{"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/environment.ts","../util/src/defaults.ts","../util/src/deferred.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/util/NextPushId.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/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"],"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 Error();\n      }\n\n      const outByte1 = (byte1 << 2) | (byte2 >> 4);\n      output.push(outByte1);\n\n      if (byte3 !== 64) {\n        const outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n        output.push(outByte2);\n\n        if (byte4 !== 64) {\n          const outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n\n    return output;\n  },\n\n  /**\n   * Lazy static initialization function. Called before\n   * accessing any of the static map variables.\n   * @private\n   */\n  init_() {\n    if (!this.byteToCharMap_) {\n      this.byteToCharMap_ = {};\n      this.charToByteMap_ = {};\n      this.byteToCharMapWebSafe_ = {};\n      this.charToByteMapWebSafe_ = {};\n\n      // We want quick mappings back and forth, so we precompute two maps.\n      for (let i = 0; i < this.ENCODED_VALS.length; i++) {\n        this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n        this.charToByteMap_[this.byteToCharMap_[i]] = i;\n        this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n        this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n\n        // Be forgiving when decoding and correctly decode both encodings.\n        if (i >= this.ENCODED_VALS_BASE.length) {\n          this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n          this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n        }\n      }\n    }\n  }\n};\n\n/**\n * URL-safe base64 encoding\n */\nexport const base64Encode = function (str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  return base64.encodeByteArray(utf8Bytes, true);\n};\n\n/**\n * URL-safe base64 encoding (without \".\" padding in the end).\n * e.g. Used in JSON Web Token (JWT) parts.\n */\nexport const base64urlEncodeWithoutPadding = function (str: string): string {\n  // Use base64url encoding and remove padding in the end (dot characters).\n  return base64Encode(str).replace(/\\./g, '');\n};\n\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param str To be decoded\n * @return Decoded result, if possible\n */\nexport const base64Decode = function (str: string): string | null {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n","/**\n * @license\n * Copyright 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 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 * 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.\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\nexport function isNode(): boolean {\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  return typeof indexedDB === 'object';\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/**\n * Polyfill for `globalThis` object.\n * @returns the `globalThis` object for the given environment.\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 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 './environment';\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  [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 */\nconst getDefaultsFromEnvVariable = (): FirebaseDefaults | undefined => {\n  if (typeof process === 'undefined') {\n    return;\n  }\n  const defaultsJsonString = process.env.__FIREBASE_DEFAULTS__;\n  const defaultsJsonPath = process.env.__FIREBASE_DEFAULTS_PATH__;\n  if (defaultsJsonString) {\n    if (defaultsJsonPath) {\n      console.warn(\n        `Values were provided for both __FIREBASE_DEFAULTS__ ` +\n          `and __FIREBASE_DEFAULTS_PATH__. __FIREBASE_DEFAULTS_PATH__ ` +\n          `will be ignored.`\n      );\n    }\n    return JSON.parse(defaultsJsonString);\n  }\n  if (defaultsJsonPath && typeof require !== 'undefined') {\n    try {\n      // eslint-disable-next-line @typescript-eslint/no-require-imports\n      const json = require(defaultsJsonPath);\n      return json;\n    } catch (e) {\n      console.warn(\n        `Unable to read defaults from file provided to ` +\n          `__FIREBASE_DEFAULTS_PATH__: ${defaultsJsonPath}`\n      );\n    }\n  }\n};\n\nconst getDefaultsFromCookie = (): FirebaseDefaults | undefined => {\n  if (typeof document === 'undefined') {\n    return;\n  }\n  const match = document.cookie.match(/__FIREBASE_DEFAULTS__=([^;]+)/);\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 */\nconst getDefaults = (): FirebaseDefaults | undefined =>\n  getDefaultsFromGlobal() ||\n  getDefaultsFromEnvVariable() ||\n  getDefaultsFromCookie();\n\n/**\n * Returns emulator host stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @public\n */\nexport const getDefaultEmulatorHost = (\n  productName: string\n): string | undefined => getDefaults()?.emulatorHosts?.[productName];\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 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\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  ) {\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 innerHTML seems to be the easiest way to do this.\n      this.myIFrame.doc.body.innerHTML = '';\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        this.onHandshake_(\n          payload as {\n            ts: number;\n            v: string;\n            h: string;\n            s: string;\n          }\n        );\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 { 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 { 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  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  }\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    return (\n      this.index_.compare(this.getStartPost(), node) <= 0 &&\n      this.index_.compare(node, this.getEndPost()) <= 0\n    );\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  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  }\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          let inRange;\n          if (this.reverse_) {\n            inRange =\n              this.index_.compare(this.rangedFilter_.getStartPost(), next) <= 0;\n          } else {\n            inRange =\n              this.index_.compare(next, this.rangedFilter_.getEndPost()) <= 0;\n          }\n          if (inRange) {\n            filtered = filtered.updateImmediateChild(next.name, next.node);\n            count++;\n          } else {\n            // if we have reached the end post, we cannot keep adding elemments\n            break;\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        let startPost;\n        let endPost;\n        let cmp;\n        let iterator;\n        if (this.reverse_) {\n          iterator = filtered.getReverseIterator(this.index_);\n          startPost = this.rangedFilter_.getEndPost();\n          endPost = this.rangedFilter_.getStartPost();\n          const indexCompare = this.index_.getCompare();\n          cmp = (a: NamedNode, b: NamedNode) => indexCompare(b, a);\n        } else {\n          iterator = filtered.getIterator(this.index_);\n          startPost = this.rangedFilter_.getStartPost();\n          endPost = this.rangedFilter_.getEndPost();\n          cmp = this.index_.getCompare();\n        }\n\n        let count = 0;\n        let foundStartPost = false;\n        while (iterator.hasNext()) {\n          const next = iterator.getNext();\n          if (!foundStartPost && cmp(startPost, next) <= 0) {\n            // start adding\n            foundStartPost = true;\n          }\n          const inRange =\n            foundStartPost && count < this.limit_ && cmp(next, endPost) <= 0;\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","/**\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 { predecessor, successor } from '../util/NextPushId';\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_END_VALUE = 'ep',\n  INDEX_END_NAME = 'en',\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_AT = 'startAt',\n  END_AT = 'endAt',\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;\n  endSet_ = false;\n  endNameSet_ = false;\n  endBeforeSet_ = false;\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  hasStartAfter(): boolean {\n    return this.startAfterSet_;\n  }\n\n  hasEndBefore(): boolean {\n    return this.endBeforeSet_;\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.indexStartValue_ = this.indexStartValue_;\n    copy.startNameSet_ = this.startNameSet_;\n    copy.indexStartName_ = this.indexStartName_;\n    copy.endSet_ = this.endSet_;\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) {\n    if (typeof indexValue === 'string') {\n      indexValue = successor(indexValue as string);\n    }\n    params = queryParamsStartAt(queryParams, indexValue, key);\n  } else {\n    let childKey: string;\n    if (key == null) {\n      childKey = MAX_NAME;\n    } else {\n      childKey = successor(key);\n    }\n    params = queryParamsStartAt(queryParams, indexValue, childKey);\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 childKey: string;\n  let params: QueryParams;\n  if (queryParams.index_ === KEY_INDEX) {\n    if (typeof indexValue === 'string') {\n      indexValue = predecessor(indexValue as string);\n    }\n    params = queryParamsEndAt(queryParams, indexValue, key);\n  } else {\n    if (key == null) {\n      childKey = MIN_NAME;\n    } else {\n      childKey = predecessor(key);\n    }\n    params = queryParamsEndAt(queryParams, indexValue, childKey);\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    qs[REST_QUERY_CONSTANTS.START_AT] = stringify(queryParams.indexStartValue_);\n    if (queryParams.startNameSet_) {\n      qs[REST_QUERY_CONSTANTS.START_AT] +=\n        ',' + stringify(queryParams.indexStartName_);\n    }\n  }\n\n  if (queryParams.endSet_) {\n    qs[REST_QUERY_CONSTANTS.END_AT] = stringify(queryParams.indexEndValue_);\n    if (queryParams.endNameSet_) {\n      qs[REST_QUERY_CONSTANTS.END_AT] +=\n        ',' + 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  }\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  }\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\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 { 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 `DataSnapshot`.\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: DataSnapshot) => 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 *\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 * </br>See {@link ttps://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 lesss than or equal\n * to the specified value and a 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  getDefaultEmulatorHost\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  );\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  const databaseEmulatorHost = getDefaultEmulatorHost('database');\n  if (databaseEmulatorHost) {\n    const [host, port] = databaseEmulatorHost.split(':');\n    connectDatabaseEmulator(db, host, parseInt(port, 10));\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"],"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","base64Encode","utf8Bytes","base64urlEncodeWithoutPadding","replace","base64Decode","e","console","error","deepCopy","value","deepExtend","undefined","target","source","Object","constructor","Date","getTime","prop","hasOwnProperty","isMobileCordova","window","test","navigator","isNodeSdk","getDefaultsFromGlobal","self","global","getGlobal","__FIREBASE_DEFAULTS__","getDefaults","process","defaultsJsonString","env","defaultsJsonPath","__FIREBASE_DEFAULTS_PATH__","warn","JSON","parse","require","getDefaultsFromEnvVariable","document","match","cookie","decoded","getDefaultsFromCookie","Deferred","reject","resolve","promise","Promise","wrapCallback","callback","catch","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","name","instanceFactory","type","multipleInstances","serviceProps","instantiationMode","onInstanceCreated","setInstantiationMode","mode","setMultipleInstances","setServiceProps","props","setInstanceCreatedCallback","LogLevel","levelStringToEnum","debug","DEBUG","verbose","VERBOSE","info","INFO","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","_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","substring","each","doubleToIEEE754String","v","bias","s","ln","Infinity","Math","abs","pow","min","floor","LN2","round","bits","reverse","hexByteString","hexByte","parseInt","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","_a","addTokenListener","notifyForInvalidToken","FirebaseAuthTokenProvider","firebaseOptions_","authProvider_","auth_","onInit","auth","code","addAuthTokenListener","removeTokenChangeListener","removeAuthTokenListener","errorMessage","EmulatorTokenProvider","accessToken","OWNER","FORGE_DOMAIN_RE","RepoInfo","host","secure","namespace","webSocketOnly","nodeAdmin","persistenceKey","includeNamespaceInQueryParams","_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","innerHTML","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","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","timestamp","h","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","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","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","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","assign","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","defineProperties","MAX","setPriorityMaxNode","json","childData","children","childrenHavePriority","childSet","sortedChildSet","setNodeFromJSON","PathIndex","indexPath_","extractChild","snap","aChild","bChild","valueNode","VALUE_INDEX","PUSH_CHARS","nextPushId","lastPushTime","lastRandChars","duplicateTime","timeStampChars","successor","keyAsInt","sourcePlusOne","repeat","changeValue","snapshotNode","changeChildAdded","changeChildRemoved","changeChildChanged","oldSnap","IndexedFilter","index_","newChild","affectedPath","optChangeAccumulator","oldChild","trackChildChange","updateFullNode","newSnap","filtersNodes","getIndexedFilter","RangedFilter","indexedFilter_","startPost_","getStartPost_","endPost_","getEndPost_","getStartPost","getEndPost","matches","filtered","hasStart","startName","getIndexStartName","getIndexStartValue","hasEnd","endName","getIndexEndName","getIndexEndValue","LimitedFilter","rangedFilter_","limit_","getLimit","reverse_","isViewFromLeft","fullLimitUpdateChild_","inRange","indexCompare","foundStartPost","childKey","childSnap","changeAccumulator","oldEventCache","newChildNamedNode","windowBoundary","oldChildSnap","nextChild","getChildAfterChild","compareNext","newEventCache","QueryParams","limitSet_","startSet_","startNameSet_","startAfterSet_","endSet_","endNameSet_","endBeforeSet_","viewFrom_","indexStartValue_","indexStartName_","indexEndValue_","indexEndName_","hasStartAfter","hasEndBefore","hasLimit","hasAnchoredLimit","queryParamsStartAt","queryParams","newParams","queryParamsEndAt","queryParamsOrderBy","queryParamsToRestQueryStringParameters","qs","orderBy","queryParamsGetQueryObject","viewFrom","ReadonlyRestClient","listens_","listenId","getListenId_","thisListen","queryStringParameters","restRequest_","querystringParams","entries","forEach","arrayVal","encodeURIComponent","querystring","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","aWrapped","bWrapped","eventGeneratorCompareChanges","materializedChange","prevName","eventGeneratorMaterializeSingleChange","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_","visibleWrites","writeTreeLayerTree_","writeTreeDefaultFilter_","lastWriteId","writeTreeResetTree_","writeRecord","writes","treeRoot","writePath","deepNode","writeTreeCalcCompleteEventCache","treePath","completeServerCache","writeIdsToExclude","includeHiddenWrites","subMerge","writeTreeRefCalcCompleteEventCache","writeTreeRef","writeTreeRefCalcCompleteEventChildren","completeServerChildren","completeChildren","topLevelSet","writeTreeCalcCompleteEventChildren","writeTreeRefCalcEventCacheAfterServerOverwrite","existingEventSnap","existingServerSnap","childMerge","writeTreeCalcEventCacheAfterServerOverwrite","writeTreeRefShadowingWrite","writeTreeShadowingWrite","writeTreeRefCalcIndexedSlice","completeServerData","toIterate","nodes","writeTreeCalcIndexedSlice","writeTreeRefCalcCompleteChild","existingServerCache","writeTreeCalcCompleteChild","writeTreeRefChild","ChildChangeAccumulator","changeMap","oldChange","oldType","getChanges","from","NO_COMPLETE_CHILD_SOURCE","getCompleteChild","WriteTreeCompleteChildSource","writes_","viewCache_","optCompleteServerCache_","serverNode","viewProcessorApplyOperation","viewProcessor","oldViewCache","operation","writesCache","completeCache","accumulator","filterServerNode","overwrite","viewProcessorApplyUserOverwrite","viewProcessorApplyServerOverwrite","changedChildren","curViewCache","viewProcessorCacheHasChild","viewProcessorApplyUserMerge","viewProcessorApplyServerMerge","ackUserWrite","serverChildren","viewProcessorRevertUserWrite","ackPath","mergePath","serverCachePath","viewProcessorAckUserWrite","oldServerNode","viewProcessorGenerateEventCacheAfterServerEvent","viewProcessorListenComplete","isLeafOrEmpty","oldCompleteSnap","viewProcessorMaybeAddValueEvent","changePath","oldEventSnap","completeEventChildren","completeNode","oldEventNode","updatedPriority","childChangePath","newEventChild","eventChildUpdate","changedSnap","oldServerSnap","newServerCache","serverFilter","newServerNode","viewProcessorApplyMerge","viewMergeTree","childMergeTree","isUnknownDeepMerge","View","initialViewCache","eventRegistrations_","indexFilter","processor_","newViewProcessor","initialServerCache","initialEventCache","eventGenerator_","viewGetCompleteServerCache","view","cache","viewIsEmpty","viewRemoveEventRegistration","eventRegistration","cancelError","cancelEvents","maybeEvent","createCancelEvent","remaining","existing","hasAnyCallback","concat","viewApplyOperation","viewGenerateEventsForChanges_","eventRegistrations","moves","eventGeneratorGenerateEventsForChanges","referenceConstructor","SyncPoint","views","syncPointApplyOperation","syncPoint","optCompleteServerCache","syncPointGetView","serverCacheComplete","eventCacheComplete","syncPointAddEventRegistration","viewAddEventRegistration","initialChanges","viewGetInitialEvents","syncPointRemoveEventRegistration","removed","hadCompleteView","syncPointHasCompleteView","viewQueryId","_repo","syncPointGetQueryViews","syncPointGetCompleteServerCache","syncPointViewForQuery","syncPointGetCompleteView","syncPointViewExistsForQuery","syncTreeNextQueryTag_","SyncTree","listenProvider_","syncPointTree_","pendingWriteTree_","tagToQueryMap","queryToTagMap","syncTreeApplyUserOverwrite","syncTree","newData","writeTreeAddOverwrite","syncTreeApplyOperationToSyncPoints_","syncTreeApplyUserMerge","writeTreeAddMerge","changeTree","fromObject","syncTreeAckUserWrite","record","writeTreeGetWrite","syncTreeApplyServerOverwrite","syncTreeRemoveEventRegistration","skipListenerDedup","maybeSyncPoint","removedAndEvents","removingDefault","covered","parentSyncPoint","newViews","maybeChildSyncPoint","childMap","_key","childViews","syncTreeCollectDistinctViewsForSubTree_","newQuery","syncTreeCreateListenerForView_","startListening","syncTreeQueryForListening_","syncTreeTagForQuery","defaultTag","stopListening","queryToRemove","tagToRemove","syncTreeMakeQueryKey_","removedQuery","removedQueryKey","removedQueryTag","syncTreeRemoveTags_","syncTreeApplyTaggedQueryOverwrite","queryKey","syncTreeQueryKeyForTag_","syncTreeParseQueryKey_","queryPath","syncTreeApplyTaggedOperation_","syncTreeAddEventRegistration","skipSetupListener","foundAncestorDefaultView","pathToSyncPoint","sp","childSyncPoint","viewAlreadyExists","queriesToStop","childQueries","queryToStop","syncTreeSetupListener_","syncTreeCalcCompleteEventCache","syncTreeGetServerValue","serverCacheNode","viewGetCompleteNode","syncTreeApplyOperationHelper_","syncPointTree","syncTreeApplyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","viewGetServerCache","syncTreeApplyTaggedListenComplete","syncTreeApplyListenComplete","toUpperCase","errorForServerCode","splitIndex","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","childEmpty","treeIsEmpty","childExists","treeUpdateChild","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","isValidKey","isValidPathString","isValidPriority","validateFirebaseDataArg","validateFirebaseData","errorPrefixFxn","hasDotValue","hasActualChild","validationPathPush","last","validationPathPop","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","repoUpdateInfo","repoOnServerInfoUpdate","statsReporter_","creatorFunction","statsManagerGetOrCreateReporter","infoData_","infoSyncTree_","infoEvents","serverSyncTree_","repoServerTime","repoGenerateServerValues","taggedChildren","raw","syncTreeApplyTaggedQueryMerge","taggedSnap","syncTreeApplyServerMerge","repoRerunTransactions","repoLog","resolvedOnDisconnectTree","resolved","repoAbortTransactions","repoRunOnDisconnectEvents","repoGetNextWriteId","repoSetWithPriority","newVal","newNodeUnresolved","success","clearEvents","repoCallOnCompleteCallback","repoOnDisconnectCancel","repoOnDisconnectSet","repoRemoveEventCallbackForQuery","repoInterrupt","repoGetLatestState","excludeSets","repoSendReadyTransactions","repoPruneCompletedTransactionsBelowNode","queue","repoBuildTransactionQueue","every","transaction","setsToIgnore","txn","currentWriteId","latestState","snapToSend","latestHash","retryCount","currentOutputSnapshotRaw","dataToSend","pathToSend","callbacks","currentOutputSnapshotResolved","unwatcher","abortReason","repoSendTransactionQueue","rootMostTransactionNode","repoGetAncestorTransactionNode","abortTransaction","currentNode","currentInputSnapshot","newDataNode","oldWriteId","newNodeResolved","applyLocally","repoRerunTransactionQueue","transactionNode","transactionQueue","repoAggregateTransactionQueuesForNode","order","nodeQueue","to","treeForEachAncestor","repoAbortTransactionsOnNode","lastSent","parseRepoInfo","dataURL","parseDatabaseURL","scheme","subdomain","port","colonInd","slashInd","questionMarkInd","pathStringDecoded","piece","decodeURIComponent","decodePath","queryString","results","segment","kv","decodeQuery","hostWithoutPort","dotInd","DataEvent","snapshot","ref","getEventType","exportVal","CancelEvent","CallbackContext","snapshotCallback","cancelCallback","onValue","expDataSnapshot","previousChildName","onCancel","hasCancelCallback","userCallback","OnDisconnect","cancel","setWithPriority","repoOnDisconnectSetWithPriority","childrenToMerge","repoOnDisconnectUpdate","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","changedKey","changedValue","repoUpdate","callbackContext","container","ValueEventRegistration","cached","err","repoGetValue","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","newLimit","queryParamsLimitToFirst","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","appRepos","repoManagerCreateRepo","Database","_repoInternal","_instanceStarted","_rootInternal","_delete","appName","repoManagerDeleteRepo","apiName","checkTransportInit","forceWebSockets","forceDisallow","forceLongPolling","forceAllow","getDatabase","getApp","_getProvider","identifier","databaseEmulatorHost","productName","_b","emulatorHosts","connectDatabaseEmulator","tokenProvider","mockUserToken","uid","project","iat","sub","user_id","iss","aud","exp","auth_time","firebase","sign_in_provider","identities","alg","createMockUserToken","repoManagerApplyEmulatorSettings","goOffline","goOnline","enableLoggingImpl","SERVER_TIMESTAMP","serverTimestamp","increment","TransactionResult","committed","runTransaction","transactionUpdate","currentState","queueNode","priorityForNode","repoStartTransaction","simpleListen","echo","onEcho","hijackHash","newHash","oldPut","forceRestClient","repoManagerForceRestClient","variant","_registerComponent","instanceIdentifier","getProvider","registerVersion"],"mappings":"uHAqBa,MAAAA,GAQC,EARDA,EAaE,oBCZFC,EAAS,SAAUC,EAAoBC,GAClD,IAAKD,EACH,MAAME,EAAeD,IAOZC,EAAiB,SAAUD,GACtC,OAAO,IAAIE,MACT,sBACEL,EACA,6BACAG,ICnBAG,EAAoB,SAAUC,GAElC,MAAMC,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIH,EAAII,OAAQD,IAAK,CACnC,IAAIE,EAAIL,EAAIM,WAAWH,GACnBE,EAAI,IACNJ,EAAIC,KAAOG,EACFA,EAAI,MACbJ,EAAIC,KAAQG,GAAK,EAAK,IACtBJ,EAAIC,KAAY,GAAJG,EAAU,KAEL,QAAZ,MAAJA,IACDF,EAAI,EAAIH,EAAII,QACyB,QAAZ,MAAxBJ,EAAIM,WAAWH,EAAI,KAGpBE,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBL,EAAIM,aAAaH,IACvDF,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,GAAM,GAAM,IAC9BJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,MAEtBJ,EAAIC,KAAQG,GAAK,GAAM,IACvBJ,EAAIC,KAASG,GAAK,EAAK,GAAM,IAC7BJ,EAAIC,KAAY,GAAJG,EAAU,KAG1B,OAAOJ,GA6DIM,EAAiB,CAI5BC,eAAgB,KAKhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBACE,iEAKEC,mBACF,OAAOC,KAAKF,kBAAoB,OAM9BG,2BACF,OAAOD,KAAKF,kBAAoB,OAUlCI,mBAAoC,mBAATC,KAW3BC,gBAAgBC,EAA8BC,GAC5C,IAAKC,MAAMC,QAAQH,GACjB,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,EAAkBoB,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,MAAMtD,QAGR,MAAMiC,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,MAUvDkD,EAAe,SAAUrD,GACpC,MAAMsD,EAAYvD,EAAkBC,GACpC,OAAOO,EAAOW,gBAAgBoC,GAAW,IAO9BC,EAAgC,SAAUvD,GAErD,OAAOqD,EAAarD,GAAKwD,QAAQ,MAAO,KAY7BC,EAAe,SAAUzD,GACpC,IACE,OAAOO,EAAOgC,aAAavC,GAAK,GAChC,MAAO0D,GACPC,QAAQC,MAAM,wBAAyBF,GAEzC,OAAO,MC3VH,SAAUG,EAAYC,GAC1B,OAAOC,OAAWC,EAAWF,GAiBf,SAAAC,EAAWE,EAAiBC,GAC1C,KAAMA,aAAkBC,QACtB,OAAOD,EAGT,OAAQA,EAAOE,aACb,KAAKC,KAIH,OAAO,IAAIA,KADOH,EACQI,WAE5B,KAAKH,YACYH,IAAXC,IACFA,EAAS,IAEX,MACF,KAAK5C,MAEH4C,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,MAAMK,KAAQL,EAEZA,EAAOM,eAAeD,IAad,cAbmCA,IAG/CN,EAAmCM,GAAQR,EACzCE,EAAmCM,GACnCL,EAAmCK,KAIxC,OAAON,ECnCO,SAAAQ,IACd,MACoB,oBAAXC,WAGJA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDC,KAtB/B,oBAAdC,WAC2B,iBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,IA8FK,SAAAC,IACd,OAAkE,IAAzBpF,EC3E3C,MAAMqF,EAAwB,IDkJd,WACd,GAAoB,oBAATC,KACT,OAAOA,KAET,GAAsB,oBAAXL,OACT,OAAOA,OAET,GAAsB,oBAAXM,OACT,OAAOA,OAET,MAAM,IAAIlF,MAAM,mCC3JhBmF,GAAYC,sBAoDRC,EAAc,IAClBL,KA9CiC,MACjC,GAAuB,oBAAZM,QACT,OAEF,MAAMC,EAAqBD,QAAQE,IAAIJ,sBACjCK,EAAmBH,QAAQE,IAAIE,2BACrC,GAAIH,EAQF,OAPIE,GACF5B,QAAQ8B,KACN,mIAKGC,KAAKC,MAAMN,GAEpB,GAAIE,GAAuC,oBAAZK,QAC7B,IAGE,OADaA,QAAQL,GAErB,MAAO7B,GACPC,QAAQ8B,KAEJ,6EAA+BF,OAuBvCM,IAjB4B,MAC5B,GAAwB,oBAAbC,SACT,OAEF,MAAMC,EAAQD,SAASE,OAAOD,MAAM,iCAC9BE,EAAUF,GAAStC,EAAasC,EAAM,IAC5C,OAAOE,GAAWP,KAAKC,MAAMM,IAY7BC,GCzFW,MAAAC,EAIX/B,cAFAtD,KAAAsF,OAAoC,OACpCtF,KAAAuF,QAAqC,OAEnCvF,KAAKwF,QAAU,IAAIC,SAAQ,CAACF,EAASD,KACnCtF,KAAKuF,QAAUA,EACfvF,KAAKsF,OAASA,KASlBI,aACEC,GAEA,MAAO,CAAC7C,EAAOE,KACTF,EACF9C,KAAKsF,OAAOxC,GAEZ9C,KAAKuF,QAAQvC,GAES,mBAAb2C,IAGT3F,KAAKwF,QAAQI,OAAM,SAIK,IAApBD,EAASrG,OACXqG,EAAS7C,GAET6C,EAAS7C,EAAOE,MC7BpB,SAAU6C,EAAS3G,GACvB,OAAO0F,KAAKC,MAAM3F,GAQd,SAAU4G,EAAUC,GACxB,OAAOnB,KAAKkB,UAAUC,GCKjB,MAAMC,EAAS,SAAUC,GAC9B,IAAIC,EAAS,GACXC,EAAiB,GACjBJ,EAAO,GACPK,EAAY,GAEd,IACE,MAAMC,EAAQJ,EAAMK,MAAM,KAC1BJ,EAASL,EAASlD,EAAa0D,EAAM,KAAO,IAC5CF,EAASN,EAASlD,EAAa0D,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBN,EAAOI,EAAU,GAAK,UACfA,EAAU,EACjB,MAAOvD,IAET,MAAO,CACLsD,OAAAA,EACAC,OAAAA,EACAJ,KAAAA,EACAK,UAAAA,ICxCY,SAAAG,EAA2BC,EAAQC,GACjD,OAAOpD,OAAOqD,UAAUhD,eAAeiD,KAAKH,EAAKC,GAGnC,SAAAG,EACdJ,EACAC,GAEA,OAAIpD,OAAOqD,UAAUhD,eAAeiD,KAAKH,EAAKC,GACrCD,EAAIC,QAEX,EAIE,SAAUI,EAAQL,GACtB,IAAK,MAAMC,KAAOD,EAChB,GAAInD,OAAOqD,UAAUhD,eAAeiD,KAAKH,EAAKC,GAC5C,OAAO,EAGX,OAAO,EAGO,SAAAK,EACdN,EACAO,EACAC,GAEA,MAAMC,EAAkC,GACxC,IAAK,MAAMR,KAAOD,EACZnD,OAAOqD,UAAUhD,eAAeiD,KAAKH,EAAKC,KAC5CQ,EAAIR,GAAOM,EAAGJ,KAAKK,EAAYR,EAAIC,GAAMA,EAAKD,IAGlD,OAAOS,ECXI,MAAAC,EAuCX5D,cAjCQtD,KAAMmH,OAAa,GAMnBnH,KAAIoH,KAAa,GAOjBpH,KAAEqH,GAAa,GAMfrH,KAAIsH,KAAa,GAKjBtH,KAAMuH,OAAW,EAKjBvH,KAAMwH,OAAW,EAKvBxH,KAAKyH,UAAY,GAEjBzH,KAAKsH,KAAK,GAAK,IACf,IAAK,IAAIjI,EAAI,EAAGA,EAAIW,KAAKyH,YAAapI,EACpCW,KAAKsH,KAAKjI,GAAK,EAGjBW,KAAK0H,QAGPA,QACE1H,KAAKmH,OAAO,GAAK,WACjBnH,KAAKmH,OAAO,GAAK,WACjBnH,KAAKmH,OAAO,GAAK,WACjBnH,KAAKmH,OAAO,GAAK,UACjBnH,KAAKmH,OAAO,GAAK,WAEjBnH,KAAKuH,OAAS,EACdvH,KAAKwH,OAAS,EAShBG,UAAUC,EAAqCC,GACxCA,IACHA,EAAS,GAGX,MAAMC,EAAI9H,KAAKqH,GAGf,GAAmB,iBAARO,EACT,IAAK,IAAIvI,EAAI,EAAGA,EAAI,GAAIA,IAStByI,EAAEzI,GACCuI,EAAIpI,WAAWqI,IAAW,GAC1BD,EAAIpI,WAAWqI,EAAS,IAAM,GAC9BD,EAAIpI,WAAWqI,EAAS,IAAM,EAC/BD,EAAIpI,WAAWqI,EAAS,GAC1BA,GAAU,OAGZ,IAAK,IAAIxI,EAAI,EAAGA,EAAI,GAAIA,IACtByI,EAAEzI,GACCuI,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAAK,IAAIxI,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,MAAM0I,EAAID,EAAEzI,EAAI,GAAKyI,EAAEzI,EAAI,GAAKyI,EAAEzI,EAAI,IAAMyI,EAAEzI,EAAI,IAClDyI,EAAEzI,GAA+B,YAAxB0I,GAAK,EAAMA,IAAM,IAG5B,IAKIC,EAAGC,EALHC,EAAIlI,KAAKmH,OAAO,GAChBgB,EAAInI,KAAKmH,OAAO,GAChB5H,EAAIS,KAAKmH,OAAO,GAChBiB,EAAIpI,KAAKmH,OAAO,GAChBvE,EAAI5C,KAAKmH,OAAO,GAIpB,IAAK,IAAI9H,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACvBA,EAAI,GACFA,EAAI,IACN2I,EAAII,EAAKD,GAAK5I,EAAI6I,GAClBH,EAAI,aAEJD,EAAIG,EAAI5I,EAAI6I,EACZH,EAAI,YAGF5I,EAAI,IACN2I,EAAKG,EAAI5I,EAAM6I,GAAKD,EAAI5I,GACxB0I,EAAI,aAEJD,EAAIG,EAAI5I,EAAI6I,EACZH,EAAI,YAIR,MAAMF,GAAOG,GAAK,EAAMA,IAAM,IAAOF,EAAIpF,EAAIqF,EAAIH,EAAEzI,GAAM,WACzDuD,EAAIwF,EACJA,EAAI7I,EACJA,EAA8B,YAAxB4I,GAAK,GAAOA,IAAM,GACxBA,EAAID,EACJA,EAAIH,EAGN/H,KAAKmH,OAAO,GAAMnH,KAAKmH,OAAO,GAAKe,EAAK,WACxClI,KAAKmH,OAAO,GAAMnH,KAAKmH,OAAO,GAAKgB,EAAK,WACxCnI,KAAKmH,OAAO,GAAMnH,KAAKmH,OAAO,GAAK5H,EAAK,WACxCS,KAAKmH,OAAO,GAAMnH,KAAKmH,OAAO,GAAKiB,EAAK,WACxCpI,KAAKmH,OAAO,GAAMnH,KAAKmH,OAAO,GAAKvE,EAAK,WAG1CyF,OAAO3G,EAAwCpC,GAE7C,GAAa,MAAToC,EACF,YAGawB,IAAX5D,IACFA,EAASoC,EAAMpC,QAGjB,MAAMgJ,EAAmBhJ,EAASU,KAAKyH,UACvC,IAAIc,EAAI,EAER,MAAMX,EAAM5H,KAAKoH,KACjB,IAAIoB,EAAQxI,KAAKuH,OAGjB,KAAOgB,EAAIjJ,GAAQ,CAKjB,GAAc,IAAVkJ,EACF,KAAOD,GAAKD,GACVtI,KAAK2H,UAAUjG,EAAO6G,GACtBA,GAAKvI,KAAKyH,UAId,GAAqB,iBAAV/F,GACT,KAAO6G,EAAIjJ,GAIT,GAHAsI,EAAIY,GAAS9G,EAAMlC,WAAW+I,KAC5BC,IACAD,EACEC,IAAUxI,KAAKyH,UAAW,CAC5BzH,KAAK2H,UAAUC,GACfY,EAAQ,EAER,YAIJ,KAAOD,EAAIjJ,GAIT,GAHAsI,EAAIY,GAAS9G,EAAM6G,KACjBC,IACAD,EACEC,IAAUxI,KAAKyH,UAAW,CAC5BzH,KAAK2H,UAAUC,GACfY,EAAQ,EAER,OAMRxI,KAAKuH,OAASiB,EACdxI,KAAKwH,QAAUlI,EAIjBmJ,SACE,MAAMA,EAAmB,GACzB,IAAIC,EAA0B,EAAd1I,KAAKwH,OAGjBxH,KAAKuH,OAAS,GAChBvH,KAAKqI,OAAOrI,KAAKsH,KAAM,GAAKtH,KAAKuH,QAEjCvH,KAAKqI,OAAOrI,KAAKsH,KAAMtH,KAAKyH,WAAazH,KAAKuH,OAAS,KAIzD,IAAK,IAAIlI,EAAIW,KAAKyH,UAAY,EAAGpI,GAAK,GAAIA,IACxCW,KAAKoH,KAAK/H,GAAiB,IAAZqJ,EACfA,GAAa,IAGf1I,KAAK2H,UAAU3H,KAAKoH,MAEpB,IAAImB,EAAI,EACR,IAAK,IAAIlJ,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIsJ,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BF,EAAOF,GAAMvI,KAAKmH,OAAO9H,IAAMsJ,EAAK,MAClCJ,EAGN,OAAOE,GC7NK,SAAAG,EAAYC,EAAgBC,GAC1C,MAAO,GAAGD,aAAkBC,cCzBvB,MAuCMC,EAAe,SAAU7J,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,SAAU4J,EACdC,GAEA,OAAIA,GAAYA,EAA+BC,UACrCD,EAA+BC,UAEhCD,ECCE,MAAAE,EAiBX7F,YACW8F,EACAC,EACAC,GAFAtJ,KAAIoJ,KAAJA,EACApJ,KAAeqJ,gBAAfA,EACArJ,KAAIsJ,KAAJA,EAnBXtJ,KAAiBuJ,mBAAG,EAIpBvJ,KAAYwJ,aAAe,GAE3BxJ,KAAAyJ,kBAA2C,OAE3CzJ,KAAiB0J,kBAAwC,KAczDC,qBAAqBC,GAEnB,OADA5J,KAAKyJ,kBAAoBG,EAClB5J,KAGT6J,qBAAqBN,GAEnB,OADAvJ,KAAKuJ,kBAAoBA,EAClBvJ,KAGT8J,gBAAgBC,GAEd,OADA/J,KAAKwJ,aAAeO,EACb/J,KAGTgK,2BAA2BrE,GAEzB,OADA3F,KAAK0J,kBAAoB/D,EAClB3F,UCdCiK,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,QACpBC,KAAQN,EAASO,KACjB7F,KAAQsF,EAASQ,KACjB3H,MAASmH,EAASS,MAClBC,OAAUV,EAASW,QAMfC,EAA4BZ,EAASO,KAmBrCM,EAAgB,CACpB,CAACb,EAASG,OAAQ,MAClB,CAACH,EAASK,SAAU,MACpB,CAACL,EAASO,MAAO,OACjB,CAACP,EAASQ,MAAO,OACjB,CAACR,EAASS,OAAQ,SAQdK,EAAgC,CAACC,EAAUC,KAAYC,KAC3D,GAAID,EAAUD,EAASG,SACrB,OAEF,MAAMC,GAAM,IAAI7H,MAAO8H,cACjBC,EAASR,EAAcG,GAC7B,IAAIK,EAMF,MAAM,IAAItM,MACR,8DAA8DiM,MANhEpI,QAAQyI,GACN,IAAIF,OAASJ,EAAS5B,WACnB8B,iCClGF,IAAIK,EAAc,GAMnB,SAAUC,EAAcC,GAC5BF,EAAcE,ECGH,MAAAC,EAOXpI,YAAoBqI,GAAA3L,KAAW2L,YAAXA,EALZ3L,KAAO4L,QAAG,YAWlBC,IAAIpF,EAAazD,GACF,MAATA,EACFhD,KAAK2L,YAAYG,WAAW9L,KAAK+L,cAActF,IAE/CzG,KAAK2L,YAAYK,QAAQhM,KAAK+L,cAActF,GAAMX,EAAU9C,IAOhEiJ,IAAIxF,GACF,MAAMyF,EAAYlM,KAAK2L,YAAYQ,QAAQnM,KAAK+L,cAActF,IAC9D,OAAiB,MAAbyF,EACK,KAEArG,EAASqG,GAIpBE,OAAO3F,GACLzG,KAAK2L,YAAYG,WAAW9L,KAAK+L,cAActF,IAKjDsF,cAAc3C,GACZ,OAAOpJ,KAAK4L,QAAUxC,EAGxBiD,WACE,OAAOrM,KAAK2L,YAAYU,YCjDf,MAAAC,EAAbhJ,cACUtD,KAAMuM,OAA6B,GAqB3CvM,KAAiBwM,mBAAG,EAnBpBX,IAAIpF,EAAazD,GACF,MAATA,SACKhD,KAAKuM,OAAO9F,GAEnBzG,KAAKuM,OAAO9F,GAAOzD,EAIvBiJ,IAAIxF,GACF,OAAIF,EAASvG,KAAKuM,OAAQ9F,GACjBzG,KAAKuM,OAAO9F,GAEd,KAGT2F,OAAO3F,UACEzG,KAAKuM,OAAO9F,ICXvB,MAAMgG,EAAmB,SACvBC,GAEA,IAGE,GACoB,oBAAX9I,aAC2B,IAA3BA,OAAO8I,GACd,CAEA,MAAMC,EAAa/I,OAAO8I,GAG1B,OAFAC,EAAWX,QAAQ,oBAAqB,SACxCW,EAAWb,WAAW,qBACf,IAAIJ,EAAkBiB,IAE/B,MAAO/J,IAIT,OAAO,IAAI0J,GAIAM,EAAoBH,EAAiB,gBAGrCI,EAAiBJ,EAAiB,kBCxBzCK,EAAY,IL2FL,MAOXxJ,YAAmB8F,GAAApJ,KAAIoJ,KAAJA,EAUXpJ,KAAS+M,UAAGlC,EAsBZ7K,KAAWgN,YAAejC,EAc1B/K,KAAeiN,gBAAsB,KAlCzC9B,eACF,OAAOnL,KAAK+M,UAGV5B,aAAS+B,GACX,KAAMA,KAAOjD,GACX,MAAM,IAAIkD,UAAU,kBAAkBD,+BAExClN,KAAK+M,UAAYG,EAInBE,YAAYF,GACVlN,KAAK+M,UAA2B,iBAARG,EAAmBhD,EAAkBgD,GAAOA,EAQlEG,iBACF,OAAOrN,KAAKgN,YAEVK,eAAWH,GACb,GAAmB,mBAARA,EACT,MAAM,IAAIC,UAAU,qDAEtBnN,KAAKgN,YAAcE,EAOjBI,qBACF,OAAOtN,KAAKiN,gBAEVK,mBAAeJ,GACjBlN,KAAKiN,gBAAkBC,EAOzB/C,SAASe,GACPlL,KAAKiN,iBAAmBjN,KAAKiN,gBAAgBjN,KAAMiK,EAASG,SAAUc,GACtElL,KAAKgN,YAAYhN,KAAMiK,EAASG,SAAUc,GAE5CqC,OAAOrC,GACLlL,KAAKiN,iBACHjN,KAAKiN,gBAAgBjN,KAAMiK,EAASK,WAAYY,GAClDlL,KAAKgN,YAAYhN,KAAMiK,EAASK,WAAYY,GAE9CX,QAAQW,GACNlL,KAAKiN,iBAAmBjN,KAAKiN,gBAAgBjN,KAAMiK,EAASO,QAASU,GACrElL,KAAKgN,YAAYhN,KAAMiK,EAASO,QAASU,GAE3CvG,QAAQuG,GACNlL,KAAKiN,iBAAmBjN,KAAKiN,gBAAgBjN,KAAMiK,EAASQ,QAASS,GACrElL,KAAKgN,YAAYhN,KAAMiK,EAASQ,QAASS,GAE3CpI,SAASoI,GACPlL,KAAKiN,iBAAmBjN,KAAKiN,gBAAgBjN,KAAMiK,EAASS,SAAUQ,GACtElL,KAAKgN,YAAYhN,KAAMiK,EAASS,SAAUQ,KK/KjB,sBAKhBsC,EAA8B,WACzC,IAAIC,EAAK,EACT,OAAO,WACL,OAAOA,KAHgC,GAY9BC,EAAO,SAAUxO,GAC5B,MAAMsD,ERlByB,SAAUtD,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,MAAMoO,EAAOpO,EAAI,MACjBF,IACAT,EAAOS,EAAIH,EAAII,OAAQ,2CAEvBC,EAAI,OAAWoO,GAAQ,KADXzO,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,GAC9BwO,EAAO,IAAIxG,EACjBwG,EAAKrF,OAAO7F,GACZ,MAAMoL,EAAYF,EAAKjF,SACvB,OAAOhJ,EAAOW,gBAAgBwN,IAG1BC,EAAmB,YAAaC,GACpC,IAAIhP,EAAU,GACd,IAAK,IAAIO,EAAI,EAAGA,EAAIyO,EAAQxO,OAAQD,IAAK,CACvC,MAAM0O,EAAMD,EAAQzO,GAElBkB,MAAMC,QAAQuN,IACbA,GACgB,iBAARA,GAEwB,iBAAvBA,EAAYzO,OAEtBR,GAAW+O,EAAiBG,MAAM,KAAMD,GAExCjP,GADwB,iBAARiP,EACLjI,EAAUiI,GAEVA,EAEbjP,GAAW,IAGb,OAAOA,GAMF,IAAImP,EAAuC,KAK9CC,GAAY,EAOT,MAAMC,EAAgB,SAC3BC,EACAC,GAEAzP,GACGyP,IAA0B,IAAZD,IAAgC,IAAZA,EACnC,+CAEc,IAAZA,GACFtB,EAAU3B,SAAWlB,EAASK,QAC9B2D,EAASnB,EAAUS,IAAIe,KAAKxB,GACxBuB,GACFxB,EAAehB,IAAI,mBAAmB,IAEZ,mBAAZuC,EAChBH,EAASG,GAETH,EAAS,KACTpB,EAAeT,OAAO,qBAIbmB,EAAM,YAAaO,GAQ9B,IAPkB,IAAdI,IACFA,GAAY,EACG,OAAXD,IAA6D,IAA1CpB,EAAeZ,IAAI,oBACxCkC,GAAc,IAIdF,EAAQ,CACV,MAAMnP,EAAU+O,EAAiBG,MAAM,KAAMF,GAC7CG,EAAOnP,KAIEyP,GAAa,SACxBC,GAEA,OAAO,YAAaV,GAClBP,EAAIiB,KAAWV,KAINhL,GAAQ,YAAagL,GAChC,MAAMhP,EAAU,4BAA8B+O,KAAoBC,GAClEhB,EAAUhK,MAAMhE,IAGL2P,GAAQ,YAAaX,GAChC,MAAMhP,EAAU,yBAAyB+O,KAAoBC,KAE7D,MADAhB,EAAUhK,MAAMhE,GACV,IAAIE,MAAMF,IAGL6F,GAAO,YAAamJ,GAC/B,MAAMhP,EAAU,qBAAuB+O,KAAoBC,GAC3DhB,EAAUnI,KAAK7F,IAiCJ4P,GAAsB,SAAU3I,GAC3C,MACkB,iBAATA,IACNA,GAASA,GACRA,IAAS4I,OAAOC,mBAChB7I,IAAS4I,OAAOE,oBAmDTC,GAAW,aAKXC,GAAW,aAKXC,GAAc,SAAU9G,EAAWC,GAC9C,GAAID,IAAMC,EACR,OAAO,EACF,GAAID,IAAM4G,IAAY3G,IAAM4G,GACjC,OAAQ,EACH,GAAI5G,IAAM2G,IAAY5G,IAAM6G,GACjC,OAAO,EACF,CACL,MAAME,EAASC,GAAYhH,GACzBiH,EAASD,GAAY/G,GAEvB,OAAe,OAAX8G,EACa,OAAXE,EACKF,EAASE,GAAW,EAAIjH,EAAE5I,OAAS6I,EAAE7I,OAAS2P,EAASE,GAEtD,EAEU,OAAXA,EACF,EAEAjH,EAAIC,GAAK,EAAI,IAQbiH,GAAgB,SAAUlH,EAAWC,GAChD,OAAID,IAAMC,EACD,EACED,EAAIC,GACL,EAED,GAIEkH,GAAa,SACxB5I,EACAD,GAEA,GAAIA,GAAOC,KAAOD,EAChB,OAAOA,EAAIC,GAEX,MAAM,IAAIzH,MACR,yBAA2ByH,EAAM,gBAAkBX,EAAUU,KAKtD8I,GAAoB,SAAU9I,GACzC,GAAmB,iBAARA,GAA4B,OAARA,EAC7B,OAAOV,EAAUU,GAGnB,MAAM+I,EAAO,GAEb,IAAK,MAAMtH,KAAKzB,EACd+I,EAAKlO,KAAK4G,GAIZsH,EAAKC,OACL,IAAI/I,EAAM,IACV,IAAK,IAAIpH,EAAI,EAAGA,EAAIkQ,EAAKjQ,OAAQD,IACrB,IAANA,IACFoH,GAAO,KAETA,GAAOX,EAAUyJ,EAAKlQ,IACtBoH,GAAO,IACPA,GAAO6I,GAAkB9I,EAAI+I,EAAKlQ,KAIpC,OADAoH,GAAO,IACAA,GASIgJ,GAAoB,SAC/BvQ,EACAwQ,GAEA,MAAMC,EAAMzQ,EAAII,OAEhB,GAAIqQ,GAAOD,EACT,MAAO,CAACxQ,GAGV,MAAM0Q,EAAW,GACjB,IAAK,IAAIrQ,EAAI,EAAGA,EAAIoQ,EAAKpQ,GAAKmQ,EACxBnQ,EAAImQ,EAAUC,EAChBC,EAASvO,KAAKnC,EAAI2Q,UAAUtQ,EAAGoQ,IAE/BC,EAASvO,KAAKnC,EAAI2Q,UAAUtQ,EAAGA,EAAImQ,IAGvC,OAAOE,GASO,SAAAE,GAAKtJ,EAAaO,GAChC,IAAK,MAAMN,KAAOD,EACZA,EAAI9C,eAAe+C,IACrBM,EAAGN,EAAKD,EAAIC,IAyBX,MAAMsJ,GAAwB,SAAUC,GAC7CpR,GAAQ8P,GAAoBsB,GAAI,uBAEhC,MAEMC,EAAO,KACb,IAAIC,EAAGtN,EAAGoF,EAAGmI,EAAI9Q,EAIP,IAAN2Q,GACFpN,EAAI,EACJoF,EAAI,EACJkI,EAAI,EAAIF,IAAOI,EAAAA,EAAW,EAAI,IAE9BF,EAAIF,EAAI,GACRA,EAAIK,KAAKC,IAAIN,KAEJK,KAAKE,IAAI,GAAG,OAEnBJ,EAAKE,KAAKG,IAAIH,KAAKI,MAAMJ,KAAK9C,IAAIyC,GAAKK,KAAKK,KAAMT,GAClDrN,EAAIuN,EAAKF,EACTjI,EAAIqI,KAAKM,MAAMX,EAAIK,KAAKE,IAAI,EAlBtB,GAkBiCJ,GAAME,KAAKE,IAAI,EAlBhD,OAqBN3N,EAAI,EACJoF,EAAIqI,KAAKM,MAAMX,EAAIK,KAAKE,IAAI,GAAG,SAKnC,MAAMK,EAAO,GACb,IAAKvR,EA5BK,GA4BMA,EAAGA,GAAK,EACtBuR,EAAKvP,KAAK2G,EAAI,EAAI,EAAI,GACtBA,EAAIqI,KAAKI,MAAMzI,EAAI,GAErB,IAAK3I,EAjCS,GAiCEA,EAAGA,GAAK,EACtBuR,EAAKvP,KAAKuB,EAAI,EAAI,EAAI,GACtBA,EAAIyN,KAAKI,MAAM7N,EAAI,GAErBgO,EAAKvP,KAAK6O,EAAI,EAAI,GAClBU,EAAKC,UACL,MAAM3R,EAAM0R,EAAKtP,KAAK,IAGtB,IAAIwP,EAAgB,GACpB,IAAKzR,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAI0R,EAAUC,SAAS9R,EAAI+R,OAAO5R,EAAG,GAAI,GAAGgN,SAAS,IAC9B,IAAnB0E,EAAQzR,SACVyR,EAAU,IAAMA,GAElBD,GAAgCC,EAElC,OAAOD,EAAcI,eAkDhB,MAAMC,GAAkB,IAAIC,OAAO,qBAe7BlC,GAAc,SAAUhQ,GACnC,GAAIiS,GAAgBtN,KAAK3E,GAAM,CAC7B,MAAMmS,EAAS1C,OAAOzP,GACtB,GAAImS,IAbsB,YAaMA,GARN,WASxB,OAAOA,EAGX,OAAO,MAoBIC,GAAiB,SAAUvK,GACtC,IACEA,IACA,MAAOnE,GAEP2O,YAAW,KAKT,MAAMC,EAAQ5O,EAAE4O,OAAS,GAEzB,MADA7M,GAAK,yCAA0C6M,GACzC5O,IACLyN,KAAKI,MAAM,MAiELgB,GAAwB,SACnC1K,EACA2K,GAEA,MAAMC,EAA2BJ,WAAWxK,EAAI2K,GAiBhD,MAdqB,iBAAZC,GAES,oBAATC,MAEPA,KAAiB,WAGjBA,KAAKC,WAAWF,GAEY,iBAAZA,GAAyBA,EAAuB,OAE/DA,EAAuB,QAGnBA,GC9lBI,MAAAG,GAEXxO,YACUyO,EACAC,GADAhS,KAAQ+R,SAARA,EACA/R,KAAgBgS,iBAAhBA,EAERhS,KAAKiS,SAAWD,MAAAA,OAAA,EAAAA,EAAkBE,aAAa,CAAEC,UAAU,IACtDnS,KAAKiS,UACRD,MAAAA,GAAAA,EAAkB/F,MAAMmG,MAAKH,GAAajS,KAAKiS,SAAWA,IAI9DI,SAASC,GACP,OAAKtS,KAAKiS,SAeHjS,KAAKiS,SAASI,SAASC,GAdrB,IAAI7M,SAA6B,CAACF,EAASD,KAKhDiM,YAAW,KACLvR,KAAKiS,SACPjS,KAAKqS,SAASC,GAAcF,KAAK7M,EAASD,GAE1CC,EAAQ,QAET,MAMTgN,uBAAuBC,SACA,QAArBC,EAAAzS,KAAKgS,wBAAgB,IAAAS,GAAAA,EACjBxG,MACDmG,MAAKH,GAAYA,EAASS,iBAAiBF,KAGhDG,wBACEhO,GACE,oDAAoD3E,KAAK+R,0FCjClD,MAAAa,GAGXtP,YACUyO,EACAc,EACAC,GAFA9S,KAAQ+R,SAARA,EACA/R,KAAgB6S,iBAAhBA,EACA7S,KAAa8S,cAAbA,EALF9S,KAAK+S,MAAgC,KAO3C/S,KAAK+S,MAAQD,EAAcZ,aAAa,CAAEC,UAAU,IAC/CnS,KAAK+S,OACRD,EAAcE,QAAOC,GAASjT,KAAK+S,MAAQE,IAI/CZ,SAASC,GACP,OAAKtS,KAAK+S,MAgBH/S,KAAK+S,MAAMV,SAASC,GAAc1M,OAAM9C,GAGzCA,GAAwB,+BAAfA,EAAMoQ,MACjB3F,EAAI,kEACG,MAEA9H,QAAQH,OAAOxC,KAtBjB,IAAI2C,SAA+B,CAACF,EAASD,KAKlDiM,YAAW,KACLvR,KAAK+S,MACP/S,KAAKqS,SAASC,GAAcF,KAAK7M,EAASD,GAE1CC,EAAQ,QAET,MAgBTgN,uBAAuBC,GAGjBxS,KAAK+S,MACP/S,KAAK+S,MAAMI,qBAAqBX,GAEhCxS,KAAK8S,cACF7G,MACAmG,MAAKa,GAAQA,EAAKE,qBAAqBX,KAI9CY,0BAA0BZ,GACxBxS,KAAK8S,cACF7G,MACAmG,MAAKa,GAAQA,EAAKI,wBAAwBb,KAG/CG,wBACE,IAAIW,EACF,0DACAtT,KAAK+R,SADL,iFAIE,eAAgB/R,KAAK6S,iBACvBS,GACE,uJAGO,mBAAoBtT,KAAK6S,iBAClCS,GACE,2JAIFA,GACE,kKAIJ3O,GAAK2O,IAKI,MAAAC,GAIXjQ,YAAoBkQ,GAAAxT,KAAWwT,YAAXA,EAEpBnB,SAASC,GACP,OAAO7M,QAAQF,QAAQ,CACrBiO,YAAaxT,KAAKwT,cAItBjB,uBAAuBC,GAGrBA,EAASxS,KAAKwT,aAGhBJ,0BAA0BZ,IAE1BG,0BAlBOY,GAAKE,MAAG,QC7GV,MAYMC,GACX,6ECHW,MAAAC,GAaXrQ,YACEsQ,EACgBC,EACAC,EACAC,EACAC,GAAqB,EACrBC,EAAyB,GACzBC,GAAyC,GALzClU,KAAM6T,OAANA,EACA7T,KAAS8T,UAATA,EACA9T,KAAa+T,cAAbA,EACA/T,KAASgU,UAATA,EACAhU,KAAciU,eAAdA,EACAjU,KAA6BkU,8BAA7BA,EAEhBlU,KAAKmU,MAAQP,EAAK1C,cAClBlR,KAAKoU,QAAUpU,KAAKmU,MAAMlD,OAAOjR,KAAKmU,MAAME,QAAQ,KAAO,GAC3DrU,KAAKsU,aACF1H,EAAkBX,IAAI,QAAU2H,IAAoB5T,KAAKmU,MAG9DI,kBACE,MAA0C,OAAnCvU,KAAKsU,aAAarD,OAAO,EAAG,GAGrCuD,eACE,MACmB,mBAAjBxU,KAAKoU,SACY,wBAAjBpU,KAAKoU,QAILR,WACF,OAAO5T,KAAKmU,MAGVP,SAAKa,GACHA,IAAYzU,KAAKsU,eACnBtU,KAAKsU,aAAeG,EAChBzU,KAAKuU,mBACP3H,EAAkBf,IAAI,QAAU7L,KAAKmU,MAAOnU,KAAKsU,eAKvDjI,WACE,IAAInN,EAAMc,KAAK0U,cAIf,OAHI1U,KAAKiU,iBACP/U,GAAO,IAAMc,KAAKiU,eAAiB,KAE9B/U,EAGTwV,cACE,MAAMC,EAAW3U,KAAK6T,OAAS,WAAa,UACtCe,EAAQ5U,KAAKkU,8BACf,OAAOlU,KAAK8T,YACZ,GACJ,MAAO,GAAGa,IAAW3U,KAAK4T,QAAQgB,KAmBtB,SAAAC,GACdC,EACAxL,EACAyL,GAKA,IAAIC,EACJ,GAJApW,EAAuB,iBAAT0K,EAAmB,8BACjC1K,EAAyB,iBAAXmW,EAAqB,gCD/EZ,cCkFnBzL,EACF0L,GACGF,EAASjB,OAAS,SAAW,SAAWiB,EAASR,aAAe,YAC9D,CAAA,GDnFmB,iBCmFfhL,EAMT,MAAM,IAAItK,MAAM,4BAA8BsK,GAL9C0L,GACGF,EAASjB,OAAS,WAAa,WAChCiB,EAASR,aACT,SA/BN,SAAiCQ,GAC/B,OACEA,EAASlB,OAASkB,EAASR,cAC3BQ,EAASN,gBACTM,EAASZ,+BA+BPe,CAAwBH,KAC1BC,EAAW,GAAID,EAAShB,WAG1B,MAAMoB,EAAkB,GAMxB,OAJApF,GAAKiF,GAAQ,CAACtO,EAAazD,KACzBkS,EAAM7T,KAAKoF,EAAM,IAAMzD,MAGlBgS,EAAUE,EAAM5T,KAAK,KCvHjB,MAAA6T,GAAb7R,cACUtD,KAASoV,UAA4B,GAE7CC,iBAAiBjM,EAAckM,EAAiB,GACzC/O,EAASvG,KAAKoV,UAAWhM,KAC5BpJ,KAAKoV,UAAUhM,GAAQ,GAGzBpJ,KAAKoV,UAAUhM,IAASkM,EAG1BrJ,MACE,OAAOlJ,EAAS/C,KAAKoV,YCbzB,MAAMG,GAAgD,GAChDC,GAAsC,GAEtC,SAAUC,GAA0BX,GACxC,MAAMY,EAAaZ,EAASzI,WAM5B,OAJKkJ,GAAYG,KACfH,GAAYG,GAAc,IAAIP,IAGzBI,GAAYG,GCRR,MAAAC,GASXrS,YAAoBsS,GAAA5V,KAAU4V,WAAVA,EARpB5V,KAAgB6V,iBAAc,GAC9B7V,KAAkB8V,mBAAG,EACrB9V,KAAkB+V,oBAAI,EACtB/V,KAAOgW,QAAwB,KAO/BC,WAAWC,EAAqBvQ,GAC9B3F,KAAK+V,mBAAqBG,EAC1BlW,KAAKgW,QAAUrQ,EACX3F,KAAK+V,mBAAqB/V,KAAK8V,qBACjC9V,KAAKgW,UACLhW,KAAKgW,QAAU,MASnBG,eAAeC,EAAoBrQ,GAEjC,IADA/F,KAAK6V,iBAAiBO,GAAcrQ,EAC7B/F,KAAK6V,iBAAiB7V,KAAK8V,qBAAqB,CACrD,MAAMO,EAAYrW,KAAK6V,iBACrB7V,KAAK8V,2BAEA9V,KAAK6V,iBAAiB7V,KAAK8V,oBAClC,IAAK,IAAIzW,EAAI,EAAGA,EAAIgX,EAAU/W,SAAUD,EAClCgX,EAAUhX,IACZiS,IAAe,KACbtR,KAAK4V,WAAWS,EAAUhX,OAIhC,GAAIW,KAAK8V,qBAAuB9V,KAAK+V,mBAAoB,CACnD/V,KAAKgW,UACPhW,KAAKgW,UACLhW,KAAKgW,QAAU,MAEjB,MAEFhW,KAAK8V,uBCeE,MAAAQ,GA4BXhT,YACSiT,EACAzB,EACC0B,EACAC,EACAC,EACDC,EACAC,GANA5W,KAAMuW,OAANA,EACAvW,KAAQ8U,SAARA,EACC9U,KAAawW,cAAbA,EACAxW,KAAayW,cAAbA,EACAzW,KAAS0W,UAATA,EACD1W,KAAkB2W,mBAAlBA,EACA3W,KAAa4W,cAAbA,EAlCT5W,KAAS6W,UAAG,EACZ7W,KAAa8W,cAAG,EAUR9W,KAAc+W,gBAAG,EAyBvB/W,KAAKgX,KAAOzI,GAAWgI,GACvBvW,KAAKiX,OAASxB,GAA0BX,GACxC9U,KAAKkX,MAASnC,IAER/U,KAAKyW,gBACP1B,EAA4B,GAAI/U,KAAKyW,eAEhC5B,GAAsBC,ELxFP,eKwF+BC,IAQzDoC,KAAKC,EAA8BC,GACjCrX,KAAKsX,cAAgB,EACrBtX,KAAKuX,cAAgBF,EACrBrX,KAAKwX,gBAAkB,IAAI7B,GAAeyB,GAC1CpX,KAAKyX,WAAY,EAEjBzX,KAAK0X,qBAAuBnG,YAAW,KACrCvR,KAAKgX,KAAK,gCAEVhX,KAAK2X,YACL3X,KAAK0X,qBAAuB,OAE3BrH,KAAKI,MArEe,MRqHQ,SAAU1J,GAC3C,GAA2C,aAAxB/B,SAAS4S,WAC1B7Q,QACK,CAIL,IAAI8Q,GAAS,EACb,MAAMC,EAAY,WACX9S,SAAS+S,KAKTF,IACHA,GAAS,EACT9Q,KANAwK,WAAWuG,EAAWzH,KAAKI,MAAM,MAUjCzL,SAASgT,kBACXhT,SAASgT,iBAAiB,mBAAoBF,GAAW,GAEzDlU,OAAOoU,iBAAiB,OAAQF,GAAW,IAEjC9S,SAAiBiT,cAG1BjT,SAAiBiT,YAAY,sBAAsB,KACtB,aAAxBjT,SAAS4S,YACXE,OAKHlU,OAAeqU,YAAY,SAAUH,KQhFxCI,EAAoB,KAClB,GAAIlY,KAAKyX,UACP,OAIFzX,KAAKmY,gBAAkB,IAAIC,IACzB,IAAIlN,KACF,MAAOmN,EAASC,EAAMC,EAAMC,EAAMC,GAAQvN,EAE1C,GADAlL,KAAK0Y,wBAAwBxN,GACxBlL,KAAKmY,gBASV,GALInY,KAAK0X,uBACPiB,aAAa3Y,KAAK0X,sBAClB1X,KAAK0X,qBAAuB,MAE9B1X,KAAK+W,gBAAiB,EAzHa,UA0H/BsB,EACFrY,KAAKyN,GAAK6K,EACVtY,KAAK4Y,SAAWL,MACX,CAAA,GA5H8B,UA4H1BF,EAgBT,MAAM,IAAIrZ,MAAM,kCAAoCqZ,GAdhDC,GAGFtY,KAAKmY,gBAAgBU,cAAe,EAIpC7Y,KAAKwX,gBAAgBvB,WAAWqC,GAAgB,KAC9CtY,KAAK2X,gBAGP3X,KAAK2X,gBAMX,IAAIzM,KACF,MAAO4N,EAAI/S,GAAQmF,EACnBlL,KAAK0Y,wBAAwBxN,GAC7BlL,KAAKwX,gBAAgBrB,eAAe2C,EAAc/S,MAEpD,KACE/F,KAAK2X,cAEP3X,KAAKkX,OAKP,MAAM6B,EAA8C,CACpDA,MAA2C,KAC3CA,EAAwC,IAAI1I,KAAKI,MAC/B,IAAhBJ,KAAK2I,UAEHhZ,KAAKmY,gBAAgBc,2BACvBF,EAA6C,GAC3C/Y,KAAKmY,gBAAgBc,0BAEzBF,EAAuB,ELrMG,IKsMtB/Y,KAAK2W,qBACPoC,EAAiC,EAAI/Y,KAAK2W,oBAExC3W,KAAK4W,gBACPmC,EAA4B,GAAI/Y,KAAK4W,eAEnC5W,KAAKwW,gBACPuC,EAA8B,EAAI/Y,KAAKwW,eAErCxW,KAAKyW,gBACPsC,EAA+B,GAAI/Y,KAAKyW,eAGpB,oBAAbyC,UACPA,SAASC,UACTzF,GAAgB7P,KAAKqV,SAASC,YAE9BJ,EAAuB,EL/MN,KKiNnB,MAAMK,EAAapZ,KAAKkX,MAAM6B,GAC9B/Y,KAAKgX,KAAK,+BAAiCoC,GAC3CpZ,KAAKmY,gBAAgBkB,OAAOD,GAAY,YAS5CE,QACEtZ,KAAKmY,gBAAgBoB,cAAcvZ,KAAKyN,GAAIzN,KAAK4Y,UACjD5Y,KAAKwZ,uBAAuBxZ,KAAKyN,GAAIzN,KAAK4Y,UAQ5Ca,oBACEnD,GAAsBoD,aAAc,EAQtCD,uBACEnD,GAAsBqD,gBAAiB,EAIzCF,qBAGS,QAAInD,GAAsBoD,eAM5BpD,GAAsBqD,gBACH,oBAAb3U,UACmB,MAA1BA,SAAS4U,eR8KK,iBAAXhW,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAOsV,SAASW,OASR,iBAAZC,SAA8C,iBAAfA,QAAQC,IQhLrDC,yBAKQC,YACNja,KAAKyX,WAAY,EAEbzX,KAAKmY,kBACPnY,KAAKmY,gBAAgB+B,QACrBla,KAAKmY,gBAAkB,MAIrBnY,KAAKma,iBACPnV,SAAS+S,KAAKqC,YAAYpa,KAAKma,gBAC/Bna,KAAKma,eAAiB,MAGpBna,KAAK0X,uBACPiB,aAAa3Y,KAAK0X,sBAClB1X,KAAK0X,qBAAuB,MAOxBC,YACD3X,KAAKyX,YACRzX,KAAKgX,KAAK,8BACVhX,KAAKia,YAEDja,KAAKuX,gBACPvX,KAAKuX,cAAcvX,KAAK+W,gBACxB/W,KAAKuX,cAAgB,OAS3B2C,QACOla,KAAKyX,YACRzX,KAAKgX,KAAK,6BACVhX,KAAKia,aASTI,KAAKtU,GACH,MAAMuU,EAAUxU,EAAUC,GAC1B/F,KAAK6W,WAAayD,EAAQhb,OAC1BU,KAAKiX,OAAO5B,iBAAiB,aAAciF,EAAQhb,QAGnD,MAAMib,EAAahY,EAAa+X,GAI1B1K,EAAWH,GAAkB8K,EAjSdC,MAqSrB,IAAK,IAAInb,EAAI,EAAGA,EAAIuQ,EAAStQ,OAAQD,IACnCW,KAAKmY,gBAAgBsC,eACnBza,KAAKsX,cACL1H,EAAStQ,OACTsQ,EAASvQ,IAEXW,KAAKsX,gBASTkC,uBAAuB/L,EAAYiN,GAIjC1a,KAAKma,eAAiBnV,SAAS4U,cAAc,UAC7C,MAAMb,EAAqC,CAC3CA,OAA2D,KAC3DA,EAAoC,GAAItL,EACxCsL,EAAoC,GAAI2B,EACxC1a,KAAKma,eAAeQ,IAAM3a,KAAKkX,MAAM6B,GACrC/Y,KAAKma,eAAeS,MAAMC,QAAU,OAEpC7V,SAAS+S,KAAK+C,YAAY9a,KAAKma,gBAMzBzB,wBAAwBxN,GAE9B,MAAM4L,EAAgBhR,EAAUoF,GAAM5L,OACtCU,KAAK8W,eAAiBA,EACtB9W,KAAKiX,OAAO5B,iBAAiB,iBAAkByB,IAYtC,MAAAsB,GAiCX9U,YACEyX,EACAC,EACO3D,EACAH,GADAlX,KAAYqX,aAAZA,EACArX,KAAKkX,MAALA,EAlCTlX,KAAAib,oBAAsB,IAAIC,IAG1Blb,KAAWmb,YAAmD,GAO9Dnb,KAAAob,cAAgB/K,KAAKI,MAAsB,IAAhBJ,KAAK2I,UAIhChZ,KAAY6Y,cAAG,EAsBK,CAKhB7Y,KAAKiZ,yBAA2BzL,IAChC5J,OApZ2C,aAqZL5D,KAAKiZ,0BACvC8B,EACJnX,OAtZwC,UAsZA5D,KAAKiZ,0BAC3C+B,EAGFhb,KAAKqb,SAAWjD,GAA2BkD,gBAG3C,IAAIC,EAAS,GAGb,GACEvb,KAAKqb,SAASV,KACwC,gBAAtD3a,KAAKqb,SAASV,IAAI1J,OAAO,EAAG,cAAc3R,QAC1C,CAEAic,EAAS,4BADavW,SAASwW,OACwB,eAEzD,MAAMC,EAAiB,eAAiBF,EAAS,iBACjD,IACEvb,KAAKqb,SAASK,IAAIvE,OAClBnX,KAAKqb,SAASK,IAAIC,MAAMF,GACxBzb,KAAKqb,SAASK,IAAIxB,QAClB,MAAOtX,GACP2K,EAAI,2BACA3K,EAAE4O,OACJjE,EAAI3K,EAAE4O,OAERjE,EAAI3K,KAYF6W,uBACN,MAAMmC,EAAS5W,SAAS4U,cAAc,UAItC,GAHAgC,EAAOhB,MAAMC,QAAU,QAGnB7V,SAAS+S,KAqBX,KAAM,oGApBN/S,SAAS+S,KAAK+C,YAAYc,GAC1B,IAIYA,EAAOC,cAAc7W,UAG7BuI,EAAI,iCAEN,MAAO3K,GACP,MAAM4Y,EAASxW,SAASwW,OACxBI,EAAOjB,IACL,gEACAa,EACA,2BAmBN,OAVII,EAAOE,gBACTF,EAAOF,IAAME,EAAOE,gBACXF,EAAOC,cAChBD,EAAOF,IAAME,EAAOC,cAAc7W,SAExB4W,EAAe5W,WAEzB4W,EAAOF,IAAOE,EAAe5W,UAGxB4W,EAMT1B,QAEEla,KAAK+b,OAAQ,EAET/b,KAAKqb,WAIPrb,KAAKqb,SAASK,IAAI3D,KAAKiE,UAAY,GACnCzK,YAAW,KACa,OAAlBvR,KAAKqb,WACPrW,SAAS+S,KAAKqC,YAAYpa,KAAKqb,UAC/Brb,KAAKqb,SAAW,QAEjBhL,KAAKI,MAAM,KAIhB,MAAM4G,EAAerX,KAAKqX,aACtBA,IACFrX,KAAKqX,aAAe,KACpBA,KASJkC,cAAc9L,EAAYiN,GAMxB,IALA1a,KAAKic,KAAOxO,EACZzN,KAAKkc,KAAOxB,EACZ1a,KAAK+b,OAAQ,EAGN/b,KAAKmc,iBAUNA,cAIN,GACEnc,KAAK+b,OACL/b,KAAK6Y,cACL7Y,KAAKib,oBAAoBmB,MAAQpc,KAAKmb,YAAY7b,OAAS,EAAI,EAAI,GACnE,CAEAU,KAAKob,gBACL,MAAMrC,EAA8C,GACpDA,EAAoC,GAAI/Y,KAAKic,KAC7ClD,EAAoC,GAAI/Y,KAAKkc,KAC7CnD,EAAwC,IAAI/Y,KAAKob,cACjD,IAAIiB,EAASrc,KAAKkX,MAAM6B,GAEpBuD,EAAgB,GAChBjd,EAAI,EAER,KAAOW,KAAKmb,YAAY7b,OAAS,GAAG,CAGlC,KADgBU,KAAKmb,YAAY,GAEtB/S,EAAgB9I,OAliBX,GAoiBZgd,EAAchd,QAriBA,MA6jBhB,MAtBA,CAEA,MAAMid,EAASvc,KAAKmb,YAAYqB,QAChCF,EACEA,EAAAA,OAGAjd,EACA,IACAkd,EAAOE,IALPH,MAQAjd,EACA,IACAkd,EAAOG,GAVPJ,KAaAjd,EACA,IACAkd,EAAOnU,EACT/I,KASJ,OAHAgd,GAAkBC,EAClBtc,KAAK2c,gBAAgBN,EAAQrc,KAAKob,gBAE3B,EAEP,OAAO,EAUXX,eAAemC,EAAgBC,EAAmB9W,GAEhD/F,KAAKmb,YAAY9Z,KAAK,CAAEob,IAAKG,EAAQF,GAAIG,EAAWzU,EAAGrC,IAInD/F,KAAK+b,OACP/b,KAAKmc,cASDQ,gBAAgBG,EAAaC,GAEnC/c,KAAKib,oBAAoB+B,IAAID,GAE7B,MAAME,EAAe,KACnBjd,KAAKib,oBAAoBiC,OAAOH,GAChC/c,KAAKmc,eAKDgB,EAAmB5L,WACvB0L,EACA5M,KAAKI,MApmBwB,OA+mB/BzQ,KAAKqZ,OAAOyD,GARS,KAEnBnE,aAAawE,GAGbF,OAWJ5D,OAAOyD,EAAaM,GAKhB7L,YAAW,KACT,IAEE,IAAKvR,KAAK6Y,aACR,OAEF,MAAMwE,EAAYrd,KAAKqb,SAASK,IAAI9B,cAAc,UAClDyD,EAAU/T,KAAO,kBACjB+T,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,KAClBpQ,EAAI,oCAAsCuP,GAC1C9c,KAAK6Y,cAAe,EACpB7Y,KAAKka,SAEPla,KAAKqb,SAASK,IAAI3D,KAAK+C,YAAYuC,GACnC,MAAOza,OAGRyN,KAAKI,MAAM,KCzrBpB,IAAImN,GAAgB,KACQ,oBAAjBC,aACTD,GAAgBC,aACc,oBAAdC,YAChBF,GAAgBE,WAUL,MAAAC,GA2BXza,YACSiT,EACPzB,EACQ0B,EACAC,EACAC,EACRC,EACAC,GANO5W,KAAMuW,OAANA,EAECvW,KAAawW,cAAbA,EACAxW,KAAayW,cAAbA,EACAzW,KAAS0W,UAATA,EA/BV1W,KAAcge,eAAkB,KAChChe,KAAMie,OAAoB,KAC1Bje,KAAWke,YAAG,EACdle,KAAS6W,UAAG,EACZ7W,KAAa8W,cAAG,EA+Bd9W,KAAKgX,KAAOzI,GAAWvO,KAAKuW,QAC5BvW,KAAKiX,OAASxB,GAA0BX,GACxC9U,KAAKgV,QAAU+I,GAAoBI,eACjCrJ,EACA6B,EACAC,EACAH,EACAD,GAEFxW,KAAKgU,UAAYc,EAASd,UAUpByF,sBACN3E,EACA6B,EACAC,EACAH,EACAD,GAEA,MAAMuC,EAAqC,CAC3CA,EN1G4B,KMiI5B,MAnBsB,oBAAbG,UACPA,SAASC,UACTzF,GAAgB7P,KAAKqV,SAASC,YAE9BJ,EAAuB,EN1GJ,KM4GjBpC,IACFoC,EAAiC,EAAIpC,GAEnCC,IACFmC,EAA4B,GAAInC,GAE9BH,IACFsC,EAA+B,GAAItC,GAEjCD,IACFuC,EAA8B,EAAIvC,GAG7B3B,GAAsBC,EN5GR,YM4G6BiE,GAOpD5B,KAAKC,EAA8BC,GACjCrX,KAAKqX,aAAeA,EACpBrX,KAAKoX,UAAYA,EAEjBpX,KAAKgX,KAAK,2BAA6BhX,KAAKgV,SAE5ChV,KAAK+W,gBAAiB,EAEtBnK,EAAkBf,IAAI,8BAA8B,GAEpD,IACE,IAAIuS,EACAra,IAiCJ/D,KAAKqe,OAAS,IAAIT,GAAc5d,KAAKgV,QAAS,GAAIoJ,GAClD,MAAOxb,GACP5C,KAAKgX,KAAK,kCACV,MAAMlU,EAAQF,EAAE9D,SAAW8D,EAAEmD,KAK7B,OAJIjD,GACF9C,KAAKgX,KAAKlU,QAEZ9C,KAAK2X,YAIP3X,KAAKqe,OAAOC,OAAS,KACnBte,KAAKgX,KAAK,wBACVhX,KAAK+W,gBAAiB,GAGxB/W,KAAKqe,OAAOE,QAAU,KACpBve,KAAKgX,KAAK,0CACVhX,KAAKqe,OAAS,KACdre,KAAK2X,aAGP3X,KAAKqe,OAAOG,UAAYC,IACtBze,KAAK0e,oBAAoBD,IAG3Bze,KAAKqe,OAAOV,QAAU/a,IACpB5C,KAAKgX,KAAK,yCAEV,MAAMlU,EAASF,EAAU9D,SAAY8D,EAAUmD,KAC3CjD,GACF9C,KAAKgX,KAAKlU,GAEZ9C,KAAK2X,aAOT2B,SAIAG,uBACEsE,GAAoBpE,gBAAiB,EAGvCF,qBACE,IAAIkF,GAAe,EACnB,GAAyB,oBAAd7a,WAA6BA,UAAU8a,UAAW,CAC3D,MAAMC,EAAkB,iCAClBC,EAAkBhb,UAAU8a,UAAU3Z,MAAM4Z,GAC9CC,GAAmBA,EAAgBxf,OAAS,GAC1Cyf,WAAWD,EAAgB,IAAM,MACnCH,GAAe,GAKrB,OACGA,GACiB,OAAlBf,KACCG,GAAoBpE,eAiBzBF,0BAGE,OACE7M,EAAkBJ,oBACsC,IAAxDI,EAAkBX,IAAI,8BAI1B+N,wBACEpN,EAAkBR,OAAO,8BAGnB4S,aAAajZ,GAEnB,GADA/F,KAAKie,OAAO5c,KAAK0E,GACb/F,KAAKie,OAAO3e,SAAWU,KAAKke,YAAa,CAC3C,MAAMe,EAAWjf,KAAKie,OAAO3c,KAAK,IAClCtB,KAAKie,OAAS,KACd,MAAMiB,EAAWrZ,EAASoZ,GAG1Bjf,KAAKoX,UAAU8H,IAOXC,qBAAqBC,GAC3Bpf,KAAKke,YAAckB,EACnBpf,KAAKie,OAAS,GAORoB,mBAAmBtZ,GAIzB,GAHAnH,EAAuB,OAAhBoB,KAAKie,OAAiB,kCAGzBlY,EAAKzG,QAAU,EAAG,CACpB,MAAM8f,EAAazQ,OAAO5I,GAC1B,IAAKuZ,MAAMF,GAET,OADApf,KAAKmf,qBAAqBC,GACnB,KAIX,OADApf,KAAKmf,qBAAqB,GACnBpZ,EAOT2Y,oBAAoBa,GAClB,GAAoB,OAAhBvf,KAAKqe,OACP,OAEF,MAAMtY,EAAOwZ,EAAW,KAMxB,GALAvf,KAAK8W,eAAiB/Q,EAAKzG,OAC3BU,KAAKiX,OAAO5B,iBAAiB,iBAAkBtP,EAAKzG,QAEpDU,KAAKwf,iBAEe,OAAhBxf,KAAKie,OAEPje,KAAKgf,aAAajZ,OACb,CAEL,MAAM0Z,EAAgBzf,KAAKqf,mBAAmBtZ,GACxB,OAAlB0Z,GACFzf,KAAKgf,aAAaS,IASxBpF,KAAKtU,GACH/F,KAAKwf,iBAEL,MAAMlF,EAAUxU,EAAUC,GAC1B/F,KAAK6W,WAAayD,EAAQhb,OAC1BU,KAAKiX,OAAO5B,iBAAiB,aAAciF,EAAQhb,QAKnD,MAAMsQ,EAAWH,GAAkB6K,EAvUN,OA0UzB1K,EAAStQ,OAAS,GACpBU,KAAK0f,YAAY7d,OAAO+N,EAAStQ,SAInC,IAAK,IAAID,EAAI,EAAGA,EAAIuQ,EAAStQ,OAAQD,IACnCW,KAAK0f,YAAY9P,EAASvQ,IAItB4a,YACNja,KAAKyX,WAAY,EACbzX,KAAKge,iBACP2B,cAAc3f,KAAKge,gBACnBhe,KAAKge,eAAiB,MAGpBhe,KAAKqe,SACPre,KAAKqe,OAAOnE,QACZla,KAAKqe,OAAS,MAIV1G,YACD3X,KAAKyX,YACRzX,KAAKgX,KAAK,+BACVhX,KAAKia,YAGDja,KAAKqX,eACPrX,KAAKqX,aAAarX,KAAK+W,gBACvB/W,KAAKqX,aAAe,OAS1B6C,QACOla,KAAKyX,YACRzX,KAAKgX,KAAK,6BACVhX,KAAKia,aAQTuF,iBACEG,cAAc3f,KAAKge,gBACnBhe,KAAKge,eAAiB4B,aAAY,KAE5B5f,KAAKqe,QACPre,KAAK0f,YAAY,KAEnB1f,KAAKwf,mBAEJnP,KAAKI,MArYyB,OA6Y3BiP,YAAYxgB,GAIlB,IACEc,KAAKqe,OAAOhE,KAAKnb,GACjB,MAAO0D,GACP5C,KAAKgX,KACH,0CACApU,EAAE9D,SAAW8D,EAAEmD,KACf,uBAEFwL,WAAWvR,KAAK2X,UAAUrJ,KAAKtO,MAAO,KAzLnC+d,GAA4B8B,6BAAG,EAK/B9B,GAAc+B,eAAG,IClPb,MAAAC,GAqBXzc,YAAYwR,GACV9U,KAAKggB,gBAAgBlL,GAhBZmL,4BACT,MAAO,CAAC3J,GAAuByH,IAOtBmC,sCACT,OAAOlgB,KAAKmgB,4BAUNH,gBAAgBlL,GACtB,MAAMsL,EACJrC,IAAuBA,GAAiC,cAC1D,IAAIsC,EACFD,IAA0BrC,GAAoBuC,mBAYhD,GAVIxL,EAASf,gBACNqM,GACHzb,GACE,mFAIJ0b,GAAuB,GAGrBA,EACFrgB,KAAKugB,YAAc,CAACxC,QACf,CACL,MAAMyC,EAAcxgB,KAAKugB,YAAc,GACvC,IAAK,MAAME,KAAaV,GAAiBE,eACnCQ,GAAaA,EAAuB,eACtCD,EAAWnf,KAAKof,GAGpBV,GAAiBI,6BAA8B,GAOnDO,mBACE,GAAI1gB,KAAKugB,YAAYjhB,OAAS,EAC5B,OAAOU,KAAKugB,YAAY,GAExB,MAAM,IAAIvhB,MAAM,2BAOpB2hB,mBACE,OAAI3gB,KAAKugB,YAAYjhB,OAAS,EACrBU,KAAKugB,YAAY,GAEjB,MApEJR,GAA2BI,6BAAG,ECgC1B,MAAAS,GA6BXtd,YACSmK,EACCoT,EACAC,EACAC,EACAC,EACApL,EACAqL,EACA1J,EACA2J,EACDtK,GATA5W,KAAEyN,GAAFA,EACCzN,KAAS6gB,UAATA,EACA7gB,KAAc8gB,eAAdA,EACA9gB,KAAc+gB,eAAdA,EACA/gB,KAAUghB,WAAVA,EACAhhB,KAAU4V,WAAVA,EACA5V,KAAQihB,SAARA,EACAjhB,KAAauX,cAAbA,EACAvX,KAAOkhB,QAAPA,EACDlhB,KAAa4W,cAAbA,EAtCT5W,KAAemhB,gBAAG,EAClBnhB,KAAmBohB,oBAAc,GAWzBphB,KAAAqhB,OAAkC,EA4BxCrhB,KAAKgX,KAAOzI,GAAW,KAAOvO,KAAKyN,GAAK,KACxCzN,KAAKshB,kBAAoB,IAAIvB,GAAiBc,GAC9C7gB,KAAKgX,KAAK,sBACVhX,KAAKuhB,SAMCA,SACN,MAAMC,EAAOxhB,KAAKshB,kBAAkBZ,mBACpC1gB,KAAKyhB,MAAQ,IAAID,EACfxhB,KAAK0hB,mBACL1hB,KAAK6gB,UACL7gB,KAAK8gB,eACL9gB,KAAK+gB,eACL/gB,KAAKghB,WACL,KACAhhB,KAAK4W,eAKP5W,KAAK2hB,0BAA4BH,EAAmC,8BAAK,EAEzE,MAAMI,EAAoB5hB,KAAK6hB,cAAc7hB,KAAKyhB,OAC5CK,EAAmB9hB,KAAK+hB,iBAAiB/hB,KAAKyhB,OACpDzhB,KAAKgiB,IAAMhiB,KAAKyhB,MAChBzhB,KAAKiiB,IAAMjiB,KAAKyhB,MAChBzhB,KAAKkiB,eAAiB,KACtBliB,KAAKmiB,YAAa,EAQlB5Q,YAAW,KAETvR,KAAKyhB,OAASzhB,KAAKyhB,MAAMtK,KAAKyK,EAAmBE,KAChDzR,KAAKI,MAAM,IAEd,MAAM2R,EAAmBZ,EAAqB,gBAAK,EAC/CY,EAAmB,IACrBpiB,KAAKqiB,gBAAkB5Q,IAAsB,KAC3CzR,KAAKqiB,gBAAkB,KAClBriB,KAAKmiB,aAENniB,KAAKyhB,OACLzhB,KAAKyhB,MAAM3K,cAnHiB,QAqH5B9W,KAAKgX,KACH,wDACEhX,KAAKyhB,MAAM3K,cACX,wCAEJ9W,KAAKmiB,YAAa,EAClBniB,KAAKyhB,MAAMzH,yBAEXha,KAAKyhB,OACLzhB,KAAKyhB,MAAM5K,UA/Ha,MAiIxB7W,KAAKgX,KACH,oDACEhX,KAAKyhB,MAAM5K,UACX,uCAKJ7W,KAAKgX,KAAK,+CACVhX,KAAKka,YAIR7J,KAAKI,MAAM2R,KAIVV,mBACN,MAAO,KAAO1hB,KAAKyN,GAAK,IAAMzN,KAAKmhB,kBAG7BY,iBAAiBP,GACvB,OAAOc,IACDd,IAASxhB,KAAKyhB,MAChBzhB,KAAKuiB,kBAAkBD,GACdd,IAASxhB,KAAKkiB,gBACvBliB,KAAKgX,KAAK,8BACVhX,KAAKwiB,8BAELxiB,KAAKgX,KAAK,8BAKR6K,cAAcL,GACpB,OAAQ1iB,IACS,IAAXkB,KAAKqhB,SACHG,IAASxhB,KAAKiiB,IAChBjiB,KAAKyiB,0BAA0B3jB,GACtB0iB,IAASxhB,KAAKkiB,eACvBliB,KAAK0iB,4BAA4B5jB,GAEjCkB,KAAKgX,KAAK,+BASlB2L,YAAYC,GAEV,MAAMC,EAAM,CAAE9a,EAAG,IAAKK,EAAGwa,GACzB5iB,KAAK8iB,UAAUD,GAGjBE,uBACM/iB,KAAKgiB,MAAQhiB,KAAKkiB,gBAAkBliB,KAAKiiB,MAAQjiB,KAAKkiB,iBACxDliB,KAAKgX,KACH,2CAA6ChX,KAAKkiB,eAAe3L,QAEnEvW,KAAKyhB,MAAQzhB,KAAKkiB,eAClBliB,KAAKkiB,eAAiB,MAKlBc,oBAAoBC,GAC1B,GA7LiB,MA6LGA,EAAa,CAC/B,MAAMC,EAAMD,EAAwB,EAxLvB,MAyLTC,EACFljB,KAAKmjB,6BA7LS,MA8LLD,GAETljB,KAAKgX,KAAK,wCACVhX,KAAKkiB,eAAehI,QAGlBla,KAAKgiB,MAAQhiB,KAAKkiB,gBAClBliB,KAAKiiB,MAAQjiB,KAAKkiB,gBAElBliB,KAAKka,SArMM,MAuMJgJ,IACTljB,KAAKgX,KAAK,0BACVhX,KAAKojB,8BACLpjB,KAAKmjB,+BAKHT,4BAA4BW,GAClC,MAAMC,EAAgBjU,GAAW,IAAKgU,GAChCtd,EAAgBsJ,GAAW,IAAKgU,GACtC,GAAc,MAAVC,EACFtjB,KAAKgjB,oBAAoBjd,OACpB,CAAA,GAAc,MAAVud,EAIT,MAAM,IAAItkB,MAAM,2BAA6BskB,GAF7CtjB,KAAKohB,oBAAoB/f,KAAK0E,IAM1Bod,6BACFnjB,KAAKojB,6BAA+B,GACtCpjB,KAAKgX,KAAK,oCACVhX,KAAKmiB,YAAa,EAClBniB,KAAKkiB,eAAelI,wBACpBha,KAAKujB,wBAGLvjB,KAAKgX,KAAK,8BACVhX,KAAKkiB,eAAe7H,KAAK,CAAEtS,EAAG,IAAKK,EAAG,CAAEL,EAlOjC,IAkO0CK,EAAG,OAIhDmb,sBAENvjB,KAAKkiB,eAAe5I,QAEpBtZ,KAAKgX,KAAK,mCACVhX,KAAKkiB,eAAe7H,KAAK,CAAEtS,EAAG,IAAKK,EAAG,CAAEL,EA7OzB,IA6OwCK,EAAG,MAI1DpI,KAAKgX,KAAK,kCACVhX,KAAKyhB,MAAMpH,KAAK,CAAEtS,EAAG,IAAKK,EAAG,CAAEL,EAjPV,IAiP+BK,EAAG,MACvDpI,KAAKgiB,IAAMhiB,KAAKkiB,eAEhBliB,KAAK+iB,uBAGCN,0BAA0BY,GAEhC,MAAMC,EAAgBjU,GAAW,IAAKgU,GAChCtd,EAAgBsJ,GAAW,IAAKgU,GACxB,MAAVC,EACFtjB,KAAKwjB,WAAWzd,GACG,MAAVud,GACTtjB,KAAKyjB,eAAe1d,GAIhB0d,eAAe3kB,GACrBkB,KAAK0jB,qBAGL1jB,KAAK4V,WAAW9W,GAGV4kB,qBACD1jB,KAAKmiB,aACRniB,KAAK2hB,4BACD3hB,KAAK2hB,2BAA6B,IACpC3hB,KAAKgX,KAAK,kCACVhX,KAAKmiB,YAAa,EAClBniB,KAAKyhB,MAAMzH,0BAKTwJ,WAAWP,GACjB,MAAMC,EAAc7T,GA5RH,IA4R4B4T,GAC7C,GA5RiB,MA4RGA,EAAa,CAC/B,MAAMU,EAAUV,EAAwB,EACxC,GArRe,MAqRXC,EACFljB,KAAK4jB,aACHD,QAOG,GAjSY,MAiSRT,EAA0B,CACnCljB,KAAKgX,KAAK,qCACVhX,KAAKiiB,IAAMjiB,KAAKkiB,eAChB,IAAK,IAAI7iB,EAAI,EAAGA,EAAIW,KAAKohB,oBAAoB9hB,SAAUD,EACrDW,KAAKyjB,eAAezjB,KAAKohB,oBAAoB/hB,IAE/CW,KAAKohB,oBAAsB,GAC3BphB,KAAK+iB,2BA7SY,MA8SRG,EAGTljB,KAAK6jB,sBAAsBF,GAhTb,MAiTLT,EAETljB,KAAK8jB,SAASH,GAlTA,MAmTLT,EACTpgB,GAAM,iBAAmB6gB,GAnTZ,MAoTJT,GACTljB,KAAKgX,KAAK,wBACVhX,KAAK0jB,qBACL1jB,KAAK+jB,iCAELjhB,GAAM,mCAAqCogB,IAQzCU,aAAaI,GAMnB,MAAMC,EAAYD,EAAUtH,GACtBjR,EAAUuY,EAAUhU,EACpB4D,EAAOoQ,EAAUE,EACvBlkB,KAAKmkB,UAAYH,EAAU9T,EAC3BlQ,KAAK6gB,UAAUjN,KAAOA,EAEP,IAAX5T,KAAKqhB,SACPrhB,KAAKyhB,MAAMnI,QACXtZ,KAAKokB,yBAAyBpkB,KAAKyhB,MAAOwC,GRtXhB,MQuXDxY,GACvB9G,GAAK,sCAGP3E,KAAKqkB,oBAIDA,mBACN,MAAM7C,EAAOxhB,KAAKshB,kBAAkBX,mBAChCa,GACFxhB,KAAKskB,cAAc9C,GAIf8C,cAAc9C,GACpBxhB,KAAKkiB,eAAiB,IAAIV,EACxBxhB,KAAK0hB,mBACL1hB,KAAK6gB,UACL7gB,KAAK8gB,eACL9gB,KAAK+gB,eACL/gB,KAAKghB,WACLhhB,KAAKmkB,WAIPnkB,KAAKojB,4BACH5B,EAAmC,8BAAK,EAE1C,MAAMpK,EAAYpX,KAAK6hB,cAAc7hB,KAAKkiB,gBACpC7K,EAAerX,KAAK+hB,iBAAiB/hB,KAAKkiB,gBAChDliB,KAAKkiB,eAAe/K,KAAKC,EAAWC,GAGpC5F,IAAsB,KAChBzR,KAAKkiB,iBACPliB,KAAKgX,KAAK,gCACVhX,KAAKkiB,eAAehI,WAErB7J,KAAKI,MA9YY,MAiZdqT,SAASlQ,GACf5T,KAAKgX,KAAK,qCAAuCpD,GACjD5T,KAAK6gB,UAAUjN,KAAOA,EAGP,IAAX5T,KAAKqhB,OACPrhB,KAAKka,SAGLla,KAAKukB,oBACLvkB,KAAKuhB,UAID6C,yBAAyB5C,EAAiByC,GAChDjkB,KAAKgX,KAAK,oCACVhX,KAAKyhB,MAAQD,EACbxhB,KAAKqhB,OAAM,EAEPrhB,KAAKihB,WACPjhB,KAAKihB,SAASgD,EAAWjkB,KAAKmkB,WAC9BnkB,KAAKihB,SAAW,MAKqB,IAAnCjhB,KAAK2hB,2BACP3hB,KAAKgX,KAAK,kCACVhX,KAAKmiB,YAAa,GAElB1Q,IAAsB,KACpBzR,KAAK+jB,kCACJ1T,KAAKI,MA7a8B,MAiblCsT,gCAED/jB,KAAKmiB,YAAyB,IAAXniB,KAAKqhB,SAC3BrhB,KAAKgX,KAAK,4BACVhX,KAAK8iB,UAAU,CAAE/a,EAAG,IAAKK,EAAG,CAAEL,EA/ZvB,IA+ZgCK,EAAG,OAItCoa,6BACN,MAAMhB,EAAOxhB,KAAKkiB,eAClBliB,KAAKkiB,eAAiB,KAClBliB,KAAKgiB,MAAQR,GAAQxhB,KAAKiiB,MAAQT,GAEpCxhB,KAAKka,QAQDqI,kBAAkBD,GACxBtiB,KAAKyhB,MAAQ,KAIRa,GAA2D,IAA1CtiB,KAAKqhB,OAQL,IAAXrhB,KAAKqhB,QACdrhB,KAAKgX,KAAK,8BARVhX,KAAKgX,KAAK,+BAENhX,KAAK6gB,UAAUtM,oBACjB3H,EAAkBR,OAAO,QAAUpM,KAAK6gB,UAAUjN,MAElD5T,KAAK6gB,UAAUvM,aAAetU,KAAK6gB,UAAUjN,OAMjD5T,KAAKka,QAGC2J,sBAAsBW,GAC5BxkB,KAAKgX,KAAK,0DAENhX,KAAKkhB,UACPlhB,KAAKkhB,QAAQsD,GACbxkB,KAAKkhB,QAAU,MAKjBlhB,KAAKuX,cAAgB,KAErBvX,KAAKka,QAGC4I,UAAU/c,GAChB,GAAe,IAAX/F,KAAKqhB,OACP,KAAM,8BAENrhB,KAAKgiB,IAAI3H,KAAKtU,GAOlBmU,QACiB,IAAXla,KAAKqhB,SACPrhB,KAAKgX,KAAK,gCACVhX,KAAKqhB,OAAM,EAEXrhB,KAAKukB,oBAEDvkB,KAAKuX,gBACPvX,KAAKuX,gBACLvX,KAAKuX,cAAgB,OAKnBgN,oBACNvkB,KAAKgX,KAAK,iCACNhX,KAAKyhB,QACPzhB,KAAKyhB,MAAMvH,QACXla,KAAKyhB,MAAQ,MAGXzhB,KAAKkiB,iBACPliB,KAAKkiB,eAAehI,QACpBla,KAAKkiB,eAAiB,MAGpBliB,KAAKqiB,kBACP1J,aAAa3Y,KAAKqiB,iBAClBriB,KAAKqiB,gBAAkB,OC5hBP,MAAAoC,GAkBpBC,IACEC,EACA5e,EACA6e,EACAC,IAGFC,MACEH,EACA5e,EACA6e,EACAC,IAOFE,iBAAiB9e,IAMjB+e,qBAAqB/e,IAErBgf,gBACEN,EACA5e,EACA6e,IAGFM,kBACEP,EACA5e,EACA6e,IAGFO,mBACER,EACAC,IAGFQ,YAAYC,KC/DQ,MAAAC,GAQpBhiB,YAAoBiiB,GAAAvlB,KAAculB,eAAdA,EAPZvlB,KAAUwlB,WAKd,GAGF5mB,EACE2B,MAAMC,QAAQ+kB,IAAmBA,EAAejmB,OAAS,EACzD,8BAeMmmB,QAAQC,KAAsB5X,GACtC,GAAIvN,MAAMC,QAAQR,KAAKwlB,WAAWE,IAAa,CAE7C,MAAMC,EAAY,IAAI3lB,KAAKwlB,WAAWE,IAEtC,IAAK,IAAIrmB,EAAI,EAAGA,EAAIsmB,EAAUrmB,OAAQD,IACpCsmB,EAAUtmB,GAAGsG,SAASqI,MAAM2X,EAAUtmB,GAAGumB,QAAS9X,IAKxD+X,GAAGH,EAAmB/f,EAAgCigB,GACpD5lB,KAAK8lB,mBAAmBJ,GACxB1lB,KAAKwlB,WAAWE,GAAa1lB,KAAKwlB,WAAWE,IAAc,GAC3D1lB,KAAKwlB,WAAWE,GAAWrkB,KAAK,CAAEsE,SAAAA,EAAUigB,QAAAA,IAE5C,MAAMG,EAAY/lB,KAAKgmB,gBAAgBN,GACnCK,GACFpgB,EAASqI,MAAM4X,EAASG,GAI5BE,IAAIP,EAAmB/f,EAAgCigB,GACrD5lB,KAAK8lB,mBAAmBJ,GACxB,MAAMC,EAAY3lB,KAAKwlB,WAAWE,IAAc,GAChD,IAAK,IAAIrmB,EAAI,EAAGA,EAAIsmB,EAAUrmB,OAAQD,IACpC,GACEsmB,EAAUtmB,GAAGsG,WAAaA,KACxBigB,GAAWA,IAAYD,EAAUtmB,GAAGumB,SAGtC,YADAD,EAAUO,OAAO7mB,EAAG,GAMlBymB,mBAAmBJ,GACzB9mB,EACEoB,KAAKulB,eAAeY,MAAKC,GAChBA,IAAOV,IAEhB,kBAAoBA,IC9DpB,MAAOW,WAAsBf,GAOjChiB,cACEgjB,MAAM,CAAC,WAPDtmB,KAAOumB,SAAG,EAcI,oBAAX3iB,aAC4B,IAA5BA,OAAOoU,kBACbrU,MAEDC,OAAOoU,iBACL,UACA,KACOhY,KAAKumB,UACRvmB,KAAKumB,SAAU,EACfvmB,KAAKylB,QAAQ,UAAU,OAG3B,GAGF7hB,OAAOoU,iBACL,WACA,KACMhY,KAAKumB,UACPvmB,KAAKumB,SAAU,EACfvmB,KAAKylB,QAAQ,UAAU,OAG3B,IAnCNhM,qBACE,OAAO,IAAI4M,GAuCbL,gBAAgBN,GAEd,OADA9mB,EAAqB,WAAd8mB,EAAwB,uBAAyBA,GACjD,CAAC1lB,KAAKumB,SAGfC,kBACE,OAAOxmB,KAAKumB,SC5CH,MAAAE,GAQXnjB,YAAYojB,EAAiCC,GAC3C,QAAiB,IAAbA,EAAqB,CACvB3mB,KAAK4mB,QAAWF,EAAwBpgB,MAAM,KAG9C,IAAIugB,EAAS,EACb,IAAK,IAAIxnB,EAAI,EAAGA,EAAIW,KAAK4mB,QAAQtnB,OAAQD,IACnCW,KAAK4mB,QAAQvnB,GAAGC,OAAS,IAC3BU,KAAK4mB,QAAQC,GAAU7mB,KAAK4mB,QAAQvnB,GACpCwnB,KAGJ7mB,KAAK4mB,QAAQtnB,OAASunB,EAEtB7mB,KAAK8mB,UAAY,OAEjB9mB,KAAK4mB,QAAUF,EACf1mB,KAAK8mB,UAAYH,EAIrBta,WACE,IAAIsY,EAAa,GACjB,IAAK,IAAItlB,EAAIW,KAAK8mB,UAAWznB,EAAIW,KAAK4mB,QAAQtnB,OAAQD,IAC5B,KAApBW,KAAK4mB,QAAQvnB,KACfslB,GAAc,IAAM3kB,KAAK4mB,QAAQvnB,IAIrC,OAAOslB,GAAc,KAIT,SAAAoC,KACd,OAAO,IAAIN,GAAK,IAGZ,SAAUO,GAAaC,GAC3B,OAAIA,EAAKH,WAAaG,EAAKL,QAAQtnB,OAC1B,KAGF2nB,EAAKL,QAAQK,EAAKH,WAMrB,SAAUI,GAAcD,GAC5B,OAAOA,EAAKL,QAAQtnB,OAAS2nB,EAAKH,UAG9B,SAAUK,GAAaF,GAC3B,IAAIN,EAAWM,EAAKH,UAIpB,OAHIH,EAAWM,EAAKL,QAAQtnB,QAC1BqnB,IAEK,IAAIF,GAAKQ,EAAKL,QAASD,GAG1B,SAAUS,GAAYH,GAC1B,OAAIA,EAAKH,UAAYG,EAAKL,QAAQtnB,OACzB2nB,EAAKL,QAAQK,EAAKL,QAAQtnB,OAAS,GAGrC,KAkBO,SAAA+nB,GAAUJ,EAAYK,EAAgB,GACpD,OAAOL,EAAKL,QAAQW,MAAMN,EAAKH,UAAYQ,GAGvC,SAAUE,GAAWP,GACzB,GAAIA,EAAKH,WAAaG,EAAKL,QAAQtnB,OACjC,OAAO,KAGT,MAAMmoB,EAAS,GACf,IAAK,IAAIpoB,EAAI4nB,EAAKH,UAAWznB,EAAI4nB,EAAKL,QAAQtnB,OAAS,EAAGD,IACxDooB,EAAOpmB,KAAK4lB,EAAKL,QAAQvnB,IAG3B,OAAO,IAAIonB,GAAKgB,EAAQ,GAGV,SAAAC,GAAUT,EAAYU,GACpC,MAAMF,EAAS,GACf,IAAK,IAAIpoB,EAAI4nB,EAAKH,UAAWznB,EAAI4nB,EAAKL,QAAQtnB,OAAQD,IACpDooB,EAAOpmB,KAAK4lB,EAAKL,QAAQvnB,IAG3B,GAAIsoB,aAAwBlB,GAC1B,IAAK,IAAIpnB,EAAIsoB,EAAab,UAAWznB,EAAIsoB,EAAaf,QAAQtnB,OAAQD,IACpEooB,EAAOpmB,KAAKsmB,EAAaf,QAAQvnB,QAE9B,CACL,MAAMuoB,EAAcD,EAAarhB,MAAM,KACvC,IAAK,IAAIjH,EAAI,EAAGA,EAAIuoB,EAAYtoB,OAAQD,IAClCuoB,EAAYvoB,GAAGC,OAAS,GAC1BmoB,EAAOpmB,KAAKumB,EAAYvoB,IAK9B,OAAO,IAAIonB,GAAKgB,EAAQ,GAMpB,SAAUI,GAAYZ,GAC1B,OAAOA,EAAKH,WAAaG,EAAKL,QAAQtnB,OAMxB,SAAAwoB,GAAgBC,EAAiBC,GAC/C,MAAMC,EAAQjB,GAAae,GACzBG,EAAQlB,GAAagB,GACvB,GAAc,OAAVC,EACF,OAAOD,EACF,GAAIC,IAAUC,EACnB,OAAOJ,GAAgBX,GAAaY,GAAYZ,GAAaa,IAE7D,MAAM,IAAIhpB,MACR,8BACEgpB,EADF,8BAIED,EACA,KAQQ,SAAAI,GAAYC,EAAYC,GACtC,MAAMC,EAAWjB,GAAUe,EAAM,GAC3BG,EAAYlB,GAAUgB,EAAO,GACnC,IAAK,IAAIhpB,EAAI,EAAGA,EAAIipB,EAAShpB,QAAUD,EAAIkpB,EAAUjpB,OAAQD,IAAK,CAChE,MAAMmpB,EAAMxZ,GAAYsZ,EAASjpB,GAAIkpB,EAAUlpB,IAC/C,GAAY,IAARmpB,EACF,OAAOA,EAGX,OAAIF,EAAShpB,SAAWipB,EAAUjpB,OACzB,EAEFgpB,EAAShpB,OAASipB,EAAUjpB,QAAU,EAAI,EAMnC,SAAAmpB,GAAWxB,EAAYyB,GACrC,GAAIxB,GAAcD,KAAUC,GAAcwB,GACxC,OAAO,EAGT,IACE,IAAIrpB,EAAI4nB,EAAKH,UAAWne,EAAI+f,EAAM5B,UAClCznB,GAAK4nB,EAAKL,QAAQtnB,OAClBD,IAAKsJ,IAEL,GAAIse,EAAKL,QAAQvnB,KAAOqpB,EAAM9B,QAAQje,GACpC,OAAO,EAIX,OAAO,EAMO,SAAAggB,GAAa1B,EAAYyB,GACvC,IAAIrpB,EAAI4nB,EAAKH,UACTne,EAAI+f,EAAM5B,UACd,GAAII,GAAcD,GAAQC,GAAcwB,GACtC,OAAO,EAET,KAAOrpB,EAAI4nB,EAAKL,QAAQtnB,QAAQ,CAC9B,GAAI2nB,EAAKL,QAAQvnB,KAAOqpB,EAAM9B,QAAQje,GACpC,OAAO,IAEPtJ,IACAsJ,EAEJ,OAAO,EAaI,MAAAigB,GASXtlB,YAAY2jB,EAAmB4B,GAAA7oB,KAAY6oB,aAAZA,EAC7B7oB,KAAK8oB,OAASzB,GAAUJ,EAAM,GAE9BjnB,KAAK+oB,YAAc1Y,KAAK2Y,IAAI,EAAGhpB,KAAK8oB,OAAOxpB,QAE3C,IAAK,IAAID,EAAI,EAAGA,EAAIW,KAAK8oB,OAAOxpB,OAAQD,IACtCW,KAAK+oB,aAAehgB,EAAa/I,KAAK8oB,OAAOzpB,IAE/C4pB,GAAyBjpB,OA0B7B,SAASipB,GAAyBC,GAChC,GAAIA,EAAeH,YAvRS,IAwR1B,MAAM,IAAI/pB,MACRkqB,EAAeL,aAAfK,yCAIEA,EAAeH,YACf,MAGN,GAAIG,EAAeJ,OAAOxpB,OApSL,GAqSnB,MAAM,IAAIN,MACRkqB,EAAeL,aAAfK,gGAIEC,GAA4BD,IAQ9B,SAAUC,GACdD,GAEA,OAAqC,IAAjCA,EAAeJ,OAAOxpB,OACjB,GAEF,gBAAkB4pB,EAAeJ,OAAOxnB,KAAK,KAAO,ICvTvD,MAAO8nB,WAA0B9D,GAOrChiB,cAEE,IAAI+lB,EACAC,EAFJhD,MAAM,CAAC,YAIe,oBAAbthB,eAC8B,IAA9BA,SAASgT,wBAEkB,IAAvBhT,SAAiB,QAE1BskB,EAAmB,mBACnBD,EAAS,eACiC,IAA1BrkB,SAAoB,WACpCskB,EAAmB,sBACnBD,EAAS,kBACgC,IAAzBrkB,SAAmB,UACnCskB,EAAmB,qBACnBD,EAAS,iBACoC,IAA7BrkB,SAAuB,eACvCskB,EAAmB,yBACnBD,EAAS,iBAQbrpB,KAAKupB,UAAW,EAEZD,GACFtkB,SAASgT,iBACPsR,GACA,KACE,MAAME,GAAWxkB,SAASqkB,GACtBG,IAAYxpB,KAAKupB,WACnBvpB,KAAKupB,SAAWC,EAChBxpB,KAAKylB,QAAQ,UAAW+D,OAG5B,GA5CN/P,qBACE,OAAO,IAAI2P,GAgDbpD,gBAAgBN,GAEd,OADA9mB,EAAqB,YAAd8mB,EAAyB,uBAAyBA,GAClD,CAAC1lB,KAAKupB,WCWX,MAAOE,WAA6BhF,GAwDxCnhB,YACUud,EACAC,EACA4I,EAMAC,EACAC,EACAC,EACAC,EACAC,GAIR,GAFAzD,QAdQtmB,KAAS6gB,UAATA,EACA7gB,KAAc8gB,eAAdA,EACA9gB,KAAa0pB,cAAbA,EAMA1pB,KAAgB2pB,iBAAhBA,EACA3pB,KAAmB4pB,oBAAnBA,EACA5pB,KAAkB6pB,mBAAlBA,EACA7pB,KAAsB8pB,uBAAtBA,EACA9pB,KAAa+pB,cAAbA,EAnEV/pB,KAAAyN,GAAKgc,GAAqBO,8BAClBhqB,KAAIgX,KAAGzI,GAAW,KAAOvO,KAAKyN,GAAK,KAEnCzN,KAAiBiqB,kBAAkC,GAC1CjqB,KAAAkqB,QAGb,IAAIC,IACAnqB,KAAgBoqB,iBAAqB,GACrCpqB,KAAgBqqB,iBAAqB,GACrCrqB,KAAoBsqB,qBAAG,EACvBtqB,KAAoBuqB,qBAAG,EACvBvqB,KAAyBwqB,0BAA0B,GACnDxqB,KAAUyqB,YAAG,EACbzqB,KAAe0qB,gBA5DG,IA6DlB1qB,KAAkB2qB,mBA5DQ,IA6D1B3qB,KAAsB4qB,uBAAiC,KAC/D5qB,KAAa4W,cAAkB,KAEvB5W,KAAyB6qB,0BAAkB,KAE3C7qB,KAAQupB,UAAY,EAGpBvpB,KAAc8qB,eAA0C,GACxD9qB,KAAc+qB,eAAG,EAEjB/qB,KAASgrB,UAGN,KAEHhrB,KAAUghB,WAAkB,KAC5BhhB,KAAc+gB,eAAkB,KAChC/gB,KAAkBirB,oBAAG,EACrBjrB,KAAsBkrB,uBAAG,EACzBlrB,KAA0BmrB,2BAAG,EAE7BnrB,KAAgBorB,kBAAG,EACnBprB,KAA0BqrB,2BAAkB,KAC5CrrB,KAA8BsrB,+BAAkB,KA+BlDvB,IAAkBhmB,IACpB,MAAM,IAAI/E,MACR,kFAIJoqB,GAAkBmC,cAAc1F,GAAG,UAAW7lB,KAAKwrB,WAAYxrB,OAEpB,IAAvC6gB,EAAUjN,KAAKS,QAAQ,YACzBgS,GAAckF,cAAc1F,GAAG,SAAU7lB,KAAKyrB,UAAWzrB,MAInD2iB,YACR+I,EACA3T,EACA4T,GAEA,MAAMC,IAAc5rB,KAAK+qB,eAEnBlI,EAAM,CAAEgJ,EAAGD,EAAW1jB,EAAGwjB,EAAQvjB,EAAG4P,GAC1C/X,KAAKgX,KAAKlR,EAAU+c,IACpBjkB,EACEoB,KAAKyqB,WACL,0DAEFzqB,KAAKgrB,UAAUrI,YAAYE,GACvB8I,IACF3rB,KAAK8qB,eAAec,GAAaD,GAIrC1f,IAAI2I,GACF5U,KAAK8rB,kBAEL,MAAMC,EAAW,IAAI1mB,EAKf2mB,EAAiB,CACrBN,OAAQ,IACRO,QANc,CACd7sB,EAAGwV,EAAMsX,MAAM7f,WACf8f,EAAGvX,EAAMwX,cAKTxH,WAAa9lB,IACX,MAAM6kB,EAAU7kB,EAAW,EACN,OAAjBA,EAAW,EACbitB,EAASxmB,QAAQoe,GAEjBoI,EAASzmB,OAAOqe,KAItB3jB,KAAKqqB,iBAAiBhpB,KAAK2qB,GAC3BhsB,KAAKuqB,uBACL,MAAM8B,EAAQrsB,KAAKqqB,iBAAiB/qB,OAAS,EAM7C,OAJIU,KAAKyqB,YACPzqB,KAAKssB,SAASD,GAGTN,EAASvmB,QAGlB+mB,OACE3X,EACA4X,EACAC,EACA7H,GAEA5kB,KAAK8rB,kBAEL,MAAMY,EAAU9X,EAAM+X,iBAChBhI,EAAa/P,EAAMsX,MAAM7f,WAC/BrM,KAAKgX,KAAK,qBAAuB2N,EAAa,IAAM+H,GAC/C1sB,KAAKkqB,QAAQ0C,IAAIjI,IACpB3kB,KAAKkqB,QAAQre,IAAI8Y,EAAY,IAAIwF,KAEnCvrB,EACEgW,EAAMiY,aAAaC,cAAgBlY,EAAMiY,aAAaE,eACtD,sDAEFnuB,GACGoB,KAAKkqB,QAAQje,IAAI0Y,GAAaiI,IAAIF,GACnC,gDAEF,MAAMM,EAAyB,CAC7BpI,WAAAA,EACAqI,OAAQT,EACR5X,MAAAA,EACA6X,IAAAA,GAEFzsB,KAAKkqB,QAAQje,IAAI0Y,GAAa9Y,IAAI6gB,EAASM,GAEvChtB,KAAKyqB,YACPzqB,KAAKktB,YAAYF,GAIbV,SAASD,GACf,MAAMpgB,EAAMjM,KAAKqqB,iBAAiBgC,GAClCrsB,KAAK2iB,YAAY,IAAK1W,EAAIggB,SAAUntB,WAC3BkB,KAAKqqB,iBAAiBgC,GAC7BrsB,KAAKuqB,uBAC6B,IAA9BvqB,KAAKuqB,uBACPvqB,KAAKqqB,iBAAmB,IAEtBpe,EAAI2Y,YACN3Y,EAAI2Y,WAAW9lB,MAKbouB,YAAYF,GAClB,MAAMpY,EAAQoY,EAAWpY,MACnB+P,EAAa/P,EAAMsX,MAAM7f,WACzBqgB,EAAU9X,EAAM+X,iBACtB3sB,KAAKgX,KAAK,aAAe2N,EAAa,QAAU+H,GAChD,MAAMS,EAAgC,CAAW/tB,EAAGulB,GAKhDqI,EAAWP,MACbU,EAAO,EAAIvY,EAAMwX,aACjBe,EAAO,EAAIH,EAAWP,KAGxBU,EAAgB,EAAIH,EAAWC,SAE/BjtB,KAAK2iB,YAVU,IAUUwK,GAAMruB,IAC7B,MAAM6kB,EAAmB7kB,EAAoB,EACvCsuB,EAAStuB,EAAsB,EAGrC2qB,GAAqB4D,sBAAsB1J,EAAS/O,IAGlD5U,KAAKkqB,QAAQje,IAAI0Y,IACjB3kB,KAAKkqB,QAAQje,IAAI0Y,GAAa1Y,IAAIygB,MAEVM,IACxBhtB,KAAKgX,KAAK,kBAAmBlY,GAEd,OAAXsuB,GACFptB,KAAKstB,cAAc3I,EAAY+H,GAG7BM,EAAWpI,YACboI,EAAWpI,WAAWwI,EAAQzJ,OAM9BlK,6BAA6BkK,EAAkB/O,GACrD,GAAI+O,GAA8B,iBAAZA,GAAwBpd,EAASod,EAAS,KAAM,CAEpE,MAAM4J,EAAW3mB,EAAQ+c,EAAgB,KACzC,GAAIpjB,MAAMC,QAAQ+sB,KAAcA,EAASlZ,QAAQ,YAAa,CAC5D,MAAMmZ,EACJ,gBAAkB5Y,EAAMiY,aAAaY,WAAWphB,WAAa,IACzDqhB,EAAY9Y,EAAMsX,MAAM7f,WAC9B1H,GAEI,wGAA2C6oB,QACxCE,sDAMb3I,iBAAiB9e,GACfjG,KAAKghB,WAAa/a,EAClBjG,KAAKgX,KAAK,wBACNhX,KAAKghB,WACPhhB,KAAK2tB,UAID3tB,KAAKyqB,YACPzqB,KAAK2iB,YAAY,SAAU,IAAI,SAInC3iB,KAAK4tB,uCAAuC3nB,GAGtC2nB,uCAAuCC,IAGpBA,GAAoC,KAAtBA,EAAWvuB,Q7BjN/B,SAAU2G,GAC/B,MAAME,EAAiBH,EAAOC,GAAOE,OACrC,MAAyB,iBAAXA,IAA2C,IAApBA,EAAc,M6BgNzB2nB,CAAQD,MAC9B7tB,KAAKgX,KACH,iEAEFhX,KAAK2qB,mBAtT4B,KA0TrC3F,qBAAqB/e,GACnBjG,KAAK+gB,eAAiB9a,EACtBjG,KAAKgX,KAAK,6BACNhX,KAAK+gB,eACP/gB,KAAK+tB,cAKD/tB,KAAKyqB,YACPzqB,KAAK2iB,YAAY,WAAY,IAAI,SASvCgL,UACE,GAAI3tB,KAAKyqB,YAAczqB,KAAKghB,WAAY,CACtC,MAAM/a,EAAQjG,KAAKghB,WACbgN,E7B9PiB,SAAU/nB,GACrC,MACEE,EADcH,EAAOC,GACJE,OAEnB,QAASA,GAA4B,iBAAXA,GAAuBA,EAAOzC,eAAe,O6B0PhDuqB,CAAchoB,GAAS,OAAS,QAC7CioB,EAAwC,CAAEC,KAAMloB,GAC3B,OAAvBjG,KAAK+pB,cACPmE,EAAoB,QAAI,EACe,iBAAvBluB,KAAK+pB,gBACrBmE,EAAqB,QAAIluB,KAAK+pB,eAEhC/pB,KAAK2iB,YACHqL,EACAE,GACCjnB,IACC,MAAMmmB,EAASnmB,EAAkB,EAC3BlB,EAAQkB,EAAgB,GAAgB,QAE1CjH,KAAKghB,aAAe/a,IACP,OAAXmnB,EACFptB,KAAKkrB,uBAAyB,EAG9BlrB,KAAKouB,eAAehB,EAAQrnB,QAaxCgoB,cACM/tB,KAAKyqB,YAAczqB,KAAK+gB,gBAC1B/gB,KAAK2iB,YACH,WACA,CAAE1c,MAASjG,KAAK+gB,iBACf9Z,IACC,MAAMmmB,EAASnmB,EAAkB,EAC3BlB,EAAQkB,EAAgB,GAAgB,QAC/B,OAAXmmB,EACFptB,KAAKmrB,2BAA6B,EAElCnrB,KAAKquB,mBAAmBjB,EAAQrnB,MAU1CuoB,SAAS1Z,EAAqB6X,GAC5B,MAAM9H,EAAa/P,EAAMsX,MAAM7f,WACzBqgB,EAAU9X,EAAM+X,iBAEtB3sB,KAAKgX,KAAK,uBAAyB2N,EAAa,IAAM+H,GAEtD9tB,EACEgW,EAAMiY,aAAaC,cAAgBlY,EAAMiY,aAAaE,eACtD,wDAEa/sB,KAAKstB,cAAc3I,EAAY+H,IAChC1sB,KAAKyqB,YACjBzqB,KAAKuuB,cAAc5J,EAAY+H,EAAS9X,EAAMwX,aAAcK,GAIxD8B,cACN5J,EACA+H,EACA8B,EACA/B,GAEAzsB,KAAKgX,KAAK,eAAiB2N,EAAa,QAAU+H,GAElD,MAAMS,EAAgC,CAAW/tB,EAAGulB,GAGhD8H,IACFU,EAAO,EAAIqB,EACXrB,EAAO,EAAIV,GAGbzsB,KAAK2iB,YAPU,IAOUwK,GAG3BlI,gBACEN,EACA5e,EACA6e,GAEA5kB,KAAK8rB,kBAED9rB,KAAKyqB,WACPzqB,KAAKyuB,kBAAkB,IAAK9J,EAAY5e,EAAM6e,GAE9C5kB,KAAKwqB,0BAA0BnpB,KAAK,CAClCsjB,WAAAA,EACA+G,OAAQ,IACR3lB,KAAAA,EACA6e,WAAAA,IAKNM,kBACEP,EACA5e,EACA6e,GAEA5kB,KAAK8rB,kBAED9rB,KAAKyqB,WACPzqB,KAAKyuB,kBAAkB,KAAM9J,EAAY5e,EAAM6e,GAE/C5kB,KAAKwqB,0BAA0BnpB,KAAK,CAClCsjB,WAAAA,EACA+G,OAAQ,KACR3lB,KAAAA,EACA6e,WAAAA,IAKNO,mBACER,EACAC,GAEA5kB,KAAK8rB,kBAED9rB,KAAKyqB,WACPzqB,KAAKyuB,kBAAkB,KAAM9J,EAAY,KAAMC,GAE/C5kB,KAAKwqB,0BAA0BnpB,KAAK,CAClCsjB,WAAAA,EACA+G,OAAQ,KACR3lB,KAAM,KACN6e,WAAAA,IAKE6J,kBACN/C,EACA/G,EACA5e,EACA6e,GAEA,MAAMqH,EAAU,CAAW7sB,EAAGulB,EAAqBvc,EAAGrC,GACtD/F,KAAKgX,KAAK,gBAAkB0U,EAAQO,GACpCjsB,KAAK2iB,YAAY+I,EAAQO,GAAUyC,IAC7B9J,GACFrT,YAAW,KACTqT,EACE8J,EAAuB,EACvBA,EAAuB,KAExBre,KAAKI,MAAM,OAKpBiU,IACEC,EACA5e,EACA6e,EACAC,GAEA7kB,KAAK2uB,YAAY,IAAKhK,EAAY5e,EAAM6e,EAAYC,GAGtDC,MACEH,EACA5e,EACA6e,EACAC,GAEA7kB,KAAK2uB,YAAY,IAAKhK,EAAY5e,EAAM6e,EAAYC,GAGtD8J,YACEjD,EACA/G,EACA5e,EACA6e,EACAC,GAEA7kB,KAAK8rB,kBAEL,MAAMG,EAAoC,CAC/B7sB,EAAGulB,EACHvc,EAAGrC,QAGD7C,IAAT2hB,IACFoH,EAAoB,EAAIpH,GAI1B7kB,KAAKoqB,iBAAiB/oB,KAAK,CACzBqqB,OAAAA,EACAO,QAAAA,EACArH,WAAAA,IAGF5kB,KAAKsqB,uBACL,MAAM+B,EAAQrsB,KAAKoqB,iBAAiB9qB,OAAS,EAEzCU,KAAKyqB,WACPzqB,KAAK4uB,SAASvC,GAEdrsB,KAAKgX,KAAK,kBAAoB2N,GAI1BiK,SAASvC,GACf,MAAMX,EAAS1rB,KAAKoqB,iBAAiBiC,GAAOX,OACtCO,EAAUjsB,KAAKoqB,iBAAiBiC,GAAOJ,QACvCrH,EAAa5kB,KAAKoqB,iBAAiBiC,GAAOzH,WAChD5kB,KAAKoqB,iBAAiBiC,GAAOwC,OAAS7uB,KAAKyqB,WAE3CzqB,KAAK2iB,YAAY+I,EAAQO,GAAUntB,IACjCkB,KAAKgX,KAAK0U,EAAS,YAAa5sB,UAEzBkB,KAAKoqB,iBAAiBiC,GAC7BrsB,KAAKsqB,uBAG6B,IAA9BtqB,KAAKsqB,uBACPtqB,KAAKoqB,iBAAmB,IAGtBxF,GACFA,EACE9lB,EAAsB,EACtBA,EAAsB,MAM9BsmB,YAAYC,GAEV,GAAIrlB,KAAKyqB,WAAY,CACnB,MAAMwB,EAAU,CAAe1sB,EAAG8lB,GAClCrlB,KAAKgX,KAAK,cAAeiV,GAEzBjsB,KAAK2iB,YAAsB,IAAKsJ,GAAS6C,IAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,MAAMC,EAAcD,EAAqB,EACzC9uB,KAAKgX,KAAK,cAAe,wBAA0B+X,QAMnDtL,eAAe3kB,GACrB,GAAI,MAAOA,EAAS,CAElBkB,KAAKgX,KAAK,gBAAkBlR,EAAUhH,IACtC,MAAMkwB,EAASlwB,EAAW,EACpB6sB,EAAa3rB,KAAK8qB,eAAekE,GACnCrD,WACK3rB,KAAK8qB,eAAekE,GAC3BrD,EAAW7sB,EAAoB,QAE5B,CAAA,GAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhBkB,KAAKivB,YAAYnwB,EAAW,EAAaA,EAAW,IAIhDmwB,YAAYvD,EAAgB3T,GAClC/X,KAAKgX,KAAK,sBAAuB0U,EAAQ3T,GAC1B,MAAX2T,EACF1rB,KAAK0pB,cACH3R,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEU,MAAX2T,EACT1rB,KAAK0pB,cACH3R,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEU,MAAX2T,EACT1rB,KAAKkvB,iBACHnX,EAAiB,EACjBA,EAAkB,GAEA,OAAX2T,EACT1rB,KAAKouB,eACHrW,EAAwB,EACxBA,EAA0B,GAER,QAAX2T,EACT1rB,KAAKquB,mBACHtW,EAAwB,EACxBA,EAA0B,GAER,OAAX2T,EACT1rB,KAAKmvB,uBAAuBpX,GAE5BjV,GACE,6CACEgD,EAAU4lB,GACV,sCAKAzK,SAASgD,EAAmBE,GAClCnkB,KAAKgX,KAAK,oBACVhX,KAAKyqB,YAAa,EAClBzqB,KAAKsrB,gCAAiC,IAAI/nB,MAAOC,UACjDxD,KAAKovB,iBAAiBnL,GACtBjkB,KAAK4W,cAAgBuN,EACjBnkB,KAAKorB,kBACPprB,KAAKqvB,oBAEPrvB,KAAKsvB,gBACLtvB,KAAKorB,kBAAmB,EACxBprB,KAAK2pB,kBAAiB,GAGhB4F,iBAAiB5d,GACvB/S,GACGoB,KAAKgrB,UACN,0DAGEhrB,KAAK6qB,2BACPlS,aAAa3Y,KAAK6qB,2BAMpB7qB,KAAK6qB,0BAA4BtZ,YAAW,KAC1CvR,KAAK6qB,0BAA4B,KACjC7qB,KAAKwvB,yBAEJnf,KAAKI,MAAMkB,IAGRma,mBACD9rB,KAAKgrB,WAAahrB,KAAKorB,kBAC1BprB,KAAKuvB,iBAAiB,GAIlB/D,WAAWhC,GAGfA,IACCxpB,KAAKupB,UACNvpB,KAAK0qB,kBAAoB1qB,KAAK2qB,qBAE9B3qB,KAAKgX,KAAK,2CACVhX,KAAK0qB,gBAjsBiB,IAmsBjB1qB,KAAKgrB,WACRhrB,KAAKuvB,iBAAiB,IAG1BvvB,KAAKupB,SAAWC,EAGViC,UAAUgE,GACZA,GACFzvB,KAAKgX,KAAK,wBACVhX,KAAK0qB,gBA7sBiB,IA8sBjB1qB,KAAKgrB,WACRhrB,KAAKuvB,iBAAiB,KAGxBvvB,KAAKgX,KAAK,8CACNhX,KAAKgrB,WACPhrB,KAAKgrB,UAAU9Q,SAKbwV,wBAWN,GAVA1vB,KAAKgX,KAAK,4BACVhX,KAAKyqB,YAAa,EAClBzqB,KAAKgrB,UAAY,KAGjBhrB,KAAK2vB,0BAGL3vB,KAAK8qB,eAAiB,GAElB9qB,KAAK4vB,mBAAoB,CAC3B,GAAK5vB,KAAKupB,UAIH,GAAIvpB,KAAKsrB,+BAAgC,EAG5C,IAAI/nB,MAAOC,UAAYxD,KAAKsrB,+BAxuBA,MA0uB5BtrB,KAAK0qB,gBA9uBa,KAgvBpB1qB,KAAKsrB,+BAAiC,WAVtCtrB,KAAKgX,KAAK,8CACVhX,KAAK0qB,gBAAkB1qB,KAAK2qB,mBAC5B3qB,KAAKqrB,4BAA6B,IAAI9nB,MAAOC,UAW/C,MAAMqsB,GACJ,IAAItsB,MAAOC,UAAYxD,KAAKqrB,2BAC9B,IAAIyE,EAAiBzf,KAAK2Y,IACxB,EACAhpB,KAAK0qB,gBAAkBmF,GAEzBC,EAAiBzf,KAAK2I,SAAW8W,EAEjC9vB,KAAKgX,KAAK,0BAA4B8Y,EAAiB,MACvD9vB,KAAKuvB,iBAAiBO,GAGtB9vB,KAAK0qB,gBAAkBra,KAAKG,IAC1BxQ,KAAK2qB,mBA7vBsB,IA8vB3B3qB,KAAK0qB,iBAGT1qB,KAAK2pB,kBAAiB,GAGhBrM,6BACN,GAAItd,KAAK4vB,mBAAoB,CAC3B5vB,KAAKgX,KAAK,+BACVhX,KAAKqrB,4BAA6B,IAAI9nB,MAAOC,UAC7CxD,KAAKsrB,+BAAiC,KACtC,MAAMyE,EAAgB/vB,KAAKyjB,eAAenV,KAAKtO,MACzCgwB,EAAUhwB,KAAKihB,SAAS3S,KAAKtO,MAC7BqX,EAAerX,KAAK0vB,sBAAsBphB,KAAKtO,MAC/CuW,EAASvW,KAAKyN,GAAK,IAAMgc,GAAqBwG,oBAC9CrZ,EAAgB5W,KAAK4W,cAC3B,IAAIsZ,GAAW,EACXC,EAAgC,KACpC,MAAMC,EAAU,WACVD,EACFA,EAAWjW,SAEXgW,GAAW,EACX7Y,MAGEgZ,EAAgB,SAAUxN,GAC9BjkB,EACEuxB,EACA,0DAEFA,EAAWxN,YAAYE,IAGzB7iB,KAAKgrB,UAAY,CACf9Q,MAAOkW,EACPzN,YAAa0N,GAGf,MAAM/d,EAAetS,KAAKirB,mBAC1BjrB,KAAKirB,oBAAqB,EAE1B,IAGE,MAAOvU,EAAWD,SAAuBhR,QAAQ6qB,IAAI,CACnDtwB,KAAK6pB,mBAAmBxX,SAASC,GACjCtS,KAAK8pB,uBAAuBzX,SAASC,KAGlC4d,EAoBH3iB,EAAI,0CAnBJA,EAAI,8CACJvN,KAAKghB,WAAatK,GAAaA,EAAUlD,YACzCxT,KAAK+gB,eAAiBtK,GAAiBA,EAAcxQ,MACrDkqB,EAAa,IAAIvP,GACfrK,EACAvW,KAAK6gB,UACL7gB,KAAK8gB,eACL9gB,KAAK+gB,eACL/gB,KAAKghB,WACL+O,EACAC,EACA3Y,GACcmN,IACZ7f,GAAK6f,EAAS,KAAOxkB,KAAK6gB,UAAUxU,WAAa,KACjDrM,KAAKuwB,UA7zBkB,iBA+zBzB3Z,IAKJ,MAAO9T,GACP9C,KAAKgX,KAAK,wBAA0BlU,GAC/BotB,IACClwB,KAAK6gB,UAAU7M,WAIjBrP,GAAK7B,GAEPstB,OAMRG,UAAU/L,GACRjX,EAAI,uCAAyCiX,GAC7CxkB,KAAKiqB,kBAAkBzF,IAAU,EAC7BxkB,KAAKgrB,UACPhrB,KAAKgrB,UAAU9Q,SAEXla,KAAK6qB,4BACPlS,aAAa3Y,KAAK6qB,2BAClB7qB,KAAK6qB,0BAA4B,MAE/B7qB,KAAKyqB,YACPzqB,KAAK0vB,yBAKXc,OAAOhM,GACLjX,EAAI,mCAAqCiX,UAClCxkB,KAAKiqB,kBAAkBzF,GAC1B3d,EAAQ7G,KAAKiqB,qBACfjqB,KAAK0qB,gBA52BiB,IA62BjB1qB,KAAKgrB,WACRhrB,KAAKuvB,iBAAiB,IAKpBH,iBAAiBnL,GACvB,MAAMwM,EAAQxM,GAAY,IAAI1gB,MAAOC,UACrCxD,KAAK4pB,oBAAoB,CAAE8G,iBAAkBD,IAGvCd,0BACN,IAAK,IAAItwB,EAAI,EAAGA,EAAIW,KAAKoqB,iBAAiB9qB,OAAQD,IAAK,CACrD,MAAMqlB,EAAM1kB,KAAKoqB,iBAAiB/qB,GAC9BqlB,GAAgB,MAAOA,EAAIuH,SAAWvH,EAAImK,SACxCnK,EAAIE,YACNF,EAAIE,WAAW,qBAGV5kB,KAAKoqB,iBAAiB/qB,GAC7BW,KAAKsqB,wBAKyB,IAA9BtqB,KAAKsqB,uBACPtqB,KAAKoqB,iBAAmB,IAIpB8E,iBAAiBvK,EAAoB/P,GAE3C,IAAI8X,EAIFA,EAHG9X,EAGOA,EAAM9N,KAAIqlB,GAAK7c,GAAkB6c,KAAI7qB,KAAK,KAF1C,UAIZ,MAAMirB,EAASvsB,KAAKstB,cAAc3I,EAAY+H,GAC1CH,GAAUA,EAAO3H,YACnB2H,EAAO3H,WAAW,qBAId0I,cAAc3I,EAAoB+H,GACxC,MAAMiE,EAAuB,IAAIlK,GAAK9B,GAAYtY,WAClD,IAAIkgB,EACJ,GAAIvsB,KAAKkqB,QAAQ0C,IAAI+D,GAAuB,CAC1C,MAAM7pB,EAAM9G,KAAKkqB,QAAQje,IAAI0kB,GAC7BpE,EAASzlB,EAAImF,IAAIygB,GACjB5lB,EAAIoW,OAAOwP,GACM,IAAb5lB,EAAIsV,MACNpc,KAAKkqB,QAAQhN,OAAOyT,QAItBpE,OAASrpB,EAEX,OAAOqpB,EAGD6B,eAAewC,EAAoBC,GACzCtjB,EAAI,uBAAyBqjB,EAAa,IAAMC,GAChD7wB,KAAKghB,WAAa,KAClBhhB,KAAKirB,oBAAqB,EAC1BjrB,KAAKgrB,UAAU9Q,QACI,kBAAf0W,GAAiD,sBAAfA,IAIpC5wB,KAAKkrB,yBACDlrB,KAAKkrB,wBA56BiB,IA86BxBlrB,KAAK0qB,gBAp7B0B,IAw7B/B1qB,KAAK6pB,mBAAmBlX,0BAKtB0b,mBAAmBuC,EAAoBC,GAC7CtjB,EAAI,4BAA8BqjB,EAAa,IAAMC,GACrD7wB,KAAK+gB,eAAiB,KACtB/gB,KAAKirB,oBAAqB,EAGP,kBAAf2F,GAAiD,sBAAfA,IAIpC5wB,KAAKmrB,6BACDnrB,KAAKmrB,4BAl8BiB,GAm8BxBnrB,KAAK8pB,uBAAuBnX,yBAK1Bwc,uBAAuBpX,GACzB/X,KAAK4qB,uBACP5qB,KAAK4qB,uBAAuB7S,GAExB,QAASA,GACXlV,QAAQ0K,IACN,aAAgBwK,EAAU,IAAarV,QAAQ,KAAM,iBAMrD4sB,gBAENtvB,KAAK2tB,UACL3tB,KAAK+tB,cAIL,IAAK,MAAM+C,KAAW9wB,KAAKkqB,QAAQ6G,SACjC,IAAK,MAAM/D,KAAc8D,EAAQC,SAC/B/wB,KAAKktB,YAAYF,GAIrB,IAAK,IAAI3tB,EAAI,EAAGA,EAAIW,KAAKoqB,iBAAiB9qB,OAAQD,IAC5CW,KAAKoqB,iBAAiB/qB,IACxBW,KAAK4uB,SAASvvB,GAIlB,KAAOW,KAAKwqB,0BAA0BlrB,QAAQ,CAC5C,MAAM2sB,EAAUjsB,KAAKwqB,0BAA0BhO,QAC/Cxc,KAAKyuB,kBACHxC,EAAQP,OACRO,EAAQtH,WACRsH,EAAQlmB,KACRkmB,EAAQrH,YAIZ,IAAK,IAAIvlB,EAAI,EAAGA,EAAIW,KAAKqqB,iBAAiB/qB,OAAQD,IAC5CW,KAAKqqB,iBAAiBhrB,IACxBW,KAAKssB,SAASjtB,GAQZgwB,oBACN,MAAMhK,EAAiC,GAWvCA,EAAM,UAA4B9Z,EAAY7I,QAAQ,MAAO,MAAQ,EAEjEiB,IACF0hB,EAAM,qBAAuB,EjC39BV,iBAAdvhB,WAAmD,gBAAzBA,UAAmB,UiC69BlDuhB,EAAM,yBAA2B,GAEnCrlB,KAAKolB,YAAYC,GAGXuK,mBACN,MAAMH,EAASpJ,GAAckF,cAAc/E,kBAC3C,OAAO3f,EAAQ7G,KAAKiqB,oBAAsBwF,GAn8B7BhG,GAA2BO,4BAAG,EAK9BP,GAAiBwG,kBAAG,ECQxB,MAAAe,GACX1tB,YAAmB8F,EAAqB6nB,GAArBjxB,KAAIoJ,KAAJA,EAAqBpJ,KAAIixB,KAAJA,EAExCxX,YAAYrQ,EAAc6nB,GACxB,OAAO,IAAID,GAAU5nB,EAAM6nB,IChIT,MAAAC,GASpBC,aACE,OAAOnxB,KAAKoxB,QAAQ9iB,KAAKtO,MAU3BqxB,oBAAoBC,EAAeC,GACjC,MAAMC,EAAa,IAAIR,GAAUliB,GAAUwiB,GACrCG,EAAa,IAAIT,GAAUliB,GAAUyiB,GAC3C,OAAgD,IAAzCvxB,KAAKoxB,QAAQI,EAAYC,GAOlCC,UAEE,OAAQV,GAAkBW,KC5B9B,IAAIC,GAEE,MAAOC,WAAiBX,GACjBU,0BACT,OAAOA,GAGEA,wBAAa1kB,GACtB0kB,GAAe1kB,EAEjBkkB,QAAQlpB,EAAcC,GACpB,OAAO6G,GAAY9G,EAAEkB,KAAMjB,EAAEiB,MAE/B0oB,YAAYb,GAGV,MAAMlyB,EAAe,mDAEvBsyB,oBAAoBC,EAAeC,GACjC,OAAO,EAETG,UAEE,OAAQV,GAAkBW,IAE5BI,UAGE,OAAO,IAAIf,GAAUjiB,GAAU6iB,IAGjCI,SAASC,EAAoB7oB,GAM3B,OALAxK,EACwB,iBAAfqzB,EACP,gDAGK,IAAIjB,GAAUiB,EAAYL,IAMnCvlB,WACE,MAAO,QAIJ,MAAM6lB,GAAY,IAAIL,GC/BhB,MAAAM,GAOX7uB,YACE2tB,EACAmB,EACAC,EACQC,EACAC,EAA+C,MAD/CvyB,KAAUsyB,WAAVA,EACAtyB,KAAgBuyB,iBAAhBA,EAXFvyB,KAAUwyB,WAAgD,GAahE,IAAIhK,EAAM,EACV,MAAQyI,EAAKpqB,WAQX,GAPAoqB,EAAOA,EACPzI,EAAM4J,EAAWC,EAAWpB,EAAKxqB,IAAK2rB,GAAY,EAE9CE,IACF9J,IAAQ,GAGNA,EAAM,EAGNyI,EADEjxB,KAAKsyB,WACArB,EAAK7I,KAEL6I,EAAK5I,UAET,CAAA,GAAY,IAARG,EAAW,CAEpBxoB,KAAKwyB,WAAWnxB,KAAK4vB,GACrB,MAGAjxB,KAAKwyB,WAAWnxB,KAAK4vB,GAEnBA,EADEjxB,KAAKsyB,WACArB,EAAK5I,MAEL4I,EAAK7I,MAMpBqK,UACE,GAA+B,IAA3BzyB,KAAKwyB,WAAWlzB,OAClB,OAAO,KAGT,IACIwvB,EADAmC,EAAOjxB,KAAKwyB,WAAWE,MAQ3B,GALE5D,EADE9uB,KAAKuyB,iBACEvyB,KAAKuyB,iBAAiBtB,EAAKxqB,IAAKwqB,EAAKjuB,OAErC,CAAEyD,IAAKwqB,EAAKxqB,IAAKzD,MAAOiuB,EAAKjuB,OAGpChD,KAAKsyB,WAEP,IADArB,EAAOA,EAAK7I,MACJ6I,EAAKpqB,WACX7G,KAAKwyB,WAAWnxB,KAAK4vB,GACrBA,EAAOA,EAAK5I,WAId,IADA4I,EAAOA,EAAK5I,OACJ4I,EAAKpqB,WACX7G,KAAKwyB,WAAWnxB,KAAK4vB,GACrBA,EAAOA,EAAK7I,KAIhB,OAAO0G,EAGT6D,UACE,OAAO3yB,KAAKwyB,WAAWlzB,OAAS,EAGlCszB,OACE,GAA+B,IAA3B5yB,KAAKwyB,WAAWlzB,OAClB,OAAO,KAGT,MAAM2xB,EAAOjxB,KAAKwyB,WAAWxyB,KAAKwyB,WAAWlzB,OAAS,GACtD,OAAIU,KAAKuyB,iBACAvyB,KAAKuyB,iBAAiBtB,EAAKxqB,IAAKwqB,EAAKjuB,OAErC,CAAEyD,IAAKwqB,EAAKxqB,IAAKzD,MAAOiuB,EAAKjuB,QAQ7B,MAAA6vB,GAYXvvB,YACSmD,EACAzD,EACP8vB,EACA1K,EACAC,GAJOroB,KAAGyG,IAAHA,EACAzG,KAAKgD,MAALA,EAKPhD,KAAK8yB,MAAiB,MAATA,EAAgBA,EAAQD,GAASE,IAC9C/yB,KAAKooB,KACK,MAARA,EAAeA,EAAQ4K,GAAUC,WACnCjzB,KAAKqoB,MACM,MAATA,EAAgBA,EAAS2K,GAAUC,WAgBvCC,KACEzsB,EACAzD,EACA8vB,EACA1K,EACAC,GAEA,OAAO,IAAIwK,GACF,MAAPpsB,EAAcA,EAAMzG,KAAKyG,IAChB,MAATzD,EAAgBA,EAAQhD,KAAKgD,MACpB,MAAT8vB,EAAgBA,EAAQ9yB,KAAK8yB,MACrB,MAAR1K,EAAeA,EAAOpoB,KAAKooB,KAClB,MAATC,EAAgBA,EAAQroB,KAAKqoB,OAOjC8K,QACE,OAAOnzB,KAAKooB,KAAK+K,QAAU,EAAInzB,KAAKqoB,MAAM8K,QAM5CtsB,UACE,OAAO,EAYTusB,iBAAiB1H,GACf,OACE1rB,KAAKooB,KAAKgL,iBAAiB1H,MACzBA,EAAO1rB,KAAKyG,IAAKzG,KAAKgD,QACxBhD,KAAKqoB,MAAM+K,iBAAiB1H,GAYhC2H,iBAAiB3H,GACf,OACE1rB,KAAKqoB,MAAMgL,iBAAiB3H,IAC5BA,EAAO1rB,KAAKyG,IAAKzG,KAAKgD,QACtBhD,KAAKooB,KAAKiL,iBAAiB3H,GAOvB4H,OACN,OAAItzB,KAAKooB,KAAKvhB,UACL7G,KAECA,KAAKooB,KAAwBkL,OAOzCC,SACE,OAAOvzB,KAAKszB,OAAO7sB,IAMrB+sB,SACE,OAAIxzB,KAAKqoB,MAAMxhB,UACN7G,KAAKyG,IAELzG,KAAKqoB,MAAMmL,SAUtBC,OAAOhtB,EAAQzD,EAAUqvB,GACvB,IAAI9pB,EAAoBvI,KACxB,MAAMwoB,EAAM6J,EAAW5rB,EAAK8B,EAAE9B,KAc9B,OAZE8B,EADEigB,EAAM,EACJjgB,EAAE2qB,KAAK,KAAM,KAAM,KAAM3qB,EAAE6f,KAAKqL,OAAOhtB,EAAKzD,EAAOqvB,GAAa,MACnD,IAAR7J,EACLjgB,EAAE2qB,KAAK,KAAMlwB,EAAO,KAAM,KAAM,MAEhCuF,EAAE2qB,KACJ,KACA,KACA,KACA,KACA3qB,EAAE8f,MAAMoL,OAAOhtB,EAAKzD,EAAOqvB,IAGxB9pB,EAAEmrB,SAMHC,aACN,GAAI3zB,KAAKooB,KAAKvhB,UACZ,OAAOmsB,GAAUC,WAEnB,IAAI1qB,EAAoBvI,KAKxB,OAJKuI,EAAE6f,KAAKwL,UAAarrB,EAAE6f,KAAKA,KAAKwL,WACnCrrB,EAAIA,EAAEsrB,gBAERtrB,EAAIA,EAAE2qB,KAAK,KAAM,KAAM,KAAO3qB,EAAE6f,KAAwBuL,aAAc,MAC/DprB,EAAEmrB,SAQXtnB,OACE3F,EACA4rB,GAEA,IAAI9pB,EAAGurB,EAEP,GADAvrB,EAAIvI,KACAqyB,EAAW5rB,EAAK8B,EAAE9B,KAAO,EACtB8B,EAAE6f,KAAKvhB,WAAc0B,EAAE6f,KAAKwL,UAAarrB,EAAE6f,KAAKA,KAAKwL,WACxDrrB,EAAIA,EAAEsrB,gBAERtrB,EAAIA,EAAE2qB,KAAK,KAAM,KAAM,KAAM3qB,EAAE6f,KAAKhc,OAAO3F,EAAK4rB,GAAa,UACxD,CAOL,GANI9pB,EAAE6f,KAAKwL,WACTrrB,EAAIA,EAAEwrB,gBAEHxrB,EAAE8f,MAAMxhB,WAAc0B,EAAE8f,MAAMuL,UAAarrB,EAAE8f,MAAMD,KAAKwL,WAC3DrrB,EAAIA,EAAEyrB,iBAEuB,IAA3B3B,EAAW5rB,EAAK8B,EAAE9B,KAAY,CAChC,GAAI8B,EAAE8f,MAAMxhB,UACV,OAAOmsB,GAAUC,WAEjBa,EAAYvrB,EAAE8f,MAAyBiL,OACvC/qB,EAAIA,EAAE2qB,KACJY,EAASrtB,IACTqtB,EAAS9wB,MACT,KACA,KACCuF,EAAE8f,MAAyBsL,cAIlCprB,EAAIA,EAAE2qB,KAAK,KAAM,KAAM,KAAM,KAAM3qB,EAAE8f,MAAMjc,OAAO3F,EAAK4rB,IAEzD,OAAO9pB,EAAEmrB,SAMXE,SACE,OAAO5zB,KAAK8yB,MAMNY,SACN,IAAInrB,EAAoBvI,KAUxB,OATIuI,EAAE8f,MAAMuL,WAAarrB,EAAE6f,KAAKwL,WAC9BrrB,EAAIA,EAAE0rB,eAEJ1rB,EAAE6f,KAAKwL,UAAYrrB,EAAE6f,KAAKA,KAAKwL,WACjCrrB,EAAIA,EAAEwrB,gBAEJxrB,EAAE6f,KAAKwL,UAAYrrB,EAAE8f,MAAMuL,WAC7BrrB,EAAIA,EAAE2rB,cAED3rB,EAMDsrB,eACN,IAAItrB,EAAIvI,KAAKk0B,aAYb,OAXI3rB,EAAE8f,MAAMD,KAAKwL,WACfrrB,EAAIA,EAAE2qB,KACJ,KACA,KACA,KACA,KACC3qB,EAAE8f,MAAyB0L,gBAE9BxrB,EAAIA,EAAE0rB,cACN1rB,EAAIA,EAAE2rB,cAED3rB,EAMDyrB,gBACN,IAAIzrB,EAAIvI,KAAKk0B,aAKb,OAJI3rB,EAAE6f,KAAKA,KAAKwL,WACdrrB,EAAIA,EAAEwrB,eACNxrB,EAAIA,EAAE2rB,cAED3rB,EAMD0rB,cACN,MAAME,EAAKn0B,KAAKkzB,KAAK,KAAM,KAAML,GAASE,IAAK,KAAM/yB,KAAKqoB,MAAMD,MAChE,OAAOpoB,KAAKqoB,MAAM6K,KAAK,KAAM,KAAMlzB,KAAK8yB,MAAOqB,EAAI,MAM7CJ,eACN,MAAMK,EAAKp0B,KAAKkzB,KAAK,KAAM,KAAML,GAASE,IAAK/yB,KAAKooB,KAAKC,MAAO,MAChE,OAAOroB,KAAKooB,KAAK8K,KAAK,KAAM,KAAMlzB,KAAK8yB,MAAO,KAAMsB,GAM9CF,aACN,MAAM9L,EAAOpoB,KAAKooB,KAAK8K,KAAK,KAAM,MAAOlzB,KAAKooB,KAAK0K,MAAO,KAAM,MAC1DzK,EAAQroB,KAAKqoB,MAAM6K,KAAK,KAAM,MAAOlzB,KAAKqoB,MAAMyK,MAAO,KAAM,MACnE,OAAO9yB,KAAKkzB,KAAK,KAAM,MAAOlzB,KAAK8yB,MAAO1K,EAAMC,GAQ1CgM,iBACN,MAAMC,EAAat0B,KAAKu0B,SACxB,OAAOlkB,KAAKE,IAAI,EAAK+jB,IAAet0B,KAAKmzB,QAAU,EAGrDoB,SACE,GAAIv0B,KAAK4zB,UAAY5zB,KAAKooB,KAAKwL,SAC7B,MAAM,IAAI50B,MACR,0BAA4BgB,KAAKyG,IAAM,IAAMzG,KAAKgD,MAAQ,KAG9D,GAAIhD,KAAKqoB,MAAMuL,SACb,MAAM,IAAI50B,MACR,mBAAqBgB,KAAKyG,IAAM,IAAMzG,KAAKgD,MAAQ,YAGvD,MAAMsxB,EAAat0B,KAAKooB,KAAKmM,SAC7B,GAAID,IAAet0B,KAAKqoB,MAAMkM,SAC5B,MAAM,IAAIv1B,MAAM,uBAEhB,OAAOs1B,GAAct0B,KAAK4zB,SAAW,EAAI,IApStCf,GAAGE,KAAG,EACNF,GAAK2B,OAAG,EAsZJ,MAAAxB,GAUX1vB,YACUmxB,EACAC,EAEkB1B,GAAUC,YAH5BjzB,KAAWy0B,YAAXA,EACAz0B,KAAK00B,MAALA,EAaVjB,OAAOhtB,EAAQzD,GACb,OAAO,IAAIgwB,GACThzB,KAAKy0B,YACLz0B,KAAK00B,MACFjB,OAAOhtB,EAAKzD,EAAOhD,KAAKy0B,aACxBvB,KAAK,KAAM,KAAML,GAAS2B,MAAO,KAAM,OAU9CpoB,OAAO3F,GACL,OAAO,IAAIusB,GACThzB,KAAKy0B,YACLz0B,KAAK00B,MACFtoB,OAAO3F,EAAKzG,KAAKy0B,aACjBvB,KAAK,KAAM,KAAML,GAAS2B,MAAO,KAAM,OAW9CvoB,IAAIxF,GACF,IAAI+hB,EACAyI,EAAOjxB,KAAK00B,MAChB,MAAQzD,EAAKpqB,WAAW,CAEtB,GADA2hB,EAAMxoB,KAAKy0B,YAAYhuB,EAAKwqB,EAAKxqB,KACrB,IAAR+hB,EACF,OAAOyI,EAAKjuB,MACHwlB,EAAM,EACfyI,EAAOA,EAAK7I,KACHI,EAAM,IACfyI,EAAOA,EAAK5I,OAGhB,OAAO,KAQTsM,kBAAkBluB,GAChB,IAAI+hB,EACFyI,EAAOjxB,KAAK00B,MACZE,EAAc,KAChB,MAAQ3D,EAAKpqB,WAAW,CAEtB,GADA2hB,EAAMxoB,KAAKy0B,YAAYhuB,EAAKwqB,EAAKxqB,KACrB,IAAR+hB,EAAW,CACb,GAAKyI,EAAK7I,KAAKvhB,UAMR,OAAI+tB,EACFA,EAAYnuB,IAEZ,KAPP,IADAwqB,EAAOA,EAAK7I,MACJ6I,EAAK5I,MAAMxhB,WACjBoqB,EAAOA,EAAK5I,MAEd,OAAO4I,EAAKxqB,IAML+hB,EAAM,EACfyI,EAAOA,EAAK7I,KACHI,EAAM,IACfoM,EAAc3D,EACdA,EAAOA,EAAK5I,OAIhB,MAAM,IAAIrpB,MACR,yEAOJ6H,UACE,OAAO7G,KAAK00B,MAAM7tB,UAMpBssB,QACE,OAAOnzB,KAAK00B,MAAMvB,QAMpBI,SACE,OAAOvzB,KAAK00B,MAAMnB,SAMpBC,SACE,OAAOxzB,KAAK00B,MAAMlB,SAYpBJ,iBAAiB1H,GACf,OAAO1rB,KAAK00B,MAAMtB,iBAAiB1H,GAWrC2H,iBAAiB3H,GACf,OAAO1rB,KAAK00B,MAAMrB,iBAAiB3H,GAOrCmJ,YACEC,GAEA,OAAO,IAAI3C,GACTnyB,KAAK00B,MACL,KACA10B,KAAKy0B,aACL,EACAK,GAIJC,gBACEtuB,EACAquB,GAEA,OAAO,IAAI3C,GACTnyB,KAAK00B,MACLjuB,EACAzG,KAAKy0B,aACL,EACAK,GAIJE,uBACEvuB,EACAquB,GAEA,OAAO,IAAI3C,GACTnyB,KAAK00B,MACLjuB,EACAzG,KAAKy0B,aACL,EACAK,GAIJG,mBACEH,GAEA,OAAO,IAAI3C,GACTnyB,KAAK00B,MACL,KACA10B,KAAKy0B,aACL,EACAK,IC1vBU,SAAAI,GAAqB9M,EAAiBC,GACpD,OAAOrZ,GAAYoZ,EAAKhf,KAAMif,EAAMjf,MAGtB,SAAA+rB,GAAgB/M,EAAcC,GAC5C,OAAOrZ,GAAYoZ,EAAMC,GCF3B,IAAI+M,GFwiBKpC,GAAAC,WAAa,IA/GT,MAYXC,KACEzsB,EACAzD,EACA8vB,EACA1K,EACAC,GAEA,OAAOroB,KAWTyzB,OAAOhtB,EAAQzD,EAAUqvB,GACvB,OAAO,IAAIQ,GAASpsB,EAAKzD,EAAO,MAUlCoJ,OAAO3F,EAAQ4rB,GACb,OAAOryB,KAMTmzB,QACE,OAAO,EAMTtsB,UACE,OAAO,EAWTusB,iBAAiB1H,GACf,OAAO,EAWT2H,iBAAiB3H,GACf,OAAO,EAGT6H,SACE,OAAO,KAGTC,SACE,OAAO,KAGTe,SACE,OAAO,EAMTX,SACE,OAAO,IEthBJ,MAAMyB,GAAmB,SAAUC,GACxC,MAAwB,iBAAbA,EACF,UAAYvlB,GAAsBulB,GAElC,UAAYA,GAOVC,GAAuB,SAAUC,GAC5C,GAAIA,EAAaC,aAAc,CAC7B,MAAMvoB,EAAMsoB,EAAatoB,MACzBtO,EACiB,iBAARsO,GACU,iBAARA,GACS,iBAARA,GAAoB3G,EAAS2G,EAAkB,OACzD,6CAGFtO,EACE42B,IAAiBJ,IAAYI,EAAa3uB,UAC1C,gCAIJjI,EACE42B,IAAiBJ,IAAYI,EAAaE,cAAc7uB,UACxD,uDCzBJ,IAAI8uB,GCXAC,GACAR,GDiBS,MAAAS,GAsBXvyB,YACmBwyB,EACTC,EAAsBF,GAASF,0BAA0B1C,YADhDjzB,KAAM81B,OAANA,EACT91B,KAAa+1B,cAAbA,EATF/1B,KAASg2B,UAAkB,KAWjCp3B,OACkBsE,IAAhBlD,KAAK81B,QAAwC,OAAhB91B,KAAK81B,OAClC,4DAGFP,GAAqBv1B,KAAK+1B,eA9BjBJ,qCAA0BzoB,GACnCyoB,GAA4BzoB,EAGnByoB,uCACT,OAAOA,GA6BTF,aACE,OAAO,EAITC,cACE,OAAO11B,KAAK+1B,cAIdE,eAAeC,GACb,OAAO,IAAIL,GAAS71B,KAAK81B,OAAQI,GAInCC,kBAAkBC,GAEhB,MAAkB,cAAdA,EACKp2B,KAAK+1B,cAELF,GAASF,0BAA0B1C,WAK9CoD,SAASpP,GACP,OAAIY,GAAYZ,GACPjnB,KACyB,cAAvBgnB,GAAaC,GACfjnB,KAAK+1B,cAELF,GAASF,0BAA0B1C,WAG9CqD,WACE,OAAO,EAITC,wBAAwBH,EAAmBI,GACzC,OAAO,KAITC,qBAAqBL,EAAmBM,GACtC,MAAkB,cAAdN,EACKp2B,KAAKi2B,eAAeS,GAClBA,EAAa7vB,WAA2B,cAAduvB,EAC5Bp2B,KAEA61B,GAASF,0BAA0B1C,WAAWwD,qBACnDL,EACAM,GACAT,eAAej2B,KAAK+1B,eAK1BY,YAAY1P,EAAYyP,GACtB,MAAME,EAAQ5P,GAAaC,GAC3B,OAAc,OAAV2P,EACKF,EACEA,EAAa7vB,WAAuB,cAAV+vB,EAC5B52B,MAEPpB,EACY,cAAVg4B,GAAiD,IAAxB1P,GAAcD,GACvC,8CAGKjnB,KAAKy2B,qBACVG,EACAf,GAASF,0BAA0B1C,WAAW0D,YAC5CxP,GAAaF,GACbyP,KAOR7vB,UACE,OAAO,EAITgwB,cACE,OAAO,EAITC,aAAazK,EAAcX,GACzB,OAAO,EAETxe,IAAI6pB,GACF,OAAIA,IAAiB/2B,KAAK01B,cAAc7uB,UAC/B,CACL,SAAU7G,KAAKg3B,WACf,YAAah3B,KAAK01B,cAAcxoB,OAG3BlN,KAAKg3B,WAKhBnS,OACE,GAAuB,OAAnB7kB,KAAKg2B,UAAoB,CAC3B,IAAIiB,EAAS,GACRj3B,KAAK+1B,cAAclvB,YACtBowB,GACE,YACA5B,GAAiBr1B,KAAK+1B,cAAc7oB,OACpC,KAGJ,MAAM5D,SAActJ,KAAK81B,OACzBmB,GAAU3tB,EAAO,IAEf2tB,GADW,WAAT3tB,EACQyG,GAAsB/P,KAAK81B,QAE3B91B,KAAK81B,OAEjB91B,KAAKg2B,UAAYtoB,EAAKupB,GAExB,OAAOj3B,KAAKg2B,UAOdgB,WACE,OAAOh3B,KAAK81B,OAEdoB,UAAUxO,GACR,OAAIA,IAAUmN,GAASF,0BAA0B1C,WACxC,EACEvK,aAAiBmN,GAASF,2BAC3B,GAER/2B,EAAO8pB,EAAM+M,aAAc,qBACpBz1B,KAAKm3B,mBAAmBzO,IAO3ByO,mBAAmBC,GACzB,MAAMC,SAAuBD,EAAUtB,OACjCwB,SAAsBt3B,KAAK81B,OAC3ByB,EAAa1B,GAAS2B,iBAAiBnjB,QAAQgjB,GAC/CI,EAAY5B,GAAS2B,iBAAiBnjB,QAAQijB,GAGpD,OAFA14B,EAAO24B,GAAc,EAAG,sBAAwBF,GAChDz4B,EAAO64B,GAAa,EAAG,sBAAwBH,GAC3CC,IAAeE,EAEI,WAAjBH,EAEK,EAGHt3B,KAAK81B,OAASsB,EAAUtB,QAClB,EACC91B,KAAK81B,SAAWsB,EAAUtB,OAC5B,EAEA,EAIJ2B,EAAYF,EAGvBG,YACE,OAAO13B,KAET23B,YACE,OAAO,EAETC,OAAOlP,GACL,GAAIA,IAAU1oB,KACZ,OAAO,EACF,GAAI0oB,EAAM+M,aAAc,CAC7B,MAAM2B,EAAY1O,EAClB,OACE1oB,KAAK81B,SAAWsB,EAAUtB,QAC1B91B,KAAK+1B,cAAc6B,OAAOR,EAAUrB,eAGtC,OAAO,GArNJF,GAAgB2B,iBAAG,CAAC,SAAU,UAAW,SAAU,UCkBrD,MAAMK,GAAiB,IAtCxB,cAA6B3G,GACjCE,QAAQlpB,EAAcC,GACpB,MAAM2vB,EAAY5vB,EAAE+oB,KAAKyE,cACnBqC,EAAY5vB,EAAE8oB,KAAKyE,cACnBsC,EAAWF,EAAUZ,UAAUa,GACrC,OAAiB,IAAbC,EACKhpB,GAAY9G,EAAEkB,KAAMjB,EAAEiB,MAEtB4uB,EAGXlG,YAAYb,GACV,OAAQA,EAAKyE,cAAc7uB,UAE7BwqB,oBAAoBC,EAAeC,GACjC,OAAQD,EAAQoE,cAAckC,OAAOrG,EAAQmE,eAE/ChE,UAEE,OAAQV,GAAkBW,IAE5BI,UACE,OAAO,IAAIf,GAAUjiB,GAAU,IAAI8mB,GAAS,kBAAmBT,KAGjEpD,SAASC,EAAqB7oB,GAC5B,MAAMosB,EAAeI,GAAa3D,GAClC,OAAO,IAAIjB,GAAU5nB,EAAM,IAAIysB,GAAS,kBAAmBL,IAM7DnpB,WACE,MAAO,cC/CL4rB,GAAQ5nB,KAAK9C,IAAI,GAEvB,MAAM2qB,GAKJ50B,YAAYhE,GACO,IAAC64B,EAIlBn4B,KAAKmzB,OAJagF,EAII74B,EAAS,EAF7B0R,SAAUX,KAAK9C,IAAI4qB,GAAOF,GAAe,KAG3Cj4B,KAAKo4B,SAAWp4B,KAAKmzB,MAAQ,EAC7B,MAAMkF,GAHWznB,EAGI5Q,KAAKmzB,MAHQniB,SAASzQ,MAAMqQ,EAAO,GAAGtP,KAAK,KAAM,IAAtD,IAACsP,EAIjB5Q,KAAKs4B,MAASh5B,EAAS,EAAK+4B,EAG9BE,eAEE,MAAMzJ,IAAW9uB,KAAKs4B,MAAS,GAAOt4B,KAAKo4B,UAE3C,OADAp4B,KAAKo4B,WACEtJ,GAiBJ,MAAM0J,GAAgB,SAC3BC,EACAjQ,EACAkQ,EACAC,GAEAF,EAAUjpB,KAAKgZ,GAEf,MAAMoQ,EAAoB,SACxBC,EACAlrB,GAEA,MAAMrO,EAASqO,EAAOkrB,EACtB,IAAIC,EACAryB,EACJ,GAAe,IAAXnH,EACF,OAAO,KACF,GAAe,IAAXA,EAGT,OAFAw5B,EAAYL,EAAUI,GACtBpyB,EAAMiyB,EAAQA,EAAMI,GAAcA,EAC3B,IAAIjG,GACTpsB,EACAqyB,EAAU7H,KACV4B,GAAS2B,MACT,KACA,MAEG,CAEL,MAAMuE,EAAS/nB,SAAU1R,EAAS,EAAW,IAAMu5B,EAC7CzQ,EAAOwQ,EAAkBC,EAAKE,GAC9B1Q,EAAQuQ,EAAkBG,EAAS,EAAGprB,GAG5C,OAFAmrB,EAAYL,EAAUM,GACtBtyB,EAAMiyB,EAAQA,EAAMI,GAAcA,EAC3B,IAAIjG,GACTpsB,EACAqyB,EAAU7H,KACV4B,GAAS2B,MACTpM,EACAC,KAsDA2Q,EAjDmB,SAAUC,GACjC,IAAIhI,EAAuB,KACvB+H,EAAO,KACP3M,EAAQoM,EAAUn5B,OAEtB,MAAM45B,EAAe,SAAUC,EAAmBrG,GAChD,MAAM+F,EAAMxM,EAAQ8M,EACdxrB,EAAO0e,EACbA,GAAS8M,EACT,MAAMC,EAAYR,EAAkBC,EAAM,EAAGlrB,GACvCmrB,EAAYL,EAAUI,GACtBpyB,EAASiyB,EAAQA,EAAMI,GAAcA,EAC3CO,EACE,IAAIxG,GACFpsB,EACAqyB,EAAU7H,KACV6B,EACA,KACAsG,KAKAC,EAAgB,SAAUC,GAC1BrI,GACFA,EAAK7I,KAAOkR,EACZrI,EAAOqI,IAEPN,EAAOM,EACPrI,EAAOqI,IAIX,IAAK,IAAIj6B,EAAI,EAAGA,EAAI45B,EAAO9F,QAAS9zB,EAAG,CACrC,MAAMk6B,EAAQN,EAAOV,eAEfY,EAAY9oB,KAAKE,IAAI,EAAG0oB,EAAO9F,OAAS9zB,EAAI,IAC9Ck6B,EACFL,EAAaC,EAAWtG,GAAS2B,QAGjC0E,EAAaC,EAAWtG,GAAS2B,OACjC0E,EAAaC,EAAWtG,GAASE,MAGrC,OAAOiG,EAIIQ,CADE,IAAItB,GAAUO,EAAUn5B,SAGvC,OAAO,IAAI0zB,GAAgB2F,GAAcnQ,EAAawQ,IChIxD,IAAIS,GAEJ,MAAMC,GAAiB,GAEV,MAAAC,GAkBXr2B,YACUs2B,EAGAC,GAHA75B,KAAQ45B,SAARA,EAGA55B,KAAS65B,UAATA,EAlBCC,qBAWT,OAVAl7B,EACE86B,IAAkB7B,GAClB,uCAEF4B,GACEA,IACA,IAAIE,GACF,CAAE,YAAaD,IACf,CAAE,YAAa7B,KAEZ4B,GAUTxtB,IAAI8tB,GACF,MAAMC,EAAYpzB,EAAQ5G,KAAK45B,SAAUG,GACzC,IAAKC,EACH,MAAM,IAAIh7B,MAAM,wBAA0B+6B,GAG5C,OAAIC,aAAqBhH,GAChBgH,EAIA,KAIXC,SAASC,GACP,OAAO3zB,EAASvG,KAAK65B,UAAWK,EAAgB7tB,YAGlD8tB,SACED,EACAE,GAEAx7B,EACEs7B,IAAoBhI,GACpB,uEAEF,MAAMuG,EAAY,GAClB,IAAI4B,GAAkB,EACtB,MAAMC,EAAOF,EAAiBvF,YAAY7D,GAAUuJ,MACpD,IAOIC,EAPAC,EAAOH,EAAK7H,UAChB,KAAOgI,GACLJ,EACEA,GAAmBH,EAAgBpI,YAAY2I,EAAKxJ,MACtDwH,EAAUp3B,KAAKo5B,GACfA,EAAOH,EAAK7H,UAIZ+H,EADEH,EACS7B,GAAcC,EAAWyB,EAAgB/I,cAEzCuI,GAEb,MAAMgB,EAAYR,EAAgB7tB,WAC5BsuB,EAAmBt3B,OAAAu3B,OAAA,GAAA56B,KAAK65B,WAC9Bc,EAAYD,GAAaR,EACzB,MAAMW,EAAkBx3B,OAAAu3B,OAAA,GAAA56B,KAAK45B,UAE7B,OADAiB,EAAWH,GAAaF,EACjB,IAAIb,GAASkB,EAAYF,GAMlCG,aACEhC,EACAsB,GAEA,MAAMS,EAAa/zB,EACjB9G,KAAK45B,UACL,CAACmB,EAA6CL,KAC5C,MAAMrO,EAAQzlB,EAAQ5G,KAAK65B,UAAWa,GAEtC,GADA97B,EAAOytB,EAAO,oCAAsCqO,GAChDK,IAAoBrB,GAAgB,CAEtC,GAAIrN,EAAMyF,YAAYgH,EAAU7H,MAAO,CAErC,MAAMwH,EAAY,GACZ6B,EAAOF,EAAiBvF,YAAY7D,GAAUuJ,MACpD,IAAIE,EAAOH,EAAK7H,UAChB,KAAOgI,GACDA,EAAKrxB,OAAS0vB,EAAU1vB,MAC1BqvB,EAAUp3B,KAAKo5B,GAEjBA,EAAOH,EAAK7H,UAGd,OADAgG,EAAUp3B,KAAKy3B,GACRN,GAAcC,EAAWpM,EAAM8E,cAGtC,OAAOuI,GAEJ,CACL,MAAMsB,EAAeZ,EAAiBnuB,IAAI6sB,EAAU1vB,MACpD,IAAI6xB,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAY7uB,OACxB,IAAI4kB,GAAU8H,EAAU1vB,KAAM4xB,KAG3BC,EAAYxH,OAAOqF,EAAWA,EAAU7H,UAIrD,OAAO,IAAI0I,GAASkB,EAAY76B,KAAK65B,WAMvCqB,kBACEpC,EACAsB,GAEA,MAAMS,EAAa/zB,EACjB9G,KAAK45B,UACJmB,IACC,GAAIA,IAAoBrB,GAEtB,OAAOqB,EACF,CACL,MAAMC,EAAeZ,EAAiBnuB,IAAI6sB,EAAU1vB,MACpD,OAAI4xB,EACKD,EAAgB3uB,OACrB,IAAI4kB,GAAU8H,EAAU1vB,KAAM4xB,IAIzBD,MAKf,OAAO,IAAIpB,GAASkB,EAAY76B,KAAK65B,YCrIzC,IAAI5G,GAOS,MAAAkI,GAkBX73B,YACmB83B,EACArF,EACTsF,GAFSr7B,KAASo7B,UAATA,EACAp7B,KAAa+1B,cAAbA,EACT/1B,KAASq7B,UAATA,EApBFr7B,KAASg2B,UAAkB,KA2B7Bh2B,KAAK+1B,eACPR,GAAqBv1B,KAAK+1B,eAGxB/1B,KAAKo7B,UAAUv0B,WACjBjI,GACGoB,KAAK+1B,eAAiB/1B,KAAK+1B,cAAclvB,UAC1C,wCAhCKosB,wBACT,OACEA,KACCA,GAAa,IAAIkI,GAChB,IAAInI,GAAwBmC,IAC5B,KACAwE,GAASG,UAgCfrE,aACE,OAAO,EAITC,cACE,OAAO11B,KAAK+1B,eAAiB9C,GAI/BgD,eAAeC,GACb,OAAIl2B,KAAKo7B,UAAUv0B,UAEV7G,KAEA,IAAIm7B,GAAan7B,KAAKo7B,UAAWlF,EAAiBl2B,KAAKq7B,WAKlElF,kBAAkBC,GAEhB,GAAkB,cAAdA,EACF,OAAOp2B,KAAK01B,cACP,CACL,MAAM4F,EAAQt7B,KAAKo7B,UAAUnvB,IAAImqB,GACjC,OAAiB,OAAVkF,EAAiBrI,GAAaqI,GAKzCjF,SAASpP,GACP,MAAM2P,EAAQ5P,GAAaC,GAC3B,OAAc,OAAV2P,EACK52B,KAGFA,KAAKm2B,kBAAkBS,GAAOP,SAASlP,GAAaF,IAI7DqP,SAASF,GACP,OAAyC,OAAlCp2B,KAAKo7B,UAAUnvB,IAAImqB,GAI5BK,qBAAqBL,EAAmBM,GAEtC,GADA93B,EAAO83B,EAAc,8CACH,cAAdN,EACF,OAAOp2B,KAAKi2B,eAAeS,GACtB,CACL,MAAMoC,EAAY,IAAI9H,GAAUoF,EAAWM,GAC3C,IAAIuE,EAAaM,EACb7E,EAAa7vB,WACfo0B,EAAcj7B,KAAKo7B,UAAUhvB,OAAOgqB,GACpCmF,EAAcv7B,KAAKq7B,UAAUH,kBAC3BpC,EACA94B,KAAKo7B,aAGPH,EAAcj7B,KAAKo7B,UAAU3H,OAAO2C,EAAWM,GAC/C6E,EAAcv7B,KAAKq7B,UAAUP,aAAahC,EAAW94B,KAAKo7B,YAG5D,MAAMI,EAAcP,EAAYp0B,UAC5BosB,GACAjzB,KAAK+1B,cACT,OAAO,IAAIoF,GAAaF,EAAaO,EAAaD,IAKtD5E,YAAY1P,EAAYyP,GACtB,MAAME,EAAQ5P,GAAaC,GAC3B,GAAc,OAAV2P,EACF,OAAOF,EACF,CACL93B,EACyB,cAAvBooB,GAAaC,IAAiD,IAAxBC,GAAcD,GACpD,8CAEF,MAAMwU,EAAoBz7B,KAAKm2B,kBAAkBS,GAAOD,YACtDxP,GAAaF,GACbyP,GAEF,OAAO12B,KAAKy2B,qBAAqBG,EAAO6E,IAK5C50B,UACE,OAAO7G,KAAKo7B,UAAUv0B,UAIxBgwB,cACE,OAAO72B,KAAKo7B,UAAUjI,QAMxBjmB,IAAI6pB,GACF,GAAI/2B,KAAK6G,UACP,OAAO,KAGT,MAAML,EAAgC,GACtC,IAAIk1B,EAAU,EACZlI,EAAS,EACTmI,GAAiB,EAYnB,GAXA37B,KAAK82B,aAAae,IAAgB,CAACpxB,EAAa+vB,KAC9ChwB,EAAIC,GAAO+vB,EAAUtpB,IAAI6pB,GAEzB2E,IACIC,GAAkBR,GAAahqB,gBAAgBtN,KAAK4C,GACtD+sB,EAASnjB,KAAK2Y,IAAIwK,EAAQ7kB,OAAOlI,IAEjCk1B,GAAiB,MAIhB5E,GAAgB4E,GAAkBnI,EAAS,EAAIkI,EAAS,CAE3D,MAAME,EAAmB,GAEzB,IAAK,MAAMn1B,KAAOD,EAChBo1B,EAAMn1B,GAA4BD,EAAIC,GAGxC,OAAOm1B,EAKP,OAHI7E,IAAiB/2B,KAAK01B,cAAc7uB,YACtCL,EAAI,aAAexG,KAAK01B,cAAcxoB,OAEjC1G,EAKXqe,OACE,GAAuB,OAAnB7kB,KAAKg2B,UAAoB,CAC3B,IAAIiB,EAAS,GACRj3B,KAAK01B,cAAc7uB,YACtBowB,GACE,YACA5B,GAAiBr1B,KAAK01B,cAAcxoB,OACpC,KAGJlN,KAAK82B,aAAae,IAAgB,CAACpxB,EAAK+vB,KACtC,MAAMqF,EAAYrF,EAAU3R,OACV,KAAdgX,IACF5E,GAAU,IAAMxwB,EAAM,IAAMo1B,MAIhC77B,KAAKg2B,UAAuB,KAAXiB,EAAgB,GAAKvpB,EAAKupB,GAE7C,OAAOj3B,KAAKg2B,UAIdO,wBACEH,EACAI,EACAnK,GAEA,MAAMyP,EAAM97B,KAAK+7B,cAAc1P,GAC/B,GAAIyP,EAAK,CACP,MAAME,EAAcF,EAAInH,kBACtB,IAAI3D,GAAUoF,EAAWI,IAE3B,OAAOwF,EAAcA,EAAY5yB,KAAO,KAExC,OAAOpJ,KAAKo7B,UAAUzG,kBAAkByB,GAI5C6F,kBAAkB/B,GAChB,MAAM4B,EAAM97B,KAAK+7B,cAAc7B,GAC/B,GAAI4B,EAAK,CACP,MAAMvI,EAASuI,EAAIvI,SACnB,OAAOA,GAAUA,EAAOnqB,KAExB,OAAOpJ,KAAKo7B,UAAU7H,SAI1B2I,cAAchC,GACZ,MAAM3G,EAASvzB,KAAKi8B,kBAAkB/B,GACtC,OAAI3G,EACK,IAAIvC,GAAUuC,EAAQvzB,KAAKo7B,UAAUnvB,IAAIsnB,IAEzC,KAOX4I,iBAAiBjC,GACf,MAAM4B,EAAM97B,KAAK+7B,cAAc7B,GAC/B,GAAI4B,EAAK,CACP,MAAMtI,EAASsI,EAAItI,SACnB,OAAOA,GAAUA,EAAOpqB,KAExB,OAAOpJ,KAAKo7B,UAAU5H,SAI1B4I,aAAalC,GACX,MAAM1G,EAASxzB,KAAKm8B,iBAAiBjC,GACrC,OAAI1G,EACK,IAAIxC,GAAUwC,EAAQxzB,KAAKo7B,UAAUnvB,IAAIunB,IAEzC,KAGXsD,aACEzK,EACAX,GAEA,MAAMoQ,EAAM97B,KAAK+7B,cAAc1P,GAC/B,OAAIyP,EACKA,EAAI1I,kBAAiBiJ,GACnB3Q,EAAO2Q,EAAYjzB,KAAMizB,EAAYpL,QAGvCjxB,KAAKo7B,UAAUhI,iBAAiB1H,GAI3CmJ,YACEqF,GAEA,OAAOl6B,KAAK+0B,gBAAgBmF,EAAgBxI,UAAWwI,GAGzDnF,gBACEuH,EACApC,GAEA,MAAM4B,EAAM97B,KAAK+7B,cAAc7B,GAC/B,GAAI4B,EACF,OAAOA,EAAI/G,gBAAgBuH,GAAW71B,GAAOA,IACxC,CACL,MAAM81B,EAAWv8B,KAAKo7B,UAAUrG,gBAC9BuH,EAAUlzB,KACV4nB,GAAUuJ,MAEZ,IAAIE,EAAO8B,EAAS3J,OACpB,KAAe,MAAR6H,GAAgBP,EAAgB9I,QAAQqJ,EAAM6B,GAAa,GAChEC,EAAS9J,UACTgI,EAAO8B,EAAS3J,OAElB,OAAO2J,GAIXtH,mBACEiF,GAEA,OAAOl6B,KAAKg1B,uBACVkF,EAAgBnI,UAChBmI,GAIJlF,uBACEwH,EACAtC,GAEA,MAAM4B,EAAM97B,KAAK+7B,cAAc7B,GAC/B,GAAI4B,EACF,OAAOA,EAAI9G,uBAAuBwH,GAAS/1B,GAClCA,IAEJ,CACL,MAAM81B,EAAWv8B,KAAKo7B,UAAUpG,uBAC9BwH,EAAQpzB,KACR4nB,GAAUuJ,MAEZ,IAAIE,EAAO8B,EAAS3J,OACpB,KAAe,MAAR6H,GAAgBP,EAAgB9I,QAAQqJ,EAAM+B,GAAW,GAC9DD,EAAS9J,UACTgI,EAAO8B,EAAS3J,OAElB,OAAO2J,GAGXrF,UAAUxO,GACR,OAAI1oB,KAAK6G,UACH6hB,EAAM7hB,UACD,GAEC,EAED6hB,EAAM+M,cAAgB/M,EAAM7hB,UAC9B,EACE6hB,IAAU0M,IACX,EAGD,EAGXsC,UAAUwC,GACR,GACEA,IAAoBhI,IACpBlyB,KAAKq7B,UAAUpB,SAASC,GAExB,OAAOl6B,KACF,CACL,MAAMu7B,EAAcv7B,KAAKq7B,UAAUlB,SACjCD,EACAl6B,KAAKo7B,WAEP,OAAO,IAAID,GAAan7B,KAAKo7B,UAAWp7B,KAAK+1B,cAAewF,IAGhE5D,UAAUtL,GACR,OAAOA,IAAU6F,IAAalyB,KAAKq7B,UAAUpB,SAAS5N,GAExDuL,OAAOlP,GACL,GAAIA,IAAU1oB,KACZ,OAAO,EACF,GAAI0oB,EAAM+M,aACf,OAAO,EACF,CACL,MAAMgH,EAAoB/T,EAC1B,GAAK1oB,KAAK01B,cAAckC,OAAO6E,EAAkB/G,eAE1C,CAAA,GACL11B,KAAKo7B,UAAUjI,UAAYsJ,EAAkBrB,UAAUjI,QACvD,CACA,MAAMuJ,EAAW18B,KAAK60B,YAAYgD,IAC5B8E,EAAYF,EAAkB5H,YAAYgD,IAChD,IAAI+E,EAAcF,EAASjK,UACvBoK,EAAeF,EAAUlK,UAC7B,KAAOmK,GAAeC,GAAc,CAClC,GACED,EAAYxzB,OAASyzB,EAAazzB,OACjCwzB,EAAY3L,KAAK2G,OAAOiF,EAAa5L,MAEtC,OAAO,EAET2L,EAAcF,EAASjK,UACvBoK,EAAeF,EAAUlK,UAE3B,OAAuB,OAAhBmK,GAAyC,OAAjBC,EAE/B,OAAO,EApBP,OAAO,GA8BLd,cACN7B,GAEA,OAAIA,IAAoBhI,GACf,KAEAlyB,KAAKq7B,UAAUpvB,IAAIiuB,EAAgB7tB,aA7Q/B8uB,GAAehqB,gBAAG,iBAwT5B,MAAMikB,GAAW,IAtClB,cAAuB+F,GAC3B73B,cACEgjB,MACE,IAAI0M,GAAwBmC,IAC5BgG,GAAalI,WACb0G,GAASG,SAIb5C,UAAUxO,GACR,OAAIA,IAAU1oB,KACL,EAEA,EAIX43B,OAAOlP,GAEL,OAAOA,IAAU1oB,KAGnB01B,cACE,OAAO11B,KAGTm2B,kBAAkBC,GAChB,OAAO+E,GAAalI,WAGtBpsB,UACE,OAAO,IAmBXxD,OAAOy5B,iBAAiB9L,GAAW,CACjCW,IAAK,CACH3uB,MAAO,IAAIguB,GAAUliB,GAAUqsB,GAAalI,aAE9C8J,IAAK,CACH/5B,MAAO,IAAIguB,GAAUjiB,GAAUqmB,OAOnCvD,GAASD,aAAeuJ,GAAalI,WACrC4C,GAASF,0BAA4BwF,GLvfnC/F,GKwfSA,GHrfL,SAAqBloB,GACzBkoB,GAAWloB,EGqfb8vB,CAAmB5H,IC7eH,SAAAQ,GACdqH,EACA3H,EAAoB,MAEpB,GAAa,OAAT2H,EACF,OAAO9B,GAAalI,WAoBtB,GAjBoB,iBAATgK,GAAqB,cAAeA,IAC7C3H,EAAW2H,EAAK,cAGlBr+B,EACe,OAAb02B,GACsB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,iBAAT2H,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,iBAATA,GAAqB,QAASA,EAAM,CAE7C,OAAO,IAAIpH,GADMoH,EACarH,GAAaN,IAG7C,GAAM2H,aAAgB18B,MA8Cf,CACL,IAAI0wB,EAAakK,GAAalI,WAa9B,OAZAnjB,GAAKmtB,GAAM,CAACx2B,EAAay2B,KACvB,GAAI32B,EAAS02B,EAAgBx2B,IACC,MAAxBA,EAAIoJ,UAAU,EAAG,GAAY,CAE/B,MAAM2mB,EAAYZ,GAAasH,IAC3B1G,EAAUf,cAAiBe,EAAU3vB,YACvCoqB,EAAOA,EAAKwF,qBAAqBhwB,EAAK+vB,QAMvCvF,EAAKgF,eAAeL,GAAaN,IA5DC,CACzC,MAAM6H,EAAwB,GAC9B,IAAIC,GAAuB,EAc3B,GAZAttB,GADqBmtB,GACF,CAACx2B,EAAK60B,KACvB,GAA4B,MAAxB70B,EAAIoJ,UAAU,EAAG,GAAY,CAE/B,MAAM2mB,EAAYZ,GAAa0F,GAC1B9E,EAAU3vB,YACbu2B,EACEA,IAAyB5G,EAAUd,cAAc7uB,UACnDs2B,EAAS97B,KAAK,IAAI2vB,GAAUvqB,EAAK+vB,SAKf,IAApB2G,EAAS79B,OACX,OAAO67B,GAAalI,WAGtB,MAAMoK,EAAW7E,GACf2E,EACAjI,IACA4D,GAAaA,EAAU1vB,MACvB+rB,IAEF,GAAIiI,EAAsB,CACxB,MAAME,EAAiB9E,GACrB2E,EACAtF,GAAe1G,cAEjB,OAAO,IAAIgK,GACTkC,EACAzH,GAAaN,GACb,IAAIqE,GACF,CAAE,YAAa2D,GACf,CAAE,YAAazF,MAInB,OAAO,IAAIsD,GACTkC,EACAzH,GAAaN,GACbqE,GAASG,WJtFX,SAA0B5sB,GAC9B0oB,GAAe1oB,EI0GjBqwB,CAAgB3H,IC1GV,MAAO4H,WAAkBtM,GAC7B5tB,YAAoBm6B,GAClBnX,QADkBtmB,KAAUy9B,WAAVA,EAGlB7+B,GACGipB,GAAY4V,IAA4C,cAA7BzW,GAAayW,GACzC,2DAIMC,aAAaC,GACrB,OAAOA,EAAKtH,SAASr2B,KAAKy9B,YAE5B3L,YAAYb,GACV,OAAQA,EAAKoF,SAASr2B,KAAKy9B,YAAY52B,UAEzCuqB,QAAQlpB,EAAcC,GACpB,MAAMy1B,EAAS59B,KAAK09B,aAAax1B,EAAE+oB,MAC7B4M,EAAS79B,KAAK09B,aAAav1B,EAAE8oB,MAC7B+G,EAAW4F,EAAO1G,UAAU2G,GAClC,OAAiB,IAAb7F,EACKhpB,GAAY9G,EAAEkB,KAAMjB,EAAEiB,MAEtB4uB,EAGXhG,SAASC,EAAoB7oB,GAC3B,MAAM00B,EAAYlI,GAAa3D,GACzBhB,EAAOkK,GAAalI,WAAW0D,YACnC32B,KAAKy9B,WACLK,GAEF,OAAO,IAAI9M,GAAU5nB,EAAM6nB,GAE7Bc,UACE,MAAMd,EAAOkK,GAAalI,WAAW0D,YAAY32B,KAAKy9B,WAAYrI,IAClE,OAAO,IAAIpE,GAAUjiB,GAAUkiB,GAEjC5kB,WACE,OAAOgb,GAAUrnB,KAAKy9B,WAAY,GAAGn8B,KAAK,MCNvC,MAAMy8B,GAAc,IArCrB,cAA0B7M,GAC9BE,QAAQlpB,EAAcC,GACpB,MAAM6vB,EAAW9vB,EAAE+oB,KAAKiG,UAAU/uB,EAAE8oB,MACpC,OAAiB,IAAb+G,EACKhpB,GAAY9G,EAAEkB,KAAMjB,EAAEiB,MAEtB4uB,EAGXlG,YAAYb,GACV,OAAO,EAETI,oBAAoBC,EAAeC,GACjC,OAAQD,EAAQsG,OAAOrG,GAEzBG,UAEE,OAAQV,GAAkBW,IAE5BI,UAEE,OAAQf,GAAkB+L,IAG5B/K,SAASC,EAAoB7oB,GAC3B,MAAM00B,EAAYlI,GAAa3D,GAC/B,OAAO,IAAIjB,GAAU5nB,EAAM00B,GAM7BzxB,WACE,MAAO,WC5BL2xB,GACJ,mEAsBWC,GAAa,WAGxB,IAAIC,EAAe,EAMnB,MAAMC,EAA0B,GAEhC,OAAO,SAAU/yB,GACf,MAAMgzB,EAAgBhzB,IAAQ8yB,EAG9B,IAAI7+B,EAFJ6+B,EAAe9yB,EAGf,MAAMizB,EAAiB,IAAI99B,MAAM,GACjC,IAAKlB,EAAI,EAAGA,GAAK,EAAGA,IAClBg/B,EAAeh/B,GAAK2+B,GAAW37B,OAAO+I,EAAM,IAG5CA,EAAMiF,KAAKI,MAAMrF,EAAM,IAEzBxM,EAAe,IAARwM,EAAW,4BAElB,IAAIqC,EAAK4wB,EAAe/8B,KAAK,IAE7B,GAAK88B,EAIE,CAGL,IAAK/+B,EAAI,GAAIA,GAAK,GAA0B,KAArB8+B,EAAc9+B,GAAWA,IAC9C8+B,EAAc9+B,GAAK,EAErB8+B,EAAc9+B,UATd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClB8+B,EAAc9+B,GAAKgR,KAAKI,MAAsB,GAAhBJ,KAAK2I,UAUvC,IAAK3Z,EAAI,EAAGA,EAAI,GAAIA,IAClBoO,GAAMuwB,GAAW37B,OAAO87B,EAAc9+B,IAIxC,OAFAT,EAAqB,KAAd6O,EAAGnO,OAAe,oCAElBmO,GA5Ce,GAgDb6wB,GAAY,SAAU73B,GACjC,GAAY,eAARA,EAEF,MAvEkB,IAyEpB,MAAM83B,EAAmBrvB,GAAYzI,GACrC,GAAgB,MAAZ83B,EACF,MAAO,IAAMA,EAAW,GAE1B,MAAM9D,EAAO,IAAIl6B,MAAMkG,EAAInH,QAE3B,IAAK,IAAID,EAAI,EAAGA,EAAIo7B,EAAKn7B,OAAQD,IAC/Bo7B,EAAKp7B,GAAKoH,EAAIpE,OAAOhD,GAGvB,GAAIo7B,EAAKn7B,OA/ES,IAiFhB,OADAm7B,EAAKp5B,KApFa,KAqFXo5B,EAAKn5B,KAAK,IAGnB,IAAIjC,EAAIo7B,EAAKn7B,OAAS,EAEtB,KAAOD,GAAK,GAxFQ,MAwFHo7B,EAAKp7B,IACpBA,IAKF,IAAW,IAAPA,EACF,OAAO0P,GAGT,MAAM3L,EAASq3B,EAAKp7B,GACdm/B,EAAgBR,GAAW37B,OAAO27B,GAAW3pB,QAAQjR,GAAU,GAGrE,OAFAq3B,EAAKp7B,GAAKm/B,EAEH/D,EAAKlT,MAAM,EAAGloB,EAAI,GAAGiC,KAAK,KAItB06B,GAAc,SAAUv1B,GACnC,GAAY,gBAARA,EACF,OAAOqI,GAET,MAAMyvB,EAAmBrvB,GAAYzI,GACrC,GAAgB,MAAZ83B,EACF,MAAO,IAAMA,EAAW,GAE1B,MAAM9D,EAAO,IAAIl6B,MAAMkG,EAAInH,QAC3B,IAAK,IAAID,EAAI,EAAGA,EAAIo7B,EAAKn7B,OAAQD,IAC/Bo7B,EAAKp7B,GAAKoH,EAAIpE,OAAOhD,GAavB,MAnIoB,MAmIhBo7B,EAAKA,EAAKn7B,OAAS,GACD,IAAhBm7B,EAAKn7B,OAEA,qBAEFm7B,EAAKA,EAAKn7B,OAAS,GACnBm7B,EAAKn5B,KAAK,MAKnBm5B,EAAKA,EAAKn7B,OAAS,GAAK0+B,GAAW37B,OACjC27B,GAAW3pB,QAAQomB,EAAKA,EAAKn7B,OAAS,IAAM,GAEvCm7B,EAAKn5B,KAAK,IA/IG,IA+IiBm9B,OA7InB,IA6IwChE,EAAKn7B,UCnI3D,SAAUo/B,GAAYC,GAC1B,MAAO,CAAEr1B,KAAI,QAAoBq1B,aAAAA,GAGnB,SAAAC,GACdxI,EACAuI,GAEA,MAAO,CAAEr1B,KAA4B,cAAEq1B,aAAAA,EAAcvI,UAAAA,GAGvC,SAAAyI,GACdzI,EACAuI,GAEA,MAAO,CAAEr1B,KAA8B,gBAAEq1B,aAAAA,EAAcvI,UAAAA,GAGzC,SAAA0I,GACd1I,EACAuI,EACAI,GAEA,MAAO,CACLz1B,KAA8B,gBAC9Bq1B,aAAAA,EACAvI,UAAAA,EACA2I,QAAAA,GCnCS,MAAAC,GACX17B,YAA6B27B,GAAAj/B,KAAMi/B,OAANA,EAE7BtI,YACEgH,EACAl3B,EACAy4B,EACAC,EACA/7B,EACAg8B,GAEAxgC,EACE++B,EAAKhG,UAAU33B,KAAKi/B,QACpB,qDAEF,MAAMI,EAAW1B,EAAKxH,kBAAkB1vB,GAExC,OACE44B,EAAShJ,SAAS8I,GAAcvH,OAAOsH,EAAS7I,SAAS8I,KAKrDE,EAASx4B,YAAcq4B,EAASr4B,UAK3B82B,GAIiB,MAAxByB,IACEF,EAASr4B,UACP82B,EAAKrH,SAAS7vB,GAChB24B,EAAqBE,iBACnBT,GAAmBp4B,EAAK44B,IAG1BzgC,EACE++B,EAAKlI,aACL,uEAGK4J,EAASx4B,UAClBu4B,EAAqBE,iBAAiBV,GAAiBn4B,EAAKy4B,IAE5DE,EAAqBE,iBACnBR,GAAmBr4B,EAAKy4B,EAAUG,KAIpC1B,EAAKlI,cAAgByJ,EAASr4B,UACzB82B,EAGAA,EAAKlH,qBAAqBhwB,EAAKy4B,GAAUxH,UAAU13B,KAAKi/B,SAGnEM,eACER,EACAS,EACAJ,GA6BA,OA3B4B,MAAxBA,IACGL,EAAQtJ,cACXsJ,EAAQjI,aAAae,IAAgB,CAACpxB,EAAK+vB,KACpCgJ,EAAQlJ,SAAS7vB,IACpB24B,EAAqBE,iBACnBT,GAAmBp4B,EAAK+vB,OAK3BgJ,EAAQ/J,cACX+J,EAAQ1I,aAAae,IAAgB,CAACpxB,EAAK+vB,KACzC,GAAIuI,EAAQzI,SAAS7vB,GAAM,CACzB,MAAM44B,EAAWN,EAAQ5I,kBAAkB1vB,GACtC44B,EAASzH,OAAOpB,IACnB4I,EAAqBE,iBACnBR,GAAmBr4B,EAAK+vB,EAAW6I,SAIvCD,EAAqBE,iBACnBV,GAAiBn4B,EAAK+vB,QAMzBgJ,EAAQ9H,UAAU13B,KAAKi/B,QAEhChJ,eAAe8I,EAAevD,GAC5B,OAAIuD,EAAQl4B,UACHs0B,GAAalI,WAEb8L,EAAQ9I,eAAeuF,GAGlCiE,eACE,OAAO,EAETC,mBACE,OAAO1/B,KAETytB,WACE,OAAOztB,KAAKi/B,QChHH,MAAAU,GASXr8B,YAAYyR,GACV/U,KAAK4/B,eAAiB,IAAIZ,GAAcjqB,EAAO0Y,YAC/CztB,KAAKi/B,OAASlqB,EAAO0Y,WACrBztB,KAAK6/B,WAAaF,GAAaG,cAAc/qB,GAC7C/U,KAAK+/B,SAAWJ,GAAaK,YAAYjrB,GAG3CkrB,eACE,OAAOjgC,KAAK6/B,WAGdK,aACE,OAAOlgC,KAAK+/B,SAGdI,QAAQlP,GACN,OACEjxB,KAAKi/B,OAAO7N,QAAQpxB,KAAKigC,eAAgBhP,IAAS,GAClDjxB,KAAKi/B,OAAO7N,QAAQH,EAAMjxB,KAAKkgC,eAAiB,EAGpDvJ,YACEgH,EACAl3B,EACAy4B,EACAC,EACA/7B,EACAg8B,GAKA,OAHKp/B,KAAKmgC,QAAQ,IAAInP,GAAUvqB,EAAKy4B,MACnCA,EAAW/D,GAAalI,YAEnBjzB,KAAK4/B,eAAejJ,YACzBgH,EACAl3B,EACAy4B,EACAC,EACA/7B,EACAg8B,GAGJG,eACER,EACAS,EACAJ,GAEII,EAAQ/J,eAEV+J,EAAUrE,GAAalI,YAEzB,IAAImN,EAAWZ,EAAQ9H,UAAU13B,KAAKi/B,QAEtCmB,EAAWA,EAASnK,eAAekF,GAAalI,YAChD,MAAMhvB,EAAOjE,KAMb,OALAw/B,EAAQ1I,aAAae,IAAgB,CAACpxB,EAAK+vB,KACpCvyB,EAAKk8B,QAAQ,IAAInP,GAAUvqB,EAAK+vB,MACnC4J,EAAWA,EAAS3J,qBAAqBhwB,EAAK00B,GAAalI,gBAGxDjzB,KAAK4/B,eAAeL,eACzBR,EACAqB,EACAhB,GAGJnJ,eAAe8I,EAAevD,GAE5B,OAAOuD,EAETU,eACE,OAAO,EAETC,mBACE,OAAO1/B,KAAK4/B,eAEdnS,WACE,OAAOztB,KAAKi/B,OAGNxlB,qBAAqB1E,GAC3B,GAAIA,EAAOsrB,WAAY,CACrB,MAAMC,EAAYvrB,EAAOwrB,oBACzB,OAAOxrB,EAAO0Y,WAAWuE,SAASjd,EAAOyrB,qBAAsBF,GAE/D,OAAOvrB,EAAO0Y,WAAWiE,UAIrBjY,mBAAmB1E,GACzB,GAAIA,EAAO0rB,SAAU,CACnB,MAAMC,EAAU3rB,EAAO4rB,kBACvB,OAAO5rB,EAAO0Y,WAAWuE,SAASjd,EAAO6rB,mBAAoBF,GAE7D,OAAO3rB,EAAO0Y,WAAWsE,WC/FlB,MAAA8O,GASXv9B,YAAYyR,GACV/U,KAAK8gC,cAAgB,IAAInB,GAAa5qB,GACtC/U,KAAKi/B,OAASlqB,EAAO0Y,WACrBztB,KAAK+gC,OAAShsB,EAAOisB,WACrBhhC,KAAKihC,UAAYlsB,EAAOmsB,iBAE1BvK,YACEgH,EACAl3B,EACAy4B,EACAC,EACA/7B,EACAg8B,GAKA,OAHKp/B,KAAK8gC,cAAcX,QAAQ,IAAInP,GAAUvqB,EAAKy4B,MACjDA,EAAW/D,GAAalI,YAEtB0K,EAAKxH,kBAAkB1vB,GAAKmxB,OAAOsH,GAE9BvB,EACEA,EAAK9G,cAAgB72B,KAAK+gC,OAC5B/gC,KAAK8gC,cACTpB,mBACA/I,YACCgH,EACAl3B,EACAy4B,EACAC,EACA/7B,EACAg8B,GAGGp/B,KAAKmhC,sBACVxD,EACAl3B,EACAy4B,EACA97B,EACAg8B,GAING,eACER,EACAS,EACAJ,GAEA,IAAIgB,EACJ,GAAIZ,EAAQ/J,cAAgB+J,EAAQ34B,UAElCu5B,EAAWjF,GAAalI,WAAWyE,UAAU13B,KAAKi/B,aAElD,GACgB,EAAdj/B,KAAK+gC,OAAavB,EAAQ3I,eAC1B2I,EAAQ7H,UAAU33B,KAAKi/B,QACvB,CAIA,IAAI1C,EAFJ6D,EAAWjF,GAAalI,WAAWyE,UAAU13B,KAAKi/B,QAIhD1C,EADEv8B,KAAKihC,SACKzB,EAAyBxK,uBACnCh1B,KAAK8gC,cAAcZ,aACnBlgC,KAAKi/B,QAGKO,EAAyBzK,gBACnC/0B,KAAK8gC,cAAcb,eACnBjgC,KAAKi/B,QAGT,IAAI9L,EAAQ,EACZ,KAAOoJ,EAAS5J,WAAaQ,EAAQnzB,KAAK+gC,QAAQ,CAChD,MAAMtG,EAAO8B,EAAS9J,UACtB,IAAI2O,EAQJ,GANEA,EADEphC,KAAKihC,SAELjhC,KAAKi/B,OAAO7N,QAAQpxB,KAAK8gC,cAAcb,eAAgBxF,IAAS,EAGhEz6B,KAAKi/B,OAAO7N,QAAQqJ,EAAMz6B,KAAK8gC,cAAcZ,eAAiB,GAE9DkB,EAKF,MAJAhB,EAAWA,EAAS3J,qBAAqBgE,EAAKrxB,KAAMqxB,EAAKxJ,MACzDkC,SAMC,CAOL,IAAImJ,EACAE,EACAhU,EACA+T,EACJ,GATA6D,EAAWZ,EAAQ9H,UAAU13B,KAAKi/B,QAElCmB,EAAWA,EAASnK,eAClBkF,GAAalI,YAMXjzB,KAAKihC,SAAU,CACjB1E,EAAW6D,EAASnL,mBAAmBj1B,KAAKi/B,QAC5C3C,EAAYt8B,KAAK8gC,cAAcZ,aAC/B1D,EAAUx8B,KAAK8gC,cAAcb,eAC7B,MAAMoB,EAAerhC,KAAKi/B,OAAO9N,aACjC3I,EAAM,CAACtgB,EAAcC,IAAiBk5B,EAAal5B,EAAGD,QAEtDq0B,EAAW6D,EAASvL,YAAY70B,KAAKi/B,QACrC3C,EAAYt8B,KAAK8gC,cAAcb,eAC/BzD,EAAUx8B,KAAK8gC,cAAcZ,aAC7B1X,EAAMxoB,KAAKi/B,OAAO9N,aAGpB,IAAIgC,EAAQ,EACRmO,GAAiB,EACrB,KAAO/E,EAAS5J,WAAW,CACzB,MAAM8H,EAAO8B,EAAS9J,WACjB6O,GAAkB9Y,EAAI8T,EAAW7B,IAAS,IAE7C6G,GAAiB,GAGjBA,GAAkBnO,EAAQnzB,KAAK+gC,QAAUvY,EAAIiS,EAAM+B,IAAY,EAE/DrJ,IAEAiN,EAAWA,EAAS3J,qBAClBgE,EAAKrxB,KACL+xB,GAAalI,aAMvB,OAAOjzB,KAAK8gC,cACTpB,mBACAH,eAAeR,EAASqB,EAAUhB,GAEvCnJ,eAAe8I,EAAevD,GAE5B,OAAOuD,EAETU,eACE,OAAO,EAETC,mBACE,OAAO1/B,KAAK8gC,cAAcpB,mBAE5BjS,WACE,OAAOztB,KAAKi/B,OAGNkC,sBACNxD,EACA4D,EACAC,EACAp+B,EACAq+B,GAGA,IAAIjZ,EACJ,GAAIxoB,KAAKihC,SAAU,CACjB,MAAMjJ,EAAWh4B,KAAKi/B,OAAO9N,aAC7B3I,EAAM,CAACtgB,EAAcC,IAAiB6vB,EAAS7vB,EAAGD,QAElDsgB,EAAMxoB,KAAKi/B,OAAO9N,aAEpB,MAAMuQ,EAAgB/D,EACtB/+B,EAAO8iC,EAAc7K,gBAAkB72B,KAAK+gC,OAAQ,IACpD,MAAMY,EAAoB,IAAI3Q,GAAUuQ,EAAUC,GAC5CI,EAAiB5hC,KAAKihC,SACxBS,EAAcxF,cAAcl8B,KAAKi/B,QAChCyC,EAActF,aAAap8B,KAAKi/B,QAC/BmC,EAAUphC,KAAK8gC,cAAcX,QAAQwB,GAC3C,GAAID,EAAcpL,SAASiL,GAAW,CACpC,MAAMM,EAAeH,EAAcvL,kBAAkBoL,GACrD,IAAIO,EAAY1+B,EAAO2+B,mBACrB/hC,KAAKi/B,OACL2C,EACA5hC,KAAKihC,UAEP,KACe,MAAba,IACCA,EAAU14B,OAASm4B,GAAYG,EAAcpL,SAASwL,EAAU14B,QAKjE04B,EAAY1+B,EAAO2+B,mBACjB/hC,KAAKi/B,OACL6C,EACA9hC,KAAKihC,UAGT,MAAMe,EACS,MAAbF,EAAoB,EAAItZ,EAAIsZ,EAAWH,GAGzC,GADEP,IAAYI,EAAU36B,WAAam7B,GAAe,EAOlD,OALyB,MAArBP,GACFA,EAAkBnC,iBAChBR,GAAmByC,EAAUC,EAAWK,IAGrCH,EAAcjL,qBAAqB8K,EAAUC,GAC/C,CACoB,MAArBC,GACFA,EAAkBnC,iBAChBT,GAAmB0C,EAAUM,IAGjC,MAAMI,EAAgBP,EAAcjL,qBAClC8K,EACApG,GAAalI,YAIf,OADe,MAAb6O,GAAqB9hC,KAAK8gC,cAAcX,QAAQ2B,IAEvB,MAArBL,GACFA,EAAkBnC,iBAChBV,GAAiBkD,EAAU14B,KAAM04B,EAAU7Q,OAGxCgR,EAAcxL,qBACnBqL,EAAU14B,KACV04B,EAAU7Q,OAGLgR,GAGN,OAAIT,EAAU36B,UAEZ82B,EACEyD,GACL5Y,EAAIoZ,EAAgBD,IAAsB,GACnB,MAArBF,IACFA,EAAkBnC,iBAChBT,GAAmB+C,EAAex4B,KAAMw4B,EAAe3Q,OAEzDwQ,EAAkBnC,iBAChBV,GAAiB2C,EAAUC,KAGxBE,EACJjL,qBAAqB8K,EAAUC,GAC/B/K,qBAAqBmL,EAAex4B,KAAM+xB,GAAalI,aAKrD0K,GCvOA,MAAAuE,GAAb5+B,cACEtD,KAASmiC,WAAG,EACZniC,KAASoiC,WAAG,EACZpiC,KAAaqiC,eAAG,EAChBriC,KAAcsiC,gBAAG,EACjBtiC,KAAOuiC,SAAG,EACVviC,KAAWwiC,aAAG,EACdxiC,KAAayiC,eAAG,EAChBziC,KAAM+gC,OAAG,EACT/gC,KAAS0iC,UAAG,GACZ1iC,KAAgB2iC,iBAAmB,KACnC3iC,KAAe4iC,gBAAG,GAClB5iC,KAAc6iC,eAAmB,KACjC7iC,KAAa8iC,cAAG,GAChB9iC,KAAMi/B,OAAkBpH,GAExBwI,WACE,OAAOrgC,KAAKoiC,UAGdW,gBACE,OAAO/iC,KAAKsiC,eAGdU,eACE,OAAOhjC,KAAKyiC,cAMdvB,iBACE,MAAuB,KAAnBlhC,KAAK0iC,UAKA1iC,KAAKoiC,UAES,MAAdpiC,KAAK0iC,UAOhBlC,qBAEE,OADA5hC,EAAOoB,KAAKoiC,UAAW,oCAChBpiC,KAAK2iC,iBAOdpC,oBAEE,OADA3hC,EAAOoB,KAAKoiC,UAAW,oCACnBpiC,KAAKqiC,cACAriC,KAAK4iC,gBAEL9zB,GAIX2xB,SACE,OAAOzgC,KAAKuiC,QAMd3B,mBAEE,OADAhiC,EAAOoB,KAAKuiC,QAAS,kCACdviC,KAAK6iC,eAOdlC,kBAEE,OADA/hC,EAAOoB,KAAKuiC,QAAS,kCACjBviC,KAAKwiC,YACAxiC,KAAK8iC,cAEL/zB,GAIXk0B,WACE,OAAOjjC,KAAKmiC,UAMde,mBACE,OAAOljC,KAAKmiC,WAAgC,KAAnBniC,KAAK0iC,UAMhC1B,WAEE,OADApiC,EAAOoB,KAAKmiC,UAAW,oCAChBniC,KAAK+gC,OAGdtT,WACE,OAAOztB,KAAKi/B,OAGdlS,eACE,QAAS/sB,KAAKoiC,WAAapiC,KAAKuiC,SAAWviC,KAAKmiC,WAGlDrV,YACE,OAAO9sB,KAAK+sB,gBAAkB/sB,KAAKi/B,SAAWpH,GAGhD3E,OACE,MAAMA,EAAO,IAAIgP,GAajB,OAZAhP,EAAKiP,UAAYniC,KAAKmiC,UACtBjP,EAAK6N,OAAS/gC,KAAK+gC,OACnB7N,EAAKkP,UAAYpiC,KAAKoiC,UACtBlP,EAAKyP,iBAAmB3iC,KAAK2iC,iBAC7BzP,EAAKmP,cAAgBriC,KAAKqiC,cAC1BnP,EAAK0P,gBAAkB5iC,KAAK4iC,gBAC5B1P,EAAKqP,QAAUviC,KAAKuiC,QACpBrP,EAAK2P,eAAiB7iC,KAAK6iC,eAC3B3P,EAAKsP,YAAcxiC,KAAKwiC,YACxBtP,EAAK4P,cAAgB9iC,KAAK8iC,cAC1B5P,EAAK+L,OAASj/B,KAAKi/B,OACnB/L,EAAKwP,UAAY1iC,KAAK0iC,UACfxP,GA+CK,SAAAiQ,GACdC,EACAnR,EACAxrB,GAEA,MAAM48B,EAAYD,EAAYlQ,OAa9B,OAZAmQ,EAAUjB,WAAY,OACHl/B,IAAf+uB,IACFA,EAAa,MAEfoR,EAAUV,iBAAmB1Q,EAClB,MAAPxrB,GACF48B,EAAUhB,eAAgB,EAC1BgB,EAAUT,gBAAkBn8B,IAE5B48B,EAAUhB,eAAgB,EAC1BgB,EAAUT,gBAAkB,IAEvBS,EA2BO,SAAAC,GACdF,EACAnR,EACAxrB,GAEA,MAAM48B,EAAYD,EAAYlQ,OAa9B,OAZAmQ,EAAUd,SAAU,OACDr/B,IAAf+uB,IACFA,EAAa,MAEfoR,EAAUR,eAAiB5Q,OACf/uB,IAARuD,GACF48B,EAAUb,aAAc,EACxBa,EAAUP,cAAgBr8B,IAE1B48B,EAAUb,aAAc,EACxBa,EAAUP,cAAgB,IAErBO,EA2BO,SAAAE,GACdH,EACA/W,GAEA,MAAMgX,EAAYD,EAAYlQ,OAE9B,OADAmQ,EAAUpE,OAAS5S,EACZgX,EAQH,SAAUG,GACdJ,GAEA,MAAMK,EAAsC,GAE5C,GAAIL,EAAYtW,YACd,OAAO2W,EAGT,IAAIC,EAqCJ,OApCIN,EAAYnE,SAAWpH,GACzB6L,EAA8C,YACrCN,EAAYnE,SAAWlB,GAChC2F,EAA2C,SAClCN,EAAYnE,SAAW/M,GAChCwR,EAAyC,QAEzC9kC,EAAOwkC,EAAYnE,kBAAkBzB,GAAW,4BAChDkG,EAAUN,EAAYnE,OAAO5yB,YAE/Bo3B,EAAiC,QAAG39B,EAAU49B,GAE1CN,EAAYhB,YACdqB,EAAiC,QAAG39B,EAAUs9B,EAAYT,kBACtDS,EAAYf,gBACdoB,EAAiC,SAC/B,IAAM39B,EAAUs9B,EAAYR,mBAI9BQ,EAAYb,UACdkB,EAA+B,MAAG39B,EAAUs9B,EAAYP,gBACpDO,EAAYZ,cACdiB,EAA+B,OAC7B,IAAM39B,EAAUs9B,EAAYN,iBAI9BM,EAAYjB,YACViB,EAAYlC,iBACduC,EAAuC,aAAGL,EAAYrC,OAEtD0C,EAAsC,YAAGL,EAAYrC,QAIlD0C,EAGH,SAAUE,GACdP,GAEA,MAAM58B,EAA+B,GAerC,GAdI48B,EAAYhB,YACd57B,EAA8C,GAC5C48B,EAAYT,iBACVS,EAAYf,gBACd77B,EAA6C,GAC3C48B,EAAYR,kBAGdQ,EAAYb,UACd/7B,EAA4C,GAAG48B,EAAYP,eACvDO,EAAYZ,cACdh8B,EAA2C,GAAG48B,EAAYN,gBAG1DM,EAAYjB,UAAW,CACzB37B,EAAkC,EAAG48B,EAAYrC,OACjD,IAAI6C,EAAWR,EAAYV,UACV,KAAbkB,IAEAA,EADER,EAAYlC,iBACoC,IAEC,KAGvD16B,EAAsC,GAAGo9B,EAM3C,OAHIR,EAAYnE,SAAWpH,KACzBrxB,EAAkC,EAAG48B,EAAYnE,OAAO5yB,YAEnD7F,EC9YH,MAAOq9B,WAA2Bpf,GA8BtCnhB,YACUud,EACA6I,EAMAG,EACAC,GAERxD,QAVQtmB,KAAS6gB,UAATA,EACA7gB,KAAa0pB,cAAbA,EAMA1pB,KAAkB6pB,mBAAlBA,EACA7pB,KAAsB8pB,uBAAtBA,EAjCF9pB,KAAAgX,KAAqCzI,GAAW,WAMhDvO,KAAQ8jC,SAA4B,GAX5C1e,YAAYC,GACV,MAAM,IAAIrmB,MAAM,2BAYlBya,oBAAoB7E,EAAqB6X,GACvC,YAAYvpB,IAARupB,EACK,OAASA,GAEhB7tB,EACEgW,EAAMiY,aAAaC,YACnB,kDAEKlY,EAAMsX,MAAM7f,YAuBvBkgB,OACE3X,EACA4X,EACAC,EACA7H,GAEA,MAAMD,EAAa/P,EAAMsX,MAAM7f,WAC/BrM,KAAKgX,KAAK,qBAAuB2N,EAAa,IAAM/P,EAAM+X,kBAG1D,MAAMoX,EAAWF,GAAmBG,aAAapvB,EAAO6X,GAClDwX,EAAa,GACnBjkC,KAAK8jC,SAASC,GAAYE,EAE1B,MAAMC,EAAwBV,GAC5B5uB,EAAMiY,cAGR7sB,KAAKmkC,aACHxf,EAAa,QACbuf,GACA,CAACphC,EAAOgsB,KACN,IAAI/oB,EAAO+oB,EAWX,GATc,MAAVhsB,IACFiD,EAAO,KACPjD,EAAQ,MAGI,OAAVA,GACF9C,KAAK0pB,cAAc/E,EAAY5e,GAAmB,EAAO0mB,GAGvD7lB,EAAQ5G,KAAK8jC,SAAUC,KAAcE,EAAY,CACnD,IAAI7W,EAIFA,EAHGtqB,EAEgB,MAAVA,EACA,oBAEA,cAAgBA,EAJhB,KAOX8hB,EAAWwI,EAAQ,UAO3BkB,SAAS1Z,EAAqB6X,GAC5B,MAAMsX,EAAWF,GAAmBG,aAAapvB,EAAO6X,UACjDzsB,KAAK8jC,SAASC,GAGvB93B,IAAI2I,GACF,MAAMsvB,EAAwBV,GAC5B5uB,EAAMiY,cAGFlI,EAAa/P,EAAMsX,MAAM7f,WAEzB0f,EAAW,IAAI1mB,EA0BrB,OAxBArF,KAAKmkC,aACHxf,EAAa,QACbuf,GACA,CAACphC,EAAOgsB,KACN,IAAI/oB,EAAO+oB,EAEG,MAAVhsB,IACFiD,EAAO,KACPjD,EAAQ,MAGI,OAAVA,GACF9C,KAAK0pB,cACH/E,EACA5e,GACa,EACJ,MAEXgmB,EAASxmB,QAAQQ,IAEjBgmB,EAASzmB,OAAO,IAAItG,MAAM+G,OAIzBgmB,EAASvmB,QAIlBuf,iBAAiB9e,IAQTk+B,aACNxf,EACAuf,EAA0D,GAC1Dv+B,GAIA,OAFAu+B,EAA8B,OAAI,SAE3Bz+B,QAAQ6qB,IAAI,CACjBtwB,KAAK6pB,mBAAmBxX,UAA2B,GACnDrS,KAAK8pB,uBAAuBzX,UAA2B,KACtDD,MAAK,EAAEsE,EAAWD,MACfC,GAAaA,EAAUlD,cACzB0wB,EAA4B,KAAIxtB,EAAUlD,aAExCiD,GAAiBA,EAAcxQ,QACjCi+B,EAA0B,GAAIztB,EAAcxQ,OAG9C,MAAM6W,GACH9c,KAAK6gB,UAAUhN,OAAS,WAAa,WACtC7T,KAAK6gB,UAAUjN,KACf+Q,EAFA,OAKA3kB,KAAK6gB,UAAU/M,UCzLjB,SAAsBswB,GAG1B,MAAMrvB,EAAS,GACf,IAAK,MAAOtO,EAAKzD,KAAUK,OAAOghC,QAAQD,GACpC7jC,MAAMC,QAAQwC,GAChBA,EAAMshC,SAAQC,IACZxvB,EAAO1T,KACLmjC,mBAAmB/9B,GAAO,IAAM+9B,mBAAmBD,OAIvDxvB,EAAO1T,KAAKmjC,mBAAmB/9B,GAAO,IAAM+9B,mBAAmBxhC,IAGnE,OAAO+R,EAAOzV,OAAS,IAAMyV,EAAOzT,KAAK,KAAO,GD2K1CmjC,CAAYP,GAEdlkC,KAAKgX,KAAK,4BAA8B8F,GACxC,MAAM4nB,EAAM,IAAIC,eAChBD,EAAIlnB,mBAAqB,KACvB,GAAI7X,GAA+B,IAAnB++B,EAAI9sB,WAAkB,CACpC5X,KAAKgX,KACH,qBAAuB8F,EAAM,qBAC7B4nB,EAAItX,OACJ,YACAsX,EAAIE,cAEN,IAAI39B,EAAM,KACV,GAAIy9B,EAAItX,QAAU,KAAOsX,EAAItX,OAAS,IAAK,CACzC,IACEnmB,EAAMpB,EAAS6+B,EAAIE,cACnB,MAAOhiC,GACP+B,GACE,qCACEmY,EACA,KACA4nB,EAAIE,cAGVj/B,EAAS,KAAMsB,QAGI,MAAfy9B,EAAItX,QAAiC,MAAfsX,EAAItX,QAC5BzoB,GACE,sCACEmY,EACA,YACA4nB,EAAItX,QAGVznB,EAAS++B,EAAItX,QAEfznB,EAAW,OAIf++B,EAAIvtB,KAAK,MAAO2F,GAAuB,GACvC4nB,EAAIrqB,WElOG,MAAAwqB,GAAbvhC,cACUtD,KAAA8kC,UAAkB3J,GAAalI,WAEvC8R,QAAQ9d,GACN,OAAOjnB,KAAK8kC,UAAUzO,SAASpP,GAGjC+d,eAAe/d,EAAYge,GACzBjlC,KAAK8kC,UAAY9kC,KAAK8kC,UAAUnO,YAAY1P,EAAMge,ICHtC,SAAAC,KACd,MAAO,CACLliC,MAAO,KACPm6B,SAAU,IAAIhT,KAsCF,SAAAgb,GACdC,EACAne,EACAlhB,GAEA,GAAI8hB,GAAYZ,GACdme,EAAmBpiC,MAAQ+C,EAC3Bq/B,EAAmBjI,SAASkI,aACvB,GAAiC,OAA7BD,EAAmBpiC,MAC5BoiC,EAAmBpiC,MAAQoiC,EAAmBpiC,MAAM2zB,YAAY1P,EAAMlhB,OACjE,CACL,MAAMw7B,EAAWva,GAAaC,GACzBme,EAAmBjI,SAASvQ,IAAI2U,IACnC6D,EAAmBjI,SAAStxB,IAAI01B,EAAU2D,MAK5CC,GAFcC,EAAmBjI,SAASlxB,IAAIs1B,GAC9Cta,EAAOE,GAAaF,GACoBlhB,IAU5B,SAAAu/B,GACdF,EACAne,GAEA,GAAIY,GAAYZ,GAGd,OAFAme,EAAmBpiC,MAAQ,KAC3BoiC,EAAmBjI,SAASkI,SACrB,EAEP,GAAiC,OAA7BD,EAAmBpiC,MAAgB,CACrC,GAAIoiC,EAAmBpiC,MAAMyyB,aAE3B,OAAO,EACF,CACL,MAAMzyB,EAAQoiC,EAAmBpiC,MAOjC,OANAoiC,EAAmBpiC,MAAQ,KAE3BA,EAAM8zB,aAAae,IAAgB,CAACpxB,EAAK8+B,KACvCJ,GAA2BC,EAAoB,IAAI3e,GAAKhgB,GAAM8+B,MAGzDD,GAAyBF,EAAoBne,IAEjD,GAAIme,EAAmBjI,SAAS/gB,KAAO,EAAG,CAC/C,MAAMmlB,EAAWva,GAAaC,GAE9B,GADAA,EAAOE,GAAaF,GAChBme,EAAmBjI,SAASvQ,IAAI2U,GAAW,CACxB+D,GACnBF,EAAmBjI,SAASlxB,IAAIs1B,GAChCta,IAGAme,EAAmBjI,SAASjgB,OAAOqkB,GAIvC,OAA4C,IAArC6D,EAAmBjI,SAAS/gB,KAEnC,OAAO,EAYG,SAAAopB,GACdJ,EACAK,EACAC,GAEiC,OAA7BN,EAAmBpiC,MACrB0iC,EAAKD,EAAYL,EAAmBpiC,OAexB,SACdoiC,EACAM,GAEAN,EAAmBjI,SAASmH,SAAQ,CAACiB,EAAM9+B,KACzCi/B,EAAKj/B,EAAK8+B,MAlBVI,CAA+BP,GAAoB,CAAC3+B,EAAK8+B,KAEvDC,GAA8BD,EADjB,IAAI9e,GAAKgf,EAAWp5B,WAAa,IAAM5F,GACVi/B,MCpInC,MAAAE,GAGXtiC,YAAoBuiC,GAAA7lC,KAAW6lC,YAAXA,EAFZ7lC,KAAK8lC,MAAmC,KAIhD75B,MACE,MAAM85B,EAAW/lC,KAAK6lC,YAAY55B,MAE5BwkB,EAAKptB,OAAAu3B,OAAA,GAAQmL,GAQnB,OAPI/lC,KAAK8lC,OACPh2B,GAAK9P,KAAK8lC,OAAO,CAACE,EAAchjC,KAC9BytB,EAAMuV,GAAQvV,EAAMuV,GAAQhjC,KAGhChD,KAAK8lC,MAAQC,EAENtV,GCRE,MAAAwV,GAIX3iC,YAAY4iC,EAAqCC,GAAAnmC,KAAOmmC,QAAPA,EAFjDnmC,KAAcomC,eAA6B,GAGzCpmC,KAAKqmC,eAAiB,IAAIT,GAAcM,GAExC,MAAMv0B,EAbmB,IAevB,IAAgDtB,KAAK2I,SACvDvH,GAAsBzR,KAAKsmC,aAAah4B,KAAKtO,MAAOqQ,KAAKI,MAAMkB,IAGzD20B,eACN,MAAMjhB,EAAQrlB,KAAKqmC,eAAep6B,MAC5Bs6B,EAA8B,GACpC,IAAIC,GAAoB,EAExB12B,GAAKuV,GAAO,CAAC2gB,EAAchjC,KACrBA,EAAQ,GAAKuD,EAASvG,KAAKomC,eAAgBJ,KAC7CO,EAAcP,GAAQhjC,EACtBwjC,GAAoB,MAIpBA,GACFxmC,KAAKmmC,QAAQ/gB,YAAYmhB,GAI3B90B,GACEzR,KAAKsmC,aAAah4B,KAAKtO,MACvBqQ,KAAKI,MAAsB,EAAhBJ,KAAK2I,SAlCQ,OCT9B,IAAYytB,GA6CN,SAAUC,GACdha,GAEA,MAAO,CACLia,UAAU,EACVC,YAAY,EACZla,QAAAA,EACAma,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,KAAAA,GAKX,KCEY,MAAAK,GAUXxjC,YAC4B2jB,EACA8f,EACAC,GAFAhnC,KAAIinB,KAAJA,EACAjnB,KAAY+mC,aAAZA,EACA/mC,KAAMgnC,OAANA,EAX5BhnC,KAAAsJ,KAAOm9B,GAAcQ,eAGrBjnC,KAAMoD,ODgBC,CACLujC,UAAU,EACVC,YAAY,EACZla,QAAS,KACTma,QAAQ,GCVVK,kBAAkB9Q,GAChB,GAAKvO,GAAY7nB,KAAKinB,MAUf,CAAA,GAA+B,MAA3BjnB,KAAK+mC,aAAa/jC,MAM3B,OALApE,EACEoB,KAAK+mC,aAAa5J,SAASt2B,UAC3B,4DAGK7G,KACF,CACL,MAAMo5B,EAAYp5B,KAAK+mC,aAAaI,QAAQ,IAAI1gB,GAAK2P,IACrD,OAAO,IAAI0Q,GAAa/f,KAAgBqS,EAAWp5B,KAAKgnC,SAdxD,OAJApoC,EACEooB,GAAahnB,KAAKinB,QAAUmP,EAC5B,iDAEK,IAAI0Q,GACT3f,GAAannB,KAAKinB,MAClBjnB,KAAK+mC,aACL/mC,KAAKgnC,SCjCA,MAAAI,GAIX9jC,YAAmBF,EAAgC6jB,GAAhCjnB,KAAMoD,OAANA,EAAgCpD,KAAIinB,KAAJA,EAFnDjnB,KAAAsJ,KAAOm9B,GAAcY,gBAIrBH,kBAAkB9Q,GAChB,OAAIvO,GAAY7nB,KAAKinB,MACZ,IAAImgB,GAAepnC,KAAKoD,OAAQ2jB,MAEhC,IAAIqgB,GAAepnC,KAAKoD,OAAQ+jB,GAAannB,KAAKinB,QCTlD,MAAAqgB,GAIXhkC,YACSF,EACA6jB,EACA0W,GAFA39B,KAAMoD,OAANA,EACApD,KAAIinB,KAAJA,EACAjnB,KAAI29B,KAAJA,EALT39B,KAAAsJ,KAAOm9B,GAAcc,UAQrBL,kBAAkB9Q,GAChB,OAAIvO,GAAY7nB,KAAKinB,MACZ,IAAIqgB,GACTtnC,KAAKoD,OACL2jB,KACA/mB,KAAK29B,KAAKxH,kBAAkBC,IAGvB,IAAIkR,GAAUtnC,KAAKoD,OAAQ+jB,GAAannB,KAAKinB,MAAOjnB,KAAK29B,OCRzD,MAAA6J,GAIXlkC,YAC4BF,EACA6jB,EACAkW,GAFAn9B,KAAMoD,OAANA,EACApD,KAAIinB,KAAJA,EACAjnB,KAAQm9B,SAARA,EAL5Bn9B,KAAAsJ,KAAOm9B,GAAcgB,MAOrBP,kBAAkB9Q,GAChB,GAAIvO,GAAY7nB,KAAKinB,MAAO,CAC1B,MAAMmS,EAAYp5B,KAAKm9B,SAASgK,QAAQ,IAAI1gB,GAAK2P,IACjD,OAAIgD,EAAUvyB,UAEL,KACEuyB,EAAUp2B,MAEZ,IAAIskC,GAAUtnC,KAAKoD,OAAQ2jB,KAAgBqS,EAAUp2B,OAGrD,IAAIwkC,GAAMxnC,KAAKoD,OAAQ2jB,KAAgBqS,GAOhD,OAJAx6B,EACEooB,GAAahnB,KAAKinB,QAAUmP,EAC5B,kEAEK,IAAIoR,GAAMxnC,KAAKoD,OAAQ+jB,GAAannB,KAAKinB,MAAOjnB,KAAKm9B,UAGhE9wB,WACE,MACE,aACArM,KAAKinB,KACL,KACAjnB,KAAKoD,OAAOiJ,WACZ,WACArM,KAAKm9B,SAAS9wB,WACd,KC5CO,MAAAq7B,GACXpkC,YACUqkC,EACAC,EACAC,GAFA7nC,KAAK2nC,MAALA,EACA3nC,KAAiB4nC,kBAAjBA,EACA5nC,KAAS6nC,UAATA,EAMVC,qBACE,OAAO9nC,KAAK4nC,kBAMdG,aACE,OAAO/nC,KAAK6nC,UAGdG,kBAAkB/gB,GAChB,GAAIY,GAAYZ,GACd,OAAOjnB,KAAK8nC,uBAAyB9nC,KAAK6nC,UAG5C,MAAMtG,EAAWva,GAAaC,GAC9B,OAAOjnB,KAAKioC,mBAAmB1G,GAGjC0G,mBAAmBxhC,GACjB,OACGzG,KAAK8nC,uBAAyB9nC,KAAK6nC,WAAc7nC,KAAK2nC,MAAMrR,SAAS7vB,GAI1Es+B,UACE,OAAO/kC,KAAK2nC,OC/BH,MAAAO,GAGX5kC,YAAmB6kC,GAAAnoC,KAAMmoC,OAANA,EACjBnoC,KAAKi/B,OAASj/B,KAAKmoC,OAAOtb,aAAaY,YAiF3C,SAAS2a,GACPC,EACAC,EACA5iB,EACA6iB,EACAC,EACAC,GAEA,MAAMC,EAAkBH,EAAQI,QAAOC,GAAUA,EAAOt/B,OAASoc,IAEjEgjB,EAAgBl5B,MAAK,CAACtH,EAAGC,IAoC3B,SACEkgC,EACAngC,EACAC,GAEA,GAAmB,MAAfD,EAAEkuB,WAAoC,MAAfjuB,EAAEiuB,UAC3B,MAAMr3B,EAAe,sCAEvB,MAAM8pC,EAAW,IAAI7X,GAAU9oB,EAAEkuB,UAAWluB,EAAEy2B,cACxCmK,EAAW,IAAI9X,GAAU7oB,EAAEiuB,UAAWjuB,EAAEw2B,cAC9C,OAAO0J,EAAepJ,OAAO7N,QAAQyX,EAAUC,GA7C7CC,CAA6BV,EAAgBngC,EAAGC,KAElDugC,EAAgBpE,SAAQsE,IACtB,MAAMI,EAeV,SACEX,EACAO,EACAH,GAEA,MAAoB,UAAhBG,EAAOt/B,MAAoC,kBAAhBs/B,EAAOt/B,OAGpCs/B,EAAOK,SAAWR,EAAWlS,wBAC3BqS,EAAOxS,UACPwS,EAAOjK,aACP0J,EAAepJ,SALV2J,EArBoBM,CACzBb,EACAO,EACAH,GAEFD,EAAclE,SAAQ6E,IAChBA,EAAaC,WAAWR,EAAOt/B,OACjCg/B,EAAOjnC,KACL8nC,EAAaE,YAAYL,EAAoBX,EAAeF,eC5GtD,SAAAmB,GACdb,EACAc,GAEA,MAAO,CAAEd,WAAAA,EAAYc,YAAAA,GAGjB,SAAUC,GACdC,EACAC,EACAC,EACAvJ,GAEA,OAAOkJ,GACL,IAAI5B,GAAUgC,EAAWC,EAAUvJ,GACnCqJ,EAAUF,aAIR,SAAUK,GACdH,EACAI,EACAF,EACAvJ,GAEA,OAAOkJ,GACLG,EAAUhB,WACV,IAAIf,GAAUmC,EAAYF,EAAUvJ,IAIlC,SAAU0J,GACdL,GAEA,OAAOA,EAAUhB,WAAWX,qBACxB2B,EAAUhB,WAAW1D,UACrB,KAGA,SAAUgF,GACdN,GAEA,OAAOA,EAAUF,YAAYzB,qBACzB2B,EAAUF,YAAYxE,UACtB,KC/CN,IAAIiF,GAkBS,MAAAC,GASX3mC,YACkBN,EACAm6B,EAvBE,MACf6M,KACHA,GAAyB,IAAIhX,GAC3B5jB,KAGG46B,IAoBDE,IAJYlqC,KAAKgD,MAALA,EACAhD,KAAQm9B,SAARA,EAVlB1jB,kBAAqBjT,GACnB,IAAI++B,EAAyB,IAAI0E,GAAiB,MAIlD,OAHAn6B,GAAKtJ,GAAK,CAAC2jC,EAAmB3I,KAC5B+D,EAAOA,EAAK15B,IAAI,IAAI4a,GAAK0jB,GAAY3I,MAEhC+D,EAcT1+B,UACE,OAAsB,OAAf7G,KAAKgD,OAAkBhD,KAAKm9B,SAASt2B,UAa9CujC,iCACEC,EACAC,GAEA,GAAkB,MAAdtqC,KAAKgD,OAAiBsnC,EAAUtqC,KAAKgD,OACvC,MAAO,CAAEikB,KAAMF,KAAgB/jB,MAAOhD,KAAKgD,OAE3C,GAAI6kB,GAAYwiB,GACd,OAAO,KACF,CACL,MAAMzT,EAAQ5P,GAAaqjB,GACrB/O,EAAQt7B,KAAKm9B,SAASlxB,IAAI2qB,GAChC,GAAc,OAAV0E,EAAgB,CAClB,MAAMiP,EACJjP,EAAM8O,iCACJjjB,GAAakjB,GACbC,GAEJ,GAAiC,MAA7BC,EAAmC,CAKrC,MAAO,CAAEtjB,KAJQS,GACf,IAAIjB,GAAKmQ,GACT2T,EAA0BtjB,MAEHjkB,MAAOunC,EAA0BvnC,OAE1D,OAAO,KAGT,OAAO,MAUfwnC,yBACEH,GAEA,OAAOrqC,KAAKoqC,iCAAiCC,GAAc,KAAM,IAMnElD,QAAQkD,GACN,GAAIxiB,GAAYwiB,GACd,OAAOrqC,KACF,CACL,MAAM42B,EAAQ5P,GAAaqjB,GACrBjR,EAAYp5B,KAAKm9B,SAASlxB,IAAI2qB,GACpC,OAAkB,OAAdwC,EACKA,EAAU+N,QAAQhgB,GAAakjB,IAE/B,IAAIJ,GAAiB,OAYlCp+B,IAAIw+B,EAAoBI,GACtB,GAAI5iB,GAAYwiB,GACd,OAAO,IAAIJ,GAAcQ,EAAOzqC,KAAKm9B,UAChC,CACL,MAAMvG,EAAQ5P,GAAaqjB,GAErBnL,GADQl/B,KAAKm9B,SAASlxB,IAAI2qB,IAAU,IAAIqT,GAAiB,OACxCp+B,IAAIsb,GAAakjB,GAAeI,GACjDxP,EAAcj7B,KAAKm9B,SAAS1J,OAAOmD,EAAOsI,GAChD,OAAO,IAAI+K,GAAcjqC,KAAKgD,MAAOi4B,IAUzC7uB,OAAOi+B,GACL,GAAIxiB,GAAYwiB,GACd,OAAIrqC,KAAKm9B,SAASt2B,UACT,IAAIojC,GAAiB,MAErB,IAAIA,GAAc,KAAMjqC,KAAKm9B,UAEjC,CACL,MAAMvG,EAAQ5P,GAAaqjB,GACrB/O,EAAQt7B,KAAKm9B,SAASlxB,IAAI2qB,GAChC,GAAI0E,EAAO,CACT,MAAM4D,EAAW5D,EAAMlvB,OAAO+a,GAAakjB,IAC3C,IAAIpP,EAMJ,OAJEA,EADEiE,EAASr4B,UACG7G,KAAKm9B,SAAS/wB,OAAOwqB,GAErB52B,KAAKm9B,SAAS1J,OAAOmD,EAAOsI,GAEzB,OAAfl/B,KAAKgD,OAAkBi4B,EAAYp0B,UAC9B,IAAIojC,GAAiB,MAErB,IAAIA,GAAcjqC,KAAKgD,MAAOi4B,GAGvC,OAAOj7B,MAWbiM,IAAIo+B,GACF,GAAIxiB,GAAYwiB,GACd,OAAOrqC,KAAKgD,MACP,CACL,MAAM4zB,EAAQ5P,GAAaqjB,GACrB/O,EAAQt7B,KAAKm9B,SAASlxB,IAAI2qB,GAChC,OAAI0E,EACKA,EAAMrvB,IAAIkb,GAAakjB,IAEvB,MAYbK,QAAQL,EAAoBM,GAC1B,GAAI9iB,GAAYwiB,GACd,OAAOM,EACF,CACL,MAAM/T,EAAQ5P,GAAaqjB,GAErBnL,GADQl/B,KAAKm9B,SAASlxB,IAAI2qB,IAAU,IAAIqT,GAAiB,OACxCS,QAAQvjB,GAAakjB,GAAeM,GAC3D,IAAI1P,EAMJ,OAJEA,EADEiE,EAASr4B,UACG7G,KAAKm9B,SAAS/wB,OAAOwqB,GAErB52B,KAAKm9B,SAAS1J,OAAOmD,EAAOsI,GAErC,IAAI+K,GAAcjqC,KAAKgD,MAAOi4B,IASzC2P,KAAQ7jC,GACN,OAAO/G,KAAK6qC,MAAM9jB,KAAgBhgB,GAM5B8jC,MACNC,EACA/jC,GAEA,MAAMgkC,EAA4B,GAMlC,OALA/qC,KAAKm9B,SAAS/J,kBACZ,CAACmO,EAAkBnI,KACjB2R,EAAMxJ,GAAYnI,EAAUyR,MAAMnjB,GAAUojB,EAAWvJ,GAAWx6B,MAG/DA,EAAG+jC,EAAW9qC,KAAKgD,MAAO+nC,GAMnCC,WAAc/jB,EAAYjf,GACxB,OAAOhI,KAAKirC,YAAYhkB,EAAMF,KAAgB/e,GAGxCijC,YACNC,EACAJ,EACA9iC,GAEA,MAAM8mB,IAAS9uB,KAAKgD,OAAQgF,EAAE8iC,EAAW9qC,KAAKgD,OAC9C,GAAI8rB,EACF,OAAOA,EAEP,GAAIjH,GAAYqjB,GACd,OAAO,KACF,CACL,MAAMtU,EAAQ5P,GAAakkB,GACrBpJ,EAAY9hC,KAAKm9B,SAASlxB,IAAI2qB,GACpC,OAAIkL,EACKA,EAAUmJ,YACf9jB,GAAa+jB,GACbxjB,GAAUojB,EAAWlU,GACrB5uB,GAGK,MAMfmjC,cACElkB,EACAjf,GAEA,OAAOhI,KAAKorC,eAAenkB,EAAMF,KAAgB/e,GAG3CojC,eACNF,EACAG,EACArjC,GAEA,GAAI6f,GAAYqjB,GACd,OAAOlrC,KACF,CACDA,KAAKgD,OACPgF,EAAEqjC,EAAqBrrC,KAAKgD,OAE9B,MAAM4zB,EAAQ5P,GAAakkB,GACrBpJ,EAAY9hC,KAAKm9B,SAASlxB,IAAI2qB,GACpC,OAAIkL,EACKA,EAAUsJ,eACfjkB,GAAa+jB,GACbxjB,GAAU2jB,EAAqBzU,GAC/B5uB,GAGK,IAAIiiC,GAAiB,OAWlCqB,QAAQtjC,GACNhI,KAAKurC,SAASxkB,KAAgB/e,GAGxBujC,SACNF,EACArjC,GAEAhI,KAAKm9B,SAAS/J,kBAAiB,CAACgD,EAAWgD,KACzCA,EAAUmS,SAAS7jB,GAAU2jB,EAAqBjV,GAAYpuB,MAE5DhI,KAAKgD,OACPgF,EAAEqjC,EAAqBrrC,KAAKgD,OAIhCwoC,aAAaxjC,GACXhI,KAAKm9B,SAAS/J,kBACZ,CAACgD,EAAmBgD,KACdA,EAAUp2B,OACZgF,EAAEouB,EAAWgD,EAAUp2B,WC9TpB,MAAAyoC,GACXnoC,YAAmBooC,GAAA1rC,KAAU0rC,WAAVA,EAEnBjyB,eACE,OAAO,IAAIgyB,GAAc,IAAIxB,GAAc,QAI/B,SAAA0B,GACdC,EACA3kB,EACAgK,GAEA,GAAIpJ,GAAYZ,GACd,OAAO,IAAIwkB,GAAc,IAAIxB,GAAchZ,IACtC,CACL,MAAM4a,EAAWD,EAAcF,WAAWlB,yBAAyBvjB,GACnE,GAAgB,MAAZ4kB,EAAkB,CACpB,MAAMC,EAAeD,EAAS5kB,KAC9B,IAAIjkB,EAAQ6oC,EAAS7oC,MACrB,MAAMqnC,EAAeviB,GAAgBgkB,EAAc7kB,GAEnD,OADAjkB,EAAQA,EAAM2zB,YAAY0T,EAAcpZ,GACjC,IAAIwa,GACTG,EAAcF,WAAW7/B,IAAIigC,EAAc9oC,IAExC,CACL,MAAMmkC,EAAU,IAAI8C,GAAchZ,GAC5B8a,EAAeH,EAAcF,WAAWhB,QAAQzjB,EAAMkgB,GAC5D,OAAO,IAAIsE,GAAcM,KAKf,SAAAC,GACdJ,EACA3kB,EACAglB,GAEA,IAAIC,EAAWN,EAIf,OAHA97B,GAAKm8B,GAAS,CAAC1K,EAAkBtQ,KAC/Bib,EAAWP,GAAsBO,EAAUxkB,GAAUT,EAAMsa,GAAWtQ,MAEjEib,EAWO,SAAAC,GACdP,EACA3kB,GAEA,GAAIY,GAAYZ,GACd,OAAOwkB,GAAcW,QAChB,CACL,MAAML,EAAeH,EAAcF,WAAWhB,QAC5CzjB,EACA,IAAIgjB,GAAoB,OAE1B,OAAO,IAAIwB,GAAcM,IAYb,SAAAM,GACdT,EACA3kB,GAEA,OAA4D,MAArDqlB,GAA6BV,EAAe3kB,GAWrC,SAAAqlB,GACdV,EACA3kB,GAEA,MAAM4kB,EAAWD,EAAcF,WAAWlB,yBAAyBvjB,GACnE,OAAgB,MAAZ4kB,EACKD,EAAcF,WAClBz/B,IAAI4/B,EAAS5kB,MACboP,SAASvO,GAAgB+jB,EAAS5kB,KAAMA,IAEpC,KAUL,SAAUslB,GACdX,GAEA,MAAMzO,EAAwB,GACxBlM,EAAO2a,EAAcF,WAAW1oC,MAoBtC,OAnBY,MAARiuB,EAEGA,EAAKwE,cACPxE,EAAsB6F,aACrBe,IACA,CAACzB,EAAWI,KACV2G,EAAS97B,KAAK,IAAI2vB,GAAUoF,EAAWI,OAK7CoV,EAAcF,WAAWvO,SAAS/J,kBAChC,CAACgD,EAAWgD,KACa,MAAnBA,EAAUp2B,OACZm6B,EAAS97B,KAAK,IAAI2vB,GAAUoF,EAAWgD,EAAUp2B,WAKlDm6B,EAGO,SAAAqP,GACdZ,EACA3kB,GAEA,GAAIY,GAAYZ,GACd,OAAO2kB,EACF,CACL,MAAMa,EAAgBH,GAA6BV,EAAe3kB,GAClE,OACS,IAAIwkB,GADQ,MAAjBgB,EACuB,IAAIxC,GAAcwC,GAElBb,EAAcF,WAAWvE,QAAQlgB,KAS1D,SAAUylB,GAAqBd,GACnC,OAAOA,EAAcF,WAAW7kC,UASlB,SAAA8lC,GACdf,EACA3a,GAEA,OAAO2b,GAAkB7lB,KAAgB6kB,EAAcF,WAAYza,GAGrE,SAAS2b,GACPvC,EACAwC,EACA5b,GAEA,GAAuB,MAAnB4b,EAAU7pC,MAEZ,OAAOiuB,EAAK0F,YAAY0T,EAAcwC,EAAU7pC,OAC3C,CACL,IAAI8pC,EAAgB,KAyBpB,OAxBAD,EAAU1P,SAAS/J,kBAAiB,CAACmO,EAAUnI,KAC5B,cAAbmI,GAGF3iC,EACsB,OAApBw6B,EAAUp2B,MACV,6CAEF8pC,EAAgB1T,EAAUp2B,OAE1BiuB,EAAO2b,GACLllB,GAAU2iB,EAAc9I,GACxBnI,EACAnI,MAKDA,EAAKoF,SAASgU,GAAcxjC,WAA+B,OAAlBimC,IAC5C7b,EAAOA,EAAK0F,YACVjP,GAAU2iB,EAAc,aACxByC,IAGG7b,GCvLK,SAAA8b,GACdF,EACA5lB,GAEA,OAAO+lB,GAAgB/lB,EAAM4lB,GAuFf,SAAAI,GACdJ,EACAK,GAOA,MAAMpR,EAAM+Q,EAAUM,UAAUC,WAAUl9B,GACjCA,EAAEg9B,UAAYA,IAEvBtuC,EAAOk9B,GAAO,EAAG,gDACjB,MAAMuR,EAAgBR,EAAUM,UAAUrR,GAC1C+Q,EAAUM,UAAUjnB,OAAO4V,EAAK,GAEhC,IAAIwR,EAAyBD,EAAc7jB,QACvC+jB,GAAsC,EAEtCluC,EAAIwtC,EAAUM,UAAU7tC,OAAS,EAErC,KAAOguC,GAA0BjuC,GAAK,GAAG,CACvC,MAAMmuC,EAAeX,EAAUM,UAAU9tC,GACrCmuC,EAAahkB,UAEbnqB,GAAKy8B,GACL2R,GAA6BD,EAAcH,EAAcpmB,MAGzDqmB,GAAyB,EAChB3kB,GAAa0kB,EAAcpmB,KAAMumB,EAAavmB,QAEvDsmB,GAAsC,IAG1CluC,IAGF,GAAKiuC,EAEE,CAAA,GAAIC,EAGT,OA2CJ,SAA6BV,GAC3BA,EAAUa,cAAgBC,GACxBd,EAAUM,UACVS,GACA7mB,MAEE8lB,EAAUM,UAAU7tC,OAAS,EAC/ButC,EAAUgB,YACRhB,EAAUM,UAAUN,EAAUM,UAAU7tC,OAAS,GAAG4tC,QAEtDL,EAAUgB,aAAe,EAtDzBC,CAAoBjB,IACb,EAGP,GAAIQ,EAAc1P,KAChBkP,EAAUa,cAAgBvB,GACxBU,EAAUa,cACVL,EAAcpmB,UAEX,CAELnX,GADiBu9B,EAAclQ,UACf/G,IACdyW,EAAUa,cAAgBvB,GACxBU,EAAUa,cACVhmB,GAAU2lB,EAAcpmB,KAAMmP,OAIpC,OAAO,EArBP,OAAO,EAyBX,SAASqX,GACPM,EACA9mB,GAEA,GAAI8mB,EAAYpQ,KACd,OAAOhV,GAAaolB,EAAY9mB,KAAMA,GAEtC,IAAK,MAAMmP,KAAa2X,EAAY5Q,SAClC,GACE4Q,EAAY5Q,SAASz5B,eAAe0yB,IACpCzN,GAAajB,GAAUqmB,EAAY9mB,KAAMmP,GAAYnP,GAErD,OAAO,EAGX,OAAO,EAwBX,SAAS2mB,GAAwBjyB,GAC/B,OAAOA,EAAM6N,QAOf,SAASmkB,GACPK,EACArF,EACAsF,GAEA,IAAIrC,EAAgBH,GAAcW,QAClC,IAAK,IAAI/sC,EAAI,EAAGA,EAAI2uC,EAAO1uC,SAAUD,EAAG,CACtC,MAAMsc,EAAQqyB,EAAO3uC,GAIrB,GAAIspC,EAAOhtB,GAAQ,CACjB,MAAMuyB,EAAYvyB,EAAMsL,KACxB,IAAIojB,EACJ,GAAI1uB,EAAMgiB,KACJhV,GAAaslB,EAAUC,IACzB7D,EAAeviB,GAAgBmmB,EAAUC,GACzCtC,EAAgBD,GACdC,EACAvB,EACA1uB,EAAMgiB,OAEChV,GAAaulB,EAAWD,KACjC5D,EAAeviB,GAAgBomB,EAAWD,GAC1CrC,EAAgBD,GACdC,EACA7kB,KACApL,EAAMgiB,KAAKtH,SAASgU,SAKnB,CAAA,IAAI1uB,EAAMwhB,SAgCf,MAAMp+B,EAAe,8CA/BrB,GAAI4pB,GAAaslB,EAAUC,GACzB7D,EAAeviB,GAAgBmmB,EAAUC,GACzCtC,EAAgBI,GACdJ,EACAvB,EACA1uB,EAAMwhB,eAEH,GAAIxU,GAAaulB,EAAWD,GAEjC,GADA5D,EAAeviB,GAAgBomB,EAAWD,GACtCpmB,GAAYwiB,GACduB,EAAgBI,GACdJ,EACA7kB,KACApL,EAAMwhB,cAEH,CACL,MAAM7B,EAAQ10B,EAAQ+U,EAAMwhB,SAAUnW,GAAaqjB,IACnD,GAAI/O,EAAO,CAET,MAAM6S,EAAW7S,EAAMjF,SAASlP,GAAakjB,IAC7CuB,EAAgBD,GACdC,EACA7kB,KACAonB,OAYd,OAAOvC,EAsBH,SAAUwC,GACdvB,EACAwB,EACAC,EACAC,EACAC,GAEA,GAAKD,GAAsBC,EAyBpB,CACL,MAAM1pB,EAAQ0nB,GACZK,EAAUa,cACVW,GAEF,IAAKG,GAAuB9B,GAAqB5nB,GAC/C,OAAOwpB,EAGP,GACGE,GACsB,MAAvBF,GACCjC,GAA8BvnB,EAAOiC,MAGjC,CACL,MAAM4hB,EAAS,SAAUhtB,GACvB,OACGA,EAAM6N,SAAWglB,MAChBD,KACEA,EAAkBl6B,QAAQsH,EAAMuxB,YACnCvkB,GAAahN,EAAMsL,KAAMonB,IACxB1lB,GAAa0lB,EAAU1yB,EAAMsL,QASnC,OAAO0lB,GANagB,GAClBd,EAAUM,UACVxE,EACA0F,GAEmBC,GAAuBnT,GAAalI,YAhBzD,OAAO,KAvCmC,CAC9C,MAAMwZ,EAAgBH,GACpBO,EAAUa,cACVW,GAEF,GAAqB,MAAjB5B,EACF,OAAOA,EACF,CACL,MAAMgC,EAAWjC,GACfK,EAAUa,cACVW,GAEF,GAAI3B,GAAqB+B,GACvB,OAAOH,EACF,GACkB,MAAvBA,GACCjC,GAA8BoC,EAAU1nB,MAIpC,CAEL,OAAO4lB,GAAmB8B,EADLH,GAAuBnT,GAAalI,YAFzD,OAAO,OAyST,SAAUyb,GACdC,EACAL,EACAC,EACAC,GAEA,OAAOJ,GACLO,EAAa9B,UACb8B,EAAaN,SACbC,EACAC,EACAC,GASY,SAAAI,GACdD,EACAE,GAEA,OAlRc,SACdhC,EACAwB,EACAQ,GAEA,IAAIC,EAAmB3T,GAAalI,WACpC,MAAM8b,EAAczC,GAClBO,EAAUa,cACVW,GAEF,GAAIU,EAUF,OATKA,EAAYtZ,cAEfsZ,EAAYjY,aAAae,IAAgB,CAACzB,EAAWoL,KACnDsN,EAAmBA,EAAiBrY,qBAClCL,EACAoL,MAICsN,EACF,GAAID,EAAwB,CAGjC,MAAM/pB,EAAQ0nB,GACZK,EAAUa,cACVW,GAsBF,OApBAQ,EAAuB/X,aACrBe,IACA,CAACzB,EAAWI,KACV,MAAMvF,EAAO0b,GACXH,GAAgC1nB,EAAO,IAAI2B,GAAK2P,IAChDI,GAEFsY,EAAmBA,EAAiBrY,qBAClCL,EACAnF,MAKNsb,GAAiCznB,GAAOwf,SAAQxL,IAC9CgW,EAAmBA,EAAiBrY,qBAClCqC,EAAU1vB,KACV0vB,EAAU7H,SAGP6d,EAcP,OANAvC,GAJcC,GACZK,EAAUa,cACVW,IAEsC/J,SAAQxL,IAC9CgW,EAAmBA,EAAiBrY,qBAClCqC,EAAU1vB,KACV0vB,EAAU7H,SAGP6d,EAoNFE,CACLL,EAAa9B,UACb8B,EAAaN,SACbQ,GAoBE,SAAUI,GACdN,EACA1nB,EACAioB,EACAC,GAEA,OA/NI,SACJtC,EACAwB,EACAlE,EACA+E,EACAC,GAEAvwC,EACEswC,GAAqBC,EACrB,6DAEF,MAAMloB,EAAOS,GAAU2mB,EAAUlE,GACjC,GAAIkC,GAA8BQ,EAAUa,cAAezmB,GAGzD,OAAO,KACF,CAEL,MAAMmoB,EAAa5C,GACjBK,EAAUa,cACVzmB,GAEF,OAAIylB,GAAqB0C,GAEhBD,EAAmB9Y,SAAS8T,GAQ5BwC,GACLyC,EACAD,EAAmB9Y,SAAS8T,KA6L3BkF,CACLV,EAAa9B,UACb8B,EAAaN,SACbpnB,EACAioB,EACAC,GAUY,SAAAG,GACdX,EACA1nB,GAEA,OApKc,SACd4lB,EACA5lB,GAEA,OAAOqlB,GAA6BO,EAAUa,cAAezmB,GAgKtDsoB,CACLZ,EAAa9B,UACbnlB,GAAUinB,EAAaN,SAAUpnB,IAQrB,SAAAuoB,GACdb,EACAc,EACAnT,EACAnJ,EACAtiB,EACAwb,GAEA,OA3Kc,SACdwgB,EACAwB,EACAoB,EACAnT,EACAnJ,EACAtiB,EACAwb,GAEA,IAAIqjB,EACJ,MAAM5qB,EAAQ0nB,GACZK,EAAUa,cACVW,GAEI5B,EAAgBH,GAA6BxnB,EAAOiC,MAC1D,GAAqB,MAAjB0lB,EACFiD,EAAYjD,MACP,CAAA,GAA0B,MAAtBgD,EAIT,MAAO,GAHPC,EAAY/C,GAAmB7nB,EAAO2qB,GAMxC,GADAC,EAAYA,EAAUhY,UAAUrL,GAC3BqjB,EAAU7oC,WAAc6oC,EAAUja,aAerC,MAAO,GAf4C,CACnD,MAAMka,EAAQ,GACRnnB,EAAM6D,EAAM8E,aACZmJ,EAAOzpB,EACR6+B,EAA2B1a,uBAAuBsH,EAAWjQ,GAC7DqjB,EAA2B3a,gBAAgBuH,EAAWjQ,GAC3D,IAAIoO,EAAOH,EAAK7H,UAChB,KAAOgI,GAAQkV,EAAMrwC,OAAS6zB,GACC,IAAzB3K,EAAIiS,EAAM6B,IACZqT,EAAMtuC,KAAKo5B,GAEbA,EAAOH,EAAK7H,UAEd,OAAOkd,GAsIFC,CACLjB,EAAa9B,UACb8B,EAAaN,SACboB,EACAnT,EACAnJ,EACAtiB,EACAwb,GAQY,SAAAwjB,GACdlB,EACApN,EACAuO,GAEA,OA5OI,SACJjD,EACAwB,EACA9M,EACA4N,GAEA,MAAMloB,EAAOS,GAAU2mB,EAAU9M,GAC3BkL,EAAgBH,GACpBO,EAAUa,cACVzmB,GAEF,GAAqB,MAAjBwlB,EACF,OAAOA,EAEP,GAAI0C,EAAmBlH,mBAAmB1G,GAKxC,OAAOoL,GAJYH,GACjBK,EAAUa,cACVzmB,GAIAkoB,EAAmBpK,UAAU5O,kBAAkBoL,IAGjD,OAAO,KAoNJwO,CACLpB,EAAa9B,UACb8B,EAAaN,SACb9M,EACAuO,GAOY,SAAAE,GACdrB,EACAvY,GAEA,OAAO4W,GACLtlB,GAAUinB,EAAaN,SAAUjY,GACjCuY,EAAa9B,WAID,SAAAG,GACd/lB,EACA4lB,GAEA,MAAO,CACLwB,SAAUpnB,EACV4lB,UAAAA,GCrxBS,MAAAoD,GAAb3sC,cACmBtD,KAAAkwC,UAAiC,IAAI/lB,IAEtDmV,iBAAiBsJ,GACf,MAAMt/B,EAAOs/B,EAAOt/B,KACdi4B,EAAWqH,EAAOxS,UACxBx3B,EACiC,gBAA/B0K,GACmC,kBAAjCA,GACiC,kBAAjCA,EACF,6CAEF1K,EACe,cAAb2iC,EACA,mDAEF,MAAM4O,EAAYnwC,KAAKkwC,UAAUjkC,IAAIs1B,GACrC,GAAI4O,EAAW,CACb,MAAMC,EAAUD,EAAU7mC,KAC1B,GACiC,gBAA/BA,GAEA,kBADA8mC,EAEApwC,KAAKkwC,UAAUrkC,IACb01B,EACAzC,GACEyC,EACAqH,EAAOjK,aACPwR,EAAUxR,oBAGT,GAC4B,kBAAjCr1B,GAEA,gBADA8mC,EAEApwC,KAAKkwC,UAAUhzB,OAAOqkB,QACjB,GAC4B,kBAAjCj4B,GAEA,kBADA8mC,EAEApwC,KAAKkwC,UAAUrkC,IACb01B,EACA1C,GAAmB0C,EAAU4O,EAAUpR,eAEpC,GAC4B,kBAAjCz1B,GAEA,gBADA8mC,EAEApwC,KAAKkwC,UAAUrkC,IACb01B,EACA3C,GAAiB2C,EAAUqH,EAAOjK,mBAE/B,CAAA,GAC4B,kBAAjCr1B,GAEA,kBADA8mC,EAOA,MAAMrxC,EACJ,mCACE6pC,EACA,mBACAuH,GATJnwC,KAAKkwC,UAAUrkC,IACb01B,EACAzC,GAAmByC,EAAUqH,EAAOjK,aAAcwR,EAAUpR,gBAWhE/+B,KAAKkwC,UAAUrkC,IAAI01B,EAAUqH,GAIjCyH,aACE,OAAO9vC,MAAM+vC,KAAKtwC,KAAKkwC,UAAUnf,WCnC9B,MAAMwf,GAA2B,IAhB3B,MACXC,iBAAiBjP,GACf,OAAO,KAETQ,mBACE1V,EACAiP,EACAzqB,GAEA,OAAO,OAaE,MAAA4/B,GACXntC,YACUotC,EACAC,EACAC,EAAuC,MAFvC5wC,KAAO0wC,QAAPA,EACA1wC,KAAU2wC,WAAVA,EACA3wC,KAAuB4wC,wBAAvBA,EAEVJ,iBAAiBjP,GACf,MAAMtQ,EAAOjxB,KAAK2wC,WAAWlI,WAC7B,GAAIxX,EAAKgX,mBAAmB1G,GAC1B,OAAOtQ,EAAK8T,UAAU5O,kBAAkBoL,GACnC,CACL,MAAMsP,EAC4B,MAAhC7wC,KAAK4wC,wBACD,IAAIlJ,GAAU1nC,KAAK4wC,yBAAyB,GAAM,GAClD5wC,KAAK2wC,WAAWpH,YACtB,OAAOsG,GAA8B7vC,KAAK0wC,QAASnP,EAAUsP,IAGjE9O,mBACE1V,EACAiP,EACAzqB,GAEA,MAAM4+B,EAC4B,MAAhCzvC,KAAK4wC,wBACD5wC,KAAK4wC,wBACL7G,GAA+B/pC,KAAK2wC,YACpChB,EAAQH,GACZxvC,KAAK0wC,QACLjB,EACAnU,EACA,EACAzqB,EACAwb,GAEF,OAAqB,IAAjBsjB,EAAMrwC,OACD,KAEAqwC,EAAM,ICpBb,SAAUmB,GACdC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAc,IAAInB,GACxB,IAAI3G,EAAc+H,EAClB,GAAIJ,EAAU3nC,OAASm9B,GAAcc,UAAW,CAC9C,MAAM+J,EAAYL,EACdK,EAAUluC,OAAOujC,SACnB2C,EAAeiI,GACbR,EACAC,EACAM,EAAUrqB,KACVqqB,EAAU3T,KACVuT,EACAC,EACAC,IAGFxyC,EAAO0yC,EAAUluC,OAAOwjC,WAAY,mBAIpCyK,EACEC,EAAUluC,OAAOyjC,QAChBmK,EAAazH,YAAYxB,eAAiBlgB,GAAYypB,EAAUrqB,MACnEqiB,EAAekI,GACbT,EACAC,EACAM,EAAUrqB,KACVqqB,EAAU3T,KACVuT,EACAC,EACAE,EACAD,SAGC,GAAIH,EAAU3nC,OAASm9B,GAAcgB,MAAO,CACjD,MAAM3iB,EAAQmsB,EACVnsB,EAAM1hB,OAAOujC,SACf2C,EAqYN,SACEyH,EACAtH,EACAxiB,EACAwqB,EACAP,EACA3H,EACA6H,GAQA,IAAIM,EAAejI,EA+BnB,OA9BAgI,EAAgBnG,SAAQ,CAACjB,EAAc7T,KACrC,MAAM0X,EAAYxmB,GAAUT,EAAMojB,GAC9BsH,GAA2BlI,EAAWziB,GAAaknB,MACrDwD,EAAeH,GACbR,EACAW,EACAxD,EACA1X,EACA0a,EACA3H,EACA6H,OAKNK,EAAgBnG,SAAQ,CAACjB,EAAc7T,KACrC,MAAM0X,EAAYxmB,GAAUT,EAAMojB,GAC7BsH,GAA2BlI,EAAWziB,GAAaknB,MACtDwD,EAAeH,GACbR,EACAW,EACAxD,EACA1X,EACA0a,EACA3H,EACA6H,OAKCM,EAnbYE,CACbb,EACAC,EACAlsB,EAAMmC,KACNnC,EAAMqY,SACN+T,EACAC,EACAC,IAGFxyC,EAAOkmB,EAAM1hB,OAAOwjC,WAAY,mBAEhCyK,EACEvsB,EAAM1hB,OAAOyjC,QAAUmK,EAAazH,YAAYxB,aAClDuB,EAAeuI,GACbd,EACAC,EACAlsB,EAAMmC,KACNnC,EAAMqY,SACN+T,EACAC,EACAE,EACAD,SAGC,GAAIH,EAAU3nC,OAASm9B,GAAcQ,eAAgB,CAC1D,MAAM6K,EAAeb,EAYnB3H,EAXGwI,EAAa9K,OAqmBtB,SACE+J,EACAtH,EACAxiB,EACAiqB,EACA5C,EACA8C,GAEA,IAAIzH,EACJ,GAAqD,MAAjD2F,GAA2B4B,EAAajqB,GAC1C,OAAOwiB,EACF,CACL,MAAMrmC,EAAS,IAAIqtC,GACjBS,EACAzH,EACA6E,GAEI5M,EAAgB+H,EAAUhB,WAAW1D,UAC3C,IAAI9C,EACJ,GAAIpa,GAAYZ,IAAgC,cAAvBD,GAAaC,GAAuB,CAC3D,IAAIsK,EACJ,GAAIkY,EAAUF,YAAYzB,qBACxBvW,EAAUmd,GACRwC,EACAnH,GAA+BN,QAE5B,CACL,MAAMsI,EAAiBtI,EAAUF,YAAYxE,UAC7CnmC,EACEmzC,aAA0B5W,GAC1B,iDAEF5J,EAAUqd,GACRsC,EACAa,GAGJxgB,EAAUA,EACV0Q,EAAgB8O,EAAcpI,OAAOpJ,eACnCmC,EACAnQ,EACA6f,OAEG,CACL,MAAM7P,EAAWva,GAAaC,GAC9B,IAAIiY,EAAW2Q,GACbqB,EACA3P,EACAkI,EAAUF,aAGE,MAAZrK,GACAuK,EAAUF,YAAYtB,mBAAmB1G,KAEzCrC,EAAWwC,EAAcvL,kBAAkBoL,IAG3CU,EADc,MAAZ/C,EACc6R,EAAcpI,OAAOhS,YACnC+K,EACAH,EACArC,EACA/X,GAAaF,GACb7jB,EACAguC,GAEO3H,EAAUhB,WAAW1D,UAAUzO,SAASiL,GAEjCwP,EAAcpI,OAAOhS,YACnC+K,EACAH,EACApG,GAAalI,WACb9L,GAAaF,GACb7jB,EACAguC,GAGc1P,EAGhBO,EAAcp7B,WACd4iC,EAAUF,YAAYzB,uBAGtB6B,EAAW+E,GACTwC,EACAnH,GAA+BN,IAE7BE,EAASlU,eACXwM,EAAgB8O,EAAcpI,OAAOpJ,eACnC0C,EACA0H,EACAyH,KAQR,OAHAzH,EACEF,EAAUF,YAAYzB,sBACqC,MAA3DwH,GAA2B4B,EAAanqB,MACnCyiB,GACLC,EACAxH,EACA0H,EACAoH,EAAcpI,OAAOlJ,iBAjsBNuS,CACbjB,EACAC,EACAc,EAAa7qB,KACbiqB,EACAC,EACAC,GA4eR,SACEL,EACAtH,EACAwI,EACAlL,EACAmK,EACAC,EACAC,GAEA,GAAwD,MAApD9B,GAA2B4B,EAAae,GAC1C,OAAOxI,EAIT,MAAM4H,EAAmB5H,EAAUF,YAAYxB,aAIzCwB,EAAcE,EAAUF,YAC9B,GAA0B,MAAtBxC,EAAa/jC,MAAe,CAE9B,GACG6kB,GAAYoqB,IAAY1I,EAAYzB,sBACrCyB,EAAYvB,kBAAkBiK,GAE9B,OAAOT,GACLT,EACAtH,EACAwI,EACA1I,EAAYxE,UAAU1O,SAAS4b,GAC/Bf,EACAC,EACAE,EACAD,GAEG,GAAIvpB,GAAYoqB,GAAU,CAG/B,IAAIR,EAAkB,IAAIxH,GAAoB,MAI9C,OAHAV,EAAYxE,UAAUjO,aAAa5E,IAAW,CAAC9oB,EAAM6nB,KACnDwgB,EAAkBA,EAAgB5lC,IAAI,IAAI4a,GAAKrd,GAAO6nB,MAEjD4gB,GACLd,EACAtH,EACAwI,EACAR,EACAP,EACAC,EACAE,EACAD,GAGF,OAAO3H,EAEJ,CAEL,IAAIgI,EAAkB,IAAIxH,GAAoB,MAU9C,OATAlD,EAAauE,SAAQ,CAAC4G,EAAWlvC,KAC/B,MAAMmvC,EAAkBzqB,GAAUuqB,EAASC,GACvC3I,EAAYvB,kBAAkBmK,KAChCV,EAAkBA,EAAgB5lC,IAChCqmC,EACA3I,EAAYxE,UAAU1O,SAAS8b,QAI9BN,GACLd,EACAtH,EACAwI,EACAR,EACAP,EACAC,EACAE,EACAD,IAvkBegB,CACbrB,EACAC,EACAc,EAAa7qB,KACb6qB,EAAa/K,aACbmK,EACAC,EACAC,OAYC,CAAA,GAAIH,EAAU3nC,OAASm9B,GAAcY,gBAS1C,MAAMtoC,EAAe,2BAA6BkyC,EAAU3nC,MAR5DggC,EAwjBJ,SACEyH,EACAtH,EACAxiB,EACAiqB,EACAE,GAEA,MAAMiB,EAAgB5I,EAAUF,YAC1BD,EAAeM,GACnBH,EACA4I,EAActN,UACdsN,EAAcvK,sBAAwBjgB,GAAYZ,GAClDorB,EAActK,cAEhB,OAAOuK,GACLvB,EACAzH,EACAriB,EACAiqB,EACAX,GACAa,GA5kBemB,CACbxB,EACAC,EACAC,EAAUhqB,KACViqB,EACAE,GAKJ,MAAM7I,EAAU6I,EAAYf,aAE5B,OAGF,SACEW,EACA1H,EACA8H,GAEA,MAAM1H,EAAYJ,EAAab,WAC/B,GAAIiB,EAAU5B,qBAAsB,CAClC,MAAM0K,EACJ9I,EAAU3E,UAAUtP,cAAgBiU,EAAU3E,UAAUl+B,UACpD4rC,EAAkB3I,GAA8BkH,IAEpDI,EAAY9xC,OAAS,IACpB0xC,EAAavI,WAAWX,sBACxB0K,IAAkB9I,EAAU3E,UAAUnN,OAAO6a,KAC7C/I,EAAU3E,UAAUrP,cAAckC,OAAO6a,EAAgB/c,iBAE1D0b,EAAY/vC,KACVq9B,GAAYoL,GAA8BR,MArBhDoJ,CAAgC1B,EAAc1H,EAAcf,GACrD,CAAEkB,UAAWH,EAAcf,QAAAA,GA0BpC,SAAS+J,GACPvB,EACAtH,EACAkJ,EACAzB,EACA9tC,EACAguC,GAEA,MAAMwB,EAAenJ,EAAUhB,WAC/B,GAA2D,MAAvD6G,GAA2B4B,EAAayB,GAE1C,OAAOlJ,EACF,CACL,IAAIxH,EAAe4O,EACnB,GAAIhpB,GAAY8qB,GAMd,GAJA/zC,EACE6qC,EAAUF,YAAYzB,qBACtB,8DAEE2B,EAAUF,YAAYxB,aAAc,CAItC,MAAMwB,EAAcQ,GAA+BN,GAK7CoJ,EAAwBjE,GAC5BsC,EAJA3H,aAAuBpO,GACnBoO,EACApO,GAAalI,YAKnBgP,EAAgB8O,EAAcpI,OAAOpJ,eACnCkK,EAAUhB,WAAW1D,UACrB8N,EACAzB,OAEG,CACL,MAAM0B,EAAepE,GACnBwC,EACAnH,GAA+BN,IAEjCxH,EAAgB8O,EAAcpI,OAAOpJ,eACnCkK,EAAUhB,WAAW1D,UACrB+N,EACA1B,OAGC,CACL,MAAM7P,EAAWva,GAAa2rB,GAC9B,GAAiB,cAAbpR,EAA0B,CAC5B3iC,EACgC,IAA9BsoB,GAAcyrB,GACd,yDAEF,MAAMI,EAAeH,EAAa7N,UAClC8L,EAAapH,EAAUF,YAAYxE,UAEnC,MAAMiO,EAAkB/D,GACtBiC,EACAyB,EACAI,EACAlC,GAGA5O,EADqB,MAAnB+Q,EACcjC,EAAcpI,OAAO1S,eACnC8c,EACAC,GAIcJ,EAAa7N,cAE1B,CACL,MAAMkO,EAAkB9rB,GAAawrB,GAErC,IAAIO,EACJ,GAAIN,EAAa3K,mBAAmB1G,GAAW,CAC7CsP,EAAapH,EAAUF,YAAYxE,UACnC,MAAMoO,EACJlE,GACEiC,EACAyB,EACAC,EAAa7N,UACb8L,GAGFqC,EADsB,MAApBC,EACcP,EACb7N,UACA5O,kBAAkBoL,GAClB5K,YAAYsc,EAAiBE,GAGhBP,EAAa7N,UAAU5O,kBAAkBoL,QAG3D2R,EAAgBrD,GACdqB,EACA3P,EACAkI,EAAUF,aAIZtH,EADmB,MAAjBiR,EACcnC,EAAcpI,OAAOhS,YACnCic,EAAa7N,UACbxD,EACA2R,EACAD,EACA7vC,EACAguC,GAIcwB,EAAa7N,WAInC,OAAOyE,GACLC,EACAxH,EACA2Q,EAAa9K,sBAAwBjgB,GAAY8qB,GACjD5B,EAAcpI,OAAOlJ,iBAK3B,SAAS+R,GACPT,EACAC,EACA2B,EACAS,EACAlC,EACAC,EACAE,EACAD,GAEA,MAAMiC,EAAgBrC,EAAazH,YACnC,IAAI+J,EACJ,MAAMC,EAAelC,EACjBN,EAAcpI,OACdoI,EAAcpI,OAAOjJ,mBACzB,GAAI7X,GAAY8qB,GACdW,EAAiBC,EAAahU,eAC5B8T,EAActO,UACdqO,EACA,WAEG,GAAIG,EAAa9T,iBAAmB4T,EAActL,aAAc,CAErE,MAAMyL,EAAgBH,EACnBtO,UACApO,YAAYgc,EAAYS,GAC3BE,EAAiBC,EAAahU,eAC5B8T,EAActO,UACdyO,EACA,UAEG,CACL,MAAMjS,EAAWva,GAAa2rB,GAC9B,IACGU,EAAcrL,kBAAkB2K,IACjCzrB,GAAcyrB,GAAc,EAG5B,OAAO3B,EAET,MAAMiC,EAAkB9rB,GAAawrB,GAE/Bjc,EADY2c,EAActO,UAAU5O,kBAAkBoL,GAC7B5K,YAAYsc,EAAiBG,GAE1DE,EADe,cAAb/R,EACegS,EAAatd,eAC5Bod,EAActO,UACdrO,GAGe6c,EAAa5c,YAC5B0c,EAActO,UACdxD,EACA7K,EACAuc,EACA1C,GACA,MAIN,MAAMjH,EAAeM,GACnBoH,EACAsC,EACAD,EAAcvL,sBAAwBjgB,GAAY8qB,GAClDY,EAAa9T,gBAOf,OAAO6S,GACLvB,EACAzH,EACAqJ,EACAzB,EATa,IAAIT,GACjBS,EACA5H,EACA6H,GAQAC,GAIJ,SAASG,GACPR,EACAC,EACA2B,EACAS,EACAlC,EACAC,EACAC,GAEA,MAAMwB,EAAe5B,EAAavI,WAClC,IAAIa,EAAcrH,EAClB,MAAM7+B,EAAS,IAAIqtC,GACjBS,EACAF,EACAG,GAEF,GAAItpB,GAAY8qB,GACd1Q,EAAgB8O,EAAcpI,OAAOpJ,eACnCyR,EAAavI,WAAW1D,UACxBqO,EACAhC,GAEF9H,EAAeE,GACbwH,EACA/O,GACA,EACA8O,EAAcpI,OAAOlJ,oBAElB,CACL,MAAM8B,EAAWva,GAAa2rB,GAC9B,GAAiB,cAAbpR,EACFU,EAAgB8O,EAAcpI,OAAO1S,eACnC+a,EAAavI,WAAW1D,UACxBqO,GAEF9J,EAAeE,GACbwH,EACA/O,EACA2Q,EAAa9K,qBACb8K,EAAa7K,kBAEV,CACL,MAAMkL,EAAkB9rB,GAAawrB,GAC/BtT,EAAWuT,EAAa7N,UAAU5O,kBAAkBoL,GAC1D,IAAIrC,EACJ,GAAIrX,GAAYorB,GAEd/T,EAAWkU,MACN,CACL,MAAM5c,EAAYpzB,EAAOotC,iBAAiBjP,GAQtCrC,EAPa,MAAb1I,EAEiC,cAAjCpP,GAAY6rB,IACZzc,EAAUH,SAAS7O,GAAWyrB,IAAkBpsC,UAIrC2vB,EAEAA,EAAUG,YAAYsc,EAAiBG,GAIzCjY,GAAalI,WAG5B,GAAKoM,EAASzH,OAAOsH,GAgBnBoK,EAAe0H,MAhBe,CAS9B1H,EAAeE,GACbwH,EATmBD,EAAcpI,OAAOhS,YACxCic,EAAa7N,UACbxD,EACArC,EACA+T,EACA7vC,EACAguC,GAKAwB,EAAa9K,qBACbiJ,EAAcpI,OAAOlJ,kBAO7B,OAAO6J,EAGT,SAASqI,GACPlI,EACAlI,GAEA,OAAOkI,EAAUhB,WAAWR,mBAAmB1G,GAoDjD,SAASkS,GACP1C,EACA9f,EACAnM,GAKA,OAHAA,EAAMwmB,SAAQ,CAACjB,EAAc7T,KAC3BvF,EAAOA,EAAK0F,YAAY0T,EAAc7T,MAEjCvF,EAGT,SAAS4gB,GACPd,EACAtH,EACAxiB,EACAwqB,EACAP,EACA3H,EACA8H,EACAD,GAIA,GACE3H,EAAUF,YAAYxE,UAAUl+B,YAC/B4iC,EAAUF,YAAYzB,qBAEvB,OAAO2B,EAST,IACIiK,EADAhC,EAAejI,EAGjBiK,EADE7rB,GAAYZ,GACEwqB,EAEA,IAAIxH,GAAoB,MAAMS,QAC5CzjB,EACAwqB,GAGJ,MAAMZ,EAAapH,EAAUF,YAAYxE,UAiDzC,OAhDA2O,EAAcvW,SAAS/J,kBAAiB,CAACmO,EAAUnI,KACjD,GAAIyX,EAAWva,SAASiL,GAAW,CACjC,MAGMrC,EAAWuU,GACf1C,EAJkBtH,EAAUF,YAC3BxE,UACA5O,kBAAkBoL,GAInBnI,GAEFsY,EAAeF,GACbT,EACAW,EACA,IAAIjrB,GAAK8a,GACTrC,EACAgS,EACA3H,EACA8H,EACAD,OAINsC,EAAcvW,SAAS/J,kBAAiB,CAACmO,EAAUoS,KACjD,MAAMC,GACHnK,EAAUF,YAAYtB,mBAAmB1G,IACjB,OAAzBoS,EAAe3wC,MACjB,IAAK6tC,EAAWva,SAASiL,KAAcqS,EAAoB,CACzD,MAGM1U,EAAWuU,GACf1C,EAJkBtH,EAAUF,YAC3BxE,UACA5O,kBAAkBoL,GAInBoS,GAEFjC,EAAeF,GACbT,EACAW,EACA,IAAIjrB,GAAK8a,GACTrC,EACAgS,EACA3H,EACA8H,EACAD,OAKCM,EChmBI,MAAAmC,GAMXvwC,YAAoB6kC,EAAsB2L,GAAtB9zC,KAAMmoC,OAANA,EAHpBnoC,KAAmB+zC,oBAAwB,GAIzC,MAAMh/B,EAAS/U,KAAKmoC,OAAOtb,aAErBmnB,EAAc,IAAIhV,GAAcjqB,EAAO0Y,YACvCkb,GrB0I+BvF,EqB1IGruB,GrB2I1BgY,eACP,IAAIiS,GAAcoE,EAAY3V,YAC5B2V,EAAYH,WACd,IAAIpC,GAAcuC,GAElB,IAAIzD,GAAayD,GANtB,IAAmCA,EqBxIrCpjC,KAAKi0C,WDEH,SAA2BtL,GAC/B,MAAO,CAAEA,OAAAA,GCHWuL,CAAiBvL,GAEnC,MAAMwL,EAAqBL,EAAiBvK,YACtC6K,EAAoBN,EAAiBrL,WAGrCoB,EAAamK,EAAYzU,eAC7BpE,GAAalI,WACbkhB,EAAmBpP,UACnB,MAEI2E,EAAYf,EAAOpJ,eACvBpE,GAAalI,WACbmhB,EAAkBrP,UAClB,MAEIuO,EAAiB,IAAI5L,GACzBmC,EACAsK,EAAmBrM,qBACnBkM,EAAYvU,gBAERwC,EAAgB,IAAIyF,GACxBgC,EACA0K,EAAkBtM,qBAClBa,EAAOlJ,gBAGTz/B,KAAK2wC,WAAarH,GAAarH,EAAeqR,GAC9CtzC,KAAKq0C,gBAAkB,IAAInM,GAAeloC,KAAKmoC,QAG7CvzB,YACF,OAAO5U,KAAKmoC,QAYA,SAAAmM,GACdC,EACAttB,GAEA,MAAMutB,EAAQzK,GAA+BwK,EAAK5D,YAClD,OAAI6D,IAIAD,EAAK3/B,MAAMiY,aAAaE,iBACtBlF,GAAYZ,KACXutB,EAAMre,kBAAkBnP,GAAaC,IAAOpgB,WAExC2tC,EAAMne,SAASpP,GAGnB,KAGH,SAAUwtB,GAAYF,GAC1B,OAA2C,IAApCA,EAAKR,oBAAoBz0C,OAelB,SAAAo1C,GACdH,EACAI,EACAC,GAEA,MAAMC,EAA8B,GACpC,GAAID,EAAa,CACfh2C,EACuB,MAArB+1C,EACA,mDAEF,MAAM1tB,EAAOstB,EAAK3/B,MAAMsX,MACxBqoB,EAAKR,oBAAoBzP,SAAQ6E,IAC/B,MAAM2L,EAAa3L,EAAa4L,kBAAkBH,EAAa3tB,GAC3D6tB,GACFD,EAAaxzC,KAAKyzC,MAKxB,GAAIH,EAAmB,CACrB,IAAIK,EAAY,GAChB,IAAK,IAAI31C,EAAI,EAAGA,EAAIk1C,EAAKR,oBAAoBz0C,SAAUD,EAAG,CACxD,MAAM41C,EAAWV,EAAKR,oBAAoB10C,GAC1C,GAAK41C,EAAS9U,QAAQwU,IAEf,GAAIA,EAAkBO,iBAAkB,CAE7CF,EAAYA,EAAUG,OAAOZ,EAAKR,oBAAoBxsB,MAAMloB,EAAI,IAChE,YAJA21C,EAAU3zC,KAAK4zC,GAOnBV,EAAKR,oBAAsBiB,OAE3BT,EAAKR,oBAAsB,GAE7B,OAAOc,EAMH,SAAUO,GACdb,EACAtD,EACAC,EACA5C,GAGE2C,EAAU3nC,OAASm9B,GAAcgB,OACJ,OAA7BwJ,EAAU7tC,OAAOspB,UAEjB9tB,EACEmrC,GAA+BwK,EAAK5D,YACpC,6DAEF/xC,EACEkrC,GAA8ByK,EAAK5D,YACnC,4DAIJ,MAAMK,EAAeuD,EAAK5D,WACpB7hB,EAASgiB,GACbyD,EAAKN,WACLjD,EACAC,EACAC,EACA5C,GD7IY,IACdyC,EACAtH,ECuJA,ODxJAsH,EC8I2BwD,EAAKN,WD7IhCxK,EC6I4C3a,EAAO2a,UD3InD7qC,EACE6qC,EAAUhB,WAAW1D,UAAUpN,UAAUoZ,EAAcpI,OAAOlb,YAC9D,0BAEF7uB,EACE6qC,EAAUF,YAAYxE,UAAUpN,UAAUoZ,EAAcpI,OAAOlb,YAC/D,2BCuIF7uB,EACEkwB,EAAO2a,UAAUF,YAAYzB,uBAC1BkJ,EAAazH,YAAYzB,qBAC5B,2DAGFyM,EAAK5D,WAAa7hB,EAAO2a,UAElB4L,GACLd,EACAzlB,EAAOyZ,QACPzZ,EAAO2a,UAAUhB,WAAW1D,UAC5B,MA2BJ,SAASsQ,GACPd,EACAhM,EACAE,EACAkM,GAEA,MAAMnM,EAAgBmM,EAClB,CAACA,GACDJ,EAAKR,oBACT,OR5NI,SACJ1L,EACAE,EACAE,EACA6M,GAEA,MAAMhN,EAAkB,GAClBiN,EAAkB,GAuDxB,OArDAhN,EAAQjE,SAAQsE,IjBkBF,IACdxS,EiBjB4C,kBAAxCwS,EAAOt/B,MACP++B,EAAepJ,OAAO5N,oBACpBuX,EAAO7J,QACP6J,EAAOjK,eAGT4W,EAAMl0C,MjBWV+0B,EiBXgCwS,EAAOxS,UjBchC,CAAE9sB,KAA4B,cAAEq1B,aiBdWiK,EAAOjK,ajBcJvI,UAAAA,QiBVrDgS,GACEC,EACAC,EAAM,gBAENC,EACA+M,EACA7M,GAEFL,GACEC,EACAC,EAAM,cAENC,EACA+M,EACA7M,GAEFL,GACEC,EACAC,EAAM,cAENiN,EACAD,EACA7M,GAEFL,GACEC,EACAC,EAAM,gBAENC,EACA+M,EACA7M,GAEFL,GACEC,EACAC,EAAM,QAENC,EACA+M,EACA7M,GAGKH,EQ8JAkN,CACLjB,EAAKF,gBACL9L,EACAE,EACAD,GCrOJ,IAAIiN,GC6BAA,GDjBS,MAAAC,GAAbpyC,cAOWtD,KAAA21C,MAA2B,IAAIxrB,KAsBpC,SAAUyrB,GACdC,EACA5E,EACAC,EACA4E,GAEA,MAAMppB,EAAUukB,EAAU7tC,OAAOspB,QACjC,GAAgB,OAAZA,EAAkB,CACpB,MAAM6nB,EAAOsB,EAAUF,MAAM1pC,IAAIygB,GAEjC,OADA9tB,EAAe,MAAR21C,EAAc,gDACda,GACLb,EACAtD,EACAC,EACA4E,GAEG,CACL,IAAIxN,EAAkB,GAEtB,IAAK,MAAMiM,KAAQsB,EAAUF,MAAM5kB,SACjCuX,EAASA,EAAO6M,OACdC,GAAmBb,EAAMtD,EAAWC,EAAa4E,IAIrD,OAAOxN,GAaL,SAAUyN,GACdF,EACAjhC,EACAs8B,EACA3H,EACAyM,GAEA,MAAMtpB,EAAU9X,EAAM+X,iBAChB4nB,EAAOsB,EAAUF,MAAM1pC,IAAIygB,GACjC,IAAK6nB,EAAM,CAET,IAAI9L,EAAaiG,GACfwC,EACA8E,EAAsBzM,EAAc,MAElC0M,GAAqB,EACrBxN,EACFwN,GAAqB,EACZ1M,aAAuBpO,IAChCsN,EAAamG,GACXsC,EACA3H,GAEF0M,GAAqB,IAErBxN,EAAatN,GAAalI,WAC1BgjB,GAAqB,GAEvB,MAAMxM,EAAYH,GAChB,IAAI5B,GAAUe,EAAYwN,GAAoB,GAC9C,IAAIvO,GAAU6B,EAAayM,GAAqB,IAElD,OAAO,IAAInC,GAAKj/B,EAAO60B,GAEzB,OAAO8K,EAaO,SAAA2B,GACdL,EACAjhC,EACA+/B,EACAzD,EACA3H,EACAyM,GAEA,MAAMzB,EAAOwB,GACXF,EACAjhC,EACAs8B,EACA3H,EACAyM,GAOF,OALKH,EAAUF,MAAM/oB,IAAIhY,EAAM+X,mBAC7BkpB,EAAUF,MAAM9pC,IAAI+I,EAAM+X,iBAAkB4nB,GDjDhC,SACdA,EACAI,GAEAJ,EAAKR,oBAAoB1yC,KAAKszC,GCgD9BwB,CAAyB5B,EAAMI,GDgDjB,SACdJ,EACApL,GAEA,MAAMO,EAAY6K,EAAK5D,WAAWlI,WAC5B2N,EAA2B,GAC5B1M,EAAU3E,UAAUtP,cACLiU,EAAU3E,UAClBjO,aAAae,IAAgB,CAACpxB,EAAK+vB,KAC3C4f,EAAe/0C,KAAKu9B,GAAiBn4B,EAAK+vB,OAM9C,OAHIkT,EAAU5B,sBACZsO,EAAe/0C,KAAKq9B,GAAYgL,EAAU3E,YAErCsQ,GACLd,EACA6B,EACA1M,EAAU3E,UACVoE,GClEKkN,CAAqB9B,EAAMI,GAa9B,SAAU2B,GACdT,EACAjhC,EACA+/B,EACAC,GAEA,MAAMloB,EAAU9X,EAAM+X,iBAChB4pB,EAA0B,GAChC,IAAI1B,EAAwB,GAC5B,MAAM2B,EAAkBC,GAAyBZ,GACjD,GAAgB,YAAZnpB,EAEF,IAAK,MAAOgqB,EAAanC,KAASsB,EAAUF,MAAMtR,UAChDwQ,EAAeA,EAAaM,OAC1BT,GAA4BH,EAAMI,EAAmBC,IAEnDH,GAAYF,KACdsB,EAAUF,MAAMz4B,OAAOw5B,GAGlBnC,EAAK3/B,MAAMiY,aAAaE,gBAC3BwpB,EAAQl1C,KAAKkzC,EAAK3/B,YAInB,CAEL,MAAM2/B,EAAOsB,EAAUF,MAAM1pC,IAAIygB,GAC7B6nB,IACFM,EAAeA,EAAaM,OAC1BT,GAA4BH,EAAMI,EAAmBC,IAEnDH,GAAYF,KACdsB,EAAUF,MAAMz4B,OAAOwP,GAGlB6nB,EAAK3/B,MAAMiY,aAAaE,gBAC3BwpB,EAAQl1C,KAAKkzC,EAAK3/B,SAa1B,OAPI4hC,IAAoBC,GAAyBZ,IAE/CU,EAAQl1C,KACN,IA5KJzC,EAAO62C,GAAsB,oCACtBA,IA2KsC7gC,EAAM+hC,MAAO/hC,EAAMsX,QAIzD,CAAEqqB,QAAAA,EAASjO,OAAQuM,GAGtB,SAAU+B,GAAuBf,GACrC,MAAM/mB,EAAS,GACf,IAAK,MAAMylB,KAAQsB,EAAUF,MAAM5kB,SAC5BwjB,EAAK3/B,MAAMiY,aAAaE,gBAC3B+B,EAAOztB,KAAKkzC,GAGhB,OAAOzlB,EAOO,SAAA+nB,GACdhB,EACA5uB,GAEA,IAAIsiB,EAA2B,KAC/B,IAAK,MAAMgL,KAAQsB,EAAUF,MAAM5kB,SACjCwY,EAAcA,GAAe+K,GAA2BC,EAAMttB,GAEhE,OAAOsiB,EAGO,SAAAuN,GACdjB,EACAjhC,GAGA,GADeA,EAAMiY,aACVE,eACT,OAAOgqB,GAAyBlB,GAC3B,CACL,MAAMnpB,EAAU9X,EAAM+X,iBACtB,OAAOkpB,EAAUF,MAAM1pC,IAAIygB,IAIf,SAAAsqB,GACdnB,EACAjhC,GAEA,OAAkD,MAA3CkiC,GAAsBjB,EAAWjhC,GAGpC,SAAU6hC,GAAyBZ,GACvC,OAA8C,MAAvCkB,GAAyBlB,GAG5B,SAAUkB,GAAyBlB,GACvC,IAAK,MAAMtB,KAAQsB,EAAUF,MAAM5kB,SACjC,GAAIwjB,EAAK3/B,MAAMiY,aAAaE,eAC1B,OAAOwnB,EAGX,OAAO,KC/MT,IAAI0C,GAAwB,EAuBf,MAAAC,GAkBX5zC,YAAmB6zC,GAAAn3C,KAAem3C,gBAAfA,EAdnBn3C,KAAAo3C,eAA2C,IAAInN,GAAyB,MAKxEjqC,KAAiBq3C,kBN0fV,CACL3J,cAAejC,GAAcW,QAC7Be,UAAW,GACXU,aAAc,GM3fP7tC,KAAAs3C,cAAqC,IAAIntB,IACzCnqB,KAAAu3C,cAAqC,IAAIptB,KAc9C,SAAUqtB,GACdC,EACAxwB,EACAywB,EACAxK,EACA1jB,GAWA,ON7FI,SACJqjB,EACA5lB,EACA0W,EACAuP,EACA1jB,GAEA5qB,EACEsuC,EAAUL,EAAUgB,YACpB,qDAEc3qC,IAAZsmB,IACFA,GAAU,GAEZqjB,EAAUM,UAAU9rC,KAAK,CACvB4lB,KAAAA,EACA0W,KAAAA,EACAuP,QAAAA,EACA1jB,QAAAA,IAGEA,IACFqjB,EAAUa,cAAgB/B,GACxBkB,EAAUa,cACVzmB,EACA0W,IAGJkP,EAAUgB,YAAcX,EMyDxByK,CACEF,EAASJ,kBACTpwB,EACAywB,EACAxK,EACA1jB,GAGGA,EAGIouB,GACLH,EACA,IAAInQ,GhB3HD,CACLX,UAAU,EACVC,YAAY,EACZla,QAAS,KACTma,QAAQ,GgBuHkC5f,EAAMywB,IAJzC,GAcL,SAAUG,GACdJ,EACAxwB,EACAwqB,EACAvE,IN9EI,SACJL,EACA5lB,EACAwqB,EACAvE,GAEAtuC,EACEsuC,EAAUL,EAAUgB,YACpB,gDAEFhB,EAAUM,UAAU9rC,KAAK,CACvB4lB,KAAAA,EACAkW,SAAUsU,EACVvE,QAAAA,EACA1jB,SAAS,IAGXqjB,EAAUa,cAAgB1B,GACxBa,EAAUa,cACVzmB,EACAwqB,GAEF5E,EAAUgB,YAAcX,EM2DxB4K,CAAkBL,EAASJ,kBAAmBpwB,EAAMwqB,EAAiBvE,GAErE,MAAM6K,EAAa9N,GAAc+N,WAAWvG,GAE5C,OAAOmG,GACLH,EACA,IAAIjQ,GhBlJC,CACLb,UAAU,EACVC,YAAY,EACZla,QAAS,KACTma,QAAQ,GgB8I4B5f,EAAM8wB,IAUxC,SAAUE,GACdR,EACAvK,EACAlG,GAAkB,GAElB,MAAMrrB,EN7EQ,SACdkxB,EACAK,GAEA,IAAK,IAAI7tC,EAAI,EAAGA,EAAIwtC,EAAUM,UAAU7tC,OAAQD,IAAK,CACnD,MAAM64C,EAASrL,EAAUM,UAAU9tC,GACnC,GAAI64C,EAAOhL,UAAYA,EACrB,OAAOgL,EAGX,OAAO,KMmEOC,CAAkBV,EAASJ,kBAAmBnK,GAK5D,GAJyBD,GACvBwK,EAASJ,kBACTnK,GAIK,CACL,IAAInG,EAAe,IAAIkD,GAAuB,MAS9C,OARkB,MAAdtuB,EAAMgiB,KAERoJ,EAAeA,EAAal7B,IAAIkb,MAAgB,GAEhDjX,GAAK6L,EAAMwhB,UAAWxY,IACpBoiB,EAAeA,EAAal7B,IAAI,IAAI4a,GAAK9B,IAAa,MAGnDizB,GACLH,EACA,IAAI3Q,GAAanrB,EAAMsL,KAAM8f,EAAcC,IAb7C,MAAO,GAuBK,SAAAoR,GACdX,EACAxwB,EACAywB,GAEA,OAAOE,GACLH,EACA,IAAInQ,GhB5LC,CACLX,UAAU,EACVC,YAAY,EACZla,QAAS,KACTma,QAAQ,GgBwLkC5f,EAAMywB,IA4EpC,SAAAW,GACdZ,EACA7iC,EACA+/B,EACAC,EACA0D,GAAoB,GAGpB,MAAMrxB,EAAOrS,EAAMsX,MACbqsB,EAAiBd,EAASL,eAAenrC,IAAIgb,GACnD,IAAI4tB,EAAwB,GAI5B,GACE0D,IAC4B,YAA3B3jC,EAAM+X,kBACLqqB,GAA4BuB,EAAgB3jC,IAC9C,CACA,MAAM4jC,EAAmBlC,GACvBiC,EACA3jC,EACA+/B,EACAC,GDzQ4B,IC2QT2D,ED3QN5C,MAAMv5B,OC4QnBq7B,EAASL,eAAiBK,EAASL,eAAehrC,OAAO6a,IAG3D,MAAMsvB,EAAUiC,EAAiBjC,QAGjC,GAFA1B,EAAe2D,EAAiBlQ,QAE3BgQ,EAAmB,CAStB,MAAMG,GACH,IACDlC,EAAQnJ,WAAUx4B,GACTA,EAAMiY,aAAaE,iBAExB2rB,EAAUjB,EAASL,eAAepM,WACtC/jB,GACA,CAACojB,EAAcsO,IACblC,GAAyBkC,KAG7B,GAAIF,IAAoBC,EAAS,CAC/B,MAAMvR,EAAUsQ,EAASL,eAAejQ,QAAQlgB,GAGhD,IAAKkgB,EAAQtgC,UAAW,CAEtB,MAAM+xC,EAgfhB,SACEzR,GAEA,OAAOA,EAAQyD,MAAa,CAACP,EAAcwO,EAAqBC,KAC9D,GAAID,GAAuBpC,GAAyBoC,GAAsB,CAExE,MAAO,CADc9B,GAAyB8B,IAEzC,CAEL,IAAIlD,EAAgB,GAOpB,OANIkD,IACFlD,EAAQiB,GAAuBiC,IAEjC/oC,GAAKgpC,GAAU,CAACC,EAAcC,KAC5BrD,EAAQA,EAAMR,OAAO6D,MAEhBrD,MAhgBcsD,CAAwC9R,GAGzD,IAAK,IAAI9nC,EAAI,EAAGA,EAAIu5C,EAASt5C,SAAUD,EAAG,CACxC,MAAMk1C,EAAOqE,EAASv5C,GACpB65C,EAAW3E,EAAK3/B,MACZpC,EAAW2mC,GAA+B1B,EAAUlD,GAC1DkD,EAASN,gBAAgBiC,eACvBC,GAA2BH,GAC3BI,GAAoB7B,EAAUyB,GAC9B1mC,EAASya,OACTza,EAASoS,cASjB,IAAK8zB,GAAWnC,EAAQj3C,OAAS,IAAMs1C,EAGrC,GAAI6D,EAAiB,CAEnB,MAAMc,EAA4B,KAClC9B,EAASN,gBAAgBqC,cACvBH,GAA2BzkC,GAC3B2kC,QAGFhD,EAAQjS,SAASmV,IACf,MAAMC,EAAcjC,EAASF,cAActrC,IACzC0tC,GAAsBF,IAExBhC,EAASN,gBAAgBqC,cACvBH,GAA2BI,GAC3BC,OAgfd,SAA6BjC,EAAoB3mB,GAC/C,IAAK,IAAInoB,EAAI,EAAGA,EAAImoB,EAAQxxB,SAAUqJ,EAAG,CACvC,MAAMixC,EAAe9oB,EAAQnoB,GAC7B,IAAKixC,EAAa/sB,aAAaE,eAAgB,CAE7C,MAAM8sB,EAAkBF,GAAsBC,GACxCE,EAAkBrC,EAASF,cAActrC,IAAI4tC,GACnDpC,EAASF,cAAcr6B,OAAO28B,GAC9BpC,EAASH,cAAcp6B,OAAO48B,KAjfhCC,CAAoBtC,EAAUlB,GAIhC,OAAO1B,EAQH,SAAUmF,GACdvC,EACAxwB,EACA0W,EACAlR,GAEA,MAAMwtB,EAAWC,GAAwBzC,EAAUhrB,GACnD,GAAgB,MAAZwtB,EAAkB,CACpB,MAAMpuB,EAAIsuB,GAAuBF,GAC3BG,EAAYvuB,EAAE5E,KAClByF,EAAUb,EAAEa,QACR2d,EAAeviB,GAAgBsyB,EAAWnzB,GAMhD,OAAOozB,GAA8B5C,EAAU2C,EALpC,IAAI9S,GACbZ,GAAoCha,GACpC2d,EACA1M,IAKF,MAAO,GAuCL,SAAU2c,GACd7C,EACA7iC,EACA+/B,EACA4F,GAAoB,GAEpB,MAAMtzB,EAAOrS,EAAMsX,MAEnB,IAAIqd,EAA2B,KAC3BiR,GAA2B,EAG/B/C,EAASL,eAAejM,cAAclkB,GAAM,CAACwzB,EAAiBC,KAC5D,MAAMrQ,EAAeviB,GAAgB2yB,EAAiBxzB,GACtDsiB,EACEA,GAAesN,GAAgC6D,EAAIrQ,GACrDmQ,EACEA,GAA4B/D,GAAyBiE,MAEzD,IAWI1E,EAXAH,EAAY4B,EAASL,eAAenrC,IAAIgb,GAY5C,GAXK4uB,GAIH2E,EACEA,GAA4B/D,GAAyBZ,GACvDtM,EACEA,GAAesN,GAAgChB,EAAW9uB,QAN5D8uB,EAAY,IAAIH,GAChB+B,EAASL,eAAiBK,EAASL,eAAevrC,IAAIob,EAAM4uB,IAS3C,MAAftM,EACFyM,GAAsB,MACjB,CACLA,GAAsB,EACtBzM,EAAcpO,GAAalI,WACXwkB,EAASL,eAAejQ,QAAQlgB,GACxCukB,cAAa,CAACpV,EAAWukB,KAC/B,MAAMxJ,EAAgB0F,GACpB8D,EACA5zB,MAEEoqB,IACF5H,EAAcA,EAAY9S,qBACxBL,EACA+a,OAMR,MAAMyJ,EAAoB5D,GAA4BnB,EAAWjhC,GACjE,IAAKgmC,IAAsBhmC,EAAMiY,aAAaE,eAAgB,CAE5D,MAAMktB,EAAWN,GAAsB/kC,GACvChW,GACG64C,EAASF,cAAc3qB,IAAIqtB,GAC5B,0CAEF,MAAMxtB,EAwXDwqB,KAvXLQ,EAASF,cAAc1rC,IAAIouC,EAAUxtB,GACrCgrB,EAASH,cAAczrC,IAAI4gB,EAAKwtB,GAGlC,IAAI3R,EAAS4N,GACXL,EACAjhC,EACA+/B,EAJkB5H,GAAqB0K,EAASJ,kBAAmBpwB,GAMnEsiB,EACAyM,GAEF,IAAK4E,IAAsBJ,IAA6BD,EAAmB,CACzE,MAAMhG,EAAOuC,GAAsBjB,EAAWjhC,GAC9C0zB,EAASA,EAAO6M,OAiXpB,SACEsC,EACA7iC,EACA2/B,GAEA,MAAMttB,EAAOrS,EAAMsX,MACbO,EAAM6sB,GAAoB7B,EAAU7iC,GACpCpC,EAAW2mC,GAA+B1B,EAAUlD,GAEpDjM,EAASmP,EAASN,gBAAgBiC,eACtCC,GAA2BzkC,GAC3B6X,EACAja,EAASya,OACTza,EAASoS,YAGLuiB,EAAUsQ,EAASL,eAAejQ,QAAQlgB,GAGhD,GAAIwF,EACF7tB,GACG63C,GAAyBtP,EAAQnkC,OAClC,yDAEG,CAEL,MAAM63C,EAAgB1T,EAAQyD,MAC5B,CAACP,EAAcwO,EAAqBC,KAClC,IACGjxB,GAAYwiB,IACbwO,GACApC,GAAyBoC,GAEzB,MAAO,CAAC9B,GAAyB8B,GAAqBjkC,OACjD,CAEL,IAAIkc,EAA0B,GAW9B,OAVI+nB,IACF/nB,EAAUA,EAAQqkB,OAChByB,GAAuBiC,GAAqB/xC,KAC1CytC,GAAQA,EAAK3/B,UAInB9E,GAAKgpC,GAAU,CAACC,EAAc+B,KAC5BhqB,EAAUA,EAAQqkB,OAAO2F,MAEpBhqB,MAIb,IAAK,IAAIzxB,EAAI,EAAGA,EAAIw7C,EAAcv7C,SAAUD,EAAG,CAC7C,MAAM07C,EAAcF,EAAcx7C,GAClCo4C,EAASN,gBAAgBqC,cACvBH,GAA2B0B,GAC3BzB,GAAoB7B,EAAUsD,KAIpC,OAAOzS,EA5akB0S,CAAuBvD,EAAU7iC,EAAO2/B,IAEjE,OAAOjM,EAcO,SAAA2S,GACdxD,EACAxwB,EACAsnB,GAEA,MACM1B,EAAY4K,EAASJ,kBACrB9N,EAAckO,EAASL,eAAepM,WAC1C/jB,GACA,CAAC6jB,EAAW+K,KACV,MACMtM,EAAcsN,GAClBhB,EAFmB/tB,GAAgBgjB,EAAW7jB,IAKhD,GAAIsiB,EACF,OAAOA,KAIb,OAAO6E,GACLvB,EACA5lB,EACAsiB,EACAgF,GAnBwB,GAwBZ,SAAA2M,GACdzD,EACA7iC,GAEA,MAAMqS,EAAOrS,EAAMsX,MACnB,IAAIqd,EAA2B,KAG/BkO,EAASL,eAAejM,cAAclkB,GAAM,CAACwzB,EAAiBC,KAC5D,MAAMrQ,EAAeviB,GAAgB2yB,EAAiBxzB,GACtDsiB,EACEA,GAAesN,GAAgC6D,EAAIrQ,MAEvD,IAAIwL,EAAY4B,EAASL,eAAenrC,IAAIgb,GACvC4uB,EAIHtM,EACEA,GAAesN,GAAgChB,EAAW9uB,OAJ5D8uB,EAAY,IAAIH,GAChB+B,EAASL,eAAiBK,EAASL,eAAevrC,IAAIob,EAAM4uB,IAK9D,MAAMG,EAAqC,MAAfzM,EACtB4R,EAAoCnF,EACtC,IAAItO,GAAU6B,GAAa,GAAM,GACjC,KAYJ,OF9hBI,SAA8BgL,GAClC,OAAOzK,GAA8ByK,EAAK5D,YE6hBnCyK,CAPYrF,GACjBF,EACAjhC,EANuCm4B,GACvC0K,EAASJ,kBACTziC,EAAMsX,OAMN8pB,EAAsBmF,EAAgBpW,UAAY5J,GAAalI,WAC/D+iB,IAkBJ,SAAS4B,GACPH,EACAxG,GAEA,OAAOoK,GACLpK,EACAwG,EAASL,eACQ,KACjBrK,GAAqB0K,EAASJ,kBAAmBtwB,OAOrD,SAASs0B,GACPpK,EACAqK,EACA/R,EACA2H,GAEA,GAAIrpB,GAAYopB,EAAUhqB,MACxB,OAAOs0B,GACLtK,EACAqK,EACA/R,EACA2H,GAEG,CACL,MAAM2E,EAAYyF,EAAcrvC,IAAI8a,MAGjB,MAAfwiB,GAAoC,MAAbsM,IACzBtM,EAAcsN,GAAgChB,EAAW9uB,OAG3D,IAAIuhB,EAAkB,GACtB,MAAMlS,EAAYpP,GAAaiqB,EAAUhqB,MACnCu0B,EAAiBvK,EAAU/J,kBAAkB9Q,GAC7CgD,EAAYkiB,EAAcne,SAASlxB,IAAImqB,GAC7C,GAAIgD,GAAaoiB,EAAgB,CAC/B,MAAMC,EAAmBlS,EACrBA,EAAYpT,kBAAkBC,GAC9B,KACEslB,EAAmB1L,GAAkBkB,EAAa9a,GACxDkS,EAASA,EAAO6M,OACdkG,GACEG,EACApiB,EACAqiB,EACAC,IAWN,OANI7F,IACFvN,EAASA,EAAO6M,OACdS,GAAwBC,EAAW5E,EAAWC,EAAa3H,KAIxDjB,GAOX,SAASiT,GACPtK,EACAqK,EACA/R,EACA2H,GAEA,MAAM2E,EAAYyF,EAAcrvC,IAAI8a,MAGjB,MAAfwiB,GAAoC,MAAbsM,IACzBtM,EAAcsN,GAAgChB,EAAW9uB,OAG3D,IAAIuhB,EAAkB,GAyBtB,OAxBAgT,EAAcne,SAAS/J,kBAAiB,CAACgD,EAAWgD,KAClD,MAAMqiB,EAAmBlS,EACrBA,EAAYpT,kBAAkBC,GAC9B,KACEslB,EAAmB1L,GAAkBkB,EAAa9a,GAClDolB,EAAiBvK,EAAU/J,kBAAkB9Q,GAC/ColB,IACFlT,EAASA,EAAO6M,OACdoG,GACEC,EACApiB,EACAqiB,EACAC,QAMJ7F,IACFvN,EAASA,EAAO6M,OACdS,GAAwBC,EAAW5E,EAAWC,EAAa3H,KAIxDjB,EAGT,SAAS6Q,GACP1B,EACAlD,GAEA,MAAM3/B,EAAQ2/B,EAAK3/B,MACb6X,EAAM6sB,GAAoB7B,EAAU7iC,GAE1C,MAAO,CACLqY,OAAQ,KACN,MAAMunB,EFxqBN,SAA6BD,GACjC,OAAOA,EAAK5D,WAAWpH,YAAYxE,UEuqBjB4W,CAAmBpH,IAASpZ,GAAalI,WACvD,OAAOuhB,EAAM3vB,QAEfD,WAAawI,IACX,GAAe,OAAXA,EACF,OAAIX,EArfI,SACdgrB,EACAxwB,EACAwF,GAEA,MAAMwtB,EAAWC,GAAwBzC,EAAUhrB,GACnD,GAAIwtB,EAAU,CACZ,MAAMpuB,EAAIsuB,GAAuBF,GAC3BG,EAAYvuB,EAAE5E,KAClByF,EAAUb,EAAEa,QACR2d,EAAeviB,GAAgBsyB,EAAWnzB,GAKhD,OAAOozB,GAA8B5C,EAAU2C,EAJpC,IAAIhT,GACbV,GAAoCha,GACpC2d,IAKF,MAAO,GAoeMuR,CAAkCnE,EAAU7iC,EAAMsX,MAAOO,GArgB1D,SACdgrB,EACAxwB,GAEA,OAAO2wB,GACLH,EACA,IAAIrQ,GhB7NC,CACLT,UAAU,EACVC,YAAY,EACZla,QAAS,KACTma,QAAQ,GgByNuC5f,IAigBlC40B,CAA4BpE,EAAU7iC,EAAMsX,OAEhD,CAGL,MAAMppB,E5DvUE,SAAmBoQ,EAAc0B,GAC/C,IAAI4P,EAAS,gBACA,YAATtR,EACFsR,EACE,0FAEgB,sBAATtR,EACTsR,EAAS,6DACS,gBAATtR,IACTsR,EAAS,8BAGX,MAAM1hB,EAAQ,IAAI9D,MAChBkU,EAAO,OAAS0B,EAAMsX,MAAM7f,WAAa,KAAOmY,GAIlD,OADC1hB,EAAcoQ,KAAOA,EAAK4oC,cACpBh5C,E4DsTai5C,CAAmB3uB,EAAQxY,GACzC,OAAOyjC,GACLZ,EACA7iC,EACsB,KACtB9R,MAUM,SAAAw2C,GACd7B,EACA7iC,GAEA,MAAMqlC,EAAWN,GAAsB/kC,GACvC,OAAO6iC,EAASF,cAActrC,IAAIguC,GAMpC,SAASN,GAAsB/kC,GAC7B,OAAOA,EAAMsX,MAAM7f,WAAa,IAAMuI,EAAM+X,iBAM9C,SAASutB,GACPzC,EACAhrB,GAEA,OAAOgrB,EAASH,cAAcrrC,IAAIwgB,GAMpC,SAAS0tB,GAAuBF,GAI9B,MAAM+B,EAAa/B,EAAS5lC,QAAQ,KAKpC,OAJAzV,GACkB,IAAhBo9C,GAAqBA,EAAa/B,EAAS36C,OAAS,EACpD,iBAEK,CACLotB,QAASutB,EAAShpC,OAAO+qC,EAAa,GACtC/0B,KAAM,IAAIR,GAAKwzB,EAAShpC,OAAO,EAAG+qC,KAOtC,SAAS3B,GACP5C,EACA2C,EACAnJ,GAEA,MAAM4E,EAAY4B,EAASL,eAAenrC,IAAImuC,GAC9Cx7C,EAAOi3C,EAAW,wDAKlB,OAAOD,GAAwBC,EAAW5E,EAJtBlE,GAClB0K,EAASJ,kBACT+C,GAEgE,MAiCpE,SAASf,GAA2BzkC,GAClC,OAAIA,EAAMiY,aAAaE,iBAAmBnY,EAAMiY,aAAaC,YAIpD,IAvzBTluB,EAAO62C,GAAsB,oCACtBA,IAszB0C7gC,EAAM+hC,MAAO/hC,EAAMsX,OAE3DtX,ECt2BX,MAAMqnC,GACJ34C,YAAqBqkC,GAAA3nC,KAAK2nC,MAALA,EAErBxR,kBAAkBC,GAChB,MAAMkF,EAAQt7B,KAAK2nC,MAAMxR,kBAAkBC,GAC3C,OAAO,IAAI6lB,GAAsB3gB,GAGnCrK,OACE,OAAOjxB,KAAK2nC,OAIhB,MAAMuU,GAIJ54C,YAAYm0C,EAAoBxwB,GAC9BjnB,KAAKm8C,UAAY1E,EACjBz3C,KAAKo8C,MAAQn1B,EAGfkP,kBAAkBC,GAChB,MAAM+T,EAAYziB,GAAU1nB,KAAKo8C,MAAOhmB,GACxC,OAAO,IAAI8lB,GAAsBl8C,KAAKm8C,UAAWhS,GAGnDlZ,OACE,OAAOgqB,GAA+Bj7C,KAAKm8C,UAAWn8C,KAAKo8C,QAOxD,MAcMC,GAA2B,SACtCr5C,EACAs5C,EACAC,GAEA,OAAKv5C,GAA0B,iBAAVA,GAGrBpE,EAAO,QAASoE,EAAO,6CAEK,iBAAjBA,EAAM,OACRw5C,GAA2Bx5C,EAAM,OAAQs5C,EAAaC,GAC5B,iBAAjBv5C,EAAM,OACfy5C,GAA4Bz5C,EAAM,OAAQs5C,QAEjD19C,GAAO,EAAO,4BAA8BgG,KAAKkB,UAAU9C,EAAO,KAAM,KATjEA,GAaLw5C,GAA6B,SACjCE,EACAzH,EACAsH,GAEA,GACO,cADCG,EAEJ,OAAOH,EAAwB,UAE/B39C,GAAO,EAAO,4BAA8B89C,IAI5CD,GAA8B,SAClCC,EACAzH,EACA0H,GAEKD,EAAGh5C,eAAe,cACrB9E,GAAO,EAAO,4BAA8BgG,KAAKkB,UAAU42C,EAAI,KAAM,IAEvE,MAAMjsB,EAAQisB,EAAc,UACP,iBAAVjsB,GACT7xB,GAAO,EAAO,+BAAiC6xB,GAGjD,MAAMmsB,EAAe3H,EAAShkB,OAO9B,GANAryB,EACEg+C,MAAAA,EACA,+CAIGA,EAAannB,aAChB,OAAOhF,EAGT,MACM6rB,EADOM,EACY5lB,WACzB,MAA2B,iBAAhBslB,EACF7rB,EAIF6rB,EAAc7rB,GAUVosB,GAA2B,SACtC51B,EACAgK,EACAwmB,EACA8E,GAEA,OAAOO,GACL7rB,EACA,IAAIirB,GAAsBzE,EAAUxwB,GACpCs1B,IASSQ,GAA+B,SAC1C9rB,EACAgkB,EACAsH,GAEA,OAAOO,GACL7rB,EACA,IAAIgrB,GAAsBhH,GAC1BsH,IAIJ,SAASO,GACP7rB,EACAqrB,EACAC,GAEA,MAAMS,EAAS/rB,EAAKyE,cAAcxoB,MAM5BooB,EAAW+mB,GACfW,EACAV,EAAYnmB,kBAAkB,aAC9BomB,GAEF,IAAIhrB,EAEJ,GAAIN,EAAKwE,aAAc,CACrB,MAAMwnB,EAAWhsB,EACXjuB,EAAQq5C,GACZY,EAASjmB,WACTslB,EACAC,GAEF,OACEv5C,IAAUi6C,EAASjmB,YACnB1B,IAAa2nB,EAASvnB,cAAcxoB,MAE7B,IAAI2oB,GAAS7yB,EAAO4yB,GAAaN,IAEjCrE,EAEJ,CACL,MAAMisB,EAAejsB,EAerB,OAdAM,EAAU2rB,EACN5nB,IAAa4nB,EAAaxnB,cAAcxoB,QAC1CqkB,EAAUA,EAAQ0E,eAAe,IAAIJ,GAASP,KAEhD4nB,EAAapmB,aAAae,IAAgB,CAACzB,EAAWI,KACpD,MAAME,EAAeomB,GACnBtmB,EACA8lB,EAAYnmB,kBAAkBC,GAC9BmmB,GAEE7lB,IAAiBF,IACnBjF,EAAUA,EAAQkF,qBAAqBL,EAAWM,OAG/CnF,GC5ME,MAAA4rB,GAMX75C,YACW8F,EAAe,GACfg0C,EAAyB,KAC3BnsB,EAAoB,CAAEkM,SAAU,GAAIkgB,WAAY,IAF9Cr9C,KAAIoJ,KAAJA,EACApJ,KAAMo9C,OAANA,EACFp9C,KAAIixB,KAAJA,GAUK,SAAAqsB,GAAe/X,EAAegY,GAE5C,IAAIt2B,EAAOs2B,aAAmB92B,GAAO82B,EAAU,IAAI92B,GAAK82B,GACpDjiB,EAAQiK,EACV9K,EAAOzT,GAAaC,GACtB,KAAgB,OAATwT,GAAe,CACpB,MAAMjE,EAAY5vB,EAAQ00B,EAAMrK,KAAKkM,SAAU1C,IAAS,CACtD0C,SAAU,GACVkgB,WAAY,GAEd/hB,EAAQ,IAAI6hB,GAAQ1iB,EAAMa,EAAO9E,GACjCvP,EAAOE,GAAaF,GACpBwT,EAAOzT,GAAaC,GAGtB,OAAOqU,EAQH,SAAUkiB,GAAgBjY,GAC9B,OAAOA,EAAKtU,KAAKjuB,MAQH,SAAAy6C,GAAgBlY,EAAeviC,GAC7CuiC,EAAKtU,KAAKjuB,MAAQA,EAClB06C,GAAkBnY,GAMd,SAAUoY,GAAmBpY,GACjC,OAAOA,EAAKtU,KAAKosB,WAAa,EAehB,SAAAO,GACdrY,EACA7Z,GAEA5b,GAAKy1B,EAAKtU,KAAKkM,UAAU,CAAC7B,EAAelC,KACvC1N,EAAO,IAAIyxB,GAAQ7hB,EAAOiK,EAAMnM,OAa9B,SAAUykB,GACdtY,EACA7Z,EACAoyB,EACAC,GAEID,IAAgBC,GAClBryB,EAAO6Z,GAGTqY,GAAiBrY,GAAMjK,IACrBuiB,GAAsBviB,EAAO5P,GAAQ,EAAMqyB,MAGzCD,GAAeC,GACjBryB,EAAO6Z,GAkDL,SAAUyY,GAAezY,GAC7B,OAAO,IAAI9e,GACO,OAAhB8e,EAAK6X,OACD7X,EAAKn8B,KACL40C,GAAYzY,EAAK6X,QAAU,IAAM7X,EAAKn8B,MAO9C,SAASs0C,GAAqBnY,GACR,OAAhBA,EAAK6X,QAWX,SAA4B7X,EAAenP,EAAmBkF,GAC5D,MAAM2iB,EApHF,SAAyB1Y,GAC7B,YAA8BriC,IAAvBs6C,GAAajY,KAAwBoY,GAAgBpY,GAmHzC2Y,CAAY5iB,GACzB6iB,EAAc53C,EAASg/B,EAAKtU,KAAKkM,SAAU/G,GAC7C6nB,GAAcE,UACT5Y,EAAKtU,KAAKkM,SAAS/G,GAC1BmP,EAAKtU,KAAKosB,aACVK,GAAkBnY,IACR0Y,GAAeE,IACzB5Y,EAAKtU,KAAKkM,SAAS/G,GAAakF,EAAMrK,KACtCsU,EAAKtU,KAAKosB,aACVK,GAAkBnY,IApBlB6Y,CAAgB7Y,EAAK6X,OAAQ7X,EAAKn8B,KAAMm8B,GCrKrC,MAAM8Y,GAAqB,iCAMrBC,GAAsB,+BAOtBC,GAAa,SAAU93C,GAClC,MACiB,iBAARA,GAAmC,IAAfA,EAAInH,SAAiB++C,GAAmBx6C,KAAK4C,IAI/D+3C,GAAoB,SAAU75B,GACzC,MACwB,iBAAfA,GACe,IAAtBA,EAAWrlB,SACVg/C,GAAoBz6C,KAAK8gB,IAajB85B,GAAkB,SAAUnpB,GACvC,OACe,OAAbA,GACoB,iBAAbA,GACc,iBAAbA,IAA0B5mB,GAAoB4mB,IACrDA,GACqB,iBAAbA,GAEP/uB,EAAS+uB,EAAiB,QAOnBopB,GAA0B,SACrC71C,EACA7F,EACAikB,EACA9U,GAEIA,QAAsBjP,IAAVF,GAIhB27C,GAAqBC,EAAe/1C,EAAQ,SAAU7F,EAAOikB,IAMlD03B,GAAuB,SAClC/1C,EACA7C,EACAq2C,GAEA,MAAMn1B,EACJm1B,aAAiB31B,GAAO,IAAImC,GAAewzB,EAAOxzC,GAAewzC,EAEnE,QAAal5C,IAAT6C,EACF,MAAM,IAAI/G,MACR4J,EAAc,sBAAwBugB,GAA4BlC,IAGtE,GAAoB,mBAATlhB,EACT,MAAM,IAAI/G,MACR4J,EACE,uBACAugB,GAA4BlC,GAC5B,oBACAlhB,EAAKsG,YAGX,GAAIqC,GAAoB3I,GACtB,MAAM,IAAI/G,MACR4J,EACE,YACA7C,EAAKsG,WACL,IACA8c,GAA4BlC,IAKlC,GACkB,iBAATlhB,GACPA,EAAKzG,OA3FqB,SA2FK,GAC/ByJ,EAAahD,GA5Fa,SA8F1B,MAAM,IAAI/G,MACR4J,EAAAA,sDAIEugB,GAA4BlC,GAC5B,MACAlhB,EAAK8J,UAAU,EAAG,IAClB,SAMN,GAAI9J,GAAwB,iBAATA,EAAmB,CACpC,IAAI84C,GAAc,EACdC,GAAiB,EAwBrB,GAvBAhvC,GAAK/J,GAAM,CAACU,EAAazD,KACvB,GAAY,WAARyD,EACFo4C,GAAc,OACT,GAAY,cAARp4C,GAA+B,QAARA,IAChCq4C,GAAiB,GACZP,GAAW93C,IACd,MAAM,IAAIzH,MACR4J,EACE,6BACAnC,EACA,KACA0iB,GAA4BlC,GAJ9Bre,yFhD4GI,SACdsgB,EACAoS,GAGIpS,EAAeJ,OAAOxpB,OAAS,IACjC4pB,EAAeH,aAAe,GAEhCG,EAAeJ,OAAOznB,KAAKi6B,GAC3BpS,EAAeH,aAAehgB,EAAauyB,GAC3CrS,GAAyBC,GgD3GrB61B,CAAmB93B,EAAMxgB,GACzBk4C,GAAqB/1C,EAAa5F,EAAOikB,GhD6GzC,SAA4BiC,GAChC,MAAM81B,EAAO91B,EAAeJ,OAAO4J,MACnCxJ,EAAeH,aAAehgB,EAAai2C,GAEvC91B,EAAeJ,OAAOxpB,OAAS,IACjC4pB,EAAeH,aAAe,GgDjH5Bk2B,CAAkBh4B,MAGhB43B,GAAeC,EACjB,MAAM,IAAI9/C,MACR4J,EACE,4BACAugB,GAA4BlC,GAC5B,sCA0DGi4B,GAA+B,SAC1Cr2C,EACA9C,EACAkhB,EACA9U,GAEA,GAAIA,QAAqBjP,IAAT6C,EACd,OAGF,MAAM6C,EAAcg2C,EAAe/1C,EAAQ,UAE3C,IAAM9C,GAAwB,iBAATA,GAAsBxF,MAAMC,QAAQuF,GACvD,MAAM,IAAI/G,MACR4J,EAAc,0DAIlB,MAAMu2C,EAAqB,GAC3BrvC,GAAK/J,GAAM,CAACU,EAAazD,KACvB,MAAMo8C,EAAU,IAAI34B,GAAKhgB,GAEzB,GADAk4C,GAAqB/1C,EAAa5F,EAAO0kB,GAAUT,EAAMm4B,IAC5B,cAAzBh4B,GAAYg4B,KACTX,GAAgBz7C,GACnB,MAAM,IAAIhE,MACR4J,EACE,kCACAw2C,EAAQ/yC,WAFVzD,gGAQNu2C,EAAW99C,KAAK+9C,MAlFsB,SACxCx2C,EACAu2C,GAEA,IAAI9/C,EAAG+/C,EACP,IAAK//C,EAAI,EAAGA,EAAI8/C,EAAW7/C,OAAQD,IAAK,CACtC+/C,EAAUD,EAAW9/C,GACrB,MAAMkQ,EAAO8X,GAAU+3B,GACvB,IAAK,IAAIz2C,EAAI,EAAGA,EAAI4G,EAAKjQ,OAAQqJ,IAC/B,GAAgB,cAAZ4G,EAAK5G,IAAsBA,IAAM4G,EAAKjQ,OAAS,QAE5C,IAAKi/C,GAAWhvC,EAAK5G,IAC1B,MAAM,IAAI3J,MACR4J,EACE,4BACA2G,EAAK5G,GACL,aACAy2C,EAAQ/yC,WAJVzD,uFAeRu2C,EAAW3vC,KAAK2Y,IAChB,IAAIk3B,EAAwB,KAC5B,IAAKhgD,EAAI,EAAGA,EAAI8/C,EAAW7/C,OAAQD,IAAK,CAEtC,GADA+/C,EAAUD,EAAW9/C,GACJ,OAAbggD,GAAqB12B,GAAa02B,EAAUD,GAC9C,MAAM,IAAIpgD,MACR4J,EACE,mBACAy2C,EAAShzC,WACT,qCACA+yC,EAAQ/yC,YAGdgzC,EAAWD,GA2CbE,CAA2B12C,EAAau2C,IAG7BI,GAAmB,SAC9B12C,EACAysB,EACAnjB,GAEA,IAAIA,QAAyBjP,IAAboyB,EAAhB,CAGA,GAAI5mB,GAAoB4mB,GACtB,MAAM,IAAIt2B,MACR4/C,EAAe/1C,EAAQ,YACrB,MACAysB,EAASjpB,WAFXuyC,6FAQJ,IAAKH,GAAgBnpB,GACnB,MAAM,IAAIt2B,MACR4/C,EAAe/1C,EAAQ,YAAvB+1C,yFAOOY,GAAc,SACzB32C,EACA42C,EACAh5C,EACA0L,GAEA,KAAIA,QAAoBjP,IAARuD,GAGX83C,GAAW93C,IACd,MAAM,IAAIzH,MACR4/C,EAAe/1C,EAAQ42C,GACrB,yBACAh5C,EAFFm4C,qGAYOc,GAAqB,SAChC72C,EACA42C,EACA96B,EACAxS,GAEA,KAAIA,QAA2BjP,IAAfyhB,GAIX65B,GAAkB75B,IACrB,MAAM,IAAI3lB,MACR4/C,EAAe/1C,EAAQ42C,GACrB,0BACA96B,EAFFi6B,qFA0BOe,GAAuB,SAAU92C,EAAgBoe,GAC5D,GAA2B,UAAvBD,GAAaC,GACf,MAAM,IAAIjoB,MAAM6J,EAAS,8CAIhB+2C,GAAc,SACzB/2C,EACAg3C,GAGA,MAAMl7B,EAAak7B,EAAU54B,KAAK5a,WAClC,GACuC,iBAA5BwzC,EAAU/qC,SAASlB,MACO,IAAnCisC,EAAU/qC,SAASlB,KAAKtU,SACtBi/C,GAAWsB,EAAU/qC,SAAShB,YACY,cAA1C+rC,EAAU/qC,SAASlB,KAAKtN,MAAM,KAAK,IACd,IAAtBqe,EAAWrlB,SApUqB,SAAUqlB,GAM7C,OALIA,IAEFA,EAAaA,EAAWjiB,QAAQ,mBAAoB,MAG/C87C,GAAkB75B,GA8TMm7B,CAAsBn7B,GAEnD,MAAM,IAAI3lB,MACR4/C,EAAe/1C,EAAQ,OAAvB+1C,yFC3WO,MAAAmB,GAAbz8C,cACEtD,KAAWggD,YAAgB,GAK3BhgD,KAAeigD,gBAAG,GAMJ,SAAAC,GACdC,EACAC,GAGA,IAAIC,EAA6B,KACjC,IAAK,IAAIhhD,EAAI,EAAGA,EAAI+gD,EAAc9gD,OAAQD,IAAK,CAC7C,MAAM0G,EAAOq6C,EAAc/gD,GACrB4nB,EAAOlhB,EAAKu6C,UACD,OAAbD,GAAsB53B,GAAWxB,EAAMo5B,EAASp5B,QAClDk5B,EAAWH,YAAY3+C,KAAKg/C,GAC5BA,EAAW,MAGI,OAAbA,IACFA,EAAW,CAAE/X,OAAQ,GAAIrhB,KAAAA,IAG3Bo5B,EAAS/X,OAAOjnC,KAAK0E,GAEnBs6C,GACFF,EAAWH,YAAY3+C,KAAKg/C,GAahB,SAAAE,GACdJ,EACAl5B,EACAm5B,GAEAF,GAAsBC,EAAYC,GAClCI,GAA6CL,GAAYM,GACvDh4B,GAAWg4B,EAAWx5B,KAaV,SAAAy5B,GACdP,EACAQ,EACAP,GAEAF,GAAsBC,EAAYC,GAClCI,GACEL,GACAM,GACE93B,GAAa83B,EAAWE,IACxBh4B,GAAag4B,EAAaF,KAIhC,SAASD,GACPL,EACA7V,GAEA6V,EAAWF,kBAEX,IAAIW,GAAU,EACd,IAAK,IAAIvhD,EAAI,EAAGA,EAAI8gD,EAAWH,YAAY1gD,OAAQD,IAAK,CACtD,MAAMwhD,EAAYV,EAAWH,YAAY3gD,GACzC,GAAIwhD,EAAW,CAETvW,EADcuW,EAAU55B,OAE1B65B,GAAeX,EAAWH,YAAY3gD,IACtC8gD,EAAWH,YAAY3gD,GAAK,MAE5BuhD,GAAU,GAKZA,IACFT,EAAWH,YAAc,IAG3BG,EAAWF,kBAWb,SAASa,GAAeD,GACtB,IAAK,IAAIxhD,EAAI,EAAGA,EAAIwhD,EAAUvY,OAAOhpC,OAAQD,IAAK,CAChD,MAAM0mB,EAAY86B,EAAUvY,OAAOjpC,GACnC,GAAkB,OAAd0mB,EAAoB,CACtB86B,EAAUvY,OAAOjpC,GAAK,KACtB,MAAM0hD,EAAUh7B,EAAUi7B,iBACtB/yC,GACFV,EAAI,UAAYwY,EAAU1Z,YAE5BiF,GAAeyvC,KCKR,MAAAE,GA0BX39C,YACSud,EACAqgC,EACAr3B,EACAs3B,GAHAnhD,KAAS6gB,UAATA,EACA7gB,KAAgBkhD,iBAAhBA,EACAlhD,KAAkB6pB,mBAAlBA,EACA7pB,KAAiBmhD,kBAAjBA,EA1BTnhD,KAAeohD,gBAAG,EAKlBphD,KAAcqmC,eAAyB,KACvCrmC,KAAAqhD,YAAc,IAAItB,GAClB//C,KAAYshD,aAAG,EAIfthD,KAA4BuhD,6BAA6C,KAGzEvhD,KAAauX,cAAuB2tB,KAGpCllC,KAAAwhD,sBAAwB,IAAIrE,GAG5Bn9C,KAAqByhD,sBAAgC,KASnDzhD,KAAKyG,IAAMzG,KAAK6gB,UAAUnM,cAM5BrI,WACE,OACGrM,KAAK6gB,UAAUhN,OAAS,WAAa,WAAa7T,KAAK6gB,UAAUjN,MAKxD,SAAA8tC,GACdC,EACAC,EACAC,GAIA,GAFAF,EAAK1qC,OAASxB,GAA0BksC,EAAK9gC,WAEzC8gC,EAAKT,mBjE0WY,iBAAXt9C,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOUk+C,OACR,6FACG,EiErXLH,EAAKxb,QAAU,IAAItC,GACjB8d,EAAK9gC,WACL,CACE8D,EACA5e,EACAg8C,EACAt1B,KAEAu1B,GAAiBL,EAAMh9B,EAAY5e,EAAMg8C,EAASt1B,KAEpDk1B,EAAK93B,mBACL83B,EAAKR,mBAIP5vC,YAAW,IAAM0wC,GAAoBN,GAA2B,IAAO,OAClE,CAEL,GAAI,MAAOE,EAAuD,CAChE,GAA4B,iBAAjBA,EACT,MAAM,IAAI7iD,MACR,sEAGJ,IACE8G,EAAU+7C,GACV,MAAOj/C,GACP,MAAM,IAAI5D,MAAM,kCAAoC4D,IAIxD++C,EAAKF,sBAAwB,IAAIh4B,GAC/Bk4B,EAAK9gC,UACL+gC,GACA,CACEj9B,EACA5e,EACAg8C,EACAt1B,KAEAu1B,GAAiBL,EAAMh9B,EAAY5e,EAAMg8C,EAASt1B,MAEnDy1B,IACCD,GAAoBN,EAAMO,MAE3BjW,KAmKP,SAAgC0V,EAAY1V,GAC1Cn8B,GAAKm8B,GAAS,CAACxlC,EAAazD,KAC1Bm/C,GAAeR,EAAMl7C,EAAKzD,MApKtBo/C,CAAuBT,EAAM1V,KAE/B0V,EAAK93B,mBACL83B,EAAKR,kBACLU,GAGFF,EAAKxb,QAAUwb,EAAKF,sBAGtBE,EAAK93B,mBAAmBtX,wBAAuBtM,IAC7C07C,EAAKxb,QAAQphB,iBAAiB9e,MAGhC07C,EAAKR,kBAAkB5uC,wBAAuBuc,IAC5C6yB,EAAKxb,QAAQnhB,qBAAqB8J,EAAO7oB,UAK3C07C,EAAKU,e3D1PS,SACdvtC,EACAwtC,GAEA,MAAM5sC,EAAaZ,EAASzI,WAM5B,OAJKmJ,GAAUE,KACbF,GAAUE,GAAc4sC,KAGnB9sC,GAAUE,G2DgPK6sC,CACpBZ,EAAK9gC,WACL,IAAM,IAAIolB,GAAc0b,EAAK1qC,OAAQ0qC,EAAKxb,WAI5Cwb,EAAKa,UAAY,IAAI3d,GACrB8c,EAAKc,cAAgB,IAAIvL,GAAS,CAChCkC,eAAgB,CAACxkC,EAAO6X,EAAKD,EAAe5H,KAC1C,IAAI89B,EAAsB,GAC1B,MAAMzxB,EAAO0wB,EAAKa,UAAUzd,QAAQnwB,EAAMsX,OAa1C,OAVK+E,EAAKpqB,YACR67C,EAAatK,GACXuJ,EAAKc,cACL7tC,EAAMsX,MACN+E,GAEF1f,YAAW,KACTqT,EAAW,QACV,IAEE89B,GAETlJ,cAAe,SAEjB2I,GAAeR,EAAM,aAAa,GAElCA,EAAKgB,gBAAkB,IAAIzL,GAAS,CAClCkC,eAAgB,CAACxkC,EAAO6X,EAAKD,EAAe5H,KAC1C+8B,EAAKxb,QAAQ5Z,OAAO3X,EAAO4X,EAAeC,GAAK,CAACW,EAAQrnB,KACtD,MAAMuiC,EAAS1jB,EAAWwI,EAAQrnB,GAClC26C,GACEiB,EAAKN,YACLzsC,EAAMsX,MACNoc,MAIG,IAETkR,cAAe,CAAC5kC,EAAO6X,KACrBk1B,EAAKxb,QAAQ7X,SAAS1Z,EAAO6X,MAQ7B,SAAUm2B,GAAejB,GAC7B,MACM95C,EADa85C,EAAKa,UAAUzd,QAAQ,IAAIte,GAAK,2BACxBvZ,OAAoB,EAC/C,OAAO,IAAI3J,MAAOC,UAAYqE,EAM1B,SAAUg7C,GAAyBlB,GACvC,OJxQA5wB,GAJAA,EI4Q0B,CACxB9M,UAAW2+B,GAAejB,MJzQT,IACD,UAAI5wB,EAAkB,YAAK,IAAIxtB,MAAOC,UACjDutB,EAPyB,IAChCA,EIoRF,SAASixB,GACPL,EACAh9B,EACA5e,EACAg8C,EACAt1B,GAGAk1B,EAAKP,kBACL,MAAMn6B,EAAO,IAAIR,GAAK9B,GACtB5e,EAAO47C,EAAKJ,6BACRI,EAAKJ,6BAA6B58B,EAAY5e,GAC9CA,EACJ,IAAIuiC,EAAS,GACb,GAAI7b,EACF,GAAIs1B,EAAS,CACX,MAAMe,EAAiBh8C,EACrBf,GACCg9C,GAAiBntB,GAAamtB,KAEjCza,EL8FA,SACJmP,EACAxwB,EACAwqB,EACAhlB,GAEA,MAAMwtB,EAAWC,GAAwBzC,EAAUhrB,GACnD,GAAIwtB,EAAU,CACZ,MAAMpuB,EAAIsuB,GAAuBF,GAC3BG,EAAYvuB,EAAE5E,KAClByF,EAAUb,EAAEa,QACR2d,EAAeviB,GAAgBsyB,EAAWnzB,GAC1C8wB,EAAa9N,GAAc+N,WAAWvG,GAM5C,OAAO4I,GAA8B5C,EAAU2C,EALpC,IAAI5S,GACbd,GAAoCha,GACpC2d,EACA0N,IAKF,MAAO,GKnHIiL,CACPrB,EAAKgB,gBACL17B,EACA67B,EACAr2B,OAEG,CACL,MAAMw2B,EAAartB,GAAa7vB,GAChCuiC,EAAS0R,GACP2H,EAAKgB,gBACL17B,EACAg8B,EACAx2B,QAGC,GAAIs1B,EAAS,CAClB,MAAMtQ,EAAkB3qC,EACtBf,GACCg9C,GAAiBntB,GAAamtB,KAEjCza,ELxIY,SACdmP,EACAxwB,EACAwqB,GAEA,MAAMsG,EAAa9N,GAAc+N,WAAWvG,GAE5C,OAAOmG,GACLH,EACA,IAAIjQ,GhB9MC,CACLb,UAAU,EACVC,YAAY,EACZla,QAAS,KACTma,QAAQ,GgB0M8B5f,EAAM8wB,IK+HnCmL,CACPvB,EAAKgB,gBACL17B,EACAwqB,OAEG,CACL,MAAM9T,EAAO/H,GAAa7vB,GAC1BuiC,EAAS8P,GAA6BuJ,EAAKgB,gBAAiB17B,EAAM0W,GAEpE,IAAIwB,EAAelY,EACfqhB,EAAOhpC,OAAS,IAGlB6/B,EAAegkB,GAAsBxB,EAAM16B,IAE7Cy5B,GAAoCiB,EAAKN,YAAaliB,EAAcmJ,GAWtE,SAAS2Z,GAAoBN,EAAYO,GACvCC,GAAeR,EAAM,YAAaO,IACZ,IAAlBA,GAyPN,SAAmCP,GACjCyB,GAAQzB,EAAM,sBAEd,MAAMpF,EAAesG,GAAyBlB,GACxC0B,EAA2Bne,KACjCM,GACEmc,EAAKpqC,cACLwP,MACA,CAACE,EAAMgK,KACL,MAAMqyB,EAAWzG,GACf51B,EACAgK,EACA0wB,EAAKgB,gBACLpG,GAEFpX,GAA2Bke,EAA0Bp8B,EAAMq8B,MAG/D,IAAIhb,EAAkB,GAEtB9C,GACE6d,EACAt8B,MACA,CAACE,EAAM0W,KACL2K,EAASA,EAAO6M,OACdiD,GAA6BuJ,EAAKgB,gBAAiB17B,EAAM0W,IAE3D,MAAMwB,EAAeokB,GAAsB5B,EAAM16B,GACjDk8B,GAAsBxB,EAAMxiB,MAIhCwiB,EAAKpqC,cAAgB2tB,KACrBwb,GAAoCiB,EAAKN,YAAat6B,KAAgBuhB,GAzRpEkb,CAA0B7B,GAU9B,SAASQ,GAAeR,EAAYh9B,EAAoB3hB,GACtD,MAAMikB,EAAO,IAAIR,GAAK,UAAY9B,GAC5B4M,EAAUqE,GAAa5yB,GAC7B2+C,EAAKa,UAAUxd,eAAe/d,EAAMsK,GACpC,MAAM+W,EAAS8P,GACbuJ,EAAKc,cACLx7B,EACAsK,GAEFmvB,GAAoCiB,EAAKN,YAAap6B,EAAMqhB,GAG9D,SAASmb,GAAmB9B,GAC1B,OAAOA,EAAKL,eA6FR,SAAUoC,GACd/B,EACA16B,EACA08B,EACAnoB,EACA5W,GAEAw+B,GAAQzB,EAAM,MAAO,CACnB16B,KAAMA,EAAK5a,WACXrJ,MAAO2gD,EACPruB,SAAUkG,IAKZ,MAAM+gB,EAAesG,GAAyBlB,GACxCiC,EAAoBhuB,GAAa+tB,EAAQnoB,GACzCyZ,EAAWgG,GAA+B0G,EAAKgB,gBAAiB17B,GAChEsK,EAAUwrB,GACd6G,EACA3O,EACAsH,GAGIrP,EAAUuW,GAAmB9B,GAC7BrZ,EAASkP,GACbmK,EAAKgB,gBACL17B,EACAsK,EACA2b,GACA,GAEFgT,GAAsByB,EAAKN,YAAa/Y,GACxCqZ,EAAKxb,QAAQzhB,IACXuC,EAAK5a,WACLu3C,EAAkB12C,KAAgB,IAClC,CAACkgB,EAAQ2B,KACP,MAAM80B,EAAqB,OAAXz2B,EACXy2B,GACHl/C,GAAK,UAAYsiB,EAAO,YAAcmG,GAGxC,MAAM02B,EAAc7L,GAClB0J,EAAKgB,gBACLzV,GACC2W,GAEHnD,GAAoCiB,EAAKN,YAAap6B,EAAM68B,GAC5DC,GAA2BpC,EAAM/8B,EAAYwI,EAAQ2B,MAGzD,MAAMoQ,EAAeokB,GAAsB5B,EAAM16B,GACjDk8B,GAAsBxB,EAAMxiB,GAE5BuhB,GAAoCiB,EAAKN,YAAaliB,EAAc,IAkHtD,SAAA6kB,GACdrC,EACA16B,EACArC,GAEA+8B,EAAKxb,QAAQhhB,mBAAmB8B,EAAK5a,YAAY,CAAC+gB,EAAQ2B,KACzC,OAAX3B,GACFkY,GAAyBqc,EAAKpqC,cAAe0P,GAE/C88B,GAA2BpC,EAAM/8B,EAAYwI,EAAQ2B,MAInD,SAAUk1B,GACdtC,EACA16B,EACAjkB,EACA4hB,GAEA,MAAM2M,EAAUqE,GAAa5yB,GAC7B2+C,EAAKxb,QAAQlhB,gBACXgC,EAAK5a,WACLklB,EAAQrkB,KAAgB,IACxB,CAACkgB,EAAQ2B,KACQ,OAAX3B,GACF+X,GAA2Bwc,EAAKpqC,cAAe0P,EAAMsK,GAEvDwyB,GAA2BpC,EAAM/8B,EAAYwI,EAAQ2B,MA8E3C,SAAAm1B,GACdvC,EACA/sC,EACA+/B,GAIA,IAAIrM,EAEFA,EADgC,UAA9BthB,GAAapS,EAAMsX,OACZmsB,GACPsJ,EAAKc,cACL7tC,EACA+/B,GAGO0D,GACPsJ,EAAKgB,gBACL/tC,EACA+/B,GAGJ4L,GAA4BoB,EAAKN,YAAazsC,EAAMsX,MAAOoc,GAGvD,SAAU6b,GAAcxC,GACxBA,EAAKF,uBACPE,EAAKF,sBAAsBlxB,UAvtBN,kBAqwBzB,SAAS6yB,GAAQzB,KAAe7zC,GAC9B,IAAIU,EAAS,GACTmzC,EAAKF,wBACPjzC,EAASmzC,EAAKF,sBAAsBh0C,GAAK,KAE3CF,EAAIiB,KAAWV,GAGX,SAAUi2C,GACdpC,EACAh8C,EACAynB,EACA2B,GAEIppB,GACF2L,IAAe,KACb,GAAe,OAAX8b,EACFznB,EAAS,UACJ,CACL,MAAMuN,GAAQka,GAAU,SAAS0uB,cACjC,IAAIh9C,EAAUoU,EACV6b,IACFjwB,GAAW,KAAOiwB,GAGpB,MAAMjsB,EAAQ,IAAI9D,MAAMF,GAGvBgE,EAAcoQ,KAAOA,EACtBvN,EAAS7C,OAiIjB,SAASshD,GACPzC,EACA16B,EACAo9B,GAEA,OACEpJ,GAA+B0G,EAAKgB,gBAAiB17B,EAAMo9B,IAC3DlpB,GAAalI,WAajB,SAASqxB,GACP3C,EACA1wB,EAA4B0wB,EAAKH,uBAOjC,GAJKvwB,GACHszB,GAAwC5C,EAAM1wB,GAG5CusB,GAAavsB,GAAO,CACtB,MAAMuzB,EAAQC,GAA0B9C,EAAM1wB,GAC9CryB,EAAO4lD,EAAMllD,OAAS,EAAG,yCAEVklD,EAAME,OAClBC,GAA+C,IAAlBA,EAAYv3B,UAqBhD,SACEu0B,EACA16B,EACAu9B,GAGA,MAAMI,EAAeJ,EAAM19C,KAAI+9C,GACtBA,EAAIC,iBAEPC,EAAcX,GAAmBzC,EAAM16B,EAAM29B,GACnD,IAAII,EAAaD,EACjB,MAAME,EAAaF,EAAYlgC,OAC/B,IAAK,IAAIxlB,EAAI,EAAGA,EAAImlD,EAAMllD,OAAQD,IAAK,CACrC,MAAMwlD,EAAML,EAAMnlD,GAClBT,EAEE,IADAimD,EAAIz3B,OACJ,iEAEFy3B,EAAIz3B,OAAM,EACVy3B,EAAIK,aACJ,MAAM7a,EAAeviB,GAAgBb,EAAM49B,EAAI59B,MAE/C+9B,EAAaA,EAAWruB,YACtB0T,EACAwa,EAAIM,0BAIR,MAAMC,EAAaJ,EAAW93C,KAAI,GAC5Bm4C,EAAap+B,EAGnB06B,EAAKxb,QAAQzhB,IACX2gC,EAAWh5C,WACX+4C,GACCh4B,IACCg2B,GAAQzB,EAAM,2BAA4B,CACxC16B,KAAMo+B,EAAWh5C,WACjB+gB,OAAAA,IAGF,IAAIkb,EAAkB,GACtB,GAAe,OAAXlb,EAAiB,CAInB,MAAMk4B,EAAY,GAClB,IAAK,IAAIjmD,EAAI,EAAGA,EAAImlD,EAAMllD,OAAQD,IAChCmlD,EAAMnlD,GAAG+tB,OAAqC,EAC9Ckb,EAASA,EAAO6M,OACd8C,GAAqB0J,EAAKgB,gBAAiB6B,EAAMnlD,GAAGylD,iBAElDN,EAAMnlD,GAAGulB,YAGX0gC,EAAUjkD,MAAK,IACbmjD,EAAMnlD,GAAGulB,WACP,MACA,EACA4/B,EAAMnlD,GAAGkmD,iCAIff,EAAMnlD,GAAGmmD,YAIXjB,GACE5C,EACArE,GAAYqE,EAAKH,sBAAuBv6B,IAG1Cq9B,GAA0B3C,EAAMA,EAAKH,uBAErCd,GAAoCiB,EAAKN,YAAap6B,EAAMqhB,GAG5D,IAAK,IAAIjpC,EAAI,EAAGA,EAAIimD,EAAUhmD,OAAQD,IACpCiS,GAAeg0C,EAAUjmD,QAEtB,CAEL,GAAe,cAAX+tB,EACF,IAAK,IAAI/tB,EAAI,EAAGA,EAAImlD,EAAMllD,OAAQD,IAC4B,IAAxDmlD,EAAMnlD,GAAG+tB,OACXo3B,EAAMnlD,GAAG+tB,OAAuC,EAEhDo3B,EAAMnlD,GAAG+tB,OAA+B,MAGvC,CACLzoB,GACE,kBAAoB0gD,EAAWh5C,WAAa,YAAc+gB,GAE5D,IAAK,IAAI/tB,EAAI,EAAGA,EAAImlD,EAAMllD,OAAQD,IAChCmlD,EAAMnlD,GAAG+tB,OAAuC,EAChDo3B,EAAMnlD,GAAGomD,YAAcr4B,EAI3B+1B,GAAsBxB,EAAM16B,MAGhCg+B,GAvHES,CAAyB/D,EAAM3D,GAAY/sB,GAAOuzB,QAE3C7G,GAAgB1sB,IACzB2sB,GAAiB3sB,GAAMuF,IACrB8tB,GAA0B3C,EAAMnrB,MAkItC,SAAS2sB,GAAsBxB,EAAYhB,GACzC,MAAMgF,EAA0BC,GAC9BjE,EACAhB,GAEI15B,EAAO+2B,GAAY2H,GAKzB,OAUF,SACEhE,EACA6C,EACAv9B,GAEA,GAAqB,IAAjBu9B,EAAMllD,OACR,OAMF,MAAMgmD,EAAY,GAClB,IAAIhd,EAAkB,GAEtB,MAGMsc,EAHcJ,EAAM7b,QAAOxc,GAChB,IAARA,EAAEiB,SAEsBtmB,KAAIqlB,GAC5BA,EAAE24B,iBAEX,IAAK,IAAIzlD,EAAI,EAAGA,EAAImlD,EAAMllD,OAAQD,IAAK,CACrC,MAAMslD,EAAcH,EAAMnlD,GACpBgrC,EAAeviB,GAAgBb,EAAM09B,EAAY19B,MACvD,IACEw+B,EADEI,GAAmB,EAOvB,GALAjnD,EACmB,OAAjByrC,EACA,iEAGoB,IAAlBsa,EAAYv3B,OACdy4B,GAAmB,EACnBJ,EAAcd,EAAYc,YAC1Bnd,EAASA,EAAO6M,OACd8C,GACE0J,EAAKgB,gBACLgC,EAAYG,gBACZ,SAGC,GAAsB,IAAlBH,EAAYv3B,OACrB,GAAIu3B,EAAYO,YAvoCU,GAwoCxBW,GAAmB,EACnBJ,EAAc,WACdnd,EAASA,EAAO6M,OACd8C,GACE0J,EAAKgB,gBACLgC,EAAYG,gBACZ,QAGC,CAEL,MAAMgB,EAAc1B,GAClBzC,EACAgD,EAAY19B,KACZ29B,GAEFD,EAAYoB,qBAAuBD,EACnC,MAAMpO,EAAU8M,EAAMnlD,GAAGgJ,OAAOy9C,EAAY54C,OAC5C,QAAgBhK,IAAZw0C,EAAuB,CACzBiH,GACE,qCACAjH,EACAiN,EAAY19B,MAEd,IAAI++B,EAAcpwB,GAAa8hB,GAEV,iBAAZA,GACI,MAAXA,GACAnxC,EAASmxC,EAAS,eAGlBsO,EAAcA,EAAY/vB,eAAe6vB,EAAYpwB,gBAGvD,MAAMuwB,EAAatB,EAAYG,eACzBvI,EAAesG,GAAyBlB,GACxCuE,EAAkBnJ,GACtBiJ,EACAF,EACAvJ,GAGFoI,EAAYQ,yBAA2Ba,EACvCrB,EAAYY,8BAAgCW,EAC5CvB,EAAYG,eAAiBrB,GAAmB9B,GAEhDiD,EAAa1+B,OAAO0+B,EAAavwC,QAAQ4xC,GAAa,GACtD3d,EAASA,EAAO6M,OACdqC,GACEmK,EAAKgB,gBACLgC,EAAY19B,KACZi/B,EACAvB,EAAYG,eACZH,EAAYwB,eAGhB7d,EAASA,EAAO6M,OACd8C,GAAqB0J,EAAKgB,gBAAiBsD,GAAY,SAGzDJ,GAAmB,EACnBJ,EAAc,SACdnd,EAASA,EAAO6M,OACd8C,GACE0J,EAAKgB,gBACLgC,EAAYG,gBACZ,IAMVpE,GAAoCiB,EAAKN,YAAap6B,EAAMqhB,GAC5DA,EAAS,GACLud,IAEFrB,EAAMnlD,GAAG+tB,OAAqC,EAKnCo4B,EAERhB,EAAMnlD,GAAGmmD,UADVj0C,WAAWi0C,EAAWn1C,KAAKI,MAAM,IAG/B+zC,EAAMnlD,GAAGulB,aACS,WAAhB6gC,EACFH,EAAUjkD,MAAK,IACbmjD,EAAMnlD,GAAGulB,WAAW,MAAM,EAAO4/B,EAAMnlD,GAAG0mD,wBAG5CT,EAAUjkD,MAAK,IACbmjD,EAAMnlD,GAAGulB,WAAW,IAAI5lB,MAAMymD,IAAc,EAAO,UAXzD,IAAWD,EAmBfjB,GAAwC5C,EAAMA,EAAKH,uBAGnD,IAAK,IAAIniD,EAAI,EAAGA,EAAIimD,EAAUhmD,OAAQD,IACpCiS,GAAeg0C,EAAUjmD,IAI3BilD,GAA0B3C,EAAMA,EAAKH,uBAnKrC4E,CAA0BzE,EADZ8C,GAA0B9C,EAAMgE,GACP1+B,GAEhCA,EA4KT,SAAS2+B,GACPjE,EACA16B,GAEA,IAAI2P,EAIAyvB,EAAkB1E,EAAKH,sBAE3B,IADA5qB,EAAQ5P,GAAaC,GACJ,OAAV2P,QAAoD1zB,IAAlCs6C,GAAa6I,IACpCA,EAAkB/I,GAAY+I,EAAiBzvB,GAE/CA,EAAQ5P,GADRC,EAAOE,GAAaF,IAItB,OAAOo/B,EAUT,SAAS5B,GACP9C,EACA0E,GAGA,MAAMC,EAAkC,GAUxC,OATAC,GACE5E,EACA0E,EACAC,GAIFA,EAAiB92C,MAAK,CAACtH,EAAGC,IAAMD,EAAEs+C,MAAQr+C,EAAEq+C,QAErCF,EAGT,SAASC,GACP5E,EACA1wB,EACAuzB,GAEA,MAAMiC,EAAYjJ,GAAavsB,GAC/B,GAAIw1B,EACF,IAAK,IAAIpnD,EAAI,EAAGA,EAAIonD,EAAUnnD,OAAQD,IACpCmlD,EAAMnjD,KAAKolD,EAAUpnD,IAIzBu+C,GAAiB3sB,GAAMqK,IACrBirB,GAAsC5E,EAAMrmB,EAAOkpB,MAOvD,SAASD,GACP5C,EACA1wB,GAEA,MAAMuzB,EAAQhH,GAAavsB,GAC3B,GAAIuzB,EAAO,CACT,IAAIkC,EAAK,EACT,IAAK,IAAIpW,EAAO,EAAGA,EAAOkU,EAAMllD,OAAQgxC,IACkB,IAApDkU,EAAMlU,GAAMljB,SACdo3B,EAAMkC,GAAMlC,EAAMlU,GAClBoW,KAGJlC,EAAMllD,OAASonD,EACfjJ,GAAaxsB,EAAMuzB,EAAMllD,OAAS,EAAIklD,OAAQthD,GAGhD06C,GAAiB3sB,GAAMuF,IACrB+tB,GAAwC5C,EAAMnrB,MAWlD,SAAS+sB,GAAsB5B,EAAY16B,GACzC,MAAMkY,EAAe6e,GAAY4H,GAA+BjE,EAAM16B,IAEhEo/B,EAAkB/I,GAAYqE,EAAKH,sBAAuBv6B,GAYhE,OHl0Cc,SACdse,EACA7Z,EACAoyB,GAEA,IAAI7sB,EAAO6sB,EAAcvY,EAAOA,EAAK6X,OACrC,KAAgB,OAATnsB,GAAe,CACpB,GAAIvF,EAAOuF,GACT,OAAO,EAETA,EAAOA,EAAKmsB,QG8yCduJ,CAAoBN,GAAkBp1B,IACpC21B,GAA4BjF,EAAM1wB,MAGpC21B,GAA4BjF,EAAM0E,GAElCxI,GAAsBwI,GAAkBp1B,IACtC21B,GAA4BjF,EAAM1wB,MAG7BkO,EAQT,SAASynB,GACPjF,EACA1wB,GAEA,MAAMuzB,EAAQhH,GAAavsB,GAC3B,GAAIuzB,EAAO,CAIT,MAAMc,EAAY,GAIlB,IAAIhd,EAAkB,GAClBue,GAAY,EAChB,IAAK,IAAIxnD,EAAI,EAAGA,EAAImlD,EAAMllD,OAAQD,QAC5BmlD,EAAMnlD,GAAG+tB,SAE0C,IAA5Co3B,EAAMnlD,GAAG+tB,QAClBxuB,EACEioD,IAAaxnD,EAAI,EACjB,mDAEFwnD,EAAWxnD,EAEXmlD,EAAMnlD,GAAG+tB,OAA4C,EACrDo3B,EAAMnlD,GAAGomD,YAAc,QAEvB7mD,EAC2C,IAAzC4lD,EAAMnlD,GAAG+tB,OACT,0CAGFo3B,EAAMnlD,GAAGmmD,YACTld,EAASA,EAAO6M,OACd8C,GACE0J,EAAKgB,gBACL6B,EAAMnlD,GAAGylD,gBACT,IAGAN,EAAMnlD,GAAGulB,YACX0gC,EAAUjkD,KACRmjD,EAAMnlD,GAAGulB,WAAWtW,KAAK,KAAM,IAAItP,MAAM,QAAQ,EAAO,UAK9C,IAAd6nD,EAEFpJ,GAAaxsB,OAAM/tB,GAGnBshD,EAAMllD,OAASunD,EAAW,EAI5BnG,GACEiB,EAAKN,YACLrD,GAAY/sB,GACZqX,GAEF,IAAK,IAAIjpC,EAAI,EAAGA,EAAIimD,EAAUhmD,OAAQD,IACpCiS,GAAeg0C,EAAUjmD,KC7+CxB,MAAMynD,GAAgB,SAC3BC,EACA/yC,GAEA,MAAM6rC,EAAYmH,GAAiBD,GACjCjzC,EAAY+rC,EAAU/rC,UAEC,iBAArB+rC,EAAUrkC,QACZ/M,GACEoxC,EAAUjsC,KAAVisC,8EAQA/rC,GAA2B,cAAdA,GACM,cAArB+rC,EAAUrkC,QAEV/M,GACE,gFAICoxC,EAAUhsC,QlEiFK,oBAAXjQ,QACPA,OAAOsV,UACPtV,OAAOsV,SAASvE,WACgC,IAAhD/Q,OAAOsV,SAASvE,SAASN,QAAQ,WAEjC1P,GACE,6FkEnFJ,MAAMoP,EAAqC,OAArB8rC,EAAUoH,QAAwC,QAArBpH,EAAUoH,OAE7D,MAAO,CACLnyC,SAAU,IAAInB,GACZksC,EAAUjsC,KACVisC,EAAUhsC,OACVC,EACAC,EACAC,EACoB,GACeF,IAAc+rC,EAAUqH,WAE7DjgC,KAAM,IAAIR,GAAKo5B,EAAUl7B,cAIhBqiC,GAAmB,SAAUD,GAWxC,IAAInzC,EAAO,GACT4H,EAAS,GACT0rC,EAAY,GACZviC,EAAa,GACb7Q,EAAY,GAGVD,GAAS,EACXozC,EAAS,QACTE,EAAO,IAGT,GAAuB,iBAAZJ,EAAsB,CAE/B,IAAIK,EAAWL,EAAQ1yC,QAAQ,MAC3B+yC,GAAY,IACdH,EAASF,EAAQl3C,UAAU,EAAGu3C,EAAW,GACzCL,EAAUA,EAAQl3C,UAAUu3C,EAAW,IAIzC,IAAIC,EAAWN,EAAQ1yC,QAAQ,MACb,IAAdgzC,IACFA,EAAWN,EAAQznD,QAErB,IAAIgoD,EAAkBP,EAAQ1yC,QAAQ,MACb,IAArBizC,IACFA,EAAkBP,EAAQznD,QAE5BsU,EAAOmzC,EAAQl3C,UAAU,EAAGQ,KAAKG,IAAI62C,EAAUC,IAC3CD,EAAWC,IAEb3iC,EA7HN,SAAoBA,GAClB,IAAI4iC,EAAoB,GACxB,MAAM9/B,EAAS9C,EAAWre,MAAM,KAChC,IAAK,IAAIjH,EAAI,EAAGA,EAAIooB,EAAOnoB,OAAQD,IACjC,GAAIooB,EAAOpoB,GAAGC,OAAS,EAAG,CACxB,IAAIkoD,EAAQ//B,EAAOpoB,GACnB,IACEmoD,EAAQC,mBAAmBD,EAAM9kD,QAAQ,MAAO,MAChD,MAAOE,IACT2kD,GAAqB,IAAMC,EAG/B,OAAOD,EAiHUG,CAAWX,EAAQl3C,UAAUw3C,EAAUC,KAEtD,MAAMlkB,EA7GV,SAAqBukB,GACnB,MAAMC,EAAU,GACc,MAA1BD,EAAYtlD,OAAO,KACrBslD,EAAcA,EAAY93C,UAAU,IAEtC,IAAK,MAAMg4C,KAAWF,EAAYrhD,MAAM,KAAM,CAC5C,GAAuB,IAAnBuhD,EAAQvoD,OACV,SAEF,MAAMwoD,EAAKD,EAAQvhD,MAAM,KACP,IAAdwhD,EAAGxoD,OACLsoD,EAAQH,mBAAmBK,EAAG,KAAOL,mBAAmBK,EAAG,IAE3DnjD,GAAK,0BAA0BkjD,gBAAsBF,MAGzD,OAAOC,EA6FeG,CAClBhB,EAAQl3C,UAAUQ,KAAKG,IAAIu2C,EAAQznD,OAAQgoD,KAI7CF,EAAWxzC,EAAKS,QAAQ,KACpB+yC,GAAY,GACdvzC,EAAoB,UAAXozC,GAAiC,QAAXA,EAC/BE,EAAOn2C,SAAS4C,EAAK/D,UAAUu3C,EAAW,GAAI,KAE9CA,EAAWxzC,EAAKtU,OAGlB,MAAM0oD,EAAkBp0C,EAAK2T,MAAM,EAAG6/B,GACtC,GAAsC,cAAlCY,EAAgB92C,cAClBsK,EAAS,iBACJ,GAAIwsC,EAAgB1hD,MAAM,KAAKhH,QAAU,EAC9Ckc,EAASwsC,MACJ,CAEL,MAAMC,EAASr0C,EAAKS,QAAQ,KAC5B6yC,EAAYtzC,EAAK/D,UAAU,EAAGo4C,GAAQ/2C,cACtCsK,EAAS5H,EAAK/D,UAAUo4C,EAAS,GAEjCn0C,EAAYozC,EAGV,OAAQ9jB,IACVtvB,EAAYsvB,EAAgB,IAIhC,MAAO,CACLxvB,KAAAA,EACAuzC,KAAAA,EACA3rC,OAAAA,EACA0rC,UAAAA,EACArzC,OAAAA,EACAozC,OAAAA,EACAtiC,WAAAA,EACA7Q,UAAAA,ICxIS,MAAAo0C,GAOX5kD,YACSoiB,EACAivB,EACAwT,EACAlf,GAHAjpC,KAAS0lB,UAATA,EACA1lB,KAAiB20C,kBAAjBA,EACA30C,KAAQmoD,SAARA,EACAnoD,KAAQipC,SAARA,EAETqX,UACE,MAAM8H,EAAMpoD,KAAKmoD,SAASC,IAC1B,MAAuB,UAAnBpoD,KAAK0lB,UACA0iC,EAAIl8B,MAEJk8B,EAAIhL,OAAOlxB,MAGtBm8B,eACE,OAAOroD,KAAK0lB,UAEds7B,iBACE,OAAOhhD,KAAK20C,kBAAkBqM,eAAehhD,MAE/CqM,WACE,OACErM,KAAKsgD,UAAUj0C,WACf,IACArM,KAAK0lB,UACL,IACA5f,EAAU9F,KAAKmoD,SAASG,cAKjB,MAAAC,GACXjlD,YACSqxC,EACA7xC,EACAmkB,GAFAjnB,KAAiB20C,kBAAjBA,EACA30C,KAAK8C,MAALA,EACA9C,KAAIinB,KAAJA,EAETq5B,UACE,OAAOtgD,KAAKinB,KAEdohC,eACE,MAAO,SAETrH,iBACE,OAAOhhD,KAAK20C,kBAAkBqM,eAAehhD,MAE/CqM,WACE,OAAOrM,KAAKinB,KAAK5a,WAAa,WC3DrB,MAAAm8C,GACXllD,YACmBmlD,EACAC,GADA1oD,KAAgByoD,iBAAhBA,EACAzoD,KAAc0oD,eAAdA,EAGnBC,QACEC,EACAC,GAEA7oD,KAAKyoD,iBAAiB9hD,KAAK,KAAMiiD,EAAiBC,GAGpDC,SAAShmD,GAKP,OAJAlE,EACEoB,KAAK+oD,kBACL,gEAEK/oD,KAAK0oD,eAAe/hD,KAAK,KAAM7D,GAGpCimD,wBACF,QAAS/oD,KAAK0oD,eAGhBvoB,QAAQzX,GACN,OACE1oB,KAAKyoD,mBAAqB//B,EAAM+/B,uBACQvlD,IAAvClD,KAAKyoD,iBAAiBO,cACrBhpD,KAAKyoD,iBAAiBO,eACpBtgC,EAAM+/B,iBAAiBO,cACzBhpD,KAAKyoD,iBAAiB7iC,UAAY8C,EAAM+/B,iBAAiB7iC,SCxBpD,MAAAqjC,GAEX3lD,YAAoBqzC,EAAqBzqB,GAArBlsB,KAAK22C,MAALA,EAAqB32C,KAAKksB,MAALA,EAYzCg9B,SACE,MAAMn9B,EAAW,IAAI1mB,EAMrB,OALA2+C,GACEhkD,KAAK22C,MACL32C,KAAKksB,MACLH,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QASlB4G,SACEuzC,GAAqB,sBAAuB3/C,KAAKksB,OACjD,MAAMH,EAAW,IAAI1mB,EAOrB,OANA4+C,GACEjkD,KAAK22C,MACL32C,KAAKksB,MACL,KACAH,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAsBlBqG,IAAI7I,GACF28C,GAAqB,mBAAoB3/C,KAAKksB,OAC9CwyB,GAAwB,mBAAoB17C,EAAOhD,KAAKksB,OAAO,GAC/D,MAAMH,EAAW,IAAI1mB,EAOrB,OANA4+C,GACEjkD,KAAK22C,MACL32C,KAAKksB,MACLlpB,EACA+oB,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAalB2jD,gBACEnmD,EACAsyB,GAEAqqB,GAAqB,+BAAgC3/C,KAAKksB,OAC1DwyB,GACE,+BACA17C,EACAhD,KAAKksB,OACL,GAEFqzB,GAAiB,+BAAgCjqB,GAAU,GAE3D,MAAMvJ,EAAW,IAAI1mB,EAQrB,OJmkBE,SACJs8C,EACA16B,EACAjkB,EACAsyB,EACA1Q,GAEA,MAAM2M,EAAUqE,GAAa5yB,EAAOsyB,GACpCqsB,EAAKxb,QAAQlhB,gBACXgC,EAAK5a,WACLklB,EAAQrkB,KAAgB,IACxB,CAACkgB,EAAQ2B,KACQ,OAAX3B,GACF+X,GAA2Bwc,EAAKpqC,cAAe0P,EAAMsK,GAEvDwyB,GAA2BpC,EAAM/8B,EAAYwI,EAAQ2B,MIzlBvDq6B,CACEppD,KAAK22C,MACL32C,KAAKksB,MACLlpB,EACAsyB,EACAvJ,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAmBlB6C,OAAO0oB,GACL4uB,GAAqB,sBAAuB3/C,KAAKksB,OACjDgzB,GACE,sBACAnuB,EACA/wB,KAAKksB,OACL,GAEF,MAAMH,EAAW,IAAI1mB,EAOrB,OJqjBE,SACJs8C,EACA16B,EACAoiC,EACAzkC,GAEA,GAAI/d,EAAQwiD,GAGV,OAFA97C,EAAI,4EACJw2C,GAA2BpC,EAAM/8B,EAAY,UAAM1hB,GAIrDy+C,EAAKxb,QAAQjhB,kBACX+B,EAAK5a,WACLg9C,GACA,CAACj8B,EAAQ2B,KACQ,OAAX3B,GACFtd,GAAKu5C,GAAiB,CAACjzB,EAAmBI,KACxC,MAAME,EAAed,GAAaY,GAClC2O,GACEwc,EAAKpqC,cACLmQ,GAAUT,EAAMmP,GAChBM,MAINqtB,GAA2BpC,EAAM/8B,EAAYwI,EAAQ2B,MIrlBvDu6B,CACEtpD,KAAK22C,MACL32C,KAAKksB,MACL6E,EACAhF,EAASrmB,cAAa,UAEjBqmB,EAASvmB,SC9FP,MAAA+jD,GAIXjmD,YACWqzC,EACAzqB,EACAW,EACA28B,GAHAxpD,KAAK22C,MAALA,EACA32C,KAAKksB,MAALA,EACAlsB,KAAY6sB,aAAZA,EACA7sB,KAAcwpD,eAAdA,EAGP/iD,UACF,OAAIohB,GAAY7nB,KAAKksB,OACZ,KAEA9E,GAAYpnB,KAAKksB,OAIxBk8B,UACF,OAAO,IAAIqB,GAAczpD,KAAK22C,MAAO32C,KAAKksB,OAGxCS,uBACF,MAAMnmB,EAAMm9B,GAA0B3jC,KAAK6sB,cACrCpf,EAAK6B,GAAkB9I,GAC7B,MAAc,OAAPiH,EAAc,UAAYA,EAM/B2e,mBACF,OAAOuX,GAA0B3jC,KAAK6sB,cAGxC68B,QAAQhhC,GAEN,MADAA,EAAQ1f,EAAmB0f,cACJ6gC,IACrB,OAAO,EAGT,MAAMI,EAAW3pD,KAAK22C,QAAUjuB,EAAMiuB,MAChCiT,EAAWnhC,GAAWzoB,KAAKksB,MAAOxD,EAAMwD,OACxC29B,EACJ7pD,KAAK2sB,mBAAqBjE,EAAMiE,iBAElC,OAAOg9B,GAAYC,GAAYC,EAGjCC,SACE,OAAO9pD,KAAKqM,WAGdA,WACE,OAAOrM,KAAK22C,MAAMtqC,WvD7ChB,SAAiC4a,GACrC,IAAItC,EAAa,GACjB,IAAK,IAAItlB,EAAI4nB,EAAKH,UAAWznB,EAAI4nB,EAAKL,QAAQtnB,OAAQD,IAC5B,KAApB4nB,EAAKL,QAAQvnB,KACfslB,GAAc,IAAM6f,mBAAmB3iC,OAAOolB,EAAKL,QAAQvnB,MAI/D,OAAOslB,GAAc,IuDqCYolC,CAAuB/pD,KAAKksB,QAO/D,SAAS89B,GAA8Bp1C,EAAkB/L,GACvD,IAA6B,IAAzB+L,EAAM40C,eACR,MAAM,IAAIxqD,MAAM6J,EAAS,+CAO7B,SAASohD,GAAuBl1C,GAC9B,IAAIm1C,EAAY,KACZC,EAAU,KAQd,GAPIp1C,EAAOsrB,aACT6pB,EAAYn1C,EAAOyrB,sBAEjBzrB,EAAO0rB,WACT0pB,EAAUp1C,EAAO6rB,oBAGf7rB,EAAO0Y,aAAeyE,GAAW,CACnC,MAAMk4B,EACJ,mGAEIC,EACJ,oIAEF,GAAIt1C,EAAOsrB,WAAY,CAErB,GADkBtrB,EAAOwrB,sBACPzxB,GAChB,MAAM,IAAI9P,MAAMorD,GACX,GAAyB,iBAAdF,EAChB,MAAM,IAAIlrD,MAAMqrD,GAGpB,GAAIt1C,EAAO0rB,SAAU,CAEnB,GADgB1rB,EAAO4rB,oBACP5xB,GACd,MAAM,IAAI/P,MAAMorD,GACX,GAAuB,iBAAZD,EAChB,MAAM,IAAInrD,MAAMqrD,SAGf,GAAIt1C,EAAO0Y,aAAeoK,IAC/B,GACgB,MAAbqyB,IAAsBzL,GAAgByL,IAC3B,MAAXC,IAAoB1L,GAAgB0L,GAErC,MAAM,IAAInrD,MACR,gMAWJ,GALAJ,EACEmW,EAAO0Y,qBAAsB+P,IAC3BzoB,EAAO0Y,aAAesQ,GACxB,uBAGc,MAAbmsB,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAE3B,MAAM,IAAInrD,MACR,oHAUR,SAASsrD,GAAcv1C,GACrB,GACEA,EAAOsrB,YACPtrB,EAAO0rB,UACP1rB,EAAOkuB,aACNluB,EAAOmuB,mBAER,MAAM,IAAIlkC,MACR,iIAQA,MAAOyqD,WAAsBF,GAEjCjmD,YAAYq+C,EAAY16B,GACtBX,MAAMq7B,EAAM16B,EAAM,IAAIib,IAAe,GAGnCkb,aACF,MAAMmN,EAAa/iC,GAAWxnB,KAAKksB,OACnC,OAAsB,OAAfq+B,EACH,KACA,IAAId,GAAczpD,KAAK22C,MAAO4T,GAGhCvxB,WACF,IAAIovB,EAAqBpoD,KACzB,KAAsB,OAAfooD,EAAIhL,QACTgL,EAAMA,EAAIhL,OAEZ,OAAOgL,GAkBE,MAAAoC,GAOXlnD,YACWmnD,EAIArC,EACAsC,GALA1qD,KAAKyqD,MAALA,EAIAzqD,KAAGooD,IAAHA,EACApoD,KAAM0qD,OAANA,EAWPp1B,eAEF,OAAOt1B,KAAKyqD,MAAM/0B,cAAcxoB,MAY9BzG,UACF,OAAOzG,KAAKooD,IAAI3hD,IAId2V,WACF,OAAOpc,KAAKyqD,MAAM5zB,cAepByE,MAAMrU,GACJ,MAAMkjB,EAAY,IAAI1jB,GAAKQ,GACrB0jC,EAAWrvB,GAAMt7B,KAAKooD,IAAKnhC,GACjC,OAAO,IAAIujC,GACTxqD,KAAKyqD,MAAMp0B,SAAS8T,GACpBwgB,EACA9yB,IAOJ+yB,SACE,OAAQ5qD,KAAKyqD,MAAM5jD,UAarByhD,YACE,OAAOtoD,KAAKyqD,MAAMv9C,KAAI,GAqBxBo3B,QAAQ5Y,GACN,GAAI1rB,KAAKyqD,MAAMh1B,aACb,OAAO,EAKT,QAFqBz1B,KAAKyqD,MAEJ3zB,aAAa92B,KAAK0qD,QAAQ,CAACjkD,EAAKwqB,IAC7CvF,EACL,IAAI8+B,GAAav5B,EAAMqK,GAAMt7B,KAAKooD,IAAK3hD,GAAMoxB,OAYnDvB,SAASrP,GACP,MAAMkjB,EAAY,IAAI1jB,GAAKQ,GAC3B,OAAQjnB,KAAKyqD,MAAMp0B,SAAS8T,GAAWtjC,UAezCgkD,cACE,OAAI7qD,KAAKyqD,MAAMh1B,eAGLz1B,KAAKyqD,MAAM5jD,UAOvBijD,SACE,OAAO9pD,KAAKsoD,YAedp7C,MACE,OAAOlN,KAAKyqD,MAAMv9C,OAkBN,SAAAk7C,GAAI0C,EAAc7jC,GAGhC,OAFA6jC,EAAK9hD,EAAmB8hD,IACrBC,iBAAiB,YACJ7nD,IAAT+jB,EAAqBqU,GAAMwvB,EAAGE,MAAO/jC,GAAQ6jC,EAAGE,MAmBzC,SAAAC,GAAWH,EAAchuC,IACvCguC,EAAK9hD,EAAmB8hD,IACrBC,iBAAiB,cACpB,MAAMG,EAAYpE,GAAchqC,EAAKguC,EAAGnU,MAAM91B,UAAU7M,WACxD4rC,GAAY,aAAcsL,GAE1B,MAAMp2C,EAAWo2C,EAAUp2C,SAgB3B,OAdGg2C,EAAGnU,MAAM91B,UAAUrM,gBACpBM,EAASlB,OAASk3C,EAAGnU,MAAM91B,UAAUjN,MAErCnF,GACE,qEAGEqG,EAASlB,KACT,iBACAk3C,EAAGnU,MAAM91B,UAAUjN,KACnB,KAICw0C,GAAI0C,EAAII,EAAUjkC,KAAK5a,YAahB,SAAAivB,GACd8hB,EACAn2B,GPjLoC,IACpCpe,EACA42C,EACA96B,EACAxS,EOqLA,OALmC,OAA/B6U,IADJo2B,EAASp0C,EAAmBo0C,IACJlxB,QPnLxBrjB,EOoLyB,QPnLzB42C,EOmLkC,OPjLlCttC,GOiLgD,GPlLhDwS,EOkL0CsC,KP7KxCtC,EAAaA,EAAWjiB,QAAQ,mBAAoB,MAGtDg9C,GAAmB72C,EAAQ42C,EAAc96B,EAAYxS,IO4KnDutC,GAAmB,QAAS,OAAQz4B,GAAM,GAErC,IAAIwiC,GAAcrM,EAAOzG,MAAOjvB,GAAU01B,EAAOlxB,MAAOjF,IAU3D,SAAU5P,GAAa+wC,GAE3B,OADAA,EAAMp/C,EAAmBo/C,GAClB,IAAIa,GAAab,EAAIzR,MAAOyR,EAAIl8B,OA8BzB,SAAA7qB,GACd+7C,EACAp6C,GAEAo6C,EAASp0C,EAAmBo0C,GAC5BuC,GAAqB,OAAQvC,EAAOlxB,OACpCwyB,GAAwB,OAAQ17C,EAAOo6C,EAAOlxB,OAAO,GACrD,MAAM9gB,EAAMw3C,GAAexF,EAAOzG,OAC5BvtC,EAAO60B,GAAW7yB,GAQlB+/C,EAAmD7vB,GACvD8hB,EACAh0C,GAEIgiD,EAAU9vB,GAAM8hB,EAAQh0C,GAE9B,IAAI5D,EASJ,OAPEA,EADW,MAATxC,EACQ6I,GAAIu/C,EAASpoD,GAAOoP,MAAK,IAAMg5C,IAE/B3lD,QAAQF,QAAQ6lD,GAG5BD,EAAiB/4C,KAAO5M,EAAQ4M,KAAK9D,KAAK9I,GAC1C2lD,EAAiBvlD,MAAQJ,EAAQ4M,KAAK9D,KAAK9I,OAAStC,GAC7CioD,EAiBH,SAAU/+C,GAAOg8C,GAErB,OADAzI,GAAqB,SAAUyI,EAAIl8B,OAC5BrgB,GAAIu8C,EAAK,MAgCF,SAAAv8C,GAAIu8C,EAAwBplD,GAC1ColD,EAAMp/C,EAAmBo/C,GACzBzI,GAAqB,MAAOyI,EAAIl8B,OAChCwyB,GAAwB,MAAO17C,EAAOolD,EAAIl8B,OAAO,GACjD,MAAMH,EAAW,IAAI1mB,EAQrB,OAPAq+C,GACE0E,EAAIzR,MACJyR,EAAIl8B,MACJlpB,EACc,KACd+oB,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAeF,SAAA6lD,GACdjD,EACA9yB,GAEA8yB,EAAMp/C,EAAmBo/C,GACzBzI,GAAqB,cAAeyI,EAAIl8B,OACxCqzB,GAAiB,cAAejqB,GAAU,GAC1C,MAAMvJ,EAAW,IAAI1mB,EAQrB,OAPAq+C,GACE0E,EAAIzR,MACJjvB,GAAU0gC,EAAIl8B,MAAO,aACrBoJ,EACA,KACAvJ,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAkBF,SAAA2jD,GACdf,EACAplD,EACAsyB,GAKA,GAHAqqB,GAAqB,kBAAmByI,EAAIl8B,OAC5CwyB,GAAwB,kBAAmB17C,EAAOolD,EAAIl8B,OAAO,GAC7DqzB,GAAiB,kBAAmBjqB,GAAU,GAC9B,YAAZ8yB,EAAI3hD,KAAiC,UAAZ2hD,EAAI3hD,IAC/B,KAAM,2BAA6B2hD,EAAI3hD,IAAM,0BAG/C,MAAMslB,EAAW,IAAI1mB,EAQrB,OAPAq+C,GACE0E,EAAIzR,MACJyR,EAAIl8B,MACJlpB,EACAsyB,EACAvJ,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAsCF,SAAA6C,GAAO+/C,EAAwBr3B,GAC7CmuB,GAA6B,SAAUnuB,EAAQq3B,EAAIl8B,OAAO,GAC1D,MAAMH,EAAW,IAAI1mB,EAOrB,OL1MI,SACJs8C,EACA16B,EACAoiC,EACAzkC,GAEAw+B,GAAQzB,EAAM,SAAU,CAAE16B,KAAMA,EAAK5a,WAAYrJ,MAAOqmD,IAGxD,IAAIjd,GAAQ,EACZ,MAAMmQ,EAAesG,GAAyBlB,GACxClQ,EAAyC,GAW/C,GAVA3hC,GAAKu5C,GAAiB,CAACiC,EAAoBC,KACzCnf,GAAQ,EACRqF,EAAgB6Z,GAAczO,GAC5Bn1B,GAAUT,EAAMqkC,GAChB11B,GAAa21B,GACb5J,EAAKgB,gBACLpG,MAICnQ,EA6CH7+B,EAAI,wDACJw2C,GAA2BpC,EAAM/8B,EAAY,UAAM1hB,OA9CzC,CACV,MAAMgqC,EAAUuW,GAAmB9B,GAC7BrZ,EAASuP,GACb8J,EAAKgB,gBACL17B,EACAwqB,EACAvE,GAEFgT,GAAsByB,EAAKN,YAAa/Y,GACxCqZ,EAAKxb,QAAQrhB,MACXmC,EAAK5a,WACLg9C,GACA,CAACj8B,EAAQ2B,KACP,MAAM80B,EAAqB,OAAXz2B,EACXy2B,GACHl/C,GAAK,aAAesiB,EAAO,YAAcmG,GAG3C,MAAM02B,EAAc7L,GAClB0J,EAAKgB,gBACLzV,GACC2W,GAEG1kB,EACJ2kB,EAAYxkD,OAAS,EAAI6jD,GAAsBxB,EAAM16B,GAAQA,EAC/Dy5B,GACEiB,EAAKN,YACLliB,EACA2kB,GAEFC,GAA2BpC,EAAM/8B,EAAYwI,EAAQ2B,MAIzDjf,GAAKu5C,GAAkB1I,IACrB,MAAMxhB,EAAeokB,GACnB5B,EACAj6B,GAAUT,EAAM05B,IAElBwC,GAAsBxB,EAAMxiB,MAI9BuhB,GAAoCiB,EAAKN,YAAap6B,EAAM,KKmI9DukC,CACEpD,EAAIzR,MACJyR,EAAIl8B,MACJ6E,EACAhF,EAASrmB,cAAa,UAEjBqmB,EAASvmB,QAWZ,SAAUyG,GAAI2I,GAClBA,EAAQ5L,EAAmB4L,GAC3B,MAAM62C,EAAkB,IAAIjD,IAAgB,SACtCkD,EAAY,IAAIC,GAAuBF,GAC7C,OL7Vc,SACd9J,EACA/sC,EACA+/B,GAGA,MAAMiX,EAAS1Q,GAAuByG,EAAKgB,gBAAiB/tC,GAC5D,OAAc,MAAVg3C,EACKnmD,QAAQF,QAAQqmD,GAElBjK,EAAKxb,QAAQl6B,IAAI2I,GAAOxC,MAC7BuR,IACE,MAAMsN,EAAO2E,GAAajS,GAAS+T,UACjC9iB,EAAMiY,aAAaY,YAerB,IAAI6a,EACJ,GAPAgS,GACEqH,EAAKgB,gBACL/tC,EACA+/B,GACA,GAGE//B,EAAMiY,aAAaE,eACrBub,EAAS8P,GACPuJ,EAAKgB,gBACL/tC,EAAMsX,MACN+E,OAEG,CACL,MAAMxE,EAAM6sB,GAAoBqI,EAAKgB,gBAAiB/tC,GACtD0zB,EAAS0R,GACP2H,EAAKgB,gBACL/tC,EAAMsX,MACN+E,EACAxE,GAyBJ,OAZAi0B,GACEiB,EAAKN,YACLzsC,EAAMsX,MACNoc,GAEF+P,GACEsJ,EAAKgB,gBACL/tC,EACA+/B,EACA,MACA,GAEK1jB,KAET46B,IACEzI,GAAQzB,EAAM,iBAAmB77C,EAAU8O,GAAS,YAAci3C,GAC3DpmD,QAAQH,OAAO,IAAItG,MAAM6sD,OKuR7BC,CAAal3C,EAAM+hC,MAAO/hC,EAAO82C,GAAWt5C,MAAK6e,GAC/C,IAAIu5B,GACTv5B,EACA,IAAIw4B,GAAc70C,EAAM+hC,MAAO/hC,EAAMsX,OACrCtX,EAAMiY,aAAaY,cAOZ,MAAAk+B,GACXroD,YAAoBmoD,GAAAzrD,KAAeyrD,gBAAfA,EAEpBriB,WAAW1jB,GACT,MAAqB,UAAdA,EAGT2jB,YAAYT,EAAgBh0B,GAC1B,MAAMyX,EAAQzX,EAAMiY,aAAaY,WACjC,OAAO,IAAIy6B,GACT,QACAloD,KACA,IAAIwqD,GACF5hB,EAAOjK,aACP,IAAI8qB,GAAc70C,EAAM+hC,MAAO/hC,EAAMsX,OACrCG,IAKN20B,eAAej7B,GACb,MAAiC,WAA7BA,EAAUsiC,eACL,IACLroD,KAAKyrD,gBAAgB3C,SAAU/iC,EAA0BjjB,OAEpD,IACL9C,KAAKyrD,gBAAgB9C,QAAS5iC,EAAwBoiC,SAAU,MAItEpT,kBAAkBjyC,EAAcmkB,GAC9B,OAAIjnB,KAAKyrD,gBAAgB1C,kBAChB,IAAIR,GAAYvoD,KAAM8C,EAAOmkB,GAE7B,KAIXkZ,QAAQzX,GACN,OAAMA,aAAiBijC,MAEXjjC,EAAM+iC,kBAAoBzrD,KAAKyrD,iBAIlC/iC,EAAM+iC,gBAAgBtrB,QAAQngC,KAAKyrD,kBAI9CvW,iBACE,OAAgC,OAAzBl1C,KAAKyrD,iBAOH,MAAAM,GACXzoD,YACUoiB,EACA+lC,GADAzrD,KAAS0lB,UAATA,EACA1lB,KAAeyrD,gBAAfA,EAGVriB,WAAW1jB,GACT,IAAIsmC,EACY,mBAAdtmC,EAAiC,cAAgBA,EAGnD,OAFAsmC,EACmB,qBAAjBA,EAAsC,gBAAkBA,EACnDhsD,KAAK0lB,YAAcsmC,EAG5BjX,kBAAkBjyC,EAAcmkB,GAC9B,OAAIjnB,KAAKyrD,gBAAgB1C,kBAChB,IAAIR,GAAYvoD,KAAM8C,EAAOmkB,GAE7B,KAIXoiB,YAAYT,EAAgBh0B,GAC1BhW,EAA2B,MAApBgqC,EAAOxS,UAAmB,yCACjC,MAAMu0B,EAAWrvB,GACf,IAAImuB,GAAc70C,EAAM+hC,MAAO/hC,EAAMsX,OACrC0c,EAAOxS,WAEH/J,EAAQzX,EAAMiY,aAAaY,WACjC,OAAO,IAAIy6B,GACTtf,EAAOt/B,KACPtJ,KACA,IAAIwqD,GAAa5hB,EAAOjK,aAAcgsB,EAAUt+B,GAChDuc,EAAOK,UAIX+X,eAAej7B,GACb,MAAiC,WAA7BA,EAAUsiC,eACL,IACLroD,KAAKyrD,gBAAgB3C,SAAU/iC,EAA0BjjB,OAEpD,IACL9C,KAAKyrD,gBAAgB9C,QAClB5iC,EAAwBoiC,SACxBpiC,EAAwBkjB,UAKjC9I,QAAQzX,GACN,OAAIA,aAAiBqjC,KAEjB/rD,KAAK0lB,YAAcgD,EAAMhD,aACvB1lB,KAAKyrD,kBACJ/iC,EAAM+iC,iBACPzrD,KAAKyrD,gBAAgBtrB,QAAQzX,EAAM+iC,mBAO3CvW,iBACE,QAASl1C,KAAKyrD,iBAIlB,SAASzzC,GACPpD,EACA8Q,EACA/f,EACAsmD,EACA7tC,GAEA,IAAIsqC,EASJ,GAR6C,iBAAlCuD,IACTvD,OAAiBxlD,EACjBkb,EAAU6tC,GAEiC,mBAAlCA,IACTvD,EAAiBuD,GAGf7tC,GAAWA,EAAQ8tC,SAAU,CAC/B,MAAMlD,EAAerjD,EACfwmD,EAA6B,CAACC,EAAcvD,KAChD3E,GAAgCtvC,EAAM+hC,MAAO/hC,EAAO82C,GACpD1C,EAAaoD,EAAcvD,IAE7BsD,EAAanD,aAAerjD,EAASqjD,aACrCmD,EAAavmC,QAAUjgB,EAASigB,QAChCjgB,EAAWwmD,EAGb,MAAMV,EAAkB,IAAIjD,GAC1B7iD,EACA+iD,QAAkBxlD,GAEdwoD,EACU,UAAdhmC,EACI,IAAIimC,GAAuBF,GAC3B,IAAIM,GAAuBrmC,EAAW+lC,GAE5C,OLnMc,SACd9J,EACA/sC,EACA+/B,GAEA,IAAIrM,EAEFA,EADgC,UAA9BthB,GAAapS,EAAMsX,OACZouB,GACPqH,EAAKc,cACL7tC,EACA+/B,GAGO2F,GACPqH,EAAKgB,gBACL/tC,EACA+/B,GAGJ4L,GAA4BoB,EAAKN,YAAazsC,EAAMsX,MAAOoc,GK+K3D+jB,CAA6Bz3C,EAAM+hC,MAAO/hC,EAAO82C,GAC1C,IAAMxH,GAAgCtvC,EAAM+hC,MAAO/hC,EAAO82C,GAmG7D,SAAU/C,GACd/zC,EACAjP,EACAsmD,EACA7tC,GAEA,OAAOpG,GACLpD,EACA,QACAjP,EACAsmD,EACA7tC,GAgHE,SAAUkuC,GACd13C,EACAjP,EAIAsmD,EACA7tC,GAEA,OAAOpG,GACLpD,EACA,cACAjP,EACAsmD,EACA7tC,GAmHE,SAAUmuC,GACd33C,EACAjP,EAIAsmD,EACA7tC,GAEA,OAAOpG,GACLpD,EACA,gBACAjP,EACAsmD,EACA7tC,GA6GE,SAAUouC,GACd53C,EACAjP,EAIAsmD,EACA7tC,GAEA,OAAOpG,GACLpD,EACA,cACAjP,EACAsmD,EACA7tC,GAgHE,SAAUquC,GACd73C,EACAjP,EACAsmD,EACA7tC,GAEA,OAAOpG,GACLpD,EACA,gBACAjP,EACAsmD,EACA7tC,GA6BY,SAAA6H,GACdrR,EACA8Q,EACA/f,GAKA,IAAI+lD,EAAsC,KAC1C,MAAMgB,EAAc/mD,EAAW,IAAI6iD,GAAgB7iD,GAAY,KAC7C,UAAd+f,EACFgmC,EAAY,IAAIC,GAAuBe,GAC9BhnC,IACTgmC,EAAY,IAAIK,GAAuBrmC,EAAWgnC,IAEpDxI,GAAgCtvC,EAAM+hC,MAAO/hC,EAAO82C,GA2BhC,MAAAiB,IAWtB,MAAMC,WAA6BD,GAGjCrpD,YACmBupD,EACA9T,GAEjBzyB,QAHiBtmB,KAAM6sD,OAANA,EACA7sD,KAAI+4C,KAAJA,EAKnB+T,OAAUl4C,GACR8pC,GAAwB,QAAS1+C,KAAK6sD,OAAQj4C,EAAMsX,OAAO,GAC3D,MAAMmX,EAAYC,GAChB1uB,EAAMiY,aACN7sB,KAAK6sD,OACL7sD,KAAK+4C,MAIP,GAFAuR,GAAcjnB,GACd4mB,GAAuB5mB,GACnBzuB,EAAMiY,aAAa4T,SACrB,MAAM,IAAIzhC,MACR,2FAIJ,OAAO,IAAIuqD,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,EACAzuB,EAAM40C,iBA4BI,SAAAuD,GACd/pD,EACAyD,GAGA,OADA+4C,GAAY,QAAS,MAAO/4C,GAAK,GAC1B,IAAImmD,GAAqB5pD,EAAOyD,GAGzC,MAAMumD,WAAiCL,GAGrCrpD,YACmBupD,EACA9T,GAEjBzyB,QAHiBtmB,KAAM6sD,OAANA,EACA7sD,KAAI+4C,KAAJA,EAKnB+T,OAAUl4C,GACR8pC,GAAwB,YAAa1+C,KAAK6sD,OAAQj4C,EAAMsX,OAAO,GAC/D,MAAMmX,EjC/5CM,SACdD,EACAnR,EACAxrB,GAEA,IAAI86B,EACAxsB,EAeJ,OAdIquB,EAAYnE,SAAW/M,IACC,iBAAfD,IACTA,EAAa+J,GAAY/J,IAE3Bld,EAASuuB,GAAiBF,EAAanR,EAAYxrB,KAGjD86B,EADS,MAAP96B,EACSqI,GAEAktB,GAAYv1B,GAEzBsO,EAASuuB,GAAiBF,EAAanR,EAAYsP,IAErDxsB,EAAO0tB,eAAgB,EAChB1tB,EiC04Cak4C,CAChBr4C,EAAMiY,aACN7sB,KAAK6sD,OACL7sD,KAAK+4C,MAIP,GAFAuR,GAAcjnB,GACd4mB,GAAuB5mB,GACnBzuB,EAAMiY,aAAa4T,SACrB,MAAM,IAAIzhC,MACR,+FAIJ,OAAO,IAAIuqD,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,EACAzuB,EAAM40C,iBAwBI,SAAA0D,GACdlqD,EACAyD,GAGA,OADA+4C,GAAY,YAAa,MAAO/4C,GAAK,GAC9B,IAAIumD,GAAyBhqD,EAAOyD,GAG7C,MAAM0mD,WAA+BR,GAGnCrpD,YACmBupD,EACA9T,GAEjBzyB,QAHiBtmB,KAAM6sD,OAANA,EACA7sD,KAAI+4C,KAAJA,EAKnB+T,OAAUl4C,GACR8pC,GAAwB,UAAW1+C,KAAK6sD,OAAQj4C,EAAMsX,OAAO,GAC7D,MAAMmX,EAAYF,GAChBvuB,EAAMiY,aACN7sB,KAAK6sD,OACL7sD,KAAK+4C,MAIP,GAFAuR,GAAcjnB,GACd4mB,GAAuB5mB,GACnBzuB,EAAMiY,aAAawT,WACrB,MAAM,IAAIrhC,MACR,iGAIJ,OAAO,IAAIuqD,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,EACAzuB,EAAM40C,iBA2BI,SAAA4D,GACdpqD,EAA0C,KAC1CyD,GAGA,OADA+4C,GAAY,UAAW,MAAO/4C,GAAK,GAC5B,IAAI0mD,GAAuBnqD,EAAOyD,GAG3C,MAAM4mD,WAAkCV,GAGtCrpD,YACmBupD,EACA9T,GAEjBzyB,QAHiBtmB,KAAM6sD,OAANA,EACA7sD,KAAI+4C,KAAJA,EAKnB+T,OAAUl4C,GACR8pC,GAAwB,aAAc1+C,KAAK6sD,OAAQj4C,EAAMsX,OAAO,GAChE,MAAMmX,EjCzkDM,SACdD,EACAnR,EACAxrB,GAEA,IAAIsO,EACJ,GAAIquB,EAAYnE,SAAW/M,GACC,iBAAfD,IACTA,EAAaqM,GAAUrM,IAEzBld,EAASouB,GAAmBC,EAAanR,EAAYxrB,OAChD,CACL,IAAI86B,EAEFA,EADS,MAAP96B,EACSsI,GAEAuvB,GAAU73B,GAEvBsO,EAASouB,GAAmBC,EAAanR,EAAYsP,GAGvD,OADAxsB,EAAOutB,gBAAiB,EACjBvtB,EiCojDau4C,CAChB14C,EAAMiY,aACN7sB,KAAK6sD,OACL7sD,KAAK+4C,MAIP,GAFAuR,GAAcjnB,GACd4mB,GAAuB5mB,GACnBzuB,EAAMiY,aAAawT,WACrB,MAAM,IAAIrhC,MACR,oGAIJ,OAAO,IAAIuqD,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,EACAzuB,EAAM40C,iBAuBI,SAAA+D,GACdvqD,EACAyD,GAGA,OADA+4C,GAAY,aAAc,MAAO/4C,GAAK,GAC/B,IAAI4mD,GAA0BrqD,EAAOyD,GAG9C,MAAM+mD,WAAoCb,GAGxCrpD,YAA6BmqD,GAC3BnnC,QAD2BtmB,KAAMytD,OAANA,EAI7BX,OAAUl4C,GACR,GAAIA,EAAMiY,aAAaoW,WACrB,MAAM,IAAIjkC,MACR,yFAIJ,OAAO,IAAIuqD,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MjCprDI,SACdkX,EACAsqB,GAEA,MAAMrqB,EAAYD,EAAYlQ,OAI9B,OAHAmQ,EAAUlB,WAAY,EACtBkB,EAAUtC,OAAS2sB,EACnBrqB,EAAUX,UAAS,IACZW,EiC6qDHsqB,CAAwB/4C,EAAMiY,aAAc7sB,KAAKytD,QACjD74C,EAAM40C,iBAuBN,SAAUoE,GAAaC,GAC3B,GAAqB,iBAAVA,GAAsBx9C,KAAKI,MAAMo9C,KAAWA,GAASA,GAAS,EACvE,MAAM,IAAI7uD,MAAM,4DAElB,OAAO,IAAIwuD,GAA4BK,GAGzC,MAAMC,WAAmCnB,GAGvCrpD,YAA6BmqD,GAC3BnnC,QAD2BtmB,KAAMytD,OAANA,EAI7BX,OAAUl4C,GACR,GAAIA,EAAMiY,aAAaoW,WACrB,MAAM,IAAIjkC,MACR,wFAIJ,OAAO,IAAIuqD,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MjCztDI,SACdkX,EACAsqB,GAEA,MAAMrqB,EAAYD,EAAYlQ,OAI9B,OAHAmQ,EAAUlB,WAAY,EACtBkB,EAAUtC,OAAS2sB,EACnBrqB,EAAUX,UAAS,IACZW,EiCktDH0qB,CAAuBn5C,EAAMiY,aAAc7sB,KAAKytD,QAChD74C,EAAM40C,iBAuBN,SAAUwE,GAAYH,GAC1B,GAAqB,iBAAVA,GAAsBx9C,KAAKI,MAAMo9C,KAAWA,GAASA,GAAS,EACvE,MAAM,IAAI7uD,MAAM,2DAGlB,OAAO,IAAI8uD,GAA2BD,GAGxC,MAAMI,WAAoCtB,GAGxCrpD,YAA6B4oB,GAC3B5F,QAD2BtmB,KAAKksB,MAALA,EAI7B4gC,OAAUl4C,GACRo1C,GAA8Bp1C,EAAO,gBACrC,MAAMs5C,EAAa,IAAIznC,GAAKzmB,KAAKksB,OACjC,GAAIrE,GAAYqmC,GACd,MAAM,IAAIlvD,MACR,wEAGJ,MAAMqtB,EAAQ,IAAImR,GAAU0wB,GACtB7qB,EAAYE,GAAmB3uB,EAAMiY,aAAcR,GAGzD,OAFA49B,GAAuB5mB,GAEhB,IAAIkmB,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,GACmB,IAsBnB,SAAU8qB,GAAalnC,GAC3B,GAAa,SAATA,EACF,MAAM,IAAIjoB,MACR,+DAEG,GAAa,cAATioB,EACT,MAAM,IAAIjoB,MACR,yEAEG,GAAa,WAATioB,EACT,MAAM,IAAIjoB,MACR,mEAIJ,OADA0gD,GAAmB,eAAgB,OAAQz4B,GAAM,GAC1C,IAAIgnC,GAA4BhnC,GAGzC,MAAMmnC,WAAkCzB,GAGtCG,OAAUl4C,GACRo1C,GAA8Bp1C,EAAO,cACrC,MAAMyuB,EAAYE,GAAmB3uB,EAAMiY,aAAcqF,IAEzD,OADA+3B,GAAuB5mB,GAChB,IAAIkmB,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,GACmB,IAaT,SAAAgrB,KACd,OAAO,IAAID,GAGb,MAAME,WAAuC3B,GAG3CG,OAAUl4C,GACRo1C,GAA8Bp1C,EAAO,mBACrC,MAAMyuB,EAAYE,GAAmB3uB,EAAMiY,aAAcgL,IAEzD,OADAoyB,GAAuB5mB,GAChB,IAAIkmB,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,GACmB,IAaT,SAAAkrB,KACd,OAAO,IAAID,GAGb,MAAME,WAAoC7B,GAGxCG,OAAUl4C,GACRo1C,GAA8Bp1C,EAAO,gBACrC,MAAMyuB,EAAYE,GAAmB3uB,EAAMiY,aAAckR,IAEzD,OADAksB,GAAuB5mB,GAChB,IAAIkmB,GACT30C,EAAM+hC,MACN/hC,EAAMsX,MACNmX,GACmB,IAcT,SAAAorB,KACd,OAAO,IAAID,GAGb,MAAME,WAAoC/B,GAGxCrpD,YACmBupD,EACA9T,GAEjBzyB,QAHiBtmB,KAAM6sD,OAANA,EACA7sD,KAAI+4C,KAAJA,EAKnB+T,OAAUl4C,GAER,GADA8pC,GAAwB,UAAW1+C,KAAK6sD,OAAQj4C,EAAMsX,OAAO,GACzDtX,EAAMiY,aAAawT,WACrB,MAAM,IAAIrhC,MACR,+FAIJ,GAAI4V,EAAMiY,aAAa4T,SACrB,MAAM,IAAIzhC,MACR,0FAIJ,OAAO,IAAI4tD,GAAqB5sD,KAAK6sD,OAAQ7sD,KAAK+4C,MAAM+T,OACtD,IAAIK,GAAuBntD,KAAK6sD,OAAQ7sD,KAAK+4C,MAAM+T,OAAOl4C,KA4BhD,SAAA+5C,GACd3rD,EACAyD,GAGA,OADA+4C,GAAY,UAAW,MAAO/4C,GAAK,GAC5B,IAAIioD,GAA4B1rD,EAAOyD,GAYhC,SAAAmO,GACdA,KACGg6C,GAEH,IAAIC,EAAY7lD,EAAmB4L,GACnC,IAAK,MAAMk6C,KAAcF,EACvBC,EAAYC,EAAWhC,OAAO+B,GAEhC,OAAOA,GXxoEH,SACJ3hD,GAEAtO,GACG62C,GACD,mDAEFA,GAAuBvoC,EW0oEzB6hD,CAAiCtF,IVxoE3B,SACJv8C,GAEAtO,GACG62C,GACD,mDAEFA,GAAuBvoC,EUkoEzB8hD,CAAgCvF,ICnpEhC,MAKMwF,GAIF,GAKJ,IAAIC,IAAgB,EA8Bd,SAAUC,GACdC,EACAC,EACAr9C,EACA8K,EACA9I,GAEA,IAAIs7C,EAA4BxyC,GAAOsyC,EAAIhxC,QAAQmxC,iBACrCrsD,IAAVosD,IACGF,EAAIhxC,QAAQoxC,WACf/gD,GACE,kHAKJlB,EAAI,kCAAmC6hD,EAAIhxC,QAAQoxC,WACnDF,EAAQ,GAAGF,EAAIhxC,QAAQoxC,yCAGzB,IAGIC,EAEAC,EALA7P,EAAYiH,GAAcwI,EAAOt7C,GACjCc,EAAW+qC,EAAU/qC,SAKF,oBAAZxQ,SAA2BA,QAAQE,MAC5CkrD,EAAiBprD,QAAQE,IAAuC,iCAG9DkrD,GACFD,GAAa,EACbH,EAAQ,UAAUI,QAAqB56C,EAAShB,YAChD+rC,EAAYiH,GAAcwI,EAAOt7C,GACjCc,EAAW+qC,EAAU/qC,UAErB26C,GAAc5P,EAAU/qC,SAASjB,OAGnC,MAAM87C,EACJ37C,GAAay7C,EACT,IAAIl8C,GAAsBA,GAAsBE,OAChD,IAAIb,GAA0Bw8C,EAAIhmD,KAAMgmD,EAAIhxC,QAASixC,GAE3DzP,GAAY,gCAAiCC,GACxCh4B,GAAYg4B,EAAU54B,OACzBxY,GACE,4FAKJ,MAAMkzC,EA8BR,SACE7sC,EACAs6C,EACAO,EACA39C,GAEA,IAAI49C,EAAWX,GAAMG,EAAIhmD,MAEpBwmD,IACHA,EAAW,GACXX,GAAMG,EAAIhmD,MAAQwmD,GAGpB,IAAIjO,EAAOiO,EAAS96C,EAASJ,eACzBitC,GACFlzC,GACE,2HAMJ,OAHAkzC,EAAO,IAAIV,GAAKnsC,EAAUo6C,GAAeS,EAAmB39C,GAC5D49C,EAAS96C,EAASJ,eAAiBitC,EAE5BA,EApDMkO,CACX/6C,EACAs6C,EACAO,EACA,IAAI79C,GAAsBs9C,EAAIhmD,KAAM4I,IAEtC,OAAO,IAAI89C,GAASnO,EAAMyN,GA2Df,MAAAU,GAWXxsD,YACSysD,EAEEX,GAFFpvD,KAAa+vD,cAAbA,EAEE/vD,KAAGovD,IAAHA,EAZFpvD,KAAM,KAAG,WAGlBA,KAAgBgwD,kBAAY,EAYxBrZ,YASF,OARK32C,KAAKgwD,mBACRtO,GACE1hD,KAAK+vD,cACL/vD,KAAKovD,IAAIhxC,QAAQwjC,MACjB5hD,KAAKovD,IAAIhxC,QAAsC,8BAEjDpe,KAAKgwD,kBAAmB,GAEnBhwD,KAAK+vD,cAGV/E,YAIF,OAHKhrD,KAAKiwD,gBACRjwD,KAAKiwD,cAAgB,IAAIxG,GAAczpD,KAAK22C,MAAO5vB,OAE9C/mB,KAAKiwD,cAGdC,UAME,OAL2B,OAAvBlwD,KAAKiwD,iBAzFb,SAA+BtO,EAAYwO,GACzC,MAAMP,EAAWX,GAAMkB,GAElBP,GAAYA,EAASjO,EAAKl7C,OAASk7C,GACtClzC,GAAM,YAAY0hD,KAAWxO,EAAK9gC,wCAEpCsjC,GAAcxC,UACPiO,EAASjO,EAAKl7C,KAmFjB2pD,CAAsBpwD,KAAK22C,MAAO32C,KAAKovD,IAAIhmD,MAC3CpJ,KAAK+vD,cAAgB,KACrB/vD,KAAKiwD,cAAgB,MAEhBxqD,QAAQF,UAGjBwlD,iBAAiBsF,GACY,OAAvBrwD,KAAKiwD,eACPxhD,GAAM,eAAiB4hD,EAAU,4BAKvC,SAASC,KACHvwC,GAAiBG,0BACnBvb,GACE,iHAQU,SAAA4rD,KACdD,KACAh6C,GAAsBk6C,gBAMR,SAAAC,KACdH,KACAvyC,GAAoByyC,gBACpBl6C,GAAsBo6C,aAeR,SAAAC,GACdvB,EAAmBwB,IACnB9zC,GAEA,MAAMguC,EAAK+F,EAAazB,EAAK,YAAYl9C,aAAa,CACpD4+C,WAAYh0C,IAERi0C,GtFhNNC,EsFgNoD,WtF/MD,QAA5BC,EAAe,QAAfx+C,EAAApO,WAAe,IAAAoO,OAAA,EAAAA,EAAAy+C,qBAAa,IAAAD,OAAA,EAAAA,EAAGD,IAFlB,IACpCA,EACuBv+C,EAAAw+C,EsFgNvB,GAAIF,EAAsB,CACxB,MAAOn9C,EAAMuzC,GAAQ4J,EAAqBzqD,MAAM,KAChD6qD,GAAwBrG,EAAIl3C,EAAM5C,SAASm2C,EAAM,KAEnD,OAAO2D,EAcH,SAAUqG,GACdrG,EACAl3C,EACAuzC,EACA/oC,EAEI,KAEJ0sC,EAAK9hD,EAAmB8hD,IACrBC,iBAAiB,eAChBD,EAAGkF,kBACLvhD,GACE,0EAIJ,MAAMkzC,EAAOmJ,EAAGiF,cAChB,IAAIqB,EACJ,GAAIzP,EAAK9gC,UAAU7M,UACboK,EAAQizC,eACV5iD,GACE,sJAGJ2iD,EAAgB,IAAI79C,GAAsBA,GAAsBE,YAC3D,GAAI2K,EAAQizC,cAAe,CAChC,MAAMprD,EAC6B,iBAA1BmY,EAAQizC,cACXjzC,EAAQizC,cCnRF,SACdprD,EACAupD,GAEA,GAAIvpD,EAAMqrD,IACR,MAAM,IAAItyD,MACR,gHAIJ,MAKMuyD,EAAU/B,GAAa,eACvBgC,EAAMvrD,EAAMurD,KAAO,EACnBC,EAAMxrD,EAAMwrD,KAAOxrD,EAAMyrD,QAC/B,IAAKD,EACH,MAAM,IAAIzyD,MAAM,wDAGlB,MAAM2kB,EAAOtgB,OAAAu3B,OAAA,CAEX+2B,IAAK,kCAAkCJ,IACvCK,IAAKL,EACLC,IAAAA,EACAK,IAAKL,EAAM,KACXM,UAAWN,EACXC,IAAAA,EACAC,QAASD,EACTM,SAAU,CACRC,iBAAkB,SAClBC,WAAY,KAIXhsD,GAKL,MAAO,CACLxD,EAA8BmC,KAAKkB,UAjCtB,CACbosD,IAAK,OACL5oD,KAAM,SAgCN7G,EAA8BmC,KAAKkB,UAAU6d,IAH7B,IAKhBriB,KAAK,KDsOC6wD,CAAoB/zC,EAAQizC,cAAevG,EAAGsE,IAAIhxC,QAAQoxC,WAChE4B,EAAgB,IAAI79C,GAAsBtN,IA/R9C,SACE07C,EACA/tC,EACAuzC,EACAiK,GAEAzP,EAAK9gC,UAAY,IAAIlN,GACnB,GAAGC,KAAQuzC,KACG,EACdxF,EAAK9gC,UAAU/M,UACf6tC,EAAK9gC,UAAU9M,cACf4tC,EAAK9gC,UAAU7M,UACf2tC,EAAK9gC,UAAU5M,eACf0tC,EAAK9gC,UAAU3M,+BAGbk9C,IACFzP,EAAK93B,mBAAqBunC,GAkR5BgB,CAAiCzQ,EAAM/tC,EAAMuzC,EAAMiK,GAwB/C,SAAUiB,GAAUvH,IACxBA,EAAK9hD,EAAmB8hD,IACrBC,iBAAiB,aACpB5G,GAAc2G,EAAGnU,OAcb,SAAU2b,GAASxH,GNyanB,IAAqBnJ,GMxazBmJ,EAAK9hD,EAAmB8hD,IACrBC,iBAAiB,aNuaKpJ,EMtadmJ,EAAGnU,ONuaL8K,uBACPE,EAAKF,sBAAsBjxB,OA7tBN,kBMwUT,SAAAriB,GACdF,EACAI,GAEAkkD,EAAkBtkD,EAAQI,GEza5B,MAAMmkD,GAAmB,CACvB,MAAO,aAQO,SAAAC,KACd,OAAOD,GAUH,SAAUE,GAAUjiC,GACxB,MAAO,CACL,MAAO,CACLiiC,UAAajiC,ICCN,MAAAkiC,GAEXrvD,YAEWsvD,EAEAzK,GAFAnoD,KAAS4yD,UAATA,EAEA5yD,KAAQmoD,SAARA,EAIX2B,SACE,MAAO,CAAE8I,UAAW5yD,KAAK4yD,UAAWzK,SAAUnoD,KAAKmoD,SAAS2B,WAyC1D,SAAU+I,GACdzK,EAEA0K,EACA10C,SAMA,GAJAgqC,EAAMp/C,EAAmBo/C,GAEzBzI,GAAqB,wBAAyByI,EAAIl8B,OAElC,YAAZk8B,EAAI3hD,KAAiC,UAAZ2hD,EAAI3hD,IAC/B,KACE,iCAAmC2hD,EAAI3hD,IAAM,0BAIjD,MAAM0/C,EAAwC,QAAzB1zC,EAAA2L,MAAAA,OAAA,EAAAA,EAAS+nC,oBAAgB,IAAA1zC,GAAAA,EACxCsZ,EAAW,IAAI1mB,EAqBfmgD,EAAYmD,GAAQP,GAAK,SAW/B,OTmxBc,SACdzG,EACA16B,EACA6rC,EACAluC,EACA4gC,EACAW,GAEA/C,GAAQzB,EAAM,kBAAoB16B,GAGlC,MAAM09B,EAA2B,CAC/B19B,KAAAA,EACA5e,OAAQyqD,EACRluC,WAAAA,EAEAwI,OAAQ,KAGRo5B,MAAOh5C,IAEP24C,aAAAA,EAEAjB,WAAY,EAEZM,UAAAA,EAEAC,YAAa,KACbX,eAAgB,KAChBiB,qBAAsB,KACtBZ,yBAA0B,KAC1BI,8BAA+B,MAI3BwN,EAAe3O,GAAmBzC,EAAM16B,OAAM/jB,GACpDyhD,EAAYoB,qBAAuBgN,EACnC,MAAMpP,EAASgB,EAAYt8C,OAAO0qD,EAAa7lD,OAC/C,QAAehK,IAAXygD,EAEFgB,EAAYa,YACZb,EAAYQ,yBAA2B,KACvCR,EAAYY,8BAAgC,KACxCZ,EAAY//B,YACd+/B,EAAY//B,WAAW,MAAM,EAAO+/B,EAAYoB,0BAE7C,CACLpH,GACE,qCACAgF,EACAgB,EAAY19B,MAId09B,EAAYv3B,OAAM,EAClB,MAAM4lC,EAAY1V,GAAYqE,EAAKH,sBAAuBv6B,GACpDw/B,EAAYjJ,GAAawV,IAAc,GAS7C,IAAIC,EARJxM,EAAUplD,KAAKsjD,GAEflH,GAAauV,EAAWvM,GAQJ,iBAAX9C,GACI,OAAXA,GACAp9C,EAASo9C,EAAQ,cAGjBsP,EAAkBrsD,EAAQ+8C,EAAe,aACzC/kD,EACE6/C,GAAgBwU,GAChB,qHAOFA,GAFEhY,GAA+B0G,EAAKgB,gBAAiB17B,IACrDkU,GAAalI,YACeyC,cAAcxoB,MAG9C,MAAMqvC,EAAesG,GAAyBlB,GACxCiC,EAAoBhuB,GAAa+tB,EAAQsP,GACzC1hC,EAAUwrB,GACd6G,EACAmP,EACAxW,GAEFoI,EAAYQ,yBAA2BvB,EACvCe,EAAYY,8BAAgCh0B,EAC5CozB,EAAYG,eAAiBrB,GAAmB9B,GAEhD,MAAMrZ,EAASkP,GACbmK,EAAKgB,gBACL17B,EACAsK,EACAozB,EAAYG,eACZH,EAAYwB,cAEdzF,GAAoCiB,EAAKN,YAAap6B,EAAMqhB,GAE5Dgc,GAA0B3C,EAAMA,EAAKH,wBSr4BvC0R,CACE9K,EAAIzR,MACJyR,EAAIl8B,MACJ4mC,GAxBsB,CACtBhwD,EACA8vD,EACA3hC,KAEA,IAAIm7B,EAAoC,KACpCtpD,EACFipB,EAASzmB,OAAOxC,IAEhBspD,EAAe,IAAI5B,GACjBv5B,EACA,IAAIw4B,GAAcrB,EAAIzR,MAAOyR,EAAIl8B,OACjC2L,IAEF9L,EAASxmB,QAAQ,IAAIotD,GAAkBC,EAAWxG,OAYpD5G,EACAW,GAGKp6B,EAASvmB,QCpHjBikB,GAAqB/iB,UAAkBysD,aAAe,SACrDxuC,EACAC,GAEA5kB,KAAK2iB,YAAY,IAAK,CAAEvjB,EAAGulB,GAAcC,IAI1C6E,GAAqB/iB,UAAkB0sD,KAAO,SAC7CrtD,EACAstD,GAEArzD,KAAK2iB,YAAY,OAAQ,CAAEva,EAAGrC,GAAQstD,IASjC,MAAMC,GAAa,SAAUC,GAClC,MAAMC,EAAS/pC,GAAqB/iB,UAAUge,IAY9C,OAXA+E,GAAqB/iB,UAAUge,IAAM,SACnCC,EACA5e,EACA6e,EACAC,QAEa3hB,IAAT2hB,IACFA,EAAO0uC,KAETC,EAAO7sD,KAAK3G,KAAM2kB,EAAY5e,EAAM6e,EAAYC,IAE3C,WACL4E,GAAqB/iB,UAAUge,IAAM8uC,IAU5BC,GAAkB,SAAUA,IJoJnC,SAAqCA,GACzCvE,GAAgBuE,EIpJhBC,CAA2BD,IC3CvB,IAA2BE,GAC/BnoD,EAAcD,GACdqoD,EACE,IAAIzqD,EACF,YACA,CAACuiD,GAAamI,mBAAoB/2C,KAIzBqyC,GAHKzD,EAAUoI,YAAY,OAAO5hD,eACpBw5C,EAAUoI,YAAY,iBAClBpI,EAAUoI,YAAY,sBAK7Ch3C,cAIJjT,sBAAqB,IAEzBkqD,EAAgB3qD,WAAeuqD,IAE/BI,EAAgB3qD,WAAe","preExistingComment":"firebase-database.js.map"}