{"version":3,"sources":["node_modules/.pnpm/@firebase+util@1.10.3/node_modules/@firebase/util/dist/index.esm2017.js","node_modules/.pnpm/@firebase+component@0.6.12/node_modules/@firebase/component/dist/esm/index.esm2017.js","node_modules/.pnpm/@firebase+logger@0.4.4/node_modules/@firebase/logger/dist/esm/index.esm2017.js","node_modules/.pnpm/idb@7.1.1/node_modules/idb/build/wrap-idb-value.js","node_modules/.pnpm/idb@7.1.1/node_modules/idb/build/index.js","node_modules/.pnpm/@firebase+app@0.10.18/node_modules/@firebase/app/dist/esm/index.esm2017.js","node_modules/.pnpm/@firebase+database@1.0.11/node_modules/@firebase/database/dist/index.esm2017.js"],"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 * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\n */\nconst 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   * Firebase SDK Version\n   */\n  SDK_VERSION: '${JSCORE_VERSION}'\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 * Throws an error if the provided assertion is falsy\n */\nconst assert = function (assertion, message) {\n  if (!assertion) {\n    throw assertionError(message);\n  }\n};\n/**\n * Returns an Error object suitable for throwing.\n */\nconst assertionError = function (message) {\n  return new Error('Firebase Database (' + CONSTANTS.SDK_VERSION + ') INTERNAL ASSERT FAILED: ' + 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 */\nconst stringToByteArray$1 = function (str) {\n  // TODO(user): Use native implementations if/when available\n  const out = [];\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 ((c & 0xfc00) === 0xd800 && i + 1 < str.length && (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {\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 * 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) {\n  // TODO(user): Use native implementations if/when available\n  const out = [];\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 = ((c1 & 7) << 18 | (c2 & 63) << 12 | (c3 & 63) << 6 | c4 & 63) - 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((c1 & 15) << 12 | (c2 & 63) << 6 | c3 & 63);\n    }\n  }\n  return out.join('');\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_()\n// TODO(dlarocque): Define this as a class, since we no longer target ES5.\nconst base64 = {\n  /**\n   * Maps bytes to characters.\n   */\n  byteToCharMap_: null,\n  /**\n   * Maps characters to bytes.\n   */\n  charToByteMap_: null,\n  /**\n   * Maps bytes to websafe characters.\n   * @private\n   */\n  byteToCharMapWebSafe_: null,\n  /**\n   * Maps websafe characters to bytes.\n   * @private\n   */\n  charToByteMapWebSafe_: null,\n  /**\n   * Our default alphabet, shared between\n   * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n   */\n  ENCODED_VALS_BASE: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\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   * Our websafe alphabet.\n   */\n  get ENCODED_VALS_WEBSAFE() {\n    return this.ENCODED_VALS_BASE + '-_.';\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   * 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, webSafe) {\n    if (!Array.isArray(input)) {\n      throw Error('encodeByteArray takes an array as a parameter');\n    }\n    this.init_();\n    const byteToCharMap = webSafe ? this.byteToCharMapWebSafe_ : this.byteToCharMap_;\n    const output = [];\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      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      if (!haveByte3) {\n        outByte4 = 64;\n        if (!haveByte2) {\n          outByte3 = 64;\n        }\n      }\n      output.push(byteToCharMap[outByte1], byteToCharMap[outByte2], byteToCharMap[outByte3], byteToCharMap[outByte4]);\n    }\n    return output.join('');\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, webSafe) {\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$1(input), webSafe);\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, webSafe) {\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   * 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, webSafe) {\n    this.init_();\n    const charToByteMap = webSafe ? this.charToByteMapWebSafe_ : this.charToByteMap_;\n    const output = [];\n    for (let i = 0; i < input.length;) {\n      const byte1 = charToByteMap[input.charAt(i++)];\n      const haveByte2 = i < input.length;\n      const byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n      ++i;\n      const haveByte3 = i < input.length;\n      const byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n      const haveByte4 = i < input.length;\n      const byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n      if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n        throw new DecodeBase64StringError();\n      }\n      const outByte1 = byte1 << 2 | byte2 >> 4;\n      output.push(outByte1);\n      if (byte3 !== 64) {\n        const outByte2 = byte2 << 4 & 0xf0 | byte3 >> 2;\n        output.push(outByte2);\n        if (byte4 !== 64) {\n          const outByte3 = byte3 << 6 & 0xc0 | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n    return output;\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      // 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        // 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 * An error encountered while decoding base64 string.\n */\nclass DecodeBase64StringError extends Error {\n  constructor() {\n    super(...arguments);\n    this.name = 'DecodeBase64StringError';\n  }\n}\n/**\n * URL-safe base64 encoding\n */\nconst base64Encode = function (str) {\n  const utf8Bytes = stringToByteArray$1(str);\n  return base64.encodeByteArray(utf8Bytes, true);\n};\n/**\n * URL-safe base64 encoding (without \".\" padding in the end).\n * e.g. Used in JSON Web Token (JWT) parts.\n */\nconst base64urlEncodeWithoutPadding = function (str) {\n  // Use base64url encoding and remove padding in the end (dot characters).\n  return base64Encode(str).replace(/\\./g, '');\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 */\nconst base64Decode = function (str) {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nfunction deepCopy(value) {\n  return deepExtend(undefined, value);\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 */\nfunction deepExtend(target, source) {\n  if (!(source instanceof Object)) {\n    return source;\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;\n      return new Date(dateValue.getTime());\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    default:\n      // Not a plain Object - treat it as a scalar.\n      return source;\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[prop] = deepExtend(target[prop], source[prop]);\n  }\n  return target;\n}\nfunction isValidKey(key) {\n  return key !== '__proto__';\n}\n\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Polyfill for `globalThis` object.\n * @returns the `globalThis` object for the given environment.\n * @public\n */\nfunction getGlobal() {\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/**\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 */\nconst getDefaultsFromGlobal = () => getGlobal().__FIREBASE_DEFAULTS__;\n/**\n * Attempt to read defaults from a JSON string provided to\n * process(.)env(.)__FIREBASE_DEFAULTS__ or a JSON file whose path is in\n * process(.)env(.)__FIREBASE_DEFAULTS_PATH__\n * The dots are in parens because certain compilers (Vite?) cannot\n * handle seeing that variable in comments.\n * See https://github.com/firebase/firebase-js-sdk/issues/6838\n */\nconst getDefaultsFromEnvVariable = () => {\n  if (typeof process === 'undefined' || typeof process.env === 'undefined') {\n    return;\n  }\n  const defaultsJsonString = process.env.__FIREBASE_DEFAULTS__;\n  if (defaultsJsonString) {\n    return JSON.parse(defaultsJsonString);\n  }\n};\nconst getDefaultsFromCookie = () => {\n  if (typeof document === 'undefined') {\n    return;\n  }\n  let match;\n  try {\n    match = document.cookie.match(/__FIREBASE_DEFAULTS__=([^;]+)/);\n  } catch (e) {\n    // Some environments such as Angular Universal SSR have a\n    // `document` object but error on accessing `document.cookie`.\n    return;\n  }\n  const decoded = match && base64Decode(match[1]);\n  return decoded && JSON.parse(decoded);\n};\n/**\n * Get the __FIREBASE_DEFAULTS__ object. It checks in order:\n * (1) if such an object exists as a property of `globalThis`\n * (2) if such an object was provided on a shell environment variable\n * (3) if such an object exists in a cookie\n * @public\n */\nconst getDefaults = () => {\n  try {\n    return getDefaultsFromGlobal() || getDefaultsFromEnvVariable() || getDefaultsFromCookie();\n  } catch (e) {\n    /**\n     * Catch-all for being unable to get __FIREBASE_DEFAULTS__ due\n     * to any environment case we have not accounted for. Log to\n     * info instead of swallowing so we can find these unknown cases\n     * and add paths for them if needed.\n     */\n    console.info(`Unable to get __FIREBASE_DEFAULTS__ due to: ${e}`);\n    return;\n  }\n};\n/**\n * Returns emulator host stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @returns a URL host formatted like `127.0.0.1:9999` or `[::1]:4000` if available\n * @public\n */\nconst getDefaultEmulatorHost = productName => {\n  var _a, _b;\n  return (_b = (_a = getDefaults()) === null || _a === void 0 ? void 0 : _a.emulatorHosts) === null || _b === void 0 ? void 0 : _b[productName];\n};\n/**\n * Returns emulator hostname and port stored in the __FIREBASE_DEFAULTS__ object\n * for the given product.\n * @returns a pair of hostname and port like `[\"::1\", 4000]` if available\n * @public\n */\nconst getDefaultEmulatorHostnameAndPort = productName => {\n  const host = getDefaultEmulatorHost(productName);\n  if (!host) {\n    return undefined;\n  }\n  const separatorIndex = host.lastIndexOf(':'); // Finding the last since IPv6 addr also has colons.\n  if (separatorIndex <= 0 || separatorIndex + 1 === host.length) {\n    throw new Error(`Invalid host ${host} with no separate hostname and port!`);\n  }\n  // eslint-disable-next-line no-restricted-globals\n  const port = parseInt(host.substring(separatorIndex + 1), 10);\n  if (host[0] === '[') {\n    // Bracket-quoted `[ipv6addr]:port` => return \"ipv6addr\" (without brackets).\n    return [host.substring(1, separatorIndex - 1), port];\n  } else {\n    return [host.substring(0, separatorIndex), port];\n  }\n};\n/**\n * Returns Firebase app config stored in the __FIREBASE_DEFAULTS__ object.\n * @public\n */\nconst getDefaultAppConfig = () => {\n  var _a;\n  return (_a = getDefaults()) === null || _a === void 0 ? void 0 : _a.config;\n};\n/**\n * Returns an experimental setting on the __FIREBASE_DEFAULTS__ object (properties\n * prefixed by \"_\")\n * @public\n */\nconst getExperimentalSetting = name => {\n  var _a;\n  return (_a = getDefaults()) === null || _a === void 0 ? void 0 : _a[`_${name}`];\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 */\nclass Deferred {\n  constructor() {\n    this.reject = () => {};\n    this.resolve = () => {};\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = resolve;\n      this.reject = reject;\n    });\n  }\n  /**\n   * Our API internals are not promisified 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(callback) {\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        // 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/**\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 */\nfunction createMockUserToken(token, projectId) {\n  if (token.uid) {\n    throw new Error('The \"uid\" field is no longer supported by mockUserToken. Please use \"sub\" instead for Firebase Auth User ID.');\n  }\n  // Unsecured JWTs use \"none\" as the algorithm.\n  const header = {\n    alg: 'none',\n    type: 'JWT'\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  const payload = Object.assign({\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  }, token);\n  // Unsecured JWTs use the empty string as a signature.\n  const signature = '';\n  return [base64urlEncodeWithoutPadding(JSON.stringify(header)), base64urlEncodeWithoutPadding(JSON.stringify(payload)), signature].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/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return user agent string\n */\nfunction getUA() {\n  if (typeof navigator !== 'undefined' && typeof navigator['userAgent'] === 'string') {\n    return navigator['userAgent'];\n  } else {\n    return '';\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 */\nfunction isMobileCordova() {\n  return 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']) && /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA());\n}\n/**\n * Detect Node.js.\n *\n * @return true if Node.js environment is detected or specified.\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\nfunction isNode() {\n  var _a;\n  const forceEnvironment = (_a = getDefaults()) === null || _a === void 0 ? void 0 : _a.forceEnvironment;\n  if (forceEnvironment === 'node') {\n    return true;\n  } else if (forceEnvironment === 'browser') {\n    return false;\n  }\n  try {\n    return Object.prototype.toString.call(global.process) === '[object process]';\n  } catch (e) {\n    return false;\n  }\n}\n/**\n * Detect Browser Environment.\n * Note: This will return true for certain test frameworks that are incompletely\n * mimicking a browser, and should not lead to assuming all browser APIs are\n * available.\n */\nfunction isBrowser() {\n  return typeof window !== 'undefined' || isWebWorker();\n}\n/**\n * Detect Web Worker context.\n */\nfunction isWebWorker() {\n  return typeof WorkerGlobalScope !== 'undefined' && typeof self !== 'undefined' && self instanceof WorkerGlobalScope;\n}\n/**\n * Detect Cloudflare Worker context.\n */\nfunction isCloudflareWorker() {\n  return typeof navigator !== 'undefined' && navigator.userAgent === 'Cloudflare-Workers';\n}\nfunction isBrowserExtension() {\n  const runtime = typeof chrome === 'object' ? chrome.runtime : typeof browser === 'object' ? browser.runtime : undefined;\n  return typeof runtime === 'object' && runtime.id !== undefined;\n}\n/**\n * Detect React Native.\n *\n * @return true if ReactNative environment is detected.\n */\nfunction isReactNative() {\n  return typeof navigator === 'object' && navigator['product'] === 'ReactNative';\n}\n/** Detects Electron apps. */\nfunction isElectron() {\n  return getUA().indexOf('Electron/') >= 0;\n}\n/** Detects Internet Explorer. */\nfunction isIE() {\n  const ua = getUA();\n  return ua.indexOf('MSIE ') >= 0 || ua.indexOf('Trident/') >= 0;\n}\n/** Detects Universal Windows Platform apps. */\nfunction isUWP() {\n  return getUA().indexOf('MSAppHost/') >= 0;\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 */\nfunction isNodeSdk() {\n  return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n/** Returns true if we are running in Safari. */\nfunction isSafari() {\n  return !isNode() && !!navigator.userAgent && navigator.userAgent.includes('Safari') && !navigator.userAgent.includes('Chrome');\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 */\nfunction isIndexedDBAvailable() {\n  try {\n    return typeof indexedDB === 'object';\n  } catch (e) {\n    return false;\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 */\nfunction validateIndexedDBOpenable() {\n  return new Promise((resolve, reject) => {\n    try {\n      let preExist = true;\n      const DB_CHECK_NAME = '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      request.onerror = () => {\n        var _a;\n        reject(((_a = request.error) === null || _a === void 0 ? void 0 : _a.message) || '');\n      };\n    } catch (error) {\n      reject(error);\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 */\nfunction areCookiesEnabled() {\n  if (typeof navigator === 'undefined' || !navigator.cookieEnabled) {\n    return false;\n  }\n  return 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/**\n * @fileoverview Standardized Firebase Error.\n *\n * Usage:\n *\n *   // TypeScript string literals for type-safe codes\n *   type Err =\n *     'unknown' |\n *     'object-not-found'\n *     ;\n *\n *   // Closure enum for type-safe error codes\n *   // at-enum {string}\n *   var Err = {\n *     UNKNOWN: 'unknown',\n *     OBJECT_NOT_FOUND: 'object-not-found',\n *   }\n *\n *   let errors: Map<Err, string> = {\n *     'generic-error': \"Unknown error\",\n *     'file-not-found': \"Could not find file: {$file}\",\n *   };\n *\n *   // Type-safe function - must pass a valid error code as param.\n *   let error = new ErrorFactory<Err>('service', 'Service', errors);\n *\n *   ...\n *   throw error.create(Err.GENERIC);\n *   ...\n *   throw error.create(Err.FILE_NOT_FOUND, {'file': fileName});\n *   ...\n *   // Service: Could not file file: foo.txt (service/file-not-found).\n *\n *   catch (e) {\n *     assert(e.message === \"Could not find file: foo.txt.\");\n *     if ((e as FirebaseError)?.code === 'service/file-not-found') {\n *       console.log(\"Could not read file: \" + e['file']);\n *     }\n *   }\n */\nconst ERROR_NAME = 'FirebaseError';\n// Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\nclass FirebaseError extends Error {\n  constructor(/** The error code for this error. */\n  code, message, /** Custom data for this error. */\n  customData) {\n    super(message);\n    this.code = code;\n    this.customData = customData;\n    /** The custom name for all FirebaseErrors. */\n    this.name = ERROR_NAME;\n    // Fix For ES5\n    // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n    // TODO(dlarocque): Replace this with `new.target`: https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-2.html#support-for-newtarget\n    //                   which we can now use since we no longer target ES5.\n    Object.setPrototypeOf(this, FirebaseError.prototype);\n    // Maintains proper stack trace for where our error was thrown.\n    // Only available on V8.\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, ErrorFactory.prototype.create);\n    }\n  }\n}\nclass ErrorFactory {\n  constructor(service, serviceName, errors) {\n    this.service = service;\n    this.serviceName = serviceName;\n    this.errors = errors;\n  }\n  create(code, ...data) {\n    const customData = data[0] || {};\n    const fullCode = `${this.service}/${code}`;\n    const template = this.errors[code];\n    const message = template ? replaceTemplate(template, customData) : 'Error';\n    // Service Name: Error message (service/code).\n    const fullMessage = `${this.serviceName}: ${message} (${fullCode}).`;\n    const error = new FirebaseError(fullCode, fullMessage, customData);\n    return error;\n  }\n}\nfunction replaceTemplate(template, data) {\n  return template.replace(PATTERN, (_, key) => {\n    const value = data[key];\n    return value != null ? String(value) : `<${key}?>`;\n  });\n}\nconst PATTERN = /\\{\\$([^}]+)}/g;\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 * 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 */\nfunction jsonEval(str) {\n  return JSON.parse(str);\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 */\nfunction stringify(data) {\n  return JSON.stringify(data);\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 * 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 */\nconst decode = function (token) {\n  let header = {},\n    claims = {},\n    data = {},\n    signature = '';\n  try {\n    const parts = token.split('.');\n    header = jsonEval(base64Decode(parts[0]) || '');\n    claims = jsonEval(base64Decode(parts[1]) || '');\n    signature = parts[2];\n    data = claims['d'] || {};\n    delete claims['d'];\n  } catch (e) {}\n  return {\n    header,\n    claims,\n    data,\n    signature\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 */\nconst isValidTimestamp = function (token) {\n  const claims = decode(token).claims;\n  const now = Math.floor(new Date().getTime() / 1000);\n  let validSince = 0,\n    validUntil = 0;\n  if (typeof claims === 'object') {\n    if (claims.hasOwnProperty('nbf')) {\n      validSince = claims['nbf'];\n    } else if (claims.hasOwnProperty('iat')) {\n      validSince = claims['iat'];\n    }\n    if (claims.hasOwnProperty('exp')) {\n      validUntil = claims['exp'];\n    } else {\n      // token will expire after 24h by default\n      validUntil = validSince + 86400;\n    }\n  }\n  return !!now && !!validSince && !!validUntil && now >= validSince && now <= validUntil;\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 */\nconst issuedAtTime = function (token) {\n  const claims = decode(token).claims;\n  if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n    return claims['iat'];\n  }\n  return null;\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 */\nconst isValidFormat = function (token) {\n  const decoded = decode(token),\n    claims = decoded.claims;\n  return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\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 */\nconst isAdmin = function (token) {\n  const claims = decode(token).claims;\n  return typeof claims === 'object' && claims['admin'] === 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 */\nfunction contains(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\nfunction safeGet(obj, key) {\n  if (Object.prototype.hasOwnProperty.call(obj, key)) {\n    return obj[key];\n  } else {\n    return undefined;\n  }\n}\nfunction isEmpty(obj) {\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction map(obj, fn, contextObj) {\n  const res = {};\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;\n}\n/**\n * Deep equal two objects. Support Arrays and Objects.\n */\nfunction deepEqual(a, b) {\n  if (a === b) {\n    return true;\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    const aProp = a[k];\n    const bProp = b[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  for (const k of bKeys) {\n    if (!aKeys.includes(k)) {\n      return false;\n    }\n  }\n  return true;\n}\nfunction isObject(thing) {\n  return thing !== null && typeof thing === 'object';\n}\n\n/**\n * @license\n * Copyright 2022 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Rejects if the given promise doesn't resolve in timeInMS milliseconds.\n * @internal\n */\nfunction promiseWithTimeout(promise, timeInMS = 2000) {\n  const deferredPromise = new Deferred();\n  setTimeout(() => deferredPromise.reject('timeout!'), timeInMS);\n  promise.then(deferredPromise.resolve, deferredPromise.reject);\n  return deferredPromise.promise;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Returns 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 */\nfunction querystring(querystringParams) {\n  const params = [];\n  for (const [key, value] of Object.entries(querystringParams)) {\n    if (Array.isArray(value)) {\n      value.forEach(arrayVal => {\n        params.push(encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal));\n      });\n    } else {\n      params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n    }\n  }\n  return params.length ? '&' + params.join('&') : '';\n}\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object\n * (e.g. {arg: 'val', arg2: 'val2'})\n */\nfunction querystringDecode(querystring) {\n  const obj = {};\n  const tokens = querystring.replace(/^\\?/, '').split('&');\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 * Extract the query string part of a URL, including the leading question mark (if present).\n */\nfunction extractQuerystring(url) {\n  const queryStart = url.indexOf('?');\n  if (!queryStart) {\n    return '';\n  }\n  const fragmentStart = url.indexOf('#', queryStart);\n  return url.substring(queryStart, 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/**\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 * 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 */\nclass Sha1 {\n  constructor() {\n    /**\n     * Holds the previous values of accumulated variables a-e in the compress_\n     * function.\n     * @private\n     */\n    this.chain_ = [];\n    /**\n     * A buffer holding the partially computed hash result.\n     * @private\n     */\n    this.buf_ = [];\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    this.W_ = [];\n    /**\n     * Contains data needed to pad messages less than 64 bytes.\n     * @private\n     */\n    this.pad_ = [];\n    /**\n     * @private {number}\n     */\n    this.inbuf_ = 0;\n    /**\n     * @private {number}\n     */\n    this.total_ = 0;\n    this.blockSize = 512 / 8;\n    this.pad_[0] = 128;\n    for (let i = 1; i < this.blockSize; ++i) {\n      this.pad_[i] = 0;\n    }\n    this.reset();\n  }\n  reset() {\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    this.inbuf_ = 0;\n    this.total_ = 0;\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, offset) {\n    if (!offset) {\n      offset = 0;\n    }\n    const W = this.W_;\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] = buf.charCodeAt(offset) << 24 | buf.charCodeAt(offset + 1) << 16 | buf.charCodeAt(offset + 2) << 8 | buf.charCodeAt(offset + 3);\n        offset += 4;\n      }\n    } else {\n      for (let i = 0; i < 16; i++) {\n        W[i] = buf[offset] << 24 | buf[offset + 1] << 16 | buf[offset + 2] << 8 | buf[offset + 3];\n        offset += 4;\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    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    // 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      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    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  update(bytes, length) {\n    // TODO(johnlenz): tighten the function signature and remove this check\n    if (bytes == null) {\n      return;\n    }\n    if (length === undefined) {\n      length = bytes.length;\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    // 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      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    this.inbuf_ = inbuf;\n    this.total_ += length;\n  }\n  /** @override */\n  digest() {\n    const digest = [];\n    let totalBits = this.total_ * 8;\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    // 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    this.compress_(this.buf_);\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/**\n * Helper to make a Subscribe function (just like Promise helps make a\n * Thenable).\n *\n * @param executor Function which can make calls to a single Observer\n *     as a proxy.\n * @param onNoObservers Callback when count of Observers goes to zero.\n */\nfunction createSubscribe(executor, onNoObservers) {\n  const proxy = new ObserverProxy(executor, onNoObservers);\n  return proxy.subscribe.bind(proxy);\n}\n/**\n * Implement fan-out for any number of Observers attached via a subscribe\n * function.\n */\nclass ObserverProxy {\n  /**\n   * @param executor Function which can make calls to a single Observer\n   *     as a proxy.\n   * @param onNoObservers Callback when count of Observers goes to zero.\n   */\n  constructor(executor, onNoObservers) {\n    this.observers = [];\n    this.unsubscribes = [];\n    this.observerCount = 0;\n    // Micro-task scheduling by calling task.then().\n    this.task = Promise.resolve();\n    this.finalized = false;\n    this.onNoObservers = onNoObservers;\n    // Call the executor asynchronously so subscribers that are called\n    // synchronously after the creation of the subscribe function\n    // can still receive the very first value generated in the executor.\n    this.task.then(() => {\n      executor(this);\n    }).catch(e => {\n      this.error(e);\n    });\n  }\n  next(value) {\n    this.forEachObserver(observer => {\n      observer.next(value);\n    });\n  }\n  error(error) {\n    this.forEachObserver(observer => {\n      observer.error(error);\n    });\n    this.close(error);\n  }\n  complete() {\n    this.forEachObserver(observer => {\n      observer.complete();\n    });\n    this.close();\n  }\n  /**\n   * Subscribe function that can be used to add an Observer to the fan-out list.\n   *\n   * - We require that no event is sent to a subscriber synchronously to their\n   *   call to subscribe().\n   */\n  subscribe(nextOrObserver, error, complete) {\n    let observer;\n    if (nextOrObserver === undefined && error === undefined && complete === undefined) {\n      throw new Error('Missing Observer.');\n    }\n    // Assemble an Observer object when passed as callback functions.\n    if (implementsAnyMethods(nextOrObserver, ['next', 'error', 'complete'])) {\n      observer = nextOrObserver;\n    } else {\n      observer = {\n        next: nextOrObserver,\n        error,\n        complete\n      };\n    }\n    if (observer.next === undefined) {\n      observer.next = noop;\n    }\n    if (observer.error === undefined) {\n      observer.error = noop;\n    }\n    if (observer.complete === undefined) {\n      observer.complete = noop;\n    }\n    const unsub = this.unsubscribeOne.bind(this, this.observers.length);\n    // Attempt to subscribe to a terminated Observable - we\n    // just respond to the Observer with the final error or complete\n    // event.\n    if (this.finalized) {\n      // eslint-disable-next-line @typescript-eslint/no-floating-promises\n      this.task.then(() => {\n        try {\n          if (this.finalError) {\n            observer.error(this.finalError);\n          } else {\n            observer.complete();\n          }\n        } catch (e) {\n          // nothing\n        }\n        return;\n      });\n    }\n    this.observers.push(observer);\n    return unsub;\n  }\n  // Unsubscribe is synchronous - we guarantee that no events are sent to\n  // any unsubscribed Observer.\n  unsubscribeOne(i) {\n    if (this.observers === undefined || this.observers[i] === undefined) {\n      return;\n    }\n    delete this.observers[i];\n    this.observerCount -= 1;\n    if (this.observerCount === 0 && this.onNoObservers !== undefined) {\n      this.onNoObservers(this);\n    }\n  }\n  forEachObserver(fn) {\n    if (this.finalized) {\n      // Already closed by previous event....just eat the additional values.\n      return;\n    }\n    // Since sendOne calls asynchronously - there is no chance that\n    // this.observers will become undefined.\n    for (let i = 0; i < this.observers.length; i++) {\n      this.sendOne(i, fn);\n    }\n  }\n  // Call the Observer via one of it's callback function. We are careful to\n  // confirm that the observe has not been unsubscribed since this asynchronous\n  // function had been queued.\n  sendOne(i, fn) {\n    // Execute the callback asynchronously\n    // eslint-disable-next-line @typescript-eslint/no-floating-promises\n    this.task.then(() => {\n      if (this.observers !== undefined && this.observers[i] !== undefined) {\n        try {\n          fn(this.observers[i]);\n        } catch (e) {\n          // Ignore exceptions raised in Observers or missing methods of an\n          // Observer.\n          // Log error to console. b/31404806\n          if (typeof console !== 'undefined' && console.error) {\n            console.error(e);\n          }\n        }\n      }\n    });\n  }\n  close(err) {\n    if (this.finalized) {\n      return;\n    }\n    this.finalized = true;\n    if (err !== undefined) {\n      this.finalError = err;\n    }\n    // Proxy is no longer needed - garbage collect references\n    // eslint-disable-next-line @typescript-eslint/no-floating-promises\n    this.task.then(() => {\n      this.observers = undefined;\n      this.onNoObservers = undefined;\n    });\n  }\n}\n/** Turn synchronous function into one called asynchronously. */\n// eslint-disable-next-line @typescript-eslint/ban-types\nfunction async(fn, onError) {\n  return (...args) => {\n    Promise.resolve(true).then(() => {\n      fn(...args);\n    }).catch(error => {\n      if (onError) {\n        onError(error);\n      }\n    });\n  };\n}\n/**\n * Return true if the object passed in implements any of the named methods.\n */\nfunction implementsAnyMethods(obj, methods) {\n  if (typeof obj !== 'object' || obj === null) {\n    return false;\n  }\n  for (const method of methods) {\n    if (method in obj && typeof obj[method] === 'function') {\n      return true;\n    }\n  }\n  return false;\n}\nfunction noop() {\n  // do nothing\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 * 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 */\nconst validateArgCount = function (fnName, minCount, maxCount, argCount) {\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 = fnName + ' failed: Was called with ' + argCount + (argCount === 1 ? ' argument.' : ' arguments.') + ' Expects ' + argError + '.';\n    throw new Error(error);\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 */\nfunction errorPrefix(fnName, argName) {\n  return `${fnName} failed: ${argName} argument `;\n}\n/**\n * @param fnName\n * @param argumentNumber\n * @param namespace\n * @param optional\n */\nfunction validateNamespace(fnName, namespace, optional) {\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(errorPrefix(fnName, 'namespace') + 'must be a valid firebase namespace.');\n  }\n}\nfunction validateCallback(fnName, argumentName,\n// eslint-disable-next-line @typescript-eslint/ban-types\ncallback, optional) {\n  if (optional && !callback) {\n    return;\n  }\n  if (typeof callback !== 'function') {\n    throw new Error(errorPrefix(fnName, argumentName) + 'must be a valid function.');\n  }\n}\nfunction validateContextObject(fnName, argumentName, context, optional) {\n  if (optional && !context) {\n    return;\n  }\n  if (typeof context !== 'object' || context === null) {\n    throw new Error(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// 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// 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 * @param {string} str\n * @return {Array}\n */\nconst stringToByteArray = function (str) {\n  const out = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\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    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 * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nconst stringLength = function (str) {\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/**\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 amount of milliseconds to exponentially increase.\n */\nconst DEFAULT_INTERVAL_MILLIS = 1000;\n/**\n * The factor to backoff by.\n * Should be a number greater than 1.\n */\nconst DEFAULT_BACKOFF_FACTOR = 2;\n/**\n * The maximum milliseconds to increase to.\n *\n * <p>Visible for testing\n */\nconst MAX_VALUE_MILLIS = 4 * 60 * 60 * 1000; // Four hours, like iOS and Android.\n/**\n * The percentage of backoff time to randomize by.\n * See\n * http://go/safe-client-behavior#step-1-determine-the-appropriate-retry-interval-to-handle-spike-traffic\n * for context.\n *\n * <p>Visible for testing\n */\nconst RANDOM_FACTOR = 0.5;\n/**\n * Based on the backoff method from\n * https://github.com/google/closure-library/blob/master/closure/goog/math/exponentialbackoff.js.\n * Extracted here so we don't need to pass metadata and a stateful ExponentialBackoff object around.\n */\nfunction calculateBackoffMillis(backoffCount, intervalMillis = DEFAULT_INTERVAL_MILLIS, backoffFactor = DEFAULT_BACKOFF_FACTOR) {\n  // Calculates an exponentially increasing value.\n  // Deviation: calculates value from count and a constant interval, so we only need to save value\n  // and count to restore state.\n  const currBaseValue = intervalMillis * Math.pow(backoffFactor, backoffCount);\n  // A random \"fuzz\" to avoid waves of retries.\n  // Deviation: randomFactor is required.\n  const randomWait = Math.round(\n  // A fraction of the backoff value to add/subtract.\n  // Deviation: changes multiplication order to improve readability.\n  RANDOM_FACTOR * currBaseValue * (\n  // A random float (rounded to int by Math.round above) in the range [-1, 1]. Determines\n  // if we add or subtract.\n  Math.random() - 0.5) * 2);\n  // Limits backoff to max to avoid effectively permanent backoff.\n  return Math.min(MAX_VALUE_MILLIS, currBaseValue + randomWait);\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Provide English ordinal letters after a number\n */\nfunction ordinal(i) {\n  if (!Number.isFinite(i)) {\n    return `${i}`;\n  }\n  return i + indicator(i);\n}\nfunction indicator(i) {\n  i = Math.abs(i);\n  const cent = i % 100;\n  if (cent >= 10 && cent <= 20) {\n    return 'th';\n  }\n  const dec = i % 10;\n  if (dec === 1) {\n    return 'st';\n  }\n  if (dec === 2) {\n    return 'nd';\n  }\n  if (dec === 3) {\n    return 'rd';\n  }\n  return 'th';\n}\n\n/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction getModularInstance(service) {\n  if (service && service._delegate) {\n    return service._delegate;\n  } else {\n    return service;\n  }\n}\nexport { CONSTANTS, DecodeBase64StringError, Deferred, ErrorFactory, FirebaseError, MAX_VALUE_MILLIS, RANDOM_FACTOR, Sha1, areCookiesEnabled, assert, assertionError, async, base64, base64Decode, base64Encode, base64urlEncodeWithoutPadding, calculateBackoffMillis, contains, createMockUserToken, createSubscribe, decode, deepCopy, deepEqual, deepExtend, errorPrefix, extractQuerystring, getDefaultAppConfig, getDefaultEmulatorHost, getDefaultEmulatorHostnameAndPort, getDefaults, getExperimentalSetting, getGlobal, getModularInstance, getUA, isAdmin, isBrowser, isBrowserExtension, isCloudflareWorker, isElectron, isEmpty, isIE, isIndexedDBAvailable, isMobileCordova, isNode, isNodeSdk, isReactNative, isSafari, isUWP, isValidFormat, isValidTimestamp, isWebWorker, issuedAtTime, jsonEval, map, ordinal, promiseWithTimeout, querystring, querystringDecode, safeGet, stringLength, stringToByteArray, stringify, validateArgCount, validateCallback, validateContextObject, validateIndexedDBOpenable, validateNamespace };\n","import { Deferred } from '@firebase/util';\n\n/**\n * Component for service name T, e.g. `auth`, `auth-internal`\n */\nclass Component {\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(name, instanceFactory, type) {\n    this.name = name;\n    this.instanceFactory = instanceFactory;\n    this.type = type;\n    this.multipleInstances = false;\n    /**\n     * Properties to be added to the service namespace\n     */\n    this.serviceProps = {};\n    this.instantiationMode = \"LAZY\" /* InstantiationMode.LAZY */;\n    this.onInstanceCreated = null;\n  }\n  setInstantiationMode(mode) {\n    this.instantiationMode = mode;\n    return this;\n  }\n  setMultipleInstances(multipleInstances) {\n    this.multipleInstances = multipleInstances;\n    return this;\n  }\n  setServiceProps(props) {\n    this.serviceProps = props;\n    return this;\n  }\n  setInstanceCreatedCallback(callback) {\n    this.onInstanceCreated = callback;\n    return this;\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 */\nconst DEFAULT_ENTRY_NAME = '[DEFAULT]';\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 * Provider for instance for service name T, e.g. 'auth', 'auth-internal'\n * NameServiceMapping[T] is an alias for the type of the instance\n */\nclass Provider {\n  constructor(name, container) {\n    this.name = name;\n    this.container = container;\n    this.component = null;\n    this.instances = new Map();\n    this.instancesDeferred = new Map();\n    this.instancesOptions = new Map();\n    this.onInitCallbacks = new Map();\n  }\n  /**\n   * @param identifier A provider can provide multiple instances of a service\n   * if this.component.multipleInstances is true.\n   */\n  get(identifier) {\n    // if multipleInstances is not supported, use the default name\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(identifier);\n    if (!this.instancesDeferred.has(normalizedIdentifier)) {\n      const deferred = new Deferred();\n      this.instancesDeferred.set(normalizedIdentifier, deferred);\n      if (this.isInitialized(normalizedIdentifier) || this.shouldAutoInitialize()) {\n        // initialize the service if it can be auto-initialized\n        try {\n          const instance = this.getOrInitializeService({\n            instanceIdentifier: normalizedIdentifier\n          });\n          if (instance) {\n            deferred.resolve(instance);\n          }\n        } catch (e) {\n          // when the instance factory throws an exception during get(), it should not cause\n          // a fatal error. We just return the unresolved promise in this case.\n        }\n      }\n    }\n    return this.instancesDeferred.get(normalizedIdentifier).promise;\n  }\n  getImmediate(options) {\n    var _a;\n    // if multipleInstances is not supported, use the default name\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(options === null || options === void 0 ? void 0 : options.identifier);\n    const optional = (_a = options === null || options === void 0 ? void 0 : options.optional) !== null && _a !== void 0 ? _a : false;\n    if (this.isInitialized(normalizedIdentifier) || this.shouldAutoInitialize()) {\n      try {\n        return this.getOrInitializeService({\n          instanceIdentifier: normalizedIdentifier\n        });\n      } catch (e) {\n        if (optional) {\n          return null;\n        } else {\n          throw e;\n        }\n      }\n    } else {\n      // In case a component is not initialized and should/cannot be auto-initialized at the moment, return null if the optional flag is set, or throw\n      if (optional) {\n        return null;\n      } else {\n        throw Error(`Service ${this.name} is not available`);\n      }\n    }\n  }\n  getComponent() {\n    return this.component;\n  }\n  setComponent(component) {\n    if (component.name !== this.name) {\n      throw Error(`Mismatching Component ${component.name} for Provider ${this.name}.`);\n    }\n    if (this.component) {\n      throw Error(`Component for ${this.name} has already been provided`);\n    }\n    this.component = component;\n    // return early without attempting to initialize the component if the component requires explicit initialization (calling `Provider.initialize()`)\n    if (!this.shouldAutoInitialize()) {\n      return;\n    }\n    // if the service is eager, initialize the default instance\n    if (isComponentEager(component)) {\n      try {\n        this.getOrInitializeService({\n          instanceIdentifier: DEFAULT_ENTRY_NAME\n        });\n      } catch (e) {\n        // when the instance factory for an eager Component throws an exception during the eager\n        // initialization, it should not cause a fatal error.\n        // TODO: Investigate if we need to make it configurable, because some component may want to cause\n        // a fatal error in this case?\n      }\n    }\n    // Create service instances for the pending promises and resolve them\n    // NOTE: if this.multipleInstances is false, only the default instance will be created\n    // and all promises with resolve with it regardless of the identifier.\n    for (const [instanceIdentifier, instanceDeferred] of this.instancesDeferred.entries()) {\n      const normalizedIdentifier = this.normalizeInstanceIdentifier(instanceIdentifier);\n      try {\n        // `getOrInitializeService()` should always return a valid instance since a component is guaranteed. use ! to make typescript happy.\n        const instance = this.getOrInitializeService({\n          instanceIdentifier: normalizedIdentifier\n        });\n        instanceDeferred.resolve(instance);\n      } catch (e) {\n        // when the instance factory throws an exception, it should not cause\n        // a fatal error. We just leave the promise unresolved.\n      }\n    }\n  }\n  clearInstance(identifier = DEFAULT_ENTRY_NAME) {\n    this.instancesDeferred.delete(identifier);\n    this.instancesOptions.delete(identifier);\n    this.instances.delete(identifier);\n  }\n  // app.delete() will call this method on every provider to delete the services\n  // TODO: should we mark the provider as deleted?\n  async delete() {\n    const services = Array.from(this.instances.values());\n    await Promise.all([...services.filter(service => 'INTERNAL' in service) // legacy services\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    .map(service => service.INTERNAL.delete()), ...services.filter(service => '_delete' in service) // modularized services\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    .map(service => service._delete())]);\n  }\n  isComponentSet() {\n    return this.component != null;\n  }\n  isInitialized(identifier = DEFAULT_ENTRY_NAME) {\n    return this.instances.has(identifier);\n  }\n  getOptions(identifier = DEFAULT_ENTRY_NAME) {\n    return this.instancesOptions.get(identifier) || {};\n  }\n  initialize(opts = {}) {\n    const {\n      options = {}\n    } = opts;\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(opts.instanceIdentifier);\n    if (this.isInitialized(normalizedIdentifier)) {\n      throw Error(`${this.name}(${normalizedIdentifier}) has already been initialized`);\n    }\n    if (!this.isComponentSet()) {\n      throw Error(`Component ${this.name} has not been registered yet`);\n    }\n    const instance = this.getOrInitializeService({\n      instanceIdentifier: normalizedIdentifier,\n      options\n    });\n    // resolve any pending promise waiting for the service instance\n    for (const [instanceIdentifier, instanceDeferred] of this.instancesDeferred.entries()) {\n      const normalizedDeferredIdentifier = this.normalizeInstanceIdentifier(instanceIdentifier);\n      if (normalizedIdentifier === normalizedDeferredIdentifier) {\n        instanceDeferred.resolve(instance);\n      }\n    }\n    return instance;\n  }\n  /**\n   *\n   * @param callback - a function that will be invoked  after the provider has been initialized by calling provider.initialize().\n   * The function is invoked SYNCHRONOUSLY, so it should not execute any longrunning tasks in order to not block the program.\n   *\n   * @param identifier An optional instance identifier\n   * @returns a function to unregister the callback\n   */\n  onInit(callback, identifier) {\n    var _a;\n    const normalizedIdentifier = this.normalizeInstanceIdentifier(identifier);\n    const existingCallbacks = (_a = this.onInitCallbacks.get(normalizedIdentifier)) !== null && _a !== void 0 ? _a : new Set();\n    existingCallbacks.add(callback);\n    this.onInitCallbacks.set(normalizedIdentifier, existingCallbacks);\n    const existingInstance = this.instances.get(normalizedIdentifier);\n    if (existingInstance) {\n      callback(existingInstance, normalizedIdentifier);\n    }\n    return () => {\n      existingCallbacks.delete(callback);\n    };\n  }\n  /**\n   * Invoke onInit callbacks synchronously\n   * @param instance the service instance`\n   */\n  invokeOnInitCallbacks(instance, identifier) {\n    const callbacks = this.onInitCallbacks.get(identifier);\n    if (!callbacks) {\n      return;\n    }\n    for (const callback of callbacks) {\n      try {\n        callback(instance, identifier);\n      } catch (_a) {\n        // ignore errors in the onInit callback\n      }\n    }\n  }\n  getOrInitializeService({\n    instanceIdentifier,\n    options = {}\n  }) {\n    let instance = this.instances.get(instanceIdentifier);\n    if (!instance && this.component) {\n      instance = this.component.instanceFactory(this.container, {\n        instanceIdentifier: normalizeIdentifierForFactory(instanceIdentifier),\n        options\n      });\n      this.instances.set(instanceIdentifier, instance);\n      this.instancesOptions.set(instanceIdentifier, options);\n      /**\n       * Invoke onInit listeners.\n       * Note this.component.onInstanceCreated is different, which is used by the component creator,\n       * while onInit listeners are registered by consumers of the provider.\n       */\n      this.invokeOnInitCallbacks(instance, instanceIdentifier);\n      /**\n       * Order is important\n       * onInstanceCreated() should be called after this.instances.set(instanceIdentifier, instance); which\n       * makes `isInitialized()` return true.\n       */\n      if (this.component.onInstanceCreated) {\n        try {\n          this.component.onInstanceCreated(this.container, instanceIdentifier, instance);\n        } catch (_a) {\n          // ignore errors in the onInstanceCreatedCallback\n        }\n      }\n    }\n    return instance || null;\n  }\n  normalizeInstanceIdentifier(identifier = DEFAULT_ENTRY_NAME) {\n    if (this.component) {\n      return this.component.multipleInstances ? identifier : DEFAULT_ENTRY_NAME;\n    } else {\n      return identifier; // assume multiple instances are supported before the component is provided.\n    }\n  }\n  shouldAutoInitialize() {\n    return !!this.component && this.component.instantiationMode !== \"EXPLICIT\" /* InstantiationMode.EXPLICIT */;\n  }\n}\n// undefined should be passed to the service factory for the default instance\nfunction normalizeIdentifierForFactory(identifier) {\n  return identifier === DEFAULT_ENTRY_NAME ? undefined : identifier;\n}\nfunction isComponentEager(component) {\n  return component.instantiationMode === \"EAGER\" /* InstantiationMode.EAGER */;\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 * ComponentContainer that provides Providers for service name T, e.g. `auth`, `auth-internal`\n */\nclass ComponentContainer {\n  constructor(name) {\n    this.name = name;\n    this.providers = new Map();\n  }\n  /**\n   *\n   * @param component Component being added\n   * @param overwrite When a component with the same name has already been registered,\n   * if overwrite is true: overwrite the existing component with the new component and create a new\n   * provider with the new component. It can be useful in tests where you want to use different mocks\n   * for different tests.\n   * if overwrite is false: throw an exception\n   */\n  addComponent(component) {\n    const provider = this.getProvider(component.name);\n    if (provider.isComponentSet()) {\n      throw new Error(`Component ${component.name} has already been registered with ${this.name}`);\n    }\n    provider.setComponent(component);\n  }\n  addOrOverwriteComponent(component) {\n    const provider = this.getProvider(component.name);\n    if (provider.isComponentSet()) {\n      // delete the existing provider from the container, so we can register the new component\n      this.providers.delete(component.name);\n    }\n    this.addComponent(component);\n  }\n  /**\n   * getProvider provides a type safe interface where it can only be called with a field name\n   * present in NameServiceMapping interface.\n   *\n   * Firebase SDKs providing services should extend NameServiceMapping interface to register\n   * themselves.\n   */\n  getProvider(name) {\n    if (this.providers.has(name)) {\n      return this.providers.get(name);\n    }\n    // create a Provider for a service that hasn't registered with Firebase\n    const provider = new Provider(name, this);\n    this.providers.set(name, provider);\n    return provider;\n  }\n  getProviders() {\n    return Array.from(this.providers.values());\n  }\n}\nexport { Component, ComponentContainer, Provider };\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A container for all of the Logger instances\n */\nconst instances = [];\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 */\nvar LogLevel = /*#__PURE__*/function (LogLevel) {\n  LogLevel[LogLevel[\"DEBUG\"] = 0] = \"DEBUG\";\n  LogLevel[LogLevel[\"VERBOSE\"] = 1] = \"VERBOSE\";\n  LogLevel[LogLevel[\"INFO\"] = 2] = \"INFO\";\n  LogLevel[LogLevel[\"WARN\"] = 3] = \"WARN\";\n  LogLevel[LogLevel[\"ERROR\"] = 4] = \"ERROR\";\n  LogLevel[LogLevel[\"SILENT\"] = 5] = \"SILENT\";\n  return LogLevel;\n}(LogLevel || {});\nconst levelStringToEnum = {\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 * The default log level\n */\nconst defaultLogLevel = LogLevel.INFO;\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 * 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 = (instance, logType, ...args) => {\n  if (logType < instance.logLevel) {\n    return;\n  }\n  const now = new Date().toISOString();\n  const method = ConsoleMethod[logType];\n  if (method) {\n    console[method](`[${now}]  ${instance.name}:`, ...args);\n  } else {\n    throw new Error(`Attempted to log a message with an invalid logType (value: ${logType})`);\n  }\n};\nclass 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(name) {\n    this.name = name;\n    /**\n     * The log level of the given Logger instance.\n     */\n    this._logLevel = defaultLogLevel;\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    this._logHandler = defaultLogHandler;\n    /**\n     * The optional, additional, user-defined log handler for the Logger instance.\n     */\n    this._userLogHandler = null;\n    /**\n     * Capture the current instance for later use\n     */\n    instances.push(this);\n  }\n  get logLevel() {\n    return this._logLevel;\n  }\n  set logLevel(val) {\n    if (!(val in LogLevel)) {\n      throw new TypeError(`Invalid value \"${val}\" assigned to \\`logLevel\\``);\n    }\n    this._logLevel = val;\n  }\n  // Workaround for setter/getter having to be the same type.\n  setLogLevel(val) {\n    this._logLevel = typeof val === 'string' ? levelStringToEnum[val] : val;\n  }\n  get logHandler() {\n    return this._logHandler;\n  }\n  set logHandler(val) {\n    if (typeof val !== 'function') {\n      throw new TypeError('Value assigned to `logHandler` must be a function');\n    }\n    this._logHandler = val;\n  }\n  get userLogHandler() {\n    return this._userLogHandler;\n  }\n  set userLogHandler(val) {\n    this._userLogHandler = val;\n  }\n  /**\n   * The functions below are all based on the `console` interface\n   */\n  debug(...args) {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.DEBUG, ...args);\n    this._logHandler(this, LogLevel.DEBUG, ...args);\n  }\n  log(...args) {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.VERBOSE, ...args);\n    this._logHandler(this, LogLevel.VERBOSE, ...args);\n  }\n  info(...args) {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.INFO, ...args);\n    this._logHandler(this, LogLevel.INFO, ...args);\n  }\n  warn(...args) {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.WARN, ...args);\n    this._logHandler(this, LogLevel.WARN, ...args);\n  }\n  error(...args) {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.ERROR, ...args);\n    this._logHandler(this, LogLevel.ERROR, ...args);\n  }\n}\nfunction setLogLevel(level) {\n  instances.forEach(inst => {\n    inst.setLogLevel(level);\n  });\n}\nfunction setUserLogHandler(logCallback, options) {\n  for (const instance of instances) {\n    let customLogLevel = 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 = (instance, level, ...args) => {\n        const message = args.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        }).filter(arg => arg).join(' ');\n        if (level >= (customLogLevel !== null && customLogLevel !== void 0 ? customLogLevel : instance.logLevel)) {\n          logCallback({\n            level: LogLevel[level].toLowerCase(),\n            message,\n            args,\n            type: instance.name\n          });\n        }\n      };\n    }\n  }\n}\nexport { LogLevel, Logger, setLogLevel, setUserLogHandler };\n","const instanceOfAny = (object, constructors) => constructors.some(c => object instanceof c);\nlet idbProxyableTypes;\nlet cursorAdvanceMethods;\n// This is a function to prevent it throwing up in node environments.\nfunction getIdbProxyableTypes() {\n  return idbProxyableTypes || (idbProxyableTypes = [IDBDatabase, IDBObjectStore, IDBIndex, IDBCursor, IDBTransaction]);\n}\n// This is a function to prevent it throwing up in node environments.\nfunction getCursorAdvanceMethods() {\n  return cursorAdvanceMethods || (cursorAdvanceMethods = [IDBCursor.prototype.advance, IDBCursor.prototype.continue, IDBCursor.prototype.continuePrimaryKey]);\n}\nconst cursorRequestMap = new WeakMap();\nconst transactionDoneMap = new WeakMap();\nconst transactionStoreNamesMap = new WeakMap();\nconst transformCache = new WeakMap();\nconst reverseTransformCache = new WeakMap();\nfunction promisifyRequest(request) {\n  const promise = new Promise((resolve, reject) => {\n    const unlisten = () => {\n      request.removeEventListener('success', success);\n      request.removeEventListener('error', error);\n    };\n    const success = () => {\n      resolve(wrap(request.result));\n      unlisten();\n    };\n    const error = () => {\n      reject(request.error);\n      unlisten();\n    };\n    request.addEventListener('success', success);\n    request.addEventListener('error', error);\n  });\n  promise.then(value => {\n    // Since cursoring reuses the IDBRequest (*sigh*), we cache it for later retrieval\n    // (see wrapFunction).\n    if (value instanceof IDBCursor) {\n      cursorRequestMap.set(value, request);\n    }\n    // Catching to avoid \"Uncaught Promise exceptions\"\n  }).catch(() => {});\n  // This mapping exists in reverseTransformCache but doesn't doesn't exist in transformCache. This\n  // is because we create many promises from a single IDBRequest.\n  reverseTransformCache.set(promise, request);\n  return promise;\n}\nfunction cacheDonePromiseForTransaction(tx) {\n  // Early bail if we've already created a done promise for this transaction.\n  if (transactionDoneMap.has(tx)) return;\n  const done = new Promise((resolve, reject) => {\n    const unlisten = () => {\n      tx.removeEventListener('complete', complete);\n      tx.removeEventListener('error', error);\n      tx.removeEventListener('abort', error);\n    };\n    const complete = () => {\n      resolve();\n      unlisten();\n    };\n    const error = () => {\n      reject(tx.error || new DOMException('AbortError', 'AbortError'));\n      unlisten();\n    };\n    tx.addEventListener('complete', complete);\n    tx.addEventListener('error', error);\n    tx.addEventListener('abort', error);\n  });\n  // Cache it for later retrieval.\n  transactionDoneMap.set(tx, done);\n}\nlet idbProxyTraps = {\n  get(target, prop, receiver) {\n    if (target instanceof IDBTransaction) {\n      // Special handling for transaction.done.\n      if (prop === 'done') return transactionDoneMap.get(target);\n      // Polyfill for objectStoreNames because of Edge.\n      if (prop === 'objectStoreNames') {\n        return target.objectStoreNames || transactionStoreNamesMap.get(target);\n      }\n      // Make tx.store return the only store in the transaction, or undefined if there are many.\n      if (prop === 'store') {\n        return receiver.objectStoreNames[1] ? undefined : receiver.objectStore(receiver.objectStoreNames[0]);\n      }\n    }\n    // Else transform whatever we get back.\n    return wrap(target[prop]);\n  },\n  set(target, prop, value) {\n    target[prop] = value;\n    return true;\n  },\n  has(target, prop) {\n    if (target instanceof IDBTransaction && (prop === 'done' || prop === 'store')) {\n      return true;\n    }\n    return prop in target;\n  }\n};\nfunction replaceTraps(callback) {\n  idbProxyTraps = callback(idbProxyTraps);\n}\nfunction wrapFunction(func) {\n  // Due to expected object equality (which is enforced by the caching in `wrap`), we\n  // only create one new func per func.\n  // Edge doesn't support objectStoreNames (booo), so we polyfill it here.\n  if (func === IDBDatabase.prototype.transaction && !('objectStoreNames' in IDBTransaction.prototype)) {\n    return function (storeNames, ...args) {\n      const tx = func.call(unwrap(this), storeNames, ...args);\n      transactionStoreNamesMap.set(tx, storeNames.sort ? storeNames.sort() : [storeNames]);\n      return wrap(tx);\n    };\n  }\n  // Cursor methods are special, as the behaviour is a little more different to standard IDB. In\n  // IDB, you advance the cursor and wait for a new 'success' on the IDBRequest that gave you the\n  // cursor. It's kinda like a promise that can resolve with many values. That doesn't make sense\n  // with real promises, so each advance methods returns a new promise for the cursor object, or\n  // undefined if the end of the cursor has been reached.\n  if (getCursorAdvanceMethods().includes(func)) {\n    return function (...args) {\n      // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n      // the original object.\n      func.apply(unwrap(this), args);\n      return wrap(cursorRequestMap.get(this));\n    };\n  }\n  return function (...args) {\n    // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n    // the original object.\n    return wrap(func.apply(unwrap(this), args));\n  };\n}\nfunction transformCachableValue(value) {\n  if (typeof value === 'function') return wrapFunction(value);\n  // This doesn't return, it just creates a 'done' promise for the transaction,\n  // which is later returned for transaction.done (see idbObjectHandler).\n  if (value instanceof IDBTransaction) cacheDonePromiseForTransaction(value);\n  if (instanceOfAny(value, getIdbProxyableTypes())) return new Proxy(value, idbProxyTraps);\n  // Return the same value back if we're not going to transform it.\n  return value;\n}\nfunction wrap(value) {\n  // We sometimes generate multiple promises from a single IDBRequest (eg when cursoring), because\n  // IDB is weird and a single IDBRequest can yield many responses, so these can't be cached.\n  if (value instanceof IDBRequest) return promisifyRequest(value);\n  // If we've already transformed this value before, reuse the transformed value.\n  // This is faster, but it also provides object equality.\n  if (transformCache.has(value)) return transformCache.get(value);\n  const newValue = transformCachableValue(value);\n  // Not all types are transformed.\n  // These may be primitive types, so they can't be WeakMap keys.\n  if (newValue !== value) {\n    transformCache.set(value, newValue);\n    reverseTransformCache.set(newValue, value);\n  }\n  return newValue;\n}\nconst unwrap = value => reverseTransformCache.get(value);\nexport { reverseTransformCache as a, instanceOfAny as i, replaceTraps as r, unwrap as u, wrap as w };","import { w as wrap, r as replaceTraps } from './wrap-idb-value.js';\nexport { u as unwrap, w as wrap } from './wrap-idb-value.js';\n\n/**\n * Open a database.\n *\n * @param name Name of the database.\n * @param version Schema version.\n * @param callbacks Additional callbacks.\n */\nfunction openDB(name, version, {\n  blocked,\n  upgrade,\n  blocking,\n  terminated\n} = {}) {\n  const request = indexedDB.open(name, version);\n  const openPromise = wrap(request);\n  if (upgrade) {\n    request.addEventListener('upgradeneeded', event => {\n      upgrade(wrap(request.result), event.oldVersion, event.newVersion, wrap(request.transaction), event);\n    });\n  }\n  if (blocked) {\n    request.addEventListener('blocked', event => blocked(\n    // Casting due to https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/1405\n    event.oldVersion, event.newVersion, event));\n  }\n  openPromise.then(db => {\n    if (terminated) db.addEventListener('close', () => terminated());\n    if (blocking) {\n      db.addEventListener('versionchange', event => blocking(event.oldVersion, event.newVersion, event));\n    }\n  }).catch(() => {});\n  return openPromise;\n}\n/**\n * Delete a database.\n *\n * @param name Name of the database.\n */\nfunction deleteDB(name, {\n  blocked\n} = {}) {\n  const request = indexedDB.deleteDatabase(name);\n  if (blocked) {\n    request.addEventListener('blocked', event => blocked(\n    // Casting due to https://github.com/microsoft/TypeScript-DOM-lib-generator/pull/1405\n    event.oldVersion, event));\n  }\n  return wrap(request).then(() => undefined);\n}\nconst readMethods = ['get', 'getKey', 'getAll', 'getAllKeys', 'count'];\nconst writeMethods = ['put', 'add', 'delete', 'clear'];\nconst cachedMethods = new Map();\nfunction getMethod(target, prop) {\n  if (!(target instanceof IDBDatabase && !(prop in target) && typeof prop === 'string')) {\n    return;\n  }\n  if (cachedMethods.get(prop)) return cachedMethods.get(prop);\n  const targetFuncName = prop.replace(/FromIndex$/, '');\n  const useIndex = prop !== targetFuncName;\n  const isWrite = writeMethods.includes(targetFuncName);\n  if (\n  // Bail if the target doesn't exist on the target. Eg, getAll isn't in Edge.\n  !(targetFuncName in (useIndex ? IDBIndex : IDBObjectStore).prototype) || !(isWrite || readMethods.includes(targetFuncName))) {\n    return;\n  }\n  const method = async function (storeName, ...args) {\n    // isWrite ? 'readwrite' : undefined gzipps better, but fails in Edge :(\n    const tx = this.transaction(storeName, isWrite ? 'readwrite' : 'readonly');\n    let target = tx.store;\n    if (useIndex) target = target.index(args.shift());\n    // Must reject if op rejects.\n    // If it's a write operation, must reject if tx.done rejects.\n    // Must reject with op rejection first.\n    // Must resolve with op value.\n    // Must handle both promises (no unhandled rejections)\n    return (await Promise.all([target[targetFuncName](...args), isWrite && tx.done]))[0];\n  };\n  cachedMethods.set(prop, method);\n  return method;\n}\nreplaceTraps(oldTraps => ({\n  ...oldTraps,\n  get: (target, prop, receiver) => getMethod(target, prop) || oldTraps.get(target, prop, receiver),\n  has: (target, prop) => !!getMethod(target, prop) || oldTraps.has(target, prop)\n}));\nexport { deleteDB, openDB };","import { Component, ComponentContainer } from '@firebase/component';\nimport { Logger, setUserLogHandler, setLogLevel as setLogLevel$1 } from '@firebase/logger';\nimport { ErrorFactory, getDefaultAppConfig, deepEqual, isBrowser, isWebWorker, FirebaseError, base64urlEncodeWithoutPadding, isIndexedDBAvailable, validateIndexedDBOpenable } from '@firebase/util';\nexport { FirebaseError } from '@firebase/util';\nimport { openDB } from 'idb';\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 */\nclass PlatformLoggerServiceImpl {\n  constructor(container) {\n    this.container = container;\n  }\n  // In initial implementation, this will be called by installations on\n  // auth token refresh, and installations will send this string.\n  getPlatformInfoString() {\n    const providers = this.container.getProviders();\n    // Loop through providers and get library/version pairs from any that are\n    // version components.\n    return providers.map(provider => {\n      if (isVersionServiceProvider(provider)) {\n        const service = provider.getImmediate();\n        return `${service.library}/${service.version}`;\n      } else {\n        return null;\n      }\n    }).filter(logString => logString).join(' ');\n  }\n}\n/**\n *\n * @param provider check if this provider provides a VersionService\n *\n * NOTE: Using Provider<'app-version'> is a hack to indicate that the provider\n * provides VersionService. The provider is not necessarily a 'app-version'\n * provider.\n */\nfunction isVersionServiceProvider(provider) {\n  const component = provider.getComponent();\n  return (component === null || component === void 0 ? void 0 : component.type) === \"VERSION\" /* ComponentType.VERSION */;\n}\nconst name$q = \"@firebase/app\";\nconst version$1 = \"0.10.18\";\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 */\nconst logger = new Logger('@firebase/app');\nconst name$p = \"@firebase/app-compat\";\nconst name$o = \"@firebase/analytics-compat\";\nconst name$n = \"@firebase/analytics\";\nconst name$m = \"@firebase/app-check-compat\";\nconst name$l = \"@firebase/app-check\";\nconst name$k = \"@firebase/auth\";\nconst name$j = \"@firebase/auth-compat\";\nconst name$i = \"@firebase/database\";\nconst name$h = \"@firebase/data-connect\";\nconst name$g = \"@firebase/database-compat\";\nconst name$f = \"@firebase/functions\";\nconst name$e = \"@firebase/functions-compat\";\nconst name$d = \"@firebase/installations\";\nconst name$c = \"@firebase/installations-compat\";\nconst name$b = \"@firebase/messaging\";\nconst name$a = \"@firebase/messaging-compat\";\nconst name$9 = \"@firebase/performance\";\nconst name$8 = \"@firebase/performance-compat\";\nconst name$7 = \"@firebase/remote-config\";\nconst name$6 = \"@firebase/remote-config-compat\";\nconst name$5 = \"@firebase/storage\";\nconst name$4 = \"@firebase/storage-compat\";\nconst name$3 = \"@firebase/firestore\";\nconst name$2 = \"@firebase/vertexai\";\nconst name$1 = \"@firebase/firestore-compat\";\nconst name = \"firebase\";\nconst version = \"11.2.0\";\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 default app name\n *\n * @internal\n */\nconst DEFAULT_ENTRY_NAME = '[DEFAULT]';\nconst PLATFORM_LOG_STRING = {\n  [name$q]: 'fire-core',\n  [name$p]: 'fire-core-compat',\n  [name$n]: 'fire-analytics',\n  [name$o]: 'fire-analytics-compat',\n  [name$l]: 'fire-app-check',\n  [name$m]: 'fire-app-check-compat',\n  [name$k]: 'fire-auth',\n  [name$j]: 'fire-auth-compat',\n  [name$i]: 'fire-rtdb',\n  [name$h]: 'fire-data-connect',\n  [name$g]: 'fire-rtdb-compat',\n  [name$f]: 'fire-fn',\n  [name$e]: 'fire-fn-compat',\n  [name$d]: 'fire-iid',\n  [name$c]: 'fire-iid-compat',\n  [name$b]: 'fire-fcm',\n  [name$a]: 'fire-fcm-compat',\n  [name$9]: 'fire-perf',\n  [name$8]: 'fire-perf-compat',\n  [name$7]: 'fire-rc',\n  [name$6]: 'fire-rc-compat',\n  [name$5]: 'fire-gcs',\n  [name$4]: 'fire-gcs-compat',\n  [name$3]: 'fire-fst',\n  [name$1]: 'fire-fst-compat',\n  [name$2]: 'fire-vertex',\n  'fire-js': 'fire-js',\n  // Platform identifier for JS SDK.\n  [name]: 'fire-js-all'\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 * @internal\n */\nconst _apps = new Map();\n/**\n * @internal\n */\nconst _serverApps = new Map();\n/**\n * Registered components.\n *\n * @internal\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nconst _components = new Map();\n/**\n * @param component - the component being added to this app's container\n *\n * @internal\n */\nfunction _addComponent(app, component) {\n  try {\n    app.container.addComponent(component);\n  } catch (e) {\n    logger.debug(`Component ${component.name} failed to register with FirebaseApp ${app.name}`, e);\n  }\n}\n/**\n *\n * @internal\n */\nfunction _addOrOverwriteComponent(app, component) {\n  app.container.addOrOverwriteComponent(component);\n}\n/**\n *\n * @param component - the component to register\n * @returns whether or not the component is registered successfully\n *\n * @internal\n */\nfunction _registerComponent(component) {\n  const componentName = component.name;\n  if (_components.has(componentName)) {\n    logger.debug(`There were multiple attempts to register component ${componentName}.`);\n    return false;\n  }\n  _components.set(componentName, component);\n  // add the component to existing app instances\n  for (const app of _apps.values()) {\n    _addComponent(app, component);\n  }\n  for (const serverApp of _serverApps.values()) {\n    _addComponent(serverApp, component);\n  }\n  return true;\n}\n/**\n *\n * @param app - FirebaseApp instance\n * @param name - service name\n *\n * @returns the provider for the service with the matching name\n *\n * @internal\n */\nfunction _getProvider(app, name) {\n  const heartbeatController = app.container.getProvider('heartbeat').getImmediate({\n    optional: true\n  });\n  if (heartbeatController) {\n    void heartbeatController.triggerHeartbeat();\n  }\n  return app.container.getProvider(name);\n}\n/**\n *\n * @param app - FirebaseApp instance\n * @param name - service name\n * @param instanceIdentifier - service instance identifier in case the service supports multiple instances\n *\n * @internal\n */\nfunction _removeServiceInstance(app, name, instanceIdentifier = DEFAULT_ENTRY_NAME) {\n  _getProvider(app, name).clearInstance(instanceIdentifier);\n}\n/**\n *\n * @param obj - an object of type FirebaseApp or FirebaseOptions.\n *\n * @returns true if the provide object is of type FirebaseApp.\n *\n * @internal\n */\nfunction _isFirebaseApp(obj) {\n  return obj.options !== undefined;\n}\n/**\n *\n * @param obj - an object of type FirebaseApp.\n *\n * @returns true if the provided object is of type FirebaseServerAppImpl.\n *\n * @internal\n */\nfunction _isFirebaseServerApp(obj) {\n  return obj.settings !== undefined;\n}\n/**\n * Test only\n *\n * @internal\n */\nfunction _clearComponents() {\n  _components.clear();\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 */\nconst ERRORS = {\n  [\"no-app\" /* AppError.NO_APP */]: \"No Firebase App '{$appName}' has been created - \" + 'call initializeApp() first',\n  [\"bad-app-name\" /* AppError.BAD_APP_NAME */]: \"Illegal App name: '{$appName}'\",\n  [\"duplicate-app\" /* AppError.DUPLICATE_APP */]: \"Firebase App named '{$appName}' already exists with different options or config\",\n  [\"app-deleted\" /* AppError.APP_DELETED */]: \"Firebase App named '{$appName}' already deleted\",\n  [\"server-app-deleted\" /* AppError.SERVER_APP_DELETED */]: 'Firebase Server App has been deleted',\n  [\"no-options\" /* AppError.NO_OPTIONS */]: 'Need to provide options, when not being deployed to hosting via source.',\n  [\"invalid-app-argument\" /* AppError.INVALID_APP_ARGUMENT */]: 'firebase.{$appName}() takes either no argument or a ' + 'Firebase App instance.',\n  [\"invalid-log-argument\" /* AppError.INVALID_LOG_ARGUMENT */]: 'First argument to `onLog` must be null or a function.',\n  [\"idb-open\" /* AppError.IDB_OPEN */]: 'Error thrown when opening IndexedDB. Original error: {$originalErrorMessage}.',\n  [\"idb-get\" /* AppError.IDB_GET */]: 'Error thrown when reading from IndexedDB. Original error: {$originalErrorMessage}.',\n  [\"idb-set\" /* AppError.IDB_WRITE */]: 'Error thrown when writing to IndexedDB. Original error: {$originalErrorMessage}.',\n  [\"idb-delete\" /* AppError.IDB_DELETE */]: 'Error thrown when deleting from IndexedDB. Original error: {$originalErrorMessage}.',\n  [\"finalization-registry-not-supported\" /* AppError.FINALIZATION_REGISTRY_NOT_SUPPORTED */]: 'FirebaseServerApp deleteOnDeref field defined but the JS runtime does not support FinalizationRegistry.',\n  [\"invalid-server-app-environment\" /* AppError.INVALID_SERVER_APP_ENVIRONMENT */]: 'FirebaseServerApp is not for use in browser environments.'\n};\nconst ERROR_FACTORY = new ErrorFactory('app', 'Firebase', ERRORS);\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 */\nclass FirebaseAppImpl {\n  constructor(options, config, container) {\n    this._isDeleted = false;\n    this._options = Object.assign({}, options);\n    this._config = Object.assign({}, config);\n    this._name = config.name;\n    this._automaticDataCollectionEnabled = config.automaticDataCollectionEnabled;\n    this._container = container;\n    this.container.addComponent(new Component('app', () => this, \"PUBLIC\" /* ComponentType.PUBLIC */));\n  }\n  get automaticDataCollectionEnabled() {\n    this.checkDestroyed();\n    return this._automaticDataCollectionEnabled;\n  }\n  set automaticDataCollectionEnabled(val) {\n    this.checkDestroyed();\n    this._automaticDataCollectionEnabled = val;\n  }\n  get name() {\n    this.checkDestroyed();\n    return this._name;\n  }\n  get options() {\n    this.checkDestroyed();\n    return this._options;\n  }\n  get config() {\n    this.checkDestroyed();\n    return this._config;\n  }\n  get container() {\n    return this._container;\n  }\n  get isDeleted() {\n    return this._isDeleted;\n  }\n  set isDeleted(val) {\n    this._isDeleted = val;\n  }\n  /**\n   * This function will throw an Error if the App has already been deleted -\n   * use before performing API actions on the App.\n   */\n  checkDestroyed() {\n    if (this.isDeleted) {\n      throw ERROR_FACTORY.create(\"app-deleted\" /* AppError.APP_DELETED */, {\n        appName: this._name\n      });\n    }\n  }\n}\n\n/**\n * @license\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass FirebaseServerAppImpl extends FirebaseAppImpl {\n  constructor(options, serverConfig, name, container) {\n    // Build configuration parameters for the FirebaseAppImpl base class.\n    const automaticDataCollectionEnabled = serverConfig.automaticDataCollectionEnabled !== undefined ? serverConfig.automaticDataCollectionEnabled : false;\n    // Create the FirebaseAppSettings object for the FirebaseAppImp constructor.\n    const config = {\n      name,\n      automaticDataCollectionEnabled\n    };\n    if (options.apiKey !== undefined) {\n      // Construct the parent FirebaseAppImp object.\n      super(options, config, container);\n    } else {\n      const appImpl = options;\n      super(appImpl.options, config, container);\n    }\n    // Now construct the data for the FirebaseServerAppImpl.\n    this._serverConfig = Object.assign({\n      automaticDataCollectionEnabled\n    }, serverConfig);\n    this._finalizationRegistry = null;\n    if (typeof FinalizationRegistry !== 'undefined') {\n      this._finalizationRegistry = new FinalizationRegistry(() => {\n        this.automaticCleanup();\n      });\n    }\n    this._refCount = 0;\n    this.incRefCount(this._serverConfig.releaseOnDeref);\n    // Do not retain a hard reference to the dref object, otherwise the FinalizationRegistry\n    // will never trigger.\n    this._serverConfig.releaseOnDeref = undefined;\n    serverConfig.releaseOnDeref = undefined;\n    registerVersion(name$q, version$1, 'serverapp');\n  }\n  toJSON() {\n    return undefined;\n  }\n  get refCount() {\n    return this._refCount;\n  }\n  // Increment the reference count of this server app. If an object is provided, register it\n  // with the finalization registry.\n  incRefCount(obj) {\n    if (this.isDeleted) {\n      return;\n    }\n    this._refCount++;\n    if (obj !== undefined && this._finalizationRegistry !== null) {\n      this._finalizationRegistry.register(obj, this);\n    }\n  }\n  // Decrement the reference count.\n  decRefCount() {\n    if (this.isDeleted) {\n      return 0;\n    }\n    return --this._refCount;\n  }\n  // Invoked by the FinalizationRegistry callback to note that this app should go through its\n  // reference counts and delete itself if no reference count remain. The coordinating logic that\n  // handles this is in deleteApp(...).\n  automaticCleanup() {\n    void deleteApp(this);\n  }\n  get settings() {\n    this.checkDestroyed();\n    return this._serverConfig;\n  }\n  /**\n   * This function will throw an Error if the App has already been deleted -\n   * use before performing API actions on the App.\n   */\n  checkDestroyed() {\n    if (this.isDeleted) {\n      throw ERROR_FACTORY.create(\"server-app-deleted\" /* AppError.SERVER_APP_DELETED */);\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 current SDK version.\n *\n * @public\n */\nconst SDK_VERSION = version;\nfunction initializeApp(_options, rawConfig = {}) {\n  let options = _options;\n  if (typeof rawConfig !== 'object') {\n    const name = rawConfig;\n    rawConfig = {\n      name\n    };\n  }\n  const config = Object.assign({\n    name: DEFAULT_ENTRY_NAME,\n    automaticDataCollectionEnabled: false\n  }, rawConfig);\n  const name = config.name;\n  if (typeof name !== 'string' || !name) {\n    throw ERROR_FACTORY.create(\"bad-app-name\" /* AppError.BAD_APP_NAME */, {\n      appName: String(name)\n    });\n  }\n  options || (options = getDefaultAppConfig());\n  if (!options) {\n    throw ERROR_FACTORY.create(\"no-options\" /* AppError.NO_OPTIONS */);\n  }\n  const existingApp = _apps.get(name);\n  if (existingApp) {\n    // return the existing app if options and config deep equal the ones in the existing app.\n    if (deepEqual(options, existingApp.options) && deepEqual(config, existingApp.config)) {\n      return existingApp;\n    } else {\n      throw ERROR_FACTORY.create(\"duplicate-app\" /* AppError.DUPLICATE_APP */, {\n        appName: name\n      });\n    }\n  }\n  const container = new ComponentContainer(name);\n  for (const component of _components.values()) {\n    container.addComponent(component);\n  }\n  const newApp = new FirebaseAppImpl(options, config, container);\n  _apps.set(name, newApp);\n  return newApp;\n}\nfunction initializeServerApp(_options, _serverAppConfig) {\n  if (isBrowser() && !isWebWorker()) {\n    // FirebaseServerApp isn't designed to be run in browsers.\n    throw ERROR_FACTORY.create(\"invalid-server-app-environment\" /* AppError.INVALID_SERVER_APP_ENVIRONMENT */);\n  }\n  if (_serverAppConfig.automaticDataCollectionEnabled === undefined) {\n    _serverAppConfig.automaticDataCollectionEnabled = false;\n  }\n  let appOptions;\n  if (_isFirebaseApp(_options)) {\n    appOptions = _options.options;\n  } else {\n    appOptions = _options;\n  }\n  // Build an app name based on a hash of the configuration options.\n  const nameObj = Object.assign(Object.assign({}, _serverAppConfig), appOptions);\n  // However, Do not mangle the name based on releaseOnDeref, since it will vary between the\n  // construction of FirebaseServerApp instances. For example, if the object is the request headers.\n  if (nameObj.releaseOnDeref !== undefined) {\n    delete nameObj.releaseOnDeref;\n  }\n  const hashCode = s => {\n    return [...s].reduce((hash, c) => Math.imul(31, hash) + c.charCodeAt(0) | 0, 0);\n  };\n  if (_serverAppConfig.releaseOnDeref !== undefined) {\n    if (typeof FinalizationRegistry === 'undefined') {\n      throw ERROR_FACTORY.create(\"finalization-registry-not-supported\" /* AppError.FINALIZATION_REGISTRY_NOT_SUPPORTED */, {});\n    }\n  }\n  const nameString = '' + hashCode(JSON.stringify(nameObj));\n  const existingApp = _serverApps.get(nameString);\n  if (existingApp) {\n    existingApp.incRefCount(_serverAppConfig.releaseOnDeref);\n    return existingApp;\n  }\n  const container = new ComponentContainer(nameString);\n  for (const component of _components.values()) {\n    container.addComponent(component);\n  }\n  const newApp = new FirebaseServerAppImpl(appOptions, _serverAppConfig, nameString, container);\n  _serverApps.set(nameString, newApp);\n  return newApp;\n}\n/**\n * Retrieves a {@link @firebase/app#FirebaseApp} instance.\n *\n * When called with no arguments, the default app is returned. When an app name\n * is provided, the app corresponding to that name is returned.\n *\n * An exception is thrown if the app being retrieved has not yet been\n * initialized.\n *\n * @example\n * ```javascript\n * // Return the default app\n * const app = getApp();\n * ```\n *\n * @example\n * ```javascript\n * // Return a named app\n * const otherApp = getApp(\"otherApp\");\n * ```\n *\n * @param name - Optional name of the app to return. If no name is\n *   provided, the default is `\"[DEFAULT]\"`.\n *\n * @returns The app corresponding to the provided app name.\n *   If no app name is provided, the default app is returned.\n *\n * @public\n */\nfunction getApp(name = DEFAULT_ENTRY_NAME) {\n  const app = _apps.get(name);\n  if (!app && name === DEFAULT_ENTRY_NAME && getDefaultAppConfig()) {\n    return initializeApp();\n  }\n  if (!app) {\n    throw ERROR_FACTORY.create(\"no-app\" /* AppError.NO_APP */, {\n      appName: name\n    });\n  }\n  return app;\n}\n/**\n * A (read-only) array of all initialized apps.\n * @public\n */\nfunction getApps() {\n  return Array.from(_apps.values());\n}\n/**\n * Renders this app unusable and frees the resources of all associated\n * services.\n *\n * @example\n * ```javascript\n * deleteApp(app)\n *   .then(function() {\n *     console.log(\"App deleted successfully\");\n *   })\n *   .catch(function(error) {\n *     console.log(\"Error deleting app:\", error);\n *   });\n * ```\n *\n * @public\n */\nasync function deleteApp(app) {\n  let cleanupProviders = false;\n  const name = app.name;\n  if (_apps.has(name)) {\n    cleanupProviders = true;\n    _apps.delete(name);\n  } else if (_serverApps.has(name)) {\n    const firebaseServerApp = app;\n    if (firebaseServerApp.decRefCount() <= 0) {\n      _serverApps.delete(name);\n      cleanupProviders = true;\n    }\n  }\n  if (cleanupProviders) {\n    await Promise.all(app.container.getProviders().map(provider => provider.delete()));\n    app.isDeleted = true;\n  }\n}\n/**\n * Registers a library's name and version for platform logging purposes.\n * @param library - Name of 1p or 3p library (e.g. firestore, angularfire)\n * @param version - Current version of that library.\n * @param variant - Bundle variant, e.g., node, rn, etc.\n *\n * @public\n */\nfunction registerVersion(libraryKeyOrName, version, variant) {\n  var _a;\n  // TODO: We can use this check to whitelist strings when/if we set up\n  // a good whitelist system.\n  let library = (_a = PLATFORM_LOG_STRING[libraryKeyOrName]) !== null && _a !== void 0 ? _a : libraryKeyOrName;\n  if (variant) {\n    library += `-${variant}`;\n  }\n  const libraryMismatch = library.match(/\\s|\\//);\n  const versionMismatch = version.match(/\\s|\\//);\n  if (libraryMismatch || versionMismatch) {\n    const warning = [`Unable to register library \"${library}\" with version \"${version}\":`];\n    if (libraryMismatch) {\n      warning.push(`library name \"${library}\" contains illegal characters (whitespace or \"/\")`);\n    }\n    if (libraryMismatch && versionMismatch) {\n      warning.push('and');\n    }\n    if (versionMismatch) {\n      warning.push(`version name \"${version}\" contains illegal characters (whitespace or \"/\")`);\n    }\n    logger.warn(warning.join(' '));\n    return;\n  }\n  _registerComponent(new Component(`${library}-version`, () => ({\n    library,\n    version\n  }), \"VERSION\" /* ComponentType.VERSION */));\n}\n/**\n * Sets log handler for all Firebase SDKs.\n * @param logCallback - An optional custom log handler that executes user code whenever\n * the Firebase SDK makes a logging call.\n *\n * @public\n */\nfunction onLog(logCallback, options) {\n  if (logCallback !== null && typeof logCallback !== 'function') {\n    throw ERROR_FACTORY.create(\"invalid-log-argument\" /* AppError.INVALID_LOG_ARGUMENT */);\n  }\n  setUserLogHandler(logCallback, options);\n}\n/**\n * Sets log level for all Firebase SDKs.\n *\n * All of the log types above the current log level are captured (i.e. if\n * you set the log level to `info`, errors are logged, but `debug` and\n * `verbose` logs are not).\n *\n * @public\n */\nfunction setLogLevel(logLevel) {\n  setLogLevel$1(logLevel);\n}\n\n/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst DB_NAME = 'firebase-heartbeat-database';\nconst DB_VERSION = 1;\nconst STORE_NAME = 'firebase-heartbeat-store';\nlet dbPromise = null;\nfunction getDbPromise() {\n  if (!dbPromise) {\n    dbPromise = openDB(DB_NAME, DB_VERSION, {\n      upgrade: (db, oldVersion) => {\n        // We don't use 'break' in this switch statement, the fall-through\n        // behavior is what we want, because if there are multiple versions between\n        // the old version and the current version, we want ALL the migrations\n        // that correspond to those versions to run, not only the last one.\n        // eslint-disable-next-line default-case\n        switch (oldVersion) {\n          case 0:\n            try {\n              db.createObjectStore(STORE_NAME);\n            } catch (e) {\n              // Safari/iOS browsers throw occasional exceptions on\n              // db.createObjectStore() that may be a bug. Avoid blocking\n              // the rest of the app functionality.\n              console.warn(e);\n            }\n        }\n      }\n    }).catch(e => {\n      throw ERROR_FACTORY.create(\"idb-open\" /* AppError.IDB_OPEN */, {\n        originalErrorMessage: e.message\n      });\n    });\n  }\n  return dbPromise;\n}\nasync function readHeartbeatsFromIndexedDB(app) {\n  try {\n    const db = await getDbPromise();\n    const tx = db.transaction(STORE_NAME);\n    const result = await tx.objectStore(STORE_NAME).get(computeKey(app));\n    // We already have the value but tx.done can throw,\n    // so we need to await it here to catch errors\n    await tx.done;\n    return result;\n  } catch (e) {\n    if (e instanceof FirebaseError) {\n      logger.warn(e.message);\n    } else {\n      const idbGetError = ERROR_FACTORY.create(\"idb-get\" /* AppError.IDB_GET */, {\n        originalErrorMessage: e === null || e === void 0 ? void 0 : e.message\n      });\n      logger.warn(idbGetError.message);\n    }\n  }\n}\nasync function writeHeartbeatsToIndexedDB(app, heartbeatObject) {\n  try {\n    const db = await getDbPromise();\n    const tx = db.transaction(STORE_NAME, 'readwrite');\n    const objectStore = tx.objectStore(STORE_NAME);\n    await objectStore.put(heartbeatObject, computeKey(app));\n    await tx.done;\n  } catch (e) {\n    if (e instanceof FirebaseError) {\n      logger.warn(e.message);\n    } else {\n      const idbGetError = ERROR_FACTORY.create(\"idb-set\" /* AppError.IDB_WRITE */, {\n        originalErrorMessage: e === null || e === void 0 ? void 0 : e.message\n      });\n      logger.warn(idbGetError.message);\n    }\n  }\n}\nfunction computeKey(app) {\n  return `${app.name}!${app.options.appId}`;\n}\n\n/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst MAX_HEADER_BYTES = 1024;\n// 30 days\nconst STORED_HEARTBEAT_RETENTION_MAX_MILLIS = 30 * 24 * 60 * 60 * 1000;\nclass HeartbeatServiceImpl {\n  constructor(container) {\n    this.container = container;\n    /**\n     * In-memory cache for heartbeats, used by getHeartbeatsHeader() to generate\n     * the header string.\n     * Stores one record per date. This will be consolidated into the standard\n     * format of one record per user agent string before being sent as a header.\n     * Populated from indexedDB when the controller is instantiated and should\n     * be kept in sync with indexedDB.\n     * Leave public for easier testing.\n     */\n    this._heartbeatsCache = null;\n    const app = this.container.getProvider('app').getImmediate();\n    this._storage = new HeartbeatStorageImpl(app);\n    this._heartbeatsCachePromise = this._storage.read().then(result => {\n      this._heartbeatsCache = result;\n      return result;\n    });\n  }\n  /**\n   * Called to report a heartbeat. The function will generate\n   * a HeartbeatsByUserAgent object, update heartbeatsCache, and persist it\n   * to IndexedDB.\n   * Note that we only store one heartbeat per day. So if a heartbeat for today is\n   * already logged, subsequent calls to this function in the same day will be ignored.\n   */\n  async triggerHeartbeat() {\n    var _a, _b;\n    try {\n      const platformLogger = this.container.getProvider('platform-logger').getImmediate();\n      // This is the \"Firebase user agent\" string from the platform logger\n      // service, not the browser user agent.\n      const agent = platformLogger.getPlatformInfoString();\n      const date = getUTCDateString();\n      if (((_a = this._heartbeatsCache) === null || _a === void 0 ? void 0 : _a.heartbeats) == null) {\n        this._heartbeatsCache = await this._heartbeatsCachePromise;\n        // If we failed to construct a heartbeats cache, then return immediately.\n        if (((_b = this._heartbeatsCache) === null || _b === void 0 ? void 0 : _b.heartbeats) == null) {\n          return;\n        }\n      }\n      // Do not store a heartbeat if one is already stored for this day\n      // or if a header has already been sent today.\n      if (this._heartbeatsCache.lastSentHeartbeatDate === date || this._heartbeatsCache.heartbeats.some(singleDateHeartbeat => singleDateHeartbeat.date === date)) {\n        return;\n      } else {\n        // There is no entry for this date. Create one.\n        this._heartbeatsCache.heartbeats.push({\n          date,\n          agent\n        });\n      }\n      // Remove entries older than 30 days.\n      this._heartbeatsCache.heartbeats = this._heartbeatsCache.heartbeats.filter(singleDateHeartbeat => {\n        const hbTimestamp = new Date(singleDateHeartbeat.date).valueOf();\n        const now = Date.now();\n        return now - hbTimestamp <= STORED_HEARTBEAT_RETENTION_MAX_MILLIS;\n      });\n      return this._storage.overwrite(this._heartbeatsCache);\n    } catch (e) {\n      logger.warn(e);\n    }\n  }\n  /**\n   * Returns a base64 encoded string which can be attached to the heartbeat-specific header directly.\n   * It also clears all heartbeats from memory as well as in IndexedDB.\n   *\n   * NOTE: Consuming product SDKs should not send the header if this method\n   * returns an empty string.\n   */\n  async getHeartbeatsHeader() {\n    var _a;\n    try {\n      if (this._heartbeatsCache === null) {\n        await this._heartbeatsCachePromise;\n      }\n      // If it's still null or the array is empty, there is no data to send.\n      if (((_a = this._heartbeatsCache) === null || _a === void 0 ? void 0 : _a.heartbeats) == null || this._heartbeatsCache.heartbeats.length === 0) {\n        return '';\n      }\n      const date = getUTCDateString();\n      // Extract as many heartbeats from the cache as will fit under the size limit.\n      const {\n        heartbeatsToSend,\n        unsentEntries\n      } = extractHeartbeatsForHeader(this._heartbeatsCache.heartbeats);\n      const headerString = base64urlEncodeWithoutPadding(JSON.stringify({\n        version: 2,\n        heartbeats: heartbeatsToSend\n      }));\n      // Store last sent date to prevent another being logged/sent for the same day.\n      this._heartbeatsCache.lastSentHeartbeatDate = date;\n      if (unsentEntries.length > 0) {\n        // Store any unsent entries if they exist.\n        this._heartbeatsCache.heartbeats = unsentEntries;\n        // This seems more likely than emptying the array (below) to lead to some odd state\n        // since the cache isn't empty and this will be called again on the next request,\n        // and is probably safest if we await it.\n        await this._storage.overwrite(this._heartbeatsCache);\n      } else {\n        this._heartbeatsCache.heartbeats = [];\n        // Do not wait for this, to reduce latency.\n        void this._storage.overwrite(this._heartbeatsCache);\n      }\n      return headerString;\n    } catch (e) {\n      logger.warn(e);\n      return '';\n    }\n  }\n}\nfunction getUTCDateString() {\n  const today = new Date();\n  // Returns date format 'YYYY-MM-DD'\n  return today.toISOString().substring(0, 10);\n}\nfunction extractHeartbeatsForHeader(heartbeatsCache, maxSize = MAX_HEADER_BYTES) {\n  // Heartbeats grouped by user agent in the standard format to be sent in\n  // the header.\n  const heartbeatsToSend = [];\n  // Single date format heartbeats that are not sent.\n  let unsentEntries = heartbeatsCache.slice();\n  for (const singleDateHeartbeat of heartbeatsCache) {\n    // Look for an existing entry with the same user agent.\n    const heartbeatEntry = heartbeatsToSend.find(hb => hb.agent === singleDateHeartbeat.agent);\n    if (!heartbeatEntry) {\n      // If no entry for this user agent exists, create one.\n      heartbeatsToSend.push({\n        agent: singleDateHeartbeat.agent,\n        dates: [singleDateHeartbeat.date]\n      });\n      if (countBytes(heartbeatsToSend) > maxSize) {\n        // If the header would exceed max size, remove the added heartbeat\n        // entry and stop adding to the header.\n        heartbeatsToSend.pop();\n        break;\n      }\n    } else {\n      heartbeatEntry.dates.push(singleDateHeartbeat.date);\n      // If the header would exceed max size, remove the added date\n      // and stop adding to the header.\n      if (countBytes(heartbeatsToSend) > maxSize) {\n        heartbeatEntry.dates.pop();\n        break;\n      }\n    }\n    // Pop unsent entry from queue. (Skipped if adding the entry exceeded\n    // quota and the loop breaks early.)\n    unsentEntries = unsentEntries.slice(1);\n  }\n  return {\n    heartbeatsToSend,\n    unsentEntries\n  };\n}\nclass HeartbeatStorageImpl {\n  constructor(app) {\n    this.app = app;\n    this._canUseIndexedDBPromise = this.runIndexedDBEnvironmentCheck();\n  }\n  async runIndexedDBEnvironmentCheck() {\n    if (!isIndexedDBAvailable()) {\n      return false;\n    } else {\n      return validateIndexedDBOpenable().then(() => true).catch(() => false);\n    }\n  }\n  /**\n   * Read all heartbeats.\n   */\n  async read() {\n    const canUseIndexedDB = await this._canUseIndexedDBPromise;\n    if (!canUseIndexedDB) {\n      return {\n        heartbeats: []\n      };\n    } else {\n      const idbHeartbeatObject = await readHeartbeatsFromIndexedDB(this.app);\n      if (idbHeartbeatObject === null || idbHeartbeatObject === void 0 ? void 0 : idbHeartbeatObject.heartbeats) {\n        return idbHeartbeatObject;\n      } else {\n        return {\n          heartbeats: []\n        };\n      }\n    }\n  }\n  // overwrite the storage with the provided heartbeats\n  async overwrite(heartbeatsObject) {\n    var _a;\n    const canUseIndexedDB = await this._canUseIndexedDBPromise;\n    if (!canUseIndexedDB) {\n      return;\n    } else {\n      const existingHeartbeatsObject = await this.read();\n      return writeHeartbeatsToIndexedDB(this.app, {\n        lastSentHeartbeatDate: (_a = heartbeatsObject.lastSentHeartbeatDate) !== null && _a !== void 0 ? _a : existingHeartbeatsObject.lastSentHeartbeatDate,\n        heartbeats: heartbeatsObject.heartbeats\n      });\n    }\n  }\n  // add heartbeats\n  async add(heartbeatsObject) {\n    var _a;\n    const canUseIndexedDB = await this._canUseIndexedDBPromise;\n    if (!canUseIndexedDB) {\n      return;\n    } else {\n      const existingHeartbeatsObject = await this.read();\n      return writeHeartbeatsToIndexedDB(this.app, {\n        lastSentHeartbeatDate: (_a = heartbeatsObject.lastSentHeartbeatDate) !== null && _a !== void 0 ? _a : existingHeartbeatsObject.lastSentHeartbeatDate,\n        heartbeats: [...existingHeartbeatsObject.heartbeats, ...heartbeatsObject.heartbeats]\n      });\n    }\n  }\n}\n/**\n * Calculate bytes of a HeartbeatsByUserAgent array after being wrapped\n * in a platform logging header JSON object, stringified, and converted\n * to base 64.\n */\nfunction countBytes(heartbeatsCache) {\n  // base64 has a restricted set of characters, all of which should be 1 byte.\n  return base64urlEncodeWithoutPadding(\n  // heartbeatsCache wrapper properties\n  JSON.stringify({\n    version: 2,\n    heartbeats: heartbeatsCache\n  })).length;\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 */\nfunction registerCoreComponents(variant) {\n  _registerComponent(new Component('platform-logger', container => new PlatformLoggerServiceImpl(container), \"PRIVATE\" /* ComponentType.PRIVATE */));\n  _registerComponent(new Component('heartbeat', container => new HeartbeatServiceImpl(container), \"PRIVATE\" /* ComponentType.PRIVATE */));\n  // Register `app` package.\n  registerVersion(name$q, version$1, variant);\n  // BUILD_TARGET will be replaced by values like esm2017, cjs2017, etc during the compilation\n  registerVersion(name$q, version$1, 'esm2017');\n  // Register platform SDK identifier (no version).\n  registerVersion('fire-js', '');\n}\n\n/**\n * Firebase App\n *\n * @remarks This package coordinates the communication between the different Firebase components\n * @packageDocumentation\n */\nregisterCoreComponents('');\nexport { SDK_VERSION, DEFAULT_ENTRY_NAME as _DEFAULT_ENTRY_NAME, _addComponent, _addOrOverwriteComponent, _apps, _clearComponents, _components, _getProvider, _isFirebaseApp, _isFirebaseServerApp, _registerComponent, _removeServiceInstance, _serverApps, deleteApp, getApp, getApps, initializeApp, initializeServerApp, onLog, registerVersion, setLogLevel };\n","import { _getProvider, getApp, SDK_VERSION as SDK_VERSION$1, _registerComponent, registerVersion } from '@firebase/app';\nimport { Component, ComponentContainer, Provider } from '@firebase/component';\nimport { stringify, jsonEval, contains, assert, isNodeSdk, stringToByteArray, Sha1, base64, deepCopy, base64Encode, isMobileCordova, stringLength, Deferred, safeGet, isAdmin, isValidFormat, isEmpty, isReactNative, assertionError, map, querystring, errorPrefix, getModularInstance, getDefaultEmulatorHostnameAndPort, createMockUserToken } from '@firebase/util';\nimport { Logger, LogLevel } from '@firebase/logger';\nconst name = \"@firebase/database\";\nconst version = \"1.0.11\";\n\n/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/** The semver (www.semver.org) version of the SDK. */\nlet SDK_VERSION = '';\n/**\n * SDK_VERSION should be set before any database instance is created\n * @internal\n */\nfunction setSDKVersion(version) {\n  SDK_VERSION = version;\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 * 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 */\nclass DOMStorageWrapper {\n  /**\n   * @param domStorage_ - The underlying storage object (e.g. localStorage or sessionStorage)\n   */\n  constructor(domStorage_) {\n    this.domStorage_ = domStorage_;\n    // Use a prefix to avoid collisions with other stuff saved by the app.\n    this.prefix_ = 'firebase:';\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, value) {\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   * @returns The value that was stored under this key, or null\n   */\n  get(key) {\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  remove(key) {\n    this.domStorage_.removeItem(this.prefixedName_(key));\n  }\n  prefixedName_(name) {\n    return this.prefix_ + name;\n  }\n  toString() {\n    return this.domStorage_.toString();\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\n * (TODO: create interface for both to implement).\n */\nclass MemoryStorage {\n  constructor() {\n    this.cache_ = {};\n    this.isInMemoryStorage = true;\n  }\n  set(key, value) {\n    if (value == null) {\n      delete this.cache_[key];\n    } else {\n      this.cache_[key] = value;\n    }\n  }\n  get(key) {\n    if (contains(this.cache_, key)) {\n      return this.cache_[key];\n    }\n    return null;\n  }\n  remove(key) {\n    delete this.cache_[key];\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * 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 (domStorageName) {\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 (typeof window !== 'undefined' && typeof window[domStorageName] !== 'undefined') {\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  // Failed to create wrapper.  Just return in-memory storage.\n  // TODO: log?\n  return new MemoryStorage();\n};\n/** A storage object that lasts across sessions */\nconst PersistentStorage = createStoragefor('localStorage');\n/** A storage object that only lasts one session */\nconst SessionStorage = createStoragefor('sessionStorage');\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst logClient = new Logger('@firebase/database');\n/**\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\n */\nconst LUIDGenerator = function () {\n  let id = 1;\n  return function () {\n    return id++;\n  };\n}();\n/**\n * Sha1 hash of the input string\n * @param str - The string to hash\n * @returns {!string} The resulting hash\n */\nconst sha1 = function (str) {\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};\nconst buildLogMessage_ = function (...varArgs) {\n  let message = '';\n  for (let i = 0; i < varArgs.length; i++) {\n    const arg = varArgs[i];\n    if (Array.isArray(arg) || arg && typeof arg === 'object' &&\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    typeof arg.length === 'number') {\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  return message;\n};\n/**\n * Use this for all debug messages in Firebase.\n */\nlet logger = null;\n/**\n * Flag to check for log availability on first log message\n */\nlet firstLog_ = true;\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 */\nconst enableLogging$1 = function (logger_, persistent) {\n  assert(!persistent || logger_ === true || logger_ === false, \"Can't turn on custom loggers persistently.\");\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};\nconst log = function (...varArgs) {\n  if (firstLog_ === true) {\n    firstLog_ = false;\n    if (logger === null && SessionStorage.get('logging_enabled') === true) {\n      enableLogging$1(true);\n    }\n  }\n  if (logger) {\n    const message = buildLogMessage_.apply(null, varArgs);\n    logger(message);\n  }\n};\nconst logWrapper = function (prefix) {\n  return function (...varArgs) {\n    log(prefix, ...varArgs);\n  };\n};\nconst error = function (...varArgs) {\n  const message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_(...varArgs);\n  logClient.error(message);\n};\nconst fatal = function (...varArgs) {\n  const message = `FIREBASE FATAL ERROR: ${buildLogMessage_(...varArgs)}`;\n  logClient.error(message);\n  throw new Error(message);\n};\nconst warn = function (...varArgs) {\n  const message = 'FIREBASE WARNING: ' + buildLogMessage_(...varArgs);\n  logClient.warn(message);\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 */\nconst warnIfPageIsSecure = function () {\n  // Be very careful accessing browser globals. Who knows what may or may not exist.\n  if (typeof window !== 'undefined' && window.location && window.location.protocol && window.location.protocol.indexOf('https:') !== -1) {\n    warn('Insecure Firebase access from a secure page. ' + 'Please use https in calls to new Firebase().');\n  }\n};\n/**\n * Returns true if data is NaN, or +/- Infinity.\n */\nconst isInvalidJSONNumber = function (data) {\n  return typeof data === 'number' && (data !== data ||\n  // NaN\n  data === Number.POSITIVE_INFINITY || data === Number.NEGATIVE_INFINITY);\n};\nconst executeWhenDOMReady = function (fn) {\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    let called = false;\n    const wrappedFn = function () {\n      if (!document.body) {\n        setTimeout(wrappedFn, Math.floor(10));\n        return;\n      }\n      if (!called) {\n        called = true;\n        fn();\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.attachEvent) {\n      // IE.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      document.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.attachEvent('onload', wrappedFn);\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 * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\n */\nconst MIN_NAME = '[MIN_NAME]';\n/**\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\n */\nconst MAX_NAME = '[MAX_NAME]';\n/**\n * Compares valid Firebase key names, plus min and max name\n */\nconst nameCompare = function (a, b) {\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    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 * @returns {!number} comparison result.\n */\nconst stringCompare = function (a, b) {\n  if (a === b) {\n    return 0;\n  } else if (a < b) {\n    return -1;\n  } else {\n    return 1;\n  }\n};\nconst requireKey = function (key, obj) {\n  if (obj && key in obj) {\n    return obj[key];\n  } else {\n    throw new Error('Missing required key (' + key + ') in object: ' + stringify(obj));\n  }\n};\nconst ObjectToUniqueKey = function (obj) {\n  if (typeof obj !== 'object' || obj === null) {\n    return stringify(obj);\n  }\n  const keys = [];\n  // eslint-disable-next-line guard-for-in\n  for (const k in obj) {\n    keys.push(k);\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  key += '}';\n  return key;\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 */\nconst splitStringBySize = function (str, segsize) {\n  const len = str.length;\n  if (len <= segsize) {\n    return [str];\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 * 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 */\nfunction each(obj, fn) {\n  for (const key in obj) {\n    if (obj.hasOwnProperty(key)) {\n      fn(key, obj[key]);\n    }\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 */\nconst doubleToIEEE754String = function (v) {\n  assert(!isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\n  const ebits = 11,\n    fbits = 52;\n  const bias = (1 << ebits - 1) - 1;\n  let s, e, f, ln, i;\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    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  // 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  // 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 * 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 */\nconst isChromeExtensionContentScript = function () {\n  return !!(typeof window === 'object' && window['chrome'] && window['chrome']['extension'] && !/^chrome/.test(window.location.href));\n};\n/**\n * Used to detect if we're in a Windows 8 Store app.\n */\nconst isWindowsStoreApp = function () {\n  // Check for the presence of a couple WinRT globals\n  return typeof Windows === 'object' && typeof Windows.UI === 'object';\n};\n/**\n * Converts a server error code to a JavaScript Error\n */\nfunction errorForServerCode(code, query) {\n  let reason = 'Unknown Error';\n  if (code === 'too_big') {\n    reason = 'The data requested exceeds the maximum size ' + '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  const error = new Error(code + ' at ' + query._path.toString() + ': ' + reason);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  error.code = code.toUpperCase();\n  return error;\n}\n/**\n * Used to test for integer-looking strings\n */\nconst INTEGER_REGEXP_ = new RegExp('^-?(0*)\\\\d{1,10}$');\n/**\n * For use in keys, the minimum possible 32-bit integer.\n */\nconst INTEGER_32_MIN = -2147483648;\n/**\n * For use in keys, the maximum possible 32-bit integer.\n */\nconst INTEGER_32_MAX = 2147483647;\n/**\n * If the string contains a 32-bit integer, return it.  Else return null.\n */\nconst tryParseInt = function (str) {\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 * 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 */\nconst exceptionGuard = function (fn) {\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 * @returns {boolean} true if we think we're currently being crawled.\n */\nconst beingCrawled = function () {\n  const userAgent = typeof window === 'object' && window['navigator'] && window['navigator']['userAgent'] || '';\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 userAgent.search(/googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i) >= 0;\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 */\nconst setTimeoutNonBlocking = function (fn, time) {\n  const timeout = 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 (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    // @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['unref']) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    timeout['unref']();\n  }\n  return timeout;\n};\n\n/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Abstraction around AppCheck's token fetching capabilities.\n */\nclass AppCheckTokenProvider {\n  constructor(appName_, appCheckProvider) {\n    this.appName_ = appName_;\n    this.appCheckProvider = appCheckProvider;\n    this.appCheck = appCheckProvider === null || appCheckProvider === void 0 ? void 0 : appCheckProvider.getImmediate({\n      optional: true\n    });\n    if (!this.appCheck) {\n      appCheckProvider === null || appCheckProvider === void 0 ? void 0 : appCheckProvider.get().then(appCheck => this.appCheck = appCheck);\n    }\n  }\n  getToken(forceRefresh) {\n    if (!this.appCheck) {\n      return new Promise((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 timeout 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  addTokenChangeListener(listener) {\n    var _a;\n    (_a = this.appCheckProvider) === null || _a === void 0 ? void 0 : _a.get().then(appCheck => appCheck.addTokenListener(listener));\n  }\n  notifyForInvalidToken() {\n    warn(`Provided AppCheck credentials for the app named \"${this.appName_}\" ` + '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/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nclass FirebaseAuthTokenProvider {\n  constructor(appName_, firebaseOptions_, authProvider_) {\n    this.appName_ = appName_;\n    this.firebaseOptions_ = firebaseOptions_;\n    this.authProvider_ = authProvider_;\n    this.auth_ = null;\n    this.auth_ = authProvider_.getImmediate({\n      optional: true\n    });\n    if (!this.auth_) {\n      authProvider_.onInit(auth => this.auth_ = auth);\n    }\n  }\n  getToken(forceRefresh) {\n    if (!this.auth_) {\n      return new Promise((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 timeout 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    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  addTokenChangeListener(listener) {\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_.get().then(auth => auth.addAuthTokenListener(listener));\n    }\n  }\n  removeTokenChangeListener(listener) {\n    this.authProvider_.get().then(auth => auth.removeAuthTokenListener(listener));\n  }\n  notifyForInvalidToken() {\n    let errorMessage = 'Provided authentication credentials for the app named \"' + this.appName_ + '\" are invalid. This usually indicates your app was not ' + 'initialized correctly. ';\n    if ('credential' in this.firebaseOptions_) {\n      errorMessage += 'Make sure the \"credential\" property provided to initializeApp() ' + 'is authorized to access the specified \"databaseURL\" and is from the correct ' + 'project.';\n    } else if ('serviceAccount' in this.firebaseOptions_) {\n      errorMessage += 'Make sure the \"serviceAccount\" property provided to initializeApp() ' + 'is authorized to access the specified \"databaseURL\" and is from the correct ' + 'project.';\n    } else {\n      errorMessage += 'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' + 'initializeApp() match the values provided for your app at ' + 'https://console.firebase.google.com/.';\n    }\n    warn(errorMessage);\n  }\n}\n/* AuthTokenProvider that supplies a constant token. Used by Admin SDK or mockUserToken with emulators. */\nlet EmulatorTokenProvider = /*#__PURE__*/(() => {\n  class EmulatorTokenProvider {\n    constructor(accessToken) {\n      this.accessToken = accessToken;\n    }\n    getToken(forceRefresh) {\n      return Promise.resolve({\n        accessToken: this.accessToken\n      });\n    }\n    addTokenChangeListener(listener) {\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    removeTokenChangeListener(listener) {}\n    notifyForInvalidToken() {}\n  }\n  /** A string that is treated as an admin access token by the RTDB emulator. Used by Admin SDK. */\n  EmulatorTokenProvider.OWNER = 'owner';\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  return EmulatorTokenProvider;\n})();\nconst PROTOCOL_VERSION = '5';\nconst VERSION_PARAM = 'v';\nconst TRANSPORT_SESSION_PARAM = 's';\nconst REFERER_PARAM = 'r';\nconst FORGE_REF = 'f';\n// Matches console.firebase.google.com, firebase-console-*.corp.google.com and\n// firebase.corp.google.com\nconst FORGE_DOMAIN_RE = /(console\\.firebase|firebase-console-\\w+\\.corp|firebase\\.corp)\\.google\\.com/;\nconst LAST_SESSION_PARAM = 'ls';\nconst APPLICATION_ID_PARAM = 'p';\nconst APP_CHECK_TOKEN_PARAM = 'ac';\nconst WEBSOCKET = 'websocket';\nconst LONG_POLLING = 'long_polling';\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A class that holds metadata about a Repo object\n */\nclass RepoInfo {\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(host, secure, namespace, webSocketOnly, nodeAdmin = false, persistenceKey = '', includeNamespaceInQueryParams = false, isUsingEmulator = false) {\n    this.secure = secure;\n    this.namespace = namespace;\n    this.webSocketOnly = webSocketOnly;\n    this.nodeAdmin = nodeAdmin;\n    this.persistenceKey = persistenceKey;\n    this.includeNamespaceInQueryParams = includeNamespaceInQueryParams;\n    this.isUsingEmulator = isUsingEmulator;\n    this._host = host.toLowerCase();\n    this._domain = this._host.substr(this._host.indexOf('.') + 1);\n    this.internalHost = PersistentStorage.get('host:' + host) || this._host;\n  }\n  isCacheableHost() {\n    return this.internalHost.substr(0, 2) === 's-';\n  }\n  isCustomHost() {\n    return this._domain !== 'firebaseio.com' && this._domain !== 'firebaseio-demo.com';\n  }\n  get host() {\n    return this._host;\n  }\n  set host(newHost) {\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  toString() {\n    let str = this.toURLString();\n    if (this.persistenceKey) {\n      str += '<' + this.persistenceKey + '>';\n    }\n    return str;\n  }\n  toURLString() {\n    const protocol = this.secure ? 'https://' : 'http://';\n    const query = this.includeNamespaceInQueryParams ? `?ns=${this.namespace}` : '';\n    return `${protocol}${this.host}/${query}`;\n  }\n}\nfunction repoInfoNeedsQueryParam(repoInfo) {\n  return repoInfo.host !== repoInfo.internalHost || repoInfo.isCustomHost() || repoInfo.includeNamespaceInQueryParams;\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 */\nfunction repoInfoConnectionURL(repoInfo, type, params) {\n  assert(typeof type === 'string', 'typeof type must == string');\n  assert(typeof params === 'object', 'typeof params must == object');\n  let connURL;\n  if (type === WEBSOCKET) {\n    connURL = (repoInfo.secure ? 'wss://' : 'ws://') + repoInfo.internalHost + '/.ws?';\n  } else if (type === LONG_POLLING) {\n    connURL = (repoInfo.secure ? 'https://' : 'http://') + repoInfo.internalHost + '/.lp?';\n  } else {\n    throw new Error('Unknown connection type: ' + type);\n  }\n  if (repoInfoNeedsQueryParam(repoInfo)) {\n    params['ns'] = repoInfo.namespace;\n  }\n  const pairs = [];\n  each(params, (key, value) => {\n    pairs.push(key + '=' + value);\n  });\n  return connURL + pairs.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/**\n * Tracks a collection of stats.\n */\nclass StatsCollection {\n  constructor() {\n    this.counters_ = {};\n  }\n  incrementCounter(name, amount = 1) {\n    if (!contains(this.counters_, name)) {\n      this.counters_[name] = 0;\n    }\n    this.counters_[name] += amount;\n  }\n  get() {\n    return deepCopy(this.counters_);\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 */\nconst collections = {};\nconst reporters = {};\nfunction statsManagerGetCollection(repoInfo) {\n  const hashString = repoInfo.toString();\n  if (!collections[hashString]) {\n    collections[hashString] = new StatsCollection();\n  }\n  return collections[hashString];\n}\nfunction statsManagerGetOrCreateReporter(repoInfo, creatorFunction) {\n  const hashString = repoInfo.toString();\n  if (!reporters[hashString]) {\n    reporters[hashString] = creatorFunction();\n  }\n  return reporters[hashString];\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 * 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 */\nclass PacketReceiver {\n  /**\n   * @param onMessage_\n   */\n  constructor(onMessage_) {\n    this.onMessage_ = onMessage_;\n    this.pendingResponses = [];\n    this.currentResponseNum = 0;\n    this.closeAfterResponse = -1;\n    this.onClose = null;\n  }\n  closeAfter(responseNum, callback) {\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   * 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, data) {\n    this.pendingResponses[requestNum] = data;\n    while (this.pendingResponses[this.currentResponseNum]) {\n      const toProcess = this.pendingResponses[this.currentResponseNum];\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// URL query parameters associated with longpolling\nconst FIREBASE_LONGPOLL_START_PARAM = 'start';\nconst FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\nconst FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\nconst FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\nconst FIREBASE_LONGPOLL_ID_PARAM = 'id';\nconst FIREBASE_LONGPOLL_PW_PARAM = 'pw';\nconst FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\nconst FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\nconst FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\nconst FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\nconst FIREBASE_LONGPOLL_DATA_PARAM = 'd';\nconst FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\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 * 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 * How long to wait before aborting a long-polling connection attempt.\n */\nconst LP_CONNECT_TIMEOUT = 30000;\n/**\n * This class manages a single long-polling connection.\n */\nclass BrowserPollConnection {\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(connId, repoInfo, applicationId, appCheckToken, authToken, transportSessionId, lastSessionId) {\n    this.connId = connId;\n    this.repoInfo = repoInfo;\n    this.applicationId = applicationId;\n    this.appCheckToken = appCheckToken;\n    this.authToken = authToken;\n    this.transportSessionId = transportSessionId;\n    this.lastSessionId = lastSessionId;\n    this.bytesSent = 0;\n    this.bytesReceived = 0;\n    this.everConnected_ = false;\n    this.log_ = logWrapper(connId);\n    this.stats_ = statsManagerGetCollection(repoInfo);\n    this.urlFn = params => {\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   * @param onMessage - Callback when messages arrive\n   * @param onDisconnect - Callback with connection lost.\n   */\n  open(onMessage, onDisconnect) {\n    this.curSegmentNum = 0;\n    this.onDisconnect_ = onDisconnect;\n    this.myPacketOrderer = new PacketReceiver(onMessage);\n    this.isClosed_ = false;\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));\n    // Ensure we delay the creation of the iframe until the DOM is loaded.\n    executeWhenDOMReady(() => {\n      if (this.isClosed_) {\n        return;\n      }\n      //Set up a callback that gets triggered once a connection is set up.\n      this.scriptTagHolder = new FirebaseIFrameScriptHolder((...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        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;\n          this.password = arg2;\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            // 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, () => {\n              this.onClosed_();\n            });\n          } else {\n            this.onClosed_();\n          }\n        } else {\n          throw new Error('Unrecognized command received: ' + command);\n        }\n      }, (...args) => {\n        const [pN, data] = args;\n        this.incrementIncomingBytes_(args);\n        this.myPacketOrderer.handleResponse(pN, data);\n      }, () => {\n        this.onClosed_();\n      }, this.urlFn);\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 = {};\n      urlParams[FIREBASE_LONGPOLL_START_PARAM] = 't';\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(Math.random() * 100000000);\n      if (this.scriptTagHolder.uniqueCallbackIdentifier) {\n        urlParams[FIREBASE_LONGPOLL_CALLBACK_ID_PARAM] = 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 (typeof location !== 'undefined' && location.hostname && FORGE_DOMAIN_RE.test(location.hostname)) {\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   * 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   * Forces long polling to be considered as a potential transport\n   */\n  static forceAllow() {\n    BrowserPollConnection.forceAllow_ = true;\n  }\n  /**\n   * Forces longpolling to not be considered as a potential transport\n   */\n  static forceDisallow() {\n    BrowserPollConnection.forceDisallow_ = true;\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 !BrowserPollConnection.forceDisallow_ && typeof document !== 'undefined' && document.createElement != null && !isChromeExtensionContentScript() && !isWindowsStoreApp();\n    }\n  }\n  /**\n   * No-op for polling\n   */\n  markConnectionHealthy() {}\n  /**\n   * Stops polling and cleans up the iframe\n   */\n  shutdown_() {\n    this.isClosed_ = true;\n    if (this.scriptTagHolder) {\n      this.scriptTagHolder.close();\n      this.scriptTagHolder = null;\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    if (this.connectTimeoutTimer_) {\n      clearTimeout(this.connectTimeoutTimer_);\n      this.connectTimeoutTimer_ = null;\n    }\n  }\n  /**\n   * Triggered when this transport is closed\n   */\n  onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is closing itself');\n      this.shutdown_();\n      if (this.onDisconnect_) {\n        this.onDisconnect_(this.everConnected_);\n        this.onDisconnect_ = null;\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   * 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    //first, lets get the base64-encoded data\n    const base64data = base64Encode(dataStr);\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    //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(this.curSegmentNum, dataSegs.length, dataSegs[i]);\n      this.curSegmentNum++;\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, pw) {\n    if (isNodeSdk()) {\n      return;\n    }\n    this.myDisconnFrame = document.createElement('iframe');\n    const urlParams = {};\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    document.body.appendChild(this.myDisconnFrame);\n  }\n  /**\n   * Used to track the bytes received by this client\n   */\n  incrementIncomingBytes_(args) {\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 * A wrapper around an iframe that is used as a long-polling script holder.\n *********************************************************************************************/\nclass FirebaseIFrameScriptHolder {\n  /**\n   * @param commandCB - The callback to be called when control commands are received 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(commandCB, onMessageCB, onDisconnect, urlFn) {\n    this.onDisconnect = onDisconnect;\n    this.urlFn = urlFn;\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    this.outstandingRequests = new Set();\n    //A queue of the pending segments waiting for transmission to the server.\n    this.pendingSegs = [];\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    this.currentSerial = Math.floor(Math.random() * 100000000);\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    this.sendNewPolls = true;\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[FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier] = commandCB;\n      window[FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier] = onMessageCB;\n      //Create an iframe for us to add script tags to.\n      this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\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 (this.myIFrame.src && this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:') {\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   * 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  static createIFrame_() {\n    const iframe = document.createElement('iframe');\n    iframe.style.display = 'none';\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 = \"javascript:void((function(){document.open();document.domain='\" + domain + \"';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    // 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.document) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      iframe.doc = iframe.document; //others?\n    }\n    return iframe;\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    if (this.myIFrame) {\n      //We have to actually remove all of the html inside this iframe before removing it from the\n      //window, or IE will continue loading and executing the script tags we've already added, which\n      //can lead to some errors being thrown. Setting textContent seems to be the safest way to do this.\n      this.myIFrame.doc.body.textContent = '';\n      setTimeout(() => {\n        if (this.myIFrame !== null) {\n          document.body.removeChild(this.myIFrame);\n          this.myIFrame = null;\n        }\n      }, Math.floor(0));\n    }\n    // Protect from being called recursively.\n    const onDisconnect = this.onDisconnect;\n    if (onDisconnect) {\n      this.onDisconnect = null;\n      onDisconnect();\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, pw) {\n    this.myID = id;\n    this.myPW = pw;\n    this.alive = true;\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   * 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  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 (this.alive && this.sendNewPolls && this.outstandingRequests.size < (this.pendingSegs.length > 0 ? 2 : 1)) {\n      //construct our url\n      this.currentSerial++;\n      const urlParams = {};\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      while (this.pendingSegs.length > 0) {\n        //first, lets see if the next segment will fit.\n        const nextSeg = this.pendingSegs[0];\n        if (nextSeg.d.length + SEG_HEADER_SIZE + curDataString.length <= MAX_URL_DATA_SIZE) {\n          //great, the segment will fit. Lets append it.\n          const theSeg = this.pendingSegs.shift();\n          curDataString = curDataString + '&' + FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM + i + '=' + theSeg.seg + '&' + FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET + i + '=' + theSeg.ts + '&' + FIREBASE_LONGPOLL_DATA_PARAM + i + '=' + theSeg.d;\n          i++;\n        } else {\n          break;\n        }\n      }\n      theURL = theURL + curDataString;\n      this.addLongPollTag_(theURL, this.currentSerial);\n      return true;\n    } else {\n      return false;\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, totalsegs, data) {\n    //add this to the queue of segments to send.\n    this.pendingSegs.push({\n      seg: segnum,\n      ts: totalsegs,\n      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   * 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  addLongPollTag_(url, serial) {\n    //remember that we sent this request.\n    this.outstandingRequests.add(serial);\n    const doNewRequest = () => {\n      this.outstandingRequests.delete(serial);\n      this.newRequest_();\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(doNewRequest, Math.floor(KEEPALIVE_REQUEST_INTERVAL));\n    const readyStateCB = () => {\n      // Request completed.  Cancel the keepalive.\n      clearTimeout(keepaliveTimeout);\n      // Trigger a new request so we can continue receiving data.\n      doNewRequest();\n    };\n    this.addTag(url, readyStateCB);\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, loadCB) {\n    if (isNodeSdk()) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      this.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.onreadystatechange = function () {\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            const rstate = newScript.readyState;\n            if (!rstate || rstate === 'loaded' || rstate === 'complete') {\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              newScript.onload = newScript.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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst WEBSOCKET_MAX_FRAME_SIZE = 16384;\nconst WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\nlet WebSocketImpl = null;\nif (typeof MozWebSocket !== 'undefined') {\n  WebSocketImpl = MozWebSocket;\n} else if (typeof WebSocket !== 'undefined') {\n  WebSocketImpl = WebSocket;\n}\n/**\n * Create a new websocket connection with the given callbacks.\n */\nlet WebSocketConnection = /*#__PURE__*/(() => {\n  class WebSocketConnection {\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(connId, repoInfo, applicationId, appCheckToken, authToken, transportSessionId, lastSessionId) {\n      this.connId = connId;\n      this.applicationId = applicationId;\n      this.appCheckToken = appCheckToken;\n      this.authToken = authToken;\n      this.keepaliveTimer = null;\n      this.frames = null;\n      this.totalFrames = 0;\n      this.bytesSent = 0;\n      this.bytesReceived = 0;\n      this.log_ = logWrapper(this.connId);\n      this.stats_ = statsManagerGetCollection(repoInfo);\n      this.connURL = WebSocketConnection.connectionURL_(repoInfo, transportSessionId, lastSessionId, appCheckToken, applicationId);\n      this.nodeAdmin = repoInfo.nodeAdmin;\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    static connectionURL_(repoInfo, transportSessionId, lastSessionId, appCheckToken, applicationId) {\n      const urlParams = {};\n      urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n      if (!isNodeSdk() && typeof location !== 'undefined' && location.hostname && FORGE_DOMAIN_RE.test(location.hostname)) {\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      return repoInfoConnectionURL(repoInfo, WEBSOCKET, urlParams);\n    }\n    /**\n     * @param onMessage - Callback when messages arrive\n     * @param onDisconnect - Callback with connection lost.\n     */\n    open(onMessage, onDisconnect) {\n      this.onDisconnect = onDisconnect;\n      this.onMessage = onMessage;\n      this.log_('Websocket connecting to ' + this.connURL);\n      this.everConnected_ = false;\n      // Assume failure until proven otherwise.\n      PersistentStorage.set('previous_websocket_failure', true);\n      try {\n        let options;\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          // 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          // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n          const env = process['env'];\n          const proxy = this.connURL.indexOf('wss://') === 0 ? env['HTTPS_PROXY'] || env['https_proxy'] : env['HTTP_PROXY'] || env['http_proxy'];\n          if (proxy) {\n            options['proxy'] = {\n              origin: proxy\n            };\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      this.mySock.onopen = () => {\n        this.log_('Websocket connected.');\n        this.everConnected_ = true;\n      };\n      this.mySock.onclose = () => {\n        this.log_('Websocket connection was disconnected.');\n        this.mySock = null;\n        this.onClosed_();\n      };\n      this.mySock.onmessage = m => {\n        this.handleIncomingFrame(m);\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.message || e.data;\n        if (error) {\n          this.log_(error);\n        }\n        this.onClosed_();\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    static forceDisallow() {\n      WebSocketConnection.forceDisallow_ = true;\n    }\n    static isAvailable() {\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      return !isOldAndroid && WebSocketImpl !== null && !WebSocketConnection.forceDisallow_;\n    }\n    /**\n     * Returns true if we previously failed to connect with this transport.\n     */\n    static previouslyFailed() {\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 PersistentStorage.isInMemoryStorage || PersistentStorage.get('previous_websocket_failure') === true;\n    }\n    markConnectionHealthy() {\n      PersistentStorage.remove('previous_websocket_failure');\n    }\n    appendFrame_(data) {\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);\n        //handle the message\n        this.onMessage(jsonMess);\n      }\n    }\n    /**\n     * @param frameCount - The number of frames we are expecting from the server\n     */\n    handleNewFrameCount_(frameCount) {\n      this.totalFrames = frameCount;\n      this.frames = [];\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    extractFrameCount_(data) {\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     * Process a websocket frame that has arrived from the server.\n     * @param mess - The frame data\n     */\n    handleIncomingFrame(mess) {\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'];\n      this.bytesReceived += data.length;\n      this.stats_.incrementCounter('bytes_received', data.length);\n      this.resetKeepAlive();\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     * Send a message to the server\n     * @param data - The JSON object to transmit\n     */\n    send(data) {\n      this.resetKeepAlive();\n      const dataStr = stringify(data);\n      this.bytesSent += dataStr.length;\n      this.stats_.incrementCounter('bytes_sent', dataStr.length);\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      const dataSegs = splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\n      //Send the length header\n      if (dataSegs.length > 1) {\n        this.sendString_(String(dataSegs.length));\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    shutdown_() {\n      this.isClosed_ = true;\n      if (this.keepaliveTimer) {\n        clearInterval(this.keepaliveTimer);\n        this.keepaliveTimer = null;\n      }\n      if (this.mySock) {\n        this.mySock.close();\n        this.mySock = null;\n      }\n    }\n    onClosed_() {\n      if (!this.isClosed_) {\n        this.log_('WebSocket is closing itself');\n        this.shutdown_();\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     * 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     * 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));\n    }\n    /**\n     * Send a string over the websocket.\n     *\n     * @param str - String to send.\n     */\n    sendString_(str) {\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_('Exception thrown from WebSocket.send():', e.message || e.data, 'Closing connection.');\n        setTimeout(this.onClosed_.bind(this), 0);\n      }\n    }\n  }\n  /**\n   * Number of response before we consider the connection \"healthy.\"\n   */\n\n  /**\n   * Time to wait for the connection te become healthy before giving up.\n   */\n  WebSocketConnection.responsesRequiredToBeHealthy = 2;\n  WebSocketConnection.healthyTimeout = 30000;\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   * 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   */\n  return WebSocketConnection;\n})();\nlet TransportManager = /*#__PURE__*/(() => {\n  class TransportManager {\n    static get ALL_TRANSPORTS() {\n      return [BrowserPollConnection, WebSocketConnection];\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     * @param repoInfo - Metadata around the namespace we're connecting to\n     */\n    constructor(repoInfo) {\n      this.initTransports_(repoInfo);\n    }\n    initTransports_(repoInfo) {\n      const isWebSocketsAvailable = WebSocketConnection && WebSocketConnection['isAvailable']();\n      let isSkipPollConnection = isWebSocketsAvailable && !WebSocketConnection.previouslyFailed();\n      if (repoInfo.webSocketOnly) {\n        if (!isWebSocketsAvailable) {\n          warn(\"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\");\n        }\n        isSkipPollConnection = true;\n      }\n      if (isSkipPollConnection) {\n        this.transports_ = [WebSocketConnection];\n      } else {\n        const transports = this.transports_ = [];\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     * @returns The constructor for the initial transport to use\n     */\n    initialTransport() {\n      if (this.transports_.length > 0) {\n        return this.transports_[0];\n      } else {\n        throw new Error('No transports available');\n      }\n    }\n    /**\n     * @returns The constructor for the next transport, or null\n     */\n    upgradeTransport() {\n      if (this.transports_.length > 1) {\n        return this.transports_[1];\n      } else {\n        return null;\n      }\n    }\n  }\n  // Keeps track of whether the TransportManager has already chosen a transport to use\n  TransportManager.globalTransportInitialized_ = false;\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  // Abort upgrade attempt if it takes longer than 60s.\n  return TransportManager;\n})();\nconst UPGRADE_TIMEOUT = 60000;\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// 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;\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';\nconst SERVER_HELLO = 'h';\n/**\n * Creates a new real-time connection to the server using whichever method works\n * best in the current browser.\n */\nclass Connection {\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(id, repoInfo_, applicationId_, appCheckToken_, authToken_, onMessage_, onReady_, onDisconnect_, onKill_, lastSessionId) {\n    this.id = id;\n    this.repoInfo_ = repoInfo_;\n    this.applicationId_ = applicationId_;\n    this.appCheckToken_ = appCheckToken_;\n    this.authToken_ = authToken_;\n    this.onMessage_ = onMessage_;\n    this.onReady_ = onReady_;\n    this.onDisconnect_ = onDisconnect_;\n    this.onKill_ = onKill_;\n    this.lastSessionId = lastSessionId;\n    this.connectionCount = 0;\n    this.pendingDataMessages = [];\n    this.state_ = 0 /* RealtimeState.CONNECTING */;\n    this.log_ = logWrapper('c:' + this.id + ':');\n    this.transportManager_ = new TransportManager(repoInfo_);\n    this.log_('Connection created');\n    this.start_();\n  }\n  /**\n   * Starts a connection attempt\n   */\n  start_() {\n    const conn = this.transportManager_.initialTransport();\n    this.conn_ = new conn(this.nextTransportId_(), this.repoInfo_, this.applicationId_, this.appCheckToken_, this.authToken_, null, this.lastSessionId);\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    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     * 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    const healthyTimeoutMS = conn['healthyTimeout'] || 0;\n    if (healthyTimeoutMS > 0) {\n      this.healthyTimeout_ = setTimeoutNonBlocking(() => {\n        this.healthyTimeout_ = null;\n        if (!this.isHealthy_) {\n          if (this.conn_ && this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE) {\n            this.log_('Connection exceeded healthy timeout but has received ' + this.conn_.bytesReceived + ' bytes.  Marking connection healthy.');\n            this.isHealthy_ = true;\n            this.conn_.markConnectionHealthy();\n          } else if (this.conn_ && this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE) {\n            this.log_('Connection exceeded healthy timeout but has sent ' + this.conn_.bytesSent + ' bytes.  Leaving connection alive.');\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));\n    }\n  }\n  nextTransportId_() {\n    return 'c:' + this.id + ':' + this.connectionCount++;\n  }\n  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  connReceiver_(conn) {\n    return message => {\n      if (this.state_ !== 2 /* 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   * @param dataMsg - An arbitrary data message to be sent to the server\n   */\n  sendRequest(dataMsg) {\n    // wrap in a data message envelope and send it on\n    const msg = {\n      t: 'd',\n      d: dataMsg\n    };\n    this.sendData_(msg);\n  }\n  tryCleanupConnection() {\n    if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\n      this.log_('cleaning up and promoting a connection: ' + this.secondaryConn_.connId);\n      this.conn_ = this.secondaryConn_;\n      this.secondaryConn_ = null;\n      // the server will shutdown the old connection\n    }\n  }\n  onSecondaryControl_(controlData) {\n    if (MESSAGE_TYPE in controlData) {\n      const cmd = controlData[MESSAGE_TYPE];\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 (this.tx_ === this.secondaryConn_ || this.rx_ === this.secondaryConn_) {\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  onSecondaryMessageReceived_(parsedData) {\n    const layer = requireKey('t', parsedData);\n    const data = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onSecondaryControl_(data);\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  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({\n        t: 'c',\n        d: {\n          t: PING,\n          d: {}\n        }\n      });\n    }\n  }\n  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({\n      t: 'c',\n      d: {\n        t: SWITCH_ACK,\n        d: {}\n      }\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({\n      t: 'c',\n      d: {\n        t: END_TRANSMISSION,\n        d: {}\n      }\n    });\n    this.tx_ = this.secondaryConn_;\n    this.tryCleanupConnection();\n  }\n  onPrimaryMessageReceived_(parsedData) {\n    // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n    const layer = requireKey('t', parsedData);\n    const data = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onControl_(data);\n    } else if (layer === 'd') {\n      this.onDataMessage_(data);\n    }\n  }\n  onDataMessage_(message) {\n    this.onPrimaryResponse_();\n    // We don't do anything with data messages, just kick them up a level\n    this.onMessage_(message);\n  }\n  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  onControl_(controlData) {\n    const cmd = requireKey(MESSAGE_TYPE, controlData);\n    if (MESSAGE_DATA in controlData) {\n      const payload = controlData[MESSAGE_DATA];\n      if (cmd === SERVER_HELLO) {\n        const handshakePayload = Object.assign({}, payload);\n        if (this.repoInfo_.isUsingEmulator) {\n          // Upon connecting, the emulator will pass the hostname that it's aware of, but we prefer the user's set hostname via `connectDatabaseEmulator` over what the emulator passes.\n          handshakePayload.h = this.repoInfo_.host;\n        }\n        this.onHandshake_(handshakePayload);\n      } else if (cmd === END_TRANSMISSION) {\n        this.log_('recvd end transmission on primary');\n        this.rx_ = this.secondaryConn_;\n        for (let i = 0; i < this.pendingDataMessages.length; ++i) {\n          this.onDataMessage_(this.pendingDataMessages[i]);\n        }\n        this.pendingDataMessages = [];\n        this.tryCleanupConnection();\n      } else if (cmd === CONTROL_SHUTDOWN) {\n        // This was previously the 'onKill' callback passed to the lower-level connection\n        // payload in this case is the reason for the shutdown. Generally a human-readable error\n        this.onConnectionShutdown_(payload);\n      } else if (cmd === CONTROL_RESET) {\n        // payload in this case is the host we should contact\n        this.onReset_(payload);\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   * @param handshake - The handshake data returned from the server\n   */\n  onHandshake_(handshake) {\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_ === 0 /* 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  tryStartUpgrade_() {\n    const conn = this.transportManager_.upgradeTransport();\n    if (conn) {\n      this.startUpgrade_(conn);\n    }\n  }\n  startUpgrade_(conn) {\n    this.secondaryConn_ = new conn(this.nextTransportId_(), this.repoInfo_, this.applicationId_, this.appCheckToken_, this.authToken_, this.sessionId);\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_ = conn['responsesRequiredToBeHealthy'] || 0;\n    const onMessage = this.connReceiver_(this.secondaryConn_);\n    const onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n    this.secondaryConn_.open(onMessage, onDisconnect);\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  onReset_(host) {\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_ === 1 /* 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  onConnectionEstablished_(conn, timestamp) {\n    this.log_('Realtime connection established.');\n    this.conn_ = conn;\n    this.state_ = 1 /* RealtimeState.CONNECTED */;\n    if (this.onReady_) {\n      this.onReady_(timestamp, this.sessionId);\n      this.onReady_ = null;\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  sendPingOnPrimaryIfNecessary_() {\n    // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n    if (!this.isHealthy_ && this.state_ === 1 /* RealtimeState.CONNECTED */) {\n      this.log_('sending ping on primary.');\n      this.sendData_({\n        t: 'c',\n        d: {\n          t: PING,\n          d: {}\n        }\n      });\n    }\n  }\n  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   * @param everConnected - Whether or not the connection ever reached a server. Used to determine if\n   * we should flush the host cache\n   */\n  onConnectionLost_(everConnected) {\n    this.conn_ = null;\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_ === 0 /* 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_ === 1 /* RealtimeState.CONNECTED */) {\n      this.log_('Realtime connection lost.');\n    }\n    this.close();\n  }\n  onConnectionShutdown_(reason) {\n    this.log_('Connection shutdown command received. Shutting down...');\n    if (this.onKill_) {\n      this.onKill_(reason);\n      this.onKill_ = null;\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    this.close();\n  }\n  sendData_(data) {\n    if (this.state_ !== 1 /* RealtimeState.CONNECTED */) {\n      throw 'Connection is not connected';\n    } else {\n      this.tx_.send(data);\n    }\n  }\n  /**\n   * Cleans up this connection, calling the appropriate callbacks\n   */\n  close() {\n    if (this.state_ !== 2 /* RealtimeState.DISCONNECTED */) {\n      this.log_('Closing realtime connection.');\n      this.state_ = 2 /* RealtimeState.DISCONNECTED */;\n      this.closeConnections_();\n      if (this.onDisconnect_) {\n        this.onDisconnect_();\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n  closeConnections_() {\n    this.log_('Shutting down all connections');\n    if (this.conn_) {\n      this.conn_.close();\n      this.conn_ = null;\n    }\n    if (this.secondaryConn_) {\n      this.secondaryConn_.close();\n      this.secondaryConn_ = null;\n    }\n    if (this.healthyTimeout_) {\n      clearTimeout(this.healthyTimeout_);\n      this.healthyTimeout_ = null;\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 * 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 */\nclass ServerActions {\n  put(pathString, data, onComplete, hash) {}\n  merge(pathString, data, onComplete, hash) {}\n  /**\n   * Refreshes the auth token for the current connection.\n   * @param token - The authentication token\n   */\n  refreshAuthToken(token) {}\n  /**\n   * Refreshes the app check token for the current connection.\n   * @param token The app check token\n   */\n  refreshAppCheckToken(token) {}\n  onDisconnectPut(pathString, data, onComplete) {}\n  onDisconnectMerge(pathString, data, onComplete) {}\n  onDisconnectCancel(pathString, onComplete) {}\n  reportStats(stats) {}\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 * Base class to be used if you want to emit events. Call the constructor with\n * the set of allowed event names.\n */\nclass EventEmitter {\n  constructor(allowedEvents_) {\n    this.allowedEvents_ = allowedEvents_;\n    this.listeners_ = {};\n    assert(Array.isArray(allowedEvents_) && allowedEvents_.length > 0, 'Requires a non-empty array');\n  }\n  /**\n   * To be called by derived classes to trigger events.\n   */\n  trigger(eventType, ...varArgs) {\n    if (Array.isArray(this.listeners_[eventType])) {\n      // Clone the list, since callbacks could add/remove listeners.\n      const listeners = [...this.listeners_[eventType]];\n      for (let i = 0; i < listeners.length; i++) {\n        listeners[i].callback.apply(listeners[i].context, varArgs);\n      }\n    }\n  }\n  on(eventType, callback, context) {\n    this.validateEventType_(eventType);\n    this.listeners_[eventType] = this.listeners_[eventType] || [];\n    this.listeners_[eventType].push({\n      callback,\n      context\n    });\n    const eventData = this.getInitialEvent(eventType);\n    if (eventData) {\n      callback.apply(context, eventData);\n    }\n  }\n  off(eventType, callback, context) {\n    this.validateEventType_(eventType);\n    const listeners = this.listeners_[eventType] || [];\n    for (let i = 0; i < listeners.length; i++) {\n      if (listeners[i].callback === callback && (!context || context === listeners[i].context)) {\n        listeners.splice(i, 1);\n        return;\n      }\n    }\n  }\n  validateEventType_(eventType) {\n    assert(this.allowedEvents_.find(et => {\n      return et === eventType;\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/**\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 */\nclass OnlineMonitor extends EventEmitter {\n  static getInstance() {\n    return new OnlineMonitor();\n  }\n  constructor() {\n    super(['online']);\n    this.online_ = true;\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 (typeof window !== 'undefined' && typeof window.addEventListener !== 'undefined' && !isMobileCordova()) {\n      window.addEventListener('online', () => {\n        if (!this.online_) {\n          this.online_ = true;\n          this.trigger('online', true);\n        }\n      }, false);\n      window.addEventListener('offline', () => {\n        if (this.online_) {\n          this.online_ = false;\n          this.trigger('online', false);\n        }\n      }, false);\n    }\n  }\n  getInitialEvent(eventType) {\n    assert(eventType === 'online', 'Unknown event type: ' + eventType);\n    return [this.online_];\n  }\n  currentlyOnline() {\n    return this.online_;\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/** Maximum key depth. */\nconst MAX_PATH_DEPTH = 32;\n/** Maximum number of (UTF8) bytes in a Firebase path. */\nconst MAX_PATH_LENGTH_BYTES = 768;\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 */\nclass Path {\n  /**\n   * @param pathOrString - Path string to parse, or another path, or the raw\n   * tokens array\n   */\n  constructor(pathOrString, pieceNum) {\n    if (pieceNum === void 0) {\n      this.pieces_ = pathOrString.split('/');\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      this.pieceNum_ = 0;\n    } else {\n      this.pieces_ = pathOrString;\n      this.pieceNum_ = pieceNum;\n    }\n  }\n  toString() {\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    return pathString || '/';\n  }\n}\nfunction newEmptyPath() {\n  return new Path('');\n}\nfunction pathGetFront(path) {\n  if (path.pieceNum_ >= path.pieces_.length) {\n    return null;\n  }\n  return path.pieces_[path.pieceNum_];\n}\n/**\n * @returns The number of segments in this path\n */\nfunction pathGetLength(path) {\n  return path.pieces_.length - path.pieceNum_;\n}\nfunction pathPopFront(path) {\n  let pieceNum = path.pieceNum_;\n  if (pieceNum < path.pieces_.length) {\n    pieceNum++;\n  }\n  return new Path(path.pieces_, pieceNum);\n}\nfunction pathGetBack(path) {\n  if (path.pieceNum_ < path.pieces_.length) {\n    return path.pieces_[path.pieces_.length - 1];\n  }\n  return null;\n}\nfunction pathToUrlEncodedString(path) {\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  return pathString || '/';\n}\n/**\n * Shallow copy of the parts of the path.\n *\n */\nfunction pathSlice(path, begin = 0) {\n  return path.pieces_.slice(path.pieceNum_ + begin);\n}\nfunction pathParent(path) {\n  if (path.pieceNum_ >= path.pieces_.length) {\n    return null;\n  }\n  const pieces = [];\n  for (let i = path.pieceNum_; i < path.pieces_.length - 1; i++) {\n    pieces.push(path.pieces_[i]);\n  }\n  return new Path(pieces, 0);\n}\nfunction pathChild(path, childPathObj) {\n  const pieces = [];\n  for (let i = path.pieceNum_; i < path.pieces_.length; i++) {\n    pieces.push(path.pieces_[i]);\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  return new Path(pieces, 0);\n}\n/**\n * @returns True if there are no segments in this path\n */\nfunction pathIsEmpty(path) {\n  return path.pieceNum_ >= path.pieces_.length;\n}\n/**\n * @returns The path from outerPath to innerPath\n */\nfunction newRelativePath(outerPath, innerPath) {\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('INTERNAL ERROR: innerPath (' + innerPath + ') is not within ' + 'outerPath (' + outerPath + ')');\n  }\n}\n/**\n * @returns -1, 0, 1 if left is less, equal, or greater than the right.\n */\nfunction pathCompare(left, right) {\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 * @returns true if paths are the same.\n */\nfunction pathEquals(path, other) {\n  if (pathGetLength(path) !== pathGetLength(other)) {\n    return false;\n  }\n  for (let i = path.pieceNum_, j = other.pieceNum_; i <= path.pieces_.length; i++, j++) {\n    if (path.pieces_[i] !== other.pieces_[j]) {\n      return false;\n    }\n  }\n  return true;\n}\n/**\n * @returns True if this path is a parent of (or the same as) other\n */\nfunction pathContains(path, other) {\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 * 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 */\nclass ValidationPath {\n  /**\n   * @param path - Initial Path.\n   * @param errorPrefix_ - Prefix for any error messages.\n   */\n  constructor(path, errorPrefix_) {\n    this.errorPrefix_ = errorPrefix_;\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    for (let i = 0; i < this.parts_.length; i++) {\n      this.byteLength_ += stringLength(this.parts_[i]);\n    }\n    validationPathCheckValid(this);\n  }\n}\nfunction validationPathPush(validationPath, child) {\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}\nfunction validationPathPop(validationPath) {\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}\nfunction validationPathCheckValid(validationPath) {\n  if (validationPath.byteLength_ > MAX_PATH_LENGTH_BYTES) {\n    throw new Error(validationPath.errorPrefix_ + 'has a key path longer than ' + MAX_PATH_LENGTH_BYTES + ' bytes (' + validationPath.byteLength_ + ').');\n  }\n  if (validationPath.parts_.length > MAX_PATH_DEPTH) {\n    throw new Error(validationPath.errorPrefix_ + 'path specified exceeds the maximum depth that can be written (' + MAX_PATH_DEPTH + ') or object contains a cycle ' + validationPathToErrorString(validationPath));\n  }\n}\n/**\n * String for use in error messages - uses '.' notation for path.\n */\nfunction validationPathToErrorString(validationPath) {\n  if (validationPath.parts_.length === 0) {\n    return '';\n  }\n  return \"in property '\" + validationPath.parts_.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 */\nclass VisibilityMonitor extends EventEmitter {\n  static getInstance() {\n    return new VisibilityMonitor();\n  }\n  constructor() {\n    super(['visible']);\n    let hidden;\n    let visibilityChange;\n    if (typeof document !== 'undefined' && typeof document.addEventListener !== 'undefined') {\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    // 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    if (visibilityChange) {\n      document.addEventListener(visibilityChange, () => {\n        const visible = !document[hidden];\n        if (visible !== this.visible_) {\n          this.visible_ = visible;\n          this.trigger('visible', visible);\n        }\n      }, false);\n    }\n  }\n  getInitialEvent(eventType) {\n    assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n    return [this.visible_];\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 */\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// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\nconst INVALID_TOKEN_THRESHOLD = 3;\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 */\nlet PersistentConnection = /*#__PURE__*/(() => {\n  class PersistentConnection extends ServerActions {\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(repoInfo_, applicationId_, onDataUpdate_, onConnectStatus_, onServerInfoUpdate_, authTokenProvider_, appCheckTokenProvider_, authOverride_) {\n      super();\n      this.repoInfo_ = repoInfo_;\n      this.applicationId_ = applicationId_;\n      this.onDataUpdate_ = onDataUpdate_;\n      this.onConnectStatus_ = onConnectStatus_;\n      this.onServerInfoUpdate_ = onServerInfoUpdate_;\n      this.authTokenProvider_ = authTokenProvider_;\n      this.appCheckTokenProvider_ = appCheckTokenProvider_;\n      this.authOverride_ = authOverride_;\n      // Used for diagnostic logging.\n      this.id = PersistentConnection.nextPersistentConnectionId_++;\n      this.log_ = logWrapper('p:' + this.id + ':');\n      this.interruptReasons_ = {};\n      this.listens = new Map();\n      this.outstandingPuts_ = [];\n      this.outstandingGets_ = [];\n      this.outstandingPutCount_ = 0;\n      this.outstandingGetCount_ = 0;\n      this.onDisconnectRequestQueue_ = [];\n      this.connected_ = false;\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\n      this.securityDebugCallback_ = null;\n      this.lastSessionId = null;\n      this.establishConnectionTimer_ = null;\n      this.visible_ = false;\n      // Before we get connected, we keep a queue of pending messages to send.\n      this.requestCBHash_ = {};\n      this.requestNumber_ = 0;\n      this.realtime_ = null;\n      this.authToken_ = null;\n      this.appCheckToken_ = null;\n      this.forceTokenRefresh_ = false;\n      this.invalidAuthTokenCount_ = 0;\n      this.invalidAppCheckTokenCount_ = 0;\n      this.firstConnection_ = true;\n      this.lastConnectionAttemptTime_ = null;\n      this.lastConnectionEstablishedTime_ = null;\n      if (authOverride_ && !isNodeSdk()) {\n        throw new Error('Auth override specified in options, but not supported on non Node.js platforms');\n      }\n      VisibilityMonitor.getInstance().on('visible', this.onVisible_, this);\n      if (repoInfo_.host.indexOf('fblocal') === -1) {\n        OnlineMonitor.getInstance().on('online', this.onOnline_, this);\n      }\n    }\n    sendRequest(action, body, onResponse) {\n      const curReqNum = ++this.requestNumber_;\n      const msg = {\n        r: curReqNum,\n        a: action,\n        b: body\n      };\n      this.log_(stringify(msg));\n      assert(this.connected_, \"sendRequest call when we're not connected not allowed.\");\n      this.realtime_.sendRequest(msg);\n      if (onResponse) {\n        this.requestCBHash_[curReqNum] = onResponse;\n      }\n    }\n    get(query) {\n      this.initConnection_();\n      const deferred = new Deferred();\n      const request = {\n        p: query._path.toString(),\n        q: query._queryObject\n      };\n      const outstandingGet = {\n        action: 'g',\n        request,\n        onComplete: message => {\n          const payload = message['d'];\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      if (this.connected_) {\n        this.sendGet_(index);\n      }\n      return deferred.promise;\n    }\n    listen(query, currentHashFn, tag, onComplete) {\n      this.initConnection_();\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(query._queryParams.isDefault() || !query._queryParams.loadsAllData(), 'listen() called for non-default but complete query');\n      assert(!this.listens.get(pathString).has(queryId), `listen() called twice for same path/queryId.`);\n      const listenSpec = {\n        onComplete,\n        hashFn: currentHashFn,\n        query,\n        tag\n      };\n      this.listens.get(pathString).set(queryId, listenSpec);\n      if (this.connected_) {\n        this.sendListen_(listenSpec);\n      }\n    }\n    sendGet_(index) {\n      const get = this.outstandingGets_[index];\n      this.sendRequest('g', get.request, message => {\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    sendListen_(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 = {\n        /*path*/p: pathString\n      };\n      const action = 'q';\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      req[/*hash*/'h'] = listenSpec.hashFn();\n      this.sendRequest(action, req, message => {\n        const payload = message[/*data*/'d'];\n        const status = message[/*status*/'s'];\n        // print warnings in any case...\n        PersistentConnection.warnOnListenWarnings_(payload, query);\n        const currentListenSpec = this.listens.get(pathString) && 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          if (status !== 'ok') {\n            this.removeListen_(pathString, queryId);\n          }\n          if (listenSpec.onComplete) {\n            listenSpec.onComplete(status, payload);\n          }\n        }\n      });\n    }\n    static warnOnListenWarnings_(payload, query) {\n      if (payload && typeof payload === 'object' && contains(payload, 'w')) {\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        const warnings = safeGet(payload, 'w');\n        if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n          const indexSpec = '\".indexOn\": \"' + query._queryParams.getIndex().toString() + '\"';\n          const indexPath = query._path.toString();\n          warn(`Using an unspecified index. Your data will be downloaded and ` + `filtered on the client. Consider adding ${indexSpec} at ` + `${indexPath} to your security rules for better performance.`);\n        }\n      }\n    }\n    refreshAuthToken(token) {\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      this.reduceReconnectDelayIfAdminCredential_(token);\n    }\n    reduceReconnectDelayIfAdminCredential_(credential) {\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_('Admin auth credential detected.  Reducing max reconnect time.');\n        this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n      }\n    }\n    refreshAppCheckToken(token) {\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     * 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 = {\n          cred: token\n        };\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(authMethod, requestData, res => {\n          const status = res[/*status*/'s'];\n          const data = res[/*data*/'d'] || 'error';\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     * 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('appcheck', {\n          'token': this.appCheckToken_\n        }, res => {\n          const status = res[/*status*/'s'];\n          const data = res[/*data*/'d'] || 'error';\n          if (status === 'ok') {\n            this.invalidAppCheckTokenCount_ = 0;\n          } else {\n            this.onAppCheckRevoked_(status, data);\n          }\n        });\n      }\n    }\n    /**\n     * @inheritDoc\n     */\n    unlisten(query, tag) {\n      const pathString = query._path.toString();\n      const queryId = query._queryIdentifier;\n      this.log_('Unlisten called for ' + pathString + ' ' + queryId);\n      assert(query._queryParams.isDefault() || !query._queryParams.loadsAllData(), 'unlisten() called for non-default but complete query');\n      const listen = this.removeListen_(pathString, queryId);\n      if (listen && this.connected_) {\n        this.sendUnlisten_(pathString, queryId, query._queryObject, tag);\n      }\n    }\n    sendUnlisten_(pathString, queryId, queryObj, tag) {\n      this.log_('Unlisten on ' + pathString + ' for ' + queryId);\n      const req = {\n        /*path*/p: pathString\n      };\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      this.sendRequest(action, req);\n    }\n    onDisconnectPut(pathString, data, onComplete) {\n      this.initConnection_();\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    onDisconnectMerge(pathString, data, onComplete) {\n      this.initConnection_();\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    onDisconnectCancel(pathString, onComplete) {\n      this.initConnection_();\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    sendOnDisconnect_(action, pathString, data, onComplete) {\n      const request = {\n        /*path*/p: pathString,\n        /*data*/d: data\n      };\n      this.log_('onDisconnect ' + action, request);\n      this.sendRequest(action, request, response => {\n        if (onComplete) {\n          setTimeout(() => {\n            onComplete(response[/*status*/'s'], response[/* data */'d']);\n          }, Math.floor(0));\n        }\n      });\n    }\n    put(pathString, data, onComplete, hash) {\n      this.putInternal('p', pathString, data, onComplete, hash);\n    }\n    merge(pathString, data, onComplete, hash) {\n      this.putInternal('m', pathString, data, onComplete, hash);\n    }\n    putInternal(action, pathString, data, onComplete, hash) {\n      this.initConnection_();\n      const request = {\n        /*path*/p: pathString,\n        /*data*/d: data\n      };\n      if (hash !== undefined) {\n        request[/*hash*/'h'] = hash;\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      this.outstandingPutCount_++;\n      const index = this.outstandingPuts_.length - 1;\n      if (this.connected_) {\n        this.sendPut_(index);\n      } else {\n        this.log_('Buffering put: ' + pathString);\n      }\n    }\n    sendPut_(index) {\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      this.sendRequest(action, request, message => {\n        this.log_(action + ' response', message);\n        delete this.outstandingPuts_[index];\n        this.outstandingPutCount_--;\n        // Clean up array occasionally.\n        if (this.outstandingPutCount_ === 0) {\n          this.outstandingPuts_ = [];\n        }\n        if (onComplete) {\n          onComplete(message[/*status*/'s'], message[/* data */'d']);\n        }\n      });\n    }\n    reportStats(stats) {\n      // If we're not connected, we just drop the stats.\n      if (this.connected_) {\n        const request = {\n          /*counters*/c: stats\n        };\n        this.log_('reportStats', request);\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    onDataMessage_(message) {\n      if ('r' in message) {\n        // this is a response\n        this.log_('from server: ' + stringify(message));\n        const reqNum = message['r'];\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'], message['b']);\n      }\n    }\n    onDataPush_(action, body) {\n      this.log_('handleServerMessage', action, body);\n      if (action === 'd') {\n        this.onDataUpdate_(body[/*path*/'p'], body[/*data*/'d'], /*isMerge*/false, body['t']);\n      } else if (action === 'm') {\n        this.onDataUpdate_(body[/*path*/'p'], body[/*data*/'d'], /*isMerge=*/true, body['t']);\n      } else if (action === 'c') {\n        this.onListenRevoked_(body[/*path*/'p'], body[/*query*/'q']);\n      } else if (action === 'ac') {\n        this.onAuthRevoked_(body[/*status code*/'s'], body[/* explanation */'d']);\n      } else if (action === 'apc') {\n        this.onAppCheckRevoked_(body[/*status code*/'s'], body[/* explanation */'d']);\n      } else if (action === 'sd') {\n        this.onSecurityDebugPacket_(body);\n      } else {\n        error('Unrecognized action received from server: ' + stringify(action) + '\\nAre you using the latest client?');\n      }\n    }\n    onReady_(timestamp, sessionId) {\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    scheduleConnect_(timeout) {\n      assert(!this.realtime_, \"Scheduling a connect when we're already connected/ing?\");\n      if (this.establishConnectionTimer_) {\n        clearTimeout(this.establishConnectionTimer_);\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      this.establishConnectionTimer_ = setTimeout(() => {\n        this.establishConnectionTimer_ = null;\n        this.establishConnection_();\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      }, Math.floor(timeout));\n    }\n    initConnection_() {\n      if (!this.realtime_ && this.firstConnection_) {\n        this.scheduleConnect_(0);\n      }\n    }\n    onVisible_(visible) {\n      // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\n      if (visible && !this.visible_ && this.reconnectDelay_ === this.maxReconnectDelay_) {\n        this.log_('Window became visible.  Reducing delay.');\n        this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n        if (!this.realtime_) {\n          this.scheduleConnect_(0);\n        }\n      }\n      this.visible_ = visible;\n    }\n    onOnline_(online) {\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    onRealtimeDisconnect_() {\n      this.log_('data client disconnected');\n      this.connected_ = false;\n      this.realtime_ = null;\n      // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\n      this.cancelSentTransactions_();\n      // Clear out the pending requests.\n      this.requestCBHash_ = {};\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 = 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        const timeSinceLastConnectAttempt = new Date().getTime() - this.lastConnectionAttemptTime_;\n        let reconnectDelay = Math.max(0, this.reconnectDelay_ - timeSinceLastConnectAttempt);\n        reconnectDelay = Math.random() * reconnectDelay;\n        this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\n        this.scheduleConnect_(reconnectDelay);\n        // Adjust reconnect delay for next time.\n        this.reconnectDelay_ = Math.min(this.maxReconnectDelay_, this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER);\n      }\n      this.onConnectStatus_(false);\n    }\n    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 = 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) {\n          assert(connection, \"sendRequest call when we're not connected not allowed.\");\n          connection.sendRequest(msg);\n        };\n        this.realtime_ = {\n          close: closeFn,\n          sendRequest: sendRequestFn\n        };\n        const forceRefresh = this.forceTokenRefresh_;\n        this.forceTokenRefresh_ = false;\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([this.authTokenProvider_.getToken(forceRefresh), this.appCheckTokenProvider_.getToken(forceRefresh)]);\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(connId, this.repoInfo_, this.applicationId_, this.appCheckToken_, this.authToken_, onDataMessage, onReady, onDisconnect, /* onKill= */reason => {\n              warn(reason + ' (' + this.repoInfo_.toString() + ')');\n              this.interrupt(SERVER_KILL_INTERRUPT_REASON);\n            }, lastSessionId);\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    interrupt(reason) {\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    resume(reason) {\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    handleTimestamp_(timestamp) {\n      const delta = timestamp - new Date().getTime();\n      this.onServerInfoUpdate_({\n        serverTimeOffset: delta\n      });\n    }\n    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          delete this.outstandingPuts_[i];\n          this.outstandingPutCount_--;\n        }\n      }\n      // Clean up array occasionally.\n      if (this.outstandingPutCount_ === 0) {\n        this.outstandingPuts_ = [];\n      }\n    }\n    onListenRevoked_(pathString, query) {\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    removeListen_(pathString, queryId) {\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    onAuthRevoked_(statusCode, explanation) {\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          // Notify the auth token provider that the token is invalid, which will log\n          // a warning\n          this.authTokenProvider_.notifyForInvalidToken();\n        }\n      }\n    }\n    onAppCheckRevoked_(statusCode, explanation) {\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    onSecurityDebugPacket_(body) {\n      if (this.securityDebugCallback_) {\n        this.securityDebugCallback_(body);\n      } else {\n        if ('msg' in body) {\n          console.log('FIREBASE: ' + body['msg'].replace('\\n', '\\nFIREBASE: '));\n        }\n      }\n    }\n    restoreState_() {\n      //Re-authenticate ourselves if we have a credential stored.\n      this.tryAuth();\n      this.tryAppCheck();\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      for (let i = 0; i < this.outstandingPuts_.length; i++) {\n        if (this.outstandingPuts_[i]) {\n          this.sendPut_(i);\n        }\n      }\n      while (this.onDisconnectRequestQueue_.length) {\n        const request = this.onDisconnectRequestQueue_.shift();\n        this.sendOnDisconnect_(request.action, request.pathString, request.data, request.onComplete);\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     * Sends client stats for first connection\n     */\n    sendConnectStats_() {\n      const stats = {};\n      let clientName = 'js';\n      if (isNodeSdk()) {\n        if (this.repoInfo_.nodeAdmin) {\n          clientName = 'admin_node';\n        } else {\n          clientName = 'node';\n        }\n      }\n      stats['sdk.' + clientName + '.' + SDK_VERSION.replace(/\\./g, '-')] = 1;\n      if (isMobileCordova()) {\n        stats['framework.cordova'] = 1;\n      } else if (isReactNative()) {\n        stats['framework.reactnative'] = 1;\n      }\n      this.reportStats(stats);\n    }\n    shouldReconnect_() {\n      const online = OnlineMonitor.getInstance().currentlyOnline();\n      return isEmpty(this.interruptReasons_) && online;\n    }\n  }\n  PersistentConnection.nextPersistentConnectionId_ = 0;\n  /**\n   * Counter for number of connections created. Mainly used for tagging in the logs\n   */\n  PersistentConnection.nextConnectionId_ = 0;\n\n  /**\n   * @license\n   * Copyright 2017 Google LLC\n   *\n   * Licensed under the Apache License, Version 2.0 (the \"License\");\n   * you may not use this file except in compliance with the License.\n   * You may obtain a copy of the License at\n   *\n   *   http://www.apache.org/licenses/LICENSE-2.0\n   *\n   * Unless required by applicable law or agreed to in writing, software\n   * distributed under the License is distributed on an \"AS IS\" BASIS,\n   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n   * See the License for the specific language governing permissions and\n   * limitations under the License.\n   */\n  return PersistentConnection;\n})();\nclass NamedNode {\n  constructor(name, node) {\n    this.name = name;\n    this.node = node;\n  }\n  static Wrap(name, node) {\n    return new NamedNode(name, node);\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 */\nclass Index {\n  /**\n   * @returns A standalone comparison function for\n   * this index\n   */\n  getCompare() {\n    return this.compare.bind(this);\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, newNode) {\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   * @returns a node wrapper that will sort equal to or less than\n   * any other node wrapper, using this index\n   */\n  minPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return NamedNode.MIN;\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 */\nlet __EMPTY_NODE;\nclass KeyIndex extends Index {\n  static get __EMPTY_NODE() {\n    return __EMPTY_NODE;\n  }\n  static set __EMPTY_NODE(val) {\n    __EMPTY_NODE = val;\n  }\n  compare(a, b) {\n    return nameCompare(a.name, b.name);\n  }\n  isDefinedOn(node) {\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, newNode) {\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.MIN;\n  }\n  maxPost() {\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  makePost(indexValue, name) {\n    assert(typeof indexValue === 'string', 'KeyIndex indexValue must always be a string.');\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   * @returns String representation for inclusion in a query spec\n   */\n  toString() {\n    return '.key';\n  }\n}\nconst KEY_INDEX = new KeyIndex();\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An iterator over an LLRBNode.\n */\nclass SortedMapIterator {\n  /**\n   * @param node - Node to iterate.\n   * @param isReverse_ - Whether or not to iterate in reverse\n   */\n  constructor(node, startKey, comparator, isReverse_, resultGenerator_ = null) {\n    this.isReverse_ = isReverse_;\n    this.resultGenerator_ = resultGenerator_;\n    this.nodeStack_ = [];\n    let cmp = 1;\n    while (!node.isEmpty()) {\n      node = node;\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      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  getNext() {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n    let node = this.nodeStack_.pop();\n    let result;\n    if (this.resultGenerator_) {\n      result = this.resultGenerator_(node.key, node.value);\n    } else {\n      result = {\n        key: node.key,\n        value: node.value\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    return result;\n  }\n  hasNext() {\n    return this.nodeStack_.length > 0;\n  }\n  peek() {\n    if (this.nodeStack_.length === 0) {\n      return null;\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 {\n        key: node.key,\n        value: node.value\n      };\n    }\n  }\n}\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nlet LLRBNode = /*#__PURE__*/(() => {\n  class LLRBNode {\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(key, value, color, left, right) {\n      this.key = key;\n      this.value = value;\n      this.color = color != null ? color : LLRBNode.RED;\n      this.left = left != null ? left : SortedMap.EMPTY_NODE;\n      this.right = right != null ? right : SortedMap.EMPTY_NODE;\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(key, value, color, left, right) {\n      return new LLRBNode(key != null ? key : this.key, value != null ? value : this.value, color != null ? color : this.color, left != null ? left : this.left, right != null ? right : this.right);\n    }\n    /**\n     * @returns The total number of nodes in the tree.\n     */\n    count() {\n      return this.left.count() + 1 + this.right.count();\n    }\n    /**\n     * @returns True if the tree is empty.\n     */\n    isEmpty() {\n      return false;\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) {\n      return this.left.inorderTraversal(action) || !!action(this.key, this.value) || this.right.inorderTraversal(action);\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) {\n      return this.right.reverseTraversal(action) || action(this.key, this.value) || this.left.reverseTraversal(action);\n    }\n    /**\n     * @returns The minimum node in the tree.\n     */\n    min_() {\n      if (this.left.isEmpty()) {\n        return this;\n      } else {\n        return this.left.min_();\n      }\n    }\n    /**\n     * @returns The maximum key in the tree.\n     */\n    minKey() {\n      return this.min_().key;\n    }\n    /**\n     * @returns The maximum key in the tree.\n     */\n    maxKey() {\n      if (this.right.isEmpty()) {\n        return this.key;\n      } else {\n        return this.right.maxKey();\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, value, comparator) {\n      let n = 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(null, null, null, null, n.right.insert(key, value, comparator));\n      }\n      return n.fixUp_();\n    }\n    /**\n     * @returns New tree, with the minimum key removed.\n     */\n    removeMin_() {\n      if (this.left.isEmpty()) {\n        return SortedMap.EMPTY_NODE;\n      }\n      let n = this;\n      if (!n.left.isRed_() && !n.left.left.isRed_()) {\n        n = n.moveRedLeft_();\n      }\n      n = n.copy(null, null, null, n.left.removeMin_(), null);\n      return n.fixUp_();\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(key, comparator) {\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;\n          } else {\n            smallest = n.right.min_();\n            n = n.copy(smallest.key, smallest.value, null, null, n.right.removeMin_());\n          }\n        }\n        n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n      }\n      return n.fixUp_();\n    }\n    /**\n     * @returns Whether this is a RED node.\n     */\n    isRed_() {\n      return this.color;\n    }\n    /**\n     * @returns New tree after performing any needed rotations.\n     */\n    fixUp_() {\n      let n = 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     * @returns New tree, after moveRedLeft.\n     */\n    moveRedLeft_() {\n      let n = this.colorFlip_();\n      if (n.right.left.isRed_()) {\n        n = n.copy(null, null, null, null, n.right.rotateRight_());\n        n = n.rotateLeft_();\n        n = n.colorFlip_();\n      }\n      return n;\n    }\n    /**\n     * @returns New tree, after moveRedRight.\n     */\n    moveRedRight_() {\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     * @returns New tree, after rotateLeft.\n     */\n    rotateLeft_() {\n      const nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n      return this.right.copy(null, null, this.color, nl, null);\n    }\n    /**\n     * @returns New tree, after rotateRight.\n     */\n    rotateRight_() {\n      const nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n      return this.left.copy(null, null, this.color, null, nr);\n    }\n    /**\n     * @returns Newt ree, after colorFlip.\n     */\n    colorFlip_() {\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     * For testing.\n     *\n     * @returns True if all is well.\n     */\n    checkMaxDepth_() {\n      const blackDepth = this.check_();\n      return Math.pow(2.0, blackDepth) <= this.count() + 1;\n    }\n    check_() {\n      if (this.isRed_() && this.left.isRed_()) {\n        throw new Error('Red node has red child(' + this.key + ',' + this.value + ')');\n      }\n      if (this.right.isRed_()) {\n        throw new Error('Right child of (' + this.key + ',' + this.value + ') is red');\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  LLRBNode.RED = true;\n  LLRBNode.BLACK = false;\n  /**\n   * Represents an empty node (a leaf node in the Red-Black Tree).\n   */\n  return LLRBNode;\n})();\nclass LLRBEmptyNode {\n  /**\n   * Returns a copy of the current node.\n   *\n   * @returns The node copy.\n   */\n  copy(key, value, color, left, right) {\n    return this;\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, value, comparator) {\n    return new LLRBNode(key, value, null);\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, comparator) {\n    return this;\n  }\n  /**\n   * @returns The total number of nodes in the tree.\n   */\n  count() {\n    return 0;\n  }\n  /**\n   * @returns True if the tree is empty.\n   */\n  isEmpty() {\n    return true;\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) {\n    return false;\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) {\n    return false;\n  }\n  minKey() {\n    return null;\n  }\n  maxKey() {\n    return null;\n  }\n  check_() {\n    return 0;\n  }\n  /**\n   * @returns Whether this node is red.\n   */\n  isRed_() {\n    return false;\n  }\n}\n/**\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\n * tree.\n */\nclass SortedMap {\n  /**\n   * @param comparator_ - Key comparator.\n   * @param root_ - Optional root node for the map.\n   */\n  constructor(comparator_, root_ = SortedMap.EMPTY_NODE) {\n    this.comparator_ = comparator_;\n    this.root_ = root_;\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, value) {\n    return new SortedMap(this.comparator_, this.root_.insert(key, value, this.comparator_).copy(null, null, LLRBNode.BLACK, null, null));\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) {\n    return new SortedMap(this.comparator_, this.root_.remove(key, this.comparator_).copy(null, null, LLRBNode.BLACK, null, null));\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) {\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   * 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) {\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    throw new Error('Attempted to find predecessor key for a nonexistent key.  What gives?');\n  }\n  /**\n   * @returns True if the map is empty.\n   */\n  isEmpty() {\n    return this.root_.isEmpty();\n  }\n  /**\n   * @returns The total number of nodes in the map.\n   */\n  count() {\n    return this.root_.count();\n  }\n  /**\n   * @returns The minimum key in the map.\n   */\n  minKey() {\n    return this.root_.minKey();\n  }\n  /**\n   * @returns The maximum key in the map.\n   */\n  maxKey() {\n    return this.root_.maxKey();\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) {\n    return this.root_.inorderTraversal(action);\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) {\n    return this.root_.reverseTraversal(action);\n  }\n  /**\n   * Returns an iterator over the SortedMap.\n   * @returns The iterator.\n   */\n  getIterator(resultGenerator) {\n    return new SortedMapIterator(this.root_, null, this.comparator_, false, resultGenerator);\n  }\n  getIteratorFrom(key, resultGenerator) {\n    return new SortedMapIterator(this.root_, key, this.comparator_, false, resultGenerator);\n  }\n  getReverseIteratorFrom(key, resultGenerator) {\n    return new SortedMapIterator(this.root_, key, this.comparator_, true, resultGenerator);\n  }\n  getReverseIterator(resultGenerator) {\n    return new SortedMapIterator(this.root_, null, this.comparator_, true, resultGenerator);\n  }\n}\n/**\n * Always use the same empty node, to reduce memory.\n */\nSortedMap.EMPTY_NODE = new LLRBEmptyNode();\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction NAME_ONLY_COMPARATOR(left, right) {\n  return nameCompare(left.name, right.name);\n}\nfunction NAME_COMPARATOR(left, right) {\n  return nameCompare(left, right);\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 */\nlet MAX_NODE$2;\nfunction setMaxNode$1(val) {\n  MAX_NODE$2 = val;\n}\nconst priorityHashText = function (priority) {\n  if (typeof priority === 'number') {\n    return 'number:' + doubleToIEEE754String(priority);\n  } else {\n    return 'string:' + priority;\n  }\n};\n/**\n * Validates that a priority snapshot Node is valid.\n */\nconst validatePriorityNode = function (priorityNode) {\n  if (priorityNode.isLeafNode()) {\n    const val = priorityNode.val();\n    assert(typeof val === 'string' || typeof val === 'number' || typeof val === 'object' && contains(val, '.sv'), 'Priority must be a string or number.');\n  } else {\n    assert(priorityNode === MAX_NODE$2 || priorityNode.isEmpty(), 'priority of unexpected type.');\n  }\n  // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\n  assert(priorityNode === MAX_NODE$2 || priorityNode.getPriority().isEmpty(), \"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 */\nlet __childrenNodeConstructor;\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 */\nlet LeafNode = /*#__PURE__*/(() => {\n  class LeafNode {\n    static set __childrenNodeConstructor(val) {\n      __childrenNodeConstructor = val;\n    }\n    static get __childrenNodeConstructor() {\n      return __childrenNodeConstructor;\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(value_, priorityNode_ = LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\n      this.value_ = value_;\n      this.priorityNode_ = priorityNode_;\n      this.lazyHash_ = null;\n      assert(this.value_ !== undefined && this.value_ !== null, \"LeafNode shouldn't be created with null/undefined value.\");\n      validatePriorityNode(this.priorityNode_);\n    }\n    /** @inheritDoc */\n    isLeafNode() {\n      return true;\n    }\n    /** @inheritDoc */\n    getPriority() {\n      return this.priorityNode_;\n    }\n    /** @inheritDoc */\n    updatePriority(newPriorityNode) {\n      return new LeafNode(this.value_, newPriorityNode);\n    }\n    /** @inheritDoc */\n    getImmediateChild(childName) {\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    /** @inheritDoc */\n    getChild(path) {\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() {\n      return false;\n    }\n    /** @inheritDoc */\n    getPredecessorChildName(childName, childNode) {\n      return null;\n    }\n    /** @inheritDoc */\n    updateImmediateChild(childName, newChildNode) {\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(childName, newChildNode).updatePriority(this.priorityNode_);\n      }\n    }\n    /** @inheritDoc */\n    updateChild(path, newChildNode) {\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(front !== '.priority' || pathGetLength(path) === 1, '.priority must be the last token in a path');\n        return this.updateImmediateChild(front, LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(pathPopFront(path), newChildNode));\n      }\n    }\n    /** @inheritDoc */\n    isEmpty() {\n      return false;\n    }\n    /** @inheritDoc */\n    numChildren() {\n      return 0;\n    }\n    /** @inheritDoc */\n    forEachChild(index, action) {\n      return false;\n    }\n    val(exportFormat) {\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    /** @inheritDoc */\n    hash() {\n      if (this.lazyHash_ === null) {\n        let toHash = '';\n        if (!this.priorityNode_.isEmpty()) {\n          toHash += 'priority:' + priorityHashText(this.priorityNode_.val()) + ':';\n        }\n        const type = typeof this.value_;\n        toHash += type + ':';\n        if (type === 'number') {\n          toHash += doubleToIEEE754String(this.value_);\n        } else {\n          toHash += this.value_;\n        }\n        this.lazyHash_ = sha1(toHash);\n      }\n      return this.lazyHash_;\n    }\n    /**\n     * Returns the value of the leaf node.\n     * @returns The value of the node.\n     */\n    getValue() {\n      return this.value_;\n    }\n    compareTo(other) {\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);\n      }\n    }\n    /**\n     * Comparison specifically for two leaf nodes\n     */\n    compareToLeafNode_(otherLeaf) {\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() {\n      return this;\n    }\n    isIndexed() {\n      return true;\n    }\n    equals(other) {\n      if (other === this) {\n        return true;\n      } else if (other.isLeafNode()) {\n        const otherLeaf = other;\n        return this.value_ === otherLeaf.value_ && this.priorityNode_.equals(otherLeaf.priorityNode_);\n      } else {\n        return false;\n      }\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  LeafNode.VALUE_TYPE_ORDER = ['object', 'boolean', 'number', '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  return LeafNode;\n})();\nlet nodeFromJSON$1;\nlet MAX_NODE$1;\nfunction setNodeFromJSON(val) {\n  nodeFromJSON$1 = val;\n}\nfunction setMaxNode(val) {\n  MAX_NODE$1 = val;\n}\nclass PriorityIndex extends Index {\n  compare(a, b) {\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) {\n    return !node.getPriority().isEmpty();\n  }\n  indexedValueChanged(oldNode, newNode) {\n    return !oldNode.getPriority().equals(newNode.getPriority());\n  }\n  minPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return NamedNode.MIN;\n  }\n  maxPost() {\n    return new NamedNode(MAX_NAME, new LeafNode('[PRIORITY-POST]', MAX_NODE$1));\n  }\n  makePost(indexValue, name) {\n    const priorityNode = nodeFromJSON$1(indexValue);\n    return new NamedNode(name, new LeafNode('[PRIORITY-POST]', priorityNode));\n  }\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString() {\n    return '.priority';\n  }\n}\nconst PRIORITY_INDEX = new PriorityIndex();\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst LOG_2 = Math.log(2);\nclass Base12Num {\n  constructor(length) {\n    const logBase2 = num =>\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    parseInt(Math.log(num) / LOG_2, 10);\n    const bitMask = bits => 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  nextBitIsOne() {\n    //noinspection JSBitwiseOperatorUsage\n    const result = !(this.bits_ & 0x1 << this.current_);\n    this.current_--;\n    return result;\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 */\nconst buildChildSet = function (childList, cmp, keyFn, mapSortFn) {\n  childList.sort(cmp);\n  const buildBalancedTree = function (low, high) {\n    const length = high - low;\n    let namedNode;\n    let key;\n    if (length === 0) {\n      return null;\n    } else if (length === 1) {\n      namedNode = childList[low];\n      key = keyFn ? keyFn(namedNode) : namedNode;\n      return new LLRBNode(key, namedNode.node, LLRBNode.BLACK, null, null);\n    } else {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const middle = parseInt(length / 2, 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;\n      return new LLRBNode(key, namedNode.node, LLRBNode.BLACK, left, right);\n    }\n  };\n  const buildFrom12Array = function (base12) {\n    let node = null;\n    let root = null;\n    let index = childList.length;\n    const buildPennant = function (chunkSize, color) {\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 = keyFn ? keyFn(namedNode) : namedNode;\n      attachPennant(new LLRBNode(key, namedNode.node, color, null, childTree));\n    };\n    const attachPennant = function (pennant) {\n      if (node) {\n        node.left = pennant;\n        node = pennant;\n      } else {\n        root = pennant;\n        node = pennant;\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  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(mapSortFn || cmp, root);\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 */\nlet _defaultIndexMap;\nconst fallbackObject = {};\nclass IndexMap {\n  /**\n   * The default IndexMap for nodes without a priority\n   */\n  static get Default() {\n    assert(fallbackObject && PRIORITY_INDEX, 'ChildrenNode.ts has not been loaded');\n    _defaultIndexMap = _defaultIndexMap || new IndexMap({\n      '.priority': fallbackObject\n    }, {\n      '.priority': PRIORITY_INDEX\n    });\n    return _defaultIndexMap;\n  }\n  constructor(indexes_, indexSet_) {\n    this.indexes_ = indexes_;\n    this.indexSet_ = indexSet_;\n  }\n  get(indexKey) {\n    const sortedMap = safeGet(this.indexes_, indexKey);\n    if (!sortedMap) {\n      throw new Error('No index defined for ' + indexKey);\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  hasIndex(indexDefinition) {\n    return contains(this.indexSet_, indexDefinition.toString());\n  }\n  addIndex(indexDefinition, existingChildren) {\n    assert(indexDefinition !== KEY_INDEX, \"KeyIndex always exists and isn't meant to be added to the IndexMap.\");\n    const childList = [];\n    let sawIndexedValue = false;\n    const iter = existingChildren.getIterator(NamedNode.Wrap);\n    let next = iter.getNext();\n    while (next) {\n      sawIndexedValue = 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 = Object.assign({}, this.indexSet_);\n    newIndexSet[indexName] = indexDefinition;\n    const newIndexes = Object.assign({}, this.indexes_);\n    newIndexes[indexName] = newIndex;\n    return new IndexMap(newIndexes, newIndexSet);\n  }\n  /**\n   * Ensure that this node is properly tracked in any indexes that we're maintaining\n   */\n  addToIndexes(namedNode, existingChildren) {\n    const newIndexes = map(this.indexes_, (indexedChildren, indexName) => {\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(new NamedNode(namedNode.name, existingSnap));\n        }\n        return newChildren.insert(namedNode, namedNode.node);\n      }\n    });\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n  /**\n   * Create a new IndexMap instance with the given value removed\n   */\n  removeFromIndexes(namedNode, existingChildren) {\n    const newIndexes = map(this.indexes_, indexedChildren => {\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(new NamedNode(namedNode.name, existingSnap));\n        } else {\n          // No record of this child\n          return indexedChildren;\n        }\n      }\n    });\n    return new IndexMap(newIndexes, this.indexSet_);\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// TODO: For memory savings, don't store priorityNode_ if it's empty.\nlet EMPTY_NODE;\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 */\nlet ChildrenNode = /*#__PURE__*/(() => {\n  class ChildrenNode {\n    static get EMPTY_NODE() {\n      return EMPTY_NODE || (EMPTY_NODE = new ChildrenNode(new SortedMap(NAME_COMPARATOR), null, IndexMap.Default));\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(children_, priorityNode_, indexMap_) {\n      this.children_ = children_;\n      this.priorityNode_ = priorityNode_;\n      this.indexMap_ = indexMap_;\n      this.lazyHash_ = null;\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      if (this.children_.isEmpty()) {\n        assert(!this.priorityNode_ || this.priorityNode_.isEmpty(), 'An empty node cannot have a priority');\n      }\n    }\n    /** @inheritDoc */\n    isLeafNode() {\n      return false;\n    }\n    /** @inheritDoc */\n    getPriority() {\n      return this.priorityNode_ || EMPTY_NODE;\n    }\n    /** @inheritDoc */\n    updatePriority(newPriorityNode) {\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    /** @inheritDoc */\n    getImmediateChild(childName) {\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    /** @inheritDoc */\n    getChild(path) {\n      const front = pathGetFront(path);\n      if (front === null) {\n        return this;\n      }\n      return this.getImmediateChild(front).getChild(pathPopFront(path));\n    }\n    /** @inheritDoc */\n    hasChild(childName) {\n      return this.children_.get(childName) !== null;\n    }\n    /** @inheritDoc */\n    updateImmediateChild(childName, newChildNode) {\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(namedNode, this.children_);\n        } else {\n          newChildren = this.children_.insert(childName, newChildNode);\n          newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\n        }\n        const newPriority = newChildren.isEmpty() ? EMPTY_NODE : this.priorityNode_;\n        return new ChildrenNode(newChildren, newPriority, newIndexMap);\n      }\n    }\n    /** @inheritDoc */\n    updateChild(path, newChildNode) {\n      const front = pathGetFront(path);\n      if (front === null) {\n        return newChildNode;\n      } else {\n        assert(pathGetFront(path) !== '.priority' || pathGetLength(path) === 1, '.priority must be the last token in a path');\n        const newImmediateChild = this.getImmediateChild(front).updateChild(pathPopFront(path), newChildNode);\n        return this.updateImmediateChild(front, newImmediateChild);\n      }\n    }\n    /** @inheritDoc */\n    isEmpty() {\n      return this.children_.isEmpty();\n    }\n    /** @inheritDoc */\n    numChildren() {\n      return this.children_.count();\n    }\n    /** @inheritDoc */\n    val(exportFormat) {\n      if (this.isEmpty()) {\n        return null;\n      }\n      const obj = {};\n      let numKeys = 0,\n        maxKey = 0,\n        allIntegerKeys = true;\n      this.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n        obj[key] = childNode.val(exportFormat);\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      if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\n        // convert to array.\n        const array = [];\n        // eslint-disable-next-line guard-for-in\n        for (const key in obj) {\n          array[key] = obj[key];\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    /** @inheritDoc */\n    hash() {\n      if (this.lazyHash_ === null) {\n        let toHash = '';\n        if (!this.getPriority().isEmpty()) {\n          toHash += 'priority:' + priorityHashText(this.getPriority().val()) + ':';\n        }\n        this.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          const childHash = childNode.hash();\n          if (childHash !== '') {\n            toHash += ':' + key + ':' + childHash;\n          }\n        });\n        this.lazyHash_ = toHash === '' ? '' : sha1(toHash);\n      }\n      return this.lazyHash_;\n    }\n    /** @inheritDoc */\n    getPredecessorChildName(childName, childNode, index) {\n      const idx = this.resolveIndex_(index);\n      if (idx) {\n        const predecessor = idx.getPredecessorKey(new NamedNode(childName, childNode));\n        return predecessor ? predecessor.name : null;\n      } else {\n        return this.children_.getPredecessorKey(childName);\n      }\n    }\n    getFirstChildName(indexDefinition) {\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    getFirstChild(indexDefinition) {\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     * Given an index, return the key name of the largest value we have, according to that index\n     */\n    getLastChildName(indexDefinition) {\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    getLastChild(indexDefinition) {\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(index, action) {\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    getIterator(indexDefinition) {\n      return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n    }\n    getIteratorFrom(startPost, indexDefinition) {\n      const idx = this.resolveIndex_(indexDefinition);\n      if (idx) {\n        return idx.getIteratorFrom(startPost, key => key);\n      } else {\n        const iterator = this.children_.getIteratorFrom(startPost.name, NamedNode.Wrap);\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    getReverseIterator(indexDefinition) {\n      return this.getReverseIteratorFrom(indexDefinition.maxPost(), indexDefinition);\n    }\n    getReverseIteratorFrom(endPost, indexDefinition) {\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(endPost.name, NamedNode.Wrap);\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) {\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) {\n      if (indexDefinition === KEY_INDEX || this.indexMap_.hasIndex(indexDefinition)) {\n        return this;\n      } else {\n        const newIndexMap = this.indexMap_.addIndex(indexDefinition, this.children_);\n        return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\n      }\n    }\n    isIndexed(index) {\n      return index === KEY_INDEX || this.indexMap_.hasIndex(index);\n    }\n    equals(other) {\n      if (other === this) {\n        return true;\n      } else if (other.isLeafNode()) {\n        return false;\n      } else {\n        const otherChildrenNode = other;\n        if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\n          return false;\n        } else if (this.children_.count() === otherChildrenNode.children_.count()) {\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 (thisCurrent.name !== otherCurrent.name || !thisCurrent.node.equals(otherCurrent.node)) {\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     * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\n     * instead.\n     *\n     */\n    resolveIndex_(indexDefinition) {\n      if (indexDefinition === KEY_INDEX) {\n        return null;\n      } else {\n        return this.indexMap_.get(indexDefinition.toString());\n      }\n    }\n  }\n  ChildrenNode.INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\n  return ChildrenNode;\n})();\nclass MaxNode extends ChildrenNode {\n  constructor() {\n    super(new SortedMap(NAME_COMPARATOR), ChildrenNode.EMPTY_NODE, IndexMap.Default);\n  }\n  compareTo(other) {\n    if (other === this) {\n      return 0;\n    } else {\n      return 1;\n    }\n  }\n  equals(other) {\n    // Not that we every compare it, but MAX_NODE is only ever equal to itself\n    return other === this;\n  }\n  getPriority() {\n    return this;\n  }\n  getImmediateChild(childName) {\n    return ChildrenNode.EMPTY_NODE;\n  }\n  isEmpty() {\n    return false;\n  }\n}\n/**\n * Marker that will sort higher than any other snapshot.\n */\nconst MAX_NODE = new MaxNode();\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 * Reference Extensions\n */\nKeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode.__childrenNodeConstructor = ChildrenNode;\nsetMaxNode$1(MAX_NODE);\nsetMaxNode(MAX_NODE);\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst USE_HINZE = true;\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 */\nfunction nodeFromJSON(json, priority = null) {\n  if (json === null) {\n    return ChildrenNode.EMPTY_NODE;\n  }\n  if (typeof json === 'object' && '.priority' in json) {\n    priority = json['.priority'];\n  }\n  assert(priority === null || typeof priority === 'string' || typeof priority === 'number' || typeof priority === 'object' && '.sv' in priority, 'Invalid priority type found: ' + typeof priority);\n  if (typeof json === 'object' && '.value' in json && json['.value'] !== null) {\n    json = json['.value'];\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;\n    return new LeafNode(jsonLeaf, nodeFromJSON(priority));\n  }\n  if (!(json instanceof Array) && USE_HINZE) {\n    const children = [];\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 = childrenHavePriority || !childNode.getPriority().isEmpty();\n          children.push(new NamedNode(key, childNode));\n        }\n      }\n    });\n    if (children.length === 0) {\n      return ChildrenNode.EMPTY_NODE;\n    }\n    const childSet = buildChildSet(children, NAME_ONLY_COMPARATOR, namedNode => namedNode.name, NAME_COMPARATOR);\n    if (childrenHavePriority) {\n      const sortedChildSet = buildChildSet(children, PRIORITY_INDEX.getCompare());\n      return new ChildrenNode(childSet, nodeFromJSON(priority), new IndexMap({\n        '.priority': sortedChildSet\n      }, {\n        '.priority': PRIORITY_INDEX\n      }));\n    } else {\n      return new ChildrenNode(childSet, nodeFromJSON(priority), IndexMap.Default);\n    }\n  } else {\n    let node = ChildrenNode.EMPTY_NODE;\n    each(json, (key, childData) => {\n      if (contains(json, 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    return node.updatePriority(nodeFromJSON(priority));\n  }\n}\nsetNodeFromJSON(nodeFromJSON);\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass PathIndex extends Index {\n  constructor(indexPath_) {\n    super();\n    this.indexPath_ = indexPath_;\n    assert(!pathIsEmpty(indexPath_) && pathGetFront(indexPath_) !== '.priority', \"Can't create PathIndex with empty path or .priority key\");\n  }\n  extractChild(snap) {\n    return snap.getChild(this.indexPath_);\n  }\n  isDefinedOn(node) {\n    return !node.getChild(this.indexPath_).isEmpty();\n  }\n  compare(a, b) {\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, name) {\n    const valueNode = nodeFromJSON(indexValue);\n    const node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, valueNode);\n    return new NamedNode(name, node);\n  }\n  maxPost() {\n    const node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, MAX_NODE);\n    return new NamedNode(MAX_NAME, node);\n  }\n  toString() {\n    return pathSlice(this.indexPath_, 0).join('/');\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 */\nclass ValueIndex extends Index {\n  compare(a, b) {\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) {\n    return true;\n  }\n  indexedValueChanged(oldNode, newNode) {\n    return !oldNode.equals(newNode);\n  }\n  minPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return NamedNode.MIN;\n  }\n  maxPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return NamedNode.MAX;\n  }\n  makePost(indexValue, name) {\n    const valueNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, valueNode);\n  }\n  /**\n   * @returns String representation for inclusion in a query spec\n   */\n  toString() {\n    return '.value';\n  }\n}\nconst VALUE_INDEX = new ValueIndex();\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction changeValue(snapshotNode) {\n  return {\n    type: \"value\" /* ChangeType.VALUE */,\n    snapshotNode\n  };\n}\nfunction changeChildAdded(childName, snapshotNode) {\n  return {\n    type: \"child_added\" /* ChangeType.CHILD_ADDED */,\n    snapshotNode,\n    childName\n  };\n}\nfunction changeChildRemoved(childName, snapshotNode) {\n  return {\n    type: \"child_removed\" /* ChangeType.CHILD_REMOVED */,\n    snapshotNode,\n    childName\n  };\n}\nfunction changeChildChanged(childName, snapshotNode, oldSnap) {\n  return {\n    type: \"child_changed\" /* ChangeType.CHILD_CHANGED */,\n    snapshotNode,\n    childName,\n    oldSnap\n  };\n}\nfunction changeChildMoved(childName, snapshotNode) {\n  return {\n    type: \"child_moved\" /* ChangeType.CHILD_MOVED */,\n    snapshotNode,\n    childName\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 * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\n */\nclass IndexedFilter {\n  constructor(index_) {\n    this.index_ = index_;\n  }\n  updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n    assert(snap.isIndexed(this.index_), 'A node must be indexed if only a child is updated');\n    const oldChild = snap.getImmediateChild(key);\n    // Check if anything actually changed.\n    if (oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))) {\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        // 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    if (optChangeAccumulator != null) {\n      if (newChild.isEmpty()) {\n        if (snap.hasChild(key)) {\n          optChangeAccumulator.trackChildChange(changeChildRemoved(key, oldChild));\n        } else {\n          assert(snap.isLeafNode(), 'A child remove without an old child only makes sense on a leaf node');\n        }\n      } else if (oldChild.isEmpty()) {\n        optChangeAccumulator.trackChildChange(changeChildAdded(key, newChild));\n      } else {\n        optChangeAccumulator.trackChildChange(changeChildChanged(key, newChild, oldChild));\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(oldSnap, newSnap, optChangeAccumulator) {\n    if (optChangeAccumulator != null) {\n      if (!oldSnap.isLeafNode()) {\n        oldSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (!newSnap.hasChild(key)) {\n            optChangeAccumulator.trackChildChange(changeChildRemoved(key, childNode));\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(changeChildChanged(key, childNode, oldChild));\n            }\n          } else {\n            optChangeAccumulator.trackChildChange(changeChildAdded(key, childNode));\n          }\n        });\n      }\n    }\n    return newSnap.withIndex(this.index_);\n  }\n  updatePriority(oldSnap, newPriority) {\n    if (oldSnap.isEmpty()) {\n      return ChildrenNode.EMPTY_NODE;\n    } else {\n      return oldSnap.updatePriority(newPriority);\n    }\n  }\n  filtersNodes() {\n    return false;\n  }\n  getIndexedFilter() {\n    return this;\n  }\n  getIndex() {\n    return this.index_;\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 * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\n */\nclass RangedFilter {\n  constructor(params) {\n    this.indexedFilter_ = new IndexedFilter(params.getIndex());\n    this.index_ = params.getIndex();\n    this.startPost_ = RangedFilter.getStartPost_(params);\n    this.endPost_ = RangedFilter.getEndPost_(params);\n    this.startIsInclusive_ = !params.startAfterSet_;\n    this.endIsInclusive_ = !params.endBeforeSet_;\n  }\n  getStartPost() {\n    return this.startPost_;\n  }\n  getEndPost() {\n    return this.endPost_;\n  }\n  matches(node) {\n    const isWithinStart = this.startIsInclusive_ ? this.index_.compare(this.getStartPost(), node) <= 0 : this.index_.compare(this.getStartPost(), node) < 0;\n    const isWithinEnd = this.endIsInclusive_ ? this.index_.compare(node, this.getEndPost()) <= 0 : this.index_.compare(node, this.getEndPost()) < 0;\n    return isWithinStart && isWithinEnd;\n  }\n  updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator) {\n    if (!this.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    return this.indexedFilter_.updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\n  }\n  updateFullNode(oldSnap, newSnap, optChangeAccumulator) {\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(oldSnap, filtered, optChangeAccumulator);\n  }\n  updatePriority(oldSnap, newPriority) {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n  filtersNodes() {\n    return true;\n  }\n  getIndexedFilter() {\n    return this.indexedFilter_;\n  }\n  getIndex() {\n    return this.index_;\n  }\n  static getStartPost_(params) {\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  static getEndPost_(params) {\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\n */\nclass LimitedFilter {\n  constructor(params) {\n    this.withinDirectionalStart = node => this.reverse_ ? this.withinEndPost(node) : this.withinStartPost(node);\n    this.withinDirectionalEnd = node => this.reverse_ ? this.withinStartPost(node) : this.withinEndPost(node);\n    this.withinStartPost = node => {\n      const compareRes = this.index_.compare(this.rangedFilter_.getStartPost(), node);\n      return this.startIsInclusive_ ? compareRes <= 0 : compareRes < 0;\n    };\n    this.withinEndPost = node => {\n      const compareRes = this.index_.compare(node, this.rangedFilter_.getEndPost());\n      return this.endIsInclusive_ ? compareRes <= 0 : compareRes < 0;\n    };\n    this.rangedFilter_ = new RangedFilter(params);\n    this.index_ = params.getIndex();\n    this.limit_ = params.getLimit();\n    this.reverse_ = !params.isViewFromLeft();\n    this.startIsInclusive_ = !params.startAfterSet_;\n    this.endIsInclusive_ = !params.endBeforeSet_;\n  }\n  updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator) {\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_.getIndexedFilter().updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\n    } else {\n      return this.fullLimitUpdateChild_(snap, key, newChild, source, optChangeAccumulator);\n    }\n  }\n  updateFullNode(oldSnap, newSnap, optChangeAccumulator) {\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 (this.limit_ * 2 < newSnap.numChildren() && newSnap.isIndexed(this.index_)) {\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.getReverseIteratorFrom(this.rangedFilter_.getEndPost(), this.index_);\n        } else {\n          iterator = newSnap.getIteratorFrom(this.rangedFilter_.getStartPost(), this.index_);\n        }\n        let count = 0;\n        while (iterator.hasNext() && count < this.limit_) {\n          const next = iterator.getNext();\n          if (!this.withinDirectionalStart(next)) {\n            // if we have not reached the start, skip to the next element\n            continue;\n          } else if (!this.withinDirectionalEnd(next)) {\n            // if we have reached the end, stop adding elements\n            break;\n          } else {\n            filtered = filtered.updateImmediateChild(next.name, next.node);\n            count++;\n          }\n        }\n      } else {\n        // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\n        filtered = newSnap.withIndex(this.index_);\n        // Don't support priorities on queries\n        filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);\n        let iterator;\n        if (this.reverse_) {\n          iterator = filtered.getReverseIterator(this.index_);\n        } else {\n          iterator = filtered.getIterator(this.index_);\n        }\n        let count = 0;\n        while (iterator.hasNext()) {\n          const next = iterator.getNext();\n          const inRange = count < this.limit_ && this.withinDirectionalStart(next) && this.withinDirectionalEnd(next);\n          if (inRange) {\n            count++;\n          } else {\n            filtered = filtered.updateImmediateChild(next.name, ChildrenNode.EMPTY_NODE);\n          }\n        }\n      }\n    }\n    return this.rangedFilter_.getIndexedFilter().updateFullNode(oldSnap, filtered, optChangeAccumulator);\n  }\n  updatePriority(oldSnap, newPriority) {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n  filtersNodes() {\n    return true;\n  }\n  getIndexedFilter() {\n    return this.rangedFilter_.getIndexedFilter();\n  }\n  getIndex() {\n    return this.index_;\n  }\n  fullLimitUpdateChild_(snap, childKey, childSnap, source, changeAccumulator) {\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, b) => indexCmp(b, a);\n    } else {\n      cmp = this.index_.getCompare();\n    }\n    const oldEventCache = snap;\n    assert(oldEventCache.numChildren() === this.limit_, '');\n    const newChildNamedNode = new NamedNode(childKey, childSnap);\n    const windowBoundary = this.reverse_ ? oldEventCache.getFirstChild(this.index_) : oldEventCache.getLastChild(this.index_);\n    const inRange = this.rangedFilter_.matches(newChildNamedNode);\n    if (oldEventCache.hasChild(childKey)) {\n      const oldChildSnap = oldEventCache.getImmediateChild(childKey);\n      let nextChild = source.getChildAfterChild(this.index_, windowBoundary, this.reverse_);\n      while (nextChild != null && (nextChild.name === childKey || oldEventCache.hasChild(nextChild.name))) {\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(this.index_, nextChild, this.reverse_);\n      }\n      const compareNext = nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\n      const remainsInWindow = inRange && !childSnap.isEmpty() && compareNext >= 0;\n      if (remainsInWindow) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(changeChildChanged(childKey, childSnap, oldChildSnap));\n        }\n        return oldEventCache.updateImmediateChild(childKey, childSnap);\n      } else {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(changeChildRemoved(childKey, oldChildSnap));\n        }\n        const newEventCache = oldEventCache.updateImmediateChild(childKey, ChildrenNode.EMPTY_NODE);\n        const nextChildInRange = nextChild != null && this.rangedFilter_.matches(nextChild);\n        if (nextChildInRange) {\n          if (changeAccumulator != null) {\n            changeAccumulator.trackChildChange(changeChildAdded(nextChild.name, nextChild.node));\n          }\n          return newEventCache.updateImmediateChild(nextChild.name, nextChild.node);\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(changeChildRemoved(windowBoundary.name, windowBoundary.node));\n          changeAccumulator.trackChildChange(changeChildAdded(childKey, childSnap));\n        }\n        return oldEventCache.updateImmediateChild(childKey, childSnap).updateImmediateChild(windowBoundary.name, ChildrenNode.EMPTY_NODE);\n      } else {\n        return snap;\n      }\n    } else {\n      return snap;\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 * 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 */\nclass QueryParams {\n  constructor() {\n    this.limitSet_ = false;\n    this.startSet_ = false;\n    this.startNameSet_ = false;\n    this.startAfterSet_ = false; // can only be true if startSet_ is true\n    this.endSet_ = false;\n    this.endNameSet_ = false;\n    this.endBeforeSet_ = false; // can only be true if endSet_ is true\n    this.limit_ = 0;\n    this.viewFrom_ = '';\n    this.indexStartValue_ = null;\n    this.indexStartName_ = '';\n    this.indexEndValue_ = null;\n    this.indexEndName_ = '';\n    this.index_ = PRIORITY_INDEX;\n  }\n  hasStart() {\n    return this.startSet_;\n  }\n  /**\n   * @returns True if it would return from left.\n   */\n  isViewFromLeft() {\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_ === \"l\" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT */;\n    }\n  }\n  /**\n   * Only valid to call if hasStart() returns true\n   */\n  getIndexStartValue() {\n    assert(this.startSet_, 'Only valid if start has been set');\n    return this.indexStartValue_;\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() {\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  hasEnd() {\n    return this.endSet_;\n  }\n  /**\n   * Only valid to call if hasEnd() returns true.\n   */\n  getIndexEndValue() {\n    assert(this.endSet_, 'Only valid if end has been set');\n    return this.indexEndValue_;\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() {\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  hasLimit() {\n    return this.limitSet_;\n  }\n  /**\n   * @returns True if a limit has been set and it has been explicitly anchored\n   */\n  hasAnchoredLimit() {\n    return this.limitSet_ && this.viewFrom_ !== '';\n  }\n  /**\n   * Only valid to call if hasLimit() returns true\n   */\n  getLimit() {\n    assert(this.limitSet_, 'Only valid if limit has been set');\n    return this.limit_;\n  }\n  getIndex() {\n    return this.index_;\n  }\n  loadsAllData() {\n    return !(this.startSet_ || this.endSet_ || this.limitSet_);\n  }\n  isDefault() {\n    return this.loadsAllData() && this.index_ === PRIORITY_INDEX;\n  }\n  copy() {\n    const copy = new QueryParams();\n    copy.limitSet_ = this.limitSet_;\n    copy.limit_ = this.limit_;\n    copy.startSet_ = this.startSet_;\n    copy.startAfterSet_ = this.startAfterSet_;\n    copy.indexStartValue_ = this.indexStartValue_;\n    copy.startNameSet_ = this.startNameSet_;\n    copy.indexStartName_ = this.indexStartName_;\n    copy.endSet_ = this.endSet_;\n    copy.endBeforeSet_ = this.endBeforeSet_;\n    copy.indexEndValue_ = this.indexEndValue_;\n    copy.endNameSet_ = this.endNameSet_;\n    copy.indexEndName_ = this.indexEndName_;\n    copy.index_ = this.index_;\n    copy.viewFrom_ = this.viewFrom_;\n    return copy;\n  }\n}\nfunction queryParamsGetNodeFilter(queryParams) {\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}\nfunction queryParamsLimitToFirst(queryParams, newLimit) {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = \"l\" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT */;\n  return newParams;\n}\nfunction queryParamsLimitToLast(queryParams, newLimit) {\n  const newParams = queryParams.copy();\n  newParams.limitSet_ = true;\n  newParams.limit_ = newLimit;\n  newParams.viewFrom_ = \"r\" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT */;\n  return newParams;\n}\nfunction queryParamsStartAt(queryParams, indexValue, key) {\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}\nfunction queryParamsStartAfter(queryParams, indexValue, key) {\n  let params;\n  if (queryParams.index_ === KEY_INDEX || !!key) {\n    params = queryParamsStartAt(queryParams, indexValue, key);\n  } else {\n    params = queryParamsStartAt(queryParams, indexValue, MAX_NAME);\n  }\n  params.startAfterSet_ = true;\n  return params;\n}\nfunction queryParamsEndAt(queryParams, indexValue, key) {\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}\nfunction queryParamsEndBefore(queryParams, indexValue, key) {\n  let params;\n  if (queryParams.index_ === KEY_INDEX || !!key) {\n    params = queryParamsEndAt(queryParams, indexValue, key);\n  } else {\n    params = queryParamsEndAt(queryParams, indexValue, MIN_NAME);\n  }\n  params.endBeforeSet_ = true;\n  return params;\n}\nfunction queryParamsOrderBy(queryParams, index) {\n  const newParams = queryParams.copy();\n  newParams.index_ = index;\n  return newParams;\n}\n/**\n * Returns a set of REST query string parameters representing this query.\n *\n * @returns query string parameters\n */\nfunction queryParamsToRestQueryStringParameters(queryParams) {\n  const qs = {};\n  if (queryParams.isDefault()) {\n    return qs;\n  }\n  let orderBy;\n  if (queryParams.index_ === PRIORITY_INDEX) {\n    orderBy = \"$priority\" /* REST_QUERY_CONSTANTS.PRIORITY_INDEX */;\n  } else if (queryParams.index_ === VALUE_INDEX) {\n    orderBy = \"$value\" /* REST_QUERY_CONSTANTS.VALUE_INDEX */;\n  } else if (queryParams.index_ === KEY_INDEX) {\n    orderBy = \"$key\" /* REST_QUERY_CONSTANTS.KEY_INDEX */;\n  } else {\n    assert(queryParams.index_ instanceof PathIndex, 'Unrecognized index type!');\n    orderBy = queryParams.index_.toString();\n  }\n  qs[\"orderBy\" /* REST_QUERY_CONSTANTS.ORDER_BY */] = stringify(orderBy);\n  if (queryParams.startSet_) {\n    const startParam = queryParams.startAfterSet_ ? \"startAfter\" /* REST_QUERY_CONSTANTS.START_AFTER */ : \"startAt\" /* REST_QUERY_CONSTANTS.START_AT */;\n    qs[startParam] = stringify(queryParams.indexStartValue_);\n    if (queryParams.startNameSet_) {\n      qs[startParam] += ',' + stringify(queryParams.indexStartName_);\n    }\n  }\n  if (queryParams.endSet_) {\n    const endParam = queryParams.endBeforeSet_ ? \"endBefore\" /* REST_QUERY_CONSTANTS.END_BEFORE */ : \"endAt\" /* REST_QUERY_CONSTANTS.END_AT */;\n    qs[endParam] = stringify(queryParams.indexEndValue_);\n    if (queryParams.endNameSet_) {\n      qs[endParam] += ',' + stringify(queryParams.indexEndName_);\n    }\n  }\n  if (queryParams.limitSet_) {\n    if (queryParams.isViewFromLeft()) {\n      qs[\"limitToFirst\" /* REST_QUERY_CONSTANTS.LIMIT_TO_FIRST */] = queryParams.limit_;\n    } else {\n      qs[\"limitToLast\" /* REST_QUERY_CONSTANTS.LIMIT_TO_LAST */] = queryParams.limit_;\n    }\n  }\n  return qs;\n}\nfunction queryParamsGetQueryObject(queryParams) {\n  const obj = {};\n  if (queryParams.startSet_) {\n    obj[\"sp\" /* WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE */] = queryParams.indexStartValue_;\n    if (queryParams.startNameSet_) {\n      obj[\"sn\" /* WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME */] = queryParams.indexStartName_;\n    }\n    obj[\"sin\" /* WIRE_PROTOCOL_CONSTANTS.INDEX_START_IS_INCLUSIVE */] = !queryParams.startAfterSet_;\n  }\n  if (queryParams.endSet_) {\n    obj[\"ep\" /* WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE */] = queryParams.indexEndValue_;\n    if (queryParams.endNameSet_) {\n      obj[\"en\" /* WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME */] = queryParams.indexEndName_;\n    }\n    obj[\"ein\" /* WIRE_PROTOCOL_CONSTANTS.INDEX_END_IS_INCLUSIVE */] = !queryParams.endBeforeSet_;\n  }\n  if (queryParams.limitSet_) {\n    obj[\"l\" /* WIRE_PROTOCOL_CONSTANTS.LIMIT */] = queryParams.limit_;\n    let viewFrom = queryParams.viewFrom_;\n    if (viewFrom === '') {\n      if (queryParams.isViewFromLeft()) {\n        viewFrom = \"l\" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT */;\n      } else {\n        viewFrom = \"r\" /* WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT */;\n      }\n    }\n    obj[\"vf\" /* 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[\"i\" /* WIRE_PROTOCOL_CONSTANTS.INDEX */] = queryParams.index_.toString();\n  }\n  return obj;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An 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 */\nclass ReadonlyRestClient extends ServerActions {\n  reportStats(stats) {\n    throw new Error('Method not implemented.');\n  }\n  static getListenId_(query, tag) {\n    if (tag !== undefined) {\n      return 'tag$' + tag;\n    } else {\n      assert(query._queryParams.isDefault(), \"should have a tag if it's not a default query.\");\n      return query._path.toString();\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(repoInfo_, onDataUpdate_, authTokenProvider_, appCheckTokenProvider_) {\n    super();\n    this.repoInfo_ = repoInfo_;\n    this.onDataUpdate_ = onDataUpdate_;\n    this.authTokenProvider_ = authTokenProvider_;\n    this.appCheckTokenProvider_ = appCheckTokenProvider_;\n    /** @private {function(...[*])} */\n    this.log_ = logWrapper('p:rest:');\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    this.listens_ = {};\n  }\n  /** @inheritDoc */\n  listen(query, currentHashFn, tag, onComplete) {\n    const pathString = query._path.toString();\n    this.log_('Listen called for ' + pathString + ' ' + query._queryIdentifier);\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    const queryStringParameters = queryParamsToRestQueryStringParameters(query._queryParams);\n    this.restRequest_(pathString + '.json', queryStringParameters, (error, result) => {\n      let data = result;\n      if (error === 404) {\n        data = null;\n        error = null;\n      }\n      if (error === null) {\n        this.onDataUpdate_(pathString, data, /*isMerge=*/false, tag);\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        onComplete(status, null);\n      }\n    });\n  }\n  /** @inheritDoc */\n  unlisten(query, tag) {\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    delete this.listens_[listenId];\n  }\n  get(query) {\n    const queryStringParameters = queryParamsToRestQueryStringParameters(query._queryParams);\n    const pathString = query._path.toString();\n    const deferred = new Deferred();\n    this.restRequest_(pathString + '.json', queryStringParameters, (error, result) => {\n      let data = result;\n      if (error === 404) {\n        data = null;\n        error = null;\n      }\n      if (error === null) {\n        this.onDataUpdate_(pathString, data, /*isMerge=*/false, /*tag=*/null);\n        deferred.resolve(data);\n      } else {\n        deferred.reject(new Error(data));\n      }\n    });\n    return deferred.promise;\n  }\n  /** @inheritDoc */\n  refreshAuthToken(token) {\n    // no-op since we just always call getToken.\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  restRequest_(pathString, queryStringParameters = {}, callback) {\n    queryStringParameters['format'] = 'export';\n    return Promise.all([this.authTokenProvider_.getToken(/*forceRefresh=*/false), this.appCheckTokenProvider_.getToken(/*forceRefresh=*/false)]).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      const url = (this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host + pathString + '?' + 'ns=' + this.repoInfo_.namespace + querystring(queryStringParameters);\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_('REST Response for ' + url + ' received. status:', xhr.status, 'response:', xhr.responseText);\n          let res = null;\n          if (xhr.status >= 200 && xhr.status < 300) {\n            try {\n              res = jsonEval(xhr.responseText);\n            } catch (e) {\n              warn('Failed to parse JSON response for ' + url + ': ' + xhr.responseText);\n            }\n            callback(null, res);\n          } else {\n            // 401 and 404 are expected.\n            if (xhr.status !== 401 && xhr.status !== 404) {\n              warn('Got unsuccessful REST response for ' + url + ' Status: ' + xhr.status);\n            }\n            callback(xhr.status);\n          }\n          callback = null;\n        }\n      };\n      xhr.open('GET', url, /*asynchronous=*/true);\n      xhr.send();\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 * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\n */\nclass SnapshotHolder {\n  constructor() {\n    this.rootNode_ = ChildrenNode.EMPTY_NODE;\n  }\n  getNode(path) {\n    return this.rootNode_.getChild(path);\n  }\n  updateSnapshot(path, newSnapshotNode) {\n    this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction newSparseSnapshotTree() {\n  return {\n    value: null,\n    children: new Map()\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 */\nfunction sparseSnapshotTreeRemember(sparseSnapshotTree, path, data) {\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    const child = sparseSnapshotTree.children.get(childKey);\n    path = pathPopFront(path);\n    sparseSnapshotTreeRemember(child, path, data);\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 */\nfunction sparseSnapshotTreeForget(sparseSnapshotTree, path) {\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        value.forEachChild(PRIORITY_INDEX, (key, tree) => {\n          sparseSnapshotTreeRemember(sparseSnapshotTree, new Path(key), tree);\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(sparseSnapshotTree.children.get(childKey), path);\n        if (safeToRemove) {\n          sparseSnapshotTree.children.delete(childKey);\n        }\n      }\n      return sparseSnapshotTree.children.size === 0;\n    } else {\n      return true;\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 */\nfunction sparseSnapshotTreeForEachTree(sparseSnapshotTree, prefixPath, func) {\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 * 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 */\nfunction sparseSnapshotTreeForEachChild(sparseSnapshotTree, func) {\n  sparseSnapshotTree.children.forEach((tree, key) => {\n    func(key, tree);\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 * Returns the delta from the previous call to get stats.\n *\n * @param collection_ - The collection to \"listen\" to.\n */\nclass StatsListener {\n  constructor(collection_) {\n    this.collection_ = collection_;\n    this.last_ = null;\n  }\n  get() {\n    const newStats = this.collection_.get();\n    const delta = Object.assign({}, newStats);\n    if (this.last_) {\n      each(this.last_, (stat, value) => {\n        delta[stat] = delta[stat] - value;\n      });\n    }\n    this.last_ = newStats;\n    return delta;\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// 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// We'll continue to report stats on average every 5 minutes.\nconst REPORT_STATS_INTERVAL = 5 * 60 * 1000;\nclass StatsReporter {\n  constructor(collection, server_) {\n    this.server_ = server_;\n    this.statsToReport_ = {};\n    this.statsListener_ = new StatsListener(collection);\n    const timeout = FIRST_STATS_MIN_TIME + (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\n    setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\n  }\n  reportStats_() {\n    const stats = this.statsListener_.get();\n    const reportedStats = {};\n    let haveStatsToReport = false;\n    each(stats, (stat, value) => {\n      if (value > 0 && contains(this.statsToReport_, stat)) {\n        reportedStats[stat] = value;\n        haveStatsToReport = true;\n      }\n    });\n    if (haveStatsToReport) {\n      this.server_.reportStats(reportedStats);\n    }\n    // queue our next run.\n    setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL));\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 * @enum\n */\nvar OperationType = /*#__PURE__*/function (OperationType) {\n  OperationType[OperationType[\"OVERWRITE\"] = 0] = \"OVERWRITE\";\n  OperationType[OperationType[\"MERGE\"] = 1] = \"MERGE\";\n  OperationType[OperationType[\"ACK_USER_WRITE\"] = 2] = \"ACK_USER_WRITE\";\n  OperationType[OperationType[\"LISTEN_COMPLETE\"] = 3] = \"LISTEN_COMPLETE\";\n  return OperationType;\n}(OperationType || {});\nfunction newOperationSourceUser() {\n  return {\n    fromUser: true,\n    fromServer: false,\n    queryId: null,\n    tagged: false\n  };\n}\nfunction newOperationSourceServer() {\n  return {\n    fromUser: false,\n    fromServer: true,\n    queryId: null,\n    tagged: false\n  };\n}\nfunction newOperationSourceServerTaggedQuery(queryId) {\n  return {\n    fromUser: false,\n    fromServer: true,\n    queryId,\n    tagged: true\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 */\nclass AckUserWrite {\n  /**\n   * @param affectedTree - A tree containing true for each affected path. Affected paths can't overlap.\n   */\n  constructor(/** @inheritDoc */path, /** @inheritDoc */affectedTree, /** @inheritDoc */revert) {\n    this.path = path;\n    this.affectedTree = affectedTree;\n    this.revert = revert;\n    /** @inheritDoc */\n    this.type = OperationType.ACK_USER_WRITE;\n    /** @inheritDoc */\n    this.source = newOperationSourceUser();\n  }\n  operationForChild(childName) {\n    if (!pathIsEmpty(this.path)) {\n      assert(pathGetFront(this.path) === childName, 'operationForChild called for unrelated child.');\n      return new AckUserWrite(pathPopFront(this.path), this.affectedTree, this.revert);\n    } else if (this.affectedTree.value != null) {\n      assert(this.affectedTree.children.isEmpty(), 'affectedTree should not have overlapping affected paths.');\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass ListenComplete {\n  constructor(source, path) {\n    this.source = source;\n    this.path = path;\n    /** @inheritDoc */\n    this.type = OperationType.LISTEN_COMPLETE;\n  }\n  operationForChild(childName) {\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass Overwrite {\n  constructor(source, path, snap) {\n    this.source = source;\n    this.path = path;\n    this.snap = snap;\n    /** @inheritDoc */\n    this.type = OperationType.OVERWRITE;\n  }\n  operationForChild(childName) {\n    if (pathIsEmpty(this.path)) {\n      return new Overwrite(this.source, newEmptyPath(), this.snap.getImmediateChild(childName));\n    } else {\n      return new Overwrite(this.source, pathPopFront(this.path), this.snap);\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 */\nclass Merge {\n  constructor(/** @inheritDoc */source, /** @inheritDoc */path, /** @inheritDoc */children) {\n    this.source = source;\n    this.path = path;\n    this.children = children;\n    /** @inheritDoc */\n    this.type = OperationType.MERGE;\n  }\n  operationForChild(childName) {\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(pathGetFront(this.path) === childName, \"Can't get a merge for a child not on the path of the operation\");\n      return new Merge(this.source, pathPopFront(this.path), this.children);\n    }\n  }\n  toString() {\n    return 'Operation(' + this.path + ': ' + this.source.toString() + ' merge: ' + this.children.toString() + ')';\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A 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 */\nclass CacheNode {\n  constructor(node_, fullyInitialized_, filtered_) {\n    this.node_ = node_;\n    this.fullyInitialized_ = fullyInitialized_;\n    this.filtered_ = filtered_;\n  }\n  /**\n   * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\n   */\n  isFullyInitialized() {\n    return this.fullyInitialized_;\n  }\n  /**\n   * Returns whether this node is potentially missing children due to a filter applied to the node\n   */\n  isFiltered() {\n    return this.filtered_;\n  }\n  isCompleteForPath(path) {\n    if (pathIsEmpty(path)) {\n      return this.isFullyInitialized() && !this.filtered_;\n    }\n    const childKey = pathGetFront(path);\n    return this.isCompleteForChild(childKey);\n  }\n  isCompleteForChild(key) {\n    return this.isFullyInitialized() && !this.filtered_ || this.node_.hasChild(key);\n  }\n  getNode() {\n    return this.node_;\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An 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 */\nclass EventGenerator {\n  constructor(query_) {\n    this.query_ = query_;\n    this.index_ = this.query_._queryParams.getIndex();\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 */\nfunction eventGeneratorGenerateEventsForChanges(eventGenerator, changes, eventCache, eventRegistrations) {\n  const events = [];\n  const moves = [];\n  changes.forEach(change => {\n    if (change.type === \"child_changed\" /* ChangeType.CHILD_CHANGED */ && eventGenerator.index_.indexedValueChanged(change.oldSnap, change.snapshotNode)) {\n      moves.push(changeChildMoved(change.childName, change.snapshotNode));\n    }\n  });\n  eventGeneratorGenerateEventsForType(eventGenerator, events, \"child_removed\" /* ChangeType.CHILD_REMOVED */, changes, eventRegistrations, eventCache);\n  eventGeneratorGenerateEventsForType(eventGenerator, events, \"child_added\" /* ChangeType.CHILD_ADDED */, changes, eventRegistrations, eventCache);\n  eventGeneratorGenerateEventsForType(eventGenerator, events, \"child_moved\" /* ChangeType.CHILD_MOVED */, moves, eventRegistrations, eventCache);\n  eventGeneratorGenerateEventsForType(eventGenerator, events, \"child_changed\" /* ChangeType.CHILD_CHANGED */, changes, eventRegistrations, eventCache);\n  eventGeneratorGenerateEventsForType(eventGenerator, events, \"value\" /* ChangeType.VALUE */, changes, eventRegistrations, eventCache);\n  return events;\n}\n/**\n * Given changes of a single change type, generate the corresponding events.\n */\nfunction eventGeneratorGenerateEventsForType(eventGenerator, events, eventType, changes, registrations, eventCache) {\n  const filteredChanges = changes.filter(change => change.type === eventType);\n  filteredChanges.sort((a, b) => eventGeneratorCompareChanges(eventGenerator, a, b));\n  filteredChanges.forEach(change => {\n    const materializedChange = eventGeneratorMaterializeSingleChange(eventGenerator, change, eventCache);\n    registrations.forEach(registration => {\n      if (registration.respondsTo(change.type)) {\n        events.push(registration.createEvent(materializedChange, eventGenerator.query_));\n      }\n    });\n  });\n}\nfunction eventGeneratorMaterializeSingleChange(eventGenerator, change, eventCache) {\n  if (change.type === 'value' || change.type === 'child_removed') {\n    return change;\n  } else {\n    change.prevName = eventCache.getPredecessorChildName(change.childName, change.snapshotNode, eventGenerator.index_);\n    return change;\n  }\n}\nfunction eventGeneratorCompareChanges(eventGenerator, a, b) {\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction newViewCache(eventCache, serverCache) {\n  return {\n    eventCache,\n    serverCache\n  };\n}\nfunction viewCacheUpdateEventSnap(viewCache, eventSnap, complete, filtered) {\n  return newViewCache(new CacheNode(eventSnap, complete, filtered), viewCache.serverCache);\n}\nfunction viewCacheUpdateServerSnap(viewCache, serverSnap, complete, filtered) {\n  return newViewCache(viewCache.eventCache, new CacheNode(serverSnap, complete, filtered));\n}\nfunction viewCacheGetCompleteEventSnap(viewCache) {\n  return viewCache.eventCache.isFullyInitialized() ? viewCache.eventCache.getNode() : null;\n}\nfunction viewCacheGetCompleteServerSnap(viewCache) {\n  return viewCache.serverCache.isFullyInitialized() ? viewCache.serverCache.getNode() : null;\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nlet emptyChildrenSingleton;\n/**\n * Singleton empty children collection.\n *\n */\nconst EmptyChildren = () => {\n  if (!emptyChildrenSingleton) {\n    emptyChildrenSingleton = new SortedMap(stringCompare);\n  }\n  return emptyChildrenSingleton;\n};\n/**\n * A tree with immutable elements.\n */\nclass ImmutableTree {\n  static fromObject(obj) {\n    let tree = new ImmutableTree(null);\n    each(obj, (childPath, childSnap) => {\n      tree = tree.set(new Path(childPath), childSnap);\n    });\n    return tree;\n  }\n  constructor(value, children = EmptyChildren()) {\n    this.value = value;\n    this.children = children;\n  }\n  /**\n   * True if the value is empty and there are no children\n   */\n  isEmpty() {\n    return this.value === null && this.children.isEmpty();\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(relativePath, predicate) {\n    if (this.value != null && predicate(this.value)) {\n      return {\n        path: newEmptyPath(),\n        value: this.value\n      };\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 = child.findRootMostMatchingPathAndValue(pathPopFront(relativePath), predicate);\n          if (childExistingPathAndValue != null) {\n            const fullPath = pathChild(new Path(front), childExistingPathAndValue.path);\n            return {\n              path: fullPath,\n              value: childExistingPathAndValue.value\n            };\n          } else {\n            return null;\n          }\n        } else {\n          return null;\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(relativePath) {\n    return this.findRootMostMatchingPathAndValue(relativePath, () => true);\n  }\n  /**\n   * @returns The subtree at the given path\n   */\n  subtree(relativePath) {\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(null);\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, toSet) {\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(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   * Removes the value at the specified path.\n   *\n   * @param relativePath - Path to value to remove.\n   * @returns Resulting tree.\n   */\n  remove(relativePath) {\n    if (pathIsEmpty(relativePath)) {\n      if (this.children.isEmpty()) {\n        return new ImmutableTree(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(null);\n        } else {\n          return new ImmutableTree(this.value, newChildren);\n        }\n      } else {\n        return this;\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) {\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   * 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, newTree) {\n    if (pathIsEmpty(relativePath)) {\n      return newTree;\n    } else {\n      const front = pathGetFront(relativePath);\n      const child = this.children.get(front) || new ImmutableTree(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   * 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(fn) {\n    return this.fold_(newEmptyPath(), fn);\n  }\n  /**\n   * Recursive helper for public-facing fold() method\n   */\n  fold_(pathSoFar, fn) {\n    const accum = {};\n    this.children.inorderTraversal((childKey, childTree) => {\n      accum[childKey] = childTree.fold_(pathChild(pathSoFar, childKey), fn);\n    });\n    return fn(pathSoFar, this.value, accum);\n  }\n  /**\n   * Find the first matching value on the given path. Return the result of applying f to it.\n   */\n  findOnPath(path, f) {\n    return this.findOnPath_(path, newEmptyPath(), f);\n  }\n  findOnPath_(pathToFollow, pathSoFar, f) {\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_(pathPopFront(pathToFollow), pathChild(pathSoFar, front), f);\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n  foreachOnPath(path, f) {\n    return this.foreachOnPath_(path, newEmptyPath(), f);\n  }\n  foreachOnPath_(pathToFollow, currentRelativePath, f) {\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_(pathPopFront(pathToFollow), pathChild(currentRelativePath, front), f);\n      } else {\n        return new ImmutableTree(null);\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) {\n    this.foreach_(newEmptyPath(), f);\n  }\n  foreach_(currentRelativePath, f) {\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  foreachChild(f) {\n    this.children.inorderTraversal((childName, childTree) => {\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/**\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 */\nclass CompoundWrite {\n  constructor(writeTree_) {\n    this.writeTree_ = writeTree_;\n  }\n  static empty() {\n    return new CompoundWrite(new ImmutableTree(null));\n  }\n}\nfunction compoundWriteAddWrite(compoundWrite, path, node) {\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(compoundWrite.writeTree_.set(rootMostPath, value));\n    } else {\n      const subtree = new ImmutableTree(node);\n      const newWriteTree = compoundWrite.writeTree_.setTree(path, subtree);\n      return new CompoundWrite(newWriteTree);\n    }\n  }\n}\nfunction compoundWriteAddWrites(compoundWrite, path, updates) {\n  let newWrite = compoundWrite;\n  each(updates, (childKey, node) => {\n    newWrite = compoundWriteAddWrite(newWrite, pathChild(path, childKey), node);\n  });\n  return newWrite;\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 */\nfunction compoundWriteRemoveWrite(compoundWrite, path) {\n  if (pathIsEmpty(path)) {\n    return CompoundWrite.empty();\n  } else {\n    const newWriteTree = compoundWrite.writeTree_.setTree(path, new ImmutableTree(null));\n    return new CompoundWrite(newWriteTree);\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 */\nfunction compoundWriteHasCompleteWrite(compoundWrite, path) {\n  return compoundWriteGetCompleteNode(compoundWrite, path) != null;\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 */\nfunction compoundWriteGetCompleteNode(compoundWrite, path) {\n  const rootmost = compoundWrite.writeTree_.findRootMostValueAndPath(path);\n  if (rootmost != null) {\n    return compoundWrite.writeTree_.get(rootmost.path).getChild(newRelativePath(rootmost.path, path));\n  } else {\n    return null;\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 */\nfunction compoundWriteGetCompleteChildren(compoundWrite) {\n  const children = [];\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.forEachChild(PRIORITY_INDEX, (childName, childNode) => {\n        children.push(new NamedNode(childName, childNode));\n      });\n    }\n  } else {\n    compoundWrite.writeTree_.children.inorderTraversal((childName, childTree) => {\n      if (childTree.value != null) {\n        children.push(new NamedNode(childName, childTree.value));\n      }\n    });\n  }\n  return children;\n}\nfunction compoundWriteChildCompoundWrite(compoundWrite, path) {\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 * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\n * @returns Whether this CompoundWrite is empty\n */\nfunction compoundWriteIsEmpty(compoundWrite) {\n  return compoundWrite.writeTree_.isEmpty();\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 */\nfunction compoundWriteApply(compoundWrite, node) {\n  return applySubtreeWrite(newEmptyPath(), compoundWrite.writeTree_, node);\n}\nfunction applySubtreeWrite(relativePath, writeTree, 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(childTree.value !== null, 'Priority writes must always be leaf nodes');\n        priorityWrite = childTree.value;\n      } else {\n        node = applySubtreeWrite(pathChild(relativePath, childKey), childTree, node);\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(pathChild(relativePath, '.priority'), priorityWrite);\n    }\n    return node;\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 * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n *\n */\nfunction writeTreeChildWrites(writeTree, path) {\n  return newWriteTreeRef(path, writeTree);\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 */\nfunction writeTreeAddOverwrite(writeTree, path, snap, writeId, visible) {\n  assert(writeId > writeTree.lastWriteId, 'Stacking an older write on top of newer ones');\n  if (visible === undefined) {\n    visible = true;\n  }\n  writeTree.allWrites.push({\n    path,\n    snap,\n    writeId,\n    visible\n  });\n  if (visible) {\n    writeTree.visibleWrites = compoundWriteAddWrite(writeTree.visibleWrites, path, snap);\n  }\n  writeTree.lastWriteId = writeId;\n}\n/**\n * Record a new merge from user code.\n */\nfunction writeTreeAddMerge(writeTree, path, changedChildren, writeId) {\n  assert(writeId > writeTree.lastWriteId, 'Stacking an older merge on top of newer ones');\n  writeTree.allWrites.push({\n    path,\n    children: changedChildren,\n    writeId,\n    visible: true\n  });\n  writeTree.visibleWrites = compoundWriteAddWrites(writeTree.visibleWrites, path, changedChildren);\n  writeTree.lastWriteId = writeId;\n}\nfunction writeTreeGetWrite(writeTree, writeId) {\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 * 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 */\nfunction writeTreeRemoveWrite(writeTree, writeId) {\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  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  let removedWriteWasVisible = writeToRemove.visible;\n  let removedWriteOverlapsWithOtherWrites = false;\n  let i = writeTree.allWrites.length - 1;\n  while (removedWriteWasVisible && i >= 0) {\n    const currentWrite = writeTree.allWrites[i];\n    if (currentWrite.visible) {\n      if (i >= idx && writeTreeRecordContainsPath_(currentWrite, writeToRemove.path)) {\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  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(writeTree.visibleWrites, writeToRemove.path);\n    } else {\n      const children = writeToRemove.children;\n      each(children, childName => {\n        writeTree.visibleWrites = compoundWriteRemoveWrite(writeTree.visibleWrites, pathChild(writeToRemove.path, childName));\n      });\n    }\n    return true;\n  }\n}\nfunction writeTreeRecordContainsPath_(writeRecord, path) {\n  if (writeRecord.snap) {\n    return pathContains(writeRecord.path, path);\n  } else {\n    for (const childName in writeRecord.children) {\n      if (writeRecord.children.hasOwnProperty(childName) && pathContains(pathChild(writeRecord.path, childName), path)) {\n        return true;\n      }\n    }\n    return false;\n  }\n}\n/**\n * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n */\nfunction writeTreeResetTree_(writeTree) {\n  writeTree.visibleWrites = writeTreeLayerTree_(writeTree.allWrites, writeTreeDefaultFilter_, newEmptyPath());\n  if (writeTree.allWrites.length > 0) {\n    writeTree.lastWriteId = writeTree.allWrites[writeTree.allWrites.length - 1].writeId;\n  } else {\n    writeTree.lastWriteId = -1;\n  }\n}\n/**\n * The default filter used when constructing the tree. Keep everything that's visible.\n */\nfunction writeTreeDefaultFilter_(write) {\n  return write.visible;\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_(writes, filter, treeRoot) {\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;\n      if (write.snap) {\n        if (pathContains(treeRoot, writePath)) {\n          relativePath = newRelativePath(treeRoot, writePath);\n          compoundWrite = compoundWriteAddWrite(compoundWrite, relativePath, write.snap);\n        } else if (pathContains(writePath, treeRoot)) {\n          relativePath = newRelativePath(writePath, treeRoot);\n          compoundWrite = compoundWriteAddWrite(compoundWrite, newEmptyPath(), write.snap.getChild(relativePath));\n        } else ;\n      } else if (write.children) {\n        if (pathContains(treeRoot, writePath)) {\n          relativePath = newRelativePath(treeRoot, writePath);\n          compoundWrite = compoundWriteAddWrites(compoundWrite, relativePath, write.children);\n        } else if (pathContains(writePath, treeRoot)) {\n          relativePath = newRelativePath(writePath, treeRoot);\n          if (pathIsEmpty(relativePath)) {\n            compoundWrite = compoundWriteAddWrites(compoundWrite, newEmptyPath(), write.children);\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(compoundWrite, newEmptyPath(), deepNode);\n            }\n          }\n        } else ;\n      } else {\n        throw assertionError('WriteRecord should have .snap or .children');\n      }\n    }\n  }\n  return compoundWrite;\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 */\nfunction writeTreeCalcCompleteEventCache(writeTree, treePath, completeServerCache, writeIdsToExclude, includeHiddenWrites) {\n  if (!writeIdsToExclude && !includeHiddenWrites) {\n    const shadowingNode = compoundWriteGetCompleteNode(writeTree.visibleWrites, treePath);\n    if (shadowingNode != null) {\n      return shadowingNode;\n    } else {\n      const subMerge = compoundWriteChildCompoundWrite(writeTree.visibleWrites, treePath);\n      if (compoundWriteIsEmpty(subMerge)) {\n        return completeServerCache;\n      } else if (completeServerCache == null && !compoundWriteHasCompleteWrite(subMerge, newEmptyPath())) {\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(writeTree.visibleWrites, treePath);\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 (!includeHiddenWrites && completeServerCache == null && !compoundWriteHasCompleteWrite(merge, newEmptyPath())) {\n        return null;\n      } else {\n        const filter = function (write) {\n          return (write.visible || includeHiddenWrites) && (!writeIdsToExclude || !~writeIdsToExclude.indexOf(write.writeId)) && (pathContains(write.path, treePath) || pathContains(treePath, write.path));\n        };\n        const mergeAtPath = writeTreeLayerTree_(writeTree.allWrites, filter, treePath);\n        const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n        return compoundWriteApply(mergeAtPath, layeredCache);\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 */\nfunction writeTreeCalcCompleteEventChildren(writeTree, treePath, completeServerChildren) {\n  let completeChildren = ChildrenNode.EMPTY_NODE;\n  const topLevelSet = compoundWriteGetCompleteNode(writeTree.visibleWrites, treePath);\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(childName, childSnap);\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(writeTree.visibleWrites, treePath);\n    completeServerChildren.forEachChild(PRIORITY_INDEX, (childName, childNode) => {\n      const node = compoundWriteApply(compoundWriteChildCompoundWrite(merge, new Path(childName)), childNode);\n      completeChildren = completeChildren.updateImmediateChild(childName, node);\n    });\n    // Add any complete children we have from the set\n    compoundWriteGetCompleteChildren(merge).forEach(namedNode => {\n      completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\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(writeTree.visibleWrites, treePath);\n    compoundWriteGetCompleteChildren(merge).forEach(namedNode => {\n      completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\n    });\n    return completeChildren;\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 */\nfunction writeTreeCalcEventCacheAfterServerOverwrite(writeTree, treePath, childPath, existingEventSnap, existingServerSnap) {\n  assert(existingEventSnap || existingServerSnap, 'Either existingEventSnap or existingServerSnap must exist');\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(writeTree.visibleWrites, path);\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(childMerge, existingServerSnap.getChild(childPath));\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 */\nfunction writeTreeCalcCompleteChild(writeTree, treePath, childKey, existingServerSnap) {\n  const path = pathChild(treePath, childKey);\n  const shadowingNode = compoundWriteGetCompleteNode(writeTree.visibleWrites, path);\n  if (shadowingNode != null) {\n    return shadowingNode;\n  } else {\n    if (existingServerSnap.isCompleteForChild(childKey)) {\n      const childMerge = compoundWriteChildCompoundWrite(writeTree.visibleWrites, path);\n      return compoundWriteApply(childMerge, existingServerSnap.getNode().getImmediateChild(childKey));\n    } else {\n      return null;\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 */\nfunction writeTreeShadowingWrite(writeTree, path) {\n  return compoundWriteGetCompleteNode(writeTree.visibleWrites, path);\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 */\nfunction writeTreeCalcIndexedSlice(writeTree, treePath, completeServerData, startPost, count, reverse, index) {\n  let toIterate;\n  const merge = compoundWriteChildCompoundWrite(writeTree.visibleWrites, treePath);\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 ? toIterate.getReverseIteratorFrom(startPost, index) : toIterate.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}\nfunction newWriteTree() {\n  return {\n    visibleWrites: CompoundWrite.empty(),\n    allWrites: [],\n    lastWriteId: -1\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 */\nfunction writeTreeRefCalcCompleteEventCache(writeTreeRef, completeServerCache, writeIdsToExclude, includeHiddenWrites) {\n  return writeTreeCalcCompleteEventCache(writeTreeRef.writeTree, writeTreeRef.treePath, completeServerCache, writeIdsToExclude, includeHiddenWrites);\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 */\nfunction writeTreeRefCalcCompleteEventChildren(writeTreeRef, completeServerChildren) {\n  return writeTreeCalcCompleteEventChildren(writeTreeRef.writeTree, writeTreeRef.treePath, completeServerChildren);\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 */\nfunction writeTreeRefCalcEventCacheAfterServerOverwrite(writeTreeRef, path, existingEventSnap, existingServerSnap) {\n  return writeTreeCalcEventCacheAfterServerOverwrite(writeTreeRef.writeTree, writeTreeRef.treePath, path, existingEventSnap, existingServerSnap);\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 */\nfunction writeTreeRefShadowingWrite(writeTreeRef, path) {\n  return writeTreeShadowingWrite(writeTreeRef.writeTree, pathChild(writeTreeRef.treePath, path));\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 */\nfunction writeTreeRefCalcIndexedSlice(writeTreeRef, completeServerData, startPost, count, reverse, index) {\n  return writeTreeCalcIndexedSlice(writeTreeRef.writeTree, writeTreeRef.treePath, completeServerData, startPost, count, reverse, index);\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 */\nfunction writeTreeRefCalcCompleteChild(writeTreeRef, childKey, existingServerCache) {\n  return writeTreeCalcCompleteChild(writeTreeRef.writeTree, writeTreeRef.treePath, childKey, existingServerCache);\n}\n/**\n * Return a WriteTreeRef for a child.\n */\nfunction writeTreeRefChild(writeTreeRef, childName) {\n  return newWriteTreeRef(pathChild(writeTreeRef.treePath, childName), writeTreeRef.writeTree);\n}\nfunction newWriteTreeRef(path, writeTree) {\n  return {\n    treePath: path,\n    writeTree\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 */\nclass ChildChangeAccumulator {\n  constructor() {\n    this.changeMap = new Map();\n  }\n  trackChildChange(change) {\n    const type = change.type;\n    const childKey = change.childName;\n    assert(type === \"child_added\" /* ChangeType.CHILD_ADDED */ || type === \"child_changed\" /* ChangeType.CHILD_CHANGED */ || type === \"child_removed\" /* ChangeType.CHILD_REMOVED */, 'Only child changes supported for tracking');\n    assert(childKey !== '.priority', 'Only non-priority child changes can be tracked.');\n    const oldChange = this.changeMap.get(childKey);\n    if (oldChange) {\n      const oldType = oldChange.type;\n      if (type === \"child_added\" /* ChangeType.CHILD_ADDED */ && oldType === \"child_removed\" /* ChangeType.CHILD_REMOVED */) {\n        this.changeMap.set(childKey, changeChildChanged(childKey, change.snapshotNode, oldChange.snapshotNode));\n      } else if (type === \"child_removed\" /* ChangeType.CHILD_REMOVED */ && oldType === \"child_added\" /* ChangeType.CHILD_ADDED */) {\n        this.changeMap.delete(childKey);\n      } else if (type === \"child_removed\" /* ChangeType.CHILD_REMOVED */ && oldType === \"child_changed\" /* ChangeType.CHILD_CHANGED */) {\n        this.changeMap.set(childKey, changeChildRemoved(childKey, oldChange.oldSnap));\n      } else if (type === \"child_changed\" /* ChangeType.CHILD_CHANGED */ && oldType === \"child_added\" /* ChangeType.CHILD_ADDED */) {\n        this.changeMap.set(childKey, changeChildAdded(childKey, change.snapshotNode));\n      } else if (type === \"child_changed\" /* ChangeType.CHILD_CHANGED */ && oldType === \"child_changed\" /* ChangeType.CHILD_CHANGED */) {\n        this.changeMap.set(childKey, changeChildChanged(childKey, change.snapshotNode, oldChange.oldSnap));\n      } else {\n        throw assertionError('Illegal combination of changes: ' + change + ' occurred after ' + oldChange);\n      }\n    } else {\n      this.changeMap.set(childKey, change);\n    }\n  }\n  getChanges() {\n    return Array.from(this.changeMap.values());\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * An implementation of CompleteChildSource that never returns any additional children\n */\n// eslint-disable-next-line @typescript-eslint/naming-convention\nclass NoCompleteChildSource_ {\n  getCompleteChild(childKey) {\n    return null;\n  }\n  getChildAfterChild(index, child, reverse) {\n    return null;\n  }\n}\n/**\n * Singleton instance.\n */\nconst NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\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 */\nclass WriteTreeCompleteChildSource {\n  constructor(writes_, viewCache_, optCompleteServerCache_ = null) {\n    this.writes_ = writes_;\n    this.viewCache_ = viewCache_;\n    this.optCompleteServerCache_ = optCompleteServerCache_;\n  }\n  getCompleteChild(childKey) {\n    const node = this.viewCache_.eventCache;\n    if (node.isCompleteForChild(childKey)) {\n      return node.getNode().getImmediateChild(childKey);\n    } else {\n      const serverNode = this.optCompleteServerCache_ != null ? new CacheNode(this.optCompleteServerCache_, true, false) : this.viewCache_.serverCache;\n      return writeTreeRefCalcCompleteChild(this.writes_, childKey, serverNode);\n    }\n  }\n  getChildAfterChild(index, child, reverse) {\n    const completeServerData = this.optCompleteServerCache_ != null ? this.optCompleteServerCache_ : viewCacheGetCompleteServerSnap(this.viewCache_);\n    const nodes = writeTreeRefCalcIndexedSlice(this.writes_, completeServerData, child, 1, reverse, index);\n    if (nodes.length === 0) {\n      return null;\n    } else {\n      return nodes[0];\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 */\nfunction newViewProcessor(filter) {\n  return {\n    filter\n  };\n}\nfunction viewProcessorAssertIndexed(viewProcessor, viewCache) {\n  assert(viewCache.eventCache.getNode().isIndexed(viewProcessor.filter.getIndex()), 'Event snap not indexed');\n  assert(viewCache.serverCache.getNode().isIndexed(viewProcessor.filter.getIndex()), 'Server snap not indexed');\n}\nfunction viewProcessorApplyOperation(viewProcessor, oldViewCache, operation, writesCache, completeCache) {\n  const accumulator = new ChildChangeAccumulator();\n  let newViewCache, filterServerNode;\n  if (operation.type === OperationType.OVERWRITE) {\n    const overwrite = operation;\n    if (overwrite.source.fromUser) {\n      newViewCache = viewProcessorApplyUserOverwrite(viewProcessor, oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, accumulator);\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 = overwrite.source.tagged || oldViewCache.serverCache.isFiltered() && !pathIsEmpty(overwrite.path);\n      newViewCache = viewProcessorApplyServerOverwrite(viewProcessor, oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, filterServerNode, accumulator);\n    }\n  } else if (operation.type === OperationType.MERGE) {\n    const merge = operation;\n    if (merge.source.fromUser) {\n      newViewCache = viewProcessorApplyUserMerge(viewProcessor, oldViewCache, merge.path, merge.children, writesCache, completeCache, accumulator);\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 = merge.source.tagged || oldViewCache.serverCache.isFiltered();\n      newViewCache = viewProcessorApplyServerMerge(viewProcessor, oldViewCache, merge.path, merge.children, writesCache, completeCache, filterServerNode, accumulator);\n    }\n  } else if (operation.type === OperationType.ACK_USER_WRITE) {\n    const ackUserWrite = operation;\n    if (!ackUserWrite.revert) {\n      newViewCache = viewProcessorAckUserWrite(viewProcessor, oldViewCache, ackUserWrite.path, ackUserWrite.affectedTree, writesCache, completeCache, accumulator);\n    } else {\n      newViewCache = viewProcessorRevertUserWrite(viewProcessor, oldViewCache, ackUserWrite.path, writesCache, completeCache, accumulator);\n    }\n  } else if (operation.type === OperationType.LISTEN_COMPLETE) {\n    newViewCache = viewProcessorListenComplete(viewProcessor, oldViewCache, operation.path, writesCache, accumulator);\n  } else {\n    throw assertionError('Unknown operation type: ' + operation.type);\n  }\n  const changes = accumulator.getChanges();\n  viewProcessorMaybeAddValueEvent(oldViewCache, newViewCache, changes);\n  return {\n    viewCache: newViewCache,\n    changes\n  };\n}\nfunction viewProcessorMaybeAddValueEvent(oldViewCache, newViewCache, accumulator) {\n  const eventSnap = newViewCache.eventCache;\n  if (eventSnap.isFullyInitialized()) {\n    const isLeafOrEmpty = eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n    const oldCompleteSnap = viewCacheGetCompleteEventSnap(oldViewCache);\n    if (accumulator.length > 0 || !oldViewCache.eventCache.isFullyInitialized() || isLeafOrEmpty && !eventSnap.getNode().equals(oldCompleteSnap) || !eventSnap.getNode().getPriority().equals(oldCompleteSnap.getPriority())) {\n      accumulator.push(changeValue(viewCacheGetCompleteEventSnap(newViewCache)));\n    }\n  }\n}\nfunction viewProcessorGenerateEventCacheAfterServerEvent(viewProcessor, viewCache, changePath, writesCache, source, accumulator) {\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(viewCache.serverCache.isFullyInitialized(), 'If change path is empty, we must have complete server data');\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 = serverCache instanceof ChildrenNode ? serverCache : ChildrenNode.EMPTY_NODE;\n        const completeEventChildren = writeTreeRefCalcCompleteEventChildren(writesCache, completeChildren);\n        newEventCache = viewProcessor.filter.updateFullNode(viewCache.eventCache.getNode(), completeEventChildren, accumulator);\n      } else {\n        const completeNode = writeTreeRefCalcCompleteEventCache(writesCache, viewCacheGetCompleteServerSnap(viewCache));\n        newEventCache = viewProcessor.filter.updateFullNode(viewCache.eventCache.getNode(), completeNode, accumulator);\n      }\n    } else {\n      const childKey = pathGetFront(changePath);\n      if (childKey === '.priority') {\n        assert(pathGetLength(changePath) === 1, \"Can't have a priority with additional path components\");\n        const oldEventNode = oldEventSnap.getNode();\n        serverNode = viewCache.serverCache.getNode();\n        // we might have overwrites for this priority\n        const updatedPriority = writeTreeRefCalcEventCacheAfterServerOverwrite(writesCache, changePath, oldEventNode, serverNode);\n        if (updatedPriority != null) {\n          newEventCache = viewProcessor.filter.updatePriority(oldEventNode, updatedPriority);\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 = writeTreeRefCalcEventCacheAfterServerOverwrite(writesCache, changePath, oldEventSnap.getNode(), serverNode);\n          if (eventChildUpdate != null) {\n            newEventChild = oldEventSnap.getNode().getImmediateChild(childKey).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(writesCache, childKey, viewCache.serverCache);\n        }\n        if (newEventChild != null) {\n          newEventCache = viewProcessor.filter.updateChild(oldEventSnap.getNode(), childKey, newEventChild, childChangePath, source, accumulator);\n        } else {\n          // no complete child available or no change\n          newEventCache = oldEventSnap.getNode();\n        }\n      }\n    }\n    return viewCacheUpdateEventSnap(viewCache, newEventCache, oldEventSnap.isFullyInitialized() || pathIsEmpty(changePath), viewProcessor.filter.filtersNodes());\n  }\n}\nfunction viewProcessorApplyServerOverwrite(viewProcessor, oldViewCache, changePath, changedSnap, writesCache, completeCache, filterServerNode, accumulator) {\n  const oldServerSnap = oldViewCache.serverCache;\n  let newServerCache;\n  const serverFilter = filterServerNode ? viewProcessor.filter : viewProcessor.filter.getIndexedFilter();\n  if (pathIsEmpty(changePath)) {\n    newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), changedSnap, null);\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.getNode().updateChild(changePath, changedSnap);\n    newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), newServerNode, null);\n  } else {\n    const childKey = pathGetFront(changePath);\n    if (!oldServerSnap.isCompleteForPath(changePath) && pathGetLength(changePath) > 1) {\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(oldServerSnap.getNode(), newChildNode);\n    } else {\n      newServerCache = serverFilter.updateChild(oldServerSnap.getNode(), childKey, newChildNode, childChangePath, NO_COMPLETE_CHILD_SOURCE, null);\n    }\n  }\n  const newViewCache = viewCacheUpdateServerSnap(oldViewCache, newServerCache, oldServerSnap.isFullyInitialized() || pathIsEmpty(changePath), serverFilter.filtersNodes());\n  const source = new WriteTreeCompleteChildSource(writesCache, newViewCache, completeCache);\n  return viewProcessorGenerateEventCacheAfterServerEvent(viewProcessor, newViewCache, changePath, writesCache, source, accumulator);\n}\nfunction viewProcessorApplyUserOverwrite(viewProcessor, oldViewCache, changePath, changedSnap, writesCache, completeCache, accumulator) {\n  const oldEventSnap = oldViewCache.eventCache;\n  let newViewCache, newEventCache;\n  const source = new WriteTreeCompleteChildSource(writesCache, oldViewCache, completeCache);\n  if (pathIsEmpty(changePath)) {\n    newEventCache = viewProcessor.filter.updateFullNode(oldViewCache.eventCache.getNode(), changedSnap, accumulator);\n    newViewCache = viewCacheUpdateEventSnap(oldViewCache, newEventCache, true, viewProcessor.filter.filtersNodes());\n  } else {\n    const childKey = pathGetFront(changePath);\n    if (childKey === '.priority') {\n      newEventCache = viewProcessor.filter.updatePriority(oldViewCache.eventCache.getNode(), changedSnap);\n      newViewCache = viewCacheUpdateEventSnap(oldViewCache, newEventCache, oldEventSnap.isFullyInitialized(), oldEventSnap.isFiltered());\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 (pathGetBack(childChangePath) === '.priority' && childNode.getChild(pathParent(childChangePath)).isEmpty()) {\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(oldEventSnap.getNode(), childKey, newChild, childChangePath, source, accumulator);\n        newViewCache = viewCacheUpdateEventSnap(oldViewCache, newEventSnap, oldEventSnap.isFullyInitialized(), viewProcessor.filter.filtersNodes());\n      } else {\n        newViewCache = oldViewCache;\n      }\n    }\n  }\n  return newViewCache;\n}\nfunction viewProcessorCacheHasChild(viewCache, childKey) {\n  return viewCache.eventCache.isCompleteForChild(childKey);\n}\nfunction viewProcessorApplyUserMerge(viewProcessor, viewCache, path, changedChildren, writesCache, serverCache, accumulator) {\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(viewProcessor, curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\n    }\n  });\n  changedChildren.foreach((relativePath, childNode) => {\n    const writePath = pathChild(path, relativePath);\n    if (!viewProcessorCacheHasChild(viewCache, pathGetFront(writePath))) {\n      curViewCache = viewProcessorApplyUserOverwrite(viewProcessor, curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\n    }\n  });\n  return curViewCache;\n}\nfunction viewProcessorApplyMerge(viewProcessor, node, merge) {\n  merge.foreach((relativePath, childNode) => {\n    node = node.updateChild(relativePath, childNode);\n  });\n  return node;\n}\nfunction viewProcessorApplyServerMerge(viewProcessor, viewCache, path, changedChildren, writesCache, serverCache, filterServerNode, accumulator) {\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 (viewCache.serverCache.getNode().isEmpty() && !viewCache.serverCache.isFullyInitialized()) {\n    return viewCache;\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;\n  if (pathIsEmpty(path)) {\n    viewMergeTree = changedChildren;\n  } else {\n    viewMergeTree = new ImmutableTree(null).setTree(path, changedChildren);\n  }\n  const serverNode = viewCache.serverCache.getNode();\n  viewMergeTree.children.inorderTraversal((childKey, childTree) => {\n    if (serverNode.hasChild(childKey)) {\n      const serverChild = viewCache.serverCache.getNode().getImmediateChild(childKey);\n      const newChild = viewProcessorApplyMerge(viewProcessor, serverChild, childTree);\n      curViewCache = viewProcessorApplyServerOverwrite(viewProcessor, curViewCache, new Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\n    }\n  });\n  viewMergeTree.children.inorderTraversal((childKey, childMergeTree) => {\n    const isUnknownDeepMerge = !viewCache.serverCache.isCompleteForChild(childKey) && childMergeTree.value === null;\n    if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n      const serverChild = viewCache.serverCache.getNode().getImmediateChild(childKey);\n      const newChild = viewProcessorApplyMerge(viewProcessor, serverChild, childMergeTree);\n      curViewCache = viewProcessorApplyServerOverwrite(viewProcessor, curViewCache, new Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\n    }\n  });\n  return curViewCache;\n}\nfunction viewProcessorAckUserWrite(viewProcessor, viewCache, ackPath, affectedTree, writesCache, completeCache, accumulator) {\n  if (writeTreeRefShadowingWrite(writesCache, ackPath) != null) {\n    return viewCache;\n  }\n  // Only filter server node if it is currently filtered\n  const filterServerNode = viewCache.serverCache.isFiltered();\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 (pathIsEmpty(ackPath) && serverCache.isFullyInitialized() || serverCache.isCompleteForPath(ackPath)) {\n      return viewProcessorApplyServerOverwrite(viewProcessor, viewCache, ackPath, serverCache.getNode().getChild(ackPath), writesCache, completeCache, filterServerNode, accumulator);\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(null);\n      serverCache.getNode().forEachChild(KEY_INDEX, (name, node) => {\n        changedChildren = changedChildren.set(new Path(name), node);\n      });\n      return viewProcessorApplyServerMerge(viewProcessor, viewCache, ackPath, changedChildren, writesCache, completeCache, filterServerNode, accumulator);\n    } else {\n      return viewCache;\n    }\n  } else {\n    // This is a merge.\n    let changedChildren = new ImmutableTree(null);\n    affectedTree.foreach((mergePath, value) => {\n      const serverCachePath = pathChild(ackPath, mergePath);\n      if (serverCache.isCompleteForPath(serverCachePath)) {\n        changedChildren = changedChildren.set(mergePath, serverCache.getNode().getChild(serverCachePath));\n      }\n    });\n    return viewProcessorApplyServerMerge(viewProcessor, viewCache, ackPath, changedChildren, writesCache, completeCache, filterServerNode, accumulator);\n  }\n}\nfunction viewProcessorListenComplete(viewProcessor, viewCache, path, writesCache, accumulator) {\n  const oldServerNode = viewCache.serverCache;\n  const newViewCache = viewCacheUpdateServerSnap(viewCache, oldServerNode.getNode(), oldServerNode.isFullyInitialized() || pathIsEmpty(path), oldServerNode.isFiltered());\n  return viewProcessorGenerateEventCacheAfterServerEvent(viewProcessor, newViewCache, path, writesCache, NO_COMPLETE_CHILD_SOURCE, accumulator);\n}\nfunction viewProcessorRevertUserWrite(viewProcessor, viewCache, path, writesCache, completeServerCache, accumulator) {\n  let complete;\n  if (writeTreeRefShadowingWrite(writesCache, path) != null) {\n    return viewCache;\n  } else {\n    const source = new WriteTreeCompleteChildSource(writesCache, viewCache, completeServerCache);\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(writesCache, viewCacheGetCompleteServerSnap(viewCache));\n      } else {\n        const serverChildren = viewCache.serverCache.getNode();\n        assert(serverChildren instanceof ChildrenNode, 'serverChildren would be complete if leaf node');\n        newNode = writeTreeRefCalcCompleteEventChildren(writesCache, serverChildren);\n      }\n      newNode = newNode;\n      newEventCache = viewProcessor.filter.updateFullNode(oldEventCache, newNode, accumulator);\n    } else {\n      const childKey = pathGetFront(path);\n      let newChild = writeTreeRefCalcCompleteChild(writesCache, childKey, viewCache.serverCache);\n      if (newChild == null && viewCache.serverCache.isCompleteForChild(childKey)) {\n        newChild = oldEventCache.getImmediateChild(childKey);\n      }\n      if (newChild != null) {\n        newEventCache = viewProcessor.filter.updateChild(oldEventCache, childKey, newChild, pathPopFront(path), source, accumulator);\n      } else if (viewCache.eventCache.getNode().hasChild(childKey)) {\n        // No complete child available, delete the existing one, if any\n        newEventCache = viewProcessor.filter.updateChild(oldEventCache, childKey, ChildrenNode.EMPTY_NODE, pathPopFront(path), source, accumulator);\n      } else {\n        newEventCache = oldEventCache;\n      }\n      if (newEventCache.isEmpty() && viewCache.serverCache.isFullyInitialized()) {\n        // We might have reverted all child writes. Maybe the old event was a leaf node\n        complete = writeTreeRefCalcCompleteEventCache(writesCache, viewCacheGetCompleteServerSnap(viewCache));\n        if (complete.isLeafNode()) {\n          newEventCache = viewProcessor.filter.updateFullNode(newEventCache, complete, accumulator);\n        }\n      }\n    }\n    complete = viewCache.serverCache.isFullyInitialized() || writeTreeRefShadowingWrite(writesCache, newEmptyPath()) != null;\n    return viewCacheUpdateEventSnap(viewCache, newEventCache, complete, 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/**\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 */\nclass View {\n  constructor(query_, initialViewCache) {\n    this.query_ = query_;\n    this.eventRegistrations_ = [];\n    const params = this.query_._queryParams;\n    const indexFilter = new IndexedFilter(params.getIndex());\n    const filter = queryParamsGetNodeFilter(params);\n    this.processor_ = newViewProcessor(filter);\n    const initialServerCache = initialViewCache.serverCache;\n    const initialEventCache = initialViewCache.eventCache;\n    // Don't filter server node with other filter than index, wait for tagged listen\n    const serverSnap = indexFilter.updateFullNode(ChildrenNode.EMPTY_NODE, initialServerCache.getNode(), null);\n    const eventSnap = filter.updateFullNode(ChildrenNode.EMPTY_NODE, initialEventCache.getNode(), null);\n    const newServerCache = new CacheNode(serverSnap, initialServerCache.isFullyInitialized(), indexFilter.filtersNodes());\n    const newEventCache = new CacheNode(eventSnap, initialEventCache.isFullyInitialized(), filter.filtersNodes());\n    this.viewCache_ = newViewCache(newEventCache, newServerCache);\n    this.eventGenerator_ = new EventGenerator(this.query_);\n  }\n  get query() {\n    return this.query_;\n  }\n}\nfunction viewGetServerCache(view) {\n  return view.viewCache_.serverCache.getNode();\n}\nfunction viewGetCompleteNode(view) {\n  return viewCacheGetCompleteEventSnap(view.viewCache_);\n}\nfunction viewGetCompleteServerCache(view, path) {\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 (view.query._queryParams.loadsAllData() || !pathIsEmpty(path) && !cache.getImmediateChild(pathGetFront(path)).isEmpty()) {\n      return cache.getChild(path);\n    }\n  }\n  return null;\n}\nfunction viewIsEmpty(view) {\n  return view.eventRegistrations_.length === 0;\n}\nfunction viewAddEventRegistration(view, eventRegistration) {\n  view.eventRegistrations_.push(eventRegistration);\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 */\nfunction viewRemoveEventRegistration(view, eventRegistration, cancelError) {\n  const cancelEvents = [];\n  if (cancelError) {\n    assert(eventRegistration == null, 'A cancel should cancel all event registrations.');\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  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 * Applies the given Operation, updates our cache, and returns the appropriate events.\n */\nfunction viewApplyOperation(view, operation, writesCache, completeServerCache) {\n  if (operation.type === OperationType.MERGE && operation.source.queryId !== null) {\n    assert(viewCacheGetCompleteServerSnap(view.viewCache_), 'We should always have a full cache before handling merges');\n    assert(viewCacheGetCompleteEventSnap(view.viewCache_), 'Missing event cache, even though we have a server cache');\n  }\n  const oldViewCache = view.viewCache_;\n  const result = viewProcessorApplyOperation(view.processor_, oldViewCache, operation, writesCache, completeServerCache);\n  viewProcessorAssertIndexed(view.processor_, result.viewCache);\n  assert(result.viewCache.serverCache.isFullyInitialized() || !oldViewCache.serverCache.isFullyInitialized(), 'Once a server snap is complete, it should never go back');\n  view.viewCache_ = result.viewCache;\n  return viewGenerateEventsForChanges_(view, result.changes, result.viewCache.eventCache.getNode(), null);\n}\nfunction viewGetInitialEvents(view, registration) {\n  const eventSnap = view.viewCache_.eventCache;\n  const initialChanges = [];\n  if (!eventSnap.getNode().isLeafNode()) {\n    const eventNode = eventSnap.getNode();\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_(view, initialChanges, eventSnap.getNode(), registration);\n}\nfunction viewGenerateEventsForChanges_(view, changes, eventCache, eventRegistration) {\n  const registrations = eventRegistration ? [eventRegistration] : view.eventRegistrations_;\n  return eventGeneratorGenerateEventsForChanges(view.eventGenerator_, changes, eventCache, 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 */\nlet referenceConstructor$1;\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 */\nclass SyncPoint {\n  constructor() {\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    this.views = new Map();\n  }\n}\nfunction syncPointSetReferenceConstructor(val) {\n  assert(!referenceConstructor$1, '__referenceConstructor has already been defined');\n  referenceConstructor$1 = val;\n}\nfunction syncPointGetReferenceConstructor() {\n  assert(referenceConstructor$1, 'Reference.ts has not been loaded');\n  return referenceConstructor$1;\n}\nfunction syncPointIsEmpty(syncPoint) {\n  return syncPoint.views.size === 0;\n}\nfunction syncPointApplyOperation(syncPoint, operation, writesCache, optCompleteServerCache) {\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(view, operation, writesCache, optCompleteServerCache);\n  } else {\n    let events = [];\n    for (const view of syncPoint.views.values()) {\n      events = events.concat(viewApplyOperation(view, operation, writesCache, optCompleteServerCache));\n    }\n    return events;\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 */\nfunction syncPointGetView(syncPoint, query, writesCache, serverCache, serverCacheComplete) {\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(writesCache, serverCacheComplete ? serverCache : null);\n    let eventCacheComplete = false;\n    if (eventCache) {\n      eventCacheComplete = true;\n    } else if (serverCache instanceof ChildrenNode) {\n      eventCache = writeTreeRefCalcCompleteEventChildren(writesCache, serverCache);\n      eventCacheComplete = false;\n    } else {\n      eventCache = ChildrenNode.EMPTY_NODE;\n      eventCacheComplete = false;\n    }\n    const viewCache = newViewCache(new CacheNode(eventCache, eventCacheComplete, false), new CacheNode(serverCache, serverCacheComplete, false));\n    return new View(query, viewCache);\n  }\n  return view;\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 */\nfunction syncPointAddEventRegistration(syncPoint, query, eventRegistration, writesCache, serverCache, serverCacheComplete) {\n  const view = syncPointGetView(syncPoint, query, writesCache, serverCache, serverCacheComplete);\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 * 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 */\nfunction syncPointRemoveEventRegistration(syncPoint, query, eventRegistration, cancelError) {\n  const queryId = query._queryIdentifier;\n  const removed = [];\n  let cancelEvents = [];\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(viewRemoveEventRegistration(view, eventRegistration, cancelError));\n      if (viewIsEmpty(view)) {\n        syncPoint.views.delete(viewQueryId);\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(viewRemoveEventRegistration(view, eventRegistration, cancelError));\n      if (viewIsEmpty(view)) {\n        syncPoint.views.delete(queryId);\n        // We'll deal with complete views later.\n        if (!view.query._queryParams.loadsAllData()) {\n          removed.push(view.query);\n        }\n      }\n    }\n  }\n  if (hadCompleteView && !syncPointHasCompleteView(syncPoint)) {\n    // We removed our last complete view.\n    removed.push(new (syncPointGetReferenceConstructor())(query._repo, query._path));\n  }\n  return {\n    removed,\n    events: cancelEvents\n  };\n}\nfunction syncPointGetQueryViews(syncPoint) {\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 * @param path - The path to the desired complete snapshot\n * @returns A complete cache, if it exists\n */\nfunction syncPointGetCompleteServerCache(syncPoint, path) {\n  let serverCache = null;\n  for (const view of syncPoint.views.values()) {\n    serverCache = serverCache || viewGetCompleteServerCache(view, path);\n  }\n  return serverCache;\n}\nfunction syncPointViewForQuery(syncPoint, query) {\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}\nfunction syncPointViewExistsForQuery(syncPoint, query) {\n  return syncPointViewForQuery(syncPoint, query) != null;\n}\nfunction syncPointHasCompleteView(syncPoint) {\n  return syncPointGetCompleteView(syncPoint) != null;\n}\nfunction syncPointGetCompleteView(syncPoint) {\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nlet referenceConstructor;\nfunction syncTreeSetReferenceConstructor(val) {\n  assert(!referenceConstructor, '__referenceConstructor has already been defined');\n  referenceConstructor = val;\n}\nfunction syncTreeGetReferenceConstructor() {\n  assert(referenceConstructor, 'Reference.ts has not been loaded');\n  return referenceConstructor;\n}\n/**\n * Static tracker for next query tag.\n */\nlet syncTreeNextQueryTag_ = 1;\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 */\nclass SyncTree {\n  /**\n   * @param listenProvider_ - Used by SyncTree to start / stop listening\n   *   to server data.\n   */\n  constructor(listenProvider_) {\n    this.listenProvider_ = listenProvider_;\n    /**\n     * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\n     */\n    this.syncPointTree_ = new ImmutableTree(null);\n    /**\n     * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n     */\n    this.pendingWriteTree_ = newWriteTree();\n    this.tagToQueryMap = new Map();\n    this.queryToTagMap = new Map();\n  }\n}\n/**\n * Apply the data changes for a user-generated set() or transaction() call.\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyUserOverwrite(syncTree, path, newData, writeId, visible) {\n  // Record pending write.\n  writeTreeAddOverwrite(syncTree.pendingWriteTree_, path, newData, writeId, visible);\n  if (!visible) {\n    return [];\n  } else {\n    return syncTreeApplyOperationToSyncPoints_(syncTree, new Overwrite(newOperationSourceUser(), path, newData));\n  }\n}\n/**\n * Apply the data from a user-generated update() call\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyUserMerge(syncTree, path, changedChildren, writeId) {\n  // Record pending merge.\n  writeTreeAddMerge(syncTree.pendingWriteTree_, path, changedChildren, writeId);\n  const changeTree = ImmutableTree.fromObject(changedChildren);\n  return syncTreeApplyOperationToSyncPoints_(syncTree, new Merge(newOperationSourceUser(), path, changeTree));\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 */\nfunction syncTreeAckUserWrite(syncTree, writeId, revert = false) {\n  const write = writeTreeGetWrite(syncTree.pendingWriteTree_, writeId);\n  const needToReevaluate = writeTreeRemoveWrite(syncTree.pendingWriteTree_, writeId);\n  if (!needToReevaluate) {\n    return [];\n  } else {\n    let affectedTree = new ImmutableTree(null);\n    if (write.snap != null) {\n      // overwrite\n      affectedTree = affectedTree.set(newEmptyPath(), true);\n    } else {\n      each(write.children, pathString => {\n        affectedTree = affectedTree.set(new Path(pathString), true);\n      });\n    }\n    return syncTreeApplyOperationToSyncPoints_(syncTree, new AckUserWrite(write.path, affectedTree, revert));\n  }\n}\n/**\n * Apply new server data for the specified path..\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyServerOverwrite(syncTree, path, newData) {\n  return syncTreeApplyOperationToSyncPoints_(syncTree, new Overwrite(newOperationSourceServer(), path, newData));\n}\n/**\n * Apply new server data to be merged in at the specified path.\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyServerMerge(syncTree, path, changedChildren) {\n  const changeTree = ImmutableTree.fromObject(changedChildren);\n  return syncTreeApplyOperationToSyncPoints_(syncTree, new Merge(newOperationSourceServer(), path, changeTree));\n}\n/**\n * Apply a listen complete for a query\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyListenComplete(syncTree, path) {\n  return syncTreeApplyOperationToSyncPoints_(syncTree, new ListenComplete(newOperationSourceServer(), path));\n}\n/**\n * Apply a listen complete for a tagged query\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyTaggedListenComplete(syncTree, path, tag) {\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(newOperationSourceServerTaggedQuery(queryId), relativePath);\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 * 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 */\nfunction syncTreeRemoveEventRegistration(syncTree, query, eventRegistration, cancelError, skipListenerDedup = false) {\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 = [];\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 (maybeSyncPoint && (query._queryIdentifier === 'default' || syncPointViewExistsForQuery(maybeSyncPoint, query))) {\n    const removedAndEvents = syncPointRemoveEventRegistration(maybeSyncPoint, query, eventRegistration, cancelError);\n    if (syncPointIsEmpty(maybeSyncPoint)) {\n      syncTree.syncPointTree_ = syncTree.syncPointTree_.remove(path);\n    }\n    const removed = removedAndEvents.removed;\n    cancelEvents = removedAndEvents.events;\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      // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\n      // queryId === 'default'\n      const removingDefault = -1 !== removed.findIndex(query => {\n        return query._queryParams.loadsAllData();\n      });\n      const covered = syncTree.syncPointTree_.findOnPath(path, (relativePath, parentSyncPoint) => syncPointHasCompleteView(parentSyncPoint));\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          // 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(syncTreeQueryForListening_(newQuery), syncTreeTagForQuery(syncTree, newQuery), listener.hashFn, listener.onComplete);\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 = null;\n          syncTree.listenProvider_.stopListening(syncTreeQueryForListening_(query), defaultTag);\n        } else {\n          removed.forEach(queryToRemove => {\n            const tagToRemove = syncTree.queryToTagMap.get(syncTreeMakeQueryKey_(queryToRemove));\n            syncTree.listenProvider_.stopListening(syncTreeQueryForListening_(queryToRemove), tagToRemove);\n          });\n        }\n      }\n    }\n    // Now, clear all of the tags we're tracking for the removed listens\n    syncTreeRemoveTags_(syncTree, removed);\n  }\n  return cancelEvents;\n}\n/**\n * Apply new server data for the specified tagged query.\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyTaggedQueryOverwrite(syncTree, path, snap, tag) {\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(newOperationSourceServerTaggedQuery(queryId), relativePath, snap);\n    return syncTreeApplyTaggedOperation_(syncTree, queryPath, op);\n  } else {\n    // Query must have been removed already\n    return [];\n  }\n}\n/**\n * Apply server data to be merged in for the specified tagged query.\n *\n * @returns Events to raise.\n */\nfunction syncTreeApplyTaggedQueryMerge(syncTree, path, changedChildren, tag) {\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(newOperationSourceServerTaggedQuery(queryId), relativePath, changeTree);\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 * Add an event callback for the specified query.\n *\n * @returns Events to raise.\n */\nfunction syncTreeAddEventRegistration(syncTree, query, eventRegistration, skipSetupListener = false) {\n  const path = query._path;\n  let serverCache = 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 = serverCache || syncPointGetCompleteServerCache(sp, relativePath);\n    foundAncestorDefaultView = 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 = foundAncestorDefaultView || syncPointHasCompleteView(syncPoint);\n    serverCache = serverCache || syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\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(childSyncPoint, newEmptyPath());\n      if (completeCache) {\n        serverCache = serverCache.updateImmediateChild(childName, completeCache);\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(!syncTree.queryToTagMap.has(queryKey), 'View does not exist, but we have a tag');\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(syncPoint, query, eventRegistration, writesCache, serverCache, serverCacheComplete);\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 * 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 */\nfunction syncTreeCalcCompleteEventCache(syncTree, path, writeIdsToExclude) {\n  const includeHiddenSets = true;\n  const writeTree = syncTree.pendingWriteTree_;\n  const serverCache = syncTree.syncPointTree_.findOnPath(path, (pathSoFar, syncPoint) => {\n    const relativePath = newRelativePath(pathSoFar, path);\n    const serverCache = syncPointGetCompleteServerCache(syncPoint, relativePath);\n    if (serverCache) {\n      return serverCache;\n    }\n  });\n  return writeTreeCalcCompleteEventCache(writeTree, path, serverCache, writeIdsToExclude, includeHiddenSets);\n}\nfunction syncTreeGetServerValue(syncTree, query) {\n  const path = query._path;\n  let serverCache = 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 = 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 = serverCache || syncPointGetCompleteServerCache(syncPoint, newEmptyPath());\n  }\n  const serverCacheComplete = serverCache != null;\n  const serverCacheNode = serverCacheComplete ? new CacheNode(serverCache, true, false) : null;\n  const writesCache = writeTreeChildWrites(syncTree.pendingWriteTree_, query._path);\n  const view = syncPointGetView(syncPoint, query, writesCache, serverCacheComplete ? serverCacheNode.getNode() : ChildrenNode.EMPTY_NODE, serverCacheComplete);\n  return viewGetCompleteNode(view);\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_(syncTree, operation) {\n  return syncTreeApplyOperationHelper_(operation, syncTree.syncPointTree_, /*serverCache=*/null, writeTreeChildWrites(syncTree.pendingWriteTree_, newEmptyPath()));\n}\n/**\n * Recursive helper for applyOperationToSyncPoints_\n */\nfunction syncTreeApplyOperationHelper_(operation, syncPointTree, serverCache, writesCache) {\n  if (pathIsEmpty(operation.path)) {\n    return syncTreeApplyOperationDescendantsHelper_(operation, syncPointTree, serverCache, writesCache);\n  } else {\n    const syncPoint = syncPointTree.get(newEmptyPath());\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    let events = [];\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 ? serverCache.getImmediateChild(childName) : null;\n      const childWritesCache = writeTreeRefChild(writesCache, childName);\n      events = events.concat(syncTreeApplyOperationHelper_(childOperation, childTree, childServerCache, childWritesCache));\n    }\n    if (syncPoint) {\n      events = events.concat(syncPointApplyOperation(syncPoint, operation, writesCache, serverCache));\n    }\n    return events;\n  }\n}\n/**\n * Recursive helper for applyOperationToSyncPoints_\n */\nfunction syncTreeApplyOperationDescendantsHelper_(operation, syncPointTree, serverCache, writesCache) {\n  const syncPoint = syncPointTree.get(newEmptyPath());\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  let events = [];\n  syncPointTree.children.inorderTraversal((childName, childTree) => {\n    const childServerCache = serverCache ? serverCache.getImmediateChild(childName) : null;\n    const childWritesCache = writeTreeRefChild(writesCache, childName);\n    const childOperation = operation.operationForChild(childName);\n    if (childOperation) {\n      events = events.concat(syncTreeApplyOperationDescendantsHelper_(childOperation, childTree, childServerCache, childWritesCache));\n    }\n  });\n  if (syncPoint) {\n    events = events.concat(syncPointApplyOperation(syncPoint, operation, writesCache, serverCache));\n  }\n  return events;\n}\nfunction syncTreeCreateListenerForView_(syncTree, view) {\n  const query = view.query;\n  const tag = syncTreeTagForQuery(syncTree, query);\n  return {\n    hashFn: () => {\n      const cache = viewGetServerCache(view) || ChildrenNode.EMPTY_NODE;\n      return cache.hash();\n    },\n    onComplete: status => {\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(syncTree, query, /*eventRegistration*/null, error);\n      }\n    }\n  };\n}\n/**\n * Return the tag associated with the given query.\n */\nfunction syncTreeTagForQuery(syncTree, query) {\n  const queryKey = syncTreeMakeQueryKey_(query);\n  return syncTree.queryToTagMap.get(queryKey);\n}\n/**\n * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\n */\nfunction syncTreeMakeQueryKey_(query) {\n  return query._path.toString() + '$' + query._queryIdentifier;\n}\n/**\n * Return the query associated with the given tag, if we have one\n */\nfunction syncTreeQueryKeyForTag_(syncTree, tag) {\n  return syncTree.tagToQueryMap.get(tag);\n}\n/**\n * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\n */\nfunction syncTreeParseQueryKey_(queryKey) {\n  const splitIndex = queryKey.indexOf('$');\n  assert(splitIndex !== -1 && splitIndex < queryKey.length - 1, 'Bad queryKey.');\n  return {\n    queryId: queryKey.substr(splitIndex + 1),\n    path: new Path(queryKey.substr(0, splitIndex))\n  };\n}\n/**\n * A helper method to apply tagged operations\n */\nfunction syncTreeApplyTaggedOperation_(syncTree, queryPath, operation) {\n  const syncPoint = syncTree.syncPointTree_.get(queryPath);\n  assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\n  const writesCache = writeTreeChildWrites(syncTree.pendingWriteTree_, queryPath);\n  return syncPointApplyOperation(syncPoint, operation, writesCache, null);\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_(subtree) {\n  return subtree.fold((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 = [];\n      if (maybeChildSyncPoint) {\n        views = syncPointGetQueryViews(maybeChildSyncPoint);\n      }\n      each(childMap, (_key, childViews) => {\n        views = views.concat(childViews);\n      });\n      return views;\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) {\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}\nfunction syncTreeRemoveTags_(syncTree, queries) {\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 * Static accessor for query tags.\n */\nfunction syncTreeGetNextQueryTag_() {\n  return syncTreeNextQueryTag_++;\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_(syncTree, query, view) {\n  const path = query._path;\n  const tag = syncTreeTagForQuery(syncTree, query);\n  const listener = syncTreeCreateListenerForView_(syncTree, view);\n  const events = syncTree.listenProvider_.startListening(syncTreeQueryForListening_(query), tag, listener.hashFn, listener.onComplete);\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(!syncPointHasCompleteView(subtree.value), \"If we're adding a query, it shouldn't be shadowed\");\n  } else {\n    // Shadow everything at or below this location, this is a default listener.\n    const queriesToStop = subtree.fold((relativePath, maybeChildSyncPoint, childMap) => {\n      if (!pathIsEmpty(relativePath) && maybeChildSyncPoint && syncPointHasCompleteView(maybeChildSyncPoint)) {\n        return [syncPointGetCompleteView(maybeChildSyncPoint).query];\n      } else {\n        // No default listener here, flatten any deeper queries into an array\n        let queries = [];\n        if (maybeChildSyncPoint) {\n          queries = queries.concat(syncPointGetQueryViews(maybeChildSyncPoint).map(view => view.query));\n        }\n        each(childMap, (_key, childQueries) => {\n          queries = queries.concat(childQueries);\n        });\n        return queries;\n      }\n    });\n    for (let i = 0; i < queriesToStop.length; ++i) {\n      const queryToStop = queriesToStop[i];\n      syncTree.listenProvider_.stopListening(syncTreeQueryForListening_(queryToStop), syncTreeTagForQuery(syncTree, queryToStop));\n    }\n  }\n  return events;\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 */\nclass ExistingValueProvider {\n  constructor(node_) {\n    this.node_ = node_;\n  }\n  getImmediateChild(childName) {\n    const child = this.node_.getImmediateChild(childName);\n    return new ExistingValueProvider(child);\n  }\n  node() {\n    return this.node_;\n  }\n}\nclass DeferredValueProvider {\n  constructor(syncTree, path) {\n    this.syncTree_ = syncTree;\n    this.path_ = path;\n  }\n  getImmediateChild(childName) {\n    const childPath = pathChild(this.path_, childName);\n    return new DeferredValueProvider(this.syncTree_, childPath);\n  }\n  node() {\n    return syncTreeCalcCompleteEventCache(this.syncTree_, this.path_);\n  }\n}\n/**\n * Generate placeholders for deferred values.\n */\nconst generateWithValues = function (values) {\n  values = values || {};\n  values['timestamp'] = values['timestamp'] || new Date().getTime();\n  return values;\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 */\nconst resolveDeferredLeafValue = function (value, existingVal, serverValues) {\n  if (!value || typeof value !== 'object') {\n    return value;\n  }\n  assert('.sv' in value, 'Unexpected leaf node or priority contents');\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);\n  } else {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(value, null, 2));\n  }\n};\nconst resolveScalarDeferredValue = function (op, existing, serverValues) {\n  switch (op) {\n    case 'timestamp':\n      return serverValues['timestamp'];\n    default:\n      assert(false, 'Unexpected server value: ' + op);\n  }\n};\nconst resolveComplexDeferredValue = function (op, existing, unused) {\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  const existingNode = existing.node();\n  assert(existingNode !== null && typeof existingNode !== 'undefined', 'Expected ChildrenNode.EMPTY_NODE for nulls');\n  // Incrementing a non-number sets the value to the incremented amount\n  if (!existingNode.isLeafNode()) {\n    return delta;\n  }\n  const leaf = existingNode;\n  const existingVal = leaf.getValue();\n  if (typeof existingVal !== 'number') {\n    return delta;\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 * 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 */\nconst resolveDeferredValueTree = function (path, node, syncTree, serverValues) {\n  return resolveDeferredValue(node, new DeferredValueProvider(syncTree, path), serverValues);\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 */\nconst resolveDeferredValueSnapshot = function (node, existing, serverValues) {\n  return resolveDeferredValue(node, new ExistingValueProvider(existing), serverValues);\n};\nfunction resolveDeferredValue(node, existingVal, serverValues) {\n  const rawPri = node.getPriority().val();\n  const priority = resolveDeferredLeafValue(rawPri, existingVal.getImmediateChild('.priority'), serverValues);\n  let newNode;\n  if (node.isLeafNode()) {\n    const leafNode = node;\n    const value = resolveDeferredLeafValue(leafNode.getValue(), existingVal, serverValues);\n    if (value !== leafNode.getValue() || priority !== leafNode.getPriority().val()) {\n      return new LeafNode(value, nodeFromJSON(priority));\n    } else {\n      return node;\n    }\n  } else {\n    const childrenNode = node;\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(childNode, existingVal.getImmediateChild(childName), serverValues);\n      if (newChildNode !== childNode) {\n        newNode = newNode.updateImmediateChild(childName, newChildNode);\n      }\n    });\n    return newNode;\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A 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 */\nclass Tree {\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(name = '', parent = null, node = {\n    children: {},\n    childCount: 0\n  }) {\n    this.name = name;\n    this.parent = parent;\n    this.node = node;\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 */\nfunction treeSubTree(tree, pathObj) {\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(next, child, childNode);\n    path = pathPopFront(path);\n    next = pathGetFront(path);\n  }\n  return child;\n}\n/**\n * Returns the data associated with this tree node.\n *\n * @returns The data or null if no data exists.\n */\nfunction treeGetValue(tree) {\n  return tree.node.value;\n}\n/**\n * Sets data to this tree node.\n *\n * @param value - Value to set.\n */\nfunction treeSetValue(tree, value) {\n  tree.node.value = value;\n  treeUpdateParents(tree);\n}\n/**\n * @returns Whether the tree has any children.\n */\nfunction treeHasChildren(tree) {\n  return tree.node.childCount > 0;\n}\n/**\n * @returns Whether the tree is empty (no value or children).\n */\nfunction treeIsEmpty(tree) {\n  return treeGetValue(tree) === undefined && !treeHasChildren(tree);\n}\n/**\n * Calls action for each child of this tree node.\n *\n * @param action - Action to be called for each child.\n */\nfunction treeForEachChild(tree, action) {\n  each(tree.node.children, (child, childTree) => {\n    action(new Tree(child, tree, childTree));\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 */\nfunction treeForEachDescendant(tree, action, includeSelf, childrenFirst) {\n  if (includeSelf && !childrenFirst) {\n    action(tree);\n  }\n  treeForEachChild(tree, child => {\n    treeForEachDescendant(child, action, true, childrenFirst);\n  });\n  if (includeSelf && childrenFirst) {\n    action(tree);\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 */\nfunction treeForEachAncestor(tree, action, includeSelf) {\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 * @returns The path of this tree node, as a Path.\n */\nfunction treeGetPath(tree) {\n  return new Path(tree.parent === null ? tree.name : treeGetPath(tree.parent) + '/' + tree.name);\n}\n/**\n * Adds or removes this child from its parent based on whether it's empty or not.\n */\nfunction treeUpdateParents(tree) {\n  if (tree.parent !== null) {\n    treeUpdateChild(tree.parent, tree.name, tree);\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(tree, childName, child) {\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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 * True for invalid Firebase keys\n */\nconst INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\n/**\n * True for invalid Firebase paths.\n * Allows '/' in paths.\n */\nconst INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\n/**\n * Maximum number of characters to allow in leaf value\n */\nconst MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\nconst isValidKey = function (key) {\n  return typeof key === 'string' && key.length !== 0 && !INVALID_KEY_REGEX_.test(key);\n};\nconst isValidPathString = function (pathString) {\n  return typeof pathString === 'string' && pathString.length !== 0 && !INVALID_PATH_REGEX_.test(pathString);\n};\nconst isValidRootPathString = function (pathString) {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n  return isValidPathString(pathString);\n};\nconst isValidPriority = function (priority) {\n  return priority === null || typeof priority === 'string' || typeof priority === 'number' && !isInvalidJSONNumber(priority) || priority && typeof priority === 'object' &&\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  contains(priority, '.sv');\n};\n/**\n * Pre-validate a datum passed as an argument to Firebase function.\n */\nconst validateFirebaseDataArg = function (fnName, value, path, optional) {\n  if (optional && value === undefined) {\n    return;\n  }\n  validateFirebaseData(errorPrefix(fnName, 'value'), value, path);\n};\n/**\n * Validate a data object client-side before sending to server.\n */\nconst validateFirebaseData = function (errorPrefix, data, path_) {\n  const path = path_ instanceof Path ? new ValidationPath(path_, errorPrefix) : path_;\n  if (data === undefined) {\n    throw new Error(errorPrefix + 'contains undefined ' + validationPathToErrorString(path));\n  }\n  if (typeof data === 'function') {\n    throw new Error(errorPrefix + 'contains a function ' + validationPathToErrorString(path) + ' with contents = ' + data.toString());\n  }\n  if (isInvalidJSONNumber(data)) {\n    throw new Error(errorPrefix + 'contains ' + data.toString() + ' ' + validationPathToErrorString(path));\n  }\n  // Check max leaf size, but try to avoid the utf8 conversion if we can.\n  if (typeof data === 'string' && data.length > MAX_LEAF_SIZE_ / 3 && stringLength(data) > MAX_LEAF_SIZE_) {\n    throw new Error(errorPrefix + 'contains a string greater than ' + MAX_LEAF_SIZE_ + ' utf8 bytes ' + validationPathToErrorString(path) + \" ('\" + data.substring(0, 50) + \"...')\");\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, value) => {\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(errorPrefix + ' contains an invalid key (' + key + ') ' + validationPathToErrorString(path) + '.  Keys must be non-empty strings ' + 'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\n        }\n      }\n      validationPathPush(path, key);\n      validateFirebaseData(errorPrefix, value, path);\n      validationPathPop(path);\n    });\n    if (hasDotValue && hasActualChild) {\n      throw new Error(errorPrefix + ' contains \".value\" child ' + validationPathToErrorString(path) + ' in addition to actual children.');\n    }\n  }\n};\n/**\n * Pre-validate paths passed in the firebase function.\n */\nconst validateFirebaseMergePaths = function (errorPrefix, mergePaths) {\n  let i, curPath;\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) ;else if (!isValidKey(keys[j])) {\n        throw new Error(errorPrefix + 'contains an invalid key (' + keys[j] + ') in path ' + curPath.toString() + '. Keys must be non-empty strings ' + 'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\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 = null;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    if (prevPath !== null && pathContains(prevPath, curPath)) {\n      throw new Error(errorPrefix + 'contains a path ' + prevPath.toString() + ' that is ancestor of another path ' + curPath.toString());\n    }\n    prevPath = curPath;\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 */\nconst validateFirebaseMergeDataArg = function (fnName, data, path, optional) {\n  if (optional && data === undefined) {\n    return;\n  }\n  const errorPrefix$1 = errorPrefix(fnName, 'values');\n  if (!(data && typeof data === 'object') || Array.isArray(data)) {\n    throw new Error(errorPrefix$1 + ' must be an object containing the children to replace.');\n  }\n  const mergePaths = [];\n  each(data, (key, value) => {\n    const curPath = new Path(key);\n    validateFirebaseData(errorPrefix$1, value, pathChild(path, curPath));\n    if (pathGetBack(curPath) === '.priority') {\n      if (!isValidPriority(value)) {\n        throw new Error(errorPrefix$1 + \"contains an invalid value for '\" + curPath.toString() + \"', which must be a valid \" + 'Firebase priority (a string, finite number, server value, or null).');\n      }\n    }\n    mergePaths.push(curPath);\n  });\n  validateFirebaseMergePaths(errorPrefix$1, mergePaths);\n};\nconst validatePriority = function (fnName, priority, optional) {\n  if (optional && priority === undefined) {\n    return;\n  }\n  if (isInvalidJSONNumber(priority)) {\n    throw new Error(errorPrefix(fnName, 'priority') + 'is ' + priority.toString() + ', but must be a valid Firebase priority (a string, finite number, ' + 'server value, or null).');\n  }\n  // Special case to allow importing data with a .sv.\n  if (!isValidPriority(priority)) {\n    throw new Error(errorPrefix(fnName, 'priority') + 'must be a valid Firebase priority ' + '(a string, finite number, server value, or null).');\n  }\n};\nconst validateKey = function (fnName, argumentName, key, optional) {\n  if (optional && key === undefined) {\n    return;\n  }\n  if (!isValidKey(key)) {\n    throw new Error(errorPrefix(fnName, argumentName) + 'was an invalid key = \"' + key + '\".  Firebase keys must be non-empty strings and ' + 'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").');\n  }\n};\n/**\n * @internal\n */\nconst validatePathString = function (fnName, argumentName, pathString, optional) {\n  if (optional && pathString === undefined) {\n    return;\n  }\n  if (!isValidPathString(pathString)) {\n    throw new Error(errorPrefix(fnName, argumentName) + 'was an invalid path = \"' + pathString + '\". Paths must be non-empty strings and ' + 'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"');\n  }\n};\nconst validateRootPathString = function (fnName, argumentName, pathString, optional) {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n  validatePathString(fnName, argumentName, pathString, optional);\n};\n/**\n * @internal\n */\nconst validateWritablePath = function (fnName, path) {\n  if (pathGetFront(path) === '.info') {\n    throw new Error(fnName + \" failed = Can't modify data under /.info/\");\n  }\n};\nconst validateUrl = function (fnName, parsedUrl) {\n  // TODO = Validate server better.\n  const pathString = parsedUrl.path.toString();\n  if (!(typeof parsedUrl.repoInfo.host === 'string') || parsedUrl.repoInfo.host.length === 0 || !isValidKey(parsedUrl.repoInfo.namespace) && parsedUrl.repoInfo.host.split(':')[0] !== 'localhost' || pathString.length !== 0 && !isValidRootPathString(pathString)) {\n    throw new Error(errorPrefix(fnName, 'url') + 'must be a valid firebase URL and ' + 'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".');\n  }\n};\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * The 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 */\nclass EventQueue {\n  constructor() {\n    this.eventLists_ = [];\n    /**\n     * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n     */\n    this.recursionDepth_ = 0;\n  }\n}\n/**\n * @param eventDataList - The new events to queue.\n */\nfunction eventQueueQueueEvents(eventQueue, eventDataList) {\n  // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\n  let currList = 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    if (currList === null) {\n      currList = {\n        events: [],\n        path\n      };\n    }\n    currList.events.push(data);\n  }\n  if (currList) {\n    eventQueue.eventLists_.push(currList);\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 */\nfunction eventQueueRaiseEventsAtPath(eventQueue, path, eventDataList) {\n  eventQueueQueueEvents(eventQueue, eventDataList);\n  eventQueueRaiseQueuedEventsMatchingPredicate(eventQueue, eventPath => pathEquals(eventPath, path));\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 */\nfunction eventQueueRaiseEventsForChangedPath(eventQueue, changedPath, eventDataList) {\n  eventQueueQueueEvents(eventQueue, eventDataList);\n  eventQueueRaiseQueuedEventsMatchingPredicate(eventQueue, eventPath => pathContains(eventPath, changedPath) || pathContains(changedPath, eventPath));\n}\nfunction eventQueueRaiseQueuedEventsMatchingPredicate(eventQueue, predicate) {\n  eventQueue.recursionDepth_++;\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  if (sentAll) {\n    eventQueue.eventLists_ = [];\n  }\n  eventQueue.recursionDepth_--;\n}\n/**\n * Iterates through the list and raises each event\n */\nfunction eventListRaise(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/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nconst INTERRUPT_REASON = 'repo_interrupt';\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/**\n * A connection to a single data repository.\n */\nclass Repo {\n  constructor(repoInfo_, forceRestClient_, authTokenProvider_, appCheckProvider_) {\n    this.repoInfo_ = repoInfo_;\n    this.forceRestClient_ = forceRestClient_;\n    this.authTokenProvider_ = authTokenProvider_;\n    this.appCheckProvider_ = appCheckProvider_;\n    this.dataUpdateCount = 0;\n    this.statsListener_ = null;\n    this.eventQueue_ = new EventQueue();\n    this.nextWriteId_ = 1;\n    this.interceptServerDataCallback_ = null;\n    /** A list of data pieces and paths to be set when this client disconnects. */\n    this.onDisconnect_ = newSparseSnapshotTree();\n    /** Stores queues of outstanding transactions for Firebase locations. */\n    this.transactionQueueTree_ = new Tree();\n    // TODO: This should be @private but it's used by test_access.js and internal.js\n    this.persistentConnection_ = null;\n    // This key is intentionally not updated if RepoInfo is later changed or replaced\n    this.key = this.repoInfo_.toURLString();\n  }\n  /**\n   * @returns The URL corresponding to the root of this Firebase.\n   */\n  toString() {\n    return (this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host;\n  }\n}\nfunction repoStart(repo, appId, authOverride) {\n  repo.stats_ = statsManagerGetCollection(repo.repoInfo_);\n  if (repo.forceRestClient_ || beingCrawled()) {\n    repo.server_ = new ReadonlyRestClient(repo.repoInfo_, (pathString, data, isMerge, tag) => {\n      repoOnDataUpdate(repo, pathString, data, isMerge, tag);\n    }, repo.authTokenProvider_, repo.appCheckProvider_);\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('Only objects are supported for option databaseAuthVariableOverride');\n      }\n      try {\n        stringify(authOverride);\n      } catch (e) {\n        throw new Error('Invalid authOverride provided: ' + e);\n      }\n    }\n    repo.persistentConnection_ = new PersistentConnection(repo.repoInfo_, appId, (pathString, data, isMerge, tag) => {\n      repoOnDataUpdate(repo, pathString, data, isMerge, tag);\n    }, connectStatus => {\n      repoOnConnectStatus(repo, connectStatus);\n    }, updates => {\n      repoOnServerInfoUpdate(repo, updates);\n    }, repo.authTokenProvider_, repo.appCheckProvider_, authOverride);\n    repo.server_ = repo.persistentConnection_;\n  }\n  repo.authTokenProvider_.addTokenChangeListener(token => {\n    repo.server_.refreshAuthToken(token);\n  });\n  repo.appCheckProvider_.addTokenChangeListener(result => {\n    repo.server_.refreshAppCheckToken(result.token);\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(repo.repoInfo_, () => new StatsReporter(repo.stats_, repo.server_));\n  // Used for .info.\n  repo.infoData_ = new SnapshotHolder();\n  repo.infoSyncTree_ = new SyncTree({\n    startListening: (query, tag, currentHashFn, onComplete) => {\n      let infoEvents = [];\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(repo.infoSyncTree_, query._path, node);\n        setTimeout(() => {\n          onComplete('ok');\n        }, 0);\n      }\n      return infoEvents;\n    },\n    stopListening: () => {}\n  });\n  repoUpdateInfo(repo, 'connected', false);\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(repo.eventQueue_, query._path, events);\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 * @returns The time in milliseconds, taking the server offset into account if we have one.\n */\nfunction repoServerTime(repo) {\n  const offsetNode = repo.infoData_.getNode(new Path('.info/serverTimeOffset'));\n  const offset = offsetNode.val() || 0;\n  return new Date().getTime() + offset;\n}\n/**\n * Generate ServerValues using some variables from the repo object.\n */\nfunction repoGenerateServerValues(repo) {\n  return generateWithValues({\n    timestamp: repoServerTime(repo)\n  });\n}\n/**\n * Called by realtime when we get new messages from the server.\n */\nfunction repoOnDataUpdate(repo, pathString, data, isMerge, tag) {\n  // For testing.\n  repo.dataUpdateCount++;\n  const path = new Path(pathString);\n  data = repo.interceptServerDataCallback_ ? repo.interceptServerDataCallback_(pathString, data) : data;\n  let events = [];\n  if (tag) {\n    if (isMerge) {\n      const taggedChildren = map(data, raw => nodeFromJSON(raw));\n      events = syncTreeApplyTaggedQueryMerge(repo.serverSyncTree_, path, taggedChildren, tag);\n    } else {\n      const taggedSnap = nodeFromJSON(data);\n      events = syncTreeApplyTaggedQueryOverwrite(repo.serverSyncTree_, path, taggedSnap, tag);\n    }\n  } else if (isMerge) {\n    const changedChildren = map(data, raw => nodeFromJSON(raw));\n    events = syncTreeApplyServerMerge(repo.serverSyncTree_, path, changedChildren);\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}\nfunction repoOnConnectStatus(repo, connectStatus) {\n  repoUpdateInfo(repo, 'connected', connectStatus);\n  if (connectStatus === false) {\n    repoRunOnDisconnectEvents(repo);\n  }\n}\nfunction repoOnServerInfoUpdate(repo, updates) {\n  each(updates, (key, value) => {\n    repoUpdateInfo(repo, key, value);\n  });\n}\nfunction repoUpdateInfo(repo, pathString, value) {\n  const path = new Path('/.info/' + pathString);\n  const newNode = nodeFromJSON(value);\n  repo.infoData_.updateSnapshot(path, newNode);\n  const events = syncTreeApplyServerOverwrite(repo.infoSyncTree_, path, newNode);\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n}\nfunction repoGetNextWriteId(repo) {\n  return repo.nextWriteId_++;\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 */\nfunction repoGetValue(repo, query, eventRegistration) {\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(payload => {\n    const node = nodeFromJSON(payload).withIndex(query._queryParams.getIndex());\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(repo.serverSyncTree_, query, eventRegistration, true);\n    let events;\n    if (query._queryParams.loadsAllData()) {\n      events = syncTreeApplyServerOverwrite(repo.serverSyncTree_, query._path, node);\n    } else {\n      const tag = syncTreeTagForQuery(repo.serverSyncTree_, query);\n      events = syncTreeApplyTaggedQueryOverwrite(repo.serverSyncTree_, query._path, node, tag);\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(repo.eventQueue_, query._path, events);\n    syncTreeRemoveEventRegistration(repo.serverSyncTree_, query, eventRegistration, null, true);\n    return node;\n  }, err => {\n    repoLog(repo, 'get for query ' + stringify(query) + ' failed: ' + err);\n    return Promise.reject(new Error(err));\n  });\n}\nfunction repoSetWithPriority(repo, path, newVal, newPriority, onComplete) {\n  repoLog(repo, 'set', {\n    path: path.toString(),\n    value: newVal,\n    priority: newPriority\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(newNodeUnresolved, existing, serverValues);\n  const writeId = repoGetNextWriteId(repo);\n  const events = syncTreeApplyUserOverwrite(repo.serverSyncTree_, path, newNode, writeId, true);\n  eventQueueQueueEvents(repo.eventQueue_, events);\n  repo.server_.put(path.toString(), newNodeUnresolved.val(/*export=*/true), (status, errorReason) => {\n    const success = status === 'ok';\n    if (!success) {\n      warn('set at ' + path + ' failed: ' + status);\n    }\n    const clearEvents = syncTreeAckUserWrite(repo.serverSyncTree_, writeId, !success);\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, clearEvents);\n    repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\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}\nfunction repoUpdate(repo, path, childrenToMerge, onComplete) {\n  repoLog(repo, 'update', {\n    path: path.toString(),\n    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 = {};\n  each(childrenToMerge, (changedKey, changedValue) => {\n    empty = false;\n    changedChildren[changedKey] = resolveDeferredValueTree(pathChild(path, changedKey), nodeFromJSON(changedValue), repo.serverSyncTree_, serverValues);\n  });\n  if (!empty) {\n    const writeId = repoGetNextWriteId(repo);\n    const events = syncTreeApplyUserMerge(repo.serverSyncTree_, path, changedChildren, writeId);\n    eventQueueQueueEvents(repo.eventQueue_, events);\n    repo.server_.merge(path.toString(), childrenToMerge, (status, errorReason) => {\n      const success = status === 'ok';\n      if (!success) {\n        warn('update at ' + path + ' failed: ' + status);\n      }\n      const clearEvents = syncTreeAckUserWrite(repo.serverSyncTree_, writeId, !success);\n      const affectedPath = clearEvents.length > 0 ? repoRerunTransactions(repo, path) : path;\n      eventQueueRaiseEventsForChangedPath(repo.eventQueue_, affectedPath, clearEvents);\n      repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n    });\n    each(childrenToMerge, changedPath => {\n      const affectedPath = repoAbortTransactions(repo, pathChild(path, changedPath));\n      repoRerunTransactions(repo, affectedPath);\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 * Applies all of the changes stored up in the onDisconnect_ tree.\n */\nfunction repoRunOnDisconnectEvents(repo) {\n  repoLog(repo, 'onDisconnectEvents');\n  const serverValues = repoGenerateServerValues(repo);\n  const resolvedOnDisconnectTree = newSparseSnapshotTree();\n  sparseSnapshotTreeForEachTree(repo.onDisconnect_, newEmptyPath(), (path, node) => {\n    const resolved = resolveDeferredValueTree(path, node, repo.serverSyncTree_, serverValues);\n    sparseSnapshotTreeRemember(resolvedOnDisconnectTree, path, resolved);\n  });\n  let events = [];\n  sparseSnapshotTreeForEachTree(resolvedOnDisconnectTree, newEmptyPath(), (path, snap) => {\n    events = events.concat(syncTreeApplyServerOverwrite(repo.serverSyncTree_, path, snap));\n    const affectedPath = repoAbortTransactions(repo, path);\n    repoRerunTransactions(repo, affectedPath);\n  });\n  repo.onDisconnect_ = newSparseSnapshotTree();\n  eventQueueRaiseEventsForChangedPath(repo.eventQueue_, newEmptyPath(), events);\n}\nfunction repoOnDisconnectCancel(repo, path, onComplete) {\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}\nfunction repoOnDisconnectSet(repo, path, value, onComplete) {\n  const newNode = nodeFromJSON(value);\n  repo.server_.onDisconnectPut(path.toString(), newNode.val(/*export=*/true), (status, errorReason) => {\n    if (status === 'ok') {\n      sparseSnapshotTreeRemember(repo.onDisconnect_, path, newNode);\n    }\n    repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n  });\n}\nfunction repoOnDisconnectSetWithPriority(repo, path, value, priority, onComplete) {\n  const newNode = nodeFromJSON(value, priority);\n  repo.server_.onDisconnectPut(path.toString(), newNode.val(/*export=*/true), (status, errorReason) => {\n    if (status === 'ok') {\n      sparseSnapshotTreeRemember(repo.onDisconnect_, path, newNode);\n    }\n    repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n  });\n}\nfunction repoOnDisconnectUpdate(repo, path, childrenToMerge, onComplete) {\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  repo.server_.onDisconnectMerge(path.toString(), childrenToMerge, (status, errorReason) => {\n    if (status === 'ok') {\n      each(childrenToMerge, (childName, childNode) => {\n        const newChildNode = nodeFromJSON(childNode);\n        sparseSnapshotTreeRemember(repo.onDisconnect_, pathChild(path, childName), newChildNode);\n      });\n    }\n    repoCallOnCompleteCallback(repo, onComplete, status, errorReason);\n  });\n}\nfunction repoAddEventCallbackForQuery(repo, query, eventRegistration) {\n  let events;\n  if (pathGetFront(query._path) === '.info') {\n    events = syncTreeAddEventRegistration(repo.infoSyncTree_, query, eventRegistration);\n  } else {\n    events = syncTreeAddEventRegistration(repo.serverSyncTree_, query, eventRegistration);\n  }\n  eventQueueRaiseEventsAtPath(repo.eventQueue_, query._path, events);\n}\nfunction repoRemoveEventCallbackForQuery(repo, query, eventRegistration) {\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(repo.infoSyncTree_, query, eventRegistration);\n  } else {\n    events = syncTreeRemoveEventRegistration(repo.serverSyncTree_, query, eventRegistration);\n  }\n  eventQueueRaiseEventsAtPath(repo.eventQueue_, query._path, events);\n}\nfunction repoInterrupt(repo) {\n  if (repo.persistentConnection_) {\n    repo.persistentConnection_.interrupt(INTERRUPT_REASON);\n  }\n}\nfunction repoResume(repo) {\n  if (repo.persistentConnection_) {\n    repo.persistentConnection_.resume(INTERRUPT_REASON);\n  }\n}\nfunction repoLog(repo, ...varArgs) {\n  let prefix = '';\n  if (repo.persistentConnection_) {\n    prefix = repo.persistentConnection_.id + ':';\n  }\n  log(prefix, ...varArgs);\n}\nfunction repoCallOnCompleteCallback(repo, callback, status, errorReason) {\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        const error = new Error(message);\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        error.code = code;\n        callback(error);\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 */\nfunction repoStartTransaction(repo, path, transactionUpdate, onComplete, unwatcher, applyLocally) {\n  repoLog(repo, 'transaction on ' + path);\n  // Initialize transaction.\n  const 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  // 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('transaction failed: Data returned ', newVal, transaction.path);\n    // Mark as run and add to our queue.\n    transaction.status = 0 /* TransactionStatus.RUN */;\n    const queueNode = treeSubTree(repo.transactionQueueTree_, path);\n    const nodeQueue = treeGetValue(queueNode) || [];\n    nodeQueue.push(transaction);\n    treeSetValue(queueNode, nodeQueue);\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 (typeof newVal === 'object' && newVal !== null && contains(newVal, '.priority')) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      priorityForNode = safeGet(newVal, '.priority');\n      assert(isValidPriority(priorityForNode), 'Invalid priority returned by transaction. ' + 'Priority must be a valid string, finite number, server value, or null.');\n    } else {\n      const currentNode = syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path) || ChildrenNode.EMPTY_NODE;\n      priorityForNode = currentNode.getPriority().val();\n    }\n    const serverValues = repoGenerateServerValues(repo);\n    const newNodeUnresolved = nodeFromJSON(newVal, priorityForNode);\n    const newNode = resolveDeferredValueSnapshot(newNodeUnresolved, currentState, serverValues);\n    transaction.currentOutputSnapshotRaw = newNodeUnresolved;\n    transaction.currentOutputSnapshotResolved = newNode;\n    transaction.currentWriteId = repoGetNextWriteId(repo);\n    const events = syncTreeApplyUserOverwrite(repo.serverSyncTree_, path, newNode, transaction.currentWriteId, transaction.applyLocally);\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n    repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n  }\n}\n/**\n * @param excludeSets - A specific set to exclude\n */\nfunction repoGetLatestState(repo, path, excludeSets) {\n  return syncTreeCalcCompleteEventCache(repo.serverSyncTree_, path, excludeSets) || ChildrenNode.EMPTY_NODE;\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(repo, node = repo.transactionQueueTree_) {\n  // Before recursing, make sure any completed transactions are removed.\n  if (!node) {\n    repoPruneCompletedTransactionsBelowNode(repo, node);\n  }\n  if (treeGetValue(node)) {\n    const queue = repoBuildTransactionQueue(repo, node);\n    assert(queue.length > 0, 'Sending zero length transaction queue');\n    const allRun = queue.every(transaction => transaction.status === 0 /* TransactionStatus.RUN */);\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 * 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(repo, path, queue) {\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(txn.status === 0 /* TransactionStatus.RUN */, 'tryToSendTransactionQueue_: items in queue should all be run.');\n    txn.status = 1 /* 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(relativePath /** @type {!Node} */, txn.currentOutputSnapshotRaw);\n  }\n  const dataToSend = snapToSend.val(true);\n  const pathToSend = path;\n  // Send the put.\n  repo.server_.put(pathToSend.toString(), dataToSend, status => {\n    repoLog(repo, 'transaction put response', {\n      path: pathToSend.toString(),\n      status\n    });\n    let events = [];\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 = 2 /* TransactionStatus.COMPLETED */;\n        events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, queue[i].currentWriteId));\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(() => queue[i].onComplete(null, true, queue[i].currentOutputSnapshotResolved));\n        }\n        queue[i].unwatcher();\n      }\n      // Now remove the completed transactions.\n      repoPruneCompletedTransactionsBelowNode(repo, treeSubTree(repo.transactionQueueTree_, path));\n      // There may be pending transactions that we can now send.\n      repoSendReadyTransactions(repo, repo.transactionQueueTree_);\n      eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\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 === 3 /* TransactionStatus.SENT_NEEDS_ABORT */) {\n            queue[i].status = 4 /* TransactionStatus.NEEDS_ABORT */;\n          } else {\n            queue[i].status = 0 /* TransactionStatus.RUN */;\n          }\n        }\n      } else {\n        warn('transaction at ' + pathToSend.toString() + ' failed: ' + status);\n        for (let i = 0; i < queue.length; i++) {\n          queue[i].status = 4 /* TransactionStatus.NEEDS_ABORT */;\n          queue[i].abortReason = status;\n        }\n      }\n      repoRerunTransactions(repo, path);\n    }\n  }, latestHash);\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, changedPath) {\n  const rootMostTransactionNode = repoGetAncestorTransactionNode(repo, changedPath);\n  const path = treeGetPath(rootMostTransactionNode);\n  const queue = repoBuildTransactionQueue(repo, rootMostTransactionNode);\n  repoRerunTransactionQueue(repo, queue, path);\n  return path;\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(repo, queue, path) {\n  if (queue.length === 0) {\n    return; // Nothing to do!\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 = [];\n  // Ignore all of the sets we're going to re-run.\n  const txnsToRerun = queue.filter(q => {\n    return q.status === 0 /* 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(relativePath !== null, 'rerunTransactionsUnderNode_: relativePath should not be null.');\n    if (transaction.status === 4 /* TransactionStatus.NEEDS_ABORT */) {\n      abortTransaction = true;\n      abortReason = transaction.abortReason;\n      events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, transaction.currentWriteId, true));\n    } else if (transaction.status === 0 /* TransactionStatus.RUN */) {\n      if (transaction.retryCount >= MAX_TRANSACTION_RETRIES) {\n        abortTransaction = true;\n        abortReason = 'maxretry';\n        events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, transaction.currentWriteId, true));\n      } else {\n        // This code reruns a transaction\n        const currentNode = repoGetLatestState(repo, transaction.path, setsToIgnore);\n        transaction.currentInputSnapshot = currentNode;\n        const newData = queue[i].update(currentNode.val());\n        if (newData !== undefined) {\n          validateFirebaseData('transaction failed: Data returned ', newData, transaction.path);\n          let newDataNode = nodeFromJSON(newData);\n          const hasExplicitPriority = typeof newData === 'object' && newData != null && 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          const oldWriteId = transaction.currentWriteId;\n          const serverValues = repoGenerateServerValues(repo);\n          const newNodeResolved = resolveDeferredValueSnapshot(newDataNode, currentNode, serverValues);\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(syncTreeApplyUserOverwrite(repo.serverSyncTree_, transaction.path, newNodeResolved, transaction.currentWriteId, transaction.applyLocally));\n          events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, oldWriteId, true));\n        } else {\n          abortTransaction = true;\n          abortReason = 'nodata';\n          events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, transaction.currentWriteId, true));\n        }\n      }\n    }\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, path, events);\n    events = [];\n    if (abortTransaction) {\n      // Abort.\n      queue[i].status = 2 /* TransactionStatus.COMPLETED */;\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      if (queue[i].onComplete) {\n        if (abortReason === 'nodata') {\n          callbacks.push(() => queue[i].onComplete(null, false, queue[i].currentInputSnapshot));\n        } else {\n          callbacks.push(() => queue[i].onComplete(new Error(abortReason), false, null));\n        }\n      }\n    }\n  }\n  // Clean up completed transactions.\n  repoPruneCompletedTransactionsBelowNode(repo, repo.transactionQueueTree_);\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  // Try to send the transaction result to the server.\n  repoSendReadyTransactions(repo, repo.transactionQueueTree_);\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(repo, path) {\n  let front;\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  return transactionNode;\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(repo, transactionNode) {\n  // Walk any child transaction queues and aggregate them into a single queue.\n  const transactionQueue = [];\n  repoAggregateTransactionQueuesForNode(repo, transactionNode, transactionQueue);\n  // Sort them by the order the transactions were created.\n  transactionQueue.sort((a, b) => a.order - b.order);\n  return transactionQueue;\n}\nfunction repoAggregateTransactionQueuesForNode(repo, node, queue) {\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  treeForEachChild(node, child => {\n    repoAggregateTransactionQueuesForNode(repo, child, queue);\n  });\n}\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n */\nfunction repoPruneCompletedTransactionsBelowNode(repo, node) {\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 !== 2 /* 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  treeForEachChild(node, childNode => {\n    repoPruneCompletedTransactionsBelowNode(repo, childNode);\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, path) {\n  const affectedPath = treeGetPath(repoGetAncestorTransactionNode(repo, path));\n  const transactionNode = treeSubTree(repo.transactionQueueTree_, path);\n  treeForEachAncestor(transactionNode, node => {\n    repoAbortTransactionsOnNode(repo, node);\n  });\n  repoAbortTransactionsOnNode(repo, transactionNode);\n  treeForEachDescendant(transactionNode, node => {\n    repoAbortTransactionsOnNode(repo, node);\n  });\n  return affectedPath;\n}\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param node - Node to abort transactions for.\n */\nfunction repoAbortTransactionsOnNode(repo, node) {\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    // 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 = [];\n    let lastSent = -1;\n    for (let i = 0; i < queue.length; i++) {\n      if (queue[i].status === 3 /* TransactionStatus.SENT_NEEDS_ABORT */) ;else if (queue[i].status === 1 /* TransactionStatus.SENT */) {\n        assert(lastSent === i - 1, 'All SENT items should be at beginning of queue.');\n        lastSent = i;\n        // Mark transaction for abort when it comes back.\n        queue[i].status = 3 /* TransactionStatus.SENT_NEEDS_ABORT */;\n        queue[i].abortReason = 'set';\n      } else {\n        assert(queue[i].status === 0 /* TransactionStatus.RUN */, 'Unexpected transaction status in abort');\n        // We can abort it immediately.\n        queue[i].unwatcher();\n        events = events.concat(syncTreeAckUserWrite(repo.serverSyncTree_, queue[i].currentWriteId, true));\n        if (queue[i].onComplete) {\n          callbacks.push(queue[i].onComplete.bind(null, new Error('set'), false, null));\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    // Now fire the callbacks.\n    eventQueueRaiseEventsForChangedPath(repo.eventQueue_, treeGetPath(node), events);\n    for (let i = 0; i < callbacks.length; i++) {\n      exceptionGuard(callbacks[i]);\n    }\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction decodePath(pathString) {\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 * @returns key value hash\n */\nfunction decodeQuery(queryString) {\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}\nconst parseRepoInfo = function (dataURL, nodeAdmin) {\n  const parsedUrl = parseDatabaseURL(dataURL),\n    namespace = parsedUrl.namespace;\n  if (parsedUrl.domain === 'firebase.com') {\n    fatal(parsedUrl.host + ' is no longer supported. ' + 'Please use <YOUR FIREBASE>.firebaseio.com instead');\n  }\n  // Catch common error of uninitialized namespace value.\n  if ((!namespace || namespace === 'undefined') && parsedUrl.domain !== 'localhost') {\n    fatal('Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com');\n  }\n  if (!parsedUrl.secure) {\n    warnIfPageIsSecure();\n  }\n  const webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n  return {\n    repoInfo: new RepoInfo(parsedUrl.host, parsedUrl.secure, namespace, webSocketOnly, nodeAdmin, /*persistenceKey=*/'', /*includeNamespaceInQueryParams=*/namespace !== parsedUrl.subdomain),\n    path: new Path(parsedUrl.pathString)\n  };\n};\nconst parseDatabaseURL = function (dataURL) {\n  // Default to empty strings in the event of a malformed string.\n  let host = '',\n    domain = '',\n    subdomain = '',\n    pathString = '',\n    namespace = '';\n  // Always default to SSL, unless otherwise specified.\n  let secure = true,\n    scheme = 'https',\n    port = 443;\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    // 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(dataURL.substring(Math.min(dataURL.length, questionMarkInd)));\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    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  return {\n    host,\n    port,\n    domain,\n    subdomain,\n    secure,\n    scheme,\n    pathString,\n    namespace\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// Modeled after base64 web-safe chars, but ordered by ASCII.\nconst PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\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 */\nconst 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  // 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 = [];\n  return function (now) {\n    const duplicateTime = now === lastPushTime;\n    lastPushTime = now;\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    let id = timeStampChars.join('');\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    return id;\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 * Encapsulates the data needed to raise an event\n */\nclass DataEvent {\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(eventType, eventRegistration, snapshot, prevName) {\n    this.eventType = eventType;\n    this.eventRegistration = eventRegistration;\n    this.snapshot = snapshot;\n    this.prevName = prevName;\n  }\n  getPath() {\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() {\n    return this.eventType;\n  }\n  getEventRunner() {\n    return this.eventRegistration.getEventRunner(this);\n  }\n  toString() {\n    return this.getPath().toString() + ':' + this.eventType + ':' + stringify(this.snapshot.exportVal());\n  }\n}\nclass CancelEvent {\n  constructor(eventRegistration, error, path) {\n    this.eventRegistration = eventRegistration;\n    this.error = error;\n    this.path = path;\n  }\n  getPath() {\n    return this.path;\n  }\n  getEventType() {\n    return 'cancel';\n  }\n  getEventRunner() {\n    return this.eventRegistration.getEventRunner(this);\n  }\n  toString() {\n    return this.path.toString() + ':cancel';\n  }\n}\n\n/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A 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 */\nclass CallbackContext {\n  constructor(snapshotCallback, cancelCallback) {\n    this.snapshotCallback = snapshotCallback;\n    this.cancelCallback = cancelCallback;\n  }\n  onValue(expDataSnapshot, previousChildName) {\n    this.snapshotCallback.call(null, expDataSnapshot, previousChildName);\n  }\n  onCancel(error) {\n    assert(this.hasCancelCallback, 'Raising a cancel event on a listener with no cancel callback');\n    return this.cancelCallback.call(null, error);\n  }\n  get hasCancelCallback() {\n    return !!this.cancelCallback;\n  }\n  matches(other) {\n    return this.snapshotCallback === other.snapshotCallback || this.snapshotCallback.userCallback !== undefined && this.snapshotCallback.userCallback === other.snapshotCallback.userCallback && this.snapshotCallback.context === other.snapshotCallback.context;\n  }\n}\n\n/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * The `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 */\nclass OnDisconnect {\n  /** @hideconstructor */\n  constructor(_repo, _path) {\n    this._repo = _repo;\n    this._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() {\n    const deferred = new Deferred();\n    repoOnDisconnectCancel(this._repo, this._path, deferred.wrapCallback(() => {}));\n    return deferred.promise;\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() {\n    validateWritablePath('OnDisconnect.remove', this._path);\n    const deferred = new Deferred();\n    repoOnDisconnectSet(this._repo, this._path, null, deferred.wrapCallback(() => {}));\n    return deferred.promise;\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) {\n    validateWritablePath('OnDisconnect.set', this._path);\n    validateFirebaseDataArg('OnDisconnect.set', value, this._path, false);\n    const deferred = new Deferred();\n    repoOnDisconnectSet(this._repo, this._path, value, deferred.wrapCallback(() => {}));\n    return deferred.promise;\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(value, priority) {\n    validateWritablePath('OnDisconnect.setWithPriority', this._path);\n    validateFirebaseDataArg('OnDisconnect.setWithPriority', value, this._path, false);\n    validatePriority('OnDisconnect.setWithPriority', priority, false);\n    const deferred = new Deferred();\n    repoOnDisconnectSetWithPriority(this._repo, this._path, value, priority, deferred.wrapCallback(() => {}));\n    return deferred.promise;\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) {\n    validateWritablePath('OnDisconnect.update', this._path);\n    validateFirebaseMergeDataArg('OnDisconnect.update', values, this._path, false);\n    const deferred = new Deferred();\n    repoOnDisconnectUpdate(this._repo, this._path, values, deferred.wrapCallback(() => {}));\n    return deferred.promise;\n  }\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @internal\n */\nclass QueryImpl {\n  /**\n   * @hideconstructor\n   */\n  constructor(_repo, _path, _queryParams, _orderByCalled) {\n    this._repo = _repo;\n    this._path = _path;\n    this._queryParams = _queryParams;\n    this._orderByCalled = _orderByCalled;\n  }\n  get key() {\n    if (pathIsEmpty(this._path)) {\n      return null;\n    } else {\n      return pathGetBack(this._path);\n    }\n  }\n  get ref() {\n    return new ReferenceImpl(this._repo, this._path);\n  }\n  get _queryIdentifier() {\n    const obj = queryParamsGetQueryObject(this._queryParams);\n    const id = ObjectToUniqueKey(obj);\n    return id === '{}' ? 'default' : id;\n  }\n  /**\n   * An object representation of the query parameters used by this Query.\n   */\n  get _queryObject() {\n    return queryParamsGetQueryObject(this._queryParams);\n  }\n  isEqual(other) {\n    other = getModularInstance(other);\n    if (!(other instanceof QueryImpl)) {\n      return false;\n    }\n    const sameRepo = this._repo === other._repo;\n    const samePath = pathEquals(this._path, other._path);\n    const sameQueryIdentifier = this._queryIdentifier === other._queryIdentifier;\n    return sameRepo && samePath && sameQueryIdentifier;\n  }\n  toJSON() {\n    return this.toString();\n  }\n  toString() {\n    return this._repo.toString() + pathToUrlEncodedString(this._path);\n  }\n}\n/**\n * Validates that no other order by call has been made\n */\nfunction validateNoPreviousOrderByCall(query, fnName) {\n  if (query._orderByCalled === true) {\n    throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\n  }\n}\n/**\n * Validates start/end values for queries.\n */\nfunction validateQueryEndpoints(params) {\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  if (params.getIndex() === KEY_INDEX) {\n    const tooManyArgsError = 'Query: When ordering by key, you may only pass one argument to ' + 'startAt(), endAt(), or equalTo().';\n    const wrongArgTypeError = 'Query: When ordering by key, the argument passed to startAt(), startAfter(), ' + '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 (startNode != null && !isValidPriority(startNode) || endNode != null && !isValidPriority(endNode)) {\n      throw new Error('Query: When ordering by priority, the first argument passed to startAt(), ' + 'startAfter() endAt(), endBefore(), or equalTo() must be a valid priority value ' + '(null, a number, or a string).');\n    }\n  } else {\n    assert(params.getIndex() instanceof PathIndex || params.getIndex() === VALUE_INDEX, 'unknown index type.');\n    if (startNode != null && typeof startNode === 'object' || endNode != null && typeof endNode === 'object') {\n      throw new Error('Query: First argument passed to startAt(), startAfter(), endAt(), endBefore(), or ' + 'equalTo() cannot be an object.');\n    }\n  }\n}\n/**\n * Validates that limit* has been called with the correct combination of parameters\n */\nfunction validateLimit(params) {\n  if (params.hasStart() && params.hasEnd() && params.hasLimit() && !params.hasAnchoredLimit()) {\n    throw new Error(\"Query: Can't combine startAt(), startAfter(), endAt(), endBefore(), and limit(). Use \" + 'limitToFirst() or limitToLast() instead.');\n  }\n}\n/**\n * @internal\n */\nclass ReferenceImpl extends QueryImpl {\n  /** @hideconstructor */\n  constructor(repo, path) {\n    super(repo, path, new QueryParams(), false);\n  }\n  get parent() {\n    const parentPath = pathParent(this._path);\n    return parentPath === null ? null : new ReferenceImpl(this._repo, parentPath);\n  }\n  get root() {\n    let ref = this;\n    while (ref.parent !== null) {\n      ref = ref.parent;\n    }\n    return ref;\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 */\nclass 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(_node,\n  /**\n   * The location of this DataSnapshot.\n   */\n  ref, _index) {\n    this._node = _node;\n    this.ref = ref;\n    this._index = _index;\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() {\n    // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\n    return this._node.getPriority().val();\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() {\n    return this.ref.key;\n  }\n  /** Returns the number of child properties of this `DataSnapshot`. */\n  get size() {\n    return this._node.numChildren();\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) {\n    const childPath = new Path(path);\n    const childRef = child(this.ref, path);\n    return new DataSnapshot(this._node.getChild(childPath), childRef, PRIORITY_INDEX);\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() {\n    return !this._node.isEmpty();\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() {\n    return this._node.val(true);\n  }\n  /**\n   * Enumerates the top-level children in the `IteratedDataSnapshot`.\n   *\n   * Because of the way JavaScript objects work, the ordering of data in the\n   * JavaScript object returned by `val()` is not guaranteed to match the\n   * ordering on the server nor the ordering of `onChildAdded()` events. That is\n   * where `forEach()` comes in handy. It guarantees the children of a\n   * `DataSnapshot` will be iterated in their query order.\n   *\n   * If no explicit `orderBy*()` method is used, results are returned\n   * ordered by key (unless priorities are used, in which case, results are\n   * returned by priority).\n   *\n   * @param action - A function that will be called for each child DataSnapshot.\n   * The callback can return true to cancel further enumeration.\n   * @returns true if enumeration was canceled due to your callback returning\n   * true.\n   */\n  forEach(action) {\n    if (this._node.isLeafNode()) {\n      return false;\n    }\n    const childrenNode = this._node;\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(new DataSnapshot(node, child(this.ref, key), PRIORITY_INDEX));\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) {\n    const childPath = new Path(path);\n    return !this._node.getChild(childPath).isEmpty();\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() {\n    if (this._node.isLeafNode()) {\n      return false;\n    } else {\n      return !this._node.isEmpty();\n    }\n  }\n  /**\n   * Returns a JSON-serializable representation of this object.\n   */\n  toJSON() {\n    return this.exportVal();\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() {\n    return this._node.val();\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 */\nfunction ref(db, path) {\n  db = getModularInstance(db);\n  db._checkNotDeleted('ref');\n  return path !== undefined ? child(db._root, path) : db._root;\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 */\nfunction refFromURL(db, url) {\n  db = getModularInstance(db);\n  db._checkNotDeleted('refFromURL');\n  const parsedURL = parseRepoInfo(url, db._repo.repoInfo_.nodeAdmin);\n  validateUrl('refFromURL', parsedURL);\n  const repoInfo = parsedURL.repoInfo;\n  if (!db._repo.repoInfo_.isCustomHost() && repoInfo.host !== db._repo.repoInfo_.host) {\n    fatal('refFromURL' + ': Host name does not match the current database: ' + '(found ' + repoInfo.host + ' but expected ' + db._repo.repoInfo_.host + ')');\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 */\nfunction child(parent, path) {\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 * 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 */\nfunction onDisconnect(ref) {\n  ref = getModularInstance(ref);\n  return new OnDisconnect(ref._repo, ref._path);\n}\n/**\n * Generates a new child location using a unique key and returns its\n * `Reference`.\n *\n * This is the most common pattern for adding data to a collection of items.\n *\n * If you provide a value to `push()`, the value is written to the\n * generated location. If you don't pass a value, nothing is written to the\n * database and the child remains empty (but you can use the `Reference`\n * elsewhere).\n *\n * The unique keys generated by `push()` are ordered by the current time, so the\n * resulting list of items is chronologically sorted. The keys are also\n * designed to be unguessable (they contain 72 random bits of entropy).\n *\n * See {@link https://firebase.google.com/docs/database/web/lists-of-data#append_to_a_list_of_data | Append to a list of data}.\n * See {@link https://firebase.googleblog.com/2015/02/the-2120-ways-to-ensure-unique_68.html | The 2^120 Ways to Ensure Unique Identifiers}.\n *\n * @param parent - The parent location.\n * @param value - Optional value to be written at the generated location.\n * @returns Combined `Promise` and `Reference`; resolves when write is complete,\n * but can be used immediately as the `Reference` to the child location.\n */\nfunction push(parent, value) {\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  // 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 thenablePushRef = child(parent, name);\n  const pushRef = child(parent, name);\n  let promise;\n  if (value != null) {\n    promise = set(pushRef, value).then(() => pushRef);\n  } else {\n    promise = Promise.resolve(pushRef);\n  }\n  thenablePushRef.then = promise.then.bind(promise);\n  thenablePushRef.catch = promise.then.bind(promise, undefined);\n  return thenablePushRef;\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 */\nfunction remove(ref) {\n  validateWritablePath('remove', ref._path);\n  return set(ref, null);\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 */\nfunction set(ref, value) {\n  ref = getModularInstance(ref);\n  validateWritablePath('set', ref._path);\n  validateFirebaseDataArg('set', value, ref._path, false);\n  const deferred = new Deferred();\n  repoSetWithPriority(ref._repo, ref._path, value, /*priority=*/null, deferred.wrapCallback(() => {}));\n  return deferred.promise;\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 */\nfunction setPriority(ref, priority) {\n  ref = getModularInstance(ref);\n  validateWritablePath('setPriority', ref._path);\n  validatePriority('setPriority', priority, false);\n  const deferred = new Deferred();\n  repoSetWithPriority(ref._repo, pathChild(ref._path, '.priority'), priority, null, deferred.wrapCallback(() => {}));\n  return deferred.promise;\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 */\nfunction setWithPriority(ref, value, priority) {\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  const deferred = new Deferred();\n  repoSetWithPriority(ref._repo, ref._path, value, priority, deferred.wrapCallback(() => {}));\n  return deferred.promise;\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 */\nfunction update(ref, values) {\n  validateFirebaseMergeDataArg('update', values, ref._path, false);\n  const deferred = new Deferred();\n  repoUpdate(ref._repo, ref._path, values, deferred.wrapCallback(() => {}));\n  return deferred.promise;\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 */\nfunction get(query) {\n  query = getModularInstance(query);\n  const callbackContext = new CallbackContext(() => {});\n  const container = new ValueEventRegistration(callbackContext);\n  return repoGetValue(query._repo, query, container).then(node => {\n    return new DataSnapshot(node, new ReferenceImpl(query._repo, query._path), query._queryParams.getIndex());\n  });\n}\n/**\n * Represents registration for 'value' events.\n */\nclass ValueEventRegistration {\n  constructor(callbackContext) {\n    this.callbackContext = callbackContext;\n  }\n  respondsTo(eventType) {\n    return eventType === 'value';\n  }\n  createEvent(change, query) {\n    const index = query._queryParams.getIndex();\n    return new DataEvent('value', this, new DataSnapshot(change.snapshotNode, new ReferenceImpl(query._repo, query._path), index));\n  }\n  getEventRunner(eventData) {\n    if (eventData.getEventType() === 'cancel') {\n      return () => this.callbackContext.onCancel(eventData.error);\n    } else {\n      return () => this.callbackContext.onValue(eventData.snapshot, null);\n    }\n  }\n  createCancelEvent(error, path) {\n    if (this.callbackContext.hasCancelCallback) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n  matches(other) {\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  hasAnyCallback() {\n    return this.callbackContext !== null;\n  }\n}\n/**\n * Represents the registration of a child_x event.\n */\nclass ChildEventRegistration {\n  constructor(eventType, callbackContext) {\n    this.eventType = eventType;\n    this.callbackContext = callbackContext;\n  }\n  respondsTo(eventType) {\n    let eventToCheck = eventType === 'children_added' ? 'child_added' : eventType;\n    eventToCheck = eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\n    return this.eventType === eventToCheck;\n  }\n  createCancelEvent(error, path) {\n    if (this.callbackContext.hasCancelCallback) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n  createEvent(change, query) {\n    assert(change.childName != null, 'Child events should have a childName.');\n    const childRef = child(new ReferenceImpl(query._repo, query._path), change.childName);\n    const index = query._queryParams.getIndex();\n    return new DataEvent(change.type, this, new DataSnapshot(change.snapshotNode, childRef, index), change.prevName);\n  }\n  getEventRunner(eventData) {\n    if (eventData.getEventType() === 'cancel') {\n      return () => this.callbackContext.onCancel(eventData.error);\n    } else {\n      return () => this.callbackContext.onValue(eventData.snapshot, eventData.prevName);\n    }\n  }\n  matches(other) {\n    if (other instanceof ChildEventRegistration) {\n      return this.eventType === other.eventType && (!this.callbackContext || !other.callbackContext || this.callbackContext.matches(other.callbackContext));\n    }\n    return false;\n  }\n  hasAnyCallback() {\n    return !!this.callbackContext;\n  }\n}\nfunction addEventListener(query, eventType, callback, cancelCallbackOrListenOptions, options) {\n  let cancelCallback;\n  if (typeof cancelCallbackOrListenOptions === 'object') {\n    cancelCallback = undefined;\n    options = cancelCallbackOrListenOptions;\n  }\n  if (typeof cancelCallbackOrListenOptions === 'function') {\n    cancelCallback = cancelCallbackOrListenOptions;\n  }\n  if (options && options.onlyOnce) {\n    const userCallback = callback;\n    const onceCallback = (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  const callbackContext = new CallbackContext(callback, cancelCallback || undefined);\n  const container = eventType === 'value' ? new ValueEventRegistration(callbackContext) : new ChildEventRegistration(eventType, callbackContext);\n  repoAddEventCallbackForQuery(query._repo, query, container);\n  return () => repoRemoveEventCallbackForQuery(query._repo, query, container);\n}\nfunction onValue(query, callback, cancelCallbackOrListenOptions, options) {\n  return addEventListener(query, 'value', callback, cancelCallbackOrListenOptions, options);\n}\nfunction onChildAdded(query, callback, cancelCallbackOrListenOptions, options) {\n  return addEventListener(query, 'child_added', callback, cancelCallbackOrListenOptions, options);\n}\nfunction onChildChanged(query, callback, cancelCallbackOrListenOptions, options) {\n  return addEventListener(query, 'child_changed', callback, cancelCallbackOrListenOptions, options);\n}\nfunction onChildMoved(query, callback, cancelCallbackOrListenOptions, options) {\n  return addEventListener(query, 'child_moved', callback, cancelCallbackOrListenOptions, options);\n}\nfunction onChildRemoved(query, callback, cancelCallbackOrListenOptions, options) {\n  return addEventListener(query, 'child_removed', callback, cancelCallbackOrListenOptions, options);\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 */\nfunction off(query, eventType, callback) {\n  let container = 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 * 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 */\nclass QueryConstraint {}\nclass QueryEndAtConstraint extends QueryConstraint {\n  constructor(_value, _key) {\n    super();\n    this._value = _value;\n    this._key = _key;\n    this.type = 'endAt';\n  }\n  _apply(query) {\n    validateFirebaseDataArg('endAt', this._value, query._path, true);\n    const newParams = queryParamsEndAt(query._queryParams, this._value, this._key);\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasEnd()) {\n      throw new Error('endAt: Starting point was already set (by another call to endAt, ' + 'endBefore or equalTo).');\n    }\n    return new QueryImpl(query._repo, query._path, newParams, query._orderByCalled);\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 */\nfunction endAt(value, key) {\n  validateKey('endAt', 'key', key, true);\n  return new QueryEndAtConstraint(value, key);\n}\nclass QueryEndBeforeConstraint extends QueryConstraint {\n  constructor(_value, _key) {\n    super();\n    this._value = _value;\n    this._key = _key;\n    this.type = 'endBefore';\n  }\n  _apply(query) {\n    validateFirebaseDataArg('endBefore', this._value, query._path, false);\n    const newParams = queryParamsEndBefore(query._queryParams, this._value, this._key);\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasEnd()) {\n      throw new Error('endBefore: Starting point was already set (by another call to endAt, ' + 'endBefore or equalTo).');\n    }\n    return new QueryImpl(query._repo, query._path, newParams, query._orderByCalled);\n  }\n}\n/**\n * Creates a `QueryConstraint` with the specified ending point (exclusive).\n *\n * Using `startAt()`, `startAfter()`, `endBefore()`, `endAt()` and `equalTo()`\n * allows you to choose arbitrary starting and ending points for your queries.\n *\n * The ending point is exclusive. If only a value is provided, children\n * with a value less than the specified value will be included in the query.\n * If a key is specified, then children must have a value less than or equal\n * to the specified value and a key name less than the specified key.\n *\n * @param value - The value to end before. The argument type depends on which\n * `orderBy*()` function was used in this query. Specify a value that matches\n * the `orderBy*()` type. When used in combination with `orderByKey()`, the\n * value must be a string.\n * @param key - The child key to end before, among the children with the\n * previously specified priority. This argument is only allowed if ordering by\n * child, value, or priority.\n */\nfunction endBefore(value, key) {\n  validateKey('endBefore', 'key', key, true);\n  return new QueryEndBeforeConstraint(value, key);\n}\nclass QueryStartAtConstraint extends QueryConstraint {\n  constructor(_value, _key) {\n    super();\n    this._value = _value;\n    this._key = _key;\n    this.type = 'startAt';\n  }\n  _apply(query) {\n    validateFirebaseDataArg('startAt', this._value, query._path, true);\n    const newParams = queryParamsStartAt(query._queryParams, this._value, this._key);\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasStart()) {\n      throw new Error('startAt: Starting point was already set (by another call to startAt, ' + 'startBefore or equalTo).');\n    }\n    return new QueryImpl(query._repo, query._path, newParams, query._orderByCalled);\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 */\nfunction startAt(value = null, key) {\n  validateKey('startAt', 'key', key, true);\n  return new QueryStartAtConstraint(value, key);\n}\nclass QueryStartAfterConstraint extends QueryConstraint {\n  constructor(_value, _key) {\n    super();\n    this._value = _value;\n    this._key = _key;\n    this.type = 'startAfter';\n  }\n  _apply(query) {\n    validateFirebaseDataArg('startAfter', this._value, query._path, false);\n    const newParams = queryParamsStartAfter(query._queryParams, this._value, this._key);\n    validateLimit(newParams);\n    validateQueryEndpoints(newParams);\n    if (query._queryParams.hasStart()) {\n      throw new Error('startAfter: Starting point was already set (by another call to startAt, ' + 'startAfter, or equalTo).');\n    }\n    return new QueryImpl(query._repo, query._path, newParams, query._orderByCalled);\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 */\nfunction startAfter(value, key) {\n  validateKey('startAfter', 'key', key, true);\n  return new QueryStartAfterConstraint(value, key);\n}\nclass QueryLimitToFirstConstraint extends QueryConstraint {\n  constructor(_limit) {\n    super();\n    this._limit = _limit;\n    this.type = 'limitToFirst';\n  }\n  _apply(query) {\n    if (query._queryParams.hasLimit()) {\n      throw new Error('limitToFirst: Limit was already set (by another call to limitToFirst ' + 'or limitToLast).');\n    }\n    return new QueryImpl(query._repo, query._path, queryParamsLimitToFirst(query._queryParams, this._limit), query._orderByCalled);\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 */\nfunction limitToFirst(limit) {\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}\nclass QueryLimitToLastConstraint extends QueryConstraint {\n  constructor(_limit) {\n    super();\n    this._limit = _limit;\n    this.type = 'limitToLast';\n  }\n  _apply(query) {\n    if (query._queryParams.hasLimit()) {\n      throw new Error('limitToLast: Limit was already set (by another call to limitToFirst ' + 'or limitToLast).');\n    }\n    return new QueryImpl(query._repo, query._path, queryParamsLimitToLast(query._queryParams, this._limit), query._orderByCalled);\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 */\nfunction limitToLast(limit) {\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  return new QueryLimitToLastConstraint(limit);\n}\nclass QueryOrderByChildConstraint extends QueryConstraint {\n  constructor(_path) {\n    super();\n    this._path = _path;\n    this.type = 'orderByChild';\n  }\n  _apply(query) {\n    validateNoPreviousOrderByCall(query, 'orderByChild');\n    const parsedPath = new Path(this._path);\n    if (pathIsEmpty(parsedPath)) {\n      throw new Error('orderByChild: cannot pass in empty path. Use orderByValue() instead.');\n    }\n    const index = new PathIndex(parsedPath);\n    const newParams = queryParamsOrderBy(query._queryParams, index);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(query._repo, query._path, newParams, /*orderByCalled=*/true);\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 */\nfunction orderByChild(path) {\n  if (path === '$key') {\n    throw new Error('orderByChild: \"$key\" is invalid.  Use orderByKey() instead.');\n  } else if (path === '$priority') {\n    throw new Error('orderByChild: \"$priority\" is invalid.  Use orderByPriority() instead.');\n  } else if (path === '$value') {\n    throw new Error('orderByChild: \"$value\" is invalid.  Use orderByValue() instead.');\n  }\n  validatePathString('orderByChild', 'path', path, false);\n  return new QueryOrderByChildConstraint(path);\n}\nclass QueryOrderByKeyConstraint extends QueryConstraint {\n  constructor() {\n    super(...arguments);\n    this.type = 'orderByKey';\n  }\n  _apply(query) {\n    validateNoPreviousOrderByCall(query, 'orderByKey');\n    const newParams = queryParamsOrderBy(query._queryParams, KEY_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(query._repo, query._path, newParams, /*orderByCalled=*/true);\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 */\nfunction orderByKey() {\n  return new QueryOrderByKeyConstraint();\n}\nclass QueryOrderByPriorityConstraint extends QueryConstraint {\n  constructor() {\n    super(...arguments);\n    this.type = 'orderByPriority';\n  }\n  _apply(query) {\n    validateNoPreviousOrderByCall(query, 'orderByPriority');\n    const newParams = queryParamsOrderBy(query._queryParams, PRIORITY_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(query._repo, query._path, newParams, /*orderByCalled=*/true);\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 */\nfunction orderByPriority() {\n  return new QueryOrderByPriorityConstraint();\n}\nclass QueryOrderByValueConstraint extends QueryConstraint {\n  constructor() {\n    super(...arguments);\n    this.type = 'orderByValue';\n  }\n  _apply(query) {\n    validateNoPreviousOrderByCall(query, 'orderByValue');\n    const newParams = queryParamsOrderBy(query._queryParams, VALUE_INDEX);\n    validateQueryEndpoints(newParams);\n    return new QueryImpl(query._repo, query._path, newParams, /*orderByCalled=*/true);\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 */\nfunction orderByValue() {\n  return new QueryOrderByValueConstraint();\n}\nclass QueryEqualToValueConstraint extends QueryConstraint {\n  constructor(_value, _key) {\n    super();\n    this._value = _value;\n    this._key = _key;\n    this.type = 'equalTo';\n  }\n  _apply(query) {\n    validateFirebaseDataArg('equalTo', this._value, query._path, false);\n    if (query._queryParams.hasStart()) {\n      throw new Error('equalTo: Starting point was already set (by another call to startAt/startAfter or ' + 'equalTo).');\n    }\n    if (query._queryParams.hasEnd()) {\n      throw new Error('equalTo: Ending point was already set (by another call to endAt/endBefore or ' + 'equalTo).');\n    }\n    return new QueryEndAtConstraint(this._value, this._key)._apply(new QueryStartAtConstraint(this._value, this._key)._apply(query));\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 */\nfunction equalTo(value, key) {\n  validateKey('equalTo', 'key', key, true);\n  return new QueryEqualToValueConstraint(value, key);\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 */\nfunction query(query, ...queryConstraints) {\n  let queryImpl = getModularInstance(query);\n  for (const constraint of queryConstraints) {\n    queryImpl = constraint._apply(queryImpl);\n  }\n  return queryImpl;\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/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * 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 * Creates and caches `Repo` instances.\n */\nconst repos = {};\n/**\n * If true, any new `Repo` will be created to use `ReadonlyRestClient` (for testing purposes).\n */\nlet useRestClient = false;\n/**\n * Update an existing `Repo` in place to point to a new host/port.\n */\nfunction repoManagerApplyEmulatorSettings(repo, host, port, tokenProvider) {\n  repo.repoInfo_ = new RepoInfo(`${host}:${port}`, /* secure= */false, repo.repoInfo_.namespace, repo.repoInfo_.webSocketOnly, repo.repoInfo_.nodeAdmin, repo.repoInfo_.persistenceKey, repo.repoInfo_.includeNamespaceInQueryParams, /*isUsingEmulator=*/true);\n  if (tokenProvider) {\n    repo.authTokenProvider_ = tokenProvider;\n  }\n}\n/**\n * This function should only ever be called to CREATE a new database instance.\n * @internal\n */\nfunction repoManagerDatabaseFromApp(app, authProvider, appCheckProvider, url, nodeAdmin) {\n  let dbUrl = url || app.options.databaseURL;\n  if (dbUrl === undefined) {\n    if (!app.options.projectId) {\n      fatal(\"Can't determine Firebase Database URL. Be sure to include \" + ' a Project ID when calling firebase.initializeApp().');\n    }\n    log('Using default host for project ', app.options.projectId);\n    dbUrl = `${app.options.projectId}-default-rtdb.firebaseio.com`;\n  }\n  let parsedUrl = parseRepoInfo(dbUrl, nodeAdmin);\n  let repoInfo = parsedUrl.repoInfo;\n  let isEmulator;\n  let dbEmulatorHost = undefined;\n  if (typeof process !== 'undefined' && process.env) {\n    dbEmulatorHost = process.env[FIREBASE_DATABASE_EMULATOR_HOST_VAR];\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  const authTokenProvider = nodeAdmin && isEmulator ? new EmulatorTokenProvider(EmulatorTokenProvider.OWNER) : new FirebaseAuthTokenProvider(app.name, app.options, authProvider);\n  validateUrl('Invalid Firebase Database URL', parsedUrl);\n  if (!pathIsEmpty(parsedUrl.path)) {\n    fatal('Database URL must point to the root of a Firebase Database ' + '(not including a child path).');\n  }\n  const repo = repoManagerCreateRepo(repoInfo, app, authTokenProvider, new AppCheckTokenProvider(app.name, appCheckProvider));\n  return new Database(repo, app);\n}\n/**\n * Remove the repo and make sure it is disconnected.\n *\n */\nfunction repoManagerDeleteRepo(repo, appName) {\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 * 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(repoInfo, app, authTokenProvider, appCheckProvider) {\n  let appRepos = repos[app.name];\n  if (!appRepos) {\n    appRepos = {};\n    repos[app.name] = appRepos;\n  }\n  let repo = appRepos[repoInfo.toURLString()];\n  if (repo) {\n    fatal('Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.');\n  }\n  repo = new Repo(repoInfo, useRestClient, authTokenProvider, appCheckProvider);\n  appRepos[repoInfo.toURLString()] = repo;\n  return repo;\n}\n/**\n * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\n */\nfunction repoManagerForceRestClient(forceRestClient) {\n  useRestClient = forceRestClient;\n}\n/**\n * Class representing a Firebase Realtime Database.\n */\nclass Database {\n  /** @hideconstructor */\n  constructor(_repoInternal, /** The {@link @firebase/app#FirebaseApp} associated with this Realtime Database instance. */\n  app) {\n    this._repoInternal = _repoInternal;\n    this.app = app;\n    /** Represents a `Database` instance. */\n    this['type'] = 'database';\n    /** Track if the instance has been used (root or repo accessed) */\n    this._instanceStarted = false;\n  }\n  get _repo() {\n    if (!this._instanceStarted) {\n      repoStart(this._repoInternal, this.app.options.appId, this.app.options['databaseAuthVariableOverride']);\n      this._instanceStarted = true;\n    }\n    return this._repoInternal;\n  }\n  get _root() {\n    if (!this._rootInternal) {\n      this._rootInternal = new ReferenceImpl(this._repo, newEmptyPath());\n    }\n    return this._rootInternal;\n  }\n  _delete() {\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  _checkNotDeleted(apiName) {\n    if (this._rootInternal === null) {\n      fatal('Cannot call ' + apiName + ' on a deleted database.');\n    }\n  }\n}\nfunction checkTransportInit() {\n  if (TransportManager.IS_TRANSPORT_INITIALIZED) {\n    warn('Transport has already been initialized. Please call this function before calling ref or setting up a listener');\n  }\n}\n/**\n * Force the use of websockets instead of longPolling.\n */\nfunction forceWebSockets() {\n  checkTransportInit();\n  BrowserPollConnection.forceDisallow();\n}\n/**\n * Force the use of longPolling instead of websockets. This will be ignored if websocket protocol is used in databaseURL.\n */\nfunction forceLongPolling() {\n  checkTransportInit();\n  WebSocketConnection.forceDisallow();\n  BrowserPollConnection.forceAllow();\n}\n/**\n * Returns the instance of the Realtime Database SDK that is associated with the provided\n * {@link @firebase/app#FirebaseApp}. Initializes a new instance with default settings if\n * no instance exists or if the existing instance uses 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 */\nfunction getDatabase(app = getApp(), url) {\n  const db = _getProvider(app, 'database').getImmediate({\n    identifier: url\n  });\n  if (!db._instanceStarted) {\n    const emulator = getDefaultEmulatorHostnameAndPort('database');\n    if (emulator) {\n      connectDatabaseEmulator(db, ...emulator);\n    }\n  }\n  return db;\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 */\nfunction connectDatabaseEmulator(db, host, port, options = {}) {\n  db = getModularInstance(db);\n  db._checkNotDeleted('useEmulator');\n  if (db._instanceStarted) {\n    fatal('Cannot call useEmulator() after instance has already been initialized.');\n  }\n  const repo = db._repoInternal;\n  let tokenProvider = undefined;\n  if (repo.repoInfo_.nodeAdmin) {\n    if (options.mockUserToken) {\n      fatal('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    tokenProvider = new EmulatorTokenProvider(EmulatorTokenProvider.OWNER);\n  } else if (options.mockUserToken) {\n    const token = typeof options.mockUserToken === 'string' ? options.mockUserToken : createMockUserToken(options.mockUserToken, db.app.options.projectId);\n    tokenProvider = new EmulatorTokenProvider(token);\n  }\n  // Modify the repo to apply emulator settings\n  repoManagerApplyEmulatorSettings(repo, host, port, tokenProvider);\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 */\nfunction goOffline(db) {\n  db = getModularInstance(db);\n  db._checkNotDeleted('goOffline');\n  repoInterrupt(db._repo);\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 */\nfunction goOnline(db) {\n  db = getModularInstance(db);\n  db._checkNotDeleted('goOnline');\n  repoResume(db._repo);\n}\nfunction enableLogging(logger, persistent) {\n  enableLogging$1(logger, persistent);\n}\n\n/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nfunction registerDatabase(variant) {\n  setSDKVersion(SDK_VERSION$1);\n  _registerComponent(new Component('database', (container, {\n    instanceIdentifier: url\n  }) => {\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(app, authProvider, appCheckProvider, url);\n  }, \"PUBLIC\" /* ComponentType.PUBLIC */).setMultipleInstances(true));\n  registerVersion(name, version, variant);\n  // BUILD_TARGET will be replaced by values like esm2017, cjs2017, etc during the compilation\n  registerVersion(name, version, 'esm2017');\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 */\nconst SERVER_TIMESTAMP = {\n  '.sv': 'timestamp'\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 */\nfunction serverTimestamp() {\n  return SERVER_TIMESTAMP;\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 */\nfunction increment(delta) {\n  return {\n    '.sv': {\n      'increment': delta\n    }\n  };\n}\n\n/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A type for the resolve value of {@link runTransaction}.\n */\nclass TransactionResult {\n  /** @hideconstructor */\n  constructor(/** Whether the transaction was successfully committed. */\n  committed, /** The resulting data snapshot. */\n  snapshot) {\n    this.committed = committed;\n    this.snapshot = snapshot;\n  }\n  /** Returns a JSON-serializable representation of this object. */\n  toJSON() {\n    return {\n      committed: this.committed,\n      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 */\nfunction runTransaction(ref,\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ntransactionUpdate, options) {\n  var _a;\n  ref = getModularInstance(ref);\n  validateWritablePath('Reference.transaction', ref._path);\n  if (ref.key === '.length' || ref.key === '.keys') {\n    throw 'Reference.transaction failed: ' + ref.key + ' is a read-only object.';\n  }\n  const applyLocally = (_a = options === null || options === void 0 ? void 0 : options.applyLocally) !== null && _a !== void 0 ? _a : true;\n  const deferred = new Deferred();\n  const promiseComplete = (error, committed, node) => {\n    let dataSnapshot = null;\n    if (error) {\n      deferred.reject(error);\n    } else {\n      dataSnapshot = new DataSnapshot(node, new ReferenceImpl(ref._repo, ref._path), PRIORITY_INDEX);\n      deferred.resolve(new TransactionResult(committed, dataSnapshot));\n    }\n  };\n  // Add a watch to make sure we get server updates.\n  const unwatcher = onValue(ref, () => {});\n  repoStartTransaction(ref._repo, ref._path, transactionUpdate, promiseComplete, unwatcher, applyLocally);\n  return deferred.promise;\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 */\nPersistentConnection;\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nPersistentConnection.prototype.simpleListen = function (pathString, onComplete) {\n  this.sendRequest('q', {\n    p: pathString\n  }, onComplete);\n};\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nPersistentConnection.prototype.echo = function (data, onEcho) {\n  this.sendRequest('echo', {\n    d: data\n  }, onEcho);\n};\n// RealTimeConnection properties that we use in tests.\nConnection;\n/**\n * @internal\n */\nconst hijackHash = function (newHash) {\n  const oldPut = PersistentConnection.prototype.put;\n  PersistentConnection.prototype.put = function (pathString, data, onComplete, hash) {\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};\nRepoInfo;\n/**\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\n * @internal\n */\nconst forceRestClient = function (forceRestClient) {\n  repoManagerForceRestClient(forceRestClient);\n};\n\n/**\n * @license\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Used by console to create a database based on the app,\n * passed database URL and a custom auth implementation.\n * @internal\n * @param app - A valid FirebaseApp-like object\n * @param url - A valid Firebase databaseURL\n * @param version - custom version e.g. firebase-admin version\n * @param customAppCheckImpl - custom app check implementation\n * @param customAuthImpl - custom auth implementation\n */\nfunction _initStandalone({\n  app,\n  url,\n  version,\n  customAuthImpl,\n  customAppCheckImpl,\n  nodeAdmin = false\n}) {\n  setSDKVersion(version);\n  /**\n   * ComponentContainer('database-standalone') is just a placeholder that doesn't perform\n   * any actual function.\n   */\n  const componentContainer = new ComponentContainer('database-standalone');\n  const authProvider = new Provider('auth-internal', componentContainer);\n  let appCheckProvider;\n  if (customAppCheckImpl) {\n    appCheckProvider = new Provider('app-check-internal', componentContainer);\n    appCheckProvider.setComponent(new Component('app-check-internal', () => customAppCheckImpl, \"PRIVATE\" /* ComponentType.PRIVATE */));\n  }\n  authProvider.setComponent(new Component('auth-internal', () => customAuthImpl, \"PRIVATE\" /* ComponentType.PRIVATE */));\n  return repoManagerDatabaseFromApp(app, authProvider, appCheckProvider, url, nodeAdmin);\n}\n\n/**\n * Firebase Realtime Database\n *\n * @packageDocumentation\n */\nregisterDatabase();\nexport { DataSnapshot, Database, OnDisconnect, QueryConstraint, TransactionResult, QueryImpl as _QueryImpl, QueryParams as _QueryParams, ReferenceImpl as _ReferenceImpl, forceRestClient as _TEST_ACCESS_forceRestClient, hijackHash as _TEST_ACCESS_hijackHash, _initStandalone, repoManagerDatabaseFromApp as _repoManagerDatabaseFromApp, setSDKVersion as _setSDKVersion, validatePathString as _validatePathString, validateWritablePath as _validateWritablePath, child, connectDatabaseEmulator, enableLogging, endAt, endBefore, equalTo, forceLongPolling, forceWebSockets, get, getDatabase, goOffline, goOnline, increment, limitToFirst, limitToLast, off, onChildAdded, onChildChanged, onChildMoved, onChildRemoved, onDisconnect, onValue, orderByChild, orderByKey, orderByPriority, orderByValue, push, query, ref, refFromURL, remove, runTransaction, serverTimestamp, set, setPriority, setWithPriority, startAfter, startAt, update };\n"],"mappings":"wDAmBA,IAAMA,GAAY,CAIhB,YAAa,GAIb,WAAY,GAIZ,YAAa,mBACf,EAqBA,IAAMC,EAAS,SAAUC,EAAWC,EAAS,CAC3C,GAAI,CAACD,EACH,MAAME,GAAeD,CAAO,CAEhC,EAIMC,GAAiB,SAAUD,EAAS,CACxC,OAAO,IAAI,MAAM,sBAAwBH,GAAU,YAAc,6BAA+BG,CAAO,CACzG,EAkBA,IAAME,GAAsB,SAAUC,EAAK,CAEzC,IAAMC,EAAM,CAAC,EACTC,EAAI,EACR,QAAS,EAAI,EAAG,EAAIF,EAAI,OAAQ,IAAK,CACnC,IAAIG,EAAIH,EAAI,WAAW,CAAC,EACpBG,EAAI,IACNF,EAAIC,GAAG,EAAIC,EACFA,EAAI,MACbF,EAAIC,GAAG,EAAIC,GAAK,EAAI,IACpBF,EAAIC,GAAG,EAAIC,EAAI,GAAK,MACVA,EAAI,SAAY,OAAU,EAAI,EAAIH,EAAI,SAAWA,EAAI,WAAW,EAAI,CAAC,EAAI,SAAY,OAE/FG,EAAI,QAAYA,EAAI,OAAW,KAAOH,EAAI,WAAW,EAAE,CAAC,EAAI,MAC5DC,EAAIC,GAAG,EAAIC,GAAK,GAAK,IACrBF,EAAIC,GAAG,EAAIC,GAAK,GAAK,GAAK,IAC1BF,EAAIC,GAAG,EAAIC,GAAK,EAAI,GAAK,IACzBF,EAAIC,GAAG,EAAIC,EAAI,GAAK,MAEpBF,EAAIC,GAAG,EAAIC,GAAK,GAAK,IACrBF,EAAIC,GAAG,EAAIC,GAAK,EAAI,GAAK,IACzBF,EAAIC,GAAG,EAAIC,EAAI,GAAK,IAExB,CACA,OAAOF,CACT,EAOMG,GAAoB,SAAUC,EAAO,CAEzC,IAAMJ,EAAM,CAAC,EACTK,EAAM,EACRH,EAAI,EACN,KAAOG,EAAMD,EAAM,QAAQ,CACzB,IAAME,EAAKF,EAAMC,GAAK,EACtB,GAAIC,EAAK,IACPN,EAAIE,GAAG,EAAI,OAAO,aAAaI,CAAE,UACxBA,EAAK,KAAOA,EAAK,IAAK,CAC/B,IAAMC,EAAKH,EAAMC,GAAK,EACtBL,EAAIE,GAAG,EAAI,OAAO,cAAcI,EAAK,KAAO,EAAIC,EAAK,EAAE,CACzD,SAAWD,EAAK,KAAOA,EAAK,IAAK,CAE/B,IAAMC,EAAKH,EAAMC,GAAK,EAChBG,EAAKJ,EAAMC,GAAK,EAChBI,EAAKL,EAAMC,GAAK,EAChBK,IAAMJ,EAAK,IAAM,IAAMC,EAAK,KAAO,IAAMC,EAAK,KAAO,EAAIC,EAAK,IAAM,MAC1ET,EAAIE,GAAG,EAAI,OAAO,aAAa,OAAUQ,GAAK,GAAG,EACjDV,EAAIE,GAAG,EAAI,OAAO,aAAa,OAAUQ,EAAI,KAAK,CACpD,KAAO,CACL,IAAMH,EAAKH,EAAMC,GAAK,EAChBG,EAAKJ,EAAMC,GAAK,EACtBL,EAAIE,GAAG,EAAI,OAAO,cAAcI,EAAK,KAAO,IAAMC,EAAK,KAAO,EAAIC,EAAK,EAAE,CAC3E,CACF,CACA,OAAOR,EAAI,KAAK,EAAE,CACpB,EAKMW,GAAS,CAIb,eAAgB,KAIhB,eAAgB,KAKhB,sBAAuB,KAKvB,sBAAuB,KAKvB,kBAAmB,iEAInB,IAAI,cAAe,CACjB,OAAO,KAAK,kBAAoB,KAClC,EAIA,IAAI,sBAAuB,CACzB,OAAO,KAAK,kBAAoB,KAClC,EAQA,mBAAoB,OAAO,MAAS,WAUpC,gBAAgBC,EAAOC,EAAS,CAC9B,GAAI,CAAC,MAAM,QAAQD,CAAK,EACtB,MAAM,MAAM,+CAA+C,EAE7D,KAAK,MAAM,EACX,IAAME,EAAgBD,EAAU,KAAK,sBAAwB,KAAK,eAC5DE,EAAS,CAAC,EAChB,QAASC,EAAI,EAAGA,EAAIJ,EAAM,OAAQI,GAAK,EAAG,CACxC,IAAMC,EAAQL,EAAMI,CAAC,EACfE,EAAYF,EAAI,EAAIJ,EAAM,OAC1BO,EAAQD,EAAYN,EAAMI,EAAI,CAAC,EAAI,EACnCI,EAAYJ,EAAI,EAAIJ,EAAM,OAC1BS,EAAQD,EAAYR,EAAMI,EAAI,CAAC,EAAI,EACnCM,EAAWL,GAAS,EACpBM,GAAYN,EAAQ,IAAS,EAAIE,GAAS,EAC5CK,GAAYL,EAAQ,KAAS,EAAIE,GAAS,EAC1CI,EAAWJ,EAAQ,GAClBD,IACHK,EAAW,GACNP,IACHM,EAAW,KAGfT,EAAO,KAAKD,EAAcQ,CAAQ,EAAGR,EAAcS,CAAQ,EAAGT,EAAcU,CAAQ,EAAGV,EAAcW,CAAQ,CAAC,CAChH,CACA,OAAOV,EAAO,KAAK,EAAE,CACvB,EASA,aAAaH,EAAOC,EAAS,CAG3B,OAAI,KAAK,oBAAsB,CAACA,EACvB,KAAKD,CAAK,EAEZ,KAAK,gBAAgBd,GAAoBc,CAAK,EAAGC,CAAO,CACjE,EASA,aAAaD,EAAOC,EAAS,CAG3B,OAAI,KAAK,oBAAsB,CAACA,EACvB,KAAKD,CAAK,EAEZT,GAAkB,KAAK,wBAAwBS,EAAOC,CAAO,CAAC,CACvE,EAgBA,wBAAwBD,EAAOC,EAAS,CACtC,KAAK,MAAM,EACX,IAAMa,EAAgBb,EAAU,KAAK,sBAAwB,KAAK,eAC5DE,EAAS,CAAC,EAChB,QAASC,EAAI,EAAGA,EAAIJ,EAAM,QAAS,CACjC,IAAMK,EAAQS,EAAcd,EAAM,OAAOI,GAAG,CAAC,EAEvCG,EADYH,EAAIJ,EAAM,OACFc,EAAcd,EAAM,OAAOI,CAAC,CAAC,EAAI,EAC3D,EAAEA,EAEF,IAAMK,EADYL,EAAIJ,EAAM,OACFc,EAAcd,EAAM,OAAOI,CAAC,CAAC,EAAI,GAC3D,EAAEA,EAEF,IAAMW,EADYX,EAAIJ,EAAM,OACFc,EAAcd,EAAM,OAAOI,CAAC,CAAC,EAAI,GAE3D,GADA,EAAEA,EACEC,GAAS,MAAQE,GAAS,MAAQE,GAAS,MAAQM,GAAS,KAC9D,MAAM,IAAIC,GAEZ,IAAMN,EAAWL,GAAS,EAAIE,GAAS,EAEvC,GADAJ,EAAO,KAAKO,CAAQ,EAChBD,IAAU,GAAI,CAChB,IAAME,EAAWJ,GAAS,EAAI,IAAOE,GAAS,EAE9C,GADAN,EAAO,KAAKQ,CAAQ,EAChBI,IAAU,GAAI,CAChB,IAAMH,EAAWH,GAAS,EAAI,IAAOM,EACrCZ,EAAO,KAAKS,CAAQ,CACtB,CACF,CACF,CACA,OAAOT,CACT,EAMA,OAAQ,CACN,GAAI,CAAC,KAAK,eAAgB,CACxB,KAAK,eAAiB,CAAC,EACvB,KAAK,eAAiB,CAAC,EACvB,KAAK,sBAAwB,CAAC,EAC9B,KAAK,sBAAwB,CAAC,EAE9B,QAASC,EAAI,EAAGA,EAAI,KAAK,aAAa,OAAQA,IAC5C,KAAK,eAAeA,CAAC,EAAI,KAAK,aAAa,OAAOA,CAAC,EACnD,KAAK,eAAe,KAAK,eAAeA,CAAC,CAAC,EAAIA,EAC9C,KAAK,sBAAsBA,CAAC,EAAI,KAAK,qBAAqB,OAAOA,CAAC,EAClE,KAAK,sBAAsB,KAAK,sBAAsBA,CAAC,CAAC,EAAIA,EAExDA,GAAK,KAAK,kBAAkB,SAC9B,KAAK,eAAe,KAAK,qBAAqB,OAAOA,CAAC,CAAC,EAAIA,EAC3D,KAAK,sBAAsB,KAAK,aAAa,OAAOA,CAAC,CAAC,EAAIA,EAGhE,CACF,CACF,EAIMY,GAAN,cAAsC,KAAM,CAC1C,aAAc,CACZ,MAAM,GAAG,SAAS,EAClB,KAAK,KAAO,yBACd,CACF,EAIMC,GAAe,SAAU9B,EAAK,CAClC,IAAM+B,EAAYhC,GAAoBC,CAAG,EACzC,OAAOY,GAAO,gBAAgBmB,EAAW,EAAI,CAC/C,EAKMC,GAAgC,SAAUhC,EAAK,CAEnD,OAAO8B,GAAa9B,CAAG,EAAE,QAAQ,MAAO,EAAE,CAC5C,EAUMiC,GAAe,SAAUjC,EAAK,CAClC,GAAI,CACF,OAAOY,GAAO,aAAaZ,EAAK,EAAI,CACtC,OAAS,EAAG,CACV,QAAQ,MAAM,wBAAyB,CAAC,CAC1C,CACA,OAAO,IACT,EAqBA,SAASkC,GAASC,EAAO,CACvB,OAAOC,GAAW,OAAWD,CAAK,CACpC,CAeA,SAASC,GAAWC,EAAQC,EAAQ,CAClC,GAAI,EAAEA,aAAkB,QACtB,OAAOA,EAET,OAAQA,EAAO,YAAa,CAC1B,KAAK,KAGH,IAAMC,EAAYD,EAClB,OAAO,IAAI,KAAKC,EAAU,QAAQ,CAAC,EACrC,KAAK,OACCF,IAAW,SACbA,EAAS,CAAC,GAEZ,MACF,KAAK,MAEHA,EAAS,CAAC,EACV,MACF,QAEE,OAAOC,CACX,CACA,QAAWE,KAAQF,EAEb,CAACA,EAAO,eAAeE,CAAI,GAAK,CAACC,GAAWD,CAAI,IAGpDH,EAAOG,CAAI,EAAIJ,GAAWC,EAAOG,CAAI,EAAGF,EAAOE,CAAI,CAAC,GAEtD,OAAOH,CACT,CACA,SAASI,GAAWC,EAAK,CACvB,OAAOA,IAAQ,WACjB,CAuBA,SAASC,IAAY,CACnB,GAAI,OAAO,KAAS,IAClB,OAAO,KAET,GAAI,OAAO,OAAW,IACpB,OAAO,OAET,GAAI,OAAO,OAAW,IACpB,OAAO,OAET,MAAM,IAAI,MAAM,iCAAiC,CACnD,CAkBA,IAAMC,GAAwB,IAAMD,GAAU,EAAE,sBAS1CE,GAA6B,IAAM,CACvC,GAAI,OAAO,QAAY,KAAe,OAAO,QAAQ,IAAQ,IAC3D,OAEF,IAAMC,EAAqB,QAAQ,IAAI,sBACvC,GAAIA,EACF,OAAO,KAAK,MAAMA,CAAkB,CAExC,EACMC,GAAwB,IAAM,CAClC,GAAI,OAAO,SAAa,IACtB,OAEF,IAAIC,EACJ,GAAI,CACFA,EAAQ,SAAS,OAAO,MAAM,+BAA+B,CAC/D,MAAY,CAGV,MACF,CACA,IAAMC,EAAUD,GAASf,GAAae,EAAM,CAAC,CAAC,EAC9C,OAAOC,GAAW,KAAK,MAAMA,CAAO,CACtC,EAQMC,GAAc,IAAM,CACxB,GAAI,CACF,OAAON,GAAsB,GAAKC,GAA2B,GAAKE,GAAsB,CAC1F,OAASI,EAAG,CAOV,QAAQ,KAAK,+CAA+CA,CAAC,EAAE,EAC/D,MACF,CACF,EAOMC,GAAyBC,GAAe,CAC5C,IAAIC,EAAIC,EACR,OAAQA,GAAMD,EAAKJ,GAAY,KAAO,MAAQI,IAAO,OAAS,OAASA,EAAG,iBAAmB,MAAQC,IAAO,OAAS,OAASA,EAAGF,CAAW,CAC9I,EAOMG,GAAoCH,GAAe,CACvD,IAAMI,EAAOL,GAAuBC,CAAW,EAC/C,GAAI,CAACI,EACH,OAEF,IAAMC,EAAiBD,EAAK,YAAY,GAAG,EAC3C,GAAIC,GAAkB,GAAKA,EAAiB,IAAMD,EAAK,OACrD,MAAM,IAAI,MAAM,gBAAgBA,CAAI,sCAAsC,EAG5E,IAAME,EAAO,SAASF,EAAK,UAAUC,EAAiB,CAAC,EAAG,EAAE,EAC5D,OAAID,EAAK,CAAC,IAAM,IAEP,CAACA,EAAK,UAAU,EAAGC,EAAiB,CAAC,EAAGC,CAAI,EAE5C,CAACF,EAAK,UAAU,EAAGC,CAAc,EAAGC,CAAI,CAEnD,EAKMC,GAAsB,IAAM,CAChC,IAAIN,EACJ,OAAQA,EAAKJ,GAAY,KAAO,MAAQI,IAAO,OAAS,OAASA,EAAG,MACtE,EAMMO,GAAyBC,GAAQ,CACrC,IAAIR,EACJ,OAAQA,EAAKJ,GAAY,KAAO,MAAQI,IAAO,OAAS,OAASA,EAAG,IAAIQ,CAAI,EAAE,CAChF,EAkBA,IAAMC,EAAN,KAAe,CACb,aAAc,CACZ,KAAK,OAAS,IAAM,CAAC,EACrB,KAAK,QAAU,IAAM,CAAC,EACtB,KAAK,QAAU,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC9C,KAAK,QAAUD,EACf,KAAK,OAASC,CAChB,CAAC,CACH,CAMA,aAAaC,EAAU,CACrB,MAAO,CAACC,EAAOhC,IAAU,CACnBgC,EACF,KAAK,OAAOA,CAAK,EAEjB,KAAK,QAAQhC,CAAK,EAEhB,OAAO+B,GAAa,aAGtB,KAAK,QAAQ,MAAM,IAAM,CAAC,CAAC,EAGvBA,EAAS,SAAW,EACtBA,EAASC,CAAK,EAEdD,EAASC,EAAOhC,CAAK,EAG3B,CACF,CACF,EAkBA,SAASiC,GAAoBC,EAAOC,EAAW,CAC7C,GAAID,EAAM,IACR,MAAM,IAAI,MAAM,8GAA8G,EAGhI,IAAME,EAAS,CACb,IAAK,OACL,KAAM,KACR,EACMC,EAAUF,GAAa,eACvBG,EAAMJ,EAAM,KAAO,EACnBK,EAAML,EAAM,KAAOA,EAAM,QAC/B,GAAI,CAACK,EACH,MAAM,IAAI,MAAM,sDAAsD,EAExE,IAAMC,EAAU,OAAO,OAAO,CAE5B,IAAK,kCAAkCH,CAAO,GAC9C,IAAKA,EACL,IAAAC,EACA,IAAKA,EAAM,KACX,UAAWA,EACX,IAAAC,EACA,QAASA,EACT,SAAU,CACR,iBAAkB,SAClB,WAAY,CAAC,CACf,CACF,EAAGL,CAAK,EAGR,MAAO,CAACrC,GAA8B,KAAK,UAAUuC,CAAM,CAAC,EAAGvC,GAA8B,KAAK,UAAU2C,CAAO,CAAC,EADlG,EAC8G,EAAE,KAAK,GAAG,CAC5I,CAsBA,SAASC,IAAQ,CACf,OAAI,OAAO,UAAc,KAAe,OAAO,UAAU,WAAiB,SACjE,UAAU,UAEV,EAEX,CAQA,SAASC,IAAkB,CACzB,OAAO,OAAO,OAAW,KAGzB,CAAC,EAAE,OAAO,SAAc,OAAO,UAAe,OAAO,WAAgB,oDAAoD,KAAKD,GAAM,CAAC,CACvI,CAuCA,SAASE,IAAqB,CAC5B,OAAO,OAAO,UAAc,KAAe,UAAU,YAAc,oBACrE,CACA,SAASC,IAAqB,CAC5B,IAAMC,EAAU,OAAO,QAAW,SAAW,OAAO,QAAU,OAAO,SAAY,SAAW,QAAQ,QAAU,OAC9G,OAAO,OAAOA,GAAY,UAAYA,EAAQ,KAAO,MACvD,CAMA,SAASC,IAAgB,CACvB,OAAO,OAAO,WAAc,UAAY,UAAU,UAAe,aACnE,CAmBA,SAASC,GAAY,CACnB,OAAOC,GAAU,cAAgB,IAAQA,GAAU,aAAe,EACpE,CASA,SAASC,IAAuB,CAC9B,GAAI,CACF,OAAO,OAAO,WAAc,QAC9B,MAAY,CACV,MAAO,EACT,CACF,CAQA,SAASC,IAA4B,CACnC,OAAO,IAAI,QAAQ,CAACC,EAASC,IAAW,CACtC,GAAI,CACF,IAAIC,EAAW,GACTC,EAAgB,0DAChBC,EAAU,KAAK,UAAU,KAAKD,CAAa,EACjDC,EAAQ,UAAY,IAAM,CACxBA,EAAQ,OAAO,MAAM,EAEhBF,GACH,KAAK,UAAU,eAAeC,CAAa,EAE7CH,EAAQ,EAAI,CACd,EACAI,EAAQ,gBAAkB,IAAM,CAC9BF,EAAW,EACb,EACAE,EAAQ,QAAU,IAAM,CACtB,IAAIC,EACJJ,IAASI,EAAKD,EAAQ,SAAW,MAAQC,IAAO,OAAS,OAASA,EAAG,UAAY,EAAE,CACrF,CACF,OAASC,EAAO,CACdL,EAAOK,CAAK,CACd,CACF,CAAC,CACH,CAqEA,IAAMC,GAAa,gBAGbC,GAAN,MAAMC,UAAsB,KAAM,CAChC,YACAC,EAAMC,EACNC,EAAY,CACV,MAAMD,CAAO,EACb,KAAK,KAAOD,EACZ,KAAK,WAAaE,EAElB,KAAK,KAAOL,GAKZ,OAAO,eAAe,KAAME,EAAc,SAAS,EAG/C,MAAM,mBACR,MAAM,kBAAkB,KAAMI,GAAa,UAAU,MAAM,CAE/D,CACF,EACMA,GAAN,KAAmB,CACjB,YAAYC,EAASC,EAAaC,EAAQ,CACxC,KAAK,QAAUF,EACf,KAAK,YAAcC,EACnB,KAAK,OAASC,CAChB,CACA,OAAON,KAASO,EAAM,CACpB,IAAML,EAAaK,EAAK,CAAC,GAAK,CAAC,EACzBC,EAAW,GAAG,KAAK,OAAO,IAAIR,CAAI,GAClCS,EAAW,KAAK,OAAOT,CAAI,EAC3BC,EAAUQ,EAAWC,GAAgBD,EAAUP,CAAU,EAAI,QAE7DS,EAAc,GAAG,KAAK,WAAW,KAAKV,CAAO,KAAKO,CAAQ,KAEhE,OADc,IAAIV,GAAcU,EAAUG,EAAaT,CAAU,CAEnE,CACF,EACA,SAASQ,GAAgBD,EAAUF,EAAM,CACvC,OAAOE,EAAS,QAAQG,GAAS,CAACC,EAAGC,IAAQ,CAC3C,IAAMC,EAAQR,EAAKO,CAAG,EACtB,OAAOC,GAAS,KAAO,OAAOA,CAAK,EAAI,IAAID,CAAG,IAChD,CAAC,CACH,CACA,IAAMF,GAAU,gBAwBhB,SAASI,GAASC,EAAK,CACrB,OAAO,KAAK,MAAMA,CAAG,CACvB,CAMA,SAASC,EAAUX,EAAM,CACvB,OAAO,KAAK,UAAUA,CAAI,CAC5B,CAyBA,IAAMY,GAAS,SAAUC,EAAO,CAC9B,IAAIC,EAAS,CAAC,EACZC,EAAS,CAAC,EACVf,EAAO,CAAC,EACRgB,EAAY,GACd,GAAI,CACF,IAAMC,EAAQJ,EAAM,MAAM,GAAG,EAC7BC,EAASL,GAASS,GAAaD,EAAM,CAAC,CAAC,GAAK,EAAE,EAC9CF,EAASN,GAASS,GAAaD,EAAM,CAAC,CAAC,GAAK,EAAE,EAC9CD,EAAYC,EAAM,CAAC,EACnBjB,EAAOe,EAAO,GAAQ,CAAC,EACvB,OAAOA,EAAO,CAChB,MAAY,CAAC,CACb,MAAO,CACL,OAAAD,EACA,OAAAC,EACA,KAAAf,EACA,UAAAgB,CACF,CACF,EAkDA,IAAMG,GAAgB,SAAUC,EAAO,CACrC,IAAMC,EAAUC,GAAOF,CAAK,EAC1BG,EAASF,EAAQ,OACnB,MAAO,CAAC,CAACE,GAAU,OAAOA,GAAW,UAAYA,EAAO,eAAe,KAAK,CAC9E,EAQMC,GAAU,SAAUJ,EAAO,CAC/B,IAAMG,EAASD,GAAOF,CAAK,EAAE,OAC7B,OAAO,OAAOG,GAAW,UAAYA,EAAO,QAAa,EAC3D,EAkBA,SAASE,EAASC,EAAKC,EAAK,CAC1B,OAAO,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAG,CACtD,CACA,SAASC,GAAQF,EAAKC,EAAK,CACzB,GAAI,OAAO,UAAU,eAAe,KAAKD,EAAKC,CAAG,EAC/C,OAAOD,EAAIC,CAAG,CAIlB,CACA,SAASE,GAAQH,EAAK,CACpB,QAAWC,KAAOD,EAChB,GAAI,OAAO,UAAU,eAAe,KAAKA,EAAKC,CAAG,EAC/C,MAAO,GAGX,MAAO,EACT,CACA,SAASG,GAAIJ,EAAKK,EAAIC,EAAY,CAChC,IAAMC,EAAM,CAAC,EACb,QAAWN,KAAOD,EACZ,OAAO,UAAU,eAAe,KAAKA,EAAKC,CAAG,IAC/CM,EAAIN,CAAG,EAAII,EAAG,KAAKC,EAAYN,EAAIC,CAAG,EAAGA,EAAKD,CAAG,GAGrD,OAAOO,CACT,CAIA,SAASC,GAAUC,EAAGC,EAAG,CACvB,GAAID,IAAMC,EACR,MAAO,GAET,IAAMC,EAAQ,OAAO,KAAKF,CAAC,EACrBG,EAAQ,OAAO,KAAKF,CAAC,EAC3B,QAAWG,KAAKF,EAAO,CACrB,GAAI,CAACC,EAAM,SAASC,CAAC,EACnB,MAAO,GAET,IAAMC,EAAQL,EAAEI,CAAC,EACXE,EAAQL,EAAEG,CAAC,EACjB,GAAIG,GAASF,CAAK,GAAKE,GAASD,CAAK,GACnC,GAAI,CAACP,GAAUM,EAAOC,CAAK,EACzB,MAAO,WAEAD,IAAUC,EACnB,MAAO,EAEX,CACA,QAAWF,KAAKD,EACd,GAAI,CAACD,EAAM,SAASE,CAAC,EACnB,MAAO,GAGX,MAAO,EACT,CACA,SAASG,GAASC,EAAO,CACvB,OAAOA,IAAU,MAAQ,OAAOA,GAAU,QAC5C,CAkDA,SAASC,GAAYC,EAAmB,CACtC,IAAMC,EAAS,CAAC,EAChB,OAAW,CAACC,EAAKC,CAAK,IAAK,OAAO,QAAQH,CAAiB,EACrD,MAAM,QAAQG,CAAK,EACrBA,EAAM,QAAQC,GAAY,CACxBH,EAAO,KAAK,mBAAmBC,CAAG,EAAI,IAAM,mBAAmBE,CAAQ,CAAC,CAC1E,CAAC,EAEDH,EAAO,KAAK,mBAAmBC,CAAG,EAAI,IAAM,mBAAmBC,CAAK,CAAC,EAGzE,OAAOF,EAAO,OAAS,IAAMA,EAAO,KAAK,GAAG,EAAI,EAClD,CAmEA,IAAMI,GAAN,KAAW,CACT,aAAc,CAMZ,KAAK,OAAS,CAAC,EAKf,KAAK,KAAO,CAAC,EAMb,KAAK,GAAK,CAAC,EAKX,KAAK,KAAO,CAAC,EAIb,KAAK,OAAS,EAId,KAAK,OAAS,EACd,KAAK,UAAY,IAAM,EACvB,KAAK,KAAK,CAAC,EAAI,IACf,QAASC,EAAI,EAAGA,EAAI,KAAK,UAAW,EAAEA,EACpC,KAAK,KAAKA,CAAC,EAAI,EAEjB,KAAK,MAAM,CACb,CACA,OAAQ,CACN,KAAK,OAAO,CAAC,EAAI,WACjB,KAAK,OAAO,CAAC,EAAI,WACjB,KAAK,OAAO,CAAC,EAAI,WACjB,KAAK,OAAO,CAAC,EAAI,UACjB,KAAK,OAAO,CAAC,EAAI,WACjB,KAAK,OAAS,EACd,KAAK,OAAS,CAChB,CAOA,UAAUC,EAAKC,EAAQ,CAChBA,IACHA,EAAS,GAEX,IAAMC,EAAI,KAAK,GAEf,GAAI,OAAOF,GAAQ,SACjB,QAASD,EAAI,EAAGA,EAAI,GAAIA,IAStBG,EAAEH,CAAC,EAAIC,EAAI,WAAWC,CAAM,GAAK,GAAKD,EAAI,WAAWC,EAAS,CAAC,GAAK,GAAKD,EAAI,WAAWC,EAAS,CAAC,GAAK,EAAID,EAAI,WAAWC,EAAS,CAAC,EACpIA,GAAU,MAGZ,SAASF,EAAI,EAAGA,EAAI,GAAIA,IACtBG,EAAEH,CAAC,EAAIC,EAAIC,CAAM,GAAK,GAAKD,EAAIC,EAAS,CAAC,GAAK,GAAKD,EAAIC,EAAS,CAAC,GAAK,EAAID,EAAIC,EAAS,CAAC,EACxFA,GAAU,EAId,QAASF,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMI,EAAID,EAAEH,EAAI,CAAC,EAAIG,EAAEH,EAAI,CAAC,EAAIG,EAAEH,EAAI,EAAE,EAAIG,EAAEH,EAAI,EAAE,EACpDG,EAAEH,CAAC,GAAKI,GAAK,EAAIA,IAAM,IAAM,UAC/B,CACA,IAAIC,EAAI,KAAK,OAAO,CAAC,EACjBC,EAAI,KAAK,OAAO,CAAC,EACjBC,EAAI,KAAK,OAAO,CAAC,EACjBC,EAAI,KAAK,OAAO,CAAC,EACjBC,EAAI,KAAK,OAAO,CAAC,EACjBC,EAAGC,EAEP,QAASX,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACvBA,EAAI,GACFA,EAAI,IACNU,EAAIF,EAAIF,GAAKC,EAAIC,GACjBG,EAAI,aAEJD,EAAIJ,EAAIC,EAAIC,EACZG,EAAI,YAGFX,EAAI,IACNU,EAAIJ,EAAIC,EAAIC,GAAKF,EAAIC,GACrBI,EAAI,aAEJD,EAAIJ,EAAIC,EAAIC,EACZG,EAAI,YAGR,IAAMP,GAAKC,GAAK,EAAIA,IAAM,IAAMK,EAAID,EAAIE,EAAIR,EAAEH,CAAC,EAAI,WACnDS,EAAID,EACJA,EAAID,EACJA,GAAKD,GAAK,GAAKA,IAAM,GAAK,WAC1BA,EAAID,EACJA,EAAID,CACN,CACA,KAAK,OAAO,CAAC,EAAI,KAAK,OAAO,CAAC,EAAIC,EAAI,WACtC,KAAK,OAAO,CAAC,EAAI,KAAK,OAAO,CAAC,EAAIC,EAAI,WACtC,KAAK,OAAO,CAAC,EAAI,KAAK,OAAO,CAAC,EAAIC,EAAI,WACtC,KAAK,OAAO,CAAC,EAAI,KAAK,OAAO,CAAC,EAAIC,EAAI,WACtC,KAAK,OAAO,CAAC,EAAI,KAAK,OAAO,CAAC,EAAIC,EAAI,UACxC,CACA,OAAOG,EAAOC,EAAQ,CAEpB,GAAID,GAAS,KACX,OAEEC,IAAW,SACbA,EAASD,EAAM,QAEjB,IAAME,EAAmBD,EAAS,KAAK,UACnCE,EAAI,EAEFd,EAAM,KAAK,KACbe,EAAQ,KAAK,OAEjB,KAAOD,EAAIF,GAAQ,CAKjB,GAAIG,IAAU,EACZ,KAAOD,GAAKD,GACV,KAAK,UAAUF,EAAOG,CAAC,EACvBA,GAAK,KAAK,UAGd,GAAI,OAAOH,GAAU,UACnB,KAAOG,EAAIF,GAIT,GAHAZ,EAAIe,CAAK,EAAIJ,EAAM,WAAWG,CAAC,EAC/B,EAAEC,EACF,EAAED,EACEC,IAAU,KAAK,UAAW,CAC5B,KAAK,UAAUf,CAAG,EAClBe,EAAQ,EAER,KACF,MAGF,MAAOD,EAAIF,GAIT,GAHAZ,EAAIe,CAAK,EAAIJ,EAAMG,CAAC,EACpB,EAAEC,EACF,EAAED,EACEC,IAAU,KAAK,UAAW,CAC5B,KAAK,UAAUf,CAAG,EAClBe,EAAQ,EAER,KACF,CAGN,CACA,KAAK,OAASA,EACd,KAAK,QAAUH,CACjB,CAEA,QAAS,CACP,IAAMI,EAAS,CAAC,EACZC,EAAY,KAAK,OAAS,EAE1B,KAAK,OAAS,GAChB,KAAK,OAAO,KAAK,KAAM,GAAK,KAAK,MAAM,EAEvC,KAAK,OAAO,KAAK,KAAM,KAAK,WAAa,KAAK,OAAS,GAAG,EAG5D,QAASlB,EAAI,KAAK,UAAY,EAAGA,GAAK,GAAIA,IACxC,KAAK,KAAKA,CAAC,EAAIkB,EAAY,IAC3BA,GAAa,IAEf,KAAK,UAAU,KAAK,IAAI,EACxB,IAAIH,EAAI,EACR,QAASf,EAAI,EAAGA,EAAI,EAAGA,IACrB,QAASmB,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BF,EAAOF,CAAC,EAAI,KAAK,OAAOf,CAAC,GAAKmB,EAAI,IAClC,EAAEJ,EAGN,OAAOE,CACT,CACF,EAUA,SAASG,GAAgBC,EAAUC,EAAe,CAChD,IAAMC,EAAQ,IAAIC,GAAcH,EAAUC,CAAa,EACvD,OAAOC,EAAM,UAAU,KAAKA,CAAK,CACnC,CAKA,IAAMC,GAAN,KAAoB,CAMlB,YAAYH,EAAUC,EAAe,CACnC,KAAK,UAAY,CAAC,EAClB,KAAK,aAAe,CAAC,EACrB,KAAK,cAAgB,EAErB,KAAK,KAAO,QAAQ,QAAQ,EAC5B,KAAK,UAAY,GACjB,KAAK,cAAgBA,EAIrB,KAAK,KAAK,KAAK,IAAM,CACnBD,EAAS,IAAI,CACf,CAAC,EAAE,MAAMZ,GAAK,CACZ,KAAK,MAAMA,CAAC,CACd,CAAC,CACH,CACA,KAAKgB,EAAO,CACV,KAAK,gBAAgBC,GAAY,CAC/BA,EAAS,KAAKD,CAAK,CACrB,CAAC,CACH,CACA,MAAME,EAAO,CACX,KAAK,gBAAgBD,GAAY,CAC/BA,EAAS,MAAMC,CAAK,CACtB,CAAC,EACD,KAAK,MAAMA,CAAK,CAClB,CACA,UAAW,CACT,KAAK,gBAAgBD,GAAY,CAC/BA,EAAS,SAAS,CACpB,CAAC,EACD,KAAK,MAAM,CACb,CAOA,UAAUE,EAAgBD,EAAOE,EAAU,CACzC,IAAIH,EACJ,GAAIE,IAAmB,QAAaD,IAAU,QAAaE,IAAa,OACtE,MAAM,IAAI,MAAM,mBAAmB,EAGjCC,GAAqBF,EAAgB,CAAC,OAAQ,QAAS,UAAU,CAAC,EACpEF,EAAWE,EAEXF,EAAW,CACT,KAAME,EACN,MAAAD,EACA,SAAAE,CACF,EAEEH,EAAS,OAAS,SACpBA,EAAS,KAAOK,IAEdL,EAAS,QAAU,SACrBA,EAAS,MAAQK,IAEfL,EAAS,WAAa,SACxBA,EAAS,SAAWK,IAEtB,IAAMC,EAAQ,KAAK,eAAe,KAAK,KAAM,KAAK,UAAU,MAAM,EAIlE,OAAI,KAAK,WAEP,KAAK,KAAK,KAAK,IAAM,CACnB,GAAI,CACE,KAAK,WACPN,EAAS,MAAM,KAAK,UAAU,EAE9BA,EAAS,SAAS,CAEtB,MAAY,CAEZ,CAEF,CAAC,EAEH,KAAK,UAAU,KAAKA,CAAQ,EACrBM,CACT,CAGA,eAAehC,EAAG,CACZ,KAAK,YAAc,QAAa,KAAK,UAAUA,CAAC,IAAM,SAG1D,OAAO,KAAK,UAAUA,CAAC,EACvB,KAAK,eAAiB,EAClB,KAAK,gBAAkB,GAAK,KAAK,gBAAkB,QACrD,KAAK,cAAc,IAAI,EAE3B,CACA,gBAAgBiC,EAAI,CAClB,GAAI,MAAK,UAMT,QAASjC,EAAI,EAAGA,EAAI,KAAK,UAAU,OAAQA,IACzC,KAAK,QAAQA,EAAGiC,CAAE,CAEtB,CAIA,QAAQjC,EAAGiC,EAAI,CAGb,KAAK,KAAK,KAAK,IAAM,CACnB,GAAI,KAAK,YAAc,QAAa,KAAK,UAAUjC,CAAC,IAAM,OACxD,GAAI,CACFiC,EAAG,KAAK,UAAUjC,CAAC,CAAC,CACtB,OAASS,EAAG,CAIN,OAAO,QAAY,KAAe,QAAQ,OAC5C,QAAQ,MAAMA,CAAC,CAEnB,CAEJ,CAAC,CACH,CACA,MAAMyB,EAAK,CACL,KAAK,YAGT,KAAK,UAAY,GACbA,IAAQ,SACV,KAAK,WAAaA,GAIpB,KAAK,KAAK,KAAK,IAAM,CACnB,KAAK,UAAY,OACjB,KAAK,cAAgB,MACvB,CAAC,EACH,CACF,EAiBA,SAASC,GAAqBC,EAAKC,EAAS,CAC1C,GAAI,OAAOD,GAAQ,UAAYA,IAAQ,KACrC,MAAO,GAET,QAAWE,KAAUD,EACnB,GAAIC,KAAUF,GAAO,OAAOA,EAAIE,CAAM,GAAM,WAC1C,MAAO,GAGX,MAAO,EACT,CACA,SAASC,IAAO,CAEhB,CA8CA,SAASC,GAAYC,EAAQC,EAAS,CACpC,MAAO,GAAGD,CAAM,YAAYC,CAAO,YACrC,CAgEA,IAAMC,GAAoB,SAAUC,EAAK,CACvC,IAAMC,EAAM,CAAC,EACTC,EAAI,EACR,QAAS,EAAI,EAAG,EAAIF,EAAI,OAAQ,IAAK,CACnC,IAAIG,EAAIH,EAAI,WAAW,CAAC,EAExB,GAAIG,GAAK,OAAUA,GAAK,MAAQ,CAC9B,IAAMC,EAAOD,EAAI,MACjB,IACAE,EAAO,EAAIL,EAAI,OAAQ,yCAAyC,EAChE,IAAMM,EAAMN,EAAI,WAAW,CAAC,EAAI,MAChCG,EAAI,OAAWC,GAAQ,IAAME,CAC/B,CACIH,EAAI,IACNF,EAAIC,GAAG,EAAIC,EACFA,EAAI,MACbF,EAAIC,GAAG,EAAIC,GAAK,EAAI,IACpBF,EAAIC,GAAG,EAAIC,EAAI,GAAK,KACXA,EAAI,OACbF,EAAIC,GAAG,EAAIC,GAAK,GAAK,IACrBF,EAAIC,GAAG,EAAIC,GAAK,EAAI,GAAK,IACzBF,EAAIC,GAAG,EAAIC,EAAI,GAAK,MAEpBF,EAAIC,GAAG,EAAIC,GAAK,GAAK,IACrBF,EAAIC,GAAG,EAAIC,GAAK,GAAK,GAAK,IAC1BF,EAAIC,GAAG,EAAIC,GAAK,EAAI,GAAK,IACzBF,EAAIC,GAAG,EAAIC,EAAI,GAAK,IAExB,CACA,OAAOF,CACT,EAMMM,GAAe,SAAUP,EAAK,CAClC,IAAIE,EAAI,EACR,QAASM,EAAI,EAAGA,EAAIR,EAAI,OAAQQ,IAAK,CACnC,IAAML,EAAIH,EAAI,WAAWQ,CAAC,EACtBL,EAAI,IACND,IACSC,EAAI,KACbD,GAAK,EACIC,GAAK,OAAUA,GAAK,OAE7BD,GAAK,EACLM,KAEAN,GAAK,CAET,CACA,OAAOA,CACT,EAgCA,IAAMO,GAAmB,EAAI,GAAK,GAAK,IA6FvC,SAASC,EAAmBC,EAAS,CACnC,OAAIA,GAAWA,EAAQ,UACdA,EAAQ,UAERA,CAEX,CCn+DA,IAAMC,EAAN,KAAgB,CAOd,YAAYC,EAAMC,EAAiBC,EAAM,CACvC,KAAK,KAAOF,EACZ,KAAK,gBAAkBC,EACvB,KAAK,KAAOC,EACZ,KAAK,kBAAoB,GAIzB,KAAK,aAAe,CAAC,EACrB,KAAK,kBAAoB,OACzB,KAAK,kBAAoB,IAC3B,CACA,qBAAqBC,EAAM,CACzB,YAAK,kBAAoBA,EAClB,IACT,CACA,qBAAqBC,EAAmB,CACtC,YAAK,kBAAoBA,EAClB,IACT,CACA,gBAAgBC,EAAO,CACrB,YAAK,aAAeA,EACb,IACT,CACA,2BAA2BC,EAAU,CACnC,YAAK,kBAAoBA,EAClB,IACT,CACF,EAkBA,IAAMC,GAAqB,YAsB3B,IAAMC,GAAN,KAAe,CACb,YAAYR,EAAMS,EAAW,CAC3B,KAAK,KAAOT,EACZ,KAAK,UAAYS,EACjB,KAAK,UAAY,KACjB,KAAK,UAAY,IAAI,IACrB,KAAK,kBAAoB,IAAI,IAC7B,KAAK,iBAAmB,IAAI,IAC5B,KAAK,gBAAkB,IAAI,GAC7B,CAKA,IAAIC,EAAY,CAEd,IAAMC,EAAuB,KAAK,4BAA4BD,CAAU,EACxE,GAAI,CAAC,KAAK,kBAAkB,IAAIC,CAAoB,EAAG,CACrD,IAAMC,EAAW,IAAIC,EAErB,GADA,KAAK,kBAAkB,IAAIF,EAAsBC,CAAQ,EACrD,KAAK,cAAcD,CAAoB,GAAK,KAAK,qBAAqB,EAExE,GAAI,CACF,IAAMG,EAAW,KAAK,uBAAuB,CAC3C,mBAAoBH,CACtB,CAAC,EACGG,GACFF,EAAS,QAAQE,CAAQ,CAE7B,MAAY,CAGZ,CAEJ,CACA,OAAO,KAAK,kBAAkB,IAAIH,CAAoB,EAAE,OAC1D,CACA,aAAaI,EAAS,CACpB,IAAIC,EAEJ,IAAML,EAAuB,KAAK,4BAA8EI,GAAQ,UAAU,EAC5HE,GAAYD,EAAuDD,GAAQ,YAAc,MAAQC,IAAO,OAASA,EAAK,GAC5H,GAAI,KAAK,cAAcL,CAAoB,GAAK,KAAK,qBAAqB,EACxE,GAAI,CACF,OAAO,KAAK,uBAAuB,CACjC,mBAAoBA,CACtB,CAAC,CACH,OAASO,EAAG,CACV,GAAID,EACF,OAAO,KAEP,MAAMC,CAEV,KACK,CAEL,GAAID,EACF,OAAO,KAEP,MAAM,MAAM,WAAW,KAAK,IAAI,mBAAmB,CAEvD,CACF,CACA,cAAe,CACb,OAAO,KAAK,SACd,CACA,aAAaE,EAAW,CACtB,GAAIA,EAAU,OAAS,KAAK,KAC1B,MAAM,MAAM,yBAAyBA,EAAU,IAAI,iBAAiB,KAAK,IAAI,GAAG,EAElF,GAAI,KAAK,UACP,MAAM,MAAM,iBAAiB,KAAK,IAAI,4BAA4B,EAIpE,GAFA,KAAK,UAAYA,EAEb,EAAC,KAAK,qBAAqB,EAI/B,IAAIC,GAAiBD,CAAS,EAC5B,GAAI,CACF,KAAK,uBAAuB,CAC1B,mBAAoBZ,EACtB,CAAC,CACH,MAAY,CAKZ,CAKF,OAAW,CAACc,EAAoBC,CAAgB,IAAK,KAAK,kBAAkB,QAAQ,EAAG,CACrF,IAAMX,EAAuB,KAAK,4BAA4BU,CAAkB,EAChF,GAAI,CAEF,IAAMP,EAAW,KAAK,uBAAuB,CAC3C,mBAAoBH,CACtB,CAAC,EACDW,EAAiB,QAAQR,CAAQ,CACnC,MAAY,CAGZ,CACF,EACF,CACA,cAAcJ,EAAaH,GAAoB,CAC7C,KAAK,kBAAkB,OAAOG,CAAU,EACxC,KAAK,iBAAiB,OAAOA,CAAU,EACvC,KAAK,UAAU,OAAOA,CAAU,CAClC,CAGM,QAAS,QAAAa,EAAA,sBACb,IAAMC,EAAW,MAAM,KAAK,KAAK,UAAU,OAAO,CAAC,EACnD,MAAM,QAAQ,IAAI,CAAC,GAAGA,EAAS,OAAOC,GAAW,aAAcA,CAAO,EAErE,IAAIA,GAAWA,EAAQ,SAAS,OAAO,CAAC,EAAG,GAAGD,EAAS,OAAOC,GAAW,YAAaA,CAAO,EAE7F,IAAIA,GAAWA,EAAQ,QAAQ,CAAC,CAAC,CAAC,CACrC,GACA,gBAAiB,CACf,OAAO,KAAK,WAAa,IAC3B,CACA,cAAcf,EAAaH,GAAoB,CAC7C,OAAO,KAAK,UAAU,IAAIG,CAAU,CACtC,CACA,WAAWA,EAAaH,GAAoB,CAC1C,OAAO,KAAK,iBAAiB,IAAIG,CAAU,GAAK,CAAC,CACnD,CACA,WAAWgB,EAAO,CAAC,EAAG,CACpB,GAAM,CACJ,QAAAX,EAAU,CAAC,CACb,EAAIW,EACEf,EAAuB,KAAK,4BAA4Be,EAAK,kBAAkB,EACrF,GAAI,KAAK,cAAcf,CAAoB,EACzC,MAAM,MAAM,GAAG,KAAK,IAAI,IAAIA,CAAoB,gCAAgC,EAElF,GAAI,CAAC,KAAK,eAAe,EACvB,MAAM,MAAM,aAAa,KAAK,IAAI,8BAA8B,EAElE,IAAMG,EAAW,KAAK,uBAAuB,CAC3C,mBAAoBH,EACpB,QAAAI,CACF,CAAC,EAED,OAAW,CAACM,EAAoBC,CAAgB,IAAK,KAAK,kBAAkB,QAAQ,EAAG,CACrF,IAAMK,EAA+B,KAAK,4BAA4BN,CAAkB,EACpFV,IAAyBgB,GAC3BL,EAAiB,QAAQR,CAAQ,CAErC,CACA,OAAOA,CACT,CASA,OAAOR,EAAUI,EAAY,CAC3B,IAAIM,EACJ,IAAML,EAAuB,KAAK,4BAA4BD,CAAU,EAClEkB,GAAqBZ,EAAK,KAAK,gBAAgB,IAAIL,CAAoB,KAAO,MAAQK,IAAO,OAASA,EAAK,IAAI,IACrHY,EAAkB,IAAItB,CAAQ,EAC9B,KAAK,gBAAgB,IAAIK,EAAsBiB,CAAiB,EAChE,IAAMC,EAAmB,KAAK,UAAU,IAAIlB,CAAoB,EAChE,OAAIkB,GACFvB,EAASuB,EAAkBlB,CAAoB,EAE1C,IAAM,CACXiB,EAAkB,OAAOtB,CAAQ,CACnC,CACF,CAKA,sBAAsBQ,EAAUJ,EAAY,CAC1C,IAAMoB,EAAY,KAAK,gBAAgB,IAAIpB,CAAU,EACrD,GAAKoB,EAGL,QAAWxB,KAAYwB,EACrB,GAAI,CACFxB,EAASQ,EAAUJ,CAAU,CAC/B,MAAa,CAEb,CAEJ,CACA,uBAAuB,CACrB,mBAAAW,EACA,QAAAN,EAAU,CAAC,CACb,EAAG,CACD,IAAID,EAAW,KAAK,UAAU,IAAIO,CAAkB,EACpD,GAAI,CAACP,GAAY,KAAK,YACpBA,EAAW,KAAK,UAAU,gBAAgB,KAAK,UAAW,CACxD,mBAAoBiB,GAA8BV,CAAkB,EACpE,QAAAN,CACF,CAAC,EACD,KAAK,UAAU,IAAIM,EAAoBP,CAAQ,EAC/C,KAAK,iBAAiB,IAAIO,EAAoBN,CAAO,EAMrD,KAAK,sBAAsBD,EAAUO,CAAkB,EAMnD,KAAK,UAAU,mBACjB,GAAI,CACF,KAAK,UAAU,kBAAkB,KAAK,UAAWA,EAAoBP,CAAQ,CAC/E,MAAa,CAEb,CAGJ,OAAOA,GAAY,IACrB,CACA,4BAA4BJ,EAAaH,GAAoB,CAC3D,OAAI,KAAK,UACA,KAAK,UAAU,kBAAoBG,EAAaH,GAEhDG,CAEX,CACA,sBAAuB,CACrB,MAAO,CAAC,CAAC,KAAK,WAAa,KAAK,UAAU,oBAAsB,UAClE,CACF,EAEA,SAASqB,GAA8BrB,EAAY,CACjD,OAAOA,IAAeH,GAAqB,OAAYG,CACzD,CACA,SAASU,GAAiBD,EAAW,CACnC,OAAOA,EAAU,oBAAsB,OACzC,CAqBA,IAAMa,GAAN,KAAyB,CACvB,YAAYhC,EAAM,CAChB,KAAK,KAAOA,EACZ,KAAK,UAAY,IAAI,GACvB,CAUA,aAAamB,EAAW,CACtB,IAAMc,EAAW,KAAK,YAAYd,EAAU,IAAI,EAChD,GAAIc,EAAS,eAAe,EAC1B,MAAM,IAAI,MAAM,aAAad,EAAU,IAAI,qCAAqC,KAAK,IAAI,EAAE,EAE7Fc,EAAS,aAAad,CAAS,CACjC,CACA,wBAAwBA,EAAW,CAChB,KAAK,YAAYA,EAAU,IAAI,EACnC,eAAe,GAE1B,KAAK,UAAU,OAAOA,EAAU,IAAI,EAEtC,KAAK,aAAaA,CAAS,CAC7B,CAQA,YAAYnB,EAAM,CAChB,GAAI,KAAK,UAAU,IAAIA,CAAI,EACzB,OAAO,KAAK,UAAU,IAAIA,CAAI,EAGhC,IAAMiC,EAAW,IAAIzB,GAASR,EAAM,IAAI,EACxC,YAAK,UAAU,IAAIA,EAAMiC,CAAQ,EAC1BA,CACT,CACA,cAAe,CACb,OAAO,MAAM,KAAK,KAAK,UAAU,OAAO,CAAC,CAC3C,CACF,ECvXA,IAAMC,GAAY,CAAC,EAYfC,EAAwB,SAAUA,EAAU,CAC9C,OAAAA,EAASA,EAAS,MAAW,CAAC,EAAI,QAClCA,EAASA,EAAS,QAAa,CAAC,EAAI,UACpCA,EAASA,EAAS,KAAU,CAAC,EAAI,OACjCA,EAASA,EAAS,KAAU,CAAC,EAAI,OACjCA,EAASA,EAAS,MAAW,CAAC,EAAI,QAClCA,EAASA,EAAS,OAAY,CAAC,EAAI,SAC5BA,CACT,EAAEA,GAAY,CAAC,CAAC,EACVC,GAAoB,CACxB,MAASD,EAAS,MAClB,QAAWA,EAAS,QACpB,KAAQA,EAAS,KACjB,KAAQA,EAAS,KACjB,MAASA,EAAS,MAClB,OAAUA,EAAS,MACrB,EAIME,GAAkBF,EAAS,KAO3BG,GAAgB,CACpB,CAACH,EAAS,KAAK,EAAG,MAClB,CAACA,EAAS,OAAO,EAAG,MACpB,CAACA,EAAS,IAAI,EAAG,OACjB,CAACA,EAAS,IAAI,EAAG,OACjB,CAACA,EAAS,KAAK,EAAG,OACpB,EAMMI,GAAoB,CAACC,EAAUC,KAAYC,IAAS,CACxD,GAAID,EAAUD,EAAS,SACrB,OAEF,IAAMG,EAAM,IAAI,KAAK,EAAE,YAAY,EAC7BC,EAASN,GAAcG,CAAO,EACpC,GAAIG,EACF,QAAQA,CAAM,EAAE,IAAID,CAAG,MAAMH,EAAS,IAAI,IAAK,GAAGE,CAAI,MAEtD,OAAM,IAAI,MAAM,8DAA8DD,CAAO,GAAG,CAE5F,EACMI,GAAN,KAAa,CAOX,YAAYC,EAAM,CAChB,KAAK,KAAOA,EAIZ,KAAK,UAAYT,GAKjB,KAAK,YAAcE,GAInB,KAAK,gBAAkB,KAIvBL,GAAU,KAAK,IAAI,CACrB,CACA,IAAI,UAAW,CACb,OAAO,KAAK,SACd,CACA,IAAI,SAASa,EAAK,CAChB,GAAI,EAAEA,KAAOZ,GACX,MAAM,IAAI,UAAU,kBAAkBY,CAAG,4BAA4B,EAEvE,KAAK,UAAYA,CACnB,CAEA,YAAYA,EAAK,CACf,KAAK,UAAY,OAAOA,GAAQ,SAAWX,GAAkBW,CAAG,EAAIA,CACtE,CACA,IAAI,YAAa,CACf,OAAO,KAAK,WACd,CACA,IAAI,WAAWA,EAAK,CAClB,GAAI,OAAOA,GAAQ,WACjB,MAAM,IAAI,UAAU,mDAAmD,EAEzE,KAAK,YAAcA,CACrB,CACA,IAAI,gBAAiB,CACnB,OAAO,KAAK,eACd,CACA,IAAI,eAAeA,EAAK,CACtB,KAAK,gBAAkBA,CACzB,CAIA,SAASL,EAAM,CACb,KAAK,iBAAmB,KAAK,gBAAgB,KAAMP,EAAS,MAAO,GAAGO,CAAI,EAC1E,KAAK,YAAY,KAAMP,EAAS,MAAO,GAAGO,CAAI,CAChD,CACA,OAAOA,EAAM,CACX,KAAK,iBAAmB,KAAK,gBAAgB,KAAMP,EAAS,QAAS,GAAGO,CAAI,EAC5E,KAAK,YAAY,KAAMP,EAAS,QAAS,GAAGO,CAAI,CAClD,CACA,QAAQA,EAAM,CACZ,KAAK,iBAAmB,KAAK,gBAAgB,KAAMP,EAAS,KAAM,GAAGO,CAAI,EACzE,KAAK,YAAY,KAAMP,EAAS,KAAM,GAAGO,CAAI,CAC/C,CACA,QAAQA,EAAM,CACZ,KAAK,iBAAmB,KAAK,gBAAgB,KAAMP,EAAS,KAAM,GAAGO,CAAI,EACzE,KAAK,YAAY,KAAMP,EAAS,KAAM,GAAGO,CAAI,CAC/C,CACA,SAASA,EAAM,CACb,KAAK,iBAAmB,KAAK,gBAAgB,KAAMP,EAAS,MAAO,GAAGO,CAAI,EAC1E,KAAK,YAAY,KAAMP,EAAS,MAAO,GAAGO,CAAI,CAChD,CACF,EChKA,IAAMM,GAAgB,CAACC,EAAQC,IAAiBA,EAAa,KAAKC,GAAKF,aAAkBE,CAAC,EACtFC,GACAC,GAEJ,SAASC,IAAuB,CAC9B,OAAOF,KAAsBA,GAAoB,CAAC,YAAa,eAAgB,SAAU,UAAW,cAAc,EACpH,CAEA,SAASG,IAA0B,CACjC,OAAOF,KAAyBA,GAAuB,CAAC,UAAU,UAAU,QAAS,UAAU,UAAU,SAAU,UAAU,UAAU,kBAAkB,EAC3J,CACA,IAAMG,GAAmB,IAAI,QACvBC,GAAqB,IAAI,QACzBC,GAA2B,IAAI,QAC/BC,GAAiB,IAAI,QACrBC,GAAwB,IAAI,QAClC,SAASC,GAAiBC,EAAS,CACjC,IAAMC,EAAU,IAAI,QAAQ,CAACC,EAASC,IAAW,CAC/C,IAAMC,EAAW,IAAM,CACrBJ,EAAQ,oBAAoB,UAAWK,CAAO,EAC9CL,EAAQ,oBAAoB,QAASM,CAAK,CAC5C,EACMD,EAAU,IAAM,CACpBH,EAAQK,EAAKP,EAAQ,MAAM,CAAC,EAC5BI,EAAS,CACX,EACME,EAAQ,IAAM,CAClBH,EAAOH,EAAQ,KAAK,EACpBI,EAAS,CACX,EACAJ,EAAQ,iBAAiB,UAAWK,CAAO,EAC3CL,EAAQ,iBAAiB,QAASM,CAAK,CACzC,CAAC,EACD,OAAAL,EAAQ,KAAKO,GAAS,CAGhBA,aAAiB,WACnBd,GAAiB,IAAIc,EAAOR,CAAO,CAGvC,CAAC,EAAE,MAAM,IAAM,CAAC,CAAC,EAGjBF,GAAsB,IAAIG,EAASD,CAAO,EACnCC,CACT,CACA,SAASQ,GAA+BC,EAAI,CAE1C,GAAIf,GAAmB,IAAIe,CAAE,EAAG,OAChC,IAAMC,EAAO,IAAI,QAAQ,CAACT,EAASC,IAAW,CAC5C,IAAMC,EAAW,IAAM,CACrBM,EAAG,oBAAoB,WAAYE,CAAQ,EAC3CF,EAAG,oBAAoB,QAASJ,CAAK,EACrCI,EAAG,oBAAoB,QAASJ,CAAK,CACvC,EACMM,EAAW,IAAM,CACrBV,EAAQ,EACRE,EAAS,CACX,EACME,EAAQ,IAAM,CAClBH,EAAOO,EAAG,OAAS,IAAI,aAAa,aAAc,YAAY,CAAC,EAC/DN,EAAS,CACX,EACAM,EAAG,iBAAiB,WAAYE,CAAQ,EACxCF,EAAG,iBAAiB,QAASJ,CAAK,EAClCI,EAAG,iBAAiB,QAASJ,CAAK,CACpC,CAAC,EAEDX,GAAmB,IAAIe,EAAIC,CAAI,CACjC,CACA,IAAIE,GAAgB,CAClB,IAAIC,EAAQC,EAAMC,EAAU,CAC1B,GAAIF,aAAkB,eAAgB,CAEpC,GAAIC,IAAS,OAAQ,OAAOpB,GAAmB,IAAImB,CAAM,EAEzD,GAAIC,IAAS,mBACX,OAAOD,EAAO,kBAAoBlB,GAAyB,IAAIkB,CAAM,EAGvE,GAAIC,IAAS,QACX,OAAOC,EAAS,iBAAiB,CAAC,EAAI,OAAYA,EAAS,YAAYA,EAAS,iBAAiB,CAAC,CAAC,CAEvG,CAEA,OAAOT,EAAKO,EAAOC,CAAI,CAAC,CAC1B,EACA,IAAID,EAAQC,EAAMP,EAAO,CACvB,OAAAM,EAAOC,CAAI,EAAIP,EACR,EACT,EACA,IAAIM,EAAQC,EAAM,CAChB,OAAID,aAAkB,iBAAmBC,IAAS,QAAUA,IAAS,SAC5D,GAEFA,KAAQD,CACjB,CACF,EACA,SAASG,GAAaC,EAAU,CAC9BL,GAAgBK,EAASL,EAAa,CACxC,CACA,SAASM,GAAaC,EAAM,CAI1B,OAAIA,IAAS,YAAY,UAAU,aAAe,EAAE,qBAAsB,eAAe,WAChF,SAAUC,KAAeC,EAAM,CACpC,IAAMZ,EAAKU,EAAK,KAAKG,GAAO,IAAI,EAAGF,EAAY,GAAGC,CAAI,EACtD,OAAA1B,GAAyB,IAAIc,EAAIW,EAAW,KAAOA,EAAW,KAAK,EAAI,CAACA,CAAU,CAAC,EAC5Ed,EAAKG,CAAE,CAChB,EAOEjB,GAAwB,EAAE,SAAS2B,CAAI,EAClC,YAAaE,EAAM,CAGxB,OAAAF,EAAK,MAAMG,GAAO,IAAI,EAAGD,CAAI,EACtBf,EAAKb,GAAiB,IAAI,IAAI,CAAC,CACxC,EAEK,YAAa4B,EAAM,CAGxB,OAAOf,EAAKa,EAAK,MAAMG,GAAO,IAAI,EAAGD,CAAI,CAAC,CAC5C,CACF,CACA,SAASE,GAAuBhB,EAAO,CACrC,OAAI,OAAOA,GAAU,WAAmBW,GAAaX,CAAK,GAGtDA,aAAiB,gBAAgBC,GAA+BD,CAAK,EACrEtB,GAAcsB,EAAOhB,GAAqB,CAAC,EAAU,IAAI,MAAMgB,EAAOK,EAAa,EAEhFL,EACT,CACA,SAASD,EAAKC,EAAO,CAGnB,GAAIA,aAAiB,WAAY,OAAOT,GAAiBS,CAAK,EAG9D,GAAIX,GAAe,IAAIW,CAAK,EAAG,OAAOX,GAAe,IAAIW,CAAK,EAC9D,IAAMiB,EAAWD,GAAuBhB,CAAK,EAG7C,OAAIiB,IAAajB,IACfX,GAAe,IAAIW,EAAOiB,CAAQ,EAClC3B,GAAsB,IAAI2B,EAAUjB,CAAK,GAEpCiB,CACT,CACA,IAAMF,GAASf,GAASV,GAAsB,IAAIU,CAAK,EClJvD,SAASkB,GAAOC,EAAMC,EAAS,CAC7B,QAAAC,EACA,QAAAC,EACA,SAAAC,EACA,WAAAC,CACF,EAAI,CAAC,EAAG,CACN,IAAMC,EAAU,UAAU,KAAKN,EAAMC,CAAO,EACtCM,EAAcC,EAAKF,CAAO,EAChC,OAAIH,GACFG,EAAQ,iBAAiB,gBAAiBG,GAAS,CACjDN,EAAQK,EAAKF,EAAQ,MAAM,EAAGG,EAAM,WAAYA,EAAM,WAAYD,EAAKF,EAAQ,WAAW,EAAGG,CAAK,CACpG,CAAC,EAECP,GACFI,EAAQ,iBAAiB,UAAWG,GAASP,EAE7CO,EAAM,WAAYA,EAAM,WAAYA,CAAK,CAAC,EAE5CF,EAAY,KAAKG,GAAM,CACjBL,GAAYK,EAAG,iBAAiB,QAAS,IAAML,EAAW,CAAC,EAC3DD,GACFM,EAAG,iBAAiB,gBAAiBD,GAASL,EAASK,EAAM,WAAYA,EAAM,WAAYA,CAAK,CAAC,CAErG,CAAC,EAAE,MAAM,IAAM,CAAC,CAAC,EACVF,CACT,CAiBA,IAAMI,GAAc,CAAC,MAAO,SAAU,SAAU,aAAc,OAAO,EAC/DC,GAAe,CAAC,MAAO,MAAO,SAAU,OAAO,EAC/CC,GAAgB,IAAI,IAC1B,SAASC,GAAUC,EAAQC,EAAM,CAC/B,GAAI,EAAED,aAAkB,aAAe,EAAEC,KAAQD,IAAW,OAAOC,GAAS,UAC1E,OAEF,GAAIH,GAAc,IAAIG,CAAI,EAAG,OAAOH,GAAc,IAAIG,CAAI,EAC1D,IAAMC,EAAiBD,EAAK,QAAQ,aAAc,EAAE,EAC9CE,EAAWF,IAASC,EACpBE,EAAUP,GAAa,SAASK,CAAc,EACpD,GAEA,EAAEA,KAAmBC,EAAW,SAAW,gBAAgB,YAAc,EAAEC,GAAWR,GAAY,SAASM,CAAc,GACvH,OAEF,IAAMG,EAAS,SAAgBC,KAAcC,EAAM,QAAAC,EAAA,sBAEjD,IAAMC,EAAK,KAAK,YAAYH,EAAWF,EAAU,YAAc,UAAU,EACrEJ,EAASS,EAAG,MAChB,OAAIN,IAAUH,EAASA,EAAO,MAAMO,EAAK,MAAM,CAAC,IAMxC,MAAM,QAAQ,IAAI,CAACP,EAAOE,CAAc,EAAE,GAAGK,CAAI,EAAGH,GAAWK,EAAG,IAAI,CAAC,GAAG,CAAC,CACrF,IACA,OAAAX,GAAc,IAAIG,EAAMI,CAAM,EACvBA,CACT,CACAK,GAAaC,GAAaC,GAAAC,GAAA,GACrBF,GADqB,CAExB,IAAK,CAACX,EAAQC,EAAMa,IAAaf,GAAUC,EAAQC,CAAI,GAAKU,EAAS,IAAIX,EAAQC,EAAMa,CAAQ,EAC/F,IAAK,CAACd,EAAQC,IAAS,CAAC,CAACF,GAAUC,EAAQC,CAAI,GAAKU,EAAS,IAAIX,EAAQC,CAAI,CAC/E,EAAE,ECjEF,IAAMc,GAAN,KAAgC,CAC9B,YAAYC,EAAW,CACrB,KAAK,UAAYA,CACnB,CAGA,uBAAwB,CAItB,OAHkB,KAAK,UAAU,aAAa,EAG7B,IAAIC,GAAY,CAC/B,GAAIC,GAAyBD,CAAQ,EAAG,CACtC,IAAME,EAAUF,EAAS,aAAa,EACtC,MAAO,GAAGE,EAAQ,OAAO,IAAIA,EAAQ,OAAO,EAC9C,KACE,QAAO,IAEX,CAAC,EAAE,OAAOC,GAAaA,CAAS,EAAE,KAAK,GAAG,CAC5C,CACF,EASA,SAASF,GAAyBD,EAAU,CAC1C,IAAMI,EAAYJ,EAAS,aAAa,EACxC,OAA8DI,GAAU,OAAU,SACpF,CACA,IAAMC,GAAS,gBACTC,GAAY,UAkBlB,IAAMC,GAAS,IAAIC,GAAO,eAAe,EACnCC,GAAS,uBACTC,GAAS,6BACTC,GAAS,sBACTC,GAAS,6BACTC,GAAS,sBACTC,GAAS,iBACTC,GAAS,wBACTC,GAAS,qBACTC,GAAS,yBACTC,GAAS,4BACTC,GAAS,sBACTC,GAAS,6BACTC,GAAS,0BACTC,GAAS,iCACTC,GAAS,sBACTC,GAAS,6BACTC,GAAS,wBACTC,GAAS,+BACTC,GAAS,0BACTC,GAAS,iCACTC,GAAS,oBACTC,GAAS,2BACTC,GAAS,sBACTC,GAAS,qBACTC,GAAS,6BACTC,GAAO,WACPC,GAAU,SAuBhB,IAAMC,GAAqB,YACrBC,GAAsB,CAC1B,CAAChC,EAAM,EAAG,YACV,CAACI,EAAM,EAAG,mBACV,CAACE,EAAM,EAAG,iBACV,CAACD,EAAM,EAAG,wBACV,CAACG,EAAM,EAAG,iBACV,CAACD,EAAM,EAAG,wBACV,CAACE,EAAM,EAAG,YACV,CAACC,EAAM,EAAG,mBACV,CAACC,EAAM,EAAG,YACV,CAACC,EAAM,EAAG,oBACV,CAACC,EAAM,EAAG,mBACV,CAACC,EAAM,EAAG,UACV,CAACC,EAAM,EAAG,iBACV,CAACC,EAAM,EAAG,WACV,CAACC,EAAM,EAAG,kBACV,CAACC,EAAM,EAAG,WACV,CAACC,EAAM,EAAG,kBACV,CAACC,EAAM,EAAG,YACV,CAACC,EAAM,EAAG,mBACV,CAACC,EAAM,EAAG,UACV,CAACC,EAAM,EAAG,iBACV,CAACC,EAAM,EAAG,WACV,CAACC,EAAM,EAAG,kBACV,CAACC,EAAM,EAAG,WACV,CAACE,EAAM,EAAG,kBACV,CAACD,EAAM,EAAG,cACV,UAAW,UAEX,CAACE,EAAI,EAAG,aACV,EAqBA,IAAMI,GAAQ,IAAI,IAIZC,GAAc,IAAI,IAOlBC,GAAc,IAAI,IAMxB,SAASC,GAAcC,EAAKtC,EAAW,CACrC,GAAI,CACFsC,EAAI,UAAU,aAAatC,CAAS,CACtC,OAASuC,EAAG,CACVpC,GAAO,MAAM,aAAaH,EAAU,IAAI,wCAAwCsC,EAAI,IAAI,GAAIC,CAAC,CAC/F,CACF,CAeA,SAASC,GAAmBC,EAAW,CACrC,IAAMC,EAAgBD,EAAU,KAChC,GAAIE,GAAY,IAAID,CAAa,EAC/B,OAAAE,GAAO,MAAM,sDAAsDF,CAAa,GAAG,EAC5E,GAETC,GAAY,IAAID,EAAeD,CAAS,EAExC,QAAWI,KAAOC,GAAM,OAAO,EAC7BC,GAAcF,EAAKJ,CAAS,EAE9B,QAAWO,KAAaC,GAAY,OAAO,EACzCF,GAAcC,EAAWP,CAAS,EAEpC,MAAO,EACT,CAUA,SAASS,GAAaL,EAAKM,EAAM,CAC/B,IAAMC,EAAsBP,EAAI,UAAU,YAAY,WAAW,EAAE,aAAa,CAC9E,SAAU,EACZ,CAAC,EACD,OAAIO,GACGA,EAAoB,iBAAiB,EAErCP,EAAI,UAAU,YAAYM,CAAI,CACvC,CA+BA,SAASE,GAAqBC,EAAK,CACjC,OAAOA,EAAI,WAAa,MAC1B,CA0BA,IAAMC,GAAS,CACZ,SAAiC,6EACjC,eAA6C,iCAC7C,gBAA+C,kFAC/C,cAA2C,kDAC3C,qBAAyD,uCACzD,aAAyC,0EACzC,uBAA6D,6EAC7D,uBAA6D,wDAC7D,WAAqC,gFACrC,UAAmC,qFACnC,UAAqC,mFACrC,aAAyC,sFACzC,sCAA2F,0GAC3F,iCAAiF,2DACpF,EACMC,GAAgB,IAAIC,GAAa,MAAO,WAAYF,EAAM,EAkBhE,IAAMG,GAAN,KAAsB,CACpB,YAAYC,EAASC,EAAQC,EAAW,CACtC,KAAK,WAAa,GAClB,KAAK,SAAW,OAAO,OAAO,CAAC,EAAGF,CAAO,EACzC,KAAK,QAAU,OAAO,OAAO,CAAC,EAAGC,CAAM,EACvC,KAAK,MAAQA,EAAO,KACpB,KAAK,gCAAkCA,EAAO,+BAC9C,KAAK,WAAaC,EAClB,KAAK,UAAU,aAAa,IAAIC,EAAU,MAAO,IAAM,KAAM,QAAmC,CAAC,CACnG,CACA,IAAI,gCAAiC,CACnC,YAAK,eAAe,EACb,KAAK,+BACd,CACA,IAAI,+BAA+BC,EAAK,CACtC,KAAK,eAAe,EACpB,KAAK,gCAAkCA,CACzC,CACA,IAAI,MAAO,CACT,YAAK,eAAe,EACb,KAAK,KACd,CACA,IAAI,SAAU,CACZ,YAAK,eAAe,EACb,KAAK,QACd,CACA,IAAI,QAAS,CACX,YAAK,eAAe,EACb,KAAK,OACd,CACA,IAAI,WAAY,CACd,OAAO,KAAK,UACd,CACA,IAAI,WAAY,CACd,OAAO,KAAK,UACd,CACA,IAAI,UAAUA,EAAK,CACjB,KAAK,WAAaA,CACpB,CAKA,gBAAiB,CACf,GAAI,KAAK,UACP,MAAMP,GAAc,OAAO,cAA0C,CACnE,QAAS,KAAK,KAChB,CAAC,CAEL,CACF,EAsHA,IAAMQ,GAAcC,GACpB,SAASC,GAAcC,EAAUC,EAAY,CAAC,EAAG,CAC/C,IAAIC,EAAUF,EACV,OAAOC,GAAc,WAEvBA,EAAY,CACV,KAFWA,CAGb,GAEF,IAAME,EAAS,OAAO,OAAO,CAC3B,KAAMC,GACN,+BAAgC,EAClC,EAAGH,CAAS,EACNI,EAAOF,EAAO,KACpB,GAAI,OAAOE,GAAS,UAAY,CAACA,EAC/B,MAAMC,GAAc,OAAO,eAA4C,CACrE,QAAS,OAAOD,CAAI,CACtB,CAAC,EAGH,GADAH,IAAYA,EAAUK,GAAoB,GACtC,CAACL,EACH,MAAMI,GAAc,OAAO,YAAsC,EAEnE,IAAME,EAAcC,GAAM,IAAIJ,CAAI,EAClC,GAAIG,EAAa,CAEf,GAAIE,GAAUR,EAASM,EAAY,OAAO,GAAKE,GAAUP,EAAQK,EAAY,MAAM,EACjF,OAAOA,EAEP,MAAMF,GAAc,OAAO,gBAA8C,CACvE,QAASD,CACX,CAAC,CAEL,CACA,IAAMM,EAAY,IAAIC,GAAmBP,CAAI,EAC7C,QAAWQ,KAAaC,GAAY,OAAO,EACzCH,EAAU,aAAaE,CAAS,EAElC,IAAME,EAAS,IAAIC,GAAgBd,EAASC,EAAQQ,CAAS,EAC7D,OAAAF,GAAM,IAAIJ,EAAMU,CAAM,EACfA,CACT,CAyEA,SAASE,GAAOC,EAAOC,GAAoB,CACzC,IAAMC,EAAMC,GAAM,IAAIH,CAAI,EAC1B,GAAI,CAACE,GAAOF,IAASC,IAAsBG,GAAoB,EAC7D,OAAOC,GAAc,EAEvB,GAAI,CAACH,EACH,MAAMI,GAAc,OAAO,SAAgC,CACzD,QAASN,CACX,CAAC,EAEH,OAAOE,CACT,CAKA,SAASK,IAAU,CACjB,OAAO,MAAM,KAAKJ,GAAM,OAAO,CAAC,CAClC,CA4CA,SAASK,GAAgBC,EAAkBC,EAASC,EAAS,CAC3D,IAAIC,EAGJ,IAAIC,GAAWD,EAAKE,GAAoBL,CAAgB,KAAO,MAAQG,IAAO,OAASA,EAAKH,EACxFE,IACFE,GAAW,IAAIF,CAAO,IAExB,IAAMI,EAAkBF,EAAQ,MAAM,OAAO,EACvCG,EAAkBN,EAAQ,MAAM,OAAO,EAC7C,GAAIK,GAAmBC,EAAiB,CACtC,IAAMC,EAAU,CAAC,+BAA+BJ,CAAO,mBAAmBH,CAAO,IAAI,EACjFK,GACFE,EAAQ,KAAK,iBAAiBJ,CAAO,mDAAmD,EAEtFE,GAAmBC,GACrBC,EAAQ,KAAK,KAAK,EAEhBD,GACFC,EAAQ,KAAK,iBAAiBP,CAAO,mDAAmD,EAE1FQ,GAAO,KAAKD,EAAQ,KAAK,GAAG,CAAC,EAC7B,MACF,CACAE,GAAmB,IAAIC,EAAU,GAAGP,CAAO,WAAY,KAAO,CAC5D,QAAAA,EACA,QAAAH,CACF,GAAI,SAAqC,CAAC,CAC5C,CA2CA,IAAMW,GAAU,8BACVC,GAAa,EACbC,GAAa,2BACfC,GAAY,KAChB,SAASC,IAAe,CACtB,OAAKD,KACHA,GAAYE,GAAOL,GAASC,GAAY,CACtC,QAAS,CAACK,EAAIC,IAAe,CAM3B,OAAQA,EAAY,CAClB,IAAK,GACH,GAAI,CACFD,EAAG,kBAAkBJ,EAAU,CACjC,OAASM,EAAG,CAIV,QAAQ,KAAKA,CAAC,CAChB,CACJ,CACF,CACF,CAAC,EAAE,MAAMA,GAAK,CACZ,MAAMC,GAAc,OAAO,WAAoC,CAC7D,qBAAsBD,EAAE,OAC1B,CAAC,CACH,CAAC,GAEIL,EACT,CACA,SAAeO,GAA4BC,EAAK,QAAAC,EAAA,sBAC9C,GAAI,CAEF,IAAMC,GADK,MAAMT,GAAa,GAChB,YAAYF,EAAU,EAC9BY,EAAS,MAAMD,EAAG,YAAYX,EAAU,EAAE,IAAIa,GAAWJ,CAAG,CAAC,EAGnE,aAAME,EAAG,KACFC,CACT,OAAS,EAAG,CACV,GAAI,aAAaE,GACfC,GAAO,KAAK,EAAE,OAAO,MAChB,CACL,IAAMC,EAAcT,GAAc,OAAO,UAAkC,CACzE,qBAA4D,GAAE,OAChE,CAAC,EACDQ,GAAO,KAAKC,EAAY,OAAO,CACjC,CACF,CACF,GACA,SAAeC,GAA2BR,EAAKS,EAAiB,QAAAR,EAAA,sBAC9D,GAAI,CAEF,IAAMC,GADK,MAAMT,GAAa,GAChB,YAAYF,GAAY,WAAW,EAEjD,MADoBW,EAAG,YAAYX,EAAU,EAC3B,IAAIkB,EAAiBL,GAAWJ,CAAG,CAAC,EACtD,MAAME,EAAG,IACX,OAASL,EAAG,CACV,GAAIA,aAAaQ,GACfC,GAAO,KAAKT,EAAE,OAAO,MAChB,CACL,IAAMU,EAAcT,GAAc,OAAO,UAAoC,CAC3E,qBAA4DD,GAAE,OAChE,CAAC,EACDS,GAAO,KAAKC,EAAY,OAAO,CACjC,CACF,CACF,GACA,SAASH,GAAWJ,EAAK,CACvB,MAAO,GAAGA,EAAI,IAAI,IAAIA,EAAI,QAAQ,KAAK,EACzC,CAkBA,IAAMU,GAAmB,KAEnBC,GAAwC,GAAK,GAAK,GAAK,GAAK,IAC5DC,GAAN,KAA2B,CACzB,YAAYC,EAAW,CACrB,KAAK,UAAYA,EAUjB,KAAK,iBAAmB,KACxB,IAAMb,EAAM,KAAK,UAAU,YAAY,KAAK,EAAE,aAAa,EAC3D,KAAK,SAAW,IAAIc,GAAqBd,CAAG,EAC5C,KAAK,wBAA0B,KAAK,SAAS,KAAK,EAAE,KAAKG,IACvD,KAAK,iBAAmBA,EACjBA,EACR,CACH,CAQM,kBAAmB,QAAAF,EAAA,sBACvB,IAAIc,EAAIC,EACR,GAAI,CAIF,IAAMC,EAHiB,KAAK,UAAU,YAAY,iBAAiB,EAAE,aAAa,EAGrD,sBAAsB,EAC7CC,EAAOC,GAAiB,EAU9B,QATMJ,EAAK,KAAK,oBAAsB,MAAQA,IAAO,OAAS,OAASA,EAAG,aAAe,OACvF,KAAK,iBAAmB,MAAM,KAAK,0BAE7BC,EAAK,KAAK,oBAAsB,MAAQA,IAAO,OAAS,OAASA,EAAG,aAAe,OAMvF,KAAK,iBAAiB,wBAA0BE,GAAQ,KAAK,iBAAiB,WAAW,KAAKE,GAAuBA,EAAoB,OAASF,CAAI,EACxJ,QAGA,KAAK,iBAAiB,WAAW,KAAK,CACpC,KAAAA,EACA,MAAAD,CACF,CAAC,EAGH,KAAK,iBAAiB,WAAa,KAAK,iBAAiB,WAAW,OAAOG,GAAuB,CAChG,IAAMC,EAAc,IAAI,KAAKD,EAAoB,IAAI,EAAE,QAAQ,EAE/D,OADY,KAAK,IAAI,EACRC,GAAeV,EAC9B,CAAC,EACM,KAAK,SAAS,UAAU,KAAK,gBAAgB,EACtD,OAASd,EAAG,CACVS,GAAO,KAAKT,CAAC,CACf,CACF,GAQM,qBAAsB,QAAAI,EAAA,sBAC1B,IAAIc,EACJ,GAAI,CAKF,GAJI,KAAK,mBAAqB,OAC5B,MAAM,KAAK,2BAGPA,EAAK,KAAK,oBAAsB,MAAQA,IAAO,OAAS,OAASA,EAAG,aAAe,MAAQ,KAAK,iBAAiB,WAAW,SAAW,EAC3I,MAAO,GAET,IAAMG,EAAOC,GAAiB,EAExB,CACJ,iBAAAG,EACA,cAAAC,CACF,EAAIC,GAA2B,KAAK,iBAAiB,UAAU,EACzDC,EAAeC,GAA8B,KAAK,UAAU,CAChE,QAAS,EACT,WAAYJ,CACd,CAAC,CAAC,EAEF,YAAK,iBAAiB,sBAAwBJ,EAC1CK,EAAc,OAAS,GAEzB,KAAK,iBAAiB,WAAaA,EAInC,MAAM,KAAK,SAAS,UAAU,KAAK,gBAAgB,IAEnD,KAAK,iBAAiB,WAAa,CAAC,EAE/B,KAAK,SAAS,UAAU,KAAK,gBAAgB,GAE7CE,CACT,OAAS5B,EAAG,CACV,OAAAS,GAAO,KAAKT,CAAC,EACN,EACT,CACF,GACF,EACA,SAASsB,IAAmB,CAG1B,OAFc,IAAI,KAAK,EAEV,YAAY,EAAE,UAAU,EAAG,EAAE,CAC5C,CACA,SAASK,GAA2BG,EAAiBC,EAAUlB,GAAkB,CAG/E,IAAMY,EAAmB,CAAC,EAEtBC,EAAgBI,EAAgB,MAAM,EAC1C,QAAWP,KAAuBO,EAAiB,CAEjD,IAAME,EAAiBP,EAAiB,KAAKQ,GAAMA,EAAG,QAAUV,EAAoB,KAAK,EACzF,GAAKS,GAgBH,GAHAA,EAAe,MAAM,KAAKT,EAAoB,IAAI,EAG9CW,GAAWT,CAAgB,EAAIM,EAAS,CAC1CC,EAAe,MAAM,IAAI,EACzB,KACF,UAjBAP,EAAiB,KAAK,CACpB,MAAOF,EAAoB,MAC3B,MAAO,CAACA,EAAoB,IAAI,CAClC,CAAC,EACGW,GAAWT,CAAgB,EAAIM,EAAS,CAG1CN,EAAiB,IAAI,EACrB,KACF,CAYFC,EAAgBA,EAAc,MAAM,CAAC,CACvC,CACA,MAAO,CACL,iBAAAD,EACA,cAAAC,CACF,CACF,CACA,IAAMT,GAAN,KAA2B,CACzB,YAAYd,EAAK,CACf,KAAK,IAAMA,EACX,KAAK,wBAA0B,KAAK,6BAA6B,CACnE,CACM,8BAA+B,QAAAC,EAAA,sBACnC,OAAK+B,GAAqB,EAGjBC,GAA0B,EAAE,KAAK,IAAM,EAAI,EAAE,MAAM,IAAM,EAAK,EAF9D,EAIX,GAIM,MAAO,QAAAhC,EAAA,sBAEX,GADwB,MAAM,KAAK,wBAK5B,CACL,IAAMiC,EAAqB,MAAMnC,GAA4B,KAAK,GAAG,EACrE,OAA4EmC,GAAmB,WACtFA,EAEA,CACL,WAAY,CAAC,CACf,CAEJ,KAZE,OAAO,CACL,WAAY,CAAC,CACf,CAWJ,GAEM,UAAUC,EAAkB,QAAAlC,EAAA,sBAChC,IAAIc,EAEJ,GADwB,MAAM,KAAK,wBAG5B,CACL,IAAMqB,EAA2B,MAAM,KAAK,KAAK,EACjD,OAAO5B,GAA2B,KAAK,IAAK,CAC1C,uBAAwBO,EAAKoB,EAAiB,yBAA2B,MAAQpB,IAAO,OAASA,EAAKqB,EAAyB,sBAC/H,WAAYD,EAAiB,UAC/B,CAAC,CACH,KAPE,OAQJ,GAEM,IAAIA,EAAkB,QAAAlC,EAAA,sBAC1B,IAAIc,EAEJ,GADwB,MAAM,KAAK,wBAG5B,CACL,IAAMqB,EAA2B,MAAM,KAAK,KAAK,EACjD,OAAO5B,GAA2B,KAAK,IAAK,CAC1C,uBAAwBO,EAAKoB,EAAiB,yBAA2B,MAAQpB,IAAO,OAASA,EAAKqB,EAAyB,sBAC/H,WAAY,CAAC,GAAGA,EAAyB,WAAY,GAAGD,EAAiB,UAAU,CACrF,CAAC,CACH,KAPE,OAQJ,GACF,EAMA,SAASJ,GAAWJ,EAAiB,CAEnC,OAAOD,GAEP,KAAK,UAAU,CACb,QAAS,EACT,WAAYC,CACd,CAAC,CAAC,EAAE,MACN,CAkBA,SAASU,GAAuBC,EAAS,CACvCC,GAAmB,IAAIC,EAAU,kBAAmB3B,GAAa,IAAI4B,GAA0B5B,CAAS,EAAG,SAAqC,CAAC,EACjJ0B,GAAmB,IAAIC,EAAU,YAAa3B,GAAa,IAAID,GAAqBC,CAAS,EAAG,SAAqC,CAAC,EAEtI6B,GAAgBC,GAAQC,GAAWN,CAAO,EAE1CI,GAAgBC,GAAQC,GAAW,SAAS,EAE5CF,GAAgB,UAAW,EAAE,CAC/B,CAQAL,GAAuB,EAAE,ECrlCzB,IAAMQ,GAAO,qBACPC,GAAU,SAmBhB,IAAIC,GAAc,GAKlB,SAASC,GAAcF,EAAS,CAC9BC,GAAcD,CAChB,CA2BA,IAAMG,GAAN,KAAwB,CAItB,YAAYC,EAAa,CACvB,KAAK,YAAcA,EAEnB,KAAK,QAAU,WACjB,CAKA,IAAIC,EAAKC,EAAO,CACVA,GAAS,KACX,KAAK,YAAY,WAAW,KAAK,cAAcD,CAAG,CAAC,EAEnD,KAAK,YAAY,QAAQ,KAAK,cAAcA,CAAG,EAAGE,EAAUD,CAAK,CAAC,CAEtE,CAIA,IAAID,EAAK,CACP,IAAMG,EAAY,KAAK,YAAY,QAAQ,KAAK,cAAcH,CAAG,CAAC,EAClE,OAAIG,GAAa,KACR,KAEAC,GAASD,CAAS,CAE7B,CACA,OAAOH,EAAK,CACV,KAAK,YAAY,WAAW,KAAK,cAAcA,CAAG,CAAC,CACrD,CACA,cAAcN,EAAM,CAClB,OAAO,KAAK,QAAUA,CACxB,CACA,UAAW,CACT,OAAO,KAAK,YAAY,SAAS,CACnC,CACF,EAsBA,IAAMW,GAAN,KAAoB,CAClB,aAAc,CACZ,KAAK,OAAS,CAAC,EACf,KAAK,kBAAoB,EAC3B,CACA,IAAIL,EAAKC,EAAO,CACVA,GAAS,KACX,OAAO,KAAK,OAAOD,CAAG,EAEtB,KAAK,OAAOA,CAAG,EAAIC,CAEvB,CACA,IAAID,EAAK,CACP,OAAIM,EAAS,KAAK,OAAQN,CAAG,EACpB,KAAK,OAAOA,CAAG,EAEjB,IACT,CACA,OAAOA,EAAK,CACV,OAAO,KAAK,OAAOA,CAAG,CACxB,CACF,EA2BA,IAAMO,GAAmB,SAAUC,EAAgB,CACjD,GAAI,CAGF,GAAI,OAAO,OAAW,KAAe,OAAO,OAAOA,CAAc,EAAM,IAAa,CAElF,IAAMC,EAAa,OAAOD,CAAc,EACxC,OAAAC,EAAW,QAAQ,oBAAqB,OAAO,EAC/CA,EAAW,WAAW,mBAAmB,EAClC,IAAIX,GAAkBW,CAAU,CACzC,CACF,MAAY,CAAC,CAGb,OAAO,IAAIJ,EACb,EAEMK,GAAoBH,GAAiB,cAAc,EAEnDI,GAAiBJ,GAAiB,gBAAgB,EAkBxD,IAAMK,GAAY,IAAIC,GAAO,oBAAoB,EAI3CC,GAAgB,UAAY,CAChC,IAAIC,EAAK,EACT,OAAO,UAAY,CACjB,OAAOA,GACT,CACF,EAAE,EAMIC,GAAO,SAAUC,EAAK,CAC1B,IAAMC,EAAYC,GAAkBF,CAAG,EACjCD,EAAO,IAAII,GACjBJ,EAAK,OAAOE,CAAS,EACrB,IAAMG,EAAYL,EAAK,OAAO,EAC9B,OAAOM,GAAO,gBAAgBD,CAAS,CACzC,EACME,GAAmB,YAAaC,EAAS,CAC7C,IAAIC,EAAU,GACd,QAASC,EAAI,EAAGA,EAAIF,EAAQ,OAAQE,IAAK,CACvC,IAAMC,EAAMH,EAAQE,CAAC,EACjB,MAAM,QAAQC,CAAG,GAAKA,GAAO,OAAOA,GAAQ,UAEhD,OAAOA,EAAI,QAAW,SACpBF,GAAWF,GAAiB,MAAM,KAAMI,CAAG,EAClC,OAAOA,GAAQ,SACxBF,GAAWvB,EAAUyB,CAAG,EAExBF,GAAWE,EAEbF,GAAW,GACb,CACA,OAAOA,CACT,EAIIG,GAAS,KAITC,GAAY,GAMVC,GAAkB,SAAUC,EAASC,EAAY,CACrDC,EAAO,CAACD,GAAcD,IAAY,IAAQA,IAAY,GAAO,4CAA4C,EACrGA,IAAY,IACdnB,GAAU,SAAWsB,EAAS,QAC9BN,GAAShB,GAAU,IAAI,KAAKA,EAAS,EACjCoB,GACFrB,GAAe,IAAI,kBAAmB,EAAI,GAEnC,OAAOoB,GAAY,WAC5BH,GAASG,GAETH,GAAS,KACTjB,GAAe,OAAO,iBAAiB,EAE3C,EACMwB,EAAM,YAAaX,EAAS,CAOhC,GANIK,KAAc,KAChBA,GAAY,GACRD,KAAW,MAAQjB,GAAe,IAAI,iBAAiB,IAAM,IAC/DmB,GAAgB,EAAI,GAGpBF,GAAQ,CACV,IAAMH,EAAUF,GAAiB,MAAM,KAAMC,CAAO,EACpDI,GAAOH,CAAO,CAChB,CACF,EACMW,GAAa,SAAUC,EAAQ,CACnC,OAAO,YAAab,EAAS,CAC3BW,EAAIE,EAAQ,GAAGb,CAAO,CACxB,CACF,EACMc,GAAQ,YAAad,EAAS,CAClC,IAAMC,EAAU,4BAA8BF,GAAiB,GAAGC,CAAO,EACzEZ,GAAU,MAAMa,CAAO,CACzB,EACMc,EAAQ,YAAaf,EAAS,CAClC,IAAMC,EAAU,yBAAyBF,GAAiB,GAAGC,CAAO,CAAC,GACrE,MAAAZ,GAAU,MAAMa,CAAO,EACjB,IAAI,MAAMA,CAAO,CACzB,EACMe,EAAO,YAAahB,EAAS,CACjC,IAAMC,EAAU,qBAAuBF,GAAiB,GAAGC,CAAO,EAClEZ,GAAU,KAAKa,CAAO,CACxB,EAKMgB,GAAqB,UAAY,CAEjC,OAAO,OAAW,KAAe,OAAO,UAAY,OAAO,SAAS,UAAY,OAAO,SAAS,SAAS,QAAQ,QAAQ,IAAM,IACjID,EAAK,2FAAgG,CAEzG,EAIME,GAAsB,SAAUC,EAAM,CAC1C,OAAO,OAAOA,GAAS,WAAaA,IAASA,GAE7CA,IAAS,OAAO,mBAAqBA,IAAS,OAAO,kBACvD,EACMC,GAAsB,SAAUC,EAAI,CACxC,GAAIC,EAAU,GAAK,SAAS,aAAe,WACzCD,EAAG,MACE,CAGL,IAAIE,EAAS,GACPC,EAAY,UAAY,CAC5B,GAAI,CAAC,SAAS,KAAM,CAClB,WAAWA,EAAW,KAAK,MAAM,EAAE,CAAC,EACpC,MACF,CACKD,IACHA,EAAS,GACTF,EAAG,EAEP,EACI,SAAS,kBACX,SAAS,iBAAiB,mBAAoBG,EAAW,EAAK,EAE9D,OAAO,iBAAiB,OAAQA,EAAW,EAAK,GAEvC,SAAS,cAGlB,SAAS,YAAY,qBAAsB,IAAM,CAC3C,SAAS,aAAe,YAC1BA,EAAU,CAEd,CAAC,EAGD,OAAO,YAAY,SAAUA,CAAS,EAK1C,CACF,EAIMC,GAAW,aAIXC,GAAW,aAIXC,GAAc,SAAUC,EAAGC,EAAG,CAClC,GAAID,IAAMC,EACR,MAAO,GACF,GAAID,IAAMH,IAAYI,IAAMH,GACjC,MAAO,GACF,GAAIG,IAAMJ,IAAYG,IAAMF,GACjC,MAAO,GACF,CACL,IAAMI,EAASC,GAAYH,CAAC,EAC1BI,EAASD,GAAYF,CAAC,EACxB,OAAIC,IAAW,KACTE,IAAW,KACNF,EAASE,IAAW,EAAIJ,EAAE,OAASC,EAAE,OAASC,EAASE,EAEvD,GAEAA,IAAW,KACb,EAEAJ,EAAIC,EAAI,GAAK,CAExB,CACF,EAIMI,GAAgB,SAAUL,EAAGC,EAAG,CACpC,OAAID,IAAMC,EACD,EACED,EAAIC,EACN,GAEA,CAEX,EACMK,GAAa,SAAU1D,EAAK2D,EAAK,CACrC,GAAIA,GAAO3D,KAAO2D,EAChB,OAAOA,EAAI3D,CAAG,EAEd,MAAM,IAAI,MAAM,yBAA2BA,EAAM,gBAAkBE,EAAUyD,CAAG,CAAC,CAErF,EACMC,GAAoB,SAAUD,EAAK,CACvC,GAAI,OAAOA,GAAQ,UAAYA,IAAQ,KACrC,OAAOzD,EAAUyD,CAAG,EAEtB,IAAME,EAAO,CAAC,EAEd,QAAWC,KAAKH,EACdE,EAAK,KAAKC,CAAC,EAGbD,EAAK,KAAK,EACV,IAAI7D,EAAM,IACV,QAAS,EAAI,EAAG,EAAI6D,EAAK,OAAQ,IAC3B,IAAM,IACR7D,GAAO,KAETA,GAAOE,EAAU2D,EAAK,CAAC,CAAC,EACxB7D,GAAO,IACPA,GAAO4D,GAAkBD,EAAIE,EAAK,CAAC,CAAC,CAAC,EAEvC,OAAA7D,GAAO,IACAA,CACT,EAOM+D,GAAoB,SAAU9C,EAAK+C,EAAS,CAChD,IAAMC,EAAMhD,EAAI,OAChB,GAAIgD,GAAOD,EACT,MAAO,CAAC/C,CAAG,EAEb,IAAMiD,EAAW,CAAC,EAClB,QAASC,EAAI,EAAGA,EAAIF,EAAKE,GAAKH,EACxBG,EAAIH,EAAUC,EAChBC,EAAS,KAAKjD,EAAI,UAAUkD,EAAGF,CAAG,CAAC,EAEnCC,EAAS,KAAKjD,EAAI,UAAUkD,EAAGA,EAAIH,CAAO,CAAC,EAG/C,OAAOE,CACT,EAOA,SAASE,EAAKT,EAAKd,EAAI,CACrB,QAAW7C,KAAO2D,EACZA,EAAI,eAAe3D,CAAG,GACxB6C,EAAG7C,EAAK2D,EAAI3D,CAAG,CAAC,CAGtB,CAQA,IAAMqE,GAAwB,SAAUC,EAAG,CACzCrC,EAAO,CAACS,GAAoB4B,CAAC,EAAG,qBAAqB,EACrD,IAAMC,EAAQ,GACZC,EAAQ,GACJC,GAAQ,GAAKF,EAAQ,GAAK,EAC5B,EAAGG,EAAGC,EAAGC,EAAIlD,EAGb4C,IAAM,GACRI,EAAI,EACJC,EAAI,EACJ,EAAI,EAAIL,IAAM,KAAY,EAAI,IAE9B,EAAIA,EAAI,EACRA,EAAI,KAAK,IAAIA,CAAC,EACVA,GAAK,KAAK,IAAI,EAAG,EAAIG,CAAI,GAE3BG,EAAK,KAAK,IAAI,KAAK,MAAM,KAAK,IAAIN,CAAC,EAAI,KAAK,GAAG,EAAGG,CAAI,EACtDC,EAAIE,EAAKH,EACTE,EAAI,KAAK,MAAML,EAAI,KAAK,IAAI,EAAGE,EAAQI,CAAE,EAAI,KAAK,IAAI,EAAGJ,CAAK,CAAC,IAG/DE,EAAI,EACJC,EAAI,KAAK,MAAML,EAAI,KAAK,IAAI,EAAG,EAAIG,EAAOD,CAAK,CAAC,IAIpD,IAAMK,EAAO,CAAC,EACd,IAAKnD,EAAI8C,EAAO9C,EAAGA,GAAK,EACtBmD,EAAK,KAAKF,EAAI,EAAI,EAAI,CAAC,EACvBA,EAAI,KAAK,MAAMA,EAAI,CAAC,EAEtB,IAAKjD,EAAI6C,EAAO7C,EAAGA,GAAK,EACtBmD,EAAK,KAAKH,EAAI,EAAI,EAAI,CAAC,EACvBA,EAAI,KAAK,MAAMA,EAAI,CAAC,EAEtBG,EAAK,KAAK,EAAI,EAAI,CAAC,EACnBA,EAAK,QAAQ,EACb,IAAM5D,EAAM4D,EAAK,KAAK,EAAE,EAEpBC,EAAgB,GACpB,IAAKpD,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAIqD,EAAU,SAAS9D,EAAI,OAAOS,EAAG,CAAC,EAAG,CAAC,EAAE,SAAS,EAAE,EACnDqD,EAAQ,SAAW,IACrBA,EAAU,IAAMA,GAElBD,EAAgBA,EAAgBC,CAClC,CACA,OAAOD,EAAc,YAAY,CACnC,EAKME,GAAiC,UAAY,CACjD,MAAO,CAAC,EAAE,OAAO,QAAW,UAAY,OAAO,QAAa,OAAO,OAAU,WAAgB,CAAC,UAAU,KAAK,OAAO,SAAS,IAAI,EACnI,EAIMC,GAAoB,UAAY,CAEpC,OAAO,OAAO,SAAY,UAAY,OAAO,QAAQ,IAAO,QAC9D,EAIA,SAASC,GAAmBC,EAAMC,EAAO,CACvC,IAAIC,EAAS,gBACTF,IAAS,UACXE,EAAS,0FACAF,IAAS,oBAClBE,EAAS,6DACAF,IAAS,gBAClBE,EAAS,8BAEX,IAAM/C,EAAQ,IAAI,MAAM6C,EAAO,OAASC,EAAM,MAAM,SAAS,EAAI,KAAOC,CAAM,EAE9E,OAAA/C,EAAM,KAAO6C,EAAK,YAAY,EACvB7C,CACT,CAIA,IAAMgD,GAAkB,IAAI,OAAO,mBAAmB,EAIhDC,GAAiB,YAIjBC,GAAiB,WAIjBjC,GAAc,SAAUtC,EAAK,CACjC,GAAIqE,GAAgB,KAAKrE,CAAG,EAAG,CAC7B,IAAMwE,EAAS,OAAOxE,CAAG,EACzB,GAAIwE,GAAUF,IAAkBE,GAAUD,GACxC,OAAOC,CAEX,CACA,OAAO,IACT,EAkBMC,GAAiB,SAAU7C,EAAI,CACnC,GAAI,CACFA,EAAG,CACL,OAAS,EAAG,CAEV,WAAW,IAAM,CAKf,IAAM8C,EAAQ,EAAE,OAAS,GACzB,MAAAnD,EAAK,yCAA0CmD,CAAK,EAC9C,CACR,EAAG,KAAK,MAAM,CAAC,CAAC,CAClB,CACF,EAIMC,GAAe,UAAY,CAM/B,OALkB,OAAO,QAAW,UAAY,OAAO,WAAgB,OAAO,UAAa,WAAgB,IAK1F,OAAO,0FAA0F,GAAK,CACzH,EAUMC,GAAwB,SAAUhD,EAAIiD,EAAM,CAChD,IAAMC,EAAU,WAAWlD,EAAIiD,CAAI,EAEnC,OAAI,OAAOC,GAAY,UAEvB,OAAO,KAAS,KAEhB,KAAK,WAEH,KAAK,WAAWA,CAAO,EAEd,OAAOA,GAAY,UAAYA,EAAQ,OAEhDA,EAAQ,MAAS,EAEZA,CACT,EAqBA,IAAMC,GAAN,KAA4B,CAC1B,YAAYC,EAAUC,EAAkB,CACtC,KAAK,SAAWD,EAChB,KAAK,iBAAmBC,EACxB,KAAK,SAA+EA,GAAiB,aAAa,CAChH,SAAU,EACZ,CAAC,EACI,KAAK,UAC4DA,GAAiB,IAAI,EAAE,KAAKC,GAAY,KAAK,SAAWA,CAAQ,CAExI,CACA,SAASC,EAAc,CACrB,OAAK,KAAK,SAeH,KAAK,SAAS,SAASA,CAAY,EAdjC,IAAI,QAAQ,CAACC,EAASC,IAAW,CAKtC,WAAW,IAAM,CACX,KAAK,SACP,KAAK,SAASF,CAAY,EAAE,KAAKC,EAASC,CAAM,EAEhDD,EAAQ,IAAI,CAEhB,EAAG,CAAC,CACN,CAAC,CAGL,CACA,uBAAuBE,EAAU,CAC/B,IAAIC,GACHA,EAAK,KAAK,oBAAsB,MAAQA,IAAO,QAAkBA,EAAG,IAAI,EAAE,KAAKL,GAAYA,EAAS,iBAAiBI,CAAQ,CAAC,CACjI,CACA,uBAAwB,CACtB/D,EAAK,oDAAoD,KAAK,QAAQ,+EAAoF,CAC5J,CACF,EAqBA,IAAMiE,GAAN,KAAgC,CAC9B,YAAYR,EAAUS,EAAkBC,EAAe,CACrD,KAAK,SAAWV,EAChB,KAAK,iBAAmBS,EACxB,KAAK,cAAgBC,EACrB,KAAK,MAAQ,KACb,KAAK,MAAQA,EAAc,aAAa,CACtC,SAAU,EACZ,CAAC,EACI,KAAK,OACRA,EAAc,OAAOC,GAAQ,KAAK,MAAQA,CAAI,CAElD,CACA,SAASR,EAAc,CACrB,OAAK,KAAK,MAeH,KAAK,MAAM,SAASA,CAAY,EAAE,MAAM9D,GAGzCA,GAASA,EAAM,OAAS,8BAC1BH,EAAI,gEAAgE,EAC7D,MAEA,QAAQ,OAAOG,CAAK,CAE9B,EAvBQ,IAAI,QAAQ,CAAC+D,EAASC,IAAW,CAKtC,WAAW,IAAM,CACX,KAAK,MACP,KAAK,SAASF,CAAY,EAAE,KAAKC,EAASC,CAAM,EAEhDD,EAAQ,IAAI,CAEhB,EAAG,CAAC,CACN,CAAC,CAYL,CACA,uBAAuBE,EAAU,CAG3B,KAAK,MACP,KAAK,MAAM,qBAAqBA,CAAQ,EAExC,KAAK,cAAc,IAAI,EAAE,KAAKK,GAAQA,EAAK,qBAAqBL,CAAQ,CAAC,CAE7E,CACA,0BAA0BA,EAAU,CAClC,KAAK,cAAc,IAAI,EAAE,KAAKK,GAAQA,EAAK,wBAAwBL,CAAQ,CAAC,CAC9E,CACA,uBAAwB,CACtB,IAAIM,EAAe,0DAA4D,KAAK,SAAW,iFAC3F,eAAgB,KAAK,iBACvBA,GAAgB,uJACP,mBAAoB,KAAK,iBAClCA,GAAgB,2JAEhBA,GAAgB,kKAElBrE,EAAKqE,CAAY,CACnB,CACF,EAEIC,IAAsC,IAAM,CAC9C,MAAMA,CAAsB,CAC1B,YAAYC,EAAa,CACvB,KAAK,YAAcA,CACrB,CACA,SAASX,EAAc,CACrB,OAAO,QAAQ,QAAQ,CACrB,YAAa,KAAK,WACpB,CAAC,CACH,CACA,uBAAuBG,EAAU,CAG/BA,EAAS,KAAK,WAAW,CAC3B,CACA,0BAA0BA,EAAU,CAAC,CACrC,uBAAwB,CAAC,CAC3B,CAEAO,EAAsB,MAAQ,QAkB9B,OAAOA,CACT,GAAG,EACGE,GAAmB,IACnBC,GAAgB,IAChBC,GAA0B,IAC1BC,GAAgB,IAChBC,GAAY,IAGZC,GAAkB,6EAClBC,GAAqB,KACrBC,GAAuB,IACvBC,GAAwB,KACxBC,GAAY,YACZC,GAAe,eAqBrB,IAAMC,GAAN,KAAe,CASb,YAAYC,EAAMC,EAAQC,EAAWC,EAAeC,EAAY,GAAOC,EAAiB,GAAIC,EAAgC,GAAOC,EAAkB,GAAO,CAC1J,KAAK,OAASN,EACd,KAAK,UAAYC,EACjB,KAAK,cAAgBC,EACrB,KAAK,UAAYC,EACjB,KAAK,eAAiBC,EACtB,KAAK,8BAAgCC,EACrC,KAAK,gBAAkBC,EACvB,KAAK,MAAQP,EAAK,YAAY,EAC9B,KAAK,QAAU,KAAK,MAAM,OAAO,KAAK,MAAM,QAAQ,GAAG,EAAI,CAAC,EAC5D,KAAK,aAAelH,GAAkB,IAAI,QAAUkH,CAAI,GAAK,KAAK,KACpE,CACA,iBAAkB,CAChB,OAAO,KAAK,aAAa,OAAO,EAAG,CAAC,IAAM,IAC5C,CACA,cAAe,CACb,OAAO,KAAK,UAAY,kBAAoB,KAAK,UAAY,qBAC/D,CACA,IAAI,MAAO,CACT,OAAO,KAAK,KACd,CACA,IAAI,KAAKQ,EAAS,CACZA,IAAY,KAAK,eACnB,KAAK,aAAeA,EAChB,KAAK,gBAAgB,GACvB1H,GAAkB,IAAI,QAAU,KAAK,MAAO,KAAK,YAAY,EAGnE,CACA,UAAW,CACT,IAAIO,EAAM,KAAK,YAAY,EAC3B,OAAI,KAAK,iBACPA,GAAO,IAAM,KAAK,eAAiB,KAE9BA,CACT,CACA,aAAc,CACZ,IAAMoH,EAAW,KAAK,OAAS,WAAa,UACtCjD,EAAQ,KAAK,8BAAgC,OAAO,KAAK,SAAS,GAAK,GAC7E,MAAO,GAAGiD,CAAQ,GAAG,KAAK,IAAI,IAAIjD,CAAK,EACzC,CACF,EACA,SAASkD,GAAwBC,EAAU,CACzC,OAAOA,EAAS,OAASA,EAAS,cAAgBA,EAAS,aAAa,GAAKA,EAAS,6BACxF,CAQA,SAASC,GAAsBD,EAAUE,EAAMC,EAAQ,CACrDzG,EAAO,OAAOwG,GAAS,SAAU,4BAA4B,EAC7DxG,EAAO,OAAOyG,GAAW,SAAU,8BAA8B,EACjE,IAAIC,EACJ,GAAIF,IAAShB,GACXkB,GAAWJ,EAAS,OAAS,SAAW,SAAWA,EAAS,aAAe,gBAClEE,IAASf,GAClBiB,GAAWJ,EAAS,OAAS,WAAa,WAAaA,EAAS,aAAe,YAE/E,OAAM,IAAI,MAAM,4BAA8BE,CAAI,EAEhDH,GAAwBC,CAAQ,IAClCG,EAAO,GAAQH,EAAS,WAE1B,IAAMK,EAAQ,CAAC,EACf,OAAAxE,EAAKsE,EAAQ,CAAC1I,EAAKC,IAAU,CAC3B2I,EAAM,KAAK5I,EAAM,IAAMC,CAAK,CAC9B,CAAC,EACM0I,EAAUC,EAAM,KAAK,GAAG,CACjC,CAqBA,IAAMC,GAAN,KAAsB,CACpB,aAAc,CACZ,KAAK,UAAY,CAAC,CACpB,CACA,iBAAiBnJ,EAAMoJ,EAAS,EAAG,CAC5BxI,EAAS,KAAK,UAAWZ,CAAI,IAChC,KAAK,UAAUA,CAAI,EAAI,GAEzB,KAAK,UAAUA,CAAI,GAAKoJ,CAC1B,CACA,KAAM,CACJ,OAAOC,GAAS,KAAK,SAAS,CAChC,CACF,EAkBA,IAAMC,GAAc,CAAC,EACfC,GAAY,CAAC,EACnB,SAASC,GAA0BX,EAAU,CAC3C,IAAMY,EAAaZ,EAAS,SAAS,EACrC,OAAKS,GAAYG,CAAU,IACzBH,GAAYG,CAAU,EAAI,IAAIN,IAEzBG,GAAYG,CAAU,CAC/B,CACA,SAASC,GAAgCb,EAAUc,EAAiB,CAClE,IAAMF,EAAaZ,EAAS,SAAS,EACrC,OAAKU,GAAUE,CAAU,IACvBF,GAAUE,CAAU,EAAIE,EAAgB,GAEnCJ,GAAUE,CAAU,CAC7B,CAsBA,IAAMG,GAAN,KAAqB,CAInB,YAAYC,EAAY,CACtB,KAAK,WAAaA,EAClB,KAAK,iBAAmB,CAAC,EACzB,KAAK,mBAAqB,EAC1B,KAAK,mBAAqB,GAC1B,KAAK,QAAU,IACjB,CACA,WAAWC,EAAaC,EAAU,CAChC,KAAK,mBAAqBD,EAC1B,KAAK,QAAUC,EACX,KAAK,mBAAqB,KAAK,qBACjC,KAAK,QAAQ,EACb,KAAK,QAAU,KAEnB,CAMA,eAAeC,EAAY/G,EAAM,CAE/B,IADA,KAAK,iBAAiB+G,CAAU,EAAI/G,EAC7B,KAAK,iBAAiB,KAAK,kBAAkB,GAAG,CACrD,IAAMgH,EAAY,KAAK,iBAAiB,KAAK,kBAAkB,EAC/D,OAAO,KAAK,iBAAiB,KAAK,kBAAkB,EACpD,QAASjI,EAAI,EAAGA,EAAIiI,EAAU,OAAQ,EAAEjI,EAClCiI,EAAUjI,CAAC,GACbgE,GAAe,IAAM,CACnB,KAAK,WAAWiE,EAAUjI,CAAC,CAAC,CAC9B,CAAC,EAGL,GAAI,KAAK,qBAAuB,KAAK,mBAAoB,CACnD,KAAK,UACP,KAAK,QAAQ,EACb,KAAK,QAAU,MAEjB,KACF,CACA,KAAK,oBACP,CACF,CACF,EAmBA,IAAMkI,GAAgC,QAChCC,GAAkC,QAClCC,GAAoC,aACpCC,GAAiC,UACjCC,GAA6B,KAC7BC,GAA6B,KAC7BC,GAAiC,MACjCC,GAAsC,KACtCC,GAAsC,MACtCC,GAAuC,KACvCC,GAA+B,IAC/BC,GAAgD,SAIhDC,GAAoB,KACpBC,GAAkB,GAClBC,GAAmBF,GAAoBC,GAMvCE,GAA6B,KAI7BC,GAAqB,IAIrBC,GAAN,MAAMC,CAAsB,CAY1B,YAAYC,EAAQxC,EAAUyC,EAAeC,EAAeC,EAAWC,EAAoBC,EAAe,CACxG,KAAK,OAASL,EACd,KAAK,SAAWxC,EAChB,KAAK,cAAgByC,EACrB,KAAK,cAAgBC,EACrB,KAAK,UAAYC,EACjB,KAAK,mBAAqBC,EAC1B,KAAK,cAAgBC,EACrB,KAAK,UAAY,EACjB,KAAK,cAAgB,EACrB,KAAK,eAAiB,GACtB,KAAK,KAAOhJ,GAAW2I,CAAM,EAC7B,KAAK,OAAS7B,GAA0BX,CAAQ,EAChD,KAAK,MAAQG,IAEP,KAAK,gBACPA,EAAOlB,EAAqB,EAAI,KAAK,eAEhCgB,GAAsBD,EAAUb,GAAcgB,CAAM,EAE/D,CAKA,KAAK2C,EAAWC,EAAc,CAC5B,KAAK,cAAgB,EACrB,KAAK,cAAgBA,EACrB,KAAK,gBAAkB,IAAIhC,GAAe+B,CAAS,EACnD,KAAK,UAAY,GACjB,KAAK,qBAAuB,WAAW,IAAM,CAC3C,KAAK,KAAK,8BAA8B,EAExC,KAAK,UAAU,EACf,KAAK,qBAAuB,IAE9B,EAAG,KAAK,MAAMT,EAAkB,CAAC,EAEjChI,GAAoB,IAAM,CACxB,GAAI,KAAK,UACP,OAGF,KAAK,gBAAkB,IAAI2I,GAA2B,IAAIC,IAAS,CACjE,GAAM,CAACC,EAASC,EAAMC,EAAMC,EAAMC,CAAI,EAAIL,EAE1C,GADA,KAAK,wBAAwBA,CAAI,EAC7B,EAAC,KAAK,gBAQV,GALI,KAAK,uBACP,aAAa,KAAK,oBAAoB,EACtC,KAAK,qBAAuB,MAE9B,KAAK,eAAiB,GAClBC,IAAY7B,GACd,KAAK,GAAK8B,EACV,KAAK,SAAWC,UACPF,IAAY5B,GAEjB6B,GAGF,KAAK,gBAAgB,aAAe,GAGpC,KAAK,gBAAgB,WAAWA,EAAM,IAAM,CAC1C,KAAK,UAAU,CACjB,CAAC,GAED,KAAK,UAAU,MAGjB,OAAM,IAAI,MAAM,kCAAoCD,CAAO,CAE/D,EAAG,IAAID,IAAS,CACd,GAAM,CAACM,EAAInJ,CAAI,EAAI6I,EACnB,KAAK,wBAAwBA,CAAI,EACjC,KAAK,gBAAgB,eAAeM,EAAInJ,CAAI,CAC9C,EAAG,IAAM,CACP,KAAK,UAAU,CACjB,EAAG,KAAK,KAAK,EAGb,IAAMoJ,EAAY,CAAC,EACnBA,EAAUnC,EAA6B,EAAI,IAC3CmC,EAAU7B,EAA8B,EAAI,KAAK,MAAM,KAAK,OAAO,EAAI,GAAS,EAC5E,KAAK,gBAAgB,2BACvB6B,EAAU5B,EAAmC,EAAI,KAAK,gBAAgB,0BAExE4B,EAAU9E,EAAa,EAAID,GACvB,KAAK,qBACP+E,EAAU7E,EAAuB,EAAI,KAAK,oBAExC,KAAK,gBACP6E,EAAUzE,EAAkB,EAAI,KAAK,eAEnC,KAAK,gBACPyE,EAAUxE,EAAoB,EAAI,KAAK,eAErC,KAAK,gBACPwE,EAAUvE,EAAqB,EAAI,KAAK,eAEtC,OAAO,SAAa,KAAe,SAAS,UAAYH,GAAgB,KAAK,SAAS,QAAQ,IAChG0E,EAAU5E,EAAa,EAAIC,IAE7B,IAAM4E,EAAa,KAAK,MAAMD,CAAS,EACvC,KAAK,KAAK,+BAAiCC,CAAU,EACrD,KAAK,gBAAgB,OAAOA,EAAY,IAAM,CAE9C,CAAC,CACH,CAAC,CACH,CAIA,OAAQ,CACN,KAAK,gBAAgB,cAAc,KAAK,GAAI,KAAK,QAAQ,EACzD,KAAK,uBAAuB,KAAK,GAAI,KAAK,QAAQ,CACpD,CAIA,OAAO,YAAa,CAClBlB,EAAsB,YAAc,EACtC,CAIA,OAAO,eAAgB,CACrBA,EAAsB,eAAiB,EACzC,CAEA,OAAO,aAAc,CACnB,OAAIhI,EAAU,EACL,GACEgI,EAAsB,YACxB,GAIA,CAACA,EAAsB,gBAAkB,OAAO,SAAa,KAAe,SAAS,eAAiB,MAAQ,CAAC9F,GAA+B,GAAK,CAACC,GAAkB,CAEjL,CAIA,uBAAwB,CAAC,CAIzB,WAAY,CACV,KAAK,UAAY,GACb,KAAK,kBACP,KAAK,gBAAgB,MAAM,EAC3B,KAAK,gBAAkB,MAGrB,KAAK,iBACP,SAAS,KAAK,YAAY,KAAK,cAAc,EAC7C,KAAK,eAAiB,MAEpB,KAAK,uBACP,aAAa,KAAK,oBAAoB,EACtC,KAAK,qBAAuB,KAEhC,CAIA,WAAY,CACL,KAAK,YACR,KAAK,KAAK,4BAA4B,EACtC,KAAK,UAAU,EACX,KAAK,gBACP,KAAK,cAAc,KAAK,cAAc,EACtC,KAAK,cAAgB,MAG3B,CAKA,OAAQ,CACD,KAAK,YACR,KAAK,KAAK,2BAA2B,EACrC,KAAK,UAAU,EAEnB,CAMA,KAAKtC,EAAM,CACT,IAAMsJ,EAAU/L,EAAUyC,CAAI,EAC9B,KAAK,WAAasJ,EAAQ,OAC1B,KAAK,OAAO,iBAAiB,aAAcA,EAAQ,MAAM,EAEzD,IAAMC,EAAaC,GAAaF,CAAO,EAGjC/H,EAAWH,GAAkBmI,EAAYxB,EAAgB,EAG/D,QAAShJ,EAAI,EAAGA,EAAIwC,EAAS,OAAQxC,IACnC,KAAK,gBAAgB,eAAe,KAAK,cAAewC,EAAS,OAAQA,EAASxC,CAAC,CAAC,EACpF,KAAK,eAET,CAMA,uBAAuBX,EAAIqL,EAAI,CAC7B,GAAItJ,EAAU,EACZ,OAEF,KAAK,eAAiB,SAAS,cAAc,QAAQ,EACrD,IAAMiJ,EAAY,CAAC,EACnBA,EAAUxB,EAA6C,EAAI,IAC3DwB,EAAU/B,EAA0B,EAAIjJ,EACxCgL,EAAU9B,EAA0B,EAAImC,EACxC,KAAK,eAAe,IAAM,KAAK,MAAML,CAAS,EAC9C,KAAK,eAAe,MAAM,QAAU,OACpC,SAAS,KAAK,YAAY,KAAK,cAAc,CAC/C,CAIA,wBAAwBP,EAAM,CAE5B,IAAMa,EAAgBnM,EAAUsL,CAAI,EAAE,OACtC,KAAK,eAAiBa,EACtB,KAAK,OAAO,iBAAiB,iBAAkBA,CAAa,CAC9D,CACF,EAIMd,GAAN,MAAMe,CAA2B,CAO/B,YAAYC,EAAWC,EAAalB,EAAcmB,EAAO,CAiBvD,GAhBA,KAAK,aAAenB,EACpB,KAAK,MAAQmB,EAGb,KAAK,oBAAsB,IAAI,IAE/B,KAAK,YAAc,CAAC,EAMpB,KAAK,cAAgB,KAAK,MAAM,KAAK,OAAO,EAAI,GAAS,EAGzD,KAAK,aAAe,GACf3J,EAAU,EA+Bb,KAAK,UAAYyJ,EACjB,KAAK,YAAcC,MAhCH,CAKhB,KAAK,yBAA2B1L,GAAc,EAC9C,OAAOgJ,GAAoC,KAAK,wBAAwB,EAAIyC,EAC5E,OAAOxC,GAAiC,KAAK,wBAAwB,EAAIyC,EAEzE,KAAK,SAAWF,EAA2B,cAAc,EAEzD,IAAII,EAAS,GAGT,KAAK,SAAS,KAAO,KAAK,SAAS,IAAI,OAAO,EAAG,EAAoB,IAAM,gBAE7EA,EAAS,4BADa,SAAS,OACwB,gBAEzD,IAAMC,EAAiB,eAAiBD,EAAS,iBACjD,GAAI,CACF,KAAK,SAAS,IAAI,KAAK,EACvB,KAAK,SAAS,IAAI,MAAMC,CAAc,EACtC,KAAK,SAAS,IAAI,MAAM,CAC1B,OAASjI,EAAG,CACVvC,EAAI,yBAAyB,EACzBuC,EAAE,OACJvC,EAAIuC,EAAE,KAAK,EAEbvC,EAAIuC,CAAC,CACP,CACF,CAIF,CAKA,OAAO,eAAgB,CACrB,IAAMkI,EAAS,SAAS,cAAc,QAAQ,EAG9C,GAFAA,EAAO,MAAM,QAAU,OAEnB,SAAS,KAAM,CACjB,SAAS,KAAK,YAAYA,CAAM,EAChC,GAAI,CAIQA,EAAO,cAAc,UAG7BzK,EAAI,+BAA+B,CAEvC,MAAY,CACV,IAAM0K,EAAS,SAAS,OACxBD,EAAO,IAAM,gEAAkEC,EAAS,0BAC1F,CACF,KAGE,MAAM,oGAGR,OAAID,EAAO,gBACTA,EAAO,IAAMA,EAAO,gBACXA,EAAO,cAChBA,EAAO,IAAMA,EAAO,cAAc,SAEzBA,EAAO,WAEhBA,EAAO,IAAMA,EAAO,UAEfA,CACT,CAIA,OAAQ,CAEN,KAAK,MAAQ,GACT,KAAK,WAIP,KAAK,SAAS,IAAI,KAAK,YAAc,GACrC,WAAW,IAAM,CACX,KAAK,WAAa,OACpB,SAAS,KAAK,YAAY,KAAK,QAAQ,EACvC,KAAK,SAAW,KAEpB,EAAG,KAAK,MAAM,CAAC,CAAC,GAGlB,IAAMtB,EAAe,KAAK,aACtBA,IACF,KAAK,aAAe,KACpBA,EAAa,EAEjB,CAMA,cAAcvK,EAAIqL,EAAI,CAKpB,IAJA,KAAK,KAAOrL,EACZ,KAAK,KAAOqL,EACZ,KAAK,MAAQ,GAEN,KAAK,YAAY,GAAG,CAC7B,CAQA,aAAc,CAIZ,GAAI,KAAK,OAAS,KAAK,cAAgB,KAAK,oBAAoB,MAAQ,KAAK,YAAY,OAAS,EAAI,EAAI,GAAI,CAE5G,KAAK,gBACL,IAAML,EAAY,CAAC,EACnBA,EAAU/B,EAA0B,EAAI,KAAK,KAC7C+B,EAAU9B,EAA0B,EAAI,KAAK,KAC7C8B,EAAU7B,EAA8B,EAAI,KAAK,cACjD,IAAI4C,EAAS,KAAK,MAAMf,CAAS,EAE7BgB,EAAgB,GAChBrL,EAAI,EACR,KAAO,KAAK,YAAY,OAAS,GAEf,KAAK,YAAY,CAAC,EACtB,EAAE,OAAS+I,GAAkBsC,EAAc,QAAUvC,IAAmB,CAElF,IAAMwC,EAAS,KAAK,YAAY,MAAM,EACtCD,EAAgBA,EAAgB,IAAM3C,GAAsC1I,EAAI,IAAMsL,EAAO,IAAM,IAAM3C,GAAuC3I,EAAI,IAAMsL,EAAO,GAAK,IAAM1C,GAA+B5I,EAAI,IAAMsL,EAAO,EAC5NtL,GACF,CAIF,OAAAoL,EAASA,EAASC,EAClB,KAAK,gBAAgBD,EAAQ,KAAK,aAAa,EACxC,EACT,KACE,OAAO,EAEX,CAOA,eAAeG,EAAQC,EAAWvK,EAAM,CAEtC,KAAK,YAAY,KAAK,CACpB,IAAKsK,EACL,GAAIC,EACJ,EAAGvK,CACL,CAAC,EAGG,KAAK,OACP,KAAK,YAAY,CAErB,CAMA,gBAAgBwK,EAAKC,EAAQ,CAE3B,KAAK,oBAAoB,IAAIA,CAAM,EACnC,IAAMC,EAAe,IAAM,CACzB,KAAK,oBAAoB,OAAOD,CAAM,EACtC,KAAK,YAAY,CACnB,EAGME,EAAmB,WAAWD,EAAc,KAAK,MAAM1C,EAA0B,CAAC,EAClF4C,EAAe,IAAM,CAEzB,aAAaD,CAAgB,EAE7BD,EAAa,CACf,EACA,KAAK,OAAOF,EAAKI,CAAY,CAC/B,CAMA,OAAOJ,EAAKK,EAAQ,CACd1K,EAAU,EAEZ,KAAK,eAAeqK,EAAKK,CAAM,EAE/B,WAAW,IAAM,CACf,GAAI,CAEF,GAAI,CAAC,KAAK,aACR,OAEF,IAAMC,EAAY,KAAK,SAAS,IAAI,cAAc,QAAQ,EAC1DA,EAAU,KAAO,kBACjBA,EAAU,MAAQ,GAClBA,EAAU,IAAMN,EAEhBM,EAAU,OAASA,EAAU,mBAAqB,UAAY,CAE5D,IAAMC,EAASD,EAAU,YACrB,CAACC,GAAUA,IAAW,UAAYA,IAAW,cAE/CD,EAAU,OAASA,EAAU,mBAAqB,KAC9CA,EAAU,YACZA,EAAU,WAAW,YAAYA,CAAS,EAE5CD,EAAO,EAEX,EACAC,EAAU,QAAU,IAAM,CACxBtL,EAAI,oCAAsCgL,CAAG,EAC7C,KAAK,aAAe,GACpB,KAAK,MAAM,CACb,EACA,KAAK,SAAS,IAAI,KAAK,YAAYM,CAAS,CAC9C,MAAY,CAEZ,CACF,EAAG,KAAK,MAAM,CAAC,CAAC,CAEpB,CACF,EAkBA,IAAME,GAA2B,MAC3BC,GAA+B,KACjCC,GAAgB,KAChB,OAAO,aAAiB,IAC1BA,GAAgB,aACP,OAAO,UAAc,MAC9BA,GAAgB,WAKlB,IAAIC,IAAoC,IAAM,CAC5C,MAAMA,CAAoB,CAYxB,YAAY/C,EAAQxC,EAAUyC,EAAeC,EAAeC,EAAWC,EAAoBC,EAAe,CACxG,KAAK,OAASL,EACd,KAAK,cAAgBC,EACrB,KAAK,cAAgBC,EACrB,KAAK,UAAYC,EACjB,KAAK,eAAiB,KACtB,KAAK,OAAS,KACd,KAAK,YAAc,EACnB,KAAK,UAAY,EACjB,KAAK,cAAgB,EACrB,KAAK,KAAO9I,GAAW,KAAK,MAAM,EAClC,KAAK,OAAS8G,GAA0BX,CAAQ,EAChD,KAAK,QAAUuF,EAAoB,eAAevF,EAAU4C,EAAoBC,EAAeH,EAAeD,CAAa,EAC3H,KAAK,UAAYzC,EAAS,SAC5B,CAQA,OAAO,eAAeA,EAAU4C,EAAoBC,EAAeH,EAAeD,EAAe,CAC/F,IAAMe,EAAY,CAAC,EACnB,OAAAA,EAAU9E,EAAa,EAAID,GACvB,CAAClE,EAAU,GAAK,OAAO,SAAa,KAAe,SAAS,UAAYuE,GAAgB,KAAK,SAAS,QAAQ,IAChH0E,EAAU5E,EAAa,EAAIC,IAEzB+D,IACFY,EAAU7E,EAAuB,EAAIiE,GAEnCC,IACFW,EAAUzE,EAAkB,EAAI8D,GAE9BH,IACFc,EAAUvE,EAAqB,EAAIyD,GAEjCD,IACFe,EAAUxE,EAAoB,EAAIyD,GAE7BxC,GAAsBD,EAAUd,GAAWsE,CAAS,CAC7D,CAKA,KAAKV,EAAWC,EAAc,CAC5B,KAAK,aAAeA,EACpB,KAAK,UAAYD,EACjB,KAAK,KAAK,2BAA6B,KAAK,OAAO,EACnD,KAAK,eAAiB,GAEtB3K,GAAkB,IAAI,6BAA8B,EAAI,EACxD,GAAI,CACF,IAAIqN,EACJ,GAAIjL,EAAU,EAAG,CACf,IAAMkL,EAAS,KAAK,UAAY,YAAc,OAE9CD,EAAU,CACR,QAAS,CACP,aAAc,YAAY/G,EAAgB,IAAIpH,EAAW,IAAI,QAAQ,QAAQ,IAAIoO,CAAM,GACvF,mBAAoB,KAAK,eAAiB,EAC5C,CACF,EAMI,KAAK,YACPD,EAAQ,QAAQ,cAAmB,UAAU,KAAK,SAAS,IAEzD,KAAK,gBACPA,EAAQ,QAAQ,qBAAqB,EAAI,KAAK,eAGhD,IAAME,EAAM,QAAQ,IACdC,EAAQ,KAAK,QAAQ,QAAQ,QAAQ,IAAM,EAAID,EAAI,aAAkBA,EAAI,YAAiBA,EAAI,YAAiBA,EAAI,WACrHC,IACFH,EAAQ,MAAW,CACjB,OAAQG,CACV,EAEJ,CACA,KAAK,OAAS,IAAIL,GAAc,KAAK,QAAS,CAAC,EAAGE,CAAO,CAC3D,OAASrJ,EAAG,CACV,KAAK,KAAK,gCAAgC,EAC1C,IAAMpC,EAAQoC,EAAE,SAAWA,EAAE,KACzBpC,GACF,KAAK,KAAKA,CAAK,EAEjB,KAAK,UAAU,EACf,MACF,CACA,KAAK,OAAO,OAAS,IAAM,CACzB,KAAK,KAAK,sBAAsB,EAChC,KAAK,eAAiB,EACxB,EACA,KAAK,OAAO,QAAU,IAAM,CAC1B,KAAK,KAAK,wCAAwC,EAClD,KAAK,OAAS,KACd,KAAK,UAAU,CACjB,EACA,KAAK,OAAO,UAAY6L,GAAK,CAC3B,KAAK,oBAAoBA,CAAC,CAC5B,EACA,KAAK,OAAO,QAAUzJ,GAAK,CACzB,KAAK,KAAK,uCAAuC,EAEjD,IAAMpC,EAAQoC,EAAE,SAAWA,EAAE,KACzBpC,GACF,KAAK,KAAKA,CAAK,EAEjB,KAAK,UAAU,CACjB,CACF,CAIA,OAAQ,CAAC,CACT,OAAO,eAAgB,CACrBwL,EAAoB,eAAiB,EACvC,CACA,OAAO,aAAc,CACnB,IAAIM,EAAe,GACnB,GAAI,OAAO,UAAc,KAAe,UAAU,UAAW,CAC3D,IAAMC,EAAkB,iCAClBC,EAAkB,UAAU,UAAU,MAAMD,CAAe,EAC7DC,GAAmBA,EAAgB,OAAS,GAC1C,WAAWA,EAAgB,CAAC,CAAC,EAAI,MACnCF,EAAe,GAGrB,CACA,MAAO,CAACA,GAAgBP,KAAkB,MAAQ,CAACC,EAAoB,cACzE,CAIA,OAAO,kBAAmB,CAGxB,OAAOpN,GAAkB,mBAAqBA,GAAkB,IAAI,4BAA4B,IAAM,EACxG,CACA,uBAAwB,CACtBA,GAAkB,OAAO,4BAA4B,CACvD,CACA,aAAaiC,EAAM,CAEjB,GADA,KAAK,OAAO,KAAKA,CAAI,EACjB,KAAK,OAAO,SAAW,KAAK,YAAa,CAC3C,IAAM4L,EAAW,KAAK,OAAO,KAAK,EAAE,EACpC,KAAK,OAAS,KACd,IAAMC,EAAWpO,GAASmO,CAAQ,EAElC,KAAK,UAAUC,CAAQ,CACzB,CACF,CAIA,qBAAqBC,EAAY,CAC/B,KAAK,YAAcA,EACnB,KAAK,OAAS,CAAC,CACjB,CAKA,mBAAmB9L,EAAM,CAIvB,GAHAV,EAAO,KAAK,SAAW,KAAM,gCAAgC,EAGzDU,EAAK,QAAU,EAAG,CACpB,IAAM8L,EAAa,OAAO9L,CAAI,EAC9B,GAAI,CAAC,MAAM8L,CAAU,EACnB,YAAK,qBAAqBA,CAAU,EAC7B,IAEX,CACA,YAAK,qBAAqB,CAAC,EACpB9L,CACT,CAKA,oBAAoB+L,EAAM,CACxB,GAAI,KAAK,SAAW,KAClB,OAEF,IAAM/L,EAAO+L,EAAK,KAIlB,GAHA,KAAK,eAAiB/L,EAAK,OAC3B,KAAK,OAAO,iBAAiB,iBAAkBA,EAAK,MAAM,EAC1D,KAAK,eAAe,EAChB,KAAK,SAAW,KAElB,KAAK,aAAaA,CAAI,MACjB,CAEL,IAAMgM,EAAgB,KAAK,mBAAmBhM,CAAI,EAC9CgM,IAAkB,MACpB,KAAK,aAAaA,CAAa,CAEnC,CACF,CAKA,KAAKhM,EAAM,CACT,KAAK,eAAe,EACpB,IAAMsJ,EAAU/L,EAAUyC,CAAI,EAC9B,KAAK,WAAasJ,EAAQ,OAC1B,KAAK,OAAO,iBAAiB,aAAcA,EAAQ,MAAM,EAGzD,IAAM/H,EAAWH,GAAkBkI,EAAS0B,EAAwB,EAEhEzJ,EAAS,OAAS,GACpB,KAAK,YAAY,OAAOA,EAAS,MAAM,CAAC,EAG1C,QAASxC,EAAI,EAAGA,EAAIwC,EAAS,OAAQxC,IACnC,KAAK,YAAYwC,EAASxC,CAAC,CAAC,CAEhC,CACA,WAAY,CACV,KAAK,UAAY,GACb,KAAK,iBACP,cAAc,KAAK,cAAc,EACjC,KAAK,eAAiB,MAEpB,KAAK,SACP,KAAK,OAAO,MAAM,EAClB,KAAK,OAAS,KAElB,CACA,WAAY,CACL,KAAK,YACR,KAAK,KAAK,6BAA6B,EACvC,KAAK,UAAU,EAEX,KAAK,eACP,KAAK,aAAa,KAAK,cAAc,EACrC,KAAK,aAAe,MAG1B,CAKA,OAAQ,CACD,KAAK,YACR,KAAK,KAAK,2BAA2B,EACrC,KAAK,UAAU,EAEnB,CAKA,gBAAiB,CACf,cAAc,KAAK,cAAc,EACjC,KAAK,eAAiB,YAAY,IAAM,CAElC,KAAK,QACP,KAAK,YAAY,GAAG,EAEtB,KAAK,eAAe,CAEtB,EAAG,KAAK,MAAMkM,EAA4B,CAAC,CAC7C,CAMA,YAAY3M,EAAK,CAIf,GAAI,CACF,KAAK,OAAO,KAAKA,CAAG,CACtB,OAASyD,EAAG,CACV,KAAK,KAAK,0CAA2CA,EAAE,SAAWA,EAAE,KAAM,qBAAqB,EAC/F,WAAW,KAAK,UAAU,KAAK,IAAI,EAAG,CAAC,CACzC,CACF,CACF,CAQAoJ,EAAoB,6BAA+B,EACnDA,EAAoB,eAAiB,IAyBrC,OAAOA,CACT,GAAG,EACCc,IAAiC,IAAM,CACzC,MAAMA,CAAiB,CACrB,WAAW,gBAAiB,CAC1B,MAAO,CAAC/D,GAAuBiD,EAAmB,CACpD,CAKA,WAAW,0BAA2B,CACpC,OAAO,KAAK,2BACd,CAIA,YAAYvF,EAAU,CACpB,KAAK,gBAAgBA,CAAQ,CAC/B,CACA,gBAAgBA,EAAU,CACxB,IAAMsG,EAAwBf,IAAuBA,GAAoB,YAAe,EACpFgB,EAAuBD,GAAyB,CAACf,GAAoB,iBAAiB,EAO1F,GANIvF,EAAS,gBACNsG,GACHrM,EAAK,iFAAiF,EAExFsM,EAAuB,IAErBA,EACF,KAAK,YAAc,CAAChB,EAAmB,MAClC,CACL,IAAMiB,EAAa,KAAK,YAAc,CAAC,EACvC,QAAWC,KAAaJ,EAAiB,eACnCI,GAAaA,EAAU,YAAe,GACxCD,EAAW,KAAKC,CAAS,EAG7BJ,EAAiB,4BAA8B,EACjD,CACF,CAIA,kBAAmB,CACjB,GAAI,KAAK,YAAY,OAAS,EAC5B,OAAO,KAAK,YAAY,CAAC,EAEzB,MAAM,IAAI,MAAM,yBAAyB,CAE7C,CAIA,kBAAmB,CACjB,OAAI,KAAK,YAAY,OAAS,EACrB,KAAK,YAAY,CAAC,EAElB,IAEX,CACF,CAEAA,EAAiB,4BAA8B,GAmB/C,OAAOA,CACT,GAAG,EACGK,GAAkB,IAGlBC,GAAsC,IAItCC,GAA8B,GAAK,KACnCC,GAAkC,IAAM,KACxCC,GAAe,IACfC,GAAe,IACfC,GAAmB,IACnBC,GAAgB,IAChBC,GAAgB,IAChBC,GAAe,IACfC,GAAa,IACbC,GAAmB,IACnBC,GAAO,IACPC,GAAe,IAKfC,GAAN,KAAiB,CAaf,YAAYhP,EAAIiP,EAAWC,EAAgBC,EAAgBC,EAAY5G,EAAY6G,EAAUC,EAAeC,EAASlF,EAAe,CAClI,KAAK,GAAKrK,EACV,KAAK,UAAYiP,EACjB,KAAK,eAAiBC,EACtB,KAAK,eAAiBC,EACtB,KAAK,WAAaC,EAClB,KAAK,WAAa5G,EAClB,KAAK,SAAW6G,EAChB,KAAK,cAAgBC,EACrB,KAAK,QAAUC,EACf,KAAK,cAAgBlF,EACrB,KAAK,gBAAkB,EACvB,KAAK,oBAAsB,CAAC,EAC5B,KAAK,OAAS,EACd,KAAK,KAAOhJ,GAAW,KAAO,KAAK,GAAK,GAAG,EAC3C,KAAK,kBAAoB,IAAIwM,GAAiBoB,CAAS,EACvD,KAAK,KAAK,oBAAoB,EAC9B,KAAK,OAAO,CACd,CAIA,QAAS,CACP,IAAMO,EAAO,KAAK,kBAAkB,iBAAiB,EACrD,KAAK,MAAQ,IAAIA,EAAK,KAAK,iBAAiB,EAAG,KAAK,UAAW,KAAK,eAAgB,KAAK,eAAgB,KAAK,WAAY,KAAM,KAAK,aAAa,EAGlJ,KAAK,0BAA4BA,EAAK,8BAAmC,EACzE,IAAMC,EAAoB,KAAK,cAAc,KAAK,KAAK,EACjDC,EAAmB,KAAK,iBAAiB,KAAK,KAAK,EACzD,KAAK,IAAM,KAAK,MAChB,KAAK,IAAM,KAAK,MAChB,KAAK,eAAiB,KACtB,KAAK,WAAa,GAOlB,WAAW,IAAM,CAEf,KAAK,OAAS,KAAK,MAAM,KAAKD,EAAmBC,CAAgB,CACnE,EAAG,KAAK,MAAM,CAAC,CAAC,EAChB,IAAMC,EAAmBH,EAAK,gBAAqB,EAC/CG,EAAmB,IACrB,KAAK,gBAAkB7K,GAAsB,IAAM,CACjD,KAAK,gBAAkB,KAClB,KAAK,aACJ,KAAK,OAAS,KAAK,MAAM,cAAgBuJ,IAC3C,KAAK,KAAK,wDAA0D,KAAK,MAAM,cAAgB,sCAAsC,EACrI,KAAK,WAAa,GAClB,KAAK,MAAM,sBAAsB,GACxB,KAAK,OAAS,KAAK,MAAM,UAAYD,GAC9C,KAAK,KAAK,oDAAsD,KAAK,MAAM,UAAY,oCAAoC,GAI3H,KAAK,KAAK,6CAA6C,EACvD,KAAK,MAAM,GAIjB,EAAG,KAAK,MAAMuB,CAAgB,CAAC,EAEnC,CACA,kBAAmB,CACjB,MAAO,KAAO,KAAK,GAAK,IAAM,KAAK,iBACrC,CACA,iBAAiBH,EAAM,CACrB,OAAOI,GAAiB,CAClBJ,IAAS,KAAK,MAChB,KAAK,kBAAkBI,CAAa,EAC3BJ,IAAS,KAAK,gBACvB,KAAK,KAAK,4BAA4B,EACtC,KAAK,2BAA2B,GAEhC,KAAK,KAAK,2BAA2B,CAEzC,CACF,CACA,cAAcA,EAAM,CAClB,OAAO9O,GAAW,CACZ,KAAK,SAAW,IACd8O,IAAS,KAAK,IAChB,KAAK,0BAA0B9O,CAAO,EAC7B8O,IAAS,KAAK,eACvB,KAAK,4BAA4B9O,CAAO,EAExC,KAAK,KAAK,2BAA2B,EAG3C,CACF,CAIA,YAAYmP,EAAS,CAEnB,IAAMC,EAAM,CACV,EAAG,IACH,EAAGD,CACL,EACA,KAAK,UAAUC,CAAG,CACpB,CACA,sBAAuB,CACjB,KAAK,MAAQ,KAAK,gBAAkB,KAAK,MAAQ,KAAK,iBACxD,KAAK,KAAK,2CAA6C,KAAK,eAAe,MAAM,EACjF,KAAK,MAAQ,KAAK,eAClB,KAAK,eAAiB,KAG1B,CACA,oBAAoBC,EAAa,CAC/B,GAAIzB,MAAgByB,EAAa,CAC/B,IAAMC,EAAMD,EAAYzB,EAAY,EAChC0B,IAAQpB,GACV,KAAK,2BAA2B,EACvBoB,IAAQvB,IAEjB,KAAK,KAAK,sCAAsC,EAChD,KAAK,eAAe,MAAM,GAEtB,KAAK,MAAQ,KAAK,gBAAkB,KAAK,MAAQ,KAAK,iBACxD,KAAK,MAAM,GAEJuB,IAAQrB,KACjB,KAAK,KAAK,wBAAwB,EAClC,KAAK,8BACL,KAAK,2BAA2B,EAEpC,CACF,CACA,4BAA4BsB,EAAY,CACtC,IAAMC,EAAQvN,GAAW,IAAKsN,CAAU,EAClCrO,EAAOe,GAAW,IAAKsN,CAAU,EACvC,GAAIC,IAAU,IACZ,KAAK,oBAAoBtO,CAAI,UACpBsO,IAAU,IAEnB,KAAK,oBAAoB,KAAKtO,CAAI,MAElC,OAAM,IAAI,MAAM,2BAA6BsO,CAAK,CAEtD,CACA,4BAA6B,CACvB,KAAK,6BAA+B,GACtC,KAAK,KAAK,kCAAkC,EAC5C,KAAK,WAAa,GAClB,KAAK,eAAe,sBAAsB,EAC1C,KAAK,oBAAoB,IAGzB,KAAK,KAAK,4BAA4B,EACtC,KAAK,eAAe,KAAK,CACvB,EAAG,IACH,EAAG,CACD,EAAGpB,GACH,EAAG,CAAC,CACN,CACF,CAAC,EAEL,CACA,qBAAsB,CAEpB,KAAK,eAAe,MAAM,EAE1B,KAAK,KAAK,iCAAiC,EAC3C,KAAK,eAAe,KAAK,CACvB,EAAG,IACH,EAAG,CACD,EAAGF,GACH,EAAG,CAAC,CACN,CACF,CAAC,EAGD,KAAK,KAAK,gCAAgC,EAC1C,KAAK,MAAM,KAAK,CACd,EAAG,IACH,EAAG,CACD,EAAGC,GACH,EAAG,CAAC,CACN,CACF,CAAC,EACD,KAAK,IAAM,KAAK,eAChB,KAAK,qBAAqB,CAC5B,CACA,0BAA0BoB,EAAY,CAEpC,IAAMC,EAAQvN,GAAW,IAAKsN,CAAU,EAClCrO,EAAOe,GAAW,IAAKsN,CAAU,EACnCC,IAAU,IACZ,KAAK,WAAWtO,CAAI,EACXsO,IAAU,KACnB,KAAK,eAAetO,CAAI,CAE5B,CACA,eAAelB,EAAS,CACtB,KAAK,mBAAmB,EAExB,KAAK,WAAWA,CAAO,CACzB,CACA,oBAAqB,CACd,KAAK,aACR,KAAK,4BACD,KAAK,2BAA6B,IACpC,KAAK,KAAK,gCAAgC,EAC1C,KAAK,WAAa,GAClB,KAAK,MAAM,sBAAsB,GAGvC,CACA,WAAWqP,EAAa,CACtB,IAAMC,EAAMrN,GAAW2L,GAAcyB,CAAW,EAChD,GAAIxB,MAAgBwB,EAAa,CAC/B,IAAMI,EAAUJ,EAAYxB,EAAY,EACxC,GAAIyB,IAAQjB,GAAc,CACxB,IAAMqB,EAAmB,OAAO,OAAO,CAAC,EAAGD,CAAO,EAC9C,KAAK,UAAU,kBAEjBC,EAAiB,EAAI,KAAK,UAAU,MAEtC,KAAK,aAAaA,CAAgB,CACpC,SAAWJ,IAAQnB,GAAkB,CACnC,KAAK,KAAK,mCAAmC,EAC7C,KAAK,IAAM,KAAK,eAChB,QAASlO,EAAI,EAAGA,EAAI,KAAK,oBAAoB,OAAQ,EAAEA,EACrD,KAAK,eAAe,KAAK,oBAAoBA,CAAC,CAAC,EAEjD,KAAK,oBAAsB,CAAC,EAC5B,KAAK,qBAAqB,CAC5B,MAAWqP,IAAQxB,GAGjB,KAAK,sBAAsB2B,CAAO,EACzBH,IAAQvB,GAEjB,KAAK,SAAS0B,CAAO,EACZH,IAAQtB,GACjBnN,GAAM,iBAAmB4O,CAAO,EACvBH,IAAQrB,IACjB,KAAK,KAAK,sBAAsB,EAChC,KAAK,mBAAmB,EACxB,KAAK,8BAA8B,GAEnCpN,GAAM,mCAAqCyO,CAAG,CAElD,CACF,CAIA,aAAaK,EAAW,CACtB,IAAMC,EAAYD,EAAU,GACtBzR,EAAUyR,EAAU,EACpBxJ,EAAOwJ,EAAU,EACvB,KAAK,UAAYA,EAAU,EAC3B,KAAK,UAAU,KAAOxJ,EAElB,KAAK,SAAW,IAClB,KAAK,MAAM,MAAM,EACjB,KAAK,yBAAyB,KAAK,MAAOyJ,CAAS,EAC/CrK,KAAqBrH,GACvB6C,EAAK,oCAAoC,EAG3C,KAAK,iBAAiB,EAE1B,CACA,kBAAmB,CACjB,IAAM+N,EAAO,KAAK,kBAAkB,iBAAiB,EACjDA,GACF,KAAK,cAAcA,CAAI,CAE3B,CACA,cAAcA,EAAM,CAClB,KAAK,eAAiB,IAAIA,EAAK,KAAK,iBAAiB,EAAG,KAAK,UAAW,KAAK,eAAgB,KAAK,eAAgB,KAAK,WAAY,KAAK,SAAS,EAGjJ,KAAK,4BAA8BA,EAAK,8BAAmC,EAC3E,IAAMlF,EAAY,KAAK,cAAc,KAAK,cAAc,EAClDC,EAAe,KAAK,iBAAiB,KAAK,cAAc,EAC9D,KAAK,eAAe,KAAKD,EAAWC,CAAY,EAEhDzF,GAAsB,IAAM,CACtB,KAAK,iBACP,KAAK,KAAK,8BAA8B,EACxC,KAAK,eAAe,MAAM,EAE9B,EAAG,KAAK,MAAMoJ,EAAe,CAAC,CAChC,CACA,SAASrH,EAAM,CACb,KAAK,KAAK,qCAAuCA,CAAI,EACrD,KAAK,UAAU,KAAOA,EAGlB,KAAK,SAAW,EAClB,KAAK,MAAM,GAGX,KAAK,kBAAkB,EACvB,KAAK,OAAO,EAEhB,CACA,yBAAyB2I,EAAMc,EAAW,CACxC,KAAK,KAAK,kCAAkC,EAC5C,KAAK,MAAQd,EACb,KAAK,OAAS,EACV,KAAK,WACP,KAAK,SAASc,EAAW,KAAK,SAAS,EACvC,KAAK,SAAW,MAId,KAAK,4BAA8B,GACrC,KAAK,KAAK,gCAAgC,EAC1C,KAAK,WAAa,IAElBxL,GAAsB,IAAM,CAC1B,KAAK,8BAA8B,CACrC,EAAG,KAAK,MAAMqJ,EAAmC,CAAC,CAEtD,CACA,+BAAgC,CAE1B,CAAC,KAAK,YAAc,KAAK,SAAW,IACtC,KAAK,KAAK,0BAA0B,EACpC,KAAK,UAAU,CACb,EAAG,IACH,EAAG,CACD,EAAGW,GACH,EAAG,CAAC,CACN,CACF,CAAC,EAEL,CACA,4BAA6B,CAC3B,IAAMU,EAAO,KAAK,eAClB,KAAK,eAAiB,MAClB,KAAK,MAAQA,GAAQ,KAAK,MAAQA,IAEpC,KAAK,MAAM,CAEf,CAKA,kBAAkBI,EAAe,CAC/B,KAAK,MAAQ,KAGT,CAACA,GAAiB,KAAK,SAAW,GACpC,KAAK,KAAK,6BAA6B,EAEnC,KAAK,UAAU,gBAAgB,IACjCjQ,GAAkB,OAAO,QAAU,KAAK,UAAU,IAAI,EAEtD,KAAK,UAAU,aAAe,KAAK,UAAU,OAEtC,KAAK,SAAW,GACzB,KAAK,KAAK,2BAA2B,EAEvC,KAAK,MAAM,CACb,CACA,sBAAsB2E,EAAQ,CAC5B,KAAK,KAAK,wDAAwD,EAC9D,KAAK,UACP,KAAK,QAAQA,CAAM,EACnB,KAAK,QAAU,MAIjB,KAAK,cAAgB,KACrB,KAAK,MAAM,CACb,CACA,UAAU1C,EAAM,CACd,GAAI,KAAK,SAAW,EAClB,KAAM,8BAEN,KAAK,IAAI,KAAKA,CAAI,CAEtB,CAIA,OAAQ,CACF,KAAK,SAAW,IAClB,KAAK,KAAK,8BAA8B,EACxC,KAAK,OAAS,EACd,KAAK,kBAAkB,EACnB,KAAK,gBACP,KAAK,cAAc,EACnB,KAAK,cAAgB,MAG3B,CACA,mBAAoB,CAClB,KAAK,KAAK,+BAA+B,EACrC,KAAK,QACP,KAAK,MAAM,MAAM,EACjB,KAAK,MAAQ,MAEX,KAAK,iBACP,KAAK,eAAe,MAAM,EAC1B,KAAK,eAAiB,MAEpB,KAAK,kBACP,aAAa,KAAK,eAAe,EACjC,KAAK,gBAAkB,KAE3B,CACF,EAwBA,IAAM2O,GAAN,KAAoB,CAClB,IAAIC,EAAY5O,EAAM6O,EAAYC,EAAM,CAAC,CACzC,MAAMF,EAAY5O,EAAM6O,EAAYC,EAAM,CAAC,CAK3C,iBAAiBC,EAAO,CAAC,CAKzB,qBAAqBA,EAAO,CAAC,CAC7B,gBAAgBH,EAAY5O,EAAM6O,EAAY,CAAC,CAC/C,kBAAkBD,EAAY5O,EAAM6O,EAAY,CAAC,CACjD,mBAAmBD,EAAYC,EAAY,CAAC,CAC5C,YAAYG,EAAO,CAAC,CACtB,EAsBA,IAAMC,GAAN,KAAmB,CACjB,YAAYC,EAAgB,CAC1B,KAAK,eAAiBA,EACtB,KAAK,WAAa,CAAC,EACnB5P,EAAO,MAAM,QAAQ4P,CAAc,GAAKA,EAAe,OAAS,EAAG,4BAA4B,CACjG,CAIA,QAAQC,KAActQ,EAAS,CAC7B,GAAI,MAAM,QAAQ,KAAK,WAAWsQ,CAAS,CAAC,EAAG,CAE7C,IAAMC,EAAY,CAAC,GAAG,KAAK,WAAWD,CAAS,CAAC,EAChD,QAASpQ,EAAI,EAAGA,EAAIqQ,EAAU,OAAQrQ,IACpCqQ,EAAUrQ,CAAC,EAAE,SAAS,MAAMqQ,EAAUrQ,CAAC,EAAE,QAASF,CAAO,CAE7D,CACF,CACA,GAAGsQ,EAAWrI,EAAUuI,EAAS,CAC/B,KAAK,mBAAmBF,CAAS,EACjC,KAAK,WAAWA,CAAS,EAAI,KAAK,WAAWA,CAAS,GAAK,CAAC,EAC5D,KAAK,WAAWA,CAAS,EAAE,KAAK,CAC9B,SAAArI,EACA,QAAAuI,CACF,CAAC,EACD,IAAMC,EAAY,KAAK,gBAAgBH,CAAS,EAC5CG,GACFxI,EAAS,MAAMuI,EAASC,CAAS,CAErC,CACA,IAAIH,EAAWrI,EAAUuI,EAAS,CAChC,KAAK,mBAAmBF,CAAS,EACjC,IAAMC,EAAY,KAAK,WAAWD,CAAS,GAAK,CAAC,EACjD,QAASpQ,EAAI,EAAGA,EAAIqQ,EAAU,OAAQrQ,IACpC,GAAIqQ,EAAUrQ,CAAC,EAAE,WAAa+H,IAAa,CAACuI,GAAWA,IAAYD,EAAUrQ,CAAC,EAAE,SAAU,CACxFqQ,EAAU,OAAOrQ,EAAG,CAAC,EACrB,MACF,CAEJ,CACA,mBAAmBoQ,EAAW,CAC5B7P,EAAO,KAAK,eAAe,KAAKiQ,GACvBA,IAAOJ,CACf,EAAG,kBAAoBA,CAAS,CACnC,CACF,EAyBA,IAAMK,GAAN,MAAMC,UAAsBR,EAAa,CACvC,OAAO,aAAc,CACnB,OAAO,IAAIQ,CACb,CACA,aAAc,CACZ,MAAM,CAAC,QAAQ,CAAC,EAChB,KAAK,QAAU,GAKX,OAAO,OAAW,KAAe,OAAO,OAAO,iBAAqB,KAAe,CAACC,GAAgB,IACtG,OAAO,iBAAiB,SAAU,IAAM,CACjC,KAAK,UACR,KAAK,QAAU,GACf,KAAK,QAAQ,SAAU,EAAI,EAE/B,EAAG,EAAK,EACR,OAAO,iBAAiB,UAAW,IAAM,CACnC,KAAK,UACP,KAAK,QAAU,GACf,KAAK,QAAQ,SAAU,EAAK,EAEhC,EAAG,EAAK,EAEZ,CACA,gBAAgBP,EAAW,CACzB,OAAA7P,EAAO6P,IAAc,SAAU,uBAAyBA,CAAS,EAC1D,CAAC,KAAK,OAAO,CACtB,CACA,iBAAkB,CAChB,OAAO,KAAK,OACd,CACF,EAmBA,IAAMQ,GAAiB,GAEjBC,GAAwB,IAMxBC,EAAN,KAAW,CAKT,YAAYC,EAAcC,EAAU,CAClC,GAAIA,IAAa,OAAQ,CACvB,KAAK,QAAUD,EAAa,MAAM,GAAG,EAErC,IAAIE,EAAS,EACb,QAASjR,EAAI,EAAGA,EAAI,KAAK,QAAQ,OAAQA,IACnC,KAAK,QAAQA,CAAC,EAAE,OAAS,IAC3B,KAAK,QAAQiR,CAAM,EAAI,KAAK,QAAQjR,CAAC,EACrCiR,KAGJ,KAAK,QAAQ,OAASA,EACtB,KAAK,UAAY,CACnB,MACE,KAAK,QAAUF,EACf,KAAK,UAAYC,CAErB,CACA,UAAW,CACT,IAAInB,EAAa,GACjB,QAAS7P,EAAI,KAAK,UAAWA,EAAI,KAAK,QAAQ,OAAQA,IAChD,KAAK,QAAQA,CAAC,IAAM,KACtB6P,GAAc,IAAM,KAAK,QAAQ7P,CAAC,GAGtC,OAAO6P,GAAc,GACvB,CACF,EACA,SAASqB,GAAe,CACtB,OAAO,IAAIJ,EAAK,EAAE,CACpB,CACA,SAASK,EAAaC,EAAM,CAC1B,OAAIA,EAAK,WAAaA,EAAK,QAAQ,OAC1B,KAEFA,EAAK,QAAQA,EAAK,SAAS,CACpC,CAIA,SAASC,GAAcD,EAAM,CAC3B,OAAOA,EAAK,QAAQ,OAASA,EAAK,SACpC,CACA,SAASE,EAAaF,EAAM,CAC1B,IAAIJ,EAAWI,EAAK,UACpB,OAAIJ,EAAWI,EAAK,QAAQ,QAC1BJ,IAEK,IAAIF,EAAKM,EAAK,QAASJ,CAAQ,CACxC,CACA,SAASO,GAAYH,EAAM,CACzB,OAAIA,EAAK,UAAYA,EAAK,QAAQ,OACzBA,EAAK,QAAQA,EAAK,QAAQ,OAAS,CAAC,EAEtC,IACT,CACA,SAASI,GAAuBJ,EAAM,CACpC,IAAIvB,EAAa,GACjB,QAAS7P,EAAIoR,EAAK,UAAWpR,EAAIoR,EAAK,QAAQ,OAAQpR,IAChDoR,EAAK,QAAQpR,CAAC,IAAM,KACtB6P,GAAc,IAAM,mBAAmB,OAAOuB,EAAK,QAAQpR,CAAC,CAAC,CAAC,GAGlE,OAAO6P,GAAc,GACvB,CAKA,SAAS4B,GAAUL,EAAMM,EAAQ,EAAG,CAClC,OAAON,EAAK,QAAQ,MAAMA,EAAK,UAAYM,CAAK,CAClD,CACA,SAASC,GAAWP,EAAM,CACxB,GAAIA,EAAK,WAAaA,EAAK,QAAQ,OACjC,OAAO,KAET,IAAMQ,EAAS,CAAC,EAChB,QAAS5R,EAAIoR,EAAK,UAAWpR,EAAIoR,EAAK,QAAQ,OAAS,EAAGpR,IACxD4R,EAAO,KAAKR,EAAK,QAAQpR,CAAC,CAAC,EAE7B,OAAO,IAAI8Q,EAAKc,EAAQ,CAAC,CAC3B,CACA,SAASC,EAAUT,EAAMU,EAAc,CACrC,IAAMF,EAAS,CAAC,EAChB,QAAS,EAAIR,EAAK,UAAW,EAAIA,EAAK,QAAQ,OAAQ,IACpDQ,EAAO,KAAKR,EAAK,QAAQ,CAAC,CAAC,EAE7B,GAAIU,aAAwBhB,EAC1B,QAAS,EAAIgB,EAAa,UAAW,EAAIA,EAAa,QAAQ,OAAQ,IACpEF,EAAO,KAAKE,EAAa,QAAQ,CAAC,CAAC,MAEhC,CACL,IAAMC,EAAcD,EAAa,MAAM,GAAG,EAC1C,QAAS9R,EAAI,EAAGA,EAAI+R,EAAY,OAAQ/R,IAClC+R,EAAY/R,CAAC,EAAE,OAAS,GAC1B4R,EAAO,KAAKG,EAAY/R,CAAC,CAAC,CAGhC,CACA,OAAO,IAAI8Q,EAAKc,EAAQ,CAAC,CAC3B,CAIA,SAASI,EAAYZ,EAAM,CACzB,OAAOA,EAAK,WAAaA,EAAK,QAAQ,MACxC,CAIA,SAASa,EAAgBC,EAAWC,EAAW,CAC7C,IAAMC,EAAQjB,EAAae,CAAS,EAClCG,EAAQlB,EAAagB,CAAS,EAChC,GAAIC,IAAU,KACZ,OAAOD,EACF,GAAIC,IAAUC,EACnB,OAAOJ,EAAgBX,EAAaY,CAAS,EAAGZ,EAAaa,CAAS,CAAC,EAEvE,MAAM,IAAI,MAAM,8BAAgCA,EAAY,8BAAqCD,EAAY,GAAG,CAEpH,CAIA,SAASI,GAAYC,EAAMC,EAAO,CAChC,IAAMC,EAAWhB,GAAUc,EAAM,CAAC,EAC5BG,EAAYjB,GAAUe,EAAO,CAAC,EACpC,QAASxS,EAAI,EAAGA,EAAIyS,EAAS,QAAUzS,EAAI0S,EAAU,OAAQ1S,IAAK,CAChE,IAAM2S,EAAMlR,GAAYgR,EAASzS,CAAC,EAAG0S,EAAU1S,CAAC,CAAC,EACjD,GAAI2S,IAAQ,EACV,OAAOA,CAEX,CACA,OAAIF,EAAS,SAAWC,EAAU,OACzB,EAEFD,EAAS,OAASC,EAAU,OAAS,GAAK,CACnD,CAIA,SAASE,GAAWxB,EAAMyB,EAAO,CAC/B,GAAIxB,GAAcD,CAAI,IAAMC,GAAcwB,CAAK,EAC7C,MAAO,GAET,QAAS7S,EAAIoR,EAAK,UAAW0B,EAAID,EAAM,UAAW7S,GAAKoR,EAAK,QAAQ,OAAQpR,IAAK8S,IAC/E,GAAI1B,EAAK,QAAQpR,CAAC,IAAM6S,EAAM,QAAQC,CAAC,EACrC,MAAO,GAGX,MAAO,EACT,CAIA,SAASC,EAAa3B,EAAMyB,EAAO,CACjC,IAAI7S,EAAIoR,EAAK,UACT0B,EAAID,EAAM,UACd,GAAIxB,GAAcD,CAAI,EAAIC,GAAcwB,CAAK,EAC3C,MAAO,GAET,KAAO7S,EAAIoR,EAAK,QAAQ,QAAQ,CAC9B,GAAIA,EAAK,QAAQpR,CAAC,IAAM6S,EAAM,QAAQC,CAAC,EACrC,MAAO,GAET,EAAE9S,EACF,EAAE8S,CACJ,CACA,MAAO,EACT,CAWA,IAAME,GAAN,KAAqB,CAKnB,YAAY5B,EAAM6B,EAAc,CAC9B,KAAK,aAAeA,EACpB,KAAK,OAASxB,GAAUL,EAAM,CAAC,EAE/B,KAAK,YAAc,KAAK,IAAI,EAAG,KAAK,OAAO,MAAM,EACjD,QAAS,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IACtC,KAAK,aAAe8B,GAAa,KAAK,OAAO,CAAC,CAAC,EAEjDC,GAAyB,IAAI,CAC/B,CACF,EACA,SAASC,GAAmBC,EAAgBC,EAAO,CAE7CD,EAAe,OAAO,OAAS,IACjCA,EAAe,aAAe,GAEhCA,EAAe,OAAO,KAAKC,CAAK,EAChCD,EAAe,aAAeH,GAAaI,CAAK,EAChDH,GAAyBE,CAAc,CACzC,CACA,SAASE,GAAkBF,EAAgB,CACzC,IAAMG,EAAOH,EAAe,OAAO,IAAI,EACvCA,EAAe,aAAeH,GAAaM,CAAI,EAE3CH,EAAe,OAAO,OAAS,IACjCA,EAAe,aAAe,EAElC,CACA,SAASF,GAAyBE,EAAgB,CAChD,GAAIA,EAAe,YAAcxC,GAC/B,MAAM,IAAI,MAAMwC,EAAe,aAAe,8BAAgCxC,GAAwB,WAAawC,EAAe,YAAc,IAAI,EAEtJ,GAAIA,EAAe,OAAO,OAASzC,GACjC,MAAM,IAAI,MAAMyC,EAAe,aAAe,iEAAmEzC,GAAiB,gCAAkC6C,GAA4BJ,CAAc,CAAC,CAEnN,CAIA,SAASI,GAA4BJ,EAAgB,CACnD,OAAIA,EAAe,OAAO,SAAW,EAC5B,GAEF,gBAAkBA,EAAe,OAAO,KAAK,GAAG,EAAI,GAC7D,CAkBA,IAAMK,GAAN,MAAMC,UAA0BzD,EAAa,CAC3C,OAAO,aAAc,CACnB,OAAO,IAAIyD,CACb,CACA,aAAc,CACZ,MAAM,CAAC,SAAS,CAAC,EACjB,IAAIC,EACAC,EACA,OAAO,SAAa,KAAe,OAAO,SAAS,iBAAqB,MACtE,OAAO,SAAS,OAAc,KAEhCA,EAAmB,mBACnBD,EAAS,UACA,OAAO,SAAS,UAAiB,KAC1CC,EAAmB,sBACnBD,EAAS,aACA,OAAO,SAAS,SAAgB,KACzCC,EAAmB,qBACnBD,EAAS,YACA,OAAO,SAAS,aAAoB,MAC7CC,EAAmB,yBACnBD,EAAS,iBAOb,KAAK,SAAW,GACZC,GACF,SAAS,iBAAiBA,EAAkB,IAAM,CAChD,IAAMC,EAAU,CAAC,SAASF,CAAM,EAC5BE,IAAY,KAAK,WACnB,KAAK,SAAWA,EAChB,KAAK,QAAQ,UAAWA,CAAO,EAEnC,EAAG,EAAK,CAEZ,CACA,gBAAgB1D,EAAW,CACzB,OAAA7P,EAAO6P,IAAc,UAAW,uBAAyBA,CAAS,EAC3D,CAAC,KAAK,QAAQ,CACvB,CACF,EAkBA,IAAM2D,GAAsB,IACtBC,GAA8B,GAAK,EAAI,IACvCC,GAAiC,GAAK,IACtCC,GAA6B,IAC7BC,GAAgC,IAChCC,GAA+B,cAE/BC,GAA0B,EAO5BC,IAAqC,IAAM,CAC7C,MAAMA,UAA6B1E,EAAc,CAM/C,YAAYtB,EAAWC,EAAgBgG,EAAeC,EAAkBC,EAAqBC,EAAoBC,EAAwBC,EAAe,CAuCtJ,GAtCA,MAAM,EACN,KAAK,UAAYtG,EACjB,KAAK,eAAiBC,EACtB,KAAK,cAAgBgG,EACrB,KAAK,iBAAmBC,EACxB,KAAK,oBAAsBC,EAC3B,KAAK,mBAAqBC,EAC1B,KAAK,uBAAyBC,EAC9B,KAAK,cAAgBC,EAErB,KAAK,GAAKN,EAAqB,8BAC/B,KAAK,KAAO5T,GAAW,KAAO,KAAK,GAAK,GAAG,EAC3C,KAAK,kBAAoB,CAAC,EAC1B,KAAK,QAAU,IAAI,IACnB,KAAK,iBAAmB,CAAC,EACzB,KAAK,iBAAmB,CAAC,EACzB,KAAK,qBAAuB,EAC5B,KAAK,qBAAuB,EAC5B,KAAK,0BAA4B,CAAC,EAClC,KAAK,WAAa,GAClB,KAAK,gBAAkBqT,GACvB,KAAK,mBAAqBC,GAC1B,KAAK,uBAAyB,KAC9B,KAAK,cAAgB,KACrB,KAAK,0BAA4B,KACjC,KAAK,SAAW,GAEhB,KAAK,eAAiB,CAAC,EACvB,KAAK,eAAiB,EACtB,KAAK,UAAY,KACjB,KAAK,WAAa,KAClB,KAAK,eAAiB,KACtB,KAAK,mBAAqB,GAC1B,KAAK,uBAAyB,EAC9B,KAAK,2BAA6B,EAClC,KAAK,iBAAmB,GACxB,KAAK,2BAA6B,KAClC,KAAK,+BAAiC,KAClCY,GAAiB,CAACxT,EAAU,EAC9B,MAAM,IAAI,MAAM,gFAAgF,EAElGsS,GAAkB,YAAY,EAAE,GAAG,UAAW,KAAK,WAAY,IAAI,EAC/DpF,EAAU,KAAK,QAAQ,SAAS,IAAM,IACxCmC,GAAc,YAAY,EAAE,GAAG,SAAU,KAAK,UAAW,IAAI,CAEjE,CACA,YAAYoE,EAAQC,EAAMC,EAAY,CACpC,IAAMC,EAAY,EAAE,KAAK,eACnB7F,EAAM,CACV6F,EACA,EAAGH,EACH,EAAGC,CACL,EACA,KAAK,KAAKtW,EAAU2Q,CAAG,CAAC,EACxB5O,EAAO,KAAK,WAAY,wDAAwD,EAChF,KAAK,UAAU,YAAY4O,CAAG,EAC1B4F,IACF,KAAK,eAAeC,CAAS,EAAID,EAErC,CACA,IAAIrR,EAAO,CACT,KAAK,gBAAgB,EACrB,IAAMuR,EAAW,IAAIC,EAKfC,EAAiB,CACrB,OAAQ,IACR,QANc,CACd,EAAGzR,EAAM,MAAM,SAAS,EACxB,EAAGA,EAAM,YACX,EAIE,WAAY3D,GAAW,CACrB,IAAMyP,EAAUzP,EAAQ,EACpBA,EAAQ,IAAS,KACnBkV,EAAS,QAAQzF,CAAO,EAExByF,EAAS,OAAOzF,CAAO,CAE3B,CACF,EACA,KAAK,iBAAiB,KAAK2F,CAAc,EACzC,KAAK,uBACL,IAAMC,EAAQ,KAAK,iBAAiB,OAAS,EAC7C,OAAI,KAAK,YACP,KAAK,SAASA,CAAK,EAEdH,EAAS,OAClB,CACA,OAAOvR,EAAO2R,EAAeC,EAAKxF,EAAY,CAC5C,KAAK,gBAAgB,EACrB,IAAMyF,EAAU7R,EAAM,iBAChBmM,EAAanM,EAAM,MAAM,SAAS,EACxC,KAAK,KAAK,qBAAuBmM,EAAa,IAAM0F,CAAO,EACtD,KAAK,QAAQ,IAAI1F,CAAU,GAC9B,KAAK,QAAQ,IAAIA,EAAY,IAAI,GAAK,EAExCtP,EAAOmD,EAAM,aAAa,UAAU,GAAK,CAACA,EAAM,aAAa,aAAa,EAAG,oDAAoD,EACjInD,EAAO,CAAC,KAAK,QAAQ,IAAIsP,CAAU,EAAE,IAAI0F,CAAO,EAAG,8CAA8C,EACjG,IAAMC,EAAa,CACjB,WAAA1F,EACA,OAAQuF,EACR,MAAA3R,EACA,IAAA4R,CACF,EACA,KAAK,QAAQ,IAAIzF,CAAU,EAAE,IAAI0F,EAASC,CAAU,EAChD,KAAK,YACP,KAAK,YAAYA,CAAU,CAE/B,CACA,SAASJ,EAAO,CACd,IAAMK,EAAM,KAAK,iBAAiBL,CAAK,EACvC,KAAK,YAAY,IAAKK,EAAI,QAAS1V,GAAW,CAC5C,OAAO,KAAK,iBAAiBqV,CAAK,EAClC,KAAK,uBACD,KAAK,uBAAyB,IAChC,KAAK,iBAAmB,CAAC,GAEvBK,EAAI,YACNA,EAAI,WAAW1V,CAAO,CAE1B,CAAC,CACH,CACA,YAAYyV,EAAY,CACtB,IAAM9R,EAAQ8R,EAAW,MACnB3F,EAAanM,EAAM,MAAM,SAAS,EAClC6R,EAAU7R,EAAM,iBACtB,KAAK,KAAK,aAAemM,EAAa,QAAU0F,CAAO,EACvD,IAAMG,EAAM,CACF,EAAG7F,CACb,EACMgF,EAAS,IAEXW,EAAW,MACbE,EAAI,EAAOhS,EAAM,aACjBgS,EAAI,EAAOF,EAAW,KAExBE,EAAY,EAAOF,EAAW,OAAO,EACrC,KAAK,YAAYX,EAAQa,EAAK3V,GAAW,CACvC,IAAMyP,EAAUzP,EAAgB,EAC1B4V,EAAS5V,EAAkB,EAEjCuU,EAAqB,sBAAsB9E,EAAS9L,CAAK,GAC/B,KAAK,QAAQ,IAAImM,CAAU,GAAK,KAAK,QAAQ,IAAIA,CAAU,EAAE,IAAI0F,CAAO,KAExEC,IACxB,KAAK,KAAK,kBAAmBzV,CAAO,EAChC4V,IAAW,MACb,KAAK,cAAc9F,EAAY0F,CAAO,EAEpCC,EAAW,YACbA,EAAW,WAAWG,EAAQnG,CAAO,EAG3C,CAAC,CACH,CACA,OAAO,sBAAsBA,EAAS9L,EAAO,CAC3C,GAAI8L,GAAW,OAAOA,GAAY,UAAY5Q,EAAS4Q,EAAS,GAAG,EAAG,CAEpE,IAAMoG,EAAWC,GAAQrG,EAAS,GAAG,EACrC,GAAI,MAAM,QAAQoG,CAAQ,GAAK,CAACA,EAAS,QAAQ,UAAU,EAAG,CAC5D,IAAME,EAAY,gBAAkBpS,EAAM,aAAa,SAAS,EAAE,SAAS,EAAI,IACzEqS,EAAYrS,EAAM,MAAM,SAAS,EACvC5C,EAAK,wGAA6GgV,CAAS,OAAYC,CAAS,iDAAiD,CACnM,CACF,CACF,CACA,iBAAiB/F,EAAO,CACtB,KAAK,WAAaA,EAClB,KAAK,KAAK,sBAAsB,EAC5B,KAAK,WACP,KAAK,QAAQ,EAIT,KAAK,YACP,KAAK,YAAY,SAAU,CAAC,EAAG,IAAM,CAAC,CAAC,EAG3C,KAAK,uCAAuCA,CAAK,CACnD,CACA,uCAAuCgG,EAAY,EAGxBA,GAAcA,EAAW,SAAW,IACrCC,GAAQD,CAAU,KACxC,KAAK,KAAK,+DAA+D,EACzE,KAAK,mBAAqB/B,GAE9B,CACA,qBAAqBjE,EAAO,CAC1B,KAAK,eAAiBA,EACtB,KAAK,KAAK,2BAA2B,EACjC,KAAK,eACP,KAAK,YAAY,EAKb,KAAK,YACP,KAAK,YAAY,WAAY,CAAC,EAAG,IAAM,CAAC,CAAC,CAG/C,CAKA,SAAU,CACR,GAAI,KAAK,YAAc,KAAK,WAAY,CACtC,IAAMA,EAAQ,KAAK,WACbkG,EAAaC,GAAcnG,CAAK,EAAI,OAAS,QAC7CoG,EAAc,CAClB,KAAMpG,CACR,EACI,KAAK,gBAAkB,KACzBoG,EAAY,OAAY,GACf,OAAO,KAAK,eAAkB,WACvCA,EAAY,QAAa,KAAK,eAEhC,KAAK,YAAYF,EAAYE,EAAaC,GAAO,CAC/C,IAAMV,EAASU,EAAc,EACvBpV,EAAOoV,EAAY,GAAQ,QAC7B,KAAK,aAAerG,IAClB2F,IAAW,KACb,KAAK,uBAAyB,EAG9B,KAAK,eAAeA,EAAQ1U,CAAI,EAGtC,CAAC,CACH,CACF,CAMA,aAAc,CACR,KAAK,YAAc,KAAK,gBAC1B,KAAK,YAAY,WAAY,CAC3B,MAAS,KAAK,cAChB,EAAGoV,GAAO,CACR,IAAMV,EAASU,EAAc,EACvBpV,EAAOoV,EAAY,GAAQ,QAC7BV,IAAW,KACb,KAAK,2BAA6B,EAElC,KAAK,mBAAmBA,EAAQ1U,CAAI,CAExC,CAAC,CAEL,CAIA,SAASyC,EAAO4R,EAAK,CACnB,IAAMzF,EAAanM,EAAM,MAAM,SAAS,EAClC6R,EAAU7R,EAAM,iBACtB,KAAK,KAAK,uBAAyBmM,EAAa,IAAM0F,CAAO,EAC7DhV,EAAOmD,EAAM,aAAa,UAAU,GAAK,CAACA,EAAM,aAAa,aAAa,EAAG,sDAAsD,EACpH,KAAK,cAAcmM,EAAY0F,CAAO,GACvC,KAAK,YACjB,KAAK,cAAc1F,EAAY0F,EAAS7R,EAAM,aAAc4R,CAAG,CAEnE,CACA,cAAczF,EAAY0F,EAASe,EAAUhB,EAAK,CAChD,KAAK,KAAK,eAAiBzF,EAAa,QAAU0F,CAAO,EACzD,IAAMG,EAAM,CACF,EAAG7F,CACb,EACMgF,EAAS,IAEXS,IACFI,EAAI,EAAOY,EACXZ,EAAI,EAAOJ,GAEb,KAAK,YAAYT,EAAQa,CAAG,CAC9B,CACA,gBAAgB7F,EAAY5O,EAAM6O,EAAY,CAC5C,KAAK,gBAAgB,EACjB,KAAK,WACP,KAAK,kBAAkB,IAAKD,EAAY5O,EAAM6O,CAAU,EAExD,KAAK,0BAA0B,KAAK,CAClC,WAAAD,EACA,OAAQ,IACR,KAAA5O,EACA,WAAA6O,CACF,CAAC,CAEL,CACA,kBAAkBD,EAAY5O,EAAM6O,EAAY,CAC9C,KAAK,gBAAgB,EACjB,KAAK,WACP,KAAK,kBAAkB,KAAMD,EAAY5O,EAAM6O,CAAU,EAEzD,KAAK,0BAA0B,KAAK,CAClC,WAAAD,EACA,OAAQ,KACR,KAAA5O,EACA,WAAA6O,CACF,CAAC,CAEL,CACA,mBAAmBD,EAAYC,EAAY,CACzC,KAAK,gBAAgB,EACjB,KAAK,WACP,KAAK,kBAAkB,KAAMD,EAAY,KAAMC,CAAU,EAEzD,KAAK,0BAA0B,KAAK,CAClC,WAAAD,EACA,OAAQ,KACR,KAAM,KACN,WAAAC,CACF,CAAC,CAEL,CACA,kBAAkB+E,EAAQhF,EAAY5O,EAAM6O,EAAY,CACtD,IAAMyG,EAAU,CACN,EAAG1G,EACH,EAAG5O,CACb,EACA,KAAK,KAAK,gBAAkB4T,EAAQ0B,CAAO,EAC3C,KAAK,YAAY1B,EAAQ0B,EAASC,GAAY,CACxC1G,GACF,WAAW,IAAM,CACfA,EAAW0G,EAAmB,EAAMA,EAAmB,CAAI,CAC7D,EAAG,KAAK,MAAM,CAAC,CAAC,CAEpB,CAAC,CACH,CACA,IAAI3G,EAAY5O,EAAM6O,EAAYC,EAAM,CACtC,KAAK,YAAY,IAAKF,EAAY5O,EAAM6O,EAAYC,CAAI,CAC1D,CACA,MAAMF,EAAY5O,EAAM6O,EAAYC,EAAM,CACxC,KAAK,YAAY,IAAKF,EAAY5O,EAAM6O,EAAYC,CAAI,CAC1D,CACA,YAAY8E,EAAQhF,EAAY5O,EAAM6O,EAAYC,EAAM,CACtD,KAAK,gBAAgB,EACrB,IAAMwG,EAAU,CACN,EAAG1G,EACH,EAAG5O,CACb,EACI8O,IAAS,SACXwG,EAAgB,EAAOxG,GAGzB,KAAK,iBAAiB,KAAK,CACzB,OAAA8E,EACA,QAAA0B,EACA,WAAAzG,CACF,CAAC,EACD,KAAK,uBACL,IAAMsF,EAAQ,KAAK,iBAAiB,OAAS,EACzC,KAAK,WACP,KAAK,SAASA,CAAK,EAEnB,KAAK,KAAK,kBAAoBvF,CAAU,CAE5C,CACA,SAASuF,EAAO,CACd,IAAMP,EAAS,KAAK,iBAAiBO,CAAK,EAAE,OACtCmB,EAAU,KAAK,iBAAiBnB,CAAK,EAAE,QACvCtF,EAAa,KAAK,iBAAiBsF,CAAK,EAAE,WAChD,KAAK,iBAAiBA,CAAK,EAAE,OAAS,KAAK,WAC3C,KAAK,YAAYP,EAAQ0B,EAASxW,GAAW,CAC3C,KAAK,KAAK8U,EAAS,YAAa9U,CAAO,EACvC,OAAO,KAAK,iBAAiBqV,CAAK,EAClC,KAAK,uBAED,KAAK,uBAAyB,IAChC,KAAK,iBAAmB,CAAC,GAEvBtF,GACFA,EAAW/P,EAAkB,EAAMA,EAAkB,CAAI,CAE7D,CAAC,CACH,CACA,YAAYkQ,EAAO,CAEjB,GAAI,KAAK,WAAY,CACnB,IAAMsG,EAAU,CACF,EAAGtG,CACjB,EACA,KAAK,KAAK,cAAesG,CAAO,EAChC,KAAK,YAAqB,IAAKA,EAASE,GAAU,CAEhD,GADeA,EAAiB,IACjB,KAAM,CACnB,IAAMC,EAAcD,EAAiB,EACrC,KAAK,KAAK,cAAe,wBAA0BC,CAAW,CAChE,CACF,CAAC,CACH,CACF,CACA,eAAe3W,EAAS,CACtB,GAAI,MAAOA,EAAS,CAElB,KAAK,KAAK,gBAAkBvB,EAAUuB,CAAO,CAAC,EAC9C,IAAM4W,EAAS5W,EAAQ,EACjBgV,EAAa,KAAK,eAAe4B,CAAM,EACzC5B,IACF,OAAO,KAAK,eAAe4B,CAAM,EACjC5B,EAAWhV,EAAgB,CAAI,EAEnC,KAAO,IAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAQ,MAC5C,MAAOA,GAEhB,KAAK,YAAYA,EAAQ,EAAMA,EAAQ,CAAI,EAE/C,CACA,YAAY8U,EAAQC,EAAM,CACxB,KAAK,KAAK,sBAAuBD,EAAQC,CAAI,EACzCD,IAAW,IACb,KAAK,cAAcC,EAAa,EAAMA,EAAa,EAAiB,GAAOA,EAAK,CAAI,EAC3ED,IAAW,IACpB,KAAK,cAAcC,EAAa,EAAMA,EAAa,EAAkB,GAAMA,EAAK,CAAI,EAC3ED,IAAW,IACpB,KAAK,iBAAiBC,EAAa,EAAMA,EAAc,CAAI,EAClDD,IAAW,KACpB,KAAK,eAAeC,EAAoB,EAAMA,EAAsB,CAAI,EAC/DD,IAAW,MACpB,KAAK,mBAAmBC,EAAoB,EAAMA,EAAsB,CAAI,EACnED,IAAW,KACpB,KAAK,uBAAuBC,CAAI,EAEhClU,GAAM,6CAA+CpC,EAAUqW,CAAM,EAAI;AAAA,iCAAoC,CAEjH,CACA,SAASlF,EAAWiH,EAAW,CAC7B,KAAK,KAAK,kBAAkB,EAC5B,KAAK,WAAa,GAClB,KAAK,+BAAiC,IAAI,KAAK,EAAE,QAAQ,EACzD,KAAK,iBAAiBjH,CAAS,EAC/B,KAAK,cAAgBiH,EACjB,KAAK,kBACP,KAAK,kBAAkB,EAEzB,KAAK,cAAc,EACnB,KAAK,iBAAmB,GACxB,KAAK,iBAAiB,EAAI,CAC5B,CACA,iBAAiBvS,EAAS,CACxB9D,EAAO,CAAC,KAAK,UAAW,wDAAwD,EAC5E,KAAK,2BACP,aAAa,KAAK,yBAAyB,EAI7C,KAAK,0BAA4B,WAAW,IAAM,CAChD,KAAK,0BAA4B,KACjC,KAAK,qBAAqB,CAE5B,EAAG,KAAK,MAAM8D,CAAO,CAAC,CACxB,CACA,iBAAkB,CACZ,CAAC,KAAK,WAAa,KAAK,kBAC1B,KAAK,iBAAiB,CAAC,CAE3B,CACA,WAAWyP,EAAS,CAEdA,GAAW,CAAC,KAAK,UAAY,KAAK,kBAAoB,KAAK,qBAC7D,KAAK,KAAK,yCAAyC,EACnD,KAAK,gBAAkBC,GAClB,KAAK,WACR,KAAK,iBAAiB,CAAC,GAG3B,KAAK,SAAWD,CAClB,CACA,UAAU+C,EAAQ,CACZA,GACF,KAAK,KAAK,sBAAsB,EAChC,KAAK,gBAAkB9C,GAClB,KAAK,WACR,KAAK,iBAAiB,CAAC,IAGzB,KAAK,KAAK,4CAA4C,EAClD,KAAK,WACP,KAAK,UAAU,MAAM,EAG3B,CACA,uBAAwB,CAQtB,GAPA,KAAK,KAAK,0BAA0B,EACpC,KAAK,WAAa,GAClB,KAAK,UAAY,KAEjB,KAAK,wBAAwB,EAE7B,KAAK,eAAiB,CAAC,EACnB,KAAK,iBAAiB,EAAG,CACtB,KAAK,SAIC,KAAK,iCAEwB,IAAI,KAAK,EAAE,QAAQ,EAAI,KAAK,+BAC9BI,KAClC,KAAK,gBAAkBJ,IAEzB,KAAK,+BAAiC,OATtC,KAAK,KAAK,4CAA4C,EACtD,KAAK,gBAAkB,KAAK,mBAC5B,KAAK,2BAA6B,IAAI,KAAK,EAAE,QAAQ,GASvD,IAAM+C,EAA8B,IAAI,KAAK,EAAE,QAAQ,EAAI,KAAK,2BAC5DC,EAAiB,KAAK,IAAI,EAAG,KAAK,gBAAkBD,CAA2B,EACnFC,EAAiB,KAAK,OAAO,EAAIA,EACjC,KAAK,KAAK,0BAA4BA,EAAiB,IAAI,EAC3D,KAAK,iBAAiBA,CAAc,EAEpC,KAAK,gBAAkB,KAAK,IAAI,KAAK,mBAAoB,KAAK,gBAAkB7C,EAA0B,CAC5G,CACA,KAAK,iBAAiB,EAAK,CAC7B,CACM,sBAAuB,QAAA8C,EAAA,sBAC3B,GAAI,KAAK,iBAAiB,EAAG,CAC3B,KAAK,KAAK,6BAA6B,EACvC,KAAK,2BAA6B,IAAI,KAAK,EAAE,QAAQ,EACrD,KAAK,+BAAiC,KACtC,IAAMC,EAAgB,KAAK,eAAe,KAAK,IAAI,EAC7CC,EAAU,KAAK,SAAS,KAAK,IAAI,EACjCtN,EAAe,KAAK,sBAAsB,KAAK,IAAI,EACnDP,EAAS,KAAK,GAAK,IAAMiL,EAAqB,oBAC9C5K,EAAgB,KAAK,cACvByN,EAAW,GACXC,EAAa,KACXC,EAAU,UAAY,CACtBD,EACFA,EAAW,MAAM,GAEjBD,EAAW,GACXvN,EAAa,EAEjB,EACM0N,EAAgB,SAAUnI,EAAK,CACnC5O,EAAO6W,EAAY,wDAAwD,EAC3EA,EAAW,YAAYjI,CAAG,CAC5B,EACA,KAAK,UAAY,CACf,MAAOkI,EACP,YAAaC,CACf,EACA,IAAM5S,EAAe,KAAK,mBAC1B,KAAK,mBAAqB,GAC1B,GAAI,CAGF,GAAM,CAAC8E,EAAWD,CAAa,EAAI,MAAM,QAAQ,IAAI,CAAC,KAAK,mBAAmB,SAAS7E,CAAY,EAAG,KAAK,uBAAuB,SAASA,CAAY,CAAC,CAAC,EACpJyS,EASH1W,EAAI,uCAAuC,GAR3CA,EAAI,4CAA4C,EAChD,KAAK,WAAa+I,GAAaA,EAAU,YACzC,KAAK,eAAiBD,GAAiBA,EAAc,MACrD6N,EAAa,IAAI/I,GAAWhF,EAAQ,KAAK,UAAW,KAAK,eAAgB,KAAK,eAAgB,KAAK,WAAY4N,EAAeC,EAAStN,EAA2BjG,GAAU,CAC1K7C,EAAK6C,EAAS,KAAO,KAAK,UAAU,SAAS,EAAI,GAAG,EACpD,KAAK,UAAUyQ,EAA4B,CAC7C,EAAG1K,CAAa,EAIpB,OAAS9I,EAAO,CACd,KAAK,KAAK,wBAA0BA,CAAK,EACpCuW,IACC,KAAK,UAAU,WAIjBrW,EAAKF,CAAK,EAEZyW,EAAQ,EAEZ,CACF,CACF,GACA,UAAU1T,EAAQ,CAChBlD,EAAI,uCAAyCkD,CAAM,EACnD,KAAK,kBAAkBA,CAAM,EAAI,GAC7B,KAAK,UACP,KAAK,UAAU,MAAM,GAEjB,KAAK,4BACP,aAAa,KAAK,yBAAyB,EAC3C,KAAK,0BAA4B,MAE/B,KAAK,YACP,KAAK,sBAAsB,EAGjC,CACA,OAAOA,EAAQ,CACblD,EAAI,mCAAqCkD,CAAM,EAC/C,OAAO,KAAK,kBAAkBA,CAAM,EAChC4T,GAAQ,KAAK,iBAAiB,IAChC,KAAK,gBAAkBxD,GAClB,KAAK,WACR,KAAK,iBAAiB,CAAC,EAG7B,CACA,iBAAiBpE,EAAW,CAC1B,IAAM6H,EAAQ7H,EAAY,IAAI,KAAK,EAAE,QAAQ,EAC7C,KAAK,oBAAoB,CACvB,iBAAkB6H,CACpB,CAAC,CACH,CACA,yBAA0B,CACxB,QAASxX,EAAI,EAAGA,EAAI,KAAK,iBAAiB,OAAQA,IAAK,CACrD,IAAMyX,EAAM,KAAK,iBAAiBzX,CAAC,EAC/ByX,GAAe,MAAOA,EAAI,SAAWA,EAAI,SACvCA,EAAI,YACNA,EAAI,WAAW,YAAY,EAE7B,OAAO,KAAK,iBAAiBzX,CAAC,EAC9B,KAAK,uBAET,CAEI,KAAK,uBAAyB,IAChC,KAAK,iBAAmB,CAAC,EAE7B,CACA,iBAAiB6P,EAAYnM,EAAO,CAElC,IAAI6R,EACC7R,EAGH6R,EAAU7R,EAAM,IAAIgU,GAAKxV,GAAkBwV,CAAC,CAAC,EAAE,KAAK,GAAG,EAFvDnC,EAAU,UAIZ,IAAMoC,EAAS,KAAK,cAAc9H,EAAY0F,CAAO,EACjDoC,GAAUA,EAAO,YACnBA,EAAO,WAAW,mBAAmB,CAEzC,CACA,cAAc9H,EAAY0F,EAAS,CACjC,IAAMqC,EAAuB,IAAI9G,EAAKjB,CAAU,EAAE,SAAS,EACvD8H,EACJ,GAAI,KAAK,QAAQ,IAAIC,CAAoB,EAAG,CAC1C,IAAMC,EAAM,KAAK,QAAQ,IAAID,CAAoB,EACjDD,EAASE,EAAI,IAAItC,CAAO,EACxBsC,EAAI,OAAOtC,CAAO,EACdsC,EAAI,OAAS,GACf,KAAK,QAAQ,OAAOD,CAAoB,CAE5C,MAEED,EAAS,OAEX,OAAOA,CACT,CACA,eAAeG,EAAYC,EAAa,CACtCtX,EAAI,uBAAyBqX,EAAa,IAAMC,CAAW,EAC3D,KAAK,WAAa,KAClB,KAAK,mBAAqB,GAC1B,KAAK,UAAU,MAAM,GACjBD,IAAe,iBAAmBA,IAAe,uBAInD,KAAK,yBACD,KAAK,wBAA0BzD,KAEjC,KAAK,gBAAkBJ,GAGvB,KAAK,mBAAmB,sBAAsB,GAGpD,CACA,mBAAmB6D,EAAYC,EAAa,CAC1CtX,EAAI,4BAA8BqX,EAAa,IAAMC,CAAW,EAChE,KAAK,eAAiB,KACtB,KAAK,mBAAqB,IAGtBD,IAAe,iBAAmBA,IAAe,uBAInD,KAAK,6BACD,KAAK,4BAA8BzD,IACrC,KAAK,uBAAuB,sBAAsB,EAGxD,CACA,uBAAuBS,EAAM,CACvB,KAAK,uBACP,KAAK,uBAAuBA,CAAI,EAE5B,QAASA,GACX,QAAQ,IAAI,aAAeA,EAAK,IAAO,QAAQ;AAAA,EAAM;AAAA,WAAc,CAAC,CAG1E,CACA,eAAgB,CAEd,KAAK,QAAQ,EACb,KAAK,YAAY,EAGjB,QAAWkD,KAAW,KAAK,QAAQ,OAAO,EACxC,QAAWxC,KAAcwC,EAAQ,OAAO,EACtC,KAAK,YAAYxC,CAAU,EAG/B,QAASxV,EAAI,EAAGA,EAAI,KAAK,iBAAiB,OAAQA,IAC5C,KAAK,iBAAiBA,CAAC,GACzB,KAAK,SAASA,CAAC,EAGnB,KAAO,KAAK,0BAA0B,QAAQ,CAC5C,IAAMuW,EAAU,KAAK,0BAA0B,MAAM,EACrD,KAAK,kBAAkBA,EAAQ,OAAQA,EAAQ,WAAYA,EAAQ,KAAMA,EAAQ,UAAU,CAC7F,CACA,QAASvW,EAAI,EAAGA,EAAI,KAAK,iBAAiB,OAAQA,IAC5C,KAAK,iBAAiBA,CAAC,GACzB,KAAK,SAASA,CAAC,CAGrB,CAIA,mBAAoB,CAClB,IAAMiQ,EAAQ,CAAC,EACXgI,EAAa,KACb7W,EAAU,IACR,KAAK,UAAU,UACjB6W,EAAa,aAEbA,EAAa,QAGjBhI,EAAM,OAASgI,EAAa,IAAM/Z,GAAY,QAAQ,MAAO,GAAG,CAAC,EAAI,EACjEyS,GAAgB,EAClBV,EAAM,mBAAmB,EAAI,EACpBiI,GAAc,IACvBjI,EAAM,uBAAuB,EAAI,GAEnC,KAAK,YAAYA,CAAK,CACxB,CACA,kBAAmB,CACjB,IAAM4G,EAASpG,GAAc,YAAY,EAAE,gBAAgB,EAC3D,OAAO8G,GAAQ,KAAK,iBAAiB,GAAKV,CAC5C,CACF,CACAvC,EAAqB,4BAA8B,EAInDA,EAAqB,kBAAoB,EAkBzC,OAAOA,CACT,GAAG,EACG6D,EAAN,MAAMC,CAAU,CACd,YAAYpa,EAAMqa,EAAM,CACtB,KAAK,KAAOra,EACZ,KAAK,KAAOqa,CACd,CACA,OAAO,KAAKra,EAAMqa,EAAM,CACtB,OAAO,IAAID,EAAUpa,EAAMqa,CAAI,CACjC,CACF,EAkBA,IAAMC,GAAN,KAAY,CAKV,YAAa,CACX,OAAO,KAAK,QAAQ,KAAK,IAAI,CAC/B,CAQA,oBAAoBC,EAASC,EAAS,CACpC,IAAMC,EAAa,IAAIN,EAAU5W,GAAUgX,CAAO,EAC5CG,EAAa,IAAIP,EAAU5W,GAAUiX,CAAO,EAClD,OAAO,KAAK,QAAQC,EAAYC,CAAU,IAAM,CAClD,CAKA,SAAU,CAER,OAAOP,EAAU,GACnB,CACF,EAkBA,IAAIQ,GACEC,GAAN,cAAuBN,EAAM,CAC3B,WAAW,cAAe,CACxB,OAAOK,EACT,CACA,WAAW,aAAaE,EAAK,CAC3BF,GAAeE,CACjB,CACA,QAAQnX,EAAGC,EAAG,CACZ,OAAOF,GAAYC,EAAE,KAAMC,EAAE,IAAI,CACnC,CACA,YAAY0W,EAAM,CAGhB,MAAMS,GAAe,iDAAiD,CACxE,CACA,oBAAoBP,EAASC,EAAS,CACpC,MAAO,EACT,CACA,SAAU,CAER,OAAOL,EAAU,GACnB,CACA,SAAU,CAGR,OAAO,IAAIA,EAAU3W,GAAUmX,EAAY,CAC7C,CACA,SAASI,EAAY/a,EAAM,CACzB,OAAAuC,EAAO,OAAOwY,GAAe,SAAU,8CAA8C,EAE9E,IAAIZ,EAAUY,EAAYJ,EAAY,CAC/C,CAIA,UAAW,CACT,MAAO,MACT,CACF,EACMK,EAAY,IAAIJ,GAqBtB,IAAMK,GAAN,KAAwB,CAKtB,YAAYZ,EAAMa,EAAUC,EAAYC,EAAYC,EAAmB,KAAM,CAC3E,KAAK,WAAaD,EAClB,KAAK,iBAAmBC,EACxB,KAAK,WAAa,CAAC,EACnB,IAAI1G,EAAM,EACV,KAAO,CAAC0F,EAAK,QAAQ,GAOnB,GANAA,EAAOA,EACP1F,EAAMuG,EAAWC,EAAWd,EAAK,IAAKa,CAAQ,EAAI,EAE9CE,IACFzG,GAAO,IAELA,EAAM,EAEJ,KAAK,WACP0F,EAAOA,EAAK,KAEZA,EAAOA,EAAK,cAEL1F,IAAQ,EAAG,CAEpB,KAAK,WAAW,KAAK0F,CAAI,EACzB,KACF,MAEE,KAAK,WAAW,KAAKA,CAAI,EACrB,KAAK,WACPA,EAAOA,EAAK,MAEZA,EAAOA,EAAK,IAIpB,CACA,SAAU,CACR,GAAI,KAAK,WAAW,SAAW,EAC7B,OAAO,KAET,IAAIA,EAAO,KAAK,WAAW,IAAI,EAC3B5B,EASJ,GARI,KAAK,iBACPA,EAAS,KAAK,iBAAiB4B,EAAK,IAAKA,EAAK,KAAK,EAEnD5B,EAAS,CACP,IAAK4B,EAAK,IACV,MAAOA,EAAK,KACd,EAEE,KAAK,WAEP,IADAA,EAAOA,EAAK,KACL,CAACA,EAAK,QAAQ,GACnB,KAAK,WAAW,KAAKA,CAAI,EACzBA,EAAOA,EAAK,UAId,KADAA,EAAOA,EAAK,MACL,CAACA,EAAK,QAAQ,GACnB,KAAK,WAAW,KAAKA,CAAI,EACzBA,EAAOA,EAAK,KAGhB,OAAO5B,CACT,CACA,SAAU,CACR,OAAO,KAAK,WAAW,OAAS,CAClC,CACA,MAAO,CACL,GAAI,KAAK,WAAW,SAAW,EAC7B,OAAO,KAET,IAAM4B,EAAO,KAAK,WAAW,KAAK,WAAW,OAAS,CAAC,EACvD,OAAI,KAAK,iBACA,KAAK,iBAAiBA,EAAK,IAAKA,EAAK,KAAK,EAE1C,CACL,IAAKA,EAAK,IACV,MAAOA,EAAK,KACd,CAEJ,CACF,EAIIiB,GAAyB,IAAM,CACjC,MAAMA,CAAS,CAQb,YAAYhb,EAAKC,EAAOgb,EAAOhH,EAAMC,EAAO,CAC1C,KAAK,IAAMlU,EACX,KAAK,MAAQC,EACb,KAAK,MAAQgb,GAAwBD,EAAS,IAC9C,KAAK,KAAO/G,GAAsBiH,EAAU,WAC5C,KAAK,MAAQhH,GAAwBgH,EAAU,UACjD,CAWA,KAAKlb,EAAKC,EAAOgb,EAAOhH,EAAMC,EAAO,CACnC,OAAO,IAAI8G,EAAShb,GAAoB,KAAK,IAAKC,GAAwB,KAAK,MAAOgb,GAAwB,KAAK,MAAOhH,GAAsB,KAAK,KAAMC,GAAwB,KAAK,KAAK,CAC/L,CAIA,OAAQ,CACN,OAAO,KAAK,KAAK,MAAM,EAAI,EAAI,KAAK,MAAM,MAAM,CAClD,CAIA,SAAU,CACR,MAAO,EACT,CAUA,iBAAiBqC,EAAQ,CACvB,OAAO,KAAK,KAAK,iBAAiBA,CAAM,GAAK,CAAC,CAACA,EAAO,KAAK,IAAK,KAAK,KAAK,GAAK,KAAK,MAAM,iBAAiBA,CAAM,CACnH,CASA,iBAAiBA,EAAQ,CACvB,OAAO,KAAK,MAAM,iBAAiBA,CAAM,GAAKA,EAAO,KAAK,IAAK,KAAK,KAAK,GAAK,KAAK,KAAK,iBAAiBA,CAAM,CACjH,CAIA,MAAO,CACL,OAAI,KAAK,KAAK,QAAQ,EACb,KAEA,KAAK,KAAK,KAAK,CAE1B,CAIA,QAAS,CACP,OAAO,KAAK,KAAK,EAAE,GACrB,CAIA,QAAS,CACP,OAAI,KAAK,MAAM,QAAQ,EACd,KAAK,IAEL,KAAK,MAAM,OAAO,CAE7B,CAOA,OAAOvW,EAAKC,EAAO4a,EAAY,CAC7B,IAAIM,EAAI,KACF9G,EAAMwG,EAAW7a,EAAKmb,EAAE,GAAG,EACjC,OAAI9G,EAAM,EACR8G,EAAIA,EAAE,KAAK,KAAM,KAAM,KAAMA,EAAE,KAAK,OAAOnb,EAAKC,EAAO4a,CAAU,EAAG,IAAI,EAC/DxG,IAAQ,EACjB8G,EAAIA,EAAE,KAAK,KAAMlb,EAAO,KAAM,KAAM,IAAI,EAExCkb,EAAIA,EAAE,KAAK,KAAM,KAAM,KAAM,KAAMA,EAAE,MAAM,OAAOnb,EAAKC,EAAO4a,CAAU,CAAC,EAEpEM,EAAE,OAAO,CAClB,CAIA,YAAa,CACX,GAAI,KAAK,KAAK,QAAQ,EACpB,OAAOD,EAAU,WAEnB,IAAIC,EAAI,KACR,MAAI,CAACA,EAAE,KAAK,OAAO,GAAK,CAACA,EAAE,KAAK,KAAK,OAAO,IAC1CA,EAAIA,EAAE,aAAa,GAErBA,EAAIA,EAAE,KAAK,KAAM,KAAM,KAAMA,EAAE,KAAK,WAAW,EAAG,IAAI,EAC/CA,EAAE,OAAO,CAClB,CAMA,OAAOnb,EAAK6a,EAAY,CACtB,IAAIM,EAAGC,EAEP,GADAD,EAAI,KACAN,EAAW7a,EAAKmb,EAAE,GAAG,EAAI,EACvB,CAACA,EAAE,KAAK,QAAQ,GAAK,CAACA,EAAE,KAAK,OAAO,GAAK,CAACA,EAAE,KAAK,KAAK,OAAO,IAC/DA,EAAIA,EAAE,aAAa,GAErBA,EAAIA,EAAE,KAAK,KAAM,KAAM,KAAMA,EAAE,KAAK,OAAOnb,EAAK6a,CAAU,EAAG,IAAI,MAC5D,CAOL,GANIM,EAAE,KAAK,OAAO,IAChBA,EAAIA,EAAE,aAAa,GAEjB,CAACA,EAAE,MAAM,QAAQ,GAAK,CAACA,EAAE,MAAM,OAAO,GAAK,CAACA,EAAE,MAAM,KAAK,OAAO,IAClEA,EAAIA,EAAE,cAAc,GAElBN,EAAW7a,EAAKmb,EAAE,GAAG,IAAM,EAAG,CAChC,GAAIA,EAAE,MAAM,QAAQ,EAClB,OAAOD,EAAU,WAEjBE,EAAWD,EAAE,MAAM,KAAK,EACxBA,EAAIA,EAAE,KAAKC,EAAS,IAAKA,EAAS,MAAO,KAAM,KAAMD,EAAE,MAAM,WAAW,CAAC,CAE7E,CACAA,EAAIA,EAAE,KAAK,KAAM,KAAM,KAAM,KAAMA,EAAE,MAAM,OAAOnb,EAAK6a,CAAU,CAAC,CACpE,CACA,OAAOM,EAAE,OAAO,CAClB,CAIA,QAAS,CACP,OAAO,KAAK,KACd,CAIA,QAAS,CACP,IAAIA,EAAI,KACR,OAAIA,EAAE,MAAM,OAAO,GAAK,CAACA,EAAE,KAAK,OAAO,IACrCA,EAAIA,EAAE,YAAY,GAEhBA,EAAE,KAAK,OAAO,GAAKA,EAAE,KAAK,KAAK,OAAO,IACxCA,EAAIA,EAAE,aAAa,GAEjBA,EAAE,KAAK,OAAO,GAAKA,EAAE,MAAM,OAAO,IACpCA,EAAIA,EAAE,WAAW,GAEZA,CACT,CAIA,cAAe,CACb,IAAIA,EAAI,KAAK,WAAW,EACxB,OAAIA,EAAE,MAAM,KAAK,OAAO,IACtBA,EAAIA,EAAE,KAAK,KAAM,KAAM,KAAM,KAAMA,EAAE,MAAM,aAAa,CAAC,EACzDA,EAAIA,EAAE,YAAY,EAClBA,EAAIA,EAAE,WAAW,GAEZA,CACT,CAIA,eAAgB,CACd,IAAIA,EAAI,KAAK,WAAW,EACxB,OAAIA,EAAE,KAAK,KAAK,OAAO,IACrBA,EAAIA,EAAE,aAAa,EACnBA,EAAIA,EAAE,WAAW,GAEZA,CACT,CAIA,aAAc,CACZ,IAAME,EAAK,KAAK,KAAK,KAAM,KAAML,EAAS,IAAK,KAAM,KAAK,MAAM,IAAI,EACpE,OAAO,KAAK,MAAM,KAAK,KAAM,KAAM,KAAK,MAAOK,EAAI,IAAI,CACzD,CAIA,cAAe,CACb,IAAMC,EAAK,KAAK,KAAK,KAAM,KAAMN,EAAS,IAAK,KAAK,KAAK,MAAO,IAAI,EACpE,OAAO,KAAK,KAAK,KAAK,KAAM,KAAM,KAAK,MAAO,KAAMM,CAAE,CACxD,CAIA,YAAa,CACX,IAAMrH,EAAO,KAAK,KAAK,KAAK,KAAM,KAAM,CAAC,KAAK,KAAK,MAAO,KAAM,IAAI,EAC9DC,EAAQ,KAAK,MAAM,KAAK,KAAM,KAAM,CAAC,KAAK,MAAM,MAAO,KAAM,IAAI,EACvE,OAAO,KAAK,KAAK,KAAM,KAAM,CAAC,KAAK,MAAOD,EAAMC,CAAK,CACvD,CAMA,gBAAiB,CACf,IAAMqH,EAAa,KAAK,OAAO,EAC/B,OAAO,KAAK,IAAI,EAAKA,CAAU,GAAK,KAAK,MAAM,EAAI,CACrD,CACA,QAAS,CACP,GAAI,KAAK,OAAO,GAAK,KAAK,KAAK,OAAO,EACpC,MAAM,IAAI,MAAM,0BAA4B,KAAK,IAAM,IAAM,KAAK,MAAQ,GAAG,EAE/E,GAAI,KAAK,MAAM,OAAO,EACpB,MAAM,IAAI,MAAM,mBAAqB,KAAK,IAAM,IAAM,KAAK,MAAQ,UAAU,EAE/E,IAAMA,EAAa,KAAK,KAAK,OAAO,EACpC,GAAIA,IAAe,KAAK,MAAM,OAAO,EACnC,MAAM,IAAI,MAAM,qBAAqB,EAErC,OAAOA,GAAc,KAAK,OAAO,EAAI,EAAI,EAE7C,CACF,CACA,OAAAP,EAAS,IAAM,GACfA,EAAS,MAAQ,GAIVA,CACT,GAAG,EACGQ,GAAN,KAAoB,CAMlB,KAAKxb,EAAKC,EAAOgb,EAAOhH,EAAMC,EAAO,CACnC,OAAO,IACT,CASA,OAAOlU,EAAKC,EAAO4a,EAAY,CAC7B,OAAO,IAAIG,EAAShb,EAAKC,EAAO,IAAI,CACtC,CAQA,OAAOD,EAAK6a,EAAY,CACtB,OAAO,IACT,CAIA,OAAQ,CACN,MAAO,EACT,CAIA,SAAU,CACR,MAAO,EACT,CASA,iBAAiBtE,EAAQ,CACvB,MAAO,EACT,CASA,iBAAiBA,EAAQ,CACvB,MAAO,EACT,CACA,QAAS,CACP,OAAO,IACT,CACA,QAAS,CACP,OAAO,IACT,CACA,QAAS,CACP,MAAO,EACT,CAIA,QAAS,CACP,MAAO,EACT,CACF,EAKM2E,EAAN,MAAMO,CAAU,CAKd,YAAYC,EAAaC,EAAQF,EAAU,WAAY,CACrD,KAAK,YAAcC,EACnB,KAAK,MAAQC,CACf,CASA,OAAO3b,EAAKC,EAAO,CACjB,OAAO,IAAIwb,EAAU,KAAK,YAAa,KAAK,MAAM,OAAOzb,EAAKC,EAAO,KAAK,WAAW,EAAE,KAAK,KAAM,KAAM+a,EAAS,MAAO,KAAM,IAAI,CAAC,CACrI,CAOA,OAAOhb,EAAK,CACV,OAAO,IAAIyb,EAAU,KAAK,YAAa,KAAK,MAAM,OAAOzb,EAAK,KAAK,WAAW,EAAE,KAAK,KAAM,KAAMgb,EAAS,MAAO,KAAM,IAAI,CAAC,CAC9H,CAQA,IAAIhb,EAAK,CACP,IAAIqU,EACA0F,EAAO,KAAK,MAChB,KAAO,CAACA,EAAK,QAAQ,GAAG,CAEtB,GADA1F,EAAM,KAAK,YAAYrU,EAAK+Z,EAAK,GAAG,EAChC1F,IAAQ,EACV,OAAO0F,EAAK,MACH1F,EAAM,EACf0F,EAAOA,EAAK,KACH1F,EAAM,IACf0F,EAAOA,EAAK,MAEhB,CACA,OAAO,IACT,CAMA,kBAAkB/Z,EAAK,CACrB,IAAIqU,EACF0F,EAAO,KAAK,MACZ6B,EAAc,KAChB,KAAO,CAAC7B,EAAK,QAAQ,GAEnB,GADA1F,EAAM,KAAK,YAAYrU,EAAK+Z,EAAK,GAAG,EAChC1F,IAAQ,EAAG,CACb,GAAK0F,EAAK,KAAK,QAAQ,EAMhB,OAAI6B,EACFA,EAAY,IAEZ,KAPP,IADA7B,EAAOA,EAAK,KACL,CAACA,EAAK,MAAM,QAAQ,GACzBA,EAAOA,EAAK,MAEd,OAAOA,EAAK,GAMhB,MAAW1F,EAAM,EACf0F,EAAOA,EAAK,KACH1F,EAAM,IACfuH,EAAc7B,EACdA,EAAOA,EAAK,OAGhB,MAAM,IAAI,MAAM,uEAAuE,CACzF,CAIA,SAAU,CACR,OAAO,KAAK,MAAM,QAAQ,CAC5B,CAIA,OAAQ,CACN,OAAO,KAAK,MAAM,MAAM,CAC1B,CAIA,QAAS,CACP,OAAO,KAAK,MAAM,OAAO,CAC3B,CAIA,QAAS,CACP,OAAO,KAAK,MAAM,OAAO,CAC3B,CAUA,iBAAiBxD,EAAQ,CACvB,OAAO,KAAK,MAAM,iBAAiBA,CAAM,CAC3C,CASA,iBAAiBA,EAAQ,CACvB,OAAO,KAAK,MAAM,iBAAiBA,CAAM,CAC3C,CAKA,YAAYsF,EAAiB,CAC3B,OAAO,IAAIlB,GAAkB,KAAK,MAAO,KAAM,KAAK,YAAa,GAAOkB,CAAe,CACzF,CACA,gBAAgB7b,EAAK6b,EAAiB,CACpC,OAAO,IAAIlB,GAAkB,KAAK,MAAO3a,EAAK,KAAK,YAAa,GAAO6b,CAAe,CACxF,CACA,uBAAuB7b,EAAK6b,EAAiB,CAC3C,OAAO,IAAIlB,GAAkB,KAAK,MAAO3a,EAAK,KAAK,YAAa,GAAM6b,CAAe,CACvF,CACA,mBAAmBA,EAAiB,CAClC,OAAO,IAAIlB,GAAkB,KAAK,MAAO,KAAM,KAAK,YAAa,GAAMkB,CAAe,CACxF,CACF,EAIAX,EAAU,WAAa,IAAIM,GAkB3B,SAASM,GAAqB7H,EAAMC,EAAO,CACzC,OAAO/Q,GAAY8Q,EAAK,KAAMC,EAAM,IAAI,CAC1C,CACA,SAAS6H,GAAgB9H,EAAMC,EAAO,CACpC,OAAO/Q,GAAY8Q,EAAMC,CAAK,CAChC,CAkBA,IAAI8H,GACJ,SAASC,GAAa1B,EAAK,CACzByB,GAAazB,CACf,CACA,IAAM2B,GAAmB,SAAUC,EAAU,CAC3C,OAAI,OAAOA,GAAa,SACf,UAAY9X,GAAsB8X,CAAQ,EAE1C,UAAYA,CAEvB,EAIMC,GAAuB,SAAUC,EAAc,CACnD,GAAIA,EAAa,WAAW,EAAG,CAC7B,IAAM9B,EAAM8B,EAAa,IAAI,EAC7Bpa,EAAO,OAAOsY,GAAQ,UAAY,OAAOA,GAAQ,UAAY,OAAOA,GAAQ,UAAYja,EAASia,EAAK,KAAK,EAAG,sCAAsC,CACtJ,MACEtY,EAAOoa,IAAiBL,IAAcK,EAAa,QAAQ,EAAG,8BAA8B,EAG9Fpa,EAAOoa,IAAiBL,IAAcK,EAAa,YAAY,EAAE,QAAQ,EAAG,oDAAoD,CAClI,EAkBA,IAAIC,GAMAC,IAAyB,IAAM,CACjC,MAAMA,CAAS,CACb,WAAW,0BAA0BhC,EAAK,CACxC+B,GAA4B/B,CAC9B,CACA,WAAW,2BAA4B,CACrC,OAAO+B,EACT,CAMA,YAAYE,EAAQC,EAAgBF,EAAS,0BAA0B,WAAY,CACjF,KAAK,OAASC,EACd,KAAK,cAAgBC,EACrB,KAAK,UAAY,KACjBxa,EAAO,KAAK,SAAW,QAAa,KAAK,SAAW,KAAM,0DAA0D,EACpHma,GAAqB,KAAK,aAAa,CACzC,CAEA,YAAa,CACX,MAAO,EACT,CAEA,aAAc,CACZ,OAAO,KAAK,aACd,CAEA,eAAeM,EAAiB,CAC9B,OAAO,IAAIH,EAAS,KAAK,OAAQG,CAAe,CAClD,CAEA,kBAAkBC,EAAW,CAE3B,OAAIA,IAAc,YACT,KAAK,cAELJ,EAAS,0BAA0B,UAE9C,CAEA,SAASzJ,EAAM,CACb,OAAIY,EAAYZ,CAAI,EACX,KACED,EAAaC,CAAI,IAAM,YACzB,KAAK,cAELyJ,EAAS,0BAA0B,UAE9C,CACA,UAAW,CACT,MAAO,EACT,CAEA,wBAAwBI,EAAWC,EAAW,CAC5C,OAAO,IACT,CAEA,qBAAqBD,EAAWE,EAAc,CAC5C,OAAIF,IAAc,YACT,KAAK,eAAeE,CAAY,EAC9BA,EAAa,QAAQ,GAAKF,IAAc,YAC1C,KAEAJ,EAAS,0BAA0B,WAAW,qBAAqBI,EAAWE,CAAY,EAAE,eAAe,KAAK,aAAa,CAExI,CAEA,YAAY/J,EAAM+J,EAAc,CAC9B,IAAMC,EAAQjK,EAAaC,CAAI,EAC/B,OAAIgK,IAAU,KACLD,EACEA,EAAa,QAAQ,GAAKC,IAAU,YACtC,MAEP7a,EAAO6a,IAAU,aAAe/J,GAAcD,CAAI,IAAM,EAAG,4CAA4C,EAChG,KAAK,qBAAqBgK,EAAOP,EAAS,0BAA0B,WAAW,YAAYvJ,EAAaF,CAAI,EAAG+J,CAAY,CAAC,EAEvI,CAEA,SAAU,CACR,MAAO,EACT,CAEA,aAAc,CACZ,MAAO,EACT,CAEA,aAAa/F,EAAOP,EAAQ,CAC1B,MAAO,EACT,CACA,IAAIwG,EAAc,CAChB,OAAIA,GAAgB,CAAC,KAAK,YAAY,EAAE,QAAQ,EACvC,CACL,SAAU,KAAK,SAAS,EACxB,YAAa,KAAK,YAAY,EAAE,IAAI,CACtC,EAEO,KAAK,SAAS,CAEzB,CAEA,MAAO,CACL,GAAI,KAAK,YAAc,KAAM,CAC3B,IAAIC,EAAS,GACR,KAAK,cAAc,QAAQ,IAC9BA,GAAU,YAAcd,GAAiB,KAAK,cAAc,IAAI,CAAC,EAAI,KAEvE,IAAMzT,EAAO,OAAO,KAAK,OACzBuU,GAAUvU,EAAO,IACbA,IAAS,SACXuU,GAAU3Y,GAAsB,KAAK,MAAM,EAE3C2Y,GAAU,KAAK,OAEjB,KAAK,UAAYhc,GAAKgc,CAAM,CAC9B,CACA,OAAO,KAAK,SACd,CAKA,UAAW,CACT,OAAO,KAAK,MACd,CACA,UAAUzI,EAAO,CACf,OAAIA,IAAUgI,EAAS,0BAA0B,WACxC,EACEhI,aAAiBgI,EAAS,0BAC5B,IAEPta,EAAOsS,EAAM,WAAW,EAAG,mBAAmB,EACvC,KAAK,mBAAmBA,CAAK,EAExC,CAIA,mBAAmB0I,EAAW,CAC5B,IAAMC,EAAgB,OAAOD,EAAU,OACjCE,EAAe,OAAO,KAAK,OAC3BC,EAAab,EAAS,iBAAiB,QAAQW,CAAa,EAC5DG,EAAYd,EAAS,iBAAiB,QAAQY,CAAY,EAGhE,OAFAlb,EAAOmb,GAAc,EAAG,sBAAwBF,CAAa,EAC7Djb,EAAOob,GAAa,EAAG,sBAAwBF,CAAY,EACvDC,IAAeC,EAEbF,IAAiB,SAEZ,EAGH,KAAK,OAASF,EAAU,OACnB,GACE,KAAK,SAAWA,EAAU,OAC5B,EAEA,EAIJI,EAAYD,CAEvB,CACA,WAAY,CACV,OAAO,IACT,CACA,WAAY,CACV,MAAO,EACT,CACA,OAAO7I,EAAO,CACZ,GAAIA,IAAU,KACZ,MAAO,GACF,GAAIA,EAAM,WAAW,EAAG,CAC7B,IAAM0I,EAAY1I,EAClB,OAAO,KAAK,SAAW0I,EAAU,QAAU,KAAK,cAAc,OAAOA,EAAU,aAAa,CAC9F,KACE,OAAO,EAEX,CACF,CAKAV,EAAS,iBAAmB,CAAC,SAAU,UAAW,SAAU,QAAQ,EAkBpE,OAAOA,CACT,GAAG,EACCe,GACAC,GACJ,SAASC,GAAgBjD,EAAK,CAC5B+C,GAAiB/C,CACnB,CACA,SAASkD,GAAWlD,EAAK,CACvBgD,GAAahD,CACf,CACA,IAAMmD,GAAN,cAA4B1D,EAAM,CAChC,QAAQ5W,EAAGC,EAAG,CACZ,IAAMsa,EAAYva,EAAE,KAAK,YAAY,EAC/Bwa,EAAYva,EAAE,KAAK,YAAY,EAC/Bwa,EAAWF,EAAU,UAAUC,CAAS,EAC9C,OAAIC,IAAa,EACR1a,GAAYC,EAAE,KAAMC,EAAE,IAAI,EAE1Bwa,CAEX,CACA,YAAY9D,EAAM,CAChB,MAAO,CAACA,EAAK,YAAY,EAAE,QAAQ,CACrC,CACA,oBAAoBE,EAASC,EAAS,CACpC,MAAO,CAACD,EAAQ,YAAY,EAAE,OAAOC,EAAQ,YAAY,CAAC,CAC5D,CACA,SAAU,CAER,OAAOL,EAAU,GACnB,CACA,SAAU,CACR,OAAO,IAAIA,EAAU3W,GAAU,IAAIqZ,GAAS,kBAAmBgB,EAAU,CAAC,CAC5E,CACA,SAAS9C,EAAY/a,EAAM,CACzB,IAAM2c,EAAeiB,GAAe7C,CAAU,EAC9C,OAAO,IAAIZ,EAAUna,EAAM,IAAI6c,GAAS,kBAAmBF,CAAY,CAAC,CAC1E,CAIA,UAAW,CACT,MAAO,WACT,CACF,EACMyB,EAAiB,IAAIJ,GAkB3B,IAAMK,GAAQ,KAAK,IAAI,CAAC,EAClBC,GAAN,KAAgB,CACd,YAAYC,EAAQ,CAClB,IAAMC,EAAWC,GAEjB,SAAS,KAAK,IAAIA,CAAG,EAAIJ,GAAO,EAAE,EAC5BK,EAAUvZ,GAAQ,SAAS,MAAMA,EAAO,CAAC,EAAE,KAAK,GAAG,EAAG,CAAC,EAC7D,KAAK,MAAQqZ,EAASD,EAAS,CAAC,EAChC,KAAK,SAAW,KAAK,MAAQ,EAC7B,IAAMI,EAAOD,EAAQ,KAAK,KAAK,EAC/B,KAAK,MAAQH,EAAS,EAAII,CAC5B,CACA,cAAe,CAEb,IAAMlG,EAAS,EAAE,KAAK,MAAQ,GAAO,KAAK,UAC1C,YAAK,WACEA,CACT,CACF,EAcMmG,GAAgB,SAAUC,EAAWlK,EAAKmK,EAAOC,EAAW,CAChEF,EAAU,KAAKlK,CAAG,EAClB,IAAMqK,EAAoB,SAAUC,EAAKC,EAAM,CAC7C,IAAMX,EAASW,EAAOD,EAClBE,EACA7e,EACJ,GAAIie,IAAW,EACb,OAAO,KACF,GAAIA,IAAW,EACpB,OAAAY,EAAYN,EAAUI,CAAG,EACzB3e,EAAMwe,EAAQA,EAAMK,CAAS,EAAIA,EAC1B,IAAI7D,EAAShb,EAAK6e,EAAU,KAAM7D,EAAS,MAAO,KAAM,IAAI,EAC9D,CAEL,IAAM8D,EAAS,SAASb,EAAS,EAAG,EAAE,EAAIU,EACpC1K,EAAOyK,EAAkBC,EAAKG,CAAM,EACpC5K,EAAQwK,EAAkBI,EAAS,EAAGF,CAAI,EAChD,OAAAC,EAAYN,EAAUO,CAAM,EAC5B9e,EAAMwe,EAAQA,EAAMK,CAAS,EAAIA,EAC1B,IAAI7D,EAAShb,EAAK6e,EAAU,KAAM7D,EAAS,MAAO/G,EAAMC,CAAK,CACtE,CACF,EACM6K,EAAmB,SAAUC,EAAQ,CACzC,IAAIjF,EAAO,KACPkF,EAAO,KACPnI,EAAQyH,EAAU,OAChBW,EAAe,SAAUC,EAAWlE,EAAO,CAC/C,IAAM0D,EAAM7H,EAAQqI,EACdP,GAAO9H,EACbA,GAASqI,EACT,IAAMC,GAAYV,EAAkBC,EAAM,EAAGC,EAAI,EAC3CC,GAAYN,EAAUI,CAAG,EACzB3e,GAAMwe,EAAQA,EAAMK,EAAS,EAAIA,GACvCQ,EAAc,IAAIrE,EAAShb,GAAK6e,GAAU,KAAM5D,EAAO,KAAMmE,EAAS,CAAC,CACzE,EACMC,EAAgB,SAAUC,EAAS,CACnCvF,GACFA,EAAK,KAAOuF,EACZvF,EAAOuF,IAEPL,EAAOK,EACPvF,EAAOuF,EAEX,EACA,QAAS5d,EAAI,EAAGA,EAAIsd,EAAO,MAAO,EAAEtd,EAAG,CACrC,IAAM6d,EAAQP,EAAO,aAAa,EAE5BG,EAAY,KAAK,IAAI,EAAGH,EAAO,OAAStd,EAAI,EAAE,EAChD6d,EACFL,EAAaC,EAAWnE,EAAS,KAAK,GAGtCkE,EAAaC,EAAWnE,EAAS,KAAK,EACtCkE,EAAaC,EAAWnE,EAAS,GAAG,EAExC,CACA,OAAOiE,CACT,EACMD,EAAS,IAAIhB,GAAUO,EAAU,MAAM,EACvCU,EAAOF,EAAiBC,CAAM,EAEpC,OAAO,IAAI9D,EAAUuD,GAAapK,EAAK4K,CAAI,CAC7C,EAkBA,IAAIO,GACEC,GAAiB,CAAC,EAClBC,GAAN,MAAMC,CAAS,CAIb,WAAW,SAAU,CACnB,OAAA1d,EAAOwd,IAAkB3B,EAAgB,qCAAqC,EAC9E0B,GAAmBA,IAAoB,IAAIG,EAAS,CAClD,YAAaF,EACf,EAAG,CACD,YAAa3B,CACf,CAAC,EACM0B,EACT,CACA,YAAYI,EAAUC,EAAW,CAC/B,KAAK,SAAWD,EAChB,KAAK,UAAYC,CACnB,CACA,IAAIC,EAAU,CACZ,IAAMC,EAAYxI,GAAQ,KAAK,SAAUuI,CAAQ,EACjD,GAAI,CAACC,EACH,MAAM,IAAI,MAAM,wBAA0BD,CAAQ,EAEpD,OAAIC,aAAqB7E,EAChB6E,EAIA,IAEX,CACA,SAASC,EAAiB,CACxB,OAAO1f,EAAS,KAAK,UAAW0f,EAAgB,SAAS,CAAC,CAC5D,CACA,SAASA,EAAiBC,EAAkB,CAC1Che,EAAO+d,IAAoBtF,EAAW,qEAAqE,EAC3G,IAAM6D,EAAY,CAAC,EACf2B,EAAkB,GAChBC,EAAOF,EAAiB,YAAYpG,EAAU,IAAI,EACpDuG,EAAOD,EAAK,QAAQ,EACxB,KAAOC,GACLF,EAAkBA,GAAmBF,EAAgB,YAAYI,EAAK,IAAI,EAC1E7B,EAAU,KAAK6B,CAAI,EACnBA,EAAOD,EAAK,QAAQ,EAEtB,IAAIE,EACAH,EACFG,EAAW/B,GAAcC,EAAWyB,EAAgB,WAAW,CAAC,EAEhEK,EAAWZ,GAEb,IAAMa,EAAYN,EAAgB,SAAS,EACrCO,EAAc,OAAO,OAAO,CAAC,EAAG,KAAK,SAAS,EACpDA,EAAYD,CAAS,EAAIN,EACzB,IAAMQ,EAAa,OAAO,OAAO,CAAC,EAAG,KAAK,QAAQ,EAClD,OAAAA,EAAWF,CAAS,EAAID,EACjB,IAAIV,EAASa,EAAYD,CAAW,CAC7C,CAIA,aAAa1B,EAAWoB,EAAkB,CACxC,IAAMO,EAAajH,GAAI,KAAK,SAAU,CAACkH,EAAiBH,IAAc,CACpE,IAAMxJ,EAAQS,GAAQ,KAAK,UAAW+I,CAAS,EAE/C,GADAre,EAAO6U,EAAO,oCAAsCwJ,CAAS,EACzDG,IAAoBhB,GAEtB,GAAI3I,EAAM,YAAY+H,EAAU,IAAI,EAAG,CAErC,IAAMN,EAAY,CAAC,EACb4B,EAAOF,EAAiB,YAAYpG,EAAU,IAAI,EACpDuG,EAAOD,EAAK,QAAQ,EACxB,KAAOC,GACDA,EAAK,OAASvB,EAAU,MAC1BN,EAAU,KAAK6B,CAAI,EAErBA,EAAOD,EAAK,QAAQ,EAEtB,OAAA5B,EAAU,KAAKM,CAAS,EACjBP,GAAcC,EAAWzH,EAAM,WAAW,CAAC,CACpD,KAEE,QAAO2I,OAEJ,CACL,IAAMiB,EAAeT,EAAiB,IAAIpB,EAAU,IAAI,EACpD8B,EAAcF,EAClB,OAAIC,IACFC,EAAcA,EAAY,OAAO,IAAI9G,EAAUgF,EAAU,KAAM6B,CAAY,CAAC,GAEvEC,EAAY,OAAO9B,EAAWA,EAAU,IAAI,CACrD,CACF,CAAC,EACD,OAAO,IAAIc,EAASa,EAAY,KAAK,SAAS,CAChD,CAIA,kBAAkB3B,EAAWoB,EAAkB,CAC7C,IAAMO,EAAajH,GAAI,KAAK,SAAUkH,GAAmB,CACvD,GAAIA,IAAoBhB,GAEtB,OAAOgB,EACF,CACL,IAAMC,EAAeT,EAAiB,IAAIpB,EAAU,IAAI,EACxD,OAAI6B,EACKD,EAAgB,OAAO,IAAI5G,EAAUgF,EAAU,KAAM6B,CAAY,CAAC,EAGlED,CAEX,CACF,CAAC,EACD,OAAO,IAAId,EAASa,EAAY,KAAK,SAAS,CAChD,CACF,EAmBA,IAAII,GAMAC,GAA6B,IAAM,CACrC,MAAMA,CAAa,CACjB,WAAW,YAAa,CACtB,OAAOD,KAAeA,GAAa,IAAIC,EAAa,IAAI3F,EAAUa,EAAe,EAAG,KAAM2D,GAAS,OAAO,EAC5G,CAKA,YAAYoB,EAAWrE,EAAesE,EAAW,CAC/C,KAAK,UAAYD,EACjB,KAAK,cAAgBrE,EACrB,KAAK,UAAYsE,EACjB,KAAK,UAAY,KAMb,KAAK,eACP3E,GAAqB,KAAK,aAAa,EAErC,KAAK,UAAU,QAAQ,GACzBna,EAAO,CAAC,KAAK,eAAiB,KAAK,cAAc,QAAQ,EAAG,sCAAsC,CAEtG,CAEA,YAAa,CACX,MAAO,EACT,CAEA,aAAc,CACZ,OAAO,KAAK,eAAiB2e,EAC/B,CAEA,eAAelE,EAAiB,CAC9B,OAAI,KAAK,UAAU,QAAQ,EAElB,KAEA,IAAImE,EAAa,KAAK,UAAWnE,EAAiB,KAAK,SAAS,CAE3E,CAEA,kBAAkBC,EAAW,CAE3B,GAAIA,IAAc,YAChB,OAAO,KAAK,YAAY,EACnB,CACL,IAAM3H,EAAQ,KAAK,UAAU,IAAI2H,CAAS,EAC1C,OAAO3H,IAAU,KAAO4L,GAAa5L,CACvC,CACF,CAEA,SAASlC,EAAM,CACb,IAAMgK,EAAQjK,EAAaC,CAAI,EAC/B,OAAIgK,IAAU,KACL,KAEF,KAAK,kBAAkBA,CAAK,EAAE,SAAS9J,EAAaF,CAAI,CAAC,CAClE,CAEA,SAAS6J,EAAW,CAClB,OAAO,KAAK,UAAU,IAAIA,CAAS,IAAM,IAC3C,CAEA,qBAAqBA,EAAWE,EAAc,CAE5C,GADA5a,EAAO4a,EAAc,4CAA4C,EAC7DF,IAAc,YAChB,OAAO,KAAK,eAAeE,CAAY,EAClC,CACL,IAAMgC,EAAY,IAAIhF,EAAU8C,EAAWE,CAAY,EACnD8D,EAAaK,EACbnE,EAAa,QAAQ,GACvB8D,EAAc,KAAK,UAAU,OAAOhE,CAAS,EAC7CqE,EAAc,KAAK,UAAU,kBAAkBnC,EAAW,KAAK,SAAS,IAExE8B,EAAc,KAAK,UAAU,OAAOhE,EAAWE,CAAY,EAC3DmE,EAAc,KAAK,UAAU,aAAanC,EAAW,KAAK,SAAS,GAErE,IAAMoC,EAAcN,EAAY,QAAQ,EAAIC,GAAa,KAAK,cAC9D,OAAO,IAAIC,EAAaF,EAAaM,EAAaD,CAAW,CAC/D,CACF,CAEA,YAAYlO,EAAM+J,EAAc,CAC9B,IAAMC,EAAQjK,EAAaC,CAAI,EAC/B,GAAIgK,IAAU,KACZ,OAAOD,EACF,CACL5a,EAAO4Q,EAAaC,CAAI,IAAM,aAAeC,GAAcD,CAAI,IAAM,EAAG,4CAA4C,EACpH,IAAMoO,EAAoB,KAAK,kBAAkBpE,CAAK,EAAE,YAAY9J,EAAaF,CAAI,EAAG+J,CAAY,EACpG,OAAO,KAAK,qBAAqBC,EAAOoE,CAAiB,CAC3D,CACF,CAEA,SAAU,CACR,OAAO,KAAK,UAAU,QAAQ,CAChC,CAEA,aAAc,CACZ,OAAO,KAAK,UAAU,MAAM,CAC9B,CAEA,IAAInE,EAAc,CAChB,GAAI,KAAK,QAAQ,EACf,OAAO,KAET,IAAMpZ,EAAM,CAAC,EACTwd,EAAU,EACZC,EAAS,EACTC,EAAiB,GAUnB,GATA,KAAK,aAAavD,EAAgB,CAAC9d,EAAK4c,IAAc,CACpDjZ,EAAI3D,CAAG,EAAI4c,EAAU,IAAIG,CAAY,EACrCoE,IACIE,GAAkBR,EAAa,gBAAgB,KAAK7gB,CAAG,EACzDohB,EAAS,KAAK,IAAIA,EAAQ,OAAOphB,CAAG,CAAC,EAErCqhB,EAAiB,EAErB,CAAC,EACG,CAACtE,GAAgBsE,GAAkBD,EAAS,EAAID,EAAS,CAE3D,IAAMG,EAAQ,CAAC,EAEf,QAAWthB,KAAO2D,EAChB2d,EAAMthB,CAAG,EAAI2D,EAAI3D,CAAG,EAEtB,OAAOshB,CACT,KACE,QAAIvE,GAAgB,CAAC,KAAK,YAAY,EAAE,QAAQ,IAC9CpZ,EAAI,WAAW,EAAI,KAAK,YAAY,EAAE,IAAI,GAErCA,CAEX,CAEA,MAAO,CACL,GAAI,KAAK,YAAc,KAAM,CAC3B,IAAIqZ,EAAS,GACR,KAAK,YAAY,EAAE,QAAQ,IAC9BA,GAAU,YAAcd,GAAiB,KAAK,YAAY,EAAE,IAAI,CAAC,EAAI,KAEvE,KAAK,aAAa4B,EAAgB,CAAC9d,EAAK4c,IAAc,CACpD,IAAM2E,EAAY3E,EAAU,KAAK,EAC7B2E,IAAc,KAChBvE,GAAU,IAAMhd,EAAM,IAAMuhB,EAEhC,CAAC,EACD,KAAK,UAAYvE,IAAW,GAAK,GAAKhc,GAAKgc,CAAM,CACnD,CACA,OAAO,KAAK,SACd,CAEA,wBAAwBL,EAAWC,EAAW9F,EAAO,CACnD,IAAM0K,EAAM,KAAK,cAAc1K,CAAK,EACpC,GAAI0K,EAAK,CACP,IAAMC,EAAcD,EAAI,kBAAkB,IAAI3H,EAAU8C,EAAWC,CAAS,CAAC,EAC7E,OAAO6E,EAAcA,EAAY,KAAO,IAC1C,KACE,QAAO,KAAK,UAAU,kBAAkB9E,CAAS,CAErD,CACA,kBAAkBqD,EAAiB,CACjC,IAAMwB,EAAM,KAAK,cAAcxB,CAAe,EAC9C,GAAIwB,EAAK,CACP,IAAME,EAASF,EAAI,OAAO,EAC1B,OAAOE,GAAUA,EAAO,IAC1B,KACE,QAAO,KAAK,UAAU,OAAO,CAEjC,CACA,cAAc1B,EAAiB,CAC7B,IAAM0B,EAAS,KAAK,kBAAkB1B,CAAe,EACrD,OAAI0B,EACK,IAAI7H,EAAU6H,EAAQ,KAAK,UAAU,IAAIA,CAAM,CAAC,EAEhD,IAEX,CAIA,iBAAiB1B,EAAiB,CAChC,IAAMwB,EAAM,KAAK,cAAcxB,CAAe,EAC9C,GAAIwB,EAAK,CACP,IAAMJ,EAASI,EAAI,OAAO,EAC1B,OAAOJ,GAAUA,EAAO,IAC1B,KACE,QAAO,KAAK,UAAU,OAAO,CAEjC,CACA,aAAapB,EAAiB,CAC5B,IAAMoB,EAAS,KAAK,iBAAiBpB,CAAe,EACpD,OAAIoB,EACK,IAAIvH,EAAUuH,EAAQ,KAAK,UAAU,IAAIA,CAAM,CAAC,EAEhD,IAEX,CACA,aAAatK,EAAOP,EAAQ,CAC1B,IAAMiL,EAAM,KAAK,cAAc1K,CAAK,EACpC,OAAI0K,EACKA,EAAI,iBAAiBG,GACnBpL,EAAOoL,EAAY,KAAMA,EAAY,IAAI,CACjD,EAEM,KAAK,UAAU,iBAAiBpL,CAAM,CAEjD,CACA,YAAYyJ,EAAiB,CAC3B,OAAO,KAAK,gBAAgBA,EAAgB,QAAQ,EAAGA,CAAe,CACxE,CACA,gBAAgB4B,EAAW5B,EAAiB,CAC1C,IAAMwB,EAAM,KAAK,cAAcxB,CAAe,EAC9C,GAAIwB,EACF,OAAOA,EAAI,gBAAgBI,EAAW5hB,GAAOA,CAAG,EAC3C,CACL,IAAM6hB,EAAW,KAAK,UAAU,gBAAgBD,EAAU,KAAM/H,EAAU,IAAI,EAC1EuG,EAAOyB,EAAS,KAAK,EACzB,KAAOzB,GAAQ,MAAQJ,EAAgB,QAAQI,EAAMwB,CAAS,EAAI,GAChEC,EAAS,QAAQ,EACjBzB,EAAOyB,EAAS,KAAK,EAEvB,OAAOA,CACT,CACF,CACA,mBAAmB7B,EAAiB,CAClC,OAAO,KAAK,uBAAuBA,EAAgB,QAAQ,EAAGA,CAAe,CAC/E,CACA,uBAAuB8B,EAAS9B,EAAiB,CAC/C,IAAMwB,EAAM,KAAK,cAAcxB,CAAe,EAC9C,GAAIwB,EACF,OAAOA,EAAI,uBAAuBM,EAAS9hB,GAClCA,CACR,EACI,CACL,IAAM6hB,EAAW,KAAK,UAAU,uBAAuBC,EAAQ,KAAMjI,EAAU,IAAI,EAC/EuG,EAAOyB,EAAS,KAAK,EACzB,KAAOzB,GAAQ,MAAQJ,EAAgB,QAAQI,EAAM0B,CAAO,EAAI,GAC9DD,EAAS,QAAQ,EACjBzB,EAAOyB,EAAS,KAAK,EAEvB,OAAOA,CACT,CACF,CACA,UAAUtN,EAAO,CACf,OAAI,KAAK,QAAQ,EACXA,EAAM,QAAQ,EACT,EAEA,GAEAA,EAAM,WAAW,GAAKA,EAAM,QAAQ,EACtC,EACEA,IAAUwN,GACZ,GAGA,CAEX,CACA,UAAU/B,EAAiB,CACzB,GAAIA,IAAoBtF,GAAa,KAAK,UAAU,SAASsF,CAAe,EAC1E,OAAO,KACF,CACL,IAAMgB,EAAc,KAAK,UAAU,SAAShB,EAAiB,KAAK,SAAS,EAC3E,OAAO,IAAIa,EAAa,KAAK,UAAW,KAAK,cAAeG,CAAW,CACzE,CACF,CACA,UAAUlK,EAAO,CACf,OAAOA,IAAU4D,GAAa,KAAK,UAAU,SAAS5D,CAAK,CAC7D,CACA,OAAOvC,EAAO,CACZ,GAAIA,IAAU,KACZ,MAAO,GACF,GAAIA,EAAM,WAAW,EAC1B,MAAO,GACF,CACL,IAAMyN,EAAoBzN,EAC1B,GAAK,KAAK,YAAY,EAAE,OAAOyN,EAAkB,YAAY,CAAC,EAEvD,GAAI,KAAK,UAAU,MAAM,IAAMA,EAAkB,UAAU,MAAM,EAAG,CACzE,IAAMC,EAAW,KAAK,YAAYnE,CAAc,EAC1CoE,EAAYF,EAAkB,YAAYlE,CAAc,EAC1DqE,EAAcF,EAAS,QAAQ,EAC/BG,EAAeF,EAAU,QAAQ,EACrC,KAAOC,GAAeC,GAAc,CAClC,GAAID,EAAY,OAASC,EAAa,MAAQ,CAACD,EAAY,KAAK,OAAOC,EAAa,IAAI,EACtF,MAAO,GAETD,EAAcF,EAAS,QAAQ,EAC/BG,EAAeF,EAAU,QAAQ,CACnC,CACA,OAAOC,IAAgB,MAAQC,IAAiB,IAClD,KACE,OAAO,OAfP,OAAO,EAiBX,CACF,CAMA,cAAcpC,EAAiB,CAC7B,OAAIA,IAAoBtF,EACf,KAEA,KAAK,UAAU,IAAIsF,EAAgB,SAAS,CAAC,CAExD,CACF,CACA,OAAAa,EAAa,gBAAkB,iBACxBA,CACT,GAAG,EACGwB,GAAN,cAAsBxB,CAAa,CACjC,aAAc,CACZ,MAAM,IAAI3F,EAAUa,EAAe,EAAG8E,EAAa,WAAYnB,GAAS,OAAO,CACjF,CACA,UAAUnL,EAAO,CACf,OAAIA,IAAU,KACL,EAEA,CAEX,CACA,OAAOA,EAAO,CAEZ,OAAOA,IAAU,IACnB,CACA,aAAc,CACZ,OAAO,IACT,CACA,kBAAkBoI,EAAW,CAC3B,OAAOkE,EAAa,UACtB,CACA,SAAU,CACR,MAAO,EACT,CACF,EAIMkB,GAAW,IAAIM,GACrB,OAAO,iBAAiBxI,EAAW,CACjC,IAAK,CACH,MAAO,IAAIA,EAAU5W,GAAU4d,EAAa,UAAU,CACxD,EACA,IAAK,CACH,MAAO,IAAIhH,EAAU3W,GAAU6e,EAAQ,CACzC,CACF,CAAC,EAIDzH,GAAS,aAAeuG,EAAa,WACrCtE,GAAS,0BAA4BsE,EACrC5E,GAAa8F,EAAQ,EACrBtE,GAAWsE,EAAQ,EAkBnB,IAAMO,GAAY,GAOlB,SAASC,EAAaC,EAAMrG,EAAW,KAAM,CAC3C,GAAIqG,IAAS,KACX,OAAO3B,EAAa,WAUtB,GARI,OAAO2B,GAAS,UAAY,cAAeA,IAC7CrG,EAAWqG,EAAK,WAAW,GAE7BvgB,EAAOka,IAAa,MAAQ,OAAOA,GAAa,UAAY,OAAOA,GAAa,UAAY,OAAOA,GAAa,UAAY,QAASA,EAAU,gCAAkC,OAAOA,CAAQ,EAC5L,OAAOqG,GAAS,UAAY,WAAYA,GAAQA,EAAK,QAAQ,IAAM,OACrEA,EAAOA,EAAK,QAAQ,GAGlB,OAAOA,GAAS,UAAY,QAASA,EAAM,CAC7C,IAAMC,EAAWD,EACjB,OAAO,IAAIjG,GAASkG,EAAUF,EAAapG,CAAQ,CAAC,CACtD,CACA,GAAI,EAAEqG,aAAgB,QAAUF,GAAW,CACzC,IAAMI,EAAW,CAAC,EACdC,EAAuB,GAY3B,GAVAve,EADqBoe,EACF,CAACxiB,EAAKgV,IAAU,CACjC,GAAIhV,EAAI,UAAU,EAAG,CAAC,IAAM,IAAK,CAE/B,IAAM4c,EAAY2F,EAAavN,CAAK,EAC/B4H,EAAU,QAAQ,IACrB+F,EAAuBA,GAAwB,CAAC/F,EAAU,YAAY,EAAE,QAAQ,EAChF8F,EAAS,KAAK,IAAI7I,EAAU7Z,EAAK4c,CAAS,CAAC,EAE/C,CACF,CAAC,EACG8F,EAAS,SAAW,EACtB,OAAO7B,EAAa,WAEtB,IAAM+B,EAAWtE,GAAcoE,EAAU5G,GAAsB+C,GAAaA,EAAU,KAAM9C,EAAe,EAC3G,GAAI4G,EAAsB,CACxB,IAAME,EAAiBvE,GAAcoE,EAAU5E,EAAe,WAAW,CAAC,EAC1E,OAAO,IAAI+C,EAAa+B,EAAUL,EAAapG,CAAQ,EAAG,IAAIuD,GAAS,CACrE,YAAamD,CACf,EAAG,CACD,YAAa/E,CACf,CAAC,CAAC,CACJ,KACE,QAAO,IAAI+C,EAAa+B,EAAUL,EAAapG,CAAQ,EAAGuD,GAAS,OAAO,CAE9E,KAAO,CACL,IAAI3F,EAAO8G,EAAa,WACxB,OAAAzc,EAAKoe,EAAM,CAACxiB,EAAK8iB,IAAc,CAC7B,GAAIxiB,EAASkiB,EAAMxiB,CAAG,GAChBA,EAAI,UAAU,EAAG,CAAC,IAAM,IAAK,CAE/B,IAAM4c,EAAY2F,EAAaO,CAAS,GACpClG,EAAU,WAAW,GAAK,CAACA,EAAU,QAAQ,KAC/C7C,EAAOA,EAAK,qBAAqB/Z,EAAK4c,CAAS,EAEnD,CAEJ,CAAC,EACM7C,EAAK,eAAewI,EAAapG,CAAQ,CAAC,CACnD,CACF,CACAqB,GAAgB+E,CAAY,EAkB5B,IAAMQ,GAAN,cAAwB/I,EAAM,CAC5B,YAAYgJ,EAAY,CACtB,MAAM,EACN,KAAK,WAAaA,EAClB/gB,EAAO,CAACyR,EAAYsP,CAAU,GAAKnQ,EAAamQ,CAAU,IAAM,YAAa,yDAAyD,CACxI,CACA,aAAaC,EAAM,CACjB,OAAOA,EAAK,SAAS,KAAK,UAAU,CACtC,CACA,YAAYlJ,EAAM,CAChB,MAAO,CAACA,EAAK,SAAS,KAAK,UAAU,EAAE,QAAQ,CACjD,CACA,QAAQ3W,EAAGC,EAAG,CACZ,IAAM6f,EAAS,KAAK,aAAa9f,EAAE,IAAI,EACjC+f,EAAS,KAAK,aAAa9f,EAAE,IAAI,EACjCwa,EAAWqF,EAAO,UAAUC,CAAM,EACxC,OAAItF,IAAa,EACR1a,GAAYC,EAAE,KAAMC,EAAE,IAAI,EAE1Bwa,CAEX,CACA,SAASpD,EAAY/a,EAAM,CACzB,IAAM0jB,EAAYb,EAAa9H,CAAU,EACnCV,EAAO8G,EAAa,WAAW,YAAY,KAAK,WAAYuC,CAAS,EAC3E,OAAO,IAAIvJ,EAAUna,EAAMqa,CAAI,CACjC,CACA,SAAU,CACR,IAAMA,EAAO8G,EAAa,WAAW,YAAY,KAAK,WAAYkB,EAAQ,EAC1E,OAAO,IAAIlI,EAAU3W,GAAU6W,CAAI,CACrC,CACA,UAAW,CACT,OAAO5G,GAAU,KAAK,WAAY,CAAC,EAAE,KAAK,GAAG,CAC/C,CACF,EAkBA,IAAMkQ,GAAN,cAAyBrJ,EAAM,CAC7B,QAAQ5W,EAAGC,EAAG,CACZ,IAAMwa,EAAWza,EAAE,KAAK,UAAUC,EAAE,IAAI,EACxC,OAAIwa,IAAa,EACR1a,GAAYC,EAAE,KAAMC,EAAE,IAAI,EAE1Bwa,CAEX,CACA,YAAY9D,EAAM,CAChB,MAAO,EACT,CACA,oBAAoBE,EAASC,EAAS,CACpC,MAAO,CAACD,EAAQ,OAAOC,CAAO,CAChC,CACA,SAAU,CAER,OAAOL,EAAU,GACnB,CACA,SAAU,CAER,OAAOA,EAAU,GACnB,CACA,SAASY,EAAY/a,EAAM,CACzB,IAAM0jB,EAAYb,EAAa9H,CAAU,EACzC,OAAO,IAAIZ,EAAUna,EAAM0jB,CAAS,CACtC,CAIA,UAAW,CACT,MAAO,QACT,CACF,EACME,GAAc,IAAID,GAkBxB,SAASE,GAAYC,EAAc,CACjC,MAAO,CACL,KAAM,QACN,aAAAA,CACF,CACF,CACA,SAASC,GAAiB9G,EAAW6G,EAAc,CACjD,MAAO,CACL,KAAM,cACN,aAAAA,EACA,UAAA7G,CACF,CACF,CACA,SAAS+G,GAAmB/G,EAAW6G,EAAc,CACnD,MAAO,CACL,KAAM,gBACN,aAAAA,EACA,UAAA7G,CACF,CACF,CACA,SAASgH,GAAmBhH,EAAW6G,EAAcI,EAAS,CAC5D,MAAO,CACL,KAAM,gBACN,aAAAJ,EACA,UAAA7G,EACA,QAAAiH,CACF,CACF,CACA,SAASC,GAAiBlH,EAAW6G,EAAc,CACjD,MAAO,CACL,KAAM,cACN,aAAAA,EACA,UAAA7G,CACF,CACF,CAqBA,IAAMmH,GAAN,KAAoB,CAClB,YAAYC,EAAQ,CAClB,KAAK,OAASA,CAChB,CACA,YAAYd,EAAMjjB,EAAKgkB,EAAUC,EAAcC,EAAQC,EAAsB,CAC3EliB,EAAOghB,EAAK,UAAU,KAAK,MAAM,EAAG,mDAAmD,EACvF,IAAMmB,EAAWnB,EAAK,kBAAkBjjB,CAAG,EA0B3C,OAxBIokB,EAAS,SAASH,CAAY,EAAE,OAAOD,EAAS,SAASC,CAAY,CAAC,GAIpEG,EAAS,QAAQ,IAAMJ,EAAS,QAAQ,IAO1CG,GAAwB,OACtBH,EAAS,QAAQ,EACff,EAAK,SAASjjB,CAAG,EACnBmkB,EAAqB,iBAAiBT,GAAmB1jB,EAAKokB,CAAQ,CAAC,EAEvEniB,EAAOghB,EAAK,WAAW,EAAG,qEAAqE,EAExFmB,EAAS,QAAQ,EAC1BD,EAAqB,iBAAiBV,GAAiBzjB,EAAKgkB,CAAQ,CAAC,EAErEG,EAAqB,iBAAiBR,GAAmB3jB,EAAKgkB,EAAUI,CAAQ,CAAC,GAGjFnB,EAAK,WAAW,GAAKe,EAAS,QAAQ,GACjCf,EAGAA,EAAK,qBAAqBjjB,EAAKgkB,CAAQ,EAAE,UAAU,KAAK,MAAM,CAEzE,CACA,eAAeJ,EAASS,EAASF,EAAsB,CACrD,OAAIA,GAAwB,OACrBP,EAAQ,WAAW,GACtBA,EAAQ,aAAa9F,EAAgB,CAAC9d,EAAK4c,IAAc,CAClDyH,EAAQ,SAASrkB,CAAG,GACvBmkB,EAAqB,iBAAiBT,GAAmB1jB,EAAK4c,CAAS,CAAC,CAE5E,CAAC,EAEEyH,EAAQ,WAAW,GACtBA,EAAQ,aAAavG,EAAgB,CAAC9d,EAAK4c,IAAc,CACvD,GAAIgH,EAAQ,SAAS5jB,CAAG,EAAG,CACzB,IAAMokB,EAAWR,EAAQ,kBAAkB5jB,CAAG,EACzCokB,EAAS,OAAOxH,CAAS,GAC5BuH,EAAqB,iBAAiBR,GAAmB3jB,EAAK4c,EAAWwH,CAAQ,CAAC,CAEtF,MACED,EAAqB,iBAAiBV,GAAiBzjB,EAAK4c,CAAS,CAAC,CAE1E,CAAC,GAGEyH,EAAQ,UAAU,KAAK,MAAM,CACtC,CACA,eAAeT,EAAS3C,EAAa,CACnC,OAAI2C,EAAQ,QAAQ,EACX/C,EAAa,WAEb+C,EAAQ,eAAe3C,CAAW,CAE7C,CACA,cAAe,CACb,MAAO,EACT,CACA,kBAAmB,CACjB,OAAO,IACT,CACA,UAAW,CACT,OAAO,KAAK,MACd,CACF,EAqBA,IAAMqD,GAAN,MAAMC,CAAa,CACjB,YAAY7b,EAAQ,CAClB,KAAK,eAAiB,IAAIob,GAAcpb,EAAO,SAAS,CAAC,EACzD,KAAK,OAASA,EAAO,SAAS,EAC9B,KAAK,WAAa6b,EAAa,cAAc7b,CAAM,EACnD,KAAK,SAAW6b,EAAa,YAAY7b,CAAM,EAC/C,KAAK,kBAAoB,CAACA,EAAO,eACjC,KAAK,gBAAkB,CAACA,EAAO,aACjC,CACA,cAAe,CACb,OAAO,KAAK,UACd,CACA,YAAa,CACX,OAAO,KAAK,QACd,CACA,QAAQqR,EAAM,CACZ,IAAMyK,EAAgB,KAAK,kBAAoB,KAAK,OAAO,QAAQ,KAAK,aAAa,EAAGzK,CAAI,GAAK,EAAI,KAAK,OAAO,QAAQ,KAAK,aAAa,EAAGA,CAAI,EAAI,EAChJ0K,EAAc,KAAK,gBAAkB,KAAK,OAAO,QAAQ1K,EAAM,KAAK,WAAW,CAAC,GAAK,EAAI,KAAK,OAAO,QAAQA,EAAM,KAAK,WAAW,CAAC,EAAI,EAC9I,OAAOyK,GAAiBC,CAC1B,CACA,YAAYxB,EAAMjjB,EAAKgkB,EAAUC,EAAcC,EAAQC,EAAsB,CAC3E,OAAK,KAAK,QAAQ,IAAItK,EAAU7Z,EAAKgkB,CAAQ,CAAC,IAC5CA,EAAWnD,EAAa,YAEnB,KAAK,eAAe,YAAYoC,EAAMjjB,EAAKgkB,EAAUC,EAAcC,EAAQC,CAAoB,CACxG,CACA,eAAeP,EAASS,EAASF,EAAsB,CACjDE,EAAQ,WAAW,IAErBA,EAAUxD,EAAa,YAEzB,IAAI6D,EAAWL,EAAQ,UAAU,KAAK,MAAM,EAE5CK,EAAWA,EAAS,eAAe7D,EAAa,UAAU,EAC1D,IAAM8D,EAAO,KACb,OAAAN,EAAQ,aAAavG,EAAgB,CAAC9d,EAAK4c,IAAc,CAClD+H,EAAK,QAAQ,IAAI9K,EAAU7Z,EAAK4c,CAAS,CAAC,IAC7C8H,EAAWA,EAAS,qBAAqB1kB,EAAK6gB,EAAa,UAAU,EAEzE,CAAC,EACM,KAAK,eAAe,eAAe+C,EAASc,EAAUP,CAAoB,CACnF,CACA,eAAeP,EAAS3C,EAAa,CAEnC,OAAO2C,CACT,CACA,cAAe,CACb,MAAO,EACT,CACA,kBAAmB,CACjB,OAAO,KAAK,cACd,CACA,UAAW,CACT,OAAO,KAAK,MACd,CACA,OAAO,cAAclb,EAAQ,CAC3B,GAAIA,EAAO,SAAS,EAAG,CACrB,IAAMkc,EAAYlc,EAAO,kBAAkB,EAC3C,OAAOA,EAAO,SAAS,EAAE,SAASA,EAAO,mBAAmB,EAAGkc,CAAS,CAC1E,KACE,QAAOlc,EAAO,SAAS,EAAE,QAAQ,CAErC,CACA,OAAO,YAAYA,EAAQ,CACzB,GAAIA,EAAO,OAAO,EAAG,CACnB,IAAMmc,EAAUnc,EAAO,gBAAgB,EACvC,OAAOA,EAAO,SAAS,EAAE,SAASA,EAAO,iBAAiB,EAAGmc,CAAO,CACtE,KACE,QAAOnc,EAAO,SAAS,EAAE,QAAQ,CAErC,CACF,EAqBA,IAAMoc,GAAN,KAAoB,CAClB,YAAYpc,EAAQ,CAClB,KAAK,uBAAyBqR,GAAQ,KAAK,SAAW,KAAK,cAAcA,CAAI,EAAI,KAAK,gBAAgBA,CAAI,EAC1G,KAAK,qBAAuBA,GAAQ,KAAK,SAAW,KAAK,gBAAgBA,CAAI,EAAI,KAAK,cAAcA,CAAI,EACxG,KAAK,gBAAkBA,GAAQ,CAC7B,IAAMgL,EAAa,KAAK,OAAO,QAAQ,KAAK,cAAc,aAAa,EAAGhL,CAAI,EAC9E,OAAO,KAAK,kBAAoBgL,GAAc,EAAIA,EAAa,CACjE,EACA,KAAK,cAAgBhL,GAAQ,CAC3B,IAAMgL,EAAa,KAAK,OAAO,QAAQhL,EAAM,KAAK,cAAc,WAAW,CAAC,EAC5E,OAAO,KAAK,gBAAkBgL,GAAc,EAAIA,EAAa,CAC/D,EACA,KAAK,cAAgB,IAAIT,GAAa5b,CAAM,EAC5C,KAAK,OAASA,EAAO,SAAS,EAC9B,KAAK,OAASA,EAAO,SAAS,EAC9B,KAAK,SAAW,CAACA,EAAO,eAAe,EACvC,KAAK,kBAAoB,CAACA,EAAO,eACjC,KAAK,gBAAkB,CAACA,EAAO,aACjC,CACA,YAAYua,EAAMjjB,EAAKgkB,EAAUC,EAAcC,EAAQC,EAAsB,CAI3E,OAHK,KAAK,cAAc,QAAQ,IAAItK,EAAU7Z,EAAKgkB,CAAQ,CAAC,IAC1DA,EAAWnD,EAAa,YAEtBoC,EAAK,kBAAkBjjB,CAAG,EAAE,OAAOgkB,CAAQ,EAEtCf,EACEA,EAAK,YAAY,EAAI,KAAK,OAC5B,KAAK,cAAc,iBAAiB,EAAE,YAAYA,EAAMjjB,EAAKgkB,EAAUC,EAAcC,EAAQC,CAAoB,EAEjH,KAAK,sBAAsBlB,EAAMjjB,EAAKgkB,EAAUE,EAAQC,CAAoB,CAEvF,CACA,eAAeP,EAASS,EAASF,EAAsB,CACrD,IAAIO,EACJ,GAAIL,EAAQ,WAAW,GAAKA,EAAQ,QAAQ,EAE1CK,EAAW7D,EAAa,WAAW,UAAU,KAAK,MAAM,UAEpD,KAAK,OAAS,EAAIwD,EAAQ,YAAY,GAAKA,EAAQ,UAAU,KAAK,MAAM,EAAG,CAE7EK,EAAW7D,EAAa,WAAW,UAAU,KAAK,MAAM,EAExD,IAAIgB,EACA,KAAK,SACPA,EAAWwC,EAAQ,uBAAuB,KAAK,cAAc,WAAW,EAAG,KAAK,MAAM,EAEtFxC,EAAWwC,EAAQ,gBAAgB,KAAK,cAAc,aAAa,EAAG,KAAK,MAAM,EAEnF,IAAIW,EAAQ,EACZ,KAAOnD,EAAS,QAAQ,GAAKmD,EAAQ,KAAK,QAAQ,CAChD,IAAM5E,EAAOyB,EAAS,QAAQ,EAC9B,GAAK,KAAK,uBAAuBzB,CAAI,EAG9B,GAAK,KAAK,qBAAqBA,CAAI,EAIxCsE,EAAWA,EAAS,qBAAqBtE,EAAK,KAAMA,EAAK,IAAI,EAC7D4E,QAHA,WAHA,SAQJ,CACF,KAAO,CAELN,EAAWL,EAAQ,UAAU,KAAK,MAAM,EAExCK,EAAWA,EAAS,eAAe7D,EAAa,UAAU,EAC1D,IAAIgB,EACA,KAAK,SACPA,EAAW6C,EAAS,mBAAmB,KAAK,MAAM,EAElD7C,EAAW6C,EAAS,YAAY,KAAK,MAAM,EAE7C,IAAIM,EAAQ,EACZ,KAAOnD,EAAS,QAAQ,GAAG,CACzB,IAAMzB,EAAOyB,EAAS,QAAQ,EACdmD,EAAQ,KAAK,QAAU,KAAK,uBAAuB5E,CAAI,GAAK,KAAK,qBAAqBA,CAAI,EAExG4E,IAEAN,EAAWA,EAAS,qBAAqBtE,EAAK,KAAMS,EAAa,UAAU,CAE/E,CACF,CAEF,OAAO,KAAK,cAAc,iBAAiB,EAAE,eAAe+C,EAASc,EAAUP,CAAoB,CACrG,CACA,eAAeP,EAAS3C,EAAa,CAEnC,OAAO2C,CACT,CACA,cAAe,CACb,MAAO,EACT,CACA,kBAAmB,CACjB,OAAO,KAAK,cAAc,iBAAiB,CAC7C,CACA,UAAW,CACT,OAAO,KAAK,MACd,CACA,sBAAsBX,EAAMgC,EAAUC,EAAWhB,EAAQiB,EAAmB,CAE1E,IAAI9Q,EACJ,GAAI,KAAK,SAAU,CACjB,IAAMwJ,EAAW,KAAK,OAAO,WAAW,EACxCxJ,EAAM,CAACjR,EAAGC,IAAMwa,EAASxa,EAAGD,CAAC,CAC/B,MACEiR,EAAM,KAAK,OAAO,WAAW,EAE/B,IAAM+Q,EAAgBnC,EACtBhhB,EAAOmjB,EAAc,YAAY,IAAM,KAAK,OAAQ,EAAE,EACtD,IAAMC,EAAoB,IAAIxL,EAAUoL,EAAUC,CAAS,EACrDI,EAAiB,KAAK,SAAWF,EAAc,cAAc,KAAK,MAAM,EAAIA,EAAc,aAAa,KAAK,MAAM,EAClHG,EAAU,KAAK,cAAc,QAAQF,CAAiB,EAC5D,GAAID,EAAc,SAASH,CAAQ,EAAG,CACpC,IAAMO,EAAeJ,EAAc,kBAAkBH,CAAQ,EACzDQ,EAAYvB,EAAO,mBAAmB,KAAK,OAAQoB,EAAgB,KAAK,QAAQ,EACpF,KAAOG,GAAa,OAASA,EAAU,OAASR,GAAYG,EAAc,SAASK,EAAU,IAAI,IAI/FA,EAAYvB,EAAO,mBAAmB,KAAK,OAAQuB,EAAW,KAAK,QAAQ,EAE7E,IAAMC,EAAcD,GAAa,KAAO,EAAIpR,EAAIoR,EAAWJ,CAAiB,EAE5E,GADwBE,GAAW,CAACL,EAAU,QAAQ,GAAKQ,GAAe,EAExE,OACEP,GAAkB,iBAAiBxB,GAAmBsB,EAAUC,EAAWM,CAAY,CAAC,EAEnFJ,EAAc,qBAAqBH,EAAUC,CAAS,EACxD,CAEHC,GAAkB,iBAAiBzB,GAAmBuB,EAAUO,CAAY,CAAC,EAE/E,IAAMG,EAAgBP,EAAc,qBAAqBH,EAAUpE,EAAa,UAAU,EAE1F,OADyB4E,GAAa,MAAQ,KAAK,cAAc,QAAQA,CAAS,GAG9EN,GAAkB,iBAAiB1B,GAAiBgC,EAAU,KAAMA,EAAU,IAAI,CAAC,EAE9EE,EAAc,qBAAqBF,EAAU,KAAMA,EAAU,IAAI,GAEjEE,CAEX,CACF,KAAO,QAAIT,EAAU,QAAQ,EAEpBjC,EACEsC,GACLlR,EAAIiR,EAAgBD,CAAiB,GAAK,GACxCF,GAAqB,OACvBA,EAAkB,iBAAiBzB,GAAmB4B,EAAe,KAAMA,EAAe,IAAI,CAAC,EAC/FH,EAAkB,iBAAiB1B,GAAiBwB,EAAUC,CAAS,CAAC,GAEnEE,EAAc,qBAAqBH,EAAUC,CAAS,EAAE,qBAAqBI,EAAe,KAAMzE,EAAa,UAAU,GAK3HoC,CAEX,CACF,EAyBA,IAAM2C,GAAN,MAAMC,CAAY,CAChB,aAAc,CACZ,KAAK,UAAY,GACjB,KAAK,UAAY,GACjB,KAAK,cAAgB,GACrB,KAAK,eAAiB,GACtB,KAAK,QAAU,GACf,KAAK,YAAc,GACnB,KAAK,cAAgB,GACrB,KAAK,OAAS,EACd,KAAK,UAAY,GACjB,KAAK,iBAAmB,KACxB,KAAK,gBAAkB,GACvB,KAAK,eAAiB,KACtB,KAAK,cAAgB,GACrB,KAAK,OAAS/H,CAChB,CACA,UAAW,CACT,OAAO,KAAK,SACd,CAIA,gBAAiB,CACf,OAAI,KAAK,YAAc,GAKd,KAAK,UAEL,KAAK,YAAc,GAE9B,CAIA,oBAAqB,CACnB,OAAA7b,EAAO,KAAK,UAAW,kCAAkC,EAClD,KAAK,gBACd,CAKA,mBAAoB,CAElB,OADAA,EAAO,KAAK,UAAW,kCAAkC,EACrD,KAAK,cACA,KAAK,gBAELgB,EAEX,CACA,QAAS,CACP,OAAO,KAAK,OACd,CAIA,kBAAmB,CACjB,OAAAhB,EAAO,KAAK,QAAS,gCAAgC,EAC9C,KAAK,cACd,CAKA,iBAAkB,CAEhB,OADAA,EAAO,KAAK,QAAS,gCAAgC,EACjD,KAAK,YACA,KAAK,cAELiB,EAEX,CACA,UAAW,CACT,OAAO,KAAK,SACd,CAIA,kBAAmB,CACjB,OAAO,KAAK,WAAa,KAAK,YAAc,EAC9C,CAIA,UAAW,CACT,OAAAjB,EAAO,KAAK,UAAW,kCAAkC,EAClD,KAAK,MACd,CACA,UAAW,CACT,OAAO,KAAK,MACd,CACA,cAAe,CACb,MAAO,EAAE,KAAK,WAAa,KAAK,SAAW,KAAK,UAClD,CACA,WAAY,CACV,OAAO,KAAK,aAAa,GAAK,KAAK,SAAW6b,CAChD,CACA,MAAO,CACL,IAAMgI,EAAO,IAAID,EACjB,OAAAC,EAAK,UAAY,KAAK,UACtBA,EAAK,OAAS,KAAK,OACnBA,EAAK,UAAY,KAAK,UACtBA,EAAK,eAAiB,KAAK,eAC3BA,EAAK,iBAAmB,KAAK,iBAC7BA,EAAK,cAAgB,KAAK,cAC1BA,EAAK,gBAAkB,KAAK,gBAC5BA,EAAK,QAAU,KAAK,QACpBA,EAAK,cAAgB,KAAK,cAC1BA,EAAK,eAAiB,KAAK,eAC3BA,EAAK,YAAc,KAAK,YACxBA,EAAK,cAAgB,KAAK,cAC1BA,EAAK,OAAS,KAAK,OACnBA,EAAK,UAAY,KAAK,UACfA,CACT,CACF,EACA,SAASC,GAAyBC,EAAa,CAC7C,OAAIA,EAAY,aAAa,EACpB,IAAIlC,GAAckC,EAAY,SAAS,CAAC,EACtCA,EAAY,SAAS,EACvB,IAAIlB,GAAckB,CAAW,EAE7B,IAAI1B,GAAa0B,CAAW,CAEvC,CACA,SAASC,GAAwBD,EAAaE,EAAU,CACtD,IAAMC,EAAYH,EAAY,KAAK,EACnC,OAAAG,EAAU,UAAY,GACtBA,EAAU,OAASD,EACnBC,EAAU,UAAY,IACfA,CACT,CACA,SAASC,GAAuBJ,EAAaE,EAAU,CACrD,IAAMC,EAAYH,EAAY,KAAK,EACnC,OAAAG,EAAU,UAAY,GACtBA,EAAU,OAASD,EACnBC,EAAU,UAAY,IACfA,CACT,CACA,SAASE,GAAmBL,EAAavL,EAAYza,EAAK,CACxD,IAAMmmB,EAAYH,EAAY,KAAK,EACnC,OAAAG,EAAU,UAAY,GAClB1L,IAAe,SACjBA,EAAa,MAEf0L,EAAU,iBAAmB1L,EACzBza,GAAO,MACTmmB,EAAU,cAAgB,GAC1BA,EAAU,gBAAkBnmB,IAE5BmmB,EAAU,cAAgB,GAC1BA,EAAU,gBAAkB,IAEvBA,CACT,CACA,SAASG,GAAsBN,EAAavL,EAAYza,EAAK,CAC3D,IAAI0I,EACJ,OAAIsd,EAAY,SAAWtL,GAAe1a,EACxC0I,EAAS2d,GAAmBL,EAAavL,EAAYza,CAAG,EAExD0I,EAAS2d,GAAmBL,EAAavL,EAAYvX,EAAQ,EAE/DwF,EAAO,eAAiB,GACjBA,CACT,CACA,SAAS6d,GAAiBP,EAAavL,EAAYza,EAAK,CACtD,IAAMmmB,EAAYH,EAAY,KAAK,EACnC,OAAAG,EAAU,QAAU,GAChB1L,IAAe,SACjBA,EAAa,MAEf0L,EAAU,eAAiB1L,EACvBza,IAAQ,QACVmmB,EAAU,YAAc,GACxBA,EAAU,cAAgBnmB,IAE1BmmB,EAAU,YAAc,GACxBA,EAAU,cAAgB,IAErBA,CACT,CACA,SAASK,GAAqBR,EAAavL,EAAYza,EAAK,CAC1D,IAAI0I,EACJ,OAAIsd,EAAY,SAAWtL,GAAe1a,EACxC0I,EAAS6d,GAAiBP,EAAavL,EAAYza,CAAG,EAEtD0I,EAAS6d,GAAiBP,EAAavL,EAAYxX,EAAQ,EAE7DyF,EAAO,cAAgB,GAChBA,CACT,CACA,SAAS+d,GAAmBT,EAAalP,EAAO,CAC9C,IAAMqP,EAAYH,EAAY,KAAK,EACnC,OAAAG,EAAU,OAASrP,EACZqP,CACT,CAMA,SAASO,GAAuCV,EAAa,CAC3D,IAAMW,EAAK,CAAC,EACZ,GAAIX,EAAY,UAAU,EACxB,OAAOW,EAET,IAAIC,EAYJ,GAXIZ,EAAY,SAAWlI,EACzB8I,EAAU,YACDZ,EAAY,SAAW1C,GAChCsD,EAAU,SACDZ,EAAY,SAAWtL,EAChCkM,EAAU,QAEV3kB,EAAO+jB,EAAY,kBAAkBjD,GAAW,0BAA0B,EAC1E6D,EAAUZ,EAAY,OAAO,SAAS,GAExCW,EAAG,QAAiDzmB,EAAU0mB,CAAO,EACjEZ,EAAY,UAAW,CACzB,IAAMa,EAAab,EAAY,eAAiB,aAAsD,UACtGW,EAAGE,CAAU,EAAI3mB,EAAU8lB,EAAY,gBAAgB,EACnDA,EAAY,gBACdW,EAAGE,CAAU,GAAK,IAAM3mB,EAAU8lB,EAAY,eAAe,EAEjE,CACA,GAAIA,EAAY,QAAS,CACvB,IAAMc,EAAWd,EAAY,cAAgB,YAAoD,QACjGW,EAAGG,CAAQ,EAAI5mB,EAAU8lB,EAAY,cAAc,EAC/CA,EAAY,cACdW,EAAGG,CAAQ,GAAK,IAAM5mB,EAAU8lB,EAAY,aAAa,EAE7D,CACA,OAAIA,EAAY,YACVA,EAAY,eAAe,EAC7BW,EAAG,aAA4DX,EAAY,OAE3EW,EAAG,YAA0DX,EAAY,QAGtEW,CACT,CACA,SAASI,GAA0Bf,EAAa,CAC9C,IAAMriB,EAAM,CAAC,EAeb,GAdIqiB,EAAY,YACdriB,EAAI,GAAwDqiB,EAAY,iBACpEA,EAAY,gBACdriB,EAAI,GAAuDqiB,EAAY,iBAEzEriB,EAAI,IAAgE,CAACqiB,EAAY,gBAE/EA,EAAY,UACdriB,EAAI,GAAsDqiB,EAAY,eAClEA,EAAY,cACdriB,EAAI,GAAqDqiB,EAAY,eAEvEriB,EAAI,IAA8D,CAACqiB,EAAY,eAE7EA,EAAY,UAAW,CACzBriB,EAAI,EAA2CqiB,EAAY,OAC3D,IAAIgB,EAAWhB,EAAY,UACvBgB,IAAa,KACXhB,EAAY,eAAe,EAC7BgB,EAAW,IAEXA,EAAW,KAGfrjB,EAAI,GAAgDqjB,CACtD,CAEA,OAAIhB,EAAY,SAAWlI,IACzBna,EAAI,EAA2CqiB,EAAY,OAAO,SAAS,GAEtEriB,CACT,CAuBA,IAAMsjB,GAAN,MAAMC,UAA2B5V,EAAc,CAC7C,YAAYK,EAAO,CACjB,MAAM,IAAI,MAAM,yBAAyB,CAC3C,CACA,OAAO,aAAavM,EAAO4R,EAAK,CAC9B,OAAIA,IAAQ,OACH,OAASA,GAEhB/U,EAAOmD,EAAM,aAAa,UAAU,EAAG,gDAAgD,EAChFA,EAAM,MAAM,SAAS,EAEhC,CAKA,YAAY4K,EAAWiG,EAAeG,EAAoBC,EAAwB,CAChF,MAAM,EACN,KAAK,UAAYrG,EACjB,KAAK,cAAgBiG,EACrB,KAAK,mBAAqBG,EAC1B,KAAK,uBAAyBC,EAE9B,KAAK,KAAOjU,GAAW,SAAS,EAKhC,KAAK,SAAW,CAAC,CACnB,CAEA,OAAOgD,EAAO2R,EAAeC,EAAKxF,EAAY,CAC5C,IAAMD,EAAanM,EAAM,MAAM,SAAS,EACxC,KAAK,KAAK,qBAAuBmM,EAAa,IAAMnM,EAAM,gBAAgB,EAE1E,IAAM+hB,EAAWD,EAAmB,aAAa9hB,EAAO4R,CAAG,EACrDoQ,EAAa,CAAC,EACpB,KAAK,SAASD,CAAQ,EAAIC,EAC1B,IAAMC,EAAwBX,GAAuCthB,EAAM,YAAY,EACvF,KAAK,aAAamM,EAAa,QAAS8V,EAAuB,CAAC/kB,EAAO6V,IAAW,CAChF,IAAIxV,EAAOwV,EAQX,GAPI7V,IAAU,MACZK,EAAO,KACPL,EAAQ,MAENA,IAAU,MACZ,KAAK,cAAciP,EAAY5O,EAAkB,GAAOqU,CAAG,EAEzDO,GAAQ,KAAK,SAAU4P,CAAQ,IAAMC,EAAY,CACnD,IAAI/P,EACC/U,EAEMA,IAAU,IACnB+U,EAAS,oBAETA,EAAS,cAAgB/U,EAJzB+U,EAAS,KAMX7F,EAAW6F,EAAQ,IAAI,CACzB,CACF,CAAC,CACH,CAEA,SAASjS,EAAO4R,EAAK,CACnB,IAAMmQ,EAAWD,EAAmB,aAAa9hB,EAAO4R,CAAG,EAC3D,OAAO,KAAK,SAASmQ,CAAQ,CAC/B,CACA,IAAI/hB,EAAO,CACT,IAAMiiB,EAAwBX,GAAuCthB,EAAM,YAAY,EACjFmM,EAAanM,EAAM,MAAM,SAAS,EAClCuR,EAAW,IAAIC,EACrB,YAAK,aAAarF,EAAa,QAAS8V,EAAuB,CAAC/kB,EAAO6V,IAAW,CAChF,IAAIxV,EAAOwV,EACP7V,IAAU,MACZK,EAAO,KACPL,EAAQ,MAENA,IAAU,MACZ,KAAK,cAAciP,EAAY5O,EAAkB,GAAe,IAAI,EACpEgU,EAAS,QAAQhU,CAAI,GAErBgU,EAAS,OAAO,IAAI,MAAMhU,CAAI,CAAC,CAEnC,CAAC,EACMgU,EAAS,OAClB,CAEA,iBAAiBjF,EAAO,CAExB,CAKA,aAAaH,EAAY8V,EAAwB,CAAC,EAAG5d,EAAU,CAC7D,OAAA4d,EAAsB,OAAY,SAC3B,QAAQ,IAAI,CAAC,KAAK,mBAAmB,SAA0B,EAAK,EAAG,KAAK,uBAAuB,SAA0B,EAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAACnc,EAAWD,CAAa,IAAM,CAC5KC,GAAaA,EAAU,cACzBmc,EAAsB,KAAUnc,EAAU,aAExCD,GAAiBA,EAAc,QACjCoc,EAAsB,GAAQpc,EAAc,OAE9C,IAAMkC,GAAO,KAAK,UAAU,OAAS,WAAa,WAAa,KAAK,UAAU,KAAOoE,EAAa,OAAc,KAAK,UAAU,UAAY+V,GAAYD,CAAqB,EAC5K,KAAK,KAAK,4BAA8Bla,CAAG,EAC3C,IAAMoa,EAAM,IAAI,eAChBA,EAAI,mBAAqB,IAAM,CAC7B,GAAI9d,GAAY8d,EAAI,aAAe,EAAG,CACpC,KAAK,KAAK,qBAAuBpa,EAAM,qBAAsBoa,EAAI,OAAQ,YAAaA,EAAI,YAAY,EACtG,IAAIxP,EAAM,KACV,GAAIwP,EAAI,QAAU,KAAOA,EAAI,OAAS,IAAK,CACzC,GAAI,CACFxP,EAAM3X,GAASmnB,EAAI,YAAY,CACjC,MAAY,CACV/kB,EAAK,qCAAuC2K,EAAM,KAAOoa,EAAI,YAAY,CAC3E,CACA9d,EAAS,KAAMsO,CAAG,CACpB,MAEMwP,EAAI,SAAW,KAAOA,EAAI,SAAW,KACvC/kB,EAAK,sCAAwC2K,EAAM,YAAcoa,EAAI,MAAM,EAE7E9d,EAAS8d,EAAI,MAAM,EAErB9d,EAAW,IACb,CACF,EACA8d,EAAI,KAAK,MAAOpa,EAAsB,EAAI,EAC1Coa,EAAI,KAAK,CACX,CAAC,CACH,CACF,EAqBA,IAAMC,GAAN,KAAqB,CACnB,aAAc,CACZ,KAAK,UAAY3G,EAAa,UAChC,CACA,QAAQ/N,EAAM,CACZ,OAAO,KAAK,UAAU,SAASA,CAAI,CACrC,CACA,eAAeA,EAAM2U,EAAiB,CACpC,KAAK,UAAY,KAAK,UAAU,YAAY3U,EAAM2U,CAAe,CACnE,CACF,EAkBA,SAASC,IAAwB,CAC/B,MAAO,CACL,MAAO,KACP,SAAU,IAAI,GAChB,CACF,CAQA,SAASC,GAA2BC,EAAoB9U,EAAMnQ,EAAM,CAClE,GAAI+Q,EAAYZ,CAAI,EAClB8U,EAAmB,MAAQjlB,EAC3BilB,EAAmB,SAAS,MAAM,UACzBA,EAAmB,QAAU,KACtCA,EAAmB,MAAQA,EAAmB,MAAM,YAAY9U,EAAMnQ,CAAI,MACrE,CACL,IAAMsiB,EAAWpS,EAAaC,CAAI,EAC7B8U,EAAmB,SAAS,IAAI3C,CAAQ,GAC3C2C,EAAmB,SAAS,IAAI3C,EAAUyC,GAAsB,CAAC,EAEnE,IAAM1S,EAAQ4S,EAAmB,SAAS,IAAI3C,CAAQ,EACtDnS,EAAOE,EAAaF,CAAI,EACxB6U,GAA2B3S,EAAOlC,EAAMnQ,CAAI,CAC9C,CACF,CAOA,SAASklB,GAAyBD,EAAoB9U,EAAM,CAC1D,GAAIY,EAAYZ,CAAI,EAClB,OAAA8U,EAAmB,MAAQ,KAC3BA,EAAmB,SAAS,MAAM,EAC3B,GAEP,GAAIA,EAAmB,QAAU,KAAM,CACrC,GAAIA,EAAmB,MAAM,WAAW,EAEtC,MAAO,GACF,CACL,IAAM3nB,EAAQ2nB,EAAmB,MACjC,OAAAA,EAAmB,MAAQ,KAC3B3nB,EAAM,aAAa6d,EAAgB,CAAC9d,EAAK8nB,IAAS,CAChDH,GAA2BC,EAAoB,IAAIpV,EAAKxS,CAAG,EAAG8nB,CAAI,CACpE,CAAC,EACMD,GAAyBD,EAAoB9U,CAAI,CAC1D,CACF,SAAW8U,EAAmB,SAAS,KAAO,EAAG,CAC/C,IAAM3C,EAAWpS,EAAaC,CAAI,EAClC,OAAAA,EAAOE,EAAaF,CAAI,EACpB8U,EAAmB,SAAS,IAAI3C,CAAQ,GACrB4C,GAAyBD,EAAmB,SAAS,IAAI3C,CAAQ,EAAGnS,CAAI,GAE3F8U,EAAmB,SAAS,OAAO3C,CAAQ,EAGxC2C,EAAmB,SAAS,OAAS,CAC9C,KACE,OAAO,EAGb,CAQA,SAASG,GAA8BH,EAAoBI,EAAYC,EAAM,CACvEL,EAAmB,QAAU,KAC/BK,EAAKD,EAAYJ,EAAmB,KAAK,EAEzCM,GAA+BN,EAAoB,CAAC5nB,EAAK8nB,IAAS,CAChE,IAAMhV,EAAO,IAAIN,EAAKwV,EAAW,SAAS,EAAI,IAAMhoB,CAAG,EACvD+nB,GAA8BD,EAAMhV,EAAMmV,CAAI,CAChD,CAAC,CAEL,CAOA,SAASC,GAA+BN,EAAoBK,EAAM,CAChEL,EAAmB,SAAS,QAAQ,CAACE,EAAM9nB,IAAQ,CACjDioB,EAAKjoB,EAAK8nB,CAAI,CAChB,CAAC,CACH,CAuBA,IAAMK,GAAN,KAAoB,CAClB,YAAYC,EAAa,CACvB,KAAK,YAAcA,EACnB,KAAK,MAAQ,IACf,CACA,KAAM,CACJ,IAAMC,EAAW,KAAK,YAAY,IAAI,EAChCnP,EAAQ,OAAO,OAAO,CAAC,EAAGmP,CAAQ,EACxC,OAAI,KAAK,OACPjkB,EAAK,KAAK,MAAO,CAACkkB,EAAMroB,IAAU,CAChCiZ,EAAMoP,CAAI,EAAIpP,EAAMoP,CAAI,EAAIroB,CAC9B,CAAC,EAEH,KAAK,MAAQooB,EACNnP,CACT,CACF,EAqBA,IAAMqP,GAAuB,GAAK,IAC5BC,GAAuB,GAAK,IAE5BC,GAAwB,EAAI,GAAK,IACjCC,GAAN,KAAoB,CAClB,YAAYC,EAAYC,EAAS,CAC/B,KAAK,QAAUA,EACf,KAAK,eAAiB,CAAC,EACvB,KAAK,eAAiB,IAAIT,GAAcQ,CAAU,EAClD,IAAM5iB,EAAUwiB,IAAwBC,GAAuBD,IAAwB,KAAK,OAAO,EACnG1iB,GAAsB,KAAK,aAAa,KAAK,IAAI,EAAG,KAAK,MAAME,CAAO,CAAC,CACzE,CACA,cAAe,CACb,IAAM4L,EAAQ,KAAK,eAAe,IAAI,EAChCkX,EAAgB,CAAC,EACnBC,EAAoB,GACxB1kB,EAAKuN,EAAO,CAAC2W,EAAMroB,IAAU,CACvBA,EAAQ,GAAKK,EAAS,KAAK,eAAgBgoB,CAAI,IACjDO,EAAcP,CAAI,EAAIroB,EACtB6oB,EAAoB,GAExB,CAAC,EACGA,GACF,KAAK,QAAQ,YAAYD,CAAa,EAGxChjB,GAAsB,KAAK,aAAa,KAAK,IAAI,EAAG,KAAK,MAAM,KAAK,OAAO,EAAI,EAAI4iB,EAAqB,CAAC,CAC3G,CACF,EAsBA,IAAIM,EAA6B,SAAUA,EAAe,CACxD,OAAAA,EAAcA,EAAc,UAAe,CAAC,EAAI,YAChDA,EAAcA,EAAc,MAAW,CAAC,EAAI,QAC5CA,EAAcA,EAAc,eAAoB,CAAC,EAAI,iBACrDA,EAAcA,EAAc,gBAAqB,CAAC,EAAI,kBAC/CA,CACT,EAAEA,GAAiB,CAAC,CAAC,EACrB,SAASC,IAAyB,CAChC,MAAO,CACL,SAAU,GACV,WAAY,GACZ,QAAS,KACT,OAAQ,EACV,CACF,CACA,SAASC,IAA2B,CAClC,MAAO,CACL,SAAU,GACV,WAAY,GACZ,QAAS,KACT,OAAQ,EACV,CACF,CACA,SAASC,GAAoCjS,EAAS,CACpD,MAAO,CACL,SAAU,GACV,WAAY,GACZ,QAAAA,EACA,OAAQ,EACV,CACF,CAkBA,IAAMkS,GAAN,MAAMC,CAAa,CAIjB,YAA8BtW,EAAwBuW,EAAgCC,EAAQ,CAC5F,KAAK,KAAOxW,EACZ,KAAK,aAAeuW,EACpB,KAAK,OAASC,EAEd,KAAK,KAAOP,EAAc,eAE1B,KAAK,OAASC,GAAuB,CACvC,CACA,kBAAkBrM,EAAW,CAC3B,GAAKjJ,EAAY,KAAK,IAAI,EAGnB,IAAI,KAAK,aAAa,OAAS,KACpC,OAAAzR,EAAO,KAAK,aAAa,SAAS,QAAQ,EAAG,0DAA0D,EAEhG,KACF,CACL,IAAMmd,EAAY,KAAK,aAAa,QAAQ,IAAI5M,EAAKmK,CAAS,CAAC,EAC/D,OAAO,IAAIyM,EAAaxW,EAAa,EAAGwM,EAAW,KAAK,MAAM,CAChE,MATE,QAAAnd,EAAO4Q,EAAa,KAAK,IAAI,IAAM8J,EAAW,+CAA+C,EACtF,IAAIyM,EAAapW,EAAa,KAAK,IAAI,EAAG,KAAK,aAAc,KAAK,MAAM,CASnF,CACF,EAkBA,IAAMuW,GAAN,MAAMC,CAAe,CACnB,YAAYtF,EAAQpR,EAAM,CACxB,KAAK,OAASoR,EACd,KAAK,KAAOpR,EAEZ,KAAK,KAAOiW,EAAc,eAC5B,CACA,kBAAkBpM,EAAW,CAC3B,OAAIjJ,EAAY,KAAK,IAAI,EAChB,IAAI8V,EAAe,KAAK,OAAQ5W,EAAa,CAAC,EAE9C,IAAI4W,EAAe,KAAK,OAAQxW,EAAa,KAAK,IAAI,CAAC,CAElE,CACF,EAkBA,IAAMyW,GAAN,MAAMC,CAAU,CACd,YAAYxF,EAAQpR,EAAMmQ,EAAM,CAC9B,KAAK,OAASiB,EACd,KAAK,KAAOpR,EACZ,KAAK,KAAOmQ,EAEZ,KAAK,KAAO8F,EAAc,SAC5B,CACA,kBAAkBpM,EAAW,CAC3B,OAAIjJ,EAAY,KAAK,IAAI,EAChB,IAAIgW,EAAU,KAAK,OAAQ9W,EAAa,EAAG,KAAK,KAAK,kBAAkB+J,CAAS,CAAC,EAEjF,IAAI+M,EAAU,KAAK,OAAQ1W,EAAa,KAAK,IAAI,EAAG,KAAK,IAAI,CAExE,CACF,EAkBA,IAAM2W,GAAN,MAAMC,CAAM,CACV,YAA8B1F,EAA0BpR,EAAwB4P,EAAU,CACxF,KAAK,OAASwB,EACd,KAAK,KAAOpR,EACZ,KAAK,SAAW4P,EAEhB,KAAK,KAAOqG,EAAc,KAC5B,CACA,kBAAkBpM,EAAW,CAC3B,GAAIjJ,EAAY,KAAK,IAAI,EAAG,CAC1B,IAAM0L,EAAY,KAAK,SAAS,QAAQ,IAAI5M,EAAKmK,CAAS,CAAC,EAC3D,OAAIyC,EAAU,QAAQ,EAEb,KACEA,EAAU,MAEZ,IAAIqK,GAAU,KAAK,OAAQ7W,EAAa,EAAGwM,EAAU,KAAK,EAG1D,IAAIwK,EAAM,KAAK,OAAQhX,EAAa,EAAGwM,CAAS,CAE3D,KACE,QAAAnd,EAAO4Q,EAAa,KAAK,IAAI,IAAM8J,EAAW,gEAAgE,EACvG,IAAIiN,EAAM,KAAK,OAAQ5W,EAAa,KAAK,IAAI,EAAG,KAAK,QAAQ,CAExE,CACA,UAAW,CACT,MAAO,aAAe,KAAK,KAAO,KAAO,KAAK,OAAO,SAAS,EAAI,WAAa,KAAK,SAAS,SAAS,EAAI,GAC5G,CACF,EAwBA,IAAM6W,GAAN,KAAgB,CACd,YAAYC,EAAOC,EAAmBC,EAAW,CAC/C,KAAK,MAAQF,EACb,KAAK,kBAAoBC,EACzB,KAAK,UAAYC,CACnB,CAIA,oBAAqB,CACnB,OAAO,KAAK,iBACd,CAIA,YAAa,CACX,OAAO,KAAK,SACd,CACA,kBAAkBlX,EAAM,CACtB,GAAIY,EAAYZ,CAAI,EAClB,OAAO,KAAK,mBAAmB,GAAK,CAAC,KAAK,UAE5C,IAAMmS,EAAWpS,EAAaC,CAAI,EAClC,OAAO,KAAK,mBAAmBmS,CAAQ,CACzC,CACA,mBAAmBjlB,EAAK,CACtB,OAAO,KAAK,mBAAmB,GAAK,CAAC,KAAK,WAAa,KAAK,MAAM,SAASA,CAAG,CAChF,CACA,SAAU,CACR,OAAO,KAAK,KACd,CACF,EAwBA,IAAMiqB,GAAN,KAAqB,CACnB,YAAYC,EAAQ,CAClB,KAAK,OAASA,EACd,KAAK,OAAS,KAAK,OAAO,aAAa,SAAS,CAClD,CACF,EAUA,SAASC,GAAuCC,EAAgBC,EAASC,EAAYC,EAAoB,CACvG,IAAMC,EAAS,CAAC,EACVC,EAAQ,CAAC,EACf,OAAAJ,EAAQ,QAAQK,GAAU,CACpBA,EAAO,OAAS,iBAAkDN,EAAe,OAAO,oBAAoBM,EAAO,QAASA,EAAO,YAAY,GACjJD,EAAM,KAAK5G,GAAiB6G,EAAO,UAAWA,EAAO,YAAY,CAAC,CAEtE,CAAC,EACDC,GAAoCP,EAAgBI,EAAQ,gBAAgDH,EAASE,EAAoBD,CAAU,EACnJK,GAAoCP,EAAgBI,EAAQ,cAA4CH,EAASE,EAAoBD,CAAU,EAC/IK,GAAoCP,EAAgBI,EAAQ,cAA4CC,EAAOF,EAAoBD,CAAU,EAC7IK,GAAoCP,EAAgBI,EAAQ,gBAAgDH,EAASE,EAAoBD,CAAU,EACnJK,GAAoCP,EAAgBI,EAAQ,QAAgCH,EAASE,EAAoBD,CAAU,EAC5HE,CACT,CAIA,SAASG,GAAoCP,EAAgBI,EAAQ1Y,EAAWuY,EAASO,EAAeN,EAAY,CAClH,IAAMO,EAAkBR,EAAQ,OAAOK,GAAUA,EAAO,OAAS5Y,CAAS,EAC1E+Y,EAAgB,KAAK,CAAC,EAAGxnB,IAAMynB,GAA6BV,EAAgB,EAAG/mB,CAAC,CAAC,EACjFwnB,EAAgB,QAAQH,GAAU,CAChC,IAAMK,EAAqBC,GAAsCZ,EAAgBM,EAAQJ,CAAU,EACnGM,EAAc,QAAQK,GAAgB,CAChCA,EAAa,WAAWP,EAAO,IAAI,GACrCF,EAAO,KAAKS,EAAa,YAAYF,EAAoBX,EAAe,MAAM,CAAC,CAEnF,CAAC,CACH,CAAC,CACH,CACA,SAASY,GAAsCZ,EAAgBM,EAAQJ,EAAY,CACjF,OAAII,EAAO,OAAS,SAAWA,EAAO,OAAS,kBAG7CA,EAAO,SAAWJ,EAAW,wBAAwBI,EAAO,UAAWA,EAAO,aAAcN,EAAe,MAAM,GAC1GM,CAEX,CACA,SAASI,GAA6BV,EAAgBhnB,EAAGC,EAAG,CAC1D,GAAID,EAAE,WAAa,MAAQC,EAAE,WAAa,KACxC,MAAMmX,GAAe,oCAAoC,EAE3D,IAAM0Q,EAAW,IAAIrR,EAAUzW,EAAE,UAAWA,EAAE,YAAY,EACpD+nB,EAAW,IAAItR,EAAUxW,EAAE,UAAWA,EAAE,YAAY,EAC1D,OAAO+mB,EAAe,OAAO,QAAQc,EAAUC,CAAQ,CACzD,CAkBA,SAASC,GAAad,EAAYe,EAAa,CAC7C,MAAO,CACL,WAAAf,EACA,YAAAe,CACF,CACF,CACA,SAASC,GAAyBC,EAAWC,EAAWC,EAAU/G,EAAU,CAC1E,OAAO0G,GAAa,IAAIvB,GAAU2B,EAAWC,EAAU/G,CAAQ,EAAG6G,EAAU,WAAW,CACzF,CACA,SAASG,GAA0BH,EAAWI,EAAYF,EAAU/G,EAAU,CAC5E,OAAO0G,GAAaG,EAAU,WAAY,IAAI1B,GAAU8B,EAAYF,EAAU/G,CAAQ,CAAC,CACzF,CACA,SAASkH,GAA8BL,EAAW,CAChD,OAAOA,EAAU,WAAW,mBAAmB,EAAIA,EAAU,WAAW,QAAQ,EAAI,IACtF,CACA,SAASM,GAA+BN,EAAW,CACjD,OAAOA,EAAU,YAAY,mBAAmB,EAAIA,EAAU,YAAY,QAAQ,EAAI,IACxF,CAkBA,IAAIO,GAKEC,GAAgB,KACfD,KACHA,GAAyB,IAAI5Q,EAAUzX,EAAa,GAE/CqoB,IAKHE,EAAN,MAAMC,CAAc,CAClB,OAAO,WAAWtoB,EAAK,CACrB,IAAImkB,EAAO,IAAImE,EAAc,IAAI,EACjC,OAAA7nB,EAAKT,EAAK,CAACuoB,EAAWhH,IAAc,CAClC4C,EAAOA,EAAK,IAAI,IAAItV,EAAK0Z,CAAS,EAAGhH,CAAS,CAChD,CAAC,EACM4C,CACT,CACA,YAAY7nB,EAAOyiB,EAAWqJ,GAAc,EAAG,CAC7C,KAAK,MAAQ9rB,EACb,KAAK,SAAWyiB,CAClB,CAIA,SAAU,CACR,OAAO,KAAK,QAAU,MAAQ,KAAK,SAAS,QAAQ,CACtD,CAWA,iCAAiCyJ,EAAcC,EAAW,CACxD,GAAI,KAAK,OAAS,MAAQA,EAAU,KAAK,KAAK,EAC5C,MAAO,CACL,KAAMxZ,EAAa,EACnB,MAAO,KAAK,KACd,EAEA,GAAIc,EAAYyY,CAAY,EAC1B,OAAO,KACF,CACL,IAAMrP,EAAQjK,EAAasZ,CAAY,EACjCnX,EAAQ,KAAK,SAAS,IAAI8H,CAAK,EACrC,GAAI9H,IAAU,KAAM,CAClB,IAAMqX,EAA4BrX,EAAM,iCAAiChC,EAAamZ,CAAY,EAAGC,CAAS,EAC9G,OAAIC,GAA6B,KAExB,CACL,KAFe9Y,EAAU,IAAIf,EAAKsK,CAAK,EAAGuP,EAA0B,IAAI,EAGxE,MAAOA,EAA0B,KACnC,EAEO,IAEX,KACE,QAAO,IAEX,CAEJ,CAKA,yBAAyBF,EAAc,CACrC,OAAO,KAAK,iCAAiCA,EAAc,IAAM,EAAI,CACvE,CAIA,QAAQA,EAAc,CACpB,GAAIzY,EAAYyY,CAAY,EAC1B,OAAO,KACF,CACL,IAAMrP,EAAQjK,EAAasZ,CAAY,EACjC/M,EAAY,KAAK,SAAS,IAAItC,CAAK,EACzC,OAAIsC,IAAc,KACTA,EAAU,QAAQpM,EAAamZ,CAAY,CAAC,EAE5C,IAAIF,EAAc,IAAI,CAEjC,CACF,CAQA,IAAIE,EAAcG,EAAO,CACvB,GAAI5Y,EAAYyY,CAAY,EAC1B,OAAO,IAAIF,EAAcK,EAAO,KAAK,QAAQ,EACxC,CACL,IAAMxP,EAAQjK,EAAasZ,CAAY,EAEjCnI,GADQ,KAAK,SAAS,IAAIlH,CAAK,GAAK,IAAImP,EAAc,IAAI,GACzC,IAAIjZ,EAAamZ,CAAY,EAAGG,CAAK,EACtD3L,EAAc,KAAK,SAAS,OAAO7D,EAAOkH,CAAQ,EACxD,OAAO,IAAIiI,EAAc,KAAK,MAAOtL,CAAW,CAClD,CACF,CAOA,OAAOwL,EAAc,CACnB,GAAIzY,EAAYyY,CAAY,EAC1B,OAAI,KAAK,SAAS,QAAQ,EACjB,IAAIF,EAAc,IAAI,EAEtB,IAAIA,EAAc,KAAM,KAAK,QAAQ,EAEzC,CACL,IAAMnP,EAAQjK,EAAasZ,CAAY,EACjCnX,EAAQ,KAAK,SAAS,IAAI8H,CAAK,EACrC,GAAI9H,EAAO,CACT,IAAMgP,EAAWhP,EAAM,OAAOhC,EAAamZ,CAAY,CAAC,EACpDxL,EAMJ,OALIqD,EAAS,QAAQ,EACnBrD,EAAc,KAAK,SAAS,OAAO7D,CAAK,EAExC6D,EAAc,KAAK,SAAS,OAAO7D,EAAOkH,CAAQ,EAEhD,KAAK,QAAU,MAAQrD,EAAY,QAAQ,EACtC,IAAIsL,EAAc,IAAI,EAEtB,IAAIA,EAAc,KAAK,MAAOtL,CAAW,CAEpD,KACE,QAAO,IAEX,CACF,CAOA,IAAIwL,EAAc,CAChB,GAAIzY,EAAYyY,CAAY,EAC1B,OAAO,KAAK,MACP,CACL,IAAMrP,EAAQjK,EAAasZ,CAAY,EACjCnX,EAAQ,KAAK,SAAS,IAAI8H,CAAK,EACrC,OAAI9H,EACKA,EAAM,IAAIhC,EAAamZ,CAAY,CAAC,EAEpC,IAEX,CACF,CAQA,QAAQA,EAAcI,EAAS,CAC7B,GAAI7Y,EAAYyY,CAAY,EAC1B,OAAOI,EACF,CACL,IAAMzP,EAAQjK,EAAasZ,CAAY,EAEjCnI,GADQ,KAAK,SAAS,IAAIlH,CAAK,GAAK,IAAImP,EAAc,IAAI,GACzC,QAAQjZ,EAAamZ,CAAY,EAAGI,CAAO,EAC9D5L,EACJ,OAAIqD,EAAS,QAAQ,EACnBrD,EAAc,KAAK,SAAS,OAAO7D,CAAK,EAExC6D,EAAc,KAAK,SAAS,OAAO7D,EAAOkH,CAAQ,EAE7C,IAAIiI,EAAc,KAAK,MAAOtL,CAAW,CAClD,CACF,CAMA,KAAK9d,EAAI,CACP,OAAO,KAAK,MAAM+P,EAAa,EAAG/P,CAAE,CACtC,CAIA,MAAM2pB,EAAW3pB,EAAI,CACnB,IAAM4pB,EAAQ,CAAC,EACf,YAAK,SAAS,iBAAiB,CAACxH,EAAU7F,IAAc,CACtDqN,EAAMxH,CAAQ,EAAI7F,EAAU,MAAM7L,EAAUiZ,EAAWvH,CAAQ,EAAGpiB,CAAE,CACtE,CAAC,EACMA,EAAG2pB,EAAW,KAAK,MAAOC,CAAK,CACxC,CAIA,WAAW3Z,EAAMnO,EAAG,CAClB,OAAO,KAAK,YAAYmO,EAAMF,EAAa,EAAGjO,CAAC,CACjD,CACA,YAAY+nB,EAAcF,EAAW7nB,EAAG,CACtC,IAAMwT,EAAS,KAAK,MAAQxT,EAAE6nB,EAAW,KAAK,KAAK,EAAI,GACvD,GAAIrU,EACF,OAAOA,EAEP,GAAIzE,EAAYgZ,CAAY,EAC1B,OAAO,KACF,CACL,IAAM5P,EAAQjK,EAAa6Z,CAAY,EACjCjH,EAAY,KAAK,SAAS,IAAI3I,CAAK,EACzC,OAAI2I,EACKA,EAAU,YAAYzS,EAAa0Z,CAAY,EAAGnZ,EAAUiZ,EAAW1P,CAAK,EAAGnY,CAAC,EAEhF,IAEX,CAEJ,CACA,cAAcmO,EAAMnO,EAAG,CACrB,OAAO,KAAK,eAAemO,EAAMF,EAAa,EAAGjO,CAAC,CACpD,CACA,eAAe+nB,EAAcC,EAAqBhoB,EAAG,CACnD,GAAI+O,EAAYgZ,CAAY,EAC1B,OAAO,KACF,CACD,KAAK,OACP/nB,EAAEgoB,EAAqB,KAAK,KAAK,EAEnC,IAAM7P,EAAQjK,EAAa6Z,CAAY,EACjCjH,EAAY,KAAK,SAAS,IAAI3I,CAAK,EACzC,OAAI2I,EACKA,EAAU,eAAezS,EAAa0Z,CAAY,EAAGnZ,EAAUoZ,EAAqB7P,CAAK,EAAGnY,CAAC,EAE7F,IAAIsnB,EAAc,IAAI,CAEjC,CACF,CAOA,QAAQtnB,EAAG,CACT,KAAK,SAASiO,EAAa,EAAGjO,CAAC,CACjC,CACA,SAASgoB,EAAqBhoB,EAAG,CAC/B,KAAK,SAAS,iBAAiB,CAACgY,EAAWyC,IAAc,CACvDA,EAAU,SAAS7L,EAAUoZ,EAAqBhQ,CAAS,EAAGhY,CAAC,CACjE,CAAC,EACG,KAAK,OACPA,EAAEgoB,EAAqB,KAAK,KAAK,CAErC,CACA,aAAahoB,EAAG,CACd,KAAK,SAAS,iBAAiB,CAACgY,EAAWyC,IAAc,CACnDA,EAAU,OACZza,EAAEgY,EAAWyC,EAAU,KAAK,CAEhC,CAAC,CACH,CACF,EAwBA,IAAMwN,EAAN,MAAMC,CAAc,CAClB,YAAYC,EAAY,CACtB,KAAK,WAAaA,CACpB,CACA,OAAO,OAAQ,CACb,OAAO,IAAID,EAAc,IAAIb,EAAc,IAAI,CAAC,CAClD,CACF,EACA,SAASe,GAAsBC,EAAela,EAAMiH,EAAM,CACxD,GAAIrG,EAAYZ,CAAI,EAClB,OAAO,IAAI8Z,EAAc,IAAIZ,EAAcjS,CAAI,CAAC,EAC3C,CACL,IAAMkT,EAAWD,EAAc,WAAW,yBAAyBla,CAAI,EACvE,GAAIma,GAAY,KAAM,CACpB,IAAMC,EAAeD,EAAS,KAC1BhtB,EAAQgtB,EAAS,MACfd,EAAexY,EAAgBuZ,EAAcpa,CAAI,EACvD,OAAA7S,EAAQA,EAAM,YAAYksB,EAAcpS,CAAI,EACrC,IAAI6S,EAAcI,EAAc,WAAW,IAAIE,EAAcjtB,CAAK,CAAC,CAC5E,KAAO,CACL,IAAMktB,EAAU,IAAInB,EAAcjS,CAAI,EAChCqT,EAAeJ,EAAc,WAAW,QAAQla,EAAMqa,CAAO,EACnE,OAAO,IAAIP,EAAcQ,CAAY,CACvC,CACF,CACF,CACA,SAASC,GAAuBL,EAAela,EAAMwa,EAAS,CAC5D,IAAIC,EAAWP,EACf,OAAA5oB,EAAKkpB,EAAS,CAACrI,EAAUlL,IAAS,CAChCwT,EAAWR,GAAsBQ,EAAUha,EAAUT,EAAMmS,CAAQ,EAAGlL,CAAI,CAC5E,CAAC,EACMwT,CACT,CASA,SAASC,GAAyBR,EAAela,EAAM,CACrD,GAAIY,EAAYZ,CAAI,EAClB,OAAO8Z,EAAc,MAAM,EACtB,CACL,IAAMQ,EAAeJ,EAAc,WAAW,QAAQla,EAAM,IAAIkZ,EAAc,IAAI,CAAC,EACnF,OAAO,IAAIY,EAAcQ,CAAY,CACvC,CACF,CASA,SAASK,GAA8BT,EAAela,EAAM,CAC1D,OAAO4a,GAA6BV,EAAela,CAAI,GAAK,IAC9D,CASA,SAAS4a,GAA6BV,EAAela,EAAM,CACzD,IAAMma,EAAWD,EAAc,WAAW,yBAAyBla,CAAI,EACvE,OAAIma,GAAY,KACPD,EAAc,WAAW,IAAIC,EAAS,IAAI,EAAE,SAAStZ,EAAgBsZ,EAAS,KAAMna,CAAI,CAAC,EAEzF,IAEX,CAOA,SAAS6a,GAAiCX,EAAe,CACvD,IAAMtK,EAAW,CAAC,EACZ3I,EAAOiT,EAAc,WAAW,MACtC,OAAIjT,GAAQ,KAELA,EAAK,WAAW,GACnBA,EAAK,aAAa+D,EAAgB,CAACnB,EAAWC,IAAc,CAC1D8F,EAAS,KAAK,IAAI7I,EAAU8C,EAAWC,CAAS,CAAC,CACnD,CAAC,EAGHoQ,EAAc,WAAW,SAAS,iBAAiB,CAACrQ,EAAWyC,IAAc,CACvEA,EAAU,OAAS,MACrBsD,EAAS,KAAK,IAAI7I,EAAU8C,EAAWyC,EAAU,KAAK,CAAC,CAE3D,CAAC,EAEIsD,CACT,CACA,SAASkL,GAAgCZ,EAAela,EAAM,CAC5D,GAAIY,EAAYZ,CAAI,EAClB,OAAOka,EACF,CACL,IAAMa,EAAgBH,GAA6BV,EAAela,CAAI,EACtE,OAAI+a,GAAiB,KACZ,IAAIjB,EAAc,IAAIZ,EAAc6B,CAAa,CAAC,EAElD,IAAIjB,EAAcI,EAAc,WAAW,QAAQla,CAAI,CAAC,CAEnE,CACF,CAKA,SAASgb,GAAqBd,EAAe,CAC3C,OAAOA,EAAc,WAAW,QAAQ,CAC1C,CAOA,SAASe,GAAmBf,EAAejT,EAAM,CAC/C,OAAOiU,GAAkBpb,EAAa,EAAGoa,EAAc,WAAYjT,CAAI,CACzE,CACA,SAASiU,GAAkB7B,EAAc8B,EAAWlU,EAAM,CACxD,GAAIkU,EAAU,OAAS,KAErB,OAAOlU,EAAK,YAAYoS,EAAc8B,EAAU,KAAK,EAChD,CACL,IAAIC,EAAgB,KACpB,OAAAD,EAAU,SAAS,iBAAiB,CAAChJ,EAAU7F,IAAc,CACvD6F,IAAa,aAGfhjB,EAAOmd,EAAU,QAAU,KAAM,2CAA2C,EAC5E8O,EAAgB9O,EAAU,OAE1BrF,EAAOiU,GAAkBza,EAAU4Y,EAAclH,CAAQ,EAAG7F,EAAWrF,CAAI,CAE/E,CAAC,EAEG,CAACA,EAAK,SAASoS,CAAY,EAAE,QAAQ,GAAK+B,IAAkB,OAC9DnU,EAAOA,EAAK,YAAYxG,EAAU4Y,EAAc,WAAW,EAAG+B,CAAa,GAEtEnU,CACT,CACF,CAsBA,SAASoU,GAAqBF,EAAWnb,EAAM,CAC7C,OAAOsb,GAAgBtb,EAAMmb,CAAS,CACxC,CAMA,SAASI,GAAsBJ,EAAWnb,EAAMmQ,EAAMqL,EAAS9Y,EAAS,CACtEvT,EAAOqsB,EAAUL,EAAU,YAAa,8CAA8C,EAClFzY,IAAY,SACdA,EAAU,IAEZyY,EAAU,UAAU,KAAK,CACvB,KAAAnb,EACA,KAAAmQ,EACA,QAAAqL,EACA,QAAA9Y,CACF,CAAC,EACGA,IACFyY,EAAU,cAAgBlB,GAAsBkB,EAAU,cAAenb,EAAMmQ,CAAI,GAErFgL,EAAU,YAAcK,CAC1B,CAIA,SAASC,GAAkBN,EAAWnb,EAAM0b,EAAiBF,EAAS,CACpErsB,EAAOqsB,EAAUL,EAAU,YAAa,8CAA8C,EACtFA,EAAU,UAAU,KAAK,CACvB,KAAAnb,EACA,SAAU0b,EACV,QAAAF,EACA,QAAS,EACX,CAAC,EACDL,EAAU,cAAgBZ,GAAuBY,EAAU,cAAenb,EAAM0b,CAAe,EAC/FP,EAAU,YAAcK,CAC1B,CACA,SAASG,GAAkBR,EAAWK,EAAS,CAC7C,QAAS5sB,EAAI,EAAGA,EAAIusB,EAAU,UAAU,OAAQvsB,IAAK,CACnD,IAAMgtB,EAAST,EAAU,UAAUvsB,CAAC,EACpC,GAAIgtB,EAAO,UAAYJ,EACrB,OAAOI,CAEX,CACA,OAAO,IACT,CAQA,SAASC,GAAqBV,EAAWK,EAAS,CAKhD,IAAM9M,EAAMyM,EAAU,UAAU,UAAUW,GACjCA,EAAE,UAAYN,CACtB,EACDrsB,EAAOuf,GAAO,EAAG,8CAA8C,EAC/D,IAAMqN,EAAgBZ,EAAU,UAAUzM,CAAG,EAC7CyM,EAAU,UAAU,OAAOzM,EAAK,CAAC,EACjC,IAAIsN,EAAyBD,EAAc,QACvCE,EAAsC,GACtCrtB,EAAIusB,EAAU,UAAU,OAAS,EACrC,KAAOa,GAA0BptB,GAAK,GAAG,CACvC,IAAMstB,EAAef,EAAU,UAAUvsB,CAAC,EACtCstB,EAAa,UACXttB,GAAK8f,GAAOyN,GAA6BD,EAAcH,EAAc,IAAI,EAE3EC,EAAyB,GAChBra,EAAaoa,EAAc,KAAMG,EAAa,IAAI,IAE3DD,EAAsC,KAG1CrtB,GACF,CACA,GAAKotB,EAEE,IAAIC,EAET,OAAAG,GAAoBjB,CAAS,EACtB,GAGP,GAAIY,EAAc,KAChBZ,EAAU,cAAgBT,GAAyBS,EAAU,cAAeY,EAAc,IAAI,MACzF,CACL,IAAMnM,EAAWmM,EAAc,SAC/BzqB,EAAKse,EAAU/F,GAAa,CAC1BsR,EAAU,cAAgBT,GAAyBS,EAAU,cAAe1a,EAAUsb,EAAc,KAAMlS,CAAS,CAAC,CACtH,CAAC,CACH,CACA,MAAO,OAfP,OAAO,EAiBX,CACA,SAASsS,GAA6BE,EAAarc,EAAM,CACvD,GAAIqc,EAAY,KACd,OAAO1a,EAAa0a,EAAY,KAAMrc,CAAI,EAE1C,QAAW6J,KAAawS,EAAY,SAClC,GAAIA,EAAY,SAAS,eAAexS,CAAS,GAAKlI,EAAalB,EAAU4b,EAAY,KAAMxS,CAAS,EAAG7J,CAAI,EAC7G,MAAO,GAGX,MAAO,EAEX,CAIA,SAASoc,GAAoBjB,EAAW,CACtCA,EAAU,cAAgBmB,GAAoBnB,EAAU,UAAWoB,GAAyBzc,EAAa,CAAC,EACtGqb,EAAU,UAAU,OAAS,EAC/BA,EAAU,YAAcA,EAAU,UAAUA,EAAU,UAAU,OAAS,CAAC,EAAE,QAE5EA,EAAU,YAAc,EAE5B,CAIA,SAASoB,GAAwBC,EAAO,CACtC,OAAOA,EAAM,OACf,CAKA,SAASF,GAAoBG,EAAQC,EAAQC,EAAU,CACrD,IAAIzC,EAAgBJ,EAAc,MAAM,EACxC,QAASlrB,EAAI,EAAGA,EAAI6tB,EAAO,OAAQ,EAAE7tB,EAAG,CACtC,IAAM4tB,EAAQC,EAAO7tB,CAAC,EAItB,GAAI8tB,EAAOF,CAAK,EAAG,CACjB,IAAMI,EAAYJ,EAAM,KACpBnD,EACJ,GAAImD,EAAM,KACJ7a,EAAagb,EAAUC,CAAS,GAClCvD,EAAexY,EAAgB8b,EAAUC,CAAS,EAClD1C,EAAgBD,GAAsBC,EAAeb,EAAcmD,EAAM,IAAI,GACpE7a,EAAaib,EAAWD,CAAQ,IACzCtD,EAAexY,EAAgB+b,EAAWD,CAAQ,EAClDzC,EAAgBD,GAAsBC,EAAepa,EAAa,EAAG0c,EAAM,KAAK,SAASnD,CAAY,CAAC,WAE/FmD,EAAM,UACf,GAAI7a,EAAagb,EAAUC,CAAS,EAClCvD,EAAexY,EAAgB8b,EAAUC,CAAS,EAClD1C,EAAgBK,GAAuBL,EAAeb,EAAcmD,EAAM,QAAQ,UACzE7a,EAAaib,EAAWD,CAAQ,EAEzC,GADAtD,EAAexY,EAAgB+b,EAAWD,CAAQ,EAC9C/b,EAAYyY,CAAY,EAC1Ba,EAAgBK,GAAuBL,EAAepa,EAAa,EAAG0c,EAAM,QAAQ,MAC/E,CACL,IAAMta,EAAQuC,GAAQ+X,EAAM,SAAUzc,EAAasZ,CAAY,CAAC,EAChE,GAAInX,EAAO,CAET,IAAM2a,EAAW3a,EAAM,SAAShC,EAAamZ,CAAY,CAAC,EAC1Da,EAAgBD,GAAsBC,EAAepa,EAAa,EAAG+c,CAAQ,CAC/E,CACF,MAGF,OAAMnV,GAAe,4CAA4C,CAErE,CACF,CACA,OAAOwS,CACT,CAQA,SAAS4C,GAAgC3B,EAAW4B,EAAUC,EAAqBC,EAAmBC,EAAqB,CACzH,GAAI,CAACD,GAAqB,CAACC,EAAqB,CAC9C,IAAMnC,EAAgBH,GAA6BO,EAAU,cAAe4B,CAAQ,EACpF,GAAIhC,GAAiB,KACnB,OAAOA,EACF,CACL,IAAMoC,EAAWrC,GAAgCK,EAAU,cAAe4B,CAAQ,EAClF,GAAI/B,GAAqBmC,CAAQ,EAC/B,OAAOH,EACF,GAAIA,GAAuB,MAAQ,CAACrC,GAA8BwC,EAAUrd,EAAa,CAAC,EAE/F,OAAO,KACF,CACL,IAAMsd,EAAeJ,GAAuBjP,EAAa,WACzD,OAAOkN,GAAmBkC,EAAUC,CAAY,CAClD,CACF,CACF,KAAO,CACL,IAAMC,EAAQvC,GAAgCK,EAAU,cAAe4B,CAAQ,EAC/E,GAAI,CAACG,GAAuBlC,GAAqBqC,CAAK,EACpD,OAAOL,EAGP,GAAI,CAACE,GAAuBF,GAAuB,MAAQ,CAACrC,GAA8B0C,EAAOvd,EAAa,CAAC,EAC7G,OAAO,KACF,CACL,IAAM4c,EAAS,SAAUF,EAAO,CAC9B,OAAQA,EAAM,SAAWU,KAAyB,CAACD,GAAqB,CAAC,CAACA,EAAkB,QAAQT,EAAM,OAAO,KAAO7a,EAAa6a,EAAM,KAAMO,CAAQ,GAAKpb,EAAaob,EAAUP,EAAM,IAAI,EACjM,EACMc,EAAchB,GAAoBnB,EAAU,UAAWuB,EAAQK,CAAQ,EACvEK,EAAeJ,GAAuBjP,EAAa,WACzD,OAAOkN,GAAmBqC,EAAaF,CAAY,CACrD,CAEJ,CACF,CAKA,SAASG,GAAmCpC,EAAW4B,EAAUS,EAAwB,CACvF,IAAIC,EAAmB1P,EAAa,WAC9B2P,EAAc9C,GAA6BO,EAAU,cAAe4B,CAAQ,EAClF,GAAIW,EACF,OAAKA,EAAY,WAAW,GAE1BA,EAAY,aAAa1S,EAAgB,CAACnB,EAAWuI,IAAc,CACjEqL,EAAmBA,EAAiB,qBAAqB5T,EAAWuI,CAAS,CAC/E,CAAC,EAEIqL,EACF,GAAID,EAAwB,CAGjC,IAAMH,EAAQvC,GAAgCK,EAAU,cAAe4B,CAAQ,EAC/E,OAAAS,EAAuB,aAAaxS,EAAgB,CAACnB,EAAWC,IAAc,CAC5E,IAAM7C,EAAOgU,GAAmBH,GAAgCuC,EAAO,IAAI3d,EAAKmK,CAAS,CAAC,EAAGC,CAAS,EACtG2T,EAAmBA,EAAiB,qBAAqB5T,EAAW5C,CAAI,CAC1E,CAAC,EAED4T,GAAiCwC,CAAK,EAAE,QAAQtR,GAAa,CAC3D0R,EAAmBA,EAAiB,qBAAqB1R,EAAU,KAAMA,EAAU,IAAI,CACzF,CAAC,EACM0R,CACT,KAAO,CAGL,IAAMJ,EAAQvC,GAAgCK,EAAU,cAAe4B,CAAQ,EAC/E,OAAAlC,GAAiCwC,CAAK,EAAE,QAAQtR,GAAa,CAC3D0R,EAAmBA,EAAiB,qBAAqB1R,EAAU,KAAMA,EAAU,IAAI,CACzF,CAAC,EACM0R,CACT,CACF,CAeA,SAASE,GAA4CxC,EAAW4B,EAAU3D,EAAWwE,EAAmBC,EAAoB,CAC1H1uB,EAAOyuB,GAAqBC,EAAoB,2DAA2D,EAC3G,IAAM7d,EAAOS,EAAUsc,EAAU3D,CAAS,EAC1C,GAAIuB,GAA8BQ,EAAU,cAAenb,CAAI,EAG7D,OAAO,KACF,CAEL,IAAM8d,EAAahD,GAAgCK,EAAU,cAAenb,CAAI,EAChF,OAAIgb,GAAqB8C,CAAU,EAE1BD,EAAmB,SAASzE,CAAS,EAQrC6B,GAAmB6C,EAAYD,EAAmB,SAASzE,CAAS,CAAC,CAEhF,CACF,CAKA,SAAS2E,GAA2B5C,EAAW4B,EAAU5K,EAAU0L,EAAoB,CACrF,IAAM7d,EAAOS,EAAUsc,EAAU5K,CAAQ,EACnC4I,EAAgBH,GAA6BO,EAAU,cAAenb,CAAI,EAChF,GAAI+a,GAAiB,KACnB,OAAOA,EAEP,GAAI8C,EAAmB,mBAAmB1L,CAAQ,EAAG,CACnD,IAAM2L,EAAahD,GAAgCK,EAAU,cAAenb,CAAI,EAChF,OAAOib,GAAmB6C,EAAYD,EAAmB,QAAQ,EAAE,kBAAkB1L,CAAQ,CAAC,CAChG,KACE,QAAO,IAGb,CAMA,SAAS6L,GAAwB7C,EAAWnb,EAAM,CAChD,OAAO4a,GAA6BO,EAAU,cAAenb,CAAI,CACnE,CAKA,SAASie,GAA0B9C,EAAW4B,EAAUmB,EAAoBpP,EAAWoD,EAAOiM,EAASna,EAAO,CAC5G,IAAIoa,EACEf,EAAQvC,GAAgCK,EAAU,cAAe4B,CAAQ,EACzEhC,EAAgBH,GAA6ByC,EAAOvd,EAAa,CAAC,EACxE,GAAIib,GAAiB,KACnBqD,EAAYrD,UACHmD,GAAsB,KAC/BE,EAAYnD,GAAmBoC,EAAOa,CAAkB,MAGxD,OAAO,CAAC,EAGV,GADAE,EAAYA,EAAU,UAAUpa,CAAK,EACjC,CAACoa,EAAU,QAAQ,GAAK,CAACA,EAAU,WAAW,EAAG,CACnD,IAAMC,EAAQ,CAAC,EACT9c,EAAMyC,EAAM,WAAW,EACvBqJ,EAAO8Q,EAAUC,EAAU,uBAAuBtP,EAAW9K,CAAK,EAAIoa,EAAU,gBAAgBtP,EAAW9K,CAAK,EAClHsJ,EAAOD,EAAK,QAAQ,EACxB,KAAOC,GAAQ+Q,EAAM,OAASnM,GACxB3Q,EAAI+L,EAAMwB,CAAS,IAAM,GAC3BuP,EAAM,KAAK/Q,CAAI,EAEjBA,EAAOD,EAAK,QAAQ,EAEtB,OAAOgR,CACT,KACE,OAAO,CAAC,CAEZ,CACA,SAAS/D,IAAe,CACtB,MAAO,CACL,cAAeR,EAAc,MAAM,EACnC,UAAW,CAAC,EACZ,YAAa,EACf,CACF,CASA,SAASwE,GAAmCC,EAAcvB,EAAqBC,EAAmBC,EAAqB,CACrH,OAAOJ,GAAgCyB,EAAa,UAAWA,EAAa,SAAUvB,EAAqBC,EAAmBC,CAAmB,CACnJ,CAMA,SAASsB,GAAsCD,EAAcf,EAAwB,CACnF,OAAOD,GAAmCgB,EAAa,UAAWA,EAAa,SAAUf,CAAsB,CACjH,CAiBA,SAASiB,GAA+CF,EAAcve,EAAM4d,EAAmBC,EAAoB,CACjH,OAAOF,GAA4CY,EAAa,UAAWA,EAAa,SAAUve,EAAM4d,EAAmBC,CAAkB,CAC/I,CAOA,SAASa,GAA2BH,EAAcve,EAAM,CACtD,OAAOge,GAAwBO,EAAa,UAAW9d,EAAU8d,EAAa,SAAUve,CAAI,CAAC,CAC/F,CAKA,SAAS2e,GAA6BJ,EAAcL,EAAoBpP,EAAWoD,EAAOiM,EAASna,EAAO,CACxG,OAAOia,GAA0BM,EAAa,UAAWA,EAAa,SAAUL,EAAoBpP,EAAWoD,EAAOiM,EAASna,CAAK,CACtI,CAKA,SAAS4a,GAA8BL,EAAcpM,EAAU0M,EAAqB,CAClF,OAAOd,GAA2BQ,EAAa,UAAWA,EAAa,SAAUpM,EAAU0M,CAAmB,CAChH,CAIA,SAASC,GAAkBP,EAAc1U,EAAW,CAClD,OAAOyR,GAAgB7a,EAAU8d,EAAa,SAAU1U,CAAS,EAAG0U,EAAa,SAAS,CAC5F,CACA,SAASjD,GAAgBtb,EAAMmb,EAAW,CACxC,MAAO,CACL,SAAUnb,EACV,UAAAmb,CACF,CACF,CAkBA,IAAM4D,GAAN,KAA6B,CAC3B,aAAc,CACZ,KAAK,UAAY,IAAI,GACvB,CACA,iBAAiBnH,EAAQ,CACvB,IAAMjiB,EAAOiiB,EAAO,KACdzF,EAAWyF,EAAO,UACxBzoB,EAAOwG,IAAS,eAA8CA,IAAS,iBAAkDA,IAAS,gBAAgD,2CAA2C,EAC7NxG,EAAOgjB,IAAa,YAAa,iDAAiD,EAClF,IAAM6M,EAAY,KAAK,UAAU,IAAI7M,CAAQ,EAC7C,GAAI6M,EAAW,CACb,IAAMC,EAAUD,EAAU,KAC1B,GAAIrpB,IAAS,eAA8CspB,IAAY,gBACrE,KAAK,UAAU,IAAI9M,EAAUtB,GAAmBsB,EAAUyF,EAAO,aAAcoH,EAAU,YAAY,CAAC,UAC7FrpB,IAAS,iBAAkDspB,IAAY,cAChF,KAAK,UAAU,OAAO9M,CAAQ,UACrBxc,IAAS,iBAAkDspB,IAAY,gBAChF,KAAK,UAAU,IAAI9M,EAAUvB,GAAmBuB,EAAU6M,EAAU,OAAO,CAAC,UACnErpB,IAAS,iBAAkDspB,IAAY,cAChF,KAAK,UAAU,IAAI9M,EAAUxB,GAAiBwB,EAAUyF,EAAO,YAAY,CAAC,UACnEjiB,IAAS,iBAAkDspB,IAAY,gBAChF,KAAK,UAAU,IAAI9M,EAAUtB,GAAmBsB,EAAUyF,EAAO,aAAcoH,EAAU,OAAO,CAAC,MAEjG,OAAMtX,GAAe,mCAAqCkQ,EAAS,mBAAqBoH,CAAS,CAErG,MACE,KAAK,UAAU,IAAI7M,EAAUyF,CAAM,CAEvC,CACA,YAAa,CACX,OAAO,MAAM,KAAK,KAAK,UAAU,OAAO,CAAC,CAC3C,CACF,EAsBA,IAAMsH,GAAN,KAA6B,CAC3B,iBAAiB/M,EAAU,CACzB,OAAO,IACT,CACA,mBAAmBnO,EAAO9B,EAAOic,EAAS,CACxC,OAAO,IACT,CACF,EAIMgB,GAA2B,IAAID,GAK/BE,GAAN,KAAmC,CACjC,YAAYC,EAASC,EAAYC,EAA0B,KAAM,CAC/D,KAAK,QAAUF,EACf,KAAK,WAAaC,EAClB,KAAK,wBAA0BC,CACjC,CACA,iBAAiBpN,EAAU,CACzB,IAAMlL,EAAO,KAAK,WAAW,WAC7B,GAAIA,EAAK,mBAAmBkL,CAAQ,EAClC,OAAOlL,EAAK,QAAQ,EAAE,kBAAkBkL,CAAQ,EAC3C,CACL,IAAMqN,EAAa,KAAK,yBAA2B,KAAO,IAAIzI,GAAU,KAAK,wBAAyB,GAAM,EAAK,EAAI,KAAK,WAAW,YACrI,OAAO6H,GAA8B,KAAK,QAASzM,EAAUqN,CAAU,CACzE,CACF,CACA,mBAAmBxb,EAAO9B,EAAOic,EAAS,CACxC,IAAMD,EAAqB,KAAK,yBAA2B,KAAO,KAAK,wBAA0BnF,GAA+B,KAAK,UAAU,EACzIsF,EAAQM,GAA6B,KAAK,QAAST,EAAoBhc,EAAO,EAAGic,EAASna,CAAK,EACrG,OAAIqa,EAAM,SAAW,EACZ,KAEAA,EAAM,CAAC,CAElB,CACF,EAkBA,SAASoB,GAAiB/C,EAAQ,CAChC,MAAO,CACL,OAAAA,CACF,CACF,CACA,SAASgD,GAA2BC,EAAelH,EAAW,CAC5DtpB,EAAOspB,EAAU,WAAW,QAAQ,EAAE,UAAUkH,EAAc,OAAO,SAAS,CAAC,EAAG,wBAAwB,EAC1GxwB,EAAOspB,EAAU,YAAY,QAAQ,EAAE,UAAUkH,EAAc,OAAO,SAAS,CAAC,EAAG,yBAAyB,CAC9G,CACA,SAASC,GAA4BD,EAAeE,EAAcC,EAAWC,EAAaC,EAAe,CACvG,IAAMC,EAAc,IAAIlB,GACpBzG,EAAc4H,EAClB,GAAIJ,EAAU,OAAS7J,EAAc,UAAW,CAC9C,IAAMkK,EAAYL,EACdK,EAAU,OAAO,SACnB7H,EAAe8H,GAAgCT,EAAeE,EAAcM,EAAU,KAAMA,EAAU,KAAMJ,EAAaC,EAAeC,CAAW,GAEnJ9wB,EAAOgxB,EAAU,OAAO,WAAY,iBAAiB,EAIrDD,EAAmBC,EAAU,OAAO,QAAUN,EAAa,YAAY,WAAW,GAAK,CAACjf,EAAYuf,EAAU,IAAI,EAClH7H,EAAe+H,GAAkCV,EAAeE,EAAcM,EAAU,KAAMA,EAAU,KAAMJ,EAAaC,EAAeE,EAAkBD,CAAW,EAE3K,SAAWH,EAAU,OAAS7J,EAAc,MAAO,CACjD,IAAMoH,EAAQyC,EACVzC,EAAM,OAAO,SACf/E,EAAegI,GAA4BX,EAAeE,EAAcxC,EAAM,KAAMA,EAAM,SAAU0C,EAAaC,EAAeC,CAAW,GAE3I9wB,EAAOkuB,EAAM,OAAO,WAAY,iBAAiB,EAEjD6C,EAAmB7C,EAAM,OAAO,QAAUwC,EAAa,YAAY,WAAW,EAC9EvH,EAAeiI,GAA8BZ,EAAeE,EAAcxC,EAAM,KAAMA,EAAM,SAAU0C,EAAaC,EAAeE,EAAkBD,CAAW,EAEnK,SAAWH,EAAU,OAAS7J,EAAc,eAAgB,CAC1D,IAAMuK,EAAeV,EAChBU,EAAa,OAGhBlI,EAAemI,GAA6Bd,EAAeE,EAAcW,EAAa,KAAMT,EAAaC,EAAeC,CAAW,EAFnI3H,EAAeoI,GAA0Bf,EAAeE,EAAcW,EAAa,KAAMA,EAAa,aAAcT,EAAaC,EAAeC,CAAW,CAI/J,SAAWH,EAAU,OAAS7J,EAAc,gBAC1CqC,EAAeqI,GAA4BhB,EAAeE,EAAcC,EAAU,KAAMC,EAAaE,CAAW,MAEhH,OAAMvY,GAAe,2BAA6BoY,EAAU,IAAI,EAElE,IAAMvI,EAAU0I,EAAY,WAAW,EACvC,OAAAW,GAAgCf,EAAcvH,EAAcf,CAAO,EAC5D,CACL,UAAWe,EACX,QAAAf,CACF,CACF,CACA,SAASqJ,GAAgCf,EAAcvH,EAAc2H,EAAa,CAChF,IAAMvH,EAAYJ,EAAa,WAC/B,GAAII,EAAU,mBAAmB,EAAG,CAClC,IAAMmI,EAAgBnI,EAAU,QAAQ,EAAE,WAAW,GAAKA,EAAU,QAAQ,EAAE,QAAQ,EAChFoI,EAAkBhI,GAA8B+G,CAAY,GAC9DI,EAAY,OAAS,GAAK,CAACJ,EAAa,WAAW,mBAAmB,GAAKgB,GAAiB,CAACnI,EAAU,QAAQ,EAAE,OAAOoI,CAAe,GAAK,CAACpI,EAAU,QAAQ,EAAE,YAAY,EAAE,OAAOoI,EAAgB,YAAY,CAAC,IACrNb,EAAY,KAAKxP,GAAYqI,GAA8BR,CAAY,CAAC,CAAC,CAE7E,CACF,CACA,SAASyI,GAAgDpB,EAAelH,EAAWuI,EAAYjB,EAAa3O,EAAQ6O,EAAa,CAC/H,IAAMgB,EAAexI,EAAU,WAC/B,GAAIiG,GAA2BqB,EAAaiB,CAAU,GAAK,KAEzD,OAAOvI,EACF,CACL,IAAI5F,EAAe2M,EACnB,GAAI5e,EAAYogB,CAAU,EAGxB,GADA7xB,EAAOspB,EAAU,YAAY,mBAAmB,EAAG,4DAA4D,EAC3GA,EAAU,YAAY,WAAW,EAAG,CAItC,IAAMF,EAAcQ,GAA+BN,CAAS,EACtDgF,EAAmBlF,aAAuBxK,EAAewK,EAAcxK,EAAa,WACpFmT,EAAwB1C,GAAsCuB,EAAatC,CAAgB,EACjG5K,EAAgB8M,EAAc,OAAO,eAAelH,EAAU,WAAW,QAAQ,EAAGyI,EAAuBjB,CAAW,CACxH,KAAO,CACL,IAAMkB,EAAe7C,GAAmCyB,EAAahH,GAA+BN,CAAS,CAAC,EAC9G5F,EAAgB8M,EAAc,OAAO,eAAelH,EAAU,WAAW,QAAQ,EAAG0I,EAAclB,CAAW,CAC/G,KACK,CACL,IAAM9N,EAAWpS,EAAaihB,CAAU,EACxC,GAAI7O,IAAa,YAAa,CAC5BhjB,EAAO8Q,GAAc+gB,CAAU,IAAM,EAAG,uDAAuD,EAC/F,IAAMI,EAAeH,EAAa,QAAQ,EAC1CzB,EAAa/G,EAAU,YAAY,QAAQ,EAE3C,IAAM4I,EAAkB5C,GAA+CsB,EAAaiB,EAAYI,EAAc5B,CAAU,EACpH6B,GAAmB,KACrBxO,EAAgB8M,EAAc,OAAO,eAAeyB,EAAcC,CAAe,EAGjFxO,EAAgBoO,EAAa,QAAQ,CAEzC,KAAO,CACL,IAAMK,EAAkBphB,EAAa8gB,CAAU,EAE3CO,EACJ,GAAIN,EAAa,mBAAmB9O,CAAQ,EAAG,CAC7CqN,EAAa/G,EAAU,YAAY,QAAQ,EAC3C,IAAM+I,EAAmB/C,GAA+CsB,EAAaiB,EAAYC,EAAa,QAAQ,EAAGzB,CAAU,EAC/HgC,GAAoB,KACtBD,EAAgBN,EAAa,QAAQ,EAAE,kBAAkB9O,CAAQ,EAAE,YAAYmP,EAAiBE,CAAgB,EAGhHD,EAAgBN,EAAa,QAAQ,EAAE,kBAAkB9O,CAAQ,CAErE,MACEoP,EAAgB3C,GAA8BmB,EAAa5N,EAAUsG,EAAU,WAAW,EAExF8I,GAAiB,KACnB1O,EAAgB8M,EAAc,OAAO,YAAYsB,EAAa,QAAQ,EAAG9O,EAAUoP,EAAeD,EAAiBlQ,EAAQ6O,CAAW,EAGtIpN,EAAgBoO,EAAa,QAAQ,CAEzC,CACF,CACA,OAAOzI,GAAyBC,EAAW5F,EAAeoO,EAAa,mBAAmB,GAAKrgB,EAAYogB,CAAU,EAAGrB,EAAc,OAAO,aAAa,CAAC,CAC7J,CACF,CACA,SAASU,GAAkCV,EAAeE,EAAcmB,EAAYS,EAAa1B,EAAaC,EAAeE,EAAkBD,EAAa,CAC1J,IAAMyB,EAAgB7B,EAAa,YAC/B8B,EACEC,EAAe1B,EAAmBP,EAAc,OAASA,EAAc,OAAO,iBAAiB,EACrG,GAAI/e,EAAYogB,CAAU,EACxBW,EAAiBC,EAAa,eAAeF,EAAc,QAAQ,EAAGD,EAAa,IAAI,UAC9EG,EAAa,aAAa,GAAK,CAACF,EAAc,WAAW,EAAG,CAErE,IAAMG,EAAgBH,EAAc,QAAQ,EAAE,YAAYV,EAAYS,CAAW,EACjFE,EAAiBC,EAAa,eAAeF,EAAc,QAAQ,EAAGG,EAAe,IAAI,CAC3F,KAAO,CACL,IAAM1P,EAAWpS,EAAaihB,CAAU,EACxC,GAAI,CAACU,EAAc,kBAAkBV,CAAU,GAAK/gB,GAAc+gB,CAAU,EAAI,EAE9E,OAAOnB,EAET,IAAMyB,EAAkBphB,EAAa8gB,CAAU,EAEzCjX,EADY2X,EAAc,QAAQ,EAAE,kBAAkBvP,CAAQ,EACrC,YAAYmP,EAAiBG,CAAW,EACnEtP,IAAa,YACfwP,EAAiBC,EAAa,eAAeF,EAAc,QAAQ,EAAG3X,CAAY,EAElF4X,EAAiBC,EAAa,YAAYF,EAAc,QAAQ,EAAGvP,EAAUpI,EAAcuX,EAAiBnC,GAA0B,IAAI,CAE9I,CACA,IAAM7G,EAAeM,GAA0BiH,EAAc8B,EAAgBD,EAAc,mBAAmB,GAAK9gB,EAAYogB,CAAU,EAAGY,EAAa,aAAa,CAAC,EACjKxQ,EAAS,IAAIgO,GAA6BW,EAAazH,EAAc0H,CAAa,EACxF,OAAOe,GAAgDpB,EAAerH,EAAc0I,EAAYjB,EAAa3O,EAAQ6O,CAAW,CAClI,CACA,SAASG,GAAgCT,EAAeE,EAAcmB,EAAYS,EAAa1B,EAAaC,EAAeC,EAAa,CACtI,IAAMgB,EAAepB,EAAa,WAC9BvH,EAAczF,EACZzB,EAAS,IAAIgO,GAA6BW,EAAaF,EAAcG,CAAa,EACxF,GAAIpf,EAAYogB,CAAU,EACxBnO,EAAgB8M,EAAc,OAAO,eAAeE,EAAa,WAAW,QAAQ,EAAG4B,EAAaxB,CAAW,EAC/G3H,EAAeE,GAAyBqH,EAAchN,EAAe,GAAM8M,EAAc,OAAO,aAAa,CAAC,MACzG,CACL,IAAMxN,EAAWpS,EAAaihB,CAAU,EACxC,GAAI7O,IAAa,YACfU,EAAgB8M,EAAc,OAAO,eAAeE,EAAa,WAAW,QAAQ,EAAG4B,CAAW,EAClGnJ,EAAeE,GAAyBqH,EAAchN,EAAeoO,EAAa,mBAAmB,EAAGA,EAAa,WAAW,CAAC,MAC5H,CACL,IAAMK,EAAkBphB,EAAa8gB,CAAU,EACzC1P,EAAW2P,EAAa,QAAQ,EAAE,kBAAkB9O,CAAQ,EAC9DjB,EACJ,GAAItQ,EAAY0gB,CAAe,EAE7BpQ,EAAWuQ,MACN,CACL,IAAM3X,EAAYsH,EAAO,iBAAiBe,CAAQ,EAC9CrI,GAAa,KACX3J,GAAYmhB,CAAe,IAAM,aAAexX,EAAU,SAASvJ,GAAW+gB,CAAe,CAAC,EAAE,QAAQ,EAG1GpQ,EAAWpH,EAEXoH,EAAWpH,EAAU,YAAYwX,EAAiBG,CAAW,EAI/DvQ,EAAWnD,EAAa,UAE5B,CACA,GAAKuD,EAAS,OAAOJ,CAAQ,EAI3BoH,EAAeuH,MAJe,CAC9B,IAAMiC,EAAenC,EAAc,OAAO,YAAYsB,EAAa,QAAQ,EAAG9O,EAAUjB,EAAUoQ,EAAiBlQ,EAAQ6O,CAAW,EACtI3H,EAAeE,GAAyBqH,EAAciC,EAAcb,EAAa,mBAAmB,EAAGtB,EAAc,OAAO,aAAa,CAAC,CAC5I,CAGF,CACF,CACA,OAAOrH,CACT,CACA,SAASyJ,GAA2BtJ,EAAWtG,EAAU,CACvD,OAAOsG,EAAU,WAAW,mBAAmBtG,CAAQ,CACzD,CACA,SAASmO,GAA4BX,EAAelH,EAAWzY,EAAM0b,EAAiBqE,EAAaxH,EAAa0H,EAAa,CAO3H,IAAI+B,EAAevJ,EACnB,OAAAiD,EAAgB,QAAQ,CAACrC,EAAcvP,IAAc,CACnD,IAAM8S,EAAYnc,EAAUT,EAAMqZ,CAAY,EAC1C0I,GAA2BtJ,EAAW1Y,EAAa6c,CAAS,CAAC,IAC/DoF,EAAe5B,GAAgCT,EAAeqC,EAAcpF,EAAW9S,EAAWiW,EAAaxH,EAAa0H,CAAW,EAE3I,CAAC,EACDvE,EAAgB,QAAQ,CAACrC,EAAcvP,IAAc,CACnD,IAAM8S,EAAYnc,EAAUT,EAAMqZ,CAAY,EACzC0I,GAA2BtJ,EAAW1Y,EAAa6c,CAAS,CAAC,IAChEoF,EAAe5B,GAAgCT,EAAeqC,EAAcpF,EAAW9S,EAAWiW,EAAaxH,EAAa0H,CAAW,EAE3I,CAAC,EACM+B,CACT,CACA,SAASC,GAAwBtC,EAAe1Y,EAAMoW,EAAO,CAC3D,OAAAA,EAAM,QAAQ,CAAChE,EAAcvP,IAAc,CACzC7C,EAAOA,EAAK,YAAYoS,EAAcvP,CAAS,CACjD,CAAC,EACM7C,CACT,CACA,SAASsZ,GAA8BZ,EAAelH,EAAWzY,EAAM0b,EAAiBqE,EAAaxH,EAAa2H,EAAkBD,EAAa,CAG/I,GAAIxH,EAAU,YAAY,QAAQ,EAAE,QAAQ,GAAK,CAACA,EAAU,YAAY,mBAAmB,EACzF,OAAOA,EAQT,IAAIuJ,EAAevJ,EACfyJ,EACAthB,EAAYZ,CAAI,EAClBkiB,EAAgBxG,EAEhBwG,EAAgB,IAAIhJ,EAAc,IAAI,EAAE,QAAQlZ,EAAM0b,CAAe,EAEvE,IAAM8D,EAAa/G,EAAU,YAAY,QAAQ,EACjD,OAAAyJ,EAAc,SAAS,iBAAiB,CAAC/P,EAAU7F,IAAc,CAC/D,GAAIkT,EAAW,SAASrN,CAAQ,EAAG,CACjC,IAAMgQ,EAAc1J,EAAU,YAAY,QAAQ,EAAE,kBAAkBtG,CAAQ,EACxEjB,EAAW+Q,GAAwBtC,EAAewC,EAAa7V,CAAS,EAC9E0V,EAAe3B,GAAkCV,EAAeqC,EAAc,IAAItiB,EAAKyS,CAAQ,EAAGjB,EAAU6O,EAAaxH,EAAa2H,EAAkBD,CAAW,CACrK,CACF,CAAC,EACDiC,EAAc,SAAS,iBAAiB,CAAC/P,EAAUiQ,IAAmB,CACpE,IAAMC,EAAqB,CAAC5J,EAAU,YAAY,mBAAmBtG,CAAQ,GAAKiQ,EAAe,QAAU,KAC3G,GAAI,CAAC5C,EAAW,SAASrN,CAAQ,GAAK,CAACkQ,EAAoB,CACzD,IAAMF,EAAc1J,EAAU,YAAY,QAAQ,EAAE,kBAAkBtG,CAAQ,EACxEjB,EAAW+Q,GAAwBtC,EAAewC,EAAaC,CAAc,EACnFJ,EAAe3B,GAAkCV,EAAeqC,EAAc,IAAItiB,EAAKyS,CAAQ,EAAGjB,EAAU6O,EAAaxH,EAAa2H,EAAkBD,CAAW,CACrK,CACF,CAAC,EACM+B,CACT,CACA,SAAStB,GAA0Bf,EAAelH,EAAW6J,EAAS/L,EAAcwJ,EAAaC,EAAeC,EAAa,CAC3H,GAAIvB,GAA2BqB,EAAauC,CAAO,GAAK,KACtD,OAAO7J,EAGT,IAAMyH,EAAmBzH,EAAU,YAAY,WAAW,EAGpDF,EAAcE,EAAU,YAC9B,GAAIlC,EAAa,OAAS,KAAM,CAE9B,GAAI3V,EAAY0hB,CAAO,GAAK/J,EAAY,mBAAmB,GAAKA,EAAY,kBAAkB+J,CAAO,EACnG,OAAOjC,GAAkCV,EAAelH,EAAW6J,EAAS/J,EAAY,QAAQ,EAAE,SAAS+J,CAAO,EAAGvC,EAAaC,EAAeE,EAAkBD,CAAW,EACzK,GAAIrf,EAAY0hB,CAAO,EAAG,CAG/B,IAAI5G,EAAkB,IAAIxC,EAAc,IAAI,EAC5C,OAAAX,EAAY,QAAQ,EAAE,aAAa3Q,EAAW,CAAChb,EAAMqa,IAAS,CAC5DyU,EAAkBA,EAAgB,IAAI,IAAIhc,EAAK9S,CAAI,EAAGqa,CAAI,CAC5D,CAAC,EACMsZ,GAA8BZ,EAAelH,EAAW6J,EAAS5G,EAAiBqE,EAAaC,EAAeE,EAAkBD,CAAW,CACpJ,KACE,QAAOxH,CAEX,KAAO,CAEL,IAAIiD,EAAkB,IAAIxC,EAAc,IAAI,EAC5C,OAAA3C,EAAa,QAAQ,CAACgM,EAAWp1B,IAAU,CACzC,IAAMq1B,EAAkB/hB,EAAU6hB,EAASC,CAAS,EAChDhK,EAAY,kBAAkBiK,CAAe,IAC/C9G,EAAkBA,EAAgB,IAAI6G,EAAWhK,EAAY,QAAQ,EAAE,SAASiK,CAAe,CAAC,EAEpG,CAAC,EACMjC,GAA8BZ,EAAelH,EAAW6J,EAAS5G,EAAiBqE,EAAaC,EAAeE,EAAkBD,CAAW,CACpJ,CACF,CACA,SAASU,GAA4BhB,EAAelH,EAAWzY,EAAM+f,EAAaE,EAAa,CAC7F,IAAMwC,EAAgBhK,EAAU,YAC1BH,EAAeM,GAA0BH,EAAWgK,EAAc,QAAQ,EAAGA,EAAc,mBAAmB,GAAK7hB,EAAYZ,CAAI,EAAGyiB,EAAc,WAAW,CAAC,EACtK,OAAO1B,GAAgDpB,EAAerH,EAActY,EAAM+f,EAAaZ,GAA0Bc,CAAW,CAC9I,CACA,SAASQ,GAA6Bd,EAAelH,EAAWzY,EAAM+f,EAAa/C,EAAqBiD,EAAa,CACnH,IAAItH,EACJ,GAAI+F,GAA2BqB,EAAa/f,CAAI,GAAK,KACnD,OAAOyY,EACF,CACL,IAAMrH,EAAS,IAAIgO,GAA6BW,EAAatH,EAAWuE,CAAmB,EACrF1K,EAAgBmG,EAAU,WAAW,QAAQ,EAC/C5F,EACJ,GAAIjS,EAAYZ,CAAI,GAAKD,EAAaC,CAAI,IAAM,YAAa,CAC3D,IAAIoH,EACJ,GAAIqR,EAAU,YAAY,mBAAmB,EAC3CrR,EAAUkX,GAAmCyB,EAAahH,GAA+BN,CAAS,CAAC,MAC9F,CACL,IAAMiK,EAAiBjK,EAAU,YAAY,QAAQ,EACrDtpB,EAAOuzB,aAA0B3U,EAAc,+CAA+C,EAC9F3G,EAAUoX,GAAsCuB,EAAa2C,CAAc,CAC7E,CACAtb,EAAUA,EACVyL,EAAgB8M,EAAc,OAAO,eAAerN,EAAelL,EAAS6Y,CAAW,CACzF,KAAO,CACL,IAAM9N,EAAWpS,EAAaC,CAAI,EAC9BkR,EAAW0N,GAA8BmB,EAAa5N,EAAUsG,EAAU,WAAW,EACrFvH,GAAY,MAAQuH,EAAU,YAAY,mBAAmBtG,CAAQ,IACvEjB,EAAWoB,EAAc,kBAAkBH,CAAQ,GAEjDjB,GAAY,KACd2B,EAAgB8M,EAAc,OAAO,YAAYrN,EAAeH,EAAUjB,EAAUhR,EAAaF,CAAI,EAAGoR,EAAQ6O,CAAW,EAClHxH,EAAU,WAAW,QAAQ,EAAE,SAAStG,CAAQ,EAEzDU,EAAgB8M,EAAc,OAAO,YAAYrN,EAAeH,EAAUpE,EAAa,WAAY7N,EAAaF,CAAI,EAAGoR,EAAQ6O,CAAW,EAE1IpN,EAAgBP,EAEdO,EAAc,QAAQ,GAAK4F,EAAU,YAAY,mBAAmB,IAEtEE,EAAW2F,GAAmCyB,EAAahH,GAA+BN,CAAS,CAAC,EAChGE,EAAS,WAAW,IACtB9F,EAAgB8M,EAAc,OAAO,eAAe9M,EAAe8F,EAAUsH,CAAW,GAG9F,CACA,OAAAtH,EAAWF,EAAU,YAAY,mBAAmB,GAAKiG,GAA2BqB,EAAajgB,EAAa,CAAC,GAAK,KAC7G0Y,GAAyBC,EAAW5F,EAAe8F,EAAUgH,EAAc,OAAO,aAAa,CAAC,CACzG,CACF,CA2BA,IAAMgD,GAAN,KAAW,CACT,YAAYvL,EAAQwL,EAAkB,CACpC,KAAK,OAASxL,EACd,KAAK,oBAAsB,CAAC,EAC5B,IAAMxhB,EAAS,KAAK,OAAO,aACrBitB,EAAc,IAAI7R,GAAcpb,EAAO,SAAS,CAAC,EACjD8mB,EAASzJ,GAAyBrd,CAAM,EAC9C,KAAK,WAAa6pB,GAAiB/C,CAAM,EACzC,IAAMoG,EAAqBF,EAAiB,YACtCG,EAAoBH,EAAiB,WAErC/J,EAAagK,EAAY,eAAe9U,EAAa,WAAY+U,EAAmB,QAAQ,EAAG,IAAI,EACnGpK,EAAYgE,EAAO,eAAe3O,EAAa,WAAYgV,EAAkB,QAAQ,EAAG,IAAI,EAC5FpB,EAAiB,IAAI5K,GAAU8B,EAAYiK,EAAmB,mBAAmB,EAAGD,EAAY,aAAa,CAAC,EAC9GhQ,EAAgB,IAAIkE,GAAU2B,EAAWqK,EAAkB,mBAAmB,EAAGrG,EAAO,aAAa,CAAC,EAC5G,KAAK,WAAapE,GAAazF,EAAe8O,CAAc,EAC5D,KAAK,gBAAkB,IAAIxK,GAAe,KAAK,MAAM,CACvD,CACA,IAAI,OAAQ,CACV,OAAO,KAAK,MACd,CACF,EACA,SAAS6L,GAAmBC,EAAM,CAChC,OAAOA,EAAK,WAAW,YAAY,QAAQ,CAC7C,CACA,SAASC,GAAoBD,EAAM,CACjC,OAAOnK,GAA8BmK,EAAK,UAAU,CACtD,CACA,SAASE,GAA2BF,EAAMjjB,EAAM,CAC9C,IAAMojB,EAAQrK,GAA+BkK,EAAK,UAAU,EAC5D,OAAIG,IAGEH,EAAK,MAAM,aAAa,aAAa,GAAK,CAACriB,EAAYZ,CAAI,GAAK,CAACojB,EAAM,kBAAkBrjB,EAAaC,CAAI,CAAC,EAAE,QAAQ,GAChHojB,EAAM,SAASpjB,CAAI,EAGvB,IACT,CACA,SAASqjB,GAAYJ,EAAM,CACzB,OAAOA,EAAK,oBAAoB,SAAW,CAC7C,CACA,SAASK,GAAyBL,EAAMM,EAAmB,CACzDN,EAAK,oBAAoB,KAAKM,CAAiB,CACjD,CAMA,SAASC,GAA4BP,EAAMM,EAAmBE,EAAa,CACzE,IAAMC,EAAe,CAAC,EACtB,GAAID,EAAa,CACft0B,EAAOo0B,GAAqB,KAAM,iDAAiD,EACnF,IAAMvjB,EAAOijB,EAAK,MAAM,MACxBA,EAAK,oBAAoB,QAAQ9K,GAAgB,CAC/C,IAAMwL,EAAaxL,EAAa,kBAAkBsL,EAAazjB,CAAI,EAC/D2jB,GACFD,EAAa,KAAKC,CAAU,CAEhC,CAAC,CACH,CACA,GAAIJ,EAAmB,CACrB,IAAIK,EAAY,CAAC,EACjB,QAASh1B,EAAI,EAAGA,EAAIq0B,EAAK,oBAAoB,OAAQ,EAAEr0B,EAAG,CACxD,IAAMi1B,EAAWZ,EAAK,oBAAoBr0B,CAAC,EAC3C,GAAI,CAACi1B,EAAS,QAAQN,CAAiB,EACrCK,EAAU,KAAKC,CAAQ,UACdN,EAAkB,eAAe,EAAG,CAE7CK,EAAYA,EAAU,OAAOX,EAAK,oBAAoB,MAAMr0B,EAAI,CAAC,CAAC,EAClE,KACF,CACF,CACAq0B,EAAK,oBAAsBW,CAC7B,MACEX,EAAK,oBAAsB,CAAC,EAE9B,OAAOS,CACT,CAIA,SAASI,GAAmBb,EAAMnD,EAAWC,EAAa/C,EAAqB,CACzE8C,EAAU,OAAS7J,EAAc,OAAS6J,EAAU,OAAO,UAAY,OACzE3wB,EAAO4pB,GAA+BkK,EAAK,UAAU,EAAG,2DAA2D,EACnH9zB,EAAO2pB,GAA8BmK,EAAK,UAAU,EAAG,yDAAyD,GAElH,IAAMpD,EAAeoD,EAAK,WACpB5d,EAASua,GAA4BqD,EAAK,WAAYpD,EAAcC,EAAWC,EAAa/C,CAAmB,EACrH,OAAA0C,GAA2BuD,EAAK,WAAY5d,EAAO,SAAS,EAC5DlW,EAAOkW,EAAO,UAAU,YAAY,mBAAmB,GAAK,CAACwa,EAAa,YAAY,mBAAmB,EAAG,yDAAyD,EACrKoD,EAAK,WAAa5d,EAAO,UAClB0e,GAA8Bd,EAAM5d,EAAO,QAASA,EAAO,UAAU,WAAW,QAAQ,EAAG,IAAI,CACxG,CACA,SAAS2e,GAAqBf,EAAM9K,EAAc,CAChD,IAAMO,EAAYuK,EAAK,WAAW,WAC5BgB,EAAiB,CAAC,EACxB,OAAKvL,EAAU,QAAQ,EAAE,WAAW,GAChBA,EAAU,QAAQ,EAC1B,aAAa1N,EAAgB,CAAC9d,EAAK4c,IAAc,CACzDma,EAAe,KAAKtT,GAAiBzjB,EAAK4c,CAAS,CAAC,CACtD,CAAC,EAEC4O,EAAU,mBAAmB,GAC/BuL,EAAe,KAAKxT,GAAYiI,EAAU,QAAQ,CAAC,CAAC,EAE/CqL,GAA8Bd,EAAMgB,EAAgBvL,EAAU,QAAQ,EAAGP,CAAY,CAC9F,CACA,SAAS4L,GAA8Bd,EAAM1L,EAASC,EAAY+L,EAAmB,CACnF,IAAMzL,EAAgByL,EAAoB,CAACA,CAAiB,EAAIN,EAAK,oBACrE,OAAO5L,GAAuC4L,EAAK,gBAAiB1L,EAASC,EAAYM,CAAa,CACxG,CAkBA,IAAIoM,GAWEC,GAAN,KAAgB,CACd,aAAc,CAOZ,KAAK,MAAQ,IAAI,GACnB,CACF,EACA,SAASC,GAAiC3c,EAAK,CAC7CtY,EAAO,CAAC+0B,GAAwB,iDAAiD,EACjFA,GAAyBzc,CAC3B,CACA,SAAS4c,IAAmC,CAC1C,OAAAl1B,EAAO+0B,GAAwB,kCAAkC,EAC1DA,EACT,CACA,SAASI,GAAiBC,EAAW,CACnC,OAAOA,EAAU,MAAM,OAAS,CAClC,CACA,SAASC,GAAwBD,EAAWzE,EAAWC,EAAa0E,EAAwB,CAC1F,IAAMtgB,EAAU2b,EAAU,OAAO,QACjC,GAAI3b,IAAY,KAAM,CACpB,IAAM8e,EAAOsB,EAAU,MAAM,IAAIpgB,CAAO,EACxC,OAAAhV,EAAO8zB,GAAQ,KAAM,8CAA8C,EAC5Da,GAAmBb,EAAMnD,EAAWC,EAAa0E,CAAsB,CAChF,KAAO,CACL,IAAI/M,EAAS,CAAC,EACd,QAAWuL,KAAQsB,EAAU,MAAM,OAAO,EACxC7M,EAASA,EAAO,OAAOoM,GAAmBb,EAAMnD,EAAWC,EAAa0E,CAAsB,CAAC,EAEjG,OAAO/M,CACT,CACF,CAUA,SAASgN,GAAiBH,EAAWjyB,EAAOytB,EAAaxH,EAAaoM,EAAqB,CACzF,IAAMxgB,EAAU7R,EAAM,iBAChB2wB,EAAOsB,EAAU,MAAM,IAAIpgB,CAAO,EACxC,GAAI,CAAC8e,EAAM,CAET,IAAIzL,EAAa8G,GAAmCyB,EAAa4E,EAAsBpM,EAAc,IAAI,EACrGqM,EAAqB,GACrBpN,EACFoN,EAAqB,GACZrM,aAAuBxK,GAChCyJ,EAAagH,GAAsCuB,EAAaxH,CAAW,EAC3EqM,EAAqB,KAErBpN,EAAazJ,EAAa,WAC1B6W,EAAqB,IAEvB,IAAMnM,EAAYH,GAAa,IAAIvB,GAAUS,EAAYoN,EAAoB,EAAK,EAAG,IAAI7N,GAAUwB,EAAaoM,EAAqB,EAAK,CAAC,EAC3I,OAAO,IAAIhC,GAAKrwB,EAAOmmB,CAAS,CAClC,CACA,OAAOwK,CACT,CAWA,SAAS4B,GAA8BN,EAAWjyB,EAAOixB,EAAmBxD,EAAaxH,EAAaoM,EAAqB,CACzH,IAAM1B,EAAOyB,GAAiBH,EAAWjyB,EAAOytB,EAAaxH,EAAaoM,CAAmB,EAC7F,OAAKJ,EAAU,MAAM,IAAIjyB,EAAM,gBAAgB,GAC7CiyB,EAAU,MAAM,IAAIjyB,EAAM,iBAAkB2wB,CAAI,EAGlDK,GAAyBL,EAAMM,CAAiB,EACzCS,GAAqBf,EAAMM,CAAiB,CACrD,CAWA,SAASuB,GAAiCP,EAAWjyB,EAAOixB,EAAmBE,EAAa,CAC1F,IAAMtf,EAAU7R,EAAM,iBAChByyB,EAAU,CAAC,EACbrB,EAAe,CAAC,EACdsB,EAAkBC,GAAyBV,CAAS,EAC1D,GAAIpgB,IAAY,UAEd,OAAW,CAAC+gB,EAAajC,CAAI,IAAKsB,EAAU,MAAM,QAAQ,EACxDb,EAAeA,EAAa,OAAOF,GAA4BP,EAAMM,EAAmBE,CAAW,CAAC,EAChGJ,GAAYJ,CAAI,IAClBsB,EAAU,MAAM,OAAOW,CAAW,EAE7BjC,EAAK,MAAM,aAAa,aAAa,GACxC8B,EAAQ,KAAK9B,EAAK,KAAK,OAIxB,CAEL,IAAMA,EAAOsB,EAAU,MAAM,IAAIpgB,CAAO,EACpC8e,IACFS,EAAeA,EAAa,OAAOF,GAA4BP,EAAMM,EAAmBE,CAAW,CAAC,EAChGJ,GAAYJ,CAAI,IAClBsB,EAAU,MAAM,OAAOpgB,CAAO,EAEzB8e,EAAK,MAAM,aAAa,aAAa,GACxC8B,EAAQ,KAAK9B,EAAK,KAAK,GAI/B,CACA,OAAI+B,GAAmB,CAACC,GAAyBV,CAAS,GAExDQ,EAAQ,KAAK,IAAKV,GAAiC,GAAG/xB,EAAM,MAAOA,EAAM,KAAK,CAAC,EAE1E,CACL,QAAAyyB,EACA,OAAQrB,CACV,CACF,CACA,SAASyB,GAAuBZ,EAAW,CACzC,IAAMlf,EAAS,CAAC,EAChB,QAAW4d,KAAQsB,EAAU,MAAM,OAAO,EACnCtB,EAAK,MAAM,aAAa,aAAa,GACxC5d,EAAO,KAAK4d,CAAI,EAGpB,OAAO5d,CACT,CAKA,SAAS+f,GAAgCb,EAAWvkB,EAAM,CACxD,IAAIuY,EAAc,KAClB,QAAW0K,KAAQsB,EAAU,MAAM,OAAO,EACxChM,EAAcA,GAAe4K,GAA2BF,EAAMjjB,CAAI,EAEpE,OAAOuY,CACT,CACA,SAAS8M,GAAsBd,EAAWjyB,EAAO,CAE/C,GADeA,EAAM,aACV,aAAa,EACtB,OAAOgzB,GAAyBf,CAAS,EACpC,CACL,IAAMpgB,EAAU7R,EAAM,iBACtB,OAAOiyB,EAAU,MAAM,IAAIpgB,CAAO,CACpC,CACF,CACA,SAASohB,GAA4BhB,EAAWjyB,EAAO,CACrD,OAAO+yB,GAAsBd,EAAWjyB,CAAK,GAAK,IACpD,CACA,SAAS2yB,GAAyBV,EAAW,CAC3C,OAAOe,GAAyBf,CAAS,GAAK,IAChD,CACA,SAASe,GAAyBf,EAAW,CAC3C,QAAWtB,KAAQsB,EAAU,MAAM,OAAO,EACxC,GAAItB,EAAK,MAAM,aAAa,aAAa,EACvC,OAAOA,EAGX,OAAO,IACT,CAkBA,IAAIuC,GACJ,SAASC,GAAgChe,EAAK,CAC5CtY,EAAO,CAACq2B,GAAsB,iDAAiD,EAC/EA,GAAuB/d,CACzB,CACA,SAASie,IAAkC,CACzC,OAAAv2B,EAAOq2B,GAAsB,kCAAkC,EACxDA,EACT,CAIA,IAAIG,GAAwB,EAsBtBC,GAAN,KAAe,CAKb,YAAYC,EAAiB,CAC3B,KAAK,gBAAkBA,EAIvB,KAAK,eAAiB,IAAI3M,EAAc,IAAI,EAI5C,KAAK,kBAAoBoB,GAAa,EACtC,KAAK,cAAgB,IAAI,IACzB,KAAK,cAAgB,IAAI,GAC3B,CACF,EAMA,SAASwL,GAA2BC,EAAU/lB,EAAMgmB,EAASxK,EAAS9Y,EAAS,CAG7E,OADA6Y,GAAsBwK,EAAS,kBAAmB/lB,EAAMgmB,EAASxK,EAAS9Y,CAAO,EAC5EA,EAGIujB,GAAoCF,EAAU,IAAIpP,GAAUT,GAAuB,EAAGlW,EAAMgmB,CAAO,CAAC,EAFpG,CAAC,CAIZ,CAMA,SAASE,GAAuBH,EAAU/lB,EAAM0b,EAAiBF,EAAS,CAExEC,GAAkBsK,EAAS,kBAAmB/lB,EAAM0b,EAAiBF,CAAO,EAC5E,IAAM2K,EAAajN,EAAc,WAAWwC,CAAe,EAC3D,OAAOuK,GAAoCF,EAAU,IAAIlP,GAAMX,GAAuB,EAAGlW,EAAMmmB,CAAU,CAAC,CAC5G,CAOA,SAASC,GAAqBL,EAAUvK,EAAShF,EAAS,GAAO,CAC/D,IAAMgG,EAAQb,GAAkBoK,EAAS,kBAAmBvK,CAAO,EAEnE,GADyBK,GAAqBkK,EAAS,kBAAmBvK,CAAO,EAG1E,CACL,IAAIjF,EAAe,IAAI2C,EAAc,IAAI,EACzC,OAAIsD,EAAM,MAAQ,KAEhBjG,EAAeA,EAAa,IAAIzW,EAAa,EAAG,EAAI,EAEpDxO,EAAKkrB,EAAM,SAAU/d,GAAc,CACjC8X,EAAeA,EAAa,IAAI,IAAI7W,EAAKjB,CAAU,EAAG,EAAI,CAC5D,CAAC,EAEIwnB,GAAoCF,EAAU,IAAI1P,GAAamG,EAAM,KAAMjG,EAAcC,CAAM,CAAC,CACzG,KAZE,OAAO,CAAC,CAaZ,CAMA,SAAS6P,GAA6BN,EAAU/lB,EAAMgmB,EAAS,CAC7D,OAAOC,GAAoCF,EAAU,IAAIpP,GAAUR,GAAyB,EAAGnW,EAAMgmB,CAAO,CAAC,CAC/G,CAMA,SAASM,GAAyBP,EAAU/lB,EAAM0b,EAAiB,CACjE,IAAMyK,EAAajN,EAAc,WAAWwC,CAAe,EAC3D,OAAOuK,GAAoCF,EAAU,IAAIlP,GAAMV,GAAyB,EAAGnW,EAAMmmB,CAAU,CAAC,CAC9G,CAMA,SAASI,GAA4BR,EAAU/lB,EAAM,CACnD,OAAOimB,GAAoCF,EAAU,IAAItP,GAAeN,GAAyB,EAAGnW,CAAI,CAAC,CAC3G,CAMA,SAASwmB,GAAkCT,EAAU/lB,EAAMkE,EAAK,CAC9D,IAAMuiB,EAAWC,GAAwBX,EAAU7hB,CAAG,EACtD,GAAIuiB,EAAU,CACZ,IAAME,EAAIC,GAAuBH,CAAQ,EACnCI,EAAYF,EAAE,KAClBxiB,EAAUwiB,EAAE,QACRtN,EAAexY,EAAgBgmB,EAAW7mB,CAAI,EAC9C8mB,EAAK,IAAIrQ,GAAeL,GAAoCjS,CAAO,EAAGkV,CAAY,EACxF,OAAO0N,GAA8BhB,EAAUc,EAAWC,CAAE,CAC9D,KAEE,OAAO,CAAC,CAEZ,CAaA,SAASE,GAAgCjB,EAAUzzB,EAAOixB,EAAmBE,EAAawD,EAAoB,GAAO,CAEnH,IAAMjnB,EAAO1N,EAAM,MACb40B,EAAiBnB,EAAS,eAAe,IAAI/lB,CAAI,EACnD0jB,EAAe,CAAC,EAIpB,GAAIwD,IAAmB50B,EAAM,mBAAqB,WAAaizB,GAA4B2B,EAAgB50B,CAAK,GAAI,CAClH,IAAM60B,EAAmBrC,GAAiCoC,EAAgB50B,EAAOixB,EAAmBE,CAAW,EAC3Ga,GAAiB4C,CAAc,IACjCnB,EAAS,eAAiBA,EAAS,eAAe,OAAO/lB,CAAI,GAE/D,IAAM+kB,EAAUoC,EAAiB,QAEjC,GADAzD,EAAeyD,EAAiB,OAC5B,CAACF,EAAmB,CAQtB,IAAMG,EAAyBrC,EAAQ,UAAUzyB,GACxCA,EAAM,aAAa,aAAa,CACxC,IAFuB,GAGlB+0B,EAAUtB,EAAS,eAAe,WAAW/lB,EAAM,CAACqZ,EAAciO,IAAoBrC,GAAyBqC,CAAe,CAAC,EACrI,GAAIF,GAAmB,CAACC,EAAS,CAC/B,IAAMhN,EAAU0L,EAAS,eAAe,QAAQ/lB,CAAI,EAGpD,GAAI,CAACqa,EAAQ,QAAQ,EAAG,CAEtB,IAAMkN,EAAWC,GAAwCnN,CAAO,EAEhE,QAASzrB,EAAI,EAAGA,EAAI24B,EAAS,OAAQ,EAAE34B,EAAG,CACxC,IAAMq0B,EAAOsE,EAAS34B,CAAC,EACrB64B,EAAWxE,EAAK,MACZxvB,GAAWi0B,GAA+B3B,EAAU9C,CAAI,EAC9D8C,EAAS,gBAAgB,eAAe4B,GAA2BF,CAAQ,EAAGG,GAAoB7B,EAAU0B,CAAQ,EAAGh0B,GAAS,OAAQA,GAAS,UAAU,CAC7J,CACF,CAEF,CAII,CAAC4zB,GAAWtC,EAAQ,OAAS,GAAK,CAACtB,IAGjC2D,EAGFrB,EAAS,gBAAgB,cAAc4B,GAA2Br1B,CAAK,EAAG,IAAU,EAEpFyyB,EAAQ,QAAQ8C,GAAiB,CAC/B,IAAMC,EAAc/B,EAAS,cAAc,IAAIgC,GAAsBF,CAAa,CAAC,EACnF9B,EAAS,gBAAgB,cAAc4B,GAA2BE,CAAa,EAAGC,CAAW,CAC/F,CAAC,EAGP,CAEAE,GAAoBjC,EAAUhB,CAAO,CACvC,CACA,OAAOrB,CACT,CAMA,SAASuE,GAAkClC,EAAU/lB,EAAMmQ,EAAMjM,EAAK,CACpE,IAAMuiB,EAAWC,GAAwBX,EAAU7hB,CAAG,EACtD,GAAIuiB,GAAY,KAAM,CACpB,IAAM,EAAIG,GAAuBH,CAAQ,EACnCI,EAAY,EAAE,KAClB1iB,EAAU,EAAE,QACRkV,EAAexY,EAAgBgmB,EAAW7mB,CAAI,EAC9C8mB,EAAK,IAAInQ,GAAUP,GAAoCjS,CAAO,EAAGkV,EAAclJ,CAAI,EACzF,OAAO4W,GAA8BhB,EAAUc,EAAWC,CAAE,CAC9D,KAEE,OAAO,CAAC,CAEZ,CAMA,SAASoB,GAA8BnC,EAAU/lB,EAAM0b,EAAiBxX,EAAK,CAC3E,IAAMuiB,EAAWC,GAAwBX,EAAU7hB,CAAG,EACtD,GAAIuiB,EAAU,CACZ,IAAM,EAAIG,GAAuBH,CAAQ,EACnCI,EAAY,EAAE,KAClB1iB,EAAU,EAAE,QACRkV,EAAexY,EAAgBgmB,EAAW7mB,CAAI,EAC9CmmB,EAAajN,EAAc,WAAWwC,CAAe,EACrDoL,EAAK,IAAIjQ,GAAMT,GAAoCjS,CAAO,EAAGkV,EAAc8M,CAAU,EAC3F,OAAOY,GAA8BhB,EAAUc,EAAWC,CAAE,CAC9D,KAEE,OAAO,CAAC,CAEZ,CAMA,SAASqB,GAA6BpC,EAAUzzB,EAAOixB,EAAmB6E,EAAoB,GAAO,CACnG,IAAMpoB,EAAO1N,EAAM,MACfimB,EAAc,KACd8P,EAA2B,GAG/BtC,EAAS,eAAe,cAAc/lB,EAAM,CAACsoB,EAAiBC,IAAO,CACnE,IAAMlP,EAAexY,EAAgBynB,EAAiBtoB,CAAI,EAC1DuY,EAAcA,GAAe6M,GAAgCmD,EAAIlP,CAAY,EAC7EgP,EAA2BA,GAA4BpD,GAAyBsD,CAAE,CACpF,CAAC,EACD,IAAIhE,EAAYwB,EAAS,eAAe,IAAI/lB,CAAI,EAC3CukB,GAIH8D,EAA2BA,GAA4BpD,GAAyBV,CAAS,EACzFhM,EAAcA,GAAe6M,GAAgCb,EAAWzkB,EAAa,CAAC,IAJtFykB,EAAY,IAAIJ,GAChB4B,EAAS,eAAiBA,EAAS,eAAe,IAAI/lB,EAAMukB,CAAS,GAKvE,IAAII,EACApM,GAAe,KACjBoM,EAAsB,IAEtBA,EAAsB,GACtBpM,EAAcxK,EAAa,WACXgY,EAAS,eAAe,QAAQ/lB,CAAI,EAC5C,aAAa,CAAC6J,EAAW2e,IAAmB,CAClD,IAAMxI,EAAgBoF,GAAgCoD,EAAgB1oB,EAAa,CAAC,EAChFkgB,IACFzH,EAAcA,EAAY,qBAAqB1O,EAAWmW,CAAa,EAE3E,CAAC,GAEH,IAAMyI,EAAoBlD,GAA4BhB,EAAWjyB,CAAK,EACtE,GAAI,CAACm2B,GAAqB,CAACn2B,EAAM,aAAa,aAAa,EAAG,CAE5D,IAAMm0B,EAAWsB,GAAsBz1B,CAAK,EAC5CnD,EAAO,CAAC42B,EAAS,cAAc,IAAIU,CAAQ,EAAG,wCAAwC,EACtF,IAAMviB,EAAMwkB,GAAyB,EACrC3C,EAAS,cAAc,IAAIU,EAAUviB,CAAG,EACxC6hB,EAAS,cAAc,IAAI7hB,EAAKuiB,CAAQ,CAC1C,CACA,IAAM1G,EAAc1E,GAAqB0K,EAAS,kBAAmB/lB,CAAI,EACrE0X,EAASmN,GAA8BN,EAAWjyB,EAAOixB,EAAmBxD,EAAaxH,EAAaoM,CAAmB,EAC7H,GAAI,CAAC8D,GAAqB,CAACJ,GAA4B,CAACD,EAAmB,CACzE,IAAMnF,EAAOoC,GAAsBd,EAAWjyB,CAAK,EACnDolB,EAASA,EAAO,OAAOiR,GAAuB5C,EAAUzzB,EAAO2wB,CAAI,CAAC,CACtE,CACA,OAAOvL,CACT,CAYA,SAASkR,GAA+B7C,EAAU/lB,EAAMid,EAAmB,CAEzE,IAAM9B,EAAY4K,EAAS,kBACrBxN,EAAcwN,EAAS,eAAe,WAAW/lB,EAAM,CAAC0Z,EAAW6K,IAAc,CACrF,IAAMlL,EAAexY,EAAgB6Y,EAAW1Z,CAAI,EAC9CuY,EAAc6M,GAAgCb,EAAWlL,CAAY,EAC3E,GAAId,EACF,OAAOA,CAEX,CAAC,EACD,OAAOuE,GAAgC3B,EAAWnb,EAAMuY,EAAa0E,EAAmB,EAAiB,CAC3G,CACA,SAAS4L,GAAuB9C,EAAUzzB,EAAO,CAC/C,IAAM0N,EAAO1N,EAAM,MACfimB,EAAc,KAGlBwN,EAAS,eAAe,cAAc/lB,EAAM,CAACsoB,EAAiBC,IAAO,CACnE,IAAMlP,EAAexY,EAAgBynB,EAAiBtoB,CAAI,EAC1DuY,EAAcA,GAAe6M,GAAgCmD,EAAIlP,CAAY,CAC/E,CAAC,EACD,IAAIkL,EAAYwB,EAAS,eAAe,IAAI/lB,CAAI,EAC3CukB,EAIHhM,EAAcA,GAAe6M,GAAgCb,EAAWzkB,EAAa,CAAC,GAHtFykB,EAAY,IAAIJ,GAChB4B,EAAS,eAAiBA,EAAS,eAAe,IAAI/lB,EAAMukB,CAAS,GAIvE,IAAMI,EAAsBpM,GAAe,KACrCuQ,EAAkBnE,EAAsB,IAAI5N,GAAUwB,EAAa,GAAM,EAAK,EAAI,KAClFwH,EAAc1E,GAAqB0K,EAAS,kBAAmBzzB,EAAM,KAAK,EAC1E2wB,EAAOyB,GAAiBH,EAAWjyB,EAAOytB,EAAa4E,EAAsBmE,EAAgB,QAAQ,EAAI/a,EAAa,WAAY4W,CAAmB,EAC3J,OAAOzB,GAAoBD,CAAI,CACjC,CAcA,SAASgD,GAAoCF,EAAUjG,EAAW,CAChE,OAAOiJ,GAA8BjJ,EAAWiG,EAAS,eAAgC,KAAM1K,GAAqB0K,EAAS,kBAAmBjmB,EAAa,CAAC,CAAC,CACjK,CAIA,SAASipB,GAA8BjJ,EAAWkJ,EAAezQ,EAAawH,EAAa,CACzF,GAAInf,EAAYkf,EAAU,IAAI,EAC5B,OAAOmJ,GAAyCnJ,EAAWkJ,EAAezQ,EAAawH,CAAW,EAC7F,CACL,IAAMwE,EAAYyE,EAAc,IAAIlpB,EAAa,CAAC,EAE9CyY,GAAe,MAAQgM,GAAa,OACtChM,EAAc6M,GAAgCb,EAAWzkB,EAAa,CAAC,GAEzE,IAAI4X,EAAS,CAAC,EACR7N,EAAY9J,EAAa+f,EAAU,IAAI,EACvCoJ,EAAiBpJ,EAAU,kBAAkBjW,CAAS,EACtDyC,EAAY0c,EAAc,SAAS,IAAInf,CAAS,EACtD,GAAIyC,GAAa4c,EAAgB,CAC/B,IAAMC,EAAmB5Q,EAAcA,EAAY,kBAAkB1O,CAAS,EAAI,KAC5Euf,EAAmBtK,GAAkBiB,EAAalW,CAAS,EACjE6N,EAASA,EAAO,OAAOqR,GAA8BG,EAAgB5c,EAAW6c,EAAkBC,CAAgB,CAAC,CACrH,CACA,OAAI7E,IACF7M,EAASA,EAAO,OAAO8M,GAAwBD,EAAWzE,EAAWC,EAAaxH,CAAW,CAAC,GAEzFb,CACT,CACF,CAIA,SAASuR,GAAyCnJ,EAAWkJ,EAAezQ,EAAawH,EAAa,CACpG,IAAMwE,EAAYyE,EAAc,IAAIlpB,EAAa,CAAC,EAE9CyY,GAAe,MAAQgM,GAAa,OACtChM,EAAc6M,GAAgCb,EAAWzkB,EAAa,CAAC,GAEzE,IAAI4X,EAAS,CAAC,EACd,OAAAsR,EAAc,SAAS,iBAAiB,CAACnf,EAAWyC,IAAc,CAChE,IAAM6c,EAAmB5Q,EAAcA,EAAY,kBAAkB1O,CAAS,EAAI,KAC5Euf,EAAmBtK,GAAkBiB,EAAalW,CAAS,EAC3Dqf,EAAiBpJ,EAAU,kBAAkBjW,CAAS,EACxDqf,IACFxR,EAASA,EAAO,OAAOuR,GAAyCC,EAAgB5c,EAAW6c,EAAkBC,CAAgB,CAAC,EAElI,CAAC,EACG7E,IACF7M,EAASA,EAAO,OAAO8M,GAAwBD,EAAWzE,EAAWC,EAAaxH,CAAW,CAAC,GAEzFb,CACT,CACA,SAASgQ,GAA+B3B,EAAU9C,EAAM,CACtD,IAAM3wB,EAAQ2wB,EAAK,MACb/e,EAAM0jB,GAAoB7B,EAAUzzB,CAAK,EAC/C,MAAO,CACL,OAAQ,KACQ0wB,GAAmBC,CAAI,GAAKlV,EAAa,YAC1C,KAAK,EAEpB,WAAYxJ,GAAU,CACpB,GAAIA,IAAW,KACb,OAAIL,EACKsiB,GAAkCT,EAAUzzB,EAAM,MAAO4R,CAAG,EAE5DqiB,GAA4BR,EAAUzzB,EAAM,KAAK,EAErD,CAGL,IAAM9C,EAAQ4C,GAAmBmS,EAAQjS,CAAK,EAC9C,OAAO00B,GAAgCjB,EAAUzzB,EAA4B,KAAM9C,CAAK,CAC1F,CACF,CACF,CACF,CAIA,SAASo4B,GAAoB7B,EAAUzzB,EAAO,CAC5C,IAAMm0B,EAAWsB,GAAsBz1B,CAAK,EAC5C,OAAOyzB,EAAS,cAAc,IAAIU,CAAQ,CAC5C,CAIA,SAASsB,GAAsBz1B,EAAO,CACpC,OAAOA,EAAM,MAAM,SAAS,EAAI,IAAMA,EAAM,gBAC9C,CAIA,SAASo0B,GAAwBX,EAAU7hB,EAAK,CAC9C,OAAO6hB,EAAS,cAAc,IAAI7hB,CAAG,CACvC,CAIA,SAAS0iB,GAAuBH,EAAU,CACxC,IAAM4C,EAAa5C,EAAS,QAAQ,GAAG,EACvC,OAAAt3B,EAAOk6B,IAAe,IAAMA,EAAa5C,EAAS,OAAS,EAAG,eAAe,EACtE,CACL,QAASA,EAAS,OAAO4C,EAAa,CAAC,EACvC,KAAM,IAAI3pB,EAAK+mB,EAAS,OAAO,EAAG4C,CAAU,CAAC,CAC/C,CACF,CAIA,SAAStC,GAA8BhB,EAAUc,EAAW/G,EAAW,CACrE,IAAMyE,EAAYwB,EAAS,eAAe,IAAIc,CAAS,EACvD13B,EAAOo1B,EAAW,sDAAsD,EACxE,IAAMxE,EAAc1E,GAAqB0K,EAAS,kBAAmBc,CAAS,EAC9E,OAAOrC,GAAwBD,EAAWzE,EAAWC,EAAa,IAAI,CACxE,CAKA,SAASyH,GAAwCnN,EAAS,CACxD,OAAOA,EAAQ,KAAK,CAAChB,EAAciQ,EAAqBC,IAAa,CACnE,GAAID,GAAuBrE,GAAyBqE,CAAmB,EAErE,MAAO,CADchE,GAAyBgE,CAAmB,CAC7C,EACf,CAEL,IAAIE,EAAQ,CAAC,EACb,OAAIF,IACFE,EAAQrE,GAAuBmE,CAAmB,GAEpDh4B,EAAKi4B,EAAU,CAACE,EAAMC,IAAe,CACnCF,EAAQA,EAAM,OAAOE,CAAU,CACjC,CAAC,EACMF,CACT,CACF,CAAC,CACH,CAMA,SAAS7B,GAA2Br1B,EAAO,CACzC,OAAIA,EAAM,aAAa,aAAa,GAAK,CAACA,EAAM,aAAa,UAAU,EAI9D,IAAKozB,GAAgC,GAAGpzB,EAAM,MAAOA,EAAM,KAAK,EAEhEA,CAEX,CACA,SAAS01B,GAAoBjC,EAAUnf,EAAS,CAC9C,QAASlF,EAAI,EAAGA,EAAIkF,EAAQ,OAAQ,EAAElF,EAAG,CACvC,IAAMioB,EAAe/iB,EAAQlF,CAAC,EAC9B,GAAI,CAACioB,EAAa,aAAa,aAAa,EAAG,CAE7C,IAAMC,EAAkB7B,GAAsB4B,CAAY,EACpDE,EAAkB9D,EAAS,cAAc,IAAI6D,CAAe,EAClE7D,EAAS,cAAc,OAAO6D,CAAe,EAC7C7D,EAAS,cAAc,OAAO8D,CAAe,CAC/C,CACF,CACF,CAIA,SAASnB,IAA2B,CAClC,OAAO/C,IACT,CAMA,SAASgD,GAAuB5C,EAAUzzB,EAAO2wB,EAAM,CACrD,IAAMjjB,EAAO1N,EAAM,MACb4R,EAAM0jB,GAAoB7B,EAAUzzB,CAAK,EACzCmB,EAAWi0B,GAA+B3B,EAAU9C,CAAI,EACxDvL,EAASqO,EAAS,gBAAgB,eAAe4B,GAA2Br1B,CAAK,EAAG4R,EAAKzQ,EAAS,OAAQA,EAAS,UAAU,EAC7H4mB,EAAU0L,EAAS,eAAe,QAAQ/lB,CAAI,EAGpD,GAAIkE,EACF/U,EAAO,CAAC81B,GAAyB5K,EAAQ,KAAK,EAAG,mDAAmD,MAC/F,CAEL,IAAMyP,EAAgBzP,EAAQ,KAAK,CAAChB,EAAciQ,EAAqBC,IAAa,CAClF,GAAI,CAAC3oB,EAAYyY,CAAY,GAAKiQ,GAAuBrE,GAAyBqE,CAAmB,EACnG,MAAO,CAAChE,GAAyBgE,CAAmB,EAAE,KAAK,EACtD,CAEL,IAAI1iB,EAAU,CAAC,EACf,OAAI0iB,IACF1iB,EAAUA,EAAQ,OAAOue,GAAuBmE,CAAmB,EAAE,IAAIrG,GAAQA,EAAK,KAAK,CAAC,GAE9F3xB,EAAKi4B,EAAU,CAACE,EAAMM,IAAiB,CACrCnjB,EAAUA,EAAQ,OAAOmjB,CAAY,CACvC,CAAC,EACMnjB,CACT,CACF,CAAC,EACD,QAAShY,EAAI,EAAGA,EAAIk7B,EAAc,OAAQ,EAAEl7B,EAAG,CAC7C,IAAMo7B,EAAcF,EAAcl7B,CAAC,EACnCm3B,EAAS,gBAAgB,cAAc4B,GAA2BqC,CAAW,EAAGpC,GAAoB7B,EAAUiE,CAAW,CAAC,CAC5H,CACF,CACA,OAAOtS,CACT,CAkBA,IAAMuS,GAAN,MAAMC,CAAsB,CAC1B,YAAYlT,EAAO,CACjB,KAAK,MAAQA,CACf,CACA,kBAAkBnN,EAAW,CAC3B,IAAM3H,EAAQ,KAAK,MAAM,kBAAkB2H,CAAS,EACpD,OAAO,IAAIqgB,EAAsBhoB,CAAK,CACxC,CACA,MAAO,CACL,OAAO,KAAK,KACd,CACF,EACMioB,GAAN,MAAMC,CAAsB,CAC1B,YAAYrE,EAAU/lB,EAAM,CAC1B,KAAK,UAAY+lB,EACjB,KAAK,MAAQ/lB,CACf,CACA,kBAAkB6J,EAAW,CAC3B,IAAMuP,EAAY3Y,EAAU,KAAK,MAAOoJ,CAAS,EACjD,OAAO,IAAIugB,EAAsB,KAAK,UAAWhR,CAAS,CAC5D,CACA,MAAO,CACL,OAAOwP,GAA+B,KAAK,UAAW,KAAK,KAAK,CAClE,CACF,EAIMyB,GAAqB,SAAUC,EAAQ,CAC3C,OAAAA,EAASA,GAAU,CAAC,EACpBA,EAAO,UAAeA,EAAO,WAAgB,IAAI,KAAK,EAAE,QAAQ,EACzDA,CACT,EAKMC,GAA2B,SAAUp9B,EAAOq9B,EAAaC,EAAc,CAC3E,GAAI,CAACt9B,GAAS,OAAOA,GAAU,SAC7B,OAAOA,EAGT,GADAgC,EAAO,QAAShC,EAAO,2CAA2C,EAC9D,OAAOA,EAAM,KAAK,GAAM,SAC1B,OAAOu9B,GAA2Bv9B,EAAM,KAAK,EAAGq9B,EAAaC,CAAY,EACpE,GAAI,OAAOt9B,EAAM,KAAK,GAAM,SACjC,OAAOw9B,GAA4Bx9B,EAAM,KAAK,EAAGq9B,CAAW,EAE5Dr7B,EAAO,GAAO,4BAA8B,KAAK,UAAUhC,EAAO,KAAM,CAAC,CAAC,CAE9E,EACMu9B,GAA6B,SAAU5D,EAAIjD,EAAU4G,EAAc,CACvE,OAAQ3D,EAAI,CACV,IAAK,YACH,OAAO2D,EAAa,UACtB,QACEt7B,EAAO,GAAO,4BAA8B23B,CAAE,CAClD,CACF,EACM6D,GAA8B,SAAU7D,EAAIjD,EAAU+G,EAAQ,CAC7D9D,EAAG,eAAe,WAAW,GAChC33B,EAAO,GAAO,4BAA8B,KAAK,UAAU23B,EAAI,KAAM,CAAC,CAAC,EAEzE,IAAM1gB,EAAQ0gB,EAAG,UACb,OAAO1gB,GAAU,UACnBjX,EAAO,GAAO,+BAAiCiX,CAAK,EAEtD,IAAMykB,EAAehH,EAAS,KAAK,EAGnC,GAFA10B,EAAO07B,IAAiB,MAAQ,OAAOA,EAAiB,IAAa,4CAA4C,EAE7G,CAACA,EAAa,WAAW,EAC3B,OAAOzkB,EAGT,IAAMokB,EADOK,EACY,SAAS,EAClC,OAAI,OAAOL,GAAgB,SAClBpkB,EAGFokB,EAAcpkB,CACvB,EAQM0kB,GAA2B,SAAU9qB,EAAMiH,EAAM8e,EAAU0E,EAAc,CAC7E,OAAOM,GAAqB9jB,EAAM,IAAIkjB,GAAsBpE,EAAU/lB,CAAI,EAAGyqB,CAAY,CAC3F,EAMMO,GAA+B,SAAU/jB,EAAM4c,EAAU4G,EAAc,CAC3E,OAAOM,GAAqB9jB,EAAM,IAAIgjB,GAAsBpG,CAAQ,EAAG4G,CAAY,CACrF,EACA,SAASM,GAAqB9jB,EAAMujB,EAAaC,EAAc,CAC7D,IAAMQ,EAAShkB,EAAK,YAAY,EAAE,IAAI,EAChCoC,EAAWkhB,GAAyBU,EAAQT,EAAY,kBAAkB,WAAW,EAAGC,CAAY,EACtGrjB,EACJ,GAAIH,EAAK,WAAW,EAAG,CACrB,IAAMikB,EAAWjkB,EACX9Z,EAAQo9B,GAAyBW,EAAS,SAAS,EAAGV,EAAaC,CAAY,EACrF,OAAIt9B,IAAU+9B,EAAS,SAAS,GAAK7hB,IAAa6hB,EAAS,YAAY,EAAE,IAAI,EACpE,IAAIzhB,GAAStc,EAAOsiB,EAAapG,CAAQ,CAAC,EAE1CpC,CAEX,KAAO,CACL,IAAMkkB,EAAelkB,EACrB,OAAAG,EAAU+jB,EACN9hB,IAAa8hB,EAAa,YAAY,EAAE,IAAI,IAC9C/jB,EAAUA,EAAQ,eAAe,IAAIqC,GAASJ,CAAQ,CAAC,GAEzD8hB,EAAa,aAAangB,EAAgB,CAACnB,EAAWC,IAAc,CAClE,IAAMC,EAAeghB,GAAqBjhB,EAAW0gB,EAAY,kBAAkB3gB,CAAS,EAAG4gB,CAAY,EACvG1gB,IAAiBD,IACnB1C,EAAUA,EAAQ,qBAAqByC,EAAWE,CAAY,EAElE,CAAC,EACM3C,CACT,CACF,CAuBA,IAAMgkB,GAAN,KAAW,CAMT,YAAYx+B,EAAO,GAAIy+B,EAAS,KAAMpkB,EAAO,CAC3C,SAAU,CAAC,EACX,WAAY,CACd,EAAG,CACD,KAAK,KAAOra,EACZ,KAAK,OAASy+B,EACd,KAAK,KAAOpkB,CACd,CACF,EAOA,SAASqkB,GAAYtW,EAAMuW,EAAS,CAElC,IAAIvrB,EAAOurB,aAAmB7rB,EAAO6rB,EAAU,IAAI7rB,EAAK6rB,CAAO,EAC3DrpB,EAAQ8S,EACV1H,EAAOvN,EAAaC,CAAI,EAC1B,KAAOsN,IAAS,MAAM,CACpB,IAAMxD,EAAYrF,GAAQvC,EAAM,KAAK,SAAUoL,CAAI,GAAK,CACtD,SAAU,CAAC,EACX,WAAY,CACd,EACApL,EAAQ,IAAIkpB,GAAK9d,EAAMpL,EAAO4H,CAAS,EACvC9J,EAAOE,EAAaF,CAAI,EACxBsN,EAAOvN,EAAaC,CAAI,CAC1B,CACA,OAAOkC,CACT,CAMA,SAASspB,GAAaxW,EAAM,CAC1B,OAAOA,EAAK,KAAK,KACnB,CAMA,SAASyW,GAAazW,EAAM7nB,EAAO,CACjC6nB,EAAK,KAAK,MAAQ7nB,EAClBu+B,GAAkB1W,CAAI,CACxB,CAIA,SAAS2W,GAAgB3W,EAAM,CAC7B,OAAOA,EAAK,KAAK,WAAa,CAChC,CAIA,SAAS4W,GAAY5W,EAAM,CACzB,OAAOwW,GAAaxW,CAAI,IAAM,QAAa,CAAC2W,GAAgB3W,CAAI,CAClE,CAMA,SAAS6W,GAAiB7W,EAAMvR,EAAQ,CACtCnS,EAAK0jB,EAAK,KAAK,SAAU,CAAC9S,EAAOoK,IAAc,CAC7C7I,EAAO,IAAI2nB,GAAKlpB,EAAO8S,EAAM1I,CAAS,CAAC,CACzC,CAAC,CACH,CAUA,SAASwf,GAAsB9W,EAAMvR,EAAQsoB,EAAaC,EAAe,CACnED,GAAe,CAACC,GAClBvoB,EAAOuR,CAAI,EAEb6W,GAAiB7W,EAAM9S,GAAS,CAC9B4pB,GAAsB5pB,EAAOuB,EAAQ,GAAMuoB,CAAa,CAC1D,CAAC,EACGD,GAAeC,GACjBvoB,EAAOuR,CAAI,CAEf,CASA,SAASiX,GAAoBjX,EAAMvR,EAAQsoB,EAAa,CACtD,IAAI9kB,EAAO8kB,EAAc/W,EAAOA,EAAK,OACrC,KAAO/N,IAAS,MAAM,CACpB,GAAIxD,EAAOwD,CAAI,EACb,MAAO,GAETA,EAAOA,EAAK,MACd,CACA,MAAO,EACT,CAIA,SAASilB,GAAYlX,EAAM,CACzB,OAAO,IAAItV,EAAKsV,EAAK,SAAW,KAAOA,EAAK,KAAOkX,GAAYlX,EAAK,MAAM,EAAI,IAAMA,EAAK,IAAI,CAC/F,CAIA,SAAS0W,GAAkB1W,EAAM,CAC3BA,EAAK,SAAW,MAClBmX,GAAgBnX,EAAK,OAAQA,EAAK,KAAMA,CAAI,CAEhD,CAOA,SAASmX,GAAgBnX,EAAMnL,EAAW3H,EAAO,CAC/C,IAAMkqB,EAAaR,GAAY1pB,CAAK,EAC9BmqB,EAAc7+B,EAASwnB,EAAK,KAAK,SAAUnL,CAAS,EACtDuiB,GAAcC,GAChB,OAAOrX,EAAK,KAAK,SAASnL,CAAS,EACnCmL,EAAK,KAAK,aACV0W,GAAkB1W,CAAI,GACb,CAACoX,GAAc,CAACC,IACzBrX,EAAK,KAAK,SAASnL,CAAS,EAAI3H,EAAM,KACtC8S,EAAK,KAAK,aACV0W,GAAkB1W,CAAI,EAE1B,CAqBA,IAAMsX,GAAqB,iCAKrBC,GAAsB,+BAItBC,GAAiB,GAAK,KAAO,KAC7BC,GAAa,SAAUv/B,EAAK,CAChC,OAAO,OAAOA,GAAQ,UAAYA,EAAI,SAAW,GAAK,CAACo/B,GAAmB,KAAKp/B,CAAG,CACpF,EACMw/B,GAAoB,SAAUjuB,EAAY,CAC9C,OAAO,OAAOA,GAAe,UAAYA,EAAW,SAAW,GAAK,CAAC8tB,GAAoB,KAAK9tB,CAAU,CAC1G,EACMkuB,GAAwB,SAAUluB,EAAY,CAClD,OAAIA,IAEFA,EAAaA,EAAW,QAAQ,mBAAoB,GAAG,GAElDiuB,GAAkBjuB,CAAU,CACrC,EACMmuB,GAAkB,SAAUvjB,EAAU,CAC1C,OAAOA,IAAa,MAAQ,OAAOA,GAAa,UAAY,OAAOA,GAAa,UAAY,CAACzZ,GAAoByZ,CAAQ,GAAKA,GAAY,OAAOA,GAAa,UAE9J7b,EAAS6b,EAAU,KAAK,CAC1B,EAIMwjB,GAA0B,SAAUC,EAAQ3/B,EAAO6S,EAAM+sB,EAAU,CACnEA,GAAY5/B,IAAU,QAG1B6/B,GAAqBC,GAAYH,EAAQ,OAAO,EAAG3/B,EAAO6S,CAAI,CAChE,EAIMgtB,GAAuB,SAAUC,EAAap9B,EAAMq9B,EAAO,CAC/D,IAAMltB,EAAOktB,aAAiBxtB,EAAO,IAAIkC,GAAesrB,EAAOD,CAAW,EAAIC,EAC9E,GAAIr9B,IAAS,OACX,MAAM,IAAI,MAAMo9B,EAAc,sBAAwB5qB,GAA4BrC,CAAI,CAAC,EAEzF,GAAI,OAAOnQ,GAAS,WAClB,MAAM,IAAI,MAAMo9B,EAAc,uBAAyB5qB,GAA4BrC,CAAI,EAAI,oBAAsBnQ,EAAK,SAAS,CAAC,EAElI,GAAID,GAAoBC,CAAI,EAC1B,MAAM,IAAI,MAAMo9B,EAAc,YAAcp9B,EAAK,SAAS,EAAI,IAAMwS,GAA4BrC,CAAI,CAAC,EAGvG,GAAI,OAAOnQ,GAAS,UAAYA,EAAK,OAAS28B,GAAiB,GAAK1qB,GAAajS,CAAI,EAAI28B,GACvF,MAAM,IAAI,MAAMS,EAAc,kCAAoCT,GAAiB,eAAiBnqB,GAA4BrC,CAAI,EAAI,MAAQnQ,EAAK,UAAU,EAAG,EAAE,EAAI,OAAO,EAIjL,GAAIA,GAAQ,OAAOA,GAAS,SAAU,CACpC,IAAIs9B,EAAc,GACdC,EAAiB,GAcrB,GAbA97B,EAAKzB,EAAM,CAAC3C,EAAKC,IAAU,CACzB,GAAID,IAAQ,SACVigC,EAAc,WACLjgC,IAAQ,aAAeA,IAAQ,QACxCkgC,EAAiB,GACb,CAACX,GAAWv/B,CAAG,GACjB,MAAM,IAAI,MAAM+/B,EAAc,6BAA+B//B,EAAM,KAAOmV,GAA4BrC,CAAI,EAAI,qFAA2F,EAG7MgC,GAAmBhC,EAAM9S,CAAG,EAC5B8/B,GAAqBC,EAAa9/B,EAAO6S,CAAI,EAC7CmC,GAAkBnC,CAAI,CACxB,CAAC,EACGmtB,GAAeC,EACjB,MAAM,IAAI,MAAMH,EAAc,4BAA8B5qB,GAA4BrC,CAAI,EAAI,kCAAkC,CAEtI,CACF,EAIMqtB,GAA6B,SAAUJ,EAAaK,EAAY,CACpE,IAAI1+B,EAAG2+B,EACP,IAAK3+B,EAAI,EAAGA,EAAI0+B,EAAW,OAAQ1+B,IAAK,CACtC2+B,EAAUD,EAAW1+B,CAAC,EACtB,IAAMmC,EAAOsP,GAAUktB,CAAO,EAC9B,QAAS7rB,EAAI,EAAGA,EAAI3Q,EAAK,OAAQ2Q,IAC/B,GAAI,EAAA3Q,EAAK2Q,CAAC,IAAM,aAAeA,IAAM3Q,EAAK,OAAS,IAAS,GAAI,CAAC07B,GAAW17B,EAAK2Q,CAAC,CAAC,EACjF,MAAM,IAAI,MAAMurB,EAAc,4BAA8Bl8B,EAAK2Q,CAAC,EAAI,aAAe6rB,EAAQ,SAAS,EAAI,oFAA0F,EAG1M,CAIAD,EAAW,KAAKpsB,EAAW,EAC3B,IAAIssB,EAAW,KACf,IAAK5+B,EAAI,EAAGA,EAAI0+B,EAAW,OAAQ1+B,IAAK,CAEtC,GADA2+B,EAAUD,EAAW1+B,CAAC,EAClB4+B,IAAa,MAAQ7rB,EAAa6rB,EAAUD,CAAO,EACrD,MAAM,IAAI,MAAMN,EAAc,mBAAqBO,EAAS,SAAS,EAAI,qCAAuCD,EAAQ,SAAS,CAAC,EAEpIC,EAAWD,CACb,CACF,EAKME,GAA+B,SAAUX,EAAQj9B,EAAMmQ,EAAM+sB,EAAU,CAC3E,GAAIA,GAAYl9B,IAAS,OACvB,OAEF,IAAM69B,EAAgBT,GAAYH,EAAQ,QAAQ,EAClD,GAAI,EAAEj9B,GAAQ,OAAOA,GAAS,WAAa,MAAM,QAAQA,CAAI,EAC3D,MAAM,IAAI,MAAM69B,EAAgB,wDAAwD,EAE1F,IAAMJ,EAAa,CAAC,EACpBh8B,EAAKzB,EAAM,CAAC3C,EAAKC,IAAU,CACzB,IAAMogC,EAAU,IAAI7tB,EAAKxS,CAAG,EAE5B,GADA8/B,GAAqBU,EAAevgC,EAAOsT,EAAUT,EAAMutB,CAAO,CAAC,EAC/DptB,GAAYotB,CAAO,IAAM,aACvB,CAACX,GAAgBz/B,CAAK,EACxB,MAAM,IAAI,MAAMugC,EAAgB,kCAAoCH,EAAQ,SAAS,EAAI,8FAAmG,EAGhMD,EAAW,KAAKC,CAAO,CACzB,CAAC,EACDF,GAA2BK,EAAeJ,CAAU,CACtD,EACMK,GAAmB,SAAUb,EAAQzjB,EAAU0jB,EAAU,CAC7D,GAAI,EAAAA,GAAY1jB,IAAa,QAG7B,IAAIzZ,GAAoByZ,CAAQ,EAC9B,MAAM,IAAI,MAAM4jB,GAAYH,EAAQ,UAAU,EAAI,MAAQzjB,EAAS,SAAS,EAAI,2FAAgG,EAGlL,GAAI,CAACujB,GAAgBvjB,CAAQ,EAC3B,MAAM,IAAI,MAAM4jB,GAAYH,EAAQ,UAAU,EAAI,qFAA0F,EAEhJ,EACMc,GAAc,SAAUd,EAAQe,EAAc3gC,EAAK6/B,EAAU,CACjE,GAAI,EAAAA,GAAY7/B,IAAQ,SAGpB,CAACu/B,GAAWv/B,CAAG,EACjB,MAAM,IAAI,MAAM+/B,GAAYH,EAAQe,CAAY,EAAI,yBAA2B3gC,EAAM,iGAAuG,CAEhM,EAIM4gC,GAAqB,SAAUhB,EAAQe,EAAcpvB,EAAYsuB,EAAU,CAC/E,GAAI,EAAAA,GAAYtuB,IAAe,SAG3B,CAACiuB,GAAkBjuB,CAAU,EAC/B,MAAM,IAAI,MAAMwuB,GAAYH,EAAQe,CAAY,EAAI,0BAA4BpvB,EAAa,iFAAuF,CAExL,EACMsvB,GAAyB,SAAUjB,EAAQe,EAAcpvB,EAAYsuB,EAAU,CAC/EtuB,IAEFA,EAAaA,EAAW,QAAQ,mBAAoB,GAAG,GAEzDqvB,GAAmBhB,EAAQe,EAAcpvB,EAAYsuB,CAAQ,CAC/D,EAIMiB,EAAuB,SAAUlB,EAAQ9sB,EAAM,CACnD,GAAID,EAAaC,CAAI,IAAM,QACzB,MAAM,IAAI,MAAM8sB,EAAS,2CAA2C,CAExE,EACMmB,GAAc,SAAUnB,EAAQoB,EAAW,CAE/C,IAAMzvB,EAAayvB,EAAU,KAAK,SAAS,EAC3C,GAAM,OAAOA,EAAU,SAAS,MAAS,UAAaA,EAAU,SAAS,KAAK,SAAW,GAAK,CAACzB,GAAWyB,EAAU,SAAS,SAAS,GAAKA,EAAU,SAAS,KAAK,MAAM,GAAG,EAAE,CAAC,IAAM,aAAezvB,EAAW,SAAW,GAAK,CAACkuB,GAAsBluB,CAAU,EAC9P,MAAM,IAAI,MAAMwuB,GAAYH,EAAQ,KAAK,EAAI,qFAA2F,CAE5I,EA+BA,IAAMqB,GAAN,KAAiB,CACf,aAAc,CACZ,KAAK,YAAc,CAAC,EAIpB,KAAK,gBAAkB,CACzB,CACF,EAIA,SAASC,GAAsBC,EAAYC,EAAe,CAExD,IAAIC,EAAW,KACf,QAAS,EAAI,EAAG,EAAID,EAAc,OAAQ,IAAK,CAC7C,IAAMz+B,EAAOy+B,EAAc,CAAC,EACtBtuB,EAAOnQ,EAAK,QAAQ,EACtB0+B,IAAa,MAAQ,CAAC/sB,GAAWxB,EAAMuuB,EAAS,IAAI,IACtDF,EAAW,YAAY,KAAKE,CAAQ,EACpCA,EAAW,MAETA,IAAa,OACfA,EAAW,CACT,OAAQ,CAAC,EACT,KAAAvuB,CACF,GAEFuuB,EAAS,OAAO,KAAK1+B,CAAI,CAC3B,CACI0+B,GACFF,EAAW,YAAY,KAAKE,CAAQ,CAExC,CAUA,SAASC,GAA4BH,EAAYruB,EAAMsuB,EAAe,CACpEF,GAAsBC,EAAYC,CAAa,EAC/CG,GAA6CJ,EAAYK,GAAaltB,GAAWktB,EAAW1uB,CAAI,CAAC,CACnG,CAUA,SAAS2uB,EAAoCN,EAAYO,EAAaN,EAAe,CACnFF,GAAsBC,EAAYC,CAAa,EAC/CG,GAA6CJ,EAAYK,GAAa/sB,EAAa+sB,EAAWE,CAAW,GAAKjtB,EAAaitB,EAAaF,CAAS,CAAC,CACpJ,CACA,SAASD,GAA6CJ,EAAY/U,EAAW,CAC3E+U,EAAW,kBACX,IAAIQ,EAAU,GACd,QAAS,EAAI,EAAG,EAAIR,EAAW,YAAY,OAAQ,IAAK,CACtD,IAAMS,EAAYT,EAAW,YAAY,CAAC,EAC1C,GAAIS,EAAW,CACb,IAAMJ,EAAYI,EAAU,KACxBxV,EAAUoV,CAAS,GACrBK,GAAeV,EAAW,YAAY,CAAC,CAAC,EACxCA,EAAW,YAAY,CAAC,EAAI,MAE5BQ,EAAU,EAEd,CACF,CACIA,IACFR,EAAW,YAAc,CAAC,GAE5BA,EAAW,iBACb,CAIA,SAASU,GAAeD,EAAW,CACjC,QAASlgC,EAAI,EAAGA,EAAIkgC,EAAU,OAAO,OAAQlgC,IAAK,CAChD,IAAMuQ,EAAY2vB,EAAU,OAAOlgC,CAAC,EACpC,GAAIuQ,IAAc,KAAM,CACtB2vB,EAAU,OAAOlgC,CAAC,EAAI,KACtB,IAAMogC,EAAU7vB,EAAU,eAAe,EACrCrQ,IACFO,EAAI,UAAY8P,EAAU,SAAS,CAAC,EAEtCvM,GAAeo8B,CAAO,CACxB,CACF,CACF,CAkBA,IAAMC,GAAmB,iBAMnBC,GAA0B,GAI1BC,GAAN,KAAW,CACT,YAAYjyB,EAAWkyB,EAAkB9rB,EAAoB+rB,EAAmB,CAC9E,KAAK,UAAYnyB,EACjB,KAAK,iBAAmBkyB,EACxB,KAAK,mBAAqB9rB,EAC1B,KAAK,kBAAoB+rB,EACzB,KAAK,gBAAkB,EACvB,KAAK,eAAiB,KACtB,KAAK,YAAc,IAAIlB,GACvB,KAAK,aAAe,EACpB,KAAK,6BAA+B,KAEpC,KAAK,cAAgBvZ,GAAsB,EAE3C,KAAK,sBAAwB,IAAIwW,GAEjC,KAAK,sBAAwB,KAE7B,KAAK,IAAM,KAAK,UAAU,YAAY,CACxC,CAIA,UAAW,CACT,OAAQ,KAAK,UAAU,OAAS,WAAa,WAAa,KAAK,UAAU,IAC3E,CACF,EACA,SAASkE,GAAUC,EAAMC,EAAOC,EAAc,CAE5C,GADAF,EAAK,OAASn5B,GAA0Bm5B,EAAK,SAAS,EAClDA,EAAK,kBAAoBz8B,GAAa,EACxCy8B,EAAK,QAAU,IAAIpb,GAAmBob,EAAK,UAAW,CAAC9wB,EAAY5O,EAAM6/B,EAASxrB,IAAQ,CACxFyrB,GAAiBJ,EAAM9wB,EAAY5O,EAAM6/B,EAASxrB,CAAG,CACvD,EAAGqrB,EAAK,mBAAoBA,EAAK,iBAAiB,EAElD,WAAW,IAAMK,GAAoBL,EAA0B,EAAI,EAAG,CAAC,MAClE,CAEL,GAAI,OAAOE,EAAiB,KAAeA,IAAiB,KAAM,CAChE,GAAI,OAAOA,GAAiB,SAC1B,MAAM,IAAI,MAAM,oEAAoE,EAEtF,GAAI,CACFriC,EAAUqiC,CAAY,CACxB,OAAS79B,EAAG,CACV,MAAM,IAAI,MAAM,kCAAoCA,CAAC,CACvD,CACF,CACA29B,EAAK,sBAAwB,IAAIrsB,GAAqBqsB,EAAK,UAAWC,EAAO,CAAC/wB,EAAY5O,EAAM6/B,EAASxrB,IAAQ,CAC/GyrB,GAAiBJ,EAAM9wB,EAAY5O,EAAM6/B,EAASxrB,CAAG,CACvD,EAAG2rB,GAAiB,CAClBD,GAAoBL,EAAMM,CAAa,CACzC,EAAGrV,GAAW,CACZsV,GAAuBP,EAAM/U,CAAO,CACtC,EAAG+U,EAAK,mBAAoBA,EAAK,kBAAmBE,CAAY,EAChEF,EAAK,QAAUA,EAAK,qBACtB,CACAA,EAAK,mBAAmB,uBAAuB3wB,GAAS,CACtD2wB,EAAK,QAAQ,iBAAiB3wB,CAAK,CACrC,CAAC,EACD2wB,EAAK,kBAAkB,uBAAuBlqB,GAAU,CACtDkqB,EAAK,QAAQ,qBAAqBlqB,EAAO,KAAK,CAChD,CAAC,EAGDkqB,EAAK,eAAiBj5B,GAAgCi5B,EAAK,UAAW,IAAM,IAAI3Z,GAAc2Z,EAAK,OAAQA,EAAK,OAAO,CAAC,EAExHA,EAAK,UAAY,IAAI7a,GACrB6a,EAAK,cAAgB,IAAI3J,GAAS,CAChC,eAAgB,CAACtzB,EAAO4R,EAAKD,EAAevF,IAAe,CACzD,IAAIqxB,EAAa,CAAC,EACZ9oB,EAAOsoB,EAAK,UAAU,QAAQj9B,EAAM,KAAK,EAG/C,OAAK2U,EAAK,QAAQ,IAChB8oB,EAAa1J,GAA6BkJ,EAAK,cAAej9B,EAAM,MAAO2U,CAAI,EAC/E,WAAW,IAAM,CACfvI,EAAW,IAAI,CACjB,EAAG,CAAC,GAECqxB,CACT,EACA,cAAe,IAAM,CAAC,CACxB,CAAC,EACDC,GAAeT,EAAM,YAAa,EAAK,EACvCA,EAAK,gBAAkB,IAAI3J,GAAS,CAClC,eAAgB,CAACtzB,EAAO4R,EAAKD,EAAevF,KAC1C6wB,EAAK,QAAQ,OAAOj9B,EAAO2R,EAAeC,EAAK,CAACK,EAAQ1U,IAAS,CAC/D,IAAM6nB,EAAShZ,EAAW6F,EAAQ1U,CAAI,EACtC8+B,EAAoCY,EAAK,YAAaj9B,EAAM,MAAOolB,CAAM,CAC3E,CAAC,EAEM,CAAC,GAEV,cAAe,CAACplB,EAAO4R,IAAQ,CAC7BqrB,EAAK,QAAQ,SAASj9B,EAAO4R,CAAG,CAClC,CACF,CAAC,CACH,CAIA,SAAS+rB,GAAeV,EAAM,CAE5B,IAAMW,EADaX,EAAK,UAAU,QAAQ,IAAI7vB,EAAK,wBAAwB,CAAC,EAClD,IAAI,GAAK,EACnC,OAAO,IAAI,KAAK,EAAE,QAAQ,EAAIwwB,CAChC,CAIA,SAASC,GAAyBZ,EAAM,CACtC,OAAOlF,GAAmB,CACxB,UAAW4F,GAAeV,CAAI,CAChC,CAAC,CACH,CAIA,SAASI,GAAiBJ,EAAM9wB,EAAY5O,EAAM6/B,EAASxrB,EAAK,CAE9DqrB,EAAK,kBACL,IAAMvvB,EAAO,IAAIN,EAAKjB,CAAU,EAChC5O,EAAO0/B,EAAK,6BAA+BA,EAAK,6BAA6B9wB,EAAY5O,CAAI,EAAIA,EACjG,IAAI6nB,EAAS,CAAC,EACd,GAAIxT,EACF,GAAIwrB,EAAS,CACX,IAAMU,EAAiB3pB,GAAI5W,EAAMwgC,GAAO5gB,EAAa4gB,CAAG,CAAC,EACzD3Y,EAASwQ,GAA8BqH,EAAK,gBAAiBvvB,EAAMowB,EAAgBlsB,CAAG,CACxF,KAAO,CACL,IAAMosB,EAAa7gB,EAAa5f,CAAI,EACpC6nB,EAASuQ,GAAkCsH,EAAK,gBAAiBvvB,EAAMswB,EAAYpsB,CAAG,CACxF,SACSwrB,EAAS,CAClB,IAAMhU,EAAkBjV,GAAI5W,EAAMwgC,GAAO5gB,EAAa4gB,CAAG,CAAC,EAC1D3Y,EAAS4O,GAAyBiJ,EAAK,gBAAiBvvB,EAAM0b,CAAe,CAC/E,KAAO,CACL,IAAMvL,EAAOV,EAAa5f,CAAI,EAC9B6nB,EAAS2O,GAA6BkJ,EAAK,gBAAiBvvB,EAAMmQ,CAAI,CACxE,CACA,IAAIgB,EAAenR,EACf0X,EAAO,OAAS,IAGlBvG,EAAeof,GAAsBhB,EAAMvvB,CAAI,GAEjD2uB,EAAoCY,EAAK,YAAape,EAAcuG,CAAM,CAC5E,CACA,SAASkY,GAAoBL,EAAMM,EAAe,CAChDG,GAAeT,EAAM,YAAaM,CAAa,EAC3CA,IAAkB,IACpBW,GAA0BjB,CAAI,CAElC,CACA,SAASO,GAAuBP,EAAM/U,EAAS,CAC7ClpB,EAAKkpB,EAAS,CAACttB,EAAKC,IAAU,CAC5B6iC,GAAeT,EAAMriC,EAAKC,CAAK,CACjC,CAAC,CACH,CACA,SAAS6iC,GAAeT,EAAM9wB,EAAYtR,EAAO,CAC/C,IAAM6S,EAAO,IAAIN,EAAK,UAAYjB,CAAU,EACtC2I,EAAUqI,EAAatiB,CAAK,EAClCoiC,EAAK,UAAU,eAAevvB,EAAMoH,CAAO,EAC3C,IAAMsQ,EAAS2O,GAA6BkJ,EAAK,cAAevvB,EAAMoH,CAAO,EAC7EunB,EAAoCY,EAAK,YAAavvB,EAAM0X,CAAM,CACpE,CACA,SAAS+Y,GAAmBlB,EAAM,CAChC,OAAOA,EAAK,cACd,CAgBA,SAASmB,GAAanB,EAAMj9B,EAAOixB,EAAmB,CAEpD,IAAMoN,EAAS9H,GAAuB0G,EAAK,gBAAiBj9B,CAAK,EACjE,OAAIq+B,GAAU,KACL,QAAQ,QAAQA,CAAM,EAExBpB,EAAK,QAAQ,IAAIj9B,CAAK,EAAE,KAAK8L,GAAW,CAC7C,IAAM6I,EAAOwI,EAAarR,CAAO,EAAE,UAAU9L,EAAM,aAAa,SAAS,CAAC,EAQ1E61B,GAA6BoH,EAAK,gBAAiBj9B,EAAOixB,EAAmB,EAAI,EACjF,IAAI7L,EACJ,GAAIplB,EAAM,aAAa,aAAa,EAClColB,EAAS2O,GAA6BkJ,EAAK,gBAAiBj9B,EAAM,MAAO2U,CAAI,MACxE,CACL,IAAM/C,EAAM0jB,GAAoB2H,EAAK,gBAAiBj9B,CAAK,EAC3DolB,EAASuQ,GAAkCsH,EAAK,gBAAiBj9B,EAAM,MAAO2U,EAAM/C,CAAG,CACzF,CAWA,OAAAyqB,EAAoCY,EAAK,YAAaj9B,EAAM,MAAOolB,CAAM,EACzEsP,GAAgCuI,EAAK,gBAAiBj9B,EAAOixB,EAAmB,KAAM,EAAI,EACnFtc,CACT,EAAG2pB,IACDC,GAAQtB,EAAM,iBAAmBniC,EAAUkF,CAAK,EAAI,YAAcs+B,CAAG,EAC9D,QAAQ,OAAO,IAAI,MAAMA,CAAG,CAAC,EACrC,CACH,CACA,SAASE,GAAoBvB,EAAMvvB,EAAM+wB,EAAQ5iB,EAAazP,EAAY,CACxEmyB,GAAQtB,EAAM,MAAO,CACnB,KAAMvvB,EAAK,SAAS,EACpB,MAAO+wB,EACP,SAAU5iB,CACZ,CAAC,EAGD,IAAMsc,EAAe0F,GAAyBZ,CAAI,EAC5CyB,EAAoBvhB,EAAashB,EAAQ5iB,CAAW,EACpD0V,EAAW+E,GAA+B2G,EAAK,gBAAiBvvB,CAAI,EACpEoH,EAAU4jB,GAA6BgG,EAAmBnN,EAAU4G,CAAY,EAChFjP,EAAUiV,GAAmBlB,CAAI,EACjC7X,EAASoO,GAA2ByJ,EAAK,gBAAiBvvB,EAAMoH,EAASoU,EAAS,EAAI,EAC5F4S,GAAsBmB,EAAK,YAAa7X,CAAM,EAC9C6X,EAAK,QAAQ,IAAIvvB,EAAK,SAAS,EAAGgxB,EAAkB,IAAe,EAAI,EAAG,CAACzsB,EAAQe,IAAgB,CACjG,IAAM2rB,EAAU1sB,IAAW,KACtB0sB,GACHvhC,EAAK,UAAYsQ,EAAO,YAAcuE,CAAM,EAE9C,IAAM2sB,EAAc9K,GAAqBmJ,EAAK,gBAAiB/T,EAAS,CAACyV,CAAO,EAChFtC,EAAoCY,EAAK,YAAavvB,EAAMkxB,CAAW,EACvEC,GAA2B5B,EAAM7wB,EAAY6F,EAAQe,CAAW,CAClE,CAAC,EACD,IAAM6L,EAAeigB,GAAsB7B,EAAMvvB,CAAI,EACrDuwB,GAAsBhB,EAAMpe,CAAY,EAExCwd,EAAoCY,EAAK,YAAape,EAAc,CAAC,CAAC,CACxE,CACA,SAASkgB,GAAW9B,EAAMvvB,EAAMsxB,EAAiB5yB,EAAY,CAC3DmyB,GAAQtB,EAAM,SAAU,CACtB,KAAMvvB,EAAK,SAAS,EACpB,MAAOsxB,CACT,CAAC,EAED,IAAIC,EAAQ,GACN9G,EAAe0F,GAAyBZ,CAAI,EAC5C7T,EAAkB,CAAC,EAKzB,GAJApqB,EAAKggC,EAAiB,CAACE,EAAYC,IAAiB,CAClDF,EAAQ,GACR7V,EAAgB8V,CAAU,EAAI1G,GAAyBrqB,EAAUT,EAAMwxB,CAAU,EAAG/hB,EAAagiB,CAAY,EAAGlC,EAAK,gBAAiB9E,CAAY,CACpJ,CAAC,EACI8G,EAqBHliC,EAAI,sDAAsD,EAC1D8hC,GAA2B5B,EAAM7wB,EAAY,KAAM,MAAS,MAtBlD,CACV,IAAM8c,EAAUiV,GAAmBlB,CAAI,EACjC7X,EAASwO,GAAuBqJ,EAAK,gBAAiBvvB,EAAM0b,EAAiBF,CAAO,EAC1F4S,GAAsBmB,EAAK,YAAa7X,CAAM,EAC9C6X,EAAK,QAAQ,MAAMvvB,EAAK,SAAS,EAAGsxB,EAAiB,CAAC/sB,EAAQe,IAAgB,CAC5E,IAAM2rB,EAAU1sB,IAAW,KACtB0sB,GACHvhC,EAAK,aAAesQ,EAAO,YAAcuE,CAAM,EAEjD,IAAM2sB,EAAc9K,GAAqBmJ,EAAK,gBAAiB/T,EAAS,CAACyV,CAAO,EAC1E9f,EAAe+f,EAAY,OAAS,EAAIX,GAAsBhB,EAAMvvB,CAAI,EAAIA,EAClF2uB,EAAoCY,EAAK,YAAape,EAAc+f,CAAW,EAC/EC,GAA2B5B,EAAM7wB,EAAY6F,EAAQe,CAAW,CAClE,CAAC,EACDhU,EAAKggC,EAAiB1C,GAAe,CACnC,IAAMzd,EAAeigB,GAAsB7B,EAAM9uB,EAAUT,EAAM4uB,CAAW,CAAC,EAC7E2B,GAAsBhB,EAAMpe,CAAY,CAC1C,CAAC,EAEDwd,EAAoCY,EAAK,YAAavvB,EAAM,CAAC,CAAC,CAChE,CAIF,CAIA,SAASwwB,GAA0BjB,EAAM,CACvCsB,GAAQtB,EAAM,oBAAoB,EAClC,IAAM9E,EAAe0F,GAAyBZ,CAAI,EAC5CmC,EAA2B9c,GAAsB,EACvDK,GAA8Bsa,EAAK,cAAezvB,EAAa,EAAG,CAACE,EAAMiH,IAAS,CAChF,IAAM0qB,EAAW7G,GAAyB9qB,EAAMiH,EAAMsoB,EAAK,gBAAiB9E,CAAY,EACxF5V,GAA2B6c,EAA0B1xB,EAAM2xB,CAAQ,CACrE,CAAC,EACD,IAAIja,EAAS,CAAC,EACdzC,GAA8Byc,EAA0B5xB,EAAa,EAAG,CAACE,EAAMmQ,IAAS,CACtFuH,EAASA,EAAO,OAAO2O,GAA6BkJ,EAAK,gBAAiBvvB,EAAMmQ,CAAI,CAAC,EACrF,IAAMgB,EAAeigB,GAAsB7B,EAAMvvB,CAAI,EACrDuwB,GAAsBhB,EAAMpe,CAAY,CAC1C,CAAC,EACDoe,EAAK,cAAgB3a,GAAsB,EAC3C+Z,EAAoCY,EAAK,YAAazvB,EAAa,EAAG4X,CAAM,CAC9E,CACA,SAASka,GAAuBrC,EAAMvvB,EAAMtB,EAAY,CACtD6wB,EAAK,QAAQ,mBAAmBvvB,EAAK,SAAS,EAAG,CAACuE,EAAQe,IAAgB,CACpEf,IAAW,MACbwQ,GAAyBwa,EAAK,cAAevvB,CAAI,EAEnDmxB,GAA2B5B,EAAM7wB,EAAY6F,EAAQe,CAAW,CAClE,CAAC,CACH,CACA,SAASusB,GAAoBtC,EAAMvvB,EAAM7S,EAAOuR,EAAY,CAC1D,IAAM0I,EAAUqI,EAAatiB,CAAK,EAClCoiC,EAAK,QAAQ,gBAAgBvvB,EAAK,SAAS,EAAGoH,EAAQ,IAAe,EAAI,EAAG,CAAC7C,EAAQe,IAAgB,CAC/Ff,IAAW,MACbsQ,GAA2B0a,EAAK,cAAevvB,EAAMoH,CAAO,EAE9D+pB,GAA2B5B,EAAM7wB,EAAY6F,EAAQe,CAAW,CAClE,CAAC,CACH,CACA,SAASwsB,GAAgCvC,EAAMvvB,EAAM7S,EAAOkc,EAAU3K,EAAY,CAChF,IAAM0I,EAAUqI,EAAatiB,EAAOkc,CAAQ,EAC5CkmB,EAAK,QAAQ,gBAAgBvvB,EAAK,SAAS,EAAGoH,EAAQ,IAAe,EAAI,EAAG,CAAC7C,EAAQe,IAAgB,CAC/Ff,IAAW,MACbsQ,GAA2B0a,EAAK,cAAevvB,EAAMoH,CAAO,EAE9D+pB,GAA2B5B,EAAM7wB,EAAY6F,EAAQe,CAAW,CAClE,CAAC,CACH,CACA,SAASysB,GAAuBxC,EAAMvvB,EAAMsxB,EAAiB5yB,EAAY,CACvE,GAAIyH,GAAQmrB,CAAe,EAAG,CAC5BjiC,EAAI,qEAAqE,EACzE8hC,GAA2B5B,EAAM7wB,EAAY,KAAM,MAAS,EAC5D,MACF,CACA6wB,EAAK,QAAQ,kBAAkBvvB,EAAK,SAAS,EAAGsxB,EAAiB,CAAC/sB,EAAQe,IAAgB,CACpFf,IAAW,MACbjT,EAAKggC,EAAiB,CAACznB,EAAWC,IAAc,CAC9C,IAAMC,EAAe0F,EAAa3F,CAAS,EAC3C+K,GAA2B0a,EAAK,cAAe9uB,EAAUT,EAAM6J,CAAS,EAAGE,CAAY,CACzF,CAAC,EAEHonB,GAA2B5B,EAAM7wB,EAAY6F,EAAQe,CAAW,CAClE,CAAC,CACH,CACA,SAAS0sB,GAA6BzC,EAAMj9B,EAAOixB,EAAmB,CACpE,IAAI7L,EACA3X,EAAazN,EAAM,KAAK,IAAM,QAChColB,EAASyQ,GAA6BoH,EAAK,cAAej9B,EAAOixB,CAAiB,EAElF7L,EAASyQ,GAA6BoH,EAAK,gBAAiBj9B,EAAOixB,CAAiB,EAEtFiL,GAA4Be,EAAK,YAAaj9B,EAAM,MAAOolB,CAAM,CACnE,CACA,SAASua,GAAgC1C,EAAMj9B,EAAOixB,EAAmB,CAGvE,IAAI7L,EACA3X,EAAazN,EAAM,KAAK,IAAM,QAChColB,EAASsP,GAAgCuI,EAAK,cAAej9B,EAAOixB,CAAiB,EAErF7L,EAASsP,GAAgCuI,EAAK,gBAAiBj9B,EAAOixB,CAAiB,EAEzFiL,GAA4Be,EAAK,YAAaj9B,EAAM,MAAOolB,CAAM,CACnE,CACA,SAASwa,GAAc3C,EAAM,CACvBA,EAAK,uBACPA,EAAK,sBAAsB,UAAUN,EAAgB,CAEzD,CACA,SAASkD,GAAW5C,EAAM,CACpBA,EAAK,uBACPA,EAAK,sBAAsB,OAAON,EAAgB,CAEtD,CACA,SAAS4B,GAAQtB,KAAS7gC,EAAS,CACjC,IAAIa,EAAS,GACTggC,EAAK,wBACPhgC,EAASggC,EAAK,sBAAsB,GAAK,KAE3ClgC,EAAIE,EAAQ,GAAGb,CAAO,CACxB,CACA,SAASyiC,GAA2B5B,EAAM54B,EAAU4N,EAAQe,EAAa,CACnE3O,GACF/D,GAAe,IAAM,CACnB,GAAI2R,IAAW,KACb5N,EAAS,IAAI,MACR,CACL,IAAMtE,GAAQkS,GAAU,SAAS,YAAY,EACzC5V,EAAU0D,EACViT,IACF3W,GAAW,KAAO2W,GAEpB,IAAM9V,EAAQ,IAAI,MAAMb,CAAO,EAE/Ba,EAAM,KAAO6C,EACbsE,EAASnH,CAAK,CAChB,CACF,CAAC,CAEL,CAYA,SAAS4iC,GAAqB7C,EAAMvvB,EAAMqyB,EAAmB3zB,EAAY4zB,EAAWC,EAAc,CAChG1B,GAAQtB,EAAM,kBAAoBvvB,CAAI,EAEtC,IAAMwyB,EAAc,CAClB,KAAAxyB,EACA,OAAQqyB,EACR,WAAA3zB,EAEA,OAAQ,KAGR,MAAO1Q,GAAc,EAErB,aAAAukC,EAEA,WAAY,EAEZ,UAAAD,EAEA,YAAa,KACb,eAAgB,KAChB,qBAAsB,KACtB,yBAA0B,KAC1B,8BAA+B,IACjC,EAEMG,EAAeC,GAAmBnD,EAAMvvB,EAAM,MAAS,EAC7DwyB,EAAY,qBAAuBC,EACnC,IAAM1B,EAASyB,EAAY,OAAOC,EAAa,IAAI,CAAC,EACpD,GAAI1B,IAAW,OAEbyB,EAAY,UAAU,EACtBA,EAAY,yBAA2B,KACvCA,EAAY,8BAAgC,KACxCA,EAAY,YACdA,EAAY,WAAW,KAAM,GAAOA,EAAY,oBAAoB,MAEjE,CACLxF,GAAqB,qCAAsC+D,EAAQyB,EAAY,IAAI,EAEnFA,EAAY,OAAS,EACrB,IAAMG,EAAYrH,GAAYiE,EAAK,sBAAuBvvB,CAAI,EACxD4yB,EAAYpH,GAAamH,CAAS,GAAK,CAAC,EAC9CC,EAAU,KAAKJ,CAAW,EAC1B/G,GAAakH,EAAWC,CAAS,EAKjC,IAAIC,EACA,OAAO9B,GAAW,UAAYA,IAAW,MAAQvjC,EAASujC,EAAQ,WAAW,GAE/E8B,EAAkBpuB,GAAQssB,EAAQ,WAAW,EAC7C5hC,EAAOy9B,GAAgBiG,CAAe,EAAG,kHAAuH,GAGhKA,GADoBjK,GAA+B2G,EAAK,gBAAiBvvB,CAAI,GAAK+N,EAAa,YACjE,YAAY,EAAE,IAAI,EAElD,IAAM0c,EAAe0F,GAAyBZ,CAAI,EAC5CyB,EAAoBvhB,EAAashB,EAAQ8B,CAAe,EACxDzrB,EAAU4jB,GAA6BgG,EAAmByB,EAAchI,CAAY,EAC1F+H,EAAY,yBAA2BxB,EACvCwB,EAAY,8BAAgCprB,EAC5CorB,EAAY,eAAiB/B,GAAmBlB,CAAI,EACpD,IAAM7X,EAASoO,GAA2ByJ,EAAK,gBAAiBvvB,EAAMoH,EAASorB,EAAY,eAAgBA,EAAY,YAAY,EACnI7D,EAAoCY,EAAK,YAAavvB,EAAM0X,CAAM,EAClEob,GAA0BvD,EAAMA,EAAK,qBAAqB,CAC5D,CACF,CAIA,SAASmD,GAAmBnD,EAAMvvB,EAAM+yB,EAAa,CACnD,OAAOnK,GAA+B2G,EAAK,gBAAiBvvB,EAAM+yB,CAAW,GAAKhlB,EAAa,UACjG,CAUA,SAAS+kB,GAA0BvD,EAAMtoB,EAAOsoB,EAAK,sBAAuB,CAK1E,GAHKtoB,GACH+rB,GAAwCzD,EAAMtoB,CAAI,EAEhDukB,GAAavkB,CAAI,EAAG,CACtB,IAAMgsB,EAAQC,GAA0B3D,EAAMtoB,CAAI,EAClD9X,EAAO8jC,EAAM,OAAS,EAAG,uCAAuC,EACjDA,EAAM,MAAMT,GAAeA,EAAY,SAAW,CAA6B,GAG5FW,GAAyB5D,EAAMrD,GAAYjlB,CAAI,EAAGgsB,CAAK,CAE3D,MAAWtH,GAAgB1kB,CAAI,GAC7B4kB,GAAiB5kB,EAAM6C,GAAa,CAClCgpB,GAA0BvD,EAAMzlB,CAAS,CAC3C,CAAC,CAEL,CAQA,SAASqpB,GAAyB5D,EAAMvvB,EAAMizB,EAAO,CAEnD,IAAMG,EAAeH,EAAM,IAAII,GACtBA,EAAI,cACZ,EACKC,EAAcZ,GAAmBnD,EAAMvvB,EAAMozB,CAAY,EAC3DG,EAAaD,EACXE,EAAaF,EAAY,KAAK,EACpC,QAAS1kC,EAAI,EAAGA,EAAIqkC,EAAM,OAAQrkC,IAAK,CACrC,IAAMykC,EAAMJ,EAAMrkC,CAAC,EACnBO,EAAOkkC,EAAI,SAAW,EAA+B,+DAA+D,EACpHA,EAAI,OAAS,EACbA,EAAI,aACJ,IAAMha,EAAexY,EAAgBb,EAAMqzB,EAAI,IAAI,EAEnDE,EAAaA,EAAW,YAAYla,EAAmCga,EAAI,wBAAwB,CACrG,CACA,IAAMI,EAAaF,EAAW,IAAI,EAAI,EAChCG,EAAa1zB,EAEnBuvB,EAAK,QAAQ,IAAImE,EAAW,SAAS,EAAGD,EAAYlvB,GAAU,CAC5DssB,GAAQtB,EAAM,2BAA4B,CACxC,KAAMmE,EAAW,SAAS,EAC1B,OAAAnvB,CACF,CAAC,EACD,IAAImT,EAAS,CAAC,EACd,GAAInT,IAAW,KAAM,CAInB,IAAMovB,EAAY,CAAC,EACnB,QAAS/kC,EAAI,EAAGA,EAAIqkC,EAAM,OAAQrkC,IAChCqkC,EAAMrkC,CAAC,EAAE,OAAS,EAClB8oB,EAASA,EAAO,OAAO0O,GAAqBmJ,EAAK,gBAAiB0D,EAAMrkC,CAAC,EAAE,cAAc,CAAC,EACtFqkC,EAAMrkC,CAAC,EAAE,YAGX+kC,EAAU,KAAK,IAAMV,EAAMrkC,CAAC,EAAE,WAAW,KAAM,GAAMqkC,EAAMrkC,CAAC,EAAE,6BAA6B,CAAC,EAE9FqkC,EAAMrkC,CAAC,EAAE,UAAU,EAGrBokC,GAAwCzD,EAAMjE,GAAYiE,EAAK,sBAAuBvvB,CAAI,CAAC,EAE3F8yB,GAA0BvD,EAAMA,EAAK,qBAAqB,EAC1DZ,EAAoCY,EAAK,YAAavvB,EAAM0X,CAAM,EAElE,QAAS9oB,EAAI,EAAGA,EAAI+kC,EAAU,OAAQ/kC,IACpCgE,GAAe+gC,EAAU/kC,CAAC,CAAC,CAE/B,KAAO,CAEL,GAAI2V,IAAW,YACb,QAAS3V,EAAI,EAAGA,EAAIqkC,EAAM,OAAQrkC,IAC5BqkC,EAAMrkC,CAAC,EAAE,SAAW,EACtBqkC,EAAMrkC,CAAC,EAAE,OAAS,EAElBqkC,EAAMrkC,CAAC,EAAE,OAAS,MAGjB,CACLc,EAAK,kBAAoBgkC,EAAW,SAAS,EAAI,YAAcnvB,CAAM,EACrE,QAAS3V,EAAI,EAAGA,EAAIqkC,EAAM,OAAQrkC,IAChCqkC,EAAMrkC,CAAC,EAAE,OAAS,EAClBqkC,EAAMrkC,CAAC,EAAE,YAAc2V,CAE3B,CACAgsB,GAAsBhB,EAAMvvB,CAAI,CAClC,CACF,EAAGwzB,CAAU,CACf,CAYA,SAASjD,GAAsBhB,EAAMX,EAAa,CAChD,IAAMgF,EAA0BC,GAA+BtE,EAAMX,CAAW,EAC1E5uB,EAAOksB,GAAY0H,CAAuB,EAC1CX,EAAQC,GAA0B3D,EAAMqE,CAAuB,EACrE,OAAAE,GAA0BvE,EAAM0D,EAAOjzB,CAAI,EACpCA,CACT,CAQA,SAAS8zB,GAA0BvE,EAAM0D,EAAOjzB,EAAM,CACpD,GAAIizB,EAAM,SAAW,EACnB,OAKF,IAAMU,EAAY,CAAC,EACfjc,EAAS,CAAC,EAKR0b,EAHcH,EAAM,OAAO3sB,GACxBA,EAAE,SAAW,CACrB,EACgC,IAAIA,GAC5BA,EAAE,cACV,EACD,QAAS1X,EAAI,EAAGA,EAAIqkC,EAAM,OAAQrkC,IAAK,CACrC,IAAM4jC,EAAcS,EAAMrkC,CAAC,EACrByqB,EAAexY,EAAgBb,EAAMwyB,EAAY,IAAI,EACvDuB,EAAmB,GACrBC,EAEF,GADA7kC,EAAOkqB,IAAiB,KAAM,+DAA+D,EACzFmZ,EAAY,SAAW,EACzBuB,EAAmB,GACnBC,EAAcxB,EAAY,YAC1B9a,EAASA,EAAO,OAAO0O,GAAqBmJ,EAAK,gBAAiBiD,EAAY,eAAgB,EAAI,CAAC,UAC1FA,EAAY,SAAW,EAChC,GAAIA,EAAY,YAActD,GAC5B6E,EAAmB,GACnBC,EAAc,WACdtc,EAASA,EAAO,OAAO0O,GAAqBmJ,EAAK,gBAAiBiD,EAAY,eAAgB,EAAI,CAAC,MAC9F,CAEL,IAAMyB,EAAcvB,GAAmBnD,EAAMiD,EAAY,KAAMY,CAAY,EAC3EZ,EAAY,qBAAuByB,EACnC,IAAMjO,EAAUiN,EAAMrkC,CAAC,EAAE,OAAOqlC,EAAY,IAAI,CAAC,EACjD,GAAIjO,IAAY,OAAW,CACzBgH,GAAqB,qCAAsChH,EAASwM,EAAY,IAAI,EACpF,IAAI0B,EAAczkB,EAAauW,CAAO,EACV,OAAOA,GAAY,UAAYA,GAAW,MAAQx4B,EAASw4B,EAAS,WAAW,IAGzGkO,EAAcA,EAAY,eAAeD,EAAY,YAAY,CAAC,GAEpE,IAAME,EAAa3B,EAAY,eACzB/H,GAAe0F,GAAyBZ,CAAI,EAC5C6E,GAAkBpJ,GAA6BkJ,EAAaD,EAAaxJ,EAAY,EAC3F+H,EAAY,yBAA2B0B,EACvC1B,EAAY,8BAAgC4B,GAC5C5B,EAAY,eAAiB/B,GAAmBlB,CAAI,EAEpD6D,EAAa,OAAOA,EAAa,QAAQe,CAAU,EAAG,CAAC,EACvDzc,EAASA,EAAO,OAAOoO,GAA2ByJ,EAAK,gBAAiBiD,EAAY,KAAM4B,GAAiB5B,EAAY,eAAgBA,EAAY,YAAY,CAAC,EAChK9a,EAASA,EAAO,OAAO0O,GAAqBmJ,EAAK,gBAAiB4E,EAAY,EAAI,CAAC,CACrF,MACEJ,EAAmB,GACnBC,EAAc,SACdtc,EAASA,EAAO,OAAO0O,GAAqBmJ,EAAK,gBAAiBiD,EAAY,eAAgB,EAAI,CAAC,CAEvG,CAEF7D,EAAoCY,EAAK,YAAavvB,EAAM0X,CAAM,EAClEA,EAAS,CAAC,EACNqc,IAEFd,EAAMrkC,CAAC,EAAE,OAAS,EAIjB,SAAU0jC,EAAW,CACpB,WAAWA,EAAW,KAAK,MAAM,CAAC,CAAC,CACrC,EAAGW,EAAMrkC,CAAC,EAAE,SAAS,EACjBqkC,EAAMrkC,CAAC,EAAE,aACPolC,IAAgB,SAClBL,EAAU,KAAK,IAAMV,EAAMrkC,CAAC,EAAE,WAAW,KAAM,GAAOqkC,EAAMrkC,CAAC,EAAE,oBAAoB,CAAC,EAEpF+kC,EAAU,KAAK,IAAMV,EAAMrkC,CAAC,EAAE,WAAW,IAAI,MAAMolC,CAAW,EAAG,GAAO,IAAI,CAAC,GAIrF,CAEAhB,GAAwCzD,EAAMA,EAAK,qBAAqB,EAExE,QAAS3gC,EAAI,EAAGA,EAAI+kC,EAAU,OAAQ/kC,IACpCgE,GAAe+gC,EAAU/kC,CAAC,CAAC,EAG7BkkC,GAA0BvD,EAAMA,EAAK,qBAAqB,CAC5D,CASA,SAASsE,GAA+BtE,EAAMvvB,EAAM,CAClD,IAAIgK,EAGAqqB,EAAkB9E,EAAK,sBAE3B,IADAvlB,EAAQjK,EAAaC,CAAI,EAClBgK,IAAU,MAAQwhB,GAAa6I,CAAe,IAAM,QACzDA,EAAkB/I,GAAY+I,EAAiBrqB,CAAK,EACpDhK,EAAOE,EAAaF,CAAI,EACxBgK,EAAQjK,EAAaC,CAAI,EAE3B,OAAOq0B,CACT,CAQA,SAASnB,GAA0B3D,EAAM8E,EAAiB,CAExD,IAAMC,EAAmB,CAAC,EAC1B,OAAAC,GAAsChF,EAAM8E,EAAiBC,CAAgB,EAE7EA,EAAiB,KAAK,CAAChkC,EAAGC,IAAMD,EAAE,MAAQC,EAAE,KAAK,EAC1C+jC,CACT,CACA,SAASC,GAAsChF,EAAMtoB,EAAMgsB,EAAO,CAChE,IAAML,EAAYpH,GAAavkB,CAAI,EACnC,GAAI2rB,EACF,QAAShkC,EAAI,EAAGA,EAAIgkC,EAAU,OAAQhkC,IACpCqkC,EAAM,KAAKL,EAAUhkC,CAAC,CAAC,EAG3Bi9B,GAAiB5kB,EAAM/E,GAAS,CAC9BqyB,GAAsChF,EAAMrtB,EAAO+wB,CAAK,CAC1D,CAAC,CACH,CAIA,SAASD,GAAwCzD,EAAMtoB,EAAM,CAC3D,IAAMgsB,EAAQzH,GAAavkB,CAAI,EAC/B,GAAIgsB,EAAO,CACT,IAAIuB,EAAK,EACT,QAASC,EAAO,EAAGA,EAAOxB,EAAM,OAAQwB,IAClCxB,EAAMwB,CAAI,EAAE,SAAW,IACzBxB,EAAMuB,CAAE,EAAIvB,EAAMwB,CAAI,EACtBD,KAGJvB,EAAM,OAASuB,EACf/I,GAAaxkB,EAAMgsB,EAAM,OAAS,EAAIA,EAAQ,MAAS,CACzD,CACApH,GAAiB5kB,EAAM6C,GAAa,CAClCkpB,GAAwCzD,EAAMzlB,CAAS,CACzD,CAAC,CACH,CAQA,SAASsnB,GAAsB7B,EAAMvvB,EAAM,CACzC,IAAMmR,EAAe+a,GAAY2H,GAA+BtE,EAAMvvB,CAAI,CAAC,EACrEq0B,EAAkB/I,GAAYiE,EAAK,sBAAuBvvB,CAAI,EACpE,OAAAisB,GAAoBoI,EAAiBptB,GAAQ,CAC3CytB,GAA4BnF,EAAMtoB,CAAI,CACxC,CAAC,EACDytB,GAA4BnF,EAAM8E,CAAe,EACjDvI,GAAsBuI,EAAiBptB,GAAQ,CAC7CytB,GAA4BnF,EAAMtoB,CAAI,CACxC,CAAC,EACMkK,CACT,CAMA,SAASujB,GAA4BnF,EAAMtoB,EAAM,CAC/C,IAAMgsB,EAAQzH,GAAavkB,CAAI,EAC/B,GAAIgsB,EAAO,CAIT,IAAMU,EAAY,CAAC,EAGfjc,EAAS,CAAC,EACVid,EAAW,GACf,QAAS/lC,EAAI,EAAGA,EAAIqkC,EAAM,OAAQrkC,IAC5BqkC,EAAMrkC,CAAC,EAAE,SAAW,IAAsDqkC,EAAMrkC,CAAC,EAAE,SAAW,GAChGO,EAAOwlC,IAAa/lC,EAAI,EAAG,iDAAiD,EAC5E+lC,EAAW/lC,EAEXqkC,EAAMrkC,CAAC,EAAE,OAAS,EAClBqkC,EAAMrkC,CAAC,EAAE,YAAc,QAEvBO,EAAO8jC,EAAMrkC,CAAC,EAAE,SAAW,EAA+B,wCAAwC,EAElGqkC,EAAMrkC,CAAC,EAAE,UAAU,EACnB8oB,EAASA,EAAO,OAAO0O,GAAqBmJ,EAAK,gBAAiB0D,EAAMrkC,CAAC,EAAE,eAAgB,EAAI,CAAC,EAC5FqkC,EAAMrkC,CAAC,EAAE,YACX+kC,EAAU,KAAKV,EAAMrkC,CAAC,EAAE,WAAW,KAAK,KAAM,IAAI,MAAM,KAAK,EAAG,GAAO,IAAI,CAAC,IAI9E+lC,IAAa,GAEflJ,GAAaxkB,EAAM,MAAS,EAG5BgsB,EAAM,OAAS0B,EAAW,EAG5BhG,EAAoCY,EAAK,YAAarD,GAAYjlB,CAAI,EAAGyQ,CAAM,EAC/E,QAAS9oB,EAAI,EAAGA,EAAI+kC,EAAU,OAAQ/kC,IACpCgE,GAAe+gC,EAAU/kC,CAAC,CAAC,CAE/B,CACF,CAkBA,SAASgmC,GAAWn2B,EAAY,CAC9B,IAAIo2B,EAAoB,GAClBr0B,EAAS/B,EAAW,MAAM,GAAG,EACnC,QAAS,EAAI,EAAG,EAAI+B,EAAO,OAAQ,IACjC,GAAIA,EAAO,CAAC,EAAE,OAAS,EAAG,CACxB,IAAIs0B,EAAQt0B,EAAO,CAAC,EACpB,GAAI,CACFs0B,EAAQ,mBAAmBA,EAAM,QAAQ,MAAO,GAAG,CAAC,CACtD,MAAY,CAAC,CACbD,GAAqB,IAAMC,CAC7B,CAEF,OAAOD,CACT,CAIA,SAASE,GAAYC,EAAa,CAChC,IAAMC,EAAU,CAAC,EACbD,EAAY,OAAO,CAAC,IAAM,MAC5BA,EAAcA,EAAY,UAAU,CAAC,GAEvC,QAAWE,KAAWF,EAAY,MAAM,GAAG,EAAG,CAC5C,GAAIE,EAAQ,SAAW,EACrB,SAEF,IAAMC,EAAKD,EAAQ,MAAM,GAAG,EACxBC,EAAG,SAAW,EAChBF,EAAQ,mBAAmBE,EAAG,CAAC,CAAC,CAAC,EAAI,mBAAmBA,EAAG,CAAC,CAAC,EAE7DzlC,EAAK,0BAA0BwlC,CAAO,eAAeF,CAAW,GAAG,CAEvE,CACA,OAAOC,CACT,CACA,IAAMG,GAAgB,SAAUC,EAASngC,EAAW,CAClD,IAAMg5B,EAAYoH,GAAiBD,CAAO,EACxCrgC,EAAYk5B,EAAU,UACpBA,EAAU,SAAW,gBACvBz+B,EAAMy+B,EAAU,KAAO,4EAAiF,GAGrG,CAACl5B,GAAaA,IAAc,cAAgBk5B,EAAU,SAAW,aACpEz+B,EAAM,8EAA8E,EAEjFy+B,EAAU,QACbv+B,GAAmB,EAErB,IAAMsF,EAAgBi5B,EAAU,SAAW,MAAQA,EAAU,SAAW,MACxE,MAAO,CACL,SAAU,IAAIr5B,GAASq5B,EAAU,KAAMA,EAAU,OAAQl5B,EAAWC,EAAeC,EAA8B,GAAsCF,IAAck5B,EAAU,SAAS,EACxL,KAAM,IAAIxuB,EAAKwuB,EAAU,UAAU,CACrC,CACF,EACMoH,GAAmB,SAAUD,EAAS,CAE1C,IAAIvgC,EAAO,GACTiF,EAAS,GACTw7B,EAAY,GACZ92B,EAAa,GACbzJ,EAAY,GAEVD,EAAS,GACXygC,EAAS,QACTC,EAAO,IAET,GAAI,OAAOJ,GAAY,SAAU,CAE/B,IAAIK,EAAWL,EAAQ,QAAQ,IAAI,EAC/BK,GAAY,IACdF,EAASH,EAAQ,UAAU,EAAGK,EAAW,CAAC,EAC1CL,EAAUA,EAAQ,UAAUK,EAAW,CAAC,GAG1C,IAAIC,EAAWN,EAAQ,QAAQ,GAAG,EAC9BM,IAAa,KACfA,EAAWN,EAAQ,QAErB,IAAIO,EAAkBP,EAAQ,QAAQ,GAAG,EACrCO,IAAoB,KACtBA,EAAkBP,EAAQ,QAE5BvgC,EAAOugC,EAAQ,UAAU,EAAG,KAAK,IAAIM,EAAUC,CAAe,CAAC,EAC3DD,EAAWC,IAEbn3B,EAAam2B,GAAWS,EAAQ,UAAUM,EAAUC,CAAe,CAAC,GAEtE,IAAM1iB,EAAc6hB,GAAYM,EAAQ,UAAU,KAAK,IAAIA,EAAQ,OAAQO,CAAe,CAAC,CAAC,EAE5FF,EAAW5gC,EAAK,QAAQ,GAAG,EACvB4gC,GAAY,GACd3gC,EAASygC,IAAW,SAAWA,IAAW,MAC1CC,EAAO,SAAS3gC,EAAK,UAAU4gC,EAAW,CAAC,EAAG,EAAE,GAEhDA,EAAW5gC,EAAK,OAElB,IAAM+gC,EAAkB/gC,EAAK,MAAM,EAAG4gC,CAAQ,EAC9C,GAAIG,EAAgB,YAAY,IAAM,YACpC97B,EAAS,oBACA87B,EAAgB,MAAM,GAAG,EAAE,QAAU,EAC9C97B,EAAS87B,MACJ,CAEL,IAAMC,EAAShhC,EAAK,QAAQ,GAAG,EAC/BygC,EAAYzgC,EAAK,UAAU,EAAGghC,CAAM,EAAE,YAAY,EAClD/7B,EAASjF,EAAK,UAAUghC,EAAS,CAAC,EAElC9gC,EAAYugC,CACd,CAEI,OAAQriB,IACVle,EAAYke,EAAY,GAE5B,CACA,MAAO,CACL,KAAApe,EACA,KAAA2gC,EACA,OAAA17B,EACA,UAAAw7B,EACA,OAAAxgC,EACA,OAAAygC,EACA,WAAA/2B,EACA,UAAAzJ,CACF,CACF,EAmBA,IAAM+gC,GAAa,mEAebC,GAAa,UAAY,CAG7B,IAAIC,EAAe,EAKbC,EAAgB,CAAC,EACvB,OAAO,SAAUC,EAAK,CACpB,IAAMC,EAAgBD,IAAQF,EAC9BA,EAAeE,EACf,IAAIvnC,EACEynC,EAAiB,IAAI,MAAM,CAAC,EAClC,IAAKznC,EAAI,EAAGA,GAAK,EAAGA,IAClBynC,EAAeznC,CAAC,EAAImnC,GAAW,OAAOI,EAAM,EAAE,EAG9CA,EAAM,KAAK,MAAMA,EAAM,EAAE,EAE3BhnC,EAAOgnC,IAAQ,EAAG,0BAA0B,EAC5C,IAAIloC,EAAKooC,EAAe,KAAK,EAAE,EAC/B,GAAKD,EAIE,CAGL,IAAKxnC,EAAI,GAAIA,GAAK,GAAKsnC,EAActnC,CAAC,IAAM,GAAIA,IAC9CsnC,EAActnC,CAAC,EAAI,EAErBsnC,EAActnC,CAAC,GACjB,KAVE,KAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBsnC,EAActnC,CAAC,EAAI,KAAK,MAAM,KAAK,OAAO,EAAI,EAAE,EAUpD,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBX,GAAM8nC,GAAW,OAAOG,EAActnC,CAAC,CAAC,EAE1C,OAAAO,EAAOlB,EAAG,SAAW,GAAI,kCAAkC,EACpDA,CACT,CACF,EAAE,EAqBF,IAAMqoC,GAAN,KAAgB,CAOd,YAAYt3B,EAAWukB,EAAmBgT,EAAUC,EAAU,CAC5D,KAAK,UAAYx3B,EACjB,KAAK,kBAAoBukB,EACzB,KAAK,SAAWgT,EAChB,KAAK,SAAWC,CAClB,CACA,SAAU,CACR,IAAMC,EAAM,KAAK,SAAS,IAC1B,OAAI,KAAK,YAAc,QACdA,EAAI,MAEJA,EAAI,OAAO,KAEtB,CACA,cAAe,CACb,OAAO,KAAK,SACd,CACA,gBAAiB,CACf,OAAO,KAAK,kBAAkB,eAAe,IAAI,CACnD,CACA,UAAW,CACT,OAAO,KAAK,QAAQ,EAAE,SAAS,EAAI,IAAM,KAAK,UAAY,IAAMrpC,EAAU,KAAK,SAAS,UAAU,CAAC,CACrG,CACF,EACMspC,GAAN,KAAkB,CAChB,YAAYnT,EAAmB/zB,EAAOwQ,EAAM,CAC1C,KAAK,kBAAoBujB,EACzB,KAAK,MAAQ/zB,EACb,KAAK,KAAOwQ,CACd,CACA,SAAU,CACR,OAAO,KAAK,IACd,CACA,cAAe,CACb,MAAO,QACT,CACA,gBAAiB,CACf,OAAO,KAAK,kBAAkB,eAAe,IAAI,CACnD,CACA,UAAW,CACT,OAAO,KAAK,KAAK,SAAS,EAAI,SAChC,CACF,EAwBA,IAAM22B,GAAN,KAAsB,CACpB,YAAYC,EAAkBC,EAAgB,CAC5C,KAAK,iBAAmBD,EACxB,KAAK,eAAiBC,CACxB,CACA,QAAQC,EAAiBC,EAAmB,CAC1C,KAAK,iBAAiB,KAAK,KAAMD,EAAiBC,CAAiB,CACrE,CACA,SAASvnC,EAAO,CACd,OAAAL,EAAO,KAAK,kBAAmB,8DAA8D,EACtF,KAAK,eAAe,KAAK,KAAMK,CAAK,CAC7C,CACA,IAAI,mBAAoB,CACtB,MAAO,CAAC,CAAC,KAAK,cAChB,CACA,QAAQiS,EAAO,CACb,OAAO,KAAK,mBAAqBA,EAAM,kBAAoB,KAAK,iBAAiB,eAAiB,QAAa,KAAK,iBAAiB,eAAiBA,EAAM,iBAAiB,cAAgB,KAAK,iBAAiB,UAAYA,EAAM,iBAAiB,OACxP,CACF,EAsCA,IAAMu1B,GAAN,KAAmB,CAEjB,YAAYC,EAAOC,EAAO,CACxB,KAAK,MAAQD,EACb,KAAK,MAAQC,CACf,CAWA,QAAS,CACP,IAAMrzB,EAAW,IAAIC,EACrB,OAAA8tB,GAAuB,KAAK,MAAO,KAAK,MAAO/tB,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EACvEA,EAAS,OAClB,CAOA,QAAS,CACPmqB,EAAqB,sBAAuB,KAAK,KAAK,EACtD,IAAMnqB,EAAW,IAAIC,EACrB,OAAA+tB,GAAoB,KAAK,MAAO,KAAK,MAAO,KAAMhuB,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EAC1EA,EAAS,OAClB,CAoBA,IAAI1W,EAAO,CACT6gC,EAAqB,mBAAoB,KAAK,KAAK,EACnDnB,GAAwB,mBAAoB1/B,EAAO,KAAK,MAAO,EAAK,EACpE,IAAM0W,EAAW,IAAIC,EACrB,OAAA+tB,GAAoB,KAAK,MAAO,KAAK,MAAO1kC,EAAO0W,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EAC3EA,EAAS,OAClB,CAWA,gBAAgB1W,EAAOkc,EAAU,CAC/B2kB,EAAqB,+BAAgC,KAAK,KAAK,EAC/DnB,GAAwB,+BAAgC1/B,EAAO,KAAK,MAAO,EAAK,EAChFwgC,GAAiB,+BAAgCtkB,EAAU,EAAK,EAChE,IAAMxF,EAAW,IAAIC,EACrB,OAAAguB,GAAgC,KAAK,MAAO,KAAK,MAAO3kC,EAAOkc,EAAUxF,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EACjGA,EAAS,OAClB,CAiBA,OAAOymB,EAAQ,CACb0D,EAAqB,sBAAuB,KAAK,KAAK,EACtDP,GAA6B,sBAAuBnD,EAAQ,KAAK,MAAO,EAAK,EAC7E,IAAMzmB,EAAW,IAAIC,EACrB,OAAAiuB,GAAuB,KAAK,MAAO,KAAK,MAAOzH,EAAQzmB,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EAC/EA,EAAS,OAClB,CACF,EAqBA,IAAMszB,EAAN,MAAMC,CAAU,CAId,YAAYH,EAAOC,EAAOG,EAAcC,EAAgB,CACtD,KAAK,MAAQL,EACb,KAAK,MAAQC,EACb,KAAK,aAAeG,EACpB,KAAK,eAAiBC,CACxB,CACA,IAAI,KAAM,CACR,OAAI12B,EAAY,KAAK,KAAK,EACjB,KAEAT,GAAY,KAAK,KAAK,CAEjC,CACA,IAAI,KAAM,CACR,OAAO,IAAIo3B,EAAc,KAAK,MAAO,KAAK,KAAK,CACjD,CACA,IAAI,kBAAmB,CACrB,IAAM1mC,EAAMojB,GAA0B,KAAK,YAAY,EACjDhmB,EAAK6C,GAAkBD,CAAG,EAChC,OAAO5C,IAAO,KAAO,UAAYA,CACnC,CAIA,IAAI,cAAe,CACjB,OAAOgmB,GAA0B,KAAK,YAAY,CACpD,CACA,QAAQxS,EAAO,CAEb,GADAA,EAAQ+1B,EAAmB/1B,CAAK,EAC5B,EAAEA,aAAiB21B,GACrB,MAAO,GAET,IAAMK,EAAW,KAAK,QAAUh2B,EAAM,MAChCi2B,EAAWl2B,GAAW,KAAK,MAAOC,EAAM,KAAK,EAC7Ck2B,EAAsB,KAAK,mBAAqBl2B,EAAM,iBAC5D,OAAOg2B,GAAYC,GAAYC,CACjC,CACA,QAAS,CACP,OAAO,KAAK,SAAS,CACvB,CACA,UAAW,CACT,OAAO,KAAK,MAAM,SAAS,EAAIv3B,GAAuB,KAAK,KAAK,CAClE,CACF,EAIA,SAASw3B,GAA8BtlC,EAAOw6B,EAAQ,CACpD,GAAIx6B,EAAM,iBAAmB,GAC3B,MAAM,IAAI,MAAMw6B,EAAS,6CAA6C,CAE1E,CAIA,SAAS+K,GAAuBjiC,EAAQ,CACtC,IAAIkiC,EAAY,KACZC,EAAU,KAOd,GANIniC,EAAO,SAAS,IAClBkiC,EAAYliC,EAAO,mBAAmB,GAEpCA,EAAO,OAAO,IAChBmiC,EAAUniC,EAAO,iBAAiB,GAEhCA,EAAO,SAAS,IAAMgS,EAAW,CACnC,IAAMowB,EAAmB,mGACnBC,EAAoB,oIAC1B,GAAIriC,EAAO,SAAS,EAAG,CAErB,GADkBA,EAAO,kBAAkB,IACzBzF,GAChB,MAAM,IAAI,MAAM6nC,CAAgB,EAC3B,GAAI,OAAOF,GAAc,SAC9B,MAAM,IAAI,MAAMG,CAAiB,CAErC,CACA,GAAIriC,EAAO,OAAO,EAAG,CAEnB,GADgBA,EAAO,gBAAgB,IACvBxF,GACd,MAAM,IAAI,MAAM4nC,CAAgB,EAC3B,GAAI,OAAOD,GAAY,SAC5B,MAAM,IAAI,MAAME,CAAiB,CAErC,CACF,SAAWriC,EAAO,SAAS,IAAMoV,GAC/B,GAAI8sB,GAAa,MAAQ,CAAClL,GAAgBkL,CAAS,GAAKC,GAAW,MAAQ,CAACnL,GAAgBmL,CAAO,EACjG,MAAM,IAAI,MAAM,yLAAmM,UAGrN5oC,EAAOyG,EAAO,SAAS,YAAaqa,IAAara,EAAO,SAAS,IAAM4a,GAAa,qBAAqB,EACrGsnB,GAAa,MAAQ,OAAOA,GAAc,UAAYC,GAAW,MAAQ,OAAOA,GAAY,SAC9F,MAAM,IAAI,MAAM,kHAAuH,CAG7I,CAIA,SAASG,GAActiC,EAAQ,CAC7B,GAAIA,EAAO,SAAS,GAAKA,EAAO,OAAO,GAAKA,EAAO,SAAS,GAAK,CAACA,EAAO,iBAAiB,EACxF,MAAM,IAAI,MAAM,+HAAoI,CAExJ,CAIA,IAAM2hC,EAAN,MAAMY,UAAsBhB,CAAU,CAEpC,YAAY5H,EAAMvvB,EAAM,CACtB,MAAMuvB,EAAMvvB,EAAM,IAAI8S,GAAe,EAAK,CAC5C,CACA,IAAI,QAAS,CACX,IAAMslB,EAAa73B,GAAW,KAAK,KAAK,EACxC,OAAO63B,IAAe,KAAO,KAAO,IAAID,EAAc,KAAK,MAAOC,CAAU,CAC9E,CACA,IAAI,MAAO,CACT,IAAI3B,EAAM,KACV,KAAOA,EAAI,SAAW,MACpBA,EAAMA,EAAI,OAEZ,OAAOA,CACT,CACF,EAeM4B,GAAN,MAAMC,CAAa,CAOjB,YAAYC,EAIZ9B,EAAK+B,EAAQ,CACX,KAAK,MAAQD,EACb,KAAK,IAAM9B,EACX,KAAK,OAAS+B,CAChB,CASA,IAAI,UAAW,CAEb,OAAO,KAAK,MAAM,YAAY,EAAE,IAAI,CACtC,CAUA,IAAI,KAAM,CACR,OAAO,KAAK,IAAI,GAClB,CAEA,IAAI,MAAO,CACT,OAAO,KAAK,MAAM,YAAY,CAChC,CAaA,MAAMx4B,EAAM,CACV,IAAMoZ,EAAY,IAAI1Z,EAAKM,CAAI,EACzBy4B,EAAWv2B,GAAM,KAAK,IAAKlC,CAAI,EACrC,OAAO,IAAIs4B,EAAa,KAAK,MAAM,SAASlf,CAAS,EAAGqf,EAAUztB,CAAc,CAClF,CAKA,QAAS,CACP,MAAO,CAAC,KAAK,MAAM,QAAQ,CAC7B,CAWA,WAAY,CACV,OAAO,KAAK,MAAM,IAAI,EAAI,CAC5B,CAmBA,QAAQvH,EAAQ,CACd,OAAI,KAAK,MAAM,WAAW,EACjB,GAIF,CAAC,CAFa,KAAK,MAEJ,aAAa,KAAK,OAAQ,CAACvW,EAAK+Z,IAC7CxD,EAAO,IAAI60B,EAAarxB,EAAM/E,GAAM,KAAK,IAAKhV,CAAG,EAAG8d,CAAc,CAAC,CAC3E,CACH,CAQA,SAAShL,EAAM,CACb,IAAMoZ,EAAY,IAAI1Z,EAAKM,CAAI,EAC/B,MAAO,CAAC,KAAK,MAAM,SAASoZ,CAAS,EAAE,QAAQ,CACjD,CAaA,aAAc,CACZ,OAAI,KAAK,MAAM,WAAW,EACjB,GAEA,CAAC,KAAK,MAAM,QAAQ,CAE/B,CAIA,QAAS,CACP,OAAO,KAAK,UAAU,CACxB,CAaA,KAAM,CACJ,OAAO,KAAK,MAAM,IAAI,CACxB,CACF,EAeA,SAASqd,GAAIiC,EAAI14B,EAAM,CACrB,OAAA04B,EAAKlB,EAAmBkB,CAAE,EAC1BA,EAAG,iBAAiB,KAAK,EAClB14B,IAAS,OAAYkC,GAAMw2B,EAAG,MAAO14B,CAAI,EAAI04B,EAAG,KACzD,CAiBA,SAASC,GAAWD,EAAIr+B,EAAK,CAC3Bq+B,EAAKlB,EAAmBkB,CAAE,EAC1BA,EAAG,iBAAiB,YAAY,EAChC,IAAME,EAAYxD,GAAc/6B,EAAKq+B,EAAG,MAAM,UAAU,SAAS,EACjEzK,GAAY,aAAc2K,CAAS,EACnC,IAAMnjC,EAAWmjC,EAAU,SAC3B,MAAI,CAACF,EAAG,MAAM,UAAU,aAAa,GAAKjjC,EAAS,OAASijC,EAAG,MAAM,UAAU,MAC7EjpC,EAAM,qEAAiFgG,EAAS,KAAO,iBAAmBijC,EAAG,MAAM,UAAU,KAAO,GAAG,EAElJjC,GAAIiC,EAAIE,EAAU,KAAK,SAAS,CAAC,CAC1C,CAYA,SAAS12B,GAAMmpB,EAAQrrB,EAAM,CAC3B,OAAAqrB,EAASmM,EAAmBnM,CAAM,EAC9BtrB,EAAasrB,EAAO,KAAK,IAAM,KACjC0C,GAAuB,QAAS,OAAQ/tB,EAAM,EAAK,EAEnD8tB,GAAmB,QAAS,OAAQ9tB,EAAM,EAAK,EAE1C,IAAIu3B,EAAclM,EAAO,MAAO5qB,EAAU4qB,EAAO,MAAOrrB,CAAI,CAAC,CACtE,CAQA,SAASxH,GAAai+B,EAAK,CACzB,OAAAA,EAAMe,EAAmBf,CAAG,EACrB,IAAIO,GAAaP,EAAI,MAAOA,EAAI,KAAK,CAC9C,CAwBA,SAASoC,GAAKxN,EAAQl+B,EAAO,CAC3Bk+B,EAASmM,EAAmBnM,CAAM,EAClC2C,EAAqB,OAAQ3C,EAAO,KAAK,EACzCwB,GAAwB,OAAQ1/B,EAAOk+B,EAAO,MAAO,EAAI,EACzD,IAAM8K,EAAMlG,GAAe5E,EAAO,KAAK,EACjCz+B,EAAOopC,GAAWG,CAAG,EAOrB2C,EAAkB52B,GAAMmpB,EAAQz+B,CAAI,EACpCmsC,EAAU72B,GAAMmpB,EAAQz+B,CAAI,EAC9BosC,EACJ,OAAI7rC,GAAS,KACX6rC,EAAUC,GAAIF,EAAS5rC,CAAK,EAAE,KAAK,IAAM4rC,CAAO,EAEhDC,EAAU,QAAQ,QAAQD,CAAO,EAEnCD,EAAgB,KAAOE,EAAQ,KAAK,KAAKA,CAAO,EAChDF,EAAgB,MAAQE,EAAQ,KAAK,KAAKA,EAAS,MAAS,EACrDF,CACT,CAeA,SAASI,GAAOzC,EAAK,CACnB,OAAAzI,EAAqB,SAAUyI,EAAI,KAAK,EACjCwC,GAAIxC,EAAK,IAAI,CACtB,CA8BA,SAASwC,GAAIxC,EAAKtpC,EAAO,CACvBspC,EAAMe,EAAmBf,CAAG,EAC5BzI,EAAqB,MAAOyI,EAAI,KAAK,EACrC5J,GAAwB,MAAO1/B,EAAOspC,EAAI,MAAO,EAAK,EACtD,IAAM5yB,EAAW,IAAIC,EACrB,OAAAgtB,GAAoB2F,EAAI,MAAOA,EAAI,MAAOtpC,EAAoB,KAAM0W,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EAC5FA,EAAS,OAClB,CAaA,SAASs1B,GAAY1C,EAAKptB,EAAU,CAClCotB,EAAMe,EAAmBf,CAAG,EAC5BzI,EAAqB,cAAeyI,EAAI,KAAK,EAC7C9I,GAAiB,cAAetkB,EAAU,EAAK,EAC/C,IAAMxF,EAAW,IAAIC,EACrB,OAAAgtB,GAAoB2F,EAAI,MAAOh2B,EAAUg2B,EAAI,MAAO,WAAW,EAAGptB,EAAU,KAAMxF,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EAC1GA,EAAS,OAClB,CAgBA,SAASu1B,GAAgB3C,EAAKtpC,EAAOkc,EAAU,CAI7C,GAHA2kB,EAAqB,kBAAmByI,EAAI,KAAK,EACjD5J,GAAwB,kBAAmB1/B,EAAOspC,EAAI,MAAO,EAAK,EAClE9I,GAAiB,kBAAmBtkB,EAAU,EAAK,EAC/CotB,EAAI,MAAQ,WAAaA,EAAI,MAAQ,QACvC,KAAM,2BAA6BA,EAAI,IAAM,0BAE/C,IAAM5yB,EAAW,IAAIC,EACrB,OAAAgtB,GAAoB2F,EAAI,MAAOA,EAAI,MAAOtpC,EAAOkc,EAAUxF,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EACnFA,EAAS,OAClB,CAoCA,SAASw1B,GAAO5C,EAAKnM,EAAQ,CAC3BmD,GAA6B,SAAUnD,EAAQmM,EAAI,MAAO,EAAK,EAC/D,IAAM5yB,EAAW,IAAIC,EACrB,OAAAutB,GAAWoF,EAAI,MAAOA,EAAI,MAAOnM,EAAQzmB,EAAS,aAAa,IAAM,CAAC,CAAC,CAAC,EACjEA,EAAS,OAClB,CASA,SAASQ,GAAI/R,EAAO,CAClBA,EAAQklC,EAAmBllC,CAAK,EAChC,IAAMgnC,EAAkB,IAAI3C,GAAgB,IAAM,CAAC,CAAC,EAC9C4C,EAAY,IAAIC,GAAuBF,CAAe,EAC5D,OAAO5I,GAAap+B,EAAM,MAAOA,EAAOinC,CAAS,EAAE,KAAKtyB,GAC/C,IAAIoxB,GAAapxB,EAAM,IAAIswB,EAAcjlC,EAAM,MAAOA,EAAM,KAAK,EAAGA,EAAM,aAAa,SAAS,CAAC,CACzG,CACH,CAIA,IAAMknC,GAAN,MAAMC,CAAuB,CAC3B,YAAYH,EAAiB,CAC3B,KAAK,gBAAkBA,CACzB,CACA,WAAWt6B,EAAW,CACpB,OAAOA,IAAc,OACvB,CACA,YAAY4Y,EAAQtlB,EAAO,CACzB,IAAM0R,EAAQ1R,EAAM,aAAa,SAAS,EAC1C,OAAO,IAAIgkC,GAAU,QAAS,KAAM,IAAI+B,GAAazgB,EAAO,aAAc,IAAI2f,EAAcjlC,EAAM,MAAOA,EAAM,KAAK,EAAG0R,CAAK,CAAC,CAC/H,CACA,eAAe7E,EAAW,CACxB,OAAIA,EAAU,aAAa,IAAM,SACxB,IAAM,KAAK,gBAAgB,SAASA,EAAU,KAAK,EAEnD,IAAM,KAAK,gBAAgB,QAAQA,EAAU,SAAU,IAAI,CAEtE,CACA,kBAAkB3P,EAAOwQ,EAAM,CAC7B,OAAI,KAAK,gBAAgB,kBAChB,IAAI02B,GAAY,KAAMlnC,EAAOwQ,CAAI,EAEjC,IAEX,CACA,QAAQyB,EAAO,CACb,OAAMA,aAAiBg4B,EAEZ,CAACh4B,EAAM,iBAAmB,CAAC,KAAK,gBAElC,GAEAA,EAAM,gBAAgB,QAAQ,KAAK,eAAe,EALlD,EAOX,CACA,gBAAiB,CACf,OAAO,KAAK,kBAAoB,IAClC,CACF,EAIMi4B,GAAN,MAAMC,CAAuB,CAC3B,YAAY36B,EAAWs6B,EAAiB,CACtC,KAAK,UAAYt6B,EACjB,KAAK,gBAAkBs6B,CACzB,CACA,WAAWt6B,EAAW,CACpB,IAAI46B,EAAe56B,IAAc,iBAAmB,cAAgBA,EACpE,OAAA46B,EAAeA,IAAiB,mBAAqB,gBAAkBA,EAChE,KAAK,YAAcA,CAC5B,CACA,kBAAkBpqC,EAAOwQ,EAAM,CAC7B,OAAI,KAAK,gBAAgB,kBAChB,IAAI02B,GAAY,KAAMlnC,EAAOwQ,CAAI,EAEjC,IAEX,CACA,YAAY4X,EAAQtlB,EAAO,CACzBnD,EAAOyoB,EAAO,WAAa,KAAM,uCAAuC,EACxE,IAAM6gB,EAAWv2B,GAAM,IAAIq1B,EAAcjlC,EAAM,MAAOA,EAAM,KAAK,EAAGslB,EAAO,SAAS,EAC9E5T,EAAQ1R,EAAM,aAAa,SAAS,EAC1C,OAAO,IAAIgkC,GAAU1e,EAAO,KAAM,KAAM,IAAIygB,GAAazgB,EAAO,aAAc6gB,EAAUz0B,CAAK,EAAG4T,EAAO,QAAQ,CACjH,CACA,eAAezY,EAAW,CACxB,OAAIA,EAAU,aAAa,IAAM,SACxB,IAAM,KAAK,gBAAgB,SAASA,EAAU,KAAK,EAEnD,IAAM,KAAK,gBAAgB,QAAQA,EAAU,SAAUA,EAAU,QAAQ,CAEpF,CACA,QAAQsC,EAAO,CACb,OAAIA,aAAiBk4B,EACZ,KAAK,YAAcl4B,EAAM,YAAc,CAAC,KAAK,iBAAmB,CAACA,EAAM,iBAAmB,KAAK,gBAAgB,QAAQA,EAAM,eAAe,GAE9I,EACT,CACA,gBAAiB,CACf,MAAO,CAAC,CAAC,KAAK,eAChB,CACF,EACA,SAASo4B,GAAiBvnC,EAAO0M,EAAWrI,EAAUmjC,EAA+B7+B,EAAS,CAC5F,IAAI47B,EAQJ,GAPI,OAAOiD,GAAkC,WAC3CjD,EAAiB,OACjB57B,EAAU6+B,GAER,OAAOA,GAAkC,aAC3CjD,EAAiBiD,GAEf7+B,GAAWA,EAAQ,SAAU,CAC/B,IAAM8+B,EAAepjC,EACfqjC,EAAe,CAACC,EAAclD,IAAsB,CACxD9E,GAAgC3/B,EAAM,MAAOA,EAAOinC,CAAS,EAC7DQ,EAAaE,EAAclD,CAAiB,CAC9C,EACAiD,EAAa,aAAerjC,EAAS,aACrCqjC,EAAa,QAAUrjC,EAAS,QAChCA,EAAWqjC,CACb,CACA,IAAMV,EAAkB,IAAI3C,GAAgBhgC,EAAUkgC,GAAkB,MAAS,EAC3E0C,EAAYv6B,IAAc,QAAU,IAAIw6B,GAAuBF,CAAe,EAAI,IAAII,GAAuB16B,EAAWs6B,CAAe,EAC7I,OAAAtH,GAA6B1/B,EAAM,MAAOA,EAAOinC,CAAS,EACnD,IAAMtH,GAAgC3/B,EAAM,MAAOA,EAAOinC,CAAS,CAC5E,CACA,SAASW,GAAQ5nC,EAAOqE,EAAUmjC,EAA+B7+B,EAAS,CACxE,OAAO4+B,GAAiBvnC,EAAO,QAASqE,EAAUmjC,EAA+B7+B,CAAO,CAC1F,CACA,SAASk/B,GAAa7nC,EAAOqE,EAAUmjC,EAA+B7+B,EAAS,CAC7E,OAAO4+B,GAAiBvnC,EAAO,cAAeqE,EAAUmjC,EAA+B7+B,CAAO,CAChG,CACA,SAASm/B,GAAe9nC,EAAOqE,EAAUmjC,EAA+B7+B,EAAS,CAC/E,OAAO4+B,GAAiBvnC,EAAO,gBAAiBqE,EAAUmjC,EAA+B7+B,CAAO,CAClG,CACA,SAASo/B,GAAa/nC,EAAOqE,EAAUmjC,EAA+B7+B,EAAS,CAC7E,OAAO4+B,GAAiBvnC,EAAO,cAAeqE,EAAUmjC,EAA+B7+B,CAAO,CAChG,CACA,SAASq/B,GAAehoC,EAAOqE,EAAUmjC,EAA+B7+B,EAAS,CAC/E,OAAO4+B,GAAiBvnC,EAAO,gBAAiBqE,EAAUmjC,EAA+B7+B,CAAO,CAClG,CAwBA,SAASs/B,GAAIjoC,EAAO0M,EAAWrI,EAAU,CACvC,IAAI4iC,EAAY,KACViB,EAAc7jC,EAAW,IAAIggC,GAAgBhgC,CAAQ,EAAI,KAC3DqI,IAAc,QAChBu6B,EAAY,IAAIC,GAAuBgB,CAAW,EACzCx7B,IACTu6B,EAAY,IAAIG,GAAuB16B,EAAWw7B,CAAW,GAE/DvI,GAAgC3/B,EAAM,MAAOA,EAAOinC,CAAS,CAC/D,CAWA,IAAMkB,EAAN,KAAsB,CAAC,EACjBC,GAAN,cAAmCD,CAAgB,CACjD,YAAYE,EAAQlR,EAAM,CACxB,MAAM,EACN,KAAK,OAASkR,EACd,KAAK,KAAOlR,EACZ,KAAK,KAAO,OACd,CACA,OAAOn3B,EAAO,CACZu6B,GAAwB,QAAS,KAAK,OAAQv6B,EAAM,MAAO,EAAI,EAC/D,IAAM+gB,EAAYI,GAAiBnhB,EAAM,aAAc,KAAK,OAAQ,KAAK,IAAI,EAG7E,GAFA4lC,GAAc7kB,CAAS,EACvBwkB,GAAuBxkB,CAAS,EAC5B/gB,EAAM,aAAa,OAAO,EAC5B,MAAM,IAAI,MAAM,yFAA8F,EAEhH,OAAO,IAAI6kC,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAAW/gB,EAAM,cAAc,CAChF,CACF,EAwBA,SAASsoC,GAAMztC,EAAOD,EAAK,CACzB,OAAA0gC,GAAY,QAAS,MAAO1gC,EAAK,EAAI,EAC9B,IAAIwtC,GAAqBvtC,EAAOD,CAAG,CAC5C,CACA,IAAM2tC,GAAN,cAAuCJ,CAAgB,CACrD,YAAYE,EAAQlR,EAAM,CACxB,MAAM,EACN,KAAK,OAASkR,EACd,KAAK,KAAOlR,EACZ,KAAK,KAAO,WACd,CACA,OAAOn3B,EAAO,CACZu6B,GAAwB,YAAa,KAAK,OAAQv6B,EAAM,MAAO,EAAK,EACpE,IAAM+gB,EAAYK,GAAqBphB,EAAM,aAAc,KAAK,OAAQ,KAAK,IAAI,EAGjF,GAFA4lC,GAAc7kB,CAAS,EACvBwkB,GAAuBxkB,CAAS,EAC5B/gB,EAAM,aAAa,OAAO,EAC5B,MAAM,IAAI,MAAM,6FAAkG,EAEpH,OAAO,IAAI6kC,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAAW/gB,EAAM,cAAc,CAChF,CACF,EAoBA,SAASwoC,GAAU3tC,EAAOD,EAAK,CAC7B,OAAA0gC,GAAY,YAAa,MAAO1gC,EAAK,EAAI,EAClC,IAAI2tC,GAAyB1tC,EAAOD,CAAG,CAChD,CACA,IAAM6tC,GAAN,cAAqCN,CAAgB,CACnD,YAAYE,EAAQlR,EAAM,CACxB,MAAM,EACN,KAAK,OAASkR,EACd,KAAK,KAAOlR,EACZ,KAAK,KAAO,SACd,CACA,OAAOn3B,EAAO,CACZu6B,GAAwB,UAAW,KAAK,OAAQv6B,EAAM,MAAO,EAAI,EACjE,IAAM+gB,EAAYE,GAAmBjhB,EAAM,aAAc,KAAK,OAAQ,KAAK,IAAI,EAG/E,GAFA4lC,GAAc7kB,CAAS,EACvBwkB,GAAuBxkB,CAAS,EAC5B/gB,EAAM,aAAa,SAAS,EAC9B,MAAM,IAAI,MAAM,+FAAoG,EAEtH,OAAO,IAAI6kC,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAAW/gB,EAAM,cAAc,CAChF,CACF,EAuBA,SAAS0oC,GAAQ7tC,EAAQ,KAAMD,EAAK,CAClC,OAAA0gC,GAAY,UAAW,MAAO1gC,EAAK,EAAI,EAChC,IAAI6tC,GAAuB5tC,EAAOD,CAAG,CAC9C,CACA,IAAM+tC,GAAN,cAAwCR,CAAgB,CACtD,YAAYE,EAAQlR,EAAM,CACxB,MAAM,EACN,KAAK,OAASkR,EACd,KAAK,KAAOlR,EACZ,KAAK,KAAO,YACd,CACA,OAAOn3B,EAAO,CACZu6B,GAAwB,aAAc,KAAK,OAAQv6B,EAAM,MAAO,EAAK,EACrE,IAAM+gB,EAAYG,GAAsBlhB,EAAM,aAAc,KAAK,OAAQ,KAAK,IAAI,EAGlF,GAFA4lC,GAAc7kB,CAAS,EACvBwkB,GAAuBxkB,CAAS,EAC5B/gB,EAAM,aAAa,SAAS,EAC9B,MAAM,IAAI,MAAM,kGAAuG,EAEzH,OAAO,IAAI6kC,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAAW/gB,EAAM,cAAc,CAChF,CACF,EAmBA,SAAS4oC,GAAW/tC,EAAOD,EAAK,CAC9B,OAAA0gC,GAAY,aAAc,MAAO1gC,EAAK,EAAI,EACnC,IAAI+tC,GAA0B9tC,EAAOD,CAAG,CACjD,CACA,IAAMiuC,GAAN,cAA0CV,CAAgB,CACxD,YAAYW,EAAQ,CAClB,MAAM,EACN,KAAK,OAASA,EACd,KAAK,KAAO,cACd,CACA,OAAO9oC,EAAO,CACZ,GAAIA,EAAM,aAAa,SAAS,EAC9B,MAAM,IAAI,MAAM,uFAA4F,EAE9G,OAAO,IAAI6kC,EAAU7kC,EAAM,MAAOA,EAAM,MAAO6gB,GAAwB7gB,EAAM,aAAc,KAAK,MAAM,EAAGA,EAAM,cAAc,CAC/H,CACF,EAmBA,SAAS+oC,GAAaC,EAAO,CAC3B,GAAI,OAAOA,GAAU,UAAY,KAAK,MAAMA,CAAK,IAAMA,GAASA,GAAS,EACvE,MAAM,IAAI,MAAM,0DAA0D,EAE5E,OAAO,IAAIH,GAA4BG,CAAK,CAC9C,CACA,IAAMC,GAAN,cAAyCd,CAAgB,CACvD,YAAYW,EAAQ,CAClB,MAAM,EACN,KAAK,OAASA,EACd,KAAK,KAAO,aACd,CACA,OAAO9oC,EAAO,CACZ,GAAIA,EAAM,aAAa,SAAS,EAC9B,MAAM,IAAI,MAAM,sFAA2F,EAE7G,OAAO,IAAI6kC,EAAU7kC,EAAM,MAAOA,EAAM,MAAOghB,GAAuBhhB,EAAM,aAAc,KAAK,MAAM,EAAGA,EAAM,cAAc,CAC9H,CACF,EAmBA,SAASkpC,GAAYF,EAAO,CAC1B,GAAI,OAAOA,GAAU,UAAY,KAAK,MAAMA,CAAK,IAAMA,GAASA,GAAS,EACvE,MAAM,IAAI,MAAM,yDAAyD,EAE3E,OAAO,IAAIC,GAA2BD,CAAK,CAC7C,CACA,IAAMG,GAAN,cAA0ChB,CAAgB,CACxD,YAAYvD,EAAO,CACjB,MAAM,EACN,KAAK,MAAQA,EACb,KAAK,KAAO,cACd,CACA,OAAO5kC,EAAO,CACZslC,GAA8BtlC,EAAO,cAAc,EACnD,IAAMopC,EAAa,IAAIh8B,EAAK,KAAK,KAAK,EACtC,GAAIkB,EAAY86B,CAAU,EACxB,MAAM,IAAI,MAAM,sEAAsE,EAExF,IAAM13B,EAAQ,IAAIiM,GAAUyrB,CAAU,EAChCroB,EAAYM,GAAmBrhB,EAAM,aAAc0R,CAAK,EAC9D,OAAA6zB,GAAuBxkB,CAAS,EACzB,IAAI8jB,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAA6B,EAAI,CAClF,CACF,EAkBA,SAASsoB,GAAa37B,EAAM,CAC1B,GAAIA,IAAS,OACX,MAAM,IAAI,MAAM,6DAA6D,EACxE,GAAIA,IAAS,YAClB,MAAM,IAAI,MAAM,uEAAuE,EAClF,GAAIA,IAAS,SAClB,MAAM,IAAI,MAAM,iEAAiE,EAEnF,OAAA8tB,GAAmB,eAAgB,OAAQ9tB,EAAM,EAAK,EAC/C,IAAIy7B,GAA4Bz7B,CAAI,CAC7C,CACA,IAAM47B,GAAN,cAAwCnB,CAAgB,CACtD,aAAc,CACZ,MAAM,GAAG,SAAS,EAClB,KAAK,KAAO,YACd,CACA,OAAOnoC,EAAO,CACZslC,GAA8BtlC,EAAO,YAAY,EACjD,IAAM+gB,EAAYM,GAAmBrhB,EAAM,aAAcsV,CAAS,EAClE,OAAAiwB,GAAuBxkB,CAAS,EACzB,IAAI8jB,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAA6B,EAAI,CAClF,CACF,EASA,SAASwoB,IAAa,CACpB,OAAO,IAAID,EACb,CACA,IAAME,GAAN,cAA6CrB,CAAgB,CAC3D,aAAc,CACZ,MAAM,GAAG,SAAS,EAClB,KAAK,KAAO,iBACd,CACA,OAAOnoC,EAAO,CACZslC,GAA8BtlC,EAAO,iBAAiB,EACtD,IAAM+gB,EAAYM,GAAmBrhB,EAAM,aAAc0Y,CAAc,EACvE,OAAA6sB,GAAuBxkB,CAAS,EACzB,IAAI8jB,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAA6B,EAAI,CAClF,CACF,EASA,SAAS0oB,IAAkB,CACzB,OAAO,IAAID,EACb,CACA,IAAME,GAAN,cAA0CvB,CAAgB,CACxD,aAAc,CACZ,MAAM,GAAG,SAAS,EAClB,KAAK,KAAO,cACd,CACA,OAAOnoC,EAAO,CACZslC,GAA8BtlC,EAAO,cAAc,EACnD,IAAM+gB,EAAYM,GAAmBrhB,EAAM,aAAcke,EAAW,EACpE,OAAAqnB,GAAuBxkB,CAAS,EACzB,IAAI8jB,EAAU7kC,EAAM,MAAOA,EAAM,MAAO+gB,EAA6B,EAAI,CAClF,CACF,EAUA,SAAS4oB,IAAe,CACtB,OAAO,IAAID,EACb,CACA,IAAME,GAAN,cAA0CzB,CAAgB,CACxD,YAAYE,EAAQlR,EAAM,CACxB,MAAM,EACN,KAAK,OAASkR,EACd,KAAK,KAAOlR,EACZ,KAAK,KAAO,SACd,CACA,OAAOn3B,EAAO,CAEZ,GADAu6B,GAAwB,UAAW,KAAK,OAAQv6B,EAAM,MAAO,EAAK,EAC9DA,EAAM,aAAa,SAAS,EAC9B,MAAM,IAAI,MAAM,6FAAkG,EAEpH,GAAIA,EAAM,aAAa,OAAO,EAC5B,MAAM,IAAI,MAAM,wFAA6F,EAE/G,OAAO,IAAIooC,GAAqB,KAAK,OAAQ,KAAK,IAAI,EAAE,OAAO,IAAIK,GAAuB,KAAK,OAAQ,KAAK,IAAI,EAAE,OAAOzoC,CAAK,CAAC,CACjI,CACF,EAwBA,SAAS6pC,GAAQhvC,EAAOD,EAAK,CAC3B,OAAA0gC,GAAY,UAAW,MAAO1gC,EAAK,EAAI,EAChC,IAAIgvC,GAA4B/uC,EAAOD,CAAG,CACnD,CAUA,SAASoF,GAAMA,KAAU8pC,EAAkB,CACzC,IAAIC,EAAY7E,EAAmBllC,CAAK,EACxC,QAAWgqC,KAAcF,EACvBC,EAAYC,EAAW,OAAOD,CAAS,EAEzC,OAAOA,CACT,CAOAjY,GAAiCmT,CAAa,EAC9C9R,GAAgC8R,CAAa,EA0B7C,IAAMgF,GAAsC,kCAItCC,GAAQ,CAAC,EAIXC,GAAgB,GAIpB,SAASC,GAAiCnN,EAAMz6B,EAAM2gC,EAAMkH,EAAe,CACzEpN,EAAK,UAAY,IAAI16B,GAAS,GAAGC,CAAI,IAAI2gC,CAAI,GAAiB,GAAOlG,EAAK,UAAU,UAAWA,EAAK,UAAU,cAAeA,EAAK,UAAU,UAAWA,EAAK,UAAU,eAAgBA,EAAK,UAAU,8BAAmD,EAAI,EACxPoN,IACFpN,EAAK,mBAAqBoN,EAE9B,CAKA,SAASC,GAA2BC,EAAKC,EAAc1pC,EAAkBiH,EAAKnF,EAAW,CACvF,IAAI6nC,EAAQ1iC,GAAOwiC,EAAI,QAAQ,YAC3BE,IAAU,SACPF,EAAI,QAAQ,WACfptC,EAAM,gHAAqH,EAE7HJ,EAAI,kCAAmCwtC,EAAI,QAAQ,SAAS,EAC5DE,EAAQ,GAAGF,EAAI,QAAQ,SAAS,gCAElC,IAAI3O,EAAYkH,GAAc2H,EAAO7nC,CAAS,EAC1CO,EAAWy4B,EAAU,SACrB8O,EACAC,EACA,OAAO,QAAY,KAAe,QAAQ,MAC5CA,EAAiB,QAAQ,IAAIV,EAAmC,GAE9DU,GACFD,EAAa,GACbD,EAAQ,UAAUE,CAAc,OAAOxnC,EAAS,SAAS,GACzDy4B,EAAYkH,GAAc2H,EAAO7nC,CAAS,EAC1CO,EAAWy4B,EAAU,UAErB8O,EAAa,CAAC9O,EAAU,SAAS,OAEnC,IAAMgP,EAAoBhoC,GAAa8nC,EAAa,IAAIhpC,GAAsBA,GAAsB,KAAK,EAAI,IAAIL,GAA0BkpC,EAAI,KAAMA,EAAI,QAASC,CAAY,EAC9K7O,GAAY,gCAAiCC,CAAS,EACjDttB,EAAYstB,EAAU,IAAI,GAC7Bz+B,EAAM,0FAA+F,EAEvG,IAAM8/B,EAAO4N,GAAsB1nC,EAAUonC,EAAKK,EAAmB,IAAIhqC,GAAsB2pC,EAAI,KAAMzpC,CAAgB,CAAC,EAC1H,OAAO,IAAIgqC,GAAS7N,EAAMsN,CAAG,CAC/B,CAKA,SAASQ,GAAsB9N,EAAM+N,EAAS,CAC5C,IAAMC,EAAWf,GAAMc,CAAO,GAE1B,CAACC,GAAYA,EAAShO,EAAK,GAAG,IAAMA,IACtC9/B,EAAM,YAAY6tC,CAAO,IAAI/N,EAAK,SAAS,6BAA6B,EAE1E2C,GAAc3C,CAAI,EAClB,OAAOgO,EAAShO,EAAK,GAAG,CAC1B,CAQA,SAAS4N,GAAsB1nC,EAAUonC,EAAKK,EAAmB9pC,EAAkB,CACjF,IAAImqC,EAAWf,GAAMK,EAAI,IAAI,EACxBU,IACHA,EAAW,CAAC,EACZf,GAAMK,EAAI,IAAI,EAAIU,GAEpB,IAAIhO,EAAOgO,EAAS9nC,EAAS,YAAY,CAAC,EAC1C,OAAI85B,GACF9/B,EAAM,yHAAyH,EAEjI8/B,EAAO,IAAIJ,GAAK15B,EAAUgnC,GAAeS,EAAmB9pC,CAAgB,EAC5EmqC,EAAS9nC,EAAS,YAAY,CAAC,EAAI85B,EAC5BA,CACT,CAIA,SAASiO,GAA2BC,EAAiB,CACnDhB,GAAgBgB,CAClB,CAIA,IAAML,GAAN,KAAe,CAEb,YAAYM,EACZb,EAAK,CACH,KAAK,cAAgBa,EACrB,KAAK,IAAMb,EAEX,KAAK,KAAU,WAEf,KAAK,iBAAmB,EAC1B,CACA,IAAI,OAAQ,CACV,OAAK,KAAK,mBACRvN,GAAU,KAAK,cAAe,KAAK,IAAI,QAAQ,MAAO,KAAK,IAAI,QAAQ,4BAA+B,EACtG,KAAK,iBAAmB,IAEnB,KAAK,aACd,CACA,IAAI,OAAQ,CACV,OAAK,KAAK,gBACR,KAAK,cAAgB,IAAIiI,EAAc,KAAK,MAAOz3B,EAAa,CAAC,GAE5D,KAAK,aACd,CACA,SAAU,CACR,OAAI,KAAK,gBAAkB,OACzBu9B,GAAsB,KAAK,MAAO,KAAK,IAAI,IAAI,EAC/C,KAAK,cAAgB,KACrB,KAAK,cAAgB,MAEhB,QAAQ,QAAQ,CACzB,CACA,iBAAiBM,EAAS,CACpB,KAAK,gBAAkB,MACzBluC,EAAM,eAAiBkuC,EAAU,yBAAyB,CAE9D,CACF,EACA,SAASC,IAAqB,CACxB9hC,GAAiB,0BACnBpM,EAAK,+GAA+G,CAExH,CAIA,SAASmuC,IAAkB,CACzBD,GAAmB,EACnB7lC,GAAsB,cAAc,CACtC,CAIA,SAAS+lC,IAAmB,CAC1BF,GAAmB,EACnB5iC,GAAoB,cAAc,EAClCjD,GAAsB,WAAW,CACnC,CAYA,SAASgmC,GAAYlB,EAAMmB,GAAO,EAAG3jC,EAAK,CACxC,IAAMq+B,EAAKuF,GAAapB,EAAK,UAAU,EAAE,aAAa,CACpD,WAAYxiC,CACd,CAAC,EACD,GAAI,CAACq+B,EAAG,iBAAkB,CACxB,IAAMwF,EAAWC,GAAkC,UAAU,EACzDD,GACFE,GAAwB1F,EAAI,GAAGwF,CAAQ,CAE3C,CACA,OAAOxF,CACT,CAYA,SAAS0F,GAAwB1F,EAAI5jC,EAAM2gC,EAAMx6B,EAAU,CAAC,EAAG,CAC7Dy9B,EAAKlB,EAAmBkB,CAAE,EAC1BA,EAAG,iBAAiB,aAAa,EAC7BA,EAAG,kBACLjpC,EAAM,wEAAwE,EAEhF,IAAM8/B,EAAOmJ,EAAG,cACZiE,EACJ,GAAIpN,EAAK,UAAU,UACbt0B,EAAQ,eACVxL,EAAM,oJAAoJ,EAE5JktC,EAAgB,IAAI3oC,GAAsBA,GAAsB,KAAK,UAC5DiH,EAAQ,cAAe,CAChC,IAAM2D,EAAQ,OAAO3D,EAAQ,eAAkB,SAAWA,EAAQ,cAAgBojC,GAAoBpjC,EAAQ,cAAey9B,EAAG,IAAI,QAAQ,SAAS,EACrJiE,EAAgB,IAAI3oC,GAAsB4K,CAAK,CACjD,CAEA89B,GAAiCnN,EAAMz6B,EAAM2gC,EAAMkH,CAAa,CAClE,CAsBA,SAAS2B,GAAU5F,EAAI,CACrBA,EAAKlB,EAAmBkB,CAAE,EAC1BA,EAAG,iBAAiB,WAAW,EAC/BxG,GAAcwG,EAAG,KAAK,CACxB,CAYA,SAAS6F,GAAS7F,EAAI,CACpBA,EAAKlB,EAAmBkB,CAAE,EAC1BA,EAAG,iBAAiB,UAAU,EAC9BvG,GAAWuG,EAAG,KAAK,CACrB,CACA,SAAS8F,GAAc1vC,EAAQI,EAAY,CACzCF,GAAgBF,EAAQI,CAAU,CACpC,CAkBA,SAASuvC,GAAiBC,EAAS,CACjC3xC,GAAcD,EAAa,EAC3B6xC,GAAmB,IAAIC,EAAU,WAAY,CAACrF,EAAW,CACvD,mBAAoBl/B,CACtB,IAAM,CACJ,IAAMwiC,EAAMtD,EAAU,YAAY,KAAK,EAAE,aAAa,EAChDuD,EAAevD,EAAU,YAAY,eAAe,EACpDnmC,EAAmBmmC,EAAU,YAAY,oBAAoB,EACnE,OAAOqD,GAA2BC,EAAKC,EAAc1pC,EAAkBiH,CAAG,CAC5E,EAAG,QAAmC,EAAE,qBAAqB,EAAI,CAAC,EAClEwkC,GAAgBjyC,GAAMC,GAAS6xC,CAAO,EAEtCG,GAAgBjyC,GAAMC,GAAS,SAAS,CAC1C,CAkBA,IAAMiyC,GAAmB,CACvB,MAAO,WACT,EAMA,SAASC,IAAkB,CACzB,OAAOD,EACT,CAQA,SAASE,GAAU54B,EAAO,CACxB,MAAO,CACL,MAAO,CACL,UAAaA,CACf,CACF,CACF,CAqBA,IAAM64B,GAAN,KAAwB,CAEtB,YACAC,EACA3I,EAAU,CACR,KAAK,UAAY2I,EACjB,KAAK,SAAW3I,CAClB,CAEA,QAAS,CACP,MAAO,CACL,UAAW,KAAK,UAChB,SAAU,KAAK,SAAS,OAAO,CACjC,CACF,CACF,EAsCA,SAAS4I,GAAe1I,EAExBpE,EAAmBp3B,EAAS,CAC1B,IAAIvH,EAGJ,GAFA+iC,EAAMe,EAAmBf,CAAG,EAC5BzI,EAAqB,wBAAyByI,EAAI,KAAK,EACnDA,EAAI,MAAQ,WAAaA,EAAI,MAAQ,QACvC,KAAM,iCAAmCA,EAAI,IAAM,0BAErD,IAAMlE,GAAgB7+B,EAAuDuH,GAAQ,gBAAkB,MAAQvH,IAAO,OAASA,EAAK,GAC9HmQ,EAAW,IAAIC,EACfs7B,EAAkB,CAAC5vC,EAAO0vC,EAAWj4B,IAAS,CAClD,IAAIgzB,EAAe,KACfzqC,EACFqU,EAAS,OAAOrU,CAAK,GAErByqC,EAAe,IAAI5B,GAAapxB,EAAM,IAAIswB,EAAcd,EAAI,MAAOA,EAAI,KAAK,EAAGzrB,CAAc,EAC7FnH,EAAS,QAAQ,IAAIo7B,GAAkBC,EAAWjF,CAAY,CAAC,EAEnE,EAEM3H,EAAY4H,GAAQzD,EAAK,IAAM,CAAC,CAAC,EACvC,OAAArE,GAAqBqE,EAAI,MAAOA,EAAI,MAAOpE,EAAmB+M,EAAiB9M,EAAWC,CAAY,EAC/F1uB,EAAS,OAClB,CAoBAX,GAAqB,UAAU,aAAe,SAAUzE,EAAYC,EAAY,CAC9E,KAAK,YAAY,IAAK,CACpB,EAAGD,CACL,EAAGC,CAAU,CACf,EAEAwE,GAAqB,UAAU,KAAO,SAAUrT,EAAMwvC,EAAQ,CAC5D,KAAK,YAAY,OAAQ,CACvB,EAAGxvC,CACL,EAAGwvC,CAAM,CACX,EAMA,IAAMC,GAAa,SAAUC,EAAS,CACpC,IAAMC,EAASt8B,GAAqB,UAAU,IAC9C,OAAAA,GAAqB,UAAU,IAAM,SAAUzE,EAAY5O,EAAM6O,EAAYC,EAAM,CAC7EA,IAAS,SACXA,EAAO4gC,EAAQ,GAEjBC,EAAO,KAAK,KAAM/gC,EAAY5O,EAAM6O,EAAYC,CAAI,CACtD,EACO,UAAY,CACjBuE,GAAqB,UAAU,IAAMs8B,CACvC,CACF,EAMM/B,GAAkB,SAAUA,EAAiB,CACjDD,GAA2BC,CAAe,CAC5C,EA4BA,SAASgC,GAAgB,CACvB,IAAA5C,EACA,IAAAxiC,EACA,QAAAxN,EACA,eAAA6yC,EACA,mBAAAC,EACA,UAAAzqC,EAAY,EACd,EAAG,CACDnI,GAAcF,CAAO,EAKrB,IAAM+yC,EAAqB,IAAIC,GAAmB,qBAAqB,EACjE/C,EAAe,IAAIgD,GAAS,gBAAiBF,CAAkB,EACjExsC,EACJ,OAAIusC,IACFvsC,EAAmB,IAAI0sC,GAAS,qBAAsBF,CAAkB,EACxExsC,EAAiB,aAAa,IAAIwrC,EAAU,qBAAsB,IAAMe,EAAoB,SAAqC,CAAC,GAEpI7C,EAAa,aAAa,IAAI8B,EAAU,gBAAiB,IAAMc,EAAgB,SAAqC,CAAC,EAC9G9C,GAA2BC,EAAKC,EAAc1pC,EAAkBiH,EAAKnF,CAAS,CACvF,CAOAupC,GAAiB","names":["CONSTANTS","assert","assertion","message","assertionError","stringToByteArray$1","str","out","p","c","byteArrayToString","bytes","pos","c1","c2","c3","c4","u","base64","input","webSafe","byteToCharMap","output","i","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","charToByteMap","byte4","DecodeBase64StringError","base64Encode","utf8Bytes","base64urlEncodeWithoutPadding","base64Decode","deepCopy","value","deepExtend","target","source","dateValue","prop","isValidKey","key","getGlobal","getDefaultsFromGlobal","getDefaultsFromEnvVariable","defaultsJsonString","getDefaultsFromCookie","match","decoded","getDefaults","e","getDefaultEmulatorHost","productName","_a","_b","getDefaultEmulatorHostnameAndPort","host","separatorIndex","port","getDefaultAppConfig","getExperimentalSetting","name","Deferred","resolve","reject","callback","error","createMockUserToken","token","projectId","header","project","iat","sub","payload","getUA","isMobileCordova","isCloudflareWorker","isBrowserExtension","runtime","isReactNative","isNodeSdk","CONSTANTS","isIndexedDBAvailable","validateIndexedDBOpenable","resolve","reject","preExist","DB_CHECK_NAME","request","_a","error","ERROR_NAME","FirebaseError","_FirebaseError","code","message","customData","ErrorFactory","service","serviceName","errors","data","fullCode","template","replaceTemplate","fullMessage","PATTERN","_","key","value","jsonEval","str","stringify","decode","token","header","claims","signature","parts","base64Decode","isValidFormat","token","decoded","decode","claims","isAdmin","contains","obj","key","safeGet","isEmpty","map","fn","contextObj","res","deepEqual","a","b","aKeys","bKeys","k","aProp","bProp","isObject","thing","querystring","querystringParams","params","key","value","arrayVal","Sha1","i","buf","offset","W","t","a","b","c","d","e","f","k","bytes","length","lengthMinusBlock","n","inbuf","digest","totalBits","j","createSubscribe","executor","onNoObservers","proxy","ObserverProxy","value","observer","error","nextOrObserver","complete","implementsAnyMethods","noop","unsub","fn","err","implementsAnyMethods","obj","methods","method","noop","errorPrefix","fnName","argName","stringToByteArray","str","out","p","c","high","assert","low","stringLength","i","MAX_VALUE_MILLIS","getModularInstance","service","Component","name","instanceFactory","type","mode","multipleInstances","props","callback","DEFAULT_ENTRY_NAME","Provider","container","identifier","normalizedIdentifier","deferred","Deferred","instance","options","_a","optional","e","component","isComponentEager","instanceIdentifier","instanceDeferred","__async","services","service","opts","normalizedDeferredIdentifier","existingCallbacks","existingInstance","callbacks","normalizeIdentifierForFactory","ComponentContainer","provider","instances","LogLevel","levelStringToEnum","defaultLogLevel","ConsoleMethod","defaultLogHandler","instance","logType","args","now","method","Logger","name","val","instanceOfAny","object","constructors","c","idbProxyableTypes","cursorAdvanceMethods","getIdbProxyableTypes","getCursorAdvanceMethods","cursorRequestMap","transactionDoneMap","transactionStoreNamesMap","transformCache","reverseTransformCache","promisifyRequest","request","promise","resolve","reject","unlisten","success","error","wrap","value","cacheDonePromiseForTransaction","tx","done","complete","idbProxyTraps","target","prop","receiver","replaceTraps","callback","wrapFunction","func","storeNames","args","unwrap","transformCachableValue","newValue","openDB","name","version","blocked","upgrade","blocking","terminated","request","openPromise","wrap","event","db","readMethods","writeMethods","cachedMethods","getMethod","target","prop","targetFuncName","useIndex","isWrite","method","storeName","args","__async","tx","replaceTraps","oldTraps","__spreadProps","__spreadValues","receiver","PlatformLoggerServiceImpl","container","provider","isVersionServiceProvider","service","logString","component","name$q","version$1","logger","Logger","name$p","name$o","name$n","name$m","name$l","name$k","name$j","name$i","name$h","name$g","name$f","name$e","name$d","name$c","name$b","name$a","name$9","name$8","name$7","name$6","name$5","name$4","name$3","name$2","name$1","name","version","DEFAULT_ENTRY_NAME","PLATFORM_LOG_STRING","_apps","_serverApps","_components","_addComponent","app","e","_registerComponent","component","componentName","_components","logger","app","_apps","_addComponent","serverApp","_serverApps","_getProvider","name","heartbeatController","_isFirebaseServerApp","obj","ERRORS","ERROR_FACTORY","ErrorFactory","FirebaseAppImpl","options","config","container","Component","val","SDK_VERSION","version","initializeApp","_options","rawConfig","options","config","DEFAULT_ENTRY_NAME","name","ERROR_FACTORY","getDefaultAppConfig","existingApp","_apps","deepEqual","container","ComponentContainer","component","_components","newApp","FirebaseAppImpl","getApp","name","DEFAULT_ENTRY_NAME","app","_apps","getDefaultAppConfig","initializeApp","ERROR_FACTORY","getApps","registerVersion","libraryKeyOrName","version","variant","_a","library","PLATFORM_LOG_STRING","libraryMismatch","versionMismatch","warning","logger","_registerComponent","Component","DB_NAME","DB_VERSION","STORE_NAME","dbPromise","getDbPromise","openDB","db","oldVersion","e","ERROR_FACTORY","readHeartbeatsFromIndexedDB","app","__async","tx","result","computeKey","FirebaseError","logger","idbGetError","writeHeartbeatsToIndexedDB","heartbeatObject","MAX_HEADER_BYTES","STORED_HEARTBEAT_RETENTION_MAX_MILLIS","HeartbeatServiceImpl","container","HeartbeatStorageImpl","_a","_b","agent","date","getUTCDateString","singleDateHeartbeat","hbTimestamp","heartbeatsToSend","unsentEntries","extractHeartbeatsForHeader","headerString","base64urlEncodeWithoutPadding","heartbeatsCache","maxSize","heartbeatEntry","hb","countBytes","isIndexedDBAvailable","validateIndexedDBOpenable","idbHeartbeatObject","heartbeatsObject","existingHeartbeatsObject","registerCoreComponents","variant","_registerComponent","Component","PlatformLoggerServiceImpl","registerVersion","name$q","version$1","name","version","SDK_VERSION","setSDKVersion","DOMStorageWrapper","domStorage_","key","value","stringify","storedVal","jsonEval","MemoryStorage","contains","createStoragefor","domStorageName","domStorage","PersistentStorage","SessionStorage","logClient","Logger","LUIDGenerator","id","sha1","str","utf8Bytes","stringToByteArray","Sha1","sha1Bytes","base64","buildLogMessage_","varArgs","message","i","arg","logger","firstLog_","enableLogging$1","logger_","persistent","assert","LogLevel","log","logWrapper","prefix","error","fatal","warn","warnIfPageIsSecure","isInvalidJSONNumber","data","executeWhenDOMReady","fn","isNodeSdk","called","wrappedFn","MIN_NAME","MAX_NAME","nameCompare","a","b","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","obj","ObjectToUniqueKey","keys","k","splitStringBySize","segsize","len","dataSegs","c","each","doubleToIEEE754String","v","ebits","fbits","bias","e","f","ln","bits","hexByteString","hexByte","isChromeExtensionContentScript","isWindowsStoreApp","errorForServerCode","code","query","reason","INTEGER_REGEXP_","INTEGER_32_MIN","INTEGER_32_MAX","intVal","exceptionGuard","stack","beingCrawled","setTimeoutNonBlocking","time","timeout","AppCheckTokenProvider","appName_","appCheckProvider","appCheck","forceRefresh","resolve","reject","listener","_a","FirebaseAuthTokenProvider","firebaseOptions_","authProvider_","auth","errorMessage","EmulatorTokenProvider","accessToken","PROTOCOL_VERSION","VERSION_PARAM","TRANSPORT_SESSION_PARAM","REFERER_PARAM","FORGE_REF","FORGE_DOMAIN_RE","LAST_SESSION_PARAM","APPLICATION_ID_PARAM","APP_CHECK_TOKEN_PARAM","WEBSOCKET","LONG_POLLING","RepoInfo","host","secure","namespace","webSocketOnly","nodeAdmin","persistenceKey","includeNamespaceInQueryParams","isUsingEmulator","newHost","protocol","repoInfoNeedsQueryParam","repoInfo","repoInfoConnectionURL","type","params","connURL","pairs","StatsCollection","amount","deepCopy","collections","reporters","statsManagerGetCollection","hashString","statsManagerGetOrCreateReporter","creatorFunction","PacketReceiver","onMessage_","responseNum","callback","requestNum","toProcess","FIREBASE_LONGPOLL_START_PARAM","FIREBASE_LONGPOLL_CLOSE_COMMAND","FIREBASE_LONGPOLL_COMMAND_CB_NAME","FIREBASE_LONGPOLL_DATA_CB_NAME","FIREBASE_LONGPOLL_ID_PARAM","FIREBASE_LONGPOLL_PW_PARAM","FIREBASE_LONGPOLL_SERIAL_PARAM","FIREBASE_LONGPOLL_CALLBACK_ID_PARAM","FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM","FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET","FIREBASE_LONGPOLL_DATA_PARAM","FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM","MAX_URL_DATA_SIZE","SEG_HEADER_SIZE","MAX_PAYLOAD_SIZE","KEEPALIVE_REQUEST_INTERVAL","LP_CONNECT_TIMEOUT","BrowserPollConnection","_BrowserPollConnection","connId","applicationId","appCheckToken","authToken","transportSessionId","lastSessionId","onMessage","onDisconnect","FirebaseIFrameScriptHolder","args","command","arg1","arg2","arg3","arg4","pN","urlParams","connectURL","dataStr","base64data","base64Encode","pw","bytesReceived","_FirebaseIFrameScriptHolder","commandCB","onMessageCB","urlFn","script","iframeContents","iframe","domain","theURL","curDataString","theSeg","segnum","totalsegs","url","serial","doNewRequest","keepaliveTimeout","readyStateCB","loadCB","newScript","rstate","WEBSOCKET_MAX_FRAME_SIZE","WEBSOCKET_KEEPALIVE_INTERVAL","WebSocketImpl","WebSocketConnection","options","device","env","proxy","m","isOldAndroid","oldAndroidRegex","oldAndroidMatch","fullMess","jsonMess","frameCount","mess","remainingData","TransportManager","isWebSocketsAvailable","isSkipPollConnection","transports","transport","UPGRADE_TIMEOUT","DELAY_BEFORE_SENDING_EXTRA_REQUESTS","BYTES_SENT_HEALTHY_OVERRIDE","BYTES_RECEIVED_HEALTHY_OVERRIDE","MESSAGE_TYPE","MESSAGE_DATA","CONTROL_SHUTDOWN","CONTROL_RESET","CONTROL_ERROR","CONTROL_PONG","SWITCH_ACK","END_TRANSMISSION","PING","SERVER_HELLO","Connection","repoInfo_","applicationId_","appCheckToken_","authToken_","onReady_","onDisconnect_","onKill_","conn","onMessageReceived","onConnectionLost","healthyTimeoutMS","everConnected","dataMsg","msg","controlData","cmd","parsedData","layer","payload","handshakePayload","handshake","timestamp","ServerActions","pathString","onComplete","hash","token","stats","EventEmitter","allowedEvents_","eventType","listeners","context","eventData","et","OnlineMonitor","_OnlineMonitor","isMobileCordova","MAX_PATH_DEPTH","MAX_PATH_LENGTH_BYTES","Path","pathOrString","pieceNum","copyTo","newEmptyPath","pathGetFront","path","pathGetLength","pathPopFront","pathGetBack","pathToUrlEncodedString","pathSlice","begin","pathParent","pieces","pathChild","childPathObj","childPieces","pathIsEmpty","newRelativePath","outerPath","innerPath","outer","inner","pathCompare","left","right","leftKeys","rightKeys","cmp","pathEquals","other","j","pathContains","ValidationPath","errorPrefix_","stringLength","validationPathCheckValid","validationPathPush","validationPath","child","validationPathPop","last","validationPathToErrorString","VisibilityMonitor","_VisibilityMonitor","hidden","visibilityChange","visible","RECONNECT_MIN_DELAY","RECONNECT_MAX_DELAY_DEFAULT","RECONNECT_MAX_DELAY_FOR_ADMINS","RECONNECT_DELAY_MULTIPLIER","RECONNECT_DELAY_RESET_TIMEOUT","SERVER_KILL_INTERRUPT_REASON","INVALID_TOKEN_THRESHOLD","PersistentConnection","onDataUpdate_","onConnectStatus_","onServerInfoUpdate_","authTokenProvider_","appCheckTokenProvider_","authOverride_","action","body","onResponse","curReqNum","deferred","Deferred","outstandingGet","index","currentHashFn","tag","queryId","listenSpec","get","req","status","warnings","safeGet","indexSpec","indexPath","credential","isAdmin","authMethod","isValidFormat","requestData","res","queryObj","request","response","result","errorReason","reqNum","sessionId","online","timeSinceLastConnectAttempt","reconnectDelay","__async","onDataMessage","onReady","canceled","connection","closeFn","sendRequestFn","isEmpty","delta","put","q","listen","normalizedPathString","map","statusCode","explanation","queries","clientName","isReactNative","NamedNode","_NamedNode","node","Index","oldNode","newNode","oldWrapped","newWrapped","__EMPTY_NODE","KeyIndex","val","assertionError","indexValue","KEY_INDEX","SortedMapIterator","startKey","comparator","isReverse_","resultGenerator_","LLRBNode","color","SortedMap","n","smallest","nl","nr","blackDepth","LLRBEmptyNode","_SortedMap","comparator_","root_","rightParent","resultGenerator","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","MAX_NODE$2","setMaxNode$1","priorityHashText","priority","validatePriorityNode","priorityNode","__childrenNodeConstructor","LeafNode","value_","priorityNode_","newPriorityNode","childName","childNode","newChildNode","front","exportFormat","toHash","otherLeaf","otherLeafType","thisLeafType","otherIndex","thisIndex","nodeFromJSON$1","MAX_NODE$1","setNodeFromJSON","setMaxNode","PriorityIndex","aPriority","bPriority","indexCmp","PRIORITY_INDEX","LOG_2","Base12Num","length","logBase2","num","bitMask","mask","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","low","high","namedNode","middle","buildFrom12Array","base12","root","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","_defaultIndexMap","fallbackObject","IndexMap","_IndexMap","indexes_","indexSet_","indexKey","sortedMap","indexDefinition","existingChildren","sawIndexedValue","iter","next","newIndex","indexName","newIndexSet","newIndexes","indexedChildren","existingSnap","newChildren","EMPTY_NODE","ChildrenNode","children_","indexMap_","newIndexMap","newPriority","newImmediateChild","numKeys","maxKey","allIntegerKeys","array","childHash","idx","predecessor","minKey","wrappedNode","startPost","iterator","endPost","MAX_NODE","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","MaxNode","USE_HINZE","nodeFromJSON","json","jsonLeaf","children","childrenHavePriority","childSet","sortedChildSet","childData","PathIndex","indexPath_","snap","aChild","bChild","valueNode","ValueIndex","VALUE_INDEX","changeValue","snapshotNode","changeChildAdded","changeChildRemoved","changeChildChanged","oldSnap","changeChildMoved","IndexedFilter","index_","newChild","affectedPath","source","optChangeAccumulator","oldChild","newSnap","RangedFilter","_RangedFilter","isWithinStart","isWithinEnd","filtered","self","startName","endName","LimitedFilter","compareRes","count","childKey","childSnap","changeAccumulator","oldEventCache","newChildNamedNode","windowBoundary","inRange","oldChildSnap","nextChild","compareNext","newEventCache","QueryParams","_QueryParams","copy","queryParamsGetNodeFilter","queryParams","queryParamsLimitToFirst","newLimit","newParams","queryParamsLimitToLast","queryParamsStartAt","queryParamsStartAfter","queryParamsEndAt","queryParamsEndBefore","queryParamsOrderBy","queryParamsToRestQueryStringParameters","qs","orderBy","startParam","endParam","queryParamsGetQueryObject","viewFrom","ReadonlyRestClient","_ReadonlyRestClient","listenId","thisListen","queryStringParameters","querystring","xhr","SnapshotHolder","newSnapshotNode","newSparseSnapshotTree","sparseSnapshotTreeRemember","sparseSnapshotTree","sparseSnapshotTreeForget","tree","sparseSnapshotTreeForEachTree","prefixPath","func","sparseSnapshotTreeForEachChild","StatsListener","collection_","newStats","stat","FIRST_STATS_MIN_TIME","FIRST_STATS_MAX_TIME","REPORT_STATS_INTERVAL","StatsReporter","collection","server_","reportedStats","haveStatsToReport","OperationType","newOperationSourceUser","newOperationSourceServer","newOperationSourceServerTaggedQuery","AckUserWrite","_AckUserWrite","affectedTree","revert","ListenComplete","_ListenComplete","Overwrite","_Overwrite","Merge","_Merge","CacheNode","node_","fullyInitialized_","filtered_","EventGenerator","query_","eventGeneratorGenerateEventsForChanges","eventGenerator","changes","eventCache","eventRegistrations","events","moves","change","eventGeneratorGenerateEventsForType","registrations","filteredChanges","eventGeneratorCompareChanges","materializedChange","eventGeneratorMaterializeSingleChange","registration","aWrapped","bWrapped","newViewCache","serverCache","viewCacheUpdateEventSnap","viewCache","eventSnap","complete","viewCacheUpdateServerSnap","serverSnap","viewCacheGetCompleteEventSnap","viewCacheGetCompleteServerSnap","emptyChildrenSingleton","EmptyChildren","ImmutableTree","_ImmutableTree","childPath","relativePath","predicate","childExistingPathAndValue","toSet","newTree","pathSoFar","accum","pathToFollow","currentRelativePath","CompoundWrite","_CompoundWrite","writeTree_","compoundWriteAddWrite","compoundWrite","rootmost","rootMostPath","subtree","newWriteTree","compoundWriteAddWrites","updates","newWrite","compoundWriteRemoveWrite","compoundWriteHasCompleteWrite","compoundWriteGetCompleteNode","compoundWriteGetCompleteChildren","compoundWriteChildCompoundWrite","shadowingNode","compoundWriteIsEmpty","compoundWriteApply","applySubtreeWrite","writeTree","priorityWrite","writeTreeChildWrites","newWriteTreeRef","writeTreeAddOverwrite","writeId","writeTreeAddMerge","changedChildren","writeTreeGetWrite","record","writeTreeRemoveWrite","s","writeToRemove","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","writeTreeRecordContainsPath_","writeTreeResetTree_","writeRecord","writeTreeLayerTree_","writeTreeDefaultFilter_","write","writes","filter","treeRoot","writePath","deepNode","writeTreeCalcCompleteEventCache","treePath","completeServerCache","writeIdsToExclude","includeHiddenWrites","subMerge","layeredCache","merge","mergeAtPath","writeTreeCalcCompleteEventChildren","completeServerChildren","completeChildren","topLevelSet","writeTreeCalcEventCacheAfterServerOverwrite","existingEventSnap","existingServerSnap","childMerge","writeTreeCalcCompleteChild","writeTreeShadowingWrite","writeTreeCalcIndexedSlice","completeServerData","reverse","toIterate","nodes","writeTreeRefCalcCompleteEventCache","writeTreeRef","writeTreeRefCalcCompleteEventChildren","writeTreeRefCalcEventCacheAfterServerOverwrite","writeTreeRefShadowingWrite","writeTreeRefCalcIndexedSlice","writeTreeRefCalcCompleteChild","existingServerCache","writeTreeRefChild","ChildChangeAccumulator","oldChange","oldType","NoCompleteChildSource_","NO_COMPLETE_CHILD_SOURCE","WriteTreeCompleteChildSource","writes_","viewCache_","optCompleteServerCache_","serverNode","newViewProcessor","viewProcessorAssertIndexed","viewProcessor","viewProcessorApplyOperation","oldViewCache","operation","writesCache","completeCache","accumulator","filterServerNode","overwrite","viewProcessorApplyUserOverwrite","viewProcessorApplyServerOverwrite","viewProcessorApplyUserMerge","viewProcessorApplyServerMerge","ackUserWrite","viewProcessorRevertUserWrite","viewProcessorAckUserWrite","viewProcessorListenComplete","viewProcessorMaybeAddValueEvent","isLeafOrEmpty","oldCompleteSnap","viewProcessorGenerateEventCacheAfterServerEvent","changePath","oldEventSnap","completeEventChildren","completeNode","oldEventNode","updatedPriority","childChangePath","newEventChild","eventChildUpdate","changedSnap","oldServerSnap","newServerCache","serverFilter","newServerNode","newEventSnap","viewProcessorCacheHasChild","curViewCache","viewProcessorApplyMerge","viewMergeTree","serverChild","childMergeTree","isUnknownDeepMerge","ackPath","mergePath","serverCachePath","oldServerNode","serverChildren","View","initialViewCache","indexFilter","initialServerCache","initialEventCache","viewGetServerCache","view","viewGetCompleteNode","viewGetCompleteServerCache","cache","viewIsEmpty","viewAddEventRegistration","eventRegistration","viewRemoveEventRegistration","cancelError","cancelEvents","maybeEvent","remaining","existing","viewApplyOperation","viewGenerateEventsForChanges_","viewGetInitialEvents","initialChanges","referenceConstructor$1","SyncPoint","syncPointSetReferenceConstructor","syncPointGetReferenceConstructor","syncPointIsEmpty","syncPoint","syncPointApplyOperation","optCompleteServerCache","syncPointGetView","serverCacheComplete","eventCacheComplete","syncPointAddEventRegistration","syncPointRemoveEventRegistration","removed","hadCompleteView","syncPointHasCompleteView","viewQueryId","syncPointGetQueryViews","syncPointGetCompleteServerCache","syncPointViewForQuery","syncPointGetCompleteView","syncPointViewExistsForQuery","referenceConstructor","syncTreeSetReferenceConstructor","syncTreeGetReferenceConstructor","syncTreeNextQueryTag_","SyncTree","listenProvider_","syncTreeApplyUserOverwrite","syncTree","newData","syncTreeApplyOperationToSyncPoints_","syncTreeApplyUserMerge","changeTree","syncTreeAckUserWrite","syncTreeApplyServerOverwrite","syncTreeApplyServerMerge","syncTreeApplyListenComplete","syncTreeApplyTaggedListenComplete","queryKey","syncTreeQueryKeyForTag_","r","syncTreeParseQueryKey_","queryPath","op","syncTreeApplyTaggedOperation_","syncTreeRemoveEventRegistration","skipListenerDedup","maybeSyncPoint","removedAndEvents","removingDefault","covered","parentSyncPoint","newViews","syncTreeCollectDistinctViewsForSubTree_","newQuery","syncTreeCreateListenerForView_","syncTreeQueryForListening_","syncTreeTagForQuery","queryToRemove","tagToRemove","syncTreeMakeQueryKey_","syncTreeRemoveTags_","syncTreeApplyTaggedQueryOverwrite","syncTreeApplyTaggedQueryMerge","syncTreeAddEventRegistration","skipSetupListener","foundAncestorDefaultView","pathToSyncPoint","sp","childSyncPoint","viewAlreadyExists","syncTreeGetNextQueryTag_","syncTreeSetupListener_","syncTreeCalcCompleteEventCache","syncTreeGetServerValue","serverCacheNode","syncTreeApplyOperationHelper_","syncPointTree","syncTreeApplyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","splitIndex","maybeChildSyncPoint","childMap","views","_key","childViews","removedQuery","removedQueryKey","removedQueryTag","queriesToStop","childQueries","queryToStop","ExistingValueProvider","_ExistingValueProvider","DeferredValueProvider","_DeferredValueProvider","generateWithValues","values","resolveDeferredLeafValue","existingVal","serverValues","resolveScalarDeferredValue","resolveComplexDeferredValue","unused","existingNode","resolveDeferredValueTree","resolveDeferredValue","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","Tree","parent","treeSubTree","pathObj","treeGetValue","treeSetValue","treeUpdateParents","treeHasChildren","treeIsEmpty","treeForEachChild","treeForEachDescendant","includeSelf","childrenFirst","treeForEachAncestor","treeGetPath","treeUpdateChild","childEmpty","childExists","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","MAX_LEAF_SIZE_","isValidKey","isValidPathString","isValidRootPathString","isValidPriority","validateFirebaseDataArg","fnName","optional","validateFirebaseData","errorPrefix","path_","hasDotValue","hasActualChild","validateFirebaseMergePaths","mergePaths","curPath","prevPath","validateFirebaseMergeDataArg","errorPrefix$1","validatePriority","validateKey","argumentName","validatePathString","validateRootPathString","validateWritablePath","validateUrl","parsedUrl","EventQueue","eventQueueQueueEvents","eventQueue","eventDataList","currList","eventQueueRaiseEventsAtPath","eventQueueRaiseQueuedEventsMatchingPredicate","eventPath","eventQueueRaiseEventsForChangedPath","changedPath","sentAll","eventList","eventListRaise","eventFn","INTERRUPT_REASON","MAX_TRANSACTION_RETRIES","Repo","forceRestClient_","appCheckProvider_","repoStart","repo","appId","authOverride","isMerge","repoOnDataUpdate","repoOnConnectStatus","connectStatus","repoOnServerInfoUpdate","infoEvents","repoUpdateInfo","repoServerTime","offset","repoGenerateServerValues","taggedChildren","raw","taggedSnap","repoRerunTransactions","repoRunOnDisconnectEvents","repoGetNextWriteId","repoGetValue","cached","err","repoLog","repoSetWithPriority","newVal","newNodeUnresolved","success","clearEvents","repoCallOnCompleteCallback","repoAbortTransactions","repoUpdate","childrenToMerge","empty","changedKey","changedValue","resolvedOnDisconnectTree","resolved","repoOnDisconnectCancel","repoOnDisconnectSet","repoOnDisconnectSetWithPriority","repoOnDisconnectUpdate","repoAddEventCallbackForQuery","repoRemoveEventCallbackForQuery","repoInterrupt","repoResume","repoStartTransaction","transactionUpdate","unwatcher","applyLocally","transaction","currentState","repoGetLatestState","queueNode","nodeQueue","priorityForNode","repoSendReadyTransactions","excludeSets","repoPruneCompletedTransactionsBelowNode","queue","repoBuildTransactionQueue","repoSendTransactionQueue","setsToIgnore","txn","latestState","snapToSend","latestHash","dataToSend","pathToSend","callbacks","rootMostTransactionNode","repoGetAncestorTransactionNode","repoRerunTransactionQueue","abortTransaction","abortReason","currentNode","newDataNode","oldWriteId","newNodeResolved","transactionNode","transactionQueue","repoAggregateTransactionQueuesForNode","to","from","repoAbortTransactionsOnNode","lastSent","decodePath","pathStringDecoded","piece","decodeQuery","queryString","results","segment","kv","parseRepoInfo","dataURL","parseDatabaseURL","subdomain","scheme","port","colonInd","slashInd","questionMarkInd","hostWithoutPort","dotInd","PUSH_CHARS","nextPushId","lastPushTime","lastRandChars","now","duplicateTime","timeStampChars","DataEvent","snapshot","prevName","ref","CancelEvent","CallbackContext","snapshotCallback","cancelCallback","expDataSnapshot","previousChildName","OnDisconnect","_repo","_path","QueryImpl","_QueryImpl","_queryParams","_orderByCalled","ReferenceImpl","getModularInstance","sameRepo","samePath","sameQueryIdentifier","validateNoPreviousOrderByCall","validateQueryEndpoints","startNode","endNode","tooManyArgsError","wrongArgTypeError","validateLimit","_ReferenceImpl","parentPath","DataSnapshot","_DataSnapshot","_node","_index","childRef","db","refFromURL","parsedURL","push","thenablePushRef","pushRef","promise","set","remove","setPriority","setWithPriority","update","callbackContext","container","ValueEventRegistration","_ValueEventRegistration","ChildEventRegistration","_ChildEventRegistration","eventToCheck","addEventListener","cancelCallbackOrListenOptions","userCallback","onceCallback","dataSnapshot","onValue","onChildAdded","onChildChanged","onChildMoved","onChildRemoved","off","expCallback","QueryConstraint","QueryEndAtConstraint","_value","endAt","QueryEndBeforeConstraint","endBefore","QueryStartAtConstraint","startAt","QueryStartAfterConstraint","startAfter","QueryLimitToFirstConstraint","_limit","limitToFirst","limit","QueryLimitToLastConstraint","limitToLast","QueryOrderByChildConstraint","parsedPath","orderByChild","QueryOrderByKeyConstraint","orderByKey","QueryOrderByPriorityConstraint","orderByPriority","QueryOrderByValueConstraint","orderByValue","QueryEqualToValueConstraint","equalTo","queryConstraints","queryImpl","constraint","FIREBASE_DATABASE_EMULATOR_HOST_VAR","repos","useRestClient","repoManagerApplyEmulatorSettings","tokenProvider","repoManagerDatabaseFromApp","app","authProvider","dbUrl","isEmulator","dbEmulatorHost","authTokenProvider","repoManagerCreateRepo","Database","repoManagerDeleteRepo","appName","appRepos","repoManagerForceRestClient","forceRestClient","_repoInternal","apiName","checkTransportInit","forceWebSockets","forceLongPolling","getDatabase","getApp","_getProvider","emulator","getDefaultEmulatorHostnameAndPort","connectDatabaseEmulator","createMockUserToken","goOffline","goOnline","enableLogging","registerDatabase","variant","_registerComponent","Component","registerVersion","SERVER_TIMESTAMP","serverTimestamp","increment","TransactionResult","committed","runTransaction","promiseComplete","onEcho","hijackHash","newHash","oldPut","_initStandalone","customAuthImpl","customAppCheckImpl","componentContainer","ComponentContainer","Provider"],"x_google_ignoreList":[0,1,2,3,4,5,6]}