{"version":3,"file":"firebase-database.js","sources":["../util/src/constants.ts","../util/src/assert.ts","../util/src/crypt.ts","../util/src/deepCopy.ts","../util/src/defaults.ts","../util/src/global.ts","../util/src/deferred.ts","../util/src/environment.ts","../util/src/json.ts","../util/src/jwt.ts","../util/src/obj.ts","../util/src/sha1.ts","../util/src/validation.ts","../util/src/utf8.ts","../util/src/compat.ts","../component/src/component.ts","../logger/src/logger.ts","../database/src/core/version.ts","../database/src/core/storage/DOMStorageWrapper.ts","../database/src/core/storage/MemoryStorage.ts","../database/src/core/storage/storage.ts","../database/src/core/util/util.ts","../database/src/core/AppCheckTokenProvider.ts","../database/src/core/AuthTokenProvider.ts","../database/src/realtime/Constants.ts","../database/src/core/RepoInfo.ts","../database/src/core/stats/StatsCollection.ts","../database/src/core/stats/StatsManager.ts","../database/src/realtime/polling/PacketReceiver.ts","../database/src/realtime/BrowserPollConnection.ts","../database/src/realtime/WebSocketConnection.ts","../database/src/realtime/TransportManager.ts","../database/src/realtime/Connection.ts","../database/src/core/ServerActions.ts","../database/src/core/util/EventEmitter.ts","../database/src/core/util/OnlineMonitor.ts","../database/src/core/util/Path.ts","../database/src/core/util/VisibilityMonitor.ts","../database/src/core/PersistentConnection.ts","../database/src/core/snap/Node.ts","../database/src/core/snap/indexes/Index.ts","../database/src/core/snap/indexes/KeyIndex.ts","../database/src/core/util/SortedMap.ts","../database/src/core/snap/comparators.ts","../database/src/core/snap/snap.ts","../database/src/core/snap/LeafNode.ts","../database/src/core/snap/indexes/PriorityIndex.ts","../database/src/core/snap/childSet.ts","../database/src/core/snap/IndexMap.ts","../database/src/core/snap/ChildrenNode.ts","../database/src/core/snap/nodeFromJSON.ts","../database/src/core/snap/indexes/PathIndex.ts","../database/src/core/snap/indexes/ValueIndex.ts","../database/src/core/view/Change.ts","../database/src/core/view/filter/IndexedFilter.ts","../database/src/core/view/filter/RangedFilter.ts","../database/src/core/view/filter/LimitedFilter.ts","../database/src/core/view/QueryParams.ts","../database/src/core/ReadonlyRestClient.ts","../util/src/query.ts","../database/src/core/SnapshotHolder.ts","../database/src/core/SparseSnapshotTree.ts","../database/src/core/stats/StatsListener.ts","../database/src/core/stats/StatsReporter.ts","../database/src/core/operation/Operation.ts","../database/src/core/operation/AckUserWrite.ts","../database/src/core/operation/ListenComplete.ts","../database/src/core/operation/Overwrite.ts","../database/src/core/operation/Merge.ts","../database/src/core/view/CacheNode.ts","../database/src/core/view/EventGenerator.ts","../database/src/core/view/ViewCache.ts","../database/src/core/util/ImmutableTree.ts","../database/src/core/CompoundWrite.ts","../database/src/core/WriteTree.ts","../database/src/core/view/ChildChangeAccumulator.ts","../database/src/core/view/CompleteChildSource.ts","../database/src/core/view/ViewProcessor.ts","../database/src/core/view/View.ts","../database/src/core/SyncPoint.ts","../database/src/core/SyncTree.ts","../database/src/core/util/ServerValues.ts","../database/src/core/util/Tree.ts","../database/src/core/util/validation.ts","../database/src/core/view/EventQueue.ts","../database/src/core/Repo.ts","../database/src/core/util/libs/parser.ts","../database/src/core/util/NextPushId.ts","../database/src/core/view/Event.ts","../database/src/core/view/EventRegistration.ts","../database/src/api/OnDisconnect.ts","../database/src/api/Reference_impl.ts","../database/src/api/Database.ts","../util/src/emulator.ts","../database/src/api/ServerValue.ts","../database/src/api/Transaction.ts","../database/src/api/test_access.ts","../database/src/register.ts","../database/src/index.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\n/**\n * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\n */\n\nexport const CONSTANTS = {\n  /**\n   * @define {boolean} Whether this is the client Node.js SDK.\n   */\n  NODE_CLIENT: false,\n  /**\n   * @define {boolean} Whether this is the Admin Node.js SDK.\n   */\n  NODE_ADMIN: false,\n\n  /**\n   * Firebase SDK Version\n   */\n  SDK_VERSION: '${JSCORE_VERSION}'\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';\n\n/**\n * Throws an error if the provided assertion is falsy\n */\nexport const assert = function (assertion: unknown, message: string): void {\n  if (!assertion) {\n    throw assertionError(message);\n  }\n};\n\n/**\n * Returns an Error object suitable for throwing.\n */\nexport const assertionError = function (message: string): Error {\n  return new Error(\n    'Firebase Database (' +\n      CONSTANTS.SDK_VERSION +\n      ') INTERNAL ASSERT FAILED: ' +\n      message\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\nconst stringToByteArray = function (str: string): number[] {\n  // TODO(user): Use native implementations if/when available\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n    if (c < 128) {\n      out[p++] = c;\n    } else if (c < 2048) {\n      out[p++] = (c >> 6) | 192;\n      out[p++] = (c & 63) | 128;\n    } else if (\n      (c & 0xfc00) === 0xd800 &&\n      i + 1 < str.length &&\n      (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00\n    ) {\n      // Surrogate Pair\n      c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\n      out[p++] = (c >> 18) | 240;\n      out[p++] = ((c >> 12) & 63) | 128;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    }\n  }\n  return out;\n};\n\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param bytes Array of numbers representing characters.\n * @return Stringification of the array.\n */\nconst byteArrayToString = function (bytes: number[]): string {\n  // TODO(user): Use native implementations if/when available\n  const out: string[] = [];\n  let pos = 0,\n    c = 0;\n  while (pos < bytes.length) {\n    const c1 = bytes[pos++];\n    if (c1 < 128) {\n      out[c++] = String.fromCharCode(c1);\n    } else if (c1 > 191 && c1 < 224) {\n      const c2 = bytes[pos++];\n      out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\n    } else if (c1 > 239 && c1 < 365) {\n      // Surrogate Pair\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      const c4 = bytes[pos++];\n      const u =\n        (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -\n        0x10000;\n      out[c++] = String.fromCharCode(0xd800 + (u >> 10));\n      out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\n    } else {\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      out[c++] = String.fromCharCode(\n        ((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)\n      );\n    }\n  }\n  return out.join('');\n};\n\ninterface Base64 {\n  byteToCharMap_: { [key: number]: string } | null;\n  charToByteMap_: { [key: string]: number } | null;\n  byteToCharMapWebSafe_: { [key: number]: string } | null;\n  charToByteMapWebSafe_: { [key: string]: number } | null;\n  ENCODED_VALS_BASE: string;\n  readonly ENCODED_VALS: string;\n  readonly ENCODED_VALS_WEBSAFE: string;\n  HAS_NATIVE_SUPPORT: boolean;\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string;\n  encodeString(input: string, webSafe?: boolean): string;\n  decodeString(input: string, webSafe: boolean): string;\n  decodeStringToByteArray(input: string, webSafe: boolean): number[];\n  init_(): void;\n}\n\n// We define it as an object literal instead of a class because a class compiled down to es5 can't\n// be treeshaked. https://github.com/rollup/rollup/issues/1691\n// Static lookup maps, lazily populated by init_()\nexport const base64: Base64 = {\n  /**\n   * Maps bytes to characters.\n   */\n  byteToCharMap_: null,\n\n  /**\n   * Maps characters to bytes.\n   */\n  charToByteMap_: null,\n\n  /**\n   * Maps bytes to websafe characters.\n   * @private\n   */\n  byteToCharMapWebSafe_: null,\n\n  /**\n   * Maps websafe characters to bytes.\n   * @private\n   */\n  charToByteMapWebSafe_: null,\n\n  /**\n   * Our default alphabet, shared between\n   * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n   */\n  ENCODED_VALS_BASE:\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n  /**\n   * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n   */\n  get ENCODED_VALS() {\n    return this.ENCODED_VALS_BASE + '+/=';\n  },\n\n  /**\n   * Our websafe alphabet.\n   */\n  get ENCODED_VALS_WEBSAFE() {\n    return this.ENCODED_VALS_BASE + '-_.';\n  },\n\n  /**\n   * Whether this browser supports the atob and btoa functions. This extension\n   * started at Mozilla but is now implemented by many browsers. We use the\n   * ASSUME_* variables to avoid pulling in the full useragent detection library\n   * but still allowing the standard per-browser compilations.\n   *\n   */\n  HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n  /**\n   * Base64-encode an array of bytes.\n   *\n   * @param input An array of bytes (numbers with\n   *     value in [0, 255]) to encode.\n   * @param webSafe Boolean indicating we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string {\n    if (!Array.isArray(input)) {\n      throw Error('encodeByteArray takes an array as a parameter');\n    }\n\n    this.init_();\n\n    const byteToCharMap = webSafe\n      ? this.byteToCharMapWebSafe_!\n      : this.byteToCharMap_!;\n\n    const output = [];\n\n    for (let i = 0; i < input.length; i += 3) {\n      const byte1 = input[i];\n      const haveByte2 = i + 1 < input.length;\n      const byte2 = haveByte2 ? input[i + 1] : 0;\n      const haveByte3 = i + 2 < input.length;\n      const byte3 = haveByte3 ? input[i + 2] : 0;\n\n      const outByte1 = byte1 >> 2;\n      const outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n      let outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n      let outByte4 = byte3 & 0x3f;\n\n      if (!haveByte3) {\n        outByte4 = 64;\n\n        if (!haveByte2) {\n          outByte3 = 64;\n        }\n      }\n\n      output.push(\n        byteToCharMap[outByte1],\n        byteToCharMap[outByte2],\n        byteToCharMap[outByte3],\n        byteToCharMap[outByte4]\n      );\n    }\n\n    return output.join('');\n  },\n\n  /**\n   * Base64-encode a string.\n   *\n   * @param input A string to encode.\n   * @param webSafe If true, we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeString(input: string, webSafe?: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return btoa(input);\n    }\n    return this.encodeByteArray(stringToByteArray(input), webSafe);\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * @param input to decode.\n   * @param webSafe True if we should use the\n   *     alternative alphabet.\n   * @return string representing the decoded value.\n   */\n  decodeString(input: string, webSafe: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return atob(input);\n    }\n    return byteArrayToString(this.decodeStringToByteArray(input, webSafe));\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * In base-64 decoding, groups of four characters are converted into three\n   * bytes.  If the encoder did not apply padding, the input length may not\n   * be a multiple of 4.\n   *\n   * In this case, the last group will have fewer than 4 characters, and\n   * padding will be inferred.  If the group has one or two characters, it decodes\n   * to one byte.  If the group has three characters, it decodes to two bytes.\n   *\n   * @param input Input to decode.\n   * @param webSafe True if we should use the web-safe alphabet.\n   * @return bytes representing the decoded value.\n   */\n  decodeStringToByteArray(input: string, webSafe: boolean): number[] {\n    this.init_();\n\n    const charToByteMap = webSafe\n      ? this.charToByteMapWebSafe_!\n      : this.charToByteMap_!;\n\n    const output: number[] = [];\n\n    for (let i = 0; i < input.length; ) {\n      const byte1 = charToByteMap[input.charAt(i++)];\n\n      const haveByte2 = i < input.length;\n      const byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n      ++i;\n\n      const haveByte3 = i < input.length;\n      const byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      const haveByte4 = i < input.length;\n      const byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n        throw new DecodeBase64StringError();\n      }\n\n      const outByte1 = (byte1 << 2) | (byte2 >> 4);\n      output.push(outByte1);\n\n      if (byte3 !== 64) {\n        const outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n        output.push(outByte2);\n\n        if (byte4 !== 64) {\n          const outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n\n    return output;\n  },\n\n  /**\n   * Lazy static initialization function. Called before\n   * accessing any of the static map variables.\n   * @private\n   */\n  init_() {\n    if (!this.byteToCharMap_) {\n      this.byteToCharMap_ = {};\n      this.charToByteMap_ = {};\n      this.byteToCharMapWebSafe_ = {};\n      this.charToByteMapWebSafe_ = {};\n\n      // We want quick mappings back and forth, so we precompute two maps.\n      for (let i = 0; i < this.ENCODED_VALS.length; i++) {\n        this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n        this.charToByteMap_[this.byteToCharMap_[i]] = i;\n        this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n        this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n\n        // Be forgiving when decoding and correctly decode both encodings.\n        if (i >= this.ENCODED_VALS_BASE.length) {\n          this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n          this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n        }\n      }\n    }\n  }\n};\n\n/**\n * An error encountered while decoding base64 string.\n */\nexport class DecodeBase64StringError extends Error {\n  readonly name = 'DecodeBase64StringError';\n}\n\n/**\n * URL-safe base64 encoding\n */\nexport const base64Encode = function (str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  return base64.encodeByteArray(utf8Bytes, true);\n};\n\n/**\n * URL-safe base64 encoding (without \".\" padding in the end).\n * e.g. Used in JSON Web Token (JWT) parts.\n */\nexport const base64urlEncodeWithoutPadding = function (str: string): string {\n  // Use base64url encoding and remove padding in the end (dot characters).\n  return base64Encode(str).replace(/\\./g, '');\n};\n\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param str To be decoded\n * @return Decoded result, if possible\n */\nexport const base64Decode = function (str: string): string | null {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n","/**\n * @license\n * Copyright 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 * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nexport function deepCopy<T>(value: T): T {\n  return deepExtend(undefined, value) as T;\n}\n\n/**\n * Copy properties from source to target (recursively allows extension\n * of Objects and Arrays).  Scalar values in the target are over-written.\n * If target is undefined, an object of the appropriate type will be created\n * (and returned).\n *\n * We recursively copy all child properties of plain Objects in the source- so\n * that namespace- like dictionaries are merged.\n *\n * Note that the target can be a function, in which case the properties in\n * the source Object are copied onto it as static properties of the Function.\n *\n * Note: we don't merge __proto__ to prevent prototype pollution\n */\nexport function deepExtend(target: unknown, source: unknown): unknown {\n  if (!(source instanceof Object)) {\n    return source;\n  }\n\n  switch (source.constructor) {\n    case Date:\n      // Treat Dates like scalars; if the target date object had any child\n      // properties - they will be lost!\n      const dateValue = source as Date;\n      return new Date(dateValue.getTime());\n\n    case Object:\n      if (target === undefined) {\n        target = {};\n      }\n      break;\n    case Array:\n      // Always copy the array source and overwrite the target.\n      target = [];\n      break;\n\n    default:\n      // Not a plain Object - treat it as a scalar.\n      return source;\n  }\n\n  for (const prop in source) {\n    // use isValidKey to guard against prototype pollution. See https://snyk.io/vuln/SNYK-JS-LODASH-450202\n    if (!source.hasOwnProperty(prop) || !isValidKey(prop)) {\n      continue;\n    }\n    (target as Record<string, unknown>)[prop] = deepExtend(\n      (target as Record<string, unknown>)[prop],\n      (source as Record<string, unknown>)[prop]\n    );\n  }\n\n  return target;\n}\n\nfunction isValidKey(key: string): boolean {\n  return key !== '__proto__';\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\nexport class Deferred<R> {\n  promise: Promise<R>;\n  reject: (value?: unknown) => void = () => {};\n  resolve: (value?: unknown) => void = () => {};\n  constructor() {\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = resolve as (value?: unknown) => void;\n      this.reject = reject as (value?: unknown) => void;\n    });\n  }\n\n  /**\n   * Our API internals are not promiseified and cannot because our callback APIs have subtle expectations around\n   * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\n   * and returns a node-style callback which will resolve or reject the Deferred's promise.\n   */\n  wrapCallback(\n    callback?: (error?: unknown, value?: unknown) => void\n  ): (error: unknown, value?: unknown) => void {\n    return (error, value?) => {\n      if (error) {\n        this.reject(error);\n      } else {\n        this.resolve(value);\n      }\n      if (typeof callback === 'function') {\n        // Attaching noop handler just in case developer wasn't expecting\n        // promises\n        this.promise.catch(() => {});\n\n        // Some of our callbacks don't expect a value and our own tests\n        // assert that the parameter length is 1\n        if (callback.length === 1) {\n          callback(error);\n        } else {\n          callback(error, value);\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\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/**\n * Evaluates a JSON string into a javascript object.\n *\n * @param {string} str A string containing JSON.\n * @return {*} The javascript object representing the specified JSON.\n */\nexport function jsonEval(str: string): unknown {\n  return JSON.parse(str);\n}\n\n/**\n * Returns JSON representing a javascript object.\n * @param {*} data Javascript object to be stringified.\n * @return {string} The JSON contents of the object.\n */\nexport function stringify(data: unknown): string {\n  return JSON.stringify(data);\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 { base64Decode } from './crypt';\nimport { jsonEval } from './json';\n\ninterface Claims {\n  [key: string]: {};\n}\n\ninterface DecodedToken {\n  header: object;\n  claims: Claims;\n  data: object;\n  signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token into constituent parts.\n *\n * Notes:\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const decode = function (token: string): DecodedToken {\n  let header = {},\n    claims: Claims = {},\n    data = {},\n    signature = '';\n\n  try {\n    const parts = token.split('.');\n    header = jsonEval(base64Decode(parts[0]) || '') as object;\n    claims = jsonEval(base64Decode(parts[1]) || '') as Claims;\n    signature = parts[2];\n    data = claims['d'] || {};\n    delete claims['d'];\n  } catch (e) {}\n\n  return {\n    header,\n    claims,\n    data,\n    signature\n  };\n};\n\ninterface DecodedToken {\n  header: object;\n  claims: Claims;\n  data: object;\n  signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidTimestamp = function (token: string): boolean {\n  const claims: Claims = decode(token).claims;\n  const now: number = Math.floor(new Date().getTime() / 1000);\n  let validSince: number = 0,\n    validUntil: number = 0;\n\n  if (typeof claims === 'object') {\n    if (claims.hasOwnProperty('nbf')) {\n      validSince = claims['nbf'] as number;\n    } else if (claims.hasOwnProperty('iat')) {\n      validSince = claims['iat'] as number;\n    }\n\n    if (claims.hasOwnProperty('exp')) {\n      validUntil = claims['exp'] as number;\n    } else {\n      // token will expire after 24h by default\n      validUntil = validSince + 86400;\n    }\n  }\n\n  return (\n    !!now &&\n    !!validSince &&\n    !!validUntil &&\n    now >= validSince &&\n    now <= validUntil\n  );\n};\n\n/**\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\n *\n * Notes:\n * - May return null if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const issuedAtTime = function (token: string): number | null {\n  const claims: Claims = decode(token).claims;\n  if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n    return claims['iat'] as number;\n  }\n  return null;\n};\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidFormat = function (token: string): boolean {\n  const decoded = decode(token),\n    claims = decoded.claims;\n\n  return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\n};\n\n/**\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isAdmin = function (token: string): boolean {\n  const claims: Claims = decode(token).claims;\n  return typeof claims === 'object' && claims['admin'] === 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\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 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 * @fileoverview SHA-1 cryptographic hash.\n * Variable names follow the notation in FIPS PUB 180-3:\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\n *\n * Usage:\n *   var sha1 = new sha1();\n *   sha1.update(bytes);\n *   var hash = sha1.digest();\n *\n * Performance:\n *   Chrome 23:   ~400 Mbit/s\n *   Firefox 16:  ~250 Mbit/s\n *\n */\n\n/**\n * SHA-1 cryptographic hash constructor.\n *\n * The properties declared here are discussed in the above algorithm document.\n * @constructor\n * @final\n * @struct\n */\nexport class Sha1 {\n  /**\n   * Holds the previous values of accumulated variables a-e in the compress_\n   * function.\n   * @private\n   */\n  private chain_: number[] = [];\n\n  /**\n   * A buffer holding the partially computed hash result.\n   * @private\n   */\n  private buf_: number[] = [];\n\n  /**\n   * An array of 80 bytes, each a part of the message to be hashed.  Referred to\n   * as the message schedule in the docs.\n   * @private\n   */\n  private W_: number[] = [];\n\n  /**\n   * Contains data needed to pad messages less than 64 bytes.\n   * @private\n   */\n  private pad_: number[] = [];\n\n  /**\n   * @private {number}\n   */\n  private inbuf_: number = 0;\n\n  /**\n   * @private {number}\n   */\n  private total_: number = 0;\n\n  blockSize: number;\n\n  constructor() {\n    this.blockSize = 512 / 8;\n\n    this.pad_[0] = 128;\n    for (let i = 1; i < this.blockSize; ++i) {\n      this.pad_[i] = 0;\n    }\n\n    this.reset();\n  }\n\n  reset(): void {\n    this.chain_[0] = 0x67452301;\n    this.chain_[1] = 0xefcdab89;\n    this.chain_[2] = 0x98badcfe;\n    this.chain_[3] = 0x10325476;\n    this.chain_[4] = 0xc3d2e1f0;\n\n    this.inbuf_ = 0;\n    this.total_ = 0;\n  }\n\n  /**\n   * Internal compress helper function.\n   * @param buf Block to compress.\n   * @param offset Offset of the block in the buffer.\n   * @private\n   */\n  compress_(buf: number[] | Uint8Array | string, offset?: number): void {\n    if (!offset) {\n      offset = 0;\n    }\n\n    const W = this.W_;\n\n    // get 16 big endian words\n    if (typeof buf === 'string') {\n      for (let i = 0; i < 16; i++) {\n        // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n        // have a bug that turns the post-increment ++ operator into pre-increment\n        // during JIT compilation.  We have code that depends heavily on SHA-1 for\n        // correctness and which is affected by this bug, so I've removed all uses\n        // of post-increment ++ in which the result value is used.  We can revert\n        // this change once the Safari bug\n        // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n        // most clients have been updated.\n        W[i] =\n          (buf.charCodeAt(offset) << 24) |\n          (buf.charCodeAt(offset + 1) << 16) |\n          (buf.charCodeAt(offset + 2) << 8) |\n          buf.charCodeAt(offset + 3);\n        offset += 4;\n      }\n    } else {\n      for (let i = 0; i < 16; i++) {\n        W[i] =\n          (buf[offset] << 24) |\n          (buf[offset + 1] << 16) |\n          (buf[offset + 2] << 8) |\n          buf[offset + 3];\n        offset += 4;\n      }\n    }\n\n    // expand to 80 words\n    for (let i = 16; i < 80; i++) {\n      const t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n      W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\n    }\n\n    let a = this.chain_[0];\n    let b = this.chain_[1];\n    let c = this.chain_[2];\n    let d = this.chain_[3];\n    let e = this.chain_[4];\n    let f, k;\n\n    // TODO(user): Try to unroll this loop to speed up the computation.\n    for (let i = 0; i < 80; i++) {\n      if (i < 40) {\n        if (i < 20) {\n          f = d ^ (b & (c ^ d));\n          k = 0x5a827999;\n        } else {\n          f = b ^ c ^ d;\n          k = 0x6ed9eba1;\n        }\n      } else {\n        if (i < 60) {\n          f = (b & c) | (d & (b | c));\n          k = 0x8f1bbcdc;\n        } else {\n          f = b ^ c ^ d;\n          k = 0xca62c1d6;\n        }\n      }\n\n      const t = (((a << 5) | (a >>> 27)) + f + e + k + W[i]) & 0xffffffff;\n      e = d;\n      d = c;\n      c = ((b << 30) | (b >>> 2)) & 0xffffffff;\n      b = a;\n      a = t;\n    }\n\n    this.chain_[0] = (this.chain_[0] + a) & 0xffffffff;\n    this.chain_[1] = (this.chain_[1] + b) & 0xffffffff;\n    this.chain_[2] = (this.chain_[2] + c) & 0xffffffff;\n    this.chain_[3] = (this.chain_[3] + d) & 0xffffffff;\n    this.chain_[4] = (this.chain_[4] + e) & 0xffffffff;\n  }\n\n  update(bytes?: number[] | Uint8Array | string, length?: number): void {\n    // TODO(johnlenz): tighten the function signature and remove this check\n    if (bytes == null) {\n      return;\n    }\n\n    if (length === undefined) {\n      length = bytes.length;\n    }\n\n    const lengthMinusBlock = length - this.blockSize;\n    let n = 0;\n    // Using local instead of member variables gives ~5% speedup on Firefox 16.\n    const buf = this.buf_;\n    let inbuf = this.inbuf_;\n\n    // The outer while loop should execute at most twice.\n    while (n < length) {\n      // When we have no data in the block to top up, we can directly process the\n      // input buffer (assuming it contains sufficient data). This gives ~25%\n      // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n      // the data is provided in large chunks (or in multiples of 64 bytes).\n      if (inbuf === 0) {\n        while (n <= lengthMinusBlock) {\n          this.compress_(bytes, n);\n          n += this.blockSize;\n        }\n      }\n\n      if (typeof bytes === 'string') {\n        while (n < length) {\n          buf[inbuf] = bytes.charCodeAt(n);\n          ++inbuf;\n          ++n;\n          if (inbuf === this.blockSize) {\n            this.compress_(buf);\n            inbuf = 0;\n            // Jump to the outer loop so we use the full-block optimization.\n            break;\n          }\n        }\n      } else {\n        while (n < length) {\n          buf[inbuf] = bytes[n];\n          ++inbuf;\n          ++n;\n          if (inbuf === this.blockSize) {\n            this.compress_(buf);\n            inbuf = 0;\n            // Jump to the outer loop so we use the full-block optimization.\n            break;\n          }\n        }\n      }\n    }\n\n    this.inbuf_ = inbuf;\n    this.total_ += length;\n  }\n\n  /** @override */\n  digest(): number[] {\n    const digest: number[] = [];\n    let totalBits = this.total_ * 8;\n\n    // Add pad 0x80 0x00*.\n    if (this.inbuf_ < 56) {\n      this.update(this.pad_, 56 - this.inbuf_);\n    } else {\n      this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n    }\n\n    // Add # bits.\n    for (let i = this.blockSize - 1; i >= 56; i--) {\n      this.buf_[i] = totalBits & 255;\n      totalBits /= 256; // Don't use bit-shifting here!\n    }\n\n    this.compress_(this.buf_);\n\n    let n = 0;\n    for (let i = 0; i < 5; i++) {\n      for (let j = 24; j >= 0; j -= 8) {\n        digest[n] = (this.chain_[i] >> j) & 255;\n        ++n;\n      }\n    }\n    return digest;\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/**\n * Check to make sure the appropriate number of arguments are provided for a public function.\n * Throws an error if it fails.\n *\n * @param fnName The function name\n * @param minCount The minimum number of arguments to allow for the function call\n * @param maxCount The maximum number of argument to allow for the function call\n * @param argCount The actual number of arguments provided.\n */\nexport const validateArgCount = function (\n  fnName: string,\n  minCount: number,\n  maxCount: number,\n  argCount: number\n): void {\n  let argError;\n  if (argCount < minCount) {\n    argError = 'at least ' + minCount;\n  } else if (argCount > maxCount) {\n    argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n  }\n  if (argError) {\n    const error =\n      fnName +\n      ' failed: Was called with ' +\n      argCount +\n      (argCount === 1 ? ' argument.' : ' arguments.') +\n      ' Expects ' +\n      argError +\n      '.';\n    throw new Error(error);\n  }\n};\n\n/**\n * Generates a string to prefix an error message about failed argument validation\n *\n * @param fnName The function name\n * @param argName The name of the argument\n * @return The prefix to add to the error thrown for validation.\n */\nexport function errorPrefix(fnName: string, argName: string): string {\n  return `${fnName} failed: ${argName} argument `;\n}\n\n/**\n * @param fnName\n * @param argumentNumber\n * @param namespace\n * @param optional\n */\nexport function validateNamespace(\n  fnName: string,\n  namespace: string,\n  optional: boolean\n): void {\n  if (optional && !namespace) {\n    return;\n  }\n  if (typeof namespace !== 'string') {\n    //TODO: I should do more validation here. We only allow certain chars in namespaces.\n    throw new Error(\n      errorPrefix(fnName, 'namespace') + 'must be a valid firebase namespace.'\n    );\n  }\n}\n\nexport function validateCallback(\n  fnName: string,\n  argumentName: string,\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  callback: Function,\n  optional: boolean\n): void {\n  if (optional && !callback) {\n    return;\n  }\n  if (typeof callback !== 'function') {\n    throw new Error(\n      errorPrefix(fnName, argumentName) + 'must be a valid function.'\n    );\n  }\n}\n\nexport function validateContextObject(\n  fnName: string,\n  argumentName: string,\n  context: unknown,\n  optional: boolean\n): void {\n  if (optional && !context) {\n    return;\n  }\n  if (typeof context !== 'object' || context === null) {\n    throw new Error(\n      errorPrefix(fnName, argumentName) + 'must be a valid context object.'\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\nimport { assert } from './assert';\n\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in Javascript.  All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n\n/**\n * @param {string} str\n * @return {Array}\n */\nexport const stringToByteArray = function (str: string): number[] {\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n\n    // Is this the lead surrogate in a surrogate pair?\n    if (c >= 0xd800 && c <= 0xdbff) {\n      const high = c - 0xd800; // the high 10 bits.\n      i++;\n      assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n      const low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n      c = 0x10000 + (high << 10) + low;\n    }\n\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 (c < 65536) {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\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    }\n  }\n  return out;\n};\n\n/**\n * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nexport const stringLength = function (str: string): number {\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    const c = str.charCodeAt(i);\n    if (c < 128) {\n      p++;\n    } else if (c < 2048) {\n      p += 2;\n    } else if (c >= 0xd800 && c <= 0xdbff) {\n      // Lead surrogate of a surrogate pair.  The pair together will take 4 bytes to represent.\n      p += 4;\n      i++; // skip trail surrogate.\n    } else {\n      p += 3;\n    }\n  }\n  return p;\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 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 semver (www.semver.org) version of the SDK. */\nexport let SDK_VERSION = '';\n\n/**\n * SDK_VERSION should be set before any database instance is created\n * @internal\n */\nexport function setSDKVersion(version: string): void {\n  SDK_VERSION = version;\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 { jsonEval, stringify } from '@firebase/util';\n\n/**\n * Wraps a DOM Storage object and:\n * - automatically encode objects as JSON strings before storing them to allow us to store arbitrary types.\n * - prefixes names with \"firebase:\" to avoid collisions with app data.\n *\n * We automatically (see storage.js) create two such wrappers, one for sessionStorage,\n * and one for localStorage.\n *\n */\nexport class DOMStorageWrapper {\n  // Use a prefix to avoid collisions with other stuff saved by the app.\n  private prefix_ = 'firebase:';\n\n  /**\n   * @param domStorage_ - The underlying storage object (e.g. localStorage or sessionStorage)\n   */\n  constructor(private domStorage_: Storage) {}\n\n  /**\n   * @param key - The key to save the value under\n   * @param value - The value being stored, or null to remove the key.\n   */\n  set(key: string, value: unknown | null) {\n    if (value == null) {\n      this.domStorage_.removeItem(this.prefixedName_(key));\n    } else {\n      this.domStorage_.setItem(this.prefixedName_(key), stringify(value));\n    }\n  }\n\n  /**\n   * @returns The value that was stored under this key, or null\n   */\n  get(key: string): unknown {\n    const storedVal = this.domStorage_.getItem(this.prefixedName_(key));\n    if (storedVal == null) {\n      return null;\n    } else {\n      return jsonEval(storedVal);\n    }\n  }\n\n  remove(key: string) {\n    this.domStorage_.removeItem(this.prefixedName_(key));\n  }\n\n  isInMemoryStorage: boolean;\n\n  prefixedName_(name: string): string {\n    return this.prefix_ + name;\n  }\n\n  toString(): string {\n    return this.domStorage_.toString();\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\nimport { contains } from '@firebase/util';\n\n/**\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\n * (TODO: create interface for both to implement).\n */\nexport class MemoryStorage {\n  private cache_: { [k: string]: unknown } = {};\n\n  set(key: string, value: unknown | null) {\n    if (value == null) {\n      delete this.cache_[key];\n    } else {\n      this.cache_[key] = value;\n    }\n  }\n\n  get(key: string): unknown {\n    if (contains(this.cache_, key)) {\n      return this.cache_[key];\n    }\n    return null;\n  }\n\n  remove(key: string) {\n    delete this.cache_[key];\n  }\n\n  isInMemoryStorage = 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\nimport { DOMStorageWrapper } from './DOMStorageWrapper';\nimport { MemoryStorage } from './MemoryStorage';\n\ndeclare const window: Window;\n\n/**\n * Helper to create a DOMStorageWrapper or else fall back to MemoryStorage.\n * TODO: Once MemoryStorage and DOMStorageWrapper have a shared interface this method annotation should change\n * to reflect this type\n *\n * @param domStorageName - Name of the underlying storage object\n *   (e.g. 'localStorage' or 'sessionStorage').\n * @returns Turning off type information until a common interface is defined.\n */\nconst createStoragefor = function (\n  domStorageName: string\n): DOMStorageWrapper | MemoryStorage {\n  try {\n    // NOTE: just accessing \"localStorage\" or \"window['localStorage']\" may throw a security exception,\n    // so it must be inside the try/catch.\n    if (\n      typeof window !== 'undefined' &&\n      typeof window[domStorageName] !== 'undefined'\n    ) {\n      // Need to test cache. Just because it's here doesn't mean it works\n      const domStorage = window[domStorageName];\n      domStorage.setItem('firebase:sentinel', 'cache');\n      domStorage.removeItem('firebase:sentinel');\n      return new DOMStorageWrapper(domStorage);\n    }\n  } catch (e) {}\n\n  // Failed to create wrapper.  Just return in-memory storage.\n  // TODO: log?\n  return new MemoryStorage();\n};\n\n/** A storage object that lasts across sessions */\nexport const PersistentStorage = createStoragefor('localStorage');\n\n/** A storage object that only lasts one session */\nexport const SessionStorage = createStoragefor('sessionStorage');\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 { Logger, LogLevel } from '@firebase/logger';\nimport {\n  assert,\n  base64,\n  Sha1,\n  stringToByteArray,\n  stringify,\n  isNodeSdk\n} from '@firebase/util';\n\nimport { SessionStorage } from '../storage/storage';\nimport { QueryContext } from '../view/EventRegistration';\n\ndeclare const window: Window;\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndeclare const Windows: any;\n\nconst logClient = new Logger('@firebase/database');\n\n/**\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\n */\nexport const LUIDGenerator: () => number = (function () {\n  let id = 1;\n  return function () {\n    return id++;\n  };\n})();\n\n/**\n * Sha1 hash of the input string\n * @param str - The string to hash\n * @returns {!string} The resulting hash\n */\nexport const sha1 = function (str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  const sha1 = new Sha1();\n  sha1.update(utf8Bytes);\n  const sha1Bytes = sha1.digest();\n  return base64.encodeByteArray(sha1Bytes);\n};\n\nconst buildLogMessage_ = function (...varArgs: unknown[]): string {\n  let message = '';\n  for (let i = 0; i < varArgs.length; i++) {\n    const arg = varArgs[i];\n    if (\n      Array.isArray(arg) ||\n      (arg &&\n        typeof arg === 'object' &&\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        typeof (arg as any).length === 'number')\n    ) {\n      message += buildLogMessage_.apply(null, arg);\n    } else if (typeof arg === 'object') {\n      message += stringify(arg);\n    } else {\n      message += arg;\n    }\n    message += ' ';\n  }\n\n  return message;\n};\n\n/**\n * Use this for all debug messages in Firebase.\n */\nexport let logger: ((a: string) => void) | null = null;\n\n/**\n * Flag to check for log availability on first log message\n */\nlet firstLog_ = true;\n\n/**\n * The implementation of Firebase.enableLogging (defined here to break dependencies)\n * @param logger_ - A flag to turn on logging, or a custom logger\n * @param persistent - Whether or not to persist logging settings across refreshes\n */\nexport const enableLogging = function (\n  logger_?: boolean | ((a: string) => void) | null,\n  persistent?: boolean\n) {\n  assert(\n    !persistent || logger_ === true || logger_ === false,\n    \"Can't turn on custom loggers persistently.\"\n  );\n  if (logger_ === true) {\n    logClient.logLevel = LogLevel.VERBOSE;\n    logger = logClient.log.bind(logClient);\n    if (persistent) {\n      SessionStorage.set('logging_enabled', true);\n    }\n  } else if (typeof logger_ === 'function') {\n    logger = logger_;\n  } else {\n    logger = null;\n    SessionStorage.remove('logging_enabled');\n  }\n};\n\nexport const log = function (...varArgs: unknown[]) {\n  if (firstLog_ === true) {\n    firstLog_ = false;\n    if (logger === null && SessionStorage.get('logging_enabled') === true) {\n      enableLogging(true);\n    }\n  }\n\n  if (logger) {\n    const message = buildLogMessage_.apply(null, varArgs);\n    logger(message);\n  }\n};\n\nexport const logWrapper = function (\n  prefix: string\n): (...varArgs: unknown[]) => void {\n  return function (...varArgs: unknown[]) {\n    log(prefix, ...varArgs);\n  };\n};\n\nexport const error = function (...varArgs: string[]) {\n  const message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_(...varArgs);\n  logClient.error(message);\n};\n\nexport const fatal = function (...varArgs: string[]) {\n  const message = `FIREBASE FATAL ERROR: ${buildLogMessage_(...varArgs)}`;\n  logClient.error(message);\n  throw new Error(message);\n};\n\nexport const warn = function (...varArgs: unknown[]) {\n  const message = 'FIREBASE WARNING: ' + buildLogMessage_(...varArgs);\n  logClient.warn(message);\n};\n\n/**\n * Logs a warning if the containing page uses https. Called when a call to new Firebase\n * does not use https.\n */\nexport const warnIfPageIsSecure = function () {\n  // Be very careful accessing browser globals. Who knows what may or may not exist.\n  if (\n    typeof window !== 'undefined' &&\n    window.location &&\n    window.location.protocol &&\n    window.location.protocol.indexOf('https:') !== -1\n  ) {\n    warn(\n      'Insecure Firebase access from a secure page. ' +\n        'Please use https in calls to new Firebase().'\n    );\n  }\n};\n\nexport const warnAboutUnsupportedMethod = function (methodName: string) {\n  warn(\n    methodName +\n      ' is unsupported and will likely change soon.  ' +\n      'Please do not use.'\n  );\n};\n\n/**\n * Returns true if data is NaN, or +/- Infinity.\n */\nexport const isInvalidJSONNumber = function (data: unknown): boolean {\n  return (\n    typeof data === 'number' &&\n    (data !== data || // NaN\n      data === Number.POSITIVE_INFINITY ||\n      data === Number.NEGATIVE_INFINITY)\n  );\n};\n\nexport const executeWhenDOMReady = function (fn: () => void) {\n  if (isNodeSdk() || document.readyState === 'complete') {\n    fn();\n  } else {\n    // Modeled after jQuery. Try DOMContentLoaded and onreadystatechange (which\n    // fire before onload), but fall back to onload.\n\n    let called = false;\n    const wrappedFn = function () {\n      if (!document.body) {\n        setTimeout(wrappedFn, Math.floor(10));\n        return;\n      }\n\n      if (!called) {\n        called = true;\n        fn();\n      }\n    };\n\n    if (document.addEventListener) {\n      document.addEventListener('DOMContentLoaded', wrappedFn, false);\n      // fallback to onload.\n      window.addEventListener('load', wrappedFn, false);\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } else if ((document as any).attachEvent) {\n      // IE.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (document as any).attachEvent('onreadystatechange', () => {\n        if (document.readyState === 'complete') {\n          wrappedFn();\n        }\n      });\n      // fallback to onload.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (window as any).attachEvent('onload', wrappedFn);\n\n      // jQuery has an extra hack for IE that we could employ (based on\n      // http://javascript.nwbox.com/IEContentLoaded/) But it looks really old.\n      // I'm hoping we don't need it.\n    }\n  }\n};\n\n/**\n * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\n */\nexport const MIN_NAME = '[MIN_NAME]';\n\n/**\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\n */\nexport const MAX_NAME = '[MAX_NAME]';\n\n/**\n * Compares valid Firebase key names, plus min and max name\n */\nexport const nameCompare = function (a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  } else if (a === MIN_NAME || b === MAX_NAME) {\n    return -1;\n  } else if (b === MIN_NAME || a === MAX_NAME) {\n    return 1;\n  } else {\n    const aAsInt = tryParseInt(a),\n      bAsInt = tryParseInt(b);\n\n    if (aAsInt !== null) {\n      if (bAsInt !== null) {\n        return aAsInt - bAsInt === 0 ? a.length - b.length : aAsInt - bAsInt;\n      } else {\n        return -1;\n      }\n    } else if (bAsInt !== null) {\n      return 1;\n    } else {\n      return a < b ? -1 : 1;\n    }\n  }\n};\n\n/**\n * @returns {!number} comparison result.\n */\nexport const stringCompare = function (a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  } else if (a < b) {\n    return -1;\n  } else {\n    return 1;\n  }\n};\n\nexport const requireKey = function (\n  key: string,\n  obj: { [k: string]: unknown }\n): unknown {\n  if (obj && key in obj) {\n    return obj[key];\n  } else {\n    throw new Error(\n      'Missing required key (' + key + ') in object: ' + stringify(obj)\n    );\n  }\n};\n\nexport const ObjectToUniqueKey = function (obj: unknown): string {\n  if (typeof obj !== 'object' || obj === null) {\n    return stringify(obj);\n  }\n\n  const keys = [];\n  // eslint-disable-next-line guard-for-in\n  for (const k in obj) {\n    keys.push(k);\n  }\n\n  // Export as json, but with the keys sorted.\n  keys.sort();\n  let key = '{';\n  for (let i = 0; i < keys.length; i++) {\n    if (i !== 0) {\n      key += ',';\n    }\n    key += stringify(keys[i]);\n    key += ':';\n    key += ObjectToUniqueKey(obj[keys[i]]);\n  }\n\n  key += '}';\n  return key;\n};\n\n/**\n * Splits a string into a number of smaller segments of maximum size\n * @param str - The string\n * @param segsize - The maximum number of chars in the string.\n * @returns The string, split into appropriately-sized chunks\n */\nexport const splitStringBySize = function (\n  str: string,\n  segsize: number\n): string[] {\n  const len = str.length;\n\n  if (len <= segsize) {\n    return [str];\n  }\n\n  const dataSegs = [];\n  for (let c = 0; c < len; c += segsize) {\n    if (c + segsize > len) {\n      dataSegs.push(str.substring(c, len));\n    } else {\n      dataSegs.push(str.substring(c, c + segsize));\n    }\n  }\n  return dataSegs;\n};\n\n/**\n * Apply a function to each (key, value) pair in an object or\n * apply a function to each (index, value) pair in an array\n * @param obj - The object or array to iterate over\n * @param fn - The function to apply\n */\nexport function each(obj: object, fn: (k: string, v: unknown) => void) {\n  for (const key in obj) {\n    if (obj.hasOwnProperty(key)) {\n      fn(key, obj[key]);\n    }\n  }\n}\n\n/**\n * Like goog.bind, but doesn't bother to create a closure if opt_context is null/undefined.\n * @param callback - Callback function.\n * @param context - Optional context to bind to.\n *\n */\nexport const bindCallback = function (\n  callback: (a: unknown) => void,\n  context?: object | null\n): (a: unknown) => void {\n  return context ? callback.bind(context) : callback;\n};\n\n/**\n * Borrowed from http://hg.secondlife.com/llsd/src/tip/js/typedarray.js (MIT License)\n * I made one modification at the end and removed the NaN / Infinity\n * handling (since it seemed broken [caused an overflow] and we don't need it).  See MJL comments.\n * @param v - A double\n *\n */\nexport const doubleToIEEE754String = function (v: number): string {\n  assert(!isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\n\n  const ebits = 11,\n    fbits = 52;\n  const bias = (1 << (ebits - 1)) - 1;\n  let s, e, f, ln, i;\n\n  // Compute sign, exponent, fraction\n  // Skip NaN / Infinity handling --MJL.\n  if (v === 0) {\n    e = 0;\n    f = 0;\n    s = 1 / v === -Infinity ? 1 : 0;\n  } else {\n    s = v < 0;\n    v = Math.abs(v);\n\n    if (v >= Math.pow(2, 1 - bias)) {\n      // Normalized\n      ln = Math.min(Math.floor(Math.log(v) / Math.LN2), bias);\n      e = ln + bias;\n      f = Math.round(v * Math.pow(2, fbits - ln) - Math.pow(2, fbits));\n    } else {\n      // Denormalized\n      e = 0;\n      f = Math.round(v / Math.pow(2, 1 - bias - fbits));\n    }\n  }\n\n  // Pack sign, exponent, fraction\n  const bits = [];\n  for (i = fbits; i; i -= 1) {\n    bits.push(f % 2 ? 1 : 0);\n    f = Math.floor(f / 2);\n  }\n  for (i = ebits; i; i -= 1) {\n    bits.push(e % 2 ? 1 : 0);\n    e = Math.floor(e / 2);\n  }\n  bits.push(s ? 1 : 0);\n  bits.reverse();\n  const str = bits.join('');\n\n  // Return the data as a hex string. --MJL\n  let hexByteString = '';\n  for (i = 0; i < 64; i += 8) {\n    let hexByte = parseInt(str.substr(i, 8), 2).toString(16);\n    if (hexByte.length === 1) {\n      hexByte = '0' + hexByte;\n    }\n    hexByteString = hexByteString + hexByte;\n  }\n  return hexByteString.toLowerCase();\n};\n\n/**\n * Used to detect if we're in a Chrome content script (which executes in an\n * isolated environment where long-polling doesn't work).\n */\nexport const isChromeExtensionContentScript = function (): boolean {\n  return !!(\n    typeof window === 'object' &&\n    window['chrome'] &&\n    window['chrome']['extension'] &&\n    !/^chrome/.test(window.location.href)\n  );\n};\n\n/**\n * Used to detect if we're in a Windows 8 Store app.\n */\nexport const isWindowsStoreApp = function (): boolean {\n  // Check for the presence of a couple WinRT globals\n  return typeof Windows === 'object' && typeof Windows.UI === 'object';\n};\n\n/**\n * Converts a server error code to a Javascript Error\n */\nexport function errorForServerCode(code: string, query: QueryContext): Error {\n  let reason = 'Unknown Error';\n  if (code === 'too_big') {\n    reason =\n      'The data requested exceeds the maximum size ' +\n      'that can be accessed with a single request.';\n  } else if (code === 'permission_denied') {\n    reason = \"Client doesn't have permission to access the desired data.\";\n  } else if (code === 'unavailable') {\n    reason = 'The service is unavailable';\n  }\n\n  const error = new Error(\n    code + ' at ' + query._path.toString() + ': ' + reason\n  );\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  (error as any).code = code.toUpperCase();\n  return error;\n}\n\n/**\n * Used to test for integer-looking strings\n */\nexport const INTEGER_REGEXP_ = new RegExp('^-?(0*)\\\\d{1,10}$');\n\n/**\n * For use in keys, the minimum possible 32-bit integer.\n */\nexport const INTEGER_32_MIN = -2147483648;\n\n/**\n * For use in kyes, the maximum possible 32-bit integer.\n */\nexport const INTEGER_32_MAX = 2147483647;\n\n/**\n * If the string contains a 32-bit integer, return it.  Else return null.\n */\nexport const tryParseInt = function (str: string): number | null {\n  if (INTEGER_REGEXP_.test(str)) {\n    const intVal = Number(str);\n    if (intVal >= INTEGER_32_MIN && intVal <= INTEGER_32_MAX) {\n      return intVal;\n    }\n  }\n  return null;\n};\n\n/**\n * Helper to run some code but catch any exceptions and re-throw them later.\n * Useful for preventing user callbacks from breaking internal code.\n *\n * Re-throwing the exception from a setTimeout is a little evil, but it's very\n * convenient (we don't have to try to figure out when is a safe point to\n * re-throw it), and the behavior seems reasonable:\n *\n * * If you aren't pausing on exceptions, you get an error in the console with\n *   the correct stack trace.\n * * If you're pausing on all exceptions, the debugger will pause on your\n *   exception and then again when we rethrow it.\n * * If you're only pausing on uncaught exceptions, the debugger will only pause\n *   on us re-throwing it.\n *\n * @param fn - The code to guard.\n */\nexport const exceptionGuard = function (fn: () => void) {\n  try {\n    fn();\n  } catch (e) {\n    // Re-throw exception when it's safe.\n    setTimeout(() => {\n      // It used to be that \"throw e\" would result in a good console error with\n      // relevant context, but as of Chrome 39, you just get the firebase.js\n      // file/line number where we re-throw it, which is useless. So we log\n      // e.stack explicitly.\n      const stack = e.stack || '';\n      warn('Exception was thrown by user callback.', stack);\n      throw e;\n    }, Math.floor(0));\n  }\n};\n\n/**\n * Helper function to safely call opt_callback with the specified arguments.  It:\n * 1. Turns into a no-op if opt_callback is null or undefined.\n * 2. Wraps the call inside exceptionGuard to prevent exceptions from breaking our state.\n *\n * @param callback - Optional onComplete callback.\n * @param varArgs - Arbitrary args to be passed to opt_onComplete\n */\nexport const callUserCallback = function (\n  // eslint-disable-next-line @typescript-eslint/ban-types\n  callback?: Function | null,\n  ...varArgs: unknown[]\n) {\n  if (typeof callback === 'function') {\n    exceptionGuard(() => {\n      callback(...varArgs);\n    });\n  }\n};\n\n/**\n * @returns {boolean} true if we think we're currently being crawled.\n */\nexport const beingCrawled = function (): boolean {\n  const userAgent =\n    (typeof window === 'object' &&\n      window['navigator'] &&\n      window['navigator']['userAgent']) ||\n    '';\n\n  // For now we whitelist the most popular crawlers.  We should refine this to be the set of crawlers we\n  // believe to support JavaScript/AJAX rendering.\n  // NOTE: Google Webmaster Tools doesn't really belong, but their \"This is how a visitor to your website\n  // would have seen the page\" is flaky if we don't treat it as a crawler.\n  return (\n    userAgent.search(\n      /googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i\n    ) >= 0\n  );\n};\n\n/**\n * Export a property of an object using a getter function.\n */\nexport const exportPropGetter = function (\n  object: object,\n  name: string,\n  fnGet: () => unknown\n) {\n  Object.defineProperty(object, name, { get: fnGet });\n};\n\n/**\n * Same as setTimeout() except on Node.JS it will /not/ prevent the process from exiting.\n *\n * It is removed with clearTimeout() as normal.\n *\n * @param fn - Function to run.\n * @param time - Milliseconds to wait before running.\n * @returns The setTimeout() return value.\n */\nexport const setTimeoutNonBlocking = function (\n  fn: () => void,\n  time: number\n): number | object {\n  const timeout: number | object = setTimeout(fn, time);\n  // Note: at the time of this comment, unrefTimer is under the unstable set of APIs. Run with --unstable to enable the API.\n  if (\n    typeof timeout === 'number' &&\n    // @ts-ignore Is only defined in Deno environments.\n    typeof Deno !== 'undefined' &&\n    // @ts-ignore Deno and unrefTimer are only defined in Deno environments.\n    Deno['unrefTimer']\n  ) {\n    // @ts-ignore Deno and unrefTimer are only defined in Deno environments.\n    Deno.unrefTimer(timeout);\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  } else if (typeof timeout === 'object' && (timeout as any)['unref']) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    (timeout as any)['unref']();\n  }\n\n  return timeout;\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 {\n  AppCheckInternalComponentName,\n  AppCheckTokenListener,\n  AppCheckTokenResult,\n  FirebaseAppCheckInternal\n} from '@firebase/app-check-interop-types';\nimport { Provider } from '@firebase/component';\n\nimport { warn } from './util/util';\n\n/**\n * Abstraction around AppCheck's token fetching capabilities.\n */\nexport class AppCheckTokenProvider {\n  private appCheck?: FirebaseAppCheckInternal;\n  constructor(\n    private appName_: string,\n    private appCheckProvider?: Provider<AppCheckInternalComponentName>\n  ) {\n    this.appCheck = appCheckProvider?.getImmediate({ optional: true });\n    if (!this.appCheck) {\n      appCheckProvider?.get().then(appCheck => (this.appCheck = appCheck));\n    }\n  }\n\n  getToken(forceRefresh?: boolean): Promise<AppCheckTokenResult> {\n    if (!this.appCheck) {\n      return new Promise<AppCheckTokenResult>((resolve, reject) => {\n        // Support delayed initialization of FirebaseAppCheck. This allows our\n        // customers to initialize the RTDB SDK before initializing Firebase\n        // AppCheck and ensures that all requests are authenticated if a token\n        // becomes available before the timoeout below expires.\n        setTimeout(() => {\n          if (this.appCheck) {\n            this.getToken(forceRefresh).then(resolve, reject);\n          } else {\n            resolve(null);\n          }\n        }, 0);\n      });\n    }\n    return this.appCheck.getToken(forceRefresh);\n  }\n\n  addTokenChangeListener(listener: AppCheckTokenListener) {\n    this.appCheckProvider\n      ?.get()\n      .then(appCheck => appCheck.addTokenListener(listener));\n  }\n\n  notifyForInvalidToken(): void {\n    warn(\n      `Provided AppCheck credentials for the app named \"${this.appName_}\" ` +\n        'are invalid. This usually indicates your app was not initialized correctly.'\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\nimport { FirebaseAuthTokenData } from '@firebase/app-types/private';\nimport {\n  FirebaseAuthInternal,\n  FirebaseAuthInternalName\n} from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\n\nimport { log, warn } from './util/util';\n\nexport interface AuthTokenProvider {\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData>;\n  addTokenChangeListener(listener: (token: string | null) => void): void;\n  removeTokenChangeListener(listener: (token: string | null) => void): void;\n  notifyForInvalidToken(): void;\n}\n\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nexport class FirebaseAuthTokenProvider implements AuthTokenProvider {\n  private auth_: FirebaseAuthInternal | null = null;\n\n  constructor(\n    private appName_: string,\n    private firebaseOptions_: object,\n    private authProvider_: Provider<FirebaseAuthInternalName>\n  ) {\n    this.auth_ = authProvider_.getImmediate({ optional: true });\n    if (!this.auth_) {\n      authProvider_.onInit(auth => (this.auth_ = auth));\n    }\n  }\n\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\n    if (!this.auth_) {\n      return new Promise<FirebaseAuthTokenData>((resolve, reject) => {\n        // Support delayed initialization of FirebaseAuth. This allows our\n        // customers to initialize the RTDB SDK before initializing Firebase\n        // Auth and ensures that all requests are authenticated if a token\n        // becomes available before the timoeout below expires.\n        setTimeout(() => {\n          if (this.auth_) {\n            this.getToken(forceRefresh).then(resolve, reject);\n          } else {\n            resolve(null);\n          }\n        }, 0);\n      });\n    }\n\n    return this.auth_.getToken(forceRefresh).catch(error => {\n      // TODO: Need to figure out all the cases this is raised and whether\n      // this makes sense.\n      if (error && error.code === 'auth/token-not-initialized') {\n        log('Got auth/token-not-initialized error.  Treating as null token.');\n        return null;\n      } else {\n        return Promise.reject(error);\n      }\n    });\n  }\n\n  addTokenChangeListener(listener: (token: string | null) => void): void {\n    // TODO: We might want to wrap the listener and call it with no args to\n    // avoid a leaky abstraction, but that makes removing the listener harder.\n    if (this.auth_) {\n      this.auth_.addAuthTokenListener(listener);\n    } else {\n      this.authProvider_\n        .get()\n        .then(auth => auth.addAuthTokenListener(listener));\n    }\n  }\n\n  removeTokenChangeListener(listener: (token: string | null) => void): void {\n    this.authProvider_\n      .get()\n      .then(auth => auth.removeAuthTokenListener(listener));\n  }\n\n  notifyForInvalidToken(): void {\n    let errorMessage =\n      'Provided authentication credentials for the app named \"' +\n      this.appName_ +\n      '\" are invalid. This usually indicates your app was not ' +\n      'initialized correctly. ';\n    if ('credential' in this.firebaseOptions_) {\n      errorMessage +=\n        'Make sure the \"credential\" property provided to initializeApp() ' +\n        'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n        'project.';\n    } else if ('serviceAccount' in this.firebaseOptions_) {\n      errorMessage +=\n        'Make sure the \"serviceAccount\" property provided to initializeApp() ' +\n        'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n        'project.';\n    } else {\n      errorMessage +=\n        'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' +\n        'initializeApp() match the values provided for your app at ' +\n        'https://console.firebase.google.com/.';\n    }\n    warn(errorMessage);\n  }\n}\n\n/* AuthTokenProvider that supplies a constant token. Used by Admin SDK or mockUserToken with emulators. */\nexport class EmulatorTokenProvider implements AuthTokenProvider {\n  /** A string that is treated as an admin access token by the RTDB emulator. Used by Admin SDK. */\n  static OWNER = 'owner';\n\n  constructor(private accessToken: string) {}\n\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\n    return Promise.resolve({\n      accessToken: this.accessToken\n    });\n  }\n\n  addTokenChangeListener(listener: (token: string | null) => void): void {\n    // Invoke the listener immediately to match the behavior in Firebase Auth\n    // (see packages/auth/src/auth.js#L1807)\n    listener(this.accessToken);\n  }\n\n  removeTokenChangeListener(listener: (token: string | null) => void): void {}\n\n  notifyForInvalidToken(): void {}\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 const PROTOCOL_VERSION = '5';\n\nexport const VERSION_PARAM = 'v';\n\nexport const TRANSPORT_SESSION_PARAM = 's';\n\nexport const REFERER_PARAM = 'r';\n\nexport const FORGE_REF = 'f';\n\n// Matches console.firebase.google.com, firebase-console-*.corp.google.com and\n// firebase.corp.google.com\nexport const FORGE_DOMAIN_RE =\n  /(console\\.firebase|firebase-console-\\w+\\.corp|firebase\\.corp)\\.google\\.com/;\n\nexport const LAST_SESSION_PARAM = 'ls';\n\nexport const APPLICATION_ID_PARAM = 'p';\n\nexport const APP_CHECK_TOKEN_PARAM = 'ac';\n\nexport const WEBSOCKET = 'websocket';\n\nexport const LONG_POLLING = 'long_polling';\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 { assert } from '@firebase/util';\n\nimport { LONG_POLLING, WEBSOCKET } from '../realtime/Constants';\n\nimport { PersistentStorage } from './storage/storage';\nimport { each } from './util/util';\n\n/**\n * A class that holds metadata about a Repo object\n */\nexport class RepoInfo {\n  private _host: string;\n  private _domain: string;\n  internalHost: string;\n\n  /**\n   * @param host - Hostname portion of the url for the repo\n   * @param secure - Whether or not this repo is accessed over ssl\n   * @param namespace - The namespace represented by the repo\n   * @param webSocketOnly - Whether to prefer websockets over all other transports (used by Nest).\n   * @param nodeAdmin - Whether this instance uses Admin SDK credentials\n   * @param persistenceKey - Override the default session persistence storage key\n   */\n  constructor(\n    host: string,\n    public readonly secure: boolean,\n    public readonly namespace: string,\n    public readonly webSocketOnly: boolean,\n    public readonly nodeAdmin: boolean = false,\n    public readonly persistenceKey: string = '',\n    public readonly includeNamespaceInQueryParams: boolean = false,\n    public readonly isUsingEmulator: boolean = false\n  ) {\n    this._host = host.toLowerCase();\n    this._domain = this._host.substr(this._host.indexOf('.') + 1);\n    this.internalHost =\n      (PersistentStorage.get('host:' + host) as string) || this._host;\n  }\n\n  isCacheableHost(): boolean {\n    return this.internalHost.substr(0, 2) === 's-';\n  }\n\n  isCustomHost() {\n    return (\n      this._domain !== 'firebaseio.com' &&\n      this._domain !== 'firebaseio-demo.com'\n    );\n  }\n\n  get host() {\n    return this._host;\n  }\n\n  set host(newHost: string) {\n    if (newHost !== this.internalHost) {\n      this.internalHost = newHost;\n      if (this.isCacheableHost()) {\n        PersistentStorage.set('host:' + this._host, this.internalHost);\n      }\n    }\n  }\n\n  toString(): string {\n    let str = this.toURLString();\n    if (this.persistenceKey) {\n      str += '<' + this.persistenceKey + '>';\n    }\n    return str;\n  }\n\n  toURLString(): string {\n    const protocol = this.secure ? 'https://' : 'http://';\n    const query = this.includeNamespaceInQueryParams\n      ? `?ns=${this.namespace}`\n      : '';\n    return `${protocol}${this.host}/${query}`;\n  }\n}\n\nfunction repoInfoNeedsQueryParam(repoInfo: RepoInfo): boolean {\n  return (\n    repoInfo.host !== repoInfo.internalHost ||\n    repoInfo.isCustomHost() ||\n    repoInfo.includeNamespaceInQueryParams\n  );\n}\n\n/**\n * Returns the websocket URL for this repo\n * @param repoInfo - RepoInfo object\n * @param type - of connection\n * @param params - list\n * @returns The URL for this repo\n */\nexport function repoInfoConnectionURL(\n  repoInfo: RepoInfo,\n  type: string,\n  params: { [k: string]: string }\n): string {\n  assert(typeof type === 'string', 'typeof type must == string');\n  assert(typeof params === 'object', 'typeof params must == object');\n\n  let connURL: string;\n  if (type === WEBSOCKET) {\n    connURL =\n      (repoInfo.secure ? 'wss://' : 'ws://') + repoInfo.internalHost + '/.ws?';\n  } else if (type === LONG_POLLING) {\n    connURL =\n      (repoInfo.secure ? 'https://' : 'http://') +\n      repoInfo.internalHost +\n      '/.lp?';\n  } else {\n    throw new Error('Unknown connection type: ' + type);\n  }\n  if (repoInfoNeedsQueryParam(repoInfo)) {\n    params['ns'] = repoInfo.namespace;\n  }\n\n  const pairs: string[] = [];\n\n  each(params, (key: string, value: string) => {\n    pairs.push(key + '=' + value);\n  });\n\n  return connURL + pairs.join('&');\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 { deepCopy, contains } from '@firebase/util';\n\n/**\n * Tracks a collection of stats.\n */\nexport class StatsCollection {\n  private counters_: { [k: string]: number } = {};\n\n  incrementCounter(name: string, amount: number = 1) {\n    if (!contains(this.counters_, name)) {\n      this.counters_[name] = 0;\n    }\n\n    this.counters_[name] += amount;\n  }\n\n  get() {\n    return deepCopy(this.counters_);\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\nimport { RepoInfo } from '../RepoInfo';\n\nimport { StatsCollection } from './StatsCollection';\n\nconst collections: { [k: string]: StatsCollection } = {};\nconst reporters: { [k: string]: unknown } = {};\n\nexport function statsManagerGetCollection(repoInfo: RepoInfo): StatsCollection {\n  const hashString = repoInfo.toString();\n\n  if (!collections[hashString]) {\n    collections[hashString] = new StatsCollection();\n  }\n\n  return collections[hashString];\n}\n\nexport function statsManagerGetOrCreateReporter<T>(\n  repoInfo: RepoInfo,\n  creatorFunction: () => T\n): T {\n  const hashString = repoInfo.toString();\n\n  if (!reporters[hashString]) {\n    reporters[hashString] = creatorFunction();\n  }\n\n  return reporters[hashString] as T;\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 { exceptionGuard } from '../../core/util/util';\n\n/**\n * This class ensures the packets from the server arrive in order\n * This class takes data from the server and ensures it gets passed into the callbacks in order.\n */\nexport class PacketReceiver {\n  pendingResponses: unknown[] = [];\n  currentResponseNum = 0;\n  closeAfterResponse = -1;\n  onClose: (() => void) | null = null;\n\n  /**\n   * @param onMessage_\n   */\n  constructor(private onMessage_: (a: {}) => void) {}\n\n  closeAfter(responseNum: number, callback: () => void) {\n    this.closeAfterResponse = responseNum;\n    this.onClose = callback;\n    if (this.closeAfterResponse < this.currentResponseNum) {\n      this.onClose();\n      this.onClose = null;\n    }\n  }\n\n  /**\n   * Each message from the server comes with a response number, and an array of data. The responseNumber\n   * allows us to ensure that we process them in the right order, since we can't be guaranteed that all\n   * browsers will respond in the same order as the requests we sent\n   */\n  handleResponse(requestNum: number, data: unknown[]) {\n    this.pendingResponses[requestNum] = data;\n    while (this.pendingResponses[this.currentResponseNum]) {\n      const toProcess = this.pendingResponses[\n        this.currentResponseNum\n      ] as unknown[];\n      delete this.pendingResponses[this.currentResponseNum];\n      for (let i = 0; i < toProcess.length; ++i) {\n        if (toProcess[i]) {\n          exceptionGuard(() => {\n            this.onMessage_(toProcess[i]);\n          });\n        }\n      }\n      if (this.currentResponseNum === this.closeAfterResponse) {\n        if (this.onClose) {\n          this.onClose();\n          this.onClose = null;\n        }\n        break;\n      }\n      this.currentResponseNum++;\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\nimport { base64Encode, isNodeSdk, stringify } from '@firebase/util';\n\nimport { RepoInfo, repoInfoConnectionURL } from '../core/RepoInfo';\nimport { StatsCollection } from '../core/stats/StatsCollection';\nimport { statsManagerGetCollection } from '../core/stats/StatsManager';\nimport {\n  executeWhenDOMReady,\n  isChromeExtensionContentScript,\n  isWindowsStoreApp,\n  log,\n  logWrapper,\n  LUIDGenerator,\n  splitStringBySize\n} from '../core/util/util';\n\nimport {\n  APP_CHECK_TOKEN_PARAM,\n  APPLICATION_ID_PARAM,\n  FORGE_DOMAIN_RE,\n  FORGE_REF,\n  LAST_SESSION_PARAM,\n  LONG_POLLING,\n  PROTOCOL_VERSION,\n  REFERER_PARAM,\n  TRANSPORT_SESSION_PARAM,\n  VERSION_PARAM\n} from './Constants';\nimport { PacketReceiver } from './polling/PacketReceiver';\nimport { Transport } from './Transport';\n\n// URL query parameters associated with longpolling\nexport const FIREBASE_LONGPOLL_START_PARAM = 'start';\nexport const FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\nexport const FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\nexport const FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\nexport const FIREBASE_LONGPOLL_ID_PARAM = 'id';\nexport const FIREBASE_LONGPOLL_PW_PARAM = 'pw';\nexport const FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\nexport const FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\nexport const FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\nexport const FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\nexport const FIREBASE_LONGPOLL_DATA_PARAM = 'd';\nexport const FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM = 'disconn';\nexport const FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\n\n//Data size constants.\n//TODO: Perf: the maximum length actually differs from browser to browser.\n// We should check what browser we're on and set accordingly.\nconst MAX_URL_DATA_SIZE = 1870;\nconst SEG_HEADER_SIZE = 30; //ie: &seg=8299234&ts=982389123&d=\nconst MAX_PAYLOAD_SIZE = MAX_URL_DATA_SIZE - SEG_HEADER_SIZE;\n\n/**\n * Keepalive period\n * send a fresh request at minimum every 25 seconds. Opera has a maximum request\n * length of 30 seconds that we can't exceed.\n */\nconst KEEPALIVE_REQUEST_INTERVAL = 25000;\n\n/**\n * How long to wait before aborting a long-polling connection attempt.\n */\nconst LP_CONNECT_TIMEOUT = 30000;\n\n/**\n * This class manages a single long-polling connection.\n */\nexport class BrowserPollConnection implements Transport {\n  bytesSent = 0;\n  bytesReceived = 0;\n  urlFn: (params: object) => string;\n  scriptTagHolder: FirebaseIFrameScriptHolder;\n  myDisconnFrame: HTMLIFrameElement;\n  curSegmentNum: number;\n  myPacketOrderer: PacketReceiver;\n  id: string;\n  password: string;\n  private log_: (...a: unknown[]) => void;\n  private stats_: StatsCollection;\n  private everConnected_ = false;\n  private isClosed_: boolean;\n  private connectTimeoutTimer_: number | null;\n  private onDisconnect_: ((a?: boolean) => void) | null;\n\n  /**\n   * @param connId An identifier for this connection, used for logging\n   * @param repoInfo The info for the endpoint to send data to.\n   * @param applicationId The Firebase App ID for this project.\n   * @param appCheckToken The AppCheck token for this client.\n   * @param authToken The AuthToken to use for this connection.\n   * @param transportSessionId Optional transportSessionid if we are\n   * reconnecting for an existing transport session\n   * @param lastSessionId Optional lastSessionId if the PersistentConnection has\n   * already created a connection previously\n   */\n  constructor(\n    public connId: string,\n    public repoInfo: RepoInfo,\n    private applicationId?: string,\n    private appCheckToken?: string,\n    private authToken?: string,\n    public transportSessionId?: string,\n    public lastSessionId?: string\n  ) {\n    this.log_ = logWrapper(connId);\n    this.stats_ = statsManagerGetCollection(repoInfo);\n    this.urlFn = (params: { [k: string]: string }) => {\n      // Always add the token if we have one.\n      if (this.appCheckToken) {\n        params[APP_CHECK_TOKEN_PARAM] = this.appCheckToken;\n      }\n      return repoInfoConnectionURL(repoInfo, LONG_POLLING, params);\n    };\n  }\n\n  /**\n   * @param onMessage - Callback when messages arrive\n   * @param onDisconnect - Callback with connection lost.\n   */\n  open(onMessage: (msg: {}) => void, onDisconnect: (a?: boolean) => void) {\n    this.curSegmentNum = 0;\n    this.onDisconnect_ = onDisconnect;\n    this.myPacketOrderer = new PacketReceiver(onMessage);\n    this.isClosed_ = false;\n\n    this.connectTimeoutTimer_ = setTimeout(() => {\n      this.log_('Timed out trying to connect.');\n      // Make sure we clear the host cache\n      this.onClosed_();\n      this.connectTimeoutTimer_ = null;\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(LP_CONNECT_TIMEOUT)) as any;\n\n    // Ensure we delay the creation of the iframe until the DOM is loaded.\n    executeWhenDOMReady(() => {\n      if (this.isClosed_) {\n        return;\n      }\n\n      //Set up a callback that gets triggered once a connection is set up.\n      this.scriptTagHolder = new FirebaseIFrameScriptHolder(\n        (...args) => {\n          const [command, arg1, arg2, arg3, arg4] = args;\n          this.incrementIncomingBytes_(args);\n          if (!this.scriptTagHolder) {\n            return; // we closed the connection.\n          }\n\n          if (this.connectTimeoutTimer_) {\n            clearTimeout(this.connectTimeoutTimer_);\n            this.connectTimeoutTimer_ = null;\n          }\n          this.everConnected_ = true;\n          if (command === FIREBASE_LONGPOLL_START_PARAM) {\n            this.id = arg1 as string;\n            this.password = arg2 as string;\n          } else if (command === FIREBASE_LONGPOLL_CLOSE_COMMAND) {\n            // Don't clear the host cache. We got a response from the server, so we know it's reachable\n            if (arg1) {\n              // We aren't expecting any more data (other than what the server's already in the process of sending us\n              // through our already open polls), so don't send any more.\n              this.scriptTagHolder.sendNewPolls = false;\n\n              // arg1 in this case is the last response number sent by the server. We should try to receive\n              // all of the responses up to this one before closing\n              this.myPacketOrderer.closeAfter(arg1 as number, () => {\n                this.onClosed_();\n              });\n            } else {\n              this.onClosed_();\n            }\n          } else {\n            throw new Error('Unrecognized command received: ' + command);\n          }\n        },\n        (...args) => {\n          const [pN, data] = args;\n          this.incrementIncomingBytes_(args);\n          this.myPacketOrderer.handleResponse(pN as number, data as unknown[]);\n        },\n        () => {\n          this.onClosed_();\n        },\n        this.urlFn\n      );\n\n      //Send the initial request to connect. The serial number is simply to keep the browser from pulling previous results\n      //from cache.\n      const urlParams: { [k: string]: string | number } = {};\n      urlParams[FIREBASE_LONGPOLL_START_PARAM] = 't';\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(\n        Math.random() * 100000000\n      );\n      if (this.scriptTagHolder.uniqueCallbackIdentifier) {\n        urlParams[FIREBASE_LONGPOLL_CALLBACK_ID_PARAM] =\n          this.scriptTagHolder.uniqueCallbackIdentifier;\n      }\n      urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n      if (this.transportSessionId) {\n        urlParams[TRANSPORT_SESSION_PARAM] = this.transportSessionId;\n      }\n      if (this.lastSessionId) {\n        urlParams[LAST_SESSION_PARAM] = this.lastSessionId;\n      }\n      if (this.applicationId) {\n        urlParams[APPLICATION_ID_PARAM] = this.applicationId;\n      }\n      if (this.appCheckToken) {\n        urlParams[APP_CHECK_TOKEN_PARAM] = this.appCheckToken;\n      }\n      if (\n        typeof location !== 'undefined' &&\n        location.hostname &&\n        FORGE_DOMAIN_RE.test(location.hostname)\n      ) {\n        urlParams[REFERER_PARAM] = FORGE_REF;\n      }\n      const connectURL = this.urlFn(urlParams);\n      this.log_('Connecting via long-poll to ' + connectURL);\n      this.scriptTagHolder.addTag(connectURL, () => {\n        /* do nothing */\n      });\n    });\n  }\n\n  /**\n   * Call this when a handshake has completed successfully and we want to consider the connection established\n   */\n  start() {\n    this.scriptTagHolder.startLongPoll(this.id, this.password);\n    this.addDisconnectPingFrame(this.id, this.password);\n  }\n\n  static forceAllow_: boolean;\n\n  /**\n   * Forces long polling to be considered as a potential transport\n   */\n  static forceAllow() {\n    BrowserPollConnection.forceAllow_ = true;\n  }\n\n  static forceDisallow_: boolean;\n\n  /**\n   * Forces longpolling to not be considered as a potential transport\n   */\n  static forceDisallow() {\n    BrowserPollConnection.forceDisallow_ = true;\n  }\n\n  // Static method, use string literal so it can be accessed in a generic way\n  static isAvailable() {\n    if (isNodeSdk()) {\n      return false;\n    } else if (BrowserPollConnection.forceAllow_) {\n      return true;\n    } else {\n      // NOTE: In React-Native there's normally no 'document', but if you debug a React-Native app in\n      // the Chrome debugger, 'document' is defined, but document.createElement is null (2015/06/08).\n      return (\n        !BrowserPollConnection.forceDisallow_ &&\n        typeof document !== 'undefined' &&\n        document.createElement != null &&\n        !isChromeExtensionContentScript() &&\n        !isWindowsStoreApp()\n      );\n    }\n  }\n\n  /**\n   * No-op for polling\n   */\n  markConnectionHealthy() {}\n\n  /**\n   * Stops polling and cleans up the iframe\n   */\n  private shutdown_() {\n    this.isClosed_ = true;\n\n    if (this.scriptTagHolder) {\n      this.scriptTagHolder.close();\n      this.scriptTagHolder = null;\n    }\n\n    //remove the disconnect frame, which will trigger an XHR call to the server to tell it we're leaving.\n    if (this.myDisconnFrame) {\n      document.body.removeChild(this.myDisconnFrame);\n      this.myDisconnFrame = null;\n    }\n\n    if (this.connectTimeoutTimer_) {\n      clearTimeout(this.connectTimeoutTimer_);\n      this.connectTimeoutTimer_ = null;\n    }\n  }\n\n  /**\n   * Triggered when this transport is closed\n   */\n  private onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is closing itself');\n      this.shutdown_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_(this.everConnected_);\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  /**\n   * External-facing close handler. RealTime has requested we shut down. Kill our connection and tell the server\n   * that we've left.\n   */\n  close() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is being closed.');\n      this.shutdown_();\n    }\n  }\n\n  /**\n   * Send the JSON object down to the server. It will need to be stringified, base64 encoded, and then\n   * broken into chunks (since URLs have a small maximum length).\n   * @param data - The JSON data to transmit.\n   */\n  send(data: {}) {\n    const dataStr = stringify(data);\n    this.bytesSent += dataStr.length;\n    this.stats_.incrementCounter('bytes_sent', dataStr.length);\n\n    //first, lets get the base64-encoded data\n    const base64data = base64Encode(dataStr);\n\n    //We can only fit a certain amount in each URL, so we need to split this request\n    //up into multiple pieces if it doesn't fit in one request.\n    const dataSegs = splitStringBySize(base64data, MAX_PAYLOAD_SIZE);\n\n    //Enqueue each segment for transmission. We assign each chunk a sequential ID and a total number\n    //of segments so that we can reassemble the packet on the server.\n    for (let i = 0; i < dataSegs.length; i++) {\n      this.scriptTagHolder.enqueueSegment(\n        this.curSegmentNum,\n        dataSegs.length,\n        dataSegs[i]\n      );\n      this.curSegmentNum++;\n    }\n  }\n\n  /**\n   * This is how we notify the server that we're leaving.\n   * We aren't able to send requests with DHTML on a window close event, but we can\n   * trigger XHR requests in some browsers (everything but Opera basically).\n   */\n  addDisconnectPingFrame(id: string, pw: string) {\n    if (isNodeSdk()) {\n      return;\n    }\n    this.myDisconnFrame = document.createElement('iframe');\n    const urlParams: { [k: string]: string } = {};\n    urlParams[FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM] = 't';\n    urlParams[FIREBASE_LONGPOLL_ID_PARAM] = id;\n    urlParams[FIREBASE_LONGPOLL_PW_PARAM] = pw;\n    this.myDisconnFrame.src = this.urlFn(urlParams);\n    this.myDisconnFrame.style.display = 'none';\n\n    document.body.appendChild(this.myDisconnFrame);\n  }\n\n  /**\n   * Used to track the bytes received by this client\n   */\n  private incrementIncomingBytes_(args: unknown) {\n    // TODO: This is an annoying perf hit just to track the number of incoming bytes.  Maybe it should be opt-in.\n    const bytesReceived = stringify(args).length;\n    this.bytesReceived += bytesReceived;\n    this.stats_.incrementCounter('bytes_received', bytesReceived);\n  }\n}\n\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport interface IFrameElement extends HTMLIFrameElement {\n  doc: Document;\n}\n\n/*********************************************************************************************\n * A wrapper around an iframe that is used as a long-polling script holder.\n *********************************************************************************************/\nexport class FirebaseIFrameScriptHolder {\n  //We maintain a count of all of the outstanding requests, because if we have too many active at once it can cause\n  //problems in some browsers.\n  outstandingRequests = new Set<number>();\n\n  //A queue of the pending segments waiting for transmission to the server.\n  pendingSegs: Array<{ seg: number; ts: number; d: unknown }> = [];\n\n  //A serial number. We use this for two things:\n  // 1) A way to ensure the browser doesn't cache responses to polls\n  // 2) A way to make the server aware when long-polls arrive in a different order than we started them. The\n  //    server needs to release both polls in this case or it will cause problems in Opera since Opera can only execute\n  //    JSONP code in the order it was added to the iframe.\n  currentSerial = Math.floor(Math.random() * 100000000);\n\n  // This gets set to false when we're \"closing down\" the connection (e.g. we're switching transports but there's still\n  // incoming data from the server that we're waiting for).\n  sendNewPolls = true;\n\n  uniqueCallbackIdentifier: number;\n  myIFrame: IFrameElement;\n  alive: boolean;\n  myID: string;\n  myPW: string;\n  commandCB: (command: string, ...args: unknown[]) => void;\n  onMessageCB: (...args: unknown[]) => void;\n\n  /**\n   * @param commandCB - The callback to be called when control commands are recevied from the server.\n   * @param onMessageCB - The callback to be triggered when responses arrive from the server.\n   * @param onDisconnect - The callback to be triggered when this tag holder is closed\n   * @param urlFn - A function that provides the URL of the endpoint to send data to.\n   */\n  constructor(\n    commandCB: (command: string, ...args: unknown[]) => void,\n    onMessageCB: (...args: unknown[]) => void,\n    public onDisconnect: () => void,\n    public urlFn: (a: object) => string\n  ) {\n    if (!isNodeSdk()) {\n      //Each script holder registers a couple of uniquely named callbacks with the window. These are called from the\n      //iframes where we put the long-polling script tags. We have two callbacks:\n      //   1) Command Callback - Triggered for control issues, like starting a connection.\n      //   2) Message Callback - Triggered when new data arrives.\n      this.uniqueCallbackIdentifier = LUIDGenerator();\n      window[\n        FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier\n      ] = commandCB;\n      window[FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier] =\n        onMessageCB;\n\n      //Create an iframe for us to add script tags to.\n      this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\n\n      // Set the iframe's contents.\n      let script = '';\n      // if we set a javascript url, it's IE and we need to set the document domain. The javascript url is sufficient\n      // for ie9, but ie8 needs to do it again in the document itself.\n      if (\n        this.myIFrame.src &&\n        this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:'\n      ) {\n        const currentDomain = document.domain;\n        script = '<script>document.domain=\"' + currentDomain + '\";</script>';\n      }\n      const iframeContents = '<html><body>' + script + '</body></html>';\n      try {\n        this.myIFrame.doc.open();\n        this.myIFrame.doc.write(iframeContents);\n        this.myIFrame.doc.close();\n      } catch (e) {\n        log('frame writing exception');\n        if (e.stack) {\n          log(e.stack);\n        }\n        log(e);\n      }\n    } else {\n      this.commandCB = commandCB;\n      this.onMessageCB = onMessageCB;\n    }\n  }\n\n  /**\n   * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\n   * actually use.\n   */\n  private static createIFrame_(): IFrameElement {\n    const iframe = document.createElement('iframe') as IFrameElement;\n    iframe.style.display = 'none';\n\n    // This is necessary in order to initialize the document inside the iframe\n    if (document.body) {\n      document.body.appendChild(iframe);\n      try {\n        // If document.domain has been modified in IE, this will throw an error, and we need to set the\n        // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\n        // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\n        const a = iframe.contentWindow.document;\n        if (!a) {\n          // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\n          log('No IE domain setting required');\n        }\n      } catch (e) {\n        const domain = document.domain;\n        iframe.src =\n          \"javascript:void((function(){document.open();document.domain='\" +\n          domain +\n          \"';document.close();})())\";\n      }\n    } else {\n      // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\n      // never gets hit.\n      throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\n    }\n\n    // Get the document of the iframe in a browser-specific way.\n    if (iframe.contentDocument) {\n      iframe.doc = iframe.contentDocument; // Firefox, Opera, Safari\n    } else if (iframe.contentWindow) {\n      iframe.doc = iframe.contentWindow.document; // Internet Explorer\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } else if ((iframe as any).document) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      iframe.doc = (iframe as any).document; //others?\n    }\n\n    return iframe;\n  }\n\n  /**\n   * Cancel all outstanding queries and remove the frame.\n   */\n  close() {\n    //Mark this iframe as dead, so no new requests are sent.\n    this.alive = false;\n\n    if (this.myIFrame) {\n      //We have to actually remove all of the html inside this iframe before removing it from the\n      //window, or IE will continue loading and executing the script tags we've already added, which\n      //can lead to some errors being thrown. Setting textContent seems to be the safest way to do this.\n      this.myIFrame.doc.body.textContent = '';\n      setTimeout(() => {\n        if (this.myIFrame !== null) {\n          document.body.removeChild(this.myIFrame);\n          this.myIFrame = null;\n        }\n      }, Math.floor(0));\n    }\n\n    // Protect from being called recursively.\n    const onDisconnect = this.onDisconnect;\n    if (onDisconnect) {\n      this.onDisconnect = null;\n      onDisconnect();\n    }\n  }\n\n  /**\n   * Actually start the long-polling session by adding the first script tag(s) to the iframe.\n   * @param id - The ID of this connection\n   * @param pw - The password for this connection\n   */\n  startLongPoll(id: string, pw: string) {\n    this.myID = id;\n    this.myPW = pw;\n    this.alive = true;\n\n    //send the initial request. If there are requests queued, make sure that we transmit as many as we are currently able to.\n    while (this.newRequest_()) {}\n  }\n\n  /**\n   * This is called any time someone might want a script tag to be added. It adds a script tag when there aren't\n   * too many outstanding requests and we are still alive.\n   *\n   * If there are outstanding packet segments to send, it sends one. If there aren't, it sends a long-poll anyways if\n   * needed.\n   */\n  private newRequest_() {\n    // We keep one outstanding request open all the time to receive data, but if we need to send data\n    // (pendingSegs.length > 0) then we create a new request to send the data.  The server will automatically\n    // close the old request.\n    if (\n      this.alive &&\n      this.sendNewPolls &&\n      this.outstandingRequests.size < (this.pendingSegs.length > 0 ? 2 : 1)\n    ) {\n      //construct our url\n      this.currentSerial++;\n      const urlParams: { [k: string]: string | number } = {};\n      urlParams[FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n      urlParams[FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = this.currentSerial;\n      let theURL = this.urlFn(urlParams);\n      //Now add as much data as we can.\n      let curDataString = '';\n      let i = 0;\n\n      while (this.pendingSegs.length > 0) {\n        //first, lets see if the next segment will fit.\n        const nextSeg = this.pendingSegs[0];\n        if (\n          (nextSeg.d as unknown[]).length +\n            SEG_HEADER_SIZE +\n            curDataString.length <=\n          MAX_URL_DATA_SIZE\n        ) {\n          //great, the segment will fit. Lets append it.\n          const theSeg = this.pendingSegs.shift();\n          curDataString =\n            curDataString +\n            '&' +\n            FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM +\n            i +\n            '=' +\n            theSeg.seg +\n            '&' +\n            FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET +\n            i +\n            '=' +\n            theSeg.ts +\n            '&' +\n            FIREBASE_LONGPOLL_DATA_PARAM +\n            i +\n            '=' +\n            theSeg.d;\n          i++;\n        } else {\n          break;\n        }\n      }\n\n      theURL = theURL + curDataString;\n      this.addLongPollTag_(theURL, this.currentSerial);\n\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  /**\n   * Queue a packet for transmission to the server.\n   * @param segnum - A sequential id for this packet segment used for reassembly\n   * @param totalsegs - The total number of segments in this packet\n   * @param data - The data for this segment.\n   */\n  enqueueSegment(segnum: number, totalsegs: number, data: unknown) {\n    //add this to the queue of segments to send.\n    this.pendingSegs.push({ seg: segnum, ts: totalsegs, d: data });\n\n    //send the data immediately if there isn't already data being transmitted, unless\n    //startLongPoll hasn't been called yet.\n    if (this.alive) {\n      this.newRequest_();\n    }\n  }\n\n  /**\n   * Add a script tag for a regular long-poll request.\n   * @param url - The URL of the script tag.\n   * @param serial - The serial number of the request.\n   */\n  private addLongPollTag_(url: string, serial: number) {\n    //remember that we sent this request.\n    this.outstandingRequests.add(serial);\n\n    const doNewRequest = () => {\n      this.outstandingRequests.delete(serial);\n      this.newRequest_();\n    };\n\n    // If this request doesn't return on its own accord (by the server sending us some data), we'll\n    // create a new one after the KEEPALIVE interval to make sure we always keep a fresh request open.\n    const keepaliveTimeout = setTimeout(\n      doNewRequest,\n      Math.floor(KEEPALIVE_REQUEST_INTERVAL)\n    );\n\n    const readyStateCB = () => {\n      // Request completed.  Cancel the keepalive.\n      clearTimeout(keepaliveTimeout);\n\n      // Trigger a new request so we can continue receiving data.\n      doNewRequest();\n    };\n\n    this.addTag(url, readyStateCB);\n  }\n\n  /**\n   * Add an arbitrary script tag to the iframe.\n   * @param url - The URL for the script tag source.\n   * @param loadCB - A callback to be triggered once the script has loaded.\n   */\n  addTag(url: string, loadCB: () => void) {\n    if (isNodeSdk()) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (this as any).doNodeLongPoll(url, loadCB);\n    } else {\n      setTimeout(() => {\n        try {\n          // if we're already closed, don't add this poll\n          if (!this.sendNewPolls) {\n            return;\n          }\n          const newScript = this.myIFrame.doc.createElement('script');\n          newScript.type = 'text/javascript';\n          newScript.async = true;\n          newScript.src = url;\n          // eslint-disable-next-line @typescript-eslint/no-explicit-any\n          newScript.onload = (newScript as any).onreadystatechange =\n            function () {\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              const rstate = (newScript as any).readyState;\n              if (!rstate || rstate === 'loaded' || rstate === 'complete') {\n                // eslint-disable-next-line @typescript-eslint/no-explicit-any\n                newScript.onload = (newScript as any).onreadystatechange = null;\n                if (newScript.parentNode) {\n                  newScript.parentNode.removeChild(newScript);\n                }\n                loadCB();\n              }\n            };\n          newScript.onerror = () => {\n            log('Long-poll script failed to load: ' + url);\n            this.sendNewPolls = false;\n            this.close();\n          };\n          this.myIFrame.doc.body.appendChild(newScript);\n        } catch (e) {\n          // TODO: we should make this error visible somehow\n        }\n      }, Math.floor(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\nimport { assert, isNodeSdk, jsonEval, stringify } from '@firebase/util';\n\nimport { RepoInfo, repoInfoConnectionURL } from '../core/RepoInfo';\nimport { StatsCollection } from '../core/stats/StatsCollection';\nimport { statsManagerGetCollection } from '../core/stats/StatsManager';\nimport { PersistentStorage } from '../core/storage/storage';\nimport { logWrapper, splitStringBySize } from '../core/util/util';\nimport { SDK_VERSION } from '../core/version';\n\nimport {\n  APPLICATION_ID_PARAM,\n  APP_CHECK_TOKEN_PARAM,\n  FORGE_DOMAIN_RE,\n  FORGE_REF,\n  LAST_SESSION_PARAM,\n  PROTOCOL_VERSION,\n  REFERER_PARAM,\n  TRANSPORT_SESSION_PARAM,\n  VERSION_PARAM,\n  WEBSOCKET\n} from './Constants';\nimport { Transport } from './Transport';\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndeclare const MozWebSocket: any;\n\nconst WEBSOCKET_MAX_FRAME_SIZE = 16384;\nconst WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\n\nlet WebSocketImpl = null;\nif (typeof MozWebSocket !== 'undefined') {\n  WebSocketImpl = MozWebSocket;\n} else if (typeof WebSocket !== 'undefined') {\n  WebSocketImpl = WebSocket;\n}\n\nexport function setWebSocketImpl(impl) {\n  WebSocketImpl = impl;\n}\n\n/**\n * Create a new websocket connection with the given callbacks.\n */\nexport class WebSocketConnection implements Transport {\n  keepaliveTimer: number | null = null;\n  frames: string[] | null = null;\n  totalFrames = 0;\n  bytesSent = 0;\n  bytesReceived = 0;\n  connURL: string;\n  onDisconnect: (a?: boolean) => void;\n  onMessage: (msg: {}) => void;\n  mySock: WebSocket | null;\n  private log_: (...a: unknown[]) => void;\n  private stats_: StatsCollection;\n  private everConnected_: boolean;\n  private isClosed_: boolean;\n  private nodeAdmin: boolean;\n\n  /**\n   * @param connId identifier for this transport\n   * @param repoInfo The info for the websocket endpoint.\n   * @param applicationId The Firebase App ID for this project.\n   * @param appCheckToken The App Check Token for this client.\n   * @param authToken The Auth Token for this client.\n   * @param transportSessionId Optional transportSessionId if this is connecting\n   * to an existing transport session\n   * @param lastSessionId Optional lastSessionId if there was a previous\n   * connection\n   */\n  constructor(\n    public connId: string,\n    repoInfo: RepoInfo,\n    private applicationId?: string,\n    private appCheckToken?: string,\n    private authToken?: string,\n    transportSessionId?: string,\n    lastSessionId?: string\n  ) {\n    this.log_ = logWrapper(this.connId);\n    this.stats_ = statsManagerGetCollection(repoInfo);\n    this.connURL = WebSocketConnection.connectionURL_(\n      repoInfo,\n      transportSessionId,\n      lastSessionId,\n      appCheckToken,\n      applicationId\n    );\n    this.nodeAdmin = repoInfo.nodeAdmin;\n  }\n\n  /**\n   * @param repoInfo - The info for the websocket endpoint.\n   * @param transportSessionId - Optional transportSessionId if this is connecting to an existing transport\n   *                                         session\n   * @param lastSessionId - Optional lastSessionId if there was a previous connection\n   * @returns connection url\n   */\n  private static connectionURL_(\n    repoInfo: RepoInfo,\n    transportSessionId?: string,\n    lastSessionId?: string,\n    appCheckToken?: string,\n    applicationId?: string\n  ): string {\n    const urlParams: { [k: string]: string } = {};\n    urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n\n    if (\n      !isNodeSdk() &&\n      typeof location !== 'undefined' &&\n      location.hostname &&\n      FORGE_DOMAIN_RE.test(location.hostname)\n    ) {\n      urlParams[REFERER_PARAM] = FORGE_REF;\n    }\n    if (transportSessionId) {\n      urlParams[TRANSPORT_SESSION_PARAM] = transportSessionId;\n    }\n    if (lastSessionId) {\n      urlParams[LAST_SESSION_PARAM] = lastSessionId;\n    }\n    if (appCheckToken) {\n      urlParams[APP_CHECK_TOKEN_PARAM] = appCheckToken;\n    }\n    if (applicationId) {\n      urlParams[APPLICATION_ID_PARAM] = applicationId;\n    }\n\n    return repoInfoConnectionURL(repoInfo, WEBSOCKET, urlParams);\n  }\n\n  /**\n   * @param onMessage - Callback when messages arrive\n   * @param onDisconnect - Callback with connection lost.\n   */\n  open(onMessage: (msg: {}) => void, onDisconnect: (a?: boolean) => void) {\n    this.onDisconnect = onDisconnect;\n    this.onMessage = onMessage;\n\n    this.log_('Websocket connecting to ' + this.connURL);\n\n    this.everConnected_ = false;\n    // Assume failure until proven otherwise.\n    PersistentStorage.set('previous_websocket_failure', true);\n\n    try {\n      let options: { [k: string]: object };\n      if (isNodeSdk()) {\n        const device = this.nodeAdmin ? 'AdminNode' : 'Node';\n        // UA Format: Firebase/<wire_protocol>/<sdk_version>/<platform>/<device>\n        options = {\n          headers: {\n            'User-Agent': `Firebase/${PROTOCOL_VERSION}/${SDK_VERSION}/${process.platform}/${device}`,\n            'X-Firebase-GMPID': this.applicationId || ''\n          }\n        };\n\n        // If using Node with admin creds, AppCheck-related checks are unnecessary.\n        // Note that we send the credentials here even if they aren't admin credentials, which is\n        // not a problem.\n        // Note that this header is just used to bypass appcheck, and the token should still be sent\n        // through the websocket connection once it is established.\n        if (this.authToken) {\n          options.headers['Authorization'] = `Bearer ${this.authToken}`;\n        }\n        if (this.appCheckToken) {\n          options.headers['X-Firebase-AppCheck'] = this.appCheckToken;\n        }\n\n        // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n        const env = process['env'];\n        const proxy =\n          this.connURL.indexOf('wss://') === 0\n            ? env['HTTPS_PROXY'] || env['https_proxy']\n            : env['HTTP_PROXY'] || env['http_proxy'];\n\n        if (proxy) {\n          options['proxy'] = { origin: proxy };\n        }\n      }\n      this.mySock = new WebSocketImpl(this.connURL, [], options);\n    } catch (e) {\n      this.log_('Error instantiating WebSocket.');\n      const error = e.message || e.data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n      return;\n    }\n\n    this.mySock.onopen = () => {\n      this.log_('Websocket connected.');\n      this.everConnected_ = true;\n    };\n\n    this.mySock.onclose = () => {\n      this.log_('Websocket connection was disconnected.');\n      this.mySock = null;\n      this.onClosed_();\n    };\n\n    this.mySock.onmessage = m => {\n      this.handleIncomingFrame(m as {});\n    };\n\n    this.mySock.onerror = e => {\n      this.log_('WebSocket error.  Closing connection.');\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const error = (e as any).message || (e as any).data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n    };\n  }\n\n  /**\n   * No-op for websockets, we don't need to do anything once the connection is confirmed as open\n   */\n  start() {}\n\n  static forceDisallow_: boolean;\n\n  static forceDisallow() {\n    WebSocketConnection.forceDisallow_ = true;\n  }\n\n  static isAvailable(): boolean {\n    let isOldAndroid = false;\n    if (typeof navigator !== 'undefined' && navigator.userAgent) {\n      const oldAndroidRegex = /Android ([0-9]{0,}\\.[0-9]{0,})/;\n      const oldAndroidMatch = navigator.userAgent.match(oldAndroidRegex);\n      if (oldAndroidMatch && oldAndroidMatch.length > 1) {\n        if (parseFloat(oldAndroidMatch[1]) < 4.4) {\n          isOldAndroid = true;\n        }\n      }\n    }\n\n    return (\n      !isOldAndroid &&\n      WebSocketImpl !== null &&\n      !WebSocketConnection.forceDisallow_\n    );\n  }\n\n  /**\n   * Number of response before we consider the connection \"healthy.\"\n   */\n  static responsesRequiredToBeHealthy = 2;\n\n  /**\n   * Time to wait for the connection te become healthy before giving up.\n   */\n  static healthyTimeout = 30000;\n\n  /**\n   * Returns true if we previously failed to connect with this transport.\n   */\n  static previouslyFailed(): boolean {\n    // If our persistent storage is actually only in-memory storage,\n    // we default to assuming that it previously failed to be safe.\n    return (\n      PersistentStorage.isInMemoryStorage ||\n      PersistentStorage.get('previous_websocket_failure') === true\n    );\n  }\n\n  markConnectionHealthy() {\n    PersistentStorage.remove('previous_websocket_failure');\n  }\n\n  private appendFrame_(data: string) {\n    this.frames.push(data);\n    if (this.frames.length === this.totalFrames) {\n      const fullMess = this.frames.join('');\n      this.frames = null;\n      const jsonMess = jsonEval(fullMess) as object;\n\n      //handle the message\n      this.onMessage(jsonMess);\n    }\n  }\n\n  /**\n   * @param frameCount - The number of frames we are expecting from the server\n   */\n  private handleNewFrameCount_(frameCount: number) {\n    this.totalFrames = frameCount;\n    this.frames = [];\n  }\n\n  /**\n   * Attempts to parse a frame count out of some text. If it can't, assumes a value of 1\n   * @returns Any remaining data to be process, or null if there is none\n   */\n  private extractFrameCount_(data: string): string | null {\n    assert(this.frames === null, 'We already have a frame buffer');\n    // TODO: The server is only supposed to send up to 9999 frames (i.e. length <= 4), but that isn't being enforced\n    // currently.  So allowing larger frame counts (length <= 6).  See https://app.asana.com/0/search/8688598998380/8237608042508\n    if (data.length <= 6) {\n      const frameCount = Number(data);\n      if (!isNaN(frameCount)) {\n        this.handleNewFrameCount_(frameCount);\n        return null;\n      }\n    }\n    this.handleNewFrameCount_(1);\n    return data;\n  }\n\n  /**\n   * Process a websocket frame that has arrived from the server.\n   * @param mess - The frame data\n   */\n  handleIncomingFrame(mess: { [k: string]: unknown }) {\n    if (this.mySock === null) {\n      return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\n    }\n    const data = mess['data'] as string;\n    this.bytesReceived += data.length;\n    this.stats_.incrementCounter('bytes_received', data.length);\n\n    this.resetKeepAlive();\n\n    if (this.frames !== null) {\n      // we're buffering\n      this.appendFrame_(data);\n    } else {\n      // try to parse out a frame count, otherwise, assume 1 and process it\n      const remainingData = this.extractFrameCount_(data);\n      if (remainingData !== null) {\n        this.appendFrame_(remainingData);\n      }\n    }\n  }\n\n  /**\n   * Send a message to the server\n   * @param data - The JSON object to transmit\n   */\n  send(data: {}) {\n    this.resetKeepAlive();\n\n    const dataStr = stringify(data);\n    this.bytesSent += dataStr.length;\n    this.stats_.incrementCounter('bytes_sent', dataStr.length);\n\n    //We can only fit a certain amount in each websocket frame, so we need to split this request\n    //up into multiple pieces if it doesn't fit in one request.\n\n    const dataSegs = splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\n\n    //Send the length header\n    if (dataSegs.length > 1) {\n      this.sendString_(String(dataSegs.length));\n    }\n\n    //Send the actual data in segments.\n    for (let i = 0; i < dataSegs.length; i++) {\n      this.sendString_(dataSegs[i]);\n    }\n  }\n\n  private shutdown_() {\n    this.isClosed_ = true;\n    if (this.keepaliveTimer) {\n      clearInterval(this.keepaliveTimer);\n      this.keepaliveTimer = null;\n    }\n\n    if (this.mySock) {\n      this.mySock.close();\n      this.mySock = null;\n    }\n  }\n\n  private onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('WebSocket is closing itself');\n      this.shutdown_();\n\n      // since this is an internal close, trigger the close listener\n      if (this.onDisconnect) {\n        this.onDisconnect(this.everConnected_);\n        this.onDisconnect = null;\n      }\n    }\n  }\n\n  /**\n   * External-facing close handler.\n   * Close the websocket and kill the connection.\n   */\n  close() {\n    if (!this.isClosed_) {\n      this.log_('WebSocket is being closed');\n      this.shutdown_();\n    }\n  }\n\n  /**\n   * Kill the current keepalive timer and start a new one, to ensure that it always fires N seconds after\n   * the last activity.\n   */\n  resetKeepAlive() {\n    clearInterval(this.keepaliveTimer);\n    this.keepaliveTimer = setInterval(() => {\n      //If there has been no websocket activity for a while, send a no-op\n      if (this.mySock) {\n        this.sendString_('0');\n      }\n      this.resetKeepAlive();\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(WEBSOCKET_KEEPALIVE_INTERVAL)) as any;\n  }\n\n  /**\n   * Send a string over the websocket.\n   *\n   * @param str - String to send.\n   */\n  private sendString_(str: string) {\n    // Firefox seems to sometimes throw exceptions (NS_ERROR_UNEXPECTED) from websocket .send()\n    // calls for some unknown reason.  We treat these as an error and disconnect.\n    // See https://app.asana.com/0/58926111402292/68021340250410\n    try {\n      this.mySock.send(str);\n    } catch (e) {\n      this.log_(\n        'Exception thrown from WebSocket.send():',\n        e.message || e.data,\n        'Closing connection.'\n      );\n      setTimeout(this.onClosed_.bind(this), 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\nimport { RepoInfo } from '../core/RepoInfo';\nimport { warn } from '../core/util/util';\n\nimport { BrowserPollConnection } from './BrowserPollConnection';\nimport { TransportConstructor } from './Transport';\nimport { WebSocketConnection } from './WebSocketConnection';\n\n/**\n * Currently simplistic, this class manages what transport a Connection should use at various stages of its\n * lifecycle.\n *\n * It starts with longpolling in a browser, and httppolling on node. It then upgrades to websockets if\n * they are available.\n */\nexport class TransportManager {\n  private transports_: TransportConstructor[];\n\n  // Keeps track of whether the TransportManager has already chosen a transport to use\n  static globalTransportInitialized_ = false;\n\n  static get ALL_TRANSPORTS() {\n    return [BrowserPollConnection, WebSocketConnection];\n  }\n\n  /**\n   * Returns whether transport has been selected to ensure WebSocketConnection or BrowserPollConnection are not called after\n   * TransportManager has already set up transports_\n   */\n  static get IS_TRANSPORT_INITIALIZED() {\n    return this.globalTransportInitialized_;\n  }\n\n  /**\n   * @param repoInfo - Metadata around the namespace we're connecting to\n   */\n  constructor(repoInfo: RepoInfo) {\n    this.initTransports_(repoInfo);\n  }\n\n  private initTransports_(repoInfo: RepoInfo) {\n    const isWebSocketsAvailable: boolean =\n      WebSocketConnection && WebSocketConnection['isAvailable']();\n    let isSkipPollConnection =\n      isWebSocketsAvailable && !WebSocketConnection.previouslyFailed();\n\n    if (repoInfo.webSocketOnly) {\n      if (!isWebSocketsAvailable) {\n        warn(\n          \"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\"\n        );\n      }\n\n      isSkipPollConnection = true;\n    }\n\n    if (isSkipPollConnection) {\n      this.transports_ = [WebSocketConnection];\n    } else {\n      const transports = (this.transports_ = [] as TransportConstructor[]);\n      for (const transport of TransportManager.ALL_TRANSPORTS) {\n        if (transport && transport['isAvailable']()) {\n          transports.push(transport);\n        }\n      }\n      TransportManager.globalTransportInitialized_ = true;\n    }\n  }\n\n  /**\n   * @returns The constructor for the initial transport to use\n   */\n  initialTransport(): TransportConstructor {\n    if (this.transports_.length > 0) {\n      return this.transports_[0];\n    } else {\n      throw new Error('No transports available');\n    }\n  }\n\n  /**\n   * @returns The constructor for the next transport, or null\n   */\n  upgradeTransport(): TransportConstructor | null {\n    if (this.transports_.length > 1) {\n      return this.transports_[1];\n    } else {\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 */\n\nimport { RepoInfo } from '../core/RepoInfo';\nimport { PersistentStorage } from '../core/storage/storage';\nimport { Indexable } from '../core/util/misc';\nimport {\n  error,\n  logWrapper,\n  requireKey,\n  setTimeoutNonBlocking,\n  warn\n} from '../core/util/util';\n\nimport { PROTOCOL_VERSION } from './Constants';\nimport { Transport, TransportConstructor } from './Transport';\nimport { TransportManager } from './TransportManager';\n\n// Abort upgrade attempt if it takes longer than 60s.\nconst UPGRADE_TIMEOUT = 60000;\n\n// For some transports (WebSockets), we need to \"validate\" the transport by exchanging a few requests and responses.\n// If we haven't sent enough requests within 5s, we'll start sending noop ping requests.\nconst DELAY_BEFORE_SENDING_EXTRA_REQUESTS = 5000;\n\n// If the initial data sent triggers a lot of bandwidth (i.e. it's a large put or a listen for a large amount of data)\n// then we may not be able to exchange our ping/pong requests within the healthy timeout.  So if we reach the timeout\n// but we've sent/received enough bytes, we don't cancel the connection.\nconst BYTES_SENT_HEALTHY_OVERRIDE = 10 * 1024;\nconst BYTES_RECEIVED_HEALTHY_OVERRIDE = 100 * 1024;\n\nconst enum RealtimeState {\n  CONNECTING,\n  CONNECTED,\n  DISCONNECTED\n}\n\nconst MESSAGE_TYPE = 't';\nconst MESSAGE_DATA = 'd';\nconst CONTROL_SHUTDOWN = 's';\nconst CONTROL_RESET = 'r';\nconst CONTROL_ERROR = 'e';\nconst CONTROL_PONG = 'o';\nconst SWITCH_ACK = 'a';\nconst END_TRANSMISSION = 'n';\nconst PING = 'p';\n\nconst SERVER_HELLO = 'h';\n\n/**\n * Creates a new real-time connection to the server using whichever method works\n * best in the current browser.\n */\nexport class Connection {\n  connectionCount = 0;\n  pendingDataMessages: unknown[] = [];\n  sessionId: string;\n\n  private conn_: Transport;\n  private healthyTimeout_: number;\n  private isHealthy_: boolean;\n  private log_: (...args: unknown[]) => void;\n  private primaryResponsesRequired_: number;\n  private rx_: Transport;\n  private secondaryConn_: Transport;\n  private secondaryResponsesRequired_: number;\n  private state_ = RealtimeState.CONNECTING;\n  private transportManager_: TransportManager;\n  private tx_: Transport;\n\n  /**\n   * @param id - an id for this connection\n   * @param repoInfo_ - the info for the endpoint to connect to\n   * @param applicationId_ - the Firebase App ID for this project\n   * @param appCheckToken_ - The App Check Token for this device.\n   * @param authToken_ - The auth token for this session.\n   * @param onMessage_ - the callback to be triggered when a server-push message arrives\n   * @param onReady_ - the callback to be triggered when this connection is ready to send messages.\n   * @param onDisconnect_ - the callback to be triggered when a connection was lost\n   * @param onKill_ - the callback to be triggered when this connection has permanently shut down.\n   * @param lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n   */\n  constructor(\n    public id: string,\n    private repoInfo_: RepoInfo,\n    private applicationId_: string | undefined,\n    private appCheckToken_: string | undefined,\n    private authToken_: string | undefined,\n    private onMessage_: (a: {}) => void,\n    private onReady_: (a: number, b: string) => void,\n    private onDisconnect_: () => void,\n    private onKill_: (a: string) => void,\n    public lastSessionId?: string\n  ) {\n    this.log_ = logWrapper('c:' + this.id + ':');\n    this.transportManager_ = new TransportManager(repoInfo_);\n    this.log_('Connection created');\n    this.start_();\n  }\n\n  /**\n   * Starts a connection attempt\n   */\n  private start_(): void {\n    const conn = this.transportManager_.initialTransport();\n    this.conn_ = new conn(\n      this.nextTransportId_(),\n      this.repoInfo_,\n      this.applicationId_,\n      this.appCheckToken_,\n      this.authToken_,\n      null,\n      this.lastSessionId\n    );\n\n    // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n    // can consider the transport healthy.\n    this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n\n    const onMessageReceived = this.connReceiver_(this.conn_);\n    const onConnectionLost = this.disconnReceiver_(this.conn_);\n    this.tx_ = this.conn_;\n    this.rx_ = this.conn_;\n    this.secondaryConn_ = null;\n    this.isHealthy_ = false;\n\n    /*\n     * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\n     * This can occur in the case of a redirect, i.e. we guessed wrong on what server to connect to and received a reset.\n     * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\n     * still have the context of your originating frame.\n     */\n    setTimeout(() => {\n      // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\n      this.conn_ && this.conn_.open(onMessageReceived, onConnectionLost);\n    }, Math.floor(0));\n\n    const healthyTimeoutMS = conn['healthyTimeout'] || 0;\n    if (healthyTimeoutMS > 0) {\n      this.healthyTimeout_ = setTimeoutNonBlocking(() => {\n        this.healthyTimeout_ = null;\n        if (!this.isHealthy_) {\n          if (\n            this.conn_ &&\n            this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE\n          ) {\n            this.log_(\n              'Connection exceeded healthy timeout but has received ' +\n                this.conn_.bytesReceived +\n                ' bytes.  Marking connection healthy.'\n            );\n            this.isHealthy_ = true;\n            this.conn_.markConnectionHealthy();\n          } else if (\n            this.conn_ &&\n            this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE\n          ) {\n            this.log_(\n              'Connection exceeded healthy timeout but has sent ' +\n                this.conn_.bytesSent +\n                ' bytes.  Leaving connection alive.'\n            );\n            // NOTE: We don't want to mark it healthy, since we have no guarantee that the bytes have made it to\n            // the server.\n          } else {\n            this.log_('Closing unhealthy connection after timeout.');\n            this.close();\n          }\n        }\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      }, Math.floor(healthyTimeoutMS)) as any;\n    }\n  }\n\n  private nextTransportId_(): string {\n    return 'c:' + this.id + ':' + this.connectionCount++;\n  }\n\n  private disconnReceiver_(conn) {\n    return everConnected => {\n      if (conn === this.conn_) {\n        this.onConnectionLost_(everConnected);\n      } else if (conn === this.secondaryConn_) {\n        this.log_('Secondary connection lost.');\n        this.onSecondaryConnectionLost_();\n      } else {\n        this.log_('closing an old connection');\n      }\n    };\n  }\n\n  private connReceiver_(conn: Transport) {\n    return (message: Indexable) => {\n      if (this.state_ !== RealtimeState.DISCONNECTED) {\n        if (conn === this.rx_) {\n          this.onPrimaryMessageReceived_(message);\n        } else if (conn === this.secondaryConn_) {\n          this.onSecondaryMessageReceived_(message);\n        } else {\n          this.log_('message on old connection');\n        }\n      }\n    };\n  }\n\n  /**\n   * @param dataMsg - An arbitrary data message to be sent to the server\n   */\n  sendRequest(dataMsg: object) {\n    // wrap in a data message envelope and send it on\n    const msg = { t: 'd', d: dataMsg };\n    this.sendData_(msg);\n  }\n\n  tryCleanupConnection() {\n    if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\n      this.log_(\n        'cleaning up and promoting a connection: ' + this.secondaryConn_.connId\n      );\n      this.conn_ = this.secondaryConn_;\n      this.secondaryConn_ = null;\n      // the server will shutdown the old connection\n    }\n  }\n\n  private onSecondaryControl_(controlData: { [k: string]: unknown }) {\n    if (MESSAGE_TYPE in controlData) {\n      const cmd = controlData[MESSAGE_TYPE] as string;\n      if (cmd === SWITCH_ACK) {\n        this.upgradeIfSecondaryHealthy_();\n      } else if (cmd === CONTROL_RESET) {\n        // Most likely the session wasn't valid. Abandon the switch attempt\n        this.log_('Got a reset on secondary, closing it');\n        this.secondaryConn_.close();\n        // If we were already using this connection for something, than we need to fully close\n        if (\n          this.tx_ === this.secondaryConn_ ||\n          this.rx_ === this.secondaryConn_\n        ) {\n          this.close();\n        }\n      } else if (cmd === CONTROL_PONG) {\n        this.log_('got pong on secondary.');\n        this.secondaryResponsesRequired_--;\n        this.upgradeIfSecondaryHealthy_();\n      }\n    }\n  }\n\n  private onSecondaryMessageReceived_(parsedData: Indexable) {\n    const layer: string = requireKey('t', parsedData) as string;\n    const data: unknown = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onSecondaryControl_(data as Indexable);\n    } else if (layer === 'd') {\n      // got a data message, but we're still second connection. Need to buffer it up\n      this.pendingDataMessages.push(data);\n    } else {\n      throw new Error('Unknown protocol layer: ' + layer);\n    }\n  }\n\n  private upgradeIfSecondaryHealthy_() {\n    if (this.secondaryResponsesRequired_ <= 0) {\n      this.log_('Secondary connection is healthy.');\n      this.isHealthy_ = true;\n      this.secondaryConn_.markConnectionHealthy();\n      this.proceedWithUpgrade_();\n    } else {\n      // Send a ping to make sure the connection is healthy.\n      this.log_('sending ping on secondary.');\n      this.secondaryConn_.send({ t: 'c', d: { t: PING, d: {} } });\n    }\n  }\n\n  private proceedWithUpgrade_() {\n    // tell this connection to consider itself open\n    this.secondaryConn_.start();\n    // send ack\n    this.log_('sending client ack on secondary');\n    this.secondaryConn_.send({ t: 'c', d: { t: SWITCH_ACK, d: {} } });\n\n    // send end packet on primary transport, switch to sending on this one\n    // can receive on this one, buffer responses until end received on primary transport\n    this.log_('Ending transmission on primary');\n    this.conn_.send({ t: 'c', d: { t: END_TRANSMISSION, d: {} } });\n    this.tx_ = this.secondaryConn_;\n\n    this.tryCleanupConnection();\n  }\n\n  private onPrimaryMessageReceived_(parsedData: { [k: string]: unknown }) {\n    // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n    const layer: string = requireKey('t', parsedData) as string;\n    const data: unknown = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onControl_(data as { [k: string]: unknown });\n    } else if (layer === 'd') {\n      this.onDataMessage_(data);\n    }\n  }\n\n  private onDataMessage_(message: unknown) {\n    this.onPrimaryResponse_();\n\n    // We don't do anything with data messages, just kick them up a level\n    this.onMessage_(message);\n  }\n\n  private onPrimaryResponse_() {\n    if (!this.isHealthy_) {\n      this.primaryResponsesRequired_--;\n      if (this.primaryResponsesRequired_ <= 0) {\n        this.log_('Primary connection is healthy.');\n        this.isHealthy_ = true;\n        this.conn_.markConnectionHealthy();\n      }\n    }\n  }\n\n  private onControl_(controlData: { [k: string]: unknown }) {\n    const cmd: string = requireKey(MESSAGE_TYPE, controlData) as string;\n    if (MESSAGE_DATA in controlData) {\n      const payload = controlData[MESSAGE_DATA];\n      if (cmd === SERVER_HELLO) {\n        const handshakePayload = {\n          ...(payload as {\n            ts: number;\n            v: string;\n            h: string;\n            s: string;\n          })\n        };\n        if (this.repoInfo_.isUsingEmulator) {\n          // Upon connecting, the emulator will pass the hostname that it's aware of, but we prefer the user's set hostname via `connectDatabaseEmulator` over what the emulator passes.\n          handshakePayload.h = this.repoInfo_.host;\n        }\n        this.onHandshake_(handshakePayload);\n      } else if (cmd === END_TRANSMISSION) {\n        this.log_('recvd end transmission on primary');\n        this.rx_ = this.secondaryConn_;\n        for (let i = 0; i < this.pendingDataMessages.length; ++i) {\n          this.onDataMessage_(this.pendingDataMessages[i]);\n        }\n        this.pendingDataMessages = [];\n        this.tryCleanupConnection();\n      } else if (cmd === CONTROL_SHUTDOWN) {\n        // This was previously the 'onKill' callback passed to the lower-level connection\n        // payload in this case is the reason for the shutdown. Generally a human-readable error\n        this.onConnectionShutdown_(payload as string);\n      } else if (cmd === CONTROL_RESET) {\n        // payload in this case is the host we should contact\n        this.onReset_(payload as string);\n      } else if (cmd === CONTROL_ERROR) {\n        error('Server Error: ' + payload);\n      } else if (cmd === CONTROL_PONG) {\n        this.log_('got pong on primary.');\n        this.onPrimaryResponse_();\n        this.sendPingOnPrimaryIfNecessary_();\n      } else {\n        error('Unknown control packet command: ' + cmd);\n      }\n    }\n  }\n\n  /**\n   * @param handshake - The handshake data returned from the server\n   */\n  private onHandshake_(handshake: {\n    ts: number;\n    v: string;\n    h: string;\n    s: string;\n  }): void {\n    const timestamp = handshake.ts;\n    const version = handshake.v;\n    const host = handshake.h;\n    this.sessionId = handshake.s;\n    this.repoInfo_.host = host;\n    // if we've already closed the connection, then don't bother trying to progress further\n    if (this.state_ === RealtimeState.CONNECTING) {\n      this.conn_.start();\n      this.onConnectionEstablished_(this.conn_, timestamp);\n      if (PROTOCOL_VERSION !== version) {\n        warn('Protocol version mismatch detected');\n      }\n      // TODO: do we want to upgrade? when? maybe a delay?\n      this.tryStartUpgrade_();\n    }\n  }\n\n  private tryStartUpgrade_() {\n    const conn = this.transportManager_.upgradeTransport();\n    if (conn) {\n      this.startUpgrade_(conn);\n    }\n  }\n\n  private startUpgrade_(conn: TransportConstructor) {\n    this.secondaryConn_ = new conn(\n      this.nextTransportId_(),\n      this.repoInfo_,\n      this.applicationId_,\n      this.appCheckToken_,\n      this.authToken_,\n      this.sessionId\n    );\n    // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n    // can consider the transport healthy.\n    this.secondaryResponsesRequired_ =\n      conn['responsesRequiredToBeHealthy'] || 0;\n\n    const onMessage = this.connReceiver_(this.secondaryConn_);\n    const onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n    this.secondaryConn_.open(onMessage, onDisconnect);\n\n    // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\n    setTimeoutNonBlocking(() => {\n      if (this.secondaryConn_) {\n        this.log_('Timed out trying to upgrade.');\n        this.secondaryConn_.close();\n      }\n    }, Math.floor(UPGRADE_TIMEOUT));\n  }\n\n  private onReset_(host: string) {\n    this.log_('Reset packet received.  New host: ' + host);\n    this.repoInfo_.host = host;\n    // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\n    // We don't currently support resets after the connection has already been established\n    if (this.state_ === RealtimeState.CONNECTED) {\n      this.close();\n    } else {\n      // Close whatever connections we have open and start again.\n      this.closeConnections_();\n      this.start_();\n    }\n  }\n\n  private onConnectionEstablished_(conn: Transport, timestamp: number) {\n    this.log_('Realtime connection established.');\n    this.conn_ = conn;\n    this.state_ = RealtimeState.CONNECTED;\n\n    if (this.onReady_) {\n      this.onReady_(timestamp, this.sessionId);\n      this.onReady_ = null;\n    }\n\n    // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\n    // send some pings.\n    if (this.primaryResponsesRequired_ === 0) {\n      this.log_('Primary connection is healthy.');\n      this.isHealthy_ = true;\n    } else {\n      setTimeoutNonBlocking(() => {\n        this.sendPingOnPrimaryIfNecessary_();\n      }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\n    }\n  }\n\n  private sendPingOnPrimaryIfNecessary_() {\n    // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n    if (!this.isHealthy_ && this.state_ === RealtimeState.CONNECTED) {\n      this.log_('sending ping on primary.');\n      this.sendData_({ t: 'c', d: { t: PING, d: {} } });\n    }\n  }\n\n  private onSecondaryConnectionLost_() {\n    const conn = this.secondaryConn_;\n    this.secondaryConn_ = null;\n    if (this.tx_ === conn || this.rx_ === conn) {\n      // we are relying on this connection already in some capacity. Therefore, a failure is real\n      this.close();\n    }\n  }\n\n  /**\n   * @param everConnected - Whether or not the connection ever reached a server. Used to determine if\n   * we should flush the host cache\n   */\n  private onConnectionLost_(everConnected: boolean) {\n    this.conn_ = null;\n\n    // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\n    // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.\n    if (!everConnected && this.state_ === RealtimeState.CONNECTING) {\n      this.log_('Realtime connection failed.');\n      // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\n      if (this.repoInfo_.isCacheableHost()) {\n        PersistentStorage.remove('host:' + this.repoInfo_.host);\n        // reset the internal host to what we would show the user, i.e. <ns>.firebaseio.com\n        this.repoInfo_.internalHost = this.repoInfo_.host;\n      }\n    } else if (this.state_ === RealtimeState.CONNECTED) {\n      this.log_('Realtime connection lost.');\n    }\n\n    this.close();\n  }\n\n  private onConnectionShutdown_(reason: string) {\n    this.log_('Connection shutdown command received. Shutting down...');\n\n    if (this.onKill_) {\n      this.onKill_(reason);\n      this.onKill_ = null;\n    }\n\n    // We intentionally don't want to fire onDisconnect (kill is a different case),\n    // so clear the callback.\n    this.onDisconnect_ = null;\n\n    this.close();\n  }\n\n  private sendData_(data: object) {\n    if (this.state_ !== RealtimeState.CONNECTED) {\n      throw 'Connection is not connected';\n    } else {\n      this.tx_.send(data);\n    }\n  }\n\n  /**\n   * Cleans up this connection, calling the appropriate callbacks\n   */\n  close() {\n    if (this.state_ !== RealtimeState.DISCONNECTED) {\n      this.log_('Closing realtime connection.');\n      this.state_ = RealtimeState.DISCONNECTED;\n\n      this.closeConnections_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_();\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  private closeConnections_() {\n    this.log_('Shutting down all connections');\n    if (this.conn_) {\n      this.conn_.close();\n      this.conn_ = null;\n    }\n\n    if (this.secondaryConn_) {\n      this.secondaryConn_.close();\n      this.secondaryConn_ = null;\n    }\n\n    if (this.healthyTimeout_) {\n      clearTimeout(this.healthyTimeout_);\n      this.healthyTimeout_ = 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 */\n\nimport { QueryContext } from './view/EventRegistration';\n\n/**\n * Interface defining the set of actions that can be performed against the Firebase server\n * (basically corresponds to our wire protocol).\n *\n * @interface\n */\nexport abstract class ServerActions {\n  abstract listen(\n    query: QueryContext,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ): void;\n\n  /**\n   * Remove a listen.\n   */\n  abstract unlisten(query: QueryContext, tag: number | null): void;\n\n  /**\n   * Get the server value satisfying this query.\n   */\n  abstract get(query: QueryContext): Promise<string>;\n\n  put(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void,\n    hash?: string\n  ) {}\n\n  merge(\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {}\n\n  /**\n   * Refreshes the auth token for the current connection.\n   * @param token - The authentication token\n   */\n  refreshAuthToken(token: string) {}\n\n  /**\n   * Refreshes the app check token for the current connection.\n   * @param token The app check token\n   */\n  refreshAppCheckToken(token: string) {}\n\n  onDisconnectPut(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  onDisconnectMerge(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  onDisconnectCancel(\n    pathString: string,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  reportStats(stats: { [k: string]: unknown }) {}\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 { assert } from '@firebase/util';\n\n/**\n * Base class to be used if you want to emit events. Call the constructor with\n * the set of allowed event names.\n */\nexport abstract class EventEmitter {\n  private listeners_: {\n    [eventType: string]: Array<{\n      callback(...args: unknown[]): void;\n      context: unknown;\n    }>;\n  } = {};\n\n  constructor(private allowedEvents_: string[]) {\n    assert(\n      Array.isArray(allowedEvents_) && allowedEvents_.length > 0,\n      'Requires a non-empty array'\n    );\n  }\n\n  /**\n   * To be overridden by derived classes in order to fire an initial event when\n   * somebody subscribes for data.\n   *\n   * @returns {Array.<*>} Array of parameters to trigger initial event with.\n   */\n  abstract getInitialEvent(eventType: string): unknown[];\n\n  /**\n   * To be called by derived classes to trigger events.\n   */\n  protected trigger(eventType: string, ...varArgs: unknown[]) {\n    if (Array.isArray(this.listeners_[eventType])) {\n      // Clone the list, since callbacks could add/remove listeners.\n      const listeners = [...this.listeners_[eventType]];\n\n      for (let i = 0; i < listeners.length; i++) {\n        listeners[i].callback.apply(listeners[i].context, varArgs);\n      }\n    }\n  }\n\n  on(eventType: string, callback: (a: unknown) => void, context: unknown) {\n    this.validateEventType_(eventType);\n    this.listeners_[eventType] = this.listeners_[eventType] || [];\n    this.listeners_[eventType].push({ callback, context });\n\n    const eventData = this.getInitialEvent(eventType);\n    if (eventData) {\n      callback.apply(context, eventData);\n    }\n  }\n\n  off(eventType: string, callback: (a: unknown) => void, context: unknown) {\n    this.validateEventType_(eventType);\n    const listeners = this.listeners_[eventType] || [];\n    for (let i = 0; i < listeners.length; i++) {\n      if (\n        listeners[i].callback === callback &&\n        (!context || context === listeners[i].context)\n      ) {\n        listeners.splice(i, 1);\n        return;\n      }\n    }\n  }\n\n  private validateEventType_(eventType: string) {\n    assert(\n      this.allowedEvents_.find(et => {\n        return et === eventType;\n      }),\n      'Unknown event: ' + eventType\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\nimport { assert, isMobileCordova } from '@firebase/util';\n\nimport { EventEmitter } from './EventEmitter';\n\n/**\n * Monitors online state (as reported by window.online/offline events).\n *\n * The expectation is that this could have many false positives (thinks we are online\n * when we're not), but no false negatives.  So we can safely use it to determine when\n * we definitely cannot reach the internet.\n */\nexport class OnlineMonitor extends EventEmitter {\n  private online_ = true;\n\n  static getInstance() {\n    return new OnlineMonitor();\n  }\n\n  constructor() {\n    super(['online']);\n\n    // We've had repeated complaints that Cordova apps can get stuck \"offline\", e.g.\n    // https://forum.ionicframework.com/t/firebase-connection-is-lost-and-never-come-back/43810\n    // It would seem that the 'online' event does not always fire consistently. So we disable it\n    // for Cordova.\n    if (\n      typeof window !== 'undefined' &&\n      typeof window.addEventListener !== 'undefined' &&\n      !isMobileCordova()\n    ) {\n      window.addEventListener(\n        'online',\n        () => {\n          if (!this.online_) {\n            this.online_ = true;\n            this.trigger('online', true);\n          }\n        },\n        false\n      );\n\n      window.addEventListener(\n        'offline',\n        () => {\n          if (this.online_) {\n            this.online_ = false;\n            this.trigger('online', false);\n          }\n        },\n        false\n      );\n    }\n  }\n\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'online', 'Unknown event type: ' + eventType);\n    return [this.online_];\n  }\n\n  currentlyOnline(): boolean {\n    return this.online_;\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\nimport { stringLength } from '@firebase/util';\n\nimport { nameCompare } from './util';\n\n/** Maximum key depth. */\nconst MAX_PATH_DEPTH = 32;\n\n/** Maximum number of (UTF8) bytes in a Firebase path. */\nconst MAX_PATH_LENGTH_BYTES = 768;\n\n/**\n * An immutable object representing a parsed path.  It's immutable so that you\n * can pass them around to other functions without worrying about them changing\n * it.\n */\n\nexport class Path {\n  pieces_: string[];\n  pieceNum_: number;\n\n  /**\n   * @param pathOrString - Path string to parse, or another path, or the raw\n   * tokens array\n   */\n  constructor(pathOrString: string | string[], pieceNum?: number) {\n    if (pieceNum === void 0) {\n      this.pieces_ = (pathOrString as string).split('/');\n\n      // Remove empty pieces.\n      let copyTo = 0;\n      for (let i = 0; i < this.pieces_.length; i++) {\n        if (this.pieces_[i].length > 0) {\n          this.pieces_[copyTo] = this.pieces_[i];\n          copyTo++;\n        }\n      }\n      this.pieces_.length = copyTo;\n\n      this.pieceNum_ = 0;\n    } else {\n      this.pieces_ = pathOrString as string[];\n      this.pieceNum_ = pieceNum;\n    }\n  }\n\n  toString(): string {\n    let pathString = '';\n    for (let i = this.pieceNum_; i < this.pieces_.length; i++) {\n      if (this.pieces_[i] !== '') {\n        pathString += '/' + this.pieces_[i];\n      }\n    }\n\n    return pathString || '/';\n  }\n}\n\nexport function newEmptyPath(): Path {\n  return new Path('');\n}\n\nexport function pathGetFront(path: Path): string | null {\n  if (path.pieceNum_ >= path.pieces_.length) {\n    return null;\n  }\n\n  return path.pieces_[path.pieceNum_];\n}\n\n/**\n * @returns The number of segments in this path\n */\nexport function pathGetLength(path: Path): number {\n  return path.pieces_.length - path.pieceNum_;\n}\n\nexport function pathPopFront(path: Path): Path {\n  let pieceNum = path.pieceNum_;\n  if (pieceNum < path.pieces_.length) {\n    pieceNum++;\n  }\n  return new Path(path.pieces_, pieceNum);\n}\n\nexport function pathGetBack(path: Path): string | null {\n  if (path.pieceNum_ < path.pieces_.length) {\n    return path.pieces_[path.pieces_.length - 1];\n  }\n\n  return null;\n}\n\nexport function pathToUrlEncodedString(path: Path): string {\n  let pathString = '';\n  for (let i = path.pieceNum_; i < path.pieces_.length; i++) {\n    if (path.pieces_[i] !== '') {\n      pathString += '/' + encodeURIComponent(String(path.pieces_[i]));\n    }\n  }\n\n  return pathString || '/';\n}\n\n/**\n * Shallow copy of the parts of the path.\n *\n */\nexport function pathSlice(path: Path, begin: number = 0): string[] {\n  return path.pieces_.slice(path.pieceNum_ + begin);\n}\n\nexport function pathParent(path: Path): Path | null {\n  if (path.pieceNum_ >= path.pieces_.length) {\n    return null;\n  }\n\n  const pieces = [];\n  for (let i = path.pieceNum_; i < path.pieces_.length - 1; i++) {\n    pieces.push(path.pieces_[i]);\n  }\n\n  return new Path(pieces, 0);\n}\n\nexport function pathChild(path: Path, childPathObj: string | Path): Path {\n  const pieces = [];\n  for (let i = path.pieceNum_; i < path.pieces_.length; i++) {\n    pieces.push(path.pieces_[i]);\n  }\n\n  if (childPathObj instanceof Path) {\n    for (let i = childPathObj.pieceNum_; i < childPathObj.pieces_.length; i++) {\n      pieces.push(childPathObj.pieces_[i]);\n    }\n  } else {\n    const childPieces = childPathObj.split('/');\n    for (let i = 0; i < childPieces.length; i++) {\n      if (childPieces[i].length > 0) {\n        pieces.push(childPieces[i]);\n      }\n    }\n  }\n\n  return new Path(pieces, 0);\n}\n\n/**\n * @returns True if there are no segments in this path\n */\nexport function pathIsEmpty(path: Path): boolean {\n  return path.pieceNum_ >= path.pieces_.length;\n}\n\n/**\n * @returns The path from outerPath to innerPath\n */\nexport function newRelativePath(outerPath: Path, innerPath: Path): Path {\n  const outer = pathGetFront(outerPath),\n    inner = pathGetFront(innerPath);\n  if (outer === null) {\n    return innerPath;\n  } else if (outer === inner) {\n    return newRelativePath(pathPopFront(outerPath), pathPopFront(innerPath));\n  } else {\n    throw new Error(\n      'INTERNAL ERROR: innerPath (' +\n        innerPath +\n        ') is not within ' +\n        'outerPath (' +\n        outerPath +\n        ')'\n    );\n  }\n}\n\n/**\n * @returns -1, 0, 1 if left is less, equal, or greater than the right.\n */\nexport function pathCompare(left: Path, right: Path): number {\n  const leftKeys = pathSlice(left, 0);\n  const rightKeys = pathSlice(right, 0);\n  for (let i = 0; i < leftKeys.length && i < rightKeys.length; i++) {\n    const cmp = nameCompare(leftKeys[i], rightKeys[i]);\n    if (cmp !== 0) {\n      return cmp;\n    }\n  }\n  if (leftKeys.length === rightKeys.length) {\n    return 0;\n  }\n  return leftKeys.length < rightKeys.length ? -1 : 1;\n}\n\n/**\n * @returns true if paths are the same.\n */\nexport function pathEquals(path: Path, other: Path): boolean {\n  if (pathGetLength(path) !== pathGetLength(other)) {\n    return false;\n  }\n\n  for (\n    let i = path.pieceNum_, j = other.pieceNum_;\n    i <= path.pieces_.length;\n    i++, j++\n  ) {\n    if (path.pieces_[i] !== other.pieces_[j]) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * @returns True if this path is a parent of (or the same as) other\n */\nexport function pathContains(path: Path, other: Path): boolean {\n  let i = path.pieceNum_;\n  let j = other.pieceNum_;\n  if (pathGetLength(path) > pathGetLength(other)) {\n    return false;\n  }\n  while (i < path.pieces_.length) {\n    if (path.pieces_[i] !== other.pieces_[j]) {\n      return false;\n    }\n    ++i;\n    ++j;\n  }\n  return true;\n}\n\n/**\n * Dynamic (mutable) path used to count path lengths.\n *\n * This class is used to efficiently check paths for valid\n * length (in UTF8 bytes) and depth (used in path validation).\n *\n * Throws Error exception if path is ever invalid.\n *\n * The definition of a path always begins with '/'.\n */\nexport class ValidationPath {\n  parts_: string[];\n  /** Initialize to number of '/' chars needed in path. */\n  byteLength_: number;\n\n  /**\n   * @param path - Initial Path.\n   * @param errorPrefix_ - Prefix for any error messages.\n   */\n  constructor(path: Path, public errorPrefix_: string) {\n    this.parts_ = pathSlice(path, 0);\n    /** Initialize to number of '/' chars needed in path. */\n    this.byteLength_ = Math.max(1, this.parts_.length);\n\n    for (let i = 0; i < this.parts_.length; i++) {\n      this.byteLength_ += stringLength(this.parts_[i]);\n    }\n    validationPathCheckValid(this);\n  }\n}\n\nexport function validationPathPush(\n  validationPath: ValidationPath,\n  child: string\n): void {\n  // Count the needed '/'\n  if (validationPath.parts_.length > 0) {\n    validationPath.byteLength_ += 1;\n  }\n  validationPath.parts_.push(child);\n  validationPath.byteLength_ += stringLength(child);\n  validationPathCheckValid(validationPath);\n}\n\nexport function validationPathPop(validationPath: ValidationPath): void {\n  const last = validationPath.parts_.pop();\n  validationPath.byteLength_ -= stringLength(last);\n  // Un-count the previous '/'\n  if (validationPath.parts_.length > 0) {\n    validationPath.byteLength_ -= 1;\n  }\n}\n\nfunction validationPathCheckValid(validationPath: ValidationPath): void {\n  if (validationPath.byteLength_ > MAX_PATH_LENGTH_BYTES) {\n    throw new Error(\n      validationPath.errorPrefix_ +\n        'has a key path longer than ' +\n        MAX_PATH_LENGTH_BYTES +\n        ' bytes (' +\n        validationPath.byteLength_ +\n        ').'\n    );\n  }\n  if (validationPath.parts_.length > MAX_PATH_DEPTH) {\n    throw new Error(\n      validationPath.errorPrefix_ +\n        'path specified exceeds the maximum depth that can be written (' +\n        MAX_PATH_DEPTH +\n        ') or object contains a cycle ' +\n        validationPathToErrorString(validationPath)\n    );\n  }\n}\n\n/**\n * String for use in error messages - uses '.' notation for path.\n */\nexport function validationPathToErrorString(\n  validationPath: ValidationPath\n): string {\n  if (validationPath.parts_.length === 0) {\n    return '';\n  }\n  return \"in property '\" + validationPath.parts_.join('.') + \"'\";\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 { assert } from '@firebase/util';\n\nimport { EventEmitter } from './EventEmitter';\n\ndeclare const document: Document;\n\nexport class VisibilityMonitor extends EventEmitter {\n  private visible_: boolean;\n\n  static getInstance() {\n    return new VisibilityMonitor();\n  }\n\n  constructor() {\n    super(['visible']);\n    let hidden: string;\n    let visibilityChange: string;\n    if (\n      typeof document !== 'undefined' &&\n      typeof document.addEventListener !== 'undefined'\n    ) {\n      if (typeof document['hidden'] !== 'undefined') {\n        // Opera 12.10 and Firefox 18 and later support\n        visibilityChange = 'visibilitychange';\n        hidden = 'hidden';\n      } else if (typeof document['mozHidden'] !== 'undefined') {\n        visibilityChange = 'mozvisibilitychange';\n        hidden = 'mozHidden';\n      } else if (typeof document['msHidden'] !== 'undefined') {\n        visibilityChange = 'msvisibilitychange';\n        hidden = 'msHidden';\n      } else if (typeof document['webkitHidden'] !== 'undefined') {\n        visibilityChange = 'webkitvisibilitychange';\n        hidden = 'webkitHidden';\n      }\n    }\n\n    // Initially, we always assume we are visible. This ensures that in browsers\n    // without page visibility support or in cases where we are never visible\n    // (e.g. chrome extension), we act as if we are visible, i.e. don't delay\n    // reconnects\n    this.visible_ = true;\n\n    if (visibilityChange) {\n      document.addEventListener(\n        visibilityChange,\n        () => {\n          const visible = !document[hidden];\n          if (visible !== this.visible_) {\n            this.visible_ = visible;\n            this.trigger('visible', visible);\n          }\n        },\n        false\n      );\n    }\n  }\n\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n    return [this.visible_];\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\nimport {\n  assert,\n  contains,\n  Deferred,\n  isEmpty,\n  isMobileCordova,\n  isNodeSdk,\n  isReactNative,\n  isValidFormat,\n  safeGet,\n  stringify,\n  isAdmin\n} from '@firebase/util';\n\nimport { Connection } from '../realtime/Connection';\n\nimport { AppCheckTokenProvider } from './AppCheckTokenProvider';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { RepoInfo } from './RepoInfo';\nimport { ServerActions } from './ServerActions';\nimport { OnlineMonitor } from './util/OnlineMonitor';\nimport { Path } from './util/Path';\nimport { error, log, logWrapper, warn, ObjectToUniqueKey } from './util/util';\nimport { VisibilityMonitor } from './util/VisibilityMonitor';\nimport { SDK_VERSION } from './version';\nimport { QueryContext } from './view/EventRegistration';\n\nconst RECONNECT_MIN_DELAY = 1000;\nconst RECONNECT_MAX_DELAY_DEFAULT = 60 * 5 * 1000; // 5 minutes in milliseconds (Case: 1858)\nconst RECONNECT_MAX_DELAY_FOR_ADMINS = 30 * 1000; // 30 seconds for admin clients (likely to be a backend server)\nconst RECONNECT_DELAY_MULTIPLIER = 1.3;\nconst RECONNECT_DELAY_RESET_TIMEOUT = 30000; // Reset delay back to MIN_DELAY after being connected for 30sec.\nconst SERVER_KILL_INTERRUPT_REASON = 'server_kill';\n\n// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\nconst INVALID_TOKEN_THRESHOLD = 3;\n\ninterface ListenSpec {\n  onComplete(s: string, p?: unknown): void;\n\n  hashFn(): string;\n\n  query: QueryContext;\n  tag: number | null;\n}\n\ninterface OnDisconnectRequest {\n  pathString: string;\n  action: string;\n  data: unknown;\n  onComplete?: (a: string, b: string) => void;\n}\n\ninterface OutstandingPut {\n  action: string;\n  request: object;\n  queued?: boolean;\n  onComplete: (a: string, b?: string) => void;\n}\n\ninterface OutstandingGet {\n  request: object;\n  onComplete: (response: { [k: string]: unknown }) => void;\n}\n\n/**\n * Firebase connection.  Abstracts wire protocol and handles reconnecting.\n *\n * NOTE: All JSON objects sent to the realtime connection must have property names enclosed\n * in quotes to make sure the closure compiler does not minify them.\n */\nexport class PersistentConnection extends ServerActions {\n  // Used for diagnostic logging.\n  id = PersistentConnection.nextPersistentConnectionId_++;\n  private log_ = logWrapper('p:' + this.id + ':');\n\n  private interruptReasons_: { [reason: string]: boolean } = {};\n  private readonly listens: Map<\n    /* path */ string,\n    Map</* queryId */ string, ListenSpec>\n  > = new Map();\n  private outstandingPuts_: OutstandingPut[] = [];\n  private outstandingGets_: OutstandingGet[] = [];\n  private outstandingPutCount_ = 0;\n  private outstandingGetCount_ = 0;\n  private onDisconnectRequestQueue_: OnDisconnectRequest[] = [];\n  private connected_ = false;\n  private reconnectDelay_ = RECONNECT_MIN_DELAY;\n  private maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\n  private securityDebugCallback_: ((a: object) => void) | null = null;\n  lastSessionId: string | null = null;\n\n  private establishConnectionTimer_: number | null = null;\n\n  private visible_: boolean = false;\n\n  // Before we get connected, we keep a queue of pending messages to send.\n  private requestCBHash_: { [k: number]: (a: unknown) => void } = {};\n  private requestNumber_ = 0;\n\n  private realtime_: {\n    sendRequest(a: object): void;\n    close(): void;\n  } | null = null;\n\n  private authToken_: string | null = null;\n  private appCheckToken_: string | null = null;\n  private forceTokenRefresh_ = false;\n  private invalidAuthTokenCount_ = 0;\n  private invalidAppCheckTokenCount_ = 0;\n\n  private firstConnection_ = true;\n  private lastConnectionAttemptTime_: number | null = null;\n  private lastConnectionEstablishedTime_: number | null = null;\n\n  private static nextPersistentConnectionId_ = 0;\n\n  /**\n   * Counter for number of connections created. Mainly used for tagging in the logs\n   */\n  private static nextConnectionId_ = 0;\n\n  /**\n   * @param repoInfo_ - Data about the namespace we are connecting to\n   * @param applicationId_ - The Firebase App ID for this project\n   * @param onDataUpdate_ - A callback for new data from the server\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private applicationId_: string,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private onConnectStatus_: (a: boolean) => void,\n    private onServerInfoUpdate_: (a: unknown) => void,\n    private authTokenProvider_: AuthTokenProvider,\n    private appCheckTokenProvider_: AppCheckTokenProvider,\n    private authOverride_?: object | null\n  ) {\n    super();\n\n    if (authOverride_ && !isNodeSdk()) {\n      throw new Error(\n        'Auth override specified in options, but not supported on non Node.js platforms'\n      );\n    }\n\n    VisibilityMonitor.getInstance().on('visible', this.onVisible_, this);\n\n    if (repoInfo_.host.indexOf('fblocal') === -1) {\n      OnlineMonitor.getInstance().on('online', this.onOnline_, this);\n    }\n  }\n\n  protected sendRequest(\n    action: string,\n    body: unknown,\n    onResponse?: (a: unknown) => void\n  ) {\n    const curReqNum = ++this.requestNumber_;\n\n    const msg = { r: curReqNum, a: action, b: body };\n    this.log_(stringify(msg));\n    assert(\n      this.connected_,\n      \"sendRequest call when we're not connected not allowed.\"\n    );\n    this.realtime_.sendRequest(msg);\n    if (onResponse) {\n      this.requestCBHash_[curReqNum] = onResponse;\n    }\n  }\n\n  get(query: QueryContext): Promise<string> {\n    this.initConnection_();\n\n    const deferred = new Deferred<string>();\n    const request = {\n      p: query._path.toString(),\n      q: query._queryObject\n    };\n    const outstandingGet = {\n      action: 'g',\n      request,\n      onComplete: (message: { [k: string]: unknown }) => {\n        const payload = message['d'] as string;\n        if (message['s'] === 'ok') {\n          deferred.resolve(payload);\n        } else {\n          deferred.reject(payload);\n        }\n      }\n    };\n    this.outstandingGets_.push(outstandingGet);\n    this.outstandingGetCount_++;\n    const index = this.outstandingGets_.length - 1;\n\n    if (this.connected_) {\n      this.sendGet_(index);\n    }\n\n    return deferred.promise;\n  }\n\n  listen(\n    query: QueryContext,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ) {\n    this.initConnection_();\n\n    const queryId = query._queryIdentifier;\n    const pathString = query._path.toString();\n    this.log_('Listen called for ' + pathString + ' ' + queryId);\n    if (!this.listens.has(pathString)) {\n      this.listens.set(pathString, new Map());\n    }\n    assert(\n      query._queryParams.isDefault() || !query._queryParams.loadsAllData(),\n      'listen() called for non-default but complete query'\n    );\n    assert(\n      !this.listens.get(pathString)!.has(queryId),\n      `listen() called twice for same path/queryId.`\n    );\n    const listenSpec: ListenSpec = {\n      onComplete,\n      hashFn: currentHashFn,\n      query,\n      tag\n    };\n    this.listens.get(pathString)!.set(queryId, listenSpec);\n\n    if (this.connected_) {\n      this.sendListen_(listenSpec);\n    }\n  }\n\n  private sendGet_(index: number) {\n    const get = this.outstandingGets_[index];\n    this.sendRequest('g', get.request, (message: { [k: string]: unknown }) => {\n      delete this.outstandingGets_[index];\n      this.outstandingGetCount_--;\n      if (this.outstandingGetCount_ === 0) {\n        this.outstandingGets_ = [];\n      }\n      if (get.onComplete) {\n        get.onComplete(message);\n      }\n    });\n  }\n\n  private sendListen_(listenSpec: ListenSpec) {\n    const query = listenSpec.query;\n    const pathString = query._path.toString();\n    const queryId = query._queryIdentifier;\n    this.log_('Listen on ' + pathString + ' for ' + queryId);\n    const req: { [k: string]: unknown } = { /*path*/ p: pathString };\n\n    const action = 'q';\n\n    // Only bother to send query if it's non-default.\n    if (listenSpec.tag) {\n      req['q'] = query._queryObject;\n      req['t'] = listenSpec.tag;\n    }\n\n    req[/*hash*/ 'h'] = listenSpec.hashFn();\n\n    this.sendRequest(action, req, (message: { [k: string]: unknown }) => {\n      const payload: unknown = message[/*data*/ 'd'];\n      const status = message[/*status*/ 's'] as string;\n\n      // print warnings in any case...\n      PersistentConnection.warnOnListenWarnings_(payload, query);\n\n      const currentListenSpec =\n        this.listens.get(pathString) &&\n        this.listens.get(pathString)!.get(queryId);\n      // only trigger actions if the listen hasn't been removed and readded\n      if (currentListenSpec === listenSpec) {\n        this.log_('listen response', message);\n\n        if (status !== 'ok') {\n          this.removeListen_(pathString, queryId);\n        }\n\n        if (listenSpec.onComplete) {\n          listenSpec.onComplete(status, payload);\n        }\n      }\n    });\n  }\n\n  private static warnOnListenWarnings_(payload: unknown, query: QueryContext) {\n    if (payload && typeof payload === 'object' && contains(payload, 'w')) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const warnings = safeGet(payload as any, 'w');\n      if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n        const indexSpec =\n          '\".indexOn\": \"' + query._queryParams.getIndex().toString() + '\"';\n        const indexPath = query._path.toString();\n        warn(\n          `Using an unspecified index. Your data will be downloaded and ` +\n            `filtered on the client. Consider adding ${indexSpec} at ` +\n            `${indexPath} to your security rules for better performance.`\n        );\n      }\n    }\n  }\n\n  refreshAuthToken(token: string) {\n    this.authToken_ = token;\n    this.log_('Auth token refreshed');\n    if (this.authToken_) {\n      this.tryAuth();\n    } else {\n      //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\n      //the credential so we dont become authenticated next time we connect.\n      if (this.connected_) {\n        this.sendRequest('unauth', {}, () => {});\n      }\n    }\n\n    this.reduceReconnectDelayIfAdminCredential_(token);\n  }\n\n  private reduceReconnectDelayIfAdminCredential_(credential: string) {\n    // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\n    // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\n    const isFirebaseSecret = credential && credential.length === 40;\n    if (isFirebaseSecret || isAdmin(credential)) {\n      this.log_(\n        'Admin auth credential detected.  Reducing max reconnect time.'\n      );\n      this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n    }\n  }\n\n  refreshAppCheckToken(token: string | null) {\n    this.appCheckToken_ = token;\n    this.log_('App check token refreshed');\n    if (this.appCheckToken_) {\n      this.tryAppCheck();\n    } else {\n      //If we're connected we want to let the server know to unauthenticate us.\n      //If we're not connected, simply delete the credential so we dont become\n      // authenticated next time we connect.\n      if (this.connected_) {\n        this.sendRequest('unappeck', {}, () => {});\n      }\n    }\n  }\n\n  /**\n   * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\n   * a auth revoked (the connection is closed).\n   */\n  tryAuth() {\n    if (this.connected_ && this.authToken_) {\n      const token = this.authToken_;\n      const authMethod = isValidFormat(token) ? 'auth' : 'gauth';\n      const requestData: { [k: string]: unknown } = { cred: token };\n      if (this.authOverride_ === null) {\n        requestData['noauth'] = true;\n      } else if (typeof this.authOverride_ === 'object') {\n        requestData['authvar'] = this.authOverride_;\n      }\n      this.sendRequest(\n        authMethod,\n        requestData,\n        (res: { [k: string]: unknown }) => {\n          const status = res[/*status*/ 's'] as string;\n          const data = (res[/*data*/ 'd'] as string) || 'error';\n\n          if (this.authToken_ === token) {\n            if (status === 'ok') {\n              this.invalidAuthTokenCount_ = 0;\n            } else {\n              // Triggers reconnect and force refresh for auth token\n              this.onAuthRevoked_(status, data);\n            }\n          }\n        }\n      );\n    }\n  }\n\n  /**\n   * Attempts to authenticate with the given token. If the authentication\n   * attempt fails, it's triggered like the token was revoked (the connection is\n   * closed).\n   */\n  tryAppCheck() {\n    if (this.connected_ && this.appCheckToken_) {\n      this.sendRequest(\n        'appcheck',\n        { 'token': this.appCheckToken_ },\n        (res: { [k: string]: unknown }) => {\n          const status = res[/*status*/ 's'] as string;\n          const data = (res[/*data*/ 'd'] as string) || 'error';\n          if (status === 'ok') {\n            this.invalidAppCheckTokenCount_ = 0;\n          } else {\n            this.onAppCheckRevoked_(status, data);\n          }\n        }\n      );\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  unlisten(query: QueryContext, tag: number | null) {\n    const pathString = query._path.toString();\n    const queryId = query._queryIdentifier;\n\n    this.log_('Unlisten called for ' + pathString + ' ' + queryId);\n\n    assert(\n      query._queryParams.isDefault() || !query._queryParams.loadsAllData(),\n      'unlisten() called for non-default but complete query'\n    );\n    const listen = this.removeListen_(pathString, queryId);\n    if (listen && this.connected_) {\n      this.sendUnlisten_(pathString, queryId, query._queryObject, tag);\n    }\n  }\n\n  private sendUnlisten_(\n    pathString: string,\n    queryId: string,\n    queryObj: object,\n    tag: number | null\n  ) {\n    this.log_('Unlisten on ' + pathString + ' for ' + queryId);\n\n    const req: { [k: string]: unknown } = { /*path*/ p: pathString };\n    const action = 'n';\n    // Only bother sending queryId if it's non-default.\n    if (tag) {\n      req['q'] = queryObj;\n      req['t'] = tag;\n    }\n\n    this.sendRequest(action, req);\n  }\n\n  onDisconnectPut(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    this.initConnection_();\n\n    if (this.connected_) {\n      this.sendOnDisconnect_('o', pathString, data, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'o',\n        data,\n        onComplete\n      });\n    }\n  }\n\n  onDisconnectMerge(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    this.initConnection_();\n\n    if (this.connected_) {\n      this.sendOnDisconnect_('om', pathString, data, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'om',\n        data,\n        onComplete\n      });\n    }\n  }\n\n  onDisconnectCancel(\n    pathString: string,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    this.initConnection_();\n\n    if (this.connected_) {\n      this.sendOnDisconnect_('oc', pathString, null, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'oc',\n        data: null,\n        onComplete\n      });\n    }\n  }\n\n  private sendOnDisconnect_(\n    action: string,\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string) => void\n  ) {\n    const request = { /*path*/ p: pathString, /*data*/ d: data };\n    this.log_('onDisconnect ' + action, request);\n    this.sendRequest(action, request, (response: { [k: string]: unknown }) => {\n      if (onComplete) {\n        setTimeout(() => {\n          onComplete(\n            response[/*status*/ 's'] as string,\n            response[/* data */ 'd'] as string\n          );\n        }, Math.floor(0));\n      }\n    });\n  }\n\n  put(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void,\n    hash?: string\n  ) {\n    this.putInternal('p', pathString, data, onComplete, hash);\n  }\n\n  merge(\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {\n    this.putInternal('m', pathString, data, onComplete, hash);\n  }\n\n  putInternal(\n    action: string,\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {\n    this.initConnection_();\n\n    const request: { [k: string]: unknown } = {\n      /*path*/ p: pathString,\n      /*data*/ d: data\n    };\n\n    if (hash !== undefined) {\n      request[/*hash*/ 'h'] = hash;\n    }\n\n    // TODO: Only keep track of the most recent put for a given path?\n    this.outstandingPuts_.push({\n      action,\n      request,\n      onComplete\n    });\n\n    this.outstandingPutCount_++;\n    const index = this.outstandingPuts_.length - 1;\n\n    if (this.connected_) {\n      this.sendPut_(index);\n    } else {\n      this.log_('Buffering put: ' + pathString);\n    }\n  }\n\n  private sendPut_(index: number) {\n    const action = this.outstandingPuts_[index].action;\n    const request = this.outstandingPuts_[index].request;\n    const onComplete = this.outstandingPuts_[index].onComplete;\n    this.outstandingPuts_[index].queued = this.connected_;\n\n    this.sendRequest(action, request, (message: { [k: string]: unknown }) => {\n      this.log_(action + ' response', message);\n\n      delete this.outstandingPuts_[index];\n      this.outstandingPutCount_--;\n\n      // Clean up array occasionally.\n      if (this.outstandingPutCount_ === 0) {\n        this.outstandingPuts_ = [];\n      }\n\n      if (onComplete) {\n        onComplete(\n          message[/*status*/ 's'] as string,\n          message[/* data */ 'd'] as string\n        );\n      }\n    });\n  }\n\n  reportStats(stats: { [k: string]: unknown }) {\n    // If we're not connected, we just drop the stats.\n    if (this.connected_) {\n      const request = { /*counters*/ c: stats };\n      this.log_('reportStats', request);\n\n      this.sendRequest(/*stats*/ 's', request, result => {\n        const status = result[/*status*/ 's'];\n        if (status !== 'ok') {\n          const errorReason = result[/* data */ 'd'];\n          this.log_('reportStats', 'Error sending stats: ' + errorReason);\n        }\n      });\n    }\n  }\n\n  private onDataMessage_(message: { [k: string]: unknown }) {\n    if ('r' in message) {\n      // this is a response\n      this.log_('from server: ' + stringify(message));\n      const reqNum = message['r'] as string;\n      const onResponse = this.requestCBHash_[reqNum];\n      if (onResponse) {\n        delete this.requestCBHash_[reqNum];\n        onResponse(message[/*body*/ 'b']);\n      }\n    } else if ('error' in message) {\n      throw 'A server-side error has occurred: ' + message['error'];\n    } else if ('a' in message) {\n      // a and b are action and body, respectively\n      this.onDataPush_(message['a'] as string, message['b'] as {});\n    }\n  }\n\n  private onDataPush_(action: string, body: { [k: string]: unknown }) {\n    this.log_('handleServerMessage', action, body);\n    if (action === 'd') {\n      this.onDataUpdate_(\n        body[/*path*/ 'p'] as string,\n        body[/*data*/ 'd'],\n        /*isMerge*/ false,\n        body['t'] as number\n      );\n    } else if (action === 'm') {\n      this.onDataUpdate_(\n        body[/*path*/ 'p'] as string,\n        body[/*data*/ 'd'],\n        /*isMerge=*/ true,\n        body['t'] as number\n      );\n    } else if (action === 'c') {\n      this.onListenRevoked_(\n        body[/*path*/ 'p'] as string,\n        body[/*query*/ 'q'] as unknown[]\n      );\n    } else if (action === 'ac') {\n      this.onAuthRevoked_(\n        body[/*status code*/ 's'] as string,\n        body[/* explanation */ 'd'] as string\n      );\n    } else if (action === 'apc') {\n      this.onAppCheckRevoked_(\n        body[/*status code*/ 's'] as string,\n        body[/* explanation */ 'd'] as string\n      );\n    } else if (action === 'sd') {\n      this.onSecurityDebugPacket_(body);\n    } else {\n      error(\n        'Unrecognized action received from server: ' +\n          stringify(action) +\n          '\\nAre you using the latest client?'\n      );\n    }\n  }\n\n  private onReady_(timestamp: number, sessionId: string) {\n    this.log_('connection ready');\n    this.connected_ = true;\n    this.lastConnectionEstablishedTime_ = new Date().getTime();\n    this.handleTimestamp_(timestamp);\n    this.lastSessionId = sessionId;\n    if (this.firstConnection_) {\n      this.sendConnectStats_();\n    }\n    this.restoreState_();\n    this.firstConnection_ = false;\n    this.onConnectStatus_(true);\n  }\n\n  private scheduleConnect_(timeout: number) {\n    assert(\n      !this.realtime_,\n      \"Scheduling a connect when we're already connected/ing?\"\n    );\n\n    if (this.establishConnectionTimer_) {\n      clearTimeout(this.establishConnectionTimer_);\n    }\n\n    // NOTE: Even when timeout is 0, it's important to do a setTimeout to work around an infuriating \"Security Error\" in\n    // Firefox when trying to write to our long-polling iframe in some scenarios (e.g. Forge or our unit tests).\n\n    this.establishConnectionTimer_ = setTimeout(() => {\n      this.establishConnectionTimer_ = null;\n      this.establishConnection_();\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(timeout)) as any;\n  }\n\n  private initConnection_() {\n    if (!this.realtime_ && this.firstConnection_) {\n      this.scheduleConnect_(0);\n    }\n  }\n\n  private onVisible_(visible: boolean) {\n    // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\n    if (\n      visible &&\n      !this.visible_ &&\n      this.reconnectDelay_ === this.maxReconnectDelay_\n    ) {\n      this.log_('Window became visible.  Reducing delay.');\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    }\n    this.visible_ = visible;\n  }\n\n  private onOnline_(online: boolean) {\n    if (online) {\n      this.log_('Browser went online.');\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    } else {\n      this.log_('Browser went offline.  Killing connection.');\n      if (this.realtime_) {\n        this.realtime_.close();\n      }\n    }\n  }\n\n  private onRealtimeDisconnect_() {\n    this.log_('data client disconnected');\n    this.connected_ = false;\n    this.realtime_ = null;\n\n    // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\n    this.cancelSentTransactions_();\n\n    // Clear out the pending requests.\n    this.requestCBHash_ = {};\n\n    if (this.shouldReconnect_()) {\n      if (!this.visible_) {\n        this.log_(\"Window isn't visible.  Delaying reconnect.\");\n        this.reconnectDelay_ = this.maxReconnectDelay_;\n        this.lastConnectionAttemptTime_ = new Date().getTime();\n      } else if (this.lastConnectionEstablishedTime_) {\n        // If we've been connected long enough, reset reconnect delay to minimum.\n        const timeSinceLastConnectSucceeded =\n          new Date().getTime() - this.lastConnectionEstablishedTime_;\n        if (timeSinceLastConnectSucceeded > RECONNECT_DELAY_RESET_TIMEOUT) {\n          this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n        }\n        this.lastConnectionEstablishedTime_ = null;\n      }\n\n      const timeSinceLastConnectAttempt =\n        new Date().getTime() - this.lastConnectionAttemptTime_;\n      let reconnectDelay = Math.max(\n        0,\n        this.reconnectDelay_ - timeSinceLastConnectAttempt\n      );\n      reconnectDelay = Math.random() * reconnectDelay;\n\n      this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\n      this.scheduleConnect_(reconnectDelay);\n\n      // Adjust reconnect delay for next time.\n      this.reconnectDelay_ = Math.min(\n        this.maxReconnectDelay_,\n        this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER\n      );\n    }\n    this.onConnectStatus_(false);\n  }\n\n  private async establishConnection_() {\n    if (this.shouldReconnect_()) {\n      this.log_('Making a connection attempt');\n      this.lastConnectionAttemptTime_ = new Date().getTime();\n      this.lastConnectionEstablishedTime_ = null;\n      const onDataMessage = this.onDataMessage_.bind(this);\n      const onReady = this.onReady_.bind(this);\n      const onDisconnect = this.onRealtimeDisconnect_.bind(this);\n      const connId = this.id + ':' + PersistentConnection.nextConnectionId_++;\n      const lastSessionId = this.lastSessionId;\n      let canceled = false;\n      let connection: Connection | null = null;\n      const closeFn = function () {\n        if (connection) {\n          connection.close();\n        } else {\n          canceled = true;\n          onDisconnect();\n        }\n      };\n      const sendRequestFn = function (msg: object) {\n        assert(\n          connection,\n          \"sendRequest call when we're not connected not allowed.\"\n        );\n        connection.sendRequest(msg);\n      };\n\n      this.realtime_ = {\n        close: closeFn,\n        sendRequest: sendRequestFn\n      };\n\n      const forceRefresh = this.forceTokenRefresh_;\n      this.forceTokenRefresh_ = false;\n\n      try {\n        // First fetch auth and app check token, and establish connection after\n        // fetching the token was successful\n        const [authToken, appCheckToken] = await Promise.all([\n          this.authTokenProvider_.getToken(forceRefresh),\n          this.appCheckTokenProvider_.getToken(forceRefresh)\n        ]);\n\n        if (!canceled) {\n          log('getToken() completed. Creating connection.');\n          this.authToken_ = authToken && authToken.accessToken;\n          this.appCheckToken_ = appCheckToken && appCheckToken.token;\n          connection = new Connection(\n            connId,\n            this.repoInfo_,\n            this.applicationId_,\n            this.appCheckToken_,\n            this.authToken_,\n            onDataMessage,\n            onReady,\n            onDisconnect,\n            /* onKill= */ reason => {\n              warn(reason + ' (' + this.repoInfo_.toString() + ')');\n              this.interrupt(SERVER_KILL_INTERRUPT_REASON);\n            },\n            lastSessionId\n          );\n        } else {\n          log('getToken() completed but was canceled');\n        }\n      } catch (error) {\n        this.log_('Failed to get token: ' + error);\n        if (!canceled) {\n          if (this.repoInfo_.nodeAdmin) {\n            // This may be a critical error for the Admin Node.js SDK, so log a warning.\n            // But getToken() may also just have temporarily failed, so we still want to\n            // continue retrying.\n            warn(error);\n          }\n          closeFn();\n        }\n      }\n    }\n  }\n\n  interrupt(reason: string) {\n    log('Interrupting connection for reason: ' + reason);\n    this.interruptReasons_[reason] = true;\n    if (this.realtime_) {\n      this.realtime_.close();\n    } else {\n      if (this.establishConnectionTimer_) {\n        clearTimeout(this.establishConnectionTimer_);\n        this.establishConnectionTimer_ = null;\n      }\n      if (this.connected_) {\n        this.onRealtimeDisconnect_();\n      }\n    }\n  }\n\n  resume(reason: string) {\n    log('Resuming connection for reason: ' + reason);\n    delete this.interruptReasons_[reason];\n    if (isEmpty(this.interruptReasons_)) {\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    }\n  }\n\n  private handleTimestamp_(timestamp: number) {\n    const delta = timestamp - new Date().getTime();\n    this.onServerInfoUpdate_({ serverTimeOffset: delta });\n  }\n\n  private cancelSentTransactions_() {\n    for (let i = 0; i < this.outstandingPuts_.length; i++) {\n      const put = this.outstandingPuts_[i];\n      if (put && /*hash*/ 'h' in put.request && put.queued) {\n        if (put.onComplete) {\n          put.onComplete('disconnect');\n        }\n\n        delete this.outstandingPuts_[i];\n        this.outstandingPutCount_--;\n      }\n    }\n\n    // Clean up array occasionally.\n    if (this.outstandingPutCount_ === 0) {\n      this.outstandingPuts_ = [];\n    }\n  }\n\n  private onListenRevoked_(pathString: string, query?: unknown[]) {\n    // Remove the listen and manufacture a \"permission_denied\" error for the failed listen.\n    let queryId;\n    if (!query) {\n      queryId = 'default';\n    } else {\n      queryId = query.map(q => ObjectToUniqueKey(q)).join('$');\n    }\n    const listen = this.removeListen_(pathString, queryId);\n    if (listen && listen.onComplete) {\n      listen.onComplete('permission_denied');\n    }\n  }\n\n  private removeListen_(pathString: string, queryId: string): ListenSpec {\n    const normalizedPathString = new Path(pathString).toString(); // normalize path.\n    let listen;\n    if (this.listens.has(normalizedPathString)) {\n      const map = this.listens.get(normalizedPathString)!;\n      listen = map.get(queryId);\n      map.delete(queryId);\n      if (map.size === 0) {\n        this.listens.delete(normalizedPathString);\n      }\n    } else {\n      // all listens for this path has already been removed\n      listen = undefined;\n    }\n    return listen;\n  }\n\n  private onAuthRevoked_(statusCode: string, explanation: string) {\n    log('Auth token revoked: ' + statusCode + '/' + explanation);\n    this.authToken_ = null;\n    this.forceTokenRefresh_ = true;\n    this.realtime_.close();\n    if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n      // We'll wait a couple times before logging the warning / increasing the\n      // retry period since oauth tokens will report as \"invalid\" if they're\n      // just expired. Plus there may be transient issues that resolve themselves.\n      this.invalidAuthTokenCount_++;\n      if (this.invalidAuthTokenCount_ >= INVALID_TOKEN_THRESHOLD) {\n        // Set a long reconnect delay because recovery is unlikely\n        this.reconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n\n        // Notify the auth token provider that the token is invalid, which will log\n        // a warning\n        this.authTokenProvider_.notifyForInvalidToken();\n      }\n    }\n  }\n\n  private onAppCheckRevoked_(statusCode: string, explanation: string) {\n    log('App check token revoked: ' + statusCode + '/' + explanation);\n    this.appCheckToken_ = null;\n    this.forceTokenRefresh_ = true;\n    // Note: We don't close the connection as the developer may not have\n    // enforcement enabled. The backend closes connections with enforcements.\n    if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n      // We'll wait a couple times before logging the warning / increasing the\n      // retry period since oauth tokens will report as \"invalid\" if they're\n      // just expired. Plus there may be transient issues that resolve themselves.\n      this.invalidAppCheckTokenCount_++;\n      if (this.invalidAppCheckTokenCount_ >= INVALID_TOKEN_THRESHOLD) {\n        this.appCheckTokenProvider_.notifyForInvalidToken();\n      }\n    }\n  }\n\n  private onSecurityDebugPacket_(body: { [k: string]: unknown }) {\n    if (this.securityDebugCallback_) {\n      this.securityDebugCallback_(body);\n    } else {\n      if ('msg' in body) {\n        console.log(\n          'FIREBASE: ' + (body['msg'] as string).replace('\\n', '\\nFIREBASE: ')\n        );\n      }\n    }\n  }\n\n  private restoreState_() {\n    //Re-authenticate ourselves if we have a credential stored.\n    this.tryAuth();\n    this.tryAppCheck();\n\n    // Puts depend on having received the corresponding data update from the server before they complete, so we must\n    // make sure to send listens before puts.\n    for (const queries of this.listens.values()) {\n      for (const listenSpec of queries.values()) {\n        this.sendListen_(listenSpec);\n      }\n    }\n\n    for (let i = 0; i < this.outstandingPuts_.length; i++) {\n      if (this.outstandingPuts_[i]) {\n        this.sendPut_(i);\n      }\n    }\n\n    while (this.onDisconnectRequestQueue_.length) {\n      const request = this.onDisconnectRequestQueue_.shift();\n      this.sendOnDisconnect_(\n        request.action,\n        request.pathString,\n        request.data,\n        request.onComplete\n      );\n    }\n\n    for (let i = 0; i < this.outstandingGets_.length; i++) {\n      if (this.outstandingGets_[i]) {\n        this.sendGet_(i);\n      }\n    }\n  }\n\n  /**\n   * Sends client stats for first connection\n   */\n  private sendConnectStats_() {\n    const stats: { [k: string]: number } = {};\n\n    let clientName = 'js';\n    if (isNodeSdk()) {\n      if (this.repoInfo_.nodeAdmin) {\n        clientName = 'admin_node';\n      } else {\n        clientName = 'node';\n      }\n    }\n\n    stats['sdk.' + clientName + '.' + SDK_VERSION.replace(/\\./g, '-')] = 1;\n\n    if (isMobileCordova()) {\n      stats['framework.cordova'] = 1;\n    } else if (isReactNative()) {\n      stats['framework.reactnative'] = 1;\n    }\n    this.reportStats(stats);\n  }\n\n  private shouldReconnect_(): boolean {\n    const online = OnlineMonitor.getInstance().currentlyOnline();\n    return isEmpty(this.interruptReasons_) && online;\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\nimport { Path } from '../util/Path';\n\nimport { Index } from './indexes/Index';\n\n/**\n * Node is an interface defining the common functionality for nodes in\n * a DataSnapshot.\n *\n * @interface\n */\nexport interface Node {\n  /**\n   * Whether this node is a leaf node.\n   * @returns Whether this is a leaf node.\n   */\n  isLeafNode(): boolean;\n\n  /**\n   * Gets the priority of the node.\n   * @returns The priority of the node.\n   */\n  getPriority(): Node;\n\n  /**\n   * Returns a duplicate node with the new priority.\n   * @param newPriorityNode - New priority to set for the node.\n   * @returns Node with new priority.\n   */\n  updatePriority(newPriorityNode: Node): Node;\n\n  /**\n   * Returns the specified immediate child, or null if it doesn't exist.\n   * @param childName - The name of the child to retrieve.\n   * @returns The retrieved child, or an empty node.\n   */\n  getImmediateChild(childName: string): Node;\n\n  /**\n   * Returns a child by path, or null if it doesn't exist.\n   * @param path - The path of the child to retrieve.\n   * @returns The retrieved child or an empty node.\n   */\n  getChild(path: Path): Node;\n\n  /**\n   * Returns the name of the child immediately prior to the specified childNode, or null.\n   * @param childName - The name of the child to find the predecessor of.\n   * @param childNode - The node to find the predecessor of.\n   * @param index - The index to use to determine the predecessor\n   * @returns The name of the predecessor child, or null if childNode is the first child.\n   */\n  getPredecessorChildName(\n    childName: string,\n    childNode: Node,\n    index: Index\n  ): string | null;\n\n  /**\n   * Returns a duplicate node, with the specified immediate child updated.\n   * Any value in the node will be removed.\n   * @param childName - The name of the child to update.\n   * @param newChildNode - The new child node\n   * @returns The updated node.\n   */\n  updateImmediateChild(childName: string, newChildNode: Node): Node;\n\n  /**\n   * Returns a duplicate node, with the specified child updated.  Any value will\n   * be removed.\n   * @param path - The path of the child to update.\n   * @param newChildNode - The new child node, which may be an empty node\n   * @returns The updated node.\n   */\n  updateChild(path: Path, newChildNode: Node): Node;\n\n  /**\n   * True if the immediate child specified exists\n   */\n  hasChild(childName: string): boolean;\n\n  /**\n   * @returns True if this node has no value or children.\n   */\n  isEmpty(): boolean;\n\n  /**\n   * @returns The number of children of this node.\n   */\n  numChildren(): number;\n\n  /**\n   * Calls action for each child.\n   * @param action - Action to be called for\n   * each child.  It's passed the child name and the child node.\n   * @returns The first truthy value return by action, or the last falsey one\n   */\n  forEachChild(index: Index, action: (a: string, b: Node) => void): unknown;\n\n  /**\n   * @param exportFormat - True for export format (also wire protocol format).\n   * @returns Value of this node as JSON.\n   */\n  val(exportFormat?: boolean): unknown;\n\n  /**\n   * @returns hash representing the node contents.\n   */\n  hash(): string;\n\n  /**\n   * @param other - Another node\n   * @returns -1 for less than, 0 for equal, 1 for greater than other\n   */\n  compareTo(other: Node): number;\n\n  /**\n   * @returns Whether or not this snapshot equals other\n   */\n  equals(other: Node): boolean;\n\n  /**\n   * @returns This node, with the specified index now available\n   */\n  withIndex(indexDefinition: Index): Node;\n\n  isIndexed(indexDefinition: Index): boolean;\n}\n\nexport class NamedNode {\n  constructor(public name: string, public node: Node) {}\n\n  static Wrap(name: string, node: Node) {\n    return new NamedNode(name, node);\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\nimport { Comparator } from '../../util/SortedMap';\nimport { MIN_NAME } from '../../util/util';\nimport { Node, NamedNode } from '../Node';\n\nexport abstract class Index {\n  abstract compare(a: NamedNode, b: NamedNode): number;\n\n  abstract isDefinedOn(node: Node): boolean;\n\n  /**\n   * @returns A standalone comparison function for\n   * this index\n   */\n  getCompare(): Comparator<NamedNode> {\n    return this.compare.bind(this);\n  }\n\n  /**\n   * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\n   * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\n   *\n   *\n   * @returns True if the portion of the snapshot being indexed changed between oldNode and newNode\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    const oldWrapped = new NamedNode(MIN_NAME, oldNode);\n    const newWrapped = new NamedNode(MIN_NAME, newNode);\n    return this.compare(oldWrapped, newWrapped) !== 0;\n  }\n\n  /**\n   * @returns a node wrapper that will sort equal to or less than\n   * any other node wrapper, using this index\n   */\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n\n  /**\n   * @returns a node wrapper that will sort greater than or equal to\n   * any other node wrapper, using this index\n   */\n  abstract maxPost(): NamedNode;\n\n  abstract makePost(indexValue: unknown, name: string): NamedNode;\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  abstract toString(): string;\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 { assert, assertionError } from '@firebase/util';\n\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { ChildrenNode } from '../ChildrenNode';\nimport { Node, NamedNode } from '../Node';\n\nimport { Index } from './Index';\n\nlet __EMPTY_NODE: ChildrenNode;\n\nexport class KeyIndex extends Index {\n  static get __EMPTY_NODE() {\n    return __EMPTY_NODE;\n  }\n\n  static set __EMPTY_NODE(val) {\n    __EMPTY_NODE = val;\n  }\n  compare(a: NamedNode, b: NamedNode): number {\n    return nameCompare(a.name, b.name);\n  }\n  isDefinedOn(node: Node): boolean {\n    // We could probably return true here (since every node has a key), but it's never called\n    // so just leaving unimplemented for now.\n    throw assertionError('KeyIndex.isDefinedOn not expected to be called.');\n  }\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return false; // The key for a node never changes.\n  }\n  minPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n  maxPost(): NamedNode {\n    // TODO: This should really be created once and cached in a static property, but\n    // NamedNode isn't defined yet, so I can't use it in a static.  Bleh.\n    return new NamedNode(MAX_NAME, __EMPTY_NODE);\n  }\n\n  makePost(indexValue: string, name: string): NamedNode {\n    assert(\n      typeof indexValue === 'string',\n      'KeyIndex indexValue must always be a string.'\n    );\n    // We just use empty node, but it'll never be compared, since our comparator only looks at name.\n    return new NamedNode(indexValue, __EMPTY_NODE);\n  }\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.key';\n  }\n}\n\nexport const KEY_INDEX = new KeyIndex();\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 * @fileoverview Implementation of an immutable SortedMap using a Left-leaning\n * Red-Black Tree, adapted from the implementation in Mugs\n * (http://mads379.github.com/mugs/) by Mads Hartmann Jensen\n * (mads379\\@gmail.com).\n *\n * Original paper on Left-leaning Red-Black Trees:\n *   http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf\n *\n * Invariant 1: No red node has a red child\n * Invariant 2: Every leaf path has the same number of black nodes\n * Invariant 3: Only the left child can be red (left leaning)\n */\n\n// TODO: There are some improvements I'd like to make to improve memory / perf:\n//  * Create two prototypes, LLRedNode and LLBlackNode, instead of storing a\n//    color property in every node.\n// TODO: It would also be good (and possibly necessary) to create a base\n// interface for LLRBNode and LLRBEmptyNode.\n\nexport type Comparator<K> = (key1: K, key2: K) => number;\n\n/**\n * An iterator over an LLRBNode.\n */\nexport class SortedMapIterator<K, V, T> {\n  private nodeStack_: Array<LLRBNode<K, V> | LLRBEmptyNode<K, V>> = [];\n\n  /**\n   * @param node - Node to iterate.\n   * @param isReverse_ - Whether or not to iterate in reverse\n   */\n  constructor(\n    node: LLRBNode<K, V> | LLRBEmptyNode<K, V>,\n    startKey: K | null,\n    comparator: Comparator<K>,\n    private isReverse_: boolean,\n    private resultGenerator_: ((k: K, v: V) => T) | null = null\n  ) {\n    let cmp = 1;\n    while (!node.isEmpty()) {\n      node = node as LLRBNode<K, V>;\n      cmp = startKey ? comparator(node.key, startKey) : 1;\n      // flip the comparison if we're going in reverse\n      if (isReverse_) {\n        cmp *= -1;\n      }\n\n      if (cmp < 0) {\n        // This node is less than our start key. ignore it\n        if (this.isReverse_) {\n          node = node.left;\n        } else {\n          node = node.right;\n        }\n      } else if (cmp === 0) {\n        // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\n        this.nodeStack_.push(node);\n        break;\n      } else {\n        // This node is greater than our start key, add it to the stack and move to the next one\n        this.nodeStack_.push(node);\n        if (this.isReverse_) {\n          node = node.right;\n        } else {\n          node = node.left;\n        }\n      }\n    }\n  }\n\n  getNext(): T {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n\n    let node = this.nodeStack_.pop();\n    let result: T;\n    if (this.resultGenerator_) {\n      result = this.resultGenerator_(node.key, node.value);\n    } else {\n      result = { key: node.key, value: node.value } as unknown as T;\n    }\n\n    if (this.isReverse_) {\n      node = node.left;\n      while (!node.isEmpty()) {\n        this.nodeStack_.push(node);\n        node = node.right;\n      }\n    } else {\n      node = node.right;\n      while (!node.isEmpty()) {\n        this.nodeStack_.push(node);\n        node = node.left;\n      }\n    }\n\n    return result;\n  }\n\n  hasNext(): boolean {\n    return this.nodeStack_.length > 0;\n  }\n\n  peek(): T {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n\n    const node = this.nodeStack_[this.nodeStack_.length - 1];\n    if (this.resultGenerator_) {\n      return this.resultGenerator_(node.key, node.value);\n    } else {\n      return { key: node.key, value: node.value } as unknown as T;\n    }\n  }\n}\n\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nexport class LLRBNode<K, V> {\n  color: boolean;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n\n  /**\n   * @param key - Key associated with this node.\n   * @param value - Value associated with this node.\n   * @param color - Whether this node is red.\n   * @param left - Left child.\n   * @param right - Right child.\n   */\n  constructor(\n    public key: K,\n    public value: V,\n    color: boolean | null,\n    left?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ) {\n    this.color = color != null ? color : LLRBNode.RED;\n    this.left =\n      left != null ? left : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n    this.right =\n      right != null ? right : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n  }\n\n  static RED = true;\n  static BLACK = false;\n\n  /**\n   * Returns a copy of the current node, optionally replacing pieces of it.\n   *\n   * @param key - New key for the node, or null.\n   * @param value - New value for the node, or null.\n   * @param color - New color for the node, or null.\n   * @param left - New left child for the node, or null.\n   * @param right - New right child for the node, or null.\n   * @returns The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBNode<K, V> {\n    return new LLRBNode(\n      key != null ? key : this.key,\n      value != null ? value : this.value,\n      color != null ? color : this.color,\n      left != null ? left : this.left,\n      right != null ? right : this.right\n    );\n  }\n\n  /**\n   * @returns The total number of nodes in the tree.\n   */\n  count(): number {\n    return this.left.count() + 1 + this.right.count();\n  }\n\n  /**\n   * @returns True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   *   node.  If it returns true, traversal is aborted.\n   * @returns The first truthy value returned by action, or the last falsey\n   *   value returned by action\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return (\n      this.left.inorderTraversal(action) ||\n      !!action(this.key, this.value) ||\n      this.right.inorderTraversal(action)\n    );\n  }\n\n  /**\n   * Traverses the tree in reverse key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @returns True if traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return (\n      this.right.reverseTraversal(action) ||\n      action(this.key, this.value) ||\n      this.left.reverseTraversal(action)\n    );\n  }\n\n  /**\n   * @returns The minimum node in the tree.\n   */\n  private min_(): LLRBNode<K, V> {\n    if (this.left.isEmpty()) {\n      return this;\n    } else {\n      return (this.left as LLRBNode<K, V>).min_();\n    }\n  }\n\n  /**\n   * @returns The maximum key in the tree.\n   */\n  minKey(): K {\n    return this.min_().key;\n  }\n\n  /**\n   * @returns The maximum key in the tree.\n   */\n  maxKey(): K {\n    if (this.right.isEmpty()) {\n      return this.key;\n    } else {\n      return this.right.maxKey();\n    }\n  }\n\n  /**\n   * @param key - Key to insert.\n   * @param value - Value to insert.\n   * @param comparator - Comparator.\n   * @returns New tree, with the key/value added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    let n: LLRBNode<K, V> = this;\n    const cmp = comparator(key, n.key);\n    if (cmp < 0) {\n      n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\n    } else if (cmp === 0) {\n      n = n.copy(null, value, null, null, null);\n    } else {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        n.right.insert(key, value, comparator)\n      );\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @returns New tree, with the minimum key removed.\n   */\n  private removeMin_(): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    if (this.left.isEmpty()) {\n      return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n    }\n    let n: LLRBNode<K, V> = this;\n    if (!n.left.isRed_() && !n.left.left.isRed_()) {\n      n = n.moveRedLeft_();\n    }\n    n = n.copy(null, null, null, (n.left as LLRBNode<K, V>).removeMin_(), null);\n    return n.fixUp_();\n  }\n\n  /**\n   * @param key - The key of the item to remove.\n   * @param comparator - Comparator.\n   * @returns New tree, with the specified item removed.\n   */\n  remove(\n    key: K,\n    comparator: Comparator<K>\n  ): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    let n, smallest;\n    n = this;\n    if (comparator(key, n.key) < 0) {\n      if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\n        n = n.moveRedLeft_();\n      }\n      n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n    } else {\n      if (n.left.isRed_()) {\n        n = n.rotateRight_();\n      }\n      if (!n.right.isEmpty() && !n.right.isRed_() && !n.right.left.isRed_()) {\n        n = n.moveRedRight_();\n      }\n      if (comparator(key, n.key) === 0) {\n        if (n.right.isEmpty()) {\n          return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n        } else {\n          smallest = (n.right as LLRBNode<K, V>).min_();\n          n = n.copy(\n            smallest.key,\n            smallest.value,\n            null,\n            null,\n            (n.right as LLRBNode<K, V>).removeMin_()\n          );\n        }\n      }\n      n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @returns Whether this is a RED node.\n   */\n  isRed_(): boolean {\n    return this.color;\n  }\n\n  /**\n   * @returns New tree after performing any needed rotations.\n   */\n  private fixUp_(): LLRBNode<K, V> {\n    let n: LLRBNode<K, V> = this;\n    if (n.right.isRed_() && !n.left.isRed_()) {\n      n = n.rotateLeft_();\n    }\n    if (n.left.isRed_() && n.left.left.isRed_()) {\n      n = n.rotateRight_();\n    }\n    if (n.left.isRed_() && n.right.isRed_()) {\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @returns New tree, after moveRedLeft.\n   */\n  private moveRedLeft_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.right.left.isRed_()) {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        (n.right as LLRBNode<K, V>).rotateRight_()\n      );\n      n = n.rotateLeft_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @returns New tree, after moveRedRight.\n   */\n  private moveRedRight_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.left.left.isRed_()) {\n      n = n.rotateRight_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @returns New tree, after rotateLeft.\n   */\n  private rotateLeft_(): LLRBNode<K, V> {\n    const nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n    return this.right.copy(null, null, this.color, nl, null) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @returns New tree, after rotateRight.\n   */\n  private rotateRight_(): LLRBNode<K, V> {\n    const nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n    return this.left.copy(null, null, this.color, null, nr) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @returns Newt ree, after colorFlip.\n   */\n  private colorFlip_(): LLRBNode<K, V> {\n    const left = this.left.copy(null, null, !this.left.color, null, null);\n    const right = this.right.copy(null, null, !this.right.color, null, null);\n    return this.copy(null, null, !this.color, left, right);\n  }\n\n  /**\n   * For testing.\n   *\n   * @returns True if all is well.\n   */\n  private checkMaxDepth_(): boolean {\n    const blackDepth = this.check_();\n    return Math.pow(2.0, blackDepth) <= this.count() + 1;\n  }\n\n  check_(): number {\n    if (this.isRed_() && this.left.isRed_()) {\n      throw new Error(\n        'Red node has red child(' + this.key + ',' + this.value + ')'\n      );\n    }\n    if (this.right.isRed_()) {\n      throw new Error(\n        'Right child of (' + this.key + ',' + this.value + ') is red'\n      );\n    }\n    const blackDepth = this.left.check_();\n    if (blackDepth !== this.right.check_()) {\n      throw new Error('Black depths differ');\n    } else {\n      return blackDepth + (this.isRed_() ? 0 : 1);\n    }\n  }\n}\n\n/**\n * Represents an empty node (a leaf node in the Red-Black Tree).\n */\nexport class LLRBEmptyNode<K, V> {\n  key: K;\n  value: V;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  color: boolean;\n\n  /**\n   * Returns a copy of the current node.\n   *\n   * @returns The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key/value added.\n   *\n   * @param key - Key to be added.\n   * @param value - Value to be added.\n   * @param comparator - Comparator.\n   * @returns New tree, with item added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    return new LLRBNode(key, value, null);\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key removed.\n   *\n   * @param key - The key to remove.\n   * @param comparator - Comparator.\n   * @returns New tree, with item removed.\n   */\n  remove(key: K, comparator: Comparator<K>): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * @returns The total number of nodes in the tree.\n   */\n  count(): number {\n    return 0;\n  }\n\n  /**\n   * @returns True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return true;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @returns True if traversal was aborted.\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in reverse key order and calls the specified action function\n   * for each node.\n   *\n   * @param action - Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @returns True if traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return false;\n  }\n\n  minKey(): null {\n    return null;\n  }\n\n  maxKey(): null {\n    return null;\n  }\n\n  check_(): number {\n    return 0;\n  }\n\n  /**\n   * @returns Whether this node is red.\n   */\n  isRed_() {\n    return false;\n  }\n}\n\n/**\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\n * tree.\n */\nexport class SortedMap<K, V> {\n  /**\n   * Always use the same empty node, to reduce memory.\n   */\n  static EMPTY_NODE = new LLRBEmptyNode();\n\n  /**\n   * @param comparator_ - Key comparator.\n   * @param root_ - Optional root node for the map.\n   */\n  constructor(\n    private comparator_: Comparator<K>,\n    private root_:\n      | LLRBNode<K, V>\n      | LLRBEmptyNode<K, V> = SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>\n  ) {}\n\n  /**\n   * Returns a copy of the map, with the specified key/value added or replaced.\n   * (TODO: We should perhaps rename this method to 'put')\n   *\n   * @param key - Key to be added.\n   * @param value - Value to be added.\n   * @returns New map, with item added.\n   */\n  insert(key: K, value: V): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .insert(key, value, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns a copy of the map, with the specified key removed.\n   *\n   * @param key - The key to remove.\n   * @returns New map, with item removed.\n   */\n  remove(key: K): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .remove(key, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns the value of the node with the given key, or null.\n   *\n   * @param key - The key to look up.\n   * @returns The value of the node with the given key, or null if the\n   * key doesn't exist.\n   */\n  get(key: K): V | null {\n    let cmp;\n    let node = this.root_;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        return node.value;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        node = node.right;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Returns the key of the item *before* the specified key, or null if key is the first item.\n   * @param key - The key to find the predecessor of\n   * @returns The predecessor key.\n   */\n  getPredecessorKey(key: K): K | null {\n    let cmp,\n      node = this.root_,\n      rightParent = null;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        if (!node.left.isEmpty()) {\n          node = node.left;\n          while (!node.right.isEmpty()) {\n            node = node.right;\n          }\n          return node.key;\n        } else if (rightParent) {\n          return rightParent.key;\n        } else {\n          return null; // first item.\n        }\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        rightParent = node;\n        node = node.right;\n      }\n    }\n\n    throw new Error(\n      'Attempted to find predecessor key for a nonexistent key.  What gives?'\n    );\n  }\n\n  /**\n   * @returns True if the map is empty.\n   */\n  isEmpty(): boolean {\n    return this.root_.isEmpty();\n  }\n\n  /**\n   * @returns The total number of nodes in the map.\n   */\n  count(): number {\n    return this.root_.count();\n  }\n\n  /**\n   * @returns The minimum key in the map.\n   */\n  minKey(): K | null {\n    return this.root_.minKey();\n  }\n\n  /**\n   * @returns The maximum key in the map.\n   */\n  maxKey(): K | null {\n    return this.root_.maxKey();\n  }\n\n  /**\n   * Traverses the map in key order and calls the specified action function\n   * for each key/value pair.\n   *\n   * @param action - Callback function to be called\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   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return this.root_.inorderTraversal(action);\n  }\n\n  /**\n   * Traverses the map in reverse key order and calls the specified action function\n   * for each key/value pair.\n   *\n   * @param action - Callback function to be called\n   * for each key/value pair.  If action returns true, traversal is aborted.\n   * @returns True if the traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return this.root_.reverseTraversal(action);\n  }\n\n  /**\n   * Returns an iterator over the SortedMap.\n   * @returns The iterator.\n   */\n  getIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getReverseIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n\n  getReverseIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      true,\n      resultGenerator\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\nimport { nameCompare } from '../util/util';\n\nimport { NamedNode } from './Node';\n\nexport function NAME_ONLY_COMPARATOR(left: NamedNode, right: NamedNode) {\n  return nameCompare(left.name, right.name);\n}\n\nexport function NAME_COMPARATOR(left: string, right: string) {\n  return nameCompare(left, right);\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 { assert, contains } from '@firebase/util';\n\nimport { Indexable } from '../util/misc';\nimport { doubleToIEEE754String } from '../util/util';\n\nimport { Node } from './Node';\n\nlet MAX_NODE: Node;\n\nexport function setMaxNode(val: Node) {\n  MAX_NODE = val;\n}\n\nexport const priorityHashText = function (priority: string | number): string {\n  if (typeof priority === 'number') {\n    return 'number:' + doubleToIEEE754String(priority);\n  } else {\n    return 'string:' + priority;\n  }\n};\n\n/**\n * Validates that a priority snapshot Node is valid.\n */\nexport const validatePriorityNode = function (priorityNode: Node) {\n  if (priorityNode.isLeafNode()) {\n    const val = priorityNode.val();\n    assert(\n      typeof val === 'string' ||\n        typeof val === 'number' ||\n        (typeof val === 'object' && contains(val as Indexable, '.sv')),\n      'Priority must be a string or number.'\n    );\n  } else {\n    assert(\n      priorityNode === MAX_NODE || priorityNode.isEmpty(),\n      'priority of unexpected type.'\n    );\n  }\n  // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\n  assert(\n    priorityNode === MAX_NODE || priorityNode.getPriority().isEmpty(),\n    \"Priority nodes can't have a priority of their own.\"\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\nimport { assert } from '@firebase/util';\n\nimport { Indexable } from '../util/misc';\nimport {\n  Path,\n  pathGetFront,\n  pathGetLength,\n  pathIsEmpty,\n  pathPopFront\n} from '../util/Path';\nimport { doubleToIEEE754String, sha1 } from '../util/util';\n\nimport { ChildrenNodeConstructor } from './ChildrenNode';\nimport { Index } from './indexes/Index';\nimport { Node } from './Node';\nimport { priorityHashText, validatePriorityNode } from './snap';\n\nlet __childrenNodeConstructor: ChildrenNodeConstructor;\n\n/**\n * LeafNode is a class for storing leaf nodes in a DataSnapshot.  It\n * implements Node and stores the value of the node (a string,\n * number, or boolean) accessible via getValue().\n */\nexport class LeafNode implements Node {\n  static set __childrenNodeConstructor(val: ChildrenNodeConstructor) {\n    __childrenNodeConstructor = val;\n  }\n\n  static get __childrenNodeConstructor() {\n    return __childrenNodeConstructor;\n  }\n\n  /**\n   * The sort order for comparing leaf nodes of different types. If two leaf nodes have\n   * the same type, the comparison falls back to their value\n   */\n  static VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\n\n  private lazyHash_: string | null = null;\n\n  /**\n   * @param value_ - The value to store in this leaf node. The object type is\n   * possible in the event of a deferred value\n   * @param priorityNode_ - The priority of this node.\n   */\n  constructor(\n    private readonly value_: string | number | boolean | Indexable,\n    private priorityNode_: Node = LeafNode.__childrenNodeConstructor.EMPTY_NODE\n  ) {\n    assert(\n      this.value_ !== undefined && this.value_ !== null,\n      \"LeafNode shouldn't be created with null/undefined value.\"\n    );\n\n    validatePriorityNode(this.priorityNode_);\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return true;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    return new LeafNode(this.value_, newPriorityNode);\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.priorityNode_;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    if (pathIsEmpty(path)) {\n      return this;\n    } else if (pathGetFront(path) === '.priority') {\n      return this.priorityNode_;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n    }\n  }\n  hasChild(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPredecessorChildName(childName: string, childNode: Node): null {\n    return null;\n  }\n\n  /** @inheritDoc */\n  updateImmediateChild(childName: string, newChildNode: Node): Node {\n    if (childName === '.priority') {\n      return this.updatePriority(newChildNode);\n    } else if (newChildNode.isEmpty() && childName !== '.priority') {\n      return this;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateImmediateChild(\n        childName,\n        newChildNode\n      ).updatePriority(this.priorityNode_);\n    }\n  }\n\n  /** @inheritDoc */\n  updateChild(path: Path, newChildNode: Node): Node {\n    const front = pathGetFront(path);\n    if (front === null) {\n      return newChildNode;\n    } else if (newChildNode.isEmpty() && front !== '.priority') {\n      return this;\n    } else {\n      assert(\n        front !== '.priority' || pathGetLength(path) === 1,\n        '.priority must be the last token in a path'\n      );\n\n      return this.updateImmediateChild(\n        front,\n        LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(\n          pathPopFront(path),\n          newChildNode\n        )\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  numChildren(): number {\n    return 0;\n  }\n\n  /** @inheritDoc */\n  forEachChild(index: Index, action: (s: string, n: Node) => void): boolean {\n    return false;\n  }\n  val(exportFormat?: boolean): {} {\n    if (exportFormat && !this.getPriority().isEmpty()) {\n      return {\n        '.value': this.getValue(),\n        '.priority': this.getPriority().val()\n      };\n    } else {\n      return this.getValue();\n    }\n  }\n\n  /** @inheritDoc */\n  hash(): string {\n    if (this.lazyHash_ === null) {\n      let toHash = '';\n      if (!this.priorityNode_.isEmpty()) {\n        toHash +=\n          'priority:' +\n          priorityHashText(this.priorityNode_.val() as number | string) +\n          ':';\n      }\n\n      const type = typeof this.value_;\n      toHash += type + ':';\n      if (type === 'number') {\n        toHash += doubleToIEEE754String(this.value_ as number);\n      } else {\n        toHash += this.value_;\n      }\n      this.lazyHash_ = sha1(toHash);\n    }\n    return this.lazyHash_;\n  }\n\n  /**\n   * Returns the value of the leaf node.\n   * @returns The value of the node.\n   */\n  getValue(): Indexable | string | number | boolean {\n    return this.value_;\n  }\n  compareTo(other: Node): number {\n    if (other === LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\n      return 1;\n    } else if (other instanceof LeafNode.__childrenNodeConstructor) {\n      return -1;\n    } else {\n      assert(other.isLeafNode(), 'Unknown node type');\n      return this.compareToLeafNode_(other as LeafNode);\n    }\n  }\n\n  /**\n   * Comparison specifically for two leaf nodes\n   */\n  private compareToLeafNode_(otherLeaf: LeafNode): number {\n    const otherLeafType = typeof otherLeaf.value_;\n    const thisLeafType = typeof this.value_;\n    const otherIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(otherLeafType);\n    const thisIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(thisLeafType);\n    assert(otherIndex >= 0, 'Unknown leaf type: ' + otherLeafType);\n    assert(thisIndex >= 0, 'Unknown leaf type: ' + thisLeafType);\n    if (otherIndex === thisIndex) {\n      // Same type, compare values\n      if (thisLeafType === 'object') {\n        // Deferred value nodes are all equal, but we should also never get to this point...\n        return 0;\n      } else {\n        // Note that this works because true > false, all others are number or string comparisons\n        if (this.value_ < otherLeaf.value_) {\n          return -1;\n        } else if (this.value_ === otherLeaf.value_) {\n          return 0;\n        } else {\n          return 1;\n        }\n      }\n    } else {\n      return thisIndex - otherIndex;\n    }\n  }\n  withIndex(): Node {\n    return this;\n  }\n  isIndexed(): boolean {\n    return true;\n  }\n  equals(other: Node): boolean {\n    if (other === this) {\n      return true;\n    } else if (other.isLeafNode()) {\n      const otherLeaf = other as LeafNode;\n      return (\n        this.value_ === otherLeaf.value_ &&\n        this.priorityNode_.equals(otherLeaf.priorityNode_)\n      );\n    } else {\n      return false;\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\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { LeafNode } from '../LeafNode';\nimport { NamedNode, Node } from '../Node';\n\nimport { Index } from './Index';\n\nlet nodeFromJSON: (a: unknown) => Node;\nlet MAX_NODE: Node;\n\nexport function setNodeFromJSON(val: (a: unknown) => Node) {\n  nodeFromJSON = val;\n}\n\nexport function setMaxNode(val: Node) {\n  MAX_NODE = val;\n}\n\nexport class PriorityIndex extends Index {\n  compare(a: NamedNode, b: NamedNode): number {\n    const aPriority = a.node.getPriority();\n    const bPriority = b.node.getPriority();\n    const indexCmp = aPriority.compareTo(bPriority);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n  isDefinedOn(node: Node): boolean {\n    return !node.getPriority().isEmpty();\n  }\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return !oldNode.getPriority().equals(newNode.getPriority());\n  }\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n  maxPost(): NamedNode {\n    return new NamedNode(MAX_NAME, new LeafNode('[PRIORITY-POST]', MAX_NODE));\n  }\n\n  makePost(indexValue: unknown, name: string): NamedNode {\n    const priorityNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, new LeafNode('[PRIORITY-POST]', priorityNode));\n  }\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.priority';\n  }\n}\n\nexport const PRIORITY_INDEX = new PriorityIndex();\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 { LLRBNode, SortedMap } from '../util/SortedMap';\n\nimport { NamedNode } from './Node';\n\nconst LOG_2 = Math.log(2);\n\nclass Base12Num {\n  count: number;\n  private current_: number;\n  private bits_: number;\n\n  constructor(length: number) {\n    const logBase2 = (num: number) =>\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      parseInt((Math.log(num) / LOG_2) as any, 10);\n    const bitMask = (bits: number) => parseInt(Array(bits + 1).join('1'), 2);\n    this.count = logBase2(length + 1);\n    this.current_ = this.count - 1;\n    const mask = bitMask(this.count);\n    this.bits_ = (length + 1) & mask;\n  }\n\n  nextBitIsOne(): boolean {\n    //noinspection JSBitwiseOperatorUsage\n    const result = !(this.bits_ & (0x1 << this.current_));\n    this.current_--;\n    return result;\n  }\n}\n\n/**\n * Takes a list of child nodes and constructs a SortedSet using the given comparison\n * function\n *\n * Uses the algorithm described in the paper linked here:\n * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458\n *\n * @param childList - Unsorted list of children\n * @param cmp - The comparison method to be used\n * @param keyFn - An optional function to extract K from a node wrapper, if K's\n * type is not NamedNode\n * @param mapSortFn - An optional override for comparator used by the generated sorted map\n */\nexport const buildChildSet = function <K, V>(\n  childList: NamedNode[],\n  cmp: (a: NamedNode, b: NamedNode) => number,\n  keyFn?: (a: NamedNode) => K,\n  mapSortFn?: (a: K, b: K) => number\n): SortedMap<K, V> {\n  childList.sort(cmp);\n\n  const buildBalancedTree = function (\n    low: number,\n    high: number\n  ): LLRBNode<K, V> | null {\n    const length = high - low;\n    let namedNode: NamedNode;\n    let key: K;\n    if (length === 0) {\n      return null;\n    } else if (length === 1) {\n      namedNode = childList[low];\n      key = keyFn ? keyFn(namedNode) : (namedNode as unknown as K);\n      return new LLRBNode(\n        key,\n        namedNode.node as unknown as V,\n        LLRBNode.BLACK,\n        null,\n        null\n      );\n    } else {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const middle = parseInt((length / 2) as any, 10) + low;\n      const left = buildBalancedTree(low, middle);\n      const right = buildBalancedTree(middle + 1, high);\n      namedNode = childList[middle];\n      key = keyFn ? keyFn(namedNode) : (namedNode as unknown as K);\n      return new LLRBNode(\n        key,\n        namedNode.node as unknown as V,\n        LLRBNode.BLACK,\n        left,\n        right\n      );\n    }\n  };\n\n  const buildFrom12Array = function (base12: Base12Num): LLRBNode<K, V> {\n    let node: LLRBNode<K, V> = null;\n    let root = null;\n    let index = childList.length;\n\n    const buildPennant = function (chunkSize: number, color: boolean) {\n      const low = index - chunkSize;\n      const high = index;\n      index -= chunkSize;\n      const childTree = buildBalancedTree(low + 1, high);\n      const namedNode = childList[low];\n      const key: K = keyFn ? keyFn(namedNode) : (namedNode as unknown as K);\n      attachPennant(\n        new LLRBNode(\n          key,\n          namedNode.node as unknown as V,\n          color,\n          null,\n          childTree\n        )\n      );\n    };\n\n    const attachPennant = function (pennant: LLRBNode<K, V>) {\n      if (node) {\n        node.left = pennant;\n        node = pennant;\n      } else {\n        root = pennant;\n        node = pennant;\n      }\n    };\n\n    for (let i = 0; i < base12.count; ++i) {\n      const isOne = base12.nextBitIsOne();\n      // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\n      const chunkSize = Math.pow(2, base12.count - (i + 1));\n      if (isOne) {\n        buildPennant(chunkSize, LLRBNode.BLACK);\n      } else {\n        // current == 2\n        buildPennant(chunkSize, LLRBNode.BLACK);\n        buildPennant(chunkSize, LLRBNode.RED);\n      }\n    }\n    return root;\n  };\n\n  const base12 = new Base12Num(childList.length);\n  const root = buildFrom12Array(base12);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  return new SortedMap<K, V>(mapSortFn || (cmp as any), root);\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 { assert, contains, map, safeGet } from '@firebase/util';\n\nimport { SortedMap } from '../util/SortedMap';\n\nimport { buildChildSet } from './childSet';\nimport { Index } from './indexes/Index';\nimport { KEY_INDEX } from './indexes/KeyIndex';\nimport { PRIORITY_INDEX } from './indexes/PriorityIndex';\nimport { NamedNode, Node } from './Node';\n\nlet _defaultIndexMap: IndexMap;\n\nconst fallbackObject = {};\n\nexport class IndexMap {\n  /**\n   * The default IndexMap for nodes without a priority\n   */\n  static get Default(): IndexMap {\n    assert(\n      fallbackObject && PRIORITY_INDEX,\n      'ChildrenNode.ts has not been loaded'\n    );\n    _defaultIndexMap =\n      _defaultIndexMap ||\n      new IndexMap(\n        { '.priority': fallbackObject },\n        { '.priority': PRIORITY_INDEX }\n      );\n    return _defaultIndexMap;\n  }\n\n  constructor(\n    private indexes_: {\n      [k: string]: SortedMap<NamedNode, Node> | /*FallbackType*/ object;\n    },\n    private indexSet_: { [k: string]: Index }\n  ) {}\n\n  get(indexKey: string): SortedMap<NamedNode, Node> | null {\n    const sortedMap = safeGet(this.indexes_, indexKey);\n    if (!sortedMap) {\n      throw new Error('No index defined for ' + indexKey);\n    }\n\n    if (sortedMap instanceof SortedMap) {\n      return sortedMap;\n    } else {\n      // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\n      // regular child map\n      return null;\n    }\n  }\n\n  hasIndex(indexDefinition: Index): boolean {\n    return contains(this.indexSet_, indexDefinition.toString());\n  }\n\n  addIndex(\n    indexDefinition: Index,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    assert(\n      indexDefinition !== KEY_INDEX,\n      \"KeyIndex always exists and isn't meant to be added to the IndexMap.\"\n    );\n    const childList = [];\n    let sawIndexedValue = false;\n    const iter = existingChildren.getIterator(NamedNode.Wrap);\n    let next = iter.getNext();\n    while (next) {\n      sawIndexedValue =\n        sawIndexedValue || indexDefinition.isDefinedOn(next.node);\n      childList.push(next);\n      next = iter.getNext();\n    }\n    let newIndex;\n    if (sawIndexedValue) {\n      newIndex = buildChildSet(childList, indexDefinition.getCompare());\n    } else {\n      newIndex = fallbackObject;\n    }\n    const indexName = indexDefinition.toString();\n    const newIndexSet = { ...this.indexSet_ };\n    newIndexSet[indexName] = indexDefinition;\n    const newIndexes = { ...this.indexes_ };\n    newIndexes[indexName] = newIndex;\n    return new IndexMap(newIndexes, newIndexSet);\n  }\n\n  /**\n   * Ensure that this node is properly tracked in any indexes that we're maintaining\n   */\n  addToIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>, indexName: string) => {\n        const index = safeGet(this.indexSet_, indexName);\n        assert(index, 'Missing index implementation for ' + indexName);\n        if (indexedChildren === fallbackObject) {\n          // Check to see if we need to index everything\n          if (index.isDefinedOn(namedNode.node)) {\n            // We need to build this index\n            const childList = [];\n            const iter = existingChildren.getIterator(NamedNode.Wrap);\n            let next = iter.getNext();\n            while (next) {\n              if (next.name !== namedNode.name) {\n                childList.push(next);\n              }\n              next = iter.getNext();\n            }\n            childList.push(namedNode);\n            return buildChildSet(childList, index.getCompare());\n          } else {\n            // No change, this remains a fallback\n            return fallbackObject;\n          }\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          let newChildren = indexedChildren;\n          if (existingSnap) {\n            newChildren = newChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          }\n          return newChildren.insert(namedNode, namedNode.node);\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n\n  /**\n   * Create a new IndexMap instance with the given value removed\n   */\n  removeFromIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>) => {\n        if (indexedChildren === fallbackObject) {\n          // This is the fallback. Just return it, nothing to do in this case\n          return indexedChildren;\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          if (existingSnap) {\n            return indexedChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          } else {\n            // No record of this child\n            return indexedChildren;\n          }\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\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\nimport { assert } from '@firebase/util';\n\nimport { Path, pathGetFront, pathGetLength, pathPopFront } from '../util/Path';\nimport { SortedMap, SortedMapIterator } from '../util/SortedMap';\nimport { MAX_NAME, MIN_NAME, sha1 } from '../util/util';\n\nimport { NAME_COMPARATOR } from './comparators';\nimport { Index } from './indexes/Index';\nimport { KEY_INDEX, KeyIndex } from './indexes/KeyIndex';\nimport {\n  PRIORITY_INDEX,\n  setMaxNode as setPriorityMaxNode\n} from './indexes/PriorityIndex';\nimport { IndexMap } from './IndexMap';\nimport { LeafNode } from './LeafNode';\nimport { NamedNode, Node } from './Node';\nimport { priorityHashText, setMaxNode, validatePriorityNode } from './snap';\n\nexport interface ChildrenNodeConstructor {\n  new (\n    children_: SortedMap<string, Node>,\n    priorityNode_: Node | null,\n    indexMap_: IndexMap\n  ): ChildrenNode;\n  EMPTY_NODE: ChildrenNode;\n}\n\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\n\nlet EMPTY_NODE: ChildrenNode;\n\n/**\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\n * (i.e. nodes with children).  It implements Node and stores the\n * list of children in the children property, sorted by child name.\n */\nexport class ChildrenNode implements Node {\n  private lazyHash_: string | null = null;\n\n  static get EMPTY_NODE(): ChildrenNode {\n    return (\n      EMPTY_NODE ||\n      (EMPTY_NODE = new ChildrenNode(\n        new SortedMap<string, Node>(NAME_COMPARATOR),\n        null,\n        IndexMap.Default\n      ))\n    );\n  }\n\n  /**\n   * @param children_ - List of children of this node..\n   * @param priorityNode_ - The priority of this node (as a snapshot node).\n   */\n  constructor(\n    private readonly children_: SortedMap<string, Node>,\n    private readonly priorityNode_: Node | null,\n    private indexMap_: IndexMap\n  ) {\n    /**\n     * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\n     * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\n     * class instead of an empty ChildrenNode.\n     */\n    if (this.priorityNode_) {\n      validatePriorityNode(this.priorityNode_);\n    }\n\n    if (this.children_.isEmpty()) {\n      assert(\n        !this.priorityNode_ || this.priorityNode_.isEmpty(),\n        'An empty node cannot have a priority'\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_ || EMPTY_NODE;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    if (this.children_.isEmpty()) {\n      // Don't allow priorities on empty nodes\n      return this;\n    } else {\n      return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\n    }\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.getPriority();\n    } else {\n      const child = this.children_.get(childName);\n      return child === null ? EMPTY_NODE : child;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    const front = pathGetFront(path);\n    if (front === null) {\n      return this;\n    }\n\n    return this.getImmediateChild(front).getChild(pathPopFront(path));\n  }\n\n  /** @inheritDoc */\n  hasChild(childName: string): boolean {\n    return this.children_.get(childName) !== null;\n  }\n\n  /** @inheritDoc */\n  updateImmediateChild(childName: string, newChildNode: Node): Node {\n    assert(newChildNode, 'We should always be passing snapshot nodes');\n    if (childName === '.priority') {\n      return this.updatePriority(newChildNode);\n    } else {\n      const namedNode = new NamedNode(childName, newChildNode);\n      let newChildren, newIndexMap;\n      if (newChildNode.isEmpty()) {\n        newChildren = this.children_.remove(childName);\n        newIndexMap = this.indexMap_.removeFromIndexes(\n          namedNode,\n          this.children_\n        );\n      } else {\n        newChildren = this.children_.insert(childName, newChildNode);\n        newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\n      }\n\n      const newPriority = newChildren.isEmpty()\n        ? EMPTY_NODE\n        : this.priorityNode_;\n      return new ChildrenNode(newChildren, newPriority, newIndexMap);\n    }\n  }\n\n  /** @inheritDoc */\n  updateChild(path: Path, newChildNode: Node): Node {\n    const front = pathGetFront(path);\n    if (front === null) {\n      return newChildNode;\n    } else {\n      assert(\n        pathGetFront(path) !== '.priority' || pathGetLength(path) === 1,\n        '.priority must be the last token in a path'\n      );\n      const newImmediateChild = this.getImmediateChild(front).updateChild(\n        pathPopFront(path),\n        newChildNode\n      );\n      return this.updateImmediateChild(front, newImmediateChild);\n    }\n  }\n\n  /** @inheritDoc */\n  isEmpty(): boolean {\n    return this.children_.isEmpty();\n  }\n\n  /** @inheritDoc */\n  numChildren(): number {\n    return this.children_.count();\n  }\n\n  private static INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\n\n  /** @inheritDoc */\n  val(exportFormat?: boolean): object {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const obj: { [k: string]: unknown } = {};\n    let numKeys = 0,\n      maxKey = 0,\n      allIntegerKeys = true;\n    this.forEachChild(PRIORITY_INDEX, (key: string, childNode: Node) => {\n      obj[key] = childNode.val(exportFormat);\n\n      numKeys++;\n      if (allIntegerKeys && ChildrenNode.INTEGER_REGEXP_.test(key)) {\n        maxKey = Math.max(maxKey, Number(key));\n      } else {\n        allIntegerKeys = false;\n      }\n    });\n\n    if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\n      // convert to array.\n      const array: unknown[] = [];\n      // eslint-disable-next-line guard-for-in\n      for (const key in obj) {\n        array[key as unknown as number] = obj[key];\n      }\n\n      return array;\n    } else {\n      if (exportFormat && !this.getPriority().isEmpty()) {\n        obj['.priority'] = this.getPriority().val();\n      }\n      return obj;\n    }\n  }\n\n  /** @inheritDoc */\n  hash(): string {\n    if (this.lazyHash_ === null) {\n      let toHash = '';\n      if (!this.getPriority().isEmpty()) {\n        toHash +=\n          'priority:' +\n          priorityHashText(this.getPriority().val() as string | number) +\n          ':';\n      }\n\n      this.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n        const childHash = childNode.hash();\n        if (childHash !== '') {\n          toHash += ':' + key + ':' + childHash;\n        }\n      });\n\n      this.lazyHash_ = toHash === '' ? '' : sha1(toHash);\n    }\n    return this.lazyHash_;\n  }\n\n  /** @inheritDoc */\n  getPredecessorChildName(\n    childName: string,\n    childNode: Node,\n    index: Index\n  ): string {\n    const idx = this.resolveIndex_(index);\n    if (idx) {\n      const predecessor = idx.getPredecessorKey(\n        new NamedNode(childName, childNode)\n      );\n      return predecessor ? predecessor.name : null;\n    } else {\n      return this.children_.getPredecessorKey(childName);\n    }\n  }\n\n  getFirstChildName(indexDefinition: Index): string | null {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      const minKey = idx.minKey();\n      return minKey && minKey.name;\n    } else {\n      return this.children_.minKey();\n    }\n  }\n\n  getFirstChild(indexDefinition: Index): NamedNode | null {\n    const minKey = this.getFirstChildName(indexDefinition);\n    if (minKey) {\n      return new NamedNode(minKey, this.children_.get(minKey));\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Given an index, return the key name of the largest value we have, according to that index\n   */\n  getLastChildName(indexDefinition: Index): string | null {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      const maxKey = idx.maxKey();\n      return maxKey && maxKey.name;\n    } else {\n      return this.children_.maxKey();\n    }\n  }\n\n  getLastChild(indexDefinition: Index): NamedNode | null {\n    const maxKey = this.getLastChildName(indexDefinition);\n    if (maxKey) {\n      return new NamedNode(maxKey, this.children_.get(maxKey));\n    } else {\n      return null;\n    }\n  }\n  forEachChild(\n    index: Index,\n    action: (key: string, node: Node) => boolean | void\n  ): boolean {\n    const idx = this.resolveIndex_(index);\n    if (idx) {\n      return idx.inorderTraversal(wrappedNode => {\n        return action(wrappedNode.name, wrappedNode.node);\n      });\n    } else {\n      return this.children_.inorderTraversal(action);\n    }\n  }\n\n  getIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n  }\n\n  getIteratorFrom(\n    startPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getIteratorFrom(startPost, key => key);\n    } else {\n      const iterator = this.children_.getIteratorFrom(\n        startPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, startPost) < 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n\n  getReverseIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getReverseIteratorFrom(\n      indexDefinition.maxPost(),\n      indexDefinition\n    );\n  }\n\n  getReverseIteratorFrom(\n    endPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getReverseIteratorFrom(endPost, key => {\n        return key;\n      });\n    } else {\n      const iterator = this.children_.getReverseIteratorFrom(\n        endPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, endPost) > 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n  compareTo(other: ChildrenNode): number {\n    if (this.isEmpty()) {\n      if (other.isEmpty()) {\n        return 0;\n      } else {\n        return -1;\n      }\n    } else if (other.isLeafNode() || other.isEmpty()) {\n      return 1;\n    } else if (other === MAX_NODE) {\n      return -1;\n    } else {\n      // Must be another node with children.\n      return 0;\n    }\n  }\n  withIndex(indexDefinition: Index): Node {\n    if (\n      indexDefinition === KEY_INDEX ||\n      this.indexMap_.hasIndex(indexDefinition)\n    ) {\n      return this;\n    } else {\n      const newIndexMap = this.indexMap_.addIndex(\n        indexDefinition,\n        this.children_\n      );\n      return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\n    }\n  }\n  isIndexed(index: Index): boolean {\n    return index === KEY_INDEX || this.indexMap_.hasIndex(index);\n  }\n  equals(other: Node): boolean {\n    if (other === this) {\n      return true;\n    } else if (other.isLeafNode()) {\n      return false;\n    } else {\n      const otherChildrenNode = other as ChildrenNode;\n      if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\n        return false;\n      } else if (\n        this.children_.count() === otherChildrenNode.children_.count()\n      ) {\n        const thisIter = this.getIterator(PRIORITY_INDEX);\n        const otherIter = otherChildrenNode.getIterator(PRIORITY_INDEX);\n        let thisCurrent = thisIter.getNext();\n        let otherCurrent = otherIter.getNext();\n        while (thisCurrent && otherCurrent) {\n          if (\n            thisCurrent.name !== otherCurrent.name ||\n            !thisCurrent.node.equals(otherCurrent.node)\n          ) {\n            return false;\n          }\n          thisCurrent = thisIter.getNext();\n          otherCurrent = otherIter.getNext();\n        }\n        return thisCurrent === null && otherCurrent === null;\n      } else {\n        return false;\n      }\n    }\n  }\n\n  /**\n   * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\n   * instead.\n   *\n   */\n  private resolveIndex_(\n    indexDefinition: Index\n  ): SortedMap<NamedNode, Node> | null {\n    if (indexDefinition === KEY_INDEX) {\n      return null;\n    } else {\n      return this.indexMap_.get(indexDefinition.toString());\n    }\n  }\n}\n\nexport class MaxNode extends ChildrenNode {\n  constructor() {\n    super(\n      new SortedMap<string, Node>(NAME_COMPARATOR),\n      ChildrenNode.EMPTY_NODE,\n      IndexMap.Default\n    );\n  }\n\n  compareTo(other: Node): number {\n    if (other === this) {\n      return 0;\n    } else {\n      return 1;\n    }\n  }\n\n  equals(other: Node): boolean {\n    // Not that we every compare it, but MAX_NODE is only ever equal to itself\n    return other === this;\n  }\n\n  getPriority(): MaxNode {\n    return this;\n  }\n\n  getImmediateChild(childName: string): ChildrenNode {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  isEmpty(): boolean {\n    return false;\n  }\n}\n\n/**\n * Marker that will sort higher than any other snapshot.\n */\nexport const MAX_NODE = new MaxNode();\n\n/**\n * Document NamedNode extensions\n */\ndeclare module './Node' {\n  interface NamedNode {\n    MIN: NamedNode;\n    MAX: NamedNode;\n  }\n}\n\nObject.defineProperties(NamedNode, {\n  MIN: {\n    value: new NamedNode(MIN_NAME, ChildrenNode.EMPTY_NODE)\n  },\n  MAX: {\n    value: new NamedNode(MAX_NAME, MAX_NODE)\n  }\n});\n\n/**\n * Reference Extensions\n */\nKeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode.__childrenNodeConstructor = ChildrenNode;\nsetMaxNode(MAX_NODE);\nsetPriorityMaxNode(MAX_NODE);\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 { contains, assert } from '@firebase/util';\n\nimport { Indexable } from '../util/misc';\nimport { SortedMap } from '../util/SortedMap';\nimport { each } from '../util/util';\n\nimport { ChildrenNode } from './ChildrenNode';\nimport { buildChildSet } from './childSet';\nimport { NAME_COMPARATOR, NAME_ONLY_COMPARATOR } from './comparators';\nimport { PRIORITY_INDEX, setNodeFromJSON } from './indexes/PriorityIndex';\nimport { IndexMap } from './IndexMap';\nimport { LeafNode } from './LeafNode';\nimport { NamedNode, Node } from './Node';\n\nconst USE_HINZE = true;\n\n/**\n * Constructs a snapshot node representing the passed JSON and returns it.\n * @param json - JSON to create a node for.\n * @param priority - Optional priority to use.  This will be ignored if the\n * passed JSON contains a .priority property.\n */\nexport function nodeFromJSON(\n  json: unknown | null,\n  priority: unknown = null\n): Node {\n  if (json === null) {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  if (typeof json === 'object' && '.priority' in json) {\n    priority = json['.priority'];\n  }\n\n  assert(\n    priority === null ||\n      typeof priority === 'string' ||\n      typeof priority === 'number' ||\n      (typeof priority === 'object' && '.sv' in (priority as object)),\n    'Invalid priority type found: ' + typeof priority\n  );\n\n  if (typeof json === 'object' && '.value' in json && json['.value'] !== null) {\n    json = json['.value'];\n  }\n\n  // Valid leaf nodes include non-objects or server-value wrapper objects\n  if (typeof json !== 'object' || '.sv' in json) {\n    const jsonLeaf = json as string | number | boolean | Indexable;\n    return new LeafNode(jsonLeaf, nodeFromJSON(priority));\n  }\n\n  if (!(json instanceof Array) && USE_HINZE) {\n    const children: NamedNode[] = [];\n    let childrenHavePriority = false;\n    const hinzeJsonObj = json;\n    each(hinzeJsonObj, (key, child) => {\n      if (key.substring(0, 1) !== '.') {\n        // Ignore metadata nodes\n        const childNode = nodeFromJSON(child);\n        if (!childNode.isEmpty()) {\n          childrenHavePriority =\n            childrenHavePriority || !childNode.getPriority().isEmpty();\n          children.push(new NamedNode(key, childNode));\n        }\n      }\n    });\n\n    if (children.length === 0) {\n      return ChildrenNode.EMPTY_NODE;\n    }\n\n    const childSet = buildChildSet(\n      children,\n      NAME_ONLY_COMPARATOR,\n      namedNode => namedNode.name,\n      NAME_COMPARATOR\n    ) as SortedMap<string, Node>;\n    if (childrenHavePriority) {\n      const sortedChildSet = buildChildSet(\n        children,\n        PRIORITY_INDEX.getCompare()\n      );\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        new IndexMap(\n          { '.priority': sortedChildSet },\n          { '.priority': PRIORITY_INDEX }\n        )\n      );\n    } else {\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        IndexMap.Default\n      );\n    }\n  } else {\n    let node: Node = ChildrenNode.EMPTY_NODE;\n    each(json, (key: string, childData: unknown) => {\n      if (contains(json as object, key)) {\n        if (key.substring(0, 1) !== '.') {\n          // ignore metadata nodes.\n          const childNode = nodeFromJSON(childData);\n          if (childNode.isLeafNode() || !childNode.isEmpty()) {\n            node = node.updateImmediateChild(key, childNode);\n          }\n        }\n      }\n    });\n\n    return node.updatePriority(nodeFromJSON(priority));\n  }\n}\n\nsetNodeFromJSON(nodeFromJSON);\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 { assert } from '@firebase/util';\n\nimport { Path, pathGetFront, pathIsEmpty, pathSlice } from '../../util/Path';\nimport { MAX_NAME, nameCompare } from '../../util/util';\nimport { ChildrenNode, MAX_NODE } from '../ChildrenNode';\nimport { NamedNode, Node } from '../Node';\nimport { nodeFromJSON } from '../nodeFromJSON';\n\nimport { Index } from './Index';\n\nexport class PathIndex extends Index {\n  constructor(private indexPath_: Path) {\n    super();\n\n    assert(\n      !pathIsEmpty(indexPath_) && pathGetFront(indexPath_) !== '.priority',\n      \"Can't create PathIndex with empty path or .priority key\"\n    );\n  }\n\n  protected extractChild(snap: Node): Node {\n    return snap.getChild(this.indexPath_);\n  }\n  isDefinedOn(node: Node): boolean {\n    return !node.getChild(this.indexPath_).isEmpty();\n  }\n  compare(a: NamedNode, b: NamedNode): number {\n    const aChild = this.extractChild(a.node);\n    const bChild = this.extractChild(b.node);\n    const indexCmp = aChild.compareTo(bChild);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n  makePost(indexValue: object, name: string): NamedNode {\n    const valueNode = nodeFromJSON(indexValue);\n    const node = ChildrenNode.EMPTY_NODE.updateChild(\n      this.indexPath_,\n      valueNode\n    );\n    return new NamedNode(name, node);\n  }\n  maxPost(): NamedNode {\n    const node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, MAX_NODE);\n    return new NamedNode(MAX_NAME, node);\n  }\n  toString(): string {\n    return pathSlice(this.indexPath_, 0).join('/');\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\nimport { nameCompare } from '../../util/util';\nimport { NamedNode, Node } from '../Node';\nimport { nodeFromJSON } from '../nodeFromJSON';\n\nimport { Index } from './Index';\n\nexport class ValueIndex extends Index {\n  compare(a: NamedNode, b: NamedNode): number {\n    const indexCmp = a.node.compareTo(b.node);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n  isDefinedOn(node: Node): boolean {\n    return true;\n  }\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return !oldNode.equals(newNode);\n  }\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n  maxPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MAX;\n  }\n\n  makePost(indexValue: object, name: string): NamedNode {\n    const valueNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, valueNode);\n  }\n\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.value';\n  }\n}\n\nexport const VALUE_INDEX = new ValueIndex();\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 { Node } from '../snap/Node';\n\nexport const enum ChangeType {\n  /** Event type for a child added */\n  CHILD_ADDED = 'child_added',\n  /** Event type for a child removed */\n  CHILD_REMOVED = 'child_removed',\n  /** Event type for a child changed */\n  CHILD_CHANGED = 'child_changed',\n  /** Event type for a child moved */\n  CHILD_MOVED = 'child_moved',\n  /** Event type for a value change */\n  VALUE = 'value'\n}\n\nexport interface Change {\n  /** @param type - The event type */\n  type: ChangeType;\n  /** @param snapshotNode - The data */\n  snapshotNode: Node;\n  /** @param childName - The name for this child, if it's a child even */\n  childName?: string;\n  /** @param oldSnap - Used for intermediate processing of child changed events */\n  oldSnap?: Node;\n  /**  * @param prevName - The name for the previous child, if applicable */\n  prevName?: string | null;\n}\n\nexport function changeValue(snapshotNode: Node): Change {\n  return { type: ChangeType.VALUE, snapshotNode };\n}\n\nexport function changeChildAdded(\n  childName: string,\n  snapshotNode: Node\n): Change {\n  return { type: ChangeType.CHILD_ADDED, snapshotNode, childName };\n}\n\nexport function changeChildRemoved(\n  childName: string,\n  snapshotNode: Node\n): Change {\n  return { type: ChangeType.CHILD_REMOVED, snapshotNode, childName };\n}\n\nexport function changeChildChanged(\n  childName: string,\n  snapshotNode: Node,\n  oldSnap: Node\n): Change {\n  return {\n    type: ChangeType.CHILD_CHANGED,\n    snapshotNode,\n    childName,\n    oldSnap\n  };\n}\n\nexport function changeChildMoved(\n  childName: string,\n  snapshotNode: Node\n): Change {\n  return { type: ChangeType.CHILD_MOVED, snapshotNode, childName };\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 { assert } from '@firebase/util';\n\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Index } from '../../snap/indexes/Index';\nimport { PRIORITY_INDEX } from '../../snap/indexes/PriorityIndex';\nimport { Node } from '../../snap/Node';\nimport { Path } from '../../util/Path';\nimport {\n  changeChildAdded,\n  changeChildChanged,\n  changeChildRemoved\n} from '../Change';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { CompleteChildSource } from '../CompleteChildSource';\n\nimport { NodeFilter } from './NodeFilter';\n\n/**\n * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\n */\nexport class IndexedFilter implements NodeFilter {\n  constructor(private readonly index_: Index) {}\n\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    assert(\n      snap.isIndexed(this.index_),\n      'A node must be indexed if only a child is updated'\n    );\n    const oldChild = snap.getImmediateChild(key);\n    // Check if anything actually changed.\n    if (\n      oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))\n    ) {\n      // There's an edge case where a child can enter or leave the view because affectedPath was set to null.\n      // In this case, affectedPath will appear null in both the old and new snapshots.  So we need\n      // to avoid treating these cases as \"nothing changed.\"\n      if (oldChild.isEmpty() === newChild.isEmpty()) {\n        // Nothing changed.\n\n        // This assert should be valid, but it's expensive (can dominate perf testing) so don't actually do it.\n        //assert(oldChild.equals(newChild), 'Old and new snapshots should be equal.');\n        return snap;\n      }\n    }\n\n    if (optChangeAccumulator != null) {\n      if (newChild.isEmpty()) {\n        if (snap.hasChild(key)) {\n          optChangeAccumulator.trackChildChange(\n            changeChildRemoved(key, oldChild)\n          );\n        } else {\n          assert(\n            snap.isLeafNode(),\n            'A child remove without an old child only makes sense on a leaf node'\n          );\n        }\n      } else if (oldChild.isEmpty()) {\n        optChangeAccumulator.trackChildChange(changeChildAdded(key, newChild));\n      } else {\n        optChangeAccumulator.trackChildChange(\n          changeChildChanged(key, newChild, oldChild)\n        );\n      }\n    }\n    if (snap.isLeafNode() && newChild.isEmpty()) {\n      return snap;\n    } else {\n      // Make sure the node is indexed\n      return snap.updateImmediateChild(key, newChild).withIndex(this.index_);\n    }\n  }\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (optChangeAccumulator != null) {\n      if (!oldSnap.isLeafNode()) {\n        oldSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (!newSnap.hasChild(key)) {\n            optChangeAccumulator.trackChildChange(\n              changeChildRemoved(key, childNode)\n            );\n          }\n        });\n      }\n      if (!newSnap.isLeafNode()) {\n        newSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (oldSnap.hasChild(key)) {\n            const oldChild = oldSnap.getImmediateChild(key);\n            if (!oldChild.equals(childNode)) {\n              optChangeAccumulator.trackChildChange(\n                changeChildChanged(key, childNode, oldChild)\n              );\n            }\n          } else {\n            optChangeAccumulator.trackChildChange(\n              changeChildAdded(key, childNode)\n            );\n          }\n        });\n      }\n    }\n    return newSnap.withIndex(this.index_);\n  }\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    if (oldSnap.isEmpty()) {\n      return ChildrenNode.EMPTY_NODE;\n    } else {\n      return oldSnap.updatePriority(newPriority);\n    }\n  }\n  filtersNodes(): boolean {\n    return false;\n  }\n  getIndexedFilter(): IndexedFilter {\n    return this;\n  }\n  getIndex(): Index {\n    return this.index_;\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\nimport { NamedNode, Node } from '../../../core/snap/Node';\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Index } from '../../snap/indexes/Index';\nimport { PRIORITY_INDEX } from '../../snap/indexes/PriorityIndex';\nimport { Path } from '../../util/Path';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { QueryParams } from '../QueryParams';\n\nimport { IndexedFilter } from './IndexedFilter';\nimport { NodeFilter } from './NodeFilter';\n\n/**\n * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\n */\nexport class RangedFilter implements NodeFilter {\n  private indexedFilter_: IndexedFilter;\n\n  private index_: Index;\n\n  private startPost_: NamedNode;\n\n  private endPost_: NamedNode;\n\n  private startIsInclusive_: boolean;\n\n  private endIsInclusive_: boolean;\n\n  constructor(params: QueryParams) {\n    this.indexedFilter_ = new IndexedFilter(params.getIndex());\n    this.index_ = params.getIndex();\n    this.startPost_ = RangedFilter.getStartPost_(params);\n    this.endPost_ = RangedFilter.getEndPost_(params);\n    this.startIsInclusive_ = !params.startAfterSet_;\n    this.endIsInclusive_ = !params.endBeforeSet_;\n  }\n\n  getStartPost(): NamedNode {\n    return this.startPost_;\n  }\n\n  getEndPost(): NamedNode {\n    return this.endPost_;\n  }\n\n  matches(node: NamedNode): boolean {\n    const isWithinStart = this.startIsInclusive_\n      ? this.index_.compare(this.getStartPost(), node) <= 0\n      : this.index_.compare(this.getStartPost(), node) < 0;\n    const isWithinEnd = this.endIsInclusive_\n      ? this.index_.compare(node, this.getEndPost()) <= 0\n      : this.index_.compare(node, this.getEndPost()) < 0;\n    return isWithinStart && isWithinEnd;\n  }\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (!this.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    return this.indexedFilter_.updateChild(\n      snap,\n      key,\n      newChild,\n      affectedPath,\n      source,\n      optChangeAccumulator\n    );\n  }\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (newSnap.isLeafNode()) {\n      // Make sure we have a children node with the correct index, not a leaf node;\n      newSnap = ChildrenNode.EMPTY_NODE;\n    }\n    let filtered = newSnap.withIndex(this.index_);\n    // Don't support priorities on queries\n    filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);\n    const self = this;\n    newSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n      if (!self.matches(new NamedNode(key, childNode))) {\n        filtered = filtered.updateImmediateChild(key, ChildrenNode.EMPTY_NODE);\n      }\n    });\n    return this.indexedFilter_.updateFullNode(\n      oldSnap,\n      filtered,\n      optChangeAccumulator\n    );\n  }\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n  filtersNodes(): boolean {\n    return true;\n  }\n  getIndexedFilter(): IndexedFilter {\n    return this.indexedFilter_;\n  }\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  private static getStartPost_(params: QueryParams): NamedNode {\n    if (params.hasStart()) {\n      const startName = params.getIndexStartName();\n      return params.getIndex().makePost(params.getIndexStartValue(), startName);\n    } else {\n      return params.getIndex().minPost();\n    }\n  }\n\n  private static getEndPost_(params: QueryParams): NamedNode {\n    if (params.hasEnd()) {\n      const endName = params.getIndexEndName();\n      return params.getIndex().makePost(params.getIndexEndValue(), endName);\n    } else {\n      return params.getIndex().maxPost();\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\nimport { assert } from '@firebase/util';\n\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Index } from '../../snap/indexes/Index';\nimport { NamedNode, Node } from '../../snap/Node';\nimport { Path } from '../../util/Path';\nimport {\n  changeChildAdded,\n  changeChildChanged,\n  changeChildRemoved\n} from '../Change';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { QueryParams } from '../QueryParams';\n\nimport { IndexedFilter } from './IndexedFilter';\nimport { NodeFilter } from './NodeFilter';\nimport { RangedFilter } from './RangedFilter';\n\n/**\n * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\n */\nexport class LimitedFilter implements NodeFilter {\n  private readonly rangedFilter_: RangedFilter;\n\n  private readonly index_: Index;\n\n  private readonly limit_: number;\n\n  private readonly reverse_: boolean;\n\n  private readonly startIsInclusive_: boolean;\n\n  private readonly endIsInclusive_: boolean;\n\n  constructor(params: QueryParams) {\n    this.rangedFilter_ = new RangedFilter(params);\n    this.index_ = params.getIndex();\n    this.limit_ = params.getLimit();\n    this.reverse_ = !params.isViewFromLeft();\n    this.startIsInclusive_ = !params.startAfterSet_;\n    this.endIsInclusive_ = !params.endBeforeSet_;\n  }\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (!this.rangedFilter_.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    if (snap.getImmediateChild(key).equals(newChild)) {\n      // No change\n      return snap;\n    } else if (snap.numChildren() < this.limit_) {\n      return this.rangedFilter_\n        .getIndexedFilter()\n        .updateChild(\n          snap,\n          key,\n          newChild,\n          affectedPath,\n          source,\n          optChangeAccumulator\n        );\n    } else {\n      return this.fullLimitUpdateChild_(\n        snap,\n        key,\n        newChild,\n        source,\n        optChangeAccumulator\n      );\n    }\n  }\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    let filtered;\n    if (newSnap.isLeafNode() || newSnap.isEmpty()) {\n      // Make sure we have a children node with the correct index, not a leaf node;\n      filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n    } else {\n      if (\n        this.limit_ * 2 < newSnap.numChildren() &&\n        newSnap.isIndexed(this.index_)\n      ) {\n        // Easier to build up a snapshot, since what we're given has more than twice the elements we want\n        filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n        // anchor to the startPost, endPost, or last element as appropriate\n        let iterator;\n        if (this.reverse_) {\n          iterator = (newSnap as ChildrenNode).getReverseIteratorFrom(\n            this.rangedFilter_.getEndPost(),\n            this.index_\n          );\n        } else {\n          iterator = (newSnap as ChildrenNode).getIteratorFrom(\n            this.rangedFilter_.getStartPost(),\n            this.index_\n          );\n        }\n        let count = 0;\n        while (iterator.hasNext() && count < this.limit_) {\n          const next = iterator.getNext();\n          if (!this.withinDirectionalStart(next)) {\n            // if we have not reached the start, skip to the next element\n            continue;\n          } else if (!this.withinDirectionalEnd(next)) {\n            // if we have reached the end, stop adding elements\n            break;\n          } else {\n            filtered = filtered.updateImmediateChild(next.name, next.node);\n            count++;\n          }\n        }\n      } else {\n        // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\n        filtered = newSnap.withIndex(this.index_);\n        // Don't support priorities on queries\n        filtered = filtered.updatePriority(\n          ChildrenNode.EMPTY_NODE\n        ) as ChildrenNode;\n\n        let iterator;\n        if (this.reverse_) {\n          iterator = filtered.getReverseIterator(this.index_);\n        } else {\n          iterator = filtered.getIterator(this.index_);\n        }\n\n        let count = 0;\n        while (iterator.hasNext()) {\n          const next = iterator.getNext();\n          const inRange =\n            count < this.limit_ &&\n            this.withinDirectionalStart(next) &&\n            this.withinDirectionalEnd(next);\n          if (inRange) {\n            count++;\n          } else {\n            filtered = filtered.updateImmediateChild(\n              next.name,\n              ChildrenNode.EMPTY_NODE\n            );\n          }\n        }\n      }\n    }\n    return this.rangedFilter_\n      .getIndexedFilter()\n      .updateFullNode(oldSnap, filtered, optChangeAccumulator);\n  }\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n  filtersNodes(): boolean {\n    return true;\n  }\n  getIndexedFilter(): IndexedFilter {\n    return this.rangedFilter_.getIndexedFilter();\n  }\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  private fullLimitUpdateChild_(\n    snap: Node,\n    childKey: string,\n    childSnap: Node,\n    source: CompleteChildSource,\n    changeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    // TODO: rename all cache stuff etc to general snap terminology\n    let cmp;\n    if (this.reverse_) {\n      const indexCmp = this.index_.getCompare();\n      cmp = (a: NamedNode, b: NamedNode) => indexCmp(b, a);\n    } else {\n      cmp = this.index_.getCompare();\n    }\n    const oldEventCache = snap as ChildrenNode;\n    assert(oldEventCache.numChildren() === this.limit_, '');\n    const newChildNamedNode = new NamedNode(childKey, childSnap);\n    const windowBoundary = this.reverse_\n      ? oldEventCache.getFirstChild(this.index_)\n      : (oldEventCache.getLastChild(this.index_) as NamedNode);\n    const inRange = this.rangedFilter_.matches(newChildNamedNode);\n    if (oldEventCache.hasChild(childKey)) {\n      const oldChildSnap = oldEventCache.getImmediateChild(childKey);\n      let nextChild = source.getChildAfterChild(\n        this.index_,\n        windowBoundary,\n        this.reverse_\n      );\n      while (\n        nextChild != null &&\n        (nextChild.name === childKey || oldEventCache.hasChild(nextChild.name))\n      ) {\n        // There is a weird edge case where a node is updated as part of a merge in the write tree, but hasn't\n        // been applied to the limited filter yet. Ignore this next child which will be updated later in\n        // the limited filter...\n        nextChild = source.getChildAfterChild(\n          this.index_,\n          nextChild,\n          this.reverse_\n        );\n      }\n      const compareNext =\n        nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\n      const remainsInWindow =\n        inRange && !childSnap.isEmpty() && compareNext >= 0;\n      if (remainsInWindow) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            changeChildChanged(childKey, childSnap, oldChildSnap)\n          );\n        }\n        return oldEventCache.updateImmediateChild(childKey, childSnap);\n      } else {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            changeChildRemoved(childKey, oldChildSnap)\n          );\n        }\n        const newEventCache = oldEventCache.updateImmediateChild(\n          childKey,\n          ChildrenNode.EMPTY_NODE\n        );\n        const nextChildInRange =\n          nextChild != null && this.rangedFilter_.matches(nextChild);\n        if (nextChildInRange) {\n          if (changeAccumulator != null) {\n            changeAccumulator.trackChildChange(\n              changeChildAdded(nextChild.name, nextChild.node)\n            );\n          }\n          return newEventCache.updateImmediateChild(\n            nextChild.name,\n            nextChild.node\n          );\n        } else {\n          return newEventCache;\n        }\n      }\n    } else if (childSnap.isEmpty()) {\n      // we're deleting a node, but it was not in the window, so ignore it\n      return snap;\n    } else if (inRange) {\n      if (cmp(windowBoundary, newChildNamedNode) >= 0) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            changeChildRemoved(windowBoundary.name, windowBoundary.node)\n          );\n          changeAccumulator.trackChildChange(\n            changeChildAdded(childKey, childSnap)\n          );\n        }\n        return oldEventCache\n          .updateImmediateChild(childKey, childSnap)\n          .updateImmediateChild(windowBoundary.name, ChildrenNode.EMPTY_NODE);\n      } else {\n        return snap;\n      }\n    } else {\n      return snap;\n    }\n  }\n\n  private withinDirectionalStart = (node: NamedNode) =>\n    this.reverse_ ? this.withinEndPost(node) : this.withinStartPost(node);\n\n  private withinDirectionalEnd = (node: NamedNode) =>\n    this.reverse_ ? this.withinStartPost(node) : this.withinEndPost(node);\n\n  private withinStartPost = (node: NamedNode) => {\n    const compareRes = this.index_.compare(\n      this.rangedFilter_.getStartPost(),\n      node\n    );\n    return this.startIsInclusive_ ? compareRes <= 0 : compareRes < 0;\n  };\n\n  private withinEndPost = (node: NamedNode) => {\n    const compareRes = this.index_.compare(\n      node,\n      this.rangedFilter_.getEndPost()\n    );\n    return this.endIsInclusive_ ? compareRes <= 0 : compareRes < 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\nimport { assert, stringify } from '@firebase/util';\n\nimport { Index } from '../snap/indexes/Index';\nimport { KEY_INDEX } from '../snap/indexes/KeyIndex';\nimport { PathIndex } from '../snap/indexes/PathIndex';\nimport { PRIORITY_INDEX, PriorityIndex } from '../snap/indexes/PriorityIndex';\nimport { VALUE_INDEX } from '../snap/indexes/ValueIndex';\nimport { MAX_NAME, MIN_NAME } from '../util/util';\n\nimport { IndexedFilter } from './filter/IndexedFilter';\nimport { LimitedFilter } from './filter/LimitedFilter';\nimport { NodeFilter } from './filter/NodeFilter';\nimport { RangedFilter } from './filter/RangedFilter';\n\n/**\n * Wire Protocol Constants\n */\nconst enum WIRE_PROTOCOL_CONSTANTS {\n  INDEX_START_VALUE = 'sp',\n  INDEX_START_NAME = 'sn',\n  INDEX_START_IS_INCLUSIVE = 'sin',\n  INDEX_END_VALUE = 'ep',\n  INDEX_END_NAME = 'en',\n  INDEX_END_IS_INCLUSIVE = 'ein',\n  LIMIT = 'l',\n  VIEW_FROM = 'vf',\n  VIEW_FROM_LEFT = 'l',\n  VIEW_FROM_RIGHT = 'r',\n  INDEX = 'i'\n}\n\n/**\n * REST Query Constants\n */\nconst enum REST_QUERY_CONSTANTS {\n  ORDER_BY = 'orderBy',\n  PRIORITY_INDEX = '$priority',\n  VALUE_INDEX = '$value',\n  KEY_INDEX = '$key',\n  START_AFTER = 'startAfter',\n  START_AT = 'startAt',\n  END_AT = 'endAt',\n  END_BEFORE = 'endBefore',\n  LIMIT_TO_FIRST = 'limitToFirst',\n  LIMIT_TO_LAST = 'limitToLast'\n}\n\n/**\n * This class is an immutable-from-the-public-api struct containing a set of query parameters defining a\n * range to be returned for a particular location. It is assumed that validation of parameters is done at the\n * user-facing API level, so it is not done here.\n *\n * @internal\n */\nexport class QueryParams {\n  limitSet_ = false;\n  startSet_ = false;\n  startNameSet_ = false;\n  startAfterSet_ = false; // can only be true if startSet_ is true\n  endSet_ = false;\n  endNameSet_ = false;\n  endBeforeSet_ = false; // can only be true if endSet_ is true\n  limit_ = 0;\n  viewFrom_ = '';\n  indexStartValue_: unknown | null = null;\n  indexStartName_ = '';\n  indexEndValue_: unknown | null = null;\n  indexEndName_ = '';\n  index_: PriorityIndex = PRIORITY_INDEX;\n\n  hasStart(): boolean {\n    return this.startSet_;\n  }\n\n  /**\n   * @returns True if it would return from left.\n   */\n  isViewFromLeft(): boolean {\n    if (this.viewFrom_ === '') {\n      // limit(), rather than limitToFirst or limitToLast was called.\n      // This means that only one of startSet_ and endSet_ is true. Use them\n      // to calculate which side of the view to anchor to. If neither is set,\n      // anchor to the end.\n      return this.startSet_;\n    } else {\n      return this.viewFrom_ === WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n    }\n  }\n\n  /**\n   * Only valid to call if hasStart() returns true\n   */\n  getIndexStartValue(): unknown {\n    assert(this.startSet_, 'Only valid if start has been set');\n    return this.indexStartValue_;\n  }\n\n  /**\n   * Only valid to call if hasStart() returns true.\n   * Returns the starting key name for the range defined by these query parameters\n   */\n  getIndexStartName(): string {\n    assert(this.startSet_, 'Only valid if start has been set');\n    if (this.startNameSet_) {\n      return this.indexStartName_;\n    } else {\n      return MIN_NAME;\n    }\n  }\n\n  hasEnd(): boolean {\n    return this.endSet_;\n  }\n\n  /**\n   * Only valid to call if hasEnd() returns true.\n   */\n  getIndexEndValue(): unknown {\n    assert(this.endSet_, 'Only valid if end has been set');\n    return this.indexEndValue_;\n  }\n\n  /**\n   * Only valid to call if hasEnd() returns true.\n   * Returns the end key name for the range defined by these query parameters\n   */\n  getIndexEndName(): string {\n    assert(this.endSet_, 'Only valid if end has been set');\n    if (this.endNameSet_) {\n      return this.indexEndName_;\n    } else {\n      return MAX_NAME;\n    }\n  }\n\n  hasLimit(): boolean {\n    return this.limitSet_;\n  }\n\n  /**\n   * @returns True if a limit has been set and it has been explicitly anchored\n   */\n  hasAnchoredLimit(): boolean {\n    return this.limitSet_ && this.viewFrom_ !== '';\n  }\n\n  /**\n   * Only valid to call if hasLimit() returns true\n   */\n  getLimit(): number {\n    assert(this.limitSet_, 'Only valid if limit has been set');\n    return this.limit_;\n  }\n\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  loadsAllData(): boolean {\n    return !(this.startSet_ || this.endSet_ || this.limitSet_);\n  }\n\n  isDefault(): boolean {\n    return this.loadsAllData() && this.index_ === PRIORITY_INDEX;\n  }\n\n  copy(): QueryParams {\n    const copy = new QueryParams();\n    copy.limitSet_ = this.limitSet_;\n    copy.limit_ = this.limit_;\n    copy.startSet_ = this.startSet_;\n    copy.startAfterSet_ = this.startAfterSet_;\n    copy.indexStartValue_ = this.indexStartValue_;\n    copy.startNameSet_ = this.startNameSet_;\n    copy.indexStartName_ = this.indexStartName_;\n    copy.endSet_ = this.endSet_;\n    copy.endBeforeSet_ = this.endBeforeSet_;\n    copy.indexEndValue_ = this.indexEndValue_;\n    copy.endNameSet_ = this.endNameSet_;\n    copy.indexEndName_ = this.indexEndName_;\n    copy.index_ = this.index_;\n    copy.viewFrom_ = this.viewFrom_;\n    return copy;\n  }\n}\n\nexport function queryParamsGetNodeFilter(queryParams: QueryParams): NodeFilter {\n  if (queryParams.loadsAllData()) {\n    return new IndexedFilter(queryParams.getIndex());\n  } else if (queryParams.hasLimit()) {\n    return new LimitedFilter(queryParams);\n  } else {\n    return new RangedFilter(queryParams);\n  }\n}\n\nexport function queryParamsLimit(\n  queryParams: QueryParams,\n  newLimit: number\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = '';\n  return newParams;\n}\n\nexport function queryParamsLimitToFirst(\n  queryParams: QueryParams,\n  newLimit: number\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n  return newParams;\n}\n\nexport function queryParamsLimitToLast(\n  queryParams: QueryParams,\n  newLimit: number\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n  return newParams;\n}\n\nexport function queryParamsStartAt(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.startSet_ = true;\n  if (indexValue === undefined) {\n    indexValue = null;\n  }\n  newParams.indexStartValue_ = indexValue;\n  if (key != null) {\n    newParams.startNameSet_ = true;\n    newParams.indexStartName_ = key;\n  } else {\n    newParams.startNameSet_ = false;\n    newParams.indexStartName_ = '';\n  }\n  return newParams;\n}\n\nexport function queryParamsStartAfter(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  let params: QueryParams;\n  if (queryParams.index_ === KEY_INDEX || !!key) {\n    params = queryParamsStartAt(queryParams, indexValue, key);\n  } else {\n    params = queryParamsStartAt(queryParams, indexValue, MAX_NAME);\n  }\n  params.startAfterSet_ = true;\n  return params;\n}\n\nexport function queryParamsEndAt(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.endSet_ = true;\n  if (indexValue === undefined) {\n    indexValue = null;\n  }\n  newParams.indexEndValue_ = indexValue;\n  if (key !== undefined) {\n    newParams.endNameSet_ = true;\n    newParams.indexEndName_ = key;\n  } else {\n    newParams.endNameSet_ = false;\n    newParams.indexEndName_ = '';\n  }\n  return newParams;\n}\n\nexport function queryParamsEndBefore(\n  queryParams: QueryParams,\n  indexValue: unknown,\n  key?: string | null\n): QueryParams {\n  let params: QueryParams;\n  if (queryParams.index_ === KEY_INDEX || !!key) {\n    params = queryParamsEndAt(queryParams, indexValue, key);\n  } else {\n    params = queryParamsEndAt(queryParams, indexValue, MIN_NAME);\n  }\n  params.endBeforeSet_ = true;\n  return params;\n}\n\nexport function queryParamsOrderBy(\n  queryParams: QueryParams,\n  index: Index\n): QueryParams {\n  const newParams = queryParams.copy();\n  newParams.index_ = index;\n  return newParams;\n}\n\n/**\n * Returns a set of REST query string parameters representing this query.\n *\n * @returns query string parameters\n */\nexport function queryParamsToRestQueryStringParameters(\n  queryParams: QueryParams\n): Record<string, string | number> {\n  const qs: Record<string, string | number> = {};\n\n  if (queryParams.isDefault()) {\n    return qs;\n  }\n\n  let orderBy;\n  if (queryParams.index_ === PRIORITY_INDEX) {\n    orderBy = REST_QUERY_CONSTANTS.PRIORITY_INDEX;\n  } else if (queryParams.index_ === VALUE_INDEX) {\n    orderBy = REST_QUERY_CONSTANTS.VALUE_INDEX;\n  } else if (queryParams.index_ === KEY_INDEX) {\n    orderBy = REST_QUERY_CONSTANTS.KEY_INDEX;\n  } else {\n    assert(queryParams.index_ instanceof PathIndex, 'Unrecognized index type!');\n    orderBy = queryParams.index_.toString();\n  }\n  qs[REST_QUERY_CONSTANTS.ORDER_BY] = stringify(orderBy);\n\n  if (queryParams.startSet_) {\n    const startParam = queryParams.startAfterSet_\n      ? REST_QUERY_CONSTANTS.START_AFTER\n      : REST_QUERY_CONSTANTS.START_AT;\n    qs[startParam] = stringify(queryParams.indexStartValue_);\n    if (queryParams.startNameSet_) {\n      qs[startParam] += ',' + stringify(queryParams.indexStartName_);\n    }\n  }\n\n  if (queryParams.endSet_) {\n    const endParam = queryParams.endBeforeSet_\n      ? REST_QUERY_CONSTANTS.END_BEFORE\n      : REST_QUERY_CONSTANTS.END_AT;\n    qs[endParam] = stringify(queryParams.indexEndValue_);\n    if (queryParams.endNameSet_) {\n      qs[endParam] += ',' + stringify(queryParams.indexEndName_);\n    }\n  }\n\n  if (queryParams.limitSet_) {\n    if (queryParams.isViewFromLeft()) {\n      qs[REST_QUERY_CONSTANTS.LIMIT_TO_FIRST] = queryParams.limit_;\n    } else {\n      qs[REST_QUERY_CONSTANTS.LIMIT_TO_LAST] = queryParams.limit_;\n    }\n  }\n\n  return qs;\n}\n\nexport function queryParamsGetQueryObject(\n  queryParams: QueryParams\n): Record<string, unknown> {\n  const obj: Record<string, unknown> = {};\n  if (queryParams.startSet_) {\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE] =\n      queryParams.indexStartValue_;\n    if (queryParams.startNameSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME] =\n        queryParams.indexStartName_;\n    }\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_IS_INCLUSIVE] =\n      !queryParams.startAfterSet_;\n  }\n  if (queryParams.endSet_) {\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE] = queryParams.indexEndValue_;\n    if (queryParams.endNameSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME] = queryParams.indexEndName_;\n    }\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_IS_INCLUSIVE] =\n      !queryParams.endBeforeSet_;\n  }\n  if (queryParams.limitSet_) {\n    obj[WIRE_PROTOCOL_CONSTANTS.LIMIT] = queryParams.limit_;\n    let viewFrom = queryParams.viewFrom_;\n    if (viewFrom === '') {\n      if (queryParams.isViewFromLeft()) {\n        viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n      } else {\n        viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n      }\n    }\n    obj[WIRE_PROTOCOL_CONSTANTS.VIEW_FROM] = viewFrom;\n  }\n  // For now, priority index is the default, so we only specify if it's some other index\n  if (queryParams.index_ !== PRIORITY_INDEX) {\n    obj[WIRE_PROTOCOL_CONSTANTS.INDEX] = queryParams.index_.toString();\n  }\n  return obj;\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 {\n  assert,\n  jsonEval,\n  safeGet,\n  querystring,\n  Deferred\n} from '@firebase/util';\n\nimport { AppCheckTokenProvider } from './AppCheckTokenProvider';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { RepoInfo } from './RepoInfo';\nimport { ServerActions } from './ServerActions';\nimport { logWrapper, warn } from './util/util';\nimport { QueryContext } from './view/EventRegistration';\nimport { queryParamsToRestQueryStringParameters } from './view/QueryParams';\n\n/**\n * An implementation of ServerActions that communicates with the server via REST requests.\n * This is mostly useful for compatibility with crawlers, where we don't want to spin up a full\n * persistent connection (using WebSockets or long-polling)\n */\nexport class ReadonlyRestClient extends ServerActions {\n  reportStats(stats: { [k: string]: unknown }): void {\n    throw new Error('Method not implemented.');\n  }\n\n  /** @private {function(...[*])} */\n  private log_: (...args: unknown[]) => void = logWrapper('p:rest:');\n\n  /**\n   * We don't actually need to track listens, except to prevent us calling an onComplete for a listen\n   * that's been removed. :-/\n   */\n  private listens_: { [k: string]: object } = {};\n\n  static getListenId_(query: QueryContext, tag?: number | null): string {\n    if (tag !== undefined) {\n      return 'tag$' + tag;\n    } else {\n      assert(\n        query._queryParams.isDefault(),\n        \"should have a tag if it's not a default query.\"\n      );\n      return query._path.toString();\n    }\n  }\n\n  /**\n   * @param repoInfo_ - Data about the namespace we are connecting to\n   * @param onDataUpdate_ - A callback for new data from the server\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private authTokenProvider_: AuthTokenProvider,\n    private appCheckTokenProvider_: AppCheckTokenProvider\n  ) {\n    super();\n  }\n\n  /** @inheritDoc */\n  listen(\n    query: QueryContext,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ) {\n    const pathString = query._path.toString();\n    this.log_('Listen called for ' + pathString + ' ' + query._queryIdentifier);\n\n    // Mark this listener so we can tell if it's removed.\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    const thisListen = {};\n    this.listens_[listenId] = thisListen;\n\n    const queryStringParameters = queryParamsToRestQueryStringParameters(\n      query._queryParams\n    );\n\n    this.restRequest_(\n      pathString + '.json',\n      queryStringParameters,\n      (error, result) => {\n        let data = result;\n\n        if (error === 404) {\n          data = null;\n          error = null;\n        }\n\n        if (error === null) {\n          this.onDataUpdate_(pathString, data, /*isMerge=*/ false, tag);\n        }\n\n        if (safeGet(this.listens_, listenId) === thisListen) {\n          let status;\n          if (!error) {\n            status = 'ok';\n          } else if (error === 401) {\n            status = 'permission_denied';\n          } else {\n            status = 'rest_error:' + error;\n          }\n\n          onComplete(status, null);\n        }\n      }\n    );\n  }\n\n  /** @inheritDoc */\n  unlisten(query: QueryContext, tag: number | null) {\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    delete this.listens_[listenId];\n  }\n\n  get(query: QueryContext): Promise<string> {\n    const queryStringParameters = queryParamsToRestQueryStringParameters(\n      query._queryParams\n    );\n\n    const pathString = query._path.toString();\n\n    const deferred = new Deferred<string>();\n\n    this.restRequest_(\n      pathString + '.json',\n      queryStringParameters,\n      (error, result) => {\n        let data = result;\n\n        if (error === 404) {\n          data = null;\n          error = null;\n        }\n\n        if (error === null) {\n          this.onDataUpdate_(\n            pathString,\n            data,\n            /*isMerge=*/ false,\n            /*tag=*/ null\n          );\n          deferred.resolve(data as string);\n        } else {\n          deferred.reject(new Error(data as string));\n        }\n      }\n    );\n    return deferred.promise;\n  }\n\n  /** @inheritDoc */\n  refreshAuthToken(token: string) {\n    // no-op since we just always call getToken.\n  }\n\n  /**\n   * Performs a REST request to the given path, with the provided query string parameters,\n   * and any auth credentials we have.\n   */\n  private restRequest_(\n    pathString: string,\n    queryStringParameters: { [k: string]: string | number } = {},\n    callback: ((a: number | null, b?: unknown) => void) | null\n  ) {\n    queryStringParameters['format'] = 'export';\n\n    return Promise.all([\n      this.authTokenProvider_.getToken(/*forceRefresh=*/ false),\n      this.appCheckTokenProvider_.getToken(/*forceRefresh=*/ false)\n    ]).then(([authToken, appCheckToken]) => {\n      if (authToken && authToken.accessToken) {\n        queryStringParameters['auth'] = authToken.accessToken;\n      }\n      if (appCheckToken && appCheckToken.token) {\n        queryStringParameters['ac'] = appCheckToken.token;\n      }\n\n      const url =\n        (this.repoInfo_.secure ? 'https://' : 'http://') +\n        this.repoInfo_.host +\n        pathString +\n        '?' +\n        'ns=' +\n        this.repoInfo_.namespace +\n        querystring(queryStringParameters);\n\n      this.log_('Sending REST request for ' + url);\n      const xhr = new XMLHttpRequest();\n      xhr.onreadystatechange = () => {\n        if (callback && xhr.readyState === 4) {\n          this.log_(\n            'REST Response for ' + url + ' received. status:',\n            xhr.status,\n            'response:',\n            xhr.responseText\n          );\n          let res = null;\n          if (xhr.status >= 200 && xhr.status < 300) {\n            try {\n              res = jsonEval(xhr.responseText);\n            } catch (e) {\n              warn(\n                'Failed to parse JSON response for ' +\n                  url +\n                  ': ' +\n                  xhr.responseText\n              );\n            }\n            callback(null, res);\n          } else {\n            // 401 and 404 are expected.\n            if (xhr.status !== 401 && xhr.status !== 404) {\n              warn(\n                'Got unsuccessful REST response for ' +\n                  url +\n                  ' Status: ' +\n                  xhr.status\n              );\n            }\n            callback(xhr.status);\n          }\n          callback = null;\n        }\n      };\n\n      xhr.open('GET', url, /*asynchronous=*/ true);\n      xhr.send();\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/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a\n * params object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n */\nexport function querystring(querystringParams: {\n  [key: string]: string | number;\n}): string {\n  const params = [];\n  for (const [key, value] of Object.entries(querystringParams)) {\n    if (Array.isArray(value)) {\n      value.forEach(arrayVal => {\n        params.push(\n          encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal)\n        );\n      });\n    } else {\n      params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n    }\n  }\n  return params.length ? '&' + params.join('&') : '';\n}\n\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object\n * (e.g. {arg: 'val', arg2: 'val2'})\n */\nexport function querystringDecode(querystring: string): Record<string, string> {\n  const obj: Record<string, string> = {};\n  const tokens = querystring.replace(/^\\?/, '').split('&');\n\n  tokens.forEach(token => {\n    if (token) {\n      const [key, value] = token.split('=');\n      obj[decodeURIComponent(key)] = decodeURIComponent(value);\n    }\n  });\n  return obj;\n}\n\n/**\n * Extract the query string part of a URL, including the leading question mark (if present).\n */\nexport function extractQuerystring(url: string): string {\n  const queryStart = url.indexOf('?');\n  if (!queryStart) {\n    return '';\n  }\n  const fragmentStart = url.indexOf('#', queryStart);\n  return url.substring(\n    queryStart,\n    fragmentStart > 0 ? fragmentStart : undefined\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\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport { Path } from './util/Path';\n\n/**\n * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\n */\nexport class SnapshotHolder {\n  private rootNode_: Node = ChildrenNode.EMPTY_NODE;\n\n  getNode(path: Path): Node {\n    return this.rootNode_.getChild(path);\n  }\n\n  updateSnapshot(path: Path, newSnapshotNode: Node) {\n    this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\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\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { Node } from './snap/Node';\nimport { Path, pathGetFront, pathIsEmpty, pathPopFront } from './util/Path';\n\n/**\n * Helper class to store a sparse set of snapshots.\n */\nexport interface SparseSnapshotTree {\n  value: Node | null;\n  readonly children: Map<string, SparseSnapshotTree>;\n}\n\nexport function newSparseSnapshotTree(): SparseSnapshotTree {\n  return {\n    value: null,\n    children: new Map()\n  };\n}\n\n/**\n * Gets the node stored at the given path if one exists.\n * Only seems to be used in tests.\n *\n * @param path - Path to look up snapshot for.\n * @returns The retrieved node, or null.\n */\nexport function sparseSnapshotTreeFind(\n  sparseSnapshotTree: SparseSnapshotTree,\n  path: Path\n): Node | null {\n  if (sparseSnapshotTree.value != null) {\n    return sparseSnapshotTree.value.getChild(path);\n  } else if (!pathIsEmpty(path) && sparseSnapshotTree.children.size > 0) {\n    const childKey = pathGetFront(path);\n    path = pathPopFront(path);\n    if (sparseSnapshotTree.children.has(childKey)) {\n      const childTree = sparseSnapshotTree.children.get(childKey);\n      return sparseSnapshotTreeFind(childTree, path);\n    } else {\n      return null;\n    }\n  } else {\n    return null;\n  }\n}\n\n/**\n * Stores the given node at the specified path. If there is already a node\n * at a shallower path, it merges the new data into that snapshot node.\n *\n * @param path - Path to look up snapshot for.\n * @param data - The new data, or null.\n */\nexport function sparseSnapshotTreeRemember(\n  sparseSnapshotTree: SparseSnapshotTree,\n  path: Path,\n  data: Node\n): void {\n  if (pathIsEmpty(path)) {\n    sparseSnapshotTree.value = data;\n    sparseSnapshotTree.children.clear();\n  } else if (sparseSnapshotTree.value !== null) {\n    sparseSnapshotTree.value = sparseSnapshotTree.value.updateChild(path, data);\n  } else {\n    const childKey = pathGetFront(path);\n    if (!sparseSnapshotTree.children.has(childKey)) {\n      sparseSnapshotTree.children.set(childKey, newSparseSnapshotTree());\n    }\n\n    const child = sparseSnapshotTree.children.get(childKey);\n    path = pathPopFront(path);\n    sparseSnapshotTreeRemember(child, path, data);\n  }\n}\n\n/**\n * Purge the data at path from the cache.\n *\n * @param path - Path to look up snapshot for.\n * @returns True if this node should now be removed.\n */\nexport function sparseSnapshotTreeForget(\n  sparseSnapshotTree: SparseSnapshotTree,\n  path: Path\n): boolean {\n  if (pathIsEmpty(path)) {\n    sparseSnapshotTree.value = null;\n    sparseSnapshotTree.children.clear();\n    return true;\n  } else {\n    if (sparseSnapshotTree.value !== null) {\n      if (sparseSnapshotTree.value.isLeafNode()) {\n        // We're trying to forget a node that doesn't exist\n        return false;\n      } else {\n        const value = sparseSnapshotTree.value;\n        sparseSnapshotTree.value = null;\n\n        value.forEachChild(PRIORITY_INDEX, (key, tree) => {\n          sparseSnapshotTreeRemember(sparseSnapshotTree, new Path(key), tree);\n        });\n\n        return sparseSnapshotTreeForget(sparseSnapshotTree, path);\n      }\n    } else if (sparseSnapshotTree.children.size > 0) {\n      const childKey = pathGetFront(path);\n      path = pathPopFront(path);\n      if (sparseSnapshotTree.children.has(childKey)) {\n        const safeToRemove = sparseSnapshotTreeForget(\n          sparseSnapshotTree.children.get(childKey),\n          path\n        );\n        if (safeToRemove) {\n          sparseSnapshotTree.children.delete(childKey);\n        }\n      }\n\n      return sparseSnapshotTree.children.size === 0;\n    } else {\n      return true;\n    }\n  }\n}\n\n/**\n * Recursively iterates through all of the stored tree and calls the\n * callback on each one.\n *\n * @param prefixPath - Path to look up node for.\n * @param func - The function to invoke for each tree.\n */\nexport function sparseSnapshotTreeForEachTree(\n  sparseSnapshotTree: SparseSnapshotTree,\n  prefixPath: Path,\n  func: (a: Path, b: Node) => unknown\n): void {\n  if (sparseSnapshotTree.value !== null) {\n    func(prefixPath, sparseSnapshotTree.value);\n  } else {\n    sparseSnapshotTreeForEachChild(sparseSnapshotTree, (key, tree) => {\n      const path = new Path(prefixPath.toString() + '/' + key);\n      sparseSnapshotTreeForEachTree(tree, path, func);\n    });\n  }\n}\n\n/**\n * Iterates through each immediate child and triggers the callback.\n * Only seems to be used in tests.\n *\n * @param func - The function to invoke for each child.\n */\nexport function sparseSnapshotTreeForEachChild(\n  sparseSnapshotTree: SparseSnapshotTree,\n  func: (a: string, b: SparseSnapshotTree) => void\n): void {\n  sparseSnapshotTree.children.forEach((tree, key) => {\n    func(key, tree);\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\nimport { each } from '../util/util';\n\nimport { StatsCollection } from './StatsCollection';\n\n/**\n * Returns the delta from the previous call to get stats.\n *\n * @param collection_ - The collection to \"listen\" to.\n */\nexport class StatsListener {\n  private last_: { [k: string]: number } | null = null;\n\n  constructor(private collection_: StatsCollection) {}\n\n  get(): { [k: string]: number } {\n    const newStats = this.collection_.get();\n\n    const delta = { ...newStats };\n    if (this.last_) {\n      each(this.last_, (stat: string, value: number) => {\n        delta[stat] = delta[stat] - value;\n      });\n    }\n    this.last_ = newStats;\n\n    return delta;\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\nimport { contains } from '@firebase/util';\n\nimport { ServerActions } from '../ServerActions';\nimport { setTimeoutNonBlocking, each } from '../util/util';\n\nimport { StatsCollection } from './StatsCollection';\nimport { StatsListener } from './StatsListener';\n\n// Assuming some apps may have a short amount of time on page, and a bulk of firebase operations probably\n// happen on page load, we try to report our first set of stats pretty quickly, but we wait at least 10\n// seconds to try to ensure the Firebase connection is established / settled.\nconst FIRST_STATS_MIN_TIME = 10 * 1000;\nconst FIRST_STATS_MAX_TIME = 30 * 1000;\n\n// We'll continue to report stats on average every 5 minutes.\nconst REPORT_STATS_INTERVAL = 5 * 60 * 1000;\n\nexport class StatsReporter {\n  private statsListener_: StatsListener;\n  statsToReport_: { [k: string]: boolean } = {};\n\n  constructor(collection: StatsCollection, private server_: ServerActions) {\n    this.statsListener_ = new StatsListener(collection);\n\n    const timeout =\n      FIRST_STATS_MIN_TIME +\n      (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\n    setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\n  }\n\n  private reportStats_() {\n    const stats = this.statsListener_.get();\n    const reportedStats: typeof stats = {};\n    let haveStatsToReport = false;\n\n    each(stats, (stat: string, value: number) => {\n      if (value > 0 && contains(this.statsToReport_, stat)) {\n        reportedStats[stat] = value;\n        haveStatsToReport = true;\n      }\n    });\n\n    if (haveStatsToReport) {\n      this.server_.reportStats(reportedStats);\n    }\n\n    // queue our next run.\n    setTimeoutNonBlocking(\n      this.reportStats_.bind(this),\n      Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL)\n    );\n  }\n}\n\nexport function statsReporterIncludeStat(\n  reporter: StatsReporter,\n  stat: string\n) {\n  reporter.statsToReport_[stat] = 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\nimport { Path } from '../util/Path';\n\n/**\n *\n * @enum\n */\nexport enum OperationType {\n  OVERWRITE,\n  MERGE,\n  ACK_USER_WRITE,\n  LISTEN_COMPLETE\n}\n\n/**\n * @interface\n */\nexport interface Operation {\n  source: OperationSource;\n\n  type: OperationType;\n\n  path: Path;\n\n  operationForChild(childName: string): Operation | null;\n}\n\nexport interface OperationSource {\n  fromUser: boolean;\n  fromServer: boolean;\n  queryId: string | null;\n  tagged: boolean;\n}\n\nexport function newOperationSourceUser(): OperationSource {\n  return {\n    fromUser: true,\n    fromServer: false,\n    queryId: null,\n    tagged: false\n  };\n}\n\nexport function newOperationSourceServer(): OperationSource {\n  return {\n    fromUser: false,\n    fromServer: true,\n    queryId: null,\n    tagged: false\n  };\n}\n\nexport function newOperationSourceServerTaggedQuery(\n  queryId: string\n): OperationSource {\n  return {\n    fromUser: false,\n    fromServer: true,\n    queryId,\n    tagged: true\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\nimport { assert } from '@firebase/util';\n\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport {\n  newEmptyPath,\n  Path,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from '../util/Path';\n\nimport { newOperationSourceUser, Operation, OperationType } from './Operation';\n\nexport class AckUserWrite implements Operation {\n  /** @inheritDoc */\n  type = OperationType.ACK_USER_WRITE;\n\n  /** @inheritDoc */\n  source = newOperationSourceUser();\n\n  /**\n   * @param affectedTree - A tree containing true for each affected path. Affected paths can't overlap.\n   */\n  constructor(\n    /** @inheritDoc */ public path: Path,\n    /** @inheritDoc */ public affectedTree: ImmutableTree<boolean>,\n    /** @inheritDoc */ public revert: boolean\n  ) {}\n  operationForChild(childName: string): AckUserWrite {\n    if (!pathIsEmpty(this.path)) {\n      assert(\n        pathGetFront(this.path) === childName,\n        'operationForChild called for unrelated child.'\n      );\n      return new AckUserWrite(\n        pathPopFront(this.path),\n        this.affectedTree,\n        this.revert\n      );\n    } else if (this.affectedTree.value != null) {\n      assert(\n        this.affectedTree.children.isEmpty(),\n        'affectedTree should not have overlapping affected paths.'\n      );\n      // All child locations are affected as well; just return same operation.\n      return this;\n    } else {\n      const childTree = this.affectedTree.subtree(new Path(childName));\n      return new AckUserWrite(newEmptyPath(), childTree, this.revert);\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\nimport { newEmptyPath, Path, pathIsEmpty, pathPopFront } from '../util/Path';\n\nimport { Operation, OperationSource, OperationType } from './Operation';\n\nexport class ListenComplete implements Operation {\n  /** @inheritDoc */\n  type = OperationType.LISTEN_COMPLETE;\n\n  constructor(public source: OperationSource, public path: Path) {}\n\n  operationForChild(childName: string): ListenComplete {\n    if (pathIsEmpty(this.path)) {\n      return new ListenComplete(this.source, newEmptyPath());\n    } else {\n      return new ListenComplete(this.source, pathPopFront(this.path));\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\nimport { Node } from '../snap/Node';\nimport { newEmptyPath, Path, pathIsEmpty, pathPopFront } from '../util/Path';\n\nimport { Operation, OperationSource, OperationType } from './Operation';\n\nexport class Overwrite implements Operation {\n  /** @inheritDoc */\n  type = OperationType.OVERWRITE;\n\n  constructor(\n    public source: OperationSource,\n    public path: Path,\n    public snap: Node\n  ) {}\n\n  operationForChild(childName: string): Overwrite {\n    if (pathIsEmpty(this.path)) {\n      return new Overwrite(\n        this.source,\n        newEmptyPath(),\n        this.snap.getImmediateChild(childName)\n      );\n    } else {\n      return new Overwrite(this.source, pathPopFront(this.path), this.snap);\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\nimport { assert } from '@firebase/util';\n\nimport { Node } from '../snap/Node';\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport {\n  newEmptyPath,\n  Path,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from '../util/Path';\n\nimport { Operation, OperationSource, OperationType } from './Operation';\nimport { Overwrite } from './Overwrite';\n\nexport class Merge implements Operation {\n  /** @inheritDoc */\n  type = OperationType.MERGE;\n\n  constructor(\n    /** @inheritDoc */ public source: OperationSource,\n    /** @inheritDoc */ public path: Path,\n    /** @inheritDoc */ public children: ImmutableTree<Node>\n  ) {}\n  operationForChild(childName: string): Operation {\n    if (pathIsEmpty(this.path)) {\n      const childTree = this.children.subtree(new Path(childName));\n      if (childTree.isEmpty()) {\n        // This child is unaffected\n        return null;\n      } else if (childTree.value) {\n        // We have a snapshot for the child in question.  This becomes an overwrite of the child.\n        return new Overwrite(this.source, newEmptyPath(), childTree.value);\n      } else {\n        // This is a merge at a deeper level\n        return new Merge(this.source, newEmptyPath(), childTree);\n      }\n    } else {\n      assert(\n        pathGetFront(this.path) === childName,\n        \"Can't get a merge for a child not on the path of the operation\"\n      );\n      return new Merge(this.source, pathPopFront(this.path), this.children);\n    }\n  }\n  toString(): string {\n    return (\n      'Operation(' +\n      this.path +\n      ': ' +\n      this.source.toString() +\n      ' merge: ' +\n      this.children.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\nimport { Node } from '../snap/Node';\nimport { Path, pathGetFront, pathIsEmpty } from '../util/Path';\n\n/**\n * A cache node only stores complete children. Additionally it holds a flag whether the node can be considered fully\n * initialized in the sense that we know at one point in time this represented a valid state of the world, e.g.\n * initialized with data from the server, or a complete overwrite by the client. The filtered flag also tracks\n * whether a node potentially had children removed due to a filter.\n */\nexport class CacheNode {\n  constructor(\n    private node_: Node,\n    private fullyInitialized_: boolean,\n    private filtered_: boolean\n  ) {}\n\n  /**\n   * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\n   */\n  isFullyInitialized(): boolean {\n    return this.fullyInitialized_;\n  }\n\n  /**\n   * Returns whether this node is potentially missing children due to a filter applied to the node\n   */\n  isFiltered(): boolean {\n    return this.filtered_;\n  }\n\n  isCompleteForPath(path: Path): boolean {\n    if (pathIsEmpty(path)) {\n      return this.isFullyInitialized() && !this.filtered_;\n    }\n\n    const childKey = pathGetFront(path);\n    return this.isCompleteForChild(childKey);\n  }\n\n  isCompleteForChild(key: string): boolean {\n    return (\n      (this.isFullyInitialized() && !this.filtered_) || this.node_.hasChild(key)\n    );\n  }\n\n  getNode(): Node {\n    return this.node_;\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\nimport { assertionError } from '@firebase/util';\n\nimport { Index } from '../snap/indexes/Index';\nimport { NamedNode, Node } from '../snap/Node';\n\nimport { Change, ChangeType, changeChildMoved } from './Change';\nimport { Event } from './Event';\nimport { EventRegistration, QueryContext } from './EventRegistration';\n\n/**\n * An EventGenerator is used to convert \"raw\" changes (Change) as computed by the\n * CacheDiffer into actual events (Event) that can be raised.  See generateEventsForChanges()\n * for details.\n *\n */\nexport class EventGenerator {\n  index_: Index;\n\n  constructor(public query_: QueryContext) {\n    this.index_ = this.query_._queryParams.getIndex();\n  }\n}\n\n/**\n * Given a set of raw changes (no moved events and prevName not specified yet), and a set of\n * EventRegistrations that should be notified of these changes, generate the actual events to be raised.\n *\n * Notes:\n *  - child_moved events will be synthesized at this time for any child_changed events that affect\n *    our index.\n *  - prevName will be calculated based on the index ordering.\n */\nexport function eventGeneratorGenerateEventsForChanges(\n  eventGenerator: EventGenerator,\n  changes: Change[],\n  eventCache: Node,\n  eventRegistrations: EventRegistration[]\n): Event[] {\n  const events: Event[] = [];\n  const moves: Change[] = [];\n\n  changes.forEach(change => {\n    if (\n      change.type === ChangeType.CHILD_CHANGED &&\n      eventGenerator.index_.indexedValueChanged(\n        change.oldSnap as Node,\n        change.snapshotNode\n      )\n    ) {\n      moves.push(changeChildMoved(change.childName, change.snapshotNode));\n    }\n  });\n\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_REMOVED,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_ADDED,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_MOVED,\n    moves,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.CHILD_CHANGED,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n  eventGeneratorGenerateEventsForType(\n    eventGenerator,\n    events,\n    ChangeType.VALUE,\n    changes,\n    eventRegistrations,\n    eventCache\n  );\n\n  return events;\n}\n\n/**\n * Given changes of a single change type, generate the corresponding events.\n */\nfunction eventGeneratorGenerateEventsForType(\n  eventGenerator: EventGenerator,\n  events: Event[],\n  eventType: string,\n  changes: Change[],\n  registrations: EventRegistration[],\n  eventCache: Node\n) {\n  const filteredChanges = changes.filter(change => change.type === eventType);\n\n  filteredChanges.sort((a, b) =>\n    eventGeneratorCompareChanges(eventGenerator, a, b)\n  );\n  filteredChanges.forEach(change => {\n    const materializedChange = eventGeneratorMaterializeSingleChange(\n      eventGenerator,\n      change,\n      eventCache\n    );\n    registrations.forEach(registration => {\n      if (registration.respondsTo(change.type)) {\n        events.push(\n          registration.createEvent(materializedChange, eventGenerator.query_)\n        );\n      }\n    });\n  });\n}\n\nfunction eventGeneratorMaterializeSingleChange(\n  eventGenerator: EventGenerator,\n  change: Change,\n  eventCache: Node\n): Change {\n  if (change.type === 'value' || change.type === 'child_removed') {\n    return change;\n  } else {\n    change.prevName = eventCache.getPredecessorChildName(\n      change.childName,\n      change.snapshotNode,\n      eventGenerator.index_\n    );\n    return change;\n  }\n}\n\nfunction eventGeneratorCompareChanges(\n  eventGenerator: EventGenerator,\n  a: Change,\n  b: Change\n) {\n  if (a.childName == null || b.childName == null) {\n    throw assertionError('Should only compare child_ events.');\n  }\n  const aWrapped = new NamedNode(a.childName, a.snapshotNode);\n  const bWrapped = new NamedNode(b.childName, b.snapshotNode);\n  return eventGenerator.index_.compare(aWrapped, bWrapped);\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 { Node } from '../snap/Node';\n\nimport { CacheNode } from './CacheNode';\n\n/**\n * Stores the data we have cached for a view.\n *\n * serverSnap is the cached server data, eventSnap is the cached event data (server data plus any local writes).\n */\nexport interface ViewCache {\n  readonly eventCache: CacheNode;\n  readonly serverCache: CacheNode;\n}\n\nexport function newViewCache(\n  eventCache: CacheNode,\n  serverCache: CacheNode\n): ViewCache {\n  return { eventCache, serverCache };\n}\n\nexport function viewCacheUpdateEventSnap(\n  viewCache: ViewCache,\n  eventSnap: Node,\n  complete: boolean,\n  filtered: boolean\n): ViewCache {\n  return newViewCache(\n    new CacheNode(eventSnap, complete, filtered),\n    viewCache.serverCache\n  );\n}\n\nexport function viewCacheUpdateServerSnap(\n  viewCache: ViewCache,\n  serverSnap: Node,\n  complete: boolean,\n  filtered: boolean\n): ViewCache {\n  return newViewCache(\n    viewCache.eventCache,\n    new CacheNode(serverSnap, complete, filtered)\n  );\n}\n\nexport function viewCacheGetCompleteEventSnap(\n  viewCache: ViewCache\n): Node | null {\n  return viewCache.eventCache.isFullyInitialized()\n    ? viewCache.eventCache.getNode()\n    : null;\n}\n\nexport function viewCacheGetCompleteServerSnap(\n  viewCache: ViewCache\n): Node | null {\n  return viewCache.serverCache.isFullyInitialized()\n    ? viewCache.serverCache.getNode()\n    : null;\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 {\n  newEmptyPath,\n  Path,\n  pathChild,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from './Path';\nimport { SortedMap } from './SortedMap';\nimport { each, stringCompare } from './util';\n\nlet emptyChildrenSingleton: SortedMap<string, ImmutableTree<null>>;\n\n/**\n * Singleton empty children collection.\n *\n */\nconst EmptyChildren = (): SortedMap<string, ImmutableTree<null>> => {\n  if (!emptyChildrenSingleton) {\n    emptyChildrenSingleton = new SortedMap<string, ImmutableTree<null>>(\n      stringCompare\n    );\n  }\n  return emptyChildrenSingleton;\n};\n\n/**\n * A tree with immutable elements.\n */\nexport class ImmutableTree<T> {\n  static fromObject<T>(obj: { [k: string]: T }): ImmutableTree<T> {\n    let tree: ImmutableTree<T> = new ImmutableTree<T>(null);\n    each(obj, (childPath: string, childSnap: T) => {\n      tree = tree.set(new Path(childPath), childSnap);\n    });\n    return tree;\n  }\n\n  constructor(\n    public readonly value: T | null,\n    public readonly children: SortedMap<\n      string,\n      ImmutableTree<T>\n    > = EmptyChildren()\n  ) {}\n\n  /**\n   * True if the value is empty and there are no children\n   */\n  isEmpty(): boolean {\n    return this.value === null && this.children.isEmpty();\n  }\n\n  /**\n   * Given a path and predicate, return the first node and the path to that node\n   * where the predicate returns true.\n   *\n   * TODO Do a perf test -- If we're creating a bunch of `{path: value:}`\n   * objects on the way back out, it may be better to pass down a pathSoFar obj.\n   *\n   * @param relativePath - The remainder of the path\n   * @param predicate - The predicate to satisfy to return a node\n   */\n  findRootMostMatchingPathAndValue(\n    relativePath: Path,\n    predicate: (a: T) => boolean\n  ): { path: Path; value: T } | null {\n    if (this.value != null && predicate(this.value)) {\n      return { path: newEmptyPath(), value: this.value };\n    } else {\n      if (pathIsEmpty(relativePath)) {\n        return null;\n      } else {\n        const front = pathGetFront(relativePath);\n        const child = this.children.get(front);\n        if (child !== null) {\n          const childExistingPathAndValue =\n            child.findRootMostMatchingPathAndValue(\n              pathPopFront(relativePath),\n              predicate\n            );\n          if (childExistingPathAndValue != null) {\n            const fullPath = pathChild(\n              new Path(front),\n              childExistingPathAndValue.path\n            );\n            return { path: fullPath, value: childExistingPathAndValue.value };\n          } else {\n            return null;\n          }\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  /**\n   * Find, if it exists, the shortest subpath of the given path that points a defined\n   * value in the tree\n   */\n  findRootMostValueAndPath(\n    relativePath: Path\n  ): { path: Path; value: T } | null {\n    return this.findRootMostMatchingPathAndValue(relativePath, () => true);\n  }\n\n  /**\n   * @returns The subtree at the given path\n   */\n  subtree(relativePath: Path): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      return this;\n    } else {\n      const front = pathGetFront(relativePath);\n      const childTree = this.children.get(front);\n      if (childTree !== null) {\n        return childTree.subtree(pathPopFront(relativePath));\n      } else {\n        return new ImmutableTree<T>(null);\n      }\n    }\n  }\n\n  /**\n   * Sets a value at the specified path.\n   *\n   * @param relativePath - Path to set value at.\n   * @param toSet - Value to set.\n   * @returns Resulting tree.\n   */\n  set(relativePath: Path, toSet: T | null): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      return new ImmutableTree(toSet, this.children);\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front) || new ImmutableTree<T>(null);\n      const newChild = child.set(pathPopFront(relativePath), toSet);\n      const newChildren = this.children.insert(front, newChild);\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Removes the value at the specified path.\n   *\n   * @param relativePath - Path to value to remove.\n   * @returns Resulting tree.\n   */\n  remove(relativePath: Path): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      if (this.children.isEmpty()) {\n        return new ImmutableTree<T>(null);\n      } else {\n        return new ImmutableTree(null, this.children);\n      }\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front);\n      if (child) {\n        const newChild = child.remove(pathPopFront(relativePath));\n        let newChildren;\n        if (newChild.isEmpty()) {\n          newChildren = this.children.remove(front);\n        } else {\n          newChildren = this.children.insert(front, newChild);\n        }\n        if (this.value === null && newChildren.isEmpty()) {\n          return new ImmutableTree<T>(null);\n        } else {\n          return new ImmutableTree(this.value, newChildren);\n        }\n      } else {\n        return this;\n      }\n    }\n  }\n\n  /**\n   * Gets a value from the tree.\n   *\n   * @param relativePath - Path to get value for.\n   * @returns Value at path, or null.\n   */\n  get(relativePath: Path): T | null {\n    if (pathIsEmpty(relativePath)) {\n      return this.value;\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front);\n      if (child) {\n        return child.get(pathPopFront(relativePath));\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Replace the subtree at the specified path with the given new tree.\n   *\n   * @param relativePath - Path to replace subtree for.\n   * @param newTree - New tree.\n   * @returns Resulting tree.\n   */\n  setTree(relativePath: Path, newTree: ImmutableTree<T>): ImmutableTree<T> {\n    if (pathIsEmpty(relativePath)) {\n      return newTree;\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front) || new ImmutableTree<T>(null);\n      const newChild = child.setTree(pathPopFront(relativePath), newTree);\n      let newChildren;\n      if (newChild.isEmpty()) {\n        newChildren = this.children.remove(front);\n      } else {\n        newChildren = this.children.insert(front, newChild);\n      }\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Performs a depth first fold on this tree. Transforms a tree into a single\n   * value, given a function that operates on the path to a node, an optional\n   * current value, and a map of child names to folded subtrees\n   */\n  fold<V>(fn: (path: Path, value: T, children: { [k: string]: V }) => V): V {\n    return this.fold_(newEmptyPath(), fn);\n  }\n\n  /**\n   * Recursive helper for public-facing fold() method\n   */\n  private fold_<V>(\n    pathSoFar: Path,\n    fn: (path: Path, value: T | null, children: { [k: string]: V }) => V\n  ): V {\n    const accum: { [k: string]: V } = {};\n    this.children.inorderTraversal(\n      (childKey: string, childTree: ImmutableTree<T>) => {\n        accum[childKey] = childTree.fold_(pathChild(pathSoFar, childKey), fn);\n      }\n    );\n    return fn(pathSoFar, this.value, accum);\n  }\n\n  /**\n   * Find the first matching value on the given path. Return the result of applying f to it.\n   */\n  findOnPath<V>(path: Path, f: (path: Path, value: T) => V | null): V | null {\n    return this.findOnPath_(path, newEmptyPath(), f);\n  }\n\n  private findOnPath_<V>(\n    pathToFollow: Path,\n    pathSoFar: Path,\n    f: (path: Path, value: T) => V | null\n  ): V | null {\n    const result = this.value ? f(pathSoFar, this.value) : false;\n    if (result) {\n      return result;\n    } else {\n      if (pathIsEmpty(pathToFollow)) {\n        return null;\n      } else {\n        const front = pathGetFront(pathToFollow)!;\n        const nextChild = this.children.get(front);\n        if (nextChild) {\n          return nextChild.findOnPath_(\n            pathPopFront(pathToFollow),\n            pathChild(pathSoFar, front),\n            f\n          );\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  foreachOnPath(\n    path: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    return this.foreachOnPath_(path, newEmptyPath(), f);\n  }\n\n  private foreachOnPath_(\n    pathToFollow: Path,\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    if (pathIsEmpty(pathToFollow)) {\n      return this;\n    } else {\n      if (this.value) {\n        f(currentRelativePath, this.value);\n      }\n      const front = pathGetFront(pathToFollow);\n      const nextChild = this.children.get(front);\n      if (nextChild) {\n        return nextChild.foreachOnPath_(\n          pathPopFront(pathToFollow),\n          pathChild(currentRelativePath, front),\n          f\n        );\n      } else {\n        return new ImmutableTree<T>(null);\n      }\n    }\n  }\n\n  /**\n   * Calls the given function for each node in the tree that has a value.\n   *\n   * @param f - A function to be called with the path from the root of the tree to\n   * a node, and the value at that node. Called in depth-first order.\n   */\n  foreach(f: (path: Path, value: T) => void) {\n    this.foreach_(newEmptyPath(), f);\n  }\n\n  private foreach_(\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ) {\n    this.children.inorderTraversal((childName, childTree) => {\n      childTree.foreach_(pathChild(currentRelativePath, childName), f);\n    });\n    if (this.value) {\n      f(currentRelativePath, this.value);\n    }\n  }\n\n  foreachChild(f: (name: string, value: T) => void) {\n    this.children.inorderTraversal(\n      (childName: string, childTree: ImmutableTree<T>) => {\n        if (childTree.value) {\n          f(childName, childTree.value);\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\nimport { assert } from '@firebase/util';\n\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { NamedNode, Node } from './snap/Node';\nimport { ImmutableTree } from './util/ImmutableTree';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathChild,\n  pathIsEmpty\n} from './util/Path';\nimport { each } from './util/util';\n\n/**\n * This class holds a collection of writes that can be applied to nodes in unison. It abstracts away the logic with\n * dealing with priority writes and multiple nested writes. At any given path there is only allowed to be one write\n * modifying that path. Any write to an existing path or shadowing an existing path will modify that existing write\n * to reflect the write added.\n */\nexport class CompoundWrite {\n  constructor(public writeTree_: ImmutableTree<Node>) {}\n\n  static empty(): CompoundWrite {\n    return new CompoundWrite(new ImmutableTree(null));\n  }\n}\n\nexport function compoundWriteAddWrite(\n  compoundWrite: CompoundWrite,\n  path: Path,\n  node: Node\n): CompoundWrite {\n  if (pathIsEmpty(path)) {\n    return new CompoundWrite(new ImmutableTree(node));\n  } else {\n    const rootmost = compoundWrite.writeTree_.findRootMostValueAndPath(path);\n    if (rootmost != null) {\n      const rootMostPath = rootmost.path;\n      let value = rootmost.value;\n      const relativePath = newRelativePath(rootMostPath, path);\n      value = value.updateChild(relativePath, node);\n      return new CompoundWrite(\n        compoundWrite.writeTree_.set(rootMostPath, value)\n      );\n    } else {\n      const subtree = new ImmutableTree(node);\n      const newWriteTree = compoundWrite.writeTree_.setTree(path, subtree);\n      return new CompoundWrite(newWriteTree);\n    }\n  }\n}\n\nexport function compoundWriteAddWrites(\n  compoundWrite: CompoundWrite,\n  path: Path,\n  updates: { [name: string]: Node }\n): CompoundWrite {\n  let newWrite = compoundWrite;\n  each(updates, (childKey: string, node: Node) => {\n    newWrite = compoundWriteAddWrite(newWrite, pathChild(path, childKey), node);\n  });\n  return newWrite;\n}\n\n/**\n * Will remove a write at the given path and deeper paths. This will <em>not</em> modify a write at a higher\n * location, which must be removed by calling this method with that path.\n *\n * @param compoundWrite - The CompoundWrite to remove.\n * @param path - The path at which a write and all deeper writes should be removed\n * @returns The new CompoundWrite with the removed path\n */\nexport function compoundWriteRemoveWrite(\n  compoundWrite: CompoundWrite,\n  path: Path\n): CompoundWrite {\n  if (pathIsEmpty(path)) {\n    return CompoundWrite.empty();\n  } else {\n    const newWriteTree = compoundWrite.writeTree_.setTree(\n      path,\n      new ImmutableTree<Node>(null)\n    );\n    return new CompoundWrite(newWriteTree);\n  }\n}\n\n/**\n * Returns whether this CompoundWrite will fully overwrite a node at a given location and can therefore be\n * considered \"complete\".\n *\n * @param compoundWrite - The CompoundWrite to check.\n * @param path - The path to check for\n * @returns Whether there is a complete write at that path\n */\nexport function compoundWriteHasCompleteWrite(\n  compoundWrite: CompoundWrite,\n  path: Path\n): boolean {\n  return compoundWriteGetCompleteNode(compoundWrite, path) != null;\n}\n\n/**\n * Returns a node for a path if and only if the node is a \"complete\" overwrite at that path. This will not aggregate\n * writes from deeper paths, but will return child nodes from a more shallow path.\n *\n * @param compoundWrite - The CompoundWrite to get the node from.\n * @param path - The path to get a complete write\n * @returns The node if complete at that path, or null otherwise.\n */\nexport function compoundWriteGetCompleteNode(\n  compoundWrite: CompoundWrite,\n  path: Path\n): Node | null {\n  const rootmost = compoundWrite.writeTree_.findRootMostValueAndPath(path);\n  if (rootmost != null) {\n    return compoundWrite.writeTree_\n      .get(rootmost.path)\n      .getChild(newRelativePath(rootmost.path, path));\n  } else {\n    return null;\n  }\n}\n\n/**\n * Returns all children that are guaranteed to be a complete overwrite.\n *\n * @param compoundWrite - The CompoundWrite to get children from.\n * @returns A list of all complete children.\n */\nexport function compoundWriteGetCompleteChildren(\n  compoundWrite: CompoundWrite\n): NamedNode[] {\n  const children: NamedNode[] = [];\n  const node = compoundWrite.writeTree_.value;\n  if (node != null) {\n    // If it's a leaf node, it has no children; so nothing to do.\n    if (!node.isLeafNode()) {\n      (node as ChildrenNode).forEachChild(\n        PRIORITY_INDEX,\n        (childName, childNode) => {\n          children.push(new NamedNode(childName, childNode));\n        }\n      );\n    }\n  } else {\n    compoundWrite.writeTree_.children.inorderTraversal(\n      (childName, childTree) => {\n        if (childTree.value != null) {\n          children.push(new NamedNode(childName, childTree.value));\n        }\n      }\n    );\n  }\n  return children;\n}\n\nexport function compoundWriteChildCompoundWrite(\n  compoundWrite: CompoundWrite,\n  path: Path\n): CompoundWrite {\n  if (pathIsEmpty(path)) {\n    return compoundWrite;\n  } else {\n    const shadowingNode = compoundWriteGetCompleteNode(compoundWrite, path);\n    if (shadowingNode != null) {\n      return new CompoundWrite(new ImmutableTree(shadowingNode));\n    } else {\n      return new CompoundWrite(compoundWrite.writeTree_.subtree(path));\n    }\n  }\n}\n\n/**\n * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\n * @returns Whether this CompoundWrite is empty\n */\nexport function compoundWriteIsEmpty(compoundWrite: CompoundWrite): boolean {\n  return compoundWrite.writeTree_.isEmpty();\n}\n\n/**\n * Applies this CompoundWrite to a node. The node is returned with all writes from this CompoundWrite applied to the\n * node\n * @param node - The node to apply this CompoundWrite to\n * @returns The node with all writes applied\n */\nexport function compoundWriteApply(\n  compoundWrite: CompoundWrite,\n  node: Node\n): Node {\n  return applySubtreeWrite(newEmptyPath(), compoundWrite.writeTree_, node);\n}\n\nfunction applySubtreeWrite(\n  relativePath: Path,\n  writeTree: ImmutableTree<Node>,\n  node: Node\n): Node {\n  if (writeTree.value != null) {\n    // Since there a write is always a leaf, we're done here\n    return node.updateChild(relativePath, writeTree.value);\n  } else {\n    let priorityWrite = null;\n    writeTree.children.inorderTraversal((childKey, childTree) => {\n      if (childKey === '.priority') {\n        // Apply priorities at the end so we don't update priorities for either empty nodes or forget\n        // to apply priorities to empty nodes that are later filled\n        assert(\n          childTree.value !== null,\n          'Priority writes must always be leaf nodes'\n        );\n        priorityWrite = childTree.value;\n      } else {\n        node = applySubtreeWrite(\n          pathChild(relativePath, childKey),\n          childTree,\n          node\n        );\n      }\n    });\n    // If there was a priority write, we only apply it if the node is not empty\n    if (!node.getChild(relativePath).isEmpty() && priorityWrite !== null) {\n      node = node.updateChild(\n        pathChild(relativePath, '.priority'),\n        priorityWrite\n      );\n    }\n    return node;\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\nimport { assert, assertionError, safeGet } from '@firebase/util';\n\nimport {\n  CompoundWrite,\n  compoundWriteAddWrite,\n  compoundWriteAddWrites,\n  compoundWriteApply,\n  compoundWriteChildCompoundWrite,\n  compoundWriteGetCompleteChildren,\n  compoundWriteGetCompleteNode,\n  compoundWriteHasCompleteWrite,\n  compoundWriteIsEmpty,\n  compoundWriteRemoveWrite\n} from './CompoundWrite';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Index } from './snap/indexes/Index';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { NamedNode, Node } from './snap/Node';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathChild,\n  pathContains,\n  pathGetFront,\n  pathIsEmpty,\n  pathPopFront\n} from './util/Path';\nimport { each } from './util/util';\nimport { CacheNode } from './view/CacheNode';\n\n/**\n * Defines a single user-initiated write operation. May be the result of a set(), transaction(), or update() call. In\n * the case of a set() or transaction, snap wil be non-null.  In the case of an update(), children will be non-null.\n */\nexport interface WriteRecord {\n  writeId: number;\n  path: Path;\n  snap?: Node | null;\n  children?: { [k: string]: Node } | null;\n  visible: boolean;\n}\n\n/**\n * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n *\n */\nexport function writeTreeChildWrites(\n  writeTree: WriteTree,\n  path: Path\n): WriteTreeRef {\n  return newWriteTreeRef(path, writeTree);\n}\n\n/**\n * Record a new overwrite from user code.\n *\n * @param visible - This is set to false by some transactions. It should be excluded from event caches\n */\nexport function writeTreeAddOverwrite(\n  writeTree: WriteTree,\n  path: Path,\n  snap: Node,\n  writeId: number,\n  visible?: boolean\n) {\n  assert(\n    writeId > writeTree.lastWriteId,\n    'Stacking an older write on top of newer ones'\n  );\n  if (visible === undefined) {\n    visible = true;\n  }\n  writeTree.allWrites.push({\n    path,\n    snap,\n    writeId,\n    visible\n  });\n\n  if (visible) {\n    writeTree.visibleWrites = compoundWriteAddWrite(\n      writeTree.visibleWrites,\n      path,\n      snap\n    );\n  }\n  writeTree.lastWriteId = writeId;\n}\n\n/**\n * Record a new merge from user code.\n */\nexport function writeTreeAddMerge(\n  writeTree: WriteTree,\n  path: Path,\n  changedChildren: { [k: string]: Node },\n  writeId: number\n) {\n  assert(\n    writeId > writeTree.lastWriteId,\n    'Stacking an older merge on top of newer ones'\n  );\n  writeTree.allWrites.push({\n    path,\n    children: changedChildren,\n    writeId,\n    visible: true\n  });\n\n  writeTree.visibleWrites = compoundWriteAddWrites(\n    writeTree.visibleWrites,\n    path,\n    changedChildren\n  );\n  writeTree.lastWriteId = writeId;\n}\n\nexport function writeTreeGetWrite(\n  writeTree: WriteTree,\n  writeId: number\n): WriteRecord | null {\n  for (let i = 0; i < writeTree.allWrites.length; i++) {\n    const record = writeTree.allWrites[i];\n    if (record.writeId === writeId) {\n      return record;\n    }\n  }\n  return null;\n}\n\n/**\n * Remove a write (either an overwrite or merge) that has been successfully acknowledge by the server. Recalculates\n * the tree if necessary.  We return true if it may have been visible, meaning views need to reevaluate.\n *\n * @returns true if the write may have been visible (meaning we'll need to reevaluate / raise\n * events as a result).\n */\nexport function writeTreeRemoveWrite(\n  writeTree: WriteTree,\n  writeId: number\n): boolean {\n  // Note: disabling this check. It could be a transaction that preempted another transaction, and thus was applied\n  // out of order.\n  //const validClear = revert || this.allWrites_.length === 0 || writeId <= this.allWrites_[0].writeId;\n  //assert(validClear, \"Either we don't have this write, or it's the first one in the queue\");\n\n  const idx = writeTree.allWrites.findIndex(s => {\n    return s.writeId === writeId;\n  });\n  assert(idx >= 0, 'removeWrite called with nonexistent writeId.');\n  const writeToRemove = writeTree.allWrites[idx];\n  writeTree.allWrites.splice(idx, 1);\n\n  let removedWriteWasVisible = writeToRemove.visible;\n  let removedWriteOverlapsWithOtherWrites = false;\n\n  let i = writeTree.allWrites.length - 1;\n\n  while (removedWriteWasVisible && i >= 0) {\n    const currentWrite = writeTree.allWrites[i];\n    if (currentWrite.visible) {\n      if (\n        i >= idx &&\n        writeTreeRecordContainsPath_(currentWrite, writeToRemove.path)\n      ) {\n        // The removed write was completely shadowed by a subsequent write.\n        removedWriteWasVisible = false;\n      } else if (pathContains(writeToRemove.path, currentWrite.path)) {\n        // Either we're covering some writes or they're covering part of us (depending on which came first).\n        removedWriteOverlapsWithOtherWrites = true;\n      }\n    }\n    i--;\n  }\n\n  if (!removedWriteWasVisible) {\n    return false;\n  } else if (removedWriteOverlapsWithOtherWrites) {\n    // There's some shadowing going on. Just rebuild the visible writes from scratch.\n    writeTreeResetTree_(writeTree);\n    return true;\n  } else {\n    // There's no shadowing.  We can safely just remove the write(s) from visibleWrites.\n    if (writeToRemove.snap) {\n      writeTree.visibleWrites = compoundWriteRemoveWrite(\n        writeTree.visibleWrites,\n        writeToRemove.path\n      );\n    } else {\n      const children = writeToRemove.children;\n      each(children, (childName: string) => {\n        writeTree.visibleWrites = compoundWriteRemoveWrite(\n          writeTree.visibleWrites,\n          pathChild(writeToRemove.path, childName)\n        );\n      });\n    }\n    return true;\n  }\n}\n\nfunction writeTreeRecordContainsPath_(\n  writeRecord: WriteRecord,\n  path: Path\n): boolean {\n  if (writeRecord.snap) {\n    return pathContains(writeRecord.path, path);\n  } else {\n    for (const childName in writeRecord.children) {\n      if (\n        writeRecord.children.hasOwnProperty(childName) &&\n        pathContains(pathChild(writeRecord.path, childName), path)\n      ) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n\n/**\n * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n */\nfunction writeTreeResetTree_(writeTree: WriteTree) {\n  writeTree.visibleWrites = writeTreeLayerTree_(\n    writeTree.allWrites,\n    writeTreeDefaultFilter_,\n    newEmptyPath()\n  );\n  if (writeTree.allWrites.length > 0) {\n    writeTree.lastWriteId =\n      writeTree.allWrites[writeTree.allWrites.length - 1].writeId;\n  } else {\n    writeTree.lastWriteId = -1;\n  }\n}\n\n/**\n * The default filter used when constructing the tree. Keep everything that's visible.\n */\nfunction writeTreeDefaultFilter_(write: WriteRecord) {\n  return write.visible;\n}\n\n/**\n * Static method. Given an array of WriteRecords, a filter for which ones to include, and a path, construct the tree of\n * event data at that path.\n */\nfunction writeTreeLayerTree_(\n  writes: WriteRecord[],\n  filter: (w: WriteRecord) => boolean,\n  treeRoot: Path\n): CompoundWrite {\n  let compoundWrite = CompoundWrite.empty();\n  for (let i = 0; i < writes.length; ++i) {\n    const write = writes[i];\n    // Theory, a later set will either:\n    // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\n    // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\n    if (filter(write)) {\n      const writePath = write.path;\n      let relativePath: Path;\n      if (write.snap) {\n        if (pathContains(treeRoot, writePath)) {\n          relativePath = newRelativePath(treeRoot, writePath);\n          compoundWrite = compoundWriteAddWrite(\n            compoundWrite,\n            relativePath,\n            write.snap\n          );\n        } else if (pathContains(writePath, treeRoot)) {\n          relativePath = newRelativePath(writePath, treeRoot);\n          compoundWrite = compoundWriteAddWrite(\n            compoundWrite,\n            newEmptyPath(),\n            write.snap.getChild(relativePath)\n          );\n        } else {\n          // There is no overlap between root path and write path, ignore write\n        }\n      } else if (write.children) {\n        if (pathContains(treeRoot, writePath)) {\n          relativePath = newRelativePath(treeRoot, writePath);\n          compoundWrite = compoundWriteAddWrites(\n            compoundWrite,\n            relativePath,\n            write.children\n          );\n        } else if (pathContains(writePath, treeRoot)) {\n          relativePath = newRelativePath(writePath, treeRoot);\n          if (pathIsEmpty(relativePath)) {\n            compoundWrite = compoundWriteAddWrites(\n              compoundWrite,\n              newEmptyPath(),\n              write.children\n            );\n          } else {\n            const child = safeGet(write.children, pathGetFront(relativePath));\n            if (child) {\n              // There exists a child in this node that matches the root path\n              const deepNode = child.getChild(pathPopFront(relativePath));\n              compoundWrite = compoundWriteAddWrite(\n                compoundWrite,\n                newEmptyPath(),\n                deepNode\n              );\n            }\n          }\n        } else {\n          // There is no overlap between root path and write path, ignore write\n        }\n      } else {\n        throw assertionError('WriteRecord should have .snap or .children');\n      }\n    }\n  }\n  return compoundWrite;\n}\n\n/**\n * Return a complete snapshot for the given path if there's visible write data at that path, else null.\n * No server data is considered.\n *\n */\nexport function writeTreeGetCompleteWriteData(\n  writeTree: WriteTree,\n  path: Path\n): Node | null {\n  return compoundWriteGetCompleteNode(writeTree.visibleWrites, path);\n}\n\n/**\n * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\n * writes), attempt to calculate a complete snapshot for the given path\n *\n * @param writeIdsToExclude - An optional set to be excluded\n * @param includeHiddenWrites - Defaults to false, whether or not to layer on writes with visible set to false\n */\nexport function writeTreeCalcCompleteEventCache(\n  writeTree: WriteTree,\n  treePath: Path,\n  completeServerCache: Node | null,\n  writeIdsToExclude?: number[],\n  includeHiddenWrites?: boolean\n): Node | null {\n  if (!writeIdsToExclude && !includeHiddenWrites) {\n    const shadowingNode = compoundWriteGetCompleteNode(\n      writeTree.visibleWrites,\n      treePath\n    );\n    if (shadowingNode != null) {\n      return shadowingNode;\n    } else {\n      const subMerge = compoundWriteChildCompoundWrite(\n        writeTree.visibleWrites,\n        treePath\n      );\n      if (compoundWriteIsEmpty(subMerge)) {\n        return completeServerCache;\n      } else if (\n        completeServerCache == null &&\n        !compoundWriteHasCompleteWrite(subMerge, newEmptyPath())\n      ) {\n        // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\n        return null;\n      } else {\n        const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n        return compoundWriteApply(subMerge, layeredCache);\n      }\n    }\n  } else {\n    const merge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      treePath\n    );\n    if (!includeHiddenWrites && compoundWriteIsEmpty(merge)) {\n      return completeServerCache;\n    } else {\n      // If the server cache is null, and we don't have a complete cache, we need to return null\n      if (\n        !includeHiddenWrites &&\n        completeServerCache == null &&\n        !compoundWriteHasCompleteWrite(merge, newEmptyPath())\n      ) {\n        return null;\n      } else {\n        const filter = function (write: WriteRecord) {\n          return (\n            (write.visible || includeHiddenWrites) &&\n            (!writeIdsToExclude ||\n              !~writeIdsToExclude.indexOf(write.writeId)) &&\n            (pathContains(write.path, treePath) ||\n              pathContains(treePath, write.path))\n          );\n        };\n        const mergeAtPath = writeTreeLayerTree_(\n          writeTree.allWrites,\n          filter,\n          treePath\n        );\n        const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n        return compoundWriteApply(mergeAtPath, layeredCache);\n      }\n    }\n  }\n}\n\n/**\n * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\n * Used when creating new views, to pre-fill their complete event children snapshot.\n */\nexport function writeTreeCalcCompleteEventChildren(\n  writeTree: WriteTree,\n  treePath: Path,\n  completeServerChildren: ChildrenNode | null\n) {\n  let completeChildren = ChildrenNode.EMPTY_NODE as Node;\n  const topLevelSet = compoundWriteGetCompleteNode(\n    writeTree.visibleWrites,\n    treePath\n  );\n  if (topLevelSet) {\n    if (!topLevelSet.isLeafNode()) {\n      // we're shadowing everything. Return the children.\n      topLevelSet.forEachChild(PRIORITY_INDEX, (childName, childSnap) => {\n        completeChildren = completeChildren.updateImmediateChild(\n          childName,\n          childSnap\n        );\n      });\n    }\n    return completeChildren;\n  } else if (completeServerChildren) {\n    // Layer any children we have on top of this\n    // We know we don't have a top-level set, so just enumerate existing children\n    const merge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      treePath\n    );\n    completeServerChildren.forEachChild(\n      PRIORITY_INDEX,\n      (childName, childNode) => {\n        const node = compoundWriteApply(\n          compoundWriteChildCompoundWrite(merge, new Path(childName)),\n          childNode\n        );\n        completeChildren = completeChildren.updateImmediateChild(\n          childName,\n          node\n        );\n      }\n    );\n    // Add any complete children we have from the set\n    compoundWriteGetCompleteChildren(merge).forEach(namedNode => {\n      completeChildren = completeChildren.updateImmediateChild(\n        namedNode.name,\n        namedNode.node\n      );\n    });\n    return completeChildren;\n  } else {\n    // We don't have anything to layer on top of. Layer on any children we have\n    // Note that we can return an empty snap if we have a defined delete\n    const merge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      treePath\n    );\n    compoundWriteGetCompleteChildren(merge).forEach(namedNode => {\n      completeChildren = completeChildren.updateImmediateChild(\n        namedNode.name,\n        namedNode.node\n      );\n    });\n    return completeChildren;\n  }\n}\n\n/**\n * Given that the underlying server data has updated, determine what, if anything, needs to be\n * applied to the event cache.\n *\n * Possibilities:\n *\n * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n *\n * 2. Some write is completely shadowing. No events to be raised\n *\n * 3. Is partially shadowed. Events\n *\n * Either existingEventSnap or existingServerSnap must exist\n */\nexport function writeTreeCalcEventCacheAfterServerOverwrite(\n  writeTree: WriteTree,\n  treePath: Path,\n  childPath: Path,\n  existingEventSnap: Node | null,\n  existingServerSnap: Node | null\n): Node | null {\n  assert(\n    existingEventSnap || existingServerSnap,\n    'Either existingEventSnap or existingServerSnap must exist'\n  );\n  const path = pathChild(treePath, childPath);\n  if (compoundWriteHasCompleteWrite(writeTree.visibleWrites, path)) {\n    // At this point we can probably guarantee that we're in case 2, meaning no events\n    // May need to check visibility while doing the findRootMostValueAndPath call\n    return null;\n  } else {\n    // No complete shadowing. We're either partially shadowing or not shadowing at all.\n    const childMerge = compoundWriteChildCompoundWrite(\n      writeTree.visibleWrites,\n      path\n    );\n    if (compoundWriteIsEmpty(childMerge)) {\n      // We're not shadowing at all. Case 1\n      return existingServerSnap.getChild(childPath);\n    } else {\n      // This could be more efficient if the serverNode + updates doesn't change the eventSnap\n      // However this is tricky to find out, since user updates don't necessary change the server\n      // snap, e.g. priority updates on empty nodes, or deep deletes. Another special case is if the server\n      // adds nodes, but doesn't change any existing writes. It is therefore not enough to\n      // only check if the updates change the serverNode.\n      // Maybe check if the merge tree contains these special cases and only do a full overwrite in that case?\n      return compoundWriteApply(\n        childMerge,\n        existingServerSnap.getChild(childPath)\n      );\n    }\n  }\n}\n\n/**\n * Returns a complete child for a given server snap after applying all user writes or null if there is no\n * complete child for this ChildKey.\n */\nexport function writeTreeCalcCompleteChild(\n  writeTree: WriteTree,\n  treePath: Path,\n  childKey: string,\n  existingServerSnap: CacheNode\n): Node | null {\n  const path = pathChild(treePath, childKey);\n  const shadowingNode = compoundWriteGetCompleteNode(\n    writeTree.visibleWrites,\n    path\n  );\n  if (shadowingNode != null) {\n    return shadowingNode;\n  } else {\n    if (existingServerSnap.isCompleteForChild(childKey)) {\n      const childMerge = compoundWriteChildCompoundWrite(\n        writeTree.visibleWrites,\n        path\n      );\n      return compoundWriteApply(\n        childMerge,\n        existingServerSnap.getNode().getImmediateChild(childKey)\n      );\n    } else {\n      return null;\n    }\n  }\n}\n\n/**\n * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n * a higher path, this will return the child of that write relative to the write and this path.\n * Returns null if there is no write at this path.\n */\nexport function writeTreeShadowingWrite(\n  writeTree: WriteTree,\n  path: Path\n): Node | null {\n  return compoundWriteGetCompleteNode(writeTree.visibleWrites, path);\n}\n\n/**\n * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n * the window, but may now be in the window.\n */\nexport function writeTreeCalcIndexedSlice(\n  writeTree: WriteTree,\n  treePath: Path,\n  completeServerData: Node | null,\n  startPost: NamedNode,\n  count: number,\n  reverse: boolean,\n  index: Index\n): NamedNode[] {\n  let toIterate: Node;\n  const merge = compoundWriteChildCompoundWrite(\n    writeTree.visibleWrites,\n    treePath\n  );\n  const shadowingNode = compoundWriteGetCompleteNode(merge, newEmptyPath());\n  if (shadowingNode != null) {\n    toIterate = shadowingNode;\n  } else if (completeServerData != null) {\n    toIterate = compoundWriteApply(merge, completeServerData);\n  } else {\n    // no children to iterate on\n    return [];\n  }\n  toIterate = toIterate.withIndex(index);\n  if (!toIterate.isEmpty() && !toIterate.isLeafNode()) {\n    const nodes = [];\n    const cmp = index.getCompare();\n    const iter = reverse\n      ? (toIterate as ChildrenNode).getReverseIteratorFrom(startPost, index)\n      : (toIterate as ChildrenNode).getIteratorFrom(startPost, index);\n    let next = iter.getNext();\n    while (next && nodes.length < count) {\n      if (cmp(next, startPost) !== 0) {\n        nodes.push(next);\n      }\n      next = iter.getNext();\n    }\n    return nodes;\n  } else {\n    return [];\n  }\n}\n\nexport function newWriteTree(): WriteTree {\n  return {\n    visibleWrites: CompoundWrite.empty(),\n    allWrites: [],\n    lastWriteId: -1\n  };\n}\n\n/**\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\n * and addMerge(), and removed with removeWrite().\n */\nexport interface WriteTree {\n  /**\n   * A tree tracking the result of applying all visible writes.  This does not include transactions with\n   * applyLocally=false or writes that are completely shadowed by other writes.\n   */\n  visibleWrites: CompoundWrite;\n\n  /**\n   * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\n   * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\n   * used by transactions).\n   */\n  allWrites: WriteRecord[];\n\n  lastWriteId: number;\n}\n\n/**\n * If possible, returns a complete event cache, using the underlying server data if possible. In addition, can be used\n * to get a cache that includes hidden writes, and excludes arbitrary writes. Note that customizing the returned node\n * can lead to a more expensive calculation.\n *\n * @param writeIdsToExclude - Optional writes to exclude.\n * @param includeHiddenWrites - Defaults to false, whether or not to layer on writes with visible set to false\n */\nexport function writeTreeRefCalcCompleteEventCache(\n  writeTreeRef: WriteTreeRef,\n  completeServerCache: Node | null,\n  writeIdsToExclude?: number[],\n  includeHiddenWrites?: boolean\n): Node | null {\n  return writeTreeCalcCompleteEventCache(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    completeServerCache,\n    writeIdsToExclude,\n    includeHiddenWrites\n  );\n}\n\n/**\n * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\n * mix of the given server data and write data.\n *\n */\nexport function writeTreeRefCalcCompleteEventChildren(\n  writeTreeRef: WriteTreeRef,\n  completeServerChildren: ChildrenNode | null\n): ChildrenNode {\n  return writeTreeCalcCompleteEventChildren(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    completeServerChildren\n  ) as ChildrenNode;\n}\n\n/**\n * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\n * if anything, needs to be applied to the event cache.\n *\n * Possibilities:\n *\n * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n *\n * 2. Some write is completely shadowing. No events to be raised\n *\n * 3. Is partially shadowed. Events should be raised\n *\n * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\n *\n *\n */\nexport function writeTreeRefCalcEventCacheAfterServerOverwrite(\n  writeTreeRef: WriteTreeRef,\n  path: Path,\n  existingEventSnap: Node | null,\n  existingServerSnap: Node | null\n): Node | null {\n  return writeTreeCalcEventCacheAfterServerOverwrite(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    path,\n    existingEventSnap,\n    existingServerSnap\n  );\n}\n\n/**\n * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n * a higher path, this will return the child of that write relative to the write and this path.\n * Returns null if there is no write at this path.\n *\n */\nexport function writeTreeRefShadowingWrite(\n  writeTreeRef: WriteTreeRef,\n  path: Path\n): Node | null {\n  return writeTreeShadowingWrite(\n    writeTreeRef.writeTree,\n    pathChild(writeTreeRef.treePath, path)\n  );\n}\n\n/**\n * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n * the window, but may now be in the window\n */\nexport function writeTreeRefCalcIndexedSlice(\n  writeTreeRef: WriteTreeRef,\n  completeServerData: Node | null,\n  startPost: NamedNode,\n  count: number,\n  reverse: boolean,\n  index: Index\n): NamedNode[] {\n  return writeTreeCalcIndexedSlice(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    completeServerData,\n    startPost,\n    count,\n    reverse,\n    index\n  );\n}\n\n/**\n * Returns a complete child for a given server snap after applying all user writes or null if there is no\n * complete child for this ChildKey.\n */\nexport function writeTreeRefCalcCompleteChild(\n  writeTreeRef: WriteTreeRef,\n  childKey: string,\n  existingServerCache: CacheNode\n): Node | null {\n  return writeTreeCalcCompleteChild(\n    writeTreeRef.writeTree,\n    writeTreeRef.treePath,\n    childKey,\n    existingServerCache\n  );\n}\n\n/**\n * Return a WriteTreeRef for a child.\n */\nexport function writeTreeRefChild(\n  writeTreeRef: WriteTreeRef,\n  childName: string\n): WriteTreeRef {\n  return newWriteTreeRef(\n    pathChild(writeTreeRef.treePath, childName),\n    writeTreeRef.writeTree\n  );\n}\n\nexport function newWriteTreeRef(\n  path: Path,\n  writeTree: WriteTree\n): WriteTreeRef {\n  return {\n    treePath: path,\n    writeTree\n  };\n}\n\n/**\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\n * just proxy to the underlying WriteTree.\n *\n */\nexport interface WriteTreeRef {\n  /**\n   * The path to this particular write tree ref. Used for calling methods on writeTree_ while exposing a simpler\n   * interface to callers.\n   */\n  readonly treePath: Path;\n\n  /**\n   * * A reference to the actual tree of write data. All methods are pass-through to the tree, but with the appropriate\n   * path prefixed.\n   *\n   * This lets us make cheap references to points in the tree for sync points without having to copy and maintain all of\n   * the data.\n   */\n  readonly writeTree: WriteTree;\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 { assert, assertionError } from '@firebase/util';\n\nimport {\n  Change,\n  ChangeType,\n  changeChildAdded,\n  changeChildChanged,\n  changeChildRemoved\n} from './Change';\n\nexport class ChildChangeAccumulator {\n  private readonly changeMap: Map<string, Change> = new Map();\n\n  trackChildChange(change: Change) {\n    const type = change.type;\n    const childKey = change.childName!;\n    assert(\n      type === ChangeType.CHILD_ADDED ||\n        type === ChangeType.CHILD_CHANGED ||\n        type === ChangeType.CHILD_REMOVED,\n      'Only child changes supported for tracking'\n    );\n    assert(\n      childKey !== '.priority',\n      'Only non-priority child changes can be tracked.'\n    );\n    const oldChange = this.changeMap.get(childKey);\n    if (oldChange) {\n      const oldType = oldChange.type;\n      if (\n        type === ChangeType.CHILD_ADDED &&\n        oldType === ChangeType.CHILD_REMOVED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildChanged(\n            childKey,\n            change.snapshotNode,\n            oldChange.snapshotNode\n          )\n        );\n      } else if (\n        type === ChangeType.CHILD_REMOVED &&\n        oldType === ChangeType.CHILD_ADDED\n      ) {\n        this.changeMap.delete(childKey);\n      } else if (\n        type === ChangeType.CHILD_REMOVED &&\n        oldType === ChangeType.CHILD_CHANGED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildRemoved(childKey, oldChange.oldSnap)\n        );\n      } else if (\n        type === ChangeType.CHILD_CHANGED &&\n        oldType === ChangeType.CHILD_ADDED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildAdded(childKey, change.snapshotNode)\n        );\n      } else if (\n        type === ChangeType.CHILD_CHANGED &&\n        oldType === ChangeType.CHILD_CHANGED\n      ) {\n        this.changeMap.set(\n          childKey,\n          changeChildChanged(childKey, change.snapshotNode, oldChange.oldSnap)\n        );\n      } else {\n        throw assertionError(\n          'Illegal combination of changes: ' +\n            change +\n            ' occurred after ' +\n            oldChange\n        );\n      }\n    } else {\n      this.changeMap.set(childKey, change);\n    }\n  }\n\n  getChanges(): Change[] {\n    return Array.from(this.changeMap.values());\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\nimport { Index } from '../snap/indexes/Index';\nimport { NamedNode, Node } from '../snap/Node';\nimport {\n  WriteTreeRef,\n  writeTreeRefCalcCompleteChild,\n  writeTreeRefCalcIndexedSlice\n} from '../WriteTree';\n\nimport { CacheNode } from './CacheNode';\nimport { ViewCache, viewCacheGetCompleteServerSnap } from './ViewCache';\n\n/**\n * Since updates to filtered nodes might require nodes to be pulled in from \"outside\" the node, this interface\n * can help to get complete children that can be pulled in.\n * A class implementing this interface takes potentially multiple sources (e.g. user writes, server data from\n * other views etc.) to try it's best to get a complete child that might be useful in pulling into the view.\n *\n * @interface\n */\nexport interface CompleteChildSource {\n  getCompleteChild(childKey: string): Node | null;\n\n  getChildAfterChild(\n    index: Index,\n    child: NamedNode,\n    reverse: boolean\n  ): NamedNode | null;\n}\n\n/**\n * An implementation of CompleteChildSource that never returns any additional children\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nexport class NoCompleteChildSource_ implements CompleteChildSource {\n  getCompleteChild(childKey?: string): Node | null {\n    return null;\n  }\n  getChildAfterChild(\n    index?: Index,\n    child?: NamedNode,\n    reverse?: boolean\n  ): NamedNode | null {\n    return null;\n  }\n}\n\n/**\n * Singleton instance.\n */\nexport const NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\n\n/**\n * An implementation of CompleteChildSource that uses a WriteTree in addition to any other server data or\n * old event caches available to calculate complete children.\n */\nexport class WriteTreeCompleteChildSource implements CompleteChildSource {\n  constructor(\n    private writes_: WriteTreeRef,\n    private viewCache_: ViewCache,\n    private optCompleteServerCache_: Node | null = null\n  ) {}\n  getCompleteChild(childKey: string): Node | null {\n    const node = this.viewCache_.eventCache;\n    if (node.isCompleteForChild(childKey)) {\n      return node.getNode().getImmediateChild(childKey);\n    } else {\n      const serverNode =\n        this.optCompleteServerCache_ != null\n          ? new CacheNode(this.optCompleteServerCache_, true, false)\n          : this.viewCache_.serverCache;\n      return writeTreeRefCalcCompleteChild(this.writes_, childKey, serverNode);\n    }\n  }\n  getChildAfterChild(\n    index: Index,\n    child: NamedNode,\n    reverse: boolean\n  ): NamedNode | null {\n    const completeServerData =\n      this.optCompleteServerCache_ != null\n        ? this.optCompleteServerCache_\n        : viewCacheGetCompleteServerSnap(this.viewCache_);\n    const nodes = writeTreeRefCalcIndexedSlice(\n      this.writes_,\n      completeServerData,\n      child,\n      1,\n      reverse,\n      index\n    );\n    if (nodes.length === 0) {\n      return null;\n    } else {\n      return nodes[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\nimport { assert, assertionError } from '@firebase/util';\n\nimport { AckUserWrite } from '../operation/AckUserWrite';\nimport { Merge } from '../operation/Merge';\nimport { Operation, OperationType } from '../operation/Operation';\nimport { Overwrite } from '../operation/Overwrite';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { KEY_INDEX } from '../snap/indexes/KeyIndex';\nimport { Node } from '../snap/Node';\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport {\n  newEmptyPath,\n  Path,\n  pathChild,\n  pathGetBack,\n  pathGetFront,\n  pathGetLength,\n  pathIsEmpty,\n  pathParent,\n  pathPopFront\n} from '../util/Path';\nimport {\n  WriteTreeRef,\n  writeTreeRefCalcCompleteChild,\n  writeTreeRefCalcCompleteEventCache,\n  writeTreeRefCalcCompleteEventChildren,\n  writeTreeRefCalcEventCacheAfterServerOverwrite,\n  writeTreeRefShadowingWrite\n} from '../WriteTree';\n\nimport { Change, changeValue } from './Change';\nimport { ChildChangeAccumulator } from './ChildChangeAccumulator';\nimport {\n  CompleteChildSource,\n  NO_COMPLETE_CHILD_SOURCE,\n  WriteTreeCompleteChildSource\n} from './CompleteChildSource';\nimport { NodeFilter } from './filter/NodeFilter';\nimport {\n  ViewCache,\n  viewCacheGetCompleteEventSnap,\n  viewCacheGetCompleteServerSnap,\n  viewCacheUpdateEventSnap,\n  viewCacheUpdateServerSnap\n} from './ViewCache';\n\nexport interface ProcessorResult {\n  readonly viewCache: ViewCache;\n  readonly changes: Change[];\n}\n\nexport interface ViewProcessor {\n  readonly filter: NodeFilter;\n}\n\nexport function newViewProcessor(filter: NodeFilter): ViewProcessor {\n  return { filter };\n}\n\nexport function viewProcessorAssertIndexed(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache\n): void {\n  assert(\n    viewCache.eventCache.getNode().isIndexed(viewProcessor.filter.getIndex()),\n    'Event snap not indexed'\n  );\n  assert(\n    viewCache.serverCache.getNode().isIndexed(viewProcessor.filter.getIndex()),\n    'Server snap not indexed'\n  );\n}\n\nexport function viewProcessorApplyOperation(\n  viewProcessor: ViewProcessor,\n  oldViewCache: ViewCache,\n  operation: Operation,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null\n): ProcessorResult {\n  const accumulator = new ChildChangeAccumulator();\n  let newViewCache, filterServerNode;\n  if (operation.type === OperationType.OVERWRITE) {\n    const overwrite = operation as Overwrite;\n    if (overwrite.source.fromUser) {\n      newViewCache = viewProcessorApplyUserOverwrite(\n        viewProcessor,\n        oldViewCache,\n        overwrite.path,\n        overwrite.snap,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    } else {\n      assert(overwrite.source.fromServer, 'Unknown source.');\n      // We filter the node if it's a tagged update or the node has been previously filtered  and the\n      // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n      // again\n      filterServerNode =\n        overwrite.source.tagged ||\n        (oldViewCache.serverCache.isFiltered() && !pathIsEmpty(overwrite.path));\n      newViewCache = viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        oldViewCache,\n        overwrite.path,\n        overwrite.snap,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  } else if (operation.type === OperationType.MERGE) {\n    const merge = operation as Merge;\n    if (merge.source.fromUser) {\n      newViewCache = viewProcessorApplyUserMerge(\n        viewProcessor,\n        oldViewCache,\n        merge.path,\n        merge.children,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    } else {\n      assert(merge.source.fromServer, 'Unknown source.');\n      // We filter the node if it's a tagged update or the node has been previously filtered\n      filterServerNode =\n        merge.source.tagged || oldViewCache.serverCache.isFiltered();\n      newViewCache = viewProcessorApplyServerMerge(\n        viewProcessor,\n        oldViewCache,\n        merge.path,\n        merge.children,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  } else if (operation.type === OperationType.ACK_USER_WRITE) {\n    const ackUserWrite = operation as AckUserWrite;\n    if (!ackUserWrite.revert) {\n      newViewCache = viewProcessorAckUserWrite(\n        viewProcessor,\n        oldViewCache,\n        ackUserWrite.path,\n        ackUserWrite.affectedTree,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    } else {\n      newViewCache = viewProcessorRevertUserWrite(\n        viewProcessor,\n        oldViewCache,\n        ackUserWrite.path,\n        writesCache,\n        completeCache,\n        accumulator\n      );\n    }\n  } else if (operation.type === OperationType.LISTEN_COMPLETE) {\n    newViewCache = viewProcessorListenComplete(\n      viewProcessor,\n      oldViewCache,\n      operation.path,\n      writesCache,\n      accumulator\n    );\n  } else {\n    throw assertionError('Unknown operation type: ' + operation.type);\n  }\n  const changes = accumulator.getChanges();\n  viewProcessorMaybeAddValueEvent(oldViewCache, newViewCache, changes);\n  return { viewCache: newViewCache, changes };\n}\n\nfunction viewProcessorMaybeAddValueEvent(\n  oldViewCache: ViewCache,\n  newViewCache: ViewCache,\n  accumulator: Change[]\n): void {\n  const eventSnap = newViewCache.eventCache;\n  if (eventSnap.isFullyInitialized()) {\n    const isLeafOrEmpty =\n      eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n    const oldCompleteSnap = viewCacheGetCompleteEventSnap(oldViewCache);\n    if (\n      accumulator.length > 0 ||\n      !oldViewCache.eventCache.isFullyInitialized() ||\n      (isLeafOrEmpty && !eventSnap.getNode().equals(oldCompleteSnap)) ||\n      !eventSnap.getNode().getPriority().equals(oldCompleteSnap.getPriority())\n    ) {\n      accumulator.push(\n        changeValue(viewCacheGetCompleteEventSnap(newViewCache))\n      );\n    }\n  }\n}\n\nfunction viewProcessorGenerateEventCacheAfterServerEvent(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  changePath: Path,\n  writesCache: WriteTreeRef,\n  source: CompleteChildSource,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldEventSnap = viewCache.eventCache;\n  if (writeTreeRefShadowingWrite(writesCache, changePath) != null) {\n    // we have a shadowing write, ignore changes\n    return viewCache;\n  } else {\n    let newEventCache, serverNode;\n    if (pathIsEmpty(changePath)) {\n      // TODO: figure out how this plays with \"sliding ack windows\"\n      assert(\n        viewCache.serverCache.isFullyInitialized(),\n        'If change path is empty, we must have complete server data'\n      );\n      if (viewCache.serverCache.isFiltered()) {\n        // We need to special case this, because we need to only apply writes to complete children, or\n        // we might end up raising events for incomplete children. If the server data is filtered deep\n        // writes cannot be guaranteed to be complete\n        const serverCache = viewCacheGetCompleteServerSnap(viewCache);\n        const completeChildren =\n          serverCache instanceof ChildrenNode\n            ? serverCache\n            : ChildrenNode.EMPTY_NODE;\n        const completeEventChildren = writeTreeRefCalcCompleteEventChildren(\n          writesCache,\n          completeChildren\n        );\n        newEventCache = viewProcessor.filter.updateFullNode(\n          viewCache.eventCache.getNode(),\n          completeEventChildren,\n          accumulator\n        );\n      } else {\n        const completeNode = writeTreeRefCalcCompleteEventCache(\n          writesCache,\n          viewCacheGetCompleteServerSnap(viewCache)\n        );\n        newEventCache = viewProcessor.filter.updateFullNode(\n          viewCache.eventCache.getNode(),\n          completeNode,\n          accumulator\n        );\n      }\n    } else {\n      const childKey = pathGetFront(changePath);\n      if (childKey === '.priority') {\n        assert(\n          pathGetLength(changePath) === 1,\n          \"Can't have a priority with additional path components\"\n        );\n        const oldEventNode = oldEventSnap.getNode();\n        serverNode = viewCache.serverCache.getNode();\n        // we might have overwrites for this priority\n        const updatedPriority = writeTreeRefCalcEventCacheAfterServerOverwrite(\n          writesCache,\n          changePath,\n          oldEventNode,\n          serverNode\n        );\n        if (updatedPriority != null) {\n          newEventCache = viewProcessor.filter.updatePriority(\n            oldEventNode,\n            updatedPriority\n          );\n        } else {\n          // priority didn't change, keep old node\n          newEventCache = oldEventSnap.getNode();\n        }\n      } else {\n        const childChangePath = pathPopFront(changePath);\n        // update child\n        let newEventChild;\n        if (oldEventSnap.isCompleteForChild(childKey)) {\n          serverNode = viewCache.serverCache.getNode();\n          const eventChildUpdate =\n            writeTreeRefCalcEventCacheAfterServerOverwrite(\n              writesCache,\n              changePath,\n              oldEventSnap.getNode(),\n              serverNode\n            );\n          if (eventChildUpdate != null) {\n            newEventChild = oldEventSnap\n              .getNode()\n              .getImmediateChild(childKey)\n              .updateChild(childChangePath, eventChildUpdate);\n          } else {\n            // Nothing changed, just keep the old child\n            newEventChild = oldEventSnap.getNode().getImmediateChild(childKey);\n          }\n        } else {\n          newEventChild = writeTreeRefCalcCompleteChild(\n            writesCache,\n            childKey,\n            viewCache.serverCache\n          );\n        }\n        if (newEventChild != null) {\n          newEventCache = viewProcessor.filter.updateChild(\n            oldEventSnap.getNode(),\n            childKey,\n            newEventChild,\n            childChangePath,\n            source,\n            accumulator\n          );\n        } else {\n          // no complete child available or no change\n          newEventCache = oldEventSnap.getNode();\n        }\n      }\n    }\n    return viewCacheUpdateEventSnap(\n      viewCache,\n      newEventCache,\n      oldEventSnap.isFullyInitialized() || pathIsEmpty(changePath),\n      viewProcessor.filter.filtersNodes()\n    );\n  }\n}\n\nfunction viewProcessorApplyServerOverwrite(\n  viewProcessor: ViewProcessor,\n  oldViewCache: ViewCache,\n  changePath: Path,\n  changedSnap: Node,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null,\n  filterServerNode: boolean,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldServerSnap = oldViewCache.serverCache;\n  let newServerCache;\n  const serverFilter = filterServerNode\n    ? viewProcessor.filter\n    : viewProcessor.filter.getIndexedFilter();\n  if (pathIsEmpty(changePath)) {\n    newServerCache = serverFilter.updateFullNode(\n      oldServerSnap.getNode(),\n      changedSnap,\n      null\n    );\n  } else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\n    // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\n    const newServerNode = oldServerSnap\n      .getNode()\n      .updateChild(changePath, changedSnap);\n    newServerCache = serverFilter.updateFullNode(\n      oldServerSnap.getNode(),\n      newServerNode,\n      null\n    );\n  } else {\n    const childKey = pathGetFront(changePath);\n    if (\n      !oldServerSnap.isCompleteForPath(changePath) &&\n      pathGetLength(changePath) > 1\n    ) {\n      // We don't update incomplete nodes with updates intended for other listeners\n      return oldViewCache;\n    }\n    const childChangePath = pathPopFront(changePath);\n    const childNode = oldServerSnap.getNode().getImmediateChild(childKey);\n    const newChildNode = childNode.updateChild(childChangePath, changedSnap);\n    if (childKey === '.priority') {\n      newServerCache = serverFilter.updatePriority(\n        oldServerSnap.getNode(),\n        newChildNode\n      );\n    } else {\n      newServerCache = serverFilter.updateChild(\n        oldServerSnap.getNode(),\n        childKey,\n        newChildNode,\n        childChangePath,\n        NO_COMPLETE_CHILD_SOURCE,\n        null\n      );\n    }\n  }\n  const newViewCache = viewCacheUpdateServerSnap(\n    oldViewCache,\n    newServerCache,\n    oldServerSnap.isFullyInitialized() || pathIsEmpty(changePath),\n    serverFilter.filtersNodes()\n  );\n  const source = new WriteTreeCompleteChildSource(\n    writesCache,\n    newViewCache,\n    completeCache\n  );\n  return viewProcessorGenerateEventCacheAfterServerEvent(\n    viewProcessor,\n    newViewCache,\n    changePath,\n    writesCache,\n    source,\n    accumulator\n  );\n}\n\nfunction viewProcessorApplyUserOverwrite(\n  viewProcessor: ViewProcessor,\n  oldViewCache: ViewCache,\n  changePath: Path,\n  changedSnap: Node,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldEventSnap = oldViewCache.eventCache;\n  let newViewCache, newEventCache;\n  const source = new WriteTreeCompleteChildSource(\n    writesCache,\n    oldViewCache,\n    completeCache\n  );\n  if (pathIsEmpty(changePath)) {\n    newEventCache = viewProcessor.filter.updateFullNode(\n      oldViewCache.eventCache.getNode(),\n      changedSnap,\n      accumulator\n    );\n    newViewCache = viewCacheUpdateEventSnap(\n      oldViewCache,\n      newEventCache,\n      true,\n      viewProcessor.filter.filtersNodes()\n    );\n  } else {\n    const childKey = pathGetFront(changePath);\n    if (childKey === '.priority') {\n      newEventCache = viewProcessor.filter.updatePriority(\n        oldViewCache.eventCache.getNode(),\n        changedSnap\n      );\n      newViewCache = viewCacheUpdateEventSnap(\n        oldViewCache,\n        newEventCache,\n        oldEventSnap.isFullyInitialized(),\n        oldEventSnap.isFiltered()\n      );\n    } else {\n      const childChangePath = pathPopFront(changePath);\n      const oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\n      let newChild;\n      if (pathIsEmpty(childChangePath)) {\n        // Child overwrite, we can replace the child\n        newChild = changedSnap;\n      } else {\n        const childNode = source.getCompleteChild(childKey);\n        if (childNode != null) {\n          if (\n            pathGetBack(childChangePath) === '.priority' &&\n            childNode.getChild(pathParent(childChangePath)).isEmpty()\n          ) {\n            // This is a priority update on an empty node. If this node exists on the server, the\n            // server will send down the priority in the update, so ignore for now\n            newChild = childNode;\n          } else {\n            newChild = childNode.updateChild(childChangePath, changedSnap);\n          }\n        } else {\n          // There is no complete child node available\n          newChild = ChildrenNode.EMPTY_NODE;\n        }\n      }\n      if (!oldChild.equals(newChild)) {\n        const newEventSnap = viewProcessor.filter.updateChild(\n          oldEventSnap.getNode(),\n          childKey,\n          newChild,\n          childChangePath,\n          source,\n          accumulator\n        );\n        newViewCache = viewCacheUpdateEventSnap(\n          oldViewCache,\n          newEventSnap,\n          oldEventSnap.isFullyInitialized(),\n          viewProcessor.filter.filtersNodes()\n        );\n      } else {\n        newViewCache = oldViewCache;\n      }\n    }\n  }\n  return newViewCache;\n}\n\nfunction viewProcessorCacheHasChild(\n  viewCache: ViewCache,\n  childKey: string\n): boolean {\n  return viewCache.eventCache.isCompleteForChild(childKey);\n}\n\nfunction viewProcessorApplyUserMerge(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  changedChildren: ImmutableTree<Node>,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  // HACK: In the case of a limit query, there may be some changes that bump things out of the\n  // window leaving room for new items.  It's important we process these changes first, so we\n  // iterate the changes twice, first processing any that affect items currently in view.\n  // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n  // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n  // not the other.\n  let curViewCache = viewCache;\n  changedChildren.foreach((relativePath, childNode) => {\n    const writePath = pathChild(path, relativePath);\n    if (viewProcessorCacheHasChild(viewCache, pathGetFront(writePath))) {\n      curViewCache = viewProcessorApplyUserOverwrite(\n        viewProcessor,\n        curViewCache,\n        writePath,\n        childNode,\n        writesCache,\n        serverCache,\n        accumulator\n      );\n    }\n  });\n\n  changedChildren.foreach((relativePath, childNode) => {\n    const writePath = pathChild(path, relativePath);\n    if (!viewProcessorCacheHasChild(viewCache, pathGetFront(writePath))) {\n      curViewCache = viewProcessorApplyUserOverwrite(\n        viewProcessor,\n        curViewCache,\n        writePath,\n        childNode,\n        writesCache,\n        serverCache,\n        accumulator\n      );\n    }\n  });\n\n  return curViewCache;\n}\n\nfunction viewProcessorApplyMerge(\n  viewProcessor: ViewProcessor,\n  node: Node,\n  merge: ImmutableTree<Node>\n): Node {\n  merge.foreach((relativePath, childNode) => {\n    node = node.updateChild(relativePath, childNode);\n  });\n  return node;\n}\n\nfunction viewProcessorApplyServerMerge(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  changedChildren: ImmutableTree<Node>,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  filterServerNode: boolean,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n  // wait for the complete data update coming soon.\n  if (\n    viewCache.serverCache.getNode().isEmpty() &&\n    !viewCache.serverCache.isFullyInitialized()\n  ) {\n    return viewCache;\n  }\n\n  // HACK: In the case of a limit query, there may be some changes that bump things out of the\n  // window leaving room for new items.  It's important we process these changes first, so we\n  // iterate the changes twice, first processing any that affect items currently in view.\n  // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n  // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n  // not the other.\n  let curViewCache = viewCache;\n  let viewMergeTree: ImmutableTree<Node>;\n  if (pathIsEmpty(path)) {\n    viewMergeTree = changedChildren;\n  } else {\n    viewMergeTree = new ImmutableTree<Node>(null).setTree(\n      path,\n      changedChildren\n    );\n  }\n  const serverNode = viewCache.serverCache.getNode();\n  viewMergeTree.children.inorderTraversal((childKey, childTree) => {\n    if (serverNode.hasChild(childKey)) {\n      const serverChild = viewCache.serverCache\n        .getNode()\n        .getImmediateChild(childKey);\n      const newChild = viewProcessorApplyMerge(\n        viewProcessor,\n        serverChild,\n        childTree\n      );\n      curViewCache = viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        curViewCache,\n        new Path(childKey),\n        newChild,\n        writesCache,\n        serverCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  });\n  viewMergeTree.children.inorderTraversal((childKey, childMergeTree) => {\n    const isUnknownDeepMerge =\n      !viewCache.serverCache.isCompleteForChild(childKey) &&\n      childMergeTree.value === null;\n    if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n      const serverChild = viewCache.serverCache\n        .getNode()\n        .getImmediateChild(childKey);\n      const newChild = viewProcessorApplyMerge(\n        viewProcessor,\n        serverChild,\n        childMergeTree\n      );\n      curViewCache = viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        curViewCache,\n        new Path(childKey),\n        newChild,\n        writesCache,\n        serverCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  });\n\n  return curViewCache;\n}\n\nfunction viewProcessorAckUserWrite(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  ackPath: Path,\n  affectedTree: ImmutableTree<boolean>,\n  writesCache: WriteTreeRef,\n  completeCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  if (writeTreeRefShadowingWrite(writesCache, ackPath) != null) {\n    return viewCache;\n  }\n\n  // Only filter server node if it is currently filtered\n  const filterServerNode = viewCache.serverCache.isFiltered();\n\n  // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\n  // now that it won't be shadowed.\n  const serverCache = viewCache.serverCache;\n  if (affectedTree.value != null) {\n    // This is an overwrite.\n    if (\n      (pathIsEmpty(ackPath) && serverCache.isFullyInitialized()) ||\n      serverCache.isCompleteForPath(ackPath)\n    ) {\n      return viewProcessorApplyServerOverwrite(\n        viewProcessor,\n        viewCache,\n        ackPath,\n        serverCache.getNode().getChild(ackPath),\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    } else if (pathIsEmpty(ackPath)) {\n      // This is a goofy edge case where we are acking data at this location but don't have full data.  We\n      // should just re-apply whatever we have in our cache as a merge.\n      let changedChildren = new ImmutableTree<Node>(null);\n      serverCache.getNode().forEachChild(KEY_INDEX, (name, node) => {\n        changedChildren = changedChildren.set(new Path(name), node);\n      });\n      return viewProcessorApplyServerMerge(\n        viewProcessor,\n        viewCache,\n        ackPath,\n        changedChildren,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    } else {\n      return viewCache;\n    }\n  } else {\n    // This is a merge.\n    let changedChildren = new ImmutableTree<Node>(null);\n    affectedTree.foreach((mergePath, value) => {\n      const serverCachePath = pathChild(ackPath, mergePath);\n      if (serverCache.isCompleteForPath(serverCachePath)) {\n        changedChildren = changedChildren.set(\n          mergePath,\n          serverCache.getNode().getChild(serverCachePath)\n        );\n      }\n    });\n    return viewProcessorApplyServerMerge(\n      viewProcessor,\n      viewCache,\n      ackPath,\n      changedChildren,\n      writesCache,\n      completeCache,\n      filterServerNode,\n      accumulator\n    );\n  }\n}\n\nfunction viewProcessorListenComplete(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  writesCache: WriteTreeRef,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  const oldServerNode = viewCache.serverCache;\n  const newViewCache = viewCacheUpdateServerSnap(\n    viewCache,\n    oldServerNode.getNode(),\n    oldServerNode.isFullyInitialized() || pathIsEmpty(path),\n    oldServerNode.isFiltered()\n  );\n  return viewProcessorGenerateEventCacheAfterServerEvent(\n    viewProcessor,\n    newViewCache,\n    path,\n    writesCache,\n    NO_COMPLETE_CHILD_SOURCE,\n    accumulator\n  );\n}\n\nfunction viewProcessorRevertUserWrite(\n  viewProcessor: ViewProcessor,\n  viewCache: ViewCache,\n  path: Path,\n  writesCache: WriteTreeRef,\n  completeServerCache: Node | null,\n  accumulator: ChildChangeAccumulator\n): ViewCache {\n  let complete;\n  if (writeTreeRefShadowingWrite(writesCache, path) != null) {\n    return viewCache;\n  } else {\n    const source = new WriteTreeCompleteChildSource(\n      writesCache,\n      viewCache,\n      completeServerCache\n    );\n    const oldEventCache = viewCache.eventCache.getNode();\n    let newEventCache;\n    if (pathIsEmpty(path) || pathGetFront(path) === '.priority') {\n      let newNode;\n      if (viewCache.serverCache.isFullyInitialized()) {\n        newNode = writeTreeRefCalcCompleteEventCache(\n          writesCache,\n          viewCacheGetCompleteServerSnap(viewCache)\n        );\n      } else {\n        const serverChildren = viewCache.serverCache.getNode();\n        assert(\n          serverChildren instanceof ChildrenNode,\n          'serverChildren would be complete if leaf node'\n        );\n        newNode = writeTreeRefCalcCompleteEventChildren(\n          writesCache,\n          serverChildren as ChildrenNode\n        );\n      }\n      newNode = newNode as Node;\n      newEventCache = viewProcessor.filter.updateFullNode(\n        oldEventCache,\n        newNode,\n        accumulator\n      );\n    } else {\n      const childKey = pathGetFront(path);\n      let newChild = writeTreeRefCalcCompleteChild(\n        writesCache,\n        childKey,\n        viewCache.serverCache\n      );\n      if (\n        newChild == null &&\n        viewCache.serverCache.isCompleteForChild(childKey)\n      ) {\n        newChild = oldEventCache.getImmediateChild(childKey);\n      }\n      if (newChild != null) {\n        newEventCache = viewProcessor.filter.updateChild(\n          oldEventCache,\n          childKey,\n          newChild,\n          pathPopFront(path),\n          source,\n          accumulator\n        );\n      } else if (viewCache.eventCache.getNode().hasChild(childKey)) {\n        // No complete child available, delete the existing one, if any\n        newEventCache = viewProcessor.filter.updateChild(\n          oldEventCache,\n          childKey,\n          ChildrenNode.EMPTY_NODE,\n          pathPopFront(path),\n          source,\n          accumulator\n        );\n      } else {\n        newEventCache = oldEventCache;\n      }\n      if (\n        newEventCache.isEmpty() &&\n        viewCache.serverCache.isFullyInitialized()\n      ) {\n        // We might have reverted all child writes. Maybe the old event was a leaf node\n        complete = writeTreeRefCalcCompleteEventCache(\n          writesCache,\n          viewCacheGetCompleteServerSnap(viewCache)\n        );\n        if (complete.isLeafNode()) {\n          newEventCache = viewProcessor.filter.updateFullNode(\n            newEventCache,\n            complete,\n            accumulator\n          );\n        }\n      }\n    }\n    complete =\n      viewCache.serverCache.isFullyInitialized() ||\n      writeTreeRefShadowingWrite(writesCache, newEmptyPath()) != null;\n    return viewCacheUpdateEventSnap(\n      viewCache,\n      newEventCache,\n      complete,\n      viewProcessor.filter.filtersNodes()\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\nimport { assert } from '@firebase/util';\n\nimport { Operation, OperationType } from '../operation/Operation';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { Node } from '../snap/Node';\nimport { Path, pathGetFront, pathIsEmpty } from '../util/Path';\nimport { WriteTreeRef } from '../WriteTree';\n\nimport { CacheNode } from './CacheNode';\nimport { Change, changeChildAdded, changeValue } from './Change';\nimport { CancelEvent, Event } from './Event';\nimport {\n  EventGenerator,\n  eventGeneratorGenerateEventsForChanges\n} from './EventGenerator';\nimport { EventRegistration, QueryContext } from './EventRegistration';\nimport { IndexedFilter } from './filter/IndexedFilter';\nimport { queryParamsGetNodeFilter } from './QueryParams';\nimport {\n  newViewCache,\n  ViewCache,\n  viewCacheGetCompleteEventSnap,\n  viewCacheGetCompleteServerSnap\n} from './ViewCache';\nimport {\n  newViewProcessor,\n  ViewProcessor,\n  viewProcessorApplyOperation,\n  viewProcessorAssertIndexed\n} from './ViewProcessor';\n\n/**\n * A view represents a specific location and query that has 1 or more event registrations.\n *\n * It does several things:\n *  - Maintains the list of event registrations for this location/query.\n *  - Maintains a cache of the data visible for this location/query.\n *  - Applies new operations (via applyOperation), updates the cache, and based on the event\n *    registrations returns the set of events to be raised.\n */\nexport class View {\n  processor_: ViewProcessor;\n  viewCache_: ViewCache;\n  eventRegistrations_: EventRegistration[] = [];\n  eventGenerator_: EventGenerator;\n\n  constructor(private query_: QueryContext, initialViewCache: ViewCache) {\n    const params = this.query_._queryParams;\n\n    const indexFilter = new IndexedFilter(params.getIndex());\n    const filter = queryParamsGetNodeFilter(params);\n\n    this.processor_ = newViewProcessor(filter);\n\n    const initialServerCache = initialViewCache.serverCache;\n    const initialEventCache = initialViewCache.eventCache;\n\n    // Don't filter server node with other filter than index, wait for tagged listen\n    const serverSnap = indexFilter.updateFullNode(\n      ChildrenNode.EMPTY_NODE,\n      initialServerCache.getNode(),\n      null\n    );\n    const eventSnap = filter.updateFullNode(\n      ChildrenNode.EMPTY_NODE,\n      initialEventCache.getNode(),\n      null\n    );\n    const newServerCache = new CacheNode(\n      serverSnap,\n      initialServerCache.isFullyInitialized(),\n      indexFilter.filtersNodes()\n    );\n    const newEventCache = new CacheNode(\n      eventSnap,\n      initialEventCache.isFullyInitialized(),\n      filter.filtersNodes()\n    );\n\n    this.viewCache_ = newViewCache(newEventCache, newServerCache);\n    this.eventGenerator_ = new EventGenerator(this.query_);\n  }\n\n  get query(): QueryContext {\n    return this.query_;\n  }\n}\n\nexport function viewGetServerCache(view: View): Node | null {\n  return view.viewCache_.serverCache.getNode();\n}\n\nexport function viewGetCompleteNode(view: View): Node | null {\n  return viewCacheGetCompleteEventSnap(view.viewCache_);\n}\n\nexport function viewGetCompleteServerCache(\n  view: View,\n  path: Path\n): Node | null {\n  const cache = viewCacheGetCompleteServerSnap(view.viewCache_);\n  if (cache) {\n    // If this isn't a \"loadsAllData\" view, then cache isn't actually a complete cache and\n    // we need to see if it contains the child we're interested in.\n    if (\n      view.query._queryParams.loadsAllData() ||\n      (!pathIsEmpty(path) &&\n        !cache.getImmediateChild(pathGetFront(path)).isEmpty())\n    ) {\n      return cache.getChild(path);\n    }\n  }\n  return null;\n}\n\nexport function viewIsEmpty(view: View): boolean {\n  return view.eventRegistrations_.length === 0;\n}\n\nexport function viewAddEventRegistration(\n  view: View,\n  eventRegistration: EventRegistration\n) {\n  view.eventRegistrations_.push(eventRegistration);\n}\n\n/**\n * @param eventRegistration - If null, remove all callbacks.\n * @param cancelError - If a cancelError is provided, appropriate cancel events will be returned.\n * @returns Cancel events, if cancelError was provided.\n */\nexport function viewRemoveEventRegistration(\n  view: View,\n  eventRegistration: EventRegistration | null,\n  cancelError?: Error\n): Event[] {\n  const cancelEvents: CancelEvent[] = [];\n  if (cancelError) {\n    assert(\n      eventRegistration == null,\n      'A cancel should cancel all event registrations.'\n    );\n    const path = view.query._path;\n    view.eventRegistrations_.forEach(registration => {\n      const maybeEvent = registration.createCancelEvent(cancelError, path);\n      if (maybeEvent) {\n        cancelEvents.push(maybeEvent);\n      }\n    });\n  }\n\n  if (eventRegistration) {\n    let remaining = [];\n    for (let i = 0; i < view.eventRegistrations_.length; ++i) {\n      const existing = view.eventRegistrations_[i];\n      if (!existing.matches(eventRegistration)) {\n        remaining.push(existing);\n      } else if (eventRegistration.hasAnyCallback()) {\n        // We're removing just this one\n        remaining = remaining.concat(view.eventRegistrations_.slice(i + 1));\n        break;\n      }\n    }\n    view.eventRegistrations_ = remaining;\n  } else {\n    view.eventRegistrations_ = [];\n  }\n  return cancelEvents;\n}\n\n/**\n * Applies the given Operation, updates our cache, and returns the appropriate events.\n */\nexport function viewApplyOperation(\n  view: View,\n  operation: Operation,\n  writesCache: WriteTreeRef,\n  completeServerCache: Node | null\n): Event[] {\n  if (\n    operation.type === OperationType.MERGE &&\n    operation.source.queryId !== null\n  ) {\n    assert(\n      viewCacheGetCompleteServerSnap(view.viewCache_),\n      'We should always have a full cache before handling merges'\n    );\n    assert(\n      viewCacheGetCompleteEventSnap(view.viewCache_),\n      'Missing event cache, even though we have a server cache'\n    );\n  }\n\n  const oldViewCache = view.viewCache_;\n  const result = viewProcessorApplyOperation(\n    view.processor_,\n    oldViewCache,\n    operation,\n    writesCache,\n    completeServerCache\n  );\n  viewProcessorAssertIndexed(view.processor_, result.viewCache);\n\n  assert(\n    result.viewCache.serverCache.isFullyInitialized() ||\n      !oldViewCache.serverCache.isFullyInitialized(),\n    'Once a server snap is complete, it should never go back'\n  );\n\n  view.viewCache_ = result.viewCache;\n\n  return viewGenerateEventsForChanges_(\n    view,\n    result.changes,\n    result.viewCache.eventCache.getNode(),\n    null\n  );\n}\n\nexport function viewGetInitialEvents(\n  view: View,\n  registration: EventRegistration\n): Event[] {\n  const eventSnap = view.viewCache_.eventCache;\n  const initialChanges: Change[] = [];\n  if (!eventSnap.getNode().isLeafNode()) {\n    const eventNode = eventSnap.getNode() as ChildrenNode;\n    eventNode.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n      initialChanges.push(changeChildAdded(key, childNode));\n    });\n  }\n  if (eventSnap.isFullyInitialized()) {\n    initialChanges.push(changeValue(eventSnap.getNode()));\n  }\n  return viewGenerateEventsForChanges_(\n    view,\n    initialChanges,\n    eventSnap.getNode(),\n    registration\n  );\n}\n\nfunction viewGenerateEventsForChanges_(\n  view: View,\n  changes: Change[],\n  eventCache: Node,\n  eventRegistration?: EventRegistration\n): Event[] {\n  const registrations = eventRegistration\n    ? [eventRegistration]\n    : view.eventRegistrations_;\n  return eventGeneratorGenerateEventsForChanges(\n    view.eventGenerator_,\n    changes,\n    eventCache,\n    registrations\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\nimport { assert } from '@firebase/util';\n\nimport { ReferenceConstructor } from '../api/Reference';\n\nimport { Operation } from './operation/Operation';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport { Path } from './util/Path';\nimport { CacheNode } from './view/CacheNode';\nimport { Event } from './view/Event';\nimport { EventRegistration, QueryContext } from './view/EventRegistration';\nimport {\n  View,\n  viewAddEventRegistration,\n  viewApplyOperation,\n  viewGetCompleteServerCache,\n  viewGetInitialEvents,\n  viewIsEmpty,\n  viewRemoveEventRegistration\n} from './view/View';\nimport { newViewCache } from './view/ViewCache';\nimport {\n  WriteTreeRef,\n  writeTreeRefCalcCompleteEventCache,\n  writeTreeRefCalcCompleteEventChildren\n} from './WriteTree';\n\nlet referenceConstructor: ReferenceConstructor;\n\n/**\n * SyncPoint represents a single location in a SyncTree with 1 or more event registrations, meaning we need to\n * maintain 1 or more Views at this location to cache server data and raise appropriate events for server changes\n * and user writes (set, transaction, update).\n *\n * It's responsible for:\n *  - Maintaining the set of 1 or more views necessary at this location (a SyncPoint with 0 views should be removed).\n *  - Proxying user / server operations to the views as appropriate (i.e. applyServerOverwrite,\n *    applyUserOverwrite, etc.)\n */\nexport class SyncPoint {\n  /**\n   * The Views being tracked at this location in the tree, stored as a map where the key is a\n   * queryId and the value is the View for that query.\n   *\n   * NOTE: This list will be quite small (usually 1, but perhaps 2 or 3; any more is an odd use case).\n   */\n  readonly views: Map<string, View> = new Map();\n}\n\nexport function syncPointSetReferenceConstructor(\n  val: ReferenceConstructor\n): void {\n  assert(\n    !referenceConstructor,\n    '__referenceConstructor has already been defined'\n  );\n  referenceConstructor = val;\n}\n\nfunction syncPointGetReferenceConstructor(): ReferenceConstructor {\n  assert(referenceConstructor, 'Reference.ts has not been loaded');\n  return referenceConstructor;\n}\n\nexport function syncPointIsEmpty(syncPoint: SyncPoint): boolean {\n  return syncPoint.views.size === 0;\n}\n\nexport function syncPointApplyOperation(\n  syncPoint: SyncPoint,\n  operation: Operation,\n  writesCache: WriteTreeRef,\n  optCompleteServerCache: Node | null\n): Event[] {\n  const queryId = operation.source.queryId;\n  if (queryId !== null) {\n    const view = syncPoint.views.get(queryId);\n    assert(view != null, 'SyncTree gave us an op for an invalid query.');\n    return viewApplyOperation(\n      view,\n      operation,\n      writesCache,\n      optCompleteServerCache\n    );\n  } else {\n    let events: Event[] = [];\n\n    for (const view of syncPoint.views.values()) {\n      events = events.concat(\n        viewApplyOperation(view, operation, writesCache, optCompleteServerCache)\n      );\n    }\n\n    return events;\n  }\n}\n\n/**\n * Get a view for the specified query.\n *\n * @param query - The query to return a view for\n * @param writesCache\n * @param serverCache\n * @param serverCacheComplete\n * @returns Events to raise.\n */\nexport function syncPointGetView(\n  syncPoint: SyncPoint,\n  query: QueryContext,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  serverCacheComplete: boolean\n): View {\n  const queryId = query._queryIdentifier;\n  const view = syncPoint.views.get(queryId);\n  if (!view) {\n    // TODO: make writesCache take flag for complete server node\n    let eventCache = writeTreeRefCalcCompleteEventCache(\n      writesCache,\n      serverCacheComplete ? serverCache : null\n    );\n    let eventCacheComplete = false;\n    if (eventCache) {\n      eventCacheComplete = true;\n    } else if (serverCache instanceof ChildrenNode) {\n      eventCache = writeTreeRefCalcCompleteEventChildren(\n        writesCache,\n        serverCache\n      );\n      eventCacheComplete = false;\n    } else {\n      eventCache = ChildrenNode.EMPTY_NODE;\n      eventCacheComplete = false;\n    }\n    const viewCache = newViewCache(\n      new CacheNode(eventCache, eventCacheComplete, false),\n      new CacheNode(serverCache, serverCacheComplete, false)\n    );\n    return new View(query, viewCache);\n  }\n  return view;\n}\n\n/**\n * Add an event callback for the specified query.\n *\n * @param query\n * @param eventRegistration\n * @param writesCache\n * @param serverCache - Complete server cache, if we have it.\n * @param serverCacheComplete\n * @returns Events to raise.\n */\nexport function syncPointAddEventRegistration(\n  syncPoint: SyncPoint,\n  query: QueryContext,\n  eventRegistration: EventRegistration,\n  writesCache: WriteTreeRef,\n  serverCache: Node | null,\n  serverCacheComplete: boolean\n): Event[] {\n  const view = syncPointGetView(\n    syncPoint,\n    query,\n    writesCache,\n    serverCache,\n    serverCacheComplete\n  );\n  if (!syncPoint.views.has(query._queryIdentifier)) {\n    syncPoint.views.set(query._queryIdentifier, view);\n  }\n  // This is guaranteed to exist now, we just created anything that was missing\n  viewAddEventRegistration(view, eventRegistration);\n  return viewGetInitialEvents(view, eventRegistration);\n}\n\n/**\n * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\n *\n * If query is the default query, we'll check all views for the specified eventRegistration.\n * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\n *\n * @param eventRegistration - If null, remove all callbacks.\n * @param cancelError - If a cancelError is provided, appropriate cancel events will be returned.\n * @returns removed queries and any cancel events\n */\nexport function syncPointRemoveEventRegistration(\n  syncPoint: SyncPoint,\n  query: QueryContext,\n  eventRegistration: EventRegistration | null,\n  cancelError?: Error\n): { removed: QueryContext[]; events: Event[] } {\n  const queryId = query._queryIdentifier;\n  const removed: QueryContext[] = [];\n  let cancelEvents: Event[] = [];\n  const hadCompleteView = syncPointHasCompleteView(syncPoint);\n  if (queryId === 'default') {\n    // When you do ref.off(...), we search all views for the registration to remove.\n    for (const [viewQueryId, view] of syncPoint.views.entries()) {\n      cancelEvents = cancelEvents.concat(\n        viewRemoveEventRegistration(view, eventRegistration, cancelError)\n      );\n      if (viewIsEmpty(view)) {\n        syncPoint.views.delete(viewQueryId);\n\n        // We'll deal with complete views later.\n        if (!view.query._queryParams.loadsAllData()) {\n          removed.push(view.query);\n        }\n      }\n    }\n  } else {\n    // remove the callback from the specific view.\n    const view = syncPoint.views.get(queryId);\n    if (view) {\n      cancelEvents = cancelEvents.concat(\n        viewRemoveEventRegistration(view, eventRegistration, cancelError)\n      );\n      if (viewIsEmpty(view)) {\n        syncPoint.views.delete(queryId);\n\n        // We'll deal with complete views later.\n        if (!view.query._queryParams.loadsAllData()) {\n          removed.push(view.query);\n        }\n      }\n    }\n  }\n\n  if (hadCompleteView && !syncPointHasCompleteView(syncPoint)) {\n    // We removed our last complete view.\n    removed.push(\n      new (syncPointGetReferenceConstructor())(query._repo, query._path)\n    );\n  }\n\n  return { removed, events: cancelEvents };\n}\n\nexport function syncPointGetQueryViews(syncPoint: SyncPoint): View[] {\n  const result = [];\n  for (const view of syncPoint.views.values()) {\n    if (!view.query._queryParams.loadsAllData()) {\n      result.push(view);\n    }\n  }\n  return result;\n}\n\n/**\n * @param path - The path to the desired complete snapshot\n * @returns A complete cache, if it exists\n */\nexport function syncPointGetCompleteServerCache(\n  syncPoint: SyncPoint,\n  path: Path\n): Node | null {\n  let serverCache: Node | null = null;\n  for (const view of syncPoint.views.values()) {\n    serverCache = serverCache || viewGetCompleteServerCache(view, path);\n  }\n  return serverCache;\n}\n\nexport function syncPointViewForQuery(\n  syncPoint: SyncPoint,\n  query: QueryContext\n): View | null {\n  const params = query._queryParams;\n  if (params.loadsAllData()) {\n    return syncPointGetCompleteView(syncPoint);\n  } else {\n    const queryId = query._queryIdentifier;\n    return syncPoint.views.get(queryId);\n  }\n}\n\nexport function syncPointViewExistsForQuery(\n  syncPoint: SyncPoint,\n  query: QueryContext\n): boolean {\n  return syncPointViewForQuery(syncPoint, query) != null;\n}\n\nexport function syncPointHasCompleteView(syncPoint: SyncPoint): boolean {\n  return syncPointGetCompleteView(syncPoint) != null;\n}\n\nexport function syncPointGetCompleteView(syncPoint: SyncPoint): View | null {\n  for (const view of syncPoint.views.values()) {\n    if (view.query._queryParams.loadsAllData()) {\n      return view;\n    }\n  }\n  return null;\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 { assert } from '@firebase/util';\n\nimport { ReferenceConstructor } from '../api/Reference';\n\nimport { AckUserWrite } from './operation/AckUserWrite';\nimport { ListenComplete } from './operation/ListenComplete';\nimport { Merge } from './operation/Merge';\nimport {\n  newOperationSourceServer,\n  newOperationSourceServerTaggedQuery,\n  newOperationSourceUser,\n  Operation\n} from './operation/Operation';\nimport { Overwrite } from './operation/Overwrite';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport {\n  SyncPoint,\n  syncPointAddEventRegistration,\n  syncPointApplyOperation,\n  syncPointGetCompleteServerCache,\n  syncPointGetCompleteView,\n  syncPointGetQueryViews,\n  syncPointGetView,\n  syncPointHasCompleteView,\n  syncPointIsEmpty,\n  syncPointRemoveEventRegistration,\n  syncPointViewExistsForQuery,\n  syncPointViewForQuery\n} from './SyncPoint';\nimport { ImmutableTree } from './util/ImmutableTree';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathGetFront,\n  pathIsEmpty\n} from './util/Path';\nimport { each, errorForServerCode } from './util/util';\nimport { CacheNode } from './view/CacheNode';\nimport { Event } from './view/Event';\nimport { EventRegistration, QueryContext } from './view/EventRegistration';\nimport { View, viewGetCompleteNode, viewGetServerCache } from './view/View';\nimport {\n  newWriteTree,\n  WriteTree,\n  writeTreeAddMerge,\n  writeTreeAddOverwrite,\n  writeTreeCalcCompleteEventCache,\n  writeTreeChildWrites,\n  writeTreeGetWrite,\n  WriteTreeRef,\n  writeTreeRefChild,\n  writeTreeRemoveWrite\n} from './WriteTree';\n\nlet referenceConstructor: ReferenceConstructor;\n\nexport function syncTreeSetReferenceConstructor(\n  val: ReferenceConstructor\n): void {\n  assert(\n    !referenceConstructor,\n    '__referenceConstructor has already been defined'\n  );\n  referenceConstructor = val;\n}\n\nfunction syncTreeGetReferenceConstructor(): ReferenceConstructor {\n  assert(referenceConstructor, 'Reference.ts has not been loaded');\n  return referenceConstructor;\n}\n\nexport interface ListenProvider {\n  startListening(\n    query: QueryContext,\n    tag: number | null,\n    hashFn: () => string,\n    onComplete: (a: string, b?: unknown) => Event[]\n  ): Event[];\n\n  stopListening(a: QueryContext, b: number | null): void;\n}\n\n/**\n * Static tracker for next query tag.\n */\nlet syncTreeNextQueryTag_ = 1;\n\nexport function resetSyncTreeTag() {\n  syncTreeNextQueryTag_ = 1;\n}\n\n/**\n * SyncTree is the central class for managing event callback registration, data caching, views\n * (query processing), and event generation.  There are typically two SyncTree instances for\n * each Repo, one for the normal Firebase data, and one for the .info data.\n *\n * It has a number of responsibilities, including:\n *  - Tracking all user event callbacks (registered via addEventRegistration() and removeEventRegistration()).\n *  - Applying and caching data changes for user set(), transaction(), and update() calls\n *    (applyUserOverwrite(), applyUserMerge()).\n *  - Applying and caching data changes for server data changes (applyServerOverwrite(),\n *    applyServerMerge()).\n *  - Generating user-facing events for server and user changes (all of the apply* methods\n *    return the set of events that need to be raised as a result).\n *  - Maintaining the appropriate set of server listens to ensure we are always subscribed\n *    to the correct set of paths and queries to satisfy the current set of user event\n *    callbacks (listens are started/stopped using the provided listenProvider).\n *\n * NOTE: Although SyncTree tracks event callbacks and calculates events to raise, the actual\n * events are returned to the caller rather than raised synchronously.\n *\n */\nexport class SyncTree {\n  /**\n   * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\n   */\n  syncPointTree_: ImmutableTree<SyncPoint> = new ImmutableTree<SyncPoint>(null);\n\n  /**\n   * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n   */\n  pendingWriteTree_: WriteTree = newWriteTree();\n\n  readonly tagToQueryMap: Map<number, string> = new Map();\n  readonly queryToTagMap: Map<string, number> = new Map();\n\n  /**\n   * @param listenProvider_ - Used by SyncTree to start / stop listening\n   *   to server data.\n   */\n  constructor(public listenProvider_: ListenProvider) {}\n}\n\n/**\n * Apply the data changes for a user-generated set() or transaction() call.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyUserOverwrite(\n  syncTree: SyncTree,\n  path: Path,\n  newData: Node,\n  writeId: number,\n  visible?: boolean\n): Event[] {\n  // Record pending write.\n  writeTreeAddOverwrite(\n    syncTree.pendingWriteTree_,\n    path,\n    newData,\n    writeId,\n    visible\n  );\n\n  if (!visible) {\n    return [];\n  } else {\n    return syncTreeApplyOperationToSyncPoints_(\n      syncTree,\n      new Overwrite(newOperationSourceUser(), path, newData)\n    );\n  }\n}\n\n/**\n * Apply the data from a user-generated update() call\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyUserMerge(\n  syncTree: SyncTree,\n  path: Path,\n  changedChildren: { [k: string]: Node },\n  writeId: number\n): Event[] {\n  // Record pending merge.\n  writeTreeAddMerge(syncTree.pendingWriteTree_, path, changedChildren, writeId);\n\n  const changeTree = ImmutableTree.fromObject(changedChildren);\n\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new Merge(newOperationSourceUser(), path, changeTree)\n  );\n}\n\n/**\n * Acknowledge a pending user write that was previously registered with applyUserOverwrite() or applyUserMerge().\n *\n * @param revert - True if the given write failed and needs to be reverted\n * @returns Events to raise.\n */\nexport function syncTreeAckUserWrite(\n  syncTree: SyncTree,\n  writeId: number,\n  revert: boolean = false\n) {\n  const write = writeTreeGetWrite(syncTree.pendingWriteTree_, writeId);\n  const needToReevaluate = writeTreeRemoveWrite(\n    syncTree.pendingWriteTree_,\n    writeId\n  );\n  if (!needToReevaluate) {\n    return [];\n  } else {\n    let affectedTree = new ImmutableTree<boolean>(null);\n    if (write.snap != null) {\n      // overwrite\n      affectedTree = affectedTree.set(newEmptyPath(), true);\n    } else {\n      each(write.children, (pathString: string) => {\n        affectedTree = affectedTree.set(new Path(pathString), true);\n      });\n    }\n    return syncTreeApplyOperationToSyncPoints_(\n      syncTree,\n      new AckUserWrite(write.path, affectedTree, revert)\n    );\n  }\n}\n\n/**\n * Apply new server data for the specified path..\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyServerOverwrite(\n  syncTree: SyncTree,\n  path: Path,\n  newData: Node\n): Event[] {\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new Overwrite(newOperationSourceServer(), path, newData)\n  );\n}\n\n/**\n * Apply new server data to be merged in at the specified path.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyServerMerge(\n  syncTree: SyncTree,\n  path: Path,\n  changedChildren: { [k: string]: Node }\n): Event[] {\n  const changeTree = ImmutableTree.fromObject(changedChildren);\n\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new Merge(newOperationSourceServer(), path, changeTree)\n  );\n}\n\n/**\n * Apply a listen complete for a query\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyListenComplete(\n  syncTree: SyncTree,\n  path: Path\n): Event[] {\n  return syncTreeApplyOperationToSyncPoints_(\n    syncTree,\n    new ListenComplete(newOperationSourceServer(), path)\n  );\n}\n\n/**\n * Apply a listen complete for a tagged query\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyTaggedListenComplete(\n  syncTree: SyncTree,\n  path: Path,\n  tag: number\n): Event[] {\n  const queryKey = syncTreeQueryKeyForTag_(syncTree, tag);\n  if (queryKey) {\n    const r = syncTreeParseQueryKey_(queryKey);\n    const queryPath = r.path,\n      queryId = r.queryId;\n    const relativePath = newRelativePath(queryPath, path);\n    const op = new ListenComplete(\n      newOperationSourceServerTaggedQuery(queryId),\n      relativePath\n    );\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // We've already removed the query. No big deal, ignore the update\n    return [];\n  }\n}\n\n/**\n * Remove event callback(s).\n *\n * If query is the default query, we'll check all queries for the specified eventRegistration.\n * If eventRegistration is null, we'll remove all callbacks for the specified query/queries.\n *\n * @param eventRegistration - If null, all callbacks are removed.\n * @param cancelError - If a cancelError is provided, appropriate cancel events will be returned.\n * @param skipListenerDedup - When performing a `get()`, we don't add any new listeners, so no\n *  deduping needs to take place. This flag allows toggling of that behavior\n * @returns Cancel events, if cancelError was provided.\n */\nexport function syncTreeRemoveEventRegistration(\n  syncTree: SyncTree,\n  query: QueryContext,\n  eventRegistration: EventRegistration | null,\n  cancelError?: Error,\n  skipListenerDedup = false\n): Event[] {\n  // Find the syncPoint first. Then deal with whether or not it has matching listeners\n  const path = query._path;\n  const maybeSyncPoint = syncTree.syncPointTree_.get(path);\n  let cancelEvents: Event[] = [];\n  // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\n  // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\n  // not loadsAllData().\n  if (\n    maybeSyncPoint &&\n    (query._queryIdentifier === 'default' ||\n      syncPointViewExistsForQuery(maybeSyncPoint, query))\n  ) {\n    const removedAndEvents = syncPointRemoveEventRegistration(\n      maybeSyncPoint,\n      query,\n      eventRegistration,\n      cancelError\n    );\n    if (syncPointIsEmpty(maybeSyncPoint)) {\n      syncTree.syncPointTree_ = syncTree.syncPointTree_.remove(path);\n    }\n\n    const removed = removedAndEvents.removed;\n    cancelEvents = removedAndEvents.events;\n\n    if (!skipListenerDedup) {\n      /**\n       * We may have just removed one of many listeners and can short-circuit this whole process\n       * We may also not have removed a default listener, in which case all of the descendant listeners should already be\n       * properly set up.\n       */\n\n      // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\n      // queryId === 'default'\n      const removingDefault =\n        -1 !==\n        removed.findIndex(query => {\n          return query._queryParams.loadsAllData();\n        });\n      const covered = syncTree.syncPointTree_.findOnPath(\n        path,\n        (relativePath, parentSyncPoint) =>\n          syncPointHasCompleteView(parentSyncPoint)\n      );\n\n      if (removingDefault && !covered) {\n        const subtree = syncTree.syncPointTree_.subtree(path);\n        // There are potentially child listeners. Determine what if any listens we need to send before executing the\n        // removal\n        if (!subtree.isEmpty()) {\n          // We need to fold over our subtree and collect the listeners to send\n          const newViews = syncTreeCollectDistinctViewsForSubTree_(subtree);\n\n          // Ok, we've collected all the listens we need. Set them up.\n          for (let i = 0; i < newViews.length; ++i) {\n            const view = newViews[i],\n              newQuery = view.query;\n            const listener = syncTreeCreateListenerForView_(syncTree, view);\n            syncTree.listenProvider_.startListening(\n              syncTreeQueryForListening_(newQuery),\n              syncTreeTagForQuery(syncTree, newQuery),\n              listener.hashFn,\n              listener.onComplete\n            );\n          }\n        }\n        // Otherwise there's nothing below us, so nothing we need to start listening on\n      }\n      // If we removed anything and we're not covered by a higher up listen, we need to stop listening on this query\n      // The above block has us covered in terms of making sure we're set up on listens lower in the tree.\n      // Also, note that if we have a cancelError, it's already been removed at the provider level.\n      if (!covered && removed.length > 0 && !cancelError) {\n        // If we removed a default, then we weren't listening on any of the other queries here. Just cancel the one\n        // default. Otherwise, we need to iterate through and cancel each individual query\n        if (removingDefault) {\n          // We don't tag default listeners\n          const defaultTag: number | null = null;\n          syncTree.listenProvider_.stopListening(\n            syncTreeQueryForListening_(query),\n            defaultTag\n          );\n        } else {\n          removed.forEach((queryToRemove: QueryContext) => {\n            const tagToRemove = syncTree.queryToTagMap.get(\n              syncTreeMakeQueryKey_(queryToRemove)\n            );\n            syncTree.listenProvider_.stopListening(\n              syncTreeQueryForListening_(queryToRemove),\n              tagToRemove\n            );\n          });\n        }\n      }\n    }\n    // Now, clear all of the tags we're tracking for the removed listens\n    syncTreeRemoveTags_(syncTree, removed);\n  } else {\n    // No-op, this listener must've been already removed\n  }\n  return cancelEvents;\n}\n\n/**\n * Apply new server data for the specified tagged query.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyTaggedQueryOverwrite(\n  syncTree: SyncTree,\n  path: Path,\n  snap: Node,\n  tag: number\n): Event[] {\n  const queryKey = syncTreeQueryKeyForTag_(syncTree, tag);\n  if (queryKey != null) {\n    const r = syncTreeParseQueryKey_(queryKey);\n    const queryPath = r.path,\n      queryId = r.queryId;\n    const relativePath = newRelativePath(queryPath, path);\n    const op = new Overwrite(\n      newOperationSourceServerTaggedQuery(queryId),\n      relativePath,\n      snap\n    );\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // Query must have been removed already\n    return [];\n  }\n}\n\n/**\n * Apply server data to be merged in for the specified tagged query.\n *\n * @returns Events to raise.\n */\nexport function syncTreeApplyTaggedQueryMerge(\n  syncTree: SyncTree,\n  path: Path,\n  changedChildren: { [k: string]: Node },\n  tag: number\n): Event[] {\n  const queryKey = syncTreeQueryKeyForTag_(syncTree, tag);\n  if (queryKey) {\n    const r = syncTreeParseQueryKey_(queryKey);\n    const queryPath = r.path,\n      queryId = r.queryId;\n    const relativePath = newRelativePath(queryPath, path);\n    const changeTree = ImmutableTree.fromObject(changedChildren);\n    const op = new Merge(\n      newOperationSourceServerTaggedQuery(queryId),\n      relativePath,\n      changeTree\n    );\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // We've already removed the query. No big deal, ignore the update\n    return [];\n  }\n}\n\n/**\n * Add an event callback for the specified query.\n *\n * @returns Events to raise.\n */\nexport function syncTreeAddEventRegistration(\n  syncTree: SyncTree,\n  query: QueryContext,\n  eventRegistration: EventRegistration,\n  skipSetupListener = false\n): Event[] {\n  const path = query._path;\n\n  let serverCache: Node | null = null;\n  let foundAncestorDefaultView = false;\n  // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n  // Consider optimizing this once there's a better understanding of what actual behavior will be.\n  syncTree.syncPointTree_.foreachOnPath(path, (pathToSyncPoint, sp) => {\n    const relativePath = newRelativePath(pathToSyncPoint, path);\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(sp, relativePath);\n    foundAncestorDefaultView =\n      foundAncestorDefaultView || syncPointHasCompleteView(sp);\n  });\n  let syncPoint = syncTree.syncPointTree_.get(path);\n  if (!syncPoint) {\n    syncPoint = new SyncPoint();\n    syncTree.syncPointTree_ = syncTree.syncPointTree_.set(path, syncPoint);\n  } else {\n    foundAncestorDefaultView =\n      foundAncestorDefaultView || syncPointHasCompleteView(syncPoint);\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n\n  let serverCacheComplete;\n  if (serverCache != null) {\n    serverCacheComplete = true;\n  } else {\n    serverCacheComplete = false;\n    serverCache = ChildrenNode.EMPTY_NODE;\n    const subtree = syncTree.syncPointTree_.subtree(path);\n    subtree.foreachChild((childName, childSyncPoint) => {\n      const completeCache = syncPointGetCompleteServerCache(\n        childSyncPoint,\n        newEmptyPath()\n      );\n      if (completeCache) {\n        serverCache = serverCache.updateImmediateChild(\n          childName,\n          completeCache\n        );\n      }\n    });\n  }\n\n  const viewAlreadyExists = syncPointViewExistsForQuery(syncPoint, query);\n  if (!viewAlreadyExists && !query._queryParams.loadsAllData()) {\n    // We need to track a tag for this query\n    const queryKey = syncTreeMakeQueryKey_(query);\n    assert(\n      !syncTree.queryToTagMap.has(queryKey),\n      'View does not exist, but we have a tag'\n    );\n    const tag = syncTreeGetNextQueryTag_();\n    syncTree.queryToTagMap.set(queryKey, tag);\n    syncTree.tagToQueryMap.set(tag, queryKey);\n  }\n  const writesCache = writeTreeChildWrites(syncTree.pendingWriteTree_, path);\n  let events = syncPointAddEventRegistration(\n    syncPoint,\n    query,\n    eventRegistration,\n    writesCache,\n    serverCache,\n    serverCacheComplete\n  );\n  if (!viewAlreadyExists && !foundAncestorDefaultView && !skipSetupListener) {\n    const view = syncPointViewForQuery(syncPoint, query);\n    events = events.concat(syncTreeSetupListener_(syncTree, query, view));\n  }\n  return events;\n}\n\n/**\n * Returns a complete cache, if we have one, of the data at a particular path. If the location does not have a\n * listener above it, we will get a false \"null\". This shouldn't be a problem because transactions will always\n * have a listener above, and atomic operations would correctly show a jitter of <increment value> ->\n *     <incremented total> as the write is applied locally and then acknowledged at the server.\n *\n * Note: this method will *include* hidden writes from transaction with applyLocally set to false.\n *\n * @param path - The path to the data we want\n * @param writeIdsToExclude - A specific set to be excluded\n */\nexport function syncTreeCalcCompleteEventCache(\n  syncTree: SyncTree,\n  path: Path,\n  writeIdsToExclude?: number[]\n): Node {\n  const includeHiddenSets = true;\n  const writeTree = syncTree.pendingWriteTree_;\n  const serverCache = syncTree.syncPointTree_.findOnPath(\n    path,\n    (pathSoFar, syncPoint) => {\n      const relativePath = newRelativePath(pathSoFar, path);\n      const serverCache = syncPointGetCompleteServerCache(\n        syncPoint,\n        relativePath\n      );\n      if (serverCache) {\n        return serverCache;\n      }\n    }\n  );\n  return writeTreeCalcCompleteEventCache(\n    writeTree,\n    path,\n    serverCache,\n    writeIdsToExclude,\n    includeHiddenSets\n  );\n}\n\nexport function syncTreeGetServerValue(\n  syncTree: SyncTree,\n  query: QueryContext\n): Node | null {\n  const path = query._path;\n  let serverCache: Node | null = null;\n  // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n  // Consider optimizing this once there's a better understanding of what actual behavior will be.\n  syncTree.syncPointTree_.foreachOnPath(path, (pathToSyncPoint, sp) => {\n    const relativePath = newRelativePath(pathToSyncPoint, path);\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(sp, relativePath);\n  });\n  let syncPoint = syncTree.syncPointTree_.get(path);\n  if (!syncPoint) {\n    syncPoint = new SyncPoint();\n    syncTree.syncPointTree_ = syncTree.syncPointTree_.set(path, syncPoint);\n  } else {\n    serverCache =\n      serverCache || syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n  const serverCacheComplete = serverCache != null;\n  const serverCacheNode: CacheNode | null = serverCacheComplete\n    ? new CacheNode(serverCache, true, false)\n    : null;\n  const writesCache: WriteTreeRef | null = writeTreeChildWrites(\n    syncTree.pendingWriteTree_,\n    query._path\n  );\n  const view: View = syncPointGetView(\n    syncPoint,\n    query,\n    writesCache,\n    serverCacheComplete ? serverCacheNode.getNode() : ChildrenNode.EMPTY_NODE,\n    serverCacheComplete\n  );\n  return viewGetCompleteNode(view);\n}\n\n/**\n * A helper method that visits all descendant and ancestor SyncPoints, applying the operation.\n *\n * NOTES:\n * - Descendant SyncPoints will be visited first (since we raise events depth-first).\n *\n * - We call applyOperation() on each SyncPoint passing three things:\n *   1. A version of the Operation that has been made relative to the SyncPoint location.\n *   2. A WriteTreeRef of any writes we have cached at the SyncPoint location.\n *   3. A snapshot Node with cached server data, if we have it.\n *\n * - We concatenate all of the events returned by each SyncPoint and return the result.\n */\nfunction syncTreeApplyOperationToSyncPoints_(\n  syncTree: SyncTree,\n  operation: Operation\n): Event[] {\n  return syncTreeApplyOperationHelper_(\n    operation,\n    syncTree.syncPointTree_,\n    /*serverCache=*/ null,\n    writeTreeChildWrites(syncTree.pendingWriteTree_, newEmptyPath())\n  );\n}\n\n/**\n * Recursive helper for applyOperationToSyncPoints_\n */\nfunction syncTreeApplyOperationHelper_(\n  operation: Operation,\n  syncPointTree: ImmutableTree<SyncPoint>,\n  serverCache: Node | null,\n  writesCache: WriteTreeRef\n): Event[] {\n  if (pathIsEmpty(operation.path)) {\n    return syncTreeApplyOperationDescendantsHelper_(\n      operation,\n      syncPointTree,\n      serverCache,\n      writesCache\n    );\n  } else {\n    const syncPoint = syncPointTree.get(newEmptyPath());\n\n    // If we don't have cached server data, see if we can get it from this SyncPoint.\n    if (serverCache == null && syncPoint != null) {\n      serverCache = syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n    }\n\n    let events: Event[] = [];\n    const childName = pathGetFront(operation.path);\n    const childOperation = operation.operationForChild(childName);\n    const childTree = syncPointTree.children.get(childName);\n    if (childTree && childOperation) {\n      const childServerCache = serverCache\n        ? serverCache.getImmediateChild(childName)\n        : null;\n      const childWritesCache = writeTreeRefChild(writesCache, childName);\n      events = events.concat(\n        syncTreeApplyOperationHelper_(\n          childOperation,\n          childTree,\n          childServerCache,\n          childWritesCache\n        )\n      );\n    }\n\n    if (syncPoint) {\n      events = events.concat(\n        syncPointApplyOperation(syncPoint, operation, writesCache, serverCache)\n      );\n    }\n\n    return events;\n  }\n}\n\n/**\n * Recursive helper for applyOperationToSyncPoints_\n */\nfunction syncTreeApplyOperationDescendantsHelper_(\n  operation: Operation,\n  syncPointTree: ImmutableTree<SyncPoint>,\n  serverCache: Node | null,\n  writesCache: WriteTreeRef\n): Event[] {\n  const syncPoint = syncPointTree.get(newEmptyPath());\n\n  // If we don't have cached server data, see if we can get it from this SyncPoint.\n  if (serverCache == null && syncPoint != null) {\n    serverCache = syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n\n  let events: Event[] = [];\n  syncPointTree.children.inorderTraversal((childName, childTree) => {\n    const childServerCache = serverCache\n      ? serverCache.getImmediateChild(childName)\n      : null;\n    const childWritesCache = writeTreeRefChild(writesCache, childName);\n    const childOperation = operation.operationForChild(childName);\n    if (childOperation) {\n      events = events.concat(\n        syncTreeApplyOperationDescendantsHelper_(\n          childOperation,\n          childTree,\n          childServerCache,\n          childWritesCache\n        )\n      );\n    }\n  });\n\n  if (syncPoint) {\n    events = events.concat(\n      syncPointApplyOperation(syncPoint, operation, writesCache, serverCache)\n    );\n  }\n\n  return events;\n}\n\nfunction syncTreeCreateListenerForView_(\n  syncTree: SyncTree,\n  view: View\n): { hashFn(): string; onComplete(a: string, b?: unknown): Event[] } {\n  const query = view.query;\n  const tag = syncTreeTagForQuery(syncTree, query);\n\n  return {\n    hashFn: () => {\n      const cache = viewGetServerCache(view) || ChildrenNode.EMPTY_NODE;\n      return cache.hash();\n    },\n    onComplete: (status: string): Event[] => {\n      if (status === 'ok') {\n        if (tag) {\n          return syncTreeApplyTaggedListenComplete(syncTree, query._path, tag);\n        } else {\n          return syncTreeApplyListenComplete(syncTree, query._path);\n        }\n      } else {\n        // If a listen failed, kill all of the listeners here, not just the one that triggered the error.\n        // Note that this may need to be scoped to just this listener if we change permissions on filtered children\n        const error = errorForServerCode(status, query);\n        return syncTreeRemoveEventRegistration(\n          syncTree,\n          query,\n          /*eventRegistration*/ null,\n          error\n        );\n      }\n    }\n  };\n}\n\n/**\n * Return the tag associated with the given query.\n */\nexport function syncTreeTagForQuery(\n  syncTree: SyncTree,\n  query: QueryContext\n): number | null {\n  const queryKey = syncTreeMakeQueryKey_(query);\n  return syncTree.queryToTagMap.get(queryKey);\n}\n\n/**\n * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\n */\nfunction syncTreeMakeQueryKey_(query: QueryContext): string {\n  return query._path.toString() + '$' + query._queryIdentifier;\n}\n\n/**\n * Return the query associated with the given tag, if we have one\n */\nfunction syncTreeQueryKeyForTag_(\n  syncTree: SyncTree,\n  tag: number\n): string | null {\n  return syncTree.tagToQueryMap.get(tag);\n}\n\n/**\n * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\n */\nfunction syncTreeParseQueryKey_(queryKey: string): {\n  queryId: string;\n  path: Path;\n} {\n  const splitIndex = queryKey.indexOf('$');\n  assert(\n    splitIndex !== -1 && splitIndex < queryKey.length - 1,\n    'Bad queryKey.'\n  );\n  return {\n    queryId: queryKey.substr(splitIndex + 1),\n    path: new Path(queryKey.substr(0, splitIndex))\n  };\n}\n\n/**\n * A helper method to apply tagged operations\n */\nfunction syncTreeApplyTaggedOperation_(\n  syncTree: SyncTree,\n  queryPath: Path,\n  operation: Operation\n): Event[] {\n  const syncPoint = syncTree.syncPointTree_.get(queryPath);\n  assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\n  const writesCache = writeTreeChildWrites(\n    syncTree.pendingWriteTree_,\n    queryPath\n  );\n  return syncPointApplyOperation(syncPoint, operation, writesCache, null);\n}\n\n/**\n * This collapses multiple unfiltered views into a single view, since we only need a single\n * listener for them.\n */\nfunction syncTreeCollectDistinctViewsForSubTree_(\n  subtree: ImmutableTree<SyncPoint>\n): View[] {\n  return subtree.fold<View[]>((relativePath, maybeChildSyncPoint, childMap) => {\n    if (maybeChildSyncPoint && syncPointHasCompleteView(maybeChildSyncPoint)) {\n      const completeView = syncPointGetCompleteView(maybeChildSyncPoint);\n      return [completeView];\n    } else {\n      // No complete view here, flatten any deeper listens into an array\n      let views: View[] = [];\n      if (maybeChildSyncPoint) {\n        views = syncPointGetQueryViews(maybeChildSyncPoint);\n      }\n      each(childMap, (_key: string, childViews: View[]) => {\n        views = views.concat(childViews);\n      });\n      return views;\n    }\n  });\n}\n\n/**\n * Normalizes a query to a query we send the server for listening\n *\n * @returns The normalized query\n */\nfunction syncTreeQueryForListening_(query: QueryContext): QueryContext {\n  if (query._queryParams.loadsAllData() && !query._queryParams.isDefault()) {\n    // We treat queries that load all data as default queries\n    // Cast is necessary because ref() technically returns Firebase which is actually fb.api.Firebase which inherits\n    // from Query\n    return new (syncTreeGetReferenceConstructor())(query._repo, query._path);\n  } else {\n    return query;\n  }\n}\n\nfunction syncTreeRemoveTags_(syncTree: SyncTree, queries: QueryContext[]) {\n  for (let j = 0; j < queries.length; ++j) {\n    const removedQuery = queries[j];\n    if (!removedQuery._queryParams.loadsAllData()) {\n      // We should have a tag for this\n      const removedQueryKey = syncTreeMakeQueryKey_(removedQuery);\n      const removedQueryTag = syncTree.queryToTagMap.get(removedQueryKey);\n      syncTree.queryToTagMap.delete(removedQueryKey);\n      syncTree.tagToQueryMap.delete(removedQueryTag);\n    }\n  }\n}\n\n/**\n * Static accessor for query tags.\n */\nfunction syncTreeGetNextQueryTag_(): number {\n  return syncTreeNextQueryTag_++;\n}\n\n/**\n * For a given new listen, manage the de-duplication of outstanding subscriptions.\n *\n * @returns This method can return events to support synchronous data sources\n */\nfunction syncTreeSetupListener_(\n  syncTree: SyncTree,\n  query: QueryContext,\n  view: View\n): Event[] {\n  const path = query._path;\n  const tag = syncTreeTagForQuery(syncTree, query);\n  const listener = syncTreeCreateListenerForView_(syncTree, view);\n\n  const events = syncTree.listenProvider_.startListening(\n    syncTreeQueryForListening_(query),\n    tag,\n    listener.hashFn,\n    listener.onComplete\n  );\n\n  const subtree = syncTree.syncPointTree_.subtree(path);\n  // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\n  // may need to shadow other listens as well.\n  if (tag) {\n    assert(\n      !syncPointHasCompleteView(subtree.value),\n      \"If we're adding a query, it shouldn't be shadowed\"\n    );\n  } else {\n    // Shadow everything at or below this location, this is a default listener.\n    const queriesToStop = subtree.fold<QueryContext[]>(\n      (relativePath, maybeChildSyncPoint, childMap) => {\n        if (\n          !pathIsEmpty(relativePath) &&\n          maybeChildSyncPoint &&\n          syncPointHasCompleteView(maybeChildSyncPoint)\n        ) {\n          return [syncPointGetCompleteView(maybeChildSyncPoint).query];\n        } else {\n          // No default listener here, flatten any deeper queries into an array\n          let queries: QueryContext[] = [];\n          if (maybeChildSyncPoint) {\n            queries = queries.concat(\n              syncPointGetQueryViews(maybeChildSyncPoint).map(\n                view => view.query\n              )\n            );\n          }\n          each(childMap, (_key: string, childQueries: QueryContext[]) => {\n            queries = queries.concat(childQueries);\n          });\n          return queries;\n        }\n      }\n    );\n    for (let i = 0; i < queriesToStop.length; ++i) {\n      const queryToStop = queriesToStop[i];\n      syncTree.listenProvider_.stopListening(\n        syncTreeQueryForListening_(queryToStop),\n        syncTreeTagForQuery(syncTree, queryToStop)\n      );\n    }\n  }\n  return events;\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 { assert } from '@firebase/util';\n\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { LeafNode } from '../snap/LeafNode';\nimport { Node } from '../snap/Node';\nimport { nodeFromJSON } from '../snap/nodeFromJSON';\nimport { SyncTree, syncTreeCalcCompleteEventCache } from '../SyncTree';\n\nimport { Indexable } from './misc';\nimport { Path, pathChild } from './Path';\n\n/* It's critical for performance that we do not calculate actual values from a SyncTree\n * unless and until the value is needed. Because we expose both a SyncTree and Node\n * version of deferred value resolution, we ned a wrapper class that will let us share\n * code.\n *\n * @see https://github.com/firebase/firebase-js-sdk/issues/2487\n */\ninterface ValueProvider {\n  getImmediateChild(childName: string): ValueProvider;\n  node(): Node;\n}\n\nclass ExistingValueProvider implements ValueProvider {\n  constructor(readonly node_: Node) {}\n\n  getImmediateChild(childName: string): ValueProvider {\n    const child = this.node_.getImmediateChild(childName);\n    return new ExistingValueProvider(child);\n  }\n\n  node(): Node {\n    return this.node_;\n  }\n}\n\nclass DeferredValueProvider implements ValueProvider {\n  private syncTree_: SyncTree;\n  private path_: Path;\n\n  constructor(syncTree: SyncTree, path: Path) {\n    this.syncTree_ = syncTree;\n    this.path_ = path;\n  }\n\n  getImmediateChild(childName: string): ValueProvider {\n    const childPath = pathChild(this.path_, childName);\n    return new DeferredValueProvider(this.syncTree_, childPath);\n  }\n\n  node(): Node {\n    return syncTreeCalcCompleteEventCache(this.syncTree_, this.path_);\n  }\n}\n\n/**\n * Generate placeholders for deferred values.\n */\nexport const generateWithValues = function (\n  values: {\n    [k: string]: unknown;\n  } | null\n): { [k: string]: unknown } {\n  values = values || {};\n  values['timestamp'] = values['timestamp'] || new Date().getTime();\n  return values;\n};\n\n/**\n * Value to use when firing local events. When writing server values, fire\n * local events with an approximate value, otherwise return value as-is.\n */\nexport const resolveDeferredLeafValue = function (\n  value: { [k: string]: unknown } | string | number | boolean,\n  existingVal: ValueProvider,\n  serverValues: { [k: string]: unknown }\n): string | number | boolean {\n  if (!value || typeof value !== 'object') {\n    return value as string | number | boolean;\n  }\n  assert('.sv' in value, 'Unexpected leaf node or priority contents');\n\n  if (typeof value['.sv'] === 'string') {\n    return resolveScalarDeferredValue(value['.sv'], existingVal, serverValues);\n  } else if (typeof value['.sv'] === 'object') {\n    return resolveComplexDeferredValue(value['.sv'], existingVal, serverValues);\n  } else {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(value, null, 2));\n  }\n};\n\nconst resolveScalarDeferredValue = function (\n  op: string,\n  existing: ValueProvider,\n  serverValues: { [k: string]: unknown }\n): string | number | boolean {\n  switch (op) {\n    case 'timestamp':\n      return serverValues['timestamp'] as string | number | boolean;\n    default:\n      assert(false, 'Unexpected server value: ' + op);\n  }\n};\n\nconst resolveComplexDeferredValue = function (\n  op: object,\n  existing: ValueProvider,\n  unused: { [k: string]: unknown }\n): string | number | boolean {\n  if (!op.hasOwnProperty('increment')) {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(op, null, 2));\n  }\n  const delta = op['increment'];\n  if (typeof delta !== 'number') {\n    assert(false, 'Unexpected increment value: ' + delta);\n  }\n\n  const existingNode = existing.node();\n  assert(\n    existingNode !== null && typeof existingNode !== 'undefined',\n    'Expected ChildrenNode.EMPTY_NODE for nulls'\n  );\n\n  // Incrementing a non-number sets the value to the incremented amount\n  if (!existingNode.isLeafNode()) {\n    return delta;\n  }\n\n  const leaf = existingNode as LeafNode;\n  const existingVal = leaf.getValue();\n  if (typeof existingVal !== 'number') {\n    return delta;\n  }\n\n  // No need to do over/underflow arithmetic here because JS only handles floats under the covers\n  return existingVal + delta;\n};\n\n/**\n * Recursively replace all deferred values and priorities in the tree with the\n * specified generated replacement values.\n * @param path - path to which write is relative\n * @param node - new data written at path\n * @param syncTree - current data\n */\nexport const resolveDeferredValueTree = function (\n  path: Path,\n  node: Node,\n  syncTree: SyncTree,\n  serverValues: Indexable\n): Node {\n  return resolveDeferredValue(\n    node,\n    new DeferredValueProvider(syncTree, path),\n    serverValues\n  );\n};\n\n/**\n * Recursively replace all deferred values and priorities in the node with the\n * specified generated replacement values.  If there are no server values in the node,\n * it'll be returned as-is.\n */\nexport const resolveDeferredValueSnapshot = function (\n  node: Node,\n  existing: Node,\n  serverValues: Indexable\n): Node {\n  return resolveDeferredValue(\n    node,\n    new ExistingValueProvider(existing),\n    serverValues\n  );\n};\n\nfunction resolveDeferredValue(\n  node: Node,\n  existingVal: ValueProvider,\n  serverValues: Indexable\n): Node {\n  const rawPri = node.getPriority().val() as\n    | Indexable\n    | boolean\n    | null\n    | number\n    | string;\n  const priority = resolveDeferredLeafValue(\n    rawPri,\n    existingVal.getImmediateChild('.priority'),\n    serverValues\n  );\n  let newNode: Node;\n\n  if (node.isLeafNode()) {\n    const leafNode = node as LeafNode;\n    const value = resolveDeferredLeafValue(\n      leafNode.getValue(),\n      existingVal,\n      serverValues\n    );\n    if (\n      value !== leafNode.getValue() ||\n      priority !== leafNode.getPriority().val()\n    ) {\n      return new LeafNode(value, nodeFromJSON(priority));\n    } else {\n      return node;\n    }\n  } else {\n    const childrenNode = node as ChildrenNode;\n    newNode = childrenNode;\n    if (priority !== childrenNode.getPriority().val()) {\n      newNode = newNode.updatePriority(new LeafNode(priority));\n    }\n    childrenNode.forEachChild(PRIORITY_INDEX, (childName, childNode) => {\n      const newChildNode = resolveDeferredValue(\n        childNode,\n        existingVal.getImmediateChild(childName),\n        serverValues\n      );\n      if (newChildNode !== childNode) {\n        newNode = newNode.updateImmediateChild(childName, newChildNode);\n      }\n    });\n    return newNode;\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\nimport { contains, safeGet } from '@firebase/util';\n\nimport { Path, pathGetFront, pathPopFront } from './Path';\nimport { each } from './util';\n\n/**\n * Node in a Tree.\n */\nexport interface TreeNode<T> {\n  // TODO: Consider making accessors that create children and value lazily or\n  // separate Internal / Leaf 'types'.\n  children: Record<string, TreeNode<T>>;\n  childCount: number;\n  value?: T;\n}\n\n/**\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\n * children.\n */\nexport class Tree<T> {\n  /**\n   * @param name - Optional name of the node.\n   * @param parent - Optional parent node.\n   * @param node - Optional node to wrap.\n   */\n  constructor(\n    readonly name: string = '',\n    readonly parent: Tree<T> | null = null,\n    public node: TreeNode<T> = { children: {}, childCount: 0 }\n  ) {}\n}\n\n/**\n * Returns a sub-Tree for the given path.\n *\n * @param pathObj - Path to look up.\n * @returns Tree for path.\n */\nexport function treeSubTree<T>(tree: Tree<T>, pathObj: string | Path): Tree<T> {\n  // TODO: Require pathObj to be Path?\n  let path = pathObj instanceof Path ? pathObj : new Path(pathObj);\n  let child = tree,\n    next = pathGetFront(path);\n  while (next !== null) {\n    const childNode = safeGet(child.node.children, next) || {\n      children: {},\n      childCount: 0\n    };\n    child = new Tree<T>(next, child, childNode);\n    path = pathPopFront(path);\n    next = pathGetFront(path);\n  }\n\n  return child;\n}\n\n/**\n * Returns the data associated with this tree node.\n *\n * @returns The data or null if no data exists.\n */\nexport function treeGetValue<T>(tree: Tree<T>): T | undefined {\n  return tree.node.value;\n}\n\n/**\n * Sets data to this tree node.\n *\n * @param value - Value to set.\n */\nexport function treeSetValue<T>(tree: Tree<T>, value: T | undefined): void {\n  tree.node.value = value;\n  treeUpdateParents(tree);\n}\n\n/**\n * @returns Whether the tree has any children.\n */\nexport function treeHasChildren<T>(tree: Tree<T>): boolean {\n  return tree.node.childCount > 0;\n}\n\n/**\n * @returns Whethe rthe tree is empty (no value or children).\n */\nexport function treeIsEmpty<T>(tree: Tree<T>): boolean {\n  return treeGetValue(tree) === undefined && !treeHasChildren(tree);\n}\n\n/**\n * Calls action for each child of this tree node.\n *\n * @param action - Action to be called for each child.\n */\nexport function treeForEachChild<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => void\n): void {\n  each(tree.node.children, (child: string, childTree: TreeNode<T>) => {\n    action(new Tree<T>(child, tree, childTree));\n  });\n}\n\n/**\n * Does a depth-first traversal of this node's descendants, calling action for each one.\n *\n * @param action - Action to be called for each child.\n * @param includeSelf - Whether to call action on this node as well. Defaults to\n *   false.\n * @param childrenFirst - Whether to call action on children before calling it on\n *   parent.\n */\nexport function treeForEachDescendant<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => void,\n  includeSelf?: boolean,\n  childrenFirst?: boolean\n): void {\n  if (includeSelf && !childrenFirst) {\n    action(tree);\n  }\n\n  treeForEachChild(tree, child => {\n    treeForEachDescendant(child, action, true, childrenFirst);\n  });\n\n  if (includeSelf && childrenFirst) {\n    action(tree);\n  }\n}\n\n/**\n * Calls action on each ancestor node.\n *\n * @param action - Action to be called on each parent; return\n *   true to abort.\n * @param includeSelf - Whether to call action on this node as well.\n * @returns true if the action callback returned true.\n */\nexport function treeForEachAncestor<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => unknown,\n  includeSelf?: boolean\n): boolean {\n  let node = includeSelf ? tree : tree.parent;\n  while (node !== null) {\n    if (action(node)) {\n      return true;\n    }\n    node = node.parent;\n  }\n  return false;\n}\n\n/**\n * Does a depth-first traversal of this node's descendants.  When a descendant with a value\n * is found, action is called on it and traversal does not continue inside the node.\n * Action is *not* called on this node.\n *\n * @param action - Action to be called for each child.\n */\nexport function treeForEachImmediateDescendantWithValue<T>(\n  tree: Tree<T>,\n  action: (tree: Tree<T>) => void\n): void {\n  treeForEachChild(tree, child => {\n    if (treeGetValue(child) !== undefined) {\n      action(child);\n    } else {\n      treeForEachImmediateDescendantWithValue(child, action);\n    }\n  });\n}\n\n/**\n * @returns The path of this tree node, as a Path.\n */\nexport function treeGetPath<T>(tree: Tree<T>) {\n  return new Path(\n    tree.parent === null\n      ? tree.name\n      : treeGetPath(tree.parent) + '/' + tree.name\n  );\n}\n\n/**\n * Adds or removes this child from its parent based on whether it's empty or not.\n */\nfunction treeUpdateParents<T>(tree: Tree<T>) {\n  if (tree.parent !== null) {\n    treeUpdateChild(tree.parent, tree.name, tree);\n  }\n}\n\n/**\n * Adds or removes the passed child to this tree node, depending on whether it's empty.\n *\n * @param childName - The name of the child to update.\n * @param child - The child to update.\n */\nfunction treeUpdateChild<T>(tree: Tree<T>, childName: string, child: Tree<T>) {\n  const childEmpty = treeIsEmpty(child);\n  const childExists = contains(tree.node.children, childName);\n  if (childEmpty && childExists) {\n    delete tree.node.children[childName];\n    tree.node.childCount--;\n    treeUpdateParents(tree);\n  } else if (!childEmpty && !childExists) {\n    tree.node.children[childName] = child.node;\n    tree.node.childCount++;\n    treeUpdateParents(tree);\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\nimport {\n  contains,\n  errorPrefix as errorPrefixFxn,\n  safeGet,\n  stringLength\n} from '@firebase/util';\n\nimport { RepoInfo } from '../RepoInfo';\n\nimport {\n  Path,\n  pathChild,\n  pathCompare,\n  pathContains,\n  pathGetBack,\n  pathGetFront,\n  pathSlice,\n  ValidationPath,\n  validationPathPop,\n  validationPathPush,\n  validationPathToErrorString\n} from './Path';\nimport { each, isInvalidJSONNumber } from './util';\n\n/**\n * True for invalid Firebase keys\n */\nexport const INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\n\n/**\n * True for invalid Firebase paths.\n * Allows '/' in paths.\n */\nexport const INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\n\n/**\n * Maximum number of characters to allow in leaf value\n */\nexport const MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\n\nexport const isValidKey = function (key: unknown): boolean {\n  return (\n    typeof key === 'string' && key.length !== 0 && !INVALID_KEY_REGEX_.test(key)\n  );\n};\n\nexport const isValidPathString = function (pathString: string): boolean {\n  return (\n    typeof pathString === 'string' &&\n    pathString.length !== 0 &&\n    !INVALID_PATH_REGEX_.test(pathString)\n  );\n};\n\nexport const isValidRootPathString = function (pathString: string): boolean {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n\n  return isValidPathString(pathString);\n};\n\nexport const isValidPriority = function (priority: unknown): boolean {\n  return (\n    priority === null ||\n    typeof priority === 'string' ||\n    (typeof priority === 'number' && !isInvalidJSONNumber(priority)) ||\n    (priority &&\n      typeof priority === 'object' &&\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      contains(priority as any, '.sv'))\n  );\n};\n\n/**\n * Pre-validate a datum passed as an argument to Firebase function.\n */\nexport const validateFirebaseDataArg = function (\n  fnName: string,\n  value: unknown,\n  path: Path,\n  optional: boolean\n) {\n  if (optional && value === undefined) {\n    return;\n  }\n\n  validateFirebaseData(errorPrefixFxn(fnName, 'value'), value, path);\n};\n\n/**\n * Validate a data object client-side before sending to server.\n */\nexport const validateFirebaseData = function (\n  errorPrefix: string,\n  data: unknown,\n  path_: Path | ValidationPath\n) {\n  const path =\n    path_ instanceof Path ? new ValidationPath(path_, errorPrefix) : path_;\n\n  if (data === undefined) {\n    throw new Error(\n      errorPrefix + 'contains undefined ' + validationPathToErrorString(path)\n    );\n  }\n  if (typeof data === 'function') {\n    throw new Error(\n      errorPrefix +\n        'contains a function ' +\n        validationPathToErrorString(path) +\n        ' with contents = ' +\n        data.toString()\n    );\n  }\n  if (isInvalidJSONNumber(data)) {\n    throw new Error(\n      errorPrefix +\n        'contains ' +\n        data.toString() +\n        ' ' +\n        validationPathToErrorString(path)\n    );\n  }\n\n  // Check max leaf size, but try to avoid the utf8 conversion if we can.\n  if (\n    typeof data === 'string' &&\n    data.length > MAX_LEAF_SIZE_ / 3 &&\n    stringLength(data) > MAX_LEAF_SIZE_\n  ) {\n    throw new Error(\n      errorPrefix +\n        'contains a string greater than ' +\n        MAX_LEAF_SIZE_ +\n        ' utf8 bytes ' +\n        validationPathToErrorString(path) +\n        \" ('\" +\n        data.substring(0, 50) +\n        \"...')\"\n    );\n  }\n\n  // TODO = Perf = Consider combining the recursive validation of keys into NodeFromJSON\n  // to save extra walking of large objects.\n  if (data && typeof data === 'object') {\n    let hasDotValue = false;\n    let hasActualChild = false;\n    each(data, (key: string, value: unknown) => {\n      if (key === '.value') {\n        hasDotValue = true;\n      } else if (key !== '.priority' && key !== '.sv') {\n        hasActualChild = true;\n        if (!isValidKey(key)) {\n          throw new Error(\n            errorPrefix +\n              ' contains an invalid key (' +\n              key +\n              ') ' +\n              validationPathToErrorString(path) +\n              '.  Keys must be non-empty strings ' +\n              'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n          );\n        }\n      }\n\n      validationPathPush(path, key);\n      validateFirebaseData(errorPrefix, value, path);\n      validationPathPop(path);\n    });\n\n    if (hasDotValue && hasActualChild) {\n      throw new Error(\n        errorPrefix +\n          ' contains \".value\" child ' +\n          validationPathToErrorString(path) +\n          ' in addition to actual children.'\n      );\n    }\n  }\n};\n\n/**\n * Pre-validate paths passed in the firebase function.\n */\nexport const validateFirebaseMergePaths = function (\n  errorPrefix: string,\n  mergePaths: Path[]\n) {\n  let i, curPath: Path;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    const keys = pathSlice(curPath);\n    for (let j = 0; j < keys.length; j++) {\n      if (keys[j] === '.priority' && j === keys.length - 1) {\n        // .priority is OK\n      } else if (!isValidKey(keys[j])) {\n        throw new Error(\n          errorPrefix +\n            'contains an invalid key (' +\n            keys[j] +\n            ') in path ' +\n            curPath.toString() +\n            '. Keys must be non-empty strings ' +\n            'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n        );\n      }\n    }\n  }\n\n  // Check that update keys are not descendants of each other.\n  // We rely on the property that sorting guarantees that ancestors come\n  // right before descendants.\n  mergePaths.sort(pathCompare);\n  let prevPath: Path | null = null;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    if (prevPath !== null && pathContains(prevPath, curPath)) {\n      throw new Error(\n        errorPrefix +\n          'contains a path ' +\n          prevPath.toString() +\n          ' that is ancestor of another path ' +\n          curPath.toString()\n      );\n    }\n    prevPath = curPath;\n  }\n};\n\n/**\n * pre-validate an object passed as an argument to firebase function (\n * must be an object - e.g. for firebase.update()).\n */\nexport const validateFirebaseMergeDataArg = function (\n  fnName: string,\n  data: unknown,\n  path: Path,\n  optional: boolean\n) {\n  if (optional && data === undefined) {\n    return;\n  }\n\n  const errorPrefix = errorPrefixFxn(fnName, 'values');\n\n  if (!(data && typeof data === 'object') || Array.isArray(data)) {\n    throw new Error(\n      errorPrefix + ' must be an object containing the children to replace.'\n    );\n  }\n\n  const mergePaths: Path[] = [];\n  each(data, (key: string, value: unknown) => {\n    const curPath = new Path(key);\n    validateFirebaseData(errorPrefix, value, pathChild(path, curPath));\n    if (pathGetBack(curPath) === '.priority') {\n      if (!isValidPriority(value)) {\n        throw new Error(\n          errorPrefix +\n            \"contains an invalid value for '\" +\n            curPath.toString() +\n            \"', which must be a valid \" +\n            'Firebase priority (a string, finite number, server value, or null).'\n        );\n      }\n    }\n    mergePaths.push(curPath);\n  });\n  validateFirebaseMergePaths(errorPrefix, mergePaths);\n};\n\nexport const validatePriority = function (\n  fnName: string,\n  priority: unknown,\n  optional: boolean\n) {\n  if (optional && priority === undefined) {\n    return;\n  }\n  if (isInvalidJSONNumber(priority)) {\n    throw new Error(\n      errorPrefixFxn(fnName, 'priority') +\n        'is ' +\n        priority.toString() +\n        ', but must be a valid Firebase priority (a string, finite number, ' +\n        'server value, or null).'\n    );\n  }\n  // Special case to allow importing data with a .sv.\n  if (!isValidPriority(priority)) {\n    throw new Error(\n      errorPrefixFxn(fnName, 'priority') +\n        'must be a valid Firebase priority ' +\n        '(a string, finite number, server value, or null).'\n    );\n  }\n};\n\nexport const validateKey = function (\n  fnName: string,\n  argumentName: string,\n  key: string,\n  optional: boolean\n) {\n  if (optional && key === undefined) {\n    return;\n  }\n  if (!isValidKey(key)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) +\n        'was an invalid key = \"' +\n        key +\n        '\".  Firebase keys must be non-empty strings and ' +\n        'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").'\n    );\n  }\n};\n\n/**\n * @internal\n */\nexport const validatePathString = function (\n  fnName: string,\n  argumentName: string,\n  pathString: string,\n  optional: boolean\n) {\n  if (optional && pathString === undefined) {\n    return;\n  }\n\n  if (!isValidPathString(pathString)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) +\n        'was an invalid path = \"' +\n        pathString +\n        '\". Paths must be non-empty strings and ' +\n        'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"'\n    );\n  }\n};\n\nexport const validateRootPathString = function (\n  fnName: string,\n  argumentName: string,\n  pathString: string,\n  optional: boolean\n) {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n\n  validatePathString(fnName, argumentName, pathString, optional);\n};\n\n/**\n * @internal\n */\nexport const validateWritablePath = function (fnName: string, path: Path) {\n  if (pathGetFront(path) === '.info') {\n    throw new Error(fnName + \" failed = Can't modify data under /.info/\");\n  }\n};\n\nexport const validateUrl = function (\n  fnName: string,\n  parsedUrl: { repoInfo: RepoInfo; path: Path }\n) {\n  // TODO = Validate server better.\n  const pathString = parsedUrl.path.toString();\n  if (\n    !(typeof parsedUrl.repoInfo.host === 'string') ||\n    parsedUrl.repoInfo.host.length === 0 ||\n    (!isValidKey(parsedUrl.repoInfo.namespace) &&\n      parsedUrl.repoInfo.host.split(':')[0] !== 'localhost') ||\n    (pathString.length !== 0 && !isValidRootPathString(pathString))\n  ) {\n    throw new Error(\n      errorPrefixFxn(fnName, 'url') +\n        'must be a valid firebase URL and ' +\n        'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".'\n    );\n  }\n};\n\nexport const validateString = function (\n  fnName: string,\n  argumentName: string,\n  string: unknown,\n  optional: boolean\n) {\n  if (optional && string === undefined) {\n    return;\n  }\n  if (!(typeof string === 'string')) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) + 'must be a valid string.'\n    );\n  }\n};\n\nexport const validateObject = function (\n  fnName: string,\n  argumentName: string,\n  obj: unknown,\n  optional: boolean\n) {\n  if (optional && obj === undefined) {\n    return;\n  }\n  if (!(obj && typeof obj === 'object') || obj === null) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentName) + 'must be a valid object.'\n    );\n  }\n};\n\nexport const validateObjectContainsKey = function (\n  fnName: string,\n  argumentName: string,\n  obj: unknown,\n  key: string,\n  optional: boolean,\n  optType?: string\n) {\n  const objectContainsKey =\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    obj && typeof obj === 'object' && contains(obj as any, key);\n\n  if (!objectContainsKey) {\n    if (optional) {\n      return;\n    } else {\n      throw new Error(\n        errorPrefixFxn(fnName, argumentName) +\n          'must contain the key \"' +\n          key +\n          '\"'\n      );\n    }\n  }\n\n  if (optType) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    const val = safeGet(obj as any, key);\n    if (\n      (optType === 'number' && !(typeof val === 'number')) ||\n      (optType === 'string' && !(typeof val === 'string')) ||\n      (optType === 'boolean' && !(typeof val === 'boolean')) ||\n      (optType === 'function' && !(typeof val === 'function')) ||\n      (optType === 'object' && !(typeof val === 'object') && val)\n    ) {\n      if (optional) {\n        throw new Error(\n          errorPrefixFxn(fnName, argumentName) +\n            'contains invalid value for key \"' +\n            key +\n            '\" (must be of type \"' +\n            optType +\n            '\")'\n        );\n      } else {\n        throw new Error(\n          errorPrefixFxn(fnName, argumentName) +\n            'must contain the key \"' +\n            key +\n            '\" with type \"' +\n            optType +\n            '\"'\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\nimport { Path, pathContains, pathEquals } from '../util/Path';\nimport { exceptionGuard, log, logger } from '../util/util';\n\nimport { Event } from './Event';\n\n/**\n * The event queue serves a few purposes:\n * 1. It ensures we maintain event order in the face of event callbacks doing operations that result in more\n *    events being queued.\n * 2. raiseQueuedEvents() handles being called reentrantly nicely.  That is, if in the course of raising events,\n *    raiseQueuedEvents() is called again, the \"inner\" call will pick up raising events where the \"outer\" call\n *    left off, ensuring that the events are still raised synchronously and in order.\n * 3. You can use raiseEventsAtPath and raiseEventsForChangedPath to ensure only relevant previously-queued\n *    events are raised synchronously.\n *\n * NOTE: This can all go away if/when we move to async events.\n *\n */\nexport class EventQueue {\n  eventLists_: EventList[] = [];\n\n  /**\n   * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n   */\n  recursionDepth_ = 0;\n}\n\n/**\n * @param eventDataList - The new events to queue.\n */\nexport function eventQueueQueueEvents(\n  eventQueue: EventQueue,\n  eventDataList: Event[]\n) {\n  // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\n  let currList: EventList | null = null;\n  for (let i = 0; i < eventDataList.length; i++) {\n    const data = eventDataList[i];\n    const path = data.getPath();\n    if (currList !== null && !pathEquals(path, currList.path)) {\n      eventQueue.eventLists_.push(currList);\n      currList = null;\n    }\n\n    if (currList === null) {\n      currList = { events: [], path };\n    }\n\n    currList.events.push(data);\n  }\n  if (currList) {\n    eventQueue.eventLists_.push(currList);\n  }\n}\n\n/**\n * Queues the specified events and synchronously raises all events (including previously queued ones)\n * for the specified path.\n *\n * It is assumed that the new events are all for the specified path.\n *\n * @param path - The path to raise events for.\n * @param eventDataList - The new events to raise.\n */\nexport function eventQueueRaiseEventsAtPath(\n  eventQueue: EventQueue,\n  path: Path,\n  eventDataList: Event[]\n) {\n  eventQueueQueueEvents(eventQueue, eventDataList);\n  eventQueueRaiseQueuedEventsMatchingPredicate(eventQueue, eventPath =>\n    pathEquals(eventPath, path)\n  );\n}\n\n/**\n * Queues the specified events and synchronously raises all events (including previously queued ones) for\n * locations related to the specified change path (i.e. all ancestors and descendants).\n *\n * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\n *\n * @param changedPath - The path to raise events for.\n * @param eventDataList - The events to raise\n */\nexport function eventQueueRaiseEventsForChangedPath(\n  eventQueue: EventQueue,\n  changedPath: Path,\n  eventDataList: Event[]\n) {\n  eventQueueQueueEvents(eventQueue, eventDataList);\n  eventQueueRaiseQueuedEventsMatchingPredicate(\n    eventQueue,\n    eventPath =>\n      pathContains(eventPath, changedPath) ||\n      pathContains(changedPath, eventPath)\n  );\n}\n\nfunction eventQueueRaiseQueuedEventsMatchingPredicate(\n  eventQueue: EventQueue,\n  predicate: (path: Path) => boolean\n) {\n  eventQueue.recursionDepth_++;\n\n  let sentAll = true;\n  for (let i = 0; i < eventQueue.eventLists_.length; i++) {\n    const eventList = eventQueue.eventLists_[i];\n    if (eventList) {\n      const eventPath = eventList.path;\n      if (predicate(eventPath)) {\n        eventListRaise(eventQueue.eventLists_[i]);\n        eventQueue.eventLists_[i] = null;\n      } else {\n        sentAll = false;\n      }\n    }\n  }\n\n  if (sentAll) {\n    eventQueue.eventLists_ = [];\n  }\n\n  eventQueue.recursionDepth_--;\n}\n\ninterface EventList {\n  events: Event[];\n  path: Path;\n}\n\n/**\n * Iterates through the list and raises each event\n */\nfunction eventListRaise(eventList: EventList) {\n  for (let i = 0; i < eventList.events.length; i++) {\n    const eventData = eventList.events[i];\n    if (eventData !== null) {\n      eventList.events[i] = null;\n      const eventFn = eventData.getEventRunner();\n      if (logger) {\n        log('event: ' + eventData.toString());\n      }\n      exceptionGuard(eventFn);\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\nimport {\n  assert,\n  contains,\n  isEmpty,\n  map,\n  safeGet,\n  stringify\n} from '@firebase/util';\n\nimport { ValueEventRegistration } from '../api/Reference_impl';\n\nimport { AppCheckTokenProvider } from './AppCheckTokenProvider';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { PersistentConnection } from './PersistentConnection';\nimport { ReadonlyRestClient } from './ReadonlyRestClient';\nimport { RepoInfo } from './RepoInfo';\nimport { ServerActions } from './ServerActions';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Node } from './snap/Node';\nimport { nodeFromJSON } from './snap/nodeFromJSON';\nimport { SnapshotHolder } from './SnapshotHolder';\nimport {\n  newSparseSnapshotTree,\n  SparseSnapshotTree,\n  sparseSnapshotTreeForEachTree,\n  sparseSnapshotTreeForget,\n  sparseSnapshotTreeRemember\n} from './SparseSnapshotTree';\nimport { StatsCollection } from './stats/StatsCollection';\nimport { StatsListener } from './stats/StatsListener';\nimport {\n  statsManagerGetCollection,\n  statsManagerGetOrCreateReporter\n} from './stats/StatsManager';\nimport { StatsReporter, statsReporterIncludeStat } from './stats/StatsReporter';\nimport {\n  SyncTree,\n  syncTreeAckUserWrite,\n  syncTreeAddEventRegistration,\n  syncTreeApplyServerMerge,\n  syncTreeApplyServerOverwrite,\n  syncTreeApplyTaggedQueryMerge,\n  syncTreeApplyTaggedQueryOverwrite,\n  syncTreeApplyUserMerge,\n  syncTreeApplyUserOverwrite,\n  syncTreeCalcCompleteEventCache,\n  syncTreeGetServerValue,\n  syncTreeRemoveEventRegistration,\n  syncTreeTagForQuery\n} from './SyncTree';\nimport { Indexable } from './util/misc';\nimport {\n  newEmptyPath,\n  newRelativePath,\n  Path,\n  pathChild,\n  pathGetFront,\n  pathPopFront\n} from './util/Path';\nimport {\n  generateWithValues,\n  resolveDeferredValueSnapshot,\n  resolveDeferredValueTree\n} from './util/ServerValues';\nimport {\n  Tree,\n  treeForEachAncestor,\n  treeForEachChild,\n  treeForEachDescendant,\n  treeGetPath,\n  treeGetValue,\n  treeHasChildren,\n  treeSetValue,\n  treeSubTree\n} from './util/Tree';\nimport {\n  beingCrawled,\n  each,\n  exceptionGuard,\n  log,\n  LUIDGenerator,\n  warn\n} from './util/util';\nimport { isValidPriority, validateFirebaseData } from './util/validation';\nimport { Event } from './view/Event';\nimport {\n  EventQueue,\n  eventQueueQueueEvents,\n  eventQueueRaiseEventsAtPath,\n  eventQueueRaiseEventsForChangedPath\n} from './view/EventQueue';\nimport { EventRegistration, QueryContext } from './view/EventRegistration';\n\nconst INTERRUPT_REASON = 'repo_interrupt';\n\n/**\n * If a transaction does not succeed after 25 retries, we abort it. Among other\n * things this ensure that if there's ever a bug causing a mismatch between\n * client / server hashes for some data, we won't retry indefinitely.\n */\nconst MAX_TRANSACTION_RETRIES = 25;\n\nconst enum TransactionStatus {\n  // We've run the transaction and updated transactionResultData_ with the result, but it isn't currently sent to the\n  // server. A transaction will go from RUN -> SENT -> RUN if it comes back from the server as rejected due to\n  // mismatched hash.\n  RUN,\n\n  // We've run the transaction and sent it to the server and it's currently outstanding (hasn't come back as accepted\n  // or rejected yet).\n  SENT,\n\n  // Temporary state used to mark completed transactions (whether successful or aborted).  The transaction will be\n  // removed when we get a chance to prune completed ones.\n  COMPLETED,\n\n  // Used when an already-sent transaction needs to be aborted (e.g. due to a conflicting set() call that was made).\n  // If it comes back as unsuccessful, we'll abort it.\n  SENT_NEEDS_ABORT,\n\n  // Temporary state used to mark transactions that need to be aborted.\n  NEEDS_ABORT\n}\n\ninterface Transaction {\n  path: Path;\n  update: (a: unknown) => unknown;\n  onComplete: (\n    error: Error | null,\n    committed: boolean,\n    node: Node | null\n  ) => void;\n  status: TransactionStatus;\n  order: number;\n  applyLocally: boolean;\n  retryCount: number;\n  unwatcher: () => void;\n  abortReason: string | null;\n  currentWriteId: number;\n  currentInputSnapshot: Node | null;\n  currentOutputSnapshotRaw: Node | null;\n  currentOutputSnapshotResolved: Node | null;\n}\n\n/**\n * A connection to a single data repository.\n */\nexport class Repo {\n  /** Key for uniquely identifying this repo, used in RepoManager */\n  readonly key: string;\n\n  dataUpdateCount = 0;\n  infoSyncTree_: SyncTree;\n  serverSyncTree_: SyncTree;\n\n  stats_: StatsCollection;\n  statsListener_: StatsListener | null = null;\n  eventQueue_ = new EventQueue();\n  nextWriteId_ = 1;\n  server_: ServerActions;\n  statsReporter_: StatsReporter;\n  infoData_: SnapshotHolder;\n  interceptServerDataCallback_: ((a: string, b: unknown) => void) | null = null;\n\n  /** A list of data pieces and paths to be set when this client disconnects. */\n  onDisconnect_: SparseSnapshotTree = newSparseSnapshotTree();\n\n  /** Stores queues of outstanding transactions for Firebase locations. */\n  transactionQueueTree_ = new Tree<Transaction[]>();\n\n  // TODO: This should be @private but it's used by test_access.js and internal.js\n  persistentConnection_: PersistentConnection | null = null;\n\n  constructor(\n    public repoInfo_: RepoInfo,\n    public forceRestClient_: boolean,\n    public authTokenProvider_: AuthTokenProvider,\n    public appCheckProvider_: AppCheckTokenProvider\n  ) {\n    // This key is intentionally not updated if RepoInfo is later changed or replaced\n    this.key = this.repoInfo_.toURLString();\n  }\n\n  /**\n   * @returns The URL corresponding to the root of this Firebase.\n   */\n  toString(): string {\n    return (\n      (this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host\n    );\n  }\n}\n\nexport function repoStart(\n  repo: Repo,\n  appId: string,\n  authOverride?: object\n): void {\n  repo.stats_ = statsManagerGetCollection(repo.repoInfo_);\n\n  if (repo.forceRestClient_ || beingCrawled()) {\n    repo.server_ = new ReadonlyRestClient(\n      repo.repoInfo_,\n      (\n        pathString: string,\n        data: unknown,\n        isMerge: boolean,\n        tag: number | null\n      ) => {\n        repoOnDataUpdate(repo, pathString, data, isMerge, tag);\n      },\n      repo.authTokenProvider_,\n      repo.appCheckProvider_\n    );\n\n    // Minor hack: Fire onConnect immediately, since there's no actual connection.\n    setTimeout(() => repoOnConnectStatus(repo, /* connectStatus= */ true), 0);\n  } else {\n    // Validate authOverride\n    if (typeof authOverride !== 'undefined' && authOverride !== null) {\n      if (typeof authOverride !== 'object') {\n        throw new Error(\n          'Only objects are supported for option databaseAuthVariableOverride'\n        );\n      }\n      try {\n        stringify(authOverride);\n      } catch (e) {\n        throw new Error('Invalid authOverride provided: ' + e);\n      }\n    }\n\n    repo.persistentConnection_ = new PersistentConnection(\n      repo.repoInfo_,\n      appId,\n      (\n        pathString: string,\n        data: unknown,\n        isMerge: boolean,\n        tag: number | null\n      ) => {\n        repoOnDataUpdate(repo, pathString, data, isMerge, tag);\n      },\n      (connectStatus: boolean) => {\n        repoOnConnectStatus(repo, connectStatus);\n      },\n      (updates: object) => {\n        repoOnServerInfoUpdate(repo, updates);\n      },\n      repo.authTokenProvider_,\n      repo.appCheckProvider_,\n      authOverride\n    );\n\n    repo.server_ = repo.persistentConnection_;\n  }\n\n  repo.authTokenProvider_.addTokenChangeListener(token => {\n    repo.server_.refreshAuthToken(token);\n  });\n\n  repo.appCheckProvider_.addTokenChangeListener(result => {\n    repo.server_.refreshAppCheckToken(result.token);\n  });\n\n  // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\n  // we only want to create one StatsReporter.  As such, we'll report stats over the first Repo created.\n  repo.statsReporter_ = statsManagerGetOrCreateReporter(\n    repo.repoInfo_,\n    () => new StatsReporter(repo.stats_, repo.server_)\n  );\n\n  // Used for .info.\n  repo.infoData_ = new SnapshotHolder();\n  repo.infoSyncTree_ = new SyncTree({\n    startListening: (query, tag, currentHashFn, onComplete) => {\n      let infoEvents: Event[] = [];\n      const node = repo.infoData_.getNode(query._path);\n      // This is possibly a hack, but we have different semantics for .info endpoints. We don't raise null events\n      // on initial data...\n      if (!node.isEmpty()) {\n        infoEvents = syncTreeApplyServerOverwrite(\n          repo.infoSyncTree_,\n          query._path,\n          node\n        );\n        setTimeout(() => {\n          onComplete('ok');\n        }, 0);\n      }\n      return infoEvents;\n    },\n    stopListening: () => {}\n  });\n  repoUpdateInfo(repo, 'connected', false);\n\n  repo.serverSyncTree_ = new SyncTree({\n    startListening: (query, tag, currentHashFn, onComplete) => {\n      repo.server_.listen(query, currentHashFn, tag, (status, data) => {\n        const events = onComplete(status, data);\n        eventQueueRaiseEventsForChangedPath(\n          repo.eventQueue_,\n          query._path,\n          events\n        );\n      });\n      // No synchronous events for network-backed sync trees\n      return [];\n    },\n    stopListening: (query, tag) => {\n      repo.server_.unlisten(query, tag);\n    }\n  });\n}\n\n/**\n * @returns The time in milliseconds, taking the server offset into account if we have one.\n */\nexport function repoServerTime(repo: Repo): number {\n  const offsetNode = repo.infoData_.getNode(new Path('.info/serverTimeOffset'));\n  const offset = (offsetNode.val() as number) || 0;\n  return new Date().getTime() + offset;\n}\n\n/**\n * Generate ServerValues using some variables from the repo object.\n */\nexport function repoGenerateServerValues(repo: Repo): Indexable {\n  return generateWithValues({\n    timestamp: repoServerTime(repo)\n  });\n}\n\n/**\n * Called by realtime when we get new messages from the server.\n */\nfunction repoOnDataUpdate(\n  repo: Repo,\n  pathString: string,\n  data: unknown,\n  isMerge: boolean,\n  tag: number | null\n): void {\n  // For testing.\n  repo.dataUpdateCount++;\n  const path = new Path(pathString);\n  data = repo.interceptServerDataCallback_\n    ? repo.interceptServerDataCallback_(pathString, data)\n    : data;\n  let events = [];\n  if (tag) {\n    if (isMerge) {\n      const taggedChildren = map(\n        data as { [k: string]: unknown },\n        (raw: unknown) => nodeFromJSON(raw)\n      );\n      events = syncTreeApplyTaggedQueryMerge(\n        repo.serverSyncTree_,\n        path,\n        taggedChildren,\n        tag\n      );\n    } else {\n      const taggedSnap = nodeFromJSON(data);\n      events = syncTreeApplyTaggedQueryOverwrite(\n        repo.serverSyncTree_,\n        path,\n        taggedSnap,\n        tag\n      );\n    }\n  } else if (isMerge) {\n    const changedChildren = map(\n      data as { [k: string]: unknown },\n      (raw: unknown) => nodeFromJSON(raw)\n    );\n    events = syncTreeApplyServerMerge(\n      repo.serverSyncTree_,\n      path,\n      changedChildren\n    );\n  } else {\n    const snap = nodeFromJSON(data);\n    events = syncTreeApplyServerOverwrite(repo.serverSyncTree_, path, snap);\n  }\n  let affectedPath = path;\n  if (events.length > 0) {\n    // Since we have a listener outstanding for each transaction, receiving any events\n    // is a proxy for some change having occurred.\n    affectedPath = repoRerunTransactions(repo, path);\n  }\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, affectedPath, events);\n}\n\n// TODO: This should be @private but it's used by test_access.js and internal.js\nexport function repoInterceptServerData(\n  repo: Repo,\n  callback: ((a: string, b: unknown) => unknown) | null\n): void {\n  repo.interceptServerDataCallback_ = callback;\n}\n\nfunction repoOnConnectStatus(repo: Repo, connectStatus: boolean): void {\n  repoUpdateInfo(repo, 'connected', connectStatus);\n  if (connectStatus === false) {\n    repoRunOnDisconnectEvents(repo);\n  }\n}\n\nfunction repoOnServerInfoUpdate(repo: Repo, updates: object): void {\n  each(updates, (key: string, value: unknown) => {\n    repoUpdateInfo(repo, key, value);\n  });\n}\n\nfunction repoUpdateInfo(repo: Repo, pathString: string, value: unknown): void {\n  const path = new Path('/.info/' + pathString);\n  const newNode = nodeFromJSON(value);\n  repo.infoData_.updateSnapshot(path, newNode);\n  const events = syncTreeApplyServerOverwrite(\n    repo.infoSyncTree_,\n    path,\n    newNode\n  );\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n}\n\nfunction repoGetNextWriteId(repo: Repo): number {\n  return repo.nextWriteId_++;\n}\n\n/**\n * The purpose of `getValue` is to return the latest known value\n * satisfying `query`.\n *\n * This method will first check for in-memory cached values\n * belonging to active listeners. If they are found, such values\n * are considered to be the most up-to-date.\n *\n * If the client is not connected, this method will wait until the\n *  repo has established a connection and then request the value for `query`.\n * If the client is not able to retrieve the query result for another reason,\n * it reports an error.\n *\n * @param query - The query to surface a value for.\n */\nexport function repoGetValue(\n  repo: Repo,\n  query: QueryContext,\n  eventRegistration: ValueEventRegistration\n): Promise<Node> {\n  // Only active queries are cached. There is no persisted cache.\n  const cached = syncTreeGetServerValue(repo.serverSyncTree_, query);\n  if (cached != null) {\n    return Promise.resolve(cached);\n  }\n  return repo.server_.get(query).then(\n    payload => {\n      const node = nodeFromJSON(payload).withIndex(\n        query._queryParams.getIndex()\n      );\n      /**\n       * Below we simulate the actions of an `onlyOnce` `onValue()` event where:\n       * Add an event registration,\n       * Update data at the path,\n       * Raise any events,\n       * Cleanup the SyncTree\n       */\n      syncTreeAddEventRegistration(\n        repo.serverSyncTree_,\n        query,\n        eventRegistration,\n        true\n      );\n      let events: Event[];\n      if (query._queryParams.loadsAllData()) {\n        events = syncTreeApplyServerOverwrite(\n          repo.serverSyncTree_,\n          query._path,\n          node\n        );\n      } else {\n        const tag = syncTreeTagForQuery(repo.serverSyncTree_, query);\n        events = syncTreeApplyTaggedQueryOverwrite(\n          repo.serverSyncTree_,\n          query._path,\n          node,\n          tag\n        );\n      }\n      /*\n       * We need to raise events in the scenario where `get()` is called at a parent path, and\n       * while the `get()` is pending, `onValue` is called at a child location. While get() is waiting\n       * for the data, `onValue` will register a new event. Then, get() will come back, and update the syncTree\n       * and its corresponding serverCache, including the child location where `onValue` is called. Then,\n       * `onValue` will receive the event from the server, but look at the syncTree and see that the data received\n       * from the server is already at the SyncPoint, and so the `onValue` callback will never get fired.\n       * Calling `eventQueueRaiseEventsForChangedPath()` is the correct way to propagate the events and\n       * ensure the corresponding child events will get fired.\n       */\n      eventQueueRaiseEventsForChangedPath(\n        repo.eventQueue_,\n        query._path,\n        events\n      );\n      syncTreeRemoveEventRegistration(\n        repo.serverSyncTree_,\n        query,\n        eventRegistration,\n        null,\n        true\n      );\n      return node;\n    },\n    err => {\n      repoLog(repo, 'get for query ' + stringify(query) + ' failed: ' + err);\n      return Promise.reject(new Error(err as string));\n    }\n  );\n}\n\nexport function repoSetWithPriority(\n  repo: Repo,\n  path: Path,\n  newVal: unknown,\n  newPriority: number | string | null,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  repoLog(repo, 'set', {\n    path: path.toString(),\n    value: newVal,\n    priority: newPriority\n  });\n\n  // TODO: Optimize this behavior to either (a) store flag to skip resolving where possible and / or\n  // (b) store unresolved paths on JSON parse\n  const serverValues = repoGenerateServerValues(repo);\n  const newNodeUnresolved = nodeFromJSON(newVal, newPriority);\n  const existing = syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path);\n  const newNode = resolveDeferredValueSnapshot(\n    newNodeUnresolved,\n    existing,\n    serverValues\n  );\n\n  const writeId = repoGetNextWriteId(repo);\n  const events = syncTreeApplyUserOverwrite(\n    repo.serverSyncTree_,\n    path,\n    newNode,\n    writeId,\n    true\n  );\n  eventQueueQueueEvents(repo.eventQueue_, events);\n  repo.server_.put(\n    path.toString(),\n    newNodeUnresolved.val(/*export=*/ true),\n    (status, errorReason) => {\n      const success = status === 'ok';\n      if (!success) {\n        warn('set at ' + path + ' failed: ' + status);\n      }\n\n      const clearEvents = syncTreeAckUserWrite(\n        repo.serverSyncTree_,\n        writeId,\n        !success\n      );\n      eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, clearEvents);\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n  const affectedPath = repoAbortTransactions(repo, path);\n  repoRerunTransactions(repo, affectedPath);\n  // We queued the events above, so just flush the queue here\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, affectedPath, []);\n}\n\nexport function repoUpdate(\n  repo: Repo,\n  path: Path,\n  childrenToMerge: { [k: string]: unknown },\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  repoLog(repo, 'update', { path: path.toString(), value: childrenToMerge });\n\n  // Start with our existing data and merge each child into it.\n  let empty = true;\n  const serverValues = repoGenerateServerValues(repo);\n  const changedChildren: { [k: string]: Node } = {};\n  each(childrenToMerge, (changedKey: string, changedValue: unknown) => {\n    empty = false;\n    changedChildren[changedKey] = resolveDeferredValueTree(\n      pathChild(path, changedKey),\n      nodeFromJSON(changedValue),\n      repo.serverSyncTree_,\n      serverValues\n    );\n  });\n\n  if (!empty) {\n    const writeId = repoGetNextWriteId(repo);\n    const events = syncTreeApplyUserMerge(\n      repo.serverSyncTree_,\n      path,\n      changedChildren,\n      writeId\n    );\n    eventQueueQueueEvents(repo.eventQueue_, events);\n    repo.server_.merge(\n      path.toString(),\n      childrenToMerge,\n      (status, errorReason) => {\n        const success = status === 'ok';\n        if (!success) {\n          warn('update at ' + path + ' failed: ' + status);\n        }\n\n        const clearEvents = syncTreeAckUserWrite(\n          repo.serverSyncTree_,\n          writeId,\n          !success\n        );\n        const affectedPath =\n          clearEvents.length > 0 ? repoRerunTransactions(repo, path) : path;\n        eventQueueRaiseEventsForChangedPath(\n          repo.eventQueue_,\n          affectedPath,\n          clearEvents\n        );\n        repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n      }\n    );\n\n    each(childrenToMerge, (changedPath: string) => {\n      const affectedPath = repoAbortTransactions(\n        repo,\n        pathChild(path, changedPath)\n      );\n      repoRerunTransactions(repo, affectedPath);\n    });\n\n    // We queued the events above, so just flush the queue here\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, []);\n  } else {\n    log(\"update() called with empty data.  Don't do anything.\");\n    repoCallOnCompleteCallback(repo, onComplete, 'ok', undefined);\n  }\n}\n\n/**\n * Applies all of the changes stored up in the onDisconnect_ tree.\n */\nfunction repoRunOnDisconnectEvents(repo: Repo): void {\n  repoLog(repo, 'onDisconnectEvents');\n\n  const serverValues = repoGenerateServerValues(repo);\n  const resolvedOnDisconnectTree = newSparseSnapshotTree();\n  sparseSnapshotTreeForEachTree(\n    repo.onDisconnect_,\n    newEmptyPath(),\n    (path, node) => {\n      const resolved = resolveDeferredValueTree(\n        path,\n        node,\n        repo.serverSyncTree_,\n        serverValues\n      );\n      sparseSnapshotTreeRemember(resolvedOnDisconnectTree, path, resolved);\n    }\n  );\n  let events: Event[] = [];\n\n  sparseSnapshotTreeForEachTree(\n    resolvedOnDisconnectTree,\n    newEmptyPath(),\n    (path, snap) => {\n      events = events.concat(\n        syncTreeApplyServerOverwrite(repo.serverSyncTree_, path, snap)\n      );\n      const affectedPath = repoAbortTransactions(repo, path);\n      repoRerunTransactions(repo, affectedPath);\n    }\n  );\n\n  repo.onDisconnect_ = newSparseSnapshotTree();\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, newEmptyPath(), events);\n}\n\nexport function repoOnDisconnectCancel(\n  repo: Repo,\n  path: Path,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  repo.server_.onDisconnectCancel(path.toString(), (status, errorReason) => {\n    if (status === 'ok') {\n      sparseSnapshotTreeForget(repo.onDisconnect_, path);\n    }\n    repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n  });\n}\n\nexport function repoOnDisconnectSet(\n  repo: Repo,\n  path: Path,\n  value: unknown,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  const newNode = nodeFromJSON(value);\n  repo.server_.onDisconnectPut(\n    path.toString(),\n    newNode.val(/*export=*/ true),\n    (status, errorReason) => {\n      if (status === 'ok') {\n        sparseSnapshotTreeRemember(repo.onDisconnect_, path, newNode);\n      }\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n}\n\nexport function repoOnDisconnectSetWithPriority(\n  repo: Repo,\n  path: Path,\n  value: unknown,\n  priority: unknown,\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  const newNode = nodeFromJSON(value, priority);\n  repo.server_.onDisconnectPut(\n    path.toString(),\n    newNode.val(/*export=*/ true),\n    (status, errorReason) => {\n      if (status === 'ok') {\n        sparseSnapshotTreeRemember(repo.onDisconnect_, path, newNode);\n      }\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n}\n\nexport function repoOnDisconnectUpdate(\n  repo: Repo,\n  path: Path,\n  childrenToMerge: { [k: string]: unknown },\n  onComplete: ((status: Error | null, errorReason?: string) => void) | null\n): void {\n  if (isEmpty(childrenToMerge)) {\n    log(\"onDisconnect().update() called with empty data.  Don't do anything.\");\n    repoCallOnCompleteCallback(repo, onComplete, 'ok', undefined);\n    return;\n  }\n\n  repo.server_.onDisconnectMerge(\n    path.toString(),\n    childrenToMerge,\n    (status, errorReason) => {\n      if (status === 'ok') {\n        each(childrenToMerge, (childName: string, childNode: unknown) => {\n          const newChildNode = nodeFromJSON(childNode);\n          sparseSnapshotTreeRemember(\n            repo.onDisconnect_,\n            pathChild(path, childName),\n            newChildNode\n          );\n        });\n      }\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    }\n  );\n}\n\nexport function repoAddEventCallbackForQuery(\n  repo: Repo,\n  query: QueryContext,\n  eventRegistration: EventRegistration\n): void {\n  let events;\n  if (pathGetFront(query._path) === '.info') {\n    events = syncTreeAddEventRegistration(\n      repo.infoSyncTree_,\n      query,\n      eventRegistration\n    );\n  } else {\n    events = syncTreeAddEventRegistration(\n      repo.serverSyncTree_,\n      query,\n      eventRegistration\n    );\n  }\n  eventQueueRaiseEventsAtPath(repo.eventQueue_, query._path, events);\n}\n\nexport function repoRemoveEventCallbackForQuery(\n  repo: Repo,\n  query: QueryContext,\n  eventRegistration: EventRegistration\n): void {\n  // These are guaranteed not to raise events, since we're not passing in a cancelError. However, we can future-proof\n  // a little bit by handling the return values anyways.\n  let events;\n  if (pathGetFront(query._path) === '.info') {\n    events = syncTreeRemoveEventRegistration(\n      repo.infoSyncTree_,\n      query,\n      eventRegistration\n    );\n  } else {\n    events = syncTreeRemoveEventRegistration(\n      repo.serverSyncTree_,\n      query,\n      eventRegistration\n    );\n  }\n  eventQueueRaiseEventsAtPath(repo.eventQueue_, query._path, events);\n}\n\nexport function repoInterrupt(repo: Repo): void {\n  if (repo.persistentConnection_) {\n    repo.persistentConnection_.interrupt(INTERRUPT_REASON);\n  }\n}\n\nexport function repoResume(repo: Repo): void {\n  if (repo.persistentConnection_) {\n    repo.persistentConnection_.resume(INTERRUPT_REASON);\n  }\n}\n\nexport function repoStats(repo: Repo, showDelta: boolean = false): void {\n  if (typeof console === 'undefined') {\n    return;\n  }\n\n  let stats: { [k: string]: unknown };\n  if (showDelta) {\n    if (!repo.statsListener_) {\n      repo.statsListener_ = new StatsListener(repo.stats_);\n    }\n    stats = repo.statsListener_.get();\n  } else {\n    stats = repo.stats_.get();\n  }\n\n  const longestName = Object.keys(stats).reduce(\n    (previousValue, currentValue) =>\n      Math.max(currentValue.length, previousValue),\n    0\n  );\n\n  each(stats, (stat: string, value: unknown) => {\n    let paddedStat = stat;\n    // pad stat names to be the same length (plus 2 extra spaces).\n    for (let i = stat.length; i < longestName + 2; i++) {\n      paddedStat += ' ';\n    }\n    console.log(paddedStat + value);\n  });\n}\n\nexport function repoStatsIncrementCounter(repo: Repo, metric: string): void {\n  repo.stats_.incrementCounter(metric);\n  statsReporterIncludeStat(repo.statsReporter_, metric);\n}\n\nfunction repoLog(repo: Repo, ...varArgs: unknown[]): void {\n  let prefix = '';\n  if (repo.persistentConnection_) {\n    prefix = repo.persistentConnection_.id + ':';\n  }\n  log(prefix, ...varArgs);\n}\n\nexport function repoCallOnCompleteCallback(\n  repo: Repo,\n  callback: ((status: Error | null, errorReason?: string) => void) | null,\n  status: string,\n  errorReason?: string | null\n): void {\n  if (callback) {\n    exceptionGuard(() => {\n      if (status === 'ok') {\n        callback(null);\n      } else {\n        const code = (status || 'error').toUpperCase();\n        let message = code;\n        if (errorReason) {\n          message += ': ' + errorReason;\n        }\n\n        const error = new Error(message);\n\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        (error as any).code = code;\n        callback(error);\n      }\n    });\n  }\n}\n\n/**\n * Creates a new transaction, adds it to the transactions we're tracking, and\n * sends it to the server if possible.\n *\n * @param path - Path at which to do transaction.\n * @param transactionUpdate - Update callback.\n * @param onComplete - Completion callback.\n * @param unwatcher - Function that will be called when the transaction no longer\n * need data updates for `path`.\n * @param applyLocally - Whether or not to make intermediate results visible\n */\nexport function repoStartTransaction(\n  repo: Repo,\n  path: Path,\n  transactionUpdate: (a: unknown) => unknown,\n  onComplete: ((error: Error, committed: boolean, node: Node) => void) | null,\n  unwatcher: () => void,\n  applyLocally: boolean\n): void {\n  repoLog(repo, 'transaction on ' + path);\n\n  // Initialize transaction.\n  const transaction: Transaction = {\n    path,\n    update: transactionUpdate,\n    onComplete,\n    // One of TransactionStatus enums.\n    status: null,\n    // Used when combining transactions at different locations to figure out\n    // which one goes first.\n    order: LUIDGenerator(),\n    // Whether to raise local events for this transaction.\n    applyLocally,\n    // Count of how many times we've retried the transaction.\n    retryCount: 0,\n    // Function to call to clean up our .on() listener.\n    unwatcher,\n    // Stores why a transaction was aborted.\n    abortReason: null,\n    currentWriteId: null,\n    currentInputSnapshot: null,\n    currentOutputSnapshotRaw: null,\n    currentOutputSnapshotResolved: null\n  };\n\n  // Run transaction initially.\n  const currentState = repoGetLatestState(repo, path, undefined);\n  transaction.currentInputSnapshot = currentState;\n  const newVal = transaction.update(currentState.val());\n  if (newVal === undefined) {\n    // Abort transaction.\n    transaction.unwatcher();\n    transaction.currentOutputSnapshotRaw = null;\n    transaction.currentOutputSnapshotResolved = null;\n    if (transaction.onComplete) {\n      transaction.onComplete(null, false, transaction.currentInputSnapshot);\n    }\n  } else {\n    validateFirebaseData(\n      'transaction failed: Data returned ',\n      newVal,\n      transaction.path\n    );\n\n    // Mark as run and add to our queue.\n    transaction.status = TransactionStatus.RUN;\n    const queueNode = treeSubTree(repo.transactionQueueTree_, path);\n    const nodeQueue = treeGetValue(queueNode) || [];\n    nodeQueue.push(transaction);\n\n    treeSetValue(queueNode, nodeQueue);\n\n    // Update visibleData and raise events\n    // Note: We intentionally raise events after updating all of our\n    // transaction state, since the user could start new transactions from the\n    // event callbacks.\n    let priorityForNode;\n    if (\n      typeof newVal === 'object' &&\n      newVal !== null &&\n      contains(newVal, '.priority')\n    ) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      priorityForNode = safeGet(newVal as any, '.priority');\n      assert(\n        isValidPriority(priorityForNode),\n        'Invalid priority returned by transaction. ' +\n          'Priority must be a valid string, finite number, server value, or null.'\n      );\n    } else {\n      const currentNode =\n        syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path) ||\n        ChildrenNode.EMPTY_NODE;\n      priorityForNode = currentNode.getPriority().val();\n    }\n\n    const serverValues = repoGenerateServerValues(repo);\n    const newNodeUnresolved = nodeFromJSON(newVal, priorityForNode);\n    const newNode = resolveDeferredValueSnapshot(\n      newNodeUnresolved,\n      currentState,\n      serverValues\n    );\n    transaction.currentOutputSnapshotRaw = newNodeUnresolved;\n    transaction.currentOutputSnapshotResolved = newNode;\n    transaction.currentWriteId = repoGetNextWriteId(repo);\n\n    const events = syncTreeApplyUserOverwrite(\n      repo.serverSyncTree_,\n      path,\n      newNode,\n      transaction.currentWriteId,\n      transaction.applyLocally\n    );\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n\n    repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n  }\n}\n\n/**\n * @param excludeSets - A specific set to exclude\n */\nfunction repoGetLatestState(\n  repo: Repo,\n  path: Path,\n  excludeSets?: number[]\n): Node {\n  return (\n    syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path, excludeSets) ||\n    ChildrenNode.EMPTY_NODE\n  );\n}\n\n/**\n * Sends any already-run transactions that aren't waiting for outstanding\n * transactions to complete.\n *\n * Externally it's called with no arguments, but it calls itself recursively\n * with a particular transactionQueueTree node to recurse through the tree.\n *\n * @param node - transactionQueueTree node to start at.\n */\nfunction repoSendReadyTransactions(\n  repo: Repo,\n  node: Tree<Transaction[]> = repo.transactionQueueTree_\n): void {\n  // Before recursing, make sure any completed transactions are removed.\n  if (!node) {\n    repoPruneCompletedTransactionsBelowNode(repo, node);\n  }\n\n  if (treeGetValue(node)) {\n    const queue = repoBuildTransactionQueue(repo, node);\n    assert(queue.length > 0, 'Sending zero length transaction queue');\n\n    const allRun = queue.every(\n      (transaction: Transaction) => transaction.status === TransactionStatus.RUN\n    );\n\n    // If they're all run (and not sent), we can send them.  Else, we must wait.\n    if (allRun) {\n      repoSendTransactionQueue(repo, treeGetPath(node), queue);\n    }\n  } else if (treeHasChildren(node)) {\n    treeForEachChild(node, childNode => {\n      repoSendReadyTransactions(repo, childNode);\n    });\n  }\n}\n\n/**\n * Given a list of run transactions, send them to the server and then handle\n * the result (success or failure).\n *\n * @param path - The location of the queue.\n * @param queue - Queue of transactions under the specified location.\n */\nfunction repoSendTransactionQueue(\n  repo: Repo,\n  path: Path,\n  queue: Transaction[]\n): void {\n  // Mark transactions as sent and increment retry count!\n  const setsToIgnore = queue.map(txn => {\n    return txn.currentWriteId;\n  });\n  const latestState = repoGetLatestState(repo, path, setsToIgnore);\n  let snapToSend = latestState;\n  const latestHash = latestState.hash();\n  for (let i = 0; i < queue.length; i++) {\n    const txn = queue[i];\n    assert(\n      txn.status === TransactionStatus.RUN,\n      'tryToSendTransactionQueue_: items in queue should all be run.'\n    );\n    txn.status = TransactionStatus.SENT;\n    txn.retryCount++;\n    const relativePath = newRelativePath(path, txn.path);\n    // If we've gotten to this point, the output snapshot must be defined.\n    snapToSend = snapToSend.updateChild(\n      relativePath /** @type {!Node} */,\n      txn.currentOutputSnapshotRaw\n    );\n  }\n\n  const dataToSend = snapToSend.val(true);\n  const pathToSend = path;\n\n  // Send the put.\n  repo.server_.put(\n    pathToSend.toString(),\n    dataToSend,\n    (status: string) => {\n      repoLog(repo, 'transaction put response', {\n        path: pathToSend.toString(),\n        status\n      });\n\n      let events: Event[] = [];\n      if (status === 'ok') {\n        // Queue up the callbacks and fire them after cleaning up all of our\n        // transaction state, since the callback could trigger more\n        // transactions or sets.\n        const callbacks = [];\n        for (let i = 0; i < queue.length; i++) {\n          queue[i].status = TransactionStatus.COMPLETED;\n          events = events.concat(\n            syncTreeAckUserWrite(repo.serverSyncTree_, queue[i].currentWriteId)\n          );\n          if (queue[i].onComplete) {\n            // We never unset the output snapshot, and given that this\n            // transaction is complete, it should be set\n            callbacks.push(() =>\n              queue[i].onComplete(\n                null,\n                true,\n                queue[i].currentOutputSnapshotResolved\n              )\n            );\n          }\n          queue[i].unwatcher();\n        }\n\n        // Now remove the completed transactions.\n        repoPruneCompletedTransactionsBelowNode(\n          repo,\n          treeSubTree(repo.transactionQueueTree_, path)\n        );\n        // There may be pending transactions that we can now send.\n        repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n\n        eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n\n        // Finally, trigger onComplete callbacks.\n        for (let i = 0; i < callbacks.length; i++) {\n          exceptionGuard(callbacks[i]);\n        }\n      } else {\n        // transactions are no longer sent.  Update their status appropriately.\n        if (status === 'datastale') {\n          for (let i = 0; i < queue.length; i++) {\n            if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n              queue[i].status = TransactionStatus.NEEDS_ABORT;\n            } else {\n              queue[i].status = TransactionStatus.RUN;\n            }\n          }\n        } else {\n          warn(\n            'transaction at ' + pathToSend.toString() + ' failed: ' + status\n          );\n          for (let i = 0; i < queue.length; i++) {\n            queue[i].status = TransactionStatus.NEEDS_ABORT;\n            queue[i].abortReason = status;\n          }\n        }\n\n        repoRerunTransactions(repo, path);\n      }\n    },\n    latestHash\n  );\n}\n\n/**\n * Finds all transactions dependent on the data at changedPath and reruns them.\n *\n * Should be called any time cached data changes.\n *\n * Return the highest path that was affected by rerunning transactions. This\n * is the path at which events need to be raised for.\n *\n * @param changedPath - The path in mergedData that changed.\n * @returns The rootmost path that was affected by rerunning transactions.\n */\nfunction repoRerunTransactions(repo: Repo, changedPath: Path): Path {\n  const rootMostTransactionNode = repoGetAncestorTransactionNode(\n    repo,\n    changedPath\n  );\n  const path = treeGetPath(rootMostTransactionNode);\n\n  const queue = repoBuildTransactionQueue(repo, rootMostTransactionNode);\n  repoRerunTransactionQueue(repo, queue, path);\n\n  return path;\n}\n\n/**\n * Does all the work of rerunning transactions (as well as cleans up aborted\n * transactions and whatnot).\n *\n * @param queue - The queue of transactions to run.\n * @param path - The path the queue is for.\n */\nfunction repoRerunTransactionQueue(\n  repo: Repo,\n  queue: Transaction[],\n  path: Path\n): void {\n  if (queue.length === 0) {\n    return; // Nothing to do!\n  }\n\n  // Queue up the callbacks and fire them after cleaning up all of our\n  // transaction state, since the callback could trigger more transactions or\n  // sets.\n  const callbacks = [];\n  let events: Event[] = [];\n  // Ignore all of the sets we're going to re-run.\n  const txnsToRerun = queue.filter(q => {\n    return q.status === TransactionStatus.RUN;\n  });\n  const setsToIgnore = txnsToRerun.map(q => {\n    return q.currentWriteId;\n  });\n  for (let i = 0; i < queue.length; i++) {\n    const transaction = queue[i];\n    const relativePath = newRelativePath(path, transaction.path);\n    let abortTransaction = false,\n      abortReason;\n    assert(\n      relativePath !== null,\n      'rerunTransactionsUnderNode_: relativePath should not be null.'\n    );\n\n    if (transaction.status === TransactionStatus.NEEDS_ABORT) {\n      abortTransaction = true;\n      abortReason = transaction.abortReason;\n      events = events.concat(\n        syncTreeAckUserWrite(\n          repo.serverSyncTree_,\n          transaction.currentWriteId,\n          true\n        )\n      );\n    } else if (transaction.status === TransactionStatus.RUN) {\n      if (transaction.retryCount >= MAX_TRANSACTION_RETRIES) {\n        abortTransaction = true;\n        abortReason = 'maxretry';\n        events = events.concat(\n          syncTreeAckUserWrite(\n            repo.serverSyncTree_,\n            transaction.currentWriteId,\n            true\n          )\n        );\n      } else {\n        // This code reruns a transaction\n        const currentNode = repoGetLatestState(\n          repo,\n          transaction.path,\n          setsToIgnore\n        );\n        transaction.currentInputSnapshot = currentNode;\n        const newData = queue[i].update(currentNode.val());\n        if (newData !== undefined) {\n          validateFirebaseData(\n            'transaction failed: Data returned ',\n            newData,\n            transaction.path\n          );\n          let newDataNode = nodeFromJSON(newData);\n          const hasExplicitPriority =\n            typeof newData === 'object' &&\n            newData != null &&\n            contains(newData, '.priority');\n          if (!hasExplicitPriority) {\n            // Keep the old priority if there wasn't a priority explicitly specified.\n            newDataNode = newDataNode.updatePriority(currentNode.getPriority());\n          }\n\n          const oldWriteId = transaction.currentWriteId;\n          const serverValues = repoGenerateServerValues(repo);\n          const newNodeResolved = resolveDeferredValueSnapshot(\n            newDataNode,\n            currentNode,\n            serverValues\n          );\n\n          transaction.currentOutputSnapshotRaw = newDataNode;\n          transaction.currentOutputSnapshotResolved = newNodeResolved;\n          transaction.currentWriteId = repoGetNextWriteId(repo);\n          // Mutates setsToIgnore in place\n          setsToIgnore.splice(setsToIgnore.indexOf(oldWriteId), 1);\n          events = events.concat(\n            syncTreeApplyUserOverwrite(\n              repo.serverSyncTree_,\n              transaction.path,\n              newNodeResolved,\n              transaction.currentWriteId,\n              transaction.applyLocally\n            )\n          );\n          events = events.concat(\n            syncTreeAckUserWrite(repo.serverSyncTree_, oldWriteId, true)\n          );\n        } else {\n          abortTransaction = true;\n          abortReason = 'nodata';\n          events = events.concat(\n            syncTreeAckUserWrite(\n              repo.serverSyncTree_,\n              transaction.currentWriteId,\n              true\n            )\n          );\n        }\n      }\n    }\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n    events = [];\n    if (abortTransaction) {\n      // Abort.\n      queue[i].status = TransactionStatus.COMPLETED;\n\n      // Removing a listener can trigger pruning which can muck with\n      // mergedData/visibleData (as it prunes data). So defer the unwatcher\n      // until we're done.\n      (function (unwatcher) {\n        setTimeout(unwatcher, Math.floor(0));\n      })(queue[i].unwatcher);\n\n      if (queue[i].onComplete) {\n        if (abortReason === 'nodata') {\n          callbacks.push(() =>\n            queue[i].onComplete(null, false, queue[i].currentInputSnapshot)\n          );\n        } else {\n          callbacks.push(() =>\n            queue[i].onComplete(new Error(abortReason), false, null)\n          );\n        }\n      }\n    }\n  }\n\n  // Clean up completed transactions.\n  repoPruneCompletedTransactionsBelowNode(repo, repo.transactionQueueTree_);\n\n  // Now fire callbacks, now that we're in a good, known state.\n  for (let i = 0; i < callbacks.length; i++) {\n    exceptionGuard(callbacks[i]);\n  }\n\n  // Try to send the transaction result to the server.\n  repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n}\n\n/**\n * Returns the rootmost ancestor node of the specified path that has a pending\n * transaction on it, or just returns the node for the given path if there are\n * no pending transactions on any ancestor.\n *\n * @param path - The location to start at.\n * @returns The rootmost node with a transaction.\n */\nfunction repoGetAncestorTransactionNode(\n  repo: Repo,\n  path: Path\n): Tree<Transaction[]> {\n  let front;\n\n  // Start at the root and walk deeper into the tree towards path until we\n  // find a node with pending transactions.\n  let transactionNode = repo.transactionQueueTree_;\n  front = pathGetFront(path);\n  while (front !== null && treeGetValue(transactionNode) === undefined) {\n    transactionNode = treeSubTree(transactionNode, front);\n    path = pathPopFront(path);\n    front = pathGetFront(path);\n  }\n\n  return transactionNode;\n}\n\n/**\n * Builds the queue of all transactions at or below the specified\n * transactionNode.\n *\n * @param transactionNode\n * @returns The generated queue.\n */\nfunction repoBuildTransactionQueue(\n  repo: Repo,\n  transactionNode: Tree<Transaction[]>\n): Transaction[] {\n  // Walk any child transaction queues and aggregate them into a single queue.\n  const transactionQueue: Transaction[] = [];\n  repoAggregateTransactionQueuesForNode(\n    repo,\n    transactionNode,\n    transactionQueue\n  );\n\n  // Sort them by the order the transactions were created.\n  transactionQueue.sort((a, b) => a.order - b.order);\n\n  return transactionQueue;\n}\n\nfunction repoAggregateTransactionQueuesForNode(\n  repo: Repo,\n  node: Tree<Transaction[]>,\n  queue: Transaction[]\n): void {\n  const nodeQueue = treeGetValue(node);\n  if (nodeQueue) {\n    for (let i = 0; i < nodeQueue.length; i++) {\n      queue.push(nodeQueue[i]);\n    }\n  }\n\n  treeForEachChild(node, child => {\n    repoAggregateTransactionQueuesForNode(repo, child, queue);\n  });\n}\n\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n */\nfunction repoPruneCompletedTransactionsBelowNode(\n  repo: Repo,\n  node: Tree<Transaction[]>\n): void {\n  const queue = treeGetValue(node);\n  if (queue) {\n    let to = 0;\n    for (let from = 0; from < queue.length; from++) {\n      if (queue[from].status !== TransactionStatus.COMPLETED) {\n        queue[to] = queue[from];\n        to++;\n      }\n    }\n    queue.length = to;\n    treeSetValue(node, queue.length > 0 ? queue : undefined);\n  }\n\n  treeForEachChild(node, childNode => {\n    repoPruneCompletedTransactionsBelowNode(repo, childNode);\n  });\n}\n\n/**\n * Aborts all transactions on ancestors or descendants of the specified path.\n * Called when doing a set() or update() since we consider them incompatible\n * with transactions.\n *\n * @param path - Path for which we want to abort related transactions.\n */\nfunction repoAbortTransactions(repo: Repo, path: Path): Path {\n  const affectedPath = treeGetPath(repoGetAncestorTransactionNode(repo, path));\n\n  const transactionNode = treeSubTree(repo.transactionQueueTree_, path);\n\n  treeForEachAncestor(transactionNode, (node: Tree<Transaction[]>) => {\n    repoAbortTransactionsOnNode(repo, node);\n  });\n\n  repoAbortTransactionsOnNode(repo, transactionNode);\n\n  treeForEachDescendant(transactionNode, (node: Tree<Transaction[]>) => {\n    repoAbortTransactionsOnNode(repo, node);\n  });\n\n  return affectedPath;\n}\n\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param node - Node to abort transactions for.\n */\nfunction repoAbortTransactionsOnNode(\n  repo: Repo,\n  node: Tree<Transaction[]>\n): void {\n  const queue = treeGetValue(node);\n  if (queue) {\n    // Queue up the callbacks and fire them after cleaning up all of our\n    // transaction state, since the callback could trigger more transactions\n    // or sets.\n    const callbacks = [];\n\n    // Go through queue.  Any already-sent transactions must be marked for\n    // abort, while the unsent ones can be immediately aborted and removed.\n    let events: Event[] = [];\n    let lastSent = -1;\n    for (let i = 0; i < queue.length; i++) {\n      if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n        // Already marked.  No action needed.\n      } else if (queue[i].status === TransactionStatus.SENT) {\n        assert(\n          lastSent === i - 1,\n          'All SENT items should be at beginning of queue.'\n        );\n        lastSent = i;\n        // Mark transaction for abort when it comes back.\n        queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\n        queue[i].abortReason = 'set';\n      } else {\n        assert(\n          queue[i].status === TransactionStatus.RUN,\n          'Unexpected transaction status in abort'\n        );\n        // We can abort it immediately.\n        queue[i].unwatcher();\n        events = events.concat(\n          syncTreeAckUserWrite(\n            repo.serverSyncTree_,\n            queue[i].currentWriteId,\n            true\n          )\n        );\n        if (queue[i].onComplete) {\n          callbacks.push(\n            queue[i].onComplete.bind(null, new Error('set'), false, null)\n          );\n        }\n      }\n    }\n    if (lastSent === -1) {\n      // We're not waiting for any sent transactions.  We can clear the queue.\n      treeSetValue(node, undefined);\n    } else {\n      // Remove the transactions we aborted.\n      queue.length = lastSent + 1;\n    }\n\n    // Now fire the callbacks.\n    eventQueueRaiseEventsForChangedPath(\n      repo.eventQueue_,\n      treeGetPath(node),\n      events\n    );\n    for (let i = 0; i < callbacks.length; i++) {\n      exceptionGuard(callbacks[i]);\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\nimport { RepoInfo } from '../../RepoInfo';\nimport { Path } from '../Path';\nimport { warnIfPageIsSecure, warn, fatal } from '../util';\n\nfunction decodePath(pathString: string): string {\n  let pathStringDecoded = '';\n  const pieces = pathString.split('/');\n  for (let i = 0; i < pieces.length; i++) {\n    if (pieces[i].length > 0) {\n      let piece = pieces[i];\n      try {\n        piece = decodeURIComponent(piece.replace(/\\+/g, ' '));\n      } catch (e) {}\n      pathStringDecoded += '/' + piece;\n    }\n  }\n  return pathStringDecoded;\n}\n\n/**\n * @returns key value hash\n */\nfunction decodeQuery(queryString: string): { [key: string]: string } {\n  const results = {};\n  if (queryString.charAt(0) === '?') {\n    queryString = queryString.substring(1);\n  }\n  for (const segment of queryString.split('&')) {\n    if (segment.length === 0) {\n      continue;\n    }\n    const kv = segment.split('=');\n    if (kv.length === 2) {\n      results[decodeURIComponent(kv[0])] = decodeURIComponent(kv[1]);\n    } else {\n      warn(`Invalid query segment '${segment}' in query '${queryString}'`);\n    }\n  }\n  return results;\n}\n\nexport const parseRepoInfo = function (\n  dataURL: string,\n  nodeAdmin: boolean\n): { repoInfo: RepoInfo; path: Path } {\n  const parsedUrl = parseDatabaseURL(dataURL),\n    namespace = parsedUrl.namespace;\n\n  if (parsedUrl.domain === 'firebase.com') {\n    fatal(\n      parsedUrl.host +\n        ' is no longer supported. ' +\n        'Please use <YOUR FIREBASE>.firebaseio.com instead'\n    );\n  }\n\n  // Catch common error of uninitialized namespace value.\n  if (\n    (!namespace || namespace === 'undefined') &&\n    parsedUrl.domain !== 'localhost'\n  ) {\n    fatal(\n      'Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com'\n    );\n  }\n\n  if (!parsedUrl.secure) {\n    warnIfPageIsSecure();\n  }\n\n  const webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n\n  return {\n    repoInfo: new RepoInfo(\n      parsedUrl.host,\n      parsedUrl.secure,\n      namespace,\n      webSocketOnly,\n      nodeAdmin,\n      /*persistenceKey=*/ '',\n      /*includeNamespaceInQueryParams=*/ namespace !== parsedUrl.subdomain\n    ),\n    path: new Path(parsedUrl.pathString)\n  };\n};\n\nexport const parseDatabaseURL = function (dataURL: string): {\n  host: string;\n  port: number;\n  domain: string;\n  subdomain: string;\n  secure: boolean;\n  scheme: string;\n  pathString: string;\n  namespace: string;\n} {\n  // Default to empty strings in the event of a malformed string.\n  let host = '',\n    domain = '',\n    subdomain = '',\n    pathString = '',\n    namespace = '';\n\n  // Always default to SSL, unless otherwise specified.\n  let secure = true,\n    scheme = 'https',\n    port = 443;\n\n  // Don't do any validation here. The caller is responsible for validating the result of parsing.\n  if (typeof dataURL === 'string') {\n    // Parse scheme.\n    let colonInd = dataURL.indexOf('//');\n    if (colonInd >= 0) {\n      scheme = dataURL.substring(0, colonInd - 1);\n      dataURL = dataURL.substring(colonInd + 2);\n    }\n\n    // Parse host, path, and query string.\n    let slashInd = dataURL.indexOf('/');\n    if (slashInd === -1) {\n      slashInd = dataURL.length;\n    }\n    let questionMarkInd = dataURL.indexOf('?');\n    if (questionMarkInd === -1) {\n      questionMarkInd = dataURL.length;\n    }\n    host = dataURL.substring(0, Math.min(slashInd, questionMarkInd));\n    if (slashInd < questionMarkInd) {\n      // For pathString, questionMarkInd will always come after slashInd\n      pathString = decodePath(dataURL.substring(slashInd, questionMarkInd));\n    }\n    const queryParams = decodeQuery(\n      dataURL.substring(Math.min(dataURL.length, questionMarkInd))\n    );\n\n    // If we have a port, use scheme for determining if it's secure.\n    colonInd = host.indexOf(':');\n    if (colonInd >= 0) {\n      secure = scheme === 'https' || scheme === 'wss';\n      port = parseInt(host.substring(colonInd + 1), 10);\n    } else {\n      colonInd = host.length;\n    }\n\n    const hostWithoutPort = host.slice(0, colonInd);\n    if (hostWithoutPort.toLowerCase() === 'localhost') {\n      domain = 'localhost';\n    } else if (hostWithoutPort.split('.').length <= 2) {\n      domain = hostWithoutPort;\n    } else {\n      // Interpret the subdomain of a 3 or more component URL as the namespace name.\n      const dotInd = host.indexOf('.');\n      subdomain = host.substring(0, dotInd).toLowerCase();\n      domain = host.substring(dotInd + 1);\n      // Normalize namespaces to lowercase to share storage / connection.\n      namespace = subdomain;\n    }\n    // Always treat the value of the `ns` as the namespace name if it is present.\n    if ('ns' in queryParams) {\n      namespace = queryParams['ns'];\n    }\n  }\n\n  return {\n    host,\n    port,\n    domain,\n    subdomain,\n    secure,\n    scheme,\n    pathString,\n    namespace\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\nimport { assert } from '@firebase/util';\n\nimport {\n  tryParseInt,\n  MAX_NAME,\n  MIN_NAME,\n  INTEGER_32_MIN,\n  INTEGER_32_MAX\n} from '../util/util';\n\n// Modeled after base64 web-safe chars, but ordered by ASCII.\nconst PUSH_CHARS =\n  '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\n\nconst MIN_PUSH_CHAR = '-';\n\nconst MAX_PUSH_CHAR = 'z';\n\nconst MAX_KEY_LEN = 786;\n\n/**\n * Fancy ID generator that creates 20-character string identifiers with the\n * following properties:\n *\n * 1. They're based on timestamp so that they sort *after* any existing ids.\n * 2. They contain 72-bits of random data after the timestamp so that IDs won't\n *    collide with other clients' IDs.\n * 3. They sort *lexicographically* (so the timestamp is converted to characters\n *    that will sort properly).\n * 4. They're monotonically increasing. Even if you generate more than one in\n *    the same timestamp, the latter ones will sort after the former ones. We do\n *    this by using the previous random bits but \"incrementing\" them by 1 (only\n *    in the case of a timestamp collision).\n */\nexport const nextPushId = (function () {\n  // Timestamp of last push, used to prevent local collisions if you push twice\n  // in one ms.\n  let lastPushTime = 0;\n\n  // We generate 72-bits of randomness which get turned into 12 characters and\n  // appended to the timestamp to prevent collisions with other clients. We\n  // store the last characters we generated because in the event of a collision,\n  // we'll use those same characters except \"incremented\" by one.\n  const lastRandChars: number[] = [];\n\n  return function (now: number) {\n    const duplicateTime = now === lastPushTime;\n    lastPushTime = now;\n\n    let i;\n    const timeStampChars = new Array(8);\n    for (i = 7; i >= 0; i--) {\n      timeStampChars[i] = PUSH_CHARS.charAt(now % 64);\n      // NOTE: Can't use << here because javascript will convert to int and lose\n      // the upper bits.\n      now = Math.floor(now / 64);\n    }\n    assert(now === 0, 'Cannot push at time == 0');\n\n    let id = timeStampChars.join('');\n\n    if (!duplicateTime) {\n      for (i = 0; i < 12; i++) {\n        lastRandChars[i] = Math.floor(Math.random() * 64);\n      }\n    } else {\n      // If the timestamp hasn't changed since last push, use the same random\n      // number, except incremented by 1.\n      for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {\n        lastRandChars[i] = 0;\n      }\n      lastRandChars[i]++;\n    }\n    for (i = 0; i < 12; i++) {\n      id += PUSH_CHARS.charAt(lastRandChars[i]);\n    }\n    assert(id.length === 20, 'nextPushId: Length should be 20.');\n\n    return id;\n  };\n})();\n\nexport const successor = function (key: string) {\n  if (key === '' + INTEGER_32_MAX) {\n    // See https://firebase.google.com/docs/database/web/lists-of-data#data-order\n    return MIN_PUSH_CHAR;\n  }\n  const keyAsInt: number = tryParseInt(key);\n  if (keyAsInt != null) {\n    return '' + (keyAsInt + 1);\n  }\n  const next = new Array(key.length);\n\n  for (let i = 0; i < next.length; i++) {\n    next[i] = key.charAt(i);\n  }\n\n  if (next.length < MAX_KEY_LEN) {\n    next.push(MIN_PUSH_CHAR);\n    return next.join('');\n  }\n\n  let i = next.length - 1;\n\n  while (i >= 0 && next[i] === MAX_PUSH_CHAR) {\n    i--;\n  }\n\n  // `successor` was called on the largest possible key, so return the\n  // MAX_NAME, which sorts larger than all keys.\n  if (i === -1) {\n    return MAX_NAME;\n  }\n\n  const source = next[i];\n  const sourcePlusOne = PUSH_CHARS.charAt(PUSH_CHARS.indexOf(source) + 1);\n  next[i] = sourcePlusOne;\n\n  return next.slice(0, i + 1).join('');\n};\n\n// `key` is assumed to be non-empty.\nexport const predecessor = function (key: string) {\n  if (key === '' + INTEGER_32_MIN) {\n    return MIN_NAME;\n  }\n  const keyAsInt: number = tryParseInt(key);\n  if (keyAsInt != null) {\n    return '' + (keyAsInt - 1);\n  }\n  const next = new Array(key.length);\n  for (let i = 0; i < next.length; i++) {\n    next[i] = key.charAt(i);\n  }\n  // If `key` ends in `MIN_PUSH_CHAR`, the largest key lexicographically\n  // smaller than `key`, is `key[0:key.length - 1]`. The next key smaller\n  // than that, `predecessor(predecessor(key))`, is\n  //\n  // `key[0:key.length - 2] + (key[key.length - 1] - 1) + \\\n  //   { MAX_PUSH_CHAR repeated MAX_KEY_LEN - (key.length - 1) times }\n  //\n  // analogous to increment/decrement for base-10 integers.\n  //\n  // This works because lexigographic comparison works character-by-character,\n  // using length as a tie-breaker if one key is a prefix of the other.\n  if (next[next.length - 1] === MIN_PUSH_CHAR) {\n    if (next.length === 1) {\n      // See https://firebase.google.com/docs/database/web/lists-of-data#orderbykey\n      return '' + INTEGER_32_MAX;\n    }\n    delete next[next.length - 1];\n    return next.join('');\n  }\n  // Replace the last character with it's immediate predecessor, and\n  // fill the suffix of the key with MAX_PUSH_CHAR. This is the\n  // lexicographically largest possible key smaller than `key`.\n  next[next.length - 1] = PUSH_CHARS.charAt(\n    PUSH_CHARS.indexOf(next[next.length - 1]) - 1\n  );\n  return next.join('') + MAX_PUSH_CHAR.repeat(MAX_KEY_LEN - next.length);\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 { stringify } from '@firebase/util';\n\nimport { DataSnapshot as ExpDataSnapshot } from '../../api/Reference_impl';\nimport { Path } from '../util/Path';\n\nimport { EventRegistration } from './EventRegistration';\n\n/**\n * Encapsulates the data needed to raise an event\n * @interface\n */\nexport interface Event {\n  getPath(): Path;\n\n  getEventType(): string;\n\n  getEventRunner(): () => void;\n\n  toString(): string;\n}\n\n/**\n * One of the following strings: \"value\", \"child_added\", \"child_changed\",\n * \"child_removed\", or \"child_moved.\"\n */\nexport type EventType =\n  | 'value'\n  | 'child_added'\n  | 'child_changed'\n  | 'child_moved'\n  | 'child_removed';\n\n/**\n * Encapsulates the data needed to raise an event\n */\nexport class DataEvent implements Event {\n  /**\n   * @param eventType - One of: value, child_added, child_changed, child_moved, child_removed\n   * @param eventRegistration - The function to call to with the event data. User provided\n   * @param snapshot - The data backing the event\n   * @param prevName - Optional, the name of the previous child for child_* events.\n   */\n  constructor(\n    public eventType: EventType,\n    public eventRegistration: EventRegistration,\n    public snapshot: ExpDataSnapshot,\n    public prevName?: string | null\n  ) {}\n  getPath(): Path {\n    const ref = this.snapshot.ref;\n    if (this.eventType === 'value') {\n      return ref._path;\n    } else {\n      return ref.parent._path;\n    }\n  }\n  getEventType(): string {\n    return this.eventType;\n  }\n  getEventRunner(): () => void {\n    return this.eventRegistration.getEventRunner(this);\n  }\n  toString(): string {\n    return (\n      this.getPath().toString() +\n      ':' +\n      this.eventType +\n      ':' +\n      stringify(this.snapshot.exportVal())\n    );\n  }\n}\n\nexport class CancelEvent implements Event {\n  constructor(\n    public eventRegistration: EventRegistration,\n    public error: Error,\n    public path: Path\n  ) {}\n  getPath(): Path {\n    return this.path;\n  }\n  getEventType(): string {\n    return 'cancel';\n  }\n  getEventRunner(): () => void {\n    return this.eventRegistration.getEventRunner(this);\n  }\n  toString(): string {\n    return this.path.toString() + ':cancel';\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\nimport { assert } from '@firebase/util';\n\nimport { DataSnapshot } from '../../api/Reference_impl';\nimport { Repo } from '../Repo';\nimport { Path } from '../util/Path';\n\nimport { Change } from './Change';\nimport { CancelEvent, Event } from './Event';\nimport { QueryParams } from './QueryParams';\n\n/**\n * A user callback. Callbacks issues from the Legacy SDK maintain references\n * to the original user-issued callbacks, which allows equality\n * comparison by reference even though this callbacks are wrapped before\n * they can be passed to the firebase@exp SDK.\n *\n * @internal\n */\nexport interface UserCallback {\n  (dataSnapshot: DataSnapshot, previousChildName?: string | null): unknown;\n  userCallback?: unknown;\n  context?: object | null;\n}\n\n/**\n * A wrapper class that converts events from the database@exp SDK to the legacy\n * Database SDK. Events are not converted directly as event registration relies\n * on reference comparison of the original user callback (see `matches()`) and\n * relies on equality of the legacy SDK's `context` object.\n */\nexport class CallbackContext {\n  constructor(\n    private readonly snapshotCallback: UserCallback,\n    private readonly cancelCallback?: (error: Error) => unknown\n  ) {}\n\n  onValue(\n    expDataSnapshot: DataSnapshot,\n    previousChildName?: string | null\n  ): void {\n    this.snapshotCallback.call(null, expDataSnapshot, previousChildName);\n  }\n\n  onCancel(error: Error): void {\n    assert(\n      this.hasCancelCallback,\n      'Raising a cancel event on a listener with no cancel callback'\n    );\n    return this.cancelCallback.call(null, error);\n  }\n\n  get hasCancelCallback(): boolean {\n    return !!this.cancelCallback;\n  }\n\n  matches(other: CallbackContext): boolean {\n    return (\n      this.snapshotCallback === other.snapshotCallback ||\n      (this.snapshotCallback.userCallback !== undefined &&\n        this.snapshotCallback.userCallback ===\n          other.snapshotCallback.userCallback &&\n        this.snapshotCallback.context === other.snapshotCallback.context)\n    );\n  }\n}\n\nexport interface QueryContext {\n  readonly _queryIdentifier: string;\n  readonly _queryObject: object;\n  readonly _repo: Repo;\n  readonly _path: Path;\n  readonly _queryParams: QueryParams;\n}\n\n/**\n * An EventRegistration is basically an event type ('value', 'child_added', etc.) and a callback\n * to be notified of that type of event.\n *\n * That said, it can also contain a cancel callback to be notified if the event is canceled.  And\n * currently, this code is organized around the idea that you would register multiple child_ callbacks\n * together, as a single EventRegistration.  Though currently we don't do that.\n */\nexport interface EventRegistration {\n  /**\n   * True if this container has a callback to trigger for this event type\n   */\n  respondsTo(eventType: string): boolean;\n\n  createEvent(change: Change, query: QueryContext): Event;\n\n  /**\n   * Given event data, return a function to trigger the user's callback\n   */\n  getEventRunner(eventData: Event): () => void;\n\n  createCancelEvent(error: Error, path: Path): CancelEvent | null;\n\n  matches(other: EventRegistration): boolean;\n\n  /**\n   * False basically means this is a \"dummy\" callback container being used as a sentinel\n   * to remove all callback containers of a particular type.  (e.g. if the user does\n   * ref.off('value') without specifying a specific callback).\n   *\n   * (TODO: Rework this, since it's hacky)\n   *\n   */\n  hasAnyCallback(): boolean;\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 { Deferred } from '@firebase/util';\n\nimport {\n  Repo,\n  repoOnDisconnectCancel,\n  repoOnDisconnectSet,\n  repoOnDisconnectSetWithPriority,\n  repoOnDisconnectUpdate\n} from '../core/Repo';\nimport { Path } from '../core/util/Path';\nimport {\n  validateFirebaseDataArg,\n  validateFirebaseMergeDataArg,\n  validatePriority,\n  validateWritablePath\n} from '../core/util/validation';\n\n/**\n * The `onDisconnect` class allows you to write or clear data when your client\n * disconnects from the Database server. These updates occur whether your\n * client disconnects cleanly or not, so you can rely on them to clean up data\n * even if a connection is dropped or a client crashes.\n *\n * The `onDisconnect` class is most commonly used to manage presence in\n * applications where it is useful to detect how many clients are connected and\n * when other clients disconnect. See\n * {@link https://firebase.google.com/docs/database/web/offline-capabilities | Enabling Offline Capabilities in JavaScript}\n * for more information.\n *\n * To avoid problems when a connection is dropped before the requests can be\n * transferred to the Database server, these functions should be called before\n * writing any data.\n *\n * Note that `onDisconnect` operations are only triggered once. If you want an\n * operation to occur each time a disconnect occurs, you'll need to re-establish\n * the `onDisconnect` operations each time you reconnect.\n */\nexport class OnDisconnect {\n  /** @hideconstructor */\n  constructor(private _repo: Repo, private _path: Path) {}\n\n  /**\n   * Cancels all previously queued `onDisconnect()` set or update events for this\n   * location and all children.\n   *\n   * If a write has been queued for this location via a `set()` or `update()` at a\n   * parent location, the write at this location will be canceled, though writes\n   * to sibling locations will still occur.\n   *\n   * @returns Resolves when synchronization to the server is complete.\n   */\n  cancel(): Promise<void> {\n    const deferred = new Deferred<void>();\n    repoOnDisconnectCancel(\n      this._repo,\n      this._path,\n      deferred.wrapCallback(() => {})\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * Ensures the data at this location is deleted when the client is disconnected\n   * (due to closing the browser, navigating to a new page, or network issues).\n   *\n   * @returns Resolves when synchronization to the server is complete.\n   */\n  remove(): Promise<void> {\n    validateWritablePath('OnDisconnect.remove', this._path);\n    const deferred = new Deferred<void>();\n    repoOnDisconnectSet(\n      this._repo,\n      this._path,\n      null,\n      deferred.wrapCallback(() => {})\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * Ensures the data at this location is set to the specified value when the\n   * client is disconnected (due to closing the browser, navigating to a new page,\n   * or network issues).\n   *\n   * `set()` is especially useful for implementing \"presence\" systems, where a\n   * value should be changed or cleared when a user disconnects so that they\n   * appear \"offline\" to other users. See\n   * {@link https://firebase.google.com/docs/database/web/offline-capabilities | Enabling Offline Capabilities in JavaScript}\n   * for more information.\n   *\n   * Note that `onDisconnect` operations are only triggered once. If you want an\n   * operation to occur each time a disconnect occurs, you'll need to re-establish\n   * the `onDisconnect` operations each time.\n   *\n   * @param value - The value to be written to this location on disconnect (can\n   * be an object, array, string, number, boolean, or null).\n   * @returns Resolves when synchronization to the Database is complete.\n   */\n  set(value: unknown): Promise<void> {\n    validateWritablePath('OnDisconnect.set', this._path);\n    validateFirebaseDataArg('OnDisconnect.set', value, this._path, false);\n    const deferred = new Deferred<void>();\n    repoOnDisconnectSet(\n      this._repo,\n      this._path,\n      value,\n      deferred.wrapCallback(() => {})\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * Ensures the data at this location is set to the specified value and priority\n   * when the client is disconnected (due to closing the browser, navigating to a\n   * new page, or network issues).\n   *\n   * @param value - The value to be written to this location on disconnect (can\n   * be an object, array, string, number, boolean, or null).\n   * @param priority - The priority to be written (string, number, or null).\n   * @returns Resolves when synchronization to the Database is complete.\n   */\n  setWithPriority(\n    value: unknown,\n    priority: number | string | null\n  ): Promise<void> {\n    validateWritablePath('OnDisconnect.setWithPriority', this._path);\n    validateFirebaseDataArg(\n      'OnDisconnect.setWithPriority',\n      value,\n      this._path,\n      false\n    );\n    validatePriority('OnDisconnect.setWithPriority', priority, false);\n\n    const deferred = new Deferred<void>();\n    repoOnDisconnectSetWithPriority(\n      this._repo,\n      this._path,\n      value,\n      priority,\n      deferred.wrapCallback(() => {})\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * Writes multiple values at this location when the client is disconnected (due\n   * to closing the browser, navigating to a new page, or network issues).\n   *\n   * The `values` argument contains multiple property-value pairs that will be\n   * written to the Database together. Each child property can either be a simple\n   * property (for example, \"name\") or a relative path (for example, \"name/first\")\n   * from the current location to the data to update.\n   *\n   * As opposed to the `set()` method, `update()` can be use to selectively update\n   * only the referenced properties at the current location (instead of replacing\n   * all the child properties at the current location).\n   *\n   * @param values - Object containing multiple values.\n   * @returns Resolves when synchronization to the Database is complete.\n   */\n  update(values: object): Promise<void> {\n    validateWritablePath('OnDisconnect.update', this._path);\n    validateFirebaseMergeDataArg(\n      'OnDisconnect.update',\n      values,\n      this._path,\n      false\n    );\n    const deferred = new Deferred<void>();\n    repoOnDisconnectUpdate(\n      this._repo,\n      this._path,\n      values as Record<string, unknown>,\n      deferred.wrapCallback(() => {})\n    );\n    return deferred.promise;\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\nimport { assert, getModularInstance, Deferred } from '@firebase/util';\n\nimport {\n  Repo,\n  repoAddEventCallbackForQuery,\n  repoGetValue,\n  repoRemoveEventCallbackForQuery,\n  repoServerTime,\n  repoSetWithPriority,\n  repoUpdate\n} from '../core/Repo';\nimport { ChildrenNode } from '../core/snap/ChildrenNode';\nimport { Index } from '../core/snap/indexes/Index';\nimport { KEY_INDEX } from '../core/snap/indexes/KeyIndex';\nimport { PathIndex } from '../core/snap/indexes/PathIndex';\nimport { PRIORITY_INDEX } from '../core/snap/indexes/PriorityIndex';\nimport { VALUE_INDEX } from '../core/snap/indexes/ValueIndex';\nimport { Node } from '../core/snap/Node';\nimport { syncPointSetReferenceConstructor } from '../core/SyncPoint';\nimport { syncTreeSetReferenceConstructor } from '../core/SyncTree';\nimport { parseRepoInfo } from '../core/util/libs/parser';\nimport { nextPushId } from '../core/util/NextPushId';\nimport {\n  Path,\n  pathEquals,\n  pathGetBack,\n  pathGetFront,\n  pathChild,\n  pathParent,\n  pathToUrlEncodedString,\n  pathIsEmpty\n} from '../core/util/Path';\nimport {\n  fatal,\n  MAX_NAME,\n  MIN_NAME,\n  ObjectToUniqueKey\n} from '../core/util/util';\nimport {\n  isValidPriority,\n  validateFirebaseDataArg,\n  validateFirebaseMergeDataArg,\n  validateKey,\n  validatePathString,\n  validatePriority,\n  validateRootPathString,\n  validateUrl,\n  validateWritablePath\n} from '../core/util/validation';\nimport { Change } from '../core/view/Change';\nimport { CancelEvent, DataEvent, EventType } from '../core/view/Event';\nimport {\n  CallbackContext,\n  EventRegistration,\n  QueryContext,\n  UserCallback\n} from '../core/view/EventRegistration';\nimport {\n  QueryParams,\n  queryParamsEndAt,\n  queryParamsEndBefore,\n  queryParamsGetQueryObject,\n  queryParamsLimitToFirst,\n  queryParamsLimitToLast,\n  queryParamsOrderBy,\n  queryParamsStartAfter,\n  queryParamsStartAt\n} from '../core/view/QueryParams';\n\nimport { Database } from './Database';\nimport { OnDisconnect } from './OnDisconnect';\nimport {\n  ListenOptions,\n  Query as Query,\n  DatabaseReference,\n  Unsubscribe,\n  ThenableReference\n} from './Reference';\n\n/**\n * @internal\n */\nexport class QueryImpl implements Query, QueryContext {\n  /**\n   * @hideconstructor\n   */\n  constructor(\n    readonly _repo: Repo,\n    readonly _path: Path,\n    readonly _queryParams: QueryParams,\n    readonly _orderByCalled: boolean\n  ) {}\n\n  get key(): string | null {\n    if (pathIsEmpty(this._path)) {\n      return null;\n    } else {\n      return pathGetBack(this._path);\n    }\n  }\n\n  get ref(): DatabaseReference {\n    return new ReferenceImpl(this._repo, this._path);\n  }\n\n  get _queryIdentifier(): string {\n    const obj = queryParamsGetQueryObject(this._queryParams);\n    const id = ObjectToUniqueKey(obj);\n    return id === '{}' ? 'default' : id;\n  }\n\n  /**\n   * An object representation of the query parameters used by this Query.\n   */\n  get _queryObject(): object {\n    return queryParamsGetQueryObject(this._queryParams);\n  }\n\n  isEqual(other: QueryImpl | null): boolean {\n    other = getModularInstance(other);\n    if (!(other instanceof QueryImpl)) {\n      return false;\n    }\n\n    const sameRepo = this._repo === other._repo;\n    const samePath = pathEquals(this._path, other._path);\n    const sameQueryIdentifier =\n      this._queryIdentifier === other._queryIdentifier;\n\n    return sameRepo && samePath && sameQueryIdentifier;\n  }\n\n  toJSON(): string {\n    return this.toString();\n  }\n\n  toString(): string {\n    return this._repo.toString() + pathToUrlEncodedString(this._path);\n  }\n}\n\n/**\n * Validates that no other order by call has been made\n */\nfunction validateNoPreviousOrderByCall(query: QueryImpl, fnName: string) {\n  if (query._orderByCalled === true) {\n    throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\n  }\n}\n\n/**\n * Validates start/end values for queries.\n */\nfunction validateQueryEndpoints(params: QueryParams) {\n  let startNode = null;\n  let endNode = null;\n  if (params.hasStart()) {\n    startNode = params.getIndexStartValue();\n  }\n  if (params.hasEnd()) {\n    endNode = params.getIndexEndValue();\n  }\n\n  if (params.getIndex() === KEY_INDEX) {\n    const tooManyArgsError =\n      'Query: When ordering by key, you may only pass one argument to ' +\n      'startAt(), endAt(), or equalTo().';\n    const wrongArgTypeError =\n      'Query: When ordering by key, the argument passed to startAt(), startAfter(), ' +\n      'endAt(), endBefore(), or equalTo() must be a string.';\n    if (params.hasStart()) {\n      const startName = params.getIndexStartName();\n      if (startName !== MIN_NAME) {\n        throw new Error(tooManyArgsError);\n      } else if (typeof startNode !== 'string') {\n        throw new Error(wrongArgTypeError);\n      }\n    }\n    if (params.hasEnd()) {\n      const endName = params.getIndexEndName();\n      if (endName !== MAX_NAME) {\n        throw new Error(tooManyArgsError);\n      } else if (typeof endNode !== 'string') {\n        throw new Error(wrongArgTypeError);\n      }\n    }\n  } else if (params.getIndex() === PRIORITY_INDEX) {\n    if (\n      (startNode != null && !isValidPriority(startNode)) ||\n      (endNode != null && !isValidPriority(endNode))\n    ) {\n      throw new Error(\n        'Query: When ordering by priority, the first argument passed to startAt(), ' +\n          'startAfter() endAt(), endBefore(), or equalTo() must be a valid priority value ' +\n          '(null, a number, or a string).'\n      );\n    }\n  } else {\n    assert(\n      params.getIndex() instanceof PathIndex ||\n        params.getIndex() === VALUE_INDEX,\n      'unknown index type.'\n    );\n    if (\n      (startNode != null && typeof startNode === 'object') ||\n      (endNode != null && typeof endNode === 'object')\n    ) {\n      throw new Error(\n        'Query: First argument passed to startAt(), startAfter(), endAt(), endBefore(), or ' +\n          'equalTo() cannot be an object.'\n      );\n    }\n  }\n}\n\n/**\n * Validates that limit* has been called with the correct combination of parameters\n */\nfunction validateLimit(params: QueryParams) {\n  if (\n    params.hasStart() &&\n    params.hasEnd() &&\n    params.hasLimit() &&\n    !params.hasAnchoredLimit()\n  ) {\n    throw new Error(\n      \"Query: Can't combine startAt(), startAfter(), endAt(), endBefore(), and limit(). Use \" +\n        'limitToFirst() or limitToLast() instead.'\n    );\n  }\n}\n/**\n * @internal\n */\nexport class ReferenceImpl extends QueryImpl implements DatabaseReference {\n  /** @hideconstructor */\n  constructor(repo: Repo, path: Path) {\n    super(repo, path, new QueryParams(), false);\n  }\n\n  get parent(): ReferenceImpl | null {\n    const parentPath = pathParent(this._path);\n    return parentPath === null\n      ? null\n      : new ReferenceImpl(this._repo, parentPath);\n  }\n\n  get root(): ReferenceImpl {\n    let ref: ReferenceImpl = this;\n    while (ref.parent !== null) {\n      ref = ref.parent;\n    }\n    return ref;\n  }\n}\n\n/**\n * A `DataSnapshot` contains data from a Database location.\n *\n * Any time you read data from the Database, you receive the data as a\n * `DataSnapshot`. A `DataSnapshot` is passed to the event callbacks you attach\n * with `on()` or `once()`. You can extract the contents of the snapshot as a\n * JavaScript object by calling the `val()` method. Alternatively, you can\n * traverse into the snapshot by calling `child()` to return child snapshots\n * (which you could then call `val()` on).\n *\n * A `DataSnapshot` is an efficiently generated, immutable copy of the data at\n * a Database location. It cannot be modified and will never change (to modify\n * data, you always call the `set()` method on a `Reference` directly).\n */\nexport class DataSnapshot {\n  /**\n   * @param _node - A SnapshotNode to wrap.\n   * @param ref - The location this snapshot came from.\n   * @param _index - The iteration order for this snapshot\n   * @hideconstructor\n   */\n  constructor(\n    readonly _node: Node,\n    /**\n     * The location of this DataSnapshot.\n     */\n    readonly ref: DatabaseReference,\n    readonly _index: Index\n  ) {}\n\n  /**\n   * Gets the priority value of the data in this `DataSnapshot`.\n   *\n   * Applications need not use priority but can order collections by\n   * ordinary properties (see\n   * {@link https://firebase.google.com/docs/database/web/lists-of-data#sorting_and_filtering_data |Sorting and filtering data}\n   * ).\n   */\n  get priority(): string | number | null {\n    // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\n    return this._node.getPriority().val() as string | number | null;\n  }\n\n  /**\n   * The key (last part of the path) of the location of this `DataSnapshot`.\n   *\n   * The last token in a Database location is considered its key. For example,\n   * \"ada\" is the key for the /users/ada/ node. Accessing the key on any\n   * `DataSnapshot` will return the key for the location that generated it.\n   * However, accessing the key on the root URL of a Database will return\n   * `null`.\n   */\n  get key(): string | null {\n    return this.ref.key;\n  }\n\n  /** Returns the number of child properties of this `DataSnapshot`. */\n  get size(): number {\n    return this._node.numChildren();\n  }\n\n  /**\n   * Gets another `DataSnapshot` for the location at the specified relative path.\n   *\n   * Passing a relative path to the `child()` method of a DataSnapshot returns\n   * another `DataSnapshot` for the location at the specified relative path. The\n   * relative path can either be a simple child name (for example, \"ada\") or a\n   * deeper, slash-separated path (for example, \"ada/name/first\"). If the child\n   * location has no data, an empty `DataSnapshot` (that is, a `DataSnapshot`\n   * whose value is `null`) is returned.\n   *\n   * @param path - A relative path to the location of child data.\n   */\n  child(path: string): DataSnapshot {\n    const childPath = new Path(path);\n    const childRef = child(this.ref, path);\n    return new DataSnapshot(\n      this._node.getChild(childPath),\n      childRef,\n      PRIORITY_INDEX\n    );\n  }\n  /**\n   * Returns true if this `DataSnapshot` contains any data. It is slightly more\n   * efficient than using `snapshot.val() !== null`.\n   */\n  exists(): boolean {\n    return !this._node.isEmpty();\n  }\n\n  /**\n   * Exports the entire contents of the DataSnapshot as a JavaScript object.\n   *\n   * The `exportVal()` method is similar to `val()`, except priority information\n   * is included (if available), making it suitable for backing up your data.\n   *\n   * @returns The DataSnapshot's contents as a JavaScript value (Object,\n   *   Array, string, number, boolean, or `null`).\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  exportVal(): any {\n    return this._node.val(true);\n  }\n\n  /**\n   * Enumerates the top-level children in the `IteratedDataSnapshot`.\n   *\n   * Because of the way JavaScript objects work, the ordering of data in the\n   * JavaScript object returned by `val()` is not guaranteed to match the\n   * ordering on the server nor the ordering of `onChildAdded()` events. That is\n   * where `forEach()` comes in handy. It guarantees the children of a\n   * `DataSnapshot` will be iterated in their query order.\n   *\n   * If no explicit `orderBy*()` method is used, results are returned\n   * ordered by key (unless priorities are used, in which case, results are\n   * returned by priority).\n   *\n   * @param action - A function that will be called for each child DataSnapshot.\n   * The callback can return true to cancel further enumeration.\n   * @returns true if enumeration was canceled due to your callback returning\n   * true.\n   */\n  forEach(action: (child: IteratedDataSnapshot) => boolean | void): boolean {\n    if (this._node.isLeafNode()) {\n      return false;\n    }\n\n    const childrenNode = this._node as ChildrenNode;\n    // Sanitize the return value to a boolean. ChildrenNode.forEachChild has a weird return type...\n    return !!childrenNode.forEachChild(this._index, (key, node) => {\n      return action(\n        new DataSnapshot(node, child(this.ref, key), PRIORITY_INDEX)\n      );\n    });\n  }\n\n  /**\n   * Returns true if the specified child path has (non-null) data.\n   *\n   * @param path - A relative path to the location of a potential child.\n   * @returns `true` if data exists at the specified child path; else\n   *  `false`.\n   */\n  hasChild(path: string): boolean {\n    const childPath = new Path(path);\n    return !this._node.getChild(childPath).isEmpty();\n  }\n\n  /**\n   * Returns whether or not the `DataSnapshot` has any non-`null` child\n   * properties.\n   *\n   * You can use `hasChildren()` to determine if a `DataSnapshot` has any\n   * children. If it does, you can enumerate them using `forEach()`. If it\n   * doesn't, then either this snapshot contains a primitive value (which can be\n   * retrieved with `val()`) or it is empty (in which case, `val()` will return\n   * `null`).\n   *\n   * @returns true if this snapshot has any children; else false.\n   */\n  hasChildren(): boolean {\n    if (this._node.isLeafNode()) {\n      return false;\n    } else {\n      return !this._node.isEmpty();\n    }\n  }\n\n  /**\n   * Returns a JSON-serializable representation of this object.\n   */\n  toJSON(): object | null {\n    return this.exportVal();\n  }\n\n  /**\n   * Extracts a JavaScript value from a `DataSnapshot`.\n   *\n   * Depending on the data in a `DataSnapshot`, the `val()` method may return a\n   * scalar type (string, number, or boolean), an array, or an object. It may\n   * also return null, indicating that the `DataSnapshot` is empty (contains no\n   * data).\n   *\n   * @returns The DataSnapshot's contents as a JavaScript value (Object,\n   *   Array, string, number, boolean, or `null`).\n   */\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  val(): any {\n    return this._node.val();\n  }\n}\n\n/**\n * Represents a child snapshot of a `Reference` that is being iterated over. The key will never be undefined.\n */\nexport interface IteratedDataSnapshot extends DataSnapshot {\n  key: string; // key of the location of this snapshot.\n}\n\n/**\n *\n * Returns a `Reference` representing the location in the Database\n * corresponding to the provided path. If no path is provided, the `Reference`\n * will point to the root of the Database.\n *\n * @param db - The database instance to obtain a reference for.\n * @param path - Optional path representing the location the returned\n *   `Reference` will point. If not provided, the returned `Reference` will\n *   point to the root of the Database.\n * @returns If a path is provided, a `Reference`\n *   pointing to the provided path. Otherwise, a `Reference` pointing to the\n *   root of the Database.\n */\nexport function ref(db: Database, path?: string): DatabaseReference {\n  db = getModularInstance(db);\n  db._checkNotDeleted('ref');\n  return path !== undefined ? child(db._root, path) : db._root;\n}\n\n/**\n * Returns a `Reference` representing the location in the Database\n * corresponding to the provided Firebase URL.\n *\n * An exception is thrown if the URL is not a valid Firebase Database URL or it\n * has a different domain than the current `Database` instance.\n *\n * Note that all query parameters (`orderBy`, `limitToLast`, etc.) are ignored\n * and are not applied to the returned `Reference`.\n *\n * @param db - The database instance to obtain a reference for.\n * @param url - The Firebase URL at which the returned `Reference` will\n *   point.\n * @returns A `Reference` pointing to the provided\n *   Firebase URL.\n */\nexport function refFromURL(db: Database, url: string): DatabaseReference {\n  db = getModularInstance(db);\n  db._checkNotDeleted('refFromURL');\n  const parsedURL = parseRepoInfo(url, db._repo.repoInfo_.nodeAdmin);\n  validateUrl('refFromURL', parsedURL);\n\n  const repoInfo = parsedURL.repoInfo;\n  if (\n    !db._repo.repoInfo_.isCustomHost() &&\n    repoInfo.host !== db._repo.repoInfo_.host\n  ) {\n    fatal(\n      'refFromURL' +\n        ': Host name does not match the current database: ' +\n        '(found ' +\n        repoInfo.host +\n        ' but expected ' +\n        db._repo.repoInfo_.host +\n        ')'\n    );\n  }\n\n  return ref(db, parsedURL.path.toString());\n}\n/**\n * Gets a `Reference` for the location at the specified relative path.\n *\n * The relative path can either be a simple child name (for example, \"ada\") or\n * a deeper slash-separated path (for example, \"ada/name/first\").\n *\n * @param parent - The parent location.\n * @param path - A relative path from this location to the desired child\n *   location.\n * @returns The specified child location.\n */\nexport function child(\n  parent: DatabaseReference,\n  path: string\n): DatabaseReference {\n  parent = getModularInstance(parent);\n  if (pathGetFront(parent._path) === null) {\n    validateRootPathString('child', 'path', path, false);\n  } else {\n    validatePathString('child', 'path', path, false);\n  }\n  return new ReferenceImpl(parent._repo, pathChild(parent._path, path));\n}\n\n/**\n * Returns an `OnDisconnect` object - see\n * {@link https://firebase.google.com/docs/database/web/offline-capabilities | Enabling Offline Capabilities in JavaScript}\n * for more information on how to use it.\n *\n * @param ref - The reference to add OnDisconnect triggers for.\n */\nexport function onDisconnect(ref: DatabaseReference): OnDisconnect {\n  ref = getModularInstance(ref) as ReferenceImpl;\n  return new OnDisconnect(ref._repo, ref._path);\n}\n\nexport interface ThenableReferenceImpl\n  extends ReferenceImpl,\n    Pick<Promise<ReferenceImpl>, 'then' | 'catch'> {}\n\n/**\n * Generates a new child location using a unique key and returns its\n * `Reference`.\n *\n * This is the most common pattern for adding data to a collection of items.\n *\n * If you provide a value to `push()`, the value is written to the\n * generated location. If you don't pass a value, nothing is written to the\n * database and the child remains empty (but you can use the `Reference`\n * elsewhere).\n *\n * The unique keys generated by `push()` are ordered by the current time, so the\n * resulting list of items is chronologically sorted. The keys are also\n * designed to be unguessable (they contain 72 random bits of entropy).\n *\n * See {@link https://firebase.google.com/docs/database/web/lists-of-data#append_to_a_list_of_data | Append to a list of data}.\n * See {@link https://firebase.googleblog.com/2015/02/the-2120-ways-to-ensure-unique_68.html | The 2^120 Ways to Ensure Unique Identifiers}.\n *\n * @param parent - The parent location.\n * @param value - Optional value to be written at the generated location.\n * @returns Combined `Promise` and `Reference`; resolves when write is complete,\n * but can be used immediately as the `Reference` to the child location.\n */\nexport function push(\n  parent: DatabaseReference,\n  value?: unknown\n): ThenableReference {\n  parent = getModularInstance(parent);\n  validateWritablePath('push', parent._path);\n  validateFirebaseDataArg('push', value, parent._path, true);\n  const now = repoServerTime(parent._repo);\n  const name = nextPushId(now);\n\n  // push() returns a ThennableReference whose promise is fulfilled with a\n  // regular Reference. We use child() to create handles to two different\n  // references. The first is turned into a ThennableReference below by adding\n  // then() and catch() methods and is used as the return value of push(). The\n  // second remains a regular Reference and is used as the fulfilled value of\n  // the first ThennableReference.\n  const thennablePushRef: Partial<ThenableReferenceImpl> = child(\n    parent,\n    name\n  ) as ReferenceImpl;\n  const pushRef = child(parent, name) as ReferenceImpl;\n\n  let promise: Promise<ReferenceImpl>;\n  if (value != null) {\n    promise = set(pushRef, value).then(() => pushRef);\n  } else {\n    promise = Promise.resolve(pushRef);\n  }\n\n  thennablePushRef.then = promise.then.bind(promise);\n  thennablePushRef.catch = promise.then.bind(promise, undefined);\n  return thennablePushRef as ThenableReferenceImpl;\n}\n\n/**\n * Removes the data at this Database location.\n *\n * Any data at child locations will also be deleted.\n *\n * The effect of the remove will be visible immediately and the corresponding\n * event 'value' will be triggered. Synchronization of the remove to the\n * Firebase servers will also be started, and the returned Promise will resolve\n * when complete. If provided, the onComplete callback will be called\n * asynchronously after synchronization has finished.\n *\n * @param ref - The location to remove.\n * @returns Resolves when remove on server is complete.\n */\nexport function remove(ref: DatabaseReference): Promise<void> {\n  validateWritablePath('remove', ref._path);\n  return set(ref, null);\n}\n\n/**\n * Writes data to this Database location.\n *\n * This will overwrite any data at this location and all child locations.\n *\n * The effect of the write will be visible immediately, and the corresponding\n * events (\"value\", \"child_added\", etc.) will be triggered. Synchronization of\n * the data to the Firebase servers will also be started, and the returned\n * Promise will resolve when complete. If provided, the `onComplete` callback\n * will be called asynchronously after synchronization has finished.\n *\n * Passing `null` for the new value is equivalent to calling `remove()`; namely,\n * all data at this location and all child locations will be deleted.\n *\n * `set()` will remove any priority stored at this location, so if priority is\n * meant to be preserved, you need to use `setWithPriority()` instead.\n *\n * Note that modifying data with `set()` will cancel any pending transactions\n * at that location, so extreme care should be taken if mixing `set()` and\n * `transaction()` to modify the same data.\n *\n * A single `set()` will generate a single \"value\" event at the location where\n * the `set()` was performed.\n *\n * @param ref - The location to write to.\n * @param value - The value to be written (string, number, boolean, object,\n *   array, or null).\n * @returns Resolves when write to server is complete.\n */\nexport function set(ref: DatabaseReference, value: unknown): Promise<void> {\n  ref = getModularInstance(ref);\n  validateWritablePath('set', ref._path);\n  validateFirebaseDataArg('set', value, ref._path, false);\n  const deferred = new Deferred<void>();\n  repoSetWithPriority(\n    ref._repo,\n    ref._path,\n    value,\n    /*priority=*/ null,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Sets a priority for the data at this Database location.\n *\n * Applications need not use priority but can order collections by\n * ordinary properties (see\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sorting_and_filtering_data | Sorting and filtering data}\n * ).\n *\n * @param ref - The location to write to.\n * @param priority - The priority to be written (string, number, or null).\n * @returns Resolves when write to server is complete.\n */\nexport function setPriority(\n  ref: DatabaseReference,\n  priority: string | number | null\n): Promise<void> {\n  ref = getModularInstance(ref);\n  validateWritablePath('setPriority', ref._path);\n  validatePriority('setPriority', priority, false);\n  const deferred = new Deferred<void>();\n  repoSetWithPriority(\n    ref._repo,\n    pathChild(ref._path, '.priority'),\n    priority,\n    null,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Writes data the Database location. Like `set()` but also specifies the\n * priority for that data.\n *\n * Applications need not use priority but can order collections by\n * ordinary properties (see\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sorting_and_filtering_data | Sorting and filtering data}\n * ).\n *\n * @param ref - The location to write to.\n * @param value - The value to be written (string, number, boolean, object,\n *   array, or null).\n * @param priority - The priority to be written (string, number, or null).\n * @returns Resolves when write to server is complete.\n */\nexport function setWithPriority(\n  ref: DatabaseReference,\n  value: unknown,\n  priority: string | number | null\n): Promise<void> {\n  validateWritablePath('setWithPriority', ref._path);\n  validateFirebaseDataArg('setWithPriority', value, ref._path, false);\n  validatePriority('setWithPriority', priority, false);\n  if (ref.key === '.length' || ref.key === '.keys') {\n    throw 'setWithPriority failed: ' + ref.key + ' is a read-only object.';\n  }\n\n  const deferred = new Deferred<void>();\n  repoSetWithPriority(\n    ref._repo,\n    ref._path,\n    value,\n    priority,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Writes multiple values to the Database at once.\n *\n * The `values` argument contains multiple property-value pairs that will be\n * written to the Database together. Each child property can either be a simple\n * property (for example, \"name\") or a relative path (for example,\n * \"name/first\") from the current location to the data to update.\n *\n * As opposed to the `set()` method, `update()` can be use to selectively update\n * only the referenced properties at the current location (instead of replacing\n * all the child properties at the current location).\n *\n * The effect of the write will be visible immediately, and the corresponding\n * events ('value', 'child_added', etc.) will be triggered. Synchronization of\n * the data to the Firebase servers will also be started, and the returned\n * Promise will resolve when complete. If provided, the `onComplete` callback\n * will be called asynchronously after synchronization has finished.\n *\n * A single `update()` will generate a single \"value\" event at the location\n * where the `update()` was performed, regardless of how many children were\n * modified.\n *\n * Note that modifying data with `update()` will cancel any pending\n * transactions at that location, so extreme care should be taken if mixing\n * `update()` and `transaction()` to modify the same data.\n *\n * Passing `null` to `update()` will remove the data at this location.\n *\n * See\n * {@link https://firebase.googleblog.com/2015/09/introducing-multi-location-updates-and_86.html | Introducing multi-location updates and more}.\n *\n * @param ref - The location to write to.\n * @param values - Object containing multiple values.\n * @returns Resolves when update on server is complete.\n */\nexport function update(ref: DatabaseReference, values: object): Promise<void> {\n  validateFirebaseMergeDataArg('update', values, ref._path, false);\n  const deferred = new Deferred<void>();\n  repoUpdate(\n    ref._repo,\n    ref._path,\n    values as Record<string, unknown>,\n    deferred.wrapCallback(() => {})\n  );\n  return deferred.promise;\n}\n\n/**\n * Gets the most up-to-date result for this query.\n *\n * @param query - The query to run.\n * @returns A `Promise` which resolves to the resulting DataSnapshot if a value is\n * available, or rejects if the client is unable to return a value (e.g., if the\n * server is unreachable and there is nothing cached).\n */\nexport function get(query: Query): Promise<DataSnapshot> {\n  query = getModularInstance(query) as QueryImpl;\n  const callbackContext = new CallbackContext(() => {});\n  const container = new ValueEventRegistration(callbackContext);\n  return repoGetValue(query._repo, query, container).then(node => {\n    return new DataSnapshot(\n      node,\n      new ReferenceImpl(query._repo, query._path),\n      query._queryParams.getIndex()\n    );\n  });\n}\n/**\n * Represents registration for 'value' events.\n */\nexport class ValueEventRegistration implements EventRegistration {\n  constructor(private callbackContext: CallbackContext) {}\n\n  respondsTo(eventType: string): boolean {\n    return eventType === 'value';\n  }\n\n  createEvent(change: Change, query: QueryContext): DataEvent {\n    const index = query._queryParams.getIndex();\n    return new DataEvent(\n      'value',\n      this,\n      new DataSnapshot(\n        change.snapshotNode,\n        new ReferenceImpl(query._repo, query._path),\n        index\n      )\n    );\n  }\n\n  getEventRunner(eventData: CancelEvent | DataEvent): () => void {\n    if (eventData.getEventType() === 'cancel') {\n      return () =>\n        this.callbackContext.onCancel((eventData as CancelEvent).error);\n    } else {\n      return () =>\n        this.callbackContext.onValue((eventData as DataEvent).snapshot, null);\n    }\n  }\n\n  createCancelEvent(error: Error, path: Path): CancelEvent | null {\n    if (this.callbackContext.hasCancelCallback) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n\n  matches(other: EventRegistration): boolean {\n    if (!(other instanceof ValueEventRegistration)) {\n      return false;\n    } else if (!other.callbackContext || !this.callbackContext) {\n      // If no callback specified, we consider it to match any callback.\n      return true;\n    } else {\n      return other.callbackContext.matches(this.callbackContext);\n    }\n  }\n\n  hasAnyCallback(): boolean {\n    return this.callbackContext !== null;\n  }\n}\n\n/**\n * Represents the registration of a child_x event.\n */\nexport class ChildEventRegistration implements EventRegistration {\n  constructor(\n    private eventType: string,\n    private callbackContext: CallbackContext | null\n  ) {}\n\n  respondsTo(eventType: string): boolean {\n    let eventToCheck =\n      eventType === 'children_added' ? 'child_added' : eventType;\n    eventToCheck =\n      eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\n    return this.eventType === eventToCheck;\n  }\n\n  createCancelEvent(error: Error, path: Path): CancelEvent | null {\n    if (this.callbackContext.hasCancelCallback) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n\n  createEvent(change: Change, query: QueryContext): DataEvent {\n    assert(change.childName != null, 'Child events should have a childName.');\n    const childRef = child(\n      new ReferenceImpl(query._repo, query._path),\n      change.childName\n    );\n    const index = query._queryParams.getIndex();\n    return new DataEvent(\n      change.type as EventType,\n      this,\n      new DataSnapshot(change.snapshotNode, childRef, index),\n      change.prevName\n    );\n  }\n\n  getEventRunner(eventData: CancelEvent | DataEvent): () => void {\n    if (eventData.getEventType() === 'cancel') {\n      return () =>\n        this.callbackContext.onCancel((eventData as CancelEvent).error);\n    } else {\n      return () =>\n        this.callbackContext.onValue(\n          (eventData as DataEvent).snapshot,\n          (eventData as DataEvent).prevName\n        );\n    }\n  }\n\n  matches(other: EventRegistration): boolean {\n    if (other instanceof ChildEventRegistration) {\n      return (\n        this.eventType === other.eventType &&\n        (!this.callbackContext ||\n          !other.callbackContext ||\n          this.callbackContext.matches(other.callbackContext))\n      );\n    }\n\n    return false;\n  }\n\n  hasAnyCallback(): boolean {\n    return !!this.callbackContext;\n  }\n}\n\nfunction addEventListener(\n  query: Query,\n  eventType: EventType,\n  callback: UserCallback,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n) {\n  let cancelCallback: ((error: Error) => unknown) | undefined;\n  if (typeof cancelCallbackOrListenOptions === 'object') {\n    cancelCallback = undefined;\n    options = cancelCallbackOrListenOptions;\n  }\n  if (typeof cancelCallbackOrListenOptions === 'function') {\n    cancelCallback = cancelCallbackOrListenOptions;\n  }\n\n  if (options && options.onlyOnce) {\n    const userCallback = callback;\n    const onceCallback: UserCallback = (dataSnapshot, previousChildName) => {\n      repoRemoveEventCallbackForQuery(query._repo, query, container);\n      userCallback(dataSnapshot, previousChildName);\n    };\n    onceCallback.userCallback = callback.userCallback;\n    onceCallback.context = callback.context;\n    callback = onceCallback;\n  }\n\n  const callbackContext = new CallbackContext(\n    callback,\n    cancelCallback || undefined\n  );\n  const container =\n    eventType === 'value'\n      ? new ValueEventRegistration(callbackContext)\n      : new ChildEventRegistration(eventType, callbackContext);\n  repoAddEventCallbackForQuery(query._repo, query, container);\n  return () => repoRemoveEventCallbackForQuery(query._repo, query, container);\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onValue` event will trigger once with the initial data stored at this\n * location, and then trigger again each time the data changes. The\n * `DataSnapshot` passed to the callback will be for the location at which\n * `on()` was called. It won't trigger until the entire contents has been\n * synchronized. If the location has no data, it will be triggered with an empty\n * `DataSnapshot` (`val()` will return `null`).\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs. The\n * callback will be passed a DataSnapshot.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onValue` event will trigger once with the initial data stored at this\n * location, and then trigger again each time the data changes. The\n * `DataSnapshot` passed to the callback will be for the location at which\n * `on()` was called. It won't trigger until the entire contents has been\n * synchronized. If the location has no data, it will be triggered with an empty\n * `DataSnapshot` (`val()` will return `null`).\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs. The\n * callback will be passed a DataSnapshot.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onValue` event will trigger once with the initial data stored at this\n * location, and then trigger again each time the data changes. The\n * `DataSnapshot` passed to the callback will be for the location at which\n * `on()` was called. It won't trigger until the entire contents has been\n * synchronized. If the location has no data, it will be triggered with an empty\n * `DataSnapshot` (`val()` will return `null`).\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs. The\n * callback will be passed a DataSnapshot.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onValue(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'value',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildAdded` event will be triggered once for each initial child at this\n * location, and it will be triggered again every time a new child is added. The\n * `DataSnapshot` passed into the callback will reflect the data for the\n * relevant child. For ordering purposes, it is passed a second argument which\n * is a string containing the key of the previous sibling child by sort order,\n * or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName?: string | null\n  ) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildAdded` event will be triggered once for each initial child at this\n * location, and it will be triggered again every time a new child is added. The\n * `DataSnapshot` passed into the callback will reflect the data for the\n * relevant child. For ordering purposes, it is passed a second argument which\n * is a string containing the key of the previous sibling child by sort order,\n * or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildAdded` event will be triggered once for each initial child at this\n * location, and it will be triggered again every time a new child is added. The\n * `DataSnapshot` passed into the callback will reflect the data for the\n * relevant child. For ordering purposes, it is passed a second argument which\n * is a string containing the key of the previous sibling child by sort order,\n * or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildAdded(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_added',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildChanged` event will be triggered when the data stored in a child\n * (or any of its descendants) changes. Note that a single `child_changed` event\n * may represent multiple changes to the child. The `DataSnapshot` passed to the\n * callback will contain the new child contents. For ordering purposes, the\n * callback is also passed a second argument which is a string containing the\n * key of the previous sibling child by sort order, or `null` if it is the first\n * child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildChanged` event will be triggered when the data stored in a child\n * (or any of its descendants) changes. Note that a single `child_changed` event\n * may represent multiple changes to the child. The `DataSnapshot` passed to the\n * callback will contain the new child contents. For ordering purposes, the\n * callback is also passed a second argument which is a string containing the\n * key of the previous sibling child by sort order, or `null` if it is the first\n * child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildChanged` event will be triggered when the data stored in a child\n * (or any of its descendants) changes. Note that a single `child_changed` event\n * may represent multiple changes to the child. The `DataSnapshot` passed to the\n * callback will contain the new child contents. For ordering purposes, the\n * callback is also passed a second argument which is a string containing the\n * key of the previous sibling child by sort order, or `null` if it is the first\n * child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildChanged(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_changed',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildMoved` event will be triggered when a child's sort order changes\n * such that its position relative to its siblings changes. The `DataSnapshot`\n * passed to the callback will be for the data of the child that has moved. It\n * is also passed a second argument which is a string containing the key of the\n * previous sibling child by sort order, or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildMoved` event will be triggered when a child's sort order changes\n * such that its position relative to its siblings changes. The `DataSnapshot`\n * passed to the callback will be for the data of the child that has moved. It\n * is also passed a second argument which is a string containing the key of the\n * previous sibling child by sort order, or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildMoved` event will be triggered when a child's sort order changes\n * such that its position relative to its siblings changes. The `DataSnapshot`\n * passed to the callback will be for the data of the child that has moved. It\n * is also passed a second argument which is a string containing the key of the\n * previous sibling child by sort order, or `null` if it is the first child.\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildMoved(\n  query: Query,\n  callback: (\n    snapshot: DataSnapshot,\n    previousChildName: string | null\n  ) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_moved',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildRemoved` event will be triggered once every time a child is\n * removed. The `DataSnapshot` passed into the callback will be the old data for\n * the child that was removed. A child will get removed when either:\n *\n * - a client explicitly calls `remove()` on that child or one of its ancestors\n * - a client calls `set(null)` on that child or one of its ancestors\n * - that child has all of its children removed\n * - there is a query in effect which now filters out the child (because it's\n *   sort order changed or the max limit was hit)\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback?: (error: Error) => unknown\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildRemoved` event will be triggered once every time a child is\n * removed. The `DataSnapshot` passed into the callback will be the old data for\n * the child that was removed. A child will get removed when either:\n *\n * - a client explicitly calls `remove()` on that child or one of its ancestors\n * - a client calls `set(null)` on that child or one of its ancestors\n * - that child has all of its children removed\n * - there is a query in effect which now filters out the child (because it's\n *   sort order changed or the max limit was hit)\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\n/**\n * Listens for data changes at a particular location.\n *\n * This is the primary way to read data from a Database. Your callback\n * will be triggered for the initial data and again whenever the data changes.\n * Invoke the returned unsubscribe callback to stop receiving updates. See\n * {@link https://firebase.google.com/docs/database/web/retrieve-data | Retrieve Data on the Web}\n * for more details.\n *\n * An `onChildRemoved` event will be triggered once every time a child is\n * removed. The `DataSnapshot` passed into the callback will be the old data for\n * the child that was removed. A child will get removed when either:\n *\n * - a client explicitly calls `remove()` on that child or one of its ancestors\n * - a client calls `set(null)` on that child or one of its ancestors\n * - that child has all of its children removed\n * - there is a query in effect which now filters out the child (because it's\n *   sort order changed or the max limit was hit)\n *\n * @param query - The query to run.\n * @param callback - A callback that fires when the specified event occurs.\n * The callback will be passed a DataSnapshot and a string containing the key of\n * the previous child, by sort order, or `null` if it is the first child.\n * @param cancelCallback - An optional callback that will be notified if your\n * event subscription is ever canceled because your client does not have\n * permission to read this data (or it had permission but has now lost it).\n * This callback will be passed an `Error` object indicating why the failure\n * occurred.\n * @param options - An object that can be used to configure `onlyOnce`, which\n * then removes the listener after its first invocation.\n * @returns A function that can be invoked to remove the listener.\n */\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallback: (error: Error) => unknown,\n  options: ListenOptions\n): Unsubscribe;\n\nexport function onChildRemoved(\n  query: Query,\n  callback: (snapshot: DataSnapshot) => unknown,\n  cancelCallbackOrListenOptions?: ((error: Error) => unknown) | ListenOptions,\n  options?: ListenOptions\n): Unsubscribe {\n  return addEventListener(\n    query,\n    'child_removed',\n    callback,\n    cancelCallbackOrListenOptions,\n    options\n  );\n}\n\nexport { EventType };\n\n/**\n * Detaches a callback previously attached with the corresponding `on*()` (`onValue`, `onChildAdded`) listener.\n * Note: This is not the recommended way to remove a listener. Instead, please use the returned callback function from\n * the respective `on*` callbacks.\n *\n * Detach a callback previously attached with `on*()`. Calling `off()` on a parent listener\n * will not automatically remove listeners registered on child nodes, `off()`\n * must also be called on any child listeners to remove the callback.\n *\n * If a callback is not specified, all callbacks for the specified eventType\n * will be removed. Similarly, if no eventType is specified, all callbacks\n * for the `Reference` will be removed.\n *\n * Individual listeners can also be removed by invoking their unsubscribe\n * callbacks.\n *\n * @param query - The query that the listener was registered with.\n * @param eventType - One of the following strings: \"value\", \"child_added\",\n * \"child_changed\", \"child_removed\", or \"child_moved.\" If omitted, all callbacks\n * for the `Reference` will be removed.\n * @param callback - The callback function that was passed to `on()` or\n * `undefined` to remove all callbacks.\n */\nexport function off(\n  query: Query,\n  eventType?: EventType,\n  callback?: (\n    snapshot: DataSnapshot,\n    previousChildName?: string | null\n  ) => unknown\n): void {\n  let container: EventRegistration | null = null;\n  const expCallback = callback ? new CallbackContext(callback) : null;\n  if (eventType === 'value') {\n    container = new ValueEventRegistration(expCallback);\n  } else if (eventType) {\n    container = new ChildEventRegistration(eventType, expCallback);\n  }\n  repoRemoveEventCallbackForQuery(query._repo, query, container);\n}\n\n/** Describes the different query constraints available in this SDK. */\nexport type QueryConstraintType =\n  | 'endAt'\n  | 'endBefore'\n  | 'startAt'\n  | 'startAfter'\n  | 'limitToFirst'\n  | 'limitToLast'\n  | 'orderByChild'\n  | 'orderByKey'\n  | 'orderByPriority'\n  | 'orderByValue'\n  | 'equalTo';\n\n/**\n * A `QueryConstraint` is used to narrow the set of documents returned by a\n * Database query. `QueryConstraint`s are created by invoking {@link endAt},\n * {@link endBefore}, {@link startAt}, {@link startAfter}, {@link\n * limitToFirst}, {@link limitToLast}, {@link orderByChild},\n * {@link orderByChild}, {@link orderByKey} , {@link orderByPriority} ,\n * {@link orderByValue}  or {@link equalTo} and\n * can then be passed to {@link query} to create a new query instance that\n * also contains this `QueryConstraint`.\n */\nexport abstract class QueryConstraint {\n  /** The type of this query constraints */\n  abstract readonly type: QueryConstraintType;\n\n  /**\n   * Takes the provided `Query` and returns a copy of the `Query` with this\n   * `QueryConstraint` applied.\n   */\n  abstract _apply<T>(query: QueryImpl): QueryImpl;\n}\n\nclass QueryEndAtConstraint extends QueryConstraint {\n  readonly type: 'endAt';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('endAt', this._value, query._path, true);\n    const newParams = queryParamsEndAt(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasEnd()) {\n      throw new Error(\n        'endAt: Starting point was already set (by another call to endAt, ' +\n          'endBefore or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified ending point.\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The ending point is inclusive, so children with exactly the specified value\n * will be included in the query. The optional key argument can be used to\n * further limit the range of the query. If it is specified, then children that\n * have exactly the specified value must also have a key name less than or equal\n * to the specified key.\n *\n * You can read more about `endAt()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param value - The value to end at. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to end at, among the children with the previously\n * specified priority. This argument is only allowed if ordering by child,\n * value, or priority.\n */\nexport function endAt(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('endAt', 'key', key, true);\n  return new QueryEndAtConstraint(value, key);\n}\n\nclass QueryEndBeforeConstraint extends QueryConstraint {\n  readonly type: 'endBefore';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('endBefore', this._value, query._path, false);\n    const newParams = queryParamsEndBefore(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasEnd()) {\n      throw new Error(\n        'endBefore: Starting point was already set (by another call to endAt, ' +\n          'endBefore or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified ending point (exclusive).\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The ending point is exclusive. If only a value is provided, children\n * with a value less than the specified value will be included in the query.\n * If a key is specified, then children must have a value less than or equal\n * to the specified value and a key name less than the specified key.\n *\n * @param value - The value to end before. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to end before, among the children with the\n * previously specified priority. This argument is only allowed if ordering by\n * child, value, or priority.\n */\nexport function endBefore(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('endBefore', 'key', key, true);\n  return new QueryEndBeforeConstraint(value, key);\n}\n\nclass QueryStartAtConstraint extends QueryConstraint {\n  readonly type: 'startAt';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('startAt', this._value, query._path, true);\n    const newParams = queryParamsStartAt(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasStart()) {\n      throw new Error(\n        'startAt: Starting point was already set (by another call to startAt, ' +\n          'startBefore or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified starting point.\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The starting point is inclusive, so children with exactly the specified value\n * will be included in the query. The optional key argument can be used to\n * further limit the range of the query. If it is specified, then children that\n * have exactly the specified value must also have a key name greater than or\n * equal to the specified key.\n *\n * You can read more about `startAt()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param value - The value to start at. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to start at. This argument is only allowed if\n * ordering by child, value, or priority.\n */\nexport function startAt(\n  value: number | string | boolean | null = null,\n  key?: string\n): QueryConstraint {\n  validateKey('startAt', 'key', key, true);\n  return new QueryStartAtConstraint(value, key);\n}\n\nclass QueryStartAfterConstraint extends QueryConstraint {\n  readonly type: 'startAfter';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('startAfter', this._value, query._path, false);\n    const newParams = queryParamsStartAfter(\n      query._queryParams,\n      this._value,\n      this._key\n    );\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasStart()) {\n      throw new Error(\n        'startAfter: Starting point was already set (by another call to startAt, ' +\n          'startAfter, or equalTo).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` with the specified starting point (exclusive).\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The starting point is exclusive. If only a value is provided, children\n * with a value greater than the specified value will be included in the query.\n * If a key is specified, then children must have a value greater than or equal\n * to the specified value and a a key name greater than the specified key.\n *\n * @param value - The value to start after. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to start after. This argument is only allowed if\n * ordering by child, value, or priority.\n */\nexport function startAfter(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('startAfter', 'key', key, true);\n  return new QueryStartAfterConstraint(value, key);\n}\n\nclass QueryLimitToFirstConstraint extends QueryConstraint {\n  readonly type: 'limitToFirst';\n\n  constructor(private readonly _limit: number) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    if (query._queryParams.hasLimit()) {\n      throw new Error(\n        'limitToFirst: Limit was already set (by another call to limitToFirst ' +\n          'or limitToLast).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      queryParamsLimitToFirst(query._queryParams, this._limit),\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that if limited to the first specific number\n * of children.\n *\n * The `limitToFirst()` method is used to set a maximum number of children to be\n * synced for a given callback. If we set a limit of 100, we will initially only\n * receive up to 100 `child_added` events. If we have fewer than 100 messages\n * stored in our Database, a `child_added` event will fire for each message.\n * However, if we have over 100 messages, we will only receive a `child_added`\n * event for the first 100 ordered messages. As items change, we will receive\n * `child_removed` events for each item that drops out of the active list so\n * that the total number stays at 100.\n *\n * You can read more about `limitToFirst()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param limit - The maximum number of nodes to include in this query.\n */\nexport function limitToFirst(limit: number): QueryConstraint {\n  if (typeof limit !== 'number' || Math.floor(limit) !== limit || limit <= 0) {\n    throw new Error('limitToFirst: First argument must be a positive integer.');\n  }\n  return new QueryLimitToFirstConstraint(limit);\n}\n\nclass QueryLimitToLastConstraint extends QueryConstraint {\n  readonly type: 'limitToLast';\n\n  constructor(private readonly _limit: number) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    if (query._queryParams.hasLimit()) {\n      throw new Error(\n        'limitToLast: Limit was already set (by another call to limitToFirst ' +\n          'or limitToLast).'\n      );\n    }\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      queryParamsLimitToLast(query._queryParams, this._limit),\n      query._orderByCalled\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that is limited to return only the last\n * specified number of children.\n *\n * The `limitToLast()` method is used to set a maximum number of children to be\n * synced for a given callback. If we set a limit of 100, we will initially only\n * receive up to 100 `child_added` events. If we have fewer than 100 messages\n * stored in our Database, a `child_added` event will fire for each message.\n * However, if we have over 100 messages, we will only receive a `child_added`\n * event for the last 100 ordered messages. As items change, we will receive\n * `child_removed` events for each item that drops out of the active list so\n * that the total number stays at 100.\n *\n * You can read more about `limitToLast()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param limit - The maximum number of nodes to include in this query.\n */\nexport function limitToLast(limit: number): QueryConstraint {\n  if (typeof limit !== 'number' || Math.floor(limit) !== limit || limit <= 0) {\n    throw new Error('limitToLast: First argument must be a positive integer.');\n  }\n\n  return new QueryLimitToLastConstraint(limit);\n}\n\nclass QueryOrderByChildConstraint extends QueryConstraint {\n  readonly type: 'orderByChild';\n\n  constructor(private readonly _path: string) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByChild');\n    const parsedPath = new Path(this._path);\n    if (pathIsEmpty(parsedPath)) {\n      throw new Error(\n        'orderByChild: cannot pass in empty path. Use orderByValue() instead.'\n      );\n    }\n    const index = new PathIndex(parsedPath);\n    const newParams = queryParamsOrderBy(query._queryParams, index);\n    validateQueryEndpoints(newParams);\n\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by the specified child key.\n *\n * Queries can only order by one key at a time. Calling `orderByChild()`\n * multiple times on the same query is an error.\n *\n * Firebase queries allow you to order your data by any child key on the fly.\n * However, if you know in advance what your indexes will be, you can define\n * them via the .indexOn rule in your Security Rules for better performance. See\n * the{@link https://firebase.google.com/docs/database/security/indexing-data}\n * rule for more information.\n *\n * You can read more about `orderByChild()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}.\n *\n * @param path - The path to order by.\n */\nexport function orderByChild(path: string): QueryConstraint {\n  if (path === '$key') {\n    throw new Error(\n      'orderByChild: \"$key\" is invalid.  Use orderByKey() instead.'\n    );\n  } else if (path === '$priority') {\n    throw new Error(\n      'orderByChild: \"$priority\" is invalid.  Use orderByPriority() instead.'\n    );\n  } else if (path === '$value') {\n    throw new Error(\n      'orderByChild: \"$value\" is invalid.  Use orderByValue() instead.'\n    );\n  }\n  validatePathString('orderByChild', 'path', path, false);\n  return new QueryOrderByChildConstraint(path);\n}\n\nclass QueryOrderByKeyConstraint extends QueryConstraint {\n  readonly type: 'orderByKey';\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByKey');\n    const newParams = queryParamsOrderBy(query._queryParams, KEY_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by the key.\n *\n * Sorts the results of a query by their (ascending) key values.\n *\n * You can read more about `orderByKey()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}.\n */\nexport function orderByKey(): QueryConstraint {\n  return new QueryOrderByKeyConstraint();\n}\n\nclass QueryOrderByPriorityConstraint extends QueryConstraint {\n  readonly type: 'orderByPriority';\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByPriority');\n    const newParams = queryParamsOrderBy(query._queryParams, PRIORITY_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by priority.\n *\n * Applications need not use priority but can order collections by\n * ordinary properties (see\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}\n * for alternatives to priority.\n */\nexport function orderByPriority(): QueryConstraint {\n  return new QueryOrderByPriorityConstraint();\n}\n\nclass QueryOrderByValueConstraint extends QueryConstraint {\n  readonly type: 'orderByValue';\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateNoPreviousOrderByCall(query, 'orderByValue');\n    const newParams = queryParamsOrderBy(query._queryParams, VALUE_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(\n      query._repo,\n      query._path,\n      newParams,\n      /*orderByCalled=*/ true\n    );\n  }\n}\n\n/**\n * Creates a new `QueryConstraint` that orders by value.\n *\n * If the children of a query are all scalar values (string, number, or\n * boolean), you can order the results by their (ascending) values.\n *\n * You can read more about `orderByValue()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#sort_data | Sort data}.\n */\nexport function orderByValue(): QueryConstraint {\n  return new QueryOrderByValueConstraint();\n}\n\nclass QueryEqualToValueConstraint extends QueryConstraint {\n  readonly type: 'equalTo';\n\n  constructor(\n    private readonly _value: number | string | boolean | null,\n    private readonly _key?: string\n  ) {\n    super();\n  }\n\n  _apply<T>(query: QueryImpl): QueryImpl {\n    validateFirebaseDataArg('equalTo', this._value, query._path, false);\n    if (query._queryParams.hasStart()) {\n      throw new Error(\n        'equalTo: Starting point was already set (by another call to startAt/startAfter or ' +\n          'equalTo).'\n      );\n    }\n    if (query._queryParams.hasEnd()) {\n      throw new Error(\n        'equalTo: Ending point was already set (by another call to endAt/endBefore or ' +\n          'equalTo).'\n      );\n    }\n    return new QueryEndAtConstraint(this._value, this._key)._apply(\n      new QueryStartAtConstraint(this._value, this._key)._apply(query)\n    );\n  }\n}\n\n/**\n * Creates a `QueryConstraint` that includes children that match the specified\n * value.\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The optional key argument can be used to further limit the range of the\n * query. If it is specified, then children that have exactly the specified\n * value must also have exactly the specified key as their key name. This can be\n * used to filter result sets with many matches for the same value.\n *\n * You can read more about `equalTo()` in\n * {@link https://firebase.google.com/docs/database/web/lists-of-data#filtering_data | Filtering data}.\n *\n * @param value - The value to match for. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to start at, among the children with the\n * previously specified priority. This argument is only allowed if ordering by\n * child, value, or priority.\n */\nexport function equalTo(\n  value: number | string | boolean | null,\n  key?: string\n): QueryConstraint {\n  validateKey('equalTo', 'key', key, true);\n  return new QueryEqualToValueConstraint(value, key);\n}\n\n/**\n * Creates a new immutable instance of `Query` that is extended to also include\n * additional query constraints.\n *\n * @param query - The Query instance to use as a base for the new constraints.\n * @param queryConstraints - The list of `QueryConstraint`s to apply.\n * @throws if any of the provided query constraints cannot be combined with the\n * existing or new constraints.\n */\nexport function query(\n  query: Query,\n  ...queryConstraints: QueryConstraint[]\n): Query {\n  let queryImpl = getModularInstance(query) as QueryImpl;\n  for (const constraint of queryConstraints) {\n    queryImpl = constraint._apply(queryImpl);\n  }\n  return queryImpl;\n}\n\n/**\n * Define reference constructor in various modules\n *\n * We are doing this here to avoid several circular\n * dependency issues\n */\nsyncPointSetReferenceConstructor(ReferenceImpl);\nsyncTreeSetReferenceConstructor(ReferenceImpl);\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// eslint-disable-next-line import/no-extraneous-dependencies\nimport {\n  _FirebaseService,\n  _getProvider,\n  FirebaseApp,\n  getApp\n} from '@firebase/app';\nimport { AppCheckInternalComponentName } from '@firebase/app-check-interop-types';\nimport { FirebaseAuthInternalName } from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\nimport {\n  getModularInstance,\n  createMockUserToken,\n  EmulatorMockTokenOptions,\n  getDefaultEmulatorHostnameAndPort\n} from '@firebase/util';\n\nimport { AppCheckTokenProvider } from '../core/AppCheckTokenProvider';\nimport {\n  AuthTokenProvider,\n  EmulatorTokenProvider,\n  FirebaseAuthTokenProvider\n} from '../core/AuthTokenProvider';\nimport { Repo, repoInterrupt, repoResume, repoStart } from '../core/Repo';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { parseRepoInfo } from '../core/util/libs/parser';\nimport { newEmptyPath, pathIsEmpty } from '../core/util/Path';\nimport {\n  warn,\n  fatal,\n  log,\n  enableLogging as enableLoggingImpl\n} from '../core/util/util';\nimport { validateUrl } from '../core/util/validation';\nimport { BrowserPollConnection } from '../realtime/BrowserPollConnection';\nimport { TransportManager } from '../realtime/TransportManager';\nimport { WebSocketConnection } from '../realtime/WebSocketConnection';\n\nimport { ReferenceImpl } from './Reference_impl';\n\nexport { EmulatorMockTokenOptions } from '@firebase/util';\n/**\n * This variable is also defined in the firebase Node.js Admin SDK. Before\n * modifying this definition, consult the definition in:\n *\n * https://github.com/firebase/firebase-admin-node\n *\n * and make sure the two are consistent.\n */\nconst FIREBASE_DATABASE_EMULATOR_HOST_VAR = 'FIREBASE_DATABASE_EMULATOR_HOST';\n\n/**\n * Creates and caches `Repo` instances.\n */\nconst repos: {\n  [appName: string]: {\n    [dbUrl: string]: Repo;\n  };\n} = {};\n\n/**\n * If true, any new `Repo` will be created to use `ReadonlyRestClient` (for testing purposes).\n */\nlet useRestClient = false;\n\n/**\n * Update an existing `Repo` in place to point to a new host/port.\n */\nfunction repoManagerApplyEmulatorSettings(\n  repo: Repo,\n  host: string,\n  port: number,\n  tokenProvider?: AuthTokenProvider\n): void {\n  repo.repoInfo_ = new RepoInfo(\n    `${host}:${port}`,\n    /* secure= */ false,\n    repo.repoInfo_.namespace,\n    repo.repoInfo_.webSocketOnly,\n    repo.repoInfo_.nodeAdmin,\n    repo.repoInfo_.persistenceKey,\n    repo.repoInfo_.includeNamespaceInQueryParams,\n    /*isUsingEmulator=*/ true\n  );\n\n  if (tokenProvider) {\n    repo.authTokenProvider_ = tokenProvider;\n  }\n}\n\n/**\n * This function should only ever be called to CREATE a new database instance.\n * @internal\n */\nexport function repoManagerDatabaseFromApp(\n  app: FirebaseApp,\n  authProvider: Provider<FirebaseAuthInternalName>,\n  appCheckProvider?: Provider<AppCheckInternalComponentName>,\n  url?: string,\n  nodeAdmin?: boolean\n): Database {\n  let dbUrl: string | undefined = url || app.options.databaseURL;\n  if (dbUrl === undefined) {\n    if (!app.options.projectId) {\n      fatal(\n        \"Can't determine Firebase Database URL. Be sure to include \" +\n          ' a Project ID when calling firebase.initializeApp().'\n      );\n    }\n\n    log('Using default host for project ', app.options.projectId);\n    dbUrl = `${app.options.projectId}-default-rtdb.firebaseio.com`;\n  }\n\n  let parsedUrl = parseRepoInfo(dbUrl, nodeAdmin);\n  let repoInfo = parsedUrl.repoInfo;\n\n  let isEmulator: boolean;\n\n  let dbEmulatorHost: string | undefined = undefined;\n  if (typeof process !== 'undefined' && process.env) {\n    dbEmulatorHost = process.env[FIREBASE_DATABASE_EMULATOR_HOST_VAR];\n  }\n\n  if (dbEmulatorHost) {\n    isEmulator = true;\n    dbUrl = `http://${dbEmulatorHost}?ns=${repoInfo.namespace}`;\n    parsedUrl = parseRepoInfo(dbUrl, nodeAdmin);\n    repoInfo = parsedUrl.repoInfo;\n  } else {\n    isEmulator = !parsedUrl.repoInfo.secure;\n  }\n\n  const authTokenProvider =\n    nodeAdmin && isEmulator\n      ? new EmulatorTokenProvider(EmulatorTokenProvider.OWNER)\n      : new FirebaseAuthTokenProvider(app.name, app.options, authProvider);\n\n  validateUrl('Invalid Firebase Database URL', parsedUrl);\n  if (!pathIsEmpty(parsedUrl.path)) {\n    fatal(\n      'Database URL must point to the root of a Firebase Database ' +\n        '(not including a child path).'\n    );\n  }\n\n  const repo = repoManagerCreateRepo(\n    repoInfo,\n    app,\n    authTokenProvider,\n    new AppCheckTokenProvider(app.name, appCheckProvider)\n  );\n  return new Database(repo, app);\n}\n\n/**\n * Remove the repo and make sure it is disconnected.\n *\n */\nfunction repoManagerDeleteRepo(repo: Repo, appName: string): void {\n  const appRepos = repos[appName];\n  // This should never happen...\n  if (!appRepos || appRepos[repo.key] !== repo) {\n    fatal(`Database ${appName}(${repo.repoInfo_}) has already been deleted.`);\n  }\n  repoInterrupt(repo);\n  delete appRepos[repo.key];\n}\n\n/**\n * Ensures a repo doesn't already exist and then creates one using the\n * provided app.\n *\n * @param repoInfo - The metadata about the Repo\n * @returns The Repo object for the specified server / repoName.\n */\nfunction repoManagerCreateRepo(\n  repoInfo: RepoInfo,\n  app: FirebaseApp,\n  authTokenProvider: AuthTokenProvider,\n  appCheckProvider: AppCheckTokenProvider\n): Repo {\n  let appRepos = repos[app.name];\n\n  if (!appRepos) {\n    appRepos = {};\n    repos[app.name] = appRepos;\n  }\n\n  let repo = appRepos[repoInfo.toURLString()];\n  if (repo) {\n    fatal(\n      'Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.'\n    );\n  }\n  repo = new Repo(repoInfo, useRestClient, authTokenProvider, appCheckProvider);\n  appRepos[repoInfo.toURLString()] = repo;\n\n  return repo;\n}\n\n/**\n * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\n */\nexport function repoManagerForceRestClient(forceRestClient: boolean): void {\n  useRestClient = forceRestClient;\n}\n\n/**\n * Class representing a Firebase Realtime Database.\n */\nexport class Database implements _FirebaseService {\n  /** Represents a `Database` instance. */\n  readonly 'type' = 'database';\n\n  /** Track if the instance has been used (root or repo accessed) */\n  _instanceStarted: boolean = false;\n\n  /** Backing state for root_ */\n  private _rootInternal?: ReferenceImpl;\n\n  /** @hideconstructor */\n  constructor(\n    public _repoInternal: Repo,\n    /** The {@link @firebase/app#FirebaseApp} associated with this Realtime Database instance. */\n    readonly app: FirebaseApp\n  ) {}\n\n  get _repo(): Repo {\n    if (!this._instanceStarted) {\n      repoStart(\n        this._repoInternal,\n        this.app.options.appId,\n        this.app.options['databaseAuthVariableOverride']\n      );\n      this._instanceStarted = true;\n    }\n    return this._repoInternal;\n  }\n\n  get _root(): ReferenceImpl {\n    if (!this._rootInternal) {\n      this._rootInternal = new ReferenceImpl(this._repo, newEmptyPath());\n    }\n    return this._rootInternal;\n  }\n\n  _delete(): Promise<void> {\n    if (this._rootInternal !== null) {\n      repoManagerDeleteRepo(this._repo, this.app.name);\n      this._repoInternal = null;\n      this._rootInternal = null;\n    }\n    return Promise.resolve();\n  }\n\n  _checkNotDeleted(apiName: string) {\n    if (this._rootInternal === null) {\n      fatal('Cannot call ' + apiName + ' on a deleted database.');\n    }\n  }\n}\n\nfunction checkTransportInit() {\n  if (TransportManager.IS_TRANSPORT_INITIALIZED) {\n    warn(\n      'Transport has already been initialized. Please call this function before calling ref or setting up a listener'\n    );\n  }\n}\n\n/**\n * Force the use of websockets instead of longPolling.\n */\nexport function forceWebSockets() {\n  checkTransportInit();\n  BrowserPollConnection.forceDisallow();\n}\n\n/**\n * Force the use of longPolling instead of websockets. This will be ignored if websocket protocol is used in databaseURL.\n */\nexport function forceLongPolling() {\n  checkTransportInit();\n  WebSocketConnection.forceDisallow();\n  BrowserPollConnection.forceAllow();\n}\n\n/**\n * Returns the instance of the Realtime Database SDK that is associated\n * with the provided {@link @firebase/app#FirebaseApp}. Initializes a new instance with\n * with default settings if no instance exists or if the existing instance uses\n * a custom database URL.\n *\n * @param app - The {@link @firebase/app#FirebaseApp} instance that the returned Realtime\n * Database instance is associated with.\n * @param url - The URL of the Realtime Database instance to connect to. If not\n * provided, the SDK connects to the default instance of the Firebase App.\n * @returns The `Database` instance of the provided app.\n */\nexport function getDatabase(\n  app: FirebaseApp = getApp(),\n  url?: string\n): Database {\n  const db = _getProvider(app, 'database').getImmediate({\n    identifier: url\n  }) as Database;\n  if (!db._instanceStarted) {\n    const emulator = getDefaultEmulatorHostnameAndPort('database');\n    if (emulator) {\n      connectDatabaseEmulator(db, ...emulator);\n    }\n  }\n  return db;\n}\n\n/**\n * Modify the provided instance to communicate with the Realtime Database\n * emulator.\n *\n * <p>Note: This method must be called before performing any other operation.\n *\n * @param db - The instance to modify.\n * @param host - The emulator host (ex: localhost)\n * @param port - The emulator port (ex: 8080)\n * @param options.mockUserToken - the mock auth token to use for unit testing Security Rules\n */\nexport function connectDatabaseEmulator(\n  db: Database,\n  host: string,\n  port: number,\n  options: {\n    mockUserToken?: EmulatorMockTokenOptions | string;\n  } = {}\n): void {\n  db = getModularInstance(db);\n  db._checkNotDeleted('useEmulator');\n  if (db._instanceStarted) {\n    fatal(\n      'Cannot call useEmulator() after instance has already been initialized.'\n    );\n  }\n\n  const repo = db._repoInternal;\n  let tokenProvider: EmulatorTokenProvider | undefined = undefined;\n  if (repo.repoInfo_.nodeAdmin) {\n    if (options.mockUserToken) {\n      fatal(\n        'mockUserToken is not supported by the Admin SDK. For client access with mock users, please use the \"firebase\" package instead of \"firebase-admin\".'\n      );\n    }\n    tokenProvider = new EmulatorTokenProvider(EmulatorTokenProvider.OWNER);\n  } else if (options.mockUserToken) {\n    const token =\n      typeof options.mockUserToken === 'string'\n        ? options.mockUserToken\n        : createMockUserToken(options.mockUserToken, db.app.options.projectId);\n    tokenProvider = new EmulatorTokenProvider(token);\n  }\n\n  // Modify the repo to apply emulator settings\n  repoManagerApplyEmulatorSettings(repo, host, port, tokenProvider);\n}\n\n/**\n * Disconnects from the server (all Database operations will be completed\n * offline).\n *\n * The client automatically maintains a persistent connection to the Database\n * server, which will remain active indefinitely and reconnect when\n * disconnected. However, the `goOffline()` and `goOnline()` methods may be used\n * to control the client connection in cases where a persistent connection is\n * undesirable.\n *\n * While offline, the client will no longer receive data updates from the\n * Database. However, all Database operations performed locally will continue to\n * immediately fire events, allowing your application to continue behaving\n * normally. Additionally, each operation performed locally will automatically\n * be queued and retried upon reconnection to the Database server.\n *\n * To reconnect to the Database and begin receiving remote events, see\n * `goOnline()`.\n *\n * @param db - The instance to disconnect.\n */\nexport function goOffline(db: Database): void {\n  db = getModularInstance(db);\n  db._checkNotDeleted('goOffline');\n  repoInterrupt(db._repo);\n}\n\n/**\n * Reconnects to the server and synchronizes the offline Database state\n * with the server state.\n *\n * This method should be used after disabling the active connection with\n * `goOffline()`. Once reconnected, the client will transmit the proper data\n * and fire the appropriate events so that your client \"catches up\"\n * automatically.\n *\n * @param db - The instance to reconnect.\n */\nexport function goOnline(db: Database): void {\n  db = getModularInstance(db);\n  db._checkNotDeleted('goOnline');\n  repoResume(db._repo);\n}\n\n/**\n * Logs debugging information to the console.\n *\n * @param enabled - Enables logging if `true`, disables logging if `false`.\n * @param persistent - Remembers the logging state between page refreshes if\n * `true`.\n */\nexport function enableLogging(enabled: boolean, persistent?: boolean);\n\n/**\n * Logs debugging information to the console.\n *\n * @param logger - A custom logger function to control how things get logged.\n */\nexport function enableLogging(logger: (message: string) => unknown);\n\nexport function enableLogging(\n  logger: boolean | ((message: string) => unknown),\n  persistent?: boolean\n): void {\n  enableLoggingImpl(logger, persistent);\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","/**\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\nconst SERVER_TIMESTAMP = {\n  '.sv': 'timestamp'\n};\n\n/**\n * Returns a placeholder value for auto-populating the current timestamp (time\n * since the Unix epoch, in milliseconds) as determined by the Firebase\n * servers.\n */\nexport function serverTimestamp(): object {\n  return SERVER_TIMESTAMP;\n}\n\n/**\n * Returns a placeholder value that can be used to atomically increment the\n * current database value by the provided delta.\n *\n * @param delta - the amount to modify the current value atomically.\n * @returns A placeholder value for modifying data atomically server-side.\n */\nexport function increment(delta: number): object {\n  return {\n    '.sv': {\n      'increment': delta\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\nimport { getModularInstance, Deferred } from '@firebase/util';\n\nimport { repoStartTransaction } from '../core/Repo';\nimport { PRIORITY_INDEX } from '../core/snap/indexes/PriorityIndex';\nimport { Node } from '../core/snap/Node';\nimport { validateWritablePath } from '../core/util/validation';\n\nimport { DatabaseReference } from './Reference';\nimport { DataSnapshot, onValue, ReferenceImpl } from './Reference_impl';\n\n/** An options object to configure transactions. */\nexport interface TransactionOptions {\n  /**\n   * By default, events are raised each time the transaction update function\n   * runs. So if it is run multiple times, you may see intermediate states. You\n   * can set this to false to suppress these intermediate states and instead\n   * wait until the transaction has completed before events are raised.\n   */\n  readonly applyLocally?: boolean;\n}\n\n/**\n * A type for the resolve value of {@link runTransaction}.\n */\nexport class TransactionResult {\n  /** @hideconstructor */\n  constructor(\n    /** Whether the transaction was successfully committed. */\n    readonly committed: boolean,\n    /** The resulting data snapshot. */\n    readonly snapshot: DataSnapshot\n  ) {}\n\n  /** Returns a JSON-serializable representation of this object. */\n  toJSON(): object {\n    return { committed: this.committed, snapshot: this.snapshot.toJSON() };\n  }\n}\n\n/**\n * Atomically modifies the data at this location.\n *\n * Atomically modify the data at this location. Unlike a normal `set()`, which\n * just overwrites the data regardless of its previous value, `runTransaction()` is\n * used to modify the existing value to a new value, ensuring there are no\n * conflicts with other clients writing to the same location at the same time.\n *\n * To accomplish this, you pass `runTransaction()` an update function which is\n * used to transform the current value into a new value. If another client\n * writes to the location before your new value is successfully written, your\n * update function will be called again with the new current value, and the\n * write will be retried. This will happen repeatedly until your write succeeds\n * without conflict or you abort the transaction by not returning a value from\n * your update function.\n *\n * Note: Modifying data with `set()` will cancel any pending transactions at\n * that location, so extreme care should be taken if mixing `set()` and\n * `runTransaction()` to update the same data.\n *\n * Note: When using transactions with Security and Firebase Rules in place, be\n * aware that a client needs `.read` access in addition to `.write` access in\n * order to perform a transaction. This is because the client-side nature of\n * transactions requires the client to read the data in order to transactionally\n * update it.\n *\n * @param ref - The location to atomically modify.\n * @param transactionUpdate - A developer-supplied function which will be passed\n * the current data stored at this location (as a JavaScript object). The\n * function should return the new value it would like written (as a JavaScript\n * object). If `undefined` is returned (i.e. you return with no arguments) the\n * transaction will be aborted and the data at this location will not be\n * modified.\n * @param options - An options object to configure transactions.\n * @returns A `Promise` that can optionally be used instead of the `onComplete`\n * callback to handle success and failure.\n */\nexport function runTransaction(\n  ref: DatabaseReference,\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  transactionUpdate: (currentData: any) => unknown,\n  options?: TransactionOptions\n): Promise<TransactionResult> {\n  ref = getModularInstance(ref);\n\n  validateWritablePath('Reference.transaction', ref._path);\n\n  if (ref.key === '.length' || ref.key === '.keys') {\n    throw (\n      'Reference.transaction failed: ' + ref.key + ' is a read-only object.'\n    );\n  }\n\n  const applyLocally = options?.applyLocally ?? true;\n  const deferred = new Deferred<TransactionResult>();\n\n  const promiseComplete = (\n    error: Error | null,\n    committed: boolean,\n    node: Node | null\n  ) => {\n    let dataSnapshot: DataSnapshot | null = null;\n    if (error) {\n      deferred.reject(error);\n    } else {\n      dataSnapshot = new DataSnapshot(\n        node,\n        new ReferenceImpl(ref._repo, ref._path),\n        PRIORITY_INDEX\n      );\n      deferred.resolve(new TransactionResult(committed, dataSnapshot));\n    }\n  };\n\n  // Add a watch to make sure we get server updates.\n  const unwatcher = onValue(ref, () => {});\n\n  repoStartTransaction(\n    ref._repo,\n    ref._path,\n    transactionUpdate,\n    promiseComplete,\n    unwatcher,\n    applyLocally\n  );\n\n  return deferred.promise;\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 { PersistentConnection } from '../core/PersistentConnection';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { Connection } from '../realtime/Connection';\n\nimport { repoManagerForceRestClient } from './Database';\n\nexport const DataConnection = PersistentConnection;\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(PersistentConnection.prototype as any).simpleListen = function (\n  pathString: string,\n  onComplete: (a: unknown) => void\n) {\n  this.sendRequest('q', { p: pathString }, onComplete);\n};\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(PersistentConnection.prototype as any).echo = function (\n  data: unknown,\n  onEcho: (a: unknown) => void\n) {\n  this.sendRequest('echo', { d: data }, onEcho);\n};\n\n// RealTimeConnection properties that we use in tests.\nexport const RealTimeConnection = Connection;\n\n/**\n * @internal\n */\nexport const hijackHash = function (newHash: () => string) {\n  const oldPut = PersistentConnection.prototype.put;\n  PersistentConnection.prototype.put = function (\n    pathString,\n    data,\n    onComplete,\n    hash\n  ) {\n    if (hash !== undefined) {\n      hash = newHash();\n    }\n    oldPut.call(this, pathString, data, onComplete, hash);\n  };\n  return function () {\n    PersistentConnection.prototype.put = oldPut;\n  };\n};\n\nexport const ConnectionTarget = RepoInfo;\n\n/**\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\n * @internal\n */\nexport const forceRestClient = function (forceRestClient: boolean) {\n  repoManagerForceRestClient(forceRestClient);\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// eslint-disable-next-line import/no-extraneous-dependencies\nimport {\n  _registerComponent,\n  registerVersion,\n  SDK_VERSION\n} from '@firebase/app';\nimport { Component, ComponentType } from '@firebase/component';\n\nimport { name, version } from '../package.json';\nimport { setSDKVersion } from '../src/core/version';\n\nimport { repoManagerDatabaseFromApp } from './api/Database';\n\nexport function registerDatabase(variant?: string): void {\n  setSDKVersion(SDK_VERSION);\n  _registerComponent(\n    new Component(\n      'database',\n      (container, { instanceIdentifier: url }) => {\n        const app = container.getProvider('app').getImmediate()!;\n        const authProvider = container.getProvider('auth-internal');\n        const appCheckProvider = container.getProvider('app-check-internal');\n        return repoManagerDatabaseFromApp(\n          app,\n          authProvider,\n          appCheckProvider,\n          url\n        );\n      },\n      ComponentType.PUBLIC\n    ).setMultipleInstances(true)\n  );\n  registerVersion(name, version, variant);\n  // BUILD_TARGET will be replaced by values like esm5, esm2017, cjs5, etc during the compilation\n  registerVersion(name, version, '__BUILD_TARGET__');\n}\n","/**\n * Firebase Realtime Database\n *\n * @packageDocumentation\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\nimport { Database } from './api/Database';\nimport { registerDatabase } from './register';\n\nexport * from './api';\n\nregisterDatabase();\n\ndeclare module '@firebase/component' {\n  interface NameServiceMapping {\n    'database': Database;\n  }\n}\n"],"names":["CONSTANTS","assert","assertion","message","assertionError","Error","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","init_","byteToCharMap","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","push","join","encodeString","btoa","decodeString","bytes","pos","c1","String","fromCharCode","c2","u","c3","byteArrayToString","decodeStringToByteArray","charToByteMap","charAt","byte4","DecodeBase64StringError","constructor","name","base64Encode","utf8Bytes","base64urlEncodeWithoutPadding","replace","base64Decode","e","console","error","deepCopy","value","deepExtend","undefined","target","source","Object","Date","getTime","prop","hasOwnProperty","getDefaultsFromGlobal","getGlobal","self","window","global","__FIREBASE_DEFAULTS__","getDefaults","process","env","defaultsJsonString","JSON","parse","getDefaultsFromEnvVariable","document","match","cookie","decoded","getDefaultsFromCookie","info","getDefaultEmulatorHostnameAndPort","productName","host","_a","_b","emulatorHosts","getDefaultEmulatorHost","separatorIndex","lastIndexOf","port","parseInt","substring","Deferred","reject","resolve","promise","Promise","wrapCallback","callback","catch","isMobileCordova","test","getUA","navigator","isNodeSdk","jsonEval","stringify","data","decode","token","header","claims","signature","parts","split","contains","obj","key","prototype","call","safeGet","isEmpty","map","fn","contextObj","res","Sha1","chain_","buf_","W_","pad_","inbuf_","total_","blockSize","reset","compress_","buf","offset","W","t","f","k","a","b","d","update","lengthMinusBlock","n","inbuf","digest","totalBits","j","errorPrefix","fnName","argName","stringLength","getModularInstance","service","_delegate","Component","instanceFactory","type","multipleInstances","serviceProps","instantiationMode","onInstanceCreated","setInstantiationMode","mode","setMultipleInstances","setServiceProps","props","setInstanceCreatedCallback","LogLevel","levelStringToEnum","debug","DEBUG","verbose","VERBOSE","INFO","warn","WARN","ERROR","silent","SILENT","defaultLogLevel","ConsoleMethod","defaultLogHandler","instance","logType","args","logLevel","now","toISOString","method","SDK_VERSION","setSDKVersion","version","DOMStorageWrapper","domStorage_","prefix_","set","removeItem","prefixedName_","setItem","get","storedVal","getItem","remove","toString","MemoryStorage","cache_","isInMemoryStorage","createStoragefor","domStorageName","domStorage","PersistentStorage","SessionStorage","logClient","Logger","_logLevel","_logHandler","_userLogHandler","val","TypeError","setLogLevel","logHandler","userLogHandler","log","LUIDGenerator","id","sha1","high","sha1Bytes","buildLogMessage_","varArgs","arg","apply","logger","firstLog_","enableLogging","logger_","persistent","bind","logWrapper","prefix","fatal","isInvalidJSONNumber","Number","POSITIVE_INFINITY","NEGATIVE_INFINITY","MIN_NAME","MAX_NAME","nameCompare","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","ObjectToUniqueKey","keys","sort","splitStringBySize","segsize","len","dataSegs","each","doubleToIEEE754String","v","bias","s","ln","Infinity","Math","abs","pow","min","floor","LN2","round","bits","reverse","hexByteString","hexByte","substr","toLowerCase","INTEGER_REGEXP_","RegExp","intVal","exceptionGuard","setTimeout","stack","setTimeoutNonBlocking","time","timeout","Deno","unrefTimer","AppCheckTokenProvider","appName_","appCheckProvider","appCheck","getImmediate","optional","then","getToken","forceRefresh","addTokenChangeListener","listener","addTokenListener","notifyForInvalidToken","FirebaseAuthTokenProvider","firebaseOptions_","authProvider_","auth_","onInit","auth","code","addAuthTokenListener","removeTokenChangeListener","removeAuthTokenListener","errorMessage","EmulatorTokenProvider","accessToken","OWNER","FORGE_DOMAIN_RE","RepoInfo","secure","namespace","webSocketOnly","nodeAdmin","persistenceKey","includeNamespaceInQueryParams","isUsingEmulator","_host","_domain","indexOf","internalHost","isCacheableHost","isCustomHost","newHost","toURLString","protocol","query","repoInfoConnectionURL","repoInfo","params","connURL","repoInfoNeedsQueryParam","pairs","StatsCollection","counters_","incrementCounter","amount","collections","reporters","statsManagerGetCollection","hashString","PacketReceiver","onMessage_","pendingResponses","currentResponseNum","closeAfterResponse","onClose","closeAfter","responseNum","handleResponse","requestNum","toProcess","BrowserPollConnection","connId","applicationId","appCheckToken","authToken","transportSessionId","lastSessionId","bytesSent","bytesReceived","everConnected_","log_","stats_","urlFn","open","onMessage","onDisconnect","curSegmentNum","onDisconnect_","myPacketOrderer","isClosed_","connectTimeoutTimer_","onClosed_","readyState","called","wrappedFn","body","addEventListener","attachEvent","executeWhenDOMReady","scriptTagHolder","FirebaseIFrameScriptHolder","command","arg1","arg2","arg3","arg4","incrementIncomingBytes_","clearTimeout","password","sendNewPolls","pN","urlParams","random","uniqueCallbackIdentifier","location","hostname","connectURL","addTag","start","startLongPoll","addDisconnectPingFrame","static","forceAllow_","forceDisallow_","createElement","href","Windows","UI","markConnectionHealthy","shutdown_","close","myDisconnFrame","removeChild","send","dataStr","base64data","MAX_URL_DATA_SIZE","enqueueSegment","pw","src","style","display","appendChild","commandCB","onMessageCB","outstandingRequests","Set","pendingSegs","currentSerial","myIFrame","createIFrame_","script","domain","iframeContents","doc","write","iframe","contentWindow","contentDocument","alive","textContent","myID","myPW","newRequest_","size","theURL","curDataString","theSeg","shift","seg","ts","addLongPollTag_","segnum","totalsegs","url","serial","add","doNewRequest","delete","keepaliveTimeout","loadCB","newScript","async","onload","onreadystatechange","rstate","parentNode","onerror","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","keepaliveTimer","frames","totalFrames","connectionURL_","options","mySock","onopen","onclose","onmessage","m","handleIncomingFrame","isOldAndroid","userAgent","oldAndroidRegex","oldAndroidMatch","parseFloat","appendFrame_","fullMess","jsonMess","handleNewFrameCount_","frameCount","extractFrameCount_","isNaN","mess","resetKeepAlive","remainingData","sendString_","clearInterval","setInterval","responsesRequiredToBeHealthy","healthyTimeout","TransportManager","initTransports_","ALL_TRANSPORTS","IS_TRANSPORT_INITIALIZED","globalTransportInitialized_","isWebSocketsAvailable","isSkipPollConnection","previouslyFailed","transports_","transports","transport","initialTransport","upgradeTransport","Connection","repoInfo_","applicationId_","appCheckToken_","authToken_","onReady_","onKill_","connectionCount","pendingDataMessages","state_","transportManager_","start_","conn","conn_","nextTransportId_","primaryResponsesRequired_","onMessageReceived","connReceiver_","onConnectionLost","disconnReceiver_","tx_","rx_","secondaryConn_","isHealthy_","healthyTimeoutMS","healthyTimeout_","everConnected","onConnectionLost_","onSecondaryConnectionLost_","onPrimaryMessageReceived_","onSecondaryMessageReceived_","sendRequest","dataMsg","msg","sendData_","tryCleanupConnection","onSecondaryControl_","controlData","cmd","upgradeIfSecondaryHealthy_","secondaryResponsesRequired_","parsedData","layer","proceedWithUpgrade_","onControl_","onDataMessage_","onPrimaryResponse_","payload","handshakePayload","assign","h","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","timestamp","sessionId","onConnectionEstablished_","tryStartUpgrade_","startUpgrade_","closeConnections_","reason","ServerActions","put","pathString","onComplete","hash","merge","refreshAuthToken","refreshAppCheckToken","onDisconnectPut","onDisconnectMerge","onDisconnectCancel","reportStats","stats","EventEmitter","allowedEvents_","listeners_","trigger","eventType","listeners","context","on","validateEventType_","eventData","getInitialEvent","off","splice","find","et","OnlineMonitor","super","online_","currentlyOnline","Path","pathOrString","pieceNum","pieces_","copyTo","pieceNum_","newEmptyPath","pathGetFront","path","pathGetLength","pathPopFront","pathGetBack","pathSlice","begin","slice","pathParent","pieces","pathChild","childPathObj","childPieces","pathIsEmpty","newRelativePath","outerPath","innerPath","outer","inner","pathCompare","left","right","leftKeys","rightKeys","cmp","pathEquals","other","pathContains","ValidationPath","errorPrefix_","parts_","byteLength_","max","validationPathCheckValid","validationPath","validationPathToErrorString","VisibilityMonitor","hidden","visibilityChange","visible_","visible","PersistentConnection","onDataUpdate_","onConnectStatus_","onServerInfoUpdate_","authTokenProvider_","appCheckTokenProvider_","authOverride_","nextPersistentConnectionId_","interruptReasons_","listens","Map","outstandingPuts_","outstandingGets_","outstandingPutCount_","outstandingGetCount_","onDisconnectRequestQueue_","connected_","reconnectDelay_","maxReconnectDelay_","securityDebugCallback_","establishConnectionTimer_","requestCBHash_","requestNumber_","realtime_","forceTokenRefresh_","invalidAuthTokenCount_","invalidAppCheckTokenCount_","firstConnection_","lastConnectionAttemptTime_","lastConnectionEstablishedTime_","getInstance","onVisible_","onOnline_","action","onResponse","curReqNum","r","initConnection_","deferred","outstandingGet","request","_path","q","_queryObject","index","sendGet_","listen","currentHashFn","tag","queryId","_queryIdentifier","has","_queryParams","isDefault","loadsAllData","listenSpec","hashFn","sendListen_","req","status","warnOnListenWarnings_","removeListen_","warnings","indexSpec","getIndex","indexPath","tryAuth","reduceReconnectDelayIfAdminCredential_","credential","isAdmin","tryAppCheck","authMethod","isValidFormat","requestData","cred","onAuthRevoked_","onAppCheckRevoked_","unlisten","sendUnlisten_","queryObj","sendOnDisconnect_","response","putInternal","sendPut_","queued","result","errorReason","reqNum","onDataPush_","onListenRevoked_","onSecurityDebugPacket_","handleTimestamp_","sendConnectStats_","restoreState_","scheduleConnect_","establishConnection_","online","onRealtimeDisconnect_","cancelSentTransactions_","shouldReconnect_","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage","onReady","nextConnectionId_","canceled","connection","closeFn","sendRequestFn","all","interrupt","resume","delta","serverTimeOffset","normalizedPathString","statusCode","explanation","queries","values","isReactNative","NamedNode","node","Index","getCompare","compare","indexedValueChanged","oldNode","newNode","oldWrapped","newWrapped","minPost","MIN","__EMPTY_NODE","KeyIndex","isDefinedOn","maxPost","makePost","indexValue","KEY_INDEX","SortedMapIterator","startKey","comparator","isReverse_","resultGenerator_","nodeStack_","getNext","pop","hasNext","peek","LLRBNode","color","RED","SortedMap","EMPTY_NODE","copy","count","inorderTraversal","reverseTraversal","min_","minKey","maxKey","insert","fixUp_","removeMin_","isRed_","moveRedLeft_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","nr","checkMaxDepth_","blackDepth","check_","BLACK","comparator_","root_","getPredecessorKey","rightParent","getIterator","resultGenerator","getIteratorFrom","getReverseIteratorFrom","getReverseIterator","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","MAX_NODE","LLRBEmptyNode","priorityHashText","priority","validatePriorityNode","priorityNode","isLeafNode","getPriority","__childrenNodeConstructor","nodeFromJSON","LeafNode","value_","priorityNode_","lazyHash_","updatePriority","newPriorityNode","getImmediateChild","childName","getChild","hasChild","getPredecessorChildName","childNode","updateImmediateChild","newChildNode","updateChild","front","numChildren","forEachChild","exportFormat","getValue","toHash","compareTo","compareToLeafNode_","otherLeaf","otherLeafType","thisLeafType","otherIndex","VALUE_TYPE_ORDER","thisIndex","withIndex","isIndexed","equals","PRIORITY_INDEX","PriorityIndex","aPriority","bPriority","indexCmp","LOG_2","Base12Num","num","current_","mask","bits_","nextBitIsOne","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","low","namedNode","middle","root","base12","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","buildFrom12Array","_defaultIndexMap","fallbackObject","IndexMap","indexes_","indexSet_","Default","indexKey","sortedMap","hasIndex","indexDefinition","addIndex","existingChildren","sawIndexedValue","iter","Wrap","newIndex","next","indexName","newIndexSet","newIndexes","addToIndexes","indexedChildren","existingSnap","newChildren","removeFromIndexes","ChildrenNode","children_","indexMap_","child","newIndexMap","newPriority","newImmediateChild","numKeys","allIntegerKeys","array","childHash","idx","resolveIndex_","predecessor","getFirstChildName","getFirstChild","getLastChildName","getLastChild","wrappedNode","startPost","iterator","endPost","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","MaxNode","defineProperties","MAX","setMaxNode","setPriorityMaxNode","json","childData","children","childrenHavePriority","childSet","sortedChildSet","setNodeFromJSON","PathIndex","indexPath_","extractChild","snap","aChild","bChild","valueNode","VALUE_INDEX","ValueIndex","changeValue","snapshotNode","changeChildAdded","changeChildRemoved","changeChildChanged","oldSnap","IndexedFilter","index_","newChild","affectedPath","optChangeAccumulator","oldChild","trackChildChange","updateFullNode","newSnap","filtersNodes","getIndexedFilter","RangedFilter","indexedFilter_","startPost_","getStartPost_","endPost_","getEndPost_","startIsInclusive_","startAfterSet_","endIsInclusive_","endBeforeSet_","getStartPost","getEndPost","matches","isWithinStart","isWithinEnd","filtered","hasStart","startName","getIndexStartName","getIndexStartValue","hasEnd","endName","getIndexEndName","getIndexEndValue","LimitedFilter","withinDirectionalStart","reverse_","withinEndPost","withinStartPost","withinDirectionalEnd","compareRes","rangedFilter_","limit_","getLimit","isViewFromLeft","fullLimitUpdateChild_","childKey","childSnap","changeAccumulator","oldEventCache","newChildNamedNode","windowBoundary","inRange","oldChildSnap","nextChild","getChildAfterChild","compareNext","newEventCache","QueryParams","limitSet_","startSet_","startNameSet_","endSet_","endNameSet_","viewFrom_","indexStartValue_","indexStartName_","indexEndValue_","indexEndName_","hasLimit","hasAnchoredLimit","queryParamsStartAt","queryParams","newParams","queryParamsEndAt","queryParamsOrderBy","queryParamsToRestQueryStringParameters","qs","orderBy","startParam","endParam","queryParamsGetQueryObject","viewFrom","ReadonlyRestClient","listens_","listenId","getListenId_","thisListen","queryStringParameters","restRequest_","querystring","querystringParams","entries","forEach","arrayVal","encodeURIComponent","xhr","XMLHttpRequest","responseText","SnapshotHolder","rootNode_","getNode","updateSnapshot","newSnapshotNode","newSparseSnapshotTree","sparseSnapshotTreeRemember","sparseSnapshotTree","clear","sparseSnapshotTreeForget","tree","sparseSnapshotTreeForEachTree","prefixPath","func","sparseSnapshotTreeForEachChild","StatsListener","collection_","last_","newStats","stat","StatsReporter","collection","server_","statsToReport_","statsListener_","reportStats_","reportedStats","haveStatsToReport","OperationType","newOperationSourceServerTaggedQuery","fromUser","fromServer","tagged","AckUserWrite","affectedTree","revert","ACK_USER_WRITE","operationForChild","subtree","ListenComplete","LISTEN_COMPLETE","Overwrite","OVERWRITE","Merge","MERGE","CacheNode","node_","fullyInitialized_","filtered_","isFullyInitialized","isFiltered","isCompleteForPath","isCompleteForChild","EventGenerator","query_","eventGeneratorGenerateEventsForType","eventGenerator","events","changes","registrations","eventCache","filteredChanges","filter","change","eventGeneratorCompareChanges","aWrapped","bWrapped","materializedChange","eventGeneratorMaterializeSingleChange","prevName","registration","respondsTo","createEvent","newViewCache","serverCache","viewCacheUpdateEventSnap","viewCache","eventSnap","complete","viewCacheUpdateServerSnap","serverSnap","viewCacheGetCompleteEventSnap","viewCacheGetCompleteServerSnap","emptyChildrenSingleton","ImmutableTree","EmptyChildren","childPath","findRootMostMatchingPathAndValue","relativePath","predicate","childExistingPathAndValue","findRootMostValueAndPath","toSet","setTree","newTree","fold","fold_","pathSoFar","accum","findOnPath","findOnPath_","pathToFollow","foreachOnPath","foreachOnPath_","currentRelativePath","foreach","foreach_","foreachChild","CompoundWrite","writeTree_","compoundWriteAddWrite","compoundWrite","rootmost","rootMostPath","newWriteTree","compoundWriteAddWrites","updates","newWrite","compoundWriteRemoveWrite","empty","compoundWriteHasCompleteWrite","compoundWriteGetCompleteNode","compoundWriteGetCompleteChildren","compoundWriteChildCompoundWrite","shadowingNode","compoundWriteIsEmpty","compoundWriteApply","applySubtreeWrite","writeTree","priorityWrite","writeTreeChildWrites","newWriteTreeRef","writeTreeRemoveWrite","writeId","allWrites","findIndex","writeToRemove","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","writeTreeRecordContainsPath_","writeTreeResetTree_","visibleWrites","writeTreeLayerTree_","writeTreeDefaultFilter_","lastWriteId","writeRecord","writes","treeRoot","writePath","deepNode","writeTreeCalcCompleteEventCache","treePath","completeServerCache","writeIdsToExclude","includeHiddenWrites","subMerge","writeTreeRefCalcCompleteEventCache","writeTreeRef","writeTreeRefCalcCompleteEventChildren","completeServerChildren","writeTreeCalcCompleteEventChildren","completeChildren","topLevelSet","writeTreeRefCalcEventCacheAfterServerOverwrite","existingEventSnap","existingServerSnap","writeTreeCalcEventCacheAfterServerOverwrite","childMerge","writeTreeRefShadowingWrite","writeTreeShadowingWrite","writeTreeRefCalcIndexedSlice","completeServerData","writeTreeCalcIndexedSlice","toIterate","nodes","writeTreeRefCalcCompleteChild","existingServerCache","writeTreeCalcCompleteChild","writeTreeRefChild","ChildChangeAccumulator","changeMap","oldChange","oldType","getChanges","from","NO_COMPLETE_CHILD_SOURCE","NoCompleteChildSource_","getCompleteChild","WriteTreeCompleteChildSource","writes_","viewCache_","optCompleteServerCache_","serverNode","viewProcessorApplyOperation","viewProcessor","oldViewCache","operation","writesCache","completeCache","accumulator","filterServerNode","overwrite","viewProcessorApplyUserOverwrite","viewProcessorApplyServerOverwrite","viewProcessorApplyUserMerge","changedChildren","curViewCache","viewProcessorCacheHasChild","viewProcessorApplyServerMerge","ackUserWrite","viewProcessorRevertUserWrite","serverChildren","viewProcessorAckUserWrite","ackPath","mergePath","serverCachePath","viewProcessorListenComplete","oldServerNode","viewProcessorGenerateEventCacheAfterServerEvent","viewProcessorMaybeAddValueEvent","isLeafOrEmpty","oldCompleteSnap","changePath","oldEventSnap","completeEventChildren","completeNode","oldEventNode","updatedPriority","childChangePath","newEventChild","eventChildUpdate","changedSnap","oldServerSnap","newServerCache","serverFilter","newServerNode","viewProcessorApplyMerge","viewMergeTree","childMergeTree","isUnknownDeepMerge","View","initialViewCache","eventRegistrations_","indexFilter","queryParamsGetNodeFilter","processor_","newViewProcessor","initialServerCache","initialEventCache","eventGenerator_","viewGetCompleteServerCache","view","cache","viewIsEmpty","viewRemoveEventRegistration","eventRegistration","cancelError","cancelEvents","maybeEvent","createCancelEvent","remaining","existing","hasAnyCallback","concat","viewApplyOperation","viewProcessorAssertIndexed","viewGenerateEventsForChanges_","eventGeneratorGenerateEventsForChanges","eventRegistrations","moves","changeChildMoved","referenceConstructor","SyncPoint","views","syncPointApplyOperation","syncPoint","optCompleteServerCache","syncPointGetView","serverCacheComplete","eventCacheComplete","syncPointAddEventRegistration","viewAddEventRegistration","viewGetInitialEvents","initialChanges","syncPointRemoveEventRegistration","removed","hadCompleteView","syncPointHasCompleteView","viewQueryId","syncPointGetReferenceConstructor","_repo","syncPointGetQueryViews","syncPointGetCompleteServerCache","syncPointViewForQuery","syncPointGetCompleteView","syncPointViewExistsForQuery","syncTreeNextQueryTag_","SyncTree","listenProvider_","syncPointTree_","pendingWriteTree_","tagToQueryMap","queryToTagMap","syncTreeApplyUserOverwrite","syncTree","newData","writeTreeAddOverwrite","syncTreeApplyOperationToSyncPoints_","syncTreeApplyUserMerge","writeTreeAddMerge","changeTree","fromObject","syncTreeAckUserWrite","writeTreeGetWrite","record","syncTreeApplyServerOverwrite","syncTreeRemoveEventRegistration","skipListenerDedup","maybeSyncPoint","removedAndEvents","syncPointIsEmpty","removingDefault","covered","parentSyncPoint","newViews","syncTreeCollectDistinctViewsForSubTree_","maybeChildSyncPoint","childMap","_key","childViews","newQuery","syncTreeCreateListenerForView_","startListening","syncTreeQueryForListening_","syncTreeTagForQuery","defaultTag","stopListening","queryToRemove","tagToRemove","syncTreeMakeQueryKey_","syncTreeRemoveTags_","removedQuery","removedQueryKey","removedQueryTag","syncTreeApplyTaggedQueryOverwrite","queryKey","syncTreeQueryKeyForTag_","syncTreeParseQueryKey_","queryPath","syncTreeApplyTaggedOperation_","syncTreeAddEventRegistration","skipSetupListener","foundAncestorDefaultView","pathToSyncPoint","sp","childSyncPoint","viewAlreadyExists","syncTreeGetNextQueryTag_","syncTreeSetupListener_","queriesToStop","childQueries","queryToStop","syncTreeCalcCompleteEventCache","syncTreeGetServerValue","serverCacheNode","viewGetCompleteNode","syncTreeApplyOperationHelper_","syncPointTree","syncTreeApplyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","viewGetServerCache","syncTreeApplyTaggedListenComplete","syncTreeApplyListenComplete","errorForServerCode","toUpperCase","splitIndex","syncTreeGetReferenceConstructor","ExistingValueProvider","DeferredValueProvider","syncTree_","path_","resolveDeferredLeafValue","existingVal","serverValues","resolveScalarDeferredValue","resolveComplexDeferredValue","op","unused","existingNode","resolveDeferredValueTree","resolveDeferredValue","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","Tree","parent","childCount","treeSubTree","pathObj","treeGetValue","treeSetValue","treeUpdateParents","treeHasChildren","treeForEachChild","treeForEachDescendant","includeSelf","childrenFirst","treeGetPath","treeUpdateChild","childEmpty","treeIsEmpty","childExists","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","isValidKey","isValidPathString","isValidPriority","validateFirebaseDataArg","validateFirebaseData","errorPrefixFxn","hasDotValue","hasActualChild","validationPathPush","validationPathPop","last","validateFirebaseMergeDataArg","mergePaths","curPath","prevPath","validateFirebaseMergePaths","validatePriority","validateKey","argumentName","validatePathString","validateWritablePath","validateUrl","parsedUrl","isValidRootPathString","EventQueue","eventLists_","recursionDepth_","eventQueueQueueEvents","eventQueue","eventDataList","currList","getPath","eventQueueRaiseEventsAtPath","eventQueueRaiseQueuedEventsMatchingPredicate","eventPath","eventQueueRaiseEventsForChangedPath","changedPath","sentAll","eventList","eventListRaise","eventFn","getEventRunner","Repo","forceRestClient_","appCheckProvider_","dataUpdateCount","eventQueue_","nextWriteId_","interceptServerDataCallback_","transactionQueueTree_","persistentConnection_","repoStart","repo","appId","authOverride","search","isMerge","repoOnDataUpdate","repoOnConnectStatus","connectStatus","repoOnServerInfoUpdate","repoUpdateInfo","statsReporter_","statsManagerGetOrCreateReporter","creatorFunction","infoData_","infoSyncTree_","infoEvents","serverSyncTree_","repoServerTime","repoGenerateServerValues","taggedChildren","raw","syncTreeApplyTaggedQueryMerge","taggedSnap","syncTreeApplyServerMerge","repoRerunTransactions","repoRunOnDisconnectEvents","repoLog","resolvedOnDisconnectTree","resolved","repoAbortTransactions","repoGetNextWriteId","repoSetWithPriority","newVal","newNodeUnresolved","success","clearEvents","repoCallOnCompleteCallback","repoOnDisconnectCancel","repoOnDisconnectSet","repoRemoveEventCallbackForQuery","repoInterrupt","repoGetLatestState","excludeSets","repoSendReadyTransactions","repoPruneCompletedTransactionsBelowNode","queue","repoBuildTransactionQueue","every","transaction","repoSendTransactionQueue","setsToIgnore","txn","currentWriteId","latestState","snapToSend","latestHash","retryCount","currentOutputSnapshotRaw","dataToSend","pathToSend","callbacks","currentOutputSnapshotResolved","unwatcher","abortReason","rootMostTransactionNode","repoGetAncestorTransactionNode","repoRerunTransactionQueue","abortTransaction","currentNode","currentInputSnapshot","newDataNode","oldWriteId","newNodeResolved","applyLocally","transactionNode","transactionQueue","repoAggregateTransactionQueuesForNode","order","nodeQueue","to","treeForEachAncestor","repoAbortTransactionsOnNode","lastSent","parseRepoInfo","dataURL","parseDatabaseURL","scheme","subdomain","colonInd","slashInd","questionMarkInd","decodePath","pathStringDecoded","piece","decodeURIComponent","decodeQuery","queryString","results","segment","kv","hostWithoutPort","dotInd","PUSH_CHARS","nextPushId","lastPushTime","lastRandChars","duplicateTime","timeStampChars","DataEvent","snapshot","ref","getEventType","exportVal","CancelEvent","CallbackContext","snapshotCallback","cancelCallback","onValue","expDataSnapshot","previousChildName","onCancel","hasCancelCallback","userCallback","OnDisconnect","cancel","setWithPriority","repoOnDisconnectSetWithPriority","repoOnDisconnectUpdate","childrenToMerge","QueryImpl","_orderByCalled","ReferenceImpl","isEqual","sameRepo","samePath","sameQueryIdentifier","toJSON","pathToUrlEncodedString","validateNoPreviousOrderByCall","validateQueryEndpoints","startNode","endNode","tooManyArgsError","wrongArgTypeError","validateLimit","parentPath","DataSnapshot","_node","_index","childRef","exists","hasChildren","db","_checkNotDeleted","_root","refFromURL","parsedURL","thennablePushRef","pushRef","setPriority","repoUpdate","changedKey","changedValue","callbackContext","container","ValueEventRegistration","repoGetValue","cached","err","ChildEventRegistration","eventToCheck","cancelCallbackOrListenOptions","onlyOnce","onceCallback","dataSnapshot","repoAddEventCallbackForQuery","onChildAdded","onChildChanged","onChildMoved","onChildRemoved","expCallback","QueryConstraint","QueryEndAtConstraint","_value","_apply","endAt","QueryEndBeforeConstraint","queryParamsEndBefore","endBefore","QueryStartAtConstraint","startAt","QueryStartAfterConstraint","queryParamsStartAfter","startAfter","QueryLimitToFirstConstraint","_limit","queryParamsLimitToFirst","newLimit","limitToFirst","limit","QueryLimitToLastConstraint","queryParamsLimitToLast","limitToLast","QueryOrderByChildConstraint","parsedPath","orderByChild","QueryOrderByKeyConstraint","orderByKey","QueryOrderByPriorityConstraint","orderByPriority","QueryOrderByValueConstraint","orderByValue","QueryEqualToValueConstraint","equalTo","queryConstraints","queryImpl","constraint","syncPointSetReferenceConstructor","syncTreeSetReferenceConstructor","repos","useRestClient","repoManagerDatabaseFromApp","app","authProvider","dbUrl","databaseURL","projectId","isEmulator","dbEmulatorHost","authTokenProvider","repoManagerCreateRepo","appRepos","Database","_repoInternal","_instanceStarted","_rootInternal","_delete","repoManagerDeleteRepo","appName","apiName","checkTransportInit","forceWebSockets","forceDisallow","forceLongPolling","forceAllow","getDatabase","getApp","_getProvider","identifier","emulator","connectDatabaseEmulator","tokenProvider","mockUserToken","createMockUserToken","uid","project","iat","sub","user_id","iss","aud","exp","auth_time","firebase","sign_in_provider","identities","alg","repoManagerApplyEmulatorSettings","goOffline","goOnline","repoResume","enableLoggingImpl","SERVER_TIMESTAMP","serverTimestamp","increment","TransactionResult","committed","runTransaction","transactionUpdate","repoStartTransaction","currentState","queueNode","priorityForNode","simpleListen","echo","onEcho","hijackHash","newHash","oldPut","forceRestClient","repoManagerForceRestClient","registerDatabase","variant","_registerComponent","instanceIdentifier","getProvider","registerVersion"],"mappings":"kHAqBa,MAAAA,GAQC,EARDA,EAaE,oBCZFC,OAAS,SAAUC,EAAoBC,GAClD,IAAKD,EACH,MAAME,eAAeD,IAOZC,eAAiB,SAAUD,GACtC,OAAO,IAAIE,MACT,sBACEL,EACA,6BACAG,ICnBAG,oBAAoB,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,MAAMrB,MAAM,iDAGdgB,KAAKS,QAEL,MAAMC,EAAgBJ,EAClBN,KAAKJ,sBACLI,KAAKN,eAEHiB,EAAS,GAEf,IAAK,IAAItB,EAAI,EAAGA,EAAIgB,EAAMf,OAAQD,GAAK,EAAG,CACxC,MAAMuB,EAAQP,EAAMhB,GACdwB,EAAYxB,EAAI,EAAIgB,EAAMf,OAC1BwB,EAAQD,EAAYR,EAAMhB,EAAI,GAAK,EACnC0B,EAAY1B,EAAI,EAAIgB,EAAMf,OAC1B0B,EAAQD,EAAYV,EAAMhB,EAAI,GAAK,EAEnC4B,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,aAAalB,EAAeC,GAG1B,OAAIN,KAAKE,qBAAuBI,EACvBkB,KAAKnB,GAEPL,KAAKI,gBAAgBnB,oBAAkBoB,GAAQC,IAWxDmB,aAAapB,EAAeC,GAG1B,OAAIN,KAAKE,qBAAuBI,EACvBH,KAAKE,GA3LQ,SAAUqB,GAElC,MAAMvC,EAAgB,GACtB,IAAIwC,EAAM,EACRpC,EAAI,EACN,KAAOoC,EAAMD,EAAMpC,QAAQ,CACzB,MAAMsC,EAAKF,EAAMC,KACjB,GAAIC,EAAK,IACPzC,EAAII,KAAOsC,OAAOC,aAAaF,QAC1B,GAAIA,EAAK,KAAOA,EAAK,IAAK,CAC/B,MAAMG,EAAKL,EAAMC,KACjBxC,EAAII,KAAOsC,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,MACFxC,EAAII,KAAOsC,OAAOC,aAAa,OAAUE,GAAK,KAC9C7C,EAAII,KAAOsC,OAAOC,aAAa,OAAc,KAAJE,QACpC,CACL,MAAMD,EAAKL,EAAMC,KACXM,EAAKP,EAAMC,KACjBxC,EAAII,KAAOsC,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,IAI9C,OAAO9C,EAAImC,KAAK,IA+JPY,CAAkBlC,KAAKmC,wBAAwB9B,EAAOC,KAkB/D6B,wBAAwB9B,EAAeC,GACrCN,KAAKS,QAEL,MAAM2B,EAAgB9B,EAClBN,KAAKH,sBACLG,KAAKL,eAEHgB,EAAmB,GAEzB,IAAK,IAAItB,EAAI,EAAGA,EAAIgB,EAAMf,QAAU,CAClC,MAAMsB,EAAQwB,EAAc/B,EAAMgC,OAAOhD,MAGnCyB,EADYzB,EAAIgB,EAAMf,OACF8C,EAAc/B,EAAMgC,OAAOhD,IAAM,IACzDA,EAEF,MACM2B,EADY3B,EAAIgB,EAAMf,OACF8C,EAAc/B,EAAMgC,OAAOhD,IAAM,KACzDA,EAEF,MACMiD,EADYjD,EAAIgB,EAAMf,OACF8C,EAAc/B,EAAMgC,OAAOhD,IAAM,GAG3D,KAFEA,EAEW,MAATuB,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATsB,EACrD,MAAM,IAAIC,wBAGZ,MAAMtB,EAAYL,GAAS,EAAME,GAAS,EAG1C,GAFAH,EAAOU,KAAKJ,GAEE,KAAVD,EAAc,CAChB,MAAME,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGnD,GAFAL,EAAOU,KAAKH,GAEE,KAAVoB,EAAc,CAChB,MAAMnB,EAAaH,GAAS,EAAK,IAAQsB,EACzC3B,EAAOU,KAAKF,KAKlB,OAAOR,GAQTF,QACE,IAAKT,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,aAAasC,OAAOhD,GAClDW,KAAKL,eAAeK,KAAKN,eAAeL,IAAMA,EAC9CW,KAAKJ,sBAAsBP,GAAKW,KAAKC,qBAAqBoC,OAAOhD,GACjEW,KAAKH,sBAAsBG,KAAKJ,sBAAsBP,IAAMA,EAGxDA,GAAKW,KAAKF,kBAAkBR,SAC9BU,KAAKL,eAAeK,KAAKC,qBAAqBoC,OAAOhD,IAAMA,EAC3DW,KAAKH,sBAAsBG,KAAKD,aAAasC,OAAOhD,IAAMA,MAU9D,MAAOkD,gCAAgCvD,MAA7CwD,kCACWxC,KAAIyC,KAAG,2BAMX,MAAMC,aAAe,SAAUxD,GACpC,MAAMyD,EAAY1D,oBAAkBC,GACpC,OAAOO,EAAOW,gBAAgBuC,GAAW,IAO9BC,8BAAgC,SAAU1D,GAErD,OAAOwD,aAAaxD,GAAK2D,QAAQ,MAAO,KAY7BC,aAAe,SAAU5D,GACpC,IACE,OAAOO,EAAOgC,aAAavC,GAAK,GAChC,MAAO6D,GACPC,QAAQC,MAAM,wBAAyBF,GAEzC,OAAO,MClWH,SAAUG,SAAYC,GAC1B,OAAOC,gBAAWC,EAAWF,GAiBf,SAAAC,WAAWE,EAAiBC,GAC1C,KAAMA,aAAkBC,QACtB,OAAOD,EAGT,OAAQA,EAAOf,aACb,KAAKiB,KAIH,OAAO,IAAIA,KADOF,EACQG,WAE5B,KAAKF,YACYH,IAAXC,IACFA,EAAS,IAEX,MACF,KAAK/C,MAEH+C,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,MAAMI,KAAQJ,EAEZA,EAAOK,eAAeD,IAad,cAbmCA,IAG/CL,EAAmCK,GAAQP,WACzCE,EAAmCK,GACnCJ,EAAmCI,KAIxC,OAAOL,ECrBT,MAAMO,sBAAwB,ICjCd,SAAAC,YACd,GAAoB,oBAATC,KACT,OAAOA,KAET,GAAsB,oBAAXC,OACT,OAAOA,OAET,GAAsB,oBAAXC,OACT,OAAOA,OAET,MAAM,IAAIjF,MAAM,mCDwBhB8E,GAAYI,sBA2CDC,YAAc,KACzB,IACE,OACEN,yBApC6B,MACjC,GAAuB,oBAAZO,cAAkD,IAAhBA,QAAQC,IACnD,OAEF,MAAMC,EAAqBF,QAAQC,IAAIH,sBACvC,OAAII,EACKC,KAAKC,MAAMF,QADpB,GAgCIG,IA3BwB,MAC5B,GAAwB,oBAAbC,SACT,OAEF,IAAIC,EACJ,IACEA,EAAQD,SAASE,OAAOD,MAAM,iCAC9B,MAAO5B,GAGP,OAEF,MAAM8B,EAAUF,GAAS7B,aAAa6B,EAAM,IAC5C,OAAOE,GAAWN,KAAKC,MAAMK,IAezBC,GAEF,MAAO/B,GAQP,YADAC,QAAQ+B,KAAK,+CAA+ChC,OAqBnDiC,kCACXC,IAEA,MAAMC,EAb8B,CACpCD,IACuB,IAAAE,EAAAC,EAAA,OAA4B,QAA5BA,EAAe,QAAfD,EAAAhB,qBAAe,IAAAgB,OAAA,EAAAA,EAAAE,qBAAa,IAAAD,OAAA,EAAAA,EAAGH,IAWzCK,CAAuBL,GACpC,IAAKC,EACH,OAEF,MAAMK,EAAiBL,EAAKM,YAAY,KACxC,GAAID,GAAkB,GAAKA,EAAiB,IAAML,EAAK5F,OACrD,MAAM,IAAIN,MAAM,gBAAgBkG,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,IEtIlC,MAAAG,SAIXpD,cAFAxC,KAAA6F,OAAoC,OACpC7F,KAAA8F,QAAqC,OAEnC9F,KAAK+F,QAAU,IAAIC,SAAQ,CAACF,EAASD,KACnC7F,KAAK8F,QAAUA,EACf9F,KAAK6F,OAASA,KASlBI,aACEC,GAEA,MAAO,CAACjD,EAAOE,KACTF,EACFjD,KAAK6F,OAAO5C,GAEZjD,KAAK8F,QAAQ3C,GAES,mBAAb+C,IAGTlG,KAAK+F,QAAQI,OAAM,SAIK,IAApBD,EAAS5G,OACX4G,EAASjD,GAETiD,EAASjD,EAAOE,MCVV,SAAAiD,kBACd,MACoB,oBAAXpC,WAGJA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDqC,KAxBxC,SAAAC,QACd,MACuB,oBAAdC,WAC2B,iBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,GAiBkDD,IAoF7C,SAAAE,YACd,OAAkE,IAAzB7H,EC9GrC,SAAU8H,SAASvH,GACvB,OAAOqF,KAAKC,MAAMtF,GAQd,SAAUwH,UAAUC,GACxB,OAAOpC,KAAKmC,UAAUC,GCKjB,MAAMC,OAAS,SAAUC,GAC9B,IAAIC,EAAS,GACXC,EAAiB,GACjBJ,EAAO,GACPK,EAAY,GAEd,IACE,MAAMC,EAAQJ,EAAMK,MAAM,KAC1BJ,EAASL,SAAS3D,aAAamE,EAAM,KAAO,IAC5CF,EAASN,SAAS3D,aAAamE,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBN,EAAOI,EAAU,GAAK,UACfA,EAAU,EACjB,MAAOhE,IAET,MAAO,CACL+D,OAAAA,EACAC,OAAAA,EACAJ,KAAAA,EACAK,UAAAA,ICxCY,SAAAG,SAA2BC,EAAQC,GACjD,OAAO7D,OAAO8D,UAAU1D,eAAe2D,KAAKH,EAAKC,GAGnC,SAAAG,QACdJ,EACAC,GAEA,OAAI7D,OAAO8D,UAAU1D,eAAe2D,KAAKH,EAAKC,GACrCD,EAAIC,QAEX,EAIE,SAAUI,QAAQL,GACtB,IAAK,MAAMC,KAAOD,EAChB,GAAI5D,OAAO8D,UAAU1D,eAAe2D,KAAKH,EAAKC,GAC5C,OAAO,EAGX,OAAO,EAGO,SAAAK,IACdN,EACAO,EACAC,GAEA,MAAMC,EAAkC,GACxC,IAAK,MAAMR,KAAOD,EACZ5D,OAAO8D,UAAU1D,eAAe2D,KAAKH,EAAKC,KAC5CQ,EAAIR,GAAOM,EAAGJ,KAAKK,EAAYR,EAAIC,GAAMA,EAAKD,IAGlD,OAAOS,ECXI,MAAAC,KAuCXtF,cAjCQxC,KAAM+H,OAAa,GAMnB/H,KAAIgI,KAAa,GAOjBhI,KAAEiI,GAAa,GAMfjI,KAAIkI,KAAa,GAKjBlI,KAAMmI,OAAW,EAKjBnI,KAAMoI,OAAW,EAKvBpI,KAAKqI,UAAY,GAEjBrI,KAAKkI,KAAK,GAAK,IACf,IAAK,IAAI7I,EAAI,EAAGA,EAAIW,KAAKqI,YAAahJ,EACpCW,KAAKkI,KAAK7I,GAAK,EAGjBW,KAAKsI,QAGPA,QACEtI,KAAK+H,OAAO,GAAK,WACjB/H,KAAK+H,OAAO,GAAK,WACjB/H,KAAK+H,OAAO,GAAK,WACjB/H,KAAK+H,OAAO,GAAK,UACjB/H,KAAK+H,OAAO,GAAK,WAEjB/H,KAAKmI,OAAS,EACdnI,KAAKoI,OAAS,EAShBG,UAAUC,EAAqCC,GACxCA,IACHA,EAAS,GAGX,MAAMC,EAAI1I,KAAKiI,GAGf,GAAmB,iBAARO,EACT,IAAK,IAAInJ,EAAI,EAAGA,EAAI,GAAIA,IAStBqJ,EAAErJ,GACCmJ,EAAIhJ,WAAWiJ,IAAW,GAC1BD,EAAIhJ,WAAWiJ,EAAS,IAAM,GAC9BD,EAAIhJ,WAAWiJ,EAAS,IAAM,EAC/BD,EAAIhJ,WAAWiJ,EAAS,GAC1BA,GAAU,OAGZ,IAAK,IAAIpJ,EAAI,EAAGA,EAAI,GAAIA,IACtBqJ,EAAErJ,GACCmJ,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAAK,IAAIpJ,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,MAAMsJ,EAAID,EAAErJ,EAAI,GAAKqJ,EAAErJ,EAAI,GAAKqJ,EAAErJ,EAAI,IAAMqJ,EAAErJ,EAAI,IAClDqJ,EAAErJ,GAA+B,YAAxBsJ,GAAK,EAAMA,IAAM,IAG5B,IAKIC,EAAGC,EALHC,EAAI9I,KAAK+H,OAAO,GAChBgB,EAAI/I,KAAK+H,OAAO,GAChBxI,EAAIS,KAAK+H,OAAO,GAChBiB,EAAIhJ,KAAK+H,OAAO,GAChBhF,EAAI/C,KAAK+H,OAAO,GAIpB,IAAK,IAAI1I,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACvBA,EAAI,GACFA,EAAI,IACNuJ,EAAII,EAAKD,GAAKxJ,EAAIyJ,GAClBH,EAAI,aAEJD,EAAIG,EAAIxJ,EAAIyJ,EACZH,EAAI,YAGFxJ,EAAI,IACNuJ,EAAKG,EAAIxJ,EAAMyJ,GAAKD,EAAIxJ,GACxBsJ,EAAI,aAEJD,EAAIG,EAAIxJ,EAAIyJ,EACZH,EAAI,YAIR,MAAMF,GAAOG,GAAK,EAAMA,IAAM,IAAOF,EAAI7F,EAAI8F,EAAIH,EAAErJ,GAAM,WACzD0D,EAAIiG,EACJA,EAAIzJ,EACJA,EAA8B,YAAxBwJ,GAAK,GAAOA,IAAM,GACxBA,EAAID,EACJA,EAAIH,EAGN3I,KAAK+H,OAAO,GAAM/H,KAAK+H,OAAO,GAAKe,EAAK,WACxC9I,KAAK+H,OAAO,GAAM/H,KAAK+H,OAAO,GAAKgB,EAAK,WACxC/I,KAAK+H,OAAO,GAAM/H,KAAK+H,OAAO,GAAKxI,EAAK,WACxCS,KAAK+H,OAAO,GAAM/H,KAAK+H,OAAO,GAAKiB,EAAK,WACxChJ,KAAK+H,OAAO,GAAM/H,KAAK+H,OAAO,GAAKhF,EAAK,WAG1CkG,OAAOvH,EAAwCpC,GAE7C,GAAa,MAAToC,EACF,YAGa2B,IAAX/D,IACFA,EAASoC,EAAMpC,QAGjB,MAAM4J,EAAmB5J,EAASU,KAAKqI,UACvC,IAAIc,EAAI,EAER,MAAMX,EAAMxI,KAAKgI,KACjB,IAAIoB,EAAQpJ,KAAKmI,OAGjB,KAAOgB,EAAI7J,GAAQ,CAKjB,GAAc,IAAV8J,EACF,KAAOD,GAAKD,GACVlJ,KAAKuI,UAAU7G,EAAOyH,GACtBA,GAAKnJ,KAAKqI,UAId,GAAqB,iBAAV3G,GACT,KAAOyH,EAAI7J,GAIT,GAHAkJ,EAAIY,GAAS1H,EAAMlC,WAAW2J,KAC5BC,IACAD,EACEC,IAAUpJ,KAAKqI,UAAW,CAC5BrI,KAAKuI,UAAUC,GACfY,EAAQ,EAER,YAIJ,KAAOD,EAAI7J,GAIT,GAHAkJ,EAAIY,GAAS1H,EAAMyH,KACjBC,IACAD,EACEC,IAAUpJ,KAAKqI,UAAW,CAC5BrI,KAAKuI,UAAUC,GACfY,EAAQ,EAER,OAMRpJ,KAAKmI,OAASiB,EACdpJ,KAAKoI,QAAU9I,EAIjB+J,SACE,MAAMA,EAAmB,GACzB,IAAIC,EAA0B,EAAdtJ,KAAKoI,OAGjBpI,KAAKmI,OAAS,GAChBnI,KAAKiJ,OAAOjJ,KAAKkI,KAAM,GAAKlI,KAAKmI,QAEjCnI,KAAKiJ,OAAOjJ,KAAKkI,KAAMlI,KAAKqI,WAAarI,KAAKmI,OAAS,KAIzD,IAAK,IAAI9I,EAAIW,KAAKqI,UAAY,EAAGhJ,GAAK,GAAIA,IACxCW,KAAKgI,KAAK3I,GAAiB,IAAZiK,EACfA,GAAa,IAGftJ,KAAKuI,UAAUvI,KAAKgI,MAEpB,IAAImB,EAAI,EACR,IAAK,IAAI9J,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIkK,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BF,EAAOF,GAAMnJ,KAAK+H,OAAO1I,IAAMkK,EAAK,MAClCJ,EAGN,OAAOE,GC7NK,SAAAG,YAAYC,EAAgBC,GAC1C,MAAO,GAAGD,aAAkBC,cCzBvB,MAuCMC,aAAe,SAAUzK,GACpC,IAAIE,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,MAAME,EAAIL,EAAIM,WAAWH,GACrBE,EAAI,IACNH,IACSG,EAAI,KACbH,GAAK,EACIG,GAAK,OAAUA,GAAK,OAE7BH,GAAK,EACLC,KAEAD,GAAK,EAGT,OAAOA,GCpEH,SAAUwK,mBACdC,GAEA,OAAIA,GAAYA,EAA+BC,UACrCD,EAA+BC,UAEhCD,ECCE,MAAAE,UAiBXvH,YACWC,EACAuH,EACAC,GAFAjK,KAAIyC,KAAJA,EACAzC,KAAegK,gBAAfA,EACAhK,KAAIiK,KAAJA,EAnBXjK,KAAiBkK,mBAAG,EAIpBlK,KAAYmK,aAAe,GAE3BnK,KAAAoK,kBAA2C,OAE3CpK,KAAiBqK,kBAAwC,KAczDC,qBAAqBC,GAEnB,OADAvK,KAAKoK,kBAAoBG,EAClBvK,KAGTwK,qBAAqBN,GAEnB,OADAlK,KAAKkK,kBAAoBA,EAClBlK,KAGTyK,gBAAgBC,GAEd,OADA1K,KAAKmK,aAAeO,EACb1K,KAGT2K,2BAA2BzE,GAEzB,OADAlG,KAAKqK,kBAAoBnE,EAClBlG,UCdC4K,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,QACpBlG,KAAQ6F,EAASM,KACjBC,KAAQP,EAASQ,KACjBnI,MAAS2H,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,kBAAgC,CAACC,EAAUC,KAAYC,KAC3D,GAAID,EAAUD,EAASG,SACrB,OAEF,MAAMC,GAAM,IAAItI,MAAOuI,cACjBC,EAASR,EAAcG,GAC7B,IAAIK,EAMF,MAAM,IAAIjN,MACR,8DAA8D4M,MANhE5I,QAAQiJ,GACN,IAAIF,OAASJ,EAASlJ,WACnBoJ,iCClGF,IAAIK,EAAc,GAMnB,SAAUC,cAAcC,GAC5BF,EAAcE,ECGH,MAAAC,kBAOX7J,YAAoB8J,GAAAtM,KAAWsM,YAAXA,EALZtM,KAAOuM,QAAG,YAWlBC,IAAInF,EAAalE,GACF,MAATA,EACFnD,KAAKsM,YAAYG,WAAWzM,KAAK0M,cAAcrF,IAE/CrH,KAAKsM,YAAYK,QAAQ3M,KAAK0M,cAAcrF,GAAMX,UAAUvD,IAOhEyJ,IAAIvF,GACF,MAAMwF,EAAY7M,KAAKsM,YAAYQ,QAAQ9M,KAAK0M,cAAcrF,IAC9D,OAAiB,MAAbwF,EACK,KAEApG,SAASoG,GAIpBE,OAAO1F,GACLrH,KAAKsM,YAAYG,WAAWzM,KAAK0M,cAAcrF,IAKjDqF,cAAcjK,GACZ,OAAOzC,KAAKuM,QAAU9J,EAGxBuK,WACE,OAAOhN,KAAKsM,YAAYU,YCjDf,MAAAC,cAAbzK,cACUxC,KAAMkN,OAA6B,GAqB3ClN,KAAiBmN,mBAAG,EAnBpBX,IAAInF,EAAalE,GACF,MAATA,SACKnD,KAAKkN,OAAO7F,GAEnBrH,KAAKkN,OAAO7F,GAAOlE,EAIvByJ,IAAIvF,GACF,OAAIF,SAASnH,KAAKkN,OAAQ7F,GACjBrH,KAAKkN,OAAO7F,GAEd,KAGT0F,OAAO1F,UACErH,KAAKkN,OAAO7F,ICXvB,MAAM+F,iBAAmB,SACvBC,GAEA,IAGE,GACoB,oBAAXrJ,aAC2B,IAA3BA,OAAOqJ,GACd,CAEA,MAAMC,EAAatJ,OAAOqJ,GAG1B,OAFAC,EAAWX,QAAQ,oBAAqB,SACxCW,EAAWb,WAAW,qBACf,IAAIJ,kBAAkBiB,IAE/B,MAAOvK,IAIT,OAAO,IAAIkK,eAIAM,EAAoBH,iBAAiB,gBAGrCI,EAAiBJ,iBAAiB,kBCxBzCK,EAAY,IL2FL,MAAAC,OAOXlL,YAAmBC,GAAAzC,KAAIyC,KAAJA,EAUXzC,KAAS2N,UAAGnC,EAsBZxL,KAAW4N,YAAelC,kBAc1B1L,KAAe6N,gBAAsB,KAlCzC/B,eACF,OAAO9L,KAAK2N,UAGV7B,aAASgC,GACX,KAAMA,KAAOlD,GACX,MAAM,IAAImD,UAAU,kBAAkBD,+BAExC9N,KAAK2N,UAAYG,EAInBE,YAAYF,GACV9N,KAAK2N,UAA2B,iBAARG,EAAmBjD,EAAkBiD,GAAOA,EAQlEG,iBACF,OAAOjO,KAAK4N,YAEVK,eAAWH,GACb,GAAmB,mBAARA,EACT,MAAM,IAAIC,UAAU,qDAEtB/N,KAAK4N,YAAcE,EAOjBI,qBACF,OAAOlO,KAAK6N,gBAEVK,mBAAeJ,GACjB9N,KAAK6N,gBAAkBC,EAOzBhD,SAASe,GACP7L,KAAK6N,iBAAmB7N,KAAK6N,gBAAgB7N,KAAM4K,EAASG,SAAUc,GACtE7L,KAAK4N,YAAY5N,KAAM4K,EAASG,SAAUc,GAE5CsC,OAAOtC,GACL7L,KAAK6N,iBACH7N,KAAK6N,gBAAgB7N,KAAM4K,EAASK,WAAYY,GAClD7L,KAAK4N,YAAY5N,KAAM4K,EAASK,WAAYY,GAE9C9G,QAAQ8G,GACN7L,KAAK6N,iBAAmB7N,KAAK6N,gBAAgB7N,KAAM4K,EAASM,QAASW,GACrE7L,KAAK4N,YAAY5N,KAAM4K,EAASM,QAASW,GAE3CV,QAAQU,GACN7L,KAAK6N,iBAAmB7N,KAAK6N,gBAAgB7N,KAAM4K,EAASQ,QAASS,GACrE7L,KAAK4N,YAAY5N,KAAM4K,EAASQ,QAASS,GAE3C5I,SAAS4I,GACP7L,KAAK6N,iBAAmB7N,KAAK6N,gBAAgB7N,KAAM4K,EAASS,SAAUQ,GACtE7L,KAAK4N,YAAY5N,KAAM4K,EAASS,SAAUQ,KK/KjB,sBAKhBuC,EAA8B,WACzC,IAAIC,EAAK,EACT,OAAO,WACL,OAAOA,KAHgC,GAY9BC,KAAO,SAAUpP,GAC5B,MAAMyD,ERlByB,SAAUzD,GACzC,MAAMC,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,IAAIE,EAAIL,EAAIM,WAAWH,GAGvB,GAAIE,GAAK,OAAUA,GAAK,MAAQ,CAC9B,MAAMgP,EAAOhP,EAAI,MACjBF,IACAT,OAAOS,EAAIH,EAAII,OAAQ,2CAEvBC,EAAI,OAAWgP,GAAQ,KADXrP,EAAIM,WAAWH,GAAK,OAI9BE,EAAI,IACNJ,EAAIC,KAAOG,EACFA,EAAI,MACbJ,EAAIC,KAAQG,GAAK,EAAK,IACtBJ,EAAIC,KAAY,GAAJG,EAAU,KACbA,EAAI,OACbJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,MAEtBJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,GAAM,GAAM,IAC9BJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,KAG1B,OAAOJ,EQbWF,CAAkBC,GAC9BoP,EAAO,IAAIxG,KACjBwG,EAAKrF,OAAOtG,GACZ,MAAM6L,EAAYF,EAAKjF,SACvB,OAAO5J,EAAOW,gBAAgBoO,IAG1BC,iBAAmB,YAAaC,GACpC,IAAI5P,EAAU,GACd,IAAK,IAAIO,EAAI,EAAGA,EAAIqP,EAAQpP,OAAQD,IAAK,CACvC,MAAMsP,EAAMD,EAAQrP,GAElBkB,MAAMC,QAAQmO,IACbA,GACgB,iBAARA,GAEwB,iBAAvBA,EAAYrP,OAEtBR,GAAW2P,iBAAiBG,MAAM,KAAMD,GAExC7P,GADwB,iBAAR6P,EACLjI,UAAUiI,GAEVA,EAEb7P,GAAW,IAGb,OAAOA,GAMF,IAAI+P,EAAuC,KAK9CC,GAAY,EAOT,MAAMC,gBAAgB,SAC3BC,EACAC,GAEArQ,QACGqQ,IAA0B,IAAZD,IAAgC,IAAZA,EACnC,+CAEc,IAAZA,GACFvB,EAAU3B,SAAWlB,EAASK,QAC9B4D,EAASpB,EAAUU,IAAIe,KAAKzB,GACxBwB,GACFzB,EAAehB,IAAI,mBAAmB,IAEZ,mBAAZwC,EAChBH,EAASG,GAETH,EAAS,KACTrB,EAAeT,OAAO,qBAIboB,IAAM,YAAaO,GAQ9B,IAPkB,IAAdI,IACFA,GAAY,EACG,OAAXD,IAA6D,IAA1CrB,EAAeZ,IAAI,oBACxCmC,iBAAc,IAIdF,EAAQ,CACV,MAAM/P,EAAU2P,iBAAiBG,MAAM,KAAMF,GAC7CG,EAAO/P,KAIEqQ,WAAa,SACxBC,GAEA,OAAO,YAAaV,GAClBP,IAAIiB,KAAWV,KAINzL,MAAQ,YAAayL,GAChC,MAAM5P,EAAU,4BAA8B2P,oBAAoBC,GAClEjB,EAAUxK,MAAMnE,IAGLuQ,MAAQ,YAAaX,GAChC,MAAM5P,EAAU,yBAAyB2P,oBAAoBC,KAE7D,MADAjB,EAAUxK,MAAMnE,GACV,IAAIE,MAAMF,IAGLqM,KAAO,YAAauD,GAC/B,MAAM5P,EAAU,qBAAuB2P,oBAAoBC,GAC3DjB,EAAUtC,KAAKrM,IAiCJwQ,oBAAsB,SAAU3I,GAC3C,MACkB,iBAATA,IACNA,GAASA,GACRA,IAAS4I,OAAOC,mBAChB7I,IAAS4I,OAAOE,oBAmDTC,EAAW,aAKXC,EAAW,aAKXC,YAAc,SAAU9G,EAAWC,GAC9C,GAAID,IAAMC,EACR,OAAO,EACF,GAAID,IAAM4G,GAAY3G,IAAM4G,EACjC,OAAQ,EACH,GAAI5G,IAAM2G,GAAY5G,IAAM6G,EACjC,OAAO,EACF,CACL,MAAME,EAASC,YAAYhH,GACzBiH,EAASD,YAAY/G,GAEvB,OAAe,OAAX8G,EACa,OAAXE,EACKF,EAASE,GAAW,EAAIjH,EAAExJ,OAASyJ,EAAEzJ,OAASuQ,EAASE,GAEtD,EAEU,OAAXA,EACF,EAEAjH,EAAIC,GAAK,EAAI,IAQbiH,cAAgB,SAAUlH,EAAWC,GAChD,OAAID,IAAMC,EACD,EACED,EAAIC,GACL,EAED,GAIEkH,WAAa,SACxB5I,EACAD,GAEA,GAAIA,GAAOC,KAAOD,EAChB,OAAOA,EAAIC,GAEX,MAAM,IAAIrI,MACR,yBAA2BqI,EAAM,gBAAkBX,UAAUU,KAKtD8I,kBAAoB,SAAU9I,GACzC,GAAmB,iBAARA,GAA4B,OAARA,EAC7B,OAAOV,UAAUU,GAGnB,MAAM+I,EAAO,GAEb,IAAK,MAAMtH,KAAKzB,EACd+I,EAAK9O,KAAKwH,GAIZsH,EAAKC,OACL,IAAI/I,EAAM,IACV,IAAK,IAAIhI,EAAI,EAAGA,EAAI8Q,EAAK7Q,OAAQD,IACrB,IAANA,IACFgI,GAAO,KAETA,GAAOX,UAAUyJ,EAAK9Q,IACtBgI,GAAO,IACPA,GAAO6I,kBAAkB9I,EAAI+I,EAAK9Q,KAIpC,OADAgI,GAAO,IACAA,GASIgJ,kBAAoB,SAC/BnR,EACAoR,GAEA,MAAMC,EAAMrR,EAAII,OAEhB,GAAIiR,GAAOD,EACT,MAAO,CAACpR,GAGV,MAAMsR,EAAW,GACjB,IAAK,IAAIjR,EAAI,EAAGA,EAAIgR,EAAKhR,GAAK+Q,EACxB/Q,EAAI+Q,EAAUC,EAChBC,EAASnP,KAAKnC,EAAIyG,UAAUpG,EAAGgR,IAE/BC,EAASnP,KAAKnC,EAAIyG,UAAUpG,EAAGA,EAAI+Q,IAGvC,OAAOE,GASO,SAAAC,KAAKrJ,EAAaO,GAChC,IAAK,MAAMN,KAAOD,EACZA,EAAIxD,eAAeyD,IACrBM,EAAGN,EAAKD,EAAIC,IAyBX,MAAMqJ,sBAAwB,SAAUC,GAC7C/R,QAAQ0Q,oBAAoBqB,GAAI,uBAEhC,MAEMC,EAAO,KACb,IAAIC,EAAG9N,EAAG6F,EAAGkI,EAAIzR,EAIP,IAANsR,GACF5N,EAAI,EACJ6F,EAAI,EACJiI,EAAI,EAAIF,IAAOI,EAAAA,EAAW,EAAI,IAE9BF,EAAIF,EAAI,GACRA,EAAIK,KAAKC,IAAIN,KAEJK,KAAKE,IAAI,GAAG,OAEnBJ,EAAKE,KAAKG,IAAIH,KAAKI,MAAMJ,KAAK7C,IAAIwC,GAAKK,KAAKK,KAAMT,GAClD7N,EAAI+N,EAAKF,EACThI,EAAIoI,KAAKM,MAAMX,EAAIK,KAAKE,IAAI,EAlBtB,GAkBiCJ,GAAME,KAAKE,IAAI,EAlBhD,OAqBNnO,EAAI,EACJ6F,EAAIoI,KAAKM,MAAMX,EAAIK,KAAKE,IAAI,GAAG,SAKnC,MAAMK,EAAO,GACb,IAAKlS,EA5BK,GA4BMA,EAAGA,GAAK,EACtBkS,EAAKlQ,KAAKuH,EAAI,EAAI,EAAI,GACtBA,EAAIoI,KAAKI,MAAMxI,EAAI,GAErB,IAAKvJ,EAjCS,GAiCEA,EAAGA,GAAK,EACtBkS,EAAKlQ,KAAK0B,EAAI,EAAI,EAAI,GACtBA,EAAIiO,KAAKI,MAAMrO,EAAI,GAErBwO,EAAKlQ,KAAKwP,EAAI,EAAI,GAClBU,EAAKC,UACL,MAAMtS,EAAMqS,EAAKjQ,KAAK,IAGtB,IAAImQ,EAAgB,GACpB,IAAKpS,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAIqS,EAAUhM,SAASxG,EAAIyS,OAAOtS,EAAG,GAAI,GAAG2N,SAAS,IAC9B,IAAnB0E,EAAQpS,SACVoS,EAAU,IAAMA,GAElBD,GAAgCC,EAElC,OAAOD,EAAcG,eAkDhB,MAAMC,EAAkB,IAAIC,OAAO,qBAe7BhC,YAAc,SAAU5Q,GACnC,GAAI2S,EAAgBxL,KAAKnH,GAAM,CAC7B,MAAM6S,EAASxC,OAAOrQ,GACtB,GAAI6S,IAbsB,YAaMA,GARN,WASxB,OAAOA,EAGX,OAAO,MAoBIC,eAAiB,SAAUrK,GACtC,IACEA,IACA,MAAO5E,GAEPkP,YAAW,KAKT,MAAMC,EAAQnP,EAAEmP,OAAS,GAEzB,MADA/G,KAAK,yCAA0C+G,GACzCnP,IACLiO,KAAKI,MAAM,MAiELe,sBAAwB,SACnCxK,EACAyK,GAEA,MAAMC,EAA2BJ,WAAWtK,EAAIyK,GAiBhD,MAdqB,iBAAZC,GAES,oBAATC,MAEPA,KAAiB,WAGjBA,KAAKC,WAAWF,GAEY,iBAAZA,GAAyBA,EAAuB,OAE/DA,EAAuB,QAGnBA,GC9lBI,MAAAG,sBAEXhQ,YACUiQ,EACAC,GADA1S,KAAQyS,SAARA,EACAzS,KAAgB0S,iBAAhBA,EAER1S,KAAK2S,SAAWD,MAAAA,OAAA,EAAAA,EAAkBE,aAAa,CAAEC,UAAU,IACtD7S,KAAK2S,UACRD,MAAAA,GAAAA,EAAkB9F,MAAMkG,MAAKH,GAAa3S,KAAK2S,SAAWA,IAI9DI,SAASC,GACP,OAAKhT,KAAK2S,SAeH3S,KAAK2S,SAASI,SAASC,GAdrB,IAAIhN,SAA6B,CAACF,EAASD,KAKhDoM,YAAW,KACLjS,KAAK2S,SACP3S,KAAK+S,SAASC,GAAcF,KAAKhN,EAASD,GAE1CC,EAAQ,QAET,MAMTmN,uBAAuBC,SACA,QAArB/N,EAAAnF,KAAK0S,wBAAgB,IAAAvN,GAAAA,EACjByH,MACDkG,MAAKH,GAAYA,EAASQ,iBAAiBD,KAGhDE,wBACEjI,KACE,oDAAoDnL,KAAKyS,0FCjClD,MAAAY,0BAGX7Q,YACUiQ,EACAa,EACAC,GAFAvT,KAAQyS,SAARA,EACAzS,KAAgBsT,iBAAhBA,EACAtT,KAAauT,cAAbA,EALFvT,KAAKwT,MAAgC,KAO3CxT,KAAKwT,MAAQD,EAAcX,aAAa,CAAEC,UAAU,IAC/C7S,KAAKwT,OACRD,EAAcE,QAAOC,GAAS1T,KAAKwT,MAAQE,IAI/CX,SAASC,GACP,OAAKhT,KAAKwT,MAgBHxT,KAAKwT,MAAMT,SAASC,GAAc7M,OAAMlD,GAGzCA,GAAwB,+BAAfA,EAAM0Q,MACjBxF,IAAI,kEACG,MAEAnI,QAAQH,OAAO5C,KAtBjB,IAAI+C,SAA+B,CAACF,EAASD,KAKlDoM,YAAW,KACLjS,KAAKwT,MACPxT,KAAK+S,SAASC,GAAcF,KAAKhN,EAASD,GAE1CC,EAAQ,QAET,MAgBTmN,uBAAuBC,GAGjBlT,KAAKwT,MACPxT,KAAKwT,MAAMI,qBAAqBV,GAEhClT,KAAKuT,cACF3G,MACAkG,MAAKY,GAAQA,EAAKE,qBAAqBV,KAI9CW,0BAA0BX,GACxBlT,KAAKuT,cACF3G,MACAkG,MAAKY,GAAQA,EAAKI,wBAAwBZ,KAG/CE,wBACE,IAAIW,EACF,0DACA/T,KAAKyS,SADL,iFAIE,eAAgBzS,KAAKsT,iBACvBS,GACE,uJAGO,mBAAoB/T,KAAKsT,iBAClCS,GACE,2JAIFA,GACE,kKAIJ5I,KAAK4I,IAKI,MAAAC,sBAIXxR,YAAoByR,GAAAjU,KAAWiU,YAAXA,EAEpBlB,SAASC,GACP,OAAOhN,QAAQF,QAAQ,CACrBmO,YAAajU,KAAKiU,cAItBhB,uBAAuBC,GAGrBA,EAASlT,KAAKiU,aAGhBJ,0BAA0BX,IAE1BE,0BAlBOY,sBAAKE,MAAG,QC7GV,MAYMC,EACX,6ECHW,MAAAC,SAaX5R,YACE0C,EACgBmP,EACAC,EACAC,EACAC,GAAqB,EACrBC,EAAyB,GACzBC,GAAyC,EACzCC,GAA2B,GAN3B3U,KAAMqU,OAANA,EACArU,KAASsU,UAATA,EACAtU,KAAauU,cAAbA,EACAvU,KAASwU,UAATA,EACAxU,KAAcyU,eAAdA,EACAzU,KAA6B0U,8BAA7BA,EACA1U,KAAe2U,gBAAfA,EAEhB3U,KAAK4U,MAAQ1P,EAAK0M,cAClB5R,KAAK6U,QAAU7U,KAAK4U,MAAMjD,OAAO3R,KAAK4U,MAAME,QAAQ,KAAO,GAC3D9U,KAAK+U,aACFxH,EAAkBX,IAAI,QAAU1H,IAAoBlF,KAAK4U,MAG9DI,kBACE,MAA0C,OAAnChV,KAAK+U,aAAapD,OAAO,EAAG,GAGrCsD,eACE,MACmB,mBAAjBjV,KAAK6U,SACY,wBAAjB7U,KAAK6U,QAIL3P,WACF,OAAOlF,KAAK4U,MAGV1P,SAAKgQ,GACHA,IAAYlV,KAAK+U,eACnB/U,KAAK+U,aAAeG,EAChBlV,KAAKgV,mBACPzH,EAAkBf,IAAI,QAAUxM,KAAK4U,MAAO5U,KAAK+U,eAKvD/H,WACE,IAAI9N,EAAMc,KAAKmV,cAIf,OAHInV,KAAKyU,iBACPvV,GAAO,IAAMc,KAAKyU,eAAiB,KAE9BvV,EAGTiW,cACE,MAAMC,EAAWpV,KAAKqU,OAAS,WAAa,UACtCgB,EAAQrV,KAAK0U,8BACf,OAAO1U,KAAKsU,YACZ,GACJ,MAAO,GAAGc,IAAWpV,KAAKkF,QAAQmQ,KAmBtB,SAAAC,sBACdC,EACAtL,EACAuL,GAKA,IAAIC,EACJ,GAJA7W,OAAuB,iBAATqL,EAAmB,8BACjCrL,OAAyB,iBAAX4W,EAAqB,gCDhFZ,cCmFnBvL,EACFwL,GACGF,EAASlB,OAAS,SAAW,SAAWkB,EAASR,aAAe,YAC9D,CAAA,GDpFmB,iBCoFf9K,EAMT,MAAM,IAAIjL,MAAM,4BAA8BiL,GAL9CwL,GACGF,EAASlB,OAAS,WAAa,WAChCkB,EAASR,aACT,SA/BN,SAASW,wBAAwBH,GAC/B,OACEA,EAASrQ,OAASqQ,EAASR,cAC3BQ,EAASN,gBACTM,EAASb,+BA+BPgB,CAAwBH,KAC1BC,EAAW,GAAID,EAASjB,WAG1B,MAAMqB,EAAkB,GAMxB,OAJAlF,KAAK+E,GAAQ,CAACnO,EAAalE,KACzBwS,EAAMtU,KAAKgG,EAAM,IAAMlE,MAGlBsS,EAAUE,EAAMrU,KAAK,KCxHjB,MAAAsU,gBAAbpT,cACUxC,KAAS6V,UAA4B,GAE7CC,iBAAiBrT,EAAcsT,EAAiB,GACzC5O,SAASnH,KAAK6V,UAAWpT,KAC5BzC,KAAK6V,UAAUpT,GAAQ,GAGzBzC,KAAK6V,UAAUpT,IAASsT,EAG1BnJ,MACE,OAAO1J,SAASlD,KAAK6V,YCbzB,MAAMG,EAAgD,GAChDC,EAAsC,GAEtC,SAAUC,0BAA0BX,GACxC,MAAMY,EAAaZ,EAASvI,WAM5B,OAJKgJ,EAAYG,KACfH,EAAYG,GAAc,IAAIP,iBAGzBI,EAAYG,GCRR,MAAAC,eASX5T,YAAoB6T,GAAArW,KAAUqW,WAAVA,EARpBrW,KAAgBsW,iBAAc,GAC9BtW,KAAkBuW,mBAAG,EACrBvW,KAAkBwW,oBAAI,EACtBxW,KAAOyW,QAAwB,KAO/BC,WAAWC,EAAqBzQ,GAC9BlG,KAAKwW,mBAAqBG,EAC1B3W,KAAKyW,QAAUvQ,EACXlG,KAAKwW,mBAAqBxW,KAAKuW,qBACjCvW,KAAKyW,UACLzW,KAAKyW,QAAU,MASnBG,eAAeC,EAAoBlQ,GAEjC,IADA3G,KAAKsW,iBAAiBO,GAAclQ,EAC7B3G,KAAKsW,iBAAiBtW,KAAKuW,qBAAqB,CACrD,MAAMO,EAAY9W,KAAKsW,iBACrBtW,KAAKuW,2BAEAvW,KAAKsW,iBAAiBtW,KAAKuW,oBAClC,IAAK,IAAIlX,EAAI,EAAGA,EAAIyX,EAAUxX,SAAUD,EAClCyX,EAAUzX,IACZ2S,gBAAe,KACbhS,KAAKqW,WAAWS,EAAUzX,OAIhC,GAAIW,KAAKuW,qBAAuBvW,KAAKwW,mBAAoB,CACnDxW,KAAKyW,UACPzW,KAAKyW,UACLzW,KAAKyW,QAAU,MAEjB,MAEFzW,KAAKuW,uBCeE,MAAAQ,sBA4BXvU,YACSwU,EACAzB,EACC0B,EACAC,EACAC,EACDC,EACAC,GANArX,KAAMgX,OAANA,EACAhX,KAAQuV,SAARA,EACCvV,KAAaiX,cAAbA,EACAjX,KAAakX,cAAbA,EACAlX,KAASmX,UAATA,EACDnX,KAAkBoX,mBAAlBA,EACApX,KAAaqX,cAAbA,EAlCTrX,KAASsX,UAAG,EACZtX,KAAauX,cAAG,EAURvX,KAAcwX,gBAAG,EAyBvBxX,KAAKyX,KAAOtI,WAAW6H,GACvBhX,KAAK0X,OAASxB,0BAA0BX,GACxCvV,KAAK2X,MAASnC,IAERxV,KAAKkX,gBACP1B,EAA4B,GAAIxV,KAAKkX,eAEhC5B,sBAAsBC,ELxFP,eKwF+BC,IAQzDoC,KAAKC,EAA8BC,GACjC9X,KAAK+X,cAAgB,EACrB/X,KAAKgY,cAAgBF,EACrB9X,KAAKiY,gBAAkB,IAAI7B,eAAeyB,GAC1C7X,KAAKkY,WAAY,EAEjBlY,KAAKmY,qBAAuBlG,YAAW,KACrCjS,KAAKyX,KAAK,gCAEVzX,KAAKoY,YACLpY,KAAKmY,qBAAuB,OAE3BnH,KAAKI,MArEe,MRqHQ,SAAUzJ,GAC3C,GAA2C,aAAxBjD,SAAS2T,WAC1B1Q,QACK,CAIL,IAAI2Q,GAAS,EACb,MAAMC,UAAY,WACX7T,SAAS8T,KAKTF,IACHA,GAAS,EACT3Q,KANAsK,WAAWsG,UAAWvH,KAAKI,MAAM,MAUjC1M,SAAS+T,kBACX/T,SAAS+T,iBAAiB,mBAAoBF,WAAW,GAEzDvU,OAAOyU,iBAAiB,OAAQF,WAAW,IAEjC7T,SAAiBgU,cAG1BhU,SAAiBgU,YAAY,sBAAsB,KACtB,aAAxBhU,SAAS2T,YACXE,eAKHvU,OAAe0U,YAAY,SAAUH,aQhFxCI,EAAoB,KAClB,GAAI3Y,KAAKkY,UACP,OAIFlY,KAAK4Y,gBAAkB,IAAIC,4BACzB,IAAIhN,KACF,MAAOiN,EAASC,EAAMC,EAAMC,EAAMC,GAAQrN,EAE1C,GADA7L,KAAKmZ,wBAAwBtN,GACxB7L,KAAK4Y,gBASV,GALI5Y,KAAKmY,uBACPiB,aAAapZ,KAAKmY,sBAClBnY,KAAKmY,qBAAuB,MAE9BnY,KAAKwX,gBAAiB,EAzHa,UA0H/BsB,EACF9Y,KAAKqO,GAAK0K,EACV/Y,KAAKqZ,SAAWL,MACX,CAAA,GA5H8B,UA4H1BF,EAgBT,MAAM,IAAI9Z,MAAM,kCAAoC8Z,GAdhDC,GAGF/Y,KAAK4Y,gBAAgBU,cAAe,EAIpCtZ,KAAKiY,gBAAgBvB,WAAWqC,GAAgB,KAC9C/Y,KAAKoY,gBAGPpY,KAAKoY,gBAMX,IAAIvM,KACF,MAAO0N,EAAI5S,GAAQkF,EACnB7L,KAAKmZ,wBAAwBtN,GAC7B7L,KAAKiY,gBAAgBrB,eAAe2C,EAAc5S,MAEpD,KACE3G,KAAKoY,cAEPpY,KAAK2X,OAKP,MAAM6B,EAA8C,CACpDA,MAA2C,KAC3CA,EAAwC,IAAIxI,KAAKI,MAC/B,IAAhBJ,KAAKyI,UAEHzZ,KAAK4Y,gBAAgBc,2BACvBF,EAA6C,GAC3CxZ,KAAK4Y,gBAAgBc,0BAEzBF,EAAuB,ELrMG,IKsMtBxZ,KAAKoX,qBACPoC,EAAiC,EAAIxZ,KAAKoX,oBAExCpX,KAAKqX,gBACPmC,EAA4B,GAAIxZ,KAAKqX,eAEnCrX,KAAKiX,gBACPuC,EAA8B,EAAIxZ,KAAKiX,eAErCjX,KAAKkX,gBACPsC,EAA+B,GAAIxZ,KAAKkX,eAGpB,oBAAbyC,UACPA,SAASC,UACTzF,EAAgB9N,KAAKsT,SAASC,YAE9BJ,EAAuB,EL/MN,KKiNnB,MAAMK,EAAa7Z,KAAK2X,MAAM6B,GAC9BxZ,KAAKyX,KAAK,+BAAiCoC,GAC3C7Z,KAAK4Y,gBAAgBkB,OAAOD,GAAY,YAS5CE,QACE/Z,KAAK4Y,gBAAgBoB,cAAcha,KAAKqO,GAAIrO,KAAKqZ,UACjDrZ,KAAKia,uBAAuBja,KAAKqO,GAAIrO,KAAKqZ,UAQ5Ca,oBACEnD,sBAAsBoD,aAAc,EAQtCD,uBACEnD,sBAAsBqD,gBAAiB,EAIzCF,qBAGS,QAAInD,sBAAsBoD,eAM5BpD,sBAAsBqD,gBACH,oBAAb1V,UACmB,MAA1BA,SAAS2V,eR8KK,iBAAXrW,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUqC,KAAKrC,OAAO2V,SAASW,OASR,iBAAZC,SAA8C,iBAAfA,QAAQC,IQhLrDC,yBAKQC,YACN1a,KAAKkY,WAAY,EAEblY,KAAK4Y,kBACP5Y,KAAK4Y,gBAAgB+B,QACrB3a,KAAK4Y,gBAAkB,MAIrB5Y,KAAK4a,iBACPlW,SAAS8T,KAAKqC,YAAY7a,KAAK4a,gBAC/B5a,KAAK4a,eAAiB,MAGpB5a,KAAKmY,uBACPiB,aAAapZ,KAAKmY,sBAClBnY,KAAKmY,qBAAuB,MAOxBC,YACDpY,KAAKkY,YACRlY,KAAKyX,KAAK,8BACVzX,KAAK0a,YAED1a,KAAKgY,gBACPhY,KAAKgY,cAAchY,KAAKwX,gBACxBxX,KAAKgY,cAAgB,OAS3B2C,QACO3a,KAAKkY,YACRlY,KAAKyX,KAAK,6BACVzX,KAAK0a,aASTI,KAAKnU,GACH,MAAMoU,EAAUrU,UAAUC,GAC1B3G,KAAKsX,WAAayD,EAAQzb,OAC1BU,KAAK0X,OAAO5B,iBAAiB,aAAciF,EAAQzb,QAGnD,MAAM0b,EAAatY,aAAaqY,GAI1BvK,EAAWH,kBAAkB2K,EAjSdC,MAqSrB,IAAK,IAAI5b,EAAI,EAAGA,EAAImR,EAASlR,OAAQD,IACnCW,KAAK4Y,gBAAgBsC,eACnBlb,KAAK+X,cACLvH,EAASlR,OACTkR,EAASnR,IAEXW,KAAK+X,gBASTkC,uBAAuB5L,EAAY8M,GAIjCnb,KAAK4a,eAAiBlW,SAAS2V,cAAc,UAC7C,MAAMb,EAAqC,CAC3CA,OAA2D,KAC3DA,EAAoC,GAAInL,EACxCmL,EAAoC,GAAI2B,EACxCnb,KAAK4a,eAAeQ,IAAMpb,KAAK2X,MAAM6B,GACrCxZ,KAAK4a,eAAeS,MAAMC,QAAU,OAEpC5W,SAAS8T,KAAK+C,YAAYvb,KAAK4a,gBAMzBzB,wBAAwBtN,GAE9B,MAAM0L,EAAgB7Q,UAAUmF,GAAMvM,OACtCU,KAAKuX,eAAiBA,EACtBvX,KAAK0X,OAAO5B,iBAAiB,iBAAkByB,IAYtC,MAAAsB,2BAiCXrW,YACEgZ,EACAC,EACO3D,EACAH,GADA3X,KAAY8X,aAAZA,EACA9X,KAAK2X,MAALA,EAlCT3X,KAAA0b,oBAAsB,IAAIC,IAG1B3b,KAAW4b,YAAmD,GAO9D5b,KAAA6b,cAAgB7K,KAAKI,MAAsB,IAAhBJ,KAAKyI,UAIhCzZ,KAAYsZ,cAAG,EAsBK,CAKhBtZ,KAAK0Z,yBAA2BtL,IAChCpK,OApZ2C,aAqZLhE,KAAK0Z,0BACvC8B,EACJxX,OAtZwC,UAsZAhE,KAAK0Z,0BAC3C+B,EAGFzb,KAAK8b,SAAWjD,2BAA2BkD,gBAG3C,IAAIC,EAAS,GAGb,GACEhc,KAAK8b,SAASV,KACwC,gBAAtDpb,KAAK8b,SAASV,IAAIzJ,OAAO,EAAG,cAAcrS,QAC1C,CAEA0c,EAAS,4BADatX,SAASuX,OACwB,eAEzD,MAAMC,EAAiB,eAAiBF,EAAS,iBACjD,IACEhc,KAAK8b,SAASK,IAAIvE,OAClB5X,KAAK8b,SAASK,IAAIC,MAAMF,GACxBlc,KAAK8b,SAASK,IAAIxB,QAClB,MAAO5X,GACPoL,IAAI,2BACApL,EAAEmP,OACJ/D,IAAIpL,EAAEmP,OAER/D,IAAIpL,KAYFmX,uBACN,MAAMmC,EAAS3X,SAAS2V,cAAc,UAItC,GAHAgC,EAAOhB,MAAMC,QAAU,QAGnB5W,SAAS8T,KAqBX,KAAM,oGApBN9T,SAAS8T,KAAK+C,YAAYc,GAC1B,IAIYA,EAAOC,cAAc5X,UAG7ByJ,IAAI,iCAEN,MAAOpL,GACP,MAAMkZ,EAASvX,SAASuX,OACxBI,EAAOjB,IACL,gEACAa,EACA,2BAmBN,OAVII,EAAOE,gBACTF,EAAOF,IAAME,EAAOE,gBACXF,EAAOC,cAChBD,EAAOF,IAAME,EAAOC,cAAc5X,SAExB2X,EAAe3X,WAEzB2X,EAAOF,IAAOE,EAAe3X,UAGxB2X,EAMT1B,QAEE3a,KAAKwc,OAAQ,EAETxc,KAAK8b,WAIP9b,KAAK8b,SAASK,IAAI3D,KAAKiE,YAAc,GACrCxK,YAAW,KACa,OAAlBjS,KAAK8b,WACPpX,SAAS8T,KAAKqC,YAAY7a,KAAK8b,UAC/B9b,KAAK8b,SAAW,QAEjB9K,KAAKI,MAAM,KAIhB,MAAM0G,EAAe9X,KAAK8X,aACtBA,IACF9X,KAAK8X,aAAe,KACpBA,KASJkC,cAAc3L,EAAY8M,GAMxB,IALAnb,KAAK0c,KAAOrO,EACZrO,KAAK2c,KAAOxB,EACZnb,KAAKwc,OAAQ,EAGNxc,KAAK4c,iBAUNA,cAIN,GACE5c,KAAKwc,OACLxc,KAAKsZ,cACLtZ,KAAK0b,oBAAoBmB,MAAQ7c,KAAK4b,YAAYtc,OAAS,EAAI,EAAI,GACnE,CAEAU,KAAK6b,gBACL,MAAMrC,EAA8C,GACpDA,EAAoC,GAAIxZ,KAAK0c,KAC7ClD,EAAoC,GAAIxZ,KAAK2c,KAC7CnD,EAAwC,IAAIxZ,KAAK6b,cACjD,IAAIiB,EAAS9c,KAAK2X,MAAM6B,GAEpBuD,EAAgB,GAChB1d,EAAI,EAER,KAAOW,KAAK4b,YAAYtc,OAAS,GAAG,CAGlC,KADgBU,KAAK4b,YAAY,GAEtB5S,EAAgB1J,OAliBX,GAoiBZyd,EAAczd,QAriBA,MA6jBhB,MAtBA,CAEA,MAAM0d,EAAShd,KAAK4b,YAAYqB,QAChCF,EACEA,EAAAA,OAGA1d,EACA,IACA2d,EAAOE,IALPH,MAQA1d,EACA,IACA2d,EAAOG,GAVPJ,KAaA1d,EACA,IACA2d,EAAOhU,EACT3J,KASJ,OAHAyd,GAAkBC,EAClB/c,KAAKod,gBAAgBN,EAAQ9c,KAAK6b,gBAE3B,EAEP,OAAO,EAUXX,eAAemC,EAAgBC,EAAmB3W,GAEhD3G,KAAK4b,YAAYva,KAAK,CAAE6b,IAAKG,EAAQF,GAAIG,EAAWtU,EAAGrC,IAInD3G,KAAKwc,OACPxc,KAAK4c,cASDQ,gBAAgBG,EAAaC,GAEnCxd,KAAK0b,oBAAoB+B,IAAID,GAE7B,MAAME,aAAe,KACnB1d,KAAK0b,oBAAoBiC,OAAOH,GAChCxd,KAAK4c,eAKDgB,EAAmB3L,WACvByL,aACA1M,KAAKI,MApmBwB,OA+mB/BpR,KAAK8Z,OAAOyD,GARS,KAEnBnE,aAAawE,GAGbF,kBAWJ5D,OAAOyD,EAAaM,GAKhB5L,YAAW,KACT,IAEE,IAAKjS,KAAKsZ,aACR,OAEF,MAAMwE,EAAY9d,KAAK8b,SAASK,IAAI9B,cAAc,UAClDyD,EAAU7T,KAAO,kBACjB6T,EAAUC,OAAQ,EAClBD,EAAU1C,IAAMmC,EAEhBO,EAAUE,OAAUF,EAAkBG,mBACpC,WAEE,MAAMC,EAAUJ,EAAkBzF,WAC7B6F,GAAqB,WAAXA,GAAkC,aAAXA,IAEpCJ,EAAUE,OAAUF,EAAkBG,mBAAqB,KACvDH,EAAUK,YACZL,EAAUK,WAAWtD,YAAYiD,GAEnCD,MAGNC,EAAUM,QAAU,KAClBjQ,IAAI,oCAAsCoP,GAC1Cvd,KAAKsZ,cAAe,EACpBtZ,KAAK2a,SAEP3a,KAAK8b,SAASK,IAAI3D,KAAK+C,YAAYuC,GACnC,MAAO/a,OAGRiO,KAAKI,MAAM,KCzrBpB,IAAIiN,EAAgB,KACQ,oBAAjBC,aACTD,EAAgBC,aACc,oBAAdC,YAChBF,EAAgBE,WAUL,MAAAC,oBA2BXhc,YACSwU,EACPzB,EACQ0B,EACAC,EACAC,EACRC,EACAC,GANOrX,KAAMgX,OAANA,EAEChX,KAAaiX,cAAbA,EACAjX,KAAakX,cAAbA,EACAlX,KAASmX,UAATA,EA/BVnX,KAAcye,eAAkB,KAChCze,KAAM0e,OAAoB,KAC1B1e,KAAW2e,YAAG,EACd3e,KAASsX,UAAG,EACZtX,KAAauX,cAAG,EA+BdvX,KAAKyX,KAAOtI,WAAWnP,KAAKgX,QAC5BhX,KAAK0X,OAASxB,0BAA0BX,GACxCvV,KAAKyV,QAAU+I,oBAAoBI,eACjCrJ,EACA6B,EACAC,EACAH,EACAD,GAEFjX,KAAKwU,UAAYe,EAASf,UAUpB0F,sBACN3E,EACA6B,EACAC,EACAH,EACAD,GAEA,MAAMuC,EAAqC,CAC3CA,EN1G4B,KMiI5B,MAnBsB,oBAAbG,UACPA,SAASC,UACTzF,EAAgB9N,KAAKsT,SAASC,YAE9BJ,EAAuB,EN1GJ,KM4GjBpC,IACFoC,EAAiC,EAAIpC,GAEnCC,IACFmC,EAA4B,GAAInC,GAE9BH,IACFsC,EAA+B,GAAItC,GAEjCD,IACFuC,EAA8B,EAAIvC,GAG7B3B,sBAAsBC,EN5GR,YM4G6BiE,GAOpD5B,KAAKC,EAA8BC,GACjC9X,KAAK8X,aAAeA,EACpB9X,KAAK6X,UAAYA,EAEjB7X,KAAKyX,KAAK,2BAA6BzX,KAAKyV,SAE5CzV,KAAKwX,gBAAiB,EAEtBjK,EAAkBf,IAAI,8BAA8B,GAEpD,IACE,IAAIqS,EACArY,YAiCJxG,KAAK8e,OAAS,IAAIT,EAAcre,KAAKyV,QAAS,GAAIoJ,GAClD,MAAO9b,GACP/C,KAAKyX,KAAK,kCACV,MAAMxU,EAAQF,EAAEjE,SAAWiE,EAAE4D,KAK7B,OAJI1D,GACFjD,KAAKyX,KAAKxU,QAEZjD,KAAKoY,YAIPpY,KAAK8e,OAAOC,OAAS,KACnB/e,KAAKyX,KAAK,wBACVzX,KAAKwX,gBAAiB,GAGxBxX,KAAK8e,OAAOE,QAAU,KACpBhf,KAAKyX,KAAK,0CACVzX,KAAK8e,OAAS,KACd9e,KAAKoY,aAGPpY,KAAK8e,OAAOG,UAAYC,IACtBlf,KAAKmf,oBAAoBD,IAG3Blf,KAAK8e,OAAOV,QAAUrb,IACpB/C,KAAKyX,KAAK,yCAEV,MAAMxU,EAASF,EAAUjE,SAAYiE,EAAU4D,KAC3C1D,GACFjD,KAAKyX,KAAKxU,GAEZjD,KAAKoY,aAOT2B,SAIAG,uBACEsE,oBAAoBpE,gBAAiB,EAGvCF,qBACE,IAAIkF,GAAe,EACnB,GAAyB,oBAAd7Y,WAA6BA,UAAU8Y,UAAW,CAC3D,MAAMC,EAAkB,iCAClBC,EAAkBhZ,UAAU8Y,UAAU1a,MAAM2a,GAC9CC,GAAmBA,EAAgBjgB,OAAS,GAC1CkgB,WAAWD,EAAgB,IAAM,MACnCH,GAAe,GAKrB,OACGA,GACiB,OAAlBf,IACCG,oBAAoBpE,eAiBzBF,0BAGE,OACE3M,EAAkBJ,oBACsC,IAAxDI,EAAkBX,IAAI,8BAI1B6N,wBACElN,EAAkBR,OAAO,8BAGnB0S,aAAa9Y,GAEnB,GADA3G,KAAK0e,OAAOrd,KAAKsF,GACb3G,KAAK0e,OAAOpf,SAAWU,KAAK2e,YAAa,CAC3C,MAAMe,EAAW1f,KAAK0e,OAAOpd,KAAK,IAClCtB,KAAK0e,OAAS,KACd,MAAMiB,EAAWlZ,SAASiZ,GAG1B1f,KAAK6X,UAAU8H,IAOXC,qBAAqBC,GAC3B7f,KAAK2e,YAAckB,EACnB7f,KAAK0e,OAAS,GAORoB,mBAAmBnZ,GAIzB,GAHA/H,OAAuB,OAAhBoB,KAAK0e,OAAiB,kCAGzB/X,EAAKrH,QAAU,EAAG,CACpB,MAAMugB,EAAatQ,OAAO5I,GAC1B,IAAKoZ,MAAMF,GAET,OADA7f,KAAK4f,qBAAqBC,GACnB,KAIX,OADA7f,KAAK4f,qBAAqB,GACnBjZ,EAOTwY,oBAAoBa,GAClB,GAAoB,OAAhBhgB,KAAK8e,OACP,OAEF,MAAMnY,EAAOqZ,EAAW,KAMxB,GALAhgB,KAAKuX,eAAiB5Q,EAAKrH,OAC3BU,KAAK0X,OAAO5B,iBAAiB,iBAAkBnP,EAAKrH,QAEpDU,KAAKigB,iBAEe,OAAhBjgB,KAAK0e,OAEP1e,KAAKyf,aAAa9Y,OACb,CAEL,MAAMuZ,EAAgBlgB,KAAK8f,mBAAmBnZ,GACxB,OAAlBuZ,GACFlgB,KAAKyf,aAAaS,IASxBpF,KAAKnU,GACH3G,KAAKigB,iBAEL,MAAMlF,EAAUrU,UAAUC,GAC1B3G,KAAKsX,WAAayD,EAAQzb,OAC1BU,KAAK0X,OAAO5B,iBAAiB,aAAciF,EAAQzb,QAKnD,MAAMkR,EAAWH,kBAAkB0K,EAvUN,OA0UzBvK,EAASlR,OAAS,GACpBU,KAAKmgB,YAAYte,OAAO2O,EAASlR,SAInC,IAAK,IAAID,EAAI,EAAGA,EAAImR,EAASlR,OAAQD,IACnCW,KAAKmgB,YAAY3P,EAASnR,IAItBqb,YACN1a,KAAKkY,WAAY,EACblY,KAAKye,iBACP2B,cAAcpgB,KAAKye,gBACnBze,KAAKye,eAAiB,MAGpBze,KAAK8e,SACP9e,KAAK8e,OAAOnE,QACZ3a,KAAK8e,OAAS,MAIV1G,YACDpY,KAAKkY,YACRlY,KAAKyX,KAAK,+BACVzX,KAAK0a,YAGD1a,KAAK8X,eACP9X,KAAK8X,aAAa9X,KAAKwX,gBACvBxX,KAAK8X,aAAe,OAS1B6C,QACO3a,KAAKkY,YACRlY,KAAKyX,KAAK,6BACVzX,KAAK0a,aAQTuF,iBACEG,cAAcpgB,KAAKye,gBACnBze,KAAKye,eAAiB4B,aAAY,KAE5BrgB,KAAK8e,QACP9e,KAAKmgB,YAAY,KAEnBngB,KAAKigB,mBAEJjP,KAAKI,MArYyB,OA6Y3B+O,YAAYjhB,GAIlB,IACEc,KAAK8e,OAAOhE,KAAK5b,GACjB,MAAO6D,GACP/C,KAAKyX,KACH,0CACA1U,EAAEjE,SAAWiE,EAAE4D,KACf,uBAEFsL,WAAWjS,KAAKoY,UAAUlJ,KAAKlP,MAAO,KAzLnCwe,oBAA4B8B,6BAAG,EAK/B9B,oBAAc+B,eAAG,IClPb,MAAAC,iBAqBXhe,YAAY+S,GACVvV,KAAKygB,gBAAgBlL,GAhBZmL,4BACT,MAAO,CAAC3J,sBAAuByH,qBAOtBmC,sCACT,OAAO3gB,KAAK4gB,4BAUNH,gBAAgBlL,GACtB,MAAMsL,EACJrC,qBAAuBA,oBAAiC,cAC1D,IAAIsC,EACFD,IAA0BrC,oBAAoBuC,mBAYhD,GAVIxL,EAAShB,gBACNsM,GACH1V,KACE,mFAIJ2V,GAAuB,GAGrBA,EACF9gB,KAAKghB,YAAc,CAACxC,yBACf,CACL,MAAMyC,EAAcjhB,KAAKghB,YAAc,GACvC,IAAK,MAAME,KAAaV,iBAAiBE,eACnCQ,GAAaA,EAAuB,eACtCD,EAAW5f,KAAK6f,GAGpBV,iBAAiBI,6BAA8B,GAOnDO,mBACE,GAAInhB,KAAKghB,YAAY1hB,OAAS,EAC5B,OAAOU,KAAKghB,YAAY,GAExB,MAAM,IAAIhiB,MAAM,2BAOpBoiB,mBACE,OAAIphB,KAAKghB,YAAY1hB,OAAS,EACrBU,KAAKghB,YAAY,GAEjB,MApEJR,iBAA2BI,6BAAG,ECgC1B,MAAAS,WA6BX7e,YACS6L,EACCiT,EACAC,EACAC,EACAC,EACApL,EACAqL,EACA1J,EACA2J,EACDtK,GATArX,KAAEqO,GAAFA,EACCrO,KAASshB,UAATA,EACAthB,KAAcuhB,eAAdA,EACAvhB,KAAcwhB,eAAdA,EACAxhB,KAAUyhB,WAAVA,EACAzhB,KAAUqW,WAAVA,EACArW,KAAQ0hB,SAARA,EACA1hB,KAAagY,cAAbA,EACAhY,KAAO2hB,QAAPA,EACD3hB,KAAaqX,cAAbA,EAtCTrX,KAAe4hB,gBAAG,EAClB5hB,KAAmB6hB,oBAAc,GAWzB7hB,KAAA8hB,OAAkC,EA4BxC9hB,KAAKyX,KAAOtI,WAAW,KAAOnP,KAAKqO,GAAK,KACxCrO,KAAK+hB,kBAAoB,IAAIvB,iBAAiBc,GAC9CthB,KAAKyX,KAAK,sBACVzX,KAAKgiB,SAMCA,SACN,MAAMC,EAAOjiB,KAAK+hB,kBAAkBZ,mBACpCnhB,KAAKkiB,MAAQ,IAAID,EACfjiB,KAAKmiB,mBACLniB,KAAKshB,UACLthB,KAAKuhB,eACLvhB,KAAKwhB,eACLxhB,KAAKyhB,WACL,KACAzhB,KAAKqX,eAKPrX,KAAKoiB,0BAA4BH,EAAmC,8BAAK,EAEzE,MAAMI,EAAoBriB,KAAKsiB,cAActiB,KAAKkiB,OAC5CK,EAAmBviB,KAAKwiB,iBAAiBxiB,KAAKkiB,OACpDliB,KAAKyiB,IAAMziB,KAAKkiB,MAChBliB,KAAK0iB,IAAM1iB,KAAKkiB,MAChBliB,KAAK2iB,eAAiB,KACtB3iB,KAAK4iB,YAAa,EAQlB3Q,YAAW,KAETjS,KAAKkiB,OAASliB,KAAKkiB,MAAMtK,KAAKyK,EAAmBE,KAChDvR,KAAKI,MAAM,IAEd,MAAMyR,EAAmBZ,EAAqB,gBAAK,EAC/CY,EAAmB,IACrB7iB,KAAK8iB,gBAAkB3Q,uBAAsB,KAC3CnS,KAAK8iB,gBAAkB,KAClB9iB,KAAK4iB,aAEN5iB,KAAKkiB,OACLliB,KAAKkiB,MAAM3K,cAnHiB,QAqH5BvX,KAAKyX,KACH,wDACEzX,KAAKkiB,MAAM3K,cACX,wCAEJvX,KAAK4iB,YAAa,EAClB5iB,KAAKkiB,MAAMzH,yBAEXza,KAAKkiB,OACLliB,KAAKkiB,MAAM5K,UA/Ha,MAiIxBtX,KAAKyX,KACH,oDACEzX,KAAKkiB,MAAM5K,UACX,uCAKJtX,KAAKyX,KAAK,+CACVzX,KAAK2a,YAIR3J,KAAKI,MAAMyR,KAIVV,mBACN,MAAO,KAAOniB,KAAKqO,GAAK,IAAMrO,KAAK4hB,kBAG7BY,iBAAiBP,GACvB,OAAOc,IACDd,IAASjiB,KAAKkiB,MAChBliB,KAAKgjB,kBAAkBD,GACdd,IAASjiB,KAAK2iB,gBACvB3iB,KAAKyX,KAAK,8BACVzX,KAAKijB,8BAELjjB,KAAKyX,KAAK,8BAKR6K,cAAcL,GACpB,OAAQnjB,IACS,IAAXkB,KAAK8hB,SACHG,IAASjiB,KAAK0iB,IAChB1iB,KAAKkjB,0BAA0BpkB,GACtBmjB,IAASjiB,KAAK2iB,eACvB3iB,KAAKmjB,4BAA4BrkB,GAEjCkB,KAAKyX,KAAK,+BASlB2L,YAAYC,GAEV,MAAMC,EAAM,CAAE3a,EAAG,IAAKK,EAAGqa,GACzBrjB,KAAKujB,UAAUD,GAGjBE,uBACMxjB,KAAKyiB,MAAQziB,KAAK2iB,gBAAkB3iB,KAAK0iB,MAAQ1iB,KAAK2iB,iBACxD3iB,KAAKyX,KACH,2CAA6CzX,KAAK2iB,eAAe3L,QAEnEhX,KAAKkiB,MAAQliB,KAAK2iB,eAClB3iB,KAAK2iB,eAAiB,MAKlBc,oBAAoBC,GAC1B,GA7LiB,MA6LGA,EAAa,CAC/B,MAAMC,EAAMD,EAAwB,EAxLvB,MAyLTC,EACF3jB,KAAK4jB,6BA7LS,MA8LLD,GAET3jB,KAAKyX,KAAK,wCACVzX,KAAK2iB,eAAehI,QAGlB3a,KAAKyiB,MAAQziB,KAAK2iB,gBAClB3iB,KAAK0iB,MAAQ1iB,KAAK2iB,gBAElB3iB,KAAK2a,SArMM,MAuMJgJ,IACT3jB,KAAKyX,KAAK,0BACVzX,KAAK6jB,8BACL7jB,KAAK4jB,+BAKHT,4BAA4BW,GAClC,MAAMC,EAAgB9T,WAAW,IAAK6T,GAChCnd,EAAgBsJ,WAAW,IAAK6T,GACtC,GAAc,MAAVC,EACF/jB,KAAKyjB,oBAAoB9c,OACpB,CAAA,GAAc,MAAVod,EAIT,MAAM,IAAI/kB,MAAM,2BAA6B+kB,GAF7C/jB,KAAK6hB,oBAAoBxgB,KAAKsF,IAM1Bid,6BACF5jB,KAAK6jB,6BAA+B,GACtC7jB,KAAKyX,KAAK,oCACVzX,KAAK4iB,YAAa,EAClB5iB,KAAK2iB,eAAelI,wBACpBza,KAAKgkB,wBAGLhkB,KAAKyX,KAAK,8BACVzX,KAAK2iB,eAAe7H,KAAK,CAAEnS,EAAG,IAAKK,EAAG,CAAEL,EAlOjC,IAkO0CK,EAAG,OAIhDgb,sBAENhkB,KAAK2iB,eAAe5I,QAEpB/Z,KAAKyX,KAAK,mCACVzX,KAAK2iB,eAAe7H,KAAK,CAAEnS,EAAG,IAAKK,EAAG,CAAEL,EA7OzB,IA6OwCK,EAAG,MAI1DhJ,KAAKyX,KAAK,kCACVzX,KAAKkiB,MAAMpH,KAAK,CAAEnS,EAAG,IAAKK,EAAG,CAAEL,EAjPV,IAiP+BK,EAAG,MACvDhJ,KAAKyiB,IAAMziB,KAAK2iB,eAEhB3iB,KAAKwjB,uBAGCN,0BAA0BY,GAEhC,MAAMC,EAAgB9T,WAAW,IAAK6T,GAChCnd,EAAgBsJ,WAAW,IAAK6T,GACxB,MAAVC,EACF/jB,KAAKikB,WAAWtd,GACG,MAAVod,GACT/jB,KAAKkkB,eAAevd,GAIhBud,eAAeplB,GACrBkB,KAAKmkB,qBAGLnkB,KAAKqW,WAAWvX,GAGVqlB,qBACDnkB,KAAK4iB,aACR5iB,KAAKoiB,4BACDpiB,KAAKoiB,2BAA6B,IACpCpiB,KAAKyX,KAAK,kCACVzX,KAAK4iB,YAAa,EAClB5iB,KAAKkiB,MAAMzH,0BAKTwJ,WAAWP,GACjB,MAAMC,EAAc1T,WA5RH,IA4R4ByT,GAC7C,GA5RiB,MA4RGA,EAAa,CAC/B,MAAMU,EAAUV,EAAwB,EACxC,GArRe,MAqRXC,EAAsB,CACxB,MAAMU,EAAgB7gB,OAAA8gB,OAAA,GAChBF,GAOFpkB,KAAKshB,UAAU3M,kBAEjB0P,EAAiBE,EAAIvkB,KAAKshB,UAAUpc,MAEtClF,KAAKwkB,aAAaH,QACb,GAtSY,MAsSRV,EAA0B,CACnC3jB,KAAKyX,KAAK,qCACVzX,KAAK0iB,IAAM1iB,KAAK2iB,eAChB,IAAK,IAAItjB,EAAI,EAAGA,EAAIW,KAAK6hB,oBAAoBviB,SAAUD,EACrDW,KAAKkkB,eAAelkB,KAAK6hB,oBAAoBxiB,IAE/CW,KAAK6hB,oBAAsB,GAC3B7hB,KAAKwjB,2BAlTY,MAmTRG,EAGT3jB,KAAKykB,sBAAsBL,GArTb,MAsTLT,EAET3jB,KAAK0kB,SAASN,GAvTA,MAwTLT,EACT1gB,MAAM,iBAAmBmhB,GAxTZ,MAyTJT,GACT3jB,KAAKyX,KAAK,wBACVzX,KAAKmkB,qBACLnkB,KAAK2kB,iCAEL1hB,MAAM,mCAAqC0gB,IAQzCa,aAAaI,GAMnB,MAAMC,EAAYD,EAAUzH,GACtB/Q,EAAUwY,EAAUjU,EACpBzL,EAAO0f,EAAUL,EACvBvkB,KAAK8kB,UAAYF,EAAU/T,EAC3B7Q,KAAKshB,UAAUpc,KAAOA,EAEP,IAAXlF,KAAK8hB,SACP9hB,KAAKkiB,MAAMnI,QACX/Z,KAAK+kB,yBAAyB/kB,KAAKkiB,MAAO2C,GR3XhB,MQ4XDzY,GACvBjB,KAAK,sCAGPnL,KAAKglB,oBAIDA,mBACN,MAAM/C,EAAOjiB,KAAK+hB,kBAAkBX,mBAChCa,GACFjiB,KAAKilB,cAAchD,GAIfgD,cAAchD,GACpBjiB,KAAK2iB,eAAiB,IAAIV,EACxBjiB,KAAKmiB,mBACLniB,KAAKshB,UACLthB,KAAKuhB,eACLvhB,KAAKwhB,eACLxhB,KAAKyhB,WACLzhB,KAAK8kB,WAIP9kB,KAAK6jB,4BACH5B,EAAmC,8BAAK,EAE1C,MAAMpK,EAAY7X,KAAKsiB,cAActiB,KAAK2iB,gBACpC7K,EAAe9X,KAAKwiB,iBAAiBxiB,KAAK2iB,gBAChD3iB,KAAK2iB,eAAe/K,KAAKC,EAAWC,GAGpC3F,uBAAsB,KAChBnS,KAAK2iB,iBACP3iB,KAAKyX,KAAK,gCACVzX,KAAK2iB,eAAehI,WAErB3J,KAAKI,MAnZY,MAsZdsT,SAASxf,GACflF,KAAKyX,KAAK,qCAAuCvS,GACjDlF,KAAKshB,UAAUpc,KAAOA,EAGP,IAAXlF,KAAK8hB,OACP9hB,KAAK2a,SAGL3a,KAAKklB,oBACLllB,KAAKgiB,UAID+C,yBAAyB9C,EAAiB4C,GAChD7kB,KAAKyX,KAAK,oCACVzX,KAAKkiB,MAAQD,EACbjiB,KAAK8hB,OAAM,EAEP9hB,KAAK0hB,WACP1hB,KAAK0hB,SAASmD,EAAW7kB,KAAK8kB,WAC9B9kB,KAAK0hB,SAAW,MAKqB,IAAnC1hB,KAAKoiB,2BACPpiB,KAAKyX,KAAK,kCACVzX,KAAK4iB,YAAa,GAElBzQ,uBAAsB,KACpBnS,KAAK2kB,kCACJ3T,KAAKI,MAlb8B,MAsblCuT,gCAED3kB,KAAK4iB,YAAyB,IAAX5iB,KAAK8hB,SAC3B9hB,KAAKyX,KAAK,4BACVzX,KAAKujB,UAAU,CAAE5a,EAAG,IAAKK,EAAG,CAAEL,EApavB,IAoagCK,EAAG,OAItCia,6BACN,MAAMhB,EAAOjiB,KAAK2iB,eAClB3iB,KAAK2iB,eAAiB,KAClB3iB,KAAKyiB,MAAQR,GAAQjiB,KAAK0iB,MAAQT,GAEpCjiB,KAAK2a,QAQDqI,kBAAkBD,GACxB/iB,KAAKkiB,MAAQ,KAIRa,GAA2D,IAA1C/iB,KAAK8hB,OAQL,IAAX9hB,KAAK8hB,QACd9hB,KAAKyX,KAAK,8BARVzX,KAAKyX,KAAK,+BAENzX,KAAKshB,UAAUtM,oBACjBzH,EAAkBR,OAAO,QAAU/M,KAAKshB,UAAUpc,MAElDlF,KAAKshB,UAAUvM,aAAe/U,KAAKshB,UAAUpc,OAMjDlF,KAAK2a,QAGC8J,sBAAsBU,GAC5BnlB,KAAKyX,KAAK,0DAENzX,KAAK2hB,UACP3hB,KAAK2hB,QAAQwD,GACbnlB,KAAK2hB,QAAU,MAKjB3hB,KAAKgY,cAAgB,KAErBhY,KAAK2a,QAGC4I,UAAU5c,GAChB,GAAe,IAAX3G,KAAK8hB,OACP,KAAM,8BAEN9hB,KAAKyiB,IAAI3H,KAAKnU,GAOlBgU,QACiB,IAAX3a,KAAK8hB,SACP9hB,KAAKyX,KAAK,gCACVzX,KAAK8hB,OAAM,EAEX9hB,KAAKklB,oBAEDllB,KAAKgY,gBACPhY,KAAKgY,gBACLhY,KAAKgY,cAAgB,OAKnBkN,oBACNllB,KAAKyX,KAAK,iCACNzX,KAAKkiB,QACPliB,KAAKkiB,MAAMvH,QACX3a,KAAKkiB,MAAQ,MAGXliB,KAAK2iB,iBACP3iB,KAAK2iB,eAAehI,QACpB3a,KAAK2iB,eAAiB,MAGpB3iB,KAAK8iB,kBACP1J,aAAapZ,KAAK8iB,iBAClB9iB,KAAK8iB,gBAAkB,OCjiBP,MAAAsC,cAkBpBC,IACEC,EACA3e,EACA4e,EACAC,IAGFC,MACEH,EACA3e,EACA4e,EACAC,IAOFE,iBAAiB7e,IAMjB8e,qBAAqB9e,IAErB+e,gBACEN,EACA3e,EACA4e,IAGFM,kBACEP,EACA3e,EACA4e,IAGFO,mBACER,EACAC,IAGFQ,YAAYC,KC/DQ,MAAAC,aAQpBzjB,YAAoB0jB,GAAAlmB,KAAckmB,eAAdA,EAPZlmB,KAAUmmB,WAKd,GAGFvnB,OACE2B,MAAMC,QAAQ0lB,IAAmBA,EAAe5mB,OAAS,EACzD,8BAeM8mB,QAAQC,KAAsB3X,GACtC,GAAInO,MAAMC,QAAQR,KAAKmmB,WAAWE,IAAa,CAE7C,MAAMC,EAAY,IAAItmB,KAAKmmB,WAAWE,IAEtC,IAAK,IAAIhnB,EAAI,EAAGA,EAAIinB,EAAUhnB,OAAQD,IACpCinB,EAAUjnB,GAAG6G,SAAS0I,MAAM0X,EAAUjnB,GAAGknB,QAAS7X,IAKxD8X,GAAGH,EAAmBngB,EAAgCqgB,GACpDvmB,KAAKymB,mBAAmBJ,GACxBrmB,KAAKmmB,WAAWE,GAAarmB,KAAKmmB,WAAWE,IAAc,GAC3DrmB,KAAKmmB,WAAWE,GAAWhlB,KAAK,CAAE6E,SAAAA,EAAUqgB,QAAAA,IAE5C,MAAMG,EAAY1mB,KAAK2mB,gBAAgBN,GACnCK,GACFxgB,EAAS0I,MAAM2X,EAASG,GAI5BE,IAAIP,EAAmBngB,EAAgCqgB,GACrDvmB,KAAKymB,mBAAmBJ,GACxB,MAAMC,EAAYtmB,KAAKmmB,WAAWE,IAAc,GAChD,IAAK,IAAIhnB,EAAI,EAAGA,EAAIinB,EAAUhnB,OAAQD,IACpC,GACEinB,EAAUjnB,GAAG6G,WAAaA,KACxBqgB,GAAWA,IAAYD,EAAUjnB,GAAGknB,SAGtC,YADAD,EAAUO,OAAOxnB,EAAG,GAMlBonB,mBAAmBJ,GACzBznB,OACEoB,KAAKkmB,eAAeY,MAAKC,GAChBA,IAAOV,IAEhB,kBAAoBA,IC9DpB,MAAOW,sBAAsBf,aAOjCzjB,cACEykB,MAAM,CAAC,WAPDjnB,KAAOknB,SAAG,EAcI,oBAAXljB,aAC4B,IAA5BA,OAAOyU,kBACbrS,oBAEDpC,OAAOyU,iBACL,UACA,KACOzY,KAAKknB,UACRlnB,KAAKknB,SAAU,EACflnB,KAAKomB,QAAQ,UAAU,OAG3B,GAGFpiB,OAAOyU,iBACL,WACA,KACMzY,KAAKknB,UACPlnB,KAAKknB,SAAU,EACflnB,KAAKomB,QAAQ,UAAU,OAG3B,IAnCNlM,qBACE,OAAO,IAAI8M,cAuCbL,gBAAgBN,GAEd,OADAznB,OAAqB,WAAdynB,EAAwB,uBAAyBA,GACjD,CAACrmB,KAAKknB,SAGfC,kBACE,OAAOnnB,KAAKknB,SC5CH,MAAAE,KAQX5kB,YAAY6kB,EAAiCC,GAC3C,QAAiB,IAAbA,EAAqB,CACvBtnB,KAAKunB,QAAWF,EAAwBngB,MAAM,KAG9C,IAAIsgB,EAAS,EACb,IAAK,IAAInoB,EAAI,EAAGA,EAAIW,KAAKunB,QAAQjoB,OAAQD,IACnCW,KAAKunB,QAAQloB,GAAGC,OAAS,IAC3BU,KAAKunB,QAAQC,GAAUxnB,KAAKunB,QAAQloB,GACpCmoB,KAGJxnB,KAAKunB,QAAQjoB,OAASkoB,EAEtBxnB,KAAKynB,UAAY,OAEjBznB,KAAKunB,QAAUF,EACfrnB,KAAKynB,UAAYH,EAIrBta,WACE,IAAIsY,EAAa,GACjB,IAAK,IAAIjmB,EAAIW,KAAKynB,UAAWpoB,EAAIW,KAAKunB,QAAQjoB,OAAQD,IAC5B,KAApBW,KAAKunB,QAAQloB,KACfimB,GAAc,IAAMtlB,KAAKunB,QAAQloB,IAIrC,OAAOimB,GAAc,KAIT,SAAAoC,eACd,OAAO,IAAIN,KAAK,IAGZ,SAAUO,aAAaC,GAC3B,OAAIA,EAAKH,WAAaG,EAAKL,QAAQjoB,OAC1B,KAGFsoB,EAAKL,QAAQK,EAAKH,WAMrB,SAAUI,cAAcD,GAC5B,OAAOA,EAAKL,QAAQjoB,OAASsoB,EAAKH,UAG9B,SAAUK,aAAaF,GAC3B,IAAIN,EAAWM,EAAKH,UAIpB,OAHIH,EAAWM,EAAKL,QAAQjoB,QAC1BgoB,IAEK,IAAIF,KAAKQ,EAAKL,QAASD,GAG1B,SAAUS,YAAYH,GAC1B,OAAIA,EAAKH,UAAYG,EAAKL,QAAQjoB,OACzBsoB,EAAKL,QAAQK,EAAKL,QAAQjoB,OAAS,GAGrC,KAkBO,SAAA0oB,UAAUJ,EAAYK,EAAgB,GACpD,OAAOL,EAAKL,QAAQW,MAAMN,EAAKH,UAAYQ,GAGvC,SAAUE,WAAWP,GACzB,GAAIA,EAAKH,WAAaG,EAAKL,QAAQjoB,OACjC,OAAO,KAGT,MAAM8oB,EAAS,GACf,IAAK,IAAI/oB,EAAIuoB,EAAKH,UAAWpoB,EAAIuoB,EAAKL,QAAQjoB,OAAS,EAAGD,IACxD+oB,EAAO/mB,KAAKumB,EAAKL,QAAQloB,IAG3B,OAAO,IAAI+nB,KAAKgB,EAAQ,GAGV,SAAAC,UAAUT,EAAYU,GACpC,MAAMF,EAAS,GACf,IAAK,IAAI/oB,EAAIuoB,EAAKH,UAAWpoB,EAAIuoB,EAAKL,QAAQjoB,OAAQD,IACpD+oB,EAAO/mB,KAAKumB,EAAKL,QAAQloB,IAG3B,GAAIipB,aAAwBlB,KAC1B,IAAK,IAAI/nB,EAAIipB,EAAab,UAAWpoB,EAAIipB,EAAaf,QAAQjoB,OAAQD,IACpE+oB,EAAO/mB,KAAKinB,EAAaf,QAAQloB,QAE9B,CACL,MAAMkpB,EAAcD,EAAaphB,MAAM,KACvC,IAAK,IAAI7H,EAAI,EAAGA,EAAIkpB,EAAYjpB,OAAQD,IAClCkpB,EAAYlpB,GAAGC,OAAS,GAC1B8oB,EAAO/mB,KAAKknB,EAAYlpB,IAK9B,OAAO,IAAI+nB,KAAKgB,EAAQ,GAMpB,SAAUI,YAAYZ,GAC1B,OAAOA,EAAKH,WAAaG,EAAKL,QAAQjoB,OAMxB,SAAAmpB,gBAAgBC,EAAiBC,GAC/C,MAAMC,EAAQjB,aAAae,GACzBG,EAAQlB,aAAagB,GACvB,GAAc,OAAVC,EACF,OAAOD,EACF,GAAIC,IAAUC,EACnB,OAAOJ,gBAAgBX,aAAaY,GAAYZ,aAAaa,IAE7D,MAAM,IAAI3pB,MACR,8BACE2pB,EADF,8BAIED,EACA,KAQQ,SAAAI,YAAYC,EAAYC,GACtC,MAAMC,EAAWjB,UAAUe,EAAM,GAC3BG,EAAYlB,UAAUgB,EAAO,GACnC,IAAK,IAAI3pB,EAAI,EAAGA,EAAI4pB,EAAS3pB,QAAUD,EAAI6pB,EAAU5pB,OAAQD,IAAK,CAChE,MAAM8pB,EAAMvZ,YAAYqZ,EAAS5pB,GAAI6pB,EAAU7pB,IAC/C,GAAY,IAAR8pB,EACF,OAAOA,EAGX,OAAIF,EAAS3pB,SAAW4pB,EAAU5pB,OACzB,EAEF2pB,EAAS3pB,OAAS4pB,EAAU5pB,QAAU,EAAI,EAMnC,SAAA8pB,WAAWxB,EAAYyB,GACrC,GAAIxB,cAAcD,KAAUC,cAAcwB,GACxC,OAAO,EAGT,IACE,IAAIhqB,EAAIuoB,EAAKH,UAAWle,EAAI8f,EAAM5B,UAClCpoB,GAAKuoB,EAAKL,QAAQjoB,OAClBD,IAAKkK,IAEL,GAAIqe,EAAKL,QAAQloB,KAAOgqB,EAAM9B,QAAQhe,GACpC,OAAO,EAIX,OAAO,EAMO,SAAA+f,aAAa1B,EAAYyB,GACvC,IAAIhqB,EAAIuoB,EAAKH,UACTle,EAAI8f,EAAM5B,UACd,GAAII,cAAcD,GAAQC,cAAcwB,GACtC,OAAO,EAET,KAAOhqB,EAAIuoB,EAAKL,QAAQjoB,QAAQ,CAC9B,GAAIsoB,EAAKL,QAAQloB,KAAOgqB,EAAM9B,QAAQhe,GACpC,OAAO,IAEPlK,IACAkK,EAEJ,OAAO,EAaI,MAAAggB,eASX/mB,YAAYolB,EAAmB4B,GAAAxpB,KAAYwpB,aAAZA,EAC7BxpB,KAAKypB,OAASzB,UAAUJ,EAAM,GAE9B5nB,KAAK0pB,YAAc1Y,KAAK2Y,IAAI,EAAG3pB,KAAKypB,OAAOnqB,QAE3C,IAAK,IAAID,EAAI,EAAGA,EAAIW,KAAKypB,OAAOnqB,OAAQD,IACtCW,KAAK0pB,aAAe/f,aAAa3J,KAAKypB,OAAOpqB,IAE/CuqB,yBAAyB5pB,OA0B7B,SAAS4pB,yBAAyBC,GAChC,GAAIA,EAAeH,YAvRS,IAwR1B,MAAM,IAAI1qB,MACR6qB,EAAeL,aAAfK,yCAIEA,EAAeH,YACf,MAGN,GAAIG,EAAeJ,OAAOnqB,OApSL,GAqSnB,MAAM,IAAIN,MACR6qB,EAAeL,aAAfK,gGAIEC,4BAA4BD,IAQ9B,SAAUC,4BACdD,GAEA,OAAqC,IAAjCA,EAAeJ,OAAOnqB,OACjB,GAEF,gBAAkBuqB,EAAeJ,OAAOnoB,KAAK,KAAO,ICvTvD,MAAOyoB,0BAA0B9D,aAOrCzjB,cAEE,IAAIwnB,EACAC,EAFJhD,MAAM,CAAC,YAIe,oBAAbviB,eAC8B,IAA9BA,SAAS+T,wBAEkB,IAAvB/T,SAAiB,QAE1BulB,EAAmB,mBACnBD,EAAS,eACiC,IAA1BtlB,SAAoB,WACpCulB,EAAmB,sBACnBD,EAAS,kBACgC,IAAzBtlB,SAAmB,UACnCulB,EAAmB,qBACnBD,EAAS,iBACoC,IAA7BtlB,SAAuB,eACvCulB,EAAmB,yBACnBD,EAAS,iBAQbhqB,KAAKkqB,UAAW,EAEZD,GACFvlB,SAAS+T,iBACPwR,GACA,KACE,MAAME,GAAWzlB,SAASslB,GACtBG,IAAYnqB,KAAKkqB,WACnBlqB,KAAKkqB,SAAWC,EAChBnqB,KAAKomB,QAAQ,UAAW+D,OAG5B,GA5CNjQ,qBACE,OAAO,IAAI6P,kBAgDbpD,gBAAgBN,GAEd,OADAznB,OAAqB,YAAdynB,EAAyB,uBAAyBA,GAClD,CAACrmB,KAAKkqB,WCWX,MAAOE,6BAA6BhF,cAwDxC5iB,YACU8e,EACAC,EACA8I,EAMAC,EACAC,EACAC,EACAC,EACAC,GAIR,GAFAzD,QAdQjnB,KAASshB,UAATA,EACAthB,KAAcuhB,eAAdA,EACAvhB,KAAaqqB,cAAbA,EAMArqB,KAAgBsqB,iBAAhBA,EACAtqB,KAAmBuqB,oBAAnBA,EACAvqB,KAAkBwqB,mBAAlBA,EACAxqB,KAAsByqB,uBAAtBA,EACAzqB,KAAa0qB,cAAbA,EAnEV1qB,KAAAqO,GAAK+b,qBAAqBO,8BAClB3qB,KAAIyX,KAAGtI,WAAW,KAAOnP,KAAKqO,GAAK,KAEnCrO,KAAiB4qB,kBAAkC,GAC1C5qB,KAAA6qB,QAGb,IAAIC,IACA9qB,KAAgB+qB,iBAAqB,GACrC/qB,KAAgBgrB,iBAAqB,GACrChrB,KAAoBirB,qBAAG,EACvBjrB,KAAoBkrB,qBAAG,EACvBlrB,KAAyBmrB,0BAA0B,GACnDnrB,KAAUorB,YAAG,EACbprB,KAAeqrB,gBA5DG,IA6DlBrrB,KAAkBsrB,mBA5DQ,IA6D1BtrB,KAAsBurB,uBAAiC,KAC/DvrB,KAAaqX,cAAkB,KAEvBrX,KAAyBwrB,0BAAkB,KAE3CxrB,KAAQkqB,UAAY,EAGpBlqB,KAAcyrB,eAA0C,GACxDzrB,KAAc0rB,eAAG,EAEjB1rB,KAAS2rB,UAGN,KAEH3rB,KAAUyhB,WAAkB,KAC5BzhB,KAAcwhB,eAAkB,KAChCxhB,KAAkB4rB,oBAAG,EACrB5rB,KAAsB6rB,uBAAG,EACzB7rB,KAA0B8rB,2BAAG,EAE7B9rB,KAAgB+rB,kBAAG,EACnB/rB,KAA0BgsB,2BAAkB,KAC5ChsB,KAA8BisB,+BAAkB,KA+BlDvB,IAAkBlkB,YACpB,MAAM,IAAIxH,MACR,kFAIJ+qB,kBAAkBmC,cAAc1F,GAAG,UAAWxmB,KAAKmsB,WAAYnsB,OAEpB,IAAvCshB,EAAUpc,KAAK4P,QAAQ,YACzBkS,cAAckF,cAAc1F,GAAG,SAAUxmB,KAAKosB,UAAWpsB,MAInDojB,YACRiJ,EACA7T,EACA8T,GAEA,MAAMC,IAAcvsB,KAAK0rB,eAEnBpI,EAAM,CAAEkJ,EAAGD,EAAWzjB,EAAGujB,EAAQtjB,EAAGyP,GAC1CxY,KAAKyX,KAAK/Q,UAAU4c,IACpB1kB,OACEoB,KAAKorB,WACL,0DAEFprB,KAAK2rB,UAAUvI,YAAYE,GACvBgJ,IACFtsB,KAAKyrB,eAAec,GAAaD,GAIrC1f,IAAIyI,GACFrV,KAAKysB,kBAEL,MAAMC,EAAW,IAAI9mB,SAKf+mB,EAAiB,CACrBN,OAAQ,IACRO,QANc,CACdxtB,EAAGiW,EAAMwX,MAAM7f,WACf8f,EAAGzX,EAAM0X,cAKTxH,WAAazmB,IACX,MAAMslB,EAAUtlB,EAAW,EACN,OAAjBA,EAAW,EACb4tB,EAAS5mB,QAAQse,GAEjBsI,EAAS7mB,OAAOue,KAItBpkB,KAAKgrB,iBAAiB3pB,KAAKsrB,GAC3B3sB,KAAKkrB,uBACL,MAAM8B,EAAQhtB,KAAKgrB,iBAAiB1rB,OAAS,EAM7C,OAJIU,KAAKorB,YACPprB,KAAKitB,SAASD,GAGTN,EAAS3mB,QAGlBmnB,OACE7X,EACA8X,EACAC,EACA7H,GAEAvlB,KAAKysB,kBAEL,MAAMY,EAAUhY,EAAMiY,iBAChBhI,EAAajQ,EAAMwX,MAAM7f,WAC/BhN,KAAKyX,KAAK,qBAAuB6N,EAAa,IAAM+H,GAC/CrtB,KAAK6qB,QAAQ0C,IAAIjI,IACpBtlB,KAAK6qB,QAAQre,IAAI8Y,EAAY,IAAIwF,KAEnClsB,OACEyW,EAAMmY,aAAaC,cAAgBpY,EAAMmY,aAAaE,eACtD,sDAEF9uB,QACGoB,KAAK6qB,QAAQje,IAAI0Y,GAAaiI,IAAIF,GACnC,gDAEF,MAAMM,EAAyB,CAC7BpI,WAAAA,EACAqI,OAAQT,EACR9X,MAAAA,EACA+X,IAAAA,GAEFptB,KAAK6qB,QAAQje,IAAI0Y,GAAa9Y,IAAI6gB,EAASM,GAEvC3tB,KAAKorB,YACPprB,KAAK6tB,YAAYF,GAIbV,SAASD,GACf,MAAMpgB,EAAM5M,KAAKgrB,iBAAiBgC,GAClChtB,KAAKojB,YAAY,IAAKxW,EAAIggB,SAAU9tB,WAC3BkB,KAAKgrB,iBAAiBgC,GAC7BhtB,KAAKkrB,uBAC6B,IAA9BlrB,KAAKkrB,uBACPlrB,KAAKgrB,iBAAmB,IAEtBpe,EAAI2Y,YACN3Y,EAAI2Y,WAAWzmB,MAKb+uB,YAAYF,GAClB,MAAMtY,EAAQsY,EAAWtY,MACnBiQ,EAAajQ,EAAMwX,MAAM7f,WACzBqgB,EAAUhY,EAAMiY,iBACtBttB,KAAKyX,KAAK,aAAe6N,EAAa,QAAU+H,GAChD,MAAMS,EAAgC,CAAW1uB,EAAGkmB,GAKhDqI,EAAWP,MACbU,EAAO,EAAIzY,EAAM0X,aACjBe,EAAO,EAAIH,EAAWP,KAGxBU,EAAgB,EAAIH,EAAWC,SAE/B5tB,KAAKojB,YAVU,IAUU0K,GAAMhvB,IAC7B,MAAMslB,EAAmBtlB,EAAoB,EACvCivB,EAASjvB,EAAsB,EAGrCsrB,qBAAqB4D,sBAAsB5J,EAAS/O,IAGlDrV,KAAK6qB,QAAQje,IAAI0Y,IACjBtlB,KAAK6qB,QAAQje,IAAI0Y,GAAa1Y,IAAIygB,MAEVM,IACxB3tB,KAAKyX,KAAK,kBAAmB3Y,GAEd,OAAXivB,GACF/tB,KAAKiuB,cAAc3I,EAAY+H,GAG7BM,EAAWpI,YACboI,EAAWpI,WAAWwI,EAAQ3J,OAM9BlK,6BAA6BkK,EAAkB/O,GACrD,GAAI+O,GAA8B,iBAAZA,GAAwBjd,SAASid,EAAS,KAAM,CAEpE,MAAM8J,EAAW1mB,QAAQ4c,EAAgB,KACzC,GAAI7jB,MAAMC,QAAQ0tB,KAAcA,EAASpZ,QAAQ,YAAa,CAC5D,MAAMqZ,EACJ,gBAAkB9Y,EAAMmY,aAAaY,WAAWphB,WAAa,IACzDqhB,EAAYhZ,EAAMwX,MAAM7f,WAC9B7B,KAEI,wGAA2CgjB,QACxCE,sDAMb3I,iBAAiB7e,GACf7G,KAAKyhB,WAAa5a,EAClB7G,KAAKyX,KAAK,wBACNzX,KAAKyhB,WACPzhB,KAAKsuB,UAIDtuB,KAAKorB,YACPprB,KAAKojB,YAAY,SAAU,IAAI,SAInCpjB,KAAKuuB,uCAAuC1nB,GAGtC0nB,uCAAuCC,IAGpBA,GAAoC,KAAtBA,EAAWlvB,Q7BjN/B,SAAUuH,GAC/B,MAAME,EAAiBH,OAAOC,GAAOE,OACrC,MAAyB,iBAAXA,IAA2C,IAApBA,EAAc,M6BgNzB0nB,CAAQD,MAC9BxuB,KAAKyX,KACH,iEAEFzX,KAAKsrB,mBAtT4B,KA0TrC3F,qBAAqB9e,GACnB7G,KAAKwhB,eAAiB3a,EACtB7G,KAAKyX,KAAK,6BACNzX,KAAKwhB,eACPxhB,KAAK0uB,cAKD1uB,KAAKorB,YACPprB,KAAKojB,YAAY,WAAY,IAAI,SASvCkL,UACE,GAAItuB,KAAKorB,YAAcprB,KAAKyhB,WAAY,CACtC,MAAM5a,EAAQ7G,KAAKyhB,WACbkN,E7B9PiB,SAAU9nB,GACrC,MACEE,EADcH,OAAOC,GACJE,OAEnB,QAASA,GAA4B,iBAAXA,GAAuBA,EAAOnD,eAAe,O6B0PhDgrB,CAAc/nB,GAAS,OAAS,QAC7CgoB,EAAwC,CAAEC,KAAMjoB,GAC3B,OAAvB7G,KAAK0qB,cACPmE,EAAoB,QAAI,EACe,iBAAvB7uB,KAAK0qB,gBACrBmE,EAAqB,QAAI7uB,KAAK0qB,eAEhC1qB,KAAKojB,YACHuL,EACAE,GACChnB,IACC,MAAMkmB,EAASlmB,EAAkB,EAC3BlB,EAAQkB,EAAgB,GAAgB,QAE1C7H,KAAKyhB,aAAe5a,IACP,OAAXknB,EACF/tB,KAAK6rB,uBAAyB,EAG9B7rB,KAAK+uB,eAAehB,EAAQpnB,QAaxC+nB,cACM1uB,KAAKorB,YAAcprB,KAAKwhB,gBAC1BxhB,KAAKojB,YACH,WACA,CAAEvc,MAAS7G,KAAKwhB,iBACf3Z,IACC,MAAMkmB,EAASlmB,EAAkB,EAC3BlB,EAAQkB,EAAgB,GAAgB,QAC/B,OAAXkmB,EACF/tB,KAAK8rB,2BAA6B,EAElC9rB,KAAKgvB,mBAAmBjB,EAAQpnB,MAU1CsoB,SAAS5Z,EAAqB+X,GAC5B,MAAM9H,EAAajQ,EAAMwX,MAAM7f,WACzBqgB,EAAUhY,EAAMiY,iBAEtBttB,KAAKyX,KAAK,uBAAyB6N,EAAa,IAAM+H,GAEtDzuB,OACEyW,EAAMmY,aAAaC,cAAgBpY,EAAMmY,aAAaE,eACtD,wDAEa1tB,KAAKiuB,cAAc3I,EAAY+H,IAChCrtB,KAAKorB,YACjBprB,KAAKkvB,cAAc5J,EAAY+H,EAAShY,EAAM0X,aAAcK,GAIxD8B,cACN5J,EACA+H,EACA8B,EACA/B,GAEAptB,KAAKyX,KAAK,eAAiB6N,EAAa,QAAU+H,GAElD,MAAMS,EAAgC,CAAW1uB,EAAGkmB,GAGhD8H,IACFU,EAAO,EAAIqB,EACXrB,EAAO,EAAIV,GAGbptB,KAAKojB,YAPU,IAOU0K,GAG3BlI,gBACEN,EACA3e,EACA4e,GAEAvlB,KAAKysB,kBAEDzsB,KAAKorB,WACPprB,KAAKovB,kBAAkB,IAAK9J,EAAY3e,EAAM4e,GAE9CvlB,KAAKmrB,0BAA0B9pB,KAAK,CAClCikB,WAAAA,EACA+G,OAAQ,IACR1lB,KAAAA,EACA4e,WAAAA,IAKNM,kBACEP,EACA3e,EACA4e,GAEAvlB,KAAKysB,kBAEDzsB,KAAKorB,WACPprB,KAAKovB,kBAAkB,KAAM9J,EAAY3e,EAAM4e,GAE/CvlB,KAAKmrB,0BAA0B9pB,KAAK,CAClCikB,WAAAA,EACA+G,OAAQ,KACR1lB,KAAAA,EACA4e,WAAAA,IAKNO,mBACER,EACAC,GAEAvlB,KAAKysB,kBAEDzsB,KAAKorB,WACPprB,KAAKovB,kBAAkB,KAAM9J,EAAY,KAAMC,GAE/CvlB,KAAKmrB,0BAA0B9pB,KAAK,CAClCikB,WAAAA,EACA+G,OAAQ,KACR1lB,KAAM,KACN4e,WAAAA,IAKE6J,kBACN/C,EACA/G,EACA3e,EACA4e,GAEA,MAAMqH,EAAU,CAAWxtB,EAAGkmB,EAAqBtc,EAAGrC,GACtD3G,KAAKyX,KAAK,gBAAkB4U,EAAQO,GACpC5sB,KAAKojB,YAAYiJ,EAAQO,GAAUyC,IAC7B9J,GACFtT,YAAW,KACTsT,EACE8J,EAAuB,EACvBA,EAAuB,KAExBre,KAAKI,MAAM,OAKpBiU,IACEC,EACA3e,EACA4e,EACAC,GAEAxlB,KAAKsvB,YAAY,IAAKhK,EAAY3e,EAAM4e,EAAYC,GAGtDC,MACEH,EACA3e,EACA4e,EACAC,GAEAxlB,KAAKsvB,YAAY,IAAKhK,EAAY3e,EAAM4e,EAAYC,GAGtD8J,YACEjD,EACA/G,EACA3e,EACA4e,EACAC,GAEAxlB,KAAKysB,kBAEL,MAAMG,EAAoC,CAC/BxtB,EAAGkmB,EACHtc,EAAGrC,QAGDtD,IAATmiB,IACFoH,EAAoB,EAAIpH,GAI1BxlB,KAAK+qB,iBAAiB1pB,KAAK,CACzBgrB,OAAAA,EACAO,QAAAA,EACArH,WAAAA,IAGFvlB,KAAKirB,uBACL,MAAM+B,EAAQhtB,KAAK+qB,iBAAiBzrB,OAAS,EAEzCU,KAAKorB,WACPprB,KAAKuvB,SAASvC,GAEdhtB,KAAKyX,KAAK,kBAAoB6N,GAI1BiK,SAASvC,GACf,MAAMX,EAASrsB,KAAK+qB,iBAAiBiC,GAAOX,OACtCO,EAAU5sB,KAAK+qB,iBAAiBiC,GAAOJ,QACvCrH,EAAavlB,KAAK+qB,iBAAiBiC,GAAOzH,WAChDvlB,KAAK+qB,iBAAiBiC,GAAOwC,OAASxvB,KAAKorB,WAE3CprB,KAAKojB,YAAYiJ,EAAQO,GAAU9tB,IACjCkB,KAAKyX,KAAK4U,EAAS,YAAavtB,UAEzBkB,KAAK+qB,iBAAiBiC,GAC7BhtB,KAAKirB,uBAG6B,IAA9BjrB,KAAKirB,uBACPjrB,KAAK+qB,iBAAmB,IAGtBxF,GACFA,EACEzmB,EAAsB,EACtBA,EAAsB,MAM9BinB,YAAYC,GAEV,GAAIhmB,KAAKorB,WAAY,CACnB,MAAMwB,EAAU,CAAertB,EAAGymB,GAClChmB,KAAKyX,KAAK,cAAemV,GAEzB5sB,KAAKojB,YAAsB,IAAKwJ,GAAS6C,IAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,MAAMC,EAAcD,EAAqB,EACzCzvB,KAAKyX,KAAK,cAAe,wBAA0BiY,QAMnDxL,eAAeplB,GACrB,GAAI,MAAOA,EAAS,CAElBkB,KAAKyX,KAAK,gBAAkB/Q,UAAU5H,IACtC,MAAM6wB,EAAS7wB,EAAW,EACpBwtB,EAAatsB,KAAKyrB,eAAekE,GACnCrD,WACKtsB,KAAKyrB,eAAekE,GAC3BrD,EAAWxtB,EAAoB,QAE5B,CAAA,GAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhBkB,KAAK4vB,YAAY9wB,EAAW,EAAaA,EAAW,IAIhD8wB,YAAYvD,EAAgB7T,GAClCxY,KAAKyX,KAAK,sBAAuB4U,EAAQ7T,GAC1B,MAAX6T,EACFrsB,KAAKqqB,cACH7R,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEU,MAAX6T,EACTrsB,KAAKqqB,cACH7R,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEU,MAAX6T,EACTrsB,KAAK6vB,iBACHrX,EAAiB,EACjBA,EAAkB,GAEA,OAAX6T,EACTrsB,KAAK+uB,eACHvW,EAAwB,EACxBA,EAA0B,GAER,QAAX6T,EACTrsB,KAAKgvB,mBACHxW,EAAwB,EACxBA,EAA0B,GAER,OAAX6T,EACTrsB,KAAK8vB,uBAAuBtX,GAE5BvV,MACE,6CACEyD,UAAU2lB,GACV,sCAKA3K,SAASmD,EAAmBC,GAClC9kB,KAAKyX,KAAK,oBACVzX,KAAKorB,YAAa,EAClBprB,KAAKisB,gCAAiC,IAAIxoB,MAAOC,UACjD1D,KAAK+vB,iBAAiBlL,GACtB7kB,KAAKqX,cAAgByN,EACjB9kB,KAAK+rB,kBACP/rB,KAAKgwB,oBAEPhwB,KAAKiwB,gBACLjwB,KAAK+rB,kBAAmB,EACxB/rB,KAAKsqB,kBAAiB,GAGhB4F,iBAAiB7d,GACvBzT,QACGoB,KAAK2rB,UACN,0DAGE3rB,KAAKwrB,2BACPpS,aAAapZ,KAAKwrB,2BAMpBxrB,KAAKwrB,0BAA4BvZ,YAAW,KAC1CjS,KAAKwrB,0BAA4B,KACjCxrB,KAAKmwB,yBAEJnf,KAAKI,MAAMiB,IAGRoa,mBACDzsB,KAAK2rB,WAAa3rB,KAAK+rB,kBAC1B/rB,KAAKkwB,iBAAiB,GAIlB/D,WAAWhC,GAGfA,IACCnqB,KAAKkqB,UACNlqB,KAAKqrB,kBAAoBrrB,KAAKsrB,qBAE9BtrB,KAAKyX,KAAK,2CACVzX,KAAKqrB,gBAjsBiB,IAmsBjBrrB,KAAK2rB,WACR3rB,KAAKkwB,iBAAiB,IAG1BlwB,KAAKkqB,SAAWC,EAGViC,UAAUgE,GACZA,GACFpwB,KAAKyX,KAAK,wBACVzX,KAAKqrB,gBA7sBiB,IA8sBjBrrB,KAAK2rB,WACR3rB,KAAKkwB,iBAAiB,KAGxBlwB,KAAKyX,KAAK,8CACNzX,KAAK2rB,WACP3rB,KAAK2rB,UAAUhR,SAKb0V,wBAWN,GAVArwB,KAAKyX,KAAK,4BACVzX,KAAKorB,YAAa,EAClBprB,KAAK2rB,UAAY,KAGjB3rB,KAAKswB,0BAGLtwB,KAAKyrB,eAAiB,GAElBzrB,KAAKuwB,mBAAoB,CAC3B,GAAKvwB,KAAKkqB,UAIH,GAAIlqB,KAAKisB,+BAAgC,EAG5C,IAAIxoB,MAAOC,UAAY1D,KAAKisB,+BAxuBA,MA0uB5BjsB,KAAKqrB,gBA9uBa,KAgvBpBrrB,KAAKisB,+BAAiC,WAVtCjsB,KAAKyX,KAAK,8CACVzX,KAAKqrB,gBAAkBrrB,KAAKsrB,mBAC5BtrB,KAAKgsB,4BAA6B,IAAIvoB,MAAOC,UAW/C,MAAM8sB,GACJ,IAAI/sB,MAAOC,UAAY1D,KAAKgsB,2BAC9B,IAAIyE,EAAiBzf,KAAK2Y,IACxB,EACA3pB,KAAKqrB,gBAAkBmF,GAEzBC,EAAiBzf,KAAKyI,SAAWgX,EAEjCzwB,KAAKyX,KAAK,0BAA4BgZ,EAAiB,MACvDzwB,KAAKkwB,iBAAiBO,GAGtBzwB,KAAKqrB,gBAAkBra,KAAKG,IAC1BnR,KAAKsrB,mBA7vBsB,IA8vB3BtrB,KAAKqrB,iBAGTrrB,KAAKsqB,kBAAiB,GAGhBvM,6BACN,GAAI/d,KAAKuwB,mBAAoB,CAC3BvwB,KAAKyX,KAAK,+BACVzX,KAAKgsB,4BAA6B,IAAIvoB,MAAOC,UAC7C1D,KAAKisB,+BAAiC,KACtC,MAAMyE,EAAgB1wB,KAAKkkB,eAAehV,KAAKlP,MACzC2wB,EAAU3wB,KAAK0hB,SAASxS,KAAKlP,MAC7B8X,EAAe9X,KAAKqwB,sBAAsBnhB,KAAKlP,MAC/CgX,EAAShX,KAAKqO,GAAK,IAAM+b,qBAAqBwG,oBAC9CvZ,EAAgBrX,KAAKqX,cAC3B,IAAIwZ,GAAW,EACXC,EAAgC,KACpC,MAAMC,QAAU,WACVD,EACFA,EAAWnW,SAEXkW,GAAW,EACX/Y,MAGEkZ,cAAgB,SAAU1N,GAC9B1kB,OACEkyB,EACA,0DAEFA,EAAW1N,YAAYE,IAGzBtjB,KAAK2rB,UAAY,CACfhR,MAAOoW,QACP3N,YAAa4N,eAGf,MAAMhe,EAAehT,KAAK4rB,mBAC1B5rB,KAAK4rB,oBAAqB,EAE1B,IAGE,MAAOzU,EAAWD,SAAuBlR,QAAQirB,IAAI,CACnDjxB,KAAKwqB,mBAAmBzX,SAASC,GACjChT,KAAKyqB,uBAAuB1X,SAASC,KAGlC6d,EAoBH1iB,IAAI,0CAnBJA,IAAI,8CACJnO,KAAKyhB,WAAatK,GAAaA,EAAUlD,YACzCjU,KAAKwhB,eAAiBtK,GAAiBA,EAAcrQ,MACrDiqB,EAAa,IAAIzP,WACfrK,EACAhX,KAAKshB,UACLthB,KAAKuhB,eACLvhB,KAAKwhB,eACLxhB,KAAKyhB,WACLiP,EACAC,EACA7Y,GACcqN,IACZha,KAAKga,EAAS,KAAOnlB,KAAKshB,UAAUtU,WAAa,KACjDhN,KAAKkxB,UA7zBkB,iBA+zBzB7Z,IAKJ,MAAOpU,GACPjD,KAAKyX,KAAK,wBAA0BxU,GAC/B4tB,IACC7wB,KAAKshB,UAAU9M,WAIjBrJ,KAAKlI,GAEP8tB,aAMRG,UAAU/L,GACRhX,IAAI,uCAAyCgX,GAC7CnlB,KAAK4qB,kBAAkBzF,IAAU,EAC7BnlB,KAAK2rB,UACP3rB,KAAK2rB,UAAUhR,SAEX3a,KAAKwrB,4BACPpS,aAAapZ,KAAKwrB,2BAClBxrB,KAAKwrB,0BAA4B,MAE/BxrB,KAAKorB,YACPprB,KAAKqwB,yBAKXc,OAAOhM,GACLhX,IAAI,mCAAqCgX,UAClCnlB,KAAK4qB,kBAAkBzF,GAC1B1d,QAAQzH,KAAK4qB,qBACf5qB,KAAKqrB,gBA52BiB,IA62BjBrrB,KAAK2rB,WACR3rB,KAAKkwB,iBAAiB,IAKpBH,iBAAiBlL,GACvB,MAAMuM,EAAQvM,GAAY,IAAIphB,MAAOC,UACrC1D,KAAKuqB,oBAAoB,CAAE8G,iBAAkBD,IAGvCd,0BACN,IAAK,IAAIjxB,EAAI,EAAGA,EAAIW,KAAK+qB,iBAAiBzrB,OAAQD,IAAK,CACrD,MAAMgmB,EAAMrlB,KAAK+qB,iBAAiB1rB,GAC9BgmB,GAAgB,MAAOA,EAAIuH,SAAWvH,EAAImK,SACxCnK,EAAIE,YACNF,EAAIE,WAAW,qBAGVvlB,KAAK+qB,iBAAiB1rB,GAC7BW,KAAKirB,wBAKyB,IAA9BjrB,KAAKirB,uBACPjrB,KAAK+qB,iBAAmB,IAIpB8E,iBAAiBvK,EAAoBjQ,GAE3C,IAAIgY,EAIFA,EAHGhY,EAGOA,EAAM3N,KAAIolB,GAAK5c,kBAAkB4c,KAAIxrB,KAAK,KAF1C,UAIZ,MAAM4rB,EAASltB,KAAKiuB,cAAc3I,EAAY+H,GAC1CH,GAAUA,EAAO3H,YACnB2H,EAAO3H,WAAW,qBAId0I,cAAc3I,EAAoB+H,GACxC,MAAMiE,EAAuB,IAAIlK,KAAK9B,GAAYtY,WAClD,IAAIkgB,EACJ,GAAIltB,KAAK6qB,QAAQ0C,IAAI+D,GAAuB,CAC1C,MAAM5pB,EAAM1H,KAAK6qB,QAAQje,IAAI0kB,GAC7BpE,EAASxlB,EAAIkF,IAAIygB,GACjB3lB,EAAIiW,OAAO0P,GACM,IAAb3lB,EAAImV,MACN7c,KAAK6qB,QAAQlN,OAAO2T,QAItBpE,OAAS7pB,EAEX,OAAO6pB,EAGD6B,eAAewC,EAAoBC,GACzCrjB,IAAI,uBAAyBojB,EAAa,IAAMC,GAChDxxB,KAAKyhB,WAAa,KAClBzhB,KAAK4rB,oBAAqB,EAC1B5rB,KAAK2rB,UAAUhR,QACI,kBAAf4W,GAAiD,sBAAfA,IAIpCvxB,KAAK6rB,yBACD7rB,KAAK6rB,wBA56BiB,IA86BxB7rB,KAAKqrB,gBAp7B0B,IAw7B/BrrB,KAAKwqB,mBAAmBpX,0BAKtB4b,mBAAmBuC,EAAoBC,GAC7CrjB,IAAI,4BAA8BojB,EAAa,IAAMC,GACrDxxB,KAAKwhB,eAAiB,KACtBxhB,KAAK4rB,oBAAqB,EAGP,kBAAf2F,GAAiD,sBAAfA,IAIpCvxB,KAAK8rB,6BACD9rB,KAAK8rB,4BAl8BiB,GAm8BxB9rB,KAAKyqB,uBAAuBrX,yBAK1B0c,uBAAuBtX,GACzBxY,KAAKurB,uBACPvrB,KAAKurB,uBAAuB/S,GAExB,QAASA,GACXxV,QAAQmL,IACN,aAAgBqK,EAAU,IAAa3V,QAAQ,KAAM,iBAMrDotB,gBAENjwB,KAAKsuB,UACLtuB,KAAK0uB,cAIL,IAAK,MAAM+C,KAAWzxB,KAAK6qB,QAAQ6G,SACjC,IAAK,MAAM/D,KAAc8D,EAAQC,SAC/B1xB,KAAK6tB,YAAYF,GAIrB,IAAK,IAAItuB,EAAI,EAAGA,EAAIW,KAAK+qB,iBAAiBzrB,OAAQD,IAC5CW,KAAK+qB,iBAAiB1rB,IACxBW,KAAKuvB,SAASlwB,GAIlB,KAAOW,KAAKmrB,0BAA0B7rB,QAAQ,CAC5C,MAAMstB,EAAU5sB,KAAKmrB,0BAA0BlO,QAC/Cjd,KAAKovB,kBACHxC,EAAQP,OACRO,EAAQtH,WACRsH,EAAQjmB,KACRimB,EAAQrH,YAIZ,IAAK,IAAIlmB,EAAI,EAAGA,EAAIW,KAAKgrB,iBAAiB1rB,OAAQD,IAC5CW,KAAKgrB,iBAAiB3rB,IACxBW,KAAKitB,SAAS5tB,GAQZ2wB,oBACN,MAAMhK,EAAiC,GAWvCA,EAAM,UAA4B9Z,EAAYrJ,QAAQ,MAAO,MAAQ,EAEjEuD,kBACF4f,EAAM,qBAAuB,E/Br9BnB,SAAA2L,gBACd,MACuB,iBAAdprB,WAAmD,gBAAzBA,UAAmB,Q+Bo9BzCorB,KACT3L,EAAM,yBAA2B,GAEnChmB,KAAK+lB,YAAYC,GAGXuK,mBACN,MAAMH,EAASpJ,cAAckF,cAAc/E,kBAC3C,OAAO1f,QAAQzH,KAAK4qB,oBAAsBwF,GAn8B7BhG,qBAA2BO,4BAAG,EAK9BP,qBAAiBwG,kBAAG,ECQxB,MAAAgB,UACXpvB,YAAmBC,EAAqBovB,GAArB7xB,KAAIyC,KAAJA,EAAqBzC,KAAI6xB,KAAJA,EAExC3X,YAAYzX,EAAcovB,GACxB,OAAO,IAAID,UAAUnvB,EAAMovB,IChIT,MAAAC,MASpBC,aACE,OAAO/xB,KAAKgyB,QAAQ9iB,KAAKlP,MAU3BiyB,oBAAoBC,EAAeC,GACjC,MAAMC,EAAa,IAAIR,UAAUliB,EAAUwiB,GACrCG,EAAa,IAAIT,UAAUliB,EAAUyiB,GAC3C,OAAgD,IAAzCnyB,KAAKgyB,QAAQI,EAAYC,GAOlCC,UAEE,OAAQV,UAAkBW,KC5B9B,IAAIC,EAEE,MAAOC,iBAAiBX,MACjBU,0BACT,OAAOA,EAGEA,wBAAa1kB,GACtB0kB,EAAe1kB,EAEjBkkB,QAAQlpB,EAAcC,GACpB,OAAO6G,YAAY9G,EAAErG,KAAMsG,EAAEtG,MAE/BiwB,YAAYb,GAGV,MAAM9yB,eAAe,mDAEvBkzB,oBAAoBC,EAAeC,GACjC,OAAO,EAETG,UAEE,OAAQV,UAAkBW,IAE5BI,UAGE,OAAO,IAAIf,UAAUjiB,EAAU6iB,GAGjCI,SAASC,EAAoBpwB,GAM3B,OALA7D,OACwB,iBAAfi0B,EACP,gDAGK,IAAIjB,UAAUiB,EAAYL,GAMnCxlB,WACE,MAAO,QAIJ,MAAM8lB,EAAY,IAAIL,SC/BhB,MAAAM,kBAOXvwB,YACEqvB,EACAmB,EACAC,EACQC,EACAC,EAA+C,MAD/CnzB,KAAUkzB,WAAVA,EACAlzB,KAAgBmzB,iBAAhBA,EAXFnzB,KAAUozB,WAAgD,GAahE,IAAIjK,EAAM,EACV,MAAQ0I,EAAKpqB,WAQX,GAPAoqB,EAAOA,EACP1I,EAAM6J,EAAWC,EAAWpB,EAAKxqB,IAAK2rB,GAAY,EAE9CE,IACF/J,IAAQ,GAGNA,EAAM,EAGN0I,EADE7xB,KAAKkzB,WACArB,EAAK9I,KAEL8I,EAAK7I,UAET,CAAA,GAAY,IAARG,EAAW,CAEpBnpB,KAAKozB,WAAW/xB,KAAKwwB,GACrB,MAGA7xB,KAAKozB,WAAW/xB,KAAKwwB,GAEnBA,EADE7xB,KAAKkzB,WACArB,EAAK7I,MAEL6I,EAAK9I,MAMpBsK,UACE,GAA+B,IAA3BrzB,KAAKozB,WAAW9zB,OAClB,OAAO,KAGT,IACImwB,EADAoC,EAAO7xB,KAAKozB,WAAWE,MAQ3B,GALE7D,EADEzvB,KAAKmzB,iBACEnzB,KAAKmzB,iBAAiBtB,EAAKxqB,IAAKwqB,EAAK1uB,OAErC,CAAEkE,IAAKwqB,EAAKxqB,IAAKlE,MAAO0uB,EAAK1uB,OAGpCnD,KAAKkzB,WAEP,IADArB,EAAOA,EAAK9I,MACJ8I,EAAKpqB,WACXzH,KAAKozB,WAAW/xB,KAAKwwB,GACrBA,EAAOA,EAAK7I,WAId,IADA6I,EAAOA,EAAK7I,OACJ6I,EAAKpqB,WACXzH,KAAKozB,WAAW/xB,KAAKwwB,GACrBA,EAAOA,EAAK9I,KAIhB,OAAO0G,EAGT8D,UACE,OAAOvzB,KAAKozB,WAAW9zB,OAAS,EAGlCk0B,OACE,GAA+B,IAA3BxzB,KAAKozB,WAAW9zB,OAClB,OAAO,KAGT,MAAMuyB,EAAO7xB,KAAKozB,WAAWpzB,KAAKozB,WAAW9zB,OAAS,GACtD,OAAIU,KAAKmzB,iBACAnzB,KAAKmzB,iBAAiBtB,EAAKxqB,IAAKwqB,EAAK1uB,OAErC,CAAEkE,IAAKwqB,EAAKxqB,IAAKlE,MAAO0uB,EAAK1uB,QAQ7B,MAAAswB,SAYXjxB,YACS6E,EACAlE,EACPuwB,EACA3K,EACAC,GAJOhpB,KAAGqH,IAAHA,EACArH,KAAKmD,MAALA,EAKPnD,KAAK0zB,MAAiB,MAATA,EAAgBA,EAAQD,SAASE,IAC9C3zB,KAAK+oB,KACK,MAARA,EAAeA,EAAQ6K,UAAUC,WACnC7zB,KAAKgpB,MACM,MAATA,EAAgBA,EAAS4K,UAAUC,WAgBvCC,KACEzsB,EACAlE,EACAuwB,EACA3K,EACAC,GAEA,OAAO,IAAIyK,SACF,MAAPpsB,EAAcA,EAAMrH,KAAKqH,IAChB,MAATlE,EAAgBA,EAAQnD,KAAKmD,MACpB,MAATuwB,EAAgBA,EAAQ1zB,KAAK0zB,MACrB,MAAR3K,EAAeA,EAAO/oB,KAAK+oB,KAClB,MAATC,EAAgBA,EAAQhpB,KAAKgpB,OAOjC+K,QACE,OAAO/zB,KAAK+oB,KAAKgL,QAAU,EAAI/zB,KAAKgpB,MAAM+K,QAM5CtsB,UACE,OAAO,EAYTusB,iBAAiB3H,GACf,OACErsB,KAAK+oB,KAAKiL,iBAAiB3H,MACzBA,EAAOrsB,KAAKqH,IAAKrH,KAAKmD,QACxBnD,KAAKgpB,MAAMgL,iBAAiB3H,GAYhC4H,iBAAiB5H,GACf,OACErsB,KAAKgpB,MAAMiL,iBAAiB5H,IAC5BA,EAAOrsB,KAAKqH,IAAKrH,KAAKmD,QACtBnD,KAAK+oB,KAAKkL,iBAAiB5H,GAOvB6H,OACN,OAAIl0B,KAAK+oB,KAAKthB,UACLzH,KAECA,KAAK+oB,KAAwBmL,OAOzCC,SACE,OAAOn0B,KAAKk0B,OAAO7sB,IAMrB+sB,SACE,OAAIp0B,KAAKgpB,MAAMvhB,UACNzH,KAAKqH,IAELrH,KAAKgpB,MAAMoL,SAUtBC,OAAOhtB,EAAQlE,EAAU8vB,GACvB,IAAI9pB,EAAoBnJ,KACxB,MAAMmpB,EAAM8J,EAAW5rB,EAAK8B,EAAE9B,KAc9B,OAZE8B,EADEggB,EAAM,EACJhgB,EAAE2qB,KAAK,KAAM,KAAM,KAAM3qB,EAAE4f,KAAKsL,OAAOhtB,EAAKlE,EAAO8vB,GAAa,MACnD,IAAR9J,EACLhgB,EAAE2qB,KAAK,KAAM3wB,EAAO,KAAM,KAAM,MAEhCgG,EAAE2qB,KACJ,KACA,KACA,KACA,KACA3qB,EAAE6f,MAAMqL,OAAOhtB,EAAKlE,EAAO8vB,IAGxB9pB,EAAEmrB,SAMHC,aACN,GAAIv0B,KAAK+oB,KAAKthB,UACZ,OAAOmsB,UAAUC,WAEnB,IAAI1qB,EAAoBnJ,KAKxB,OAJKmJ,EAAE4f,KAAKyL,UAAarrB,EAAE4f,KAAKA,KAAKyL,WACnCrrB,EAAIA,EAAEsrB,gBAERtrB,EAAIA,EAAE2qB,KAAK,KAAM,KAAM,KAAO3qB,EAAE4f,KAAwBwL,aAAc,MAC/DprB,EAAEmrB,SAQXvnB,OACE1F,EACA4rB,GAEA,IAAI9pB,EAAGurB,EAEP,GADAvrB,EAAInJ,KACAizB,EAAW5rB,EAAK8B,EAAE9B,KAAO,EACtB8B,EAAE4f,KAAKthB,WAAc0B,EAAE4f,KAAKyL,UAAarrB,EAAE4f,KAAKA,KAAKyL,WACxDrrB,EAAIA,EAAEsrB,gBAERtrB,EAAIA,EAAE2qB,KAAK,KAAM,KAAM,KAAM3qB,EAAE4f,KAAKhc,OAAO1F,EAAK4rB,GAAa,UACxD,CAOL,GANI9pB,EAAE4f,KAAKyL,WACTrrB,EAAIA,EAAEwrB,gBAEHxrB,EAAE6f,MAAMvhB,WAAc0B,EAAE6f,MAAMwL,UAAarrB,EAAE6f,MAAMD,KAAKyL,WAC3DrrB,EAAIA,EAAEyrB,iBAEuB,IAA3B3B,EAAW5rB,EAAK8B,EAAE9B,KAAY,CAChC,GAAI8B,EAAE6f,MAAMvhB,UACV,OAAOmsB,UAAUC,WAEjBa,EAAYvrB,EAAE6f,MAAyBkL,OACvC/qB,EAAIA,EAAE2qB,KACJY,EAASrtB,IACTqtB,EAASvxB,MACT,KACA,KACCgG,EAAE6f,MAAyBuL,cAIlCprB,EAAIA,EAAE2qB,KAAK,KAAM,KAAM,KAAM,KAAM3qB,EAAE6f,MAAMjc,OAAO1F,EAAK4rB,IAEzD,OAAO9pB,EAAEmrB,SAMXE,SACE,OAAOx0B,KAAK0zB,MAMNY,SACN,IAAInrB,EAAoBnJ,KAUxB,OATImJ,EAAE6f,MAAMwL,WAAarrB,EAAE4f,KAAKyL,WAC9BrrB,EAAIA,EAAE0rB,eAEJ1rB,EAAE4f,KAAKyL,UAAYrrB,EAAE4f,KAAKA,KAAKyL,WACjCrrB,EAAIA,EAAEwrB,gBAEJxrB,EAAE4f,KAAKyL,UAAYrrB,EAAE6f,MAAMwL,WAC7BrrB,EAAIA,EAAE2rB,cAED3rB,EAMDsrB,eACN,IAAItrB,EAAInJ,KAAK80B,aAYb,OAXI3rB,EAAE6f,MAAMD,KAAKyL,WACfrrB,EAAIA,EAAE2qB,KACJ,KACA,KACA,KACA,KACC3qB,EAAE6f,MAAyB2L,gBAE9BxrB,EAAIA,EAAE0rB,cACN1rB,EAAIA,EAAE2rB,cAED3rB,EAMDyrB,gBACN,IAAIzrB,EAAInJ,KAAK80B,aAKb,OAJI3rB,EAAE4f,KAAKA,KAAKyL,WACdrrB,EAAIA,EAAEwrB,eACNxrB,EAAIA,EAAE2rB,cAED3rB,EAMD0rB,cACN,MAAME,EAAK/0B,KAAK8zB,KAAK,KAAM,KAAML,SAASE,IAAK,KAAM3zB,KAAKgpB,MAAMD,MAChE,OAAO/oB,KAAKgpB,MAAM8K,KAAK,KAAM,KAAM9zB,KAAK0zB,MAAOqB,EAAI,MAM7CJ,eACN,MAAMK,EAAKh1B,KAAK8zB,KAAK,KAAM,KAAML,SAASE,IAAK3zB,KAAK+oB,KAAKC,MAAO,MAChE,OAAOhpB,KAAK+oB,KAAK+K,KAAK,KAAM,KAAM9zB,KAAK0zB,MAAO,KAAMsB,GAM9CF,aACN,MAAM/L,EAAO/oB,KAAK+oB,KAAK+K,KAAK,KAAM,MAAO9zB,KAAK+oB,KAAK2K,MAAO,KAAM,MAC1D1K,EAAQhpB,KAAKgpB,MAAM8K,KAAK,KAAM,MAAO9zB,KAAKgpB,MAAM0K,MAAO,KAAM,MACnE,OAAO1zB,KAAK8zB,KAAK,KAAM,MAAO9zB,KAAK0zB,MAAO3K,EAAMC,GAQ1CiM,iBACN,MAAMC,EAAal1B,KAAKm1B,SACxB,OAAOnkB,KAAKE,IAAI,EAAKgkB,IAAel1B,KAAK+zB,QAAU,EAGrDoB,SACE,GAAIn1B,KAAKw0B,UAAYx0B,KAAK+oB,KAAKyL,SAC7B,MAAM,IAAIx1B,MACR,0BAA4BgB,KAAKqH,IAAM,IAAMrH,KAAKmD,MAAQ,KAG9D,GAAInD,KAAKgpB,MAAMwL,SACb,MAAM,IAAIx1B,MACR,mBAAqBgB,KAAKqH,IAAM,IAAMrH,KAAKmD,MAAQ,YAGvD,MAAM+xB,EAAal1B,KAAK+oB,KAAKoM,SAC7B,GAAID,IAAel1B,KAAKgpB,MAAMmM,SAC5B,MAAM,IAAIn2B,MAAM,uBAEhB,OAAOk2B,GAAcl1B,KAAKw0B,SAAW,EAAI,IApStCf,SAAGE,KAAG,EACNF,SAAK2B,OAAG,EAsZJ,MAAAxB,UAUXpxB,YACU6yB,EACAC,EAEkB1B,UAAUC,YAH5B7zB,KAAWq1B,YAAXA,EACAr1B,KAAKs1B,MAALA,EAaVjB,OAAOhtB,EAAQlE,GACb,OAAO,IAAIywB,UACT5zB,KAAKq1B,YACLr1B,KAAKs1B,MACFjB,OAAOhtB,EAAKlE,EAAOnD,KAAKq1B,aACxBvB,KAAK,KAAM,KAAML,SAAS2B,MAAO,KAAM,OAU9CroB,OAAO1F,GACL,OAAO,IAAIusB,UACT5zB,KAAKq1B,YACLr1B,KAAKs1B,MACFvoB,OAAO1F,EAAKrH,KAAKq1B,aACjBvB,KAAK,KAAM,KAAML,SAAS2B,MAAO,KAAM,OAW9CxoB,IAAIvF,GACF,IAAI8hB,EACA0I,EAAO7xB,KAAKs1B,MAChB,MAAQzD,EAAKpqB,WAAW,CAEtB,GADA0hB,EAAMnpB,KAAKq1B,YAAYhuB,EAAKwqB,EAAKxqB,KACrB,IAAR8hB,EACF,OAAO0I,EAAK1uB,MACHgmB,EAAM,EACf0I,EAAOA,EAAK9I,KACHI,EAAM,IACf0I,EAAOA,EAAK7I,OAGhB,OAAO,KAQTuM,kBAAkBluB,GAChB,IAAI8hB,EACF0I,EAAO7xB,KAAKs1B,MACZE,EAAc,KAChB,MAAQ3D,EAAKpqB,WAAW,CAEtB,GADA0hB,EAAMnpB,KAAKq1B,YAAYhuB,EAAKwqB,EAAKxqB,KACrB,IAAR8hB,EAAW,CACb,GAAK0I,EAAK9I,KAAKthB,UAMR,OAAI+tB,EACFA,EAAYnuB,IAEZ,KAPP,IADAwqB,EAAOA,EAAK9I,MACJ8I,EAAK7I,MAAMvhB,WACjBoqB,EAAOA,EAAK7I,MAEd,OAAO6I,EAAKxqB,IAML8hB,EAAM,EACf0I,EAAOA,EAAK9I,KACHI,EAAM,IACfqM,EAAc3D,EACdA,EAAOA,EAAK7I,OAIhB,MAAM,IAAIhqB,MACR,yEAOJyI,UACE,OAAOzH,KAAKs1B,MAAM7tB,UAMpBssB,QACE,OAAO/zB,KAAKs1B,MAAMvB,QAMpBI,SACE,OAAOn0B,KAAKs1B,MAAMnB,SAMpBC,SACE,OAAOp0B,KAAKs1B,MAAMlB,SAYpBJ,iBAAiB3H,GACf,OAAOrsB,KAAKs1B,MAAMtB,iBAAiB3H,GAWrC4H,iBAAiB5H,GACf,OAAOrsB,KAAKs1B,MAAMrB,iBAAiB5H,GAOrCoJ,YACEC,GAEA,OAAO,IAAI3C,kBACT/yB,KAAKs1B,MACL,KACAt1B,KAAKq1B,aACL,EACAK,GAIJC,gBACEtuB,EACAquB,GAEA,OAAO,IAAI3C,kBACT/yB,KAAKs1B,MACLjuB,EACArH,KAAKq1B,aACL,EACAK,GAIJE,uBACEvuB,EACAquB,GAEA,OAAO,IAAI3C,kBACT/yB,KAAKs1B,MACLjuB,EACArH,KAAKq1B,aACL,EACAK,GAIJG,mBACEH,GAEA,OAAO,IAAI3C,kBACT/yB,KAAKs1B,MACL,KACAt1B,KAAKq1B,aACL,EACAK,IC1vBU,SAAAI,qBAAqB/M,EAAiBC,GACpD,OAAOpZ,YAAYmZ,EAAKtmB,KAAMumB,EAAMvmB,MAGtB,SAAAszB,gBAAgBhN,EAAcC,GAC5C,OAAOpZ,YAAYmZ,EAAMC,GCF3B,IAAIgN,EFwiBKpC,UAAAC,WAAa,IA/GT,MAAAoC,cAYXnC,KACEzsB,EACAlE,EACAuwB,EACA3K,EACAC,GAEA,OAAOhpB,KAWTq0B,OAAOhtB,EAAQlE,EAAU8vB,GACvB,OAAO,IAAIQ,SAASpsB,EAAKlE,EAAO,MAUlC4J,OAAO1F,EAAQ4rB,GACb,OAAOjzB,KAMT+zB,QACE,OAAO,EAMTtsB,UACE,OAAO,EAWTusB,iBAAiB3H,GACf,OAAO,EAWT4H,iBAAiB5H,GACf,OAAO,EAGT8H,SACE,OAAO,KAGTC,SACE,OAAO,KAGTe,SACE,OAAO,EAMTX,SACE,OAAO,IEthBJ,MAAM0B,iBAAmB,SAAUC,GACxC,MAAwB,iBAAbA,EACF,UAAYzlB,sBAAsBylB,GAElC,UAAYA,GAOVC,qBAAuB,SAAUC,GAC5C,GAAIA,EAAaC,aAAc,CAC7B,MAAMxoB,EAAMuoB,EAAavoB,MACzBlP,OACiB,iBAARkP,GACU,iBAARA,GACS,iBAARA,GAAoB3G,SAAS2G,EAAkB,OACzD,6CAGFlP,OACEy3B,IAAiBL,GAAYK,EAAa5uB,UAC1C,gCAIJ7I,OACEy3B,IAAiBL,GAAYK,EAAaE,cAAc9uB,UACxD,uDCzBJ,IAAI+uB,ECXAC,EACAT,EDiBS,MAAAU,SAsBXl0B,YACmBm0B,EACTC,EAAsBF,SAASF,0BAA0B3C,YADhD7zB,KAAM22B,OAANA,EACT32B,KAAa42B,cAAbA,EATF52B,KAAS62B,UAAkB,KAWjCj4B,YACkByE,IAAhBrD,KAAK22B,QAAwC,OAAhB32B,KAAK22B,OAClC,4DAGFP,qBAAqBp2B,KAAK42B,eA9BjBJ,qCAA0B1oB,GACnC0oB,EAA4B1oB,EAGnB0oB,uCACT,OAAOA,EA6BTF,aACE,OAAO,EAITC,cACE,OAAOv2B,KAAK42B,cAIdE,eAAeC,GACb,OAAO,IAAIL,SAAS12B,KAAK22B,OAAQI,GAInCC,kBAAkBC,GAEhB,MAAkB,cAAdA,EACKj3B,KAAK42B,cAELF,SAASF,0BAA0B3C,WAK9CqD,SAAStP,GACP,OAAIY,YAAYZ,GACP5nB,KACyB,cAAvB2nB,aAAaC,GACf5nB,KAAK42B,cAELF,SAASF,0BAA0B3C,WAG9CsD,WACE,OAAO,EAITC,wBAAwBH,EAAmBI,GACzC,OAAO,KAITC,qBAAqBL,EAAmBM,GACtC,MAAkB,cAAdN,EACKj3B,KAAK82B,eAAeS,GAClBA,EAAa9vB,WAA2B,cAAdwvB,EAC5Bj3B,KAEA02B,SAASF,0BAA0B3C,WAAWyD,qBACnDL,EACAM,GACAT,eAAe92B,KAAK42B,eAK1BY,YAAY5P,EAAY2P,GACtB,MAAME,EAAQ9P,aAAaC,GAC3B,OAAc,OAAV6P,EACKF,EACEA,EAAa9vB,WAAuB,cAAVgwB,EAC5Bz3B,MAEPpB,OACY,cAAV64B,GAAiD,IAAxB5P,cAAcD,GACvC,8CAGK5nB,KAAKs3B,qBACVG,EACAf,SAASF,0BAA0B3C,WAAW2D,YAC5C1P,aAAaF,GACb2P,KAOR9vB,UACE,OAAO,EAITiwB,cACE,OAAO,EAITC,aAAa3K,EAAcX,GACzB,OAAO,EAETve,IAAI8pB,GACF,OAAIA,IAAiB53B,KAAKu2B,cAAc9uB,UAC/B,CACL,SAAUzH,KAAK63B,WACf,YAAa73B,KAAKu2B,cAAczoB,OAG3B9N,KAAK63B,WAKhBrS,OACE,GAAuB,OAAnBxlB,KAAK62B,UAAoB,CAC3B,IAAIiB,EAAS,GACR93B,KAAK42B,cAAcnvB,YACtBqwB,GACE,YACA5B,iBAAiBl2B,KAAK42B,cAAc9oB,OACpC,KAGJ,MAAM7D,SAAcjK,KAAK22B,OACzBmB,GAAU7tB,EAAO,IAEf6tB,GADW,WAAT7tB,EACQyG,sBAAsB1Q,KAAK22B,QAE3B32B,KAAK22B,OAEjB32B,KAAK62B,UAAYvoB,KAAKwpB,GAExB,OAAO93B,KAAK62B,UAOdgB,WACE,OAAO73B,KAAK22B,OAEdoB,UAAU1O,GACR,OAAIA,IAAUqN,SAASF,0BAA0B3C,WACxC,EACExK,aAAiBqN,SAASF,2BAC3B,GAER53B,OAAOyqB,EAAMiN,aAAc,qBACpBt2B,KAAKg4B,mBAAmB3O,IAO3B2O,mBAAmBC,GACzB,MAAMC,SAAuBD,EAAUtB,OACjCwB,SAAsBn4B,KAAK22B,OAC3ByB,EAAa1B,SAAS2B,iBAAiBvjB,QAAQojB,GAC/CI,EAAY5B,SAAS2B,iBAAiBvjB,QAAQqjB,GAGpD,OAFAv5B,OAAOw5B,GAAc,EAAG,sBAAwBF,GAChDt5B,OAAO05B,GAAa,EAAG,sBAAwBH,GAC3CC,IAAeE,EAEI,WAAjBH,EAEK,EAGHn4B,KAAK22B,OAASsB,EAAUtB,QAClB,EACC32B,KAAK22B,SAAWsB,EAAUtB,OAC5B,EAEA,EAIJ2B,EAAYF,EAGvBG,YACE,OAAOv4B,KAETw4B,YACE,OAAO,EAETC,OAAOpP,GACL,GAAIA,IAAUrpB,KACZ,OAAO,EACF,GAAIqpB,EAAMiN,aAAc,CAC7B,MAAM2B,EAAY5O,EAClB,OACErpB,KAAK22B,SAAWsB,EAAUtB,QAC1B32B,KAAK42B,cAAc6B,OAAOR,EAAUrB,eAGtC,OAAO,GArNJF,SAAgB2B,iBAAG,CAAC,SAAU,UAAW,SAAU,UCkBrD,MAAMK,EAAiB,IAtCxB,MAAOC,sBAAsB7G,MACjCE,QAAQlpB,EAAcC,GACpB,MAAM6vB,EAAY9vB,EAAE+oB,KAAK0E,cACnBsC,EAAY9vB,EAAE8oB,KAAK0E,cACnBuC,EAAWF,EAAUb,UAAUc,GACrC,OAAiB,IAAbC,EACKlpB,YAAY9G,EAAErG,KAAMsG,EAAEtG,MAEtBq2B,EAGXpG,YAAYb,GACV,OAAQA,EAAK0E,cAAc9uB,UAE7BwqB,oBAAoBC,EAAeC,GACjC,OAAQD,EAAQqE,cAAckC,OAAOtG,EAAQoE,eAE/CjE,UAEE,OAAQV,UAAkBW,IAE5BI,UACE,OAAO,IAAIf,UAAUjiB,EAAU,IAAI+mB,SAAS,kBAAmBV,IAGjEpD,SAASC,EAAqBpwB,GAC5B,MAAM4zB,EAAeI,EAAa5D,GAClC,OAAO,IAAIjB,UAAUnvB,EAAM,IAAIi0B,SAAS,kBAAmBL,IAM7DrpB,WACE,MAAO,cC/CL+rB,EAAQ/nB,KAAK7C,IAAI,GAEvB,MAAM6qB,UAKJx2B,YAAYlD,GACO,IAAC25B,EAIlBj5B,KAAK+zB,OAJakF,EAII35B,EAAS,EAF7BoG,SAAUsL,KAAK7C,IAAI8qB,GAAOF,EAAe,KAG3C/4B,KAAKk5B,SAAWl5B,KAAK+zB,MAAQ,EAC7B,MAAMoF,GAHW5nB,EAGIvR,KAAK+zB,MAHQruB,SAASnF,MAAMgR,EAAO,GAAGjQ,KAAK,KAAM,IAAtD,IAACiQ,EAIjBvR,KAAKo5B,MAAS95B,EAAS,EAAK65B,EAG9BE,eAEE,MAAM5J,IAAWzvB,KAAKo5B,MAAS,GAAOp5B,KAAKk5B,UAE3C,OADAl5B,KAAKk5B,WACEzJ,GAiBJ,MAAM6J,cAAgB,SAC3BC,EACApQ,EACAqQ,EACAC,GAEAF,EAAUnpB,KAAK+Y,GAEf,MAAMuQ,kBAAoB,SACxBC,EACAprB,GAEA,MAAMjP,EAASiP,EAAOorB,EACtB,IAAIC,EACAvyB,EACJ,GAAe,IAAX/H,EACF,OAAO,KACF,GAAe,IAAXA,EAGT,OAFAs6B,EAAYL,EAAUI,GACtBtyB,EAAMmyB,EAAQA,EAAMI,GAAcA,EAC3B,IAAInG,SACTpsB,EACAuyB,EAAU/H,KACV4B,SAAS2B,MACT,KACA,MAEG,CAEL,MAAMyE,EAASn0B,SAAUpG,EAAS,EAAW,IAAMq6B,EAC7C5Q,EAAO2Q,kBAAkBC,EAAKE,GAC9B7Q,EAAQ0Q,kBAAkBG,EAAS,EAAGtrB,GAG5C,OAFAqrB,EAAYL,EAAUM,GACtBxyB,EAAMmyB,EAAQA,EAAMI,GAAcA,EAC3B,IAAInG,SACTpsB,EACAuyB,EAAU/H,KACV4B,SAAS2B,MACTrM,EACAC,KAsDA8Q,EAjDmB,SAAUC,GACjC,IAAIlI,EAAuB,KACvBiI,EAAO,KACP9M,EAAQuM,EAAUj6B,OAEtB,MAAM06B,aAAe,SAAUC,EAAmBvG,GAChD,MAAMiG,EAAM3M,EAAQiN,EACd1rB,EAAOye,EACbA,GAASiN,EACT,MAAMC,EAAYR,kBAAkBC,EAAM,EAAGprB,GACvCqrB,EAAYL,EAAUI,GACtBtyB,EAASmyB,EAAQA,EAAMI,GAAcA,EAC3CO,cACE,IAAI1G,SACFpsB,EACAuyB,EAAU/H,KACV6B,EACA,KACAwG,KAKAC,cAAgB,SAAUC,GAC1BvI,GACFA,EAAK9I,KAAOqR,EACZvI,EAAOuI,IAEPN,EAAOM,EACPvI,EAAOuI,IAIX,IAAK,IAAI/6B,EAAI,EAAGA,EAAI06B,EAAOhG,QAAS10B,EAAG,CACrC,MAAMg7B,EAAQN,EAAOV,eAEfY,EAAYjpB,KAAKE,IAAI,EAAG6oB,EAAOhG,OAAS10B,EAAI,IAC9Cg7B,EACFL,aAAaC,EAAWxG,SAAS2B,QAGjC4E,aAAaC,EAAWxG,SAAS2B,OACjC4E,aAAaC,EAAWxG,SAASE,MAGrC,OAAOmG,EAIIQ,CADE,IAAItB,UAAUO,EAAUj6B,SAGvC,OAAO,IAAIs0B,UAAgB6F,GAActQ,EAAa2Q,IChIxD,IAAIS,EAEJ,MAAMC,EAAiB,GAEV,MAAAC,SAkBXj4B,YACUk4B,EAGAC,GAHA36B,KAAQ06B,SAARA,EAGA16B,KAAS26B,UAATA,EAlBCC,qBAWT,OAVAh8B,OACE47B,GAAkB9B,EAClB,uCAEF6B,EACEA,GACA,IAAIE,SACF,CAAE,YAAaD,GACf,CAAE,YAAa9B,IAEZ6B,EAUT3tB,IAAIiuB,GACF,MAAMC,EAAYtzB,QAAQxH,KAAK06B,SAAUG,GACzC,IAAKC,EACH,MAAM,IAAI97B,MAAM,wBAA0B67B,GAG5C,OAAIC,aAAqBlH,UAChBkH,EAIA,KAIXC,SAASC,GACP,OAAO7zB,SAASnH,KAAK26B,UAAWK,EAAgBhuB,YAGlDiuB,SACED,EACAE,GAEAt8B,OACEo8B,IAAoBlI,EACpB,uEAEF,MAAMyG,EAAY,GAClB,IAAI4B,GAAkB,EACtB,MAAMC,EAAOF,EAAiBzF,YAAY7D,UAAUyJ,MACpD,IAOIC,EAPAC,EAAOH,EAAK/H,UAChB,KAAOkI,GACLJ,EACEA,GAAmBH,EAAgBtI,YAAY6I,EAAK1J,MACtD0H,EAAUl4B,KAAKk6B,GACfA,EAAOH,EAAK/H,UAIZiI,EADEH,EACS7B,cAAcC,EAAWyB,EAAgBjJ,cAEzCyI,EAEb,MAAMgB,EAAYR,EAAgBhuB,WAC5ByuB,EAAmBj4B,OAAA8gB,OAAA,GAAAtkB,KAAK26B,WAC9Bc,EAAYD,GAAaR,EACzB,MAAMU,EAAkBl4B,OAAA8gB,OAAA,GAAAtkB,KAAK06B,UAE7B,OADAgB,EAAWF,GAAaF,EACjB,IAAIb,SAASiB,EAAYD,GAMlCE,aACE/B,EACAsB,GAEA,MAAMQ,EAAah0B,IACjB1H,KAAK06B,UACL,CAACkB,EAA6CJ,KAC5C,MAAMxO,EAAQxlB,QAAQxH,KAAK26B,UAAWa,GAEtC,GADA58B,OAAOouB,EAAO,oCAAsCwO,GAChDI,IAAoBpB,EAAgB,CAEtC,GAAIxN,EAAM0F,YAAYkH,EAAU/H,MAAO,CAErC,MAAM0H,EAAY,GACZ6B,EAAOF,EAAiBzF,YAAY7D,UAAUyJ,MACpD,IAAIE,EAAOH,EAAK/H,UAChB,KAAOkI,GACDA,EAAK94B,OAASm3B,EAAUn3B,MAC1B82B,EAAUl4B,KAAKk6B,GAEjBA,EAAOH,EAAK/H,UAGd,OADAkG,EAAUl4B,KAAKu4B,GACRN,cAAcC,EAAWvM,EAAM+E,cAGtC,OAAOyI,EAEJ,CACL,MAAMqB,EAAeX,EAAiBtuB,IAAIgtB,EAAUn3B,MACpD,IAAIq5B,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAY/uB,OACxB,IAAI6kB,UAAUgI,EAAUn3B,KAAMo5B,KAG3BC,EAAYzH,OAAOuF,EAAWA,EAAU/H,UAIrD,OAAO,IAAI4I,SAASiB,EAAY17B,KAAK26B,WAMvCoB,kBACEnC,EACAsB,GAEA,MAAMQ,EAAah0B,IACjB1H,KAAK06B,UACJkB,IACC,GAAIA,IAAoBpB,EAEtB,OAAOoB,EACF,CACL,MAAMC,EAAeX,EAAiBtuB,IAAIgtB,EAAUn3B,MACpD,OAAIo5B,EACKD,EAAgB7uB,OACrB,IAAI6kB,UAAUgI,EAAUn3B,KAAMo5B,IAIzBD,MAKf,OAAO,IAAInB,SAASiB,EAAY17B,KAAK26B,YCrIzC,IAAI9G,EAOS,MAAAmI,aAkBXx5B,YACmBy5B,EACArF,EACTsF,GAFSl8B,KAASi8B,UAATA,EACAj8B,KAAa42B,cAAbA,EACT52B,KAASk8B,UAATA,EApBFl8B,KAAS62B,UAAkB,KA2B7B72B,KAAK42B,eACPR,qBAAqBp2B,KAAK42B,eAGxB52B,KAAKi8B,UAAUx0B,WACjB7I,QACGoB,KAAK42B,eAAiB52B,KAAK42B,cAAcnvB,UAC1C,wCAhCKosB,wBACT,OACEA,IACCA,EAAa,IAAImI,aAChB,IAAIpI,UAAwBmC,iBAC5B,KACA0E,SAASG,UAgCftE,aACE,OAAO,EAITC,cACE,OAAOv2B,KAAK42B,eAAiB/C,EAI/BiD,eAAeC,GACb,OAAI/2B,KAAKi8B,UAAUx0B,UAEVzH,KAEA,IAAIg8B,aAAah8B,KAAKi8B,UAAWlF,EAAiB/2B,KAAKk8B,WAKlElF,kBAAkBC,GAEhB,GAAkB,cAAdA,EACF,OAAOj3B,KAAKu2B,cACP,CACL,MAAM4F,EAAQn8B,KAAKi8B,UAAUrvB,IAAIqqB,GACjC,OAAiB,OAAVkF,EAAiBtI,EAAasI,GAKzCjF,SAAStP,GACP,MAAM6P,EAAQ9P,aAAaC,GAC3B,OAAc,OAAV6P,EACKz3B,KAGFA,KAAKg3B,kBAAkBS,GAAOP,SAASpP,aAAaF,IAI7DuP,SAASF,GACP,OAAyC,OAAlCj3B,KAAKi8B,UAAUrvB,IAAIqqB,GAI5BK,qBAAqBL,EAAmBM,GAEtC,GADA34B,OAAO24B,EAAc,8CACH,cAAdN,EACF,OAAOj3B,KAAK82B,eAAeS,GACtB,CACL,MAAMqC,EAAY,IAAIhI,UAAUqF,EAAWM,GAC3C,IAAIuE,EAAaM,EACb7E,EAAa9vB,WACfq0B,EAAc97B,KAAKi8B,UAAUlvB,OAAOkqB,GACpCmF,EAAcp8B,KAAKk8B,UAAUH,kBAC3BnC,EACA55B,KAAKi8B,aAGPH,EAAc97B,KAAKi8B,UAAU5H,OAAO4C,EAAWM,GAC/C6E,EAAcp8B,KAAKk8B,UAAUP,aAAa/B,EAAW55B,KAAKi8B,YAG5D,MAAMI,EAAcP,EAAYr0B,UAC5BosB,EACA7zB,KAAK42B,cACT,OAAO,IAAIoF,aAAaF,EAAaO,EAAaD,IAKtD5E,YAAY5P,EAAY2P,GACtB,MAAME,EAAQ9P,aAAaC,GAC3B,GAAc,OAAV6P,EACF,OAAOF,EACF,CACL34B,OACyB,cAAvB+oB,aAAaC,IAAiD,IAAxBC,cAAcD,GACpD,8CAEF,MAAM0U,EAAoBt8B,KAAKg3B,kBAAkBS,GAAOD,YACtD1P,aAAaF,GACb2P,GAEF,OAAOv3B,KAAKs3B,qBAAqBG,EAAO6E,IAK5C70B,UACE,OAAOzH,KAAKi8B,UAAUx0B,UAIxBiwB,cACE,OAAO13B,KAAKi8B,UAAUlI,QAMxBjmB,IAAI8pB,GACF,GAAI53B,KAAKyH,UACP,OAAO,KAGT,MAAML,EAAgC,GACtC,IAAIm1B,EAAU,EACZnI,EAAS,EACToI,GAAiB,EAYnB,GAXAx8B,KAAK23B,aAAae,GAAgB,CAACrxB,EAAagwB,KAC9CjwB,EAAIC,GAAOgwB,EAAUvpB,IAAI8pB,GAEzB2E,IACIC,GAAkBR,aAAanqB,gBAAgBxL,KAAKgB,GACtD+sB,EAASpjB,KAAK2Y,IAAIyK,EAAQ7kB,OAAOlI,IAEjCm1B,GAAiB,MAIhB5E,GAAgB4E,GAAkBpI,EAAS,EAAImI,EAAS,CAE3D,MAAME,EAAmB,GAEzB,IAAK,MAAMp1B,KAAOD,EAChBq1B,EAAMp1B,GAA4BD,EAAIC,GAGxC,OAAOo1B,EAKP,OAHI7E,IAAiB53B,KAAKu2B,cAAc9uB,YACtCL,EAAI,aAAepH,KAAKu2B,cAAczoB,OAEjC1G,EAKXoe,OACE,GAAuB,OAAnBxlB,KAAK62B,UAAoB,CAC3B,IAAIiB,EAAS,GACR93B,KAAKu2B,cAAc9uB,YACtBqwB,GACE,YACA5B,iBAAiBl2B,KAAKu2B,cAAczoB,OACpC,KAGJ9N,KAAK23B,aAAae,GAAgB,CAACrxB,EAAKgwB,KACtC,MAAMqF,EAAYrF,EAAU7R,OACV,KAAdkX,IACF5E,GAAU,IAAMzwB,EAAM,IAAMq1B,MAIhC18B,KAAK62B,UAAuB,KAAXiB,EAAgB,GAAKxpB,KAAKwpB,GAE7C,OAAO93B,KAAK62B,UAIdO,wBACEH,EACAI,EACArK,GAEA,MAAM2P,EAAM38B,KAAK48B,cAAc5P,GAC/B,GAAI2P,EAAK,CACP,MAAME,EAAcF,EAAIpH,kBACtB,IAAI3D,UAAUqF,EAAWI,IAE3B,OAAOwF,EAAcA,EAAYp6B,KAAO,KAExC,OAAOzC,KAAKi8B,UAAU1G,kBAAkB0B,GAI5C6F,kBAAkB9B,GAChB,MAAM2B,EAAM38B,KAAK48B,cAAc5B,GAC/B,GAAI2B,EAAK,CACP,MAAMxI,EAASwI,EAAIxI,SACnB,OAAOA,GAAUA,EAAO1xB,KAExB,OAAOzC,KAAKi8B,UAAU9H,SAI1B4I,cAAc/B,GACZ,MAAM7G,EAASn0B,KAAK88B,kBAAkB9B,GACtC,OAAI7G,EACK,IAAIvC,UAAUuC,EAAQn0B,KAAKi8B,UAAUrvB,IAAIunB,IAEzC,KAOX6I,iBAAiBhC,GACf,MAAM2B,EAAM38B,KAAK48B,cAAc5B,GAC/B,GAAI2B,EAAK,CACP,MAAMvI,EAASuI,EAAIvI,SACnB,OAAOA,GAAUA,EAAO3xB,KAExB,OAAOzC,KAAKi8B,UAAU7H,SAI1B6I,aAAajC,GACX,MAAM5G,EAASp0B,KAAKg9B,iBAAiBhC,GACrC,OAAI5G,EACK,IAAIxC,UAAUwC,EAAQp0B,KAAKi8B,UAAUrvB,IAAIwnB,IAEzC,KAGXuD,aACE3K,EACAX,GAEA,MAAMsQ,EAAM38B,KAAK48B,cAAc5P,GAC/B,OAAI2P,EACKA,EAAI3I,kBAAiBkJ,GACnB7Q,EAAO6Q,EAAYz6B,KAAMy6B,EAAYrL,QAGvC7xB,KAAKi8B,UAAUjI,iBAAiB3H,GAI3CoJ,YACEuF,GAEA,OAAOh7B,KAAK21B,gBAAgBqF,EAAgB1I,UAAW0I,GAGzDrF,gBACEwH,EACAnC,GAEA,MAAM2B,EAAM38B,KAAK48B,cAAc5B,GAC/B,GAAI2B,EACF,OAAOA,EAAIhH,gBAAgBwH,GAAW91B,GAAOA,IACxC,CACL,MAAM+1B,EAAWp9B,KAAKi8B,UAAUtG,gBAC9BwH,EAAU16B,KACVmvB,UAAUyJ,MAEZ,IAAIE,EAAO6B,EAAS5J,OACpB,KAAe,MAAR+H,GAAgBP,EAAgBhJ,QAAQuJ,EAAM4B,GAAa,GAChEC,EAAS/J,UACTkI,EAAO6B,EAAS5J,OAElB,OAAO4J,GAIXvH,mBACEmF,GAEA,OAAOh7B,KAAK41B,uBACVoF,EAAgBrI,UAChBqI,GAIJpF,uBACEyH,EACArC,GAEA,MAAM2B,EAAM38B,KAAK48B,cAAc5B,GAC/B,GAAI2B,EACF,OAAOA,EAAI/G,uBAAuByH,GAASh2B,GAClCA,IAEJ,CACL,MAAM+1B,EAAWp9B,KAAKi8B,UAAUrG,uBAC9ByH,EAAQ56B,KACRmvB,UAAUyJ,MAEZ,IAAIE,EAAO6B,EAAS5J,OACpB,KAAe,MAAR+H,GAAgBP,EAAgBhJ,QAAQuJ,EAAM8B,GAAW,GAC9DD,EAAS/J,UACTkI,EAAO6B,EAAS5J,OAElB,OAAO4J,GAGXrF,UAAU1O,GACR,OAAIrpB,KAAKyH,UACH4hB,EAAM5hB,UACD,GAEC,EAED4hB,EAAMiN,cAAgBjN,EAAM5hB,UAC9B,EACE4hB,IAAU2M,GACX,EAGD,EAGXuC,UAAUyC,GACR,GACEA,IAAoBlI,GACpB9yB,KAAKk8B,UAAUnB,SAASC,GAExB,OAAOh7B,KACF,CACL,MAAMo8B,EAAcp8B,KAAKk8B,UAAUjB,SACjCD,EACAh7B,KAAKi8B,WAEP,OAAO,IAAID,aAAah8B,KAAKi8B,UAAWj8B,KAAK42B,cAAewF,IAGhE5D,UAAUxL,GACR,OAAOA,IAAU8F,GAAa9yB,KAAKk8B,UAAUnB,SAAS/N,GAExDyL,OAAOpP,GACL,GAAIA,IAAUrpB,KACZ,OAAO,EACF,GAAIqpB,EAAMiN,aACf,OAAO,EACF,CACL,MAAMgH,EAAoBjU,EAC1B,GAAKrpB,KAAKu2B,cAAckC,OAAO6E,EAAkB/G,eAE1C,CAAA,GACLv2B,KAAKi8B,UAAUlI,UAAYuJ,EAAkBrB,UAAUlI,QACvD,CACA,MAAMwJ,EAAWv9B,KAAKy1B,YAAYiD,GAC5B8E,EAAYF,EAAkB7H,YAAYiD,GAChD,IAAI+E,EAAcF,EAASlK,UACvBqK,EAAeF,EAAUnK,UAC7B,KAAOoK,GAAeC,GAAc,CAClC,GACED,EAAYh7B,OAASi7B,EAAaj7B,OACjCg7B,EAAY5L,KAAK4G,OAAOiF,EAAa7L,MAEtC,OAAO,EAET4L,EAAcF,EAASlK,UACvBqK,EAAeF,EAAUnK,UAE3B,OAAuB,OAAhBoK,GAAyC,OAAjBC,EAE/B,OAAO,EApBP,OAAO,GA8BLd,cACN5B,GAEA,OAAIA,IAAoBlI,EACf,KAEA9yB,KAAKk8B,UAAUtvB,IAAIouB,EAAgBhuB,aA7Q/BgvB,aAAenqB,gBAAG,iBAwT5B,MAAMmkB,EAAW,IAtClB,MAAO2H,gBAAgB3B,aAC3Bx5B,cACEykB,MACE,IAAI2M,UAAwBmC,iBAC5BiG,aAAanI,WACb4G,SAASG,SAIb7C,UAAU1O,GACR,OAAIA,IAAUrpB,KACL,EAEA,EAIXy4B,OAAOpP,GAEL,OAAOA,IAAUrpB,KAGnBu2B,cACE,OAAOv2B,KAGTg3B,kBAAkBC,GAChB,OAAO+E,aAAanI,WAGtBpsB,UACE,OAAO,IAmBXjE,OAAOo6B,iBAAiBhM,UAAW,CACjCW,IAAK,CACHpvB,MAAO,IAAIyuB,UAAUliB,EAAUssB,aAAanI,aAE9CgK,IAAK,CACH16B,MAAO,IAAIyuB,UAAUjiB,EAAUqmB,MAOnCvD,SAASD,aAAewJ,aAAanI,WACrC6C,SAASF,0BAA4BwF,aLxf/B,SAAU8B,aAAWhwB,GACzBkoB,EAAWloB,EKwfbgwB,CAAW9H,GHrfL,SAAU8H,WAAWhwB,GACzBkoB,EAAWloB,EGqfbiwB,CAAmB/H,GC7eH,SAAAS,aACduH,EACA7H,EAAoB,MAEpB,GAAa,OAAT6H,EACF,OAAOhC,aAAanI,WAoBtB,GAjBoB,iBAATmK,GAAqB,cAAeA,IAC7C7H,EAAW6H,EAAK,cAGlBp/B,OACe,OAAbu3B,GACsB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,iBAAT6H,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,iBAATA,GAAqB,QAASA,EAAM,CAE7C,OAAO,IAAItH,SADMsH,EACavH,aAAaN,IAG7C,GAAM6H,aAAgBz9B,MA8Cf,CACL,IAAIsxB,EAAamK,aAAanI,WAa9B,OAZApjB,KAAKutB,GAAM,CAAC32B,EAAa42B,KACvB,GAAI92B,SAAS62B,EAAgB32B,IACC,MAAxBA,EAAI1B,UAAU,EAAG,GAAY,CAE/B,MAAM0xB,EAAYZ,aAAawH,IAC3B5G,EAAUf,cAAiBe,EAAU5vB,YACvCoqB,EAAOA,EAAKyF,qBAAqBjwB,EAAKgwB,QAMvCxF,EAAKiF,eAAeL,aAAaN,IA5DC,CACzC,MAAM+H,EAAwB,GAC9B,IAAIC,GAAuB,EAc3B,GAZA1tB,KADqButB,GACF,CAAC32B,EAAK80B,KACvB,GAA4B,MAAxB90B,EAAI1B,UAAU,EAAG,GAAY,CAE/B,MAAM0xB,EAAYZ,aAAa0F,GAC1B9E,EAAU5vB,YACb02B,EACEA,IAAyB9G,EAAUd,cAAc9uB,UACnDy2B,EAAS78B,KAAK,IAAIuwB,UAAUvqB,EAAKgwB,SAKf,IAApB6G,EAAS5+B,OACX,OAAO08B,aAAanI,WAGtB,MAAMuK,EAAW9E,cACf4E,EACApI,sBACA8D,GAAaA,EAAUn3B,MACvBszB,iBAEF,GAAIoI,EAAsB,CACxB,MAAME,EAAiB/E,cACrB4E,EACAxF,EAAe3G,cAEjB,OAAO,IAAIiK,aACToC,EACA3H,aAAaN,GACb,IAAIsE,SACF,CAAE,YAAa4D,GACf,CAAE,YAAa3F,KAInB,OAAO,IAAIsD,aACToC,EACA3H,aAAaN,GACbsE,SAASG,WJtFX,SAAU0D,gBAAgBxwB,GAC9B2oB,EAAe3oB,EI0GjBwwB,CAAgB7H,cC1GV,MAAO8H,kBAAkBzM,MAC7BtvB,YAAoBg8B,GAClBvX,QADkBjnB,KAAUw+B,WAAVA,EAGlB5/B,QACG4pB,YAAYgW,IAA4C,cAA7B7W,aAAa6W,GACzC,2DAIMC,aAAaC,GACrB,OAAOA,EAAKxH,SAASl3B,KAAKw+B,YAE5B9L,YAAYb,GACV,OAAQA,EAAKqF,SAASl3B,KAAKw+B,YAAY/2B,UAEzCuqB,QAAQlpB,EAAcC,GACpB,MAAM41B,EAAS3+B,KAAKy+B,aAAa31B,EAAE+oB,MAC7B+M,EAAS5+B,KAAKy+B,aAAa11B,EAAE8oB,MAC7BiH,EAAW6F,EAAO5G,UAAU6G,GAClC,OAAiB,IAAb9F,EACKlpB,YAAY9G,EAAErG,KAAMsG,EAAEtG,MAEtBq2B,EAGXlG,SAASC,EAAoBpwB,GAC3B,MAAMo8B,EAAYpI,aAAa5D,GACzBhB,EAAOmK,aAAanI,WAAW2D,YACnCx3B,KAAKw+B,WACLK,GAEF,OAAO,IAAIjN,UAAUnvB,EAAMovB,GAE7Bc,UACE,MAAMd,EAAOmK,aAAanI,WAAW2D,YAAYx3B,KAAKw+B,WAAYxI,GAClE,OAAO,IAAIpE,UAAUjiB,EAAUkiB,GAEjC7kB,WACE,OAAOgb,UAAUhoB,KAAKw+B,WAAY,GAAGl9B,KAAK,MCNvC,MAAMw9B,EAAc,IArCrB,MAAOC,mBAAmBjN,MAC9BE,QAAQlpB,EAAcC,GACpB,MAAM+vB,EAAWhwB,EAAE+oB,KAAKkG,UAAUhvB,EAAE8oB,MACpC,OAAiB,IAAbiH,EACKlpB,YAAY9G,EAAErG,KAAMsG,EAAEtG,MAEtBq2B,EAGXpG,YAAYb,GACV,OAAO,EAETI,oBAAoBC,EAAeC,GACjC,OAAQD,EAAQuG,OAAOtG,GAEzBG,UAEE,OAAQV,UAAkBW,IAE5BI,UAEE,OAAQf,UAAkBiM,IAG5BjL,SAASC,EAAoBpwB,GAC3B,MAAMo8B,EAAYpI,aAAa5D,GAC/B,OAAO,IAAIjB,UAAUnvB,EAAMo8B,GAM7B7xB,WACE,MAAO,WCXL,SAAUgyB,YAAYC,GAC1B,MAAO,CAAEh1B,KAAI,QAAoBg1B,aAAAA,GAGnB,SAAAC,iBACdjI,EACAgI,GAEA,MAAO,CAAEh1B,KAA4B,cAAEg1B,aAAAA,EAAchI,UAAAA,GAGvC,SAAAkI,mBACdlI,EACAgI,GAEA,MAAO,CAAEh1B,KAA8B,gBAAEg1B,aAAAA,EAAchI,UAAAA,GAGzC,SAAAmI,mBACdnI,EACAgI,EACAI,GAEA,MAAO,CACLp1B,KAA8B,gBAC9Bg1B,aAAAA,EACAhI,UAAAA,EACAoI,QAAAA,GCnCS,MAAAC,cACX98B,YAA6B+8B,GAAAv/B,KAAMu/B,OAANA,EAE7B/H,YACEkH,EACAr3B,EACAm4B,EACAC,EACAl8B,EACAm8B,GAEA9gC,OACE8/B,EAAKlG,UAAUx4B,KAAKu/B,QACpB,qDAEF,MAAMI,EAAWjB,EAAK1H,kBAAkB3vB,GAExC,OACEs4B,EAASzI,SAASuI,GAAchH,OAAO+G,EAAStI,SAASuI,KAKrDE,EAASl4B,YAAc+3B,EAAS/3B,UAK3Bi3B,GAIiB,MAAxBgB,IACEF,EAAS/3B,UACPi3B,EAAKvH,SAAS9vB,GAChBq4B,EAAqBE,iBACnBT,mBAAmB93B,EAAKs4B,IAG1B/gC,OACE8/B,EAAKpI,aACL,uEAGKqJ,EAASl4B,UAClBi4B,EAAqBE,iBAAiBV,iBAAiB73B,EAAKm4B,IAE5DE,EAAqBE,iBACnBR,mBAAmB/3B,EAAKm4B,EAAUG,KAIpCjB,EAAKpI,cAAgBkJ,EAAS/3B,UACzBi3B,EAGAA,EAAKpH,qBAAqBjwB,EAAKm4B,GAAUjH,UAAUv4B,KAAKu/B,SAGnEM,eACER,EACAS,EACAJ,GA6BA,OA3B4B,MAAxBA,IACGL,EAAQ/I,cACX+I,EAAQ1H,aAAae,GAAgB,CAACrxB,EAAKgwB,KACpCyI,EAAQ3I,SAAS9vB,IACpBq4B,EAAqBE,iBACnBT,mBAAmB93B,EAAKgwB,OAK3ByI,EAAQxJ,cACXwJ,EAAQnI,aAAae,GAAgB,CAACrxB,EAAKgwB,KACzC,GAAIgI,EAAQlI,SAAS9vB,GAAM,CACzB,MAAMs4B,EAAWN,EAAQrI,kBAAkB3vB,GACtCs4B,EAASlH,OAAOpB,IACnBqI,EAAqBE,iBACnBR,mBAAmB/3B,EAAKgwB,EAAWsI,SAIvCD,EAAqBE,iBACnBV,iBAAiB73B,EAAKgwB,QAMzByI,EAAQvH,UAAUv4B,KAAKu/B,QAEhCzI,eAAeuI,EAAehD,GAC5B,OAAIgD,EAAQ53B,UACHu0B,aAAanI,WAEbwL,EAAQvI,eAAeuF,GAGlC0D,eACE,OAAO,EAETC,mBACE,OAAOhgC,KAETouB,WACE,OAAOpuB,KAAKu/B,QChHH,MAAAU,aAaXz9B,YAAYgT,GACVxV,KAAKkgC,eAAiB,IAAIZ,cAAc9pB,EAAO4Y,YAC/CpuB,KAAKu/B,OAAS/pB,EAAO4Y,WACrBpuB,KAAKmgC,WAAaF,aAAaG,cAAc5qB,GAC7CxV,KAAKqgC,SAAWJ,aAAaK,YAAY9qB,GACzCxV,KAAKugC,mBAAqB/qB,EAAOgrB,eACjCxgC,KAAKygC,iBAAmBjrB,EAAOkrB,cAGjCC,eACE,OAAO3gC,KAAKmgC,WAGdS,aACE,OAAO5gC,KAAKqgC,SAGdQ,QAAQhP,GACN,MAAMiP,EAAgB9gC,KAAKugC,kBACvBvgC,KAAKu/B,OAAOvN,QAAQhyB,KAAK2gC,eAAgB9O,IAAS,EAClD7xB,KAAKu/B,OAAOvN,QAAQhyB,KAAK2gC,eAAgB9O,GAAQ,EAC/CkP,EAAc/gC,KAAKygC,gBACrBzgC,KAAKu/B,OAAOvN,QAAQH,EAAM7xB,KAAK4gC,eAAiB,EAChD5gC,KAAKu/B,OAAOvN,QAAQH,EAAM7xB,KAAK4gC,cAAgB,EACnD,OAAOE,GAAiBC,EAE1BvJ,YACEkH,EACAr3B,EACAm4B,EACAC,EACAl8B,EACAm8B,GAKA,OAHK1/B,KAAK6gC,QAAQ,IAAIjP,UAAUvqB,EAAKm4B,MACnCA,EAAWxD,aAAanI,YAEnB7zB,KAAKkgC,eAAe1I,YACzBkH,EACAr3B,EACAm4B,EACAC,EACAl8B,EACAm8B,GAGJG,eACER,EACAS,EACAJ,GAEII,EAAQxJ,eAEVwJ,EAAU9D,aAAanI,YAEzB,IAAImN,EAAWlB,EAAQvH,UAAUv4B,KAAKu/B,QAEtCyB,EAAWA,EAASlK,eAAekF,aAAanI,YAChD,MAAM9vB,EAAO/D,KAMb,OALA8/B,EAAQnI,aAAae,GAAgB,CAACrxB,EAAKgwB,KACpCtzB,EAAK88B,QAAQ,IAAIjP,UAAUvqB,EAAKgwB,MACnC2J,EAAWA,EAAS1J,qBAAqBjwB,EAAK20B,aAAanI,gBAGxD7zB,KAAKkgC,eAAeL,eACzBR,EACA2B,EACAtB,GAGJ5I,eAAeuI,EAAehD,GAE5B,OAAOgD,EAETU,eACE,OAAO,EAETC,mBACE,OAAOhgC,KAAKkgC,eAEd9R,WACE,OAAOpuB,KAAKu/B,OAGNrlB,qBAAqB1E,GAC3B,GAAIA,EAAOyrB,WAAY,CACrB,MAAMC,EAAY1rB,EAAO2rB,oBACzB,OAAO3rB,EAAO4Y,WAAWwE,SAASpd,EAAO4rB,qBAAsBF,GAE/D,OAAO1rB,EAAO4Y,WAAWkE,UAIrBpY,mBAAmB1E,GACzB,GAAIA,EAAO6rB,SAAU,CACnB,MAAMC,EAAU9rB,EAAO+rB,kBACvB,OAAO/rB,EAAO4Y,WAAWwE,SAASpd,EAAOgsB,mBAAoBF,GAE7D,OAAO9rB,EAAO4Y,WAAWuE,WCxGlB,MAAA8O,cAaXj/B,YAAYgT,GAgPJxV,KAAsB0hC,uBAAI7P,GAChC7xB,KAAK2hC,SAAW3hC,KAAK4hC,cAAc/P,GAAQ7xB,KAAK6hC,gBAAgBhQ,GAE1D7xB,KAAoB8hC,qBAAIjQ,GAC9B7xB,KAAK2hC,SAAW3hC,KAAK6hC,gBAAgBhQ,GAAQ7xB,KAAK4hC,cAAc/P,GAE1D7xB,KAAA6hC,gBAAmBhQ,IACzB,MAAMkQ,EAAa/hC,KAAKu/B,OAAOvN,QAC7BhyB,KAAKgiC,cAAcrB,eACnB9O,GAEF,OAAO7xB,KAAKugC,kBAAoBwB,GAAc,EAAIA,EAAa,GAGzD/hC,KAAA4hC,cAAiB/P,IACvB,MAAMkQ,EAAa/hC,KAAKu/B,OAAOvN,QAC7BH,EACA7xB,KAAKgiC,cAAcpB,cAErB,OAAO5gC,KAAKygC,gBAAkBsB,GAAc,EAAIA,EAAa,GAlQ7D/hC,KAAKgiC,cAAgB,IAAI/B,aAAazqB,GACtCxV,KAAKu/B,OAAS/pB,EAAO4Y,WACrBpuB,KAAKiiC,OAASzsB,EAAO0sB,WACrBliC,KAAK2hC,UAAYnsB,EAAO2sB,iBACxBniC,KAAKugC,mBAAqB/qB,EAAOgrB,eACjCxgC,KAAKygC,iBAAmBjrB,EAAOkrB,cAEjClJ,YACEkH,EACAr3B,EACAm4B,EACAC,EACAl8B,EACAm8B,GAKA,OAHK1/B,KAAKgiC,cAAcnB,QAAQ,IAAIjP,UAAUvqB,EAAKm4B,MACjDA,EAAWxD,aAAanI,YAEtB6K,EAAK1H,kBAAkB3vB,GAAKoxB,OAAO+G,GAE9Bd,EACEA,EAAKhH,cAAgB13B,KAAKiiC,OAC5BjiC,KAAKgiC,cACThC,mBACAxI,YACCkH,EACAr3B,EACAm4B,EACAC,EACAl8B,EACAm8B,GAGG1/B,KAAKoiC,sBACV1D,EACAr3B,EACAm4B,EACAj8B,EACAm8B,GAING,eACER,EACAS,EACAJ,GAEA,IAAIsB,EACJ,GAAIlB,EAAQxJ,cAAgBwJ,EAAQr4B,UAElCu5B,EAAWhF,aAAanI,WAAW0E,UAAUv4B,KAAKu/B,aAElD,GACgB,EAAdv/B,KAAKiiC,OAAanC,EAAQpI,eAC1BoI,EAAQtH,UAAUx4B,KAAKu/B,QACvB,CAIA,IAAInC,EAFJ4D,EAAWhF,aAAanI,WAAW0E,UAAUv4B,KAAKu/B,QAIhDnC,EADEp9B,KAAK2hC,SACK7B,EAAyBlK,uBACnC51B,KAAKgiC,cAAcpB,aACnB5gC,KAAKu/B,QAGKO,EAAyBnK,gBACnC31B,KAAKgiC,cAAcrB,eACnB3gC,KAAKu/B,QAGT,IAAIxL,EAAQ,EACZ,KAAOqJ,EAAS7J,WAAaQ,EAAQ/zB,KAAKiiC,QAAQ,CAChD,MAAM1G,EAAO6B,EAAS/J,UACtB,GAAKrzB,KAAK0hC,uBAAuBnG,GAAjC,CAGO,IAAKv7B,KAAK8hC,qBAAqBvG,GAEpC,MAEAyF,EAAWA,EAAS1J,qBAAqBiE,EAAK94B,KAAM84B,EAAK1J,MACzDkC,UAGC,CAQL,IAAIqJ,EANJ4D,EAAWlB,EAAQvH,UAAUv4B,KAAKu/B,QAElCyB,EAAWA,EAASlK,eAClBkF,aAAanI,YAKbuJ,EADEp9B,KAAK2hC,SACIX,EAASnL,mBAAmB71B,KAAKu/B,QAEjCyB,EAASvL,YAAYz1B,KAAKu/B,QAGvC,IAAIxL,EAAQ,EACZ,KAAOqJ,EAAS7J,WAAW,CACzB,MAAMgI,EAAO6B,EAAS/J,UAEpBU,EAAQ/zB,KAAKiiC,QACbjiC,KAAK0hC,uBAAuBnG,IAC5Bv7B,KAAK8hC,qBAAqBvG,GAE1BxH,IAEAiN,EAAWA,EAAS1J,qBAClBiE,EAAK94B,KACLu5B,aAAanI,aAMvB,OAAO7zB,KAAKgiC,cACThC,mBACAH,eAAeR,EAAS2B,EAAUtB,GAEvC5I,eAAeuI,EAAehD,GAE5B,OAAOgD,EAETU,eACE,OAAO,EAETC,mBACE,OAAOhgC,KAAKgiC,cAAchC,mBAE5B5R,WACE,OAAOpuB,KAAKu/B,OAGN6C,sBACN1D,EACA2D,EACAC,EACA/+B,EACAg/B,GAGA,IAAIpZ,EACJ,GAAInpB,KAAK2hC,SAAU,CACjB,MAAM7I,EAAW94B,KAAKu/B,OAAOxN,aAC7B5I,EAAM,CAACrgB,EAAcC,IAAiB+vB,EAAS/vB,EAAGD,QAElDqgB,EAAMnpB,KAAKu/B,OAAOxN,aAEpB,MAAMyQ,EAAgB9D,EACtB9/B,OAAO4jC,EAAc9K,gBAAkB13B,KAAKiiC,OAAQ,IACpD,MAAMQ,EAAoB,IAAI7Q,UAAUyQ,EAAUC,GAC5CI,EAAiB1iC,KAAK2hC,SACxBa,EAAczF,cAAc/8B,KAAKu/B,QAChCiD,EAAcvF,aAAaj9B,KAAKu/B,QAC/BoD,EAAU3iC,KAAKgiC,cAAcnB,QAAQ4B,GAC3C,GAAID,EAAcrL,SAASkL,GAAW,CACpC,MAAMO,EAAeJ,EAAcxL,kBAAkBqL,GACrD,IAAIQ,EAAYt/B,EAAOu/B,mBACrB9iC,KAAKu/B,OACLmD,EACA1iC,KAAK2hC,UAEP,KACe,MAAbkB,IACCA,EAAUpgC,OAAS4/B,GAAYG,EAAcrL,SAAS0L,EAAUpgC,QAKjEogC,EAAYt/B,EAAOu/B,mBACjB9iC,KAAKu/B,OACLsD,EACA7iC,KAAK2hC,UAGT,MAAMoB,EACS,MAAbF,EAAoB,EAAI1Z,EAAI0Z,EAAWJ,GAGzC,GADEE,IAAYL,EAAU76B,WAAas7B,GAAe,EAOlD,OALyB,MAArBR,GACFA,EAAkB3C,iBAChBR,mBAAmBiD,EAAUC,EAAWM,IAGrCJ,EAAclL,qBAAqB+K,EAAUC,GAC/C,CACoB,MAArBC,GACFA,EAAkB3C,iBAChBT,mBAAmBkD,EAAUO,IAGjC,MAAMI,EAAgBR,EAAclL,qBAClC+K,EACArG,aAAanI,YAIf,OADe,MAAbgP,GAAqB7iC,KAAKgiC,cAAcnB,QAAQgC,IAEvB,MAArBN,GACFA,EAAkB3C,iBAChBV,iBAAiB2D,EAAUpgC,KAAMogC,EAAUhR,OAGxCmR,EAAc1L,qBACnBuL,EAAUpgC,KACVogC,EAAUhR,OAGLmR,GAGN,OAAIV,EAAU76B,UAEZi3B,EACEiE,GACLxZ,EAAIuZ,EAAgBD,IAAsB,GACnB,MAArBF,IACFA,EAAkB3C,iBAChBT,mBAAmBuD,EAAejgC,KAAMigC,EAAe7Q,OAEzD0Q,EAAkB3C,iBAChBV,iBAAiBmD,EAAUC,KAGxBE,EACJlL,qBAAqB+K,EAAUC,GAC/BhL,qBAAqBoL,EAAejgC,KAAMu5B,aAAanI,aAKrD6K,GCzNA,MAAAuE,YAAbzgC,cACExC,KAASkjC,WAAG,EACZljC,KAASmjC,WAAG,EACZnjC,KAAaojC,eAAG,EAChBpjC,KAAAwgC,gBAAiB,EACjBxgC,KAAOqjC,SAAG,EACVrjC,KAAWsjC,aAAG,EACdtjC,KAAA0gC,eAAgB,EAChB1gC,KAAMiiC,OAAG,EACTjiC,KAASujC,UAAG,GACZvjC,KAAgBwjC,iBAAmB,KACnCxjC,KAAeyjC,gBAAG,GAClBzjC,KAAc0jC,eAAmB,KACjC1jC,KAAa2jC,cAAG,GAChB3jC,KAAMu/B,OAAkB7G,EAExBuI,WACE,OAAOjhC,KAAKmjC,UAMdhB,iBACE,MAAuB,KAAnBniC,KAAKujC,UAKAvjC,KAAKmjC,UAES,MAAdnjC,KAAKujC,UAOhBnC,qBAEE,OADAxiC,OAAOoB,KAAKmjC,UAAW,oCAChBnjC,KAAKwjC,iBAOdrC,oBAEE,OADAviC,OAAOoB,KAAKmjC,UAAW,oCACnBnjC,KAAKojC,cACApjC,KAAKyjC,gBAEL/zB,EAIX2xB,SACE,OAAOrhC,KAAKqjC,QAMd7B,mBAEE,OADA5iC,OAAOoB,KAAKqjC,QAAS,kCACdrjC,KAAK0jC,eAOdnC,kBAEE,OADA3iC,OAAOoB,KAAKqjC,QAAS,kCACjBrjC,KAAKsjC,YACAtjC,KAAK2jC,cAELh0B,EAIXi0B,WACE,OAAO5jC,KAAKkjC,UAMdW,mBACE,OAAO7jC,KAAKkjC,WAAgC,KAAnBljC,KAAKujC,UAMhCrB,WAEE,OADAtjC,OAAOoB,KAAKkjC,UAAW,oCAChBljC,KAAKiiC,OAGd7T,WACE,OAAOpuB,KAAKu/B,OAGd7R,eACE,QAAS1tB,KAAKmjC,WAAanjC,KAAKqjC,SAAWrjC,KAAKkjC,WAGlDzV,YACE,OAAOztB,KAAK0tB,gBAAkB1tB,KAAKu/B,SAAW7G,EAGhD5E,OACE,MAAMA,EAAO,IAAImP,YAejB,OAdAnP,EAAKoP,UAAYljC,KAAKkjC,UACtBpP,EAAKmO,OAASjiC,KAAKiiC,OACnBnO,EAAKqP,UAAYnjC,KAAKmjC,UACtBrP,EAAK0M,eAAiBxgC,KAAKwgC,eAC3B1M,EAAK0P,iBAAmBxjC,KAAKwjC,iBAC7B1P,EAAKsP,cAAgBpjC,KAAKojC,cAC1BtP,EAAK2P,gBAAkBzjC,KAAKyjC,gBAC5B3P,EAAKuP,QAAUrjC,KAAKqjC,QACpBvP,EAAK4M,cAAgB1gC,KAAK0gC,cAC1B5M,EAAK4P,eAAiB1jC,KAAK0jC,eAC3B5P,EAAKwP,YAActjC,KAAKsjC,YACxBxP,EAAK6P,cAAgB3jC,KAAK2jC,cAC1B7P,EAAKyL,OAASv/B,KAAKu/B,OACnBzL,EAAKyP,UAAYvjC,KAAKujC,UACfzP,GA+CK,SAAAgQ,mBACdC,EACAlR,EACAxrB,GAEA,MAAM28B,EAAYD,EAAYjQ,OAa9B,OAZAkQ,EAAUb,WAAY,OACH9/B,IAAfwvB,IACFA,EAAa,MAEfmR,EAAUR,iBAAmB3Q,EAClB,MAAPxrB,GACF28B,EAAUZ,eAAgB,EAC1BY,EAAUP,gBAAkBp8B,IAE5B28B,EAAUZ,eAAgB,EAC1BY,EAAUP,gBAAkB,IAEvBO,EAkBO,SAAAC,iBACdF,EACAlR,EACAxrB,GAEA,MAAM28B,EAAYD,EAAYjQ,OAa9B,OAZAkQ,EAAUX,SAAU,OACDhgC,IAAfwvB,IACFA,EAAa,MAEfmR,EAAUN,eAAiB7Q,OACfxvB,IAARgE,GACF28B,EAAUV,aAAc,EACxBU,EAAUL,cAAgBt8B,IAE1B28B,EAAUV,aAAc,EACxBU,EAAUL,cAAgB,IAErBK,EAkBO,SAAAE,mBACdH,EACA/W,GAEA,MAAMgX,EAAYD,EAAYjQ,OAE9B,OADAkQ,EAAUzE,OAASvS,EACZgX,EAQH,SAAUG,uCACdJ,GAEA,MAAMK,EAAsC,GAE5C,GAAIL,EAAYtW,YACd,OAAO2W,EAGT,IAAIC,EAaJ,GAZIN,EAAYxE,SAAW7G,EACzB2L,EAA8C,YACrCN,EAAYxE,SAAWT,EAChCuF,EAA2C,SAClCN,EAAYxE,SAAWzM,EAChCuR,EAAyC,QAEzCzlC,OAAOmlC,EAAYxE,kBAAkBhB,UAAW,4BAChD8F,EAAUN,EAAYxE,OAAOvyB,YAE/Bo3B,EAAiC,QAAG19B,UAAU29B,GAE1CN,EAAYZ,UAAW,CACzB,MAAMmB,EAAaP,EAAYvD,eAC5B,aAC+B,UAClC4D,EAAGE,GAAc59B,UAAUq9B,EAAYP,kBACnCO,EAAYX,gBACdgB,EAAGE,IAAe,IAAM59B,UAAUq9B,EAAYN,kBAIlD,GAAIM,EAAYV,QAAS,CACvB,MAAMkB,EAAWR,EAAYrD,cAC1B,YAC6B,QAChC0D,EAAGG,GAAY79B,UAAUq9B,EAAYL,gBACjCK,EAAYT,cACdc,EAAGG,IAAa,IAAM79B,UAAUq9B,EAAYJ,gBAYhD,OARII,EAAYb,YACVa,EAAY5B,iBACdiC,EAAuC,aAAGL,EAAY9B,OAEtDmC,EAAsC,YAAGL,EAAY9B,QAIlDmC,EAGH,SAAUI,0BACdT,GAEA,MAAM38B,EAA+B,GAmBrC,GAlBI28B,EAAYZ,YACd/7B,EAA8C,GAC5C28B,EAAYP,iBACVO,EAAYX,gBACdh8B,EAA6C,GAC3C28B,EAAYN,iBAEhBr8B,EAAqD,KAClD28B,EAAYvD,gBAEbuD,EAAYV,UACdj8B,EAA4C,GAAG28B,EAAYL,eACvDK,EAAYT,cACdl8B,EAA2C,GAAG28B,EAAYJ,eAE5Dv8B,EAAmD,KAChD28B,EAAYrD,eAEbqD,EAAYb,UAAW,CACzB97B,EAAkC,EAAG28B,EAAY9B,OACjD,IAAIwC,EAAWV,EAAYR,UACV,KAAbkB,IAEAA,EADEV,EAAY5B,iBACoC,IAEC,KAGvD/6B,EAAsC,GAAGq9B,EAM3C,OAHIV,EAAYxE,SAAW7G,IACzBtxB,EAAkC,EAAG28B,EAAYxE,OAAOvyB,YAEnD5F,ECjYH,MAAOs9B,2BAA2Btf,cA8BtC5iB,YACU8e,EACA+I,EAMAG,EACAC,GAERxD,QAVQjnB,KAASshB,UAATA,EACAthB,KAAaqqB,cAAbA,EAMArqB,KAAkBwqB,mBAAlBA,EACAxqB,KAAsByqB,uBAAtBA,EAjCFzqB,KAAAyX,KAAqCtI,WAAW,WAMhDnP,KAAQ2kC,SAA4B,GAX5C5e,YAAYC,GACV,MAAM,IAAIhnB,MAAM,2BAYlBkb,oBAAoB7E,EAAqB+X,GACvC,YAAY/pB,IAAR+pB,EACK,OAASA,GAEhBxuB,OACEyW,EAAMmY,aAAaC,YACnB,kDAEKpY,EAAMwX,MAAM7f,YAuBvBkgB,OACE7X,EACA8X,EACAC,EACA7H,GAEA,MAAMD,EAAajQ,EAAMwX,MAAM7f,WAC/BhN,KAAKyX,KAAK,qBAAuB6N,EAAa,IAAMjQ,EAAMiY,kBAG1D,MAAMsX,EAAWF,mBAAmBG,aAAaxvB,EAAO+X,GAClD0X,EAAa,GACnB9kC,KAAK2kC,SAASC,GAAYE,EAE1B,MAAMC,EAAwBZ,uCAC5B9uB,EAAMmY,cAGRxtB,KAAKglC,aACH1f,EAAa,QACbyf,GACA,CAAC9hC,EAAOwsB,KACN,IAAI9oB,EAAO8oB,EAWX,GATc,MAAVxsB,IACF0D,EAAO,KACP1D,EAAQ,MAGI,OAAVA,GACFjD,KAAKqqB,cAAc/E,EAAY3e,GAAmB,EAAOymB,GAGvD5lB,QAAQxH,KAAK2kC,SAAUC,KAAcE,EAAY,CACnD,IAAI/W,EAIFA,EAHG9qB,EAEgB,MAAVA,EACA,oBAEA,cAAgBA,EAJhB,KAOXsiB,EAAWwI,EAAQ,UAO3BkB,SAAS5Z,EAAqB+X,GAC5B,MAAMwX,EAAWF,mBAAmBG,aAAaxvB,EAAO+X,UACjDptB,KAAK2kC,SAASC,GAGvBh4B,IAAIyI,GACF,MAAM0vB,EAAwBZ,uCAC5B9uB,EAAMmY,cAGFlI,EAAajQ,EAAMwX,MAAM7f,WAEzB0f,EAAW,IAAI9mB,SA0BrB,OAxBA5F,KAAKglC,aACH1f,EAAa,QACbyf,GACA,CAAC9hC,EAAOwsB,KACN,IAAI9oB,EAAO8oB,EAEG,MAAVxsB,IACF0D,EAAO,KACP1D,EAAQ,MAGI,OAAVA,GACFjD,KAAKqqB,cACH/E,EACA3e,GACa,EACJ,MAEX+lB,EAAS5mB,QAAQa,IAEjB+lB,EAAS7mB,OAAO,IAAI7G,MAAM2H,OAIzB+lB,EAAS3mB,QAIlB2f,iBAAiB7e,IAQTm+B,aACN1f,EACAyf,EAA0D,GAC1D7+B,GAIA,OAFA6+B,EAA8B,OAAI,SAE3B/+B,QAAQirB,IAAI,CACjBjxB,KAAKwqB,mBAAmBzX,UAA2B,GACnD/S,KAAKyqB,uBAAuB1X,UAA2B,KACtDD,MAAK,EAAEqE,EAAWD,MACfC,GAAaA,EAAUlD,cACzB8wB,EAA4B,KAAI5tB,EAAUlD,aAExCiD,GAAiBA,EAAcrQ,QACjCk+B,EAA0B,GAAI7tB,EAAcrQ,OAG9C,MAAM0W,GACHvd,KAAKshB,UAAUjN,OAAS,WAAa,WACtCrU,KAAKshB,UAAUpc,KACfogB,EAFA,OAKAtlB,KAAKshB,UAAUhN,UCzLjB,SAAU2wB,YAAYC,GAG1B,MAAM1vB,EAAS,GACf,IAAK,MAAOnO,EAAKlE,KAAUK,OAAO2hC,QAAQD,GACpC3kC,MAAMC,QAAQ2C,GAChBA,EAAMiiC,SAAQC,IACZ7vB,EAAOnU,KACLikC,mBAAmBj+B,GAAO,IAAMi+B,mBAAmBD,OAIvD7vB,EAAOnU,KAAKikC,mBAAmBj+B,GAAO,IAAMi+B,mBAAmBniC,IAGnE,OAAOqS,EAAOlW,OAAS,IAAMkW,EAAOlU,KAAK,KAAO,GD2K1C2jC,CAAYF,GAEd/kC,KAAKyX,KAAK,4BAA8B8F,GACxC,MAAMgoB,EAAM,IAAIC,eAChBD,EAAItnB,mBAAqB,KACvB,GAAI/X,GAA+B,IAAnBq/B,EAAIltB,WAAkB,CACpCrY,KAAKyX,KACH,qBAAuB8F,EAAM,qBAC7BgoB,EAAIxX,OACJ,YACAwX,EAAIE,cAEN,IAAI59B,EAAM,KACV,GAAI09B,EAAIxX,QAAU,KAAOwX,EAAIxX,OAAS,IAAK,CACzC,IACElmB,EAAMpB,SAAS8+B,EAAIE,cACnB,MAAO1iC,GACPoI,KACE,qCACEoS,EACA,KACAgoB,EAAIE,cAGVv/B,EAAS,KAAM2B,QAGI,MAAf09B,EAAIxX,QAAiC,MAAfwX,EAAIxX,QAC5B5iB,KACE,sCACEoS,EACA,YACAgoB,EAAIxX,QAGV7nB,EAASq/B,EAAIxX,QAEf7nB,EAAW,OAIfq/B,EAAI3tB,KAAK,MAAO2F,GAAuB,GACvCgoB,EAAIzqB,WElOG,MAAA4qB,eAAbljC,cACUxC,KAAA2lC,UAAkB3J,aAAanI,WAEvC+R,QAAQhe,GACN,OAAO5nB,KAAK2lC,UAAUzO,SAAStP,GAGjCie,eAAeje,EAAYke,GACzB9lC,KAAK2lC,UAAY3lC,KAAK2lC,UAAUnO,YAAY5P,EAAMke,ICHtC,SAAAC,wBACd,MAAO,CACL5iC,MAAO,KACP+6B,SAAU,IAAIpT,KAsCF,SAAAkb,2BACdC,EACAre,EACAjhB,GAEA,GAAI6hB,YAAYZ,GACdqe,EAAmB9iC,MAAQwD,EAC3Bs/B,EAAmB/H,SAASgI,aACvB,GAAiC,OAA7BD,EAAmB9iC,MAC5B8iC,EAAmB9iC,MAAQ8iC,EAAmB9iC,MAAMq0B,YAAY5P,EAAMjhB,OACjE,CACL,MAAM07B,EAAW1a,aAAaC,GACzBqe,EAAmB/H,SAAS3Q,IAAI8U,IACnC4D,EAAmB/H,SAAS1xB,IAAI61B,EAAU0D,yBAK5CC,2BAFcC,EAAmB/H,SAAStxB,IAAIy1B,GAC9Cza,EAAOE,aAAaF,GACoBjhB,IAU5B,SAAAw/B,yBACdF,EACAre,GAEA,GAAIY,YAAYZ,GAGd,OAFAqe,EAAmB9iC,MAAQ,KAC3B8iC,EAAmB/H,SAASgI,SACrB,EAEP,GAAiC,OAA7BD,EAAmB9iC,MAAgB,CACrC,GAAI8iC,EAAmB9iC,MAAMmzB,aAE3B,OAAO,EACF,CACL,MAAMnzB,EAAQ8iC,EAAmB9iC,MAOjC,OANA8iC,EAAmB9iC,MAAQ,KAE3BA,EAAMw0B,aAAae,GAAgB,CAACrxB,EAAK++B,KACvCJ,2BAA2BC,EAAoB,IAAI7e,KAAK/f,GAAM++B,MAGzDD,yBAAyBF,EAAoBre,IAEjD,GAAIqe,EAAmB/H,SAASrhB,KAAO,EAAG,CAC/C,MAAMwlB,EAAW1a,aAAaC,GAE9B,GADAA,EAAOE,aAAaF,GAChBqe,EAAmB/H,SAAS3Q,IAAI8U,GAAW,CACxB8D,yBACnBF,EAAmB/H,SAAStxB,IAAIy1B,GAChCza,IAGAqe,EAAmB/H,SAASvgB,OAAO0kB,GAIvC,OAA4C,IAArC4D,EAAmB/H,SAASrhB,KAEnC,OAAO,EAYG,SAAAwpB,8BACdJ,EACAK,EACAC,GAEiC,OAA7BN,EAAmB9iC,MACrBojC,EAAKD,EAAYL,EAAmB9iC,OAexB,SAAAqjC,+BACdP,EACAM,GAEAN,EAAmB/H,SAASkH,SAAQ,CAACgB,EAAM/+B,KACzCk/B,EAAKl/B,EAAK++B,MAlBVI,CAA+BP,GAAoB,CAAC5+B,EAAK++B,KAEvDC,8BAA8BD,EADjB,IAAIhf,KAAKkf,EAAWt5B,WAAa,IAAM3F,GACVk/B,MCpInC,MAAAE,cAGXjkC,YAAoBkkC,GAAA1mC,KAAW0mC,YAAXA,EAFZ1mC,KAAK2mC,MAAmC,KAIhD/5B,MACE,MAAMg6B,EAAW5mC,KAAK0mC,YAAY95B,MAE5BwkB,EAAK5tB,OAAA8gB,OAAA,GAAQsiB,GAQnB,OAPI5mC,KAAK2mC,OACPl2B,KAAKzQ,KAAK2mC,OAAO,CAACE,EAAc1jC,KAC9BiuB,EAAMyV,GAAQzV,EAAMyV,GAAQ1jC,KAGhCnD,KAAK2mC,MAAQC,EAENxV,GCRE,MAAA0V,cAIXtkC,YAAYukC,EAAqCC,GAAAhnC,KAAOgnC,QAAPA,EAFjDhnC,KAAcinC,eAA6B,GAGzCjnC,KAAKknC,eAAiB,IAAIT,cAAcM,GAExC,MAAM10B,EAbmB,IAevB,IAAgDrB,KAAKyI,SACvDtH,sBAAsBnS,KAAKmnC,aAAaj4B,KAAKlP,MAAOgR,KAAKI,MAAMiB,IAGzD80B,eACN,MAAMnhB,EAAQhmB,KAAKknC,eAAet6B,MAC5Bw6B,EAA8B,GACpC,IAAIC,GAAoB,EAExB52B,KAAKuV,GAAO,CAAC6gB,EAAc1jC,KACrBA,EAAQ,GAAKgE,SAASnH,KAAKinC,eAAgBJ,KAC7CO,EAAcP,GAAQ1jC,EACtBkkC,GAAoB,MAIpBA,GACFrnC,KAAKgnC,QAAQjhB,YAAYqhB,GAI3Bj1B,sBACEnS,KAAKmnC,aAAaj4B,KAAKlP,MACvBgR,KAAKI,MAAsB,EAAhBJ,KAAKyI,SAlCQ,OCT9B,IAAY6tB,EA6CN,SAAUC,oCACdla,GAEA,MAAO,CACLma,UAAU,EACVC,YAAY,EACZpa,QAAAA,EACAqa,QAAQ,IApDZ,SAAYJ,GACVA,EAAAA,EAAA,UAAA,GAAA,YACAA,EAAAA,EAAA,MAAA,GAAA,QACAA,EAAAA,EAAA,eAAA,GAAA,iBACAA,EAAAA,EAAA,gBAAA,GAAA,kBAJF,CAAYA,IAAAA,EAKX,KCEY,MAAAK,aAUXnlC,YAC4BolB,EACAggB,EACAC,GAFA7nC,KAAI4nB,KAAJA,EACA5nB,KAAY4nC,aAAZA,EACA5nC,KAAM6nC,OAANA,EAX5B7nC,KAAAiK,KAAOq9B,EAAcQ,eAGrB9nC,KAAMuD,ODgBC,CACLikC,UAAU,EACVC,YAAY,EACZpa,QAAS,KACTqa,QAAQ,GCVVK,kBAAkB9Q,GAChB,GAAKzO,YAAYxoB,KAAK4nB,MAUf,CAAA,GAA+B,MAA3B5nB,KAAK4nC,aAAazkC,MAM3B,OALAvE,OACEoB,KAAK4nC,aAAa1J,SAASz2B,UAC3B,4DAGKzH,KACF,CACL,MAAMk6B,EAAYl6B,KAAK4nC,aAAaI,QAAQ,IAAI5gB,KAAK6P,IACrD,OAAO,IAAI0Q,aAAajgB,eAAgBwS,EAAWl6B,KAAK6nC,SAdxD,OAJAjpC,OACE+oB,aAAa3nB,KAAK4nB,QAAUqP,EAC5B,iDAEK,IAAI0Q,aACT7f,aAAa9nB,KAAK4nB,MAClB5nB,KAAK4nC,aACL5nC,KAAK6nC,SCjCA,MAAAI,eAIXzlC,YAAmBe,EAAgCqkB,GAAhC5nB,KAAMuD,OAANA,EAAgCvD,KAAI4nB,KAAJA,EAFnD5nB,KAAAiK,KAAOq9B,EAAcY,gBAIrBH,kBAAkB9Q,GAChB,OAAIzO,YAAYxoB,KAAK4nB,MACZ,IAAIqgB,eAAejoC,KAAKuD,OAAQmkB,gBAEhC,IAAIugB,eAAejoC,KAAKuD,OAAQukB,aAAa9nB,KAAK4nB,QCTlD,MAAAugB,UAIX3lC,YACSe,EACAqkB,EACA8W,GAFA1+B,KAAMuD,OAANA,EACAvD,KAAI4nB,KAAJA,EACA5nB,KAAI0+B,KAAJA,EALT1+B,KAAAiK,KAAOq9B,EAAcc,UAQrBL,kBAAkB9Q,GAChB,OAAIzO,YAAYxoB,KAAK4nB,MACZ,IAAIugB,UACTnoC,KAAKuD,OACLmkB,eACA1nB,KAAK0+B,KAAK1H,kBAAkBC,IAGvB,IAAIkR,UAAUnoC,KAAKuD,OAAQukB,aAAa9nB,KAAK4nB,MAAO5nB,KAAK0+B,OCRzD,MAAA2J,MAIX7lC,YAC4Be,EACAqkB,EACAsW,GAFAl+B,KAAMuD,OAANA,EACAvD,KAAI4nB,KAAJA,EACA5nB,KAAQk+B,SAARA,EAL5Bl+B,KAAAiK,KAAOq9B,EAAcgB,MAOrBP,kBAAkB9Q,GAChB,GAAIzO,YAAYxoB,KAAK4nB,MAAO,CAC1B,MAAMsS,EAAYl6B,KAAKk+B,SAAS8J,QAAQ,IAAI5gB,KAAK6P,IACjD,OAAIiD,EAAUzyB,UAEL,KACEyyB,EAAU/2B,MAEZ,IAAIglC,UAAUnoC,KAAKuD,OAAQmkB,eAAgBwS,EAAU/2B,OAGrD,IAAIklC,MAAMroC,KAAKuD,OAAQmkB,eAAgBwS,GAOhD,OAJAt7B,OACE+oB,aAAa3nB,KAAK4nB,QAAUqP,EAC5B,kEAEK,IAAIoR,MAAMroC,KAAKuD,OAAQukB,aAAa9nB,KAAK4nB,MAAO5nB,KAAKk+B,UAGhElxB,WACE,MACE,aACAhN,KAAK4nB,KACL,KACA5nB,KAAKuD,OAAOyJ,WACZ,WACAhN,KAAKk+B,SAASlxB,WACd,KC5CO,MAAAu7B,UACX/lC,YACUgmC,EACAC,EACAC,GAFA1oC,KAAKwoC,MAALA,EACAxoC,KAAiByoC,kBAAjBA,EACAzoC,KAAS0oC,UAATA,EAMVC,qBACE,OAAO3oC,KAAKyoC,kBAMdG,aACE,OAAO5oC,KAAK0oC,UAGdG,kBAAkBjhB,GAChB,GAAIY,YAAYZ,GACd,OAAO5nB,KAAK2oC,uBAAyB3oC,KAAK0oC,UAG5C,MAAMrG,EAAW1a,aAAaC,GAC9B,OAAO5nB,KAAK8oC,mBAAmBzG,GAGjCyG,mBAAmBzhC,GACjB,OACGrH,KAAK2oC,uBAAyB3oC,KAAK0oC,WAAc1oC,KAAKwoC,MAAMrR,SAAS9vB,GAI1Eu+B,UACE,OAAO5lC,KAAKwoC,OC/BH,MAAAO,eAGXvmC,YAAmBwmC,GAAAhpC,KAAMgpC,OAANA,EACjBhpC,KAAKu/B,OAASv/B,KAAKgpC,OAAOxb,aAAaY,YAiF3C,SAAS6a,oCACPC,EACAC,EACA9iB,EACA+iB,EACAC,EACAC,GAEA,MAAMC,EAAkBH,EAAQI,QAAOC,GAAUA,EAAOx/B,OAASoc,IAEjEkjB,EAAgBn5B,MAAK,CAACtH,EAAGC,IAoC3B,SAAS2gC,6BACPR,EACApgC,EACAC,GAEA,GAAmB,MAAfD,EAAEmuB,WAAoC,MAAfluB,EAAEkuB,UAC3B,MAAMl4B,eAAe,sCAEvB,MAAM4qC,EAAW,IAAI/X,UAAU9oB,EAAEmuB,UAAWnuB,EAAEm2B,cACxC2K,EAAW,IAAIhY,UAAU7oB,EAAEkuB,UAAWluB,EAAEk2B,cAC9C,OAAOiK,EAAe3J,OAAOvN,QAAQ2X,EAAUC,GA7C7CF,CAA6BR,EAAgBpgC,EAAGC,KAElDwgC,EAAgBnE,SAAQqE,IACtB,MAAMI,EAeV,SAASC,sCACPZ,EACAO,EACAH,GAEA,MAAoB,UAAhBG,EAAOx/B,MAAoC,kBAAhBw/B,EAAOx/B,OAGpCw/B,EAAOM,SAAWT,EAAWlS,wBAC3BqS,EAAOxS,UACPwS,EAAOxK,aACPiK,EAAe3J,SALVkK,EArBoBK,CACzBZ,EACAO,EACAH,GAEFD,EAAcjE,SAAQ4E,IAChBA,EAAaC,WAAWR,EAAOx/B,OACjCk/B,EAAO9nC,KACL2oC,EAAaE,YAAYL,EAAoBX,EAAeF,eC5GtD,SAAAmB,aACdb,EACAc,GAEA,MAAO,CAAEd,WAAAA,EAAYc,YAAAA,GAGjB,SAAUC,yBACdC,EACAC,EACAC,EACAxJ,GAEA,OAAOmJ,aACL,IAAI5B,UAAUgC,EAAWC,EAAUxJ,GACnCsJ,EAAUF,aAIR,SAAUK,0BACdH,EACAI,EACAF,EACAxJ,GAEA,OAAOmJ,aACLG,EAAUhB,WACV,IAAIf,UAAUmC,EAAYF,EAAUxJ,IAIlC,SAAU2J,8BACdL,GAEA,OAAOA,EAAUhB,WAAWX,qBACxB2B,EAAUhB,WAAW1D,UACrB,KAGA,SAAUgF,+BACdN,GAEA,OAAOA,EAAUF,YAAYzB,qBACzB2B,EAAUF,YAAYxE,UACtB,KC/CN,IAAIiF,EAkBS,MAAAC,cASXtoC,YACkBW,EACA+6B,EAvBE,MACf2M,IACHA,EAAyB,IAAIjX,UAC3B5jB,gBAGG66B,GAoBDE,IAJY/qC,KAAKmD,MAALA,EACAnD,KAAQk+B,SAARA,EAVlBhkB,kBAAqB9S,GACnB,IAAIg/B,EAAyB,IAAI0E,cAAiB,MAIlD,OAHAr6B,KAAKrJ,GAAK,CAAC4jC,EAAmB1I,KAC5B8D,EAAOA,EAAK55B,IAAI,IAAI4a,KAAK4jB,GAAY1I,MAEhC8D,EAcT3+B,UACE,OAAsB,OAAfzH,KAAKmD,OAAkBnD,KAAKk+B,SAASz2B,UAa9CwjC,iCACEC,EACAC,GAEA,GAAkB,MAAdnrC,KAAKmD,OAAiBgoC,EAAUnrC,KAAKmD,OACvC,MAAO,CAAEykB,KAAMF,eAAgBvkB,MAAOnD,KAAKmD,OAE3C,GAAIqlB,YAAY0iB,GACd,OAAO,KACF,CACL,MAAMzT,EAAQ9P,aAAaujB,GACrB/O,EAAQn8B,KAAKk+B,SAAStxB,IAAI6qB,GAChC,GAAc,OAAV0E,EAAgB,CAClB,MAAMiP,EACJjP,EAAM8O,iCACJnjB,aAAaojB,GACbC,GAEJ,GAAiC,MAA7BC,EAAmC,CAKrC,MAAO,CAAExjB,KAJQS,UACf,IAAIjB,KAAKqQ,GACT2T,EAA0BxjB,MAEHzkB,MAAOioC,EAA0BjoC,OAE1D,OAAO,KAGT,OAAO,MAUfkoC,yBACEH,GAEA,OAAOlrC,KAAKirC,iCAAiCC,GAAc,KAAM,IAMnElD,QAAQkD,GACN,GAAI1iB,YAAY0iB,GACd,OAAOlrC,KACF,CACL,MAAMy3B,EAAQ9P,aAAaujB,GACrBhR,EAAYl6B,KAAKk+B,SAAStxB,IAAI6qB,GACpC,OAAkB,OAAdyC,EACKA,EAAU8N,QAAQlgB,aAAaojB,IAE/B,IAAIJ,cAAiB,OAYlCt+B,IAAI0+B,EAAoBI,GACtB,GAAI9iB,YAAY0iB,GACd,OAAO,IAAIJ,cAAcQ,EAAOtrC,KAAKk+B,UAChC,CACL,MAAMzG,EAAQ9P,aAAaujB,GAErB1L,GADQx/B,KAAKk+B,SAAStxB,IAAI6qB,IAAU,IAAIqT,cAAiB,OACxCt+B,IAAIsb,aAAaojB,GAAeI,GACjDxP,EAAc97B,KAAKk+B,SAAS7J,OAAOoD,EAAO+H,GAChD,OAAO,IAAIsL,cAAc9qC,KAAKmD,MAAO24B,IAUzC/uB,OAAOm+B,GACL,GAAI1iB,YAAY0iB,GACd,OAAIlrC,KAAKk+B,SAASz2B,UACT,IAAIqjC,cAAiB,MAErB,IAAIA,cAAc,KAAM9qC,KAAKk+B,UAEjC,CACL,MAAMzG,EAAQ9P,aAAaujB,GACrB/O,EAAQn8B,KAAKk+B,SAAStxB,IAAI6qB,GAChC,GAAI0E,EAAO,CACT,MAAMqD,EAAWrD,EAAMpvB,OAAO+a,aAAaojB,IAC3C,IAAIpP,EAMJ,OAJEA,EADE0D,EAAS/3B,UACGzH,KAAKk+B,SAASnxB,OAAO0qB,GAErBz3B,KAAKk+B,SAAS7J,OAAOoD,EAAO+H,GAEzB,OAAfx/B,KAAKmD,OAAkB24B,EAAYr0B,UAC9B,IAAIqjC,cAAiB,MAErB,IAAIA,cAAc9qC,KAAKmD,MAAO24B,GAGvC,OAAO97B,MAWb4M,IAAIs+B,GACF,GAAI1iB,YAAY0iB,GACd,OAAOlrC,KAAKmD,MACP,CACL,MAAMs0B,EAAQ9P,aAAaujB,GACrB/O,EAAQn8B,KAAKk+B,SAAStxB,IAAI6qB,GAChC,OAAI0E,EACKA,EAAMvvB,IAAIkb,aAAaojB,IAEvB,MAYbK,QAAQL,EAAoBM,GAC1B,GAAIhjB,YAAY0iB,GACd,OAAOM,EACF,CACL,MAAM/T,EAAQ9P,aAAaujB,GAErB1L,GADQx/B,KAAKk+B,SAAStxB,IAAI6qB,IAAU,IAAIqT,cAAiB,OACxCS,QAAQzjB,aAAaojB,GAAeM,GAC3D,IAAI1P,EAMJ,OAJEA,EADE0D,EAAS/3B,UACGzH,KAAKk+B,SAASnxB,OAAO0qB,GAErBz3B,KAAKk+B,SAAS7J,OAAOoD,EAAO+H,GAErC,IAAIsL,cAAc9qC,KAAKmD,MAAO24B,IASzC2P,KAAQ9jC,GACN,OAAO3H,KAAK0rC,MAAMhkB,eAAgB/f,GAM5B+jC,MACNC,EACAhkC,GAEA,MAAMikC,EAA4B,GAMlC,OALA5rC,KAAKk+B,SAASlK,kBACZ,CAACqO,EAAkBnI,KACjB0R,EAAMvJ,GAAYnI,EAAUwR,MAAMrjB,UAAUsjB,EAAWtJ,GAAW16B,MAG/DA,EAAGgkC,EAAW3rC,KAAKmD,MAAOyoC,GAMnCC,WAAcjkB,EAAYhf,GACxB,OAAO5I,KAAK8rC,YAAYlkB,EAAMF,eAAgB9e,GAGxCkjC,YACNC,EACAJ,EACA/iC,GAEA,MAAM6mB,IAASzvB,KAAKmD,OAAQyF,EAAE+iC,EAAW3rC,KAAKmD,OAC9C,GAAIssB,EACF,OAAOA,EAEP,GAAIjH,YAAYujB,GACd,OAAO,KACF,CACL,MAAMtU,EAAQ9P,aAAaokB,GACrBlJ,EAAY7iC,KAAKk+B,SAAStxB,IAAI6qB,GACpC,OAAIoL,EACKA,EAAUiJ,YACfhkB,aAAaikB,GACb1jB,UAAUsjB,EAAWlU,GACrB7uB,GAGK,MAMfojC,cACEpkB,EACAhf,GAEA,OAAO5I,KAAKisC,eAAerkB,EAAMF,eAAgB9e,GAG3CqjC,eACNF,EACAG,EACAtjC,GAEA,GAAI4f,YAAYujB,GACd,OAAO/rC,KACF,CACDA,KAAKmD,OACPyF,EAAEsjC,EAAqBlsC,KAAKmD,OAE9B,MAAMs0B,EAAQ9P,aAAaokB,GACrBlJ,EAAY7iC,KAAKk+B,SAAStxB,IAAI6qB,GACpC,OAAIoL,EACKA,EAAUoJ,eACfnkB,aAAaikB,GACb1jB,UAAU6jB,EAAqBzU,GAC/B7uB,GAGK,IAAIkiC,cAAiB,OAWlCqB,QAAQvjC,GACN5I,KAAKosC,SAAS1kB,eAAgB9e,GAGxBwjC,SACNF,EACAtjC,GAEA5I,KAAKk+B,SAASlK,kBAAiB,CAACiD,EAAWiD,KACzCA,EAAUkS,SAAS/jB,UAAU6jB,EAAqBjV,GAAYruB,MAE5D5I,KAAKmD,OACPyF,EAAEsjC,EAAqBlsC,KAAKmD,OAIhCkpC,aAAazjC,GACX5I,KAAKk+B,SAASlK,kBACZ,CAACiD,EAAmBiD,KACdA,EAAU/2B,OACZyF,EAAEquB,EAAWiD,EAAU/2B,WC9TpB,MAAAmpC,cACX9pC,YAAmB+pC,GAAAvsC,KAAUusC,WAAVA,EAEnBryB,eACE,OAAO,IAAIoyB,cAAc,IAAIxB,cAAc,QAI/B,SAAA0B,sBACdC,EACA7kB,EACAiK,GAEA,GAAIrJ,YAAYZ,GACd,OAAO,IAAI0kB,cAAc,IAAIxB,cAAcjZ,IACtC,CACL,MAAM6a,EAAWD,EAAcF,WAAWlB,yBAAyBzjB,GACnE,GAAgB,MAAZ8kB,EAAkB,CACpB,MAAMC,EAAeD,EAAS9kB,KAC9B,IAAIzkB,EAAQupC,EAASvpC,MACrB,MAAM+nC,EAAeziB,gBAAgBkkB,EAAc/kB,GAEnD,OADAzkB,EAAQA,EAAMq0B,YAAY0T,EAAcrZ,GACjC,IAAIya,cACTG,EAAcF,WAAW//B,IAAImgC,EAAcxpC,IAExC,CACL,MAAM6kC,EAAU,IAAI8C,cAAcjZ,GAC5B+a,EAAeH,EAAcF,WAAWhB,QAAQ3jB,EAAMogB,GAC5D,OAAO,IAAIsE,cAAcM,KAKf,SAAAC,uBACdJ,EACA7kB,EACAklB,GAEA,IAAIC,EAAWN,EAIf,OAHAh8B,KAAKq8B,GAAS,CAACzK,EAAkBxQ,KAC/Bkb,EAAWP,sBAAsBO,EAAU1kB,UAAUT,EAAMya,GAAWxQ,MAEjEkb,EAWO,SAAAC,yBACdP,EACA7kB,GAEA,GAAIY,YAAYZ,GACd,OAAO0kB,cAAcW,QAChB,CACL,MAAML,EAAeH,EAAcF,WAAWhB,QAC5C3jB,EACA,IAAIkjB,cAAoB,OAE1B,OAAO,IAAIwB,cAAcM,IAYb,SAAAM,8BACdT,EACA7kB,GAEA,OAA4D,MAArDulB,6BAA6BV,EAAe7kB,GAWrC,SAAAulB,6BACdV,EACA7kB,GAEA,MAAM8kB,EAAWD,EAAcF,WAAWlB,yBAAyBzjB,GACnE,OAAgB,MAAZ8kB,EACKD,EAAcF,WAClB3/B,IAAI8/B,EAAS9kB,MACbsP,SAASzO,gBAAgBikB,EAAS9kB,KAAMA,IAEpC,KAUL,SAAUwlB,iCACdX,GAEA,MAAMvO,EAAwB,GACxBrM,EAAO4a,EAAcF,WAAWppC,MAoBtC,OAnBY,MAAR0uB,EAEGA,EAAKyE,cACPzE,EAAsB8F,aACrBe,GACA,CAACzB,EAAWI,KACV6G,EAAS78B,KAAK,IAAIuwB,UAAUqF,EAAWI,OAK7CoV,EAAcF,WAAWrO,SAASlK,kBAChC,CAACiD,EAAWiD,KACa,MAAnBA,EAAU/2B,OACZ+6B,EAAS78B,KAAK,IAAIuwB,UAAUqF,EAAWiD,EAAU/2B,WAKlD+6B,EAGO,SAAAmP,gCACdZ,EACA7kB,GAEA,GAAIY,YAAYZ,GACd,OAAO6kB,EACF,CACL,MAAMa,EAAgBH,6BAA6BV,EAAe7kB,GAClE,OACS,IAAI0kB,cADQ,MAAjBgB,EACuB,IAAIxC,cAAcwC,GAElBb,EAAcF,WAAWvE,QAAQpgB,KAS1D,SAAU2lB,qBAAqBd,GACnC,OAAOA,EAAcF,WAAW9kC,UASlB,SAAA+lC,mBACdf,EACA5a,GAEA,OAAO4b,kBAAkB/lB,eAAgB+kB,EAAcF,WAAY1a,GAGrE,SAAS4b,kBACPvC,EACAwC,EACA7b,GAEA,GAAuB,MAAnB6b,EAAUvqC,MAEZ,OAAO0uB,EAAK2F,YAAY0T,EAAcwC,EAAUvqC,OAC3C,CACL,IAAIwqC,EAAgB,KAyBpB,OAxBAD,EAAUxP,SAASlK,kBAAiB,CAACqO,EAAUnI,KAC5B,cAAbmI,GAGFzjC,OACsB,OAApBs7B,EAAU/2B,MACV,6CAEFwqC,EAAgBzT,EAAU/2B,OAE1B0uB,EAAO4b,kBACLplB,UAAU6iB,EAAc7I,GACxBnI,EACArI,MAKDA,EAAKqF,SAASgU,GAAczjC,WAA+B,OAAlBkmC,IAC5C9b,EAAOA,EAAK2F,YACVnP,UAAU6iB,EAAc,aACxByC,IAGG9b,GCvLK,SAAA+b,qBACdF,EACA9lB,GAEA,OAAOimB,gBAAgBjmB,EAAM8lB,GAuFf,SAAAI,qBACdJ,EACAK,GAOA,MAAMpR,EAAM+Q,EAAUM,UAAUC,WAAUp9B,GACjCA,EAAEk9B,UAAYA,IAEvBnvC,OAAO+9B,GAAO,EAAG,gDACjB,MAAMuR,EAAgBR,EAAUM,UAAUrR,GAC1C+Q,EAAUM,UAAUnnB,OAAO8V,EAAK,GAEhC,IAAIwR,EAAyBD,EAAc/jB,QACvCikB,GAAsC,EAEtC/uC,EAAIquC,EAAUM,UAAU1uC,OAAS,EAErC,KAAO6uC,GAA0B9uC,GAAK,GAAG,CACvC,MAAMgvC,EAAeX,EAAUM,UAAU3uC,GACrCgvC,EAAalkB,UAEb9qB,GAAKs9B,GACL2R,6BAA6BD,EAAcH,EAActmB,MAGzDumB,GAAyB,EAChB7kB,aAAa4kB,EAActmB,KAAMymB,EAAazmB,QAEvDwmB,GAAsC,IAG1C/uC,IAGF,GAAK8uC,EAEE,CAAA,GAAIC,EAGT,OA2CJ,SAASG,oBAAoBb,GAC3BA,EAAUc,cAAgBC,oBACxBf,EAAUM,UACVU,wBACAhnB,gBAEEgmB,EAAUM,UAAU1uC,OAAS,EAC/BouC,EAAUiB,YACRjB,EAAUM,UAAUN,EAAUM,UAAU1uC,OAAS,GAAGyuC,QAEtDL,EAAUiB,aAAe,EAtDzBJ,CAAoBb,IACb,EAGP,GAAIQ,EAAcxP,KAChBgP,EAAUc,cAAgBxB,yBACxBU,EAAUc,cACVN,EAActmB,UAEX,CAELnX,KADiBy9B,EAAchQ,UACfjH,IACdyW,EAAUc,cAAgBxB,yBACxBU,EAAUc,cACVnmB,UAAU6lB,EAActmB,KAAMqP,OAIpC,OAAO,EArBP,OAAO,EAyBX,SAASqX,6BACPM,EACAhnB,GAEA,GAAIgnB,EAAYlQ,KACd,OAAOpV,aAAaslB,EAAYhnB,KAAMA,GAEtC,IAAK,MAAMqP,KAAa2X,EAAY1Q,SAClC,GACE0Q,EAAY1Q,SAASt6B,eAAeqzB,IACpC3N,aAAajB,UAAUumB,EAAYhnB,KAAMqP,GAAYrP,GAErD,OAAO,EAGX,OAAO,EAwBX,SAAS8mB,wBAAwBtyB,GAC/B,OAAOA,EAAM+N,QAOf,SAASskB,oBACPI,EACArF,EACAsF,GAEA,IAAIrC,EAAgBH,cAAcW,QAClC,IAAK,IAAI5tC,EAAI,EAAGA,EAAIwvC,EAAOvvC,SAAUD,EAAG,CACtC,MAAM+c,EAAQyyB,EAAOxvC,GAIrB,GAAImqC,EAAOptB,GAAQ,CACjB,MAAM2yB,EAAY3yB,EAAMwL,KACxB,IAAIsjB,EACJ,GAAI9uB,EAAMsiB,KACJpV,aAAawlB,EAAUC,IACzB7D,EAAeziB,gBAAgBqmB,EAAUC,GACzCtC,EAAgBD,sBACdC,EACAvB,EACA9uB,EAAMsiB,OAECpV,aAAaylB,EAAWD,KACjC5D,EAAeziB,gBAAgBsmB,EAAWD,GAC1CrC,EAAgBD,sBACdC,EACA/kB,eACAtL,EAAMsiB,KAAKxH,SAASgU,SAKnB,CAAA,IAAI9uB,EAAM8hB,SAgCf,MAAMn/B,eAAe,8CA/BrB,GAAIuqB,aAAawlB,EAAUC,GACzB7D,EAAeziB,gBAAgBqmB,EAAUC,GACzCtC,EAAgBI,uBACdJ,EACAvB,EACA9uB,EAAM8hB,eAEH,GAAI5U,aAAaylB,EAAWD,GAEjC,GADA5D,EAAeziB,gBAAgBsmB,EAAWD,GACtCtmB,YAAY0iB,GACduB,EAAgBI,uBACdJ,EACA/kB,eACAtL,EAAM8hB,cAEH,CACL,MAAM/B,EAAQ30B,QAAQ4U,EAAM8hB,SAAUvW,aAAaujB,IACnD,GAAI/O,EAAO,CAET,MAAM6S,EAAW7S,EAAMjF,SAASpP,aAAaojB,IAC7CuB,EAAgBD,sBACdC,EACA/kB,eACAsnB,OAYd,OAAOvC,EAsBH,SAAUwC,gCACdvB,EACAwB,EACAC,EACAC,EACAC,GAEA,GAAKD,GAAsBC,EAyBpB,CACL,MAAM5pB,EAAQ4nB,gCACZK,EAAUc,cACVU,GAEF,IAAKG,GAAuB9B,qBAAqB9nB,GAC/C,OAAO0pB,EAGP,GACGE,GACsB,MAAvBF,GACCjC,8BAA8BznB,EAAOiC,gBAGjC,CACL,MAAM8hB,OAAS,SAAUptB,GACvB,OACGA,EAAM+N,SAAWklB,MAChBD,KACEA,EAAkBt6B,QAAQsH,EAAM2xB,YACnCzkB,aAAalN,EAAMwL,KAAMsnB,IACxB5lB,aAAa4lB,EAAU9yB,EAAMwL,QASnC,OAAO4lB,mBANaiB,oBAClBf,EAAUM,UACVxE,OACA0F,GAEmBC,GAAuBnT,aAAanI,YAhBzD,OAAO,KAvCmC,CAC9C,MAAMyZ,EAAgBH,6BACpBO,EAAUc,cACVU,GAEF,GAAqB,MAAjB5B,EACF,OAAOA,EACF,CACL,MAAMgC,EAAWjC,gCACfK,EAAUc,cACVU,GAEF,GAAI3B,qBAAqB+B,GACvB,OAAOH,EACF,GACkB,MAAvBA,GACCjC,8BAA8BoC,EAAU5nB,gBAIpC,CAEL,OAAO8lB,mBAAmB8B,EADLH,GAAuBnT,aAAanI,YAFzD,OAAO,OAyST,SAAU0b,mCACdC,EACAL,EACAC,EACAC,GAEA,OAAOJ,gCACLO,EAAa9B,UACb8B,EAAaN,SACbC,EACAC,EACAC,GASY,SAAAI,sCACdD,EACAE,GAEA,OAlRc,SAAAC,mCACdjC,EACAwB,EACAQ,GAEA,IAAIE,EAAmB5T,aAAanI,WACpC,MAAMgc,EAAc1C,6BAClBO,EAAUc,cACVU,GAEF,GAAIW,EAUF,OATKA,EAAYvZ,cAEfuZ,EAAYlY,aAAae,GAAgB,CAACzB,EAAWqL,KACnDsN,EAAmBA,EAAiBtY,qBAClCL,EACAqL,MAICsN,EACF,GAAIF,EAAwB,CAGjC,MAAMjqB,EAAQ4nB,gCACZK,EAAUc,cACVU,GAsBF,OApBAQ,EAAuB/X,aACrBe,GACA,CAACzB,EAAWI,KACV,MAAMxF,EAAO2b,mBACXH,gCAAgC5nB,EAAO,IAAI2B,KAAK6P,IAChDI,GAEFuY,EAAmBA,EAAiBtY,qBAClCL,EACApF,MAKNub,iCAAiC3nB,GAAO2f,SAAQxL,IAC9CgW,EAAmBA,EAAiBtY,qBAClCsC,EAAUn3B,KACVm3B,EAAU/H,SAGP+d,EAcP,OANAxC,iCAJcC,gCACZK,EAAUc,cACVU,IAEsC9J,SAAQxL,IAC9CgW,EAAmBA,EAAiBtY,qBAClCsC,EAAUn3B,KACVm3B,EAAU/H,SAGP+d,EAoNFD,CACLH,EAAa9B,UACb8B,EAAaN,SACbQ,GAoBE,SAAUI,+CACdN,EACA5nB,EACAmoB,EACAC,GAEA,OA/NI,SAAUC,4CACdvC,EACAwB,EACAlE,EACA+E,EACAC,GAEApxC,OACEmxC,GAAqBC,EACrB,6DAEF,MAAMpoB,EAAOS,UAAU6mB,EAAUlE,GACjC,GAAIkC,8BAA8BQ,EAAUc,cAAe5mB,GAGzD,OAAO,KACF,CAEL,MAAMsoB,EAAa7C,gCACjBK,EAAUc,cACV5mB,GAEF,OAAI2lB,qBAAqB2C,GAEhBF,EAAmB9Y,SAAS8T,GAQ5BwC,mBACL0C,EACAF,EAAmB9Y,SAAS8T,KA6L3BiF,CACLT,EAAa9B,UACb8B,EAAaN,SACbtnB,EACAmoB,EACAC,GAUY,SAAAG,2BACdX,EACA5nB,GAEA,OApKc,SAAAwoB,wBACd1C,EACA9lB,GAEA,OAAOulB,6BAA6BO,EAAUc,cAAe5mB,GAgKtDwoB,CACLZ,EAAa9B,UACbrlB,UAAUmnB,EAAaN,SAAUtnB,IAQrB,SAAAyoB,6BACdb,EACAc,EACAnT,EACApJ,EACAviB,EACAwb,GAEA,OA3Kc,SAAAujB,0BACd7C,EACAwB,EACAoB,EACAnT,EACApJ,EACAviB,EACAwb,GAEA,IAAIwjB,EACJ,MAAM/qB,EAAQ4nB,gCACZK,EAAUc,cACVU,GAEI5B,EAAgBH,6BAA6B1nB,EAAOiC,gBAC1D,GAAqB,MAAjB4lB,EACFkD,EAAYlD,MACP,CAAA,GAA0B,MAAtBgD,EAIT,MAAO,GAHPE,EAAYhD,mBAAmB/nB,EAAO6qB,GAMxC,GADAE,EAAYA,EAAUjY,UAAUvL,GAC3BwjB,EAAU/oC,WAAc+oC,EAAUla,aAerC,MAAO,GAf4C,CACnD,MAAMma,EAAQ,GACRtnB,EAAM6D,EAAM+E,aACZqJ,EAAO5pB,EACRg/B,EAA2B5a,uBAAuBuH,EAAWnQ,GAC7DwjB,EAA2B7a,gBAAgBwH,EAAWnQ,GAC3D,IAAIuO,EAAOH,EAAK/H,UAChB,KAAOkI,GAAQkV,EAAMnxC,OAASy0B,GACC,IAAzB5K,EAAIoS,EAAM4B,IACZsT,EAAMpvC,KAAKk6B,GAEbA,EAAOH,EAAK/H,UAEd,OAAOod,GAsIFF,CACLf,EAAa9B,UACb8B,EAAaN,SACboB,EACAnT,EACApJ,EACAviB,EACAwb,GAQY,SAAA0jB,8BACdlB,EACAnN,EACAsO,GAEA,OA5OI,SAAUC,2BACdlD,EACAwB,EACA7M,EACA2N,GAEA,MAAMpoB,EAAOS,UAAU6mB,EAAU7M,GAC3BiL,EAAgBH,6BACpBO,EAAUc,cACV5mB,GAEF,GAAqB,MAAjB0lB,EACF,OAAOA,EAEP,GAAI0C,EAAmBlH,mBAAmBzG,GAKxC,OAAOmL,mBAJYH,gCACjBK,EAAUc,cACV5mB,GAIAooB,EAAmBpK,UAAU5O,kBAAkBqL,IAGjD,OAAO,KAoNJuO,CACLpB,EAAa9B,UACb8B,EAAaN,SACb7M,EACAsO,GAOY,SAAAE,kBACdrB,EACAvY,GAEA,OAAO4W,gBACLxlB,UAAUmnB,EAAaN,SAAUjY,GACjCuY,EAAa9B,WAID,SAAAG,gBACdjmB,EACA8lB,GAEA,MAAO,CACLwB,SAAUtnB,EACV8lB,UAAAA,GCrxBS,MAAAoD,uBAAbtuC,cACmBxC,KAAA+wC,UAAiC,IAAIjmB,IAEtD8U,iBAAiB6J,GACf,MAAMx/B,EAAOw/B,EAAOx/B,KACdo4B,EAAWoH,EAAOxS,UACxBr4B,OACiC,gBAA/BqL,GACmC,kBAAjCA,GACiC,kBAAjCA,EACF,6CAEFrL,OACe,cAAbyjC,EACA,mDAEF,MAAM2O,EAAYhxC,KAAK+wC,UAAUnkC,IAAIy1B,GACrC,GAAI2O,EAAW,CACb,MAAMC,EAAUD,EAAU/mC,KAC1B,GACiC,gBAA/BA,GAEA,kBADAgnC,EAEAjxC,KAAK+wC,UAAUvkC,IACb61B,EACAjD,mBACEiD,EACAoH,EAAOxK,aACP+R,EAAU/R,oBAGT,GAC4B,kBAAjCh1B,GAEA,gBADAgnC,EAEAjxC,KAAK+wC,UAAUpzB,OAAO0kB,QACjB,GAC4B,kBAAjCp4B,GAEA,kBADAgnC,EAEAjxC,KAAK+wC,UAAUvkC,IACb61B,EACAlD,mBAAmBkD,EAAU2O,EAAU3R,eAEpC,GAC4B,kBAAjCp1B,GAEA,gBADAgnC,EAEAjxC,KAAK+wC,UAAUvkC,IACb61B,EACAnD,iBAAiBmD,EAAUoH,EAAOxK,mBAE/B,CAAA,GAC4B,kBAAjCh1B,GAEA,kBADAgnC,EAOA,MAAMlyC,eACJ,mCACE0qC,EACA,mBACAuH,GATJhxC,KAAK+wC,UAAUvkC,IACb61B,EACAjD,mBAAmBiD,EAAUoH,EAAOxK,aAAc+R,EAAU3R,gBAWhEr/B,KAAK+wC,UAAUvkC,IAAI61B,EAAUoH,GAIjCyH,aACE,OAAO3wC,MAAM4wC,KAAKnxC,KAAK+wC,UAAUrf,WCnC9B,MAAM0f,EAA2B,IAhB3B,MAAAC,uBACXC,iBAAiBjP,GACf,OAAO,KAETS,mBACE9V,EACAmP,EACA3qB,GAEA,OAAO,OAaE,MAAA+/B,6BACX/uC,YACUgvC,EACAC,EACAC,EAAuC,MAFvC1xC,KAAOwxC,QAAPA,EACAxxC,KAAUyxC,WAAVA,EACAzxC,KAAuB0xC,wBAAvBA,EAEVJ,iBAAiBjP,GACf,MAAMxQ,EAAO7xB,KAAKyxC,WAAWnI,WAC7B,GAAIzX,EAAKiX,mBAAmBzG,GAC1B,OAAOxQ,EAAK+T,UAAU5O,kBAAkBqL,GACnC,CACL,MAAMsP,EAC4B,MAAhC3xC,KAAK0xC,wBACD,IAAInJ,UAAUvoC,KAAK0xC,yBAAyB,GAAM,GAClD1xC,KAAKyxC,WAAWrH,YACtB,OAAOsG,8BAA8B1wC,KAAKwxC,QAASnP,EAAUsP,IAGjE7O,mBACE9V,EACAmP,EACA3qB,GAEA,MAAM8+B,EAC4B,MAAhCtwC,KAAK0xC,wBACD1xC,KAAK0xC,wBACL9G,+BAA+B5qC,KAAKyxC,YACpChB,EAAQJ,6BACZrwC,KAAKwxC,QACLlB,EACAnU,EACA,EACA3qB,EACAwb,GAEF,OAAqB,IAAjByjB,EAAMnxC,OACD,KAEAmxC,EAAM,ICpBb,SAAUmB,4BACdC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAc,IAAIpB,uBACxB,IAAI3G,EAAcgI,EAClB,GAAIJ,EAAU9nC,OAASq9B,EAAcc,UAAW,CAC9C,MAAMgK,EAAYL,EACdK,EAAU7uC,OAAOikC,SACnB2C,EAAekI,gCACbR,EACAC,EACAM,EAAUxqB,KACVwqB,EAAU1T,KACVsT,EACAC,EACAC,IAGFtzC,OAAOwzC,EAAU7uC,OAAOkkC,WAAY,mBAIpC0K,EACEC,EAAU7uC,OAAOmkC,QAChBoK,EAAa1H,YAAYxB,eAAiBpgB,YAAY4pB,EAAUxqB,MACnEuiB,EAAemI,kCACbT,EACAC,EACAM,EAAUxqB,KACVwqB,EAAU1T,KACVsT,EACAC,EACAE,EACAD,SAGC,GAAIH,EAAU9nC,OAASq9B,EAAcgB,MAAO,CACjD,MAAM7iB,EAAQssB,EACVtsB,EAAMliB,OAAOikC,SACf2C,EAqYN,SAASoI,4BACPV,EACAvH,EACA1iB,EACA4qB,EACAR,EACA5H,EACA8H,GAQA,IAAIO,EAAenI,EA+BnB,OA9BAkI,EAAgBrG,SAAQ,CAACjB,EAAc7T,KACrC,MAAM0X,EAAY1mB,UAAUT,EAAMsjB,GAC9BwH,2BAA2BpI,EAAW3iB,aAAaonB,MACrD0D,EAAeJ,gCACbR,EACAY,EACA1D,EACA1X,EACA2a,EACA5H,EACA8H,OAKNM,EAAgBrG,SAAQ,CAACjB,EAAc7T,KACrC,MAAM0X,EAAY1mB,UAAUT,EAAMsjB,GAC7BwH,2BAA2BpI,EAAW3iB,aAAaonB,MACtD0D,EAAeJ,gCACbR,EACAY,EACA1D,EACA1X,EACA2a,EACA5H,EACA8H,OAKCO,EAnbYF,CACbV,EACAC,EACArsB,EAAMmC,KACNnC,EAAMyY,SACN8T,EACAC,EACAC,IAGFtzC,OAAO6mB,EAAMliB,OAAOkkC,WAAY,mBAEhC0K,EACE1sB,EAAMliB,OAAOmkC,QAAUoK,EAAa1H,YAAYxB,aAClDuB,EAAewI,8BACbd,EACAC,EACArsB,EAAMmC,KACNnC,EAAMyY,SACN8T,EACAC,EACAE,EACAD,SAGC,GAAIH,EAAU9nC,OAASq9B,EAAcQ,eAAgB,CAC1D,MAAM8K,EAAeb,EAYnB5H,EAXGyI,EAAa/K,OAqmBtB,SAASgL,6BACPhB,EACAvH,EACA1iB,EACAoqB,EACA7C,EACA+C,GAEA,IAAI1H,EACJ,GAAqD,MAAjD2F,2BAA2B6B,EAAapqB,GAC1C,OAAO0iB,EACF,CACL,MAAM/mC,EAAS,IAAIguC,6BACjBS,EACA1H,EACA6E,GAEI3M,EAAgB8H,EAAUhB,WAAW1D,UAC3C,IAAI5C,EACJ,GAAIxa,YAAYZ,IAAgC,cAAvBD,aAAaC,GAAuB,CAC3D,IAAIuK,EACJ,GAAImY,EAAUF,YAAYzB,qBACxBxW,EAAUod,mCACRyC,EACApH,+BAA+BN,QAE5B,CACL,MAAMwI,EAAiBxI,EAAUF,YAAYxE,UAC7ChnC,OACEk0C,aAA0B9W,aAC1B,iDAEF7J,EAAUsd,sCACRuC,EACAc,GAGJ3gB,EAAUA,EACV6Q,EAAgB6O,EAAcrI,OAAO3J,eACnC2C,EACArQ,EACA+f,OAEG,CACL,MAAM7P,EAAW1a,aAAaC,GAC9B,IAAI4X,EAAWkR,8BACbsB,EACA3P,EACAiI,EAAUF,aAGE,MAAZ5K,GACA8K,EAAUF,YAAYtB,mBAAmBzG,KAEzC7C,EAAWgD,EAAcxL,kBAAkBqL,IAG3CW,EADc,MAAZxD,EACcqS,EAAcrI,OAAOhS,YACnCgL,EACAH,EACA7C,EACA1X,aAAaF,GACbrkB,EACA2uC,GAEO5H,EAAUhB,WAAW1D,UAAUzO,SAASkL,GAEjCwP,EAAcrI,OAAOhS,YACnCgL,EACAH,EACArG,aAAanI,WACb/L,aAAaF,GACbrkB,EACA2uC,GAGc1P,EAGhBQ,EAAcv7B,WACd6iC,EAAUF,YAAYzB,uBAGtB6B,EAAW+E,mCACTyC,EACApH,+BAA+BN,IAE7BE,EAASlU,eACX0M,EAAgB6O,EAAcrI,OAAO3J,eACnCmD,EACAwH,EACA0H,KAQR,OAHA1H,EACEF,EAAUF,YAAYzB,sBACqC,MAA3DwH,2BAA2B6B,EAAatqB,gBACnC2iB,yBACLC,EACAtH,EACAwH,EACAqH,EAAcrI,OAAOzJ,iBAjsBN8S,CACbhB,EACAC,EACAc,EAAahrB,KACboqB,EACAC,EACAC,GA4eR,SAASa,0BACPlB,EACAvH,EACA0I,EACApL,EACAoK,EACAC,EACAC,GAEA,GAAwD,MAApD/B,2BAA2B6B,EAAagB,GAC1C,OAAO1I,EAIT,MAAM6H,EAAmB7H,EAAUF,YAAYxB,aAIzCwB,EAAcE,EAAUF,YAC9B,GAA0B,MAAtBxC,EAAazkC,MAAe,CAE9B,GACGqlB,YAAYwqB,IAAY5I,EAAYzB,sBACrCyB,EAAYvB,kBAAkBmK,GAE9B,OAAOV,kCACLT,EACAvH,EACA0I,EACA5I,EAAYxE,UAAU1O,SAAS8b,GAC/BhB,EACAC,EACAE,EACAD,GAEG,GAAI1pB,YAAYwqB,GAAU,CAG/B,IAAIR,EAAkB,IAAI1H,cAAoB,MAI9C,OAHAV,EAAYxE,UAAUjO,aAAa7E,GAAW,CAACrwB,EAAMovB,KACnD2gB,EAAkBA,EAAgBhmC,IAAI,IAAI4a,KAAK3kB,GAAOovB,MAEjD8gB,8BACLd,EACAvH,EACA0I,EACAR,EACAR,EACAC,EACAE,EACAD,GAGF,OAAO5H,EAEJ,CAEL,IAAIkI,EAAkB,IAAI1H,cAAoB,MAU9C,OATAlD,EAAauE,SAAQ,CAAC8G,EAAW9vC,KAC/B,MAAM+vC,EAAkB7qB,UAAU2qB,EAASC,GACvC7I,EAAYvB,kBAAkBqK,KAChCV,EAAkBA,EAAgBhmC,IAChCymC,EACA7I,EAAYxE,UAAU1O,SAASgc,QAI9BP,8BACLd,EACAvH,EACA0I,EACAR,EACAR,EACAC,EACAE,EACAD,IAvkBea,CACblB,EACAC,EACAc,EAAahrB,KACbgrB,EAAahL,aACboK,EACAC,EACAC,OAYC,CAAA,GAAIH,EAAU9nC,OAASq9B,EAAcY,gBAS1C,MAAMnpC,eAAe,2BAA6BgzC,EAAU9nC,MAR5DkgC,EAwjBJ,SAASgJ,4BACPtB,EACAvH,EACA1iB,EACAoqB,EACAE,GAEA,MAAMkB,EAAgB9I,EAAUF,YAC1BD,EAAeM,0BACnBH,EACA8I,EAAcxN,UACdwN,EAAczK,sBAAwBngB,YAAYZ,GAClDwrB,EAAcxK,cAEhB,OAAOyK,gDACLxB,EACA1H,EACAviB,EACAoqB,EACAZ,EACAc,GA5kBeiB,CACbtB,EACAC,EACAC,EAAUnqB,KACVoqB,EACAE,GAKJ,MAAM9I,EAAU8I,EAAYhB,aAE5B,OAGF,SAASoC,gCACPxB,EACA3H,EACA+H,GAEA,MAAM3H,EAAYJ,EAAab,WAC/B,GAAIiB,EAAU5B,qBAAsB,CAClC,MAAM4K,EACJhJ,EAAU3E,UAAUtP,cAAgBiU,EAAU3E,UAAUn+B,UACpD+rC,EAAkB7I,8BAA8BmH,IAEpDI,EAAY5yC,OAAS,IACpBwyC,EAAaxI,WAAWX,sBACxB4K,IAAkBhJ,EAAU3E,UAAUnN,OAAO+a,KAC7CjJ,EAAU3E,UAAUrP,cAAckC,OAAO+a,EAAgBjd,iBAE1D2b,EAAY7wC,KACV29B,YAAY2L,8BAA8BR,MArBhDmJ,CAAgCxB,EAAc3H,EAAcf,GACrD,CAAEkB,UAAWH,EAAcf,QAAAA,GA0BpC,SAASiK,gDACPxB,EACAvH,EACAmJ,EACAzB,EACAzuC,EACA2uC,GAEA,MAAMwB,EAAepJ,EAAUhB,WAC/B,GAA2D,MAAvD6G,2BAA2B6B,EAAayB,GAE1C,OAAOnJ,EACF,CACL,IAAItH,EAAe2O,EACnB,GAAInpB,YAAYirB,GAMd,GAJA70C,OACE0rC,EAAUF,YAAYzB,qBACtB,8DAEE2B,EAAUF,YAAYxB,aAAc,CAItC,MAAMwB,EAAcQ,+BAA+BN,GAK7CqJ,EAAwBlE,sCAC5BuC,EAJA5H,aAAuBpO,aACnBoO,EACApO,aAAanI,YAKnBmP,EAAgB6O,EAAcrI,OAAO3J,eACnCyK,EAAUhB,WAAW1D,UACrB+N,EACAzB,OAEG,CACL,MAAM0B,EAAerE,mCACnByC,EACApH,+BAA+BN,IAEjCtH,EAAgB6O,EAAcrI,OAAO3J,eACnCyK,EAAUhB,WAAW1D,UACrBgO,EACA1B,OAGC,CACL,MAAM7P,EAAW1a,aAAa8rB,GAC9B,GAAiB,cAAbpR,EAA0B,CAC5BzjC,OACgC,IAA9BipB,cAAc4rB,GACd,yDAEF,MAAMI,EAAeH,EAAa9N,UAClC+L,EAAarH,EAAUF,YAAYxE,UAEnC,MAAMkO,EAAkBhE,+CACtBkC,EACAyB,EACAI,EACAlC,GAGA3O,EADqB,MAAnB8Q,EACcjC,EAAcrI,OAAO1S,eACnC+c,EACAC,GAIcJ,EAAa9N,cAE1B,CACL,MAAMmO,EAAkBjsB,aAAa2rB,GAErC,IAAIO,EACJ,GAAIN,EAAa5K,mBAAmBzG,GAAW,CAC7CsP,EAAarH,EAAUF,YAAYxE,UACnC,MAAMqO,EACJnE,+CACEkC,EACAyB,EACAC,EAAa9N,UACb+L,GAGFqC,EADsB,MAApBC,EACcP,EACb9N,UACA5O,kBAAkBqL,GAClB7K,YAAYuc,EAAiBE,GAGhBP,EAAa9N,UAAU5O,kBAAkBqL,QAG3D2R,EAAgBtD,8BACdsB,EACA3P,EACAiI,EAAUF,aAIZpH,EADmB,MAAjBgR,EACcnC,EAAcrI,OAAOhS,YACnCkc,EAAa9N,UACbvD,EACA2R,EACAD,EACAxwC,EACA2uC,GAIcwB,EAAa9N,WAInC,OAAOyE,yBACLC,EACAtH,EACA0Q,EAAa/K,sBAAwBngB,YAAYirB,GACjD5B,EAAcrI,OAAOzJ,iBAK3B,SAASuS,kCACPT,EACAC,EACA2B,EACAS,EACAlC,EACAC,EACAE,EACAD,GAEA,MAAMiC,EAAgBrC,EAAa1H,YACnC,IAAIgK,EACJ,MAAMC,EAAelC,EACjBN,EAAcrI,OACdqI,EAAcrI,OAAOxJ,mBACzB,GAAIxX,YAAYirB,GACdW,EAAiBC,EAAaxU,eAC5BsU,EAAcvO,UACdsO,EACA,WAEG,GAAIG,EAAatU,iBAAmBoU,EAAcvL,aAAc,CAErE,MAAM0L,EAAgBH,EACnBvO,UACApO,YAAYic,EAAYS,GAC3BE,EAAiBC,EAAaxU,eAC5BsU,EAAcvO,UACd0O,EACA,UAEG,CACL,MAAMjS,EAAW1a,aAAa8rB,GAC9B,IACGU,EAActL,kBAAkB4K,IACjC5rB,cAAc4rB,GAAc,EAG5B,OAAO3B,EAET,MAAMiC,EAAkBjsB,aAAa2rB,GAE/Blc,EADY4c,EAAcvO,UAAU5O,kBAAkBqL,GAC7B7K,YAAYuc,EAAiBG,GAE1DE,EADe,cAAb/R,EACegS,EAAavd,eAC5Bqd,EAAcvO,UACdrO,GAGe8c,EAAa7c,YAC5B2c,EAAcvO,UACdvD,EACA9K,EACAwc,EACA3C,EACA,MAIN,MAAMjH,EAAeM,0BACnBqH,EACAsC,EACAD,EAAcxL,sBAAwBngB,YAAYirB,GAClDY,EAAatU,gBAOf,OAAOsT,gDACLxB,EACA1H,EACAsJ,EACAzB,EATa,IAAIT,6BACjBS,EACA7H,EACA8H,GAQAC,GAIJ,SAASG,gCACPR,EACAC,EACA2B,EACAS,EACAlC,EACAC,EACAC,GAEA,MAAMwB,EAAe5B,EAAaxI,WAClC,IAAIa,EAAcnH,EAClB,MAAMz/B,EAAS,IAAIguC,6BACjBS,EACAF,EACAG,GAEF,GAAIzpB,YAAYirB,GACdzQ,EAAgB6O,EAAcrI,OAAO3J,eACnCiS,EAAaxI,WAAW1D,UACxBsO,EACAhC,GAEF/H,EAAeE,yBACbyH,EACA9O,GACA,EACA6O,EAAcrI,OAAOzJ,oBAElB,CACL,MAAMsC,EAAW1a,aAAa8rB,GAC9B,GAAiB,cAAbpR,EACFW,EAAgB6O,EAAcrI,OAAO1S,eACnCgb,EAAaxI,WAAW1D,UACxBsO,GAEF/J,EAAeE,yBACbyH,EACA9O,EACA0Q,EAAa/K,qBACb+K,EAAa9K,kBAEV,CACL,MAAMmL,EAAkBjsB,aAAa2rB,GAC/B9T,EAAW+T,EAAa9N,UAAU5O,kBAAkBqL,GAC1D,IAAI7C,EACJ,GAAIhX,YAAYurB,GAEdvU,EAAW0U,MACN,CACL,MAAM7c,EAAY9zB,EAAO+tC,iBAAiBjP,GAQtC7C,EAPa,MAAbnI,EAEiC,cAAjCtP,YAAYgsB,IACZ1c,EAAUH,SAAS/O,WAAW4rB,IAAkBtsC,UAIrC4vB,EAEAA,EAAUG,YAAYuc,EAAiBG,GAIzClY,aAAanI,WAG5B,GAAK8L,EAASlH,OAAO+G,GAgBnB2K,EAAe2H,MAhBe,CAS9B3H,EAAeE,yBACbyH,EATmBD,EAAcrI,OAAOhS,YACxCkc,EAAa9N,UACbvD,EACA7C,EACAuU,EACAxwC,EACA2uC,GAKAwB,EAAa/K,qBACbkJ,EAAcrI,OAAOzJ,kBAO7B,OAAOoK,EAGT,SAASuI,2BACPpI,EACAjI,GAEA,OAAOiI,EAAUhB,WAAWR,mBAAmBzG,GAoDjD,SAASkS,wBACP1C,EACAhgB,EACApM,GAKA,OAHAA,EAAM0mB,SAAQ,CAACjB,EAAc7T,KAC3BxF,EAAOA,EAAK2F,YAAY0T,EAAc7T,MAEjCxF,EAGT,SAAS8gB,8BACPd,EACAvH,EACA1iB,EACA4qB,EACAR,EACA5H,EACA+H,EACAD,GAIA,GACE5H,EAAUF,YAAYxE,UAAUn+B,YAC/B6iC,EAAUF,YAAYzB,qBAEvB,OAAO2B,EAST,IACIkK,EADA/B,EAAenI,EAGjBkK,EADEhsB,YAAYZ,GACE4qB,EAEA,IAAI1H,cAAoB,MAAMS,QAC5C3jB,EACA4qB,GAGJ,MAAMb,EAAarH,EAAUF,YAAYxE,UAiDzC,OAhDA4O,EAActW,SAASlK,kBAAiB,CAACqO,EAAUnI,KACjD,GAAIyX,EAAWxa,SAASkL,GAAW,CACjC,MAGM7C,EAAW+U,wBACf1C,EAJkBvH,EAAUF,YAC3BxE,UACA5O,kBAAkBqL,GAInBnI,GAEFuY,EAAeH,kCACbT,EACAY,EACA,IAAIrrB,KAAKib,GACT7C,EACAwS,EACA5H,EACA+H,EACAD,OAINsC,EAActW,SAASlK,kBAAiB,CAACqO,EAAUoS,KACjD,MAAMC,GACHpK,EAAUF,YAAYtB,mBAAmBzG,IACjB,OAAzBoS,EAAetxC,MACjB,IAAKwuC,EAAWxa,SAASkL,KAAcqS,EAAoB,CACzD,MAGMlV,EAAW+U,wBACf1C,EAJkBvH,EAAUF,YAC3BxE,UACA5O,kBAAkBqL,GAInBoS,GAEFhC,EAAeH,kCACbT,EACAY,EACA,IAAIrrB,KAAKib,GACT7C,EACAwS,EACA5H,EACA+H,EACAD,OAKCO,EChmBI,MAAAkC,KAMXnyC,YAAoBwmC,EAAsB4L,GAAtB50C,KAAMgpC,OAANA,EAHpBhpC,KAAmB60C,oBAAwB,GAIzC,MAAMr/B,EAASxV,KAAKgpC,OAAOxb,aAErBsnB,EAAc,IAAIxV,cAAc9pB,EAAO4Y,YACvCob,ErBuIJ,SAAUuL,yBAAyBhR,GACvC,OAAIA,EAAYrW,eACP,IAAI4R,cAAcyE,EAAY3V,YAC5B2V,EAAYH,WACd,IAAInC,cAAcsC,GAElB,IAAI9D,aAAa8D,GqB7ITgR,CAAyBv/B,GAExCxV,KAAKg1C,WDEH,SAAUC,iBAAiBzL,GAC/B,MAAO,CAAEA,OAAAA,GCHWyL,CAAiBzL,GAEnC,MAAM0L,EAAqBN,EAAiBxK,YACtC+K,EAAoBP,EAAiBtL,WAGrCoB,EAAaoK,EAAYjV,eAC7B7D,aAAanI,WACbqhB,EAAmBtP,UACnB,MAEI2E,EAAYf,EAAO3J,eACvB7D,aAAanI,WACbshB,EAAkBvP,UAClB,MAEIwO,EAAiB,IAAI7L,UACzBmC,EACAwK,EAAmBvM,qBACnBmM,EAAY/U,gBAERiD,EAAgB,IAAIuF,UACxBgC,EACA4K,EAAkBxM,qBAClBa,EAAOzJ,gBAGT//B,KAAKyxC,WAAatH,aAAanH,EAAeoR,GAC9Cp0C,KAAKo1C,gBAAkB,IAAIrM,eAAe/oC,KAAKgpC,QAG7C3zB,YACF,OAAOrV,KAAKgpC,QAYA,SAAAqM,2BACdC,EACA1tB,GAEA,MAAM2tB,EAAQ3K,+BAA+B0K,EAAK7D,YAClD,OAAI8D,IAIAD,EAAKjgC,MAAMmY,aAAaE,iBACtBlF,YAAYZ,KACX2tB,EAAMve,kBAAkBrP,aAAaC,IAAOngB,WAExC8tC,EAAMre,SAAStP,GAGnB,KAGH,SAAU4tB,YAAYF,GAC1B,OAA2C,IAApCA,EAAKT,oBAAoBv1C,OAelB,SAAAm2C,4BACdH,EACAI,EACAC,GAEA,MAAMC,EAA8B,GACpC,GAAID,EAAa,CACf/2C,OACuB,MAArB82C,EACA,mDAEF,MAAM9tB,EAAO0tB,EAAKjgC,MAAMwX,MACxByoB,EAAKT,oBAAoBzP,SAAQ4E,IAC/B,MAAM6L,EAAa7L,EAAa8L,kBAAkBH,EAAa/tB,GAC3DiuB,GACFD,EAAav0C,KAAKw0C,MAKxB,GAAIH,EAAmB,CACrB,IAAIK,EAAY,GAChB,IAAK,IAAI12C,EAAI,EAAGA,EAAIi2C,EAAKT,oBAAoBv1C,SAAUD,EAAG,CACxD,MAAM22C,EAAWV,EAAKT,oBAAoBx1C,GAC1C,GAAK22C,EAASnV,QAAQ6U,IAEf,GAAIA,EAAkBO,iBAAkB,CAE7CF,EAAYA,EAAUG,OAAOZ,EAAKT,oBAAoB3sB,MAAM7oB,EAAI,IAChE,YAJA02C,EAAU10C,KAAK20C,GAOnBV,EAAKT,oBAAsBkB,OAE3BT,EAAKT,oBAAsB,GAE7B,OAAOe,EAMH,SAAUO,mBACdb,EACAvD,EACAC,EACA7C,GAGE4C,EAAU9nC,OAASq9B,EAAcgB,OACJ,OAA7ByJ,EAAUxuC,OAAO8pB,UAEjBzuB,OACEgsC,+BAA+B0K,EAAK7D,YACpC,6DAEF7yC,OACE+rC,8BAA8B2K,EAAK7D,YACnC,4DAIJ,MAAMK,EAAewD,EAAK7D,WACpBhiB,EAASmiB,4BACb0D,EAAKN,WACLlD,EACAC,EACAC,EACA7C,GAYF,ODzJc,SAAAiH,2BACdvE,EACAvH,GAEA1rC,OACE0rC,EAAUhB,WAAW1D,UAAUpN,UAAUqZ,EAAcrI,OAAOpb,YAC9D,0BAEFxvB,OACE0rC,EAAUF,YAAYxE,UAAUpN,UAAUqZ,EAAcrI,OAAOpb,YAC/D,2BCqIFgoB,CAA2Bd,EAAKN,WAAYvlB,EAAO6a,WAEnD1rC,OACE6wB,EAAO6a,UAAUF,YAAYzB,uBAC1BmJ,EAAa1H,YAAYzB,qBAC5B,2DAGF2M,EAAK7D,WAAahiB,EAAO6a,UAElB+L,8BACLf,EACA7lB,EAAO2Z,QACP3Z,EAAO6a,UAAUhB,WAAW1D,UAC5B,MA2BJ,SAASyQ,8BACPf,EACAlM,EACAE,EACAoM,GAEA,MAAMrM,EAAgBqM,EAClB,CAACA,GACDJ,EAAKT,oBACT,OR5NI,SAAUyB,uCACdpN,EACAE,EACAE,EACAiN,GAEA,MAAMpN,EAAkB,GAClBqN,EAAkB,GAuDxB,OArDApN,EAAQhE,SAAQqE,IAE4B,kBAAxCA,EAAOx/B,MACPi/B,EAAe3J,OAAOtN,oBACpBwX,EAAOpK,QACPoK,EAAOxK,eAGTuX,EAAMn1C,KjBUI,SAAAo1C,iBACdxf,EACAgI,GAEA,MAAO,CAAEh1B,KAA4B,cAAEg1B,aAAAA,EAAchI,UAAAA,GiBdtCwf,CAAiBhN,EAAOxS,UAAWwS,EAAOxK,kBAIzDgK,oCACEC,EACAC,EAAM,gBAENC,EACAmN,EACAjN,GAEFL,oCACEC,EACAC,EAAM,cAENC,EACAmN,EACAjN,GAEFL,oCACEC,EACAC,EAAM,cAENqN,EACAD,EACAjN,GAEFL,oCACEC,EACAC,EAAM,gBAENC,EACAmN,EACAjN,GAEFL,oCACEC,EACAC,EAAM,QAENC,EACAmN,EACAjN,GAGKH,EQ8JAmN,CACLhB,EAAKF,gBACLhM,EACAE,EACAD,GCrOJ,IAAIqN,EC6BAA,EDjBS,MAAAC,UAAbn0C,cAOWxC,KAAA42C,MAA2B,IAAI9rB,KAsBpC,SAAU+rB,wBACdC,EACA/E,EACAC,EACA+E,GAEA,MAAM1pB,EAAU0kB,EAAUxuC,OAAO8pB,QACjC,GAAgB,OAAZA,EAAkB,CACpB,MAAMioB,EAAOwB,EAAUF,MAAMhqC,IAAIygB,GAEjC,OADAzuB,OAAe,MAAR02C,EAAc,gDACda,mBACLb,EACAvD,EACAC,EACA+E,GAEG,CACL,IAAI5N,EAAkB,GAEtB,IAAK,MAAMmM,KAAQwB,EAAUF,MAAMllB,SACjCyX,EAASA,EAAO+M,OACdC,mBAAmBb,EAAMvD,EAAWC,EAAa+E,IAIrD,OAAO5N,GAaL,SAAU6N,iBACdF,EACAzhC,EACA28B,EACA5H,EACA6M,GAEA,MAAM5pB,EAAUhY,EAAMiY,iBAChBgoB,EAAOwB,EAAUF,MAAMhqC,IAAIygB,GACjC,IAAKioB,EAAM,CAET,IAAIhM,EAAaiG,mCACfyC,EACAiF,EAAsB7M,EAAc,MAElC8M,GAAqB,EACrB5N,EACF4N,GAAqB,EACZ9M,aAAuBpO,cAChCsN,EAAamG,sCACXuC,EACA5H,GAEF8M,GAAqB,IAErB5N,EAAatN,aAAanI,WAC1BqjB,GAAqB,GAEvB,MAAM5M,EAAYH,aAChB,IAAI5B,UAAUe,EAAY4N,GAAoB,GAC9C,IAAI3O,UAAU6B,EAAa6M,GAAqB,IAElD,OAAO,IAAItC,KAAKt/B,EAAOi1B,GAEzB,OAAOgL,EAaO,SAAA6B,8BACdL,EACAzhC,EACAqgC,EACA1D,EACA5H,EACA6M,GAEA,MAAM3B,EAAO0B,iBACXF,EACAzhC,EACA28B,EACA5H,EACA6M,GAOF,OALKH,EAAUF,MAAMrpB,IAAIlY,EAAMiY,mBAC7BwpB,EAAUF,MAAMpqC,IAAI6I,EAAMiY,iBAAkBgoB,GDjDhC,SAAA8B,yBACd9B,EACAI,GAEAJ,EAAKT,oBAAoBxzC,KAAKq0C,GCgD9B0B,CAAyB9B,EAAMI,GDgDjB,SAAA2B,qBACd/B,EACAtL,GAEA,MAAMO,EAAY+K,EAAK7D,WAAWnI,WAC5BgO,EAA2B,GAC5B/M,EAAU3E,UAAUtP,cACLiU,EAAU3E,UAClBjO,aAAae,GAAgB,CAACrxB,EAAKgwB,KAC3CigB,EAAej2C,KAAK69B,iBAAiB73B,EAAKgwB,OAM9C,OAHIkT,EAAU5B,sBACZ2O,EAAej2C,KAAK29B,YAAYuL,EAAU3E,YAErCyQ,8BACLf,EACAgC,EACA/M,EAAU3E,UACVoE,GClEKqN,CAAqB/B,EAAMI,GAa9B,SAAU6B,iCACdT,EACAzhC,EACAqgC,EACAC,GAEA,MAAMtoB,EAAUhY,EAAMiY,iBAChBkqB,EAA0B,GAChC,IAAI5B,EAAwB,GAC5B,MAAM6B,EAAkBC,yBAAyBZ,GACjD,GAAgB,YAAZzpB,EAEF,IAAK,MAAOsqB,EAAarC,KAASwB,EAAUF,MAAMzR,UAChDyQ,EAAeA,EAAaM,OAC1BT,4BAA4BH,EAAMI,EAAmBC,IAEnDH,YAAYF,KACdwB,EAAUF,MAAMj5B,OAAOg6B,GAGlBrC,EAAKjgC,MAAMmY,aAAaE,gBAC3B8pB,EAAQn2C,KAAKi0C,EAAKjgC,YAInB,CAEL,MAAMigC,EAAOwB,EAAUF,MAAMhqC,IAAIygB,GAC7BioB,IACFM,EAAeA,EAAaM,OAC1BT,4BAA4BH,EAAMI,EAAmBC,IAEnDH,YAAYF,KACdwB,EAAUF,MAAMj5B,OAAO0P,GAGlBioB,EAAKjgC,MAAMmY,aAAaE,gBAC3B8pB,EAAQn2C,KAAKi0C,EAAKjgC,SAa1B,OAPIoiC,IAAoBC,yBAAyBZ,IAE/CU,EAAQn2C,KACN,IA7KN,SAASu2C,mCAEP,OADAh5C,OAAO83C,EAAsB,oCACtBA,EA2KH,GAAA,CAAyCrhC,EAAMwiC,MAAOxiC,EAAMwX,QAIzD,CAAE2qB,QAAAA,EAASrO,OAAQyM,GAGtB,SAAUkC,uBAAuBhB,GACrC,MAAMrnB,EAAS,GACf,IAAK,MAAM6lB,KAAQwB,EAAUF,MAAMllB,SAC5B4jB,EAAKjgC,MAAMmY,aAAaE,gBAC3B+B,EAAOpuB,KAAKi0C,GAGhB,OAAO7lB,EAOO,SAAAsoB,gCACdjB,EACAlvB,GAEA,IAAIwiB,EAA2B,KAC/B,IAAK,MAAMkL,KAAQwB,EAAUF,MAAMllB,SACjC0Y,EAAcA,GAAeiL,2BAA2BC,EAAM1tB,GAEhE,OAAOwiB,EAGO,SAAA4N,sBACdlB,EACAzhC,GAGA,GADeA,EAAMmY,aACVE,eACT,OAAOuqB,yBAAyBnB,GAC3B,CACL,MAAMzpB,EAAUhY,EAAMiY,iBACtB,OAAOwpB,EAAUF,MAAMhqC,IAAIygB,IAIf,SAAA6qB,4BACdpB,EACAzhC,GAEA,OAAkD,MAA3C2iC,sBAAsBlB,EAAWzhC,GAGpC,SAAUqiC,yBAAyBZ,GACvC,OAA8C,MAAvCmB,yBAAyBnB,GAG5B,SAAUmB,yBAAyBnB,GACvC,IAAK,MAAMxB,KAAQwB,EAAUF,MAAMllB,SACjC,GAAI4jB,EAAKjgC,MAAMmY,aAAaE,eAC1B,OAAO4nB,EAGX,OAAO,KC/MT,IAAI6C,EAAwB,EA2Bf,MAAAC,SAkBX51C,YAAmB61C,GAAAr4C,KAAeq4C,gBAAfA,EAdnBr4C,KAAAs4C,eAA2C,IAAIxN,cAAyB,MAKxE9qC,KAAiBu4C,kBNqfH,SAAA3L,eACd,MAAO,CACL4B,cAAelC,cAAcW,QAC7Be,UAAW,GACXW,aAAc,GMzfe/B,GAEtB5sC,KAAAw4C,cAAqC,IAAI1tB,IACzC9qB,KAAAy4C,cAAqC,IAAI3tB,KAc9C,SAAU4tB,2BACdC,EACA/wB,EACAgxB,EACA7K,EACA5jB,GAWA,ONjGI,SAAU0uB,sBACdnL,EACA9lB,EACA8W,EACAqP,EACA5jB,GAEAvrB,OACEmvC,EAAUL,EAAUiB,YACpB,qDAEctrC,IAAZ8mB,IACFA,GAAU,GAEZujB,EAAUM,UAAU3sC,KAAK,CACvBumB,KAAAA,EACA8W,KAAAA,EACAqP,QAAAA,EACA5jB,QAAAA,IAGEA,IACFujB,EAAUc,cAAgBhC,sBACxBkB,EAAUc,cACV5mB,EACA8W,IAGJgP,EAAUiB,YAAcZ,EM6DxB8K,CACEF,EAASJ,kBACT3wB,EACAgxB,EACA7K,EACA5jB,GAGGA,EAGI2uB,oCACLH,EACA,IAAIxQ,UhB/HD,CACLX,UAAU,EACVC,YAAY,EACZpa,QAAS,KACTqa,QAAQ,GgB2HkC9f,EAAMgxB,IAJzC,GAcL,SAAUG,uBACdJ,EACA/wB,EACA4qB,EACAzE,INlFI,SAAUiL,kBACdtL,EACA9lB,EACA4qB,EACAzE,GAEAnvC,OACEmvC,EAAUL,EAAUiB,YACpB,gDAEFjB,EAAUM,UAAU3sC,KAAK,CACvBumB,KAAAA,EACAsW,SAAUsU,EACVzE,QAAAA,EACA5jB,SAAS,IAGXujB,EAAUc,cAAgB3B,uBACxBa,EAAUc,cACV5mB,EACA4qB,GAEF9E,EAAUiB,YAAcZ,EM+DxBiL,CAAkBL,EAASJ,kBAAmB3wB,EAAM4qB,EAAiBzE,GAErE,MAAMkL,EAAanO,cAAcoO,WAAW1G,GAE5C,OAAOsG,oCACLH,EACA,IAAItQ,MhBtJC,CACLb,UAAU,EACVC,YAAY,EACZpa,QAAS,KACTqa,QAAQ,GgBkJ4B9f,EAAMqxB,IAUxC,SAAUE,qBACdR,EACA5K,EACAlG,GAAkB,GAElB,MAAMzrB,ENjFQ,SAAAg9B,kBACd1L,EACAK,GAEA,IAAK,IAAI1uC,EAAI,EAAGA,EAAIquC,EAAUM,UAAU1uC,OAAQD,IAAK,CACnD,MAAMg6C,EAAS3L,EAAUM,UAAU3uC,GACnC,GAAIg6C,EAAOtL,UAAYA,EACrB,OAAOsL,EAGX,OAAO,KMuEOD,CAAkBT,EAASJ,kBAAmBxK,GAK5D,GAJyBD,qBACvB6K,EAASJ,kBACTxK,GAIK,CACL,IAAInG,EAAe,IAAIkD,cAAuB,MAS9C,OARkB,MAAd1uB,EAAMsiB,KAERkJ,EAAeA,EAAap7B,IAAIkb,gBAAgB,GAEhDjX,KAAK2L,EAAM8hB,UAAW5Y,IACpBsiB,EAAeA,EAAap7B,IAAI,IAAI4a,KAAK9B,IAAa,MAGnDwzB,oCACLH,EACA,IAAIhR,aAAavrB,EAAMwL,KAAMggB,EAAcC,IAb7C,MAAO,GAuBK,SAAAyR,6BACdX,EACA/wB,EACAgxB,GAEA,OAAOE,oCACLH,EACA,IAAIxQ,UhBhMC,CACLX,UAAU,EACVC,YAAY,EACZpa,QAAS,KACTqa,QAAQ,GgB4LkC9f,EAAMgxB,IA4EpC,SAAAW,gCACdZ,EACAtjC,EACAqgC,EACAC,EACA6D,GAAoB,GAGpB,MAAM5xB,EAAOvS,EAAMwX,MACb4sB,EAAiBd,EAASL,eAAe1rC,IAAIgb,GACnD,IAAIguB,EAAwB,GAI5B,GACE6D,IAC4B,YAA3BpkC,EAAMiY,kBACL4qB,4BAA4BuB,EAAgBpkC,IAC9C,CACA,MAAMqkC,EAAmBnC,iCACvBkC,EACApkC,EACAqgC,EACAC,ID9QA,SAAUgE,iBAAiB7C,GAC/B,OAAgC,IAAzBA,EAAUF,MAAM/5B,MC+QjB88B,CAAiBF,KACnBd,EAASL,eAAiBK,EAASL,eAAevrC,OAAO6a,IAG3D,MAAM4vB,EAAUkC,EAAiBlC,QAGjC,GAFA5B,EAAe8D,EAAiBvQ,QAE3BqQ,EAAmB,CAStB,MAAMI,GACH,IACDpC,EAAQvJ,WAAU54B,GACTA,EAAMmY,aAAaE,iBAExBmsB,EAAUlB,EAASL,eAAezM,WACtCjkB,GACA,CAACsjB,EAAc4O,IACbpC,yBAAyBoC,KAG7B,GAAIF,IAAoBC,EAAS,CAC/B,MAAM7R,EAAU2Q,EAASL,eAAetQ,QAAQpgB,GAGhD,IAAKogB,EAAQvgC,UAAW,CAEtB,MAAMsyC,EAgfhB,SAASC,wCACPhS,GAEA,OAAOA,EAAQyD,MAAa,CAACP,EAAc+O,EAAqBC,KAC9D,GAAID,GAAuBvC,yBAAyBuC,GAAsB,CAExE,MAAO,CADchC,yBAAyBgC,IAEzC,CAEL,IAAIrD,EAAgB,GAOpB,OANIqD,IACFrD,EAAQkB,uBAAuBmC,IAEjCxpC,KAAKypC,GAAU,CAACC,EAAcC,KAC5BxD,EAAQA,EAAMV,OAAOkE,MAEhBxD,MAhgBcoD,CAAwChS,GAGzD,IAAK,IAAI3oC,EAAI,EAAGA,EAAI06C,EAASz6C,SAAUD,EAAG,CACxC,MAAMi2C,EAAOyE,EAAS16C,GACpBg7C,EAAW/E,EAAKjgC,MACZnC,EAAWonC,+BAA+B3B,EAAUrD,GAC1DqD,EAASN,gBAAgBkC,eACvBC,2BAA2BH,GAC3BI,oBAAoB9B,EAAU0B,GAC9BnnC,EAAS0a,OACT1a,EAASqS,cASjB,IAAKs0B,GAAWrC,EAAQl4C,OAAS,IAAMq2C,EAGrC,GAAIiE,EAAiB,CAEnB,MAAMc,EAA4B,KAClC/B,EAASN,gBAAgBsC,cACvBH,2BAA2BnlC,GAC3BqlC,QAGFlD,EAAQpS,SAASwV,IACf,MAAMC,EAAclC,EAASF,cAAc7rC,IACzCkuC,sBAAsBF,IAExBjC,EAASN,gBAAgBsC,cACvBH,2BAA2BI,GAC3BC,OAgfd,SAASE,oBAAoBpC,EAAoBlnB,GAC/C,IAAK,IAAIloB,EAAI,EAAGA,EAAIkoB,EAAQnyB,SAAUiK,EAAG,CACvC,MAAMyxC,EAAevpB,EAAQloB,GAC7B,IAAKyxC,EAAaxtB,aAAaE,eAAgB,CAE7C,MAAMutB,EAAkBH,sBAAsBE,GACxCE,EAAkBvC,EAASF,cAAc7rC,IAAIquC,GACnDtC,EAASF,cAAc96B,OAAOs9B,GAC9BtC,EAASH,cAAc76B,OAAOu9B,KAjfhCH,CAAoBpC,EAAUnB,GAIhC,OAAO5B,EAQH,SAAUuF,kCACdxC,EACA/wB,EACA8W,EACAtR,GAEA,MAAMguB,EAAWC,wBAAwB1C,EAAUvrB,GACnD,GAAgB,MAAZguB,EAAkB,CACpB,MAAM5uB,EAAI8uB,uBAAuBF,GAC3BG,EAAY/uB,EAAE5E,KAClByF,EAAUb,EAAEa,QACR6d,EAAeziB,gBAAgB8yB,EAAW3zB,GAMhD,OAAO4zB,8BAA8B7C,EAAU4C,EALpC,IAAIpT,UACbZ,oCAAoCla,GACpC6d,EACAxM,IAKF,MAAO,GAuCL,SAAU+c,6BACd9C,EACAtjC,EACAqgC,EACAgG,GAAoB,GAEpB,MAAM9zB,EAAOvS,EAAMwX,MAEnB,IAAIud,EAA2B,KAC3BuR,GAA2B,EAG/BhD,EAASL,eAAetM,cAAcpkB,GAAM,CAACg0B,EAAiBC,KAC5D,MAAM3Q,EAAeziB,gBAAgBmzB,EAAiBh0B,GACtDwiB,EACEA,GAAe2N,gCAAgC8D,EAAI3Q,GACrDyQ,EACEA,GAA4BjE,yBAAyBmE,MAEzD,IAWI5E,EAXAH,EAAY6B,EAASL,eAAe1rC,IAAIgb,GAY5C,GAXKkvB,GAIH6E,EACEA,GAA4BjE,yBAAyBZ,GACvD1M,EACEA,GAAe2N,gCAAgCjB,EAAWpvB,kBAN5DovB,EAAY,IAAIH,UAChBgC,EAASL,eAAiBK,EAASL,eAAe9rC,IAAIob,EAAMkvB,IAS3C,MAAf1M,EACF6M,GAAsB,MACjB,CACLA,GAAsB,EACtB7M,EAAcpO,aAAanI,WACX8kB,EAASL,eAAetQ,QAAQpgB,GACxCykB,cAAa,CAACpV,EAAW6kB,KAC/B,MAAM7J,EAAgB8F,gCACpB+D,EACAp0B,gBAEEuqB,IACF7H,EAAcA,EAAY9S,qBACxBL,EACAgb,OAMR,MAAM8J,EAAoB7D,4BAA4BpB,EAAWzhC,GACjE,IAAK0mC,IAAsB1mC,EAAMmY,aAAaE,eAAgB,CAE5D,MAAM0tB,EAAWN,sBAAsBzlC,GACvCzW,QACG+5C,EAASF,cAAclrB,IAAI6tB,GAC5B,0CAEF,MAAMhuB,EAuXV,SAAS4uB,2BACP,OAAO7D,IAxXO6D,GACZrD,EAASF,cAAcjsC,IAAI4uC,EAAUhuB,GACrCurB,EAASH,cAAchsC,IAAI4gB,EAAKguB,GAGlC,IAAIjS,EAASgO,8BACXL,EACAzhC,EACAqgC,EAJkB9H,qBAAqB+K,EAASJ,kBAAmB3wB,GAMnEwiB,EACA6M,GAEF,IAAK8E,IAAsBJ,IAA6BD,EAAmB,CACzE,MAAMpG,EAAO0C,sBAAsBlB,EAAWzhC,GAC9C8zB,EAASA,EAAO+M,OAiXpB,SAAS+F,uBACPtD,EACAtjC,EACAigC,GAEA,MAAM1tB,EAAOvS,EAAMwX,MACbO,EAAMqtB,oBAAoB9B,EAAUtjC,GACpCnC,EAAWonC,+BAA+B3B,EAAUrD,GAEpDnM,EAASwP,EAASN,gBAAgBkC,eACtCC,2BAA2BnlC,GAC3B+X,EACAla,EAAS0a,OACT1a,EAASqS,YAGLyiB,EAAU2Q,EAASL,eAAetQ,QAAQpgB,GAGhD,GAAIwF,EACFxuB,QACG84C,yBAAyB1P,EAAQ7kC,OAClC,yDAEG,CAEL,MAAM+4C,EAAgBlU,EAAQyD,MAC5B,CAACP,EAAc+O,EAAqBC,KAClC,IACG1xB,YAAY0iB,IACb+O,GACAvC,yBAAyBuC,GAEzB,MAAO,CAAChC,yBAAyBgC,GAAqB5kC,OACjD,CAEL,IAAIoc,EAA0B,GAW9B,OAVIwoB,IACFxoB,EAAUA,EAAQykB,OAChB4B,uBAAuBmC,GAAqBvyC,KAC1C4tC,GAAQA,EAAKjgC,UAInB5E,KAAKypC,GAAU,CAACC,EAAcgC,KAC5B1qB,EAAUA,EAAQykB,OAAOiG,MAEpB1qB,MAIb,IAAK,IAAIpyB,EAAI,EAAGA,EAAI68C,EAAc58C,SAAUD,EAAG,CAC7C,MAAM+8C,EAAcF,EAAc78C,GAClCs5C,EAASN,gBAAgBsC,cACvBH,2BAA2B4B,GAC3B3B,oBAAoB9B,EAAUyD,KAIpC,OAAOjT,EA5akB8S,CAAuBtD,EAAUtjC,EAAOigC,IAEjE,OAAOnM,EAcO,SAAAkT,+BACd1D,EACA/wB,EACAwnB,GAEA,MACM1B,EAAYiL,EAASJ,kBACrBnO,EAAcuO,EAASL,eAAezM,WAC1CjkB,GACA,CAAC+jB,EAAWmL,KACV,MACM1M,EAAc2N,gCAClBjB,EAFmBruB,gBAAgBkjB,EAAW/jB,IAKhD,GAAIwiB,EACF,OAAOA,KAIb,OAAO6E,gCACLvB,EACA9lB,EACAwiB,EACAgF,GAnBwB,GAwBZ,SAAAkN,uBACd3D,EACAtjC,GAEA,MAAMuS,EAAOvS,EAAMwX,MACnB,IAAIud,EAA2B,KAG/BuO,EAASL,eAAetM,cAAcpkB,GAAM,CAACg0B,EAAiBC,KAC5D,MAAM3Q,EAAeziB,gBAAgBmzB,EAAiBh0B,GACtDwiB,EACEA,GAAe2N,gCAAgC8D,EAAI3Q,MAEvD,IAAI4L,EAAY6B,EAASL,eAAe1rC,IAAIgb,GACvCkvB,EAIH1M,EACEA,GAAe2N,gCAAgCjB,EAAWpvB,iBAJ5DovB,EAAY,IAAIH,UAChBgC,EAASL,eAAiBK,EAASL,eAAe9rC,IAAIob,EAAMkvB,IAK9D,MAAMG,EAAqC,MAAf7M,EACtBmS,EAAoCtF,EACtC,IAAI1O,UAAU6B,GAAa,GAAM,GACjC,KAYJ,OFliBI,SAAUoS,oBAAoBlH,GAClC,OAAO3K,8BAA8B2K,EAAK7D,YEiiBnC+K,CAPYxF,iBACjBF,EACAzhC,EANuCu4B,qBACvC+K,EAASJ,kBACTljC,EAAMwX,OAMNoqB,EAAsBsF,EAAgB3W,UAAY5J,aAAanI,WAC/DojB,IAkBJ,SAAS6B,oCACPH,EACA5G,GAEA,OAAO0K,8BACL1K,EACA4G,EAASL,eACQ,KACjB1K,qBAAqB+K,EAASJ,kBAAmB7wB,iBAOrD,SAAS+0B,8BACP1K,EACA2K,EACAtS,EACA4H,GAEA,GAAIxpB,YAAYupB,EAAUnqB,MACxB,OAAO+0B,yCACL5K,EACA2K,EACAtS,EACA4H,GAEG,CACL,MAAM8E,EAAY4F,EAAc9vC,IAAI8a,gBAGjB,MAAf0iB,GAAoC,MAAb0M,IACzB1M,EAAc2N,gCAAgCjB,EAAWpvB,iBAG3D,IAAIyhB,EAAkB,GACtB,MAAMlS,EAAYtP,aAAaoqB,EAAUnqB,MACnCg1B,EAAiB7K,EAAUhK,kBAAkB9Q,GAC7CiD,EAAYwiB,EAAcxe,SAAStxB,IAAIqqB,GAC7C,GAAIiD,GAAa0iB,EAAgB,CAC/B,MAAMC,EAAmBzS,EACrBA,EAAYpT,kBAAkBC,GAC9B,KACE6lB,EAAmBjM,kBAAkBmB,EAAa/a,GACxDkS,EAASA,EAAO+M,OACduG,8BACEG,EACA1iB,EACA2iB,EACAC,IAWN,OANIhG,IACF3N,EAASA,EAAO+M,OACdW,wBAAwBC,EAAW/E,EAAWC,EAAa5H,KAIxDjB,GAOX,SAASwT,yCACP5K,EACA2K,EACAtS,EACA4H,GAEA,MAAM8E,EAAY4F,EAAc9vC,IAAI8a,gBAGjB,MAAf0iB,GAAoC,MAAb0M,IACzB1M,EAAc2N,gCAAgCjB,EAAWpvB,iBAG3D,IAAIyhB,EAAkB,GAyBtB,OAxBAuT,EAAcxe,SAASlK,kBAAiB,CAACiD,EAAWiD,KAClD,MAAM2iB,EAAmBzS,EACrBA,EAAYpT,kBAAkBC,GAC9B,KACE6lB,EAAmBjM,kBAAkBmB,EAAa/a,GAClD2lB,EAAiB7K,EAAUhK,kBAAkB9Q,GAC/C2lB,IACFzT,EAASA,EAAO+M,OACdyG,yCACEC,EACA1iB,EACA2iB,EACAC,QAMJhG,IACF3N,EAASA,EAAO+M,OACdW,wBAAwBC,EAAW/E,EAAWC,EAAa5H,KAIxDjB,EAGT,SAASmR,+BACP3B,EACArD,GAEA,MAAMjgC,EAAQigC,EAAKjgC,MACb+X,EAAMqtB,oBAAoB9B,EAAUtjC,GAE1C,MAAO,CACLuY,OAAQ,KACN,MAAM2nB,EF5qBN,SAAUwH,mBAAmBzH,GACjC,OAAOA,EAAK7D,WAAWrH,YAAYxE,UE2qBjBmX,CAAmBzH,IAAStZ,aAAanI,WACvD,OAAO0hB,EAAM/vB,QAEfD,WAAawI,IACX,GAAe,OAAXA,EACF,OAAIX,EArfI,SAAA4vB,kCACdrE,EACA/wB,EACAwF,GAEA,MAAMguB,EAAWC,wBAAwB1C,EAAUvrB,GACnD,GAAIguB,EAAU,CACZ,MAAM5uB,EAAI8uB,uBAAuBF,GAC3BG,EAAY/uB,EAAE5E,KAClByF,EAAUb,EAAEa,QACR6d,EAAeziB,gBAAgB8yB,EAAW3zB,GAKhD,OAAO4zB,8BAA8B7C,EAAU4C,EAJpC,IAAItT,eACbV,oCAAoCla,GACpC6d,IAKF,MAAO,GAoeM8R,CAAkCrE,EAAUtjC,EAAMwX,MAAOO,GArgB1D,SAAA6vB,4BACdtE,EACA/wB,GAEA,OAAOkxB,oCACLH,EACA,IAAI1Q,ehBjOC,CACLT,UAAU,EACVC,YAAY,EACZpa,QAAS,KACTqa,QAAQ,GgB6NuC9f,IAigBlCq1B,CAA4BtE,EAAUtjC,EAAMwX,OAEhD,CAGL,MAAM5pB,E3D3UE,SAAAi6C,mBAAmBvpC,EAAc0B,GAC/C,IAAI8P,EAAS,gBACA,YAATxR,EACFwR,EACE,0FAEgB,sBAATxR,EACTwR,EAAS,6DACS,gBAATxR,IACTwR,EAAS,8BAGX,MAAMliB,EAAQ,IAAIjE,MAChB2U,EAAO,OAAS0B,EAAMwX,MAAM7f,WAAa,KAAOmY,GAIlD,OADCliB,EAAc0Q,KAAOA,EAAKwpC,cACpBl6C,E2D0Tai6C,CAAmBnvB,EAAQ1Y,GACzC,OAAOkkC,gCACLZ,EACAtjC,EACsB,KACtBpS,MAUM,SAAAw3C,oBACd9B,EACAtjC,GAEA,MAAM+lC,EAAWN,sBAAsBzlC,GACvC,OAAOsjC,EAASF,cAAc7rC,IAAIwuC,GAMpC,SAASN,sBAAsBzlC,GAC7B,OAAOA,EAAMwX,MAAM7f,WAAa,IAAMqI,EAAMiY,iBAM9C,SAAS+tB,wBACP1C,EACAvrB,GAEA,OAAOurB,EAASH,cAAc5rC,IAAIwgB,GAMpC,SAASkuB,uBAAuBF,GAI9B,MAAMgC,EAAahC,EAAStmC,QAAQ,KAKpC,OAJAlW,QACkB,IAAhBw+C,GAAqBA,EAAahC,EAAS97C,OAAS,EACpD,iBAEK,CACL+tB,QAAS+tB,EAASzpC,OAAOyrC,EAAa,GACtCx1B,KAAM,IAAIR,KAAKg0B,EAASzpC,OAAO,EAAGyrC,KAOtC,SAAS5B,8BACP7C,EACA4C,EACAxJ,GAEA,MAAM+E,EAAY6B,EAASL,eAAe1rC,IAAI2uC,GAC9C38C,OAAOk4C,EAAW,wDAKlB,OAAOD,wBAAwBC,EAAW/E,EAJtBnE,qBAClB+K,EAASJ,kBACTgD,GAEgE,MAiCpE,SAASf,2BAA2BnlC,GAClC,OAAIA,EAAMmY,aAAaE,iBAAmBrY,EAAMmY,aAAaC,YAIpD,IA5zBX,SAAS4vB,kCAEP,OADAz+C,OAAO83C,EAAsB,oCACtBA,EA0zBE,GAAA,CAAwCrhC,EAAMwiC,MAAOxiC,EAAMwX,OAE3DxX,EC12BX,MAAMioC,sBACJ96C,YAAqBgmC,GAAAxoC,KAAKwoC,MAALA,EAErBxR,kBAAkBC,GAChB,MAAMkF,EAAQn8B,KAAKwoC,MAAMxR,kBAAkBC,GAC3C,OAAO,IAAIqmB,sBAAsBnhB,GAGnCtK,OACE,OAAO7xB,KAAKwoC,OAIhB,MAAM+U,sBAIJ/6C,YAAYm2C,EAAoB/wB,GAC9B5nB,KAAKw9C,UAAY7E,EACjB34C,KAAKy9C,MAAQ71B,EAGfoP,kBAAkBC,GAChB,MAAM+T,EAAY3iB,UAAUroB,KAAKy9C,MAAOxmB,GACxC,OAAO,IAAIsmB,sBAAsBv9C,KAAKw9C,UAAWxS,GAGnDnZ,OACE,OAAOwqB,+BAA+Br8C,KAAKw9C,UAAWx9C,KAAKy9C,QAOxD,MAcMC,yBAA2B,SACtCv6C,EACAw6C,EACAC,GAEA,OAAKz6C,GAA0B,iBAAVA,GAGrBvE,OAAO,QAASuE,EAAO,6CAEK,iBAAjBA,EAAM,OACR06C,2BAA2B16C,EAAM,OAAQw6C,EAAaC,GAC5B,iBAAjBz6C,EAAM,OACf26C,4BAA4B36C,EAAM,OAAQw6C,QAEjD/+C,QAAO,EAAO,4BAA8B2F,KAAKmC,UAAUvD,EAAO,KAAM,KATjEA,GAaL06C,2BAA6B,SACjCE,EACA/H,EACA4H,GAEA,GACO,cADCG,EAEJ,OAAOH,EAAwB,UAE/Bh/C,QAAO,EAAO,4BAA8Bm/C,IAI5CD,4BAA8B,SAClCC,EACA/H,EACAgI,GAEKD,EAAGn6C,eAAe,cACrBhF,QAAO,EAAO,4BAA8B2F,KAAKmC,UAAUq3C,EAAI,KAAM,IAEvE,MAAM3sB,EAAQ2sB,EAAc,UACP,iBAAV3sB,GACTxyB,QAAO,EAAO,+BAAiCwyB,GAGjD,MAAM6sB,EAAejI,EAASnkB,OAO9B,GANAjzB,OACEq/C,MAAAA,EACA,+CAIGA,EAAa3nB,aAChB,OAAOlF,EAGT,MACMusB,EADOM,EACYpmB,WACzB,MAA2B,iBAAhB8lB,EACFvsB,EAIFusB,EAAcvsB,GAUV8sB,yBAA2B,SACtCt2B,EACAiK,EACA8mB,EACAiF,GAEA,OAAOO,qBACLtsB,EACA,IAAI0rB,sBAAsB5E,EAAU/wB,GACpCg2B,IASSQ,6BAA+B,SAC1CvsB,EACAmkB,EACA4H,GAEA,OAAOO,qBACLtsB,EACA,IAAIyrB,sBAAsBtH,GAC1B4H,IAIJ,SAASO,qBACPtsB,EACA8rB,EACAC,GAEA,MAAMS,EAASxsB,EAAK0E,cAAczoB,MAM5BqoB,EAAWunB,yBACfW,EACAV,EAAY3mB,kBAAkB,aAC9B4mB,GAEF,IAAIzrB,EAEJ,GAAIN,EAAKyE,aAAc,CACrB,MAAMgoB,EAAWzsB,EACX1uB,EAAQu6C,yBACZY,EAASzmB,WACT8lB,EACAC,GAEF,OACEz6C,IAAUm7C,EAASzmB,YACnB1B,IAAamoB,EAAS/nB,cAAczoB,MAE7B,IAAI4oB,SAASvzB,EAAOszB,aAAaN,IAEjCtE,EAEJ,CACL,MAAM0sB,EAAe1sB,EAerB,OAdAM,EAAUosB,EACNpoB,IAAaooB,EAAahoB,cAAczoB,QAC1CqkB,EAAUA,EAAQ2E,eAAe,IAAIJ,SAASP,KAEhDooB,EAAa5mB,aAAae,GAAgB,CAACzB,EAAWI,KACpD,MAAME,EAAe4mB,qBACnB9mB,EACAsmB,EAAY3mB,kBAAkBC,GAC9B2mB,GAEErmB,IAAiBF,IACnBlF,EAAUA,EAAQmF,qBAAqBL,EAAWM,OAG/CpF,GC5ME,MAAAqsB,KAMXh8C,YACWC,EAAe,GACfg8C,EAAyB,KAC3B5sB,EAAoB,CAAEqM,SAAU,GAAIwgB,WAAY,IAF9C1+C,KAAIyC,KAAJA,EACAzC,KAAMy+C,OAANA,EACFz+C,KAAI6xB,KAAJA,GAUK,SAAA8sB,YAAevY,EAAewY,GAE5C,IAAIh3B,EAAOg3B,aAAmBx3B,KAAOw3B,EAAU,IAAIx3B,KAAKw3B,GACpDziB,EAAQiK,EACV7K,EAAO5T,aAAaC,GACtB,KAAgB,OAAT2T,GAAe,CACpB,MAAMlE,EAAY7vB,QAAQ20B,EAAMtK,KAAKqM,SAAU3C,IAAS,CACtD2C,SAAU,GACVwgB,WAAY,GAEdviB,EAAQ,IAAIqiB,KAAQjjB,EAAMY,EAAO9E,GACjCzP,EAAOE,aAAaF,GACpB2T,EAAO5T,aAAaC,GAGtB,OAAOuU,EAQH,SAAU0iB,aAAgBzY,GAC9B,OAAOA,EAAKvU,KAAK1uB,MAQH,SAAA27C,aAAgB1Y,EAAejjC,GAC7CijC,EAAKvU,KAAK1uB,MAAQA,EAClB47C,kBAAkB3Y,GAMd,SAAU4Y,gBAAmB5Y,GACjC,OAAOA,EAAKvU,KAAK6sB,WAAa,EAehB,SAAAO,iBACd7Y,EACA/Z,GAEA5b,KAAK21B,EAAKvU,KAAKqM,UAAU,CAAC/B,EAAejC,KACvC7N,EAAO,IAAImyB,KAAQriB,EAAOiK,EAAMlM,OAa9B,SAAUglB,sBACd9Y,EACA/Z,EACA8yB,EACAC,GAEID,IAAgBC,GAClB/yB,EAAO+Z,GAGT6Y,iBAAiB7Y,GAAMjK,IACrB+iB,sBAAsB/iB,EAAO9P,GAAQ,EAAM+yB,MAGzCD,GAAeC,GACjB/yB,EAAO+Z,GAkDL,SAAUiZ,YAAejZ,GAC7B,OAAO,IAAIhf,KACO,OAAhBgf,EAAKqY,OACDrY,EAAK3jC,KACL48C,YAAYjZ,EAAKqY,QAAU,IAAMrY,EAAK3jC,MAO9C,SAASs8C,kBAAqB3Y,GACR,OAAhBA,EAAKqY,QAWX,SAASa,gBAAmBlZ,EAAenP,EAAmBkF,GAC5D,MAAMojB,EApHF,SAAUC,YAAepZ,GAC7B,YAA8B/iC,IAAvBw7C,aAAazY,KAAwB4Y,gBAAgB5Y,GAmHzCoZ,CAAYrjB,GACzBsjB,EAAct4C,SAASi/B,EAAKvU,KAAKqM,SAAUjH,GAC7CsoB,GAAcE,UACTrZ,EAAKvU,KAAKqM,SAASjH,GAC1BmP,EAAKvU,KAAK6sB,aACVK,kBAAkB3Y,IACRmZ,GAAeE,IACzBrZ,EAAKvU,KAAKqM,SAASjH,GAAakF,EAAMtK,KACtCuU,EAAKvU,KAAK6sB,aACVK,kBAAkB3Y,IApBlBkZ,CAAgBlZ,EAAKqY,OAAQrY,EAAK3jC,KAAM2jC,GCrKrC,MAAMsZ,EAAqB,iCAMrBC,EAAsB,+BAOtBC,WAAa,SAAUv4C,GAClC,MACiB,iBAARA,GAAmC,IAAfA,EAAI/H,SAAiBogD,EAAmBr5C,KAAKgB,IAI/Dw4C,kBAAoB,SAAUv6B,GACzC,MACwB,iBAAfA,GACe,IAAtBA,EAAWhmB,SACVqgD,EAAoBt5C,KAAKif,IAajBw6B,gBAAkB,SAAU3pB,GACvC,OACe,OAAbA,GACoB,iBAAbA,GACc,iBAAbA,IAA0B7mB,oBAAoB6mB,IACrDA,GACqB,iBAAbA,GAEPhvB,SAASgvB,EAAiB,QAOnB4pB,wBAA0B,SACrCt2C,EACAtG,EACAykB,EACA/U,GAEIA,QAAsBxP,IAAVF,GAIhB68C,qBAAqBC,YAAex2C,EAAQ,SAAUtG,EAAOykB,IAMlDo4B,qBAAuB,SAClCx2C,EACA7C,EACA82C,GAEA,MAAM71B,EACJ61B,aAAiBr2B,KAAO,IAAImC,eAAek0B,EAAOj0C,GAAei0C,EAEnE,QAAap6C,IAATsD,EACF,MAAM,IAAI3H,MACRwK,EAAc,sBAAwBsgB,4BAA4BlC,IAGtE,GAAoB,mBAATjhB,EACT,MAAM,IAAI3H,MACRwK,EACE,uBACAsgB,4BAA4BlC,GAC5B,oBACAjhB,EAAKqG,YAGX,GAAIsC,oBAAoB3I,GACtB,MAAM,IAAI3H,MACRwK,EACE,YACA7C,EAAKqG,WACL,IACA8c,4BAA4BlC,IAKlC,GACkB,iBAATjhB,GACPA,EAAKrH,OA3FqB,SA2FK,GAC/BqK,aAAahD,GA5Fa,SA8F1B,MAAM,IAAI3H,MACRwK,EAAAA,sDAIEsgB,4BAA4BlC,GAC5B,MACAjhB,EAAKhB,UAAU,EAAG,IAClB,SAMN,GAAIgB,GAAwB,iBAATA,EAAmB,CACpC,IAAIu5C,GAAc,EACdC,GAAiB,EAwBrB,GAvBA1vC,KAAK9J,GAAM,CAACU,EAAalE,KACvB,GAAY,WAARkE,EACF64C,GAAc,OACT,GAAY,cAAR74C,GAA+B,QAARA,IAChC84C,GAAiB,GACZP,WAAWv4C,IACd,MAAM,IAAIrI,MACRwK,EACE,6BACAnC,EACA,KACAyiB,4BAA4BlC,GAJ9Bpe,yF/C4GI,SAAA42C,mBACdv2B,EACAsS,GAGItS,EAAeJ,OAAOnqB,OAAS,IACjCuqB,EAAeH,aAAe,GAEhCG,EAAeJ,OAAOpoB,KAAK86B,GAC3BtS,EAAeH,aAAe/f,aAAawyB,GAC3CvS,yBAAyBC,G+C3GrBu2B,CAAmBx4B,EAAMvgB,GACzB24C,qBAAqBx2C,EAAarG,EAAOykB,G/C6GzC,SAAUy4B,kBAAkBx2B,GAChC,MAAMy2B,EAAOz2B,EAAeJ,OAAO6J,MACnCzJ,EAAeH,aAAe/f,aAAa22C,GAEvCz2B,EAAeJ,OAAOnqB,OAAS,IACjCuqB,EAAeH,aAAe,G+CjH5B22B,CAAkBz4B,MAGhBs4B,GAAeC,EACjB,MAAM,IAAInhD,MACRwK,EACE,4BACAsgB,4BAA4BlC,GAC5B,sCA0DG24B,6BAA+B,SAC1C92C,EACA9C,EACAihB,EACA/U,GAEA,GAAIA,QAAqBxP,IAATsD,EACd,OAGF,MAAM6C,EAAcy2C,YAAex2C,EAAQ,UAE3C,IAAM9C,GAAwB,iBAATA,GAAsBpG,MAAMC,QAAQmG,GACvD,MAAM,IAAI3H,MACRwK,EAAc,0DAIlB,MAAMg3C,EAAqB,GAC3B/vC,KAAK9J,GAAM,CAACU,EAAalE,KACvB,MAAMs9C,EAAU,IAAIr5B,KAAK/f,GAEzB,GADA24C,qBAAqBx2C,EAAarG,EAAOklB,UAAUT,EAAM64B,IAC5B,cAAzB14B,YAAY04B,KACTX,gBAAgB38C,GACnB,MAAM,IAAInE,MACRwK,EACE,kCACAi3C,EAAQzzC,WAFVxD,gGAQNg3C,EAAWn/C,KAAKo/C,MAlFsB,SACxCj3C,EACAg3C,GAEA,IAAInhD,EAAGohD,EACP,IAAKphD,EAAI,EAAGA,EAAImhD,EAAWlhD,OAAQD,IAAK,CACtCohD,EAAUD,EAAWnhD,GACrB,MAAM8Q,EAAO6X,UAAUy4B,GACvB,IAAK,IAAIl3C,EAAI,EAAGA,EAAI4G,EAAK7Q,OAAQiK,IAC/B,GAAgB,cAAZ4G,EAAK5G,IAAsBA,IAAM4G,EAAK7Q,OAAS,QAE5C,IAAKsgD,WAAWzvC,EAAK5G,IAC1B,MAAM,IAAIvK,MACRwK,EACE,4BACA2G,EAAK5G,GACL,aACAk3C,EAAQzzC,WAJVxD,uFAeRg3C,EAAWpwC,KAAK0Y,aAChB,IAAI43B,EAAwB,KAC5B,IAAKrhD,EAAI,EAAGA,EAAImhD,EAAWlhD,OAAQD,IAAK,CAEtC,GADAohD,EAAUD,EAAWnhD,GACJ,OAAbqhD,GAAqBp3B,aAAao3B,EAAUD,GAC9C,MAAM,IAAIzhD,MACRwK,EACE,mBACAk3C,EAAS1zC,WACT,qCACAyzC,EAAQzzC,YAGd0zC,EAAWD,GA2CbE,CAA2Bn3C,EAAag3C,IAG7BI,iBAAmB,SAC9Bn3C,EACA0sB,EACAtjB,GAEA,IAAIA,QAAyBxP,IAAb8yB,EAAhB,CAGA,GAAI7mB,oBAAoB6mB,GACtB,MAAM,IAAIn3B,MACRihD,YAAex2C,EAAQ,YACrB,MACA0sB,EAASnpB,WAFXizC,6FAQJ,IAAKH,gBAAgB3pB,GACnB,MAAM,IAAIn3B,MACRihD,YAAex2C,EAAQ,YAAvBw2C,yFAOOY,YAAc,SACzBp3C,EACAq3C,EACAz5C,EACAwL,GAEA,KAAIA,QAAoBxP,IAARgE,GAGXu4C,WAAWv4C,IACd,MAAM,IAAIrI,MACRihD,YAAex2C,EAAQq3C,GACrB,yBACAz5C,EAFF44C,qGAYOc,mBAAqB,SAChCt3C,EACAq3C,EACAx7B,EACAzS,GAEA,KAAIA,QAA2BxP,IAAfiiB,GAIXu6B,kBAAkBv6B,IACrB,MAAM,IAAItmB,MACRihD,YAAex2C,EAAQq3C,GACrB,0BACAx7B,EAFF26B,qFA0BOe,qBAAuB,SAAUv3C,EAAgBme,GAC5D,GAA2B,UAAvBD,aAAaC,GACf,MAAM,IAAI5oB,MAAMyK,EAAS,8CAIhBw3C,YAAc,SACzBx3C,EACAy3C,GAGA,MAAM57B,EAAa47B,EAAUt5B,KAAK5a,WAClC,GACuC,iBAA5Bk0C,EAAU3rC,SAASrQ,MACO,IAAnCg8C,EAAU3rC,SAASrQ,KAAK5F,SACtBsgD,WAAWsB,EAAU3rC,SAASjB,YACY,cAA1C4sC,EAAU3rC,SAASrQ,KAAKgC,MAAM,KAAK,IACd,IAAtBoe,EAAWhmB,SApUqB,SAAUgmB,GAM7C,OALIA,IAEFA,EAAaA,EAAWziB,QAAQ,mBAAoB,MAG/Cg9C,kBAAkBv6B,GA8TM67B,CAAsB77B,GAEnD,MAAM,IAAItmB,MACRihD,YAAex2C,EAAQ,OAAvBw2C,yFC3WO,MAAAmB,WAAb5+C,cACExC,KAAWqhD,YAAgB,GAK3BrhD,KAAeshD,gBAAG,GAMJ,SAAAC,sBACdC,EACAC,GAGA,IAAIC,EAA6B,KACjC,IAAK,IAAIriD,EAAI,EAAGA,EAAIoiD,EAAcniD,OAAQD,IAAK,CAC7C,MAAMsH,EAAO86C,EAAcpiD,GACrBuoB,EAAOjhB,EAAKg7C,UACD,OAAbD,GAAsBt4B,WAAWxB,EAAM85B,EAAS95B,QAClD45B,EAAWH,YAAYhgD,KAAKqgD,GAC5BA,EAAW,MAGI,OAAbA,IACFA,EAAW,CAAEvY,OAAQ,GAAIvhB,KAAAA,IAG3B85B,EAASvY,OAAO9nC,KAAKsF,GAEnB+6C,GACFF,EAAWH,YAAYhgD,KAAKqgD,GAahB,SAAAE,4BACdJ,EACA55B,EACA65B,GAEAF,sBAAsBC,EAAYC,GAClCI,6CAA6CL,GAAYM,GACvD14B,WAAW04B,EAAWl6B,KAaV,SAAAm6B,oCACdP,EACAQ,EACAP,GAEAF,sBAAsBC,EAAYC,GAClCI,6CACEL,GACAM,GACEx4B,aAAaw4B,EAAWE,IACxB14B,aAAa04B,EAAaF,KAIhC,SAASD,6CACPL,EACArW,GAEAqW,EAAWF,kBAEX,IAAIW,GAAU,EACd,IAAK,IAAI5iD,EAAI,EAAGA,EAAImiD,EAAWH,YAAY/hD,OAAQD,IAAK,CACtD,MAAM6iD,EAAYV,EAAWH,YAAYhiD,GACzC,GAAI6iD,EAAW,CAET/W,EADc+W,EAAUt6B,OAE1Bu6B,eAAeX,EAAWH,YAAYhiD,IACtCmiD,EAAWH,YAAYhiD,GAAK,MAE5B4iD,GAAU,GAKZA,IACFT,EAAWH,YAAc,IAG3BG,EAAWF,kBAWb,SAASa,eAAeD,GACtB,IAAK,IAAI7iD,EAAI,EAAGA,EAAI6iD,EAAU/Y,OAAO7pC,OAAQD,IAAK,CAChD,MAAMqnB,EAAYw7B,EAAU/Y,OAAO9pC,GACnC,GAAkB,OAAdqnB,EAAoB,CACtBw7B,EAAU/Y,OAAO9pC,GAAK,KACtB,MAAM+iD,EAAU17B,EAAU27B,iBACtBxzC,GACFV,IAAI,UAAYuY,EAAU1Z,YAE5BgF,eAAeowC,KCKR,MAAAE,KA0BX9/C,YACS8e,EACAihC,EACA/3B,EACAg4B,GAHAxiD,KAASshB,UAATA,EACAthB,KAAgBuiD,iBAAhBA,EACAviD,KAAkBwqB,mBAAlBA,EACAxqB,KAAiBwiD,kBAAjBA,EA1BTxiD,KAAeyiD,gBAAG,EAKlBziD,KAAcknC,eAAyB,KACvClnC,KAAA0iD,YAAc,IAAItB,WAClBphD,KAAY2iD,aAAG,EAIf3iD,KAA4B4iD,6BAA6C,KAGzE5iD,KAAagY,cAAuB+tB,wBAGpC/lC,KAAA6iD,sBAAwB,IAAIrE,KAG5Bx+C,KAAqB8iD,sBAAgC,KASnD9iD,KAAKqH,IAAMrH,KAAKshB,UAAUnM,cAM5BnI,WACE,OACGhN,KAAKshB,UAAUjN,OAAS,WAAa,WAAarU,KAAKshB,UAAUpc,MAKxD,SAAA69C,UACdC,EACAC,EACAC,GAIA,GAFAF,EAAKtrC,OAASxB,0BAA0B8sC,EAAK1hC,WAEzC0hC,EAAKT,mBhE0WY,iBAAXv+C,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOUm/C,OACR,6FACG,EgErXLH,EAAKhc,QAAU,IAAItC,mBACjBse,EAAK1hC,WACL,CACEgE,EACA3e,EACAy8C,EACAh2B,KAEAi2B,iBAAiBL,EAAM19B,EAAY3e,EAAMy8C,EAASh2B,KAEpD41B,EAAKx4B,mBACLw4B,EAAKR,mBAIPvwC,YAAW,IAAMqxC,oBAAoBN,GAA2B,IAAO,OAClE,CAEL,GAAI,MAAOE,EAAuD,CAChE,GAA4B,iBAAjBA,EACT,MAAM,IAAIlkD,MACR,sEAGJ,IACE0H,UAAUw8C,GACV,MAAOngD,GACP,MAAM,IAAI/D,MAAM,kCAAoC+D,IAIxDigD,EAAKF,sBAAwB,IAAI14B,qBAC/B44B,EAAK1hC,UACL2hC,GACA,CACE39B,EACA3e,EACAy8C,EACAh2B,KAEAi2B,iBAAiBL,EAAM19B,EAAY3e,EAAMy8C,EAASh2B,MAEnDm2B,IACCD,oBAAoBN,EAAMO,MAE3BzW,KAmKP,SAAS0W,uBAAuBR,EAAYlW,GAC1Cr8B,KAAKq8B,GAAS,CAACzlC,EAAalE,KAC1BsgD,eAAeT,EAAM37C,EAAKlE,MApKtBqgD,CAAuBR,EAAMlW,KAE/BkW,EAAKx4B,mBACLw4B,EAAKR,kBACLU,GAGFF,EAAKhc,QAAUgc,EAAKF,sBAGtBE,EAAKx4B,mBAAmBvX,wBAAuBpM,IAC7Cm8C,EAAKhc,QAAQthB,iBAAiB7e,MAGhCm8C,EAAKR,kBAAkBvvC,wBAAuBwc,IAC5CuzB,EAAKhc,QAAQrhB,qBAAqB8J,EAAO5oB,UAK3Cm8C,EAAKU,e1D1PS,SAAAC,gCACdpuC,EACAquC,GAEA,MAAMztC,EAAaZ,EAASvI,WAM5B,OAJKiJ,EAAUE,KACbF,EAAUE,GAAcytC,KAGnB3tC,EAAUE,G0DgPKwtC,CACpBX,EAAK1hC,WACL,IAAM,IAAIwlB,cAAckc,EAAKtrC,OAAQsrC,EAAKhc,WAI5Cgc,EAAKa,UAAY,IAAIne,eACrBsd,EAAKc,cAAgB,IAAI1L,SAAS,CAChCmC,eAAgB,CAACllC,EAAO+X,EAAKD,EAAe5H,KAC1C,IAAIw+B,EAAsB,GAC1B,MAAMlyB,EAAOmxB,EAAKa,UAAUje,QAAQvwB,EAAMwX,OAa1C,OAVKgF,EAAKpqB,YACRs8C,EAAazK,6BACX0J,EAAKc,cACLzuC,EAAMwX,MACNgF,GAEF5f,YAAW,KACTsT,EAAW,QACV,IAEEw+B,GAETpJ,cAAe,SAEjB8I,eAAeT,EAAM,aAAa,GAElCA,EAAKgB,gBAAkB,IAAI5L,SAAS,CAClCmC,eAAgB,CAACllC,EAAO+X,EAAKD,EAAe5H,KAC1Cy9B,EAAKhc,QAAQ9Z,OAAO7X,EAAO8X,EAAeC,GAAK,CAACW,EAAQpnB,KACtD,MAAMwiC,EAAS5jB,EAAWwI,EAAQpnB,GAClCo7C,oCACEiB,EAAKN,YACLrtC,EAAMwX,MACNsc,MAIG,IAETwR,cAAe,CAACtlC,EAAO+X,KACrB41B,EAAKhc,QAAQ/X,SAAS5Z,EAAO+X,MAQ7B,SAAU62B,eAAejB,GAC7B,MACMv6C,EADau6C,EAAKa,UAAUje,QAAQ,IAAIxe,KAAK,2BACxBtZ,OAAoB,EAC/C,OAAO,IAAIrK,MAAOC,UAAY+E,EAM1B,SAAUy7C,yBAAyBlB,GACvC,OJxQAtxB,GAJAA,EI4Q0B,CACxB7M,UAAWo/B,eAAejB,MJzQT,IACD,UAAItxB,EAAkB,YAAK,IAAIjuB,MAAOC,UACjDguB,EAPyB,IAChCA,EIoRF,SAAS2xB,iBACPL,EACA19B,EACA3e,EACAy8C,EACAh2B,GAGA41B,EAAKP,kBACL,MAAM76B,EAAO,IAAIR,KAAK9B,GACtB3e,EAAOq8C,EAAKJ,6BACRI,EAAKJ,6BAA6Bt9B,EAAY3e,GAC9CA,EACJ,IAAIwiC,EAAS,GACb,GAAI/b,EACF,GAAIg2B,EAAS,CACX,MAAMe,EAAiBz8C,IACrBf,GACCy9C,GAAiB3tB,aAAa2tB,KAEjCjb,ELkGA,SAAUkb,8BACd1L,EACA/wB,EACA4qB,EACAplB,GAEA,MAAMguB,EAAWC,wBAAwB1C,EAAUvrB,GACnD,GAAIguB,EAAU,CACZ,MAAM5uB,EAAI8uB,uBAAuBF,GAC3BG,EAAY/uB,EAAE5E,KAClByF,EAAUb,EAAEa,QACR6d,EAAeziB,gBAAgB8yB,EAAW3zB,GAC1CqxB,EAAanO,cAAcoO,WAAW1G,GAM5C,OAAOgJ,8BAA8B7C,EAAU4C,EALpC,IAAIlT,MACbd,oCAAoCla,GACpC6d,EACA+N,IAKF,MAAO,GKvHIoL,CACPrB,EAAKgB,gBACLp8B,EACAu8B,EACA/2B,OAEG,CACL,MAAMk3B,EAAa7tB,aAAa9vB,GAChCwiC,EAASgS,kCACP6H,EAAKgB,gBACLp8B,EACA08B,EACAl3B,QAGC,GAAIg2B,EAAS,CAClB,MAAM5Q,EAAkB9qC,IACtBf,GACCy9C,GAAiB3tB,aAAa2tB,KAEjCjb,ELpIY,SAAAob,yBACd5L,EACA/wB,EACA4qB,GAEA,MAAMyG,EAAanO,cAAcoO,WAAW1G,GAE5C,OAAOsG,oCACLH,EACA,IAAItQ,MhBlNC,CACLb,UAAU,EACVC,YAAY,EACZpa,QAAS,KACTqa,QAAQ,GgB8M8B9f,EAAMqxB,IK2HnCsL,CACPvB,EAAKgB,gBACLp8B,EACA4qB,OAEG,CACL,MAAM9T,EAAOjI,aAAa9vB,GAC1BwiC,EAASmQ,6BAA6B0J,EAAKgB,gBAAiBp8B,EAAM8W,GAEpE,IAAIe,EAAe7X,EACfuhB,EAAO7pC,OAAS,IAGlBmgC,EAAe+kB,sBAAsBxB,EAAMp7B,IAE7Cm6B,oCAAoCiB,EAAKN,YAAajjB,EAAc0J,GAWtE,SAASma,oBAAoBN,EAAYO,GACvCE,eAAeT,EAAM,YAAaO,IACZ,IAAlBA,GAyPN,SAASkB,0BAA0BzB,GACjC0B,QAAQ1B,EAAM,sBAEd,MAAMpF,EAAesG,yBAAyBlB,GACxC2B,EAA2B5e,wBACjCM,8BACE2c,EAAKhrC,cACL0P,gBACA,CAACE,EAAMiK,KACL,MAAM+yB,EAAW1G,yBACft2B,EACAiK,EACAmxB,EAAKgB,gBACLpG,GAEF5X,2BAA2B2e,EAA0B/8B,EAAMg9B,MAG/D,IAAIzb,EAAkB,GAEtB9C,8BACEse,EACAj9B,gBACA,CAACE,EAAM8W,KACLyK,EAASA,EAAO+M,OACdoD,6BAA6B0J,EAAKgB,gBAAiBp8B,EAAM8W,IAE3D,MAAMe,EAAeolB,sBAAsB7B,EAAMp7B,GACjD48B,sBAAsBxB,EAAMvjB,MAIhCujB,EAAKhrC,cAAgB+tB,wBACrBgc,oCAAoCiB,EAAKN,YAAah7B,eAAgByhB,GAzRpEsb,CAA0BzB,GAU9B,SAASS,eAAeT,EAAY19B,EAAoBniB,GACtD,MAAMykB,EAAO,IAAIR,KAAK,UAAY9B,GAC5B6M,EAAUsE,aAAatzB,GAC7B6/C,EAAKa,UAAUhe,eAAeje,EAAMuK,GACpC,MAAMgX,EAASmQ,6BACb0J,EAAKc,cACLl8B,EACAuK,GAEF4vB,oCAAoCiB,EAAKN,YAAa96B,EAAMuhB,GAG9D,SAAS2b,mBAAmB9B,GAC1B,OAAOA,EAAKL,eA6FR,SAAUoC,oBACd/B,EACAp7B,EACAo9B,EACA3oB,EACA9W,GAEAm/B,QAAQ1B,EAAM,MAAO,CACnBp7B,KAAMA,EAAK5a,WACX7J,MAAO6hD,EACP7uB,SAAUkG,IAKZ,MAAMuhB,EAAesG,yBAAyBlB,GACxCiC,EAAoBxuB,aAAauuB,EAAQ3oB,GACzC2Z,EAAWqG,+BAA+B2G,EAAKgB,gBAAiBp8B,GAChEuK,EAAUisB,6BACd6G,EACAjP,EACA4H,GAGI7P,EAAU+W,mBAAmB9B,GAC7B7Z,EAASuP,2BACbsK,EAAKgB,gBACLp8B,EACAuK,EACA4b,GACA,GAEFwT,sBAAsByB,EAAKN,YAAavZ,GACxC6Z,EAAKhc,QAAQ3hB,IACXuC,EAAK5a,WACLi4C,EAAkBn3C,KAAgB,IAClC,CAACigB,EAAQ2B,KACP,MAAMw1B,EAAqB,OAAXn3B,EACXm3B,GACH/5C,KAAK,UAAYyc,EAAO,YAAcmG,GAGxC,MAAMo3B,EAAchM,qBAClB6J,EAAKgB,gBACLjW,GACCmX,GAEHnD,oCAAoCiB,EAAKN,YAAa96B,EAAMu9B,GAC5DC,2BAA2BpC,EAAMz9B,EAAYwI,EAAQ2B,MAGzD,MAAM+P,EAAeolB,sBAAsB7B,EAAMp7B,GACjD48B,sBAAsBxB,EAAMvjB,GAE5BsiB,oCAAoCiB,EAAKN,YAAajjB,EAAc,IAkHtD,SAAA4lB,uBACdrC,EACAp7B,EACArC,GAEAy9B,EAAKhc,QAAQlhB,mBAAmB8B,EAAK5a,YAAY,CAAC+gB,EAAQ2B,KACzC,OAAX3B,GACFoY,yBAAyB6c,EAAKhrC,cAAe4P,GAE/Cw9B,2BAA2BpC,EAAMz9B,EAAYwI,EAAQ2B,MAInD,SAAU41B,oBACdtC,EACAp7B,EACAzkB,EACAoiB,GAEA,MAAM4M,EAAUsE,aAAatzB,GAC7B6/C,EAAKhc,QAAQphB,gBACXgC,EAAK5a,WACLmlB,EAAQrkB,KAAgB,IACxB,CAACigB,EAAQ2B,KACQ,OAAX3B,GACFiY,2BAA2Bgd,EAAKhrC,cAAe4P,EAAMuK,GAEvDizB,2BAA2BpC,EAAMz9B,EAAYwI,EAAQ2B,MA8E3C,SAAA61B,gCACdvC,EACA3tC,EACAqgC,GAIA,IAAIvM,EAEFA,EADgC,UAA9BxhB,aAAatS,EAAMwX,OACZ0sB,gCACPyJ,EAAKc,cACLzuC,EACAqgC,GAGO6D,gCACPyJ,EAAKgB,gBACL3uC,EACAqgC,GAGJkM,4BAA4BoB,EAAKN,YAAartC,EAAMwX,MAAOsc,GAGvD,SAAUqc,cAAcxC,GACxBA,EAAKF,uBACPE,EAAKF,sBAAsB5xB,UAvtBN,kBAqwBzB,SAASwzB,QAAQ1B,KAAet0C,GAC9B,IAAIU,EAAS,GACT4zC,EAAKF,wBACP1zC,EAAS4zC,EAAKF,sBAAsBz0C,GAAK,KAE3CF,IAAIiB,KAAWV,GAGX,SAAU02C,2BACdpC,EACA98C,EACA6nB,EACA2B,GAEIxpB,GACF8L,gBAAe,KACb,GAAe,OAAX+b,EACF7nB,EAAS,UACJ,CACL,MAAMyN,GAAQoa,GAAU,SAASovB,cACjC,IAAIr+C,EAAU6U,EACV+b,IACF5wB,GAAW,KAAO4wB,GAGpB,MAAMzsB,EAAQ,IAAIjE,MAAMF,GAGvBmE,EAAc0Q,KAAOA,EACtBzN,EAASjD,OAiIjB,SAASwiD,mBACPzC,EACAp7B,EACA89B,GAEA,OACErJ,+BAA+B2G,EAAKgB,gBAAiBp8B,EAAM89B,IAC3D1pB,aAAanI,WAajB,SAAS8xB,0BACP3C,EACAnxB,EAA4BmxB,EAAKH,uBAOjC,GAJKhxB,GACH+zB,wCAAwC5C,EAAMnxB,GAG5CgtB,aAAahtB,GAAO,CACtB,MAAMg0B,EAAQC,0BAA0B9C,EAAMnxB,GAC9CjzB,OAAOinD,EAAMvmD,OAAS,EAAG,yCAEVumD,EAAME,OAClBC,GAA+C,IAAlBA,EAAYj4B,UAqBhD,SAASk4B,yBACPjD,EACAp7B,EACAi+B,GAGA,MAAMK,EAAeL,EAAMn+C,KAAIy+C,GACtBA,EAAIC,iBAEPC,EAAcZ,mBAAmBzC,EAAMp7B,EAAMs+B,GACnD,IAAII,EAAaD,EACjB,MAAME,EAAaF,EAAY7gC,OAC/B,IAAK,IAAInmB,EAAI,EAAGA,EAAIwmD,EAAMvmD,OAAQD,IAAK,CACrC,MAAM8mD,EAAMN,EAAMxmD,GAClBT,OAEE,IADAunD,EAAIp4B,OACJ,iEAEFo4B,EAAIp4B,OAAM,EACVo4B,EAAIK,aACJ,MAAMtb,EAAeziB,gBAAgBb,EAAMu+B,EAAIv+B,MAE/C0+B,EAAaA,EAAW9uB,YACtB0T,EACAib,EAAIM,0BAIR,MAAMC,EAAaJ,EAAWx4C,KAAI,GAC5B64C,EAAa/+B,EAGnBo7B,EAAKhc,QAAQ3hB,IACXshC,EAAW35C,WACX05C,GACC34B,IACC22B,QAAQ1B,EAAM,2BAA4B,CACxCp7B,KAAM++B,EAAW35C,WACjB+gB,OAAAA,IAGF,IAAIob,EAAkB,GACtB,GAAe,OAAXpb,EAAiB,CAInB,MAAM64B,EAAY,GAClB,IAAK,IAAIvnD,EAAI,EAAGA,EAAIwmD,EAAMvmD,OAAQD,IAChCwmD,EAAMxmD,GAAG0uB,OAAqC,EAC9Cob,EAASA,EAAO+M,OACdiD,qBAAqB6J,EAAKgB,gBAAiB6B,EAAMxmD,GAAG+mD,iBAElDP,EAAMxmD,GAAGkmB,YAGXqhC,EAAUvlD,MAAK,IACbwkD,EAAMxmD,GAAGkmB,WACP,MACA,EACAsgC,EAAMxmD,GAAGwnD,iCAIfhB,EAAMxmD,GAAGynD,YAIXlB,wCACE5C,EACArE,YAAYqE,EAAKH,sBAAuBj7B,IAG1C+9B,0BAA0B3C,EAAMA,EAAKH,uBAErCd,oCAAoCiB,EAAKN,YAAa96B,EAAMuhB,GAG5D,IAAK,IAAI9pC,EAAI,EAAGA,EAAIunD,EAAUtnD,OAAQD,IACpC2S,eAAe40C,EAAUvnD,QAEtB,CAEL,GAAe,cAAX0uB,EACF,IAAK,IAAI1uB,EAAI,EAAGA,EAAIwmD,EAAMvmD,OAAQD,IAC4B,IAAxDwmD,EAAMxmD,GAAG0uB,OACX83B,EAAMxmD,GAAG0uB,OAAuC,EAEhD83B,EAAMxmD,GAAG0uB,OAA+B,MAGvC,CACL5iB,KACE,kBAAoBw7C,EAAW35C,WAAa,YAAc+gB,GAE5D,IAAK,IAAI1uB,EAAI,EAAGA,EAAIwmD,EAAMvmD,OAAQD,IAChCwmD,EAAMxmD,GAAG0uB,OAAuC,EAChD83B,EAAMxmD,GAAG0nD,YAAch5B,EAI3By2B,sBAAsBxB,EAAMp7B,MAGhC2+B,GAvHEN,CAAyBjD,EAAM3D,YAAYxtB,GAAOg0B,QAE3C7G,gBAAgBntB,IACzBotB,iBAAiBptB,GAAMwF,IACrBsuB,0BAA0B3C,EAAM3rB,MAkItC,SAASmtB,sBAAsBxB,EAAYhB,GACzC,MAAMgF,EAA0BC,+BAC9BjE,EACAhB,GAEIp6B,EAAOy3B,YAAY2H,GAKzB,OAUF,SAASE,0BACPlE,EACA6C,EACAj+B,GAEA,GAAqB,IAAjBi+B,EAAMvmD,OACR,OAMF,MAAMsnD,EAAY,GAClB,IAAIzd,EAAkB,GAEtB,MAGM+c,EAHcL,EAAMrc,QAAO1c,GAChB,IAARA,EAAEiB,SAEsBrmB,KAAIolB,GAC5BA,EAAEs5B,iBAEX,IAAK,IAAI/mD,EAAI,EAAGA,EAAIwmD,EAAMvmD,OAAQD,IAAK,CACrC,MAAM2mD,EAAcH,EAAMxmD,GACpB6rC,EAAeziB,gBAAgBb,EAAMo+B,EAAYp+B,MACvD,IACEm/B,EADEI,GAAmB,EAOvB,GALAvoD,OACmB,OAAjBssC,EACA,iEAGoB,IAAlB8a,EAAYj4B,OACdo5B,GAAmB,EACnBJ,EAAcf,EAAYe,YAC1B5d,EAASA,EAAO+M,OACdiD,qBACE6J,EAAKgB,gBACLgC,EAAYI,gBACZ,SAGC,GAAsB,IAAlBJ,EAAYj4B,OACrB,GAAIi4B,EAAYQ,YAvoCU,GAwoCxBW,GAAmB,EACnBJ,EAAc,WACd5d,EAASA,EAAO+M,OACdiD,qBACE6J,EAAKgB,gBACLgC,EAAYI,gBACZ,QAGC,CAEL,MAAMgB,EAAc3B,mBAClBzC,EACAgD,EAAYp+B,KACZs+B,GAEFF,EAAYqB,qBAAuBD,EACnC,MAAMxO,EAAUiN,EAAMxmD,GAAG4J,OAAOm+C,EAAYt5C,OAC5C,QAAgBzK,IAAZu1C,EAAuB,CACzBoH,qBACE,qCACApH,EACAoN,EAAYp+B,MAEd,IAAI0/B,EAAc7wB,aAAamiB,GAEV,iBAAZA,GACI,MAAXA,GACAzxC,SAASyxC,EAAS,eAGlB0O,EAAcA,EAAYxwB,eAAeswB,EAAY7wB,gBAGvD,MAAMgxB,EAAavB,EAAYI,eACzBxI,EAAesG,yBAAyBlB,GACxCwE,EAAkBpJ,6BACtBkJ,EACAF,EACAxJ,GAGFoI,EAAYS,yBAA2Ba,EACvCtB,EAAYa,8BAAgCW,EAC5CxB,EAAYI,eAAiBtB,mBAAmB9B,GAEhDkD,EAAar/B,OAAOq/B,EAAapxC,QAAQyyC,GAAa,GACtDpe,EAASA,EAAO+M,OACdwC,2BACEsK,EAAKgB,gBACLgC,EAAYp+B,KACZ4/B,EACAxB,EAAYI,eACZJ,EAAYyB,eAGhBte,EAASA,EAAO+M,OACdiD,qBAAqB6J,EAAKgB,gBAAiBuD,GAAY,SAGzDJ,GAAmB,EACnBJ,EAAc,SACd5d,EAASA,EAAO+M,OACdiD,qBACE6J,EAAKgB,gBACLgC,EAAYI,gBACZ,IAMVrE,oCAAoCiB,EAAKN,YAAa96B,EAAMuhB,GAC5DA,EAAS,GACLge,IAEFtB,EAAMxmD,GAAG0uB,OAAqC,EAKnC+4B,EAERjB,EAAMxmD,GAAGynD,UADV70C,WAAW60C,EAAW91C,KAAKI,MAAM,IAG/By0C,EAAMxmD,GAAGkmB,aACS,WAAhBwhC,EACFH,EAAUvlD,MAAK,IACbwkD,EAAMxmD,GAAGkmB,WAAW,MAAM,EAAOsgC,EAAMxmD,GAAGgoD,wBAG5CT,EAAUvlD,MAAK,IACbwkD,EAAMxmD,GAAGkmB,WAAW,IAAIvmB,MAAM+nD,IAAc,EAAO,UAXzD,IAAWD,EAmBflB,wCAAwC5C,EAAMA,EAAKH,uBAGnD,IAAK,IAAIxjD,EAAI,EAAGA,EAAIunD,EAAUtnD,OAAQD,IACpC2S,eAAe40C,EAAUvnD,IAI3BsmD,0BAA0B3C,EAAMA,EAAKH,uBAnKrCqE,CAA0BlE,EADZ8C,0BAA0B9C,EAAMgE,GACPp/B,GAEhCA,EA4KT,SAASq/B,+BACPjE,EACAp7B,GAEA,IAAI6P,EAIAiwB,EAAkB1E,EAAKH,sBAE3B,IADAprB,EAAQ9P,aAAaC,GACJ,OAAV6P,QAAoDp0B,IAAlCw7C,aAAa6I,IACpCA,EAAkB/I,YAAY+I,EAAiBjwB,GAE/CA,EAAQ9P,aADRC,EAAOE,aAAaF,IAItB,OAAO8/B,EAUT,SAAS5B,0BACP9C,EACA0E,GAGA,MAAMC,EAAkC,GAUxC,OATAC,sCACE5E,EACA0E,EACAC,GAIFA,EAAiBv3C,MAAK,CAACtH,EAAGC,IAAMD,EAAE++C,MAAQ9+C,EAAE8+C,QAErCF,EAGT,SAASC,sCACP5E,EACAnxB,EACAg0B,GAEA,MAAMiC,EAAYjJ,aAAahtB,GAC/B,GAAIi2B,EACF,IAAK,IAAIzoD,EAAI,EAAGA,EAAIyoD,EAAUxoD,OAAQD,IACpCwmD,EAAMxkD,KAAKymD,EAAUzoD,IAIzB4/C,iBAAiBptB,GAAMsK,IACrByrB,sCAAsC5E,EAAM7mB,EAAO0pB,MAOvD,SAASD,wCACP5C,EACAnxB,GAEA,MAAMg0B,EAAQhH,aAAahtB,GAC3B,GAAIg0B,EAAO,CACT,IAAIkC,EAAK,EACT,IAAK,IAAI5W,EAAO,EAAGA,EAAO0U,EAAMvmD,OAAQ6xC,IACkB,IAApD0U,EAAM1U,GAAMpjB,SACd83B,EAAMkC,GAAMlC,EAAM1U,GAClB4W,KAGJlC,EAAMvmD,OAASyoD,EACfjJ,aAAajtB,EAAMg0B,EAAMvmD,OAAS,EAAIumD,OAAQxiD,GAGhD47C,iBAAiBptB,GAAMwF,IACrBuuB,wCAAwC5C,EAAM3rB,MAWlD,SAASwtB,sBAAsB7B,EAAYp7B,GACzC,MAAM6X,EAAe4f,YAAY4H,+BAA+BjE,EAAMp7B,IAEhE8/B,EAAkB/I,YAAYqE,EAAKH,sBAAuBj7B,GAYhE,OHl0Cc,SAAAogC,oBACd5hB,EACA/Z,EACA8yB,GAEA,IAAIttB,EAAOstB,EAAc/Y,EAAOA,EAAKqY,OACrC,KAAgB,OAAT5sB,GAAe,CACpB,GAAIxF,EAAOwF,GACT,OAAO,EAETA,EAAOA,EAAK4sB,OAEd,OAAO,EG4yCPuJ,CAAoBN,GAAkB71B,IACpCo2B,4BAA4BjF,EAAMnxB,MAGpCo2B,4BAA4BjF,EAAM0E,GAElCxI,sBAAsBwI,GAAkB71B,IACtCo2B,4BAA4BjF,EAAMnxB,MAG7B4N,EAQT,SAASwoB,4BACPjF,EACAnxB,GAEA,MAAMg0B,EAAQhH,aAAahtB,GAC3B,GAAIg0B,EAAO,CAIT,MAAMe,EAAY,GAIlB,IAAIzd,EAAkB,GAClB+e,GAAY,EAChB,IAAK,IAAI7oD,EAAI,EAAGA,EAAIwmD,EAAMvmD,OAAQD,QAC5BwmD,EAAMxmD,GAAG0uB,SAE0C,IAA5C83B,EAAMxmD,GAAG0uB,QAClBnvB,OACEspD,IAAa7oD,EAAI,EACjB,mDAEF6oD,EAAW7oD,EAEXwmD,EAAMxmD,GAAG0uB,OAA4C,EACrD83B,EAAMxmD,GAAG0nD,YAAc,QAEvBnoD,OAC2C,IAAzCinD,EAAMxmD,GAAG0uB,OACT,0CAGF83B,EAAMxmD,GAAGynD,YACT3d,EAASA,EAAO+M,OACdiD,qBACE6J,EAAKgB,gBACL6B,EAAMxmD,GAAG+mD,gBACT,IAGAP,EAAMxmD,GAAGkmB,YACXqhC,EAAUvlD,KACRwkD,EAAMxmD,GAAGkmB,WAAWrW,KAAK,KAAM,IAAIlQ,MAAM,QAAQ,EAAO,UAK9C,IAAdkpD,EAEFpJ,aAAajtB,OAAMxuB,GAGnBwiD,EAAMvmD,OAAS4oD,EAAW,EAI5BnG,oCACEiB,EAAKN,YACLrD,YAAYxtB,GACZsX,GAEF,IAAK,IAAI9pC,EAAI,EAAGA,EAAIunD,EAAUtnD,OAAQD,IACpC2S,eAAe40C,EAAUvnD,KC7+CxB,MAAM8oD,cAAgB,SAC3BC,EACA5zC,GAEA,MAAM0sC,EAAYmH,iBAAiBD,GACjC9zC,EAAY4sC,EAAU5sC,UAEC,iBAArB4sC,EAAUjlC,QACZ5M,MACE6xC,EAAUh8C,KAAVg8C,8EAQA5sC,GAA2B,cAAdA,GACM,cAArB4sC,EAAUjlC,QAEV5M,MACE,gFAIC6xC,EAAU7sC,QjEiFK,oBAAXrQ,QACPA,OAAO2V,UACP3V,OAAO2V,SAASvE,WACgC,IAAhDpR,OAAO2V,SAASvE,SAASN,QAAQ,WAEjC3J,KACE,6FiEnFJ,MAAMoJ,EAAqC,OAArB2sC,EAAUoH,QAAwC,QAArBpH,EAAUoH,OAE7D,MAAO,CACL/yC,SAAU,IAAInB,SACZ8sC,EAAUh8C,KACVg8C,EAAU7sC,OACVC,EACAC,EACAC,EACoB,GACeF,IAAc4sC,EAAUqH,WAE7D3gC,KAAM,IAAIR,KAAK85B,EAAU57B,cAIhB+iC,iBAAmB,SAAUD,GAWxC,IAAIljD,EAAO,GACT+W,EAAS,GACTssC,EAAY,GACZjjC,EAAa,GACbhR,EAAY,GAGVD,GAAS,EACXi0C,EAAS,QACT7iD,EAAO,IAGT,GAAuB,iBAAZ2iD,EAAsB,CAE/B,IAAII,EAAWJ,EAAQtzC,QAAQ,MAC3B0zC,GAAY,IACdF,EAASF,EAAQziD,UAAU,EAAG6iD,EAAW,GACzCJ,EAAUA,EAAQziD,UAAU6iD,EAAW,IAIzC,IAAIC,EAAWL,EAAQtzC,QAAQ,MACb,IAAd2zC,IACFA,EAAWL,EAAQ9oD,QAErB,IAAIopD,EAAkBN,EAAQtzC,QAAQ,MACb,IAArB4zC,IACFA,EAAkBN,EAAQ9oD,QAE5B4F,EAAOkjD,EAAQziD,UAAU,EAAGqL,KAAKG,IAAIs3C,EAAUC,IAC3CD,EAAWC,IAEbpjC,EA7HN,SAASqjC,WAAWrjC,GAClB,IAAIsjC,EAAoB,GACxB,MAAMxgC,EAAS9C,EAAWpe,MAAM,KAChC,IAAK,IAAI7H,EAAI,EAAGA,EAAI+oB,EAAO9oB,OAAQD,IACjC,GAAI+oB,EAAO/oB,GAAGC,OAAS,EAAG,CACxB,IAAIupD,EAAQzgC,EAAO/oB,GACnB,IACEwpD,EAAQC,mBAAmBD,EAAMhmD,QAAQ,MAAO,MAChD,MAAOE,IACT6lD,GAAqB,IAAMC,EAG/B,OAAOD,EAiHUD,CAAWP,EAAQziD,UAAU8iD,EAAUC,KAEtD,MAAM3kB,EA7GV,SAASglB,YAAYC,GACnB,MAAMC,EAAU,GACc,MAA1BD,EAAY3mD,OAAO,KACrB2mD,EAAcA,EAAYrjD,UAAU,IAEtC,IAAK,MAAMujD,KAAWF,EAAY9hD,MAAM,KAAM,CAC5C,GAAuB,IAAnBgiD,EAAQ5pD,OACV,SAEF,MAAM6pD,EAAKD,EAAQhiD,MAAM,KACP,IAAdiiD,EAAG7pD,OACL2pD,EAAQH,mBAAmBK,EAAG,KAAOL,mBAAmBK,EAAG,IAE3Dh+C,KAAK,0BAA0B+9C,gBAAsBF,MAGzD,OAAOC,EA6FeF,CAClBX,EAAQziD,UAAUqL,KAAKG,IAAIi3C,EAAQ9oD,OAAQopD,KAI7CF,EAAWtjD,EAAK4P,QAAQ,KACpB0zC,GAAY,GACdn0C,EAAoB,UAAXi0C,GAAiC,QAAXA,EAC/B7iD,EAAOC,SAASR,EAAKS,UAAU6iD,EAAW,GAAI,KAE9CA,EAAWtjD,EAAK5F,OAGlB,MAAM8pD,EAAkBlkD,EAAKgjB,MAAM,EAAGsgC,GACtC,GAAsC,cAAlCY,EAAgBx3C,cAClBqK,EAAS,iBACJ,GAAImtC,EAAgBliD,MAAM,KAAK5H,QAAU,EAC9C2c,EAASmtC,MACJ,CAEL,MAAMC,EAASnkD,EAAK4P,QAAQ,KAC5ByzC,EAAYrjD,EAAKS,UAAU,EAAG0jD,GAAQz3C,cACtCqK,EAAS/W,EAAKS,UAAU0jD,EAAS,GAEjC/0C,EAAYi0C,EAGV,OAAQxkB,IACVzvB,EAAYyvB,EAAgB,IAIhC,MAAO,CACL7+B,KAAAA,EACAO,KAAAA,EACAwW,OAAAA,EACAssC,UAAAA,EACAl0C,OAAAA,EACAi0C,OAAAA,EACAhjC,WAAAA,EACAhR,UAAAA,IChKEg1C,EACJ,mEAsBWC,EAAa,WAGxB,IAAIC,EAAe,EAMnB,MAAMC,EAA0B,GAEhC,OAAO,SAAU19C,GACf,MAAM29C,EAAgB39C,IAAQy9C,EAG9B,IAAInqD,EAFJmqD,EAAez9C,EAGf,MAAM49C,EAAiB,IAAIppD,MAAM,GACjC,IAAKlB,EAAI,EAAGA,GAAK,EAAGA,IAClBsqD,EAAetqD,GAAKiqD,EAAWjnD,OAAO0J,EAAM,IAG5CA,EAAMiF,KAAKI,MAAMrF,EAAM,IAEzBnN,OAAe,IAARmN,EAAW,4BAElB,IAAIsC,EAAKs7C,EAAeroD,KAAK,IAE7B,GAAKooD,EAIE,CAGL,IAAKrqD,EAAI,GAAIA,GAAK,GAA0B,KAArBoqD,EAAcpqD,GAAWA,IAC9CoqD,EAAcpqD,GAAK,EAErBoqD,EAAcpqD,UATd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBoqD,EAAcpqD,GAAK2R,KAAKI,MAAsB,GAAhBJ,KAAKyI,UAUvC,IAAKpa,EAAI,EAAGA,EAAI,GAAIA,IAClBgP,GAAMi7C,EAAWjnD,OAAOonD,EAAcpqD,IAIxC,OAFAT,OAAqB,KAAdyP,EAAG/O,OAAe,oCAElB+O,GA5Ce,GCCb,MAAAu7C,UAOXpnD,YACS6jB,EACAqvB,EACAmU,EACA9f,GAHA/pC,KAASqmB,UAATA,EACArmB,KAAiB01C,kBAAjBA,EACA11C,KAAQ6pD,SAARA,EACA7pD,KAAQ+pC,SAARA,EAET4X,UACE,MAAMmI,EAAM9pD,KAAK6pD,SAASC,IAC1B,MAAuB,UAAnB9pD,KAAKqmB,UACAyjC,EAAIj9B,MAEJi9B,EAAIrL,OAAO5xB,MAGtBk9B,eACE,OAAO/pD,KAAKqmB,UAEdg8B,iBACE,OAAOriD,KAAK01C,kBAAkB2M,eAAeriD,MAE/CgN,WACE,OACEhN,KAAK2hD,UAAU30C,WACf,IACAhN,KAAKqmB,UACL,IACA3f,UAAU1G,KAAK6pD,SAASG,cAKjB,MAAAC,YACXznD,YACSkzC,EACAzyC,EACA2kB,GAFA5nB,KAAiB01C,kBAAjBA,EACA11C,KAAKiD,MAALA,EACAjD,KAAI4nB,KAAJA,EAET+5B,UACE,OAAO3hD,KAAK4nB,KAEdmiC,eACE,MAAO,SAET1H,iBACE,OAAOriD,KAAK01C,kBAAkB2M,eAAeriD,MAE/CgN,WACE,OAAOhN,KAAK4nB,KAAK5a,WAAa,WC3DrB,MAAAk9C,gBACX1nD,YACmB2nD,EACAC,GADApqD,KAAgBmqD,iBAAhBA,EACAnqD,KAAcoqD,eAAdA,EAGnBC,QACEC,EACAC,GAEAvqD,KAAKmqD,iBAAiB5iD,KAAK,KAAM+iD,EAAiBC,GAGpDC,SAASvnD,GAKP,OAJArE,OACEoB,KAAKyqD,kBACL,gEAEKzqD,KAAKoqD,eAAe7iD,KAAK,KAAMtE,GAGpCwnD,wBACF,QAASzqD,KAAKoqD,eAGhBvpB,QAAQxX,GACN,OACErpB,KAAKmqD,mBAAqB9gC,EAAM8gC,uBACQ9mD,IAAvCrD,KAAKmqD,iBAAiBO,cACrB1qD,KAAKmqD,iBAAiBO,eACpBrhC,EAAM8gC,iBAAiBO,cACzB1qD,KAAKmqD,iBAAiB5jC,UAAY8C,EAAM8gC,iBAAiB5jC,SCxBpD,MAAAokC,aAEXnoD,YAAoBq1C,EAAqBhrB,GAArB7sB,KAAK63C,MAALA,EAAqB73C,KAAK6sB,MAALA,EAYzC+9B,SACE,MAAMl+B,EAAW,IAAI9mB,SAMrB,OALAy/C,uBACErlD,KAAK63C,MACL73C,KAAK6sB,MACLH,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QASlBgH,SACEi0C,qBAAqB,sBAAuBhhD,KAAK6sB,OACjD,MAAMH,EAAW,IAAI9mB,SAOrB,OANA0/C,oBACEtlD,KAAK63C,MACL73C,KAAK6sB,MACL,KACAH,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAsBlByG,IAAIrJ,GACF69C,qBAAqB,mBAAoBhhD,KAAK6sB,OAC9CkzB,wBAAwB,mBAAoB58C,EAAOnD,KAAK6sB,OAAO,GAC/D,MAAMH,EAAW,IAAI9mB,SAOrB,OANA0/C,oBACEtlD,KAAK63C,MACL73C,KAAK6sB,MACL1pB,EACAupB,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAalB8kD,gBACE1nD,EACAgzB,GAEA6qB,qBAAqB,+BAAgChhD,KAAK6sB,OAC1DkzB,wBACE,+BACA58C,EACAnD,KAAK6sB,OACL,GAEF+zB,iBAAiB,+BAAgCzqB,GAAU,GAE3D,MAAMzJ,EAAW,IAAI9mB,SAQrB,OLmkBE,SAAUklD,gCACd9H,EACAp7B,EACAzkB,EACAgzB,EACA5Q,GAEA,MAAM4M,EAAUsE,aAAatzB,EAAOgzB,GACpC6sB,EAAKhc,QAAQphB,gBACXgC,EAAK5a,WACLmlB,EAAQrkB,KAAgB,IACxB,CAACigB,EAAQ2B,KACQ,OAAX3B,GACFiY,2BAA2Bgd,EAAKhrC,cAAe4P,EAAMuK,GAEvDizB,2BAA2BpC,EAAMz9B,EAAYwI,EAAQ2B,MKzlBvDo7B,CACE9qD,KAAK63C,MACL73C,KAAK6sB,MACL1pB,EACAgzB,EACAzJ,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAmBlBkD,OAAOyoB,GACLsvB,qBAAqB,sBAAuBhhD,KAAK6sB,OACjD0zB,6BACE,sBACA7uB,EACA1xB,KAAK6sB,OACL,GAEF,MAAMH,EAAW,IAAI9mB,SAOrB,OLqjBE,SAAUmlD,uBACd/H,EACAp7B,EACAojC,EACAzlC,GAEA,GAAI9d,QAAQujD,GAGV,OAFA78C,IAAI,4EACJi3C,2BAA2BpC,EAAMz9B,EAAY,UAAMliB,GAIrD2/C,EAAKhc,QAAQnhB,kBACX+B,EAAK5a,WACLg+C,GACA,CAACj9B,EAAQ2B,KACQ,OAAX3B,GACFtd,KAAKu6C,GAAiB,CAAC/zB,EAAmBI,KACxC,MAAME,EAAed,aAAaY,GAClC2O,2BACEgd,EAAKhrC,cACLqQ,UAAUT,EAAMqP,GAChBM,MAIN6tB,2BAA2BpC,EAAMz9B,EAAYwI,EAAQ2B,MKrlBvDq7B,CACE/qD,KAAK63C,MACL73C,KAAK6sB,MACL6E,EACAhF,EAASzmB,cAAa,UAEjBymB,EAAS3mB,SC9FP,MAAAklD,UAIXzoD,YACWq1C,EACAhrB,EACAW,EACA09B,GAHAlrD,KAAK63C,MAALA,EACA73C,KAAK6sB,MAALA,EACA7sB,KAAYwtB,aAAZA,EACAxtB,KAAckrD,eAAdA,EAGP7jD,UACF,OAAImhB,YAAYxoB,KAAK6sB,OACZ,KAEA9E,YAAY/nB,KAAK6sB,OAIxBi9B,UACF,OAAO,IAAIqB,cAAcnrD,KAAK63C,MAAO73C,KAAK6sB,OAGxCS,uBACF,MAAMlmB,EAAMo9B,0BAA0BxkC,KAAKwtB,cACrCnf,EAAK6B,kBAAkB9I,GAC7B,MAAc,OAAPiH,EAAc,UAAYA,EAM/B0e,mBACF,OAAOyX,0BAA0BxkC,KAAKwtB,cAGxC49B,QAAQ/hC,GAEN,MADAA,EAAQzf,mBAAmByf,cACJ4hC,WACrB,OAAO,EAGT,MAAMI,EAAWrrD,KAAK63C,QAAUxuB,EAAMwuB,MAChCyT,EAAWliC,WAAWppB,KAAK6sB,MAAOxD,EAAMwD,OACxC0+B,EACJvrD,KAAKstB,mBAAqBjE,EAAMiE,iBAElC,OAAO+9B,GAAYC,GAAYC,EAGjCC,SACE,OAAOxrD,KAAKgN,WAGdA,WACE,OAAOhN,KAAK63C,MAAM7qC,WvD7ChB,SAAUy+C,uBAAuB7jC,GACrC,IAAItC,EAAa,GACjB,IAAK,IAAIjmB,EAAIuoB,EAAKH,UAAWpoB,EAAIuoB,EAAKL,QAAQjoB,OAAQD,IAC5B,KAApBuoB,EAAKL,QAAQloB,KACfimB,GAAc,IAAMggB,mBAAmBzjC,OAAO+lB,EAAKL,QAAQloB,MAI/D,OAAOimB,GAAc,IuDqCYmmC,CAAuBzrD,KAAK6sB,QAO/D,SAAS6+B,8BAA8Br2C,EAAkB5L,GACvD,IAA6B,IAAzB4L,EAAM61C,eACR,MAAM,IAAIlsD,MAAMyK,EAAS,+CAO7B,SAASkiD,uBAAuBn2C,GAC9B,IAAIo2C,EAAY,KACZC,EAAU,KAQd,GAPIr2C,EAAOyrB,aACT2qB,EAAYp2C,EAAO4rB,sBAEjB5rB,EAAO6rB,WACTwqB,EAAUr2C,EAAOgsB,oBAGfhsB,EAAO4Y,aAAe0E,EAAW,CACnC,MAAMg5B,EACJ,mGAEIC,EACJ,oIAEF,GAAIv2C,EAAOyrB,WAAY,CAErB,GADkBzrB,EAAO2rB,sBACPzxB,EAChB,MAAM,IAAI1Q,MAAM8sD,GACX,GAAyB,iBAAdF,EAChB,MAAM,IAAI5sD,MAAM+sD,GAGpB,GAAIv2C,EAAO6rB,SAAU,CAEnB,GADgB7rB,EAAO+rB,oBACP5xB,EACd,MAAM,IAAI3Q,MAAM8sD,GACX,GAAuB,iBAAZD,EAChB,MAAM,IAAI7sD,MAAM+sD,SAGf,GAAIv2C,EAAO4Y,aAAesK,GAC/B,GACgB,MAAbkzB,IAAsB9L,gBAAgB8L,IAC3B,MAAXC,IAAoB/L,gBAAgB+L,GAErC,MAAM,IAAI7sD,MACR,gMAWJ,GALAJ,OACE4W,EAAO4Y,qBAAsBmQ,WAC3B/oB,EAAO4Y,aAAe0Q,EACxB,uBAGc,MAAb8sB,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAE3B,MAAM,IAAI7sD,MACR,oHAUR,SAASgtD,cAAcx2C,GACrB,GACEA,EAAOyrB,YACPzrB,EAAO6rB,UACP7rB,EAAOouB,aACNpuB,EAAOquB,mBAER,MAAM,IAAI7kC,MACR,iIAQA,MAAOmsD,sBAAsBF,UAEjCzoD,YAAYwgD,EAAYp7B,GACtBX,MAAM+7B,EAAMp7B,EAAM,IAAIqb,aAAe,GAGnCwb,aACF,MAAMwN,EAAa9jC,WAAWnoB,KAAK6sB,OACnC,OAAsB,OAAfo/B,EACH,KACA,IAAId,cAAcnrD,KAAK63C,MAAOoU,GAGhCnyB,WACF,IAAIgwB,EAAqB9pD,KACzB,KAAsB,OAAf8pD,EAAIrL,QACTqL,EAAMA,EAAIrL,OAEZ,OAAOqL,GAkBE,MAAAoC,aAOX1pD,YACW2pD,EAIArC,EACAsC,GALApsD,KAAKmsD,MAALA,EAIAnsD,KAAG8pD,IAAHA,EACA9pD,KAAMosD,OAANA,EAWPj2B,eAEF,OAAOn2B,KAAKmsD,MAAM51B,cAAczoB,MAY9BzG,UACF,OAAOrH,KAAK8pD,IAAIziD,IAIdwV,WACF,OAAO7c,KAAKmsD,MAAMz0B,cAepByE,MAAMvU,GACJ,MAAMojB,EAAY,IAAI5jB,KAAKQ,GACrBykC,EAAWlwB,MAAMn8B,KAAK8pD,IAAKliC,GACjC,OAAO,IAAIskC,aACTlsD,KAAKmsD,MAAMj1B,SAAS8T,GACpBqhB,EACA3zB,GAOJ4zB,SACE,OAAQtsD,KAAKmsD,MAAM1kD,UAarBuiD,YACE,OAAOhqD,KAAKmsD,MAAMr+C,KAAI,GAqBxBs3B,QAAQ/Y,GACN,GAAIrsB,KAAKmsD,MAAM71B,aACb,OAAO,EAKT,QAFqBt2B,KAAKmsD,MAEJx0B,aAAa33B,KAAKosD,QAAQ,CAAC/kD,EAAKwqB,IAC7CxF,EACL,IAAI6/B,aAAar6B,EAAMsK,MAAMn8B,KAAK8pD,IAAKziD,GAAMqxB,MAYnDvB,SAASvP,GACP,MAAMojB,EAAY,IAAI5jB,KAAKQ,GAC3B,OAAQ5nB,KAAKmsD,MAAMj1B,SAAS8T,GAAWvjC,UAezC8kD,cACE,OAAIvsD,KAAKmsD,MAAM71B,eAGLt2B,KAAKmsD,MAAM1kD,UAOvB+jD,SACE,OAAOxrD,KAAKgqD,YAedl8C,MACE,OAAO9N,KAAKmsD,MAAMr+C,OAyBN,SAAAg8C,IAAI0C,EAAc5kC,GAGhC,OAFA4kC,EAAK5iD,mBAAmB4iD,IACrBC,iBAAiB,YACJppD,IAATukB,EAAqBuU,MAAMqwB,EAAGE,MAAO9kC,GAAQ4kC,EAAGE,MAmBzC,SAAAC,WAAWH,EAAcjvC,IACvCivC,EAAK5iD,mBAAmB4iD,IACrBC,iBAAiB,cACpB,MAAMG,EAAYzE,cAAc5qC,EAAKivC,EAAG3U,MAAMv2B,UAAU9M,WACxDysC,YAAY,aAAc2L,GAE1B,MAAMr3C,EAAWq3C,EAAUr3C,SAgB3B,OAdGi3C,EAAG3U,MAAMv2B,UAAUrM,gBACpBM,EAASrQ,OAASsnD,EAAG3U,MAAMv2B,UAAUpc,MAErCmK,MACE,qEAGEkG,EAASrQ,KACT,iBACAsnD,EAAG3U,MAAMv2B,UAAUpc,KACnB,KAIC4kD,IAAI0C,EAAII,EAAUhlC,KAAK5a,YAahB,SAAAmvB,MACdsiB,EACA72B,GRxLoC,IACpCne,EACAq3C,EACAx7B,EACAzS,EQ4LA,OALmC,OAA/B8U,cADJ82B,EAAS70C,mBAAmB60C,IACJ5xB,QR1LxBpjB,EQ2LyB,QR1LzBq3C,EQ0LkC,ORxLlCjuC,GQwLgD,GRzLhDyS,EQyL0CsC,KRpLxCtC,EAAaA,EAAWziB,QAAQ,mBAAoB,MAGtDk+C,mBAAmBt3C,EAAQq3C,EAAcx7B,EAAYzS,IQmLnDkuC,mBAAmB,QAAS,OAAQn5B,GAAM,GAErC,IAAIujC,cAAc1M,EAAO5G,MAAOxvB,UAAUo2B,EAAO5xB,MAAOjF,IAU3D,SAAU9P,aAAagyC,GAE3B,OADAA,EAAMlgD,mBAAmBkgD,GAClB,IAAIa,aAAab,EAAIjS,MAAOiS,EAAIj9B,OA8BzB,SAAAxrB,KACdo9C,EACAt7C,GAEAs7C,EAAS70C,mBAAmB60C,GAC5BuC,qBAAqB,OAAQvC,EAAO5xB,OACpCkzB,wBAAwB,OAAQ58C,EAAOs7C,EAAO5xB,OAAO,GACrD,MAAM9gB,EAAMk4C,eAAexF,EAAO5G,OAC5Bp1C,EAAO8mD,EAAWx9C,GAQlB8gD,EAAmD1wB,MACvDsiB,EACAh8C,GAEIqqD,EAAU3wB,MAAMsiB,EAAQh8C,GAE9B,IAAIsD,EASJ,OAPEA,EADW,MAAT5C,EACQqJ,IAAIsgD,EAAS3pD,GAAO2P,MAAK,IAAMg6C,IAE/B9mD,QAAQF,QAAQgnD,GAG5BD,EAAiB/5C,KAAO/M,EAAQ+M,KAAK5D,KAAKnJ,GAC1C8mD,EAAiB1mD,MAAQJ,EAAQ+M,KAAK5D,KAAKnJ,OAAS1C,GAC7CwpD,EAiBH,SAAU9/C,OAAO+8C,GAErB,OADA9I,qBAAqB,SAAU8I,EAAIj9B,OAC5BrgB,IAAIs9C,EAAK,MAgCF,SAAAt9C,IAAIs9C,EAAwB3mD,GAC1C2mD,EAAMlgD,mBAAmBkgD,GACzB9I,qBAAqB,MAAO8I,EAAIj9B,OAChCkzB,wBAAwB,MAAO58C,EAAO2mD,EAAIj9B,OAAO,GACjD,MAAMH,EAAW,IAAI9mB,SAQrB,OAPAm/C,oBACE+E,EAAIjS,MACJiS,EAAIj9B,MACJ1pB,EACc,KACdupB,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAeF,SAAAgnD,YACdjD,EACA3zB,GAEA2zB,EAAMlgD,mBAAmBkgD,GACzB9I,qBAAqB,cAAe8I,EAAIj9B,OACxC+zB,iBAAiB,cAAezqB,GAAU,GAC1C,MAAMzJ,EAAW,IAAI9mB,SAQrB,OAPAm/C,oBACE+E,EAAIjS,MACJxvB,UAAUyhC,EAAIj9B,MAAO,aACrBsJ,EACA,KACAzJ,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAkBF,SAAA8kD,gBACdf,EACA3mD,EACAgzB,GAKA,GAHA6qB,qBAAqB,kBAAmB8I,EAAIj9B,OAC5CkzB,wBAAwB,kBAAmB58C,EAAO2mD,EAAIj9B,OAAO,GAC7D+zB,iBAAiB,kBAAmBzqB,GAAU,GAC9B,YAAZ2zB,EAAIziD,KAAiC,UAAZyiD,EAAIziD,IAC/B,KAAM,2BAA6ByiD,EAAIziD,IAAM,0BAG/C,MAAMqlB,EAAW,IAAI9mB,SAQrB,OAPAm/C,oBACE+E,EAAIjS,MACJiS,EAAIj9B,MACJ1pB,EACAgzB,EACAzJ,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAsCF,SAAAkD,OAAO6gD,EAAwBp4B,GAC7C6uB,6BAA6B,SAAU7uB,EAAQo4B,EAAIj9B,OAAO,GAC1D,MAAMH,EAAW,IAAI9mB,SAOrB,ONjNI,SAAUonD,WACdhK,EACAp7B,EACAojC,EACAzlC,GAEAm/B,QAAQ1B,EAAM,SAAU,CAAEp7B,KAAMA,EAAK5a,WAAY7J,MAAO6nD,IAGxD,IAAI/d,GAAQ,EACZ,MAAM2Q,EAAesG,yBAAyBlB,GACxCxQ,EAAyC,GAW/C,GAVA/hC,KAAKu6C,GAAiB,CAACiC,EAAoBC,KACzCjgB,GAAQ,EACRuF,EAAgBya,GAAc/O,yBAC5B71B,UAAUT,EAAMqlC,GAChBx2B,aAAay2B,GACblK,EAAKgB,gBACLpG,MAIC3Q,EA6CH9+B,IAAI,wDACJi3C,2BAA2BpC,EAAMz9B,EAAY,UAAMliB,OA9CzC,CACV,MAAM0qC,EAAU+W,mBAAmB9B,GAC7B7Z,EAAS4P,uBACbiK,EAAKgB,gBACLp8B,EACA4qB,EACAzE,GAEFwT,sBAAsByB,EAAKN,YAAavZ,GACxC6Z,EAAKhc,QAAQvhB,MACXmC,EAAK5a,WACLg+C,GACA,CAACj9B,EAAQ2B,KACP,MAAMw1B,EAAqB,OAAXn3B,EACXm3B,GACH/5C,KAAK,aAAeyc,EAAO,YAAcmG,GAG3C,MAAMo3B,EAAchM,qBAClB6J,EAAKgB,gBACLjW,GACCmX,GAEGzlB,EACJ0lB,EAAY7lD,OAAS,EAAIklD,sBAAsBxB,EAAMp7B,GAAQA,EAC/Dm6B,oCACEiB,EAAKN,YACLjjB,EACA0lB,GAEFC,2BAA2BpC,EAAMz9B,EAAYwI,EAAQ2B,MAIzDjf,KAAKu6C,GAAkBhJ,IACrB,MAAMviB,EAAeolB,sBACnB7B,EACA36B,UAAUT,EAAMo6B,IAElBwC,sBAAsBxB,EAAMvjB,MAI9BsiB,oCAAoCiB,EAAKN,YAAa96B,EAAM,KM0I9DolC,CACElD,EAAIjS,MACJiS,EAAIj9B,MACJ6E,EACAhF,EAASzmB,cAAa,UAEjBymB,EAAS3mB,QAWZ,SAAU6G,IAAIyI,GAClBA,EAAQzL,mBAAmByL,GAC3B,MAAM83C,EAAkB,IAAIjD,iBAAgB,SACtCkD,EAAY,IAAIC,uBAAuBF,GAC7C,ONpWc,SAAAG,aACdtK,EACA3tC,EACAqgC,GAGA,MAAM6X,EAASjR,uBAAuB0G,EAAKgB,gBAAiB3uC,GAC5D,OAAc,MAAVk4C,EACKvnD,QAAQF,QAAQynD,GAElBvK,EAAKhc,QAAQp6B,IAAIyI,GAAOvC,MAC7BsR,IACE,MAAMyN,EAAO4E,aAAarS,GAASmU,UACjCljB,EAAMmY,aAAaY,YAerB,IAAI+a,EACJ,GAPAsS,6BACEuH,EAAKgB,gBACL3uC,EACAqgC,GACA,GAGErgC,EAAMmY,aAAaE,eACrByb,EAASmQ,6BACP0J,EAAKgB,gBACL3uC,EAAMwX,MACNgF,OAEG,CACL,MAAMzE,EAAMqtB,oBAAoBuI,EAAKgB,gBAAiB3uC,GACtD8zB,EAASgS,kCACP6H,EAAKgB,gBACL3uC,EAAMwX,MACNgF,EACAzE,GAyBJ,OAZA20B,oCACEiB,EAAKN,YACLrtC,EAAMwX,MACNsc,GAEFoQ,gCACEyJ,EAAKgB,gBACL3uC,EACAqgC,EACA,MACA,GAEK7jB,KAET27B,IACE9I,QAAQ1B,EAAM,iBAAmBt8C,UAAU2O,GAAS,YAAcm4C,GAC3DxnD,QAAQH,OAAO,IAAI7G,MAAMwuD,OM8R7BF,CAAaj4C,EAAMwiC,MAAOxiC,EAAO+3C,GAAWt6C,MAAK+e,GAC/C,IAAIq6B,aACTr6B,EACA,IAAIs5B,cAAc91C,EAAMwiC,MAAOxiC,EAAMwX,OACrCxX,EAAMmY,aAAaY,cAOZ,MAAAi/B,uBACX7qD,YAAoB2qD,GAAAntD,KAAemtD,gBAAfA,EAEpBljB,WAAW5jB,GACT,MAAqB,UAAdA,EAGT6jB,YAAYT,EAAgBp0B,GAC1B,MAAM2X,EAAQ3X,EAAMmY,aAAaY,WACjC,OAAO,IAAIw7B,UACT,QACA5pD,KACA,IAAIksD,aACFziB,EAAOxK,aACP,IAAIksB,cAAc91C,EAAMwiC,MAAOxiC,EAAMwX,OACrCG,IAKNq1B,eAAe37B,GACb,MAAiC,WAA7BA,EAAUqjC,eACL,IACL/pD,KAAKmtD,gBAAgB3C,SAAU9jC,EAA0BzjB,OAEpD,IACLjD,KAAKmtD,gBAAgB9C,QAAS3jC,EAAwBmjC,SAAU,MAItE/T,kBAAkB7yC,EAAc2kB,GAC9B,OAAI5nB,KAAKmtD,gBAAgB1C,kBAChB,IAAIR,YAAYjqD,KAAMiD,EAAO2kB,GAE7B,KAIXiZ,QAAQxX,GACN,OAAMA,aAAiBgkC,0BAEXhkC,EAAM8jC,kBAAoBntD,KAAKmtD,iBAIlC9jC,EAAM8jC,gBAAgBtsB,QAAQ7gC,KAAKmtD,kBAI9ClX,iBACE,OAAgC,OAAzBj2C,KAAKmtD,iBAOH,MAAAM,uBACXjrD,YACU6jB,EACA8mC,GADAntD,KAASqmB,UAATA,EACArmB,KAAemtD,gBAAfA,EAGVljB,WAAW5jB,GACT,IAAIqnC,EACY,mBAAdrnC,EAAiC,cAAgBA,EAGnD,OAFAqnC,EACmB,qBAAjBA,EAAsC,gBAAkBA,EACnD1tD,KAAKqmB,YAAcqnC,EAG5B5X,kBAAkB7yC,EAAc2kB,GAC9B,OAAI5nB,KAAKmtD,gBAAgB1C,kBAChB,IAAIR,YAAYjqD,KAAMiD,EAAO2kB,GAE7B,KAIXsiB,YAAYT,EAAgBp0B,GAC1BzW,OAA2B,MAApB6qC,EAAOxS,UAAmB,yCACjC,MAAMo1B,EAAWlwB,MACf,IAAIgvB,cAAc91C,EAAMwiC,MAAOxiC,EAAMwX,OACrC4c,EAAOxS,WAEHjK,EAAQ3X,EAAMmY,aAAaY,WACjC,OAAO,IAAIw7B,UACTngB,EAAOx/B,KACPjK,KACA,IAAIksD,aAAaziB,EAAOxK,aAAcotB,EAAUr/B,GAChDyc,EAAOM,UAIXsY,eAAe37B,GACb,MAAiC,WAA7BA,EAAUqjC,eACL,IACL/pD,KAAKmtD,gBAAgB3C,SAAU9jC,EAA0BzjB,OAEpD,IACLjD,KAAKmtD,gBAAgB9C,QAClB3jC,EAAwBmjC,SACxBnjC,EAAwBqjB,UAKjClJ,QAAQxX,GACN,OAAIA,aAAiBokC,yBAEjBztD,KAAKqmB,YAAcgD,EAAMhD,aACvBrmB,KAAKmtD,kBACJ9jC,EAAM8jC,iBACPntD,KAAKmtD,gBAAgBtsB,QAAQxX,EAAM8jC,mBAO3ClX,iBACE,QAASj2C,KAAKmtD,iBAIlB,SAAS10C,iBACPpD,EACAgR,EACAngB,EACAynD,EACA9uC,GAEA,IAAIurC,EASJ,GAR6C,iBAAlCuD,IACTvD,OAAiB/mD,EACjBwb,EAAU8uC,GAEiC,mBAAlCA,IACTvD,EAAiBuD,GAGf9uC,GAAWA,EAAQ+uC,SAAU,CAC/B,MAAMlD,EAAexkD,EACf2nD,aAA6B,CAACC,EAAcvD,KAChDhF,gCAAgClwC,EAAMwiC,MAAOxiC,EAAO+3C,GACpD1C,EAAaoD,EAAcvD,IAE7BsD,aAAanD,aAAexkD,EAASwkD,aACrCmD,aAAatnC,QAAUrgB,EAASqgB,QAChCrgB,EAAW2nD,aAGb,MAAMV,EAAkB,IAAIjD,gBAC1BhkD,EACAkkD,QAAkB/mD,GAEd+pD,EACU,UAAd/mC,EACI,IAAIgnC,uBAAuBF,GAC3B,IAAIM,uBAAuBpnC,EAAW8mC,GAE5C,ON1Mc,SAAAY,6BACd/K,EACA3tC,EACAqgC,GAEA,IAAIvM,EAEFA,EADgC,UAA9BxhB,aAAatS,EAAMwX,OACZ4uB,6BACPuH,EAAKc,cACLzuC,EACAqgC,GAGO+F,6BACPuH,EAAKgB,gBACL3uC,EACAqgC,GAGJkM,4BAA4BoB,EAAKN,YAAartC,EAAMwX,MAAOsc,GMsL3D4kB,CAA6B14C,EAAMwiC,MAAOxiC,EAAO+3C,GAC1C,IAAM7H,gCAAgClwC,EAAMwiC,MAAOxiC,EAAO+3C,GAmG7D,SAAU/C,QACdh1C,EACAnP,EACAynD,EACA9uC,GAEA,OAAOpG,iBACLpD,EACA,QACAnP,EACAynD,EACA9uC,GAgHE,SAAUmvC,aACd34C,EACAnP,EAIAynD,EACA9uC,GAEA,OAAOpG,iBACLpD,EACA,cACAnP,EACAynD,EACA9uC,GAmHE,SAAUovC,eACd54C,EACAnP,EAIAynD,EACA9uC,GAEA,OAAOpG,iBACLpD,EACA,gBACAnP,EACAynD,EACA9uC,GA6GE,SAAUqvC,aACd74C,EACAnP,EAIAynD,EACA9uC,GAEA,OAAOpG,iBACLpD,EACA,cACAnP,EACAynD,EACA9uC,GAgHE,SAAUsvC,eACd94C,EACAnP,EACAynD,EACA9uC,GAEA,OAAOpG,iBACLpD,EACA,gBACAnP,EACAynD,EACA9uC,GA6BY,SAAA+H,IACdvR,EACAgR,EACAngB,GAKA,IAAIknD,EAAsC,KAC1C,MAAMgB,EAAcloD,EAAW,IAAIgkD,gBAAgBhkD,GAAY,KAC7C,UAAdmgB,EACF+mC,EAAY,IAAIC,uBAAuBe,GAC9B/nC,IACT+mC,EAAY,IAAIK,uBAAuBpnC,EAAW+nC,IAEpD7I,gCAAgClwC,EAAMwiC,MAAOxiC,EAAO+3C,GA2BhC,MAAAiB,iBAWtB,MAAMC,6BAA6BD,gBAGjC7rD,YACmB+rD,EACApU,GAEjBlzB,QAHiBjnB,KAAMuuD,OAANA,EACAvuD,KAAIm6C,KAAJA,EAKnBqU,OAAUn5C,GACR0qC,wBAAwB,QAAS//C,KAAKuuD,OAAQl5C,EAAMwX,OAAO,GAC3D,MAAMmX,EAAYC,iBAChB5uB,EAAMmY,aACNxtB,KAAKuuD,OACLvuD,KAAKm6C,MAIP,GAFA6R,cAAchoB,GACd2nB,uBAAuB3nB,GACnB3uB,EAAMmY,aAAa6T,SACrB,MAAM,IAAIriC,MACR,2FAIJ,OAAO,IAAIisD,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,EACA3uB,EAAM61C,iBA4BI,SAAAuD,MACdtrD,EACAkE,GAGA,OADAw5C,YAAY,QAAS,MAAOx5C,GAAK,GAC1B,IAAIinD,qBAAqBnrD,EAAOkE,GAGzC,MAAMqnD,iCAAiCL,gBAGrC7rD,YACmB+rD,EACApU,GAEjBlzB,QAHiBjnB,KAAMuuD,OAANA,EACAvuD,KAAIm6C,KAAJA,EAKnBqU,OAAUn5C,GACR0qC,wBAAwB,YAAa//C,KAAKuuD,OAAQl5C,EAAMwX,OAAO,GAC/D,MAAMmX,ElCl7CM,SAAA2qB,qBACd5qB,EACAlR,EACAxrB,GAEA,IAAImO,EAOJ,OALEA,EADEuuB,EAAYxE,SAAWzM,GAAezrB,EAC/B48B,iBAAiBF,EAAalR,EAAYxrB,GAE1C48B,iBAAiBF,EAAalR,EAAYnjB,GAErD8F,EAAOkrB,eAAgB,EAChBlrB,EkCs6Cam5C,CAChBt5C,EAAMmY,aACNxtB,KAAKuuD,OACLvuD,KAAKm6C,MAIP,GAFA6R,cAAchoB,GACd2nB,uBAAuB3nB,GACnB3uB,EAAMmY,aAAa6T,SACrB,MAAM,IAAIriC,MACR,+FAIJ,OAAO,IAAIisD,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,EACA3uB,EAAM61C,iBAwBI,SAAA0D,UACdzrD,EACAkE,GAGA,OADAw5C,YAAY,YAAa,MAAOx5C,GAAK,GAC9B,IAAIqnD,yBAAyBvrD,EAAOkE,GAG7C,MAAMwnD,+BAA+BR,gBAGnC7rD,YACmB+rD,EACApU,GAEjBlzB,QAHiBjnB,KAAMuuD,OAANA,EACAvuD,KAAIm6C,KAAJA,EAKnBqU,OAAUn5C,GACR0qC,wBAAwB,UAAW//C,KAAKuuD,OAAQl5C,EAAMwX,OAAO,GAC7D,MAAMmX,EAAYF,mBAChBzuB,EAAMmY,aACNxtB,KAAKuuD,OACLvuD,KAAKm6C,MAIP,GAFA6R,cAAchoB,GACd2nB,uBAAuB3nB,GACnB3uB,EAAMmY,aAAayT,WACrB,MAAM,IAAIjiC,MACR,iGAIJ,OAAO,IAAIisD,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,EACA3uB,EAAM61C,iBA2BI,SAAA4D,QACd3rD,EAA0C,KAC1CkE,GAGA,OADAw5C,YAAY,UAAW,MAAOx5C,GAAK,GAC5B,IAAIwnD,uBAAuB1rD,EAAOkE,GAG3C,MAAM0nD,kCAAkCV,gBAGtC7rD,YACmB+rD,EACApU,GAEjBlzB,QAHiBjnB,KAAMuuD,OAANA,EACAvuD,KAAIm6C,KAAJA,EAKnBqU,OAAUn5C,GACR0qC,wBAAwB,aAAc//C,KAAKuuD,OAAQl5C,EAAMwX,OAAO,GAChE,MAAMmX,ElCnlDM,SAAAgrB,sBACdjrB,EACAlR,EACAxrB,GAEA,IAAImO,EAOJ,OALEA,EADEuuB,EAAYxE,SAAWzM,GAAezrB,EAC/By8B,mBAAmBC,EAAalR,EAAYxrB,GAE5Cy8B,mBAAmBC,EAAalR,EAAYljB,GAEvD6F,EAAOgrB,gBAAiB,EACjBhrB,EkCukDaw5C,CAChB35C,EAAMmY,aACNxtB,KAAKuuD,OACLvuD,KAAKm6C,MAIP,GAFA6R,cAAchoB,GACd2nB,uBAAuB3nB,GACnB3uB,EAAMmY,aAAayT,WACrB,MAAM,IAAIjiC,MACR,oGAIJ,OAAO,IAAIisD,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,EACA3uB,EAAM61C,iBAuBI,SAAA+D,WACd9rD,EACAkE,GAGA,OADAw5C,YAAY,aAAc,MAAOx5C,GAAK,GAC/B,IAAI0nD,0BAA0B5rD,EAAOkE,GAG9C,MAAM6nD,oCAAoCb,gBAGxC7rD,YAA6B2sD,GAC3BloC,QAD2BjnB,KAAMmvD,OAANA,EAI7BX,OAAUn5C,GACR,GAAIA,EAAMmY,aAAaoW,WACrB,MAAM,IAAI5kC,MACR,yFAIJ,OAAO,IAAIisD,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MlC9rDI,SAAAuiC,wBACdrrB,EACAsrB,GAEA,MAAMrrB,EAAYD,EAAYjQ,OAI9B,OAHAkQ,EAAUd,WAAY,EACtBc,EAAU/B,OAASotB,EACnBrrB,EAAUT,UAAS,IACZS,EkCurDHorB,CAAwB/5C,EAAMmY,aAAcxtB,KAAKmvD,QACjD95C,EAAM61C,iBAuBN,SAAUoE,aAAaC,GAC3B,GAAqB,iBAAVA,GAAsBv+C,KAAKI,MAAMm+C,KAAWA,GAASA,GAAS,EACvE,MAAM,IAAIvwD,MAAM,4DAElB,OAAO,IAAIkwD,4BAA4BK,GAGzC,MAAMC,mCAAmCnB,gBAGvC7rD,YAA6B2sD,GAC3BloC,QAD2BjnB,KAAMmvD,OAANA,EAI7BX,OAAUn5C,GACR,GAAIA,EAAMmY,aAAaoW,WACrB,MAAM,IAAI5kC,MACR,wFAIJ,OAAO,IAAIisD,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MlCnuDI,SAAA4iC,uBACd1rB,EACAsrB,GAEA,MAAMrrB,EAAYD,EAAYjQ,OAI9B,OAHAkQ,EAAUd,WAAY,EACtBc,EAAU/B,OAASotB,EACnBrrB,EAAUT,UAAS,IACZS,EkC4tDHyrB,CAAuBp6C,EAAMmY,aAAcxtB,KAAKmvD,QAChD95C,EAAM61C,iBAuBN,SAAUwE,YAAYH,GAC1B,GAAqB,iBAAVA,GAAsBv+C,KAAKI,MAAMm+C,KAAWA,GAASA,GAAS,EACvE,MAAM,IAAIvwD,MAAM,2DAGlB,OAAO,IAAIwwD,2BAA2BD,GAGxC,MAAMI,oCAAoCtB,gBAGxC7rD,YAA6BqqB,GAC3B5F,QAD2BjnB,KAAK6sB,MAALA,EAI7B2hC,OAAUn5C,GACRq2C,8BAA8Br2C,EAAO,gBACrC,MAAMu6C,EAAa,IAAIxoC,KAAKpnB,KAAK6sB,OACjC,GAAIrE,YAAYonC,GACd,MAAM,IAAI5wD,MACR,wEAGJ,MAAMguB,EAAQ,IAAIuR,UAAUqxB,GACtB5rB,EAAYE,mBAAmB7uB,EAAMmY,aAAcR,GAGzD,OAFA2+B,uBAAuB3nB,GAEhB,IAAIinB,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,GACmB,IAsBnB,SAAU6rB,aAAajoC,GAC3B,GAAa,SAATA,EACF,MAAM,IAAI5oB,MACR,+DAEG,GAAa,cAAT4oB,EACT,MAAM,IAAI5oB,MACR,yEAEG,GAAa,WAAT4oB,EACT,MAAM,IAAI5oB,MACR,mEAIJ,OADA+hD,mBAAmB,eAAgB,OAAQn5B,GAAM,GAC1C,IAAI+nC,4BAA4B/nC,GAGzC,MAAMkoC,kCAAkCzB,gBAGtCG,OAAUn5C,GACRq2C,8BAA8Br2C,EAAO,cACrC,MAAM2uB,EAAYE,mBAAmB7uB,EAAMmY,aAAcsF,GAEzD,OADA64B,uBAAuB3nB,GAChB,IAAIinB,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,GACmB,IAaT,SAAA+rB,aACd,OAAO,IAAID,0BAGb,MAAME,uCAAuC3B,gBAG3CG,OAAUn5C,GACRq2C,8BAA8Br2C,EAAO,mBACrC,MAAM2uB,EAAYE,mBAAmB7uB,EAAMmY,aAAckL,GAEzD,OADAizB,uBAAuB3nB,GAChB,IAAIinB,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,GACmB,IAaT,SAAAisB,kBACd,OAAO,IAAID,+BAGb,MAAME,oCAAoC7B,gBAGxCG,OAAUn5C,GACRq2C,8BAA8Br2C,EAAO,gBACrC,MAAM2uB,EAAYE,mBAAmB7uB,EAAMmY,aAAcsR,GAEzD,OADA6sB,uBAAuB3nB,GAChB,IAAIinB,UACT51C,EAAMwiC,MACNxiC,EAAMwX,MACNmX,GACmB,IAcT,SAAAmsB,eACd,OAAO,IAAID,4BAGb,MAAME,oCAAoC/B,gBAGxC7rD,YACmB+rD,EACApU,GAEjBlzB,QAHiBjnB,KAAMuuD,OAANA,EACAvuD,KAAIm6C,KAAJA,EAKnBqU,OAAUn5C,GAER,GADA0qC,wBAAwB,UAAW//C,KAAKuuD,OAAQl5C,EAAMwX,OAAO,GACzDxX,EAAMmY,aAAayT,WACrB,MAAM,IAAIjiC,MACR,+FAIJ,GAAIqW,EAAMmY,aAAa6T,SACrB,MAAM,IAAIriC,MACR,0FAIJ,OAAO,IAAIsvD,qBAAqBtuD,KAAKuuD,OAAQvuD,KAAKm6C,MAAMqU,OACtD,IAAIK,uBAAuB7uD,KAAKuuD,OAAQvuD,KAAKm6C,MAAMqU,OAAOn5C,KA4BhD,SAAAg7C,QACdltD,EACAkE,GAGA,OADAw5C,YAAY,UAAW,MAAOx5C,GAAK,GAC5B,IAAI+oD,4BAA4BjtD,EAAOkE,GAYhC,SAAAgO,MACdA,KACGi7C,GAEH,IAAIC,EAAY3mD,mBAAmByL,GACnC,IAAK,MAAMm7C,KAAcF,EACvBC,EAAYC,EAAWhC,OAAO+B,GAEhC,OAAOA,GZ/oEH,SAAUE,iCACd3iD,GAEAlP,QACG83C,EACD,mDAEFA,EAAuB5oC,EYipEzB2iD,CAAiCtF,eX/oE3B,SAAUuF,gCACd5iD,GAEAlP,QACG83C,EACD,mDAEFA,EAAuB5oC,EWyoEzB4iD,CAAgCvF,eC1pEhC,MAKMwF,EAIF,GAKJ,IAAIC,GAAgB,EA+Bd,SAAUC,2BACdC,EACAC,EACAr+C,EACA6K,EACA/I,GAEA,IAAIw8C,EAA4BzzC,GAAOuzC,EAAIjyC,QAAQoyC,iBACrC5tD,IAAV2tD,IACGF,EAAIjyC,QAAQqyC,WACf7hD,MACE,kHAKJlB,IAAI,kCAAmC2iD,EAAIjyC,QAAQqyC,WACnDF,EAAQ,GAAGF,EAAIjyC,QAAQqyC,yCAGzB,IAGIC,EAEAC,EALAlQ,EAAYiH,cAAc6I,EAAOx8C,GACjCe,EAAW2rC,EAAU3rC,SAKF,oBAAZnR,SAA2BA,QAAQC,MAC5C+sD,EAAiBhtD,QAAQC,IAAuC,iCAG9D+sD,GACFD,GAAa,EACbH,EAAQ,UAAUI,QAAqB77C,EAASjB,YAChD4sC,EAAYiH,cAAc6I,EAAOx8C,GACjCe,EAAW2rC,EAAU3rC,UAErB47C,GAAcjQ,EAAU3rC,SAASlB,OAGnC,MAAMg9C,EACJ78C,GAAa28C,EACT,IAAIn9C,sBAAsBA,sBAAsBE,OAChD,IAAIb,0BAA0By9C,EAAIruD,KAAMquD,EAAIjyC,QAASkyC,GAE3D9P,YAAY,gCAAiCC,GACxC14B,YAAY04B,EAAUt5B,OACzBvY,MACE,4FAKJ,MAAM2zC,EA8BR,SAASsO,sBACP/7C,EACAu7C,EACAO,EACA3+C,GAEA,IAAI6+C,EAAWZ,EAAMG,EAAIruD,MAEpB8uD,IACHA,EAAW,GACXZ,EAAMG,EAAIruD,MAAQ8uD,GAGpB,IAAIvO,EAAOuO,EAASh8C,EAASJ,eACzB6tC,GACF3zC,MACE,2HAMJ,OAHA2zC,EAAO,IAAIV,KAAK/sC,EAAUq7C,EAAeS,EAAmB3+C,GAC5D6+C,EAASh8C,EAASJ,eAAiB6tC,EAE5BA,EApDMsO,CACX/7C,EACAu7C,EACAO,EACA,IAAI7+C,sBAAsBs+C,EAAIruD,KAAMiQ,IAEtC,OAAO,IAAI8+C,SAASxO,EAAM8N,GA2Df,MAAAU,SAWXhvD,YACSivD,EAEEX,GAFF9wD,KAAayxD,cAAbA,EAEEzxD,KAAG8wD,IAAHA,EAZF9wD,KAAM,KAAG,WAGlBA,KAAgB0xD,kBAAY,EAYxB7Z,YASF,OARK73C,KAAK0xD,mBACR3O,UACE/iD,KAAKyxD,cACLzxD,KAAK8wD,IAAIjyC,QAAQokC,MACjBjjD,KAAK8wD,IAAIjyC,QAAsC,8BAEjD7e,KAAK0xD,kBAAmB,GAEnB1xD,KAAKyxD,cAGV/E,YAIF,OAHK1sD,KAAK2xD,gBACR3xD,KAAK2xD,cAAgB,IAAIxG,cAAcnrD,KAAK63C,MAAOnwB,iBAE9C1nB,KAAK2xD,cAGdC,UAME,OAL2B,OAAvB5xD,KAAK2xD,iBAzFb,SAASE,sBAAsB7O,EAAY8O,GACzC,MAAMP,EAAWZ,EAAMmB,GAElBP,GAAYA,EAASvO,EAAK37C,OAAS27C,GACtC3zC,MAAM,YAAYyiD,KAAW9O,EAAK1hC,wCAEpCkkC,cAAcxC,UACPuO,EAASvO,EAAK37C,KAmFjBwqD,CAAsB7xD,KAAK63C,MAAO73C,KAAK8wD,IAAIruD,MAC3CzC,KAAKyxD,cAAgB,KACrBzxD,KAAK2xD,cAAgB,MAEhB3rD,QAAQF,UAGjB2mD,iBAAiBsF,GACY,OAAvB/xD,KAAK2xD,eACPtiD,MAAM,eAAiB0iD,EAAU,4BAKvC,SAASC,qBACHxxC,iBAAiBG,0BACnBxV,KACE,iHAQU,SAAA8mD,kBACdD,qBACAj7C,sBAAsBm7C,gBAMR,SAAAC,mBACdH,qBACAxzC,oBAAoB0zC,gBACpBn7C,sBAAsBq7C,aAeR,SAAAC,YACdvB,EAAmBwB,IACnB/0C,GAEA,MAAMivC,EAAK+F,aAAazB,EAAK,YAAYl+C,aAAa,CACpD4/C,WAAYj1C,IAEd,IAAKivC,EAAGkF,iBAAkB,CACxB,MAAMe,EAAWztD,kCAAkC,YAC/CytD,GACFC,wBAAwBlG,KAAOiG,GAGnC,OAAOjG,EAcH,SAAUkG,wBACdlG,EACAtnD,EACAO,EACAoZ,EAEI,KAEJ2tC,EAAK5iD,mBAAmB4iD,IACrBC,iBAAiB,eAChBD,EAAGkF,kBACLriD,MACE,0EAIJ,MAAM2zC,EAAOwJ,EAAGiF,cAChB,IAAIkB,EACJ,GAAI3P,EAAK1hC,UAAU9M,UACbqK,EAAQ+zC,eACVvjD,MACE,sJAGJsjD,EAAgB,IAAI3+C,sBAAsBA,sBAAsBE,YAC3D,GAAI2K,EAAQ+zC,cAAe,CAChC,MAAM/rD,EAC6B,iBAA1BgY,EAAQ+zC,cACX/zC,EAAQ+zC,cCrRF,SAAAC,oBACdhsD,EACAqqD,GAEA,GAAIrqD,EAAMisD,IACR,MAAM,IAAI9zD,MACR,gHAIJ,MAKM+zD,EAAU7B,GAAa,eACvB8B,EAAMnsD,EAAMmsD,KAAO,EACnBC,EAAMpsD,EAAMosD,KAAOpsD,EAAMqsD,QAC/B,IAAKD,EACH,MAAM,IAAIj0D,MAAM,wDAGlB,MAAMolB,EAAO5gB,OAAA8gB,OAAA,CAEX6uC,IAAK,kCAAkCJ,IACvCK,IAAKL,EACLC,IAAAA,EACAK,IAAKL,EAAM,KACXM,UAAWN,EACXC,IAAAA,EACAC,QAASD,EACTM,SAAU,CACRC,iBAAkB,SAClBC,WAAY,KAIX5sD,GAKL,MAAO,CACLjE,8BAA8B2B,KAAKmC,UAjCtB,CACbgtD,IAAK,OACLzpD,KAAM,SAgCNrH,8BAA8B2B,KAAKmC,UAAU0d,IAH7B,IAKhB9iB,KAAK,KDwOCuxD,CAAoBh0C,EAAQ+zC,cAAepG,EAAGsE,IAAIjyC,QAAQqyC,WAChEyB,EAAgB,IAAI3+C,sBAAsBnN,IAjS9C,SAAS8sD,iCACP3Q,EACA99C,EACAO,EACAktD,GAEA3P,EAAK1hC,UAAY,IAAIlN,SACnB,GAAGlP,KAAQO,KACG,EACdu9C,EAAK1hC,UAAUhN,UACf0uC,EAAK1hC,UAAU/M,cACfyuC,EAAK1hC,UAAU9M,UACfwuC,EAAK1hC,UAAU7M,eACfuuC,EAAK1hC,UAAU5M,+BACM,GAGnBi+C,IACF3P,EAAKx4B,mBAAqBmoC,GAmR5BgB,CAAiC3Q,EAAM99C,EAAMO,EAAMktD,GAwB/C,SAAUiB,UAAUpH,IACxBA,EAAK5iD,mBAAmB4iD,IACrBC,iBAAiB,aACpBjH,cAAcgH,EAAG3U,OAcb,SAAUgc,SAASrH,IACvBA,EAAK5iD,mBAAmB4iD,IACrBC,iBAAiB,YPqahB,SAAUqH,WAAW9Q,GACrBA,EAAKF,uBACPE,EAAKF,sBAAsB3xB,OA7tBN,kBOuTvB2iC,CAAWtH,EAAG3U,OAmBA,SAAA9oC,cACdF,EACAI,GAEA8kD,gBAAkBllD,EAAQI,GE3a5B,MAAM+kD,EAAmB,CACvB,MAAO,aAQO,SAAAC,kBACd,OAAOD,EAUH,SAAUE,UAAU9iC,GACxB,MAAO,CACL,MAAO,CACL8iC,UAAa9iC,ICCN,MAAA+iC,kBAEX3xD,YAEW4xD,EAEAvK,GAFA7pD,KAASo0D,UAATA,EAEAp0D,KAAQ6pD,SAARA,EAIX2B,SACE,MAAO,CAAE4I,UAAWp0D,KAAKo0D,UAAWvK,SAAU7pD,KAAK6pD,SAAS2B,WAyC1D,SAAU6I,eACdvK,EAEAwK,EACAz1C,SAMA,GAJAirC,EAAMlgD,mBAAmBkgD,GAEzB9I,qBAAqB,wBAAyB8I,EAAIj9B,OAElC,YAAZi9B,EAAIziD,KAAiC,UAAZyiD,EAAIziD,IAC/B,KACE,iCAAmCyiD,EAAIziD,IAAM,0BAIjD,MAAMogD,EAAwC,QAAzBtiD,EAAA0Z,MAAAA,OAAA,EAAAA,EAAS4oC,oBAAgB,IAAAtiD,GAAAA,EACxCunB,EAAW,IAAI9mB,SAqBfkhD,EAAYuD,QAAQP,GAAK,SAW/B,OVmxBc,SAAAyK,qBACdvR,EACAp7B,EACA0sC,EACA/uC,EACAuhC,EACAW,GAEA/C,QAAQ1B,EAAM,kBAAoBp7B,GAGlC,MAAMo+B,EAA2B,CAC/Bp+B,KAAAA,EACA3e,OAAQqrD,EACR/uC,WAAAA,EAEAwI,OAAQ,KAGR85B,MAAOz5C,IAEPq5C,aAAAA,EAEAjB,WAAY,EAEZM,UAAAA,EAEAC,YAAa,KACbX,eAAgB,KAChBiB,qBAAsB,KACtBZ,yBAA0B,KAC1BI,8BAA+B,MAI3B2N,EAAe/O,mBAAmBzC,EAAMp7B,OAAMvkB,GACpD2iD,EAAYqB,qBAAuBmN,EACnC,MAAMxP,EAASgB,EAAY/8C,OAAOurD,EAAa1mD,OAC/C,QAAezK,IAAX2hD,EAEFgB,EAAYc,YACZd,EAAYS,yBAA2B,KACvCT,EAAYa,8BAAgC,KACxCb,EAAYzgC,YACdygC,EAAYzgC,WAAW,MAAM,EAAOygC,EAAYqB,0BAE7C,CACLrH,qBACE,qCACAgF,EACAgB,EAAYp+B,MAIdo+B,EAAYj4B,OAAM,EAClB,MAAM0mC,EAAY9V,YAAYqE,EAAKH,sBAAuBj7B,GACpDkgC,EAAYjJ,aAAa4V,IAAc,GAS7C,IAAIC,EARJ5M,EAAUzmD,KAAK2kD,GAEflH,aAAa2V,EAAW3M,GAQJ,iBAAX9C,GACI,OAAXA,GACA79C,SAAS69C,EAAQ,cAGjB0P,EAAkBltD,QAAQw9C,EAAe,aACzCpmD,OACEkhD,gBAAgB4U,GAChB,qHAOFA,GAFErY,+BAA+B2G,EAAKgB,gBAAiBp8B,IACrDoU,aAAanI,YACe0C,cAAczoB,MAG9C,MAAM8vC,EAAesG,yBAAyBlB,GACxCiC,EAAoBxuB,aAAauuB,EAAQ0P,GACzCviC,EAAUisB,6BACd6G,EACAuP,EACA5W,GAEFoI,EAAYS,yBAA2BxB,EACvCe,EAAYa,8BAAgC10B,EAC5C6zB,EAAYI,eAAiBtB,mBAAmB9B,GAEhD,MAAM7Z,EAASuP,2BACbsK,EAAKgB,gBACLp8B,EACAuK,EACA6zB,EAAYI,eACZJ,EAAYyB,cAEd1F,oCAAoCiB,EAAKN,YAAa96B,EAAMuhB,GAE5Dwc,0BAA0B3C,EAAMA,EAAKH,wBUr4BvC0R,CACEzK,EAAIjS,MACJiS,EAAIj9B,MACJynC,GAxBsB,CACtBrxD,EACAmxD,EACAviC,KAEA,IAAIi8B,EAAoC,KACpC7qD,EACFypB,EAAS7mB,OAAO5C,IAEhB6qD,EAAe,IAAI5B,aACjBr6B,EACA,IAAIs5B,cAAcrB,EAAIjS,MAAOiS,EAAIj9B,OACjC6L,GAEFhM,EAAS5mB,QAAQ,IAAIquD,kBAAkBC,EAAWtG,OAYpDhH,EACAW,GAGK/6B,EAAS3mB,QCpHjBqkB,qBAAqB9iB,UAAkBqtD,aAAe,SACrDrvC,EACAC,GAEAvlB,KAAKojB,YAAY,IAAK,CAAEhkB,EAAGkmB,GAAcC,IAI1C6E,qBAAqB9iB,UAAkBstD,KAAO,SAC7CjuD,EACAkuD,GAEA70D,KAAKojB,YAAY,OAAQ,CAAEpa,EAAGrC,GAAQkuD,IASjC,MAAMC,WAAa,SAAUC,GAClC,MAAMC,EAAS5qC,qBAAqB9iB,UAAU+d,IAY9C,OAXA+E,qBAAqB9iB,UAAU+d,IAAM,SACnCC,EACA3e,EACA4e,EACAC,QAEaniB,IAATmiB,IACFA,EAAOuvC,KAETC,EAAOztD,KAAKvH,KAAMslB,EAAY3e,EAAM4e,EAAYC,IAE3C,WACL4E,qBAAqB9iB,UAAU+d,IAAM2vC,IAU5BC,gBAAkB,SAAUA,IJqJnC,SAAUC,2BAA2BD,GACzCrE,EAAgBqE,EIrJhBC,CAA2BD,KC3CvB,SAAUE,iBAAiBC,GAC/BjpD,cAAcD,GACdmpD,EACE,IAAItrD,UACF,YACA,CAACqjD,GAAakI,mBAAoB/3C,KAIzBszC,2BAHKzD,EAAUmI,YAAY,OAAO3iD,eACpBw6C,EAAUmI,YAAY,iBAClBnI,EAAUmI,YAAY,sBAK7Ch4C,cAIJ/S,sBAAqB,IAEzBgrD,EAAgB/yD,UAAe2yD,GAE/BI,EAAgB/yD,UAAe,WCtBjC0yD","preExistingComment":"firebase-database.js.map"}