{"version":3,"file":"firebase-database.js","sources":["../../node_modules/tslib/tslib.es6.js","../util/src/crypt.ts","../util/src/constants.ts","../util/src/assert.ts","../util/src/deepCopy.ts","../util/src/deferred.ts","../util/src/environment.ts","../util/src/errors.ts","../util/src/json.ts","../util/src/jwt.ts","../util/src/obj.ts","../util/src/sha1.ts","../util/src/validation.ts","../util/src/utf8.ts","../logger/src/logger.ts","../component/src/component.ts","../database/src/core/storage/DOMStorageWrapper.ts","../database/src/core/storage/MemoryStorage.ts","../database/src/core/storage/storage.ts","../database/src/core/util/util.ts","../database/src/core/util/Path.ts","../database/src/realtime/Constants.ts","../database/src/core/RepoInfo.ts","../database/src/core/util/libs/parser.ts","../database/src/core/util/validation.ts","../database/src/api/onDisconnect.ts","../database/src/api/TransactionResult.ts","../database/src/core/util/NextPushId.ts","../database/src/core/snap/Node.ts","../database/src/core/snap/indexes/Index.ts","../database/src/core/snap/indexes/KeyIndex.ts","../database/src/core/snap/snap.ts","../database/src/core/snap/LeafNode.ts","../database/src/core/snap/indexes/PriorityIndex.ts","../database/src/core/util/SortedMap.ts","../database/src/core/snap/childSet.ts","../database/src/core/snap/IndexMap.ts","../database/src/core/snap/ChildrenNode.ts","../database/src/core/snap/comparators.ts","../database/src/core/snap/nodeFromJSON.ts","../database/src/core/snap/indexes/ValueIndex.ts","../database/src/core/snap/indexes/PathIndex.ts","../database/src/api/DataSnapshot.ts","../database/src/core/view/Event.ts","../database/src/core/view/EventRegistration.ts","../database/src/api/Query.ts","../database/src/core/util/ServerValues.ts","../database/src/core/SparseSnapshotTree.ts","../database/src/core/operation/Operation.ts","../database/src/core/operation/AckUserWrite.ts","../database/src/core/util/ImmutableTree.ts","../database/src/core/operation/ListenComplete.ts","../database/src/core/operation/Overwrite.ts","../database/src/core/operation/Merge.ts","../database/src/core/view/CacheNode.ts","../database/src/core/view/ViewCache.ts","../database/src/core/view/Change.ts","../database/src/core/view/filter/IndexedFilter.ts","../database/src/core/view/ChildChangeAccumulator.ts","../database/src/core/view/CompleteChildSource.ts","../database/src/core/view/ViewProcessor.ts","../database/src/core/view/EventGenerator.ts","../database/src/core/view/View.ts","../database/src/core/SyncPoint.ts","../database/src/core/CompoundWrite.ts","../database/src/core/WriteTree.ts","../database/src/core/SyncTree.ts","../database/src/core/SnapshotHolder.ts","../database/src/core/AuthTokenProvider.ts","../database/src/core/stats/StatsCollection.ts","../database/src/core/stats/StatsManager.ts","../database/src/core/stats/StatsListener.ts","../database/src/core/stats/StatsReporter.ts","../database/src/core/view/EventQueue.ts","../database/src/core/util/EventEmitter.ts","../database/src/core/util/VisibilityMonitor.ts","../database/src/core/util/OnlineMonitor.ts","../database/src/realtime/polling/PacketReceiver.ts","../database/src/realtime/BrowserPollConnection.ts","../database/src/core/version.ts","../database/src/realtime/WebSocketConnection.ts","../database/src/realtime/TransportManager.ts","../database/src/realtime/Connection.ts","../database/src/core/ServerActions.ts","../database/src/core/PersistentConnection.ts","../database/src/core/ReadonlyRestClient.ts","../util/src/query.ts","../database/src/core/Repo.ts","../database/src/core/view/filter/RangedFilter.ts","../database/src/core/view/filter/LimitedFilter.ts","../database/src/core/view/QueryParams.ts","../database/src/api/Reference.ts","../database/src/core/util/Tree.ts","../database/src/core/Repo_transaction.ts","../database/src/core/RepoManager.ts","../database/src/api/Database.ts","../database/src/api/internal.ts","../database/src/api/test_access.ts","../database/index.ts"],"sourcesContent":["/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n    for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n};\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n    result.default = mod;\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, privateMap) {\r\n    if (!privateMap.has(receiver)) {\r\n        throw new TypeError(\"attempted to get private field on non-instance\");\r\n    }\r\n    return privateMap.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, privateMap, value) {\r\n    if (!privateMap.has(receiver)) {\r\n        throw new TypeError(\"attempted to set private field on non-instance\");\r\n    }\r\n    privateMap.set(receiver, value);\r\n    return value;\r\n}\r\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nconst stringToByteArray = function(str: string): number[] {\n  // TODO(user): Use native implementations if/when available\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n    if (c < 128) {\n      out[p++] = c;\n    } else if (c < 2048) {\n      out[p++] = (c >> 6) | 192;\n      out[p++] = (c & 63) | 128;\n    } else if (\n      (c & 0xfc00) === 0xd800 &&\n      i + 1 < str.length &&\n      (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00\n    ) {\n      // Surrogate Pair\n      c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\n      out[p++] = (c >> 18) | 240;\n      out[p++] = ((c >> 12) & 63) | 128;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    }\n  }\n  return out;\n};\n\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param bytes Array of numbers representing characters.\n * @return Stringification of the array.\n */\nconst byteArrayToString = function(bytes: number[]): string {\n  // TODO(user): Use native implementations if/when available\n  const out: string[] = [];\n  let pos = 0,\n    c = 0;\n  while (pos < bytes.length) {\n    const c1 = bytes[pos++];\n    if (c1 < 128) {\n      out[c++] = String.fromCharCode(c1);\n    } else if (c1 > 191 && c1 < 224) {\n      const c2 = bytes[pos++];\n      out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\n    } else if (c1 > 239 && c1 < 365) {\n      // Surrogate Pair\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      const c4 = bytes[pos++];\n      const u =\n        (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -\n        0x10000;\n      out[c++] = String.fromCharCode(0xd800 + (u >> 10));\n      out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\n    } else {\n      const c2 = bytes[pos++];\n      const c3 = bytes[pos++];\n      out[c++] = String.fromCharCode(\n        ((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)\n      );\n    }\n  }\n  return out.join('');\n};\n\ninterface Base64 {\n  byteToCharMap_: { [key: number]: string } | null;\n  charToByteMap_: { [key: string]: number } | null;\n  byteToCharMapWebSafe_: { [key: number]: string } | null;\n  charToByteMapWebSafe_: { [key: string]: number } | null;\n  ENCODED_VALS_BASE: string;\n  readonly ENCODED_VALS: string;\n  readonly ENCODED_VALS_WEBSAFE: string;\n  HAS_NATIVE_SUPPORT: boolean;\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string;\n  encodeString(input: string, webSafe?: boolean): string;\n  decodeString(input: string, webSafe: boolean): string;\n  decodeStringToByteArray(input: string, webSafe: boolean): number[];\n  init_(): void;\n}\n\n// We define it as an object literal instead of a class because a class compiled down to es5 can't\n// be treeshaked. https://github.com/rollup/rollup/issues/1691\n// Static lookup maps, lazily populated by init_()\nexport const base64: Base64 = {\n  /**\n   * Maps bytes to characters.\n   */\n  byteToCharMap_: null,\n\n  /**\n   * Maps characters to bytes.\n   */\n  charToByteMap_: null,\n\n  /**\n   * Maps bytes to websafe characters.\n   * @private\n   */\n  byteToCharMapWebSafe_: null,\n\n  /**\n   * Maps websafe characters to bytes.\n   * @private\n   */\n  charToByteMapWebSafe_: null,\n\n  /**\n   * Our default alphabet, shared between\n   * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n   */\n  ENCODED_VALS_BASE:\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n  /**\n   * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n   */\n  get ENCODED_VALS() {\n    return this.ENCODED_VALS_BASE + '+/=';\n  },\n\n  /**\n   * Our websafe alphabet.\n   */\n  get ENCODED_VALS_WEBSAFE() {\n    return this.ENCODED_VALS_BASE + '-_.';\n  },\n\n  /**\n   * Whether this browser supports the atob and btoa functions. This extension\n   * started at Mozilla but is now implemented by many browsers. We use the\n   * ASSUME_* variables to avoid pulling in the full useragent detection library\n   * but still allowing the standard per-browser compilations.\n   *\n   */\n  HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n  /**\n   * Base64-encode an array of bytes.\n   *\n   * @param input An array of bytes (numbers with\n   *     value in [0, 255]) to encode.\n   * @param webSafe Boolean indicating we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string {\n    if (!Array.isArray(input)) {\n      throw Error('encodeByteArray takes an array as a parameter');\n    }\n\n    this.init_();\n\n    const byteToCharMap = webSafe\n      ? this.byteToCharMapWebSafe_!\n      : this.byteToCharMap_!;\n\n    const output = [];\n\n    for (let i = 0; i < input.length; i += 3) {\n      const byte1 = input[i];\n      const haveByte2 = i + 1 < input.length;\n      const byte2 = haveByte2 ? input[i + 1] : 0;\n      const haveByte3 = i + 2 < input.length;\n      const byte3 = haveByte3 ? input[i + 2] : 0;\n\n      const outByte1 = byte1 >> 2;\n      const outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n      let outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n      let outByte4 = byte3 & 0x3f;\n\n      if (!haveByte3) {\n        outByte4 = 64;\n\n        if (!haveByte2) {\n          outByte3 = 64;\n        }\n      }\n\n      output.push(\n        byteToCharMap[outByte1],\n        byteToCharMap[outByte2],\n        byteToCharMap[outByte3],\n        byteToCharMap[outByte4]\n      );\n    }\n\n    return output.join('');\n  },\n\n  /**\n   * Base64-encode a string.\n   *\n   * @param input A string to encode.\n   * @param webSafe If true, we should use the\n   *     alternative alphabet.\n   * @return The base64 encoded string.\n   */\n  encodeString(input: string, webSafe?: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return btoa(input);\n    }\n    return this.encodeByteArray(stringToByteArray(input), webSafe);\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * @param input to decode.\n   * @param webSafe True if we should use the\n   *     alternative alphabet.\n   * @return string representing the decoded value.\n   */\n  decodeString(input: string, webSafe: boolean): string {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n      return atob(input);\n    }\n    return byteArrayToString(this.decodeStringToByteArray(input, webSafe));\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * In base-64 decoding, groups of four characters are converted into three\n   * bytes.  If the encoder did not apply padding, the input length may not\n   * be a multiple of 4.\n   *\n   * In this case, the last group will have fewer than 4 characters, and\n   * padding will be inferred.  If the group has one or two characters, it decodes\n   * to one byte.  If the group has three characters, it decodes to two bytes.\n   *\n   * @param input Input to decode.\n   * @param webSafe True if we should use the web-safe alphabet.\n   * @return bytes representing the decoded value.\n   */\n  decodeStringToByteArray(input: string, webSafe: boolean): number[] {\n    this.init_();\n\n    const charToByteMap = webSafe\n      ? this.charToByteMapWebSafe_!\n      : this.charToByteMap_!;\n\n    const output: number[] = [];\n\n    for (let i = 0; i < input.length; ) {\n      const byte1 = charToByteMap[input.charAt(i++)];\n\n      const haveByte2 = i < input.length;\n      const byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n      ++i;\n\n      const haveByte3 = i < input.length;\n      const byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      const haveByte4 = i < input.length;\n      const byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n        throw Error();\n      }\n\n      const outByte1 = (byte1 << 2) | (byte2 >> 4);\n      output.push(outByte1);\n\n      if (byte3 !== 64) {\n        const outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n        output.push(outByte2);\n\n        if (byte4 !== 64) {\n          const outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n\n    return output;\n  },\n\n  /**\n   * Lazy static initialization function. Called before\n   * accessing any of the static map variables.\n   * @private\n   */\n  init_() {\n    if (!this.byteToCharMap_) {\n      this.byteToCharMap_ = {};\n      this.charToByteMap_ = {};\n      this.byteToCharMapWebSafe_ = {};\n      this.charToByteMapWebSafe_ = {};\n\n      // We want quick mappings back and forth, so we precompute two maps.\n      for (let i = 0; i < this.ENCODED_VALS.length; i++) {\n        this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n        this.charToByteMap_[this.byteToCharMap_[i]] = i;\n        this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n        this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n\n        // Be forgiving when decoding and correctly decode both encodings.\n        if (i >= this.ENCODED_VALS_BASE.length) {\n          this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n          this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n        }\n      }\n    }\n  }\n};\n\n/**\n * URL-safe base64 encoding\n */\nexport const base64Encode = function(str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  return base64.encodeByteArray(utf8Bytes, true);\n};\n\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param str To be decoded\n * @return Decoded result, if possible\n */\nexport const base64Decode = function(str: string): string | null {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\n */\n\nexport const CONSTANTS = {\n  /**\n   * @define {boolean} Whether this is the client Node.js SDK.\n   */\n  NODE_CLIENT: false,\n  /**\n   * @define {boolean} Whether this is the Admin Node.js SDK.\n   */\n  NODE_ADMIN: false,\n\n  /**\n   * Firebase SDK Version\n   */\n  SDK_VERSION: '${JSCORE_VERSION}'\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CONSTANTS } from './constants';\n\n/**\n * Throws an error if the provided assertion is falsy\n */\nexport const assert = function(assertion: unknown, message: string): void {\n  if (!assertion) {\n    throw assertionError(message);\n  }\n};\n\n/**\n * Returns an Error object suitable for throwing.\n */\nexport const assertionError = function(message: string): Error {\n  return new Error(\n    'Firebase Database (' +\n      CONSTANTS.SDK_VERSION +\n      ') INTERNAL ASSERT FAILED: ' +\n      message\n  );\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nexport function deepCopy<T>(value: T): T {\n  return deepExtend(undefined, value) as T;\n}\n\n/**\n * Copy properties from source to target (recursively allows extension\n * of Objects and Arrays).  Scalar values in the target are over-written.\n * If target is undefined, an object of the appropriate type will be created\n * (and returned).\n *\n * We recursively copy all child properties of plain Objects in the source- so\n * that namespace- like dictionaries are merged.\n *\n * Note that the target can be a function, in which case the properties in\n * the source Object are copied onto it as static properties of the Function.\n */\nexport function deepExtend(target: unknown, source: unknown): unknown {\n  if (!(source instanceof Object)) {\n    return source;\n  }\n\n  switch (source.constructor) {\n    case Date:\n      // Treat Dates like scalars; if the target date object had any child\n      // properties - they will be lost!\n      const dateValue = source as Date;\n      return new Date(dateValue.getTime());\n\n    case Object:\n      if (target === undefined) {\n        target = {};\n      }\n      break;\n    case Array:\n      // Always copy the array source and overwrite the target.\n      target = [];\n      break;\n\n    default:\n      // Not a plain Object - treat it as a scalar.\n      return source;\n  }\n\n  for (const prop in source) {\n    if (!source.hasOwnProperty(prop)) {\n      continue;\n    }\n    (target as { [key: string]: unknown })[prop] = deepExtend(\n      (target as { [key: string]: unknown })[prop],\n      (source as { [key: string]: unknown })[prop]\n    );\n  }\n\n  return target;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport class Deferred<R> {\n  promise: Promise<R>;\n  reject: (value?: unknown) => void = () => {};\n  resolve: (value?: unknown) => void = () => {};\n  constructor() {\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = resolve as (value?: unknown) => void;\n      this.reject = reject as (value?: unknown) => void;\n    });\n  }\n\n  /**\n   * Our API internals are not promiseified and cannot because our callback APIs have subtle expectations around\n   * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\n   * and returns a node-style callback which will resolve or reject the Deferred's promise.\n   */\n  wrapCallback(\n    callback?: (error?: unknown, value?: unknown) => void\n  ): (error: unknown, value?: unknown) => void {\n    return (error, value?) => {\n      if (error) {\n        this.reject(error);\n      } else {\n        this.resolve(value);\n      }\n      if (typeof callback === 'function') {\n        // Attaching noop handler just in case developer wasn't expecting\n        // promises\n        this.promise.catch(() => {});\n\n        // Some of our callbacks don't expect a value and our own tests\n        // assert that the parameter length is 1\n        if (callback.length === 1) {\n          callback(error);\n        } else {\n          callback(error, value);\n        }\n      }\n    };\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CONSTANTS } from './constants';\n\n/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return user agent string\n */\nexport function getUA(): string {\n  if (\n    typeof navigator !== 'undefined' &&\n    typeof navigator['userAgent'] === 'string'\n  ) {\n    return navigator['userAgent'];\n  } else {\n    return '';\n  }\n}\n\n/**\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\n *\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap\n * in the Ripple emulator) nor Cordova `onDeviceReady`, which would normally\n * wait for a callback.\n */\nexport function isMobileCordova(): boolean {\n  return (\n    typeof window !== 'undefined' &&\n    // @ts-ignore Setting up an broadly applicable index signature for Window\n    // just to deal with this case would probably be a bad idea.\n    !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\n    /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA())\n  );\n}\n\n/**\n * Detect Node.js.\n *\n * @return true if Node.js environment is detected.\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\nexport function isNode(): boolean {\n  try {\n    return (\n      Object.prototype.toString.call(global.process) === '[object process]'\n    );\n  } catch (e) {\n    return false;\n  }\n}\n\n/**\n * Detect Browser Environment\n */\nexport function isBrowser(): boolean {\n  return typeof self === 'object' && self.self === self;\n}\n\n/**\n * Detect browser extensions (Chrome and Firefox at least).\n */\ninterface BrowserRuntime {\n  id?: unknown;\n}\ndeclare const chrome: { runtime?: BrowserRuntime };\ndeclare const browser: { runtime?: BrowserRuntime };\nexport function isBrowserExtension(): boolean {\n  const runtime =\n    typeof chrome === 'object'\n      ? chrome.runtime\n      : typeof browser === 'object'\n      ? browser.runtime\n      : undefined;\n  return typeof runtime === 'object' && runtime.id !== undefined;\n}\n\n/**\n * Detect React Native.\n *\n * @return true if ReactNative environment is detected.\n */\nexport function isReactNative(): boolean {\n  return (\n    typeof navigator === 'object' && navigator['product'] === 'ReactNative'\n  );\n}\n\n/** Detects Electron apps. */\nexport function isElectron(): boolean {\n  return getUA().indexOf('Electron/') >= 0;\n}\n\n/** Detects Internet Explorer. */\nexport function isIE(): boolean {\n  const ua = getUA();\n  return ua.indexOf('MSIE ') >= 0 || ua.indexOf('Trident/') >= 0;\n}\n\n/** Detects Universal Windows Platform apps. */\nexport function isUWP(): boolean {\n  return getUA().indexOf('MSAppHost/') >= 0;\n}\n\n/**\n * Detect whether the current SDK build is the Node version.\n *\n * @return true if it's the Node SDK build.\n */\nexport function isNodeSdk(): boolean {\n  return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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.code === 'service/file-not-found') {\n *       console.log(\"Could not read file: \" + e['file']);\n *     }\n *   }\n */\n\nexport type ErrorMap<ErrorCode extends string> = {\n  readonly [K in ErrorCode]: string;\n};\n\nconst ERROR_NAME = 'FirebaseError';\n\nexport interface StringLike {\n  toString(): string;\n}\n\nexport interface ErrorData {\n  [key: string]: StringLike | undefined;\n}\n\nexport interface FirebaseError extends Error, ErrorData {\n  // Unique code for error - format is service/error-code-string.\n  readonly code: string;\n\n  // Developer-friendly error message.\n  readonly message: string;\n\n  // Always 'FirebaseError'.\n  readonly name: typeof ERROR_NAME;\n\n  // Where available - stack backtrace in a string.\n  readonly stack?: string;\n}\n\n// Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\nexport class FirebaseError extends Error {\n  readonly name = ERROR_NAME;\n\n  constructor(readonly code: string, message: string) {\n    super(message);\n\n    // Fix For ES5\n    // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n    Object.setPrototypeOf(this, FirebaseError.prototype);\n\n    // Maintains proper stack trace for where our error was thrown.\n    // Only available on V8.\n    if (Error.captureStackTrace) {\n      Error.captureStackTrace(this, ErrorFactory.prototype.create);\n    }\n  }\n}\n\nexport class ErrorFactory<\n  ErrorCode extends string,\n  ErrorParams extends { readonly [K in ErrorCode]?: ErrorData } = {}\n> {\n  constructor(\n    private readonly service: string,\n    private readonly serviceName: string,\n    private readonly errors: ErrorMap<ErrorCode>\n  ) {}\n\n  create<K extends ErrorCode>(\n    code: K,\n    ...data: K extends keyof ErrorParams ? [ErrorParams[K]] : []\n  ): FirebaseError {\n    const customData = (data[0] as ErrorData) || {};\n    const fullCode = `${this.service}/${code}`;\n    const template = this.errors[code];\n\n    const message = template ? replaceTemplate(template, customData) : 'Error';\n    // Service Name: Error message (service/code).\n    const fullMessage = `${this.serviceName}: ${message} (${fullCode}).`;\n\n    const error = new FirebaseError(fullCode, fullMessage);\n\n    // Keys with an underscore at the end of their name are not included in\n    // error.data for some reason.\n    // TODO: Replace with Object.entries when lib is updated to es2017.\n    for (const key of Object.keys(customData)) {\n      if (key.slice(-1) !== '_') {\n        if (key in error) {\n          console.warn(\n            `Overwriting FirebaseError base field \"${key}\" can cause unexpected behavior.`\n          );\n        }\n        error[key] = customData[key];\n      }\n    }\n\n    return error;\n  }\n}\n\nfunction replaceTemplate(template: string, data: ErrorData): string {\n  return template.replace(PATTERN, (_, key) => {\n    const value = data[key];\n    return value != null ? value.toString() : `<${key}?>`;\n  });\n}\n\nconst PATTERN = /\\{\\$([^}]+)}/g;\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Evaluates a JSON string into a javascript object.\n *\n * @param {string} str A string containing JSON.\n * @return {*} The javascript object representing the specified JSON.\n */\nexport function jsonEval(str: string): unknown {\n  return JSON.parse(str);\n}\n\n/**\n * Returns JSON representing a javascript object.\n * @param {*} data Javascript object to be stringified.\n * @return {string} The JSON contents of the object.\n */\nexport function stringify(data: unknown): string {\n  return JSON.stringify(data);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64Decode } from './crypt';\nimport { jsonEval } from './json';\n\ninterface Claims {\n  [key: string]: {};\n}\n\ninterface DecodedToken {\n  header: object;\n  claims: Claims;\n  data: object;\n  signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token into constituent parts.\n *\n * Notes:\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const decode = function(token: string): DecodedToken {\n  let header = {},\n    claims: Claims = {},\n    data = {},\n    signature = '';\n\n  try {\n    const parts = token.split('.');\n    header = jsonEval(base64Decode(parts[0]) || '') as object;\n    claims = jsonEval(base64Decode(parts[1]) || '') as Claims;\n    signature = parts[2];\n    data = claims['d'] || {};\n    delete claims['d'];\n  } catch (e) {}\n\n  return {\n    header,\n    claims,\n    data,\n    signature\n  };\n};\n\ninterface DecodedToken {\n  header: object;\n  claims: Claims;\n  data: object;\n  signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidTimestamp = function(token: string): boolean {\n  const claims: Claims = decode(token).claims;\n  const now: number = Math.floor(new Date().getTime() / 1000);\n  let validSince: number = 0,\n    validUntil: number = 0;\n\n  if (typeof claims === 'object') {\n    if (claims.hasOwnProperty('nbf')) {\n      validSince = claims['nbf'] as number;\n    } else if (claims.hasOwnProperty('iat')) {\n      validSince = claims['iat'] as number;\n    }\n\n    if (claims.hasOwnProperty('exp')) {\n      validUntil = claims['exp'] as number;\n    } else {\n      // token will expire after 24h by default\n      validUntil = validSince + 86400;\n    }\n  }\n\n  return (\n    !!now &&\n    !!validSince &&\n    !!validUntil &&\n    now >= validSince &&\n    now <= validUntil\n  );\n};\n\n/**\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\n *\n * Notes:\n * - May return null if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const issuedAtTime = function(token: string): number | null {\n  const claims: Claims = decode(token).claims;\n  if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n    return claims['iat'] as number;\n  }\n  return null;\n};\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidFormat = function(token: string): boolean {\n  const decoded = decode(token),\n    claims = decoded.claims;\n\n  return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\n};\n\n/**\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isAdmin = function(token: string): boolean {\n  const claims: Claims = decode(token).claims;\n  return typeof claims === 'object' && claims['admin'] === true;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport function contains<T extends object>(obj: T, key: string): boolean {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexport function safeGet<T extends object, K extends keyof T>(\n  obj: T,\n  key: K\n): T[K] | undefined {\n  if (Object.prototype.hasOwnProperty.call(obj, key)) {\n    return obj[key];\n  } else {\n    return undefined;\n  }\n}\n\nexport function isEmpty(obj: object): obj is {} {\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function map<K extends string, V, U>(\n  obj: { [key in K]: V },\n  fn: (value: V, key: K, obj: { [key in K]: V }) => U,\n  contextObj?: unknown\n): { [key in K]: U } {\n  const res: Partial<{ [key in K]: U }> = {};\n  for (const key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      res[key] = fn.call(contextObj, obj[key], key, obj);\n    }\n  }\n  return res as { [key in K]: U };\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview SHA-1 cryptographic hash.\n * Variable names follow the notation in FIPS PUB 180-3:\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\n *\n * Usage:\n *   var sha1 = new sha1();\n *   sha1.update(bytes);\n *   var hash = sha1.digest();\n *\n * Performance:\n *   Chrome 23:   ~400 Mbit/s\n *   Firefox 16:  ~250 Mbit/s\n *\n */\n\n/**\n * SHA-1 cryptographic hash constructor.\n *\n * The properties declared here are discussed in the above algorithm document.\n * @constructor\n * @final\n * @struct\n */\nexport class Sha1 {\n  /**\n   * Holds the previous values of accumulated variables a-e in the compress_\n   * function.\n   * @private\n   */\n  private chain_: number[] = [];\n\n  /**\n   * A buffer holding the partially computed hash result.\n   * @private\n   */\n  private buf_: number[] = [];\n\n  /**\n   * An array of 80 bytes, each a part of the message to be hashed.  Referred to\n   * as the message schedule in the docs.\n   * @private\n   */\n  private W_: number[] = [];\n\n  /**\n   * Contains data needed to pad messages less than 64 bytes.\n   * @private\n   */\n  private pad_: number[] = [];\n\n  /**\n   * @private {number}\n   */\n  private inbuf_: number = 0;\n\n  /**\n   * @private {number}\n   */\n  private total_: number = 0;\n\n  blockSize: number;\n\n  constructor() {\n    this.blockSize = 512 / 8;\n\n    this.pad_[0] = 128;\n    for (let i = 1; i < this.blockSize; ++i) {\n      this.pad_[i] = 0;\n    }\n\n    this.reset();\n  }\n\n  reset(): void {\n    this.chain_[0] = 0x67452301;\n    this.chain_[1] = 0xefcdab89;\n    this.chain_[2] = 0x98badcfe;\n    this.chain_[3] = 0x10325476;\n    this.chain_[4] = 0xc3d2e1f0;\n\n    this.inbuf_ = 0;\n    this.total_ = 0;\n  }\n\n  /**\n   * Internal compress helper function.\n   * @param buf Block to compress.\n   * @param offset Offset of the block in the buffer.\n   * @private\n   */\n  compress_(buf: number[] | Uint8Array | string, offset?: number): void {\n    if (!offset) {\n      offset = 0;\n    }\n\n    const W = this.W_;\n\n    // get 16 big endian words\n    if (typeof buf === 'string') {\n      for (let i = 0; i < 16; i++) {\n        // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n        // have a bug that turns the post-increment ++ operator into pre-increment\n        // during JIT compilation.  We have code that depends heavily on SHA-1 for\n        // correctness and which is affected by this bug, so I've removed all uses\n        // of post-increment ++ in which the result value is used.  We can revert\n        // this change once the Safari bug\n        // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n        // most clients have been updated.\n        W[i] =\n          (buf.charCodeAt(offset) << 24) |\n          (buf.charCodeAt(offset + 1) << 16) |\n          (buf.charCodeAt(offset + 2) << 8) |\n          buf.charCodeAt(offset + 3);\n        offset += 4;\n      }\n    } else {\n      for (let i = 0; i < 16; i++) {\n        W[i] =\n          (buf[offset] << 24) |\n          (buf[offset + 1] << 16) |\n          (buf[offset + 2] << 8) |\n          buf[offset + 3];\n        offset += 4;\n      }\n    }\n\n    // expand to 80 words\n    for (let i = 16; i < 80; i++) {\n      const t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n      W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\n    }\n\n    let a = this.chain_[0];\n    let b = this.chain_[1];\n    let c = this.chain_[2];\n    let d = this.chain_[3];\n    let e = this.chain_[4];\n    let f, k;\n\n    // TODO(user): Try to unroll this loop to speed up the computation.\n    for (let i = 0; i < 80; i++) {\n      if (i < 40) {\n        if (i < 20) {\n          f = d ^ (b & (c ^ d));\n          k = 0x5a827999;\n        } else {\n          f = b ^ c ^ d;\n          k = 0x6ed9eba1;\n        }\n      } else {\n        if (i < 60) {\n          f = (b & c) | (d & (b | c));\n          k = 0x8f1bbcdc;\n        } else {\n          f = b ^ c ^ d;\n          k = 0xca62c1d6;\n        }\n      }\n\n      const t = (((a << 5) | (a >>> 27)) + f + e + k + W[i]) & 0xffffffff;\n      e = d;\n      d = c;\n      c = ((b << 30) | (b >>> 2)) & 0xffffffff;\n      b = a;\n      a = t;\n    }\n\n    this.chain_[0] = (this.chain_[0] + a) & 0xffffffff;\n    this.chain_[1] = (this.chain_[1] + b) & 0xffffffff;\n    this.chain_[2] = (this.chain_[2] + c) & 0xffffffff;\n    this.chain_[3] = (this.chain_[3] + d) & 0xffffffff;\n    this.chain_[4] = (this.chain_[4] + e) & 0xffffffff;\n  }\n\n  update(bytes?: number[] | Uint8Array | string, length?: number): void {\n    // TODO(johnlenz): tighten the function signature and remove this check\n    if (bytes == null) {\n      return;\n    }\n\n    if (length === undefined) {\n      length = bytes.length;\n    }\n\n    const lengthMinusBlock = length - this.blockSize;\n    let n = 0;\n    // Using local instead of member variables gives ~5% speedup on Firefox 16.\n    const buf = this.buf_;\n    let inbuf = this.inbuf_;\n\n    // The outer while loop should execute at most twice.\n    while (n < length) {\n      // When we have no data in the block to top up, we can directly process the\n      // input buffer (assuming it contains sufficient data). This gives ~25%\n      // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n      // the data is provided in large chunks (or in multiples of 64 bytes).\n      if (inbuf === 0) {\n        while (n <= lengthMinusBlock) {\n          this.compress_(bytes, n);\n          n += this.blockSize;\n        }\n      }\n\n      if (typeof bytes === 'string') {\n        while (n < length) {\n          buf[inbuf] = bytes.charCodeAt(n);\n          ++inbuf;\n          ++n;\n          if (inbuf === this.blockSize) {\n            this.compress_(buf);\n            inbuf = 0;\n            // Jump to the outer loop so we use the full-block optimization.\n            break;\n          }\n        }\n      } else {\n        while (n < length) {\n          buf[inbuf] = bytes[n];\n          ++inbuf;\n          ++n;\n          if (inbuf === this.blockSize) {\n            this.compress_(buf);\n            inbuf = 0;\n            // Jump to the outer loop so we use the full-block optimization.\n            break;\n          }\n        }\n      }\n    }\n\n    this.inbuf_ = inbuf;\n    this.total_ += length;\n  }\n\n  /** @override */\n  digest(): number[] {\n    const digest: number[] = [];\n    let totalBits = this.total_ * 8;\n\n    // Add pad 0x80 0x00*.\n    if (this.inbuf_ < 56) {\n      this.update(this.pad_, 56 - this.inbuf_);\n    } else {\n      this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n    }\n\n    // Add # bits.\n    for (let i = this.blockSize - 1; i >= 56; i--) {\n      this.buf_[i] = totalBits & 255;\n      totalBits /= 256; // Don't use bit-shifting here!\n    }\n\n    this.compress_(this.buf_);\n\n    let n = 0;\n    for (let i = 0; i < 5; i++) {\n      for (let j = 24; j >= 0; j -= 8) {\n        digest[n] = (this.chain_[i] >> j) & 255;\n        ++n;\n      }\n    }\n    return digest;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Check to make sure the appropriate number of arguments are provided for a public function.\n * Throws an error if it fails.\n *\n * @param fnName The function name\n * @param minCount The minimum number of arguments to allow for the function call\n * @param maxCount The maximum number of argument to allow for the function call\n * @param argCount The actual number of arguments provided.\n */\nexport const validateArgCount = function(\n  fnName: string,\n  minCount: number,\n  maxCount: number,\n  argCount: number\n): void {\n  let argError;\n  if (argCount < minCount) {\n    argError = 'at least ' + minCount;\n  } else if (argCount > maxCount) {\n    argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n  }\n  if (argError) {\n    const error =\n      fnName +\n      ' failed: Was called with ' +\n      argCount +\n      (argCount === 1 ? ' argument.' : ' arguments.') +\n      ' Expects ' +\n      argError +\n      '.';\n    throw new Error(error);\n  }\n};\n\n/**\n * Generates a string to prefix an error message about failed argument validation\n *\n * @param fnName The function name\n * @param argumentNumber The index of the argument\n * @param optional Whether or not the argument is optional\n * @return The prefix to add to the error thrown for validation.\n */\nexport function errorPrefix(\n  fnName: string,\n  argumentNumber: number,\n  optional: boolean\n): string {\n  let argName = '';\n  switch (argumentNumber) {\n    case 1:\n      argName = optional ? 'first' : 'First';\n      break;\n    case 2:\n      argName = optional ? 'second' : 'Second';\n      break;\n    case 3:\n      argName = optional ? 'third' : 'Third';\n      break;\n    case 4:\n      argName = optional ? 'fourth' : 'Fourth';\n      break;\n    default:\n      throw new Error(\n        'errorPrefix called with argumentNumber > 4.  Need to update it?'\n      );\n  }\n\n  let error = fnName + ' failed: ';\n\n  error += argName + ' argument ';\n  return error;\n}\n\n/**\n * @param fnName\n * @param argumentNumber\n * @param namespace\n * @param optional\n */\nexport function validateNamespace(\n  fnName: string,\n  argumentNumber: number,\n  namespace: string,\n  optional: boolean\n): void {\n  if (optional && !namespace) {\n    return;\n  }\n  if (typeof namespace !== 'string') {\n    //TODO: I should do more validation here. We only allow certain chars in namespaces.\n    throw new Error(\n      errorPrefix(fnName, argumentNumber, optional) +\n        'must be a valid firebase namespace.'\n    );\n  }\n}\n\nexport function validateCallback(\n  fnName: string,\n  argumentNumber: number,\n  callback: Function,\n  optional: boolean\n): void {\n  if (optional && !callback) {\n    return;\n  }\n  if (typeof callback !== 'function') {\n    throw new Error(\n      errorPrefix(fnName, argumentNumber, optional) +\n        'must be a valid function.'\n    );\n  }\n}\n\nexport function validateContextObject(\n  fnName: string,\n  argumentNumber: number,\n  context: unknown,\n  optional: boolean\n): void {\n  if (optional && !context) {\n    return;\n  }\n  if (typeof context !== 'object' || context === null) {\n    throw new Error(\n      errorPrefix(fnName, argumentNumber, optional) +\n        'must be a valid context object.'\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from './assert';\n\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in Javascript.  All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n\n/**\n * @param {string} str\n * @return {Array}\n */\nexport const stringToByteArray = function(str: string): number[] {\n  const out: number[] = [];\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    let c = str.charCodeAt(i);\n\n    // Is this the lead surrogate in a surrogate pair?\n    if (c >= 0xd800 && c <= 0xdbff) {\n      const high = c - 0xd800; // the high 10 bits.\n      i++;\n      assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n      const low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n      c = 0x10000 + (high << 10) + low;\n    }\n\n    if (c < 128) {\n      out[p++] = c;\n    } else if (c < 2048) {\n      out[p++] = (c >> 6) | 192;\n      out[p++] = (c & 63) | 128;\n    } else if (c < 65536) {\n      out[p++] = (c >> 12) | 224;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    } else {\n      out[p++] = (c >> 18) | 240;\n      out[p++] = ((c >> 12) & 63) | 128;\n      out[p++] = ((c >> 6) & 63) | 128;\n      out[p++] = (c & 63) | 128;\n    }\n  }\n  return out;\n};\n\n/**\n * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nexport const stringLength = function(str: string): number {\n  let p = 0;\n  for (let i = 0; i < str.length; i++) {\n    const c = str.charCodeAt(i);\n    if (c < 128) {\n      p++;\n    } else if (c < 2048) {\n      p += 2;\n    } else if (c >= 0xd800 && c <= 0xdbff) {\n      // Lead surrogate of a surrogate pair.  The pair together will take 4 bytes to represent.\n      p += 4;\n      i++; // skip trail surrogate.\n    } else {\n      p += 3;\n    }\n  }\n  return p;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport type LogLevelString =\n  | 'debug'\n  | 'verbose'\n  | 'info'\n  | 'warn'\n  | 'error'\n  | 'silent';\n\nexport interface LogOptions {\n  level: LogLevelString;\n}\n\nexport type LogCallback = (callbackParams: LogCallbackParams) => void;\n\nexport interface LogCallbackParams {\n  level: LogLevelString;\n  message: string;\n  args: unknown[];\n  type: string;\n}\n\n/**\n * A container for all of the Logger instances\n */\nexport const instances: Logger[] = [];\n\n/**\n * The JS SDK supports 5 log levels and also allows a user the ability to\n * silence the logs altogether.\n *\n * The order is a follows:\n * DEBUG < VERBOSE < INFO < WARN < ERROR\n *\n * All of the log types above the current log level will be captured (i.e. if\n * you set the log level to `INFO`, errors will still be logged, but `DEBUG` and\n * `VERBOSE` logs will not)\n */\nexport enum LogLevel {\n  DEBUG,\n  VERBOSE,\n  INFO,\n  WARN,\n  ERROR,\n  SILENT\n}\n\nconst levelStringToEnum: { [key in LogLevelString]: LogLevel } = {\n  'debug': LogLevel.DEBUG,\n  'verbose': LogLevel.VERBOSE,\n  'info': LogLevel.INFO,\n  'warn': LogLevel.WARN,\n  'error': LogLevel.ERROR,\n  'silent': LogLevel.SILENT\n};\n\n/**\n * The default log level\n */\nconst defaultLogLevel: LogLevel = LogLevel.INFO;\n\n/**\n * We allow users the ability to pass their own log handler. We will pass the\n * type of log, the current log level, and any other arguments passed (i.e. the\n * messages that the user wants to log) to this function.\n */\nexport type LogHandler = (\n  loggerInstance: Logger,\n  logType: LogLevel,\n  ...args: unknown[]\n) => void;\n\n/**\n * By default, `console.debug` is not displayed in the developer console (in\n * chrome). To avoid forcing users to have to opt-in to these logs twice\n * (i.e. once for firebase, and once in the console), we are sending `DEBUG`\n * logs to the `console.log` function.\n */\nconst ConsoleMethod = {\n  [LogLevel.DEBUG]: 'log',\n  [LogLevel.VERBOSE]: 'log',\n  [LogLevel.INFO]: 'info',\n  [LogLevel.WARN]: 'warn',\n  [LogLevel.ERROR]: 'error'\n};\n\n/**\n * The default log handler will forward DEBUG, VERBOSE, INFO, WARN, and ERROR\n * messages on to their corresponding console counterparts (if the log method\n * is supported by the current log level)\n */\nconst defaultLogHandler: LogHandler = (instance, logType, ...args): void => {\n  if (logType < instance.logLevel) {\n    return;\n  }\n  const now = new Date().toISOString();\n  const method = ConsoleMethod[logType as keyof typeof ConsoleMethod];\n  if (method) {\n    console[method as 'log' | 'info' | 'warn' | 'error'](\n      `[${now}]  ${instance.name}:`,\n      ...args\n    );\n  } else {\n    throw new Error(\n      `Attempted to log a message with an invalid logType (value: ${logType})`\n    );\n  }\n};\n\nexport class Logger {\n  /**\n   * Gives you an instance of a Logger to capture messages according to\n   * Firebase's logging scheme.\n   *\n   * @param name The name that the logs will be associated with\n   */\n  constructor(public name: string) {\n    /**\n     * Capture the current instance for later use\n     */\n    instances.push(this);\n  }\n\n  /**\n   * The log level of the given Logger instance.\n   */\n  private _logLevel = defaultLogLevel;\n  get logLevel(): LogLevel {\n    return this._logLevel;\n  }\n  set logLevel(val: LogLevel) {\n    if (!(val in LogLevel)) {\n      throw new TypeError('Invalid value assigned to `logLevel`');\n    }\n    this._logLevel = val;\n  }\n\n  /**\n   * The main (internal) log handler for the Logger instance.\n   * Can be set to a new function in internal package code but not by user.\n   */\n  private _logHandler: LogHandler = defaultLogHandler;\n  get logHandler(): LogHandler {\n    return this._logHandler;\n  }\n  set logHandler(val: LogHandler) {\n    if (typeof val !== 'function') {\n      throw new TypeError('Value assigned to `logHandler` must be a function');\n    }\n    this._logHandler = val;\n  }\n\n  /**\n   * The optional, additional, user-defined log handler for the Logger instance.\n   */\n  private _userLogHandler: LogHandler | null = null;\n  get userLogHandler(): LogHandler | null {\n    return this._userLogHandler;\n  }\n  set userLogHandler(val: LogHandler | null) {\n    this._userLogHandler = val;\n  }\n\n  /**\n   * The functions below are all based on the `console` interface\n   */\n\n  debug(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.DEBUG, ...args);\n    this._logHandler(this, LogLevel.DEBUG, ...args);\n  }\n  log(...args: unknown[]): void {\n    this._userLogHandler &&\n      this._userLogHandler(this, LogLevel.VERBOSE, ...args);\n    this._logHandler(this, LogLevel.VERBOSE, ...args);\n  }\n  info(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.INFO, ...args);\n    this._logHandler(this, LogLevel.INFO, ...args);\n  }\n  warn(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.WARN, ...args);\n    this._logHandler(this, LogLevel.WARN, ...args);\n  }\n  error(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.ERROR, ...args);\n    this._logHandler(this, LogLevel.ERROR, ...args);\n  }\n}\n\nexport function setLogLevel(level: LogLevelString | LogLevel): void {\n  const newLevel = typeof level === 'string' ? levelStringToEnum[level] : level;\n  instances.forEach(inst => {\n    inst.logLevel = newLevel;\n  });\n}\n\nexport function setUserLogHandler(\n  logCallback: LogCallback | null,\n  options?: LogOptions\n): void {\n  for (const instance of instances) {\n    let customLogLevel: LogLevel | null = null;\n    if (options && options.level) {\n      customLogLevel = levelStringToEnum[options.level];\n    }\n    if (logCallback === null) {\n      instance.userLogHandler = null;\n    } else {\n      instance.userLogHandler = (\n        instance: Logger,\n        level: LogLevel,\n        ...args: unknown[]\n      ) => {\n        const message = args\n          .map(arg => {\n            if (arg == null) {\n              return null;\n            } else if (typeof arg === 'string') {\n              return arg;\n            } else if (typeof arg === 'number' || typeof arg === 'boolean') {\n              return arg.toString();\n            } else if (arg instanceof Error) {\n              return arg.message;\n            } else {\n              try {\n                return JSON.stringify(arg);\n              } catch (ignored) {\n                return null;\n              }\n            }\n          })\n          .filter(arg => arg)\n          .join(' ');\n        if (level >= (customLogLevel ?? instance.logLevel)) {\n          logCallback({\n            level: LogLevel[level].toLowerCase() as LogLevelString,\n            message,\n            args,\n            type: instance.name\n          });\n        }\n      };\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nimport {\n  InstantiationMode,\n  InstanceFactory,\n  ComponentType,\n  Dictionary,\n  Name\n} from './types';\n\n/**\n * Component for service name T, e.g. `auth`, `auth-internal`\n */\nexport class Component<T extends Name = Name> {\n  multipleInstances = false;\n  /**\n   * Properties to be added to the service namespace\n   */\n  serviceProps: Dictionary = {};\n\n  instantiationMode = InstantiationMode.LAZY;\n\n  /**\n   *\n   * @param name The public service name, e.g. app, auth, firestore, database\n   * @param instanceFactory Service factory responsible for creating the public interface\n   * @param type whether the service provided by the component is public or private\n   */\n  constructor(\n    readonly name: T,\n    readonly instanceFactory: InstanceFactory<T>,\n    readonly type: ComponentType\n  ) {}\n\n  setInstantiationMode(mode: InstantiationMode): this {\n    this.instantiationMode = mode;\n    return this;\n  }\n\n  setMultipleInstances(multipleInstances: boolean): this {\n    this.multipleInstances = multipleInstances;\n    return this;\n  }\n\n  setServiceProps(props: Dictionary): this {\n    this.serviceProps = props;\n    return this;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { jsonEval, stringify } from '@firebase/util';\n\n/**\n * Wraps a DOM Storage object and:\n * - automatically encode objects as JSON strings before storing them to allow us to store arbitrary types.\n * - prefixes names with \"firebase:\" to avoid collisions with app data.\n *\n * We automatically (see storage.js) create two such wrappers, one for sessionStorage,\n * and one for localStorage.\n *\n * @constructor\n */\nexport class DOMStorageWrapper {\n  // Use a prefix to avoid collisions with other stuff saved by the app.\n  private prefix_ = 'firebase:';\n\n  /**\n   * @param {Storage} domStorage_ The underlying storage object (e.g. localStorage or sessionStorage)\n   */\n  constructor(private domStorage_: Storage) {}\n\n  /**\n   * @param {string} key The key to save the value under\n   * @param {?Object} value The value being stored, or null to remove the key.\n   */\n  set(key: string, value: unknown | null) {\n    if (value == null) {\n      this.domStorage_.removeItem(this.prefixedName_(key));\n    } else {\n      this.domStorage_.setItem(this.prefixedName_(key), stringify(value));\n    }\n  }\n\n  /**\n   * @param {string} key\n   * @return {*} The value that was stored under this key, or null\n   */\n  get(key: string): unknown {\n    const storedVal = this.domStorage_.getItem(this.prefixedName_(key));\n    if (storedVal == null) {\n      return null;\n    } else {\n      return jsonEval(storedVal);\n    }\n  }\n\n  /**\n   * @param {string} key\n   */\n  remove(key: string) {\n    this.domStorage_.removeItem(this.prefixedName_(key));\n  }\n\n  isInMemoryStorage: boolean;\n\n  /**\n   * @param {string} name\n   * @return {string}\n   */\n  prefixedName_(name: string): string {\n    return this.prefix_ + name;\n  }\n\n  toString(): string {\n    return this.domStorage_.toString();\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { contains } from '@firebase/util';\n\n/**\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\n * (TODO: create interface for both to implement).\n *\n * @constructor\n */\nexport class MemoryStorage {\n  private cache_: { [k: string]: unknown } = {};\n\n  set(key: string, value: unknown | null) {\n    if (value == null) {\n      delete this.cache_[key];\n    } else {\n      this.cache_[key] = value;\n    }\n  }\n\n  get(key: string): unknown {\n    if (contains(this.cache_, key)) {\n      return this.cache_[key];\n    }\n    return null;\n  }\n\n  remove(key: string) {\n    delete this.cache_[key];\n  }\n\n  isInMemoryStorage = true;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DOMStorageWrapper } from './DOMStorageWrapper';\nimport { MemoryStorage } from './MemoryStorage';\n\ndeclare const window: Window;\n\n/**\n * Helper to create a DOMStorageWrapper or else fall back to MemoryStorage.\n * TODO: Once MemoryStorage and DOMStorageWrapper have a shared interface this method annotation should change\n * to reflect this type\n *\n * @param {string} domStorageName Name of the underlying storage object\n *   (e.g. 'localStorage' or 'sessionStorage').\n * @return {?} Turning off type information until a common interface is defined.\n */\nconst createStoragefor = function(\n  domStorageName: string\n): DOMStorageWrapper | MemoryStorage {\n  try {\n    // NOTE: just accessing \"localStorage\" or \"window['localStorage']\" may throw a security exception,\n    // so it must be inside the try/catch.\n    if (\n      typeof window !== 'undefined' &&\n      typeof window[domStorageName] !== 'undefined'\n    ) {\n      // Need to test cache. Just because it's here doesn't mean it works\n      const domStorage = window[domStorageName];\n      domStorage.setItem('firebase:sentinel', 'cache');\n      domStorage.removeItem('firebase:sentinel');\n      return new DOMStorageWrapper(domStorage);\n    }\n  } catch (e) {}\n\n  // Failed to create wrapper.  Just return in-memory storage.\n  // TODO: log?\n  return new MemoryStorage();\n};\n\n/** A storage object that lasts across sessions */\nexport const PersistentStorage = createStoragefor('localStorage');\n\n/** A storage object that only lasts one session */\nexport const SessionStorage = createStoragefor('sessionStorage');\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Query } from '../../api/Query';\nimport {\n  assert,\n  base64,\n  Sha1,\n  stringToByteArray,\n  stringify,\n  isNodeSdk\n} from '@firebase/util';\nimport { SessionStorage } from '../storage/storage';\nimport { Logger, LogLevel } from '@firebase/logger';\n\ndeclare const window: Window;\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndeclare const Windows: any;\n\nconst logClient = new Logger('@firebase/database');\n\n/**\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\n * @type {function(): number} Generated ID.\n */\nexport const LUIDGenerator: () => number = (function() {\n  let id = 1;\n  return function() {\n    return id++;\n  };\n})();\n\n/**\n * Sha1 hash of the input string\n * @param {!string} str The string to hash\n * @return {!string} The resulting hash\n */\nexport const sha1 = function(str: string): string {\n  const utf8Bytes = stringToByteArray(str);\n  const sha1 = new Sha1();\n  sha1.update(utf8Bytes);\n  const sha1Bytes = sha1.digest();\n  return base64.encodeByteArray(sha1Bytes);\n};\n\n/**\n * @param {...*} varArgs\n * @return {string}\n * @private\n */\nconst buildLogMessage_ = function(...varArgs: unknown[]): string {\n  let message = '';\n  for (let i = 0; i < varArgs.length; i++) {\n    const arg = varArgs[i];\n    if (\n      Array.isArray(arg) ||\n      (arg &&\n        typeof arg === 'object' &&\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n        typeof (arg as any).length === 'number')\n    ) {\n      message += buildLogMessage_.apply(null, arg);\n    } else if (typeof arg === 'object') {\n      message += stringify(arg);\n    } else {\n      message += arg;\n    }\n    message += ' ';\n  }\n\n  return message;\n};\n\n/**\n * Use this for all debug messages in Firebase.\n * @type {?function(string)}\n */\nexport let logger: ((a: string) => void) | null = null;\n\n/**\n * Flag to check for log availability on first log message\n * @type {boolean}\n * @private\n */\nlet firstLog_ = true;\n\n/**\n * The implementation of Firebase.enableLogging (defined here to break dependencies)\n * @param {boolean|?function(string)} logger_ A flag to turn on logging, or a custom logger\n * @param {boolean=} persistent Whether or not to persist logging settings across refreshes\n */\nexport const enableLogging = function(\n  logger_?: boolean | ((a: string) => void) | null,\n  persistent?: boolean\n) {\n  assert(\n    !persistent || logger_ === true || logger_ === false,\n    \"Can't turn on custom loggers persistently.\"\n  );\n  if (logger_ === true) {\n    logClient.logLevel = LogLevel.VERBOSE;\n    logger = logClient.log.bind(logClient);\n    if (persistent) {\n      SessionStorage.set('logging_enabled', true);\n    }\n  } else if (typeof logger_ === 'function') {\n    logger = logger_;\n  } else {\n    logger = null;\n    SessionStorage.remove('logging_enabled');\n  }\n};\n\n/**\n *\n * @param {...(string|Arguments)} varArgs\n */\nexport const log = function(...varArgs: unknown[]) {\n  if (firstLog_ === true) {\n    firstLog_ = false;\n    if (logger === null && SessionStorage.get('logging_enabled') === true) {\n      enableLogging(true);\n    }\n  }\n\n  if (logger) {\n    const message = buildLogMessage_.apply(null, varArgs);\n    logger(message);\n  }\n};\n\n/**\n * @param {!string} prefix\n * @return {function(...[*])}\n */\nexport const logWrapper = function(\n  prefix: string\n): (...varArgs: unknown[]) => void {\n  return function(...varArgs: unknown[]) {\n    log(prefix, ...varArgs);\n  };\n};\n\n/**\n * @param {...string} varArgs\n */\nexport const error = function(...varArgs: string[]) {\n  const message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_(...varArgs);\n  logClient.error(message);\n};\n\n/**\n * @param {...string} varArgs\n */\nexport const fatal = function(...varArgs: string[]) {\n  const message = `FIREBASE FATAL ERROR: ${buildLogMessage_(...varArgs)}`;\n  logClient.error(message);\n  throw new Error(message);\n};\n\n/**\n * @param {...*} varArgs\n */\nexport const warn = function(...varArgs: unknown[]) {\n  const message = 'FIREBASE WARNING: ' + buildLogMessage_(...varArgs);\n  logClient.warn(message);\n};\n\n/**\n * Logs a warning if the containing page uses https. Called when a call to new Firebase\n * does not use https.\n */\nexport const warnIfPageIsSecure = function() {\n  // Be very careful accessing browser globals. Who knows what may or may not exist.\n  if (\n    typeof window !== 'undefined' &&\n    window.location &&\n    window.location.protocol &&\n    window.location.protocol.indexOf('https:') !== -1\n  ) {\n    warn(\n      'Insecure Firebase access from a secure page. ' +\n        'Please use https in calls to new Firebase().'\n    );\n  }\n};\n\n/**\n * @param {!String} methodName\n */\nexport const warnAboutUnsupportedMethod = function(methodName: string) {\n  warn(\n    methodName +\n      ' is unsupported and will likely change soon.  ' +\n      'Please do not use.'\n  );\n};\n\n/**\n * Returns true if data is NaN, or +/- Infinity.\n * @param {*} data\n * @return {boolean}\n */\nexport const isInvalidJSONNumber = function(data: unknown): boolean {\n  return (\n    typeof data === 'number' &&\n    (data !== data || // NaN\n      data === Number.POSITIVE_INFINITY ||\n      data === Number.NEGATIVE_INFINITY)\n  );\n};\n\n/**\n * @param {function()} fn\n */\nexport const executeWhenDOMReady = function(fn: () => void) {\n  if (isNodeSdk() || document.readyState === 'complete') {\n    fn();\n  } else {\n    // Modeled after jQuery. Try DOMContentLoaded and onreadystatechange (which\n    // fire before onload), but fall back to onload.\n\n    let called = false;\n    const wrappedFn = function() {\n      if (!document.body) {\n        setTimeout(wrappedFn, Math.floor(10));\n        return;\n      }\n\n      if (!called) {\n        called = true;\n        fn();\n      }\n    };\n\n    if (document.addEventListener) {\n      document.addEventListener('DOMContentLoaded', wrappedFn, false);\n      // fallback to onload.\n      window.addEventListener('load', wrappedFn, false);\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } else if ((document as any).attachEvent) {\n      // IE.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (document as any).attachEvent('onreadystatechange', () => {\n        if (document.readyState === 'complete') {\n          wrappedFn();\n        }\n      });\n      // fallback to onload.\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (window as any).attachEvent('onload', wrappedFn);\n\n      // jQuery has an extra hack for IE that we could employ (based on\n      // http://javascript.nwbox.com/IEContentLoaded/) But it looks really old.\n      // I'm hoping we don't need it.\n    }\n  }\n};\n\n/**\n * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\n * @type {!string}\n */\nexport const MIN_NAME = '[MIN_NAME]';\n\n/**\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\n * @type {!string}\n */\nexport const MAX_NAME = '[MAX_NAME]';\n\n/**\n * Compares valid Firebase key names, plus min and max name\n * @param {!string} a\n * @param {!string} b\n * @return {!number}\n */\nexport const nameCompare = function(a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  } else if (a === MIN_NAME || b === MAX_NAME) {\n    return -1;\n  } else if (b === MIN_NAME || a === MAX_NAME) {\n    return 1;\n  } else {\n    const aAsInt = tryParseInt(a),\n      bAsInt = tryParseInt(b);\n\n    if (aAsInt !== null) {\n      if (bAsInt !== null) {\n        return aAsInt - bAsInt === 0 ? a.length - b.length : aAsInt - bAsInt;\n      } else {\n        return -1;\n      }\n    } else if (bAsInt !== null) {\n      return 1;\n    } else {\n      return a < b ? -1 : 1;\n    }\n  }\n};\n\n/**\n * @param {!string} a\n * @param {!string} b\n * @return {!number} comparison result.\n */\nexport const stringCompare = function(a: string, b: string): number {\n  if (a === b) {\n    return 0;\n  } else if (a < b) {\n    return -1;\n  } else {\n    return 1;\n  }\n};\n\n/**\n * @param {string} key\n * @param {Object} obj\n * @return {*}\n */\nexport const requireKey = function(\n  key: string,\n  obj: { [k: string]: unknown }\n): unknown {\n  if (obj && key in obj) {\n    return obj[key];\n  } else {\n    throw new Error(\n      'Missing required key (' + key + ') in object: ' + stringify(obj)\n    );\n  }\n};\n\n/**\n * @param {*} obj\n * @return {string}\n */\nexport const ObjectToUniqueKey = function(obj: unknown): string {\n  if (typeof obj !== 'object' || obj === null) {\n    return stringify(obj);\n  }\n\n  const keys = [];\n  // eslint-disable-next-line guard-for-in\n  for (const k in obj) {\n    keys.push(k);\n  }\n\n  // Export as json, but with the keys sorted.\n  keys.sort();\n  let key = '{';\n  for (let i = 0; i < keys.length; i++) {\n    if (i !== 0) {\n      key += ',';\n    }\n    key += stringify(keys[i]);\n    key += ':';\n    key += ObjectToUniqueKey(obj[keys[i]]);\n  }\n\n  key += '}';\n  return key;\n};\n\n/**\n * Splits a string into a number of smaller segments of maximum size\n * @param {!string} str The string\n * @param {!number} segsize The maximum number of chars in the string.\n * @return {Array.<string>} The string, split into appropriately-sized chunks\n */\nexport const splitStringBySize = function(\n  str: string,\n  segsize: number\n): string[] {\n  const len = str.length;\n\n  if (len <= segsize) {\n    return [str];\n  }\n\n  const dataSegs = [];\n  for (let c = 0; c < len; c += segsize) {\n    if (c + segsize > len) {\n      dataSegs.push(str.substring(c, len));\n    } else {\n      dataSegs.push(str.substring(c, c + segsize));\n    }\n  }\n  return dataSegs;\n};\n\n/**\n * Apply a function to each (key, value) pair in an object or\n * apply a function to each (index, value) pair in an array\n * @param obj The object or array to iterate over\n * @param fn The function to apply\n */\nexport function each(obj: object, fn: (k: string, v: unknown) => void) {\n  for (const key in obj) {\n    if (obj.hasOwnProperty(key)) {\n      fn(key, obj[key]);\n    }\n  }\n}\n\n/**\n * Like goog.bind, but doesn't bother to create a closure if opt_context is null/undefined.\n * @param {function(*)} callback Callback function.\n * @param {?Object=} context Optional context to bind to.\n * @return {function(*)}\n */\nexport const bindCallback = function(\n  callback: (a: unknown) => void,\n  context?: object | null\n): Function {\n  return context ? callback.bind(context) : callback;\n};\n\n/**\n * Borrowed from http://hg.secondlife.com/llsd/src/tip/js/typedarray.js (MIT License)\n * I made one modification at the end and removed the NaN / Infinity\n * handling (since it seemed broken [caused an overflow] and we don't need it).  See MJL comments.\n * @param {!number} v A double\n * @return {string}\n */\nexport const doubleToIEEE754String = function(v: number): string {\n  assert(!isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\n\n  const ebits = 11,\n    fbits = 52;\n  const bias = (1 << (ebits - 1)) - 1;\n  let s, e, f, ln, i;\n\n  // Compute sign, exponent, fraction\n  // Skip NaN / Infinity handling --MJL.\n  if (v === 0) {\n    e = 0;\n    f = 0;\n    s = 1 / v === -Infinity ? 1 : 0;\n  } else {\n    s = v < 0;\n    v = Math.abs(v);\n\n    if (v >= Math.pow(2, 1 - bias)) {\n      // Normalized\n      ln = Math.min(Math.floor(Math.log(v) / Math.LN2), bias);\n      e = ln + bias;\n      f = Math.round(v * Math.pow(2, fbits - ln) - Math.pow(2, fbits));\n    } else {\n      // Denormalized\n      e = 0;\n      f = Math.round(v / Math.pow(2, 1 - bias - fbits));\n    }\n  }\n\n  // Pack sign, exponent, fraction\n  const bits = [];\n  for (i = fbits; i; i -= 1) {\n    bits.push(f % 2 ? 1 : 0);\n    f = Math.floor(f / 2);\n  }\n  for (i = ebits; i; i -= 1) {\n    bits.push(e % 2 ? 1 : 0);\n    e = Math.floor(e / 2);\n  }\n  bits.push(s ? 1 : 0);\n  bits.reverse();\n  const str = bits.join('');\n\n  // Return the data as a hex string. --MJL\n  let hexByteString = '';\n  for (i = 0; i < 64; i += 8) {\n    let hexByte = parseInt(str.substr(i, 8), 2).toString(16);\n    if (hexByte.length === 1) {\n      hexByte = '0' + hexByte;\n    }\n    hexByteString = hexByteString + hexByte;\n  }\n  return hexByteString.toLowerCase();\n};\n\n/**\n * Used to detect if we're in a Chrome content script (which executes in an\n * isolated environment where long-polling doesn't work).\n * @return {boolean}\n */\nexport const isChromeExtensionContentScript = function(): boolean {\n  return !!(\n    typeof window === 'object' &&\n    window['chrome'] &&\n    window['chrome']['extension'] &&\n    !/^chrome/.test(window.location.href)\n  );\n};\n\n/**\n * Used to detect if we're in a Windows 8 Store app.\n * @return {boolean}\n */\nexport const isWindowsStoreApp = function(): boolean {\n  // Check for the presence of a couple WinRT globals\n  return typeof Windows === 'object' && typeof Windows.UI === 'object';\n};\n\n/**\n * Converts a server error code to a Javascript Error\n * @param {!string} code\n * @param {!Query} query\n * @return {Error}\n */\nexport const errorForServerCode = function(code: string, query: Query): Error {\n  let reason = 'Unknown Error';\n  if (code === 'too_big') {\n    reason =\n      'The data requested exceeds the maximum size ' +\n      'that can be accessed with a single request.';\n  } else if (code === 'permission_denied') {\n    reason = \"Client doesn't have permission to access the desired data.\";\n  } else if (code === 'unavailable') {\n    reason = 'The service is unavailable';\n  }\n\n  const error = new Error(\n    code + ' at ' + query.path.toString() + ': ' + reason\n  );\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  (error as any).code = code.toUpperCase();\n  return error;\n};\n\n/**\n * Used to test for integer-looking strings\n * @type {RegExp}\n * @private\n */\nexport const INTEGER_REGEXP_ = new RegExp('^-?(0*)\\\\d{1,10}$');\n\n/**\n * If the string contains a 32-bit integer, return it.  Else return null.\n * @param {!string} str\n * @return {?number}\n */\nexport const tryParseInt = function(str: string): number | null {\n  if (INTEGER_REGEXP_.test(str)) {\n    const intVal = Number(str);\n    if (intVal >= -2147483648 && intVal <= 2147483647) {\n      return intVal;\n    }\n  }\n  return null;\n};\n\n/**\n * Helper to run some code but catch any exceptions and re-throw them later.\n * Useful for preventing user callbacks from breaking internal code.\n *\n * Re-throwing the exception from a setTimeout is a little evil, but it's very\n * convenient (we don't have to try to figure out when is a safe point to\n * re-throw it), and the behavior seems reasonable:\n *\n * * If you aren't pausing on exceptions, you get an error in the console with\n *   the correct stack trace.\n * * If you're pausing on all exceptions, the debugger will pause on your\n *   exception and then again when we rethrow it.\n * * If you're only pausing on uncaught exceptions, the debugger will only pause\n *   on us re-throwing it.\n *\n * @param {!function()} fn The code to guard.\n */\nexport const exceptionGuard = function(fn: () => void) {\n  try {\n    fn();\n  } catch (e) {\n    // Re-throw exception when it's safe.\n    setTimeout(() => {\n      // It used to be that \"throw e\" would result in a good console error with\n      // relevant context, but as of Chrome 39, you just get the firebase.js\n      // file/line number where we re-throw it, which is useless. So we log\n      // e.stack explicitly.\n      const stack = e.stack || '';\n      warn('Exception was thrown by user callback.', stack);\n      throw e;\n    }, Math.floor(0));\n  }\n};\n\n/**\n * Helper function to safely call opt_callback with the specified arguments.  It:\n * 1. Turns into a no-op if opt_callback is null or undefined.\n * 2. Wraps the call inside exceptionGuard to prevent exceptions from breaking our state.\n *\n * @param {?Function=} callback Optional onComplete callback.\n * @param {...*} varArgs Arbitrary args to be passed to opt_onComplete\n */\nexport const callUserCallback = function(\n  callback?: Function | null,\n  ...varArgs: unknown[]\n) {\n  if (typeof callback === 'function') {\n    exceptionGuard(() => {\n      callback(...varArgs);\n    });\n  }\n};\n\n/**\n * @return {boolean} true if we think we're currently being crawled.\n */\nexport const beingCrawled = function(): boolean {\n  const userAgent =\n    (typeof window === 'object' &&\n      window['navigator'] &&\n      window['navigator']['userAgent']) ||\n    '';\n\n  // For now we whitelist the most popular crawlers.  We should refine this to be the set of crawlers we\n  // believe to support JavaScript/AJAX rendering.\n  // NOTE: Google Webmaster Tools doesn't really belong, but their \"This is how a visitor to your website\n  // would have seen the page\" is flaky if we don't treat it as a crawler.\n  return (\n    userAgent.search(\n      /googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i\n    ) >= 0\n  );\n};\n\n/**\n * Export a property of an object using a getter function.\n *\n * @param {!Object} object\n * @param {string} name\n * @param {!function(): *} fnGet\n */\nexport const exportPropGetter = function(\n  object: object,\n  name: string,\n  fnGet: () => unknown\n) {\n  Object.defineProperty(object, name, { get: fnGet });\n};\n\n/**\n * Same as setTimeout() except on Node.JS it will /not/ prevent the process from exiting.\n *\n * It is removed with clearTimeout() as normal.\n *\n * @param {Function} fn Function to run.\n * @param {number} time Milliseconds to wait before running.\n * @return {number|Object} The setTimeout() return value.\n */\nexport const setTimeoutNonBlocking = function(\n  fn: Function,\n  time: number\n): number | object {\n  const timeout: number | object = setTimeout(fn, time);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  if (typeof timeout === 'object' && (timeout as any)['unref']) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    (timeout as any)['unref']();\n  }\n  return timeout;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { nameCompare } from './util';\nimport { stringLength } from '@firebase/util';\n/**\n * An immutable object representing a parsed path.  It's immutable so that you\n * can pass them around to other functions without worrying about them changing\n * it.\n */\n\nexport class Path {\n  private pieces_: string[];\n  private pieceNum_: number;\n\n  /**\n   * Singleton to represent an empty path\n   *\n   * @const\n   */\n  static get Empty() {\n    return new Path('');\n  }\n\n  /**\n   * @param {string|Array.<string>} pathOrString Path string to parse,\n   *      or another path, or the raw tokens array\n   * @param {number=} pieceNum\n   */\n  constructor(pathOrString: string | string[], pieceNum?: number) {\n    if (pieceNum === void 0) {\n      this.pieces_ = (pathOrString as string).split('/');\n\n      // Remove empty pieces.\n      let copyTo = 0;\n      for (let i = 0; i < this.pieces_.length; i++) {\n        if (this.pieces_[i].length > 0) {\n          this.pieces_[copyTo] = this.pieces_[i];\n          copyTo++;\n        }\n      }\n      this.pieces_.length = copyTo;\n\n      this.pieceNum_ = 0;\n    } else {\n      this.pieces_ = pathOrString as string[];\n      this.pieceNum_ = pieceNum;\n    }\n  }\n\n  getFront(): string | null {\n    if (this.pieceNum_ >= this.pieces_.length) {\n      return null;\n    }\n\n    return this.pieces_[this.pieceNum_];\n  }\n\n  /**\n   * @return {number} The number of segments in this path\n   */\n  getLength(): number {\n    return this.pieces_.length - this.pieceNum_;\n  }\n\n  /**\n   * @return {!Path}\n   */\n  popFront(): Path {\n    let pieceNum = this.pieceNum_;\n    if (pieceNum < this.pieces_.length) {\n      pieceNum++;\n    }\n    return new Path(this.pieces_, pieceNum);\n  }\n\n  /**\n   * @return {?string}\n   */\n  getBack(): string | null {\n    if (this.pieceNum_ < this.pieces_.length) {\n      return this.pieces_[this.pieces_.length - 1];\n    }\n\n    return null;\n  }\n\n  toString(): string {\n    let pathString = '';\n    for (let i = this.pieceNum_; i < this.pieces_.length; i++) {\n      if (this.pieces_[i] !== '') {\n        pathString += '/' + this.pieces_[i];\n      }\n    }\n\n    return pathString || '/';\n  }\n\n  toUrlEncodedString(): string {\n    let pathString = '';\n    for (let i = this.pieceNum_; i < this.pieces_.length; i++) {\n      if (this.pieces_[i] !== '') {\n        pathString += '/' + encodeURIComponent(String(this.pieces_[i]));\n      }\n    }\n\n    return pathString || '/';\n  }\n\n  /**\n   * Shallow copy of the parts of the path.\n   *\n   * @param {number=} begin\n   * @return {!Array<string>}\n   */\n  slice(begin: number = 0): string[] {\n    return this.pieces_.slice(this.pieceNum_ + begin);\n  }\n\n  /**\n   * @return {?Path}\n   */\n  parent(): Path | null {\n    if (this.pieceNum_ >= this.pieces_.length) {\n      return null;\n    }\n\n    const pieces = [];\n    for (let i = this.pieceNum_; i < this.pieces_.length - 1; i++) {\n      pieces.push(this.pieces_[i]);\n    }\n\n    return new Path(pieces, 0);\n  }\n\n  /**\n   * @param {string|!Path} childPathObj\n   * @return {!Path}\n   */\n  child(childPathObj: string | Path): Path {\n    const pieces = [];\n    for (let i = this.pieceNum_; i < this.pieces_.length; i++) {\n      pieces.push(this.pieces_[i]);\n    }\n\n    if (childPathObj instanceof Path) {\n      for (\n        let i = childPathObj.pieceNum_;\n        i < childPathObj.pieces_.length;\n        i++\n      ) {\n        pieces.push(childPathObj.pieces_[i]);\n      }\n    } else {\n      const childPieces = childPathObj.split('/');\n      for (let i = 0; i < childPieces.length; i++) {\n        if (childPieces[i].length > 0) {\n          pieces.push(childPieces[i]);\n        }\n      }\n    }\n\n    return new Path(pieces, 0);\n  }\n\n  /**\n   * @return {boolean} True if there are no segments in this path\n   */\n  isEmpty(): boolean {\n    return this.pieceNum_ >= this.pieces_.length;\n  }\n\n  /**\n   * @param {!Path} outerPath\n   * @param {!Path} innerPath\n   * @return {!Path} The path from outerPath to innerPath\n   */\n  static relativePath(outerPath: Path, innerPath: Path): Path {\n    const outer = outerPath.getFront(),\n      inner = innerPath.getFront();\n    if (outer === null) {\n      return innerPath;\n    } else if (outer === inner) {\n      return Path.relativePath(outerPath.popFront(), innerPath.popFront());\n    } else {\n      throw new Error(\n        'INTERNAL ERROR: innerPath (' +\n          innerPath +\n          ') is not within ' +\n          'outerPath (' +\n          outerPath +\n          ')'\n      );\n    }\n  }\n\n  /**\n   * @param {!Path} left\n   * @param {!Path} right\n   * @return {number} -1, 0, 1 if left is less, equal, or greater than the right.\n   */\n  static comparePaths(left: Path, right: Path): number {\n    const leftKeys = left.slice();\n    const rightKeys = right.slice();\n    for (let i = 0; i < leftKeys.length && i < rightKeys.length; i++) {\n      const cmp = nameCompare(leftKeys[i], rightKeys[i]);\n      if (cmp !== 0) {\n        return cmp;\n      }\n    }\n    if (leftKeys.length === rightKeys.length) {\n      return 0;\n    }\n    return leftKeys.length < rightKeys.length ? -1 : 1;\n  }\n\n  /**\n   *\n   * @param {Path} other\n   * @return {boolean} true if paths are the same.\n   */\n  equals(other: Path): boolean {\n    if (this.getLength() !== other.getLength()) {\n      return false;\n    }\n\n    for (\n      let i = this.pieceNum_, j = other.pieceNum_;\n      i <= this.pieces_.length;\n      i++, j++\n    ) {\n      if (this.pieces_[i] !== other.pieces_[j]) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   *\n   * @param {!Path} other\n   * @return {boolean} True if this path is a parent (or the same as) other\n   */\n  contains(other: Path): boolean {\n    let i = this.pieceNum_;\n    let j = other.pieceNum_;\n    if (this.getLength() > other.getLength()) {\n      return false;\n    }\n    while (i < this.pieces_.length) {\n      if (this.pieces_[i] !== other.pieces_[j]) {\n        return false;\n      }\n      ++i;\n      ++j;\n    }\n    return true;\n  }\n} // end Path\n\n/**\n * Dynamic (mutable) path used to count path lengths.\n *\n * This class is used to efficiently check paths for valid\n * length (in UTF8 bytes) and depth (used in path validation).\n *\n * Throws Error exception if path is ever invalid.\n *\n * The definition of a path always begins with '/'.\n */\nexport class ValidationPath {\n  /** @type {!Array<string>} */\n  private parts_: string[];\n  /** @type {number} Initialize to number of '/' chars needed in path. */\n  private byteLength_: number;\n\n  /**\n   * @param {!Path} path Initial Path.\n   * @param {string} errorPrefix_ Prefix for any error messages.\n   */\n  constructor(path: Path, private errorPrefix_: string) {\n    /** @type {!Array<string>} */\n    this.parts_ = path.slice();\n    /** @type {number} Initialize to number of '/' chars needed in path. */\n    this.byteLength_ = Math.max(1, this.parts_.length);\n\n    for (let i = 0; i < this.parts_.length; i++) {\n      this.byteLength_ += stringLength(this.parts_[i]);\n    }\n    this.checkValid_();\n  }\n\n  /** @const {number} Maximum key depth. */\n  static get MAX_PATH_DEPTH() {\n    return 32;\n  }\n\n  /** @const {number} Maximum number of (UTF8) bytes in a Firebase path. */\n  static get MAX_PATH_LENGTH_BYTES() {\n    return 768;\n  }\n\n  /** @param {string} child */\n  push(child: string) {\n    // Count the needed '/'\n    if (this.parts_.length > 0) {\n      this.byteLength_ += 1;\n    }\n    this.parts_.push(child);\n    this.byteLength_ += stringLength(child);\n    this.checkValid_();\n  }\n\n  pop() {\n    const last = this.parts_.pop();\n    this.byteLength_ -= stringLength(last);\n    // Un-count the previous '/'\n    if (this.parts_.length > 0) {\n      this.byteLength_ -= 1;\n    }\n  }\n\n  private checkValid_() {\n    if (this.byteLength_ > ValidationPath.MAX_PATH_LENGTH_BYTES) {\n      throw new Error(\n        this.errorPrefix_ +\n          'has a key path longer than ' +\n          ValidationPath.MAX_PATH_LENGTH_BYTES +\n          ' bytes (' +\n          this.byteLength_ +\n          ').'\n      );\n    }\n    if (this.parts_.length > ValidationPath.MAX_PATH_DEPTH) {\n      throw new Error(\n        this.errorPrefix_ +\n          'path specified exceeds the maximum depth that can be written (' +\n          ValidationPath.MAX_PATH_DEPTH +\n          ') or object contains a cycle ' +\n          this.toErrorString()\n      );\n    }\n  }\n\n  /**\n   * String for use in error messages - uses '.' notation for path.\n   *\n   * @return {string}\n   */\n  toErrorString(): string {\n    if (this.parts_.length === 0) {\n      return '';\n    }\n    return \"in property '\" + this.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 */\n\nexport const PROTOCOL_VERSION = '5';\n\nexport const VERSION_PARAM = 'v';\n\nexport const TRANSPORT_SESSION_PARAM = 's';\n\nexport const REFERER_PARAM = 'r';\n\nexport const FORGE_REF = 'f';\n\nexport const FORGE_DOMAIN = 'firebaseio.com';\n\nexport const LAST_SESSION_PARAM = 'ls';\n\nexport const WEBSOCKET = 'websocket';\n\nexport const LONG_POLLING = 'long_polling';\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { PersistentStorage } from './storage/storage';\nimport { LONG_POLLING, WEBSOCKET } from '../realtime/Constants';\nimport { each } from './util/util';\n\n/**\n * A class that holds metadata about a Repo object\n *\n * @constructor\n */\nexport class RepoInfo {\n  host: string;\n  domain: string;\n  internalHost: string;\n\n  /**\n   * @param {string} host Hostname portion of the url for the repo\n   * @param {boolean} secure Whether or not this repo is accessed over ssl\n   * @param {string} namespace The namespace represented by the repo\n   * @param {boolean} webSocketOnly Whether to prefer websockets over all other transports (used by Nest).\n   * @param {string=} persistenceKey Override the default session persistence storage key\n   */\n  constructor(\n    host: string,\n    public secure: boolean,\n    public namespace: string,\n    public webSocketOnly: boolean,\n    public persistenceKey: string = '',\n    public includeNamespaceInQueryParams: boolean = false\n  ) {\n    this.host = host.toLowerCase();\n    this.domain = this.host.substr(this.host.indexOf('.') + 1);\n    this.internalHost =\n      (PersistentStorage.get('host:' + host) as string) || this.host;\n  }\n\n  needsQueryParam(): boolean {\n    return (\n      this.host !== this.internalHost ||\n      this.isCustomHost() ||\n      this.includeNamespaceInQueryParams\n    );\n  }\n\n  isCacheableHost(): boolean {\n    return this.internalHost.substr(0, 2) === 's-';\n  }\n\n  isDemoHost() {\n    return this.domain === 'firebaseio-demo.com';\n  }\n\n  isCustomHost() {\n    return (\n      this.domain !== 'firebaseio.com' && this.domain !== 'firebaseio-demo.com'\n    );\n  }\n\n  updateHost(newHost: string) {\n    if (newHost !== this.internalHost) {\n      this.internalHost = newHost;\n      if (this.isCacheableHost()) {\n        PersistentStorage.set('host:' + this.host, this.internalHost);\n      }\n    }\n  }\n\n  /**\n   * Returns the websocket URL for this repo\n   * @param {string} type of connection\n   * @param {Object} params list\n   * @return {string} The URL for this repo\n   */\n  connectionURL(type: string, params: { [k: string]: string }): string {\n    assert(typeof type === 'string', 'typeof type must == string');\n    assert(typeof params === 'object', 'typeof params must == object');\n\n    let connURL: string;\n    if (type === WEBSOCKET) {\n      connURL =\n        (this.secure ? 'wss://' : 'ws://') + this.internalHost + '/.ws?';\n    } else if (type === LONG_POLLING) {\n      connURL =\n        (this.secure ? 'https://' : 'http://') + this.internalHost + '/.lp?';\n    } else {\n      throw new Error('Unknown connection type: ' + type);\n    }\n    if (this.needsQueryParam()) {\n      params['ns'] = this.namespace;\n    }\n\n    const pairs: string[] = [];\n\n    each(params, (key: string, value: string) => {\n      pairs.push(key + '=' + value);\n    });\n\n    return connURL + pairs.join('&');\n  }\n\n  /** @return {string} */\n  toString(): string {\n    let str = this.toURLString();\n    if (this.persistenceKey) {\n      str += '<' + this.persistenceKey + '>';\n    }\n    return str;\n  }\n\n  /** @return {string} */\n  toURLString(): string {\n    return (this.secure ? 'https://' : 'http://') + this.host;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from '../Path';\nimport { RepoInfo } from '../../RepoInfo';\nimport { warnIfPageIsSecure, warn, fatal } from '../util';\n\n/**\n * @param {!string} pathString\n * @return {string}\n */\nfunction decodePath(pathString: string): string {\n  let pathStringDecoded = '';\n  const pieces = pathString.split('/');\n  for (let i = 0; i < pieces.length; i++) {\n    if (pieces[i].length > 0) {\n      let piece = pieces[i];\n      try {\n        piece = decodeURIComponent(piece.replace(/\\+/g, ' '));\n      } catch (e) {}\n      pathStringDecoded += '/' + piece;\n    }\n  }\n  return pathStringDecoded;\n}\n\n/**\n * @param {!string} queryString\n * @return {!{[key:string]:string}} key value hash\n */\nfunction decodeQuery(queryString: string): { [key: string]: string } {\n  const results = {};\n  if (queryString.charAt(0) === '?') {\n    queryString = queryString.substring(1);\n  }\n  for (const segment of queryString.split('&')) {\n    if (segment.length === 0) {\n      continue;\n    }\n    const kv = segment.split('=');\n    if (kv.length === 2) {\n      results[decodeURIComponent(kv[0])] = decodeURIComponent(kv[1]);\n    } else {\n      warn(`Invalid query segment '${segment}' in query '${queryString}'`);\n    }\n  }\n  return results;\n}\n\n/**\n *\n * @param {!string} dataURL\n * @return {{repoInfo: !RepoInfo, path: !Path}}\n */\nexport const parseRepoInfo = function(\n  dataURL: string\n): { repoInfo: RepoInfo; path: Path } {\n  const parsedUrl = parseDatabaseURL(dataURL),\n    namespace = parsedUrl.namespace;\n\n  if (parsedUrl.domain === 'firebase.com') {\n    fatal(\n      parsedUrl.host +\n        ' is no longer supported. ' +\n        'Please use <YOUR FIREBASE>.firebaseio.com instead'\n    );\n  }\n\n  // Catch common error of uninitialized namespace value.\n  if (\n    (!namespace || namespace === 'undefined') &&\n    parsedUrl.domain !== 'localhost'\n  ) {\n    fatal(\n      'Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com'\n    );\n  }\n\n  if (!parsedUrl.secure) {\n    warnIfPageIsSecure();\n  }\n\n  const webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n\n  return {\n    repoInfo: new RepoInfo(\n      parsedUrl.host,\n      parsedUrl.secure,\n      namespace,\n      webSocketOnly,\n      /*persistenceKey=*/ '',\n      /*includeNamespaceInQueryParams=*/ namespace !== parsedUrl.subdomain\n    ),\n    path: new Path(parsedUrl.pathString)\n  };\n};\n\n/**\n *\n * @param {!string} dataURL\n * @return {{host: string, port: number, domain: string, subdomain: string, secure: boolean, scheme: string, pathString: string, namespace: string}}\n */\nexport const parseDatabaseURL = function(\n  dataURL: string\n): {\n  host: string;\n  port: number;\n  domain: string;\n  subdomain: string;\n  secure: boolean;\n  scheme: string;\n  pathString: string;\n  namespace: string;\n} {\n  // Default to empty strings in the event of a malformed string.\n  let host = '',\n    domain = '',\n    subdomain = '',\n    pathString = '',\n    namespace = '';\n\n  // Always default to SSL, unless otherwise specified.\n  let secure = true,\n    scheme = 'https',\n    port = 443;\n\n  // Don't do any validation here. The caller is responsible for validating the result of parsing.\n  if (typeof dataURL === 'string') {\n    // Parse scheme.\n    let colonInd = dataURL.indexOf('//');\n    if (colonInd >= 0) {\n      scheme = dataURL.substring(0, colonInd - 1);\n      dataURL = dataURL.substring(colonInd + 2);\n    }\n\n    // Parse host, path, and query string.\n    let slashInd = dataURL.indexOf('/');\n    if (slashInd === -1) {\n      slashInd = dataURL.length;\n    }\n    let questionMarkInd = dataURL.indexOf('?');\n    if (questionMarkInd === -1) {\n      questionMarkInd = dataURL.length;\n    }\n    host = dataURL.substring(0, Math.min(slashInd, questionMarkInd));\n    if (slashInd < questionMarkInd) {\n      // For pathString, questionMarkInd will always come after slashInd\n      pathString = decodePath(dataURL.substring(slashInd, questionMarkInd));\n    }\n    const queryParams = decodeQuery(\n      dataURL.substring(Math.min(dataURL.length, questionMarkInd))\n    );\n\n    // If we have a port, use scheme for determining if it's secure.\n    colonInd = host.indexOf(':');\n    if (colonInd >= 0) {\n      secure = scheme === 'https' || scheme === 'wss';\n      port = parseInt(host.substring(colonInd + 1), 10);\n    } else {\n      colonInd = host.length;\n    }\n\n    const hostWithoutPort = host.slice(0, colonInd);\n    if (hostWithoutPort.toLowerCase() === 'localhost') {\n      domain = 'localhost';\n    } else if (hostWithoutPort.split('.').length <= 2) {\n      domain = hostWithoutPort;\n    } else {\n      // Interpret the subdomain of a 3 or more component URL as the namespace name.\n      const dotInd = host.indexOf('.');\n      subdomain = host.substring(0, dotInd).toLowerCase();\n      domain = host.substring(dotInd + 1);\n      // Normalize namespaces to lowercase to share storage / connection.\n      namespace = subdomain;\n    }\n    // Always treat the value of the `ns` as the namespace name if it is present.\n    if ('ns' in queryParams) {\n      namespace = queryParams['ns'];\n    }\n  }\n\n  return {\n    host,\n    port,\n    domain,\n    subdomain,\n    secure,\n    scheme,\n    pathString,\n    namespace\n  };\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path, ValidationPath } from './Path';\nimport {\n  contains,\n  safeGet,\n  errorPrefix as errorPrefixFxn,\n  stringLength\n} from '@firebase/util';\nimport { isInvalidJSONNumber, each } from './util';\n\nimport { RepoInfo } from '../RepoInfo';\n\n/**\n * True for invalid Firebase keys\n * @type {RegExp}\n * @private\n */\nexport const INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\n\n/**\n * True for invalid Firebase paths.\n * Allows '/' in paths.\n * @type {RegExp}\n * @private\n */\nexport const INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\n\n/**\n * Maximum number of characters to allow in leaf value\n * @type {number}\n * @private\n */\nexport const MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\n\n/**\n * @param {*} key\n * @return {boolean}\n */\nexport const isValidKey = function(key: unknown): boolean {\n  return (\n    typeof key === 'string' && key.length !== 0 && !INVALID_KEY_REGEX_.test(key)\n  );\n};\n\n/**\n * @param {string} pathString\n * @return {boolean}\n */\nexport const isValidPathString = function(pathString: string): boolean {\n  return (\n    typeof pathString === 'string' &&\n    pathString.length !== 0 &&\n    !INVALID_PATH_REGEX_.test(pathString)\n  );\n};\n\n/**\n * @param {string} pathString\n * @return {boolean}\n */\nexport const isValidRootPathString = function(pathString: string): boolean {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n\n  return isValidPathString(pathString);\n};\n\n/**\n * @param {*} priority\n * @return {boolean}\n */\nexport const isValidPriority = function(priority: unknown): boolean {\n  return (\n    priority === null ||\n    typeof priority === 'string' ||\n    (typeof priority === 'number' && !isInvalidJSONNumber(priority)) ||\n    (priority &&\n      typeof priority === 'object' &&\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      contains(priority as any, '.sv'))\n  );\n};\n\n/**\n * Pre-validate a datum passed as an argument to Firebase function.\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexport const validateFirebaseDataArg = function(\n  fnName: string,\n  argumentNumber: number,\n  data: unknown,\n  path: Path,\n  optional: boolean\n) {\n  if (optional && data === undefined) {\n    return;\n  }\n\n  validateFirebaseData(\n    errorPrefixFxn(fnName, argumentNumber, optional),\n    data,\n    path\n  );\n};\n\n/**\n * Validate a data object client-side before sending to server.\n *\n * @param {string} errorPrefix\n * @param {*} data\n * @param {!Path|!ValidationPath} path_\n */\nexport const validateFirebaseData = function(\n  errorPrefix: string,\n  data: unknown,\n  path_: Path | ValidationPath\n) {\n  const path =\n    path_ instanceof Path ? new ValidationPath(path_, errorPrefix) : path_;\n\n  if (data === undefined) {\n    throw new Error(errorPrefix + 'contains undefined ' + path.toErrorString());\n  }\n  if (typeof data === 'function') {\n    throw new Error(\n      errorPrefix +\n        'contains a function ' +\n        path.toErrorString() +\n        ' with contents = ' +\n        data.toString()\n    );\n  }\n  if (isInvalidJSONNumber(data)) {\n    throw new Error(\n      errorPrefix + 'contains ' + data.toString() + ' ' + path.toErrorString()\n    );\n  }\n\n  // Check max leaf size, but try to avoid the utf8 conversion if we can.\n  if (\n    typeof data === 'string' &&\n    data.length > MAX_LEAF_SIZE_ / 3 &&\n    stringLength(data) > MAX_LEAF_SIZE_\n  ) {\n    throw new Error(\n      errorPrefix +\n        'contains a string greater than ' +\n        MAX_LEAF_SIZE_ +\n        ' utf8 bytes ' +\n        path.toErrorString() +\n        \" ('\" +\n        data.substring(0, 50) +\n        \"...')\"\n    );\n  }\n\n  // TODO = Perf = Consider combining the recursive validation of keys into NodeFromJSON\n  // to save extra walking of large objects.\n  if (data && typeof data === 'object') {\n    let hasDotValue = false;\n    let hasActualChild = false;\n    each(data, (key: string, value: unknown) => {\n      if (key === '.value') {\n        hasDotValue = true;\n      } else if (key !== '.priority' && key !== '.sv') {\n        hasActualChild = true;\n        if (!isValidKey(key)) {\n          throw new Error(\n            errorPrefix +\n              ' contains an invalid key (' +\n              key +\n              ') ' +\n              path.toErrorString() +\n              '.  Keys must be non-empty strings ' +\n              'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n          );\n        }\n      }\n\n      path.push(key);\n      validateFirebaseData(errorPrefix, value, path);\n      path.pop();\n    });\n\n    if (hasDotValue && hasActualChild) {\n      throw new Error(\n        errorPrefix +\n          ' contains \".value\" child ' +\n          path.toErrorString() +\n          ' in addition to actual children.'\n      );\n    }\n  }\n};\n\n/**\n * Pre-validate paths passed in the firebase function.\n *\n * @param {string} errorPrefix\n * @param {Array<!Path>} mergePaths\n */\nexport const validateFirebaseMergePaths = function(\n  errorPrefix: string,\n  mergePaths: Path[]\n) {\n  let i, curPath;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    const keys = curPath.slice();\n    for (let j = 0; j < keys.length; j++) {\n      if (keys[j] === '.priority' && j === keys.length - 1) {\n        // .priority is OK\n      } else if (!isValidKey(keys[j])) {\n        throw new Error(\n          errorPrefix +\n            'contains an invalid key (' +\n            keys[j] +\n            ') in path ' +\n            curPath.toString() +\n            '. Keys must be non-empty strings ' +\n            'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n        );\n      }\n    }\n  }\n\n  // Check that update keys are not descendants of each other.\n  // We rely on the property that sorting guarantees that ancestors come\n  // right before descendants.\n  mergePaths.sort(Path.comparePaths);\n  let prevPath: Path | null = null;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    if (prevPath !== null && prevPath.contains(curPath)) {\n      throw new Error(\n        errorPrefix +\n          'contains a path ' +\n          prevPath.toString() +\n          ' that is ancestor of another path ' +\n          curPath.toString()\n      );\n    }\n    prevPath = curPath;\n  }\n};\n\n/**\n * pre-validate an object passed as an argument to firebase function (\n * must be an object - e.g. for firebase.update()).\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexport const validateFirebaseMergeDataArg = function(\n  fnName: string,\n  argumentNumber: number,\n  data: unknown,\n  path: Path,\n  optional: boolean\n) {\n  if (optional && data === undefined) {\n    return;\n  }\n\n  const errorPrefix = errorPrefixFxn(fnName, argumentNumber, optional);\n\n  if (!(data && typeof data === 'object') || Array.isArray(data)) {\n    throw new Error(\n      errorPrefix + ' must be an object containing the children to replace.'\n    );\n  }\n\n  const mergePaths: Path[] = [];\n  each(data, (key: string, value: unknown) => {\n    const curPath = new Path(key);\n    validateFirebaseData(errorPrefix, value, path.child(curPath));\n    if (curPath.getBack() === '.priority') {\n      if (!isValidPriority(value)) {\n        throw new Error(\n          errorPrefix +\n            \"contains an invalid value for '\" +\n            curPath.toString() +\n            \"', which must be a valid \" +\n            'Firebase priority (a string, finite number, server value, or null).'\n        );\n      }\n    }\n    mergePaths.push(curPath);\n  });\n  validateFirebaseMergePaths(errorPrefix, mergePaths);\n};\n\nexport const validatePriority = function(\n  fnName: string,\n  argumentNumber: number,\n  priority: unknown,\n  optional: boolean\n) {\n  if (optional && priority === undefined) {\n    return;\n  }\n  if (isInvalidJSONNumber(priority)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'is ' +\n        priority.toString() +\n        ', but must be a valid Firebase priority (a string, finite number, ' +\n        'server value, or null).'\n    );\n  }\n  // Special case to allow importing data with a .sv.\n  if (!isValidPriority(priority)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'must be a valid Firebase priority ' +\n        '(a string, finite number, server value, or null).'\n    );\n  }\n};\n\nexport const validateEventType = function(\n  fnName: string,\n  argumentNumber: number,\n  eventType: string,\n  optional: boolean\n) {\n  if (optional && eventType === undefined) {\n    return;\n  }\n\n  switch (eventType) {\n    case 'value':\n    case 'child_added':\n    case 'child_removed':\n    case 'child_changed':\n    case 'child_moved':\n      break;\n    default:\n      throw new Error(\n        errorPrefixFxn(fnName, argumentNumber, optional) +\n          'must be a valid event type = \"value\", \"child_added\", \"child_removed\", ' +\n          '\"child_changed\", or \"child_moved\".'\n      );\n  }\n};\n\nexport const validateKey = function(\n  fnName: string,\n  argumentNumber: number,\n  key: string,\n  optional: boolean\n) {\n  if (optional && key === undefined) {\n    return;\n  }\n  if (!isValidKey(key)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'was an invalid key = \"' +\n        key +\n        '\".  Firebase keys must be non-empty strings and ' +\n        'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").'\n    );\n  }\n};\n\nexport const validatePathString = function(\n  fnName: string,\n  argumentNumber: number,\n  pathString: string,\n  optional: boolean\n) {\n  if (optional && pathString === undefined) {\n    return;\n  }\n\n  if (!isValidPathString(pathString)) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'was an invalid path = \"' +\n        pathString +\n        '\". Paths must be non-empty strings and ' +\n        'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"'\n    );\n  }\n};\n\nexport const validateRootPathString = function(\n  fnName: string,\n  argumentNumber: number,\n  pathString: string,\n  optional: boolean\n) {\n  if (pathString) {\n    // Allow '/.info/' at the beginning.\n    pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\n  }\n\n  validatePathString(fnName, argumentNumber, pathString, optional);\n};\n\nexport const validateWritablePath = function(fnName: string, path: Path) {\n  if (path.getFront() === '.info') {\n    throw new Error(fnName + \" failed = Can't modify data under /.info/\");\n  }\n};\n\nexport const validateUrl = function(\n  fnName: string,\n  argumentNumber: number,\n  parsedUrl: { repoInfo: RepoInfo; path: Path }\n) {\n  // TODO = Validate server better.\n  const pathString = parsedUrl.path.toString();\n  if (\n    !(typeof parsedUrl.repoInfo.host === 'string') ||\n    parsedUrl.repoInfo.host.length === 0 ||\n    (!isValidKey(parsedUrl.repoInfo.namespace) &&\n      parsedUrl.repoInfo.host.split(':')[0] !== 'localhost') ||\n    (pathString.length !== 0 && !isValidRootPathString(pathString))\n  ) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, false) +\n        'must be a valid firebase URL and ' +\n        'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".'\n    );\n  }\n};\n\nexport const validateCredential = function(\n  fnName: string,\n  argumentNumber: number,\n  cred: unknown,\n  optional: boolean\n) {\n  if (optional && cred === undefined) {\n    return;\n  }\n  if (!(typeof cred === 'string')) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'must be a valid credential (a string).'\n    );\n  }\n};\n\nexport const validateBoolean = function(\n  fnName: string,\n  argumentNumber: number,\n  bool: unknown,\n  optional: boolean\n) {\n  if (optional && bool === undefined) {\n    return;\n  }\n  if (typeof bool !== 'boolean') {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) + 'must be a boolean.'\n    );\n  }\n};\n\nexport const validateString = function(\n  fnName: string,\n  argumentNumber: number,\n  string: unknown,\n  optional: boolean\n) {\n  if (optional && string === undefined) {\n    return;\n  }\n  if (!(typeof string === 'string')) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'must be a valid string.'\n    );\n  }\n};\n\nexport const validateObject = function(\n  fnName: string,\n  argumentNumber: number,\n  obj: unknown,\n  optional: boolean\n) {\n  if (optional && obj === undefined) {\n    return;\n  }\n  if (!(obj && typeof obj === 'object') || obj === null) {\n    throw new Error(\n      errorPrefixFxn(fnName, argumentNumber, optional) +\n        'must be a valid object.'\n    );\n  }\n};\n\nexport const validateObjectContainsKey = function(\n  fnName: string,\n  argumentNumber: number,\n  obj: unknown,\n  key: string,\n  optional: boolean,\n  optType?: string\n) {\n  const objectContainsKey =\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    obj && typeof obj === 'object' && contains(obj as any, key);\n\n  if (!objectContainsKey) {\n    if (optional) {\n      return;\n    } else {\n      throw new Error(\n        errorPrefixFxn(fnName, argumentNumber, optional) +\n          'must contain the key \"' +\n          key +\n          '\"'\n      );\n    }\n  }\n\n  if (optType) {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    const val = safeGet(obj as any, key);\n    if (\n      (optType === 'number' && !(typeof val === 'number')) ||\n      (optType === 'string' && !(typeof val === 'string')) ||\n      (optType === 'boolean' && !(typeof val === 'boolean')) ||\n      (optType === 'function' && !(typeof val === 'function')) ||\n      (optType === 'object' && !(typeof val === 'object') && val)\n    ) {\n      if (optional) {\n        throw new Error(\n          errorPrefixFxn(fnName, argumentNumber, optional) +\n            'contains invalid value for key \"' +\n            key +\n            '\" (must be of type \"' +\n            optType +\n            '\")'\n        );\n      } else {\n        throw new Error(\n          errorPrefixFxn(fnName, argumentNumber, optional) +\n            'must contain the key \"' +\n            key +\n            '\" with type \"' +\n            optType +\n            '\"'\n        );\n      }\n    }\n  }\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { validateArgCount, validateCallback, Deferred } from '@firebase/util';\nimport {\n  validateWritablePath,\n  validateFirebaseDataArg,\n  validatePriority,\n  validateFirebaseMergeDataArg\n} from '../core/util/validation';\nimport { warn } from '../core/util/util';\n\nimport { Repo } from '../core/Repo';\nimport { Path } from '../core/util/Path';\nimport { Indexable } from '../core/util/misc';\n\n/**\n * @constructor\n */\nexport class OnDisconnect {\n  /**\n   * @param {!Repo} repo_\n   * @param {!Path} path_\n   */\n  constructor(private repo_: Repo, private path_: Path) {}\n\n  /**\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  cancel(onComplete?: (a: Error | null) => void): Promise<void> {\n    validateArgCount('OnDisconnect.cancel', 0, 1, arguments.length);\n    validateCallback('OnDisconnect.cancel', 1, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectCancel(\n      this.path_,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  remove(onComplete?: (a: Error | null) => void): Promise<void> {\n    validateArgCount('OnDisconnect.remove', 0, 1, arguments.length);\n    validateWritablePath('OnDisconnect.remove', this.path_);\n    validateCallback('OnDisconnect.remove', 1, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectSet(\n      this.path_,\n      null,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {*} value\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  set(value: unknown, onComplete?: (a: Error | null) => void): Promise<void> {\n    validateArgCount('OnDisconnect.set', 1, 2, arguments.length);\n    validateWritablePath('OnDisconnect.set', this.path_);\n    validateFirebaseDataArg('OnDisconnect.set', 1, value, this.path_, false);\n    validateCallback('OnDisconnect.set', 2, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectSet(\n      this.path_,\n      value,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {*} value\n   * @param {number|string|null} priority\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  setWithPriority(\n    value: unknown,\n    priority: number | string | null,\n    onComplete?: (a: Error | null) => void\n  ): Promise<void> {\n    validateArgCount('OnDisconnect.setWithPriority', 2, 3, arguments.length);\n    validateWritablePath('OnDisconnect.setWithPriority', this.path_);\n    validateFirebaseDataArg(\n      'OnDisconnect.setWithPriority',\n      1,\n      value,\n      this.path_,\n      false\n    );\n    validatePriority('OnDisconnect.setWithPriority', 2, priority, false);\n    validateCallback('OnDisconnect.setWithPriority', 3, onComplete, true);\n\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectSetWithPriority(\n      this.path_,\n      value,\n      priority,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {!Object} objectToMerge\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  update(\n    objectToMerge: Indexable,\n    onComplete?: (a: Error | null) => void\n  ): Promise<void> {\n    validateArgCount('OnDisconnect.update', 1, 2, arguments.length);\n    validateWritablePath('OnDisconnect.update', this.path_);\n    if (Array.isArray(objectToMerge)) {\n      const newObjectToMerge: { [k: string]: unknown } = {};\n      for (let i = 0; i < objectToMerge.length; ++i) {\n        newObjectToMerge['' + i] = objectToMerge[i];\n      }\n      objectToMerge = newObjectToMerge;\n      warn(\n        'Passing an Array to firebase.database.onDisconnect().update() is deprecated. Use set() if you want to overwrite the ' +\n          'existing data, or an Object with integer keys if you really do want to only update some of the children.'\n      );\n    }\n    validateFirebaseMergeDataArg(\n      'OnDisconnect.update',\n      1,\n      objectToMerge,\n      this.path_,\n      false\n    );\n    validateCallback('OnDisconnect.update', 2, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectUpdate(\n      this.path_,\n      objectToMerge,\n      deferred.wrapCallback(onComplete)\n    );\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 */\n\nimport { DataSnapshot } from './DataSnapshot';\nimport { validateArgCount } from '@firebase/util';\n\nexport class TransactionResult {\n  /**\n   * A type for the resolve value of Firebase.transaction.\n   * @constructor\n   * @dict\n   * @param {boolean} committed\n   * @param {DataSnapshot} snapshot\n   */\n  constructor(public committed: boolean, public snapshot: DataSnapshot) {}\n\n  // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n  // for end-users\n  toJSON(): object {\n    validateArgCount('TransactionResult.toJSON', 0, 1, arguments.length);\n    return { committed: this.committed, snapshot: this.snapshot.toJSON() };\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\n/**\n * Fancy ID generator that creates 20-character string identifiers with the\n * following properties:\n *\n * 1. They're based on timestamp so that they sort *after* any existing ids.\n * 2. They contain 72-bits of random data after the timestamp so that IDs won't\n *    collide with other clients' IDs.\n * 3. They sort *lexicographically* (so the timestamp is converted to characters\n *    that will sort properly).\n * 4. They're monotonically increasing. Even if you generate more than one in\n *    the same timestamp, the latter ones will sort after the former ones. We do\n *    this by using the previous random bits but \"incrementing\" them by 1 (only\n *    in the case of a timestamp collision).\n */\nexport const nextPushId = (function() {\n  // Modeled after base64 web-safe chars, but ordered by ASCII.\n  const PUSH_CHARS =\n    '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\n\n  // Timestamp of last push, used to prevent local collisions if you push twice\n  // in one ms.\n  let lastPushTime = 0;\n\n  // We generate 72-bits of randomness which get turned into 12 characters and\n  // appended to the timestamp to prevent collisions with other clients. We\n  // store the last characters we generated because in the event of a collision,\n  // we'll use those same characters except \"incremented\" by one.\n  const lastRandChars: number[] = [];\n\n  return function(now: number) {\n    const duplicateTime = now === lastPushTime;\n    lastPushTime = now;\n\n    let i;\n    const timeStampChars = new Array(8);\n    for (i = 7; i >= 0; i--) {\n      timeStampChars[i] = PUSH_CHARS.charAt(now % 64);\n      // NOTE: Can't use << here because javascript will convert to int and lose\n      // the upper bits.\n      now = Math.floor(now / 64);\n    }\n    assert(now === 0, 'Cannot push at time == 0');\n\n    let id = timeStampChars.join('');\n\n    if (!duplicateTime) {\n      for (i = 0; i < 12; i++) {\n        lastRandChars[i] = Math.floor(Math.random() * 64);\n      }\n    } else {\n      // If the timestamp hasn't changed since last push, use the same random\n      // number, except incremented by 1.\n      for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {\n        lastRandChars[i] = 0;\n      }\n      lastRandChars[i]++;\n    }\n    for (i = 0; i < 12; i++) {\n      id += PUSH_CHARS.charAt(lastRandChars[i]);\n    }\n    assert(id.length === 20, 'nextPushId: Length should be 20.');\n\n    return id;\n  };\n})();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from '../util/Path';\nimport { Index } from './indexes/Index';\n\n/**\n * Node is an interface defining the common functionality for nodes in\n * a DataSnapshot.\n *\n * @interface\n */\nexport interface Node {\n  /**\n   * Whether this node is a leaf node.\n   * @return {boolean} Whether this is a leaf node.\n   */\n  isLeafNode(): boolean;\n\n  /**\n   * Gets the priority of the node.\n   * @return {!Node} The priority of the node.\n   */\n  getPriority(): Node;\n\n  /**\n   * Returns a duplicate node with the new priority.\n   * @param {!Node} newPriorityNode New priority to set for the node.\n   * @return {!Node} Node with new priority.\n   */\n  updatePriority(newPriorityNode: Node): Node;\n\n  /**\n   * Returns the specified immediate child, or null if it doesn't exist.\n   * @param {string} childName The name of the child to retrieve.\n   * @return {!Node} The retrieved child, or an empty node.\n   */\n  getImmediateChild(childName: string): Node;\n\n  /**\n   * Returns a child by path, or null if it doesn't exist.\n   * @param {!Path} path The path of the child to retrieve.\n   * @return {!Node} The retrieved child or an empty node.\n   */\n  getChild(path: Path): Node;\n\n  /**\n   * Returns the name of the child immediately prior to the specified childNode, or null.\n   * @param {!string} childName The name of the child to find the predecessor of.\n   * @param {!Node} childNode The node to find the predecessor of.\n   * @param {!Index} index The index to use to determine the predecessor\n   * @return {?string} The name of the predecessor child, or null if childNode is the first child.\n   */\n  getPredecessorChildName(\n    childName: string,\n    childNode: Node,\n    index: Index\n  ): string | null;\n\n  /**\n   * Returns a duplicate node, with the specified immediate child updated.\n   * Any value in the node will be removed.\n   * @param {string} childName The name of the child to update.\n   * @param {!Node} newChildNode The new child node\n   * @return {!Node} The updated node.\n   */\n  updateImmediateChild(childName: string, newChildNode: Node): Node;\n\n  /**\n   * Returns a duplicate node, with the specified child updated.  Any value will\n   * be removed.\n   * @param {!Path} path The path of the child to update.\n   * @param {!Node} newChildNode The new child node, which may be an empty node\n   * @return {!Node} The updated node.\n   */\n  updateChild(path: Path, newChildNode: Node): Node;\n\n  /**\n   * True if the immediate child specified exists\n   * @param {!string} childName\n   * @return {boolean}\n   */\n  hasChild(childName: string): boolean;\n\n  /**\n   * @return {boolean} True if this node has no value or children.\n   */\n  isEmpty(): boolean;\n\n  /**\n   * @return {number} The number of children of this node.\n   */\n  numChildren(): number;\n\n  /**\n   * Calls action for each child.\n   * @param {!Index} index\n   * @param {function(string, !Node)} action Action to be called for\n   * each child.  It's passed the child name and the child node.\n   * @return {*} The first truthy value return by action, or the last falsey one\n   */\n  forEachChild(index: Index, action: (a: string, b: Node) => void): unknown;\n\n  /**\n   * @param exportFormat True for export format (also wire protocol format).\n   * @return Value of this node as JSON.\n   */\n  val(exportFormat?: boolean): unknown;\n\n  /**\n   * @return {string} hash representing the node contents.\n   */\n  hash(): string;\n\n  /**\n   * @param {!Node} other Another node\n   * @return {!number} -1 for less than, 0 for equal, 1 for greater than other\n   */\n  compareTo(other: Node): number;\n\n  /**\n   * @param {!Node} other\n   * @return {boolean} Whether or not this snapshot equals other\n   */\n  equals(other: Node): boolean;\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {!Node} This node, with the specified index now available\n   */\n  withIndex(indexDefinition: Index): Node;\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {boolean}\n   */\n  isIndexed(indexDefinition: Index): boolean;\n}\n\n/**\n *\n * @param {!string} name\n * @param {!Node} node\n * @constructor\n * @struct\n */\nexport class NamedNode {\n  constructor(public name: string, public node: Node) {}\n\n  /**\n   *\n   * @param {!string} name\n   * @param {!Node} node\n   * @return {NamedNode}\n   */\n  static Wrap(name: string, node: Node) {\n    return new NamedNode(name, node);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Node, NamedNode } from '../Node';\nimport { MIN_NAME, MAX_NAME } from '../../util/util';\nimport { Comparator } from '../../util/SortedMap';\n\n/**\n *\n * @constructor\n */\nexport abstract class Index {\n  /**\n   * @param {!NamedNode} a\n   * @param {!NamedNode} b\n   * @return {number}\n   */\n  abstract compare(a: NamedNode, b: NamedNode): number;\n\n  /**\n   * @param {!Node} node\n   * @return {boolean}\n   */\n  abstract isDefinedOn(node: Node): boolean;\n\n  /**\n   * @return {function(!NamedNode, !NamedNode):number} A standalone comparison function for\n   * this index\n   */\n  getCompare(): Comparator<NamedNode> {\n    return this.compare.bind(this);\n  }\n\n  /**\n   * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\n   * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\n   *\n   * @param {!Node} oldNode\n   * @param {!Node} newNode\n   * @return {boolean} True if the portion of the snapshot being indexed changed between oldNode and newNode\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    const oldWrapped = new NamedNode(MIN_NAME, oldNode);\n    const newWrapped = new NamedNode(MIN_NAME, newNode);\n    return this.compare(oldWrapped, newWrapped) !== 0;\n  }\n\n  /**\n   * @return {!NamedNode} a node wrapper that will sort equal to or less than\n   * any other node wrapper, using this index\n   */\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n\n  /**\n   * @return {!NamedNode} a node wrapper that will sort greater than or equal to\n   * any other node wrapper, using this index\n   */\n  abstract maxPost(): NamedNode;\n\n  /**\n   * @param {*} indexValue\n   * @param {string} name\n   * @return {!NamedNode}\n   */\n  abstract makePost(indexValue: unknown, name: string): NamedNode;\n\n  /**\n   * @return {!string} String representation for inclusion in a query spec\n   */\n  abstract toString(): string;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Index } from './Index';\nimport { Node, NamedNode } from '../Node';\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { assert, assertionError } from '@firebase/util';\nimport { ChildrenNode } from '../ChildrenNode';\n\nlet __EMPTY_NODE: ChildrenNode;\n\nexport class KeyIndex extends Index {\n  static get __EMPTY_NODE() {\n    return __EMPTY_NODE;\n  }\n\n  static set __EMPTY_NODE(val) {\n    __EMPTY_NODE = val;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  compare(a: NamedNode, b: NamedNode): number {\n    return nameCompare(a.name, b.name);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  isDefinedOn(node: Node): boolean {\n    // We could probably return true here (since every node has a key), but it's never called\n    // so just leaving unimplemented for now.\n    throw assertionError('KeyIndex.isDefinedOn not expected to be called.');\n  }\n\n  /**\n   * @inheritDoc\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return false; // The key for a node never changes.\n  }\n\n  /**\n   * @inheritDoc\n   */\n  minPost() {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  maxPost(): NamedNode {\n    // TODO: This should really be created once and cached in a static property, but\n    // NamedNode isn't defined yet, so I can't use it in a static.  Bleh.\n    return new NamedNode(MAX_NAME, __EMPTY_NODE);\n  }\n\n  /**\n   * @param {*} indexValue\n   * @param {string} name\n   * @return {!NamedNode}\n   */\n  makePost(indexValue: string, name: string): NamedNode {\n    assert(\n      typeof indexValue === 'string',\n      'KeyIndex indexValue must always be a string.'\n    );\n    // We just use empty node, but it'll never be compared, since our comparator only looks at name.\n    return new NamedNode(indexValue, __EMPTY_NODE);\n  }\n\n  /**\n   * @return {!string} String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.key';\n  }\n}\n\nexport const KEY_INDEX = new KeyIndex();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, contains } from '@firebase/util';\nimport { doubleToIEEE754String } from '../util/util';\n\nimport { Node } from './Node';\nimport { Indexable } from '../util/misc';\n\nlet MAX_NODE: Node;\n\nexport function setMaxNode(val: Node) {\n  MAX_NODE = val;\n}\n\n/**\n * @param {(!string|!number)} priority\n * @return {!string}\n */\nexport const priorityHashText = function(priority: string | number): string {\n  if (typeof priority === 'number') {\n    return 'number:' + doubleToIEEE754String(priority);\n  } else {\n    return 'string:' + priority;\n  }\n};\n\n/**\n * Validates that a priority snapshot Node is valid.\n *\n * @param {!Node} priorityNode\n */\nexport const validatePriorityNode = function(priorityNode: Node) {\n  if (priorityNode.isLeafNode()) {\n    const val = priorityNode.val();\n    assert(\n      typeof val === 'string' ||\n        typeof val === 'number' ||\n        (typeof val === 'object' && contains(val as Indexable, '.sv')),\n      'Priority must be a string or number.'\n    );\n  } else {\n    assert(\n      priorityNode === MAX_NODE || priorityNode.isEmpty(),\n      'priority of unexpected type.'\n    );\n  }\n  // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\n  assert(\n    priorityNode === MAX_NODE || priorityNode.getPriority().isEmpty(),\n    \"Priority nodes can't have a priority of their own.\"\n  );\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { doubleToIEEE754String, sha1 } from '../util/util';\nimport { priorityHashText, validatePriorityNode } from './snap';\nimport { Node } from './Node';\nimport { Path } from '../util/Path';\nimport { Index } from './indexes/Index';\nimport { ChildrenNodeConstructor } from './ChildrenNode';\nimport { Indexable } from '../util/misc';\n\nlet __childrenNodeConstructor: ChildrenNodeConstructor;\n\n/**\n * LeafNode is a class for storing leaf nodes in a DataSnapshot.  It\n * implements Node and stores the value of the node (a string,\n * number, or boolean) accessible via getValue().\n */\nexport class LeafNode implements Node {\n  static set __childrenNodeConstructor(val: ChildrenNodeConstructor) {\n    __childrenNodeConstructor = val;\n  }\n\n  static get __childrenNodeConstructor() {\n    return __childrenNodeConstructor;\n  }\n\n  /**\n   * The sort order for comparing leaf nodes of different types. If two leaf nodes have\n   * the same type, the comparison falls back to their value\n   * @type {Array.<!string>}\n   * @const\n   */\n  static VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\n\n  private lazyHash_: string | null = null;\n\n  /**\n   * @implements {Node}\n   * @param {!(string|number|boolean|Object)} value_ The value to store in this leaf node.\n   *                                         The object type is possible in the event of a deferred value\n   * @param {!Node=} priorityNode_ The priority of this node.\n   */\n  constructor(\n    private readonly value_: string | number | boolean | Indexable,\n    private priorityNode_: Node = LeafNode.__childrenNodeConstructor.EMPTY_NODE\n  ) {\n    assert(\n      this.value_ !== undefined && this.value_ !== null,\n      \"LeafNode shouldn't be created with null/undefined value.\"\n    );\n\n    validatePriorityNode(this.priorityNode_);\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return true;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    return new LeafNode(this.value_, newPriorityNode);\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.priorityNode_;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    if (path.isEmpty()) {\n      return this;\n    } else if (path.getFront() === '.priority') {\n      return this.priorityNode_;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  hasChild(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPredecessorChildName(childName: string, childNode: Node): null {\n    return null;\n  }\n\n  /** @inheritDoc */\n  updateImmediateChild(childName: string, newChildNode: Node): Node {\n    if (childName === '.priority') {\n      return this.updatePriority(newChildNode);\n    } else if (newChildNode.isEmpty() && childName !== '.priority') {\n      return this;\n    } else {\n      return LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateImmediateChild(\n        childName,\n        newChildNode\n      ).updatePriority(this.priorityNode_);\n    }\n  }\n\n  /** @inheritDoc */\n  updateChild(path: Path, newChildNode: Node): Node {\n    const front = path.getFront();\n    if (front === null) {\n      return newChildNode;\n    } else if (newChildNode.isEmpty() && front !== '.priority') {\n      return this;\n    } else {\n      assert(\n        front !== '.priority' || path.getLength() === 1,\n        '.priority must be the last token in a path'\n      );\n\n      return this.updateImmediateChild(\n        front,\n        LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(\n          path.popFront(),\n          newChildNode\n        )\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  numChildren(): number {\n    return 0;\n  }\n\n  /** @inheritDoc */\n  forEachChild(index: Index, action: (s: string, n: Node) => void): boolean {\n    return false;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  val(exportFormat?: boolean): {} {\n    if (exportFormat && !this.getPriority().isEmpty()) {\n      return {\n        '.value': this.getValue(),\n        '.priority': this.getPriority().val()\n      };\n    } else {\n      return this.getValue();\n    }\n  }\n\n  /** @inheritDoc */\n  hash(): string {\n    if (this.lazyHash_ === null) {\n      let toHash = '';\n      if (!this.priorityNode_.isEmpty()) {\n        toHash +=\n          'priority:' +\n          priorityHashText(this.priorityNode_.val() as number | string) +\n          ':';\n      }\n\n      const type = typeof this.value_;\n      toHash += type + ':';\n      if (type === 'number') {\n        toHash += doubleToIEEE754String(this.value_ as number);\n      } else {\n        toHash += this.value_;\n      }\n      this.lazyHash_ = sha1(toHash);\n    }\n    return this.lazyHash_;\n  }\n\n  /**\n   * Returns the value of the leaf node.\n   * @return {Object|string|number|boolean} The value of the node.\n   */\n  getValue(): Indexable | string | number | boolean {\n    return this.value_;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  compareTo(other: Node): number {\n    if (other === LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\n      return 1;\n    } else if (other instanceof LeafNode.__childrenNodeConstructor) {\n      return -1;\n    } else {\n      assert(other.isLeafNode(), 'Unknown node type');\n      return this.compareToLeafNode_(other as LeafNode);\n    }\n  }\n\n  /**\n   * Comparison specifically for two leaf nodes\n   * @param {!LeafNode} otherLeaf\n   * @return {!number}\n   * @private\n   */\n  private compareToLeafNode_(otherLeaf: LeafNode): number {\n    const otherLeafType = typeof otherLeaf.value_;\n    const thisLeafType = typeof this.value_;\n    const otherIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(otherLeafType);\n    const thisIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(thisLeafType);\n    assert(otherIndex >= 0, 'Unknown leaf type: ' + otherLeafType);\n    assert(thisIndex >= 0, 'Unknown leaf type: ' + thisLeafType);\n    if (otherIndex === thisIndex) {\n      // Same type, compare values\n      if (thisLeafType === 'object') {\n        // Deferred value nodes are all equal, but we should also never get to this point...\n        return 0;\n      } else {\n        // Note that this works because true > false, all others are number or string comparisons\n        if (this.value_ < otherLeaf.value_) {\n          return -1;\n        } else if (this.value_ === otherLeaf.value_) {\n          return 0;\n        } else {\n          return 1;\n        }\n      }\n    } else {\n      return thisIndex - otherIndex;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  withIndex(): Node {\n    return this;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  isIndexed(): boolean {\n    return true;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  equals(other: Node): boolean {\n    /**\n     * @inheritDoc\n     */\n    if (other === this) {\n      return true;\n    } else if (other.isLeafNode()) {\n      const otherLeaf = other as LeafNode;\n      return (\n        this.value_ === otherLeaf.value_ &&\n        this.priorityNode_.equals(otherLeaf.priorityNode_)\n      );\n    } else {\n      return false;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Index } from './Index';\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { NamedNode, Node } from '../Node';\nimport { LeafNode } from '../LeafNode';\n\nlet nodeFromJSON: (a: unknown) => Node;\nlet MAX_NODE: Node;\n\nexport function setNodeFromJSON(val: (a: unknown) => Node) {\n  nodeFromJSON = val;\n}\n\nexport function setMaxNode(val: Node) {\n  MAX_NODE = val;\n}\n\n/**\n * @constructor\n * @extends {Index}\n * @private\n */\nexport class PriorityIndex extends Index {\n  /**\n   * @inheritDoc\n   */\n  compare(a: NamedNode, b: NamedNode): number {\n    const aPriority = a.node.getPriority();\n    const bPriority = b.node.getPriority();\n    const indexCmp = aPriority.compareTo(bPriority);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  isDefinedOn(node: Node): boolean {\n    return !node.getPriority().isEmpty();\n  }\n\n  /**\n   * @inheritDoc\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return !oldNode.getPriority().equals(newNode.getPriority());\n  }\n\n  /**\n   * @inheritDoc\n   */\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  maxPost(): NamedNode {\n    return new NamedNode(MAX_NAME, new LeafNode('[PRIORITY-POST]', MAX_NODE));\n  }\n\n  /**\n   * @param {*} indexValue\n   * @param {string} name\n   * @return {!NamedNode}\n   */\n  makePost(indexValue: unknown, name: string): NamedNode {\n    const priorityNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, new LeafNode('[PRIORITY-POST]', priorityNode));\n  }\n\n  /**\n   * @return {!string} String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.priority';\n  }\n}\n\nexport const PRIORITY_INDEX = new PriorityIndex();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview Implementation of an immutable SortedMap using a Left-leaning\n * Red-Black Tree, adapted from the implementation in Mugs\n * (http://mads379.github.com/mugs/) by Mads Hartmann Jensen\n * (mads379@gmail.com).\n *\n * Original paper on Left-leaning Red-Black Trees:\n *   http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf\n *\n * Invariant 1: No red node has a red child\n * Invariant 2: Every leaf path has the same number of black nodes\n * Invariant 3: Only the left child can be red (left leaning)\n */\n\n// TODO: There are some improvements I'd like to make to improve memory / perf:\n//  * Create two prototypes, LLRedNode and LLBlackNode, instead of storing a\n//    color property in every node.\n// TODO: It would also be good (and possibly necessary) to create a base\n// interface for LLRBNode and LLRBEmptyNode.\n\nexport type Comparator<K> = (key1: K, key2: K) => number;\n\n/**\n * An iterator over an LLRBNode.\n */\nexport class SortedMapIterator<K, V, T> {\n  /** @private\n   * @type {Array.<!LLRBNode>}\n   */\n  private nodeStack_: Array<LLRBNode<K, V> | LLRBEmptyNode<K, V>> = [];\n\n  /**\n   * @template K, V, T\n   * @param {LLRBNode|LLRBEmptyNode} node Node to iterate.\n   * @param {?K} startKey\n   * @param {function(K, K): number} comparator\n   * @param {boolean} isReverse_ Whether or not to iterate in reverse\n   * @param {(function(K, V):T)=} resultGenerator_\n   */\n  constructor(\n    node: LLRBNode<K, V> | LLRBEmptyNode<K, V>,\n    startKey: K | null,\n    comparator: Comparator<K>,\n    private isReverse_: boolean,\n    private resultGenerator_: ((k: K, v: V) => T) | null = null\n  ) {\n    let cmp = 1;\n    while (!node.isEmpty()) {\n      node = node as LLRBNode<K, V>;\n      cmp = startKey ? comparator(node.key, startKey) : 1;\n      // flip the comparison if we're going in reverse\n      if (isReverse_) {\n        cmp *= -1;\n      }\n\n      if (cmp < 0) {\n        // This node is less than our start key. ignore it\n        if (this.isReverse_) {\n          node = node.left;\n        } else {\n          node = node.right;\n        }\n      } else if (cmp === 0) {\n        // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\n        this.nodeStack_.push(node);\n        break;\n      } else {\n        // This node is greater than our start key, add it to the stack and move to the next one\n        this.nodeStack_.push(node);\n        if (this.isReverse_) {\n          node = node.right;\n        } else {\n          node = node.left;\n        }\n      }\n    }\n  }\n\n  getNext(): T {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n\n    let node = this.nodeStack_.pop();\n    let result: T;\n    if (this.resultGenerator_) {\n      result = this.resultGenerator_(node.key, node.value);\n    } else {\n      result = ({ key: node.key, value: node.value } as unknown) as T;\n    }\n\n    if (this.isReverse_) {\n      node = node.left;\n      while (!node.isEmpty()) {\n        this.nodeStack_.push(node);\n        node = node.right;\n      }\n    } else {\n      node = node.right;\n      while (!node.isEmpty()) {\n        this.nodeStack_.push(node);\n        node = node.left;\n      }\n    }\n\n    return result;\n  }\n\n  hasNext(): boolean {\n    return this.nodeStack_.length > 0;\n  }\n\n  peek(): T {\n    if (this.nodeStack_.length === 0) {\n      return null;\n    }\n\n    const node = this.nodeStack_[this.nodeStack_.length - 1];\n    if (this.resultGenerator_) {\n      return this.resultGenerator_(node.key, node.value);\n    } else {\n      return ({ key: node.key, value: node.value } as unknown) as T;\n    }\n  }\n}\n\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nexport class LLRBNode<K, V> {\n  color: boolean;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n\n  /**\n   * @template K, V\n   * @param {!K} key Key associated with this node.\n   * @param {!V} value Value associated with this node.\n   * @param {?boolean} color Whether this node is red.\n   * @param {?(LLRBNode|LLRBEmptyNode)=} left Left child.\n   * @param {?(LLRBNode|LLRBEmptyNode)=} right Right child.\n   */\n  constructor(\n    public key: K,\n    public value: V,\n    color: boolean | null,\n    left?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ) {\n    this.color = color != null ? color : LLRBNode.RED;\n    this.left =\n      left != null ? left : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n    this.right =\n      right != null ? right : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n  }\n\n  static RED = true;\n  static BLACK = false;\n\n  /**\n   * Returns a copy of the current node, optionally replacing pieces of it.\n   *\n   * @param {?K} key New key for the node, or null.\n   * @param {?V} value New value for the node, or null.\n   * @param {?boolean} color New color for the node, or null.\n   * @param {?LLRBNode|LLRBEmptyNode} left New left child for the node, or null.\n   * @param {?LLRBNode|LLRBEmptyNode} right New right child for the node, or null.\n   * @return {!LLRBNode} The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBNode<K, V> {\n    return new LLRBNode(\n      key != null ? key : this.key,\n      value != null ? value : this.value,\n      color != null ? color : this.color,\n      left != null ? left : this.left,\n      right != null ? right : this.right\n    );\n  }\n\n  /**\n   * @return {number} The total number of nodes in the tree.\n   */\n  count(): number {\n    return this.left.count() + 1 + this.right.count();\n  }\n\n  /**\n   * @return {boolean} True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param {function(!K, !V):*} action Callback function to be called for each\n   *   node.  If it returns true, traversal is aborted.\n   * @return {*} The first truthy value returned by action, or the last falsey\n   *   value returned by action\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return (\n      this.left.inorderTraversal(action) ||\n      !!action(this.key, this.value) ||\n      this.right.inorderTraversal(action)\n    );\n  }\n\n  /**\n   * Traverses the tree in reverse key order and calls the specified action function\n   * for each node.\n   *\n   * @param {function(!Object, !Object)} action Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @return {*} True if traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return (\n      this.right.reverseTraversal(action) ||\n      action(this.key, this.value) ||\n      this.left.reverseTraversal(action)\n    );\n  }\n\n  /**\n   * @return {!Object} The minimum node in the tree.\n   * @private\n   */\n  private min_(): LLRBNode<K, V> {\n    if (this.left.isEmpty()) {\n      return this;\n    } else {\n      return (this.left as LLRBNode<K, V>).min_();\n    }\n  }\n\n  /**\n   * @return {!K} The maximum key in the tree.\n   */\n  minKey(): K {\n    return this.min_().key;\n  }\n\n  /**\n   * @return {!K} The maximum key in the tree.\n   */\n  maxKey(): K {\n    if (this.right.isEmpty()) {\n      return this.key;\n    } else {\n      return this.right.maxKey();\n    }\n  }\n\n  /**\n   *\n   * @param {!Object} key Key to insert.\n   * @param {!Object} value Value to insert.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBNode} New tree, with the key/value added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    let n: LLRBNode<K, V> = this;\n    const cmp = comparator(key, n.key);\n    if (cmp < 0) {\n      n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\n    } else if (cmp === 0) {\n      n = n.copy(null, value, null, null, null);\n    } else {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        n.right.insert(key, value, comparator)\n      );\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode|LLRBEmptyNode} New tree, with the minimum key removed.\n   */\n  private removeMin_(): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    if (this.left.isEmpty()) {\n      return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n    }\n    let n: LLRBNode<K, V> = this;\n    if (!n.left.isRed_() && !n.left.left.isRed_()) {\n      n = n.moveRedLeft_();\n    }\n    n = n.copy(null, null, null, (n.left as LLRBNode<K, V>).removeMin_(), null);\n    return n.fixUp_();\n  }\n\n  /**\n   * @param {!Object} key The key of the item to remove.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBNode|LLRBEmptyNode} New tree, with the specified item removed.\n   */\n  remove(\n    key: K,\n    comparator: Comparator<K>\n  ): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    let n, smallest;\n    n = this;\n    if (comparator(key, n.key) < 0) {\n      if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\n        n = n.moveRedLeft_();\n      }\n      n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n    } else {\n      if (n.left.isRed_()) {\n        n = n.rotateRight_();\n      }\n      if (!n.right.isEmpty() && !n.right.isRed_() && !n.right.left.isRed_()) {\n        n = n.moveRedRight_();\n      }\n      if (comparator(key, n.key) === 0) {\n        if (n.right.isEmpty()) {\n          return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n        } else {\n          smallest = (n.right as LLRBNode<K, V>).min_();\n          n = n.copy(\n            smallest.key,\n            smallest.value,\n            null,\n            null,\n            (n.right as LLRBNode<K, V>).removeMin_()\n          );\n        }\n      }\n      n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @private\n   * @return {boolean} Whether this is a RED node.\n   */\n  isRed_(): boolean {\n    return this.color;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree after performing any needed rotations.\n   */\n  private fixUp_(): LLRBNode<K, V> {\n    let n: LLRBNode<K, V> = this;\n    if (n.right.isRed_() && !n.left.isRed_()) {\n      n = n.rotateLeft_();\n    }\n    if (n.left.isRed_() && n.left.left.isRed_()) {\n      n = n.rotateRight_();\n    }\n    if (n.left.isRed_() && n.right.isRed_()) {\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after moveRedLeft.\n   */\n  private moveRedLeft_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.right.left.isRed_()) {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        (n.right as LLRBNode<K, V>).rotateRight_()\n      );\n      n = n.rotateLeft_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after moveRedRight.\n   */\n  private moveRedRight_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.left.left.isRed_()) {\n      n = n.rotateRight_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after rotateLeft.\n   */\n  private rotateLeft_(): LLRBNode<K, V> {\n    const nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n    return this.right.copy(null, null, this.color, nl, null) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after rotateRight.\n   */\n  private rotateRight_(): LLRBNode<K, V> {\n    const nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n    return this.left.copy(null, null, this.color, null, nr) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after colorFlip.\n   */\n  private colorFlip_(): LLRBNode<K, V> {\n    const left = this.left.copy(null, null, !this.left.color, null, null);\n    const right = this.right.copy(null, null, !this.right.color, null, null);\n    return this.copy(null, null, !this.color, left, right);\n  }\n\n  /**\n   * For testing.\n   *\n   * @private\n   * @return {boolean} True if all is well.\n   */\n  private checkMaxDepth_(): boolean {\n    const blackDepth = this.check_();\n    return Math.pow(2.0, blackDepth) <= this.count() + 1;\n  }\n\n  /**\n   * @private\n   * @return {number} Not sure what this returns exactly. :-).\n   */\n  check_(): number {\n    if (this.isRed_() && this.left.isRed_()) {\n      throw new Error(\n        'Red node has red child(' + this.key + ',' + this.value + ')'\n      );\n    }\n    if (this.right.isRed_()) {\n      throw new Error(\n        'Right child of (' + this.key + ',' + this.value + ') is red'\n      );\n    }\n    const blackDepth = this.left.check_();\n    if (blackDepth !== this.right.check_()) {\n      throw new Error('Black depths differ');\n    } else {\n      return blackDepth + (this.isRed_() ? 0 : 1);\n    }\n  }\n}\n\n/**\n * Represents an empty node (a leaf node in the Red-Black Tree).\n */\nexport class LLRBEmptyNode<K, V> {\n  key: K;\n  value: V;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  color: boolean;\n\n  /**\n   * Returns a copy of the current node.\n   *\n   * @return {!LLRBEmptyNode} The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key/value added.\n   *\n   * @param {!K} key Key to be added.\n   * @param {!V} value Value to be added.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBNode} New tree, with item added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    return new LLRBNode(key, value, null);\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key removed.\n   *\n   * @param {!K} key The key to remove.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBEmptyNode} New tree, with item removed.\n   */\n  remove(key: K, comparator: Comparator<K>): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * @return {number} The total number of nodes in the tree.\n   */\n  count(): number {\n    return 0;\n  }\n\n  /**\n   * @return {boolean} True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return true;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param {function(!K, !V):*} action Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @return {boolean} True if traversal was aborted.\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in reverse key order and calls the specified action function\n   * for each node.\n   *\n   * @param {function(!K, !V)} action Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @return {boolean} True if traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return false;\n  }\n\n  /**\n   * @return {null}\n   */\n  minKey(): null {\n    return null;\n  }\n\n  /**\n   * @return {null}\n   */\n  maxKey(): null {\n    return null;\n  }\n\n  /**\n   * @private\n   * @return {number} Not sure what this returns exactly. :-).\n   */\n  check_(): number {\n    return 0;\n  }\n\n  /**\n   * @private\n   * @return {boolean} Whether this node is red.\n   */\n  isRed_() {\n    return false;\n  }\n}\n\n/**\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\n * tree.\n */\nexport class SortedMap<K, V> {\n  /**\n   * Always use the same empty node, to reduce memory.\n   * @const\n   */\n  static EMPTY_NODE = new LLRBEmptyNode();\n\n  /**\n   * @template K, V\n   * @param {function(K, K):number} comparator_ Key comparator.\n   * @param {LLRBNode=} root_ (Optional) Root node for the map.\n   */\n  constructor(\n    private comparator_: Comparator<K>,\n    private root_:\n      | LLRBNode<K, V>\n      | LLRBEmptyNode<K, V> = SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>\n  ) {}\n\n  /**\n   * Returns a copy of the map, with the specified key/value added or replaced.\n   * (TODO: We should perhaps rename this method to 'put')\n   *\n   * @param {!K} key Key to be added.\n   * @param {!V} value Value to be added.\n   * @return {!SortedMap.<K, V>} New map, with item added.\n   */\n  insert(key: K, value: V): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .insert(key, value, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns a copy of the map, with the specified key removed.\n   *\n   * @param {!K} key The key to remove.\n   * @return {!SortedMap.<K, V>} New map, with item removed.\n   */\n  remove(key: K): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .remove(key, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns the value of the node with the given key, or null.\n   *\n   * @param {!K} key The key to look up.\n   * @return {?V} The value of the node with the given key, or null if the\n   * key doesn't exist.\n   */\n  get(key: K): V | null {\n    let cmp;\n    let node = this.root_;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        return node.value;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        node = node.right;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Returns the key of the item *before* the specified key, or null if key is the first item.\n   * @param {K} key The key to find the predecessor of\n   * @return {?K} The predecessor key.\n   */\n  getPredecessorKey(key: K): K | null {\n    let cmp,\n      node = this.root_,\n      rightParent = null;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        if (!node.left.isEmpty()) {\n          node = node.left;\n          while (!node.right.isEmpty()) {\n            node = node.right;\n          }\n          return node.key;\n        } else if (rightParent) {\n          return rightParent.key;\n        } else {\n          return null; // first item.\n        }\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        rightParent = node;\n        node = node.right;\n      }\n    }\n\n    throw new Error(\n      'Attempted to find predecessor key for a nonexistent key.  What gives?'\n    );\n  }\n\n  /**\n   * @return {boolean} True if the map is empty.\n   */\n  isEmpty(): boolean {\n    return this.root_.isEmpty();\n  }\n\n  /**\n   * @return {number} The total number of nodes in the map.\n   */\n  count(): number {\n    return this.root_.count();\n  }\n\n  /**\n   * @return {?K} The minimum key in the map.\n   */\n  minKey(): K | null {\n    return this.root_.minKey();\n  }\n\n  /**\n   * @return {?K} The maximum key in the map.\n   */\n  maxKey(): K | null {\n    return this.root_.maxKey();\n  }\n\n  /**\n   * Traverses the map in key order and calls the specified action function\n   * for each key/value pair.\n   *\n   * @param {function(!K, !V):*} action Callback function to be called\n   * for each key/value pair.  If action returns true, traversal is aborted.\n   * @return {*} The first truthy value returned by action, or the last falsey\n   *   value returned by action\n   */\n  inorderTraversal(action: (k: K, v: V) => unknown): boolean {\n    return this.root_.inorderTraversal(action);\n  }\n\n  /**\n   * Traverses the map in reverse key order and calls the specified action function\n   * for each key/value pair.\n   *\n   * @param {function(!Object, !Object)} action Callback function to be called\n   * for each key/value pair.  If action returns true, traversal is aborted.\n   * @return {*} True if the traversal was aborted.\n   */\n  reverseTraversal(action: (k: K, v: V) => void): boolean {\n    return this.root_.reverseTraversal(action);\n  }\n\n  /**\n   * Returns an iterator over the SortedMap.\n   * @template T\n   * @param {(function(K, V):T)=} resultGenerator\n   * @return {SortedMapIterator.<K, V, T>} The iterator.\n   */\n  getIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getReverseIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n\n  getReverseIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { LLRBNode, SortedMap } from '../util/SortedMap';\n\nimport { NamedNode } from './Node';\n\nconst LOG_2 = Math.log(2);\n\n/**\n * @constructor\n */\nclass Base12Num {\n  count: number;\n  private current_: number;\n  private bits_: number;\n\n  /**\n   * @param {number} length\n   */\n  constructor(length: number) {\n    const logBase2 = (num: number) =>\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      parseInt((Math.log(num) / LOG_2) as any, 10);\n    const bitMask = (bits: number) => parseInt(Array(bits + 1).join('1'), 2);\n    this.count = logBase2(length + 1);\n    this.current_ = this.count - 1;\n    const mask = bitMask(this.count);\n    this.bits_ = (length + 1) & mask;\n  }\n\n  /**\n   * @return {boolean}\n   */\n  nextBitIsOne(): boolean {\n    //noinspection JSBitwiseOperatorUsage\n    const result = !(this.bits_ & (0x1 << this.current_));\n    this.current_--;\n    return result;\n  }\n}\n\n/**\n * Takes a list of child nodes and constructs a SortedSet using the given comparison\n * function\n *\n * Uses the algorithm described in the paper linked here:\n * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458\n *\n * @template K, V\n * @param {Array.<!NamedNode>} childList Unsorted list of children\n * @param {function(!NamedNode, !NamedNode):number} cmp The comparison method to be used\n * @param {(function(NamedNode):K)=} keyFn An optional function to extract K from a node wrapper, if K's\n *                                                        type is not NamedNode\n * @param {(function(K, K):number)=} mapSortFn An optional override for comparator used by the generated sorted map\n * @return {SortedMap.<K, V>}\n */\nexport const buildChildSet = function<K, V>(\n  childList: NamedNode[],\n  cmp: (a: NamedNode, b: NamedNode) => number,\n  keyFn?: (a: NamedNode) => K,\n  mapSortFn?: (a: K, b: K) => number\n): SortedMap<K, V> {\n  childList.sort(cmp);\n\n  const buildBalancedTree = function(\n    low: number,\n    high: number\n  ): LLRBNode<K, V> | null {\n    const length = high - low;\n    let namedNode: NamedNode;\n    let key: K;\n    if (length === 0) {\n      return null;\n    } else if (length === 1) {\n      namedNode = childList[low];\n      key = keyFn ? keyFn(namedNode) : ((namedNode as unknown) as K);\n      return new LLRBNode(\n        key,\n        (namedNode.node as unknown) as V,\n        LLRBNode.BLACK,\n        null,\n        null\n      );\n    } else {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const middle = parseInt((length / 2) as any, 10) + low;\n      const left = buildBalancedTree(low, middle);\n      const right = buildBalancedTree(middle + 1, high);\n      namedNode = childList[middle];\n      key = keyFn ? keyFn(namedNode) : ((namedNode as unknown) as K);\n      return new LLRBNode(\n        key,\n        (namedNode.node as unknown) as V,\n        LLRBNode.BLACK,\n        left,\n        right\n      );\n    }\n  };\n\n  const buildFrom12Array = function(base12: Base12Num): LLRBNode<K, V> {\n    let node: LLRBNode<K, V> = null;\n    let root = null;\n    let index = childList.length;\n\n    const buildPennant = function(chunkSize: number, color: boolean) {\n      const low = index - chunkSize;\n      const high = index;\n      index -= chunkSize;\n      const childTree = buildBalancedTree(low + 1, high);\n      const namedNode = childList[low];\n      const key: K = keyFn ? keyFn(namedNode) : ((namedNode as unknown) as K);\n      attachPennant(\n        new LLRBNode(\n          key,\n          (namedNode.node as unknown) as V,\n          color,\n          null,\n          childTree\n        )\n      );\n    };\n\n    const attachPennant = function(pennant: LLRBNode<K, V>) {\n      if (node) {\n        node.left = pennant;\n        node = pennant;\n      } else {\n        root = pennant;\n        node = pennant;\n      }\n    };\n\n    for (let i = 0; i < base12.count; ++i) {\n      const isOne = base12.nextBitIsOne();\n      // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\n      const chunkSize = Math.pow(2, base12.count - (i + 1));\n      if (isOne) {\n        buildPennant(chunkSize, LLRBNode.BLACK);\n      } else {\n        // current == 2\n        buildPennant(chunkSize, LLRBNode.BLACK);\n        buildPennant(chunkSize, LLRBNode.RED);\n      }\n    }\n    return root;\n  };\n\n  const base12 = new Base12Num(childList.length);\n  const root = buildFrom12Array(base12);\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  return new SortedMap<K, V>(mapSortFn || (cmp as any), root);\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, contains, map, safeGet } from '@firebase/util';\nimport { buildChildSet } from './childSet';\n\nimport { NamedNode, Node } from './Node';\nimport { PRIORITY_INDEX } from './indexes/PriorityIndex';\nimport { KEY_INDEX } from './indexes/KeyIndex';\nimport { SortedMap } from '../util/SortedMap';\nimport { Index } from './indexes/Index';\n\nlet _defaultIndexMap: IndexMap;\n\nconst fallbackObject = {};\n\nexport class IndexMap {\n  /**\n   * The default IndexMap for nodes without a priority\n   */\n  static get Default(): IndexMap {\n    assert(\n      fallbackObject && PRIORITY_INDEX,\n      'ChildrenNode.ts has not been loaded'\n    );\n    _defaultIndexMap =\n      _defaultIndexMap ||\n      new IndexMap(\n        { '.priority': fallbackObject },\n        { '.priority': PRIORITY_INDEX }\n      );\n    return _defaultIndexMap;\n  }\n\n  constructor(\n    private indexes_: {\n      [k: string]: SortedMap<NamedNode, Node> | /*FallbackType*/ object;\n    },\n    private indexSet_: { [k: string]: Index }\n  ) {}\n\n  get(indexKey: string): SortedMap<NamedNode, Node> | null {\n    const sortedMap = safeGet(this.indexes_, indexKey);\n    if (!sortedMap) {\n      throw new Error('No index defined for ' + indexKey);\n    }\n\n    if (sortedMap instanceof SortedMap) {\n      return sortedMap;\n    } else {\n      // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\n      // regular child map\n      return null;\n    }\n  }\n\n  hasIndex(indexDefinition: Index): boolean {\n    return contains(this.indexSet_, indexDefinition.toString());\n  }\n\n  addIndex(\n    indexDefinition: Index,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    assert(\n      indexDefinition !== KEY_INDEX,\n      \"KeyIndex always exists and isn't meant to be added to the IndexMap.\"\n    );\n    const childList = [];\n    let sawIndexedValue = false;\n    const iter = existingChildren.getIterator(NamedNode.Wrap);\n    let next = iter.getNext();\n    while (next) {\n      sawIndexedValue =\n        sawIndexedValue || indexDefinition.isDefinedOn(next.node);\n      childList.push(next);\n      next = iter.getNext();\n    }\n    let newIndex;\n    if (sawIndexedValue) {\n      newIndex = buildChildSet(childList, indexDefinition.getCompare());\n    } else {\n      newIndex = fallbackObject;\n    }\n    const indexName = indexDefinition.toString();\n    const newIndexSet = { ...this.indexSet_ };\n    newIndexSet[indexName] = indexDefinition;\n    const newIndexes = { ...this.indexes_ };\n    newIndexes[indexName] = newIndex;\n    return new IndexMap(newIndexes, newIndexSet);\n  }\n\n  /**\n   * Ensure that this node is properly tracked in any indexes that we're maintaining\n   */\n  addToIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>, indexName: string) => {\n        const index = safeGet(this.indexSet_, indexName);\n        assert(index, 'Missing index implementation for ' + indexName);\n        if (indexedChildren === fallbackObject) {\n          // Check to see if we need to index everything\n          if (index.isDefinedOn(namedNode.node)) {\n            // We need to build this index\n            const childList = [];\n            const iter = existingChildren.getIterator(NamedNode.Wrap);\n            let next = iter.getNext();\n            while (next) {\n              if (next.name !== namedNode.name) {\n                childList.push(next);\n              }\n              next = iter.getNext();\n            }\n            childList.push(namedNode);\n            return buildChildSet(childList, index.getCompare());\n          } else {\n            // No change, this remains a fallback\n            return fallbackObject;\n          }\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          let newChildren = indexedChildren;\n          if (existingSnap) {\n            newChildren = newChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          }\n          return newChildren.insert(namedNode, namedNode.node);\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n\n  /**\n   * Create a new IndexMap instance with the given value removed\n   */\n  removeFromIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>) => {\n        if (indexedChildren === fallbackObject) {\n          // This is the fallback. Just return it, nothing to do in this case\n          return indexedChildren;\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          if (existingSnap) {\n            return indexedChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          } else {\n            // No record of this child\n            return indexedChildren;\n          }\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { sha1, MAX_NAME, MIN_NAME } from '../util/util';\nimport { SortedMap, SortedMapIterator } from '../util/SortedMap';\nimport { Node, NamedNode } from './Node';\nimport { validatePriorityNode, priorityHashText, setMaxNode } from './snap';\nimport {\n  PRIORITY_INDEX,\n  setMaxNode as setPriorityMaxNode\n} from './indexes/PriorityIndex';\nimport { KEY_INDEX, KeyIndex } from './indexes/KeyIndex';\nimport { IndexMap } from './IndexMap';\nimport { LeafNode } from './LeafNode';\nimport { NAME_COMPARATOR } from './comparators';\nimport { Index } from './indexes/Index';\nimport { Path } from '../util/Path';\n\nexport interface ChildrenNodeConstructor {\n  new (\n    children_: SortedMap<string, Node>,\n    priorityNode_: Node | null,\n    indexMap_: IndexMap\n  ): ChildrenNode;\n  EMPTY_NODE: ChildrenNode;\n}\n\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\n\nlet EMPTY_NODE: ChildrenNode;\n\n/**\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\n * (i.e. nodes with children).  It implements Node and stores the\n * list of children in the children property, sorted by child name.\n *\n * @constructor\n * @implements {Node}\n */\nexport class ChildrenNode implements Node {\n  private lazyHash_: string | null = null;\n\n  static get EMPTY_NODE(): ChildrenNode {\n    return (\n      EMPTY_NODE ||\n      (EMPTY_NODE = new ChildrenNode(\n        new SortedMap<string, Node>(NAME_COMPARATOR),\n        null,\n        IndexMap.Default\n      ))\n    );\n  }\n\n  /**\n   *\n   * @param {!SortedMap.<string, !Node>} children_ List of children\n   * of this node..\n   * @param {?Node} priorityNode_ The priority of this node (as a snapshot node).\n   * @param {!IndexMap} indexMap_\n   */\n  constructor(\n    private readonly children_: SortedMap<string, Node>,\n    private readonly priorityNode_: Node | null,\n    private indexMap_: IndexMap\n  ) {\n    /**\n     * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\n     * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\n     * class instead of an empty ChildrenNode.\n     */\n    if (this.priorityNode_) {\n      validatePriorityNode(this.priorityNode_);\n    }\n\n    if (this.children_.isEmpty()) {\n      assert(\n        !this.priorityNode_ || this.priorityNode_.isEmpty(),\n        'An empty node cannot have a priority'\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_ || EMPTY_NODE;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    if (this.children_.isEmpty()) {\n      // Don't allow priorities on empty nodes\n      return this;\n    } else {\n      return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\n    }\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.getPriority();\n    } else {\n      const child = this.children_.get(childName);\n      return child === null ? EMPTY_NODE : child;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    const front = path.getFront();\n    if (front === null) {\n      return this;\n    }\n\n    return this.getImmediateChild(front).getChild(path.popFront());\n  }\n\n  /** @inheritDoc */\n  hasChild(childName: string): boolean {\n    return this.children_.get(childName) !== null;\n  }\n\n  /** @inheritDoc */\n  updateImmediateChild(childName: string, newChildNode: Node): Node {\n    assert(newChildNode, 'We should always be passing snapshot nodes');\n    if (childName === '.priority') {\n      return this.updatePriority(newChildNode);\n    } else {\n      const namedNode = new NamedNode(childName, newChildNode);\n      let newChildren, newIndexMap;\n      if (newChildNode.isEmpty()) {\n        newChildren = this.children_.remove(childName);\n        newIndexMap = this.indexMap_.removeFromIndexes(\n          namedNode,\n          this.children_\n        );\n      } else {\n        newChildren = this.children_.insert(childName, newChildNode);\n        newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\n      }\n\n      const newPriority = newChildren.isEmpty()\n        ? EMPTY_NODE\n        : this.priorityNode_;\n      return new ChildrenNode(newChildren, newPriority, newIndexMap);\n    }\n  }\n\n  /** @inheritDoc */\n  updateChild(path: Path, newChildNode: Node): Node {\n    const front = path.getFront();\n    if (front === null) {\n      return newChildNode;\n    } else {\n      assert(\n        path.getFront() !== '.priority' || path.getLength() === 1,\n        '.priority must be the last token in a path'\n      );\n      const newImmediateChild = this.getImmediateChild(front).updateChild(\n        path.popFront(),\n        newChildNode\n      );\n      return this.updateImmediateChild(front, newImmediateChild);\n    }\n  }\n\n  /** @inheritDoc */\n  isEmpty(): boolean {\n    return this.children_.isEmpty();\n  }\n\n  /** @inheritDoc */\n  numChildren(): number {\n    return this.children_.count();\n  }\n\n  /**\n   * @private\n   * @type {RegExp}\n   */\n  private static INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\n\n  /** @inheritDoc */\n  val(exportFormat?: boolean): object {\n    if (this.isEmpty()) {\n      return null;\n    }\n\n    const obj: { [k: string]: unknown } = {};\n    let numKeys = 0,\n      maxKey = 0,\n      allIntegerKeys = true;\n    this.forEachChild(PRIORITY_INDEX, (key: string, childNode: Node) => {\n      obj[key] = childNode.val(exportFormat);\n\n      numKeys++;\n      if (allIntegerKeys && ChildrenNode.INTEGER_REGEXP_.test(key)) {\n        maxKey = Math.max(maxKey, Number(key));\n      } else {\n        allIntegerKeys = false;\n      }\n    });\n\n    if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\n      // convert to array.\n      const array: unknown[] = [];\n      // eslint-disable-next-line guard-for-in\n      for (const key in obj) {\n        array[(key as unknown) as number] = obj[key];\n      }\n\n      return array;\n    } else {\n      if (exportFormat && !this.getPriority().isEmpty()) {\n        obj['.priority'] = this.getPriority().val();\n      }\n      return obj;\n    }\n  }\n\n  /** @inheritDoc */\n  hash(): string {\n    if (this.lazyHash_ === null) {\n      let toHash = '';\n      if (!this.getPriority().isEmpty()) {\n        toHash +=\n          'priority:' +\n          priorityHashText(this.getPriority().val() as string | number) +\n          ':';\n      }\n\n      this.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n        const childHash = childNode.hash();\n        if (childHash !== '') {\n          toHash += ':' + key + ':' + childHash;\n        }\n      });\n\n      this.lazyHash_ = toHash === '' ? '' : sha1(toHash);\n    }\n    return this.lazyHash_;\n  }\n\n  /** @inheritDoc */\n  getPredecessorChildName(\n    childName: string,\n    childNode: Node,\n    index: Index\n  ): string {\n    const idx = this.resolveIndex_(index);\n    if (idx) {\n      const predecessor = idx.getPredecessorKey(\n        new NamedNode(childName, childNode)\n      );\n      return predecessor ? predecessor.name : null;\n    } else {\n      return this.children_.getPredecessorKey(childName);\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {?string}\n   */\n  getFirstChildName(indexDefinition: Index): string | null {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      const minKey = idx.minKey();\n      return minKey && minKey.name;\n    } else {\n      return this.children_.minKey();\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {?NamedNode}\n   */\n  getFirstChild(indexDefinition: Index): NamedNode | null {\n    const minKey = this.getFirstChildName(indexDefinition);\n    if (minKey) {\n      return new NamedNode(minKey, this.children_.get(minKey));\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Given an index, return the key name of the largest value we have, according to that index\n   * @param {!Index} indexDefinition\n   * @return {?string}\n   */\n  getLastChildName(indexDefinition: Index): string | null {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      const maxKey = idx.maxKey();\n      return maxKey && maxKey.name;\n    } else {\n      return this.children_.maxKey();\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {?NamedNode}\n   */\n  getLastChild(indexDefinition: Index): NamedNode | null {\n    const maxKey = this.getLastChildName(indexDefinition);\n    if (maxKey) {\n      return new NamedNode(maxKey, this.children_.get(maxKey));\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  forEachChild(\n    index: Index,\n    action: (key: string, node: Node) => boolean | void\n  ): boolean {\n    const idx = this.resolveIndex_(index);\n    if (idx) {\n      return idx.inorderTraversal(wrappedNode => {\n        return action(wrappedNode.name, wrappedNode.node);\n      });\n    } else {\n      return this.children_.inorderTraversal(action);\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {SortedMapIterator}\n   */\n  getIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n  }\n\n  /**\n   *\n   * @param {!NamedNode} startPost\n   * @param {!Index} indexDefinition\n   * @return {!SortedMapIterator}\n   */\n  getIteratorFrom(\n    startPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getIteratorFrom(startPost, key => key);\n    } else {\n      const iterator = this.children_.getIteratorFrom(\n        startPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, startPost) < 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {!SortedMapIterator}\n   */\n  getReverseIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getReverseIteratorFrom(\n      indexDefinition.maxPost(),\n      indexDefinition\n    );\n  }\n\n  /**\n   * @param {!NamedNode} endPost\n   * @param {!Index} indexDefinition\n   * @return {!SortedMapIterator}\n   */\n  getReverseIteratorFrom(\n    endPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getReverseIteratorFrom(endPost, key => {\n        return key;\n      });\n    } else {\n      const iterator = this.children_.getReverseIteratorFrom(\n        endPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, endPost) > 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  compareTo(other: ChildrenNode): number {\n    if (this.isEmpty()) {\n      if (other.isEmpty()) {\n        return 0;\n      } else {\n        return -1;\n      }\n    } else if (other.isLeafNode() || other.isEmpty()) {\n      return 1;\n    } else if (other === MAX_NODE) {\n      return -1;\n    } else {\n      // Must be another node with children.\n      return 0;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  withIndex(indexDefinition: Index): Node {\n    if (\n      indexDefinition === KEY_INDEX ||\n      this.indexMap_.hasIndex(indexDefinition)\n    ) {\n      return this;\n    } else {\n      const newIndexMap = this.indexMap_.addIndex(\n        indexDefinition,\n        this.children_\n      );\n      return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  isIndexed(index: Index): boolean {\n    return index === KEY_INDEX || this.indexMap_.hasIndex(index);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  equals(other: Node): boolean {\n    if (other === this) {\n      return true;\n    } else if (other.isLeafNode()) {\n      return false;\n    } else {\n      const otherChildrenNode = other as ChildrenNode;\n      if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\n        return false;\n      } else if (\n        this.children_.count() === otherChildrenNode.children_.count()\n      ) {\n        const thisIter = this.getIterator(PRIORITY_INDEX);\n        const otherIter = otherChildrenNode.getIterator(PRIORITY_INDEX);\n        let thisCurrent = thisIter.getNext();\n        let otherCurrent = otherIter.getNext();\n        while (thisCurrent && otherCurrent) {\n          if (\n            thisCurrent.name !== otherCurrent.name ||\n            !thisCurrent.node.equals(otherCurrent.node)\n          ) {\n            return false;\n          }\n          thisCurrent = thisIter.getNext();\n          otherCurrent = otherIter.getNext();\n        }\n        return thisCurrent === null && otherCurrent === null;\n      } else {\n        return false;\n      }\n    }\n  }\n\n  /**\n   * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\n   * instead.\n   *\n   * @private\n   * @param {!Index} indexDefinition\n   * @return {?SortedMap.<NamedNode, Node>}\n   */\n  private resolveIndex_(\n    indexDefinition: Index\n  ): SortedMap<NamedNode, Node> | null {\n    if (indexDefinition === KEY_INDEX) {\n      return null;\n    } else {\n      return this.indexMap_.get(indexDefinition.toString());\n    }\n  }\n}\n\n/**\n * @constructor\n * @extends {ChildrenNode}\n * @private\n */\nexport class MaxNode extends ChildrenNode {\n  constructor() {\n    super(\n      new SortedMap<string, Node>(NAME_COMPARATOR),\n      ChildrenNode.EMPTY_NODE,\n      IndexMap.Default\n    );\n  }\n\n  compareTo(other: Node): number {\n    if (other === this) {\n      return 0;\n    } else {\n      return 1;\n    }\n  }\n\n  equals(other: Node): boolean {\n    // Not that we every compare it, but MAX_NODE is only ever equal to itself\n    return other === this;\n  }\n\n  getPriority(): MaxNode {\n    return this;\n  }\n\n  getImmediateChild(childName: string): ChildrenNode {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  isEmpty(): boolean {\n    return false;\n  }\n}\n\n/**\n * Marker that will sort higher than any other snapshot.\n * @type {!MAX_NODE}\n * @const\n */\nexport const MAX_NODE = new MaxNode();\n\n/**\n * Document NamedNode extensions\n */\ndeclare module './Node' {\n  interface NamedNode {\n    MIN: NamedNode;\n    MAX: NamedNode;\n  }\n}\n\nObject.defineProperties(NamedNode, {\n  MIN: {\n    value: new NamedNode(MIN_NAME, ChildrenNode.EMPTY_NODE)\n  },\n  MAX: {\n    value: new NamedNode(MAX_NAME, MAX_NODE)\n  }\n});\n\n/**\n * Reference Extensions\n */\nKeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode.__childrenNodeConstructor = ChildrenNode;\nsetMaxNode(MAX_NODE);\nsetPriorityMaxNode(MAX_NODE);\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { nameCompare } from '../util/util';\nimport { NamedNode } from './Node';\n\nexport function NAME_ONLY_COMPARATOR(left: NamedNode, right: NamedNode) {\n  return nameCompare(left.name, right.name);\n}\n\nexport function NAME_COMPARATOR(left: string, right: string) {\n  return nameCompare(left, right);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ChildrenNode } from './ChildrenNode';\nimport { LeafNode } from './LeafNode';\nimport { NamedNode, Node } from './Node';\nimport { contains, assert } from '@firebase/util';\n\nimport { buildChildSet } from './childSet';\nimport { NAME_COMPARATOR, NAME_ONLY_COMPARATOR } from './comparators';\nimport { IndexMap } from './IndexMap';\nimport { PRIORITY_INDEX, setNodeFromJSON } from './indexes/PriorityIndex';\nimport { SortedMap } from '../util/SortedMap';\nimport { each } from '../util/util';\nimport { Indexable } from '../util/misc';\n\nconst USE_HINZE = true;\n\n/**\n * Constructs a snapshot node representing the passed JSON and returns it.\n * @param {*} json JSON to create a node for.\n * @param {?string|?number=} priority Optional priority to use.  This will be ignored if the\n * passed JSON contains a .priority property.\n * @return {!Node}\n */\nexport function nodeFromJSON(\n  json: unknown | null,\n  priority: unknown = null\n): Node {\n  if (json === null) {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  if (typeof json === 'object' && '.priority' in json) {\n    priority = json['.priority'];\n  }\n\n  assert(\n    priority === null ||\n      typeof priority === 'string' ||\n      typeof priority === 'number' ||\n      (typeof priority === 'object' && '.sv' in (priority as object)),\n    'Invalid priority type found: ' + typeof priority\n  );\n\n  if (typeof json === 'object' && '.value' in json && json['.value'] !== null) {\n    json = json['.value'];\n  }\n\n  // Valid leaf nodes include non-objects or server-value wrapper objects\n  if (typeof json !== 'object' || '.sv' in json) {\n    const jsonLeaf = json as string | number | boolean | Indexable;\n    return new LeafNode(jsonLeaf, nodeFromJSON(priority));\n  }\n\n  if (!(json instanceof Array) && USE_HINZE) {\n    const children: NamedNode[] = [];\n    let childrenHavePriority = false;\n    const hinzeJsonObj = json;\n    each(hinzeJsonObj, (key, child) => {\n      if (key.substring(0, 1) !== '.') {\n        // Ignore metadata nodes\n        const childNode = nodeFromJSON(child);\n        if (!childNode.isEmpty()) {\n          childrenHavePriority =\n            childrenHavePriority || !childNode.getPriority().isEmpty();\n          children.push(new NamedNode(key, childNode));\n        }\n      }\n    });\n\n    if (children.length === 0) {\n      return ChildrenNode.EMPTY_NODE;\n    }\n\n    const childSet = buildChildSet(\n      children,\n      NAME_ONLY_COMPARATOR,\n      namedNode => namedNode.name,\n      NAME_COMPARATOR\n    ) as SortedMap<string, Node>;\n    if (childrenHavePriority) {\n      const sortedChildSet = buildChildSet(\n        children,\n        PRIORITY_INDEX.getCompare()\n      );\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        new IndexMap(\n          { '.priority': sortedChildSet },\n          { '.priority': PRIORITY_INDEX }\n        )\n      );\n    } else {\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        IndexMap.Default\n      );\n    }\n  } else {\n    let node: Node = ChildrenNode.EMPTY_NODE;\n    each(json, (key: string, childData: unknown) => {\n      if (contains(json as object, key)) {\n        if (key.substring(0, 1) !== '.') {\n          // ignore metadata nodes.\n          const childNode = nodeFromJSON(childData);\n          if (childNode.isLeafNode() || !childNode.isEmpty()) {\n            node = node.updateImmediateChild(key, childNode);\n          }\n        }\n      }\n    });\n\n    return node.updatePriority(nodeFromJSON(priority));\n  }\n}\n\nsetNodeFromJSON(nodeFromJSON);\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Index } from './Index';\nimport { NamedNode, Node } from '../Node';\nimport { nameCompare } from '../../util/util';\nimport { nodeFromJSON } from '../nodeFromJSON';\n\n/**\n * @constructor\n * @extends {Index}\n * @private\n */\nexport class ValueIndex extends Index {\n  /**\n   * @inheritDoc\n   */\n  compare(a: NamedNode, b: NamedNode): number {\n    const indexCmp = a.node.compareTo(b.node);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  isDefinedOn(node: Node): boolean {\n    return true;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    return !oldNode.equals(newNode);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  minPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MIN;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  maxPost(): NamedNode {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    return (NamedNode as any).MAX;\n  }\n\n  /**\n   * @param {*} indexValue\n   * @param {string} name\n   * @return {!NamedNode}\n   */\n  makePost(indexValue: object, name: string): NamedNode {\n    const valueNode = nodeFromJSON(indexValue);\n    return new NamedNode(name, valueNode);\n  }\n\n  /**\n   * @return {!string} String representation for inclusion in a query spec\n   */\n  toString(): string {\n    return '.value';\n  }\n}\n\nexport const VALUE_INDEX = new ValueIndex();\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { nameCompare, MAX_NAME } from '../../util/util';\nimport { Index } from './Index';\nimport { ChildrenNode, MAX_NODE } from '../ChildrenNode';\nimport { NamedNode, Node } from '../Node';\nimport { nodeFromJSON } from '../nodeFromJSON';\nimport { Path } from '../../util/Path';\n\n/**\n * @param {!Path} indexPath\n * @constructor\n * @extends {Index}\n */\nexport class PathIndex extends Index {\n  constructor(private indexPath_: Path) {\n    super();\n\n    assert(\n      !indexPath_.isEmpty() && indexPath_.getFront() !== '.priority',\n      \"Can't create PathIndex with empty path or .priority key\"\n    );\n  }\n\n  /**\n   * @param {!Node} snap\n   * @return {!Node}\n   * @protected\n   */\n  protected extractChild(snap: Node): Node {\n    return snap.getChild(this.indexPath_);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  isDefinedOn(node: Node): boolean {\n    return !node.getChild(this.indexPath_).isEmpty();\n  }\n\n  /**\n   * @inheritDoc\n   */\n  compare(a: NamedNode, b: NamedNode): number {\n    const aChild = this.extractChild(a.node);\n    const bChild = this.extractChild(b.node);\n    const indexCmp = aChild.compareTo(bChild);\n    if (indexCmp === 0) {\n      return nameCompare(a.name, b.name);\n    } else {\n      return indexCmp;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  makePost(indexValue: object, name: string): NamedNode {\n    const valueNode = nodeFromJSON(indexValue);\n    const node = ChildrenNode.EMPTY_NODE.updateChild(\n      this.indexPath_,\n      valueNode\n    );\n    return new NamedNode(name, node);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  maxPost(): NamedNode {\n    const node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, MAX_NODE);\n    return new NamedNode(MAX_NAME, node);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  toString(): string {\n    return this.indexPath_.slice().join('/');\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { validateArgCount, validateCallback } from '@firebase/util';\nimport { validatePathString } from '../core/util/validation';\nimport { Path } from '../core/util/Path';\nimport { PRIORITY_INDEX } from '../core/snap/indexes/PriorityIndex';\nimport { Node } from '../core/snap/Node';\nimport { Reference } from './Reference';\nimport { Index } from '../core/snap/indexes/Index';\nimport { ChildrenNode } from '../core/snap/ChildrenNode';\n\n/**\n * Class representing a firebase data snapshot.  It wraps a SnapshotNode and\n * surfaces the public methods (val, forEach, etc.) we want to expose.\n */\nexport class DataSnapshot {\n  /**\n   * @param {!Node} node_ A SnapshotNode to wrap.\n   * @param {!Reference} ref_ The ref of the location this snapshot came from.\n   * @param {!Index} index_ The iteration order for this snapshot\n   */\n  constructor(\n    private readonly node_: Node,\n    private readonly ref_: Reference,\n    private readonly index_: Index\n  ) {}\n\n  /**\n   * Retrieves the snapshot contents as JSON.  Returns null if the snapshot is\n   * empty.\n   *\n   * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\n   */\n  val(): unknown {\n    validateArgCount('DataSnapshot.val', 0, 0, arguments.length);\n    return this.node_.val();\n  }\n\n  /**\n   * Returns the snapshot contents as JSON, including priorities of node.  Suitable for exporting\n   * the entire node contents.\n   * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\n   */\n  exportVal(): unknown {\n    validateArgCount('DataSnapshot.exportVal', 0, 0, arguments.length);\n    return this.node_.val(true);\n  }\n\n  // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n  // for end-users\n  toJSON(): unknown {\n    // Optional spacer argument is unnecessary because we're depending on recursion rather than stringifying the content\n    validateArgCount('DataSnapshot.toJSON', 0, 1, arguments.length);\n    return this.exportVal();\n  }\n\n  /**\n   * Returns whether the snapshot contains a non-null value.\n   *\n   * @return {boolean} Whether the snapshot contains a non-null value, or is empty.\n   */\n  exists(): boolean {\n    validateArgCount('DataSnapshot.exists', 0, 0, arguments.length);\n    return !this.node_.isEmpty();\n  }\n\n  /**\n   * Returns a DataSnapshot of the specified child node's contents.\n   *\n   * @param {!string} childPathString Path to a child.\n   * @return {!DataSnapshot} DataSnapshot for child node.\n   */\n  child(childPathString: string): DataSnapshot {\n    validateArgCount('DataSnapshot.child', 0, 1, arguments.length);\n    // Ensure the childPath is a string (can be a number)\n    childPathString = String(childPathString);\n    validatePathString('DataSnapshot.child', 1, childPathString, false);\n\n    const childPath = new Path(childPathString);\n    const childRef = this.ref_.child(childPath);\n    return new DataSnapshot(\n      this.node_.getChild(childPath),\n      childRef,\n      PRIORITY_INDEX\n    );\n  }\n\n  /**\n   * Returns whether the snapshot contains a child at the specified path.\n   *\n   * @param {!string} childPathString Path to a child.\n   * @return {boolean} Whether the child exists.\n   */\n  hasChild(childPathString: string): boolean {\n    validateArgCount('DataSnapshot.hasChild', 1, 1, arguments.length);\n    validatePathString('DataSnapshot.hasChild', 1, childPathString, false);\n\n    const childPath = new Path(childPathString);\n    return !this.node_.getChild(childPath).isEmpty();\n  }\n\n  /**\n   * Returns the priority of the object, or null if no priority was set.\n   *\n   * @return {string|number|null} The priority.\n   */\n  getPriority(): string | number | null {\n    validateArgCount('DataSnapshot.getPriority', 0, 0, arguments.length);\n\n    // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\n    return this.node_.getPriority().val() as string | number | null;\n  }\n\n  /**\n   * Iterates through child nodes and calls the specified action for each one.\n   *\n   * @param {function(!DataSnapshot)} action Callback function to be called\n   * for each child.\n   * @return {boolean} True if forEach was canceled by action returning true for\n   * one of the child nodes.\n   */\n  forEach(action: (d: DataSnapshot) => boolean | void): boolean {\n    validateArgCount('DataSnapshot.forEach', 1, 1, arguments.length);\n    validateCallback('DataSnapshot.forEach', 1, action, false);\n\n    if (this.node_.isLeafNode()) {\n      return false;\n    }\n\n    const childrenNode = this.node_ as ChildrenNode;\n    // Sanitize the return value to a boolean. ChildrenNode.forEachChild has a weird return type...\n    return !!childrenNode.forEachChild(this.index_, (key, node) => {\n      return action(\n        new DataSnapshot(node, this.ref_.child(key), PRIORITY_INDEX)\n      );\n    });\n  }\n\n  /**\n   * Returns whether this DataSnapshot has children.\n   * @return {boolean} True if the DataSnapshot contains 1 or more child nodes.\n   */\n  hasChildren(): boolean {\n    validateArgCount('DataSnapshot.hasChildren', 0, 0, arguments.length);\n\n    if (this.node_.isLeafNode()) {\n      return false;\n    } else {\n      return !this.node_.isEmpty();\n    }\n  }\n\n  get key() {\n    return this.ref_.getKey();\n  }\n\n  /**\n   * Returns the number of children for this DataSnapshot.\n   * @return {number} The number of children that this DataSnapshot contains.\n   */\n  numChildren(): number {\n    validateArgCount('DataSnapshot.numChildren', 0, 0, arguments.length);\n\n    return this.node_.numChildren();\n  }\n\n  /**\n   * @return {Reference} The Firebase reference for the location this snapshot's data came from.\n   */\n  getRef(): Reference {\n    validateArgCount('DataSnapshot.ref', 0, 0, arguments.length);\n\n    return this.ref_;\n  }\n\n  get ref() {\n    return this.getRef();\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { stringify } from '@firebase/util';\nimport { Path } from '../util/Path';\nimport { EventRegistration } from './EventRegistration';\nimport { DataSnapshot } from '../../api/DataSnapshot';\n\n/**\n * Encapsulates the data needed to raise an event\n * @interface\n */\nexport interface Event {\n  /**\n   * @return {!Path}\n   */\n  getPath(): Path;\n\n  /**\n   * @return {!string}\n   */\n  getEventType(): string;\n\n  /**\n   * @return {!function()}\n   */\n  getEventRunner(): () => void;\n\n  /**\n   * @return {!string}\n   */\n  toString(): string;\n}\n\nexport type EventType =\n  | 'value'\n  | ' child_added'\n  | ' child_changed'\n  | ' child_moved'\n  | ' child_removed';\n\n/**\n * Encapsulates the data needed to raise an event\n * @implements {Event}\n */\nexport class DataEvent implements Event {\n  /**\n   * @param {!string} eventType One of: value, child_added, child_changed, child_moved, child_removed\n   * @param {!EventRegistration} eventRegistration The function to call to with the event data. User provided\n   * @param {!DataSnapshot} snapshot The data backing the event\n   * @param {?string=} prevName Optional, the name of the previous child for child_* events.\n   */\n  constructor(\n    public eventType: EventType,\n    public eventRegistration: EventRegistration,\n    public snapshot: DataSnapshot,\n    public prevName?: string | null\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  getPath(): Path {\n    const ref = this.snapshot.getRef();\n    if (this.eventType === 'value') {\n      return ref.path;\n    } else {\n      return ref.getParent().path;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getEventType(): string {\n    return this.eventType;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getEventRunner(): () => void {\n    return this.eventRegistration.getEventRunner(this);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  toString(): string {\n    return (\n      this.getPath().toString() +\n      ':' +\n      this.eventType +\n      ':' +\n      stringify(this.snapshot.exportVal())\n    );\n  }\n}\n\nexport class CancelEvent implements Event {\n  /**\n   * @param {EventRegistration} eventRegistration\n   * @param {Error} error\n   * @param {!Path} path\n   */\n  constructor(\n    public eventRegistration: EventRegistration,\n    public error: Error,\n    public path: Path\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  getPath(): Path {\n    return this.path;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getEventType(): string {\n    return 'cancel';\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getEventRunner(): () => void {\n    return this.eventRegistration.getEventRunner(this);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  toString(): string {\n    return this.path.toString() + ':cancel';\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { DataSnapshot } from '../../api/DataSnapshot';\nimport { DataEvent, CancelEvent, Event, EventType } from './Event';\nimport { contains, assert } from '@firebase/util';\n\nimport { Path } from '../util/Path';\nimport { Change } from './Change';\nimport { Query } from '../../api/Query';\n\n/**\n * An EventRegistration is basically an event type ('value', 'child_added', etc.) and a callback\n * to be notified of that type of event.\n *\n * That said, it can also contain a cancel callback to be notified if the event is canceled.  And\n * currently, this code is organized around the idea that you would register multiple child_ callbacks\n * together, as a single EventRegistration.  Though currently we don't do that.\n */\nexport interface EventRegistration {\n  /**\n   * True if this container has a callback to trigger for this event type\n   * @param {!string} eventType\n   * @return {boolean}\n   */\n  respondsTo(eventType: string): boolean;\n\n  /**\n   * @param {!Change} change\n   * @param {!Query} query\n   * @return {!Event}\n   */\n  createEvent(change: Change, query: Query): Event;\n\n  /**\n   * Given event data, return a function to trigger the user's callback\n   * @param {!Event} eventData\n   * @return {function()}\n   */\n  getEventRunner(eventData: Event): () => void;\n\n  /**\n   * @param {!Error} error\n   * @param {!Path} path\n   * @return {?CancelEvent}\n   */\n  createCancelEvent(error: Error, path: Path): CancelEvent | null;\n\n  /**\n   * @param {!EventRegistration} other\n   * @return {boolean}\n   */\n  matches(other: EventRegistration): boolean;\n\n  /**\n   * False basically means this is a \"dummy\" callback container being used as a sentinel\n   * to remove all callback containers of a particular type.  (e.g. if the user does\n   * ref.off('value') without specifying a specific callback).\n   *\n   * (TODO: Rework this, since it's hacky)\n   *\n   * @return {boolean}\n   */\n  hasAnyCallback(): boolean;\n}\n\n/**\n * Represents registration for 'value' events.\n */\nexport class ValueEventRegistration implements EventRegistration {\n  /**\n   * @param {?function(!DataSnapshot)} callback_\n   * @param {?function(Error)} cancelCallback_\n   * @param {?Object} context_\n   */\n  constructor(\n    private callback_: ((d: DataSnapshot) => void) | null,\n    private cancelCallback_: ((e: Error) => void) | null,\n    private context_: {} | null\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  respondsTo(eventType: string): boolean {\n    return eventType === 'value';\n  }\n\n  /**\n   * @inheritDoc\n   */\n  createEvent(change: Change, query: Query): DataEvent {\n    const index = query.getQueryParams().getIndex();\n    return new DataEvent(\n      'value',\n      this,\n      new DataSnapshot(change.snapshotNode, query.getRef(), index)\n    );\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getEventRunner(eventData: CancelEvent | DataEvent): () => void {\n    const ctx = this.context_;\n    if (eventData.getEventType() === 'cancel') {\n      assert(\n        this.cancelCallback_,\n        'Raising a cancel event on a listener with no cancel callback'\n      );\n      const cancelCB = this.cancelCallback_;\n      return function() {\n        // We know that error exists, we checked above that this is a cancel event\n        cancelCB.call(ctx, (eventData as CancelEvent).error);\n      };\n    } else {\n      const cb = this.callback_;\n      return function() {\n        cb.call(ctx, (eventData as DataEvent).snapshot);\n      };\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  createCancelEvent(error: Error, path: Path): CancelEvent | null {\n    if (this.cancelCallback_) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  matches(other: EventRegistration): boolean {\n    if (!(other instanceof ValueEventRegistration)) {\n      return false;\n    } else if (!other.callback_ || !this.callback_) {\n      // If no callback specified, we consider it to match any callback.\n      return true;\n    } else {\n      return (\n        other.callback_ === this.callback_ && other.context_ === this.context_\n      );\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  hasAnyCallback(): boolean {\n    return this.callback_ !== null;\n  }\n}\n\n/**\n * Represents the registration of 1 or more child_xxx events.\n *\n * Currently, it is always exactly 1 child_xxx event, but the idea is we might let you\n * register a group of callbacks together in the future.\n *\n * @constructor\n * @implements {EventRegistration}\n */\nexport class ChildEventRegistration implements EventRegistration {\n  /**\n   * @param {?Object.<string, function(!DataSnapshot, ?string=)>} callbacks_\n   * @param {?function(Error)} cancelCallback_\n   * @param {Object=} context_\n   */\n  constructor(\n    private callbacks_: {\n      [k: string]: (d: DataSnapshot, s?: string | null) => void;\n    } | null,\n    private cancelCallback_: ((e: Error) => void) | null,\n    private context_?: {}\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  respondsTo(eventType: string): boolean {\n    let eventToCheck =\n      eventType === 'children_added' ? 'child_added' : eventType;\n    eventToCheck =\n      eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\n    return contains(this.callbacks_, eventToCheck);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  createCancelEvent(error: Error, path: Path): CancelEvent | null {\n    if (this.cancelCallback_) {\n      return new CancelEvent(this, error, path);\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  createEvent(change: Change, query: Query): DataEvent {\n    assert(change.childName != null, 'Child events should have a childName.');\n    const ref = query.getRef().child(/** @type {!string} */ change.childName);\n    const index = query.getQueryParams().getIndex();\n    return new DataEvent(\n      change.type as EventType,\n      this,\n      new DataSnapshot(change.snapshotNode, ref, index),\n      change.prevName\n    );\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getEventRunner(eventData: CancelEvent | DataEvent): () => void {\n    const ctx = this.context_;\n    if (eventData.getEventType() === 'cancel') {\n      assert(\n        this.cancelCallback_,\n        'Raising a cancel event on a listener with no cancel callback'\n      );\n      const cancelCB = this.cancelCallback_;\n      return function() {\n        // We know that error exists, we checked above that this is a cancel event\n        cancelCB.call(ctx, (eventData as CancelEvent).error);\n      };\n    } else {\n      const cb = this.callbacks_[(eventData as DataEvent).eventType];\n      return function() {\n        cb.call(\n          ctx,\n          (eventData as DataEvent).snapshot,\n          (eventData as DataEvent).prevName\n        );\n      };\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  matches(other: EventRegistration): boolean {\n    if (other instanceof ChildEventRegistration) {\n      if (!this.callbacks_ || !other.callbacks_) {\n        return true;\n      } else if (this.context_ === other.context_) {\n        const otherKeys = Object.keys(other.callbacks_);\n        const thisKeys = Object.keys(this.callbacks_);\n        const otherCount = otherKeys.length;\n        const thisCount = thisKeys.length;\n        if (otherCount === thisCount) {\n          // If count is 1, do an exact match on eventType, if either is defined but null, it's a match.\n          // If event types don't match, not a match\n          // If count is not 1, exact match across all\n\n          if (otherCount === 1) {\n            const otherKey = otherKeys[0];\n            const thisKey = thisKeys[0];\n            return (\n              thisKey === otherKey &&\n              (!other.callbacks_[otherKey] ||\n                !this.callbacks_[thisKey] ||\n                other.callbacks_[otherKey] === this.callbacks_[thisKey])\n            );\n          } else {\n            // Exact match on each key.\n            return thisKeys.every(\n              eventType =>\n                other.callbacks_[eventType] === this.callbacks_[eventType]\n            );\n          }\n        }\n      }\n    }\n\n    return false;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  hasAnyCallback(): boolean {\n    return this.callbacks_ !== 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\nimport {\n  assert,\n  errorPrefix,\n  validateArgCount,\n  validateCallback,\n  validateContextObject,\n  Deferred\n} from '@firebase/util';\nimport { KEY_INDEX } from '../core/snap/indexes/KeyIndex';\nimport { PRIORITY_INDEX } from '../core/snap/indexes/PriorityIndex';\nimport { VALUE_INDEX } from '../core/snap/indexes/ValueIndex';\nimport { PathIndex } from '../core/snap/indexes/PathIndex';\nimport { MIN_NAME, MAX_NAME, ObjectToUniqueKey } from '../core/util/util';\nimport { Path } from '../core/util/Path';\nimport {\n  isValidPriority,\n  validateEventType,\n  validatePathString,\n  validateFirebaseDataArg,\n  validateKey\n} from '../core/util/validation';\n\nimport {\n  ValueEventRegistration,\n  ChildEventRegistration,\n  EventRegistration\n} from '../core/view/EventRegistration';\n\nimport { Repo } from '../core/Repo';\nimport { QueryParams } from '../core/view/QueryParams';\nimport { Reference } from './Reference';\nimport { DataSnapshot } from './DataSnapshot';\n\nlet __referenceConstructor: new (repo: Repo, path: Path) => Query;\n\nexport interface SnapshotCallback {\n  (a: DataSnapshot, b?: string | null): unknown;\n}\n\n/**\n * A Query represents a filter to be applied to a firebase location.  This object purely represents the\n * query expression (and exposes our public API to build the query).  The actual query logic is in ViewBase.js.\n *\n * Since every Firebase reference is a query, Firebase inherits from this object.\n */\nexport class Query {\n  static set __referenceConstructor(val) {\n    __referenceConstructor = val;\n  }\n\n  static get __referenceConstructor() {\n    assert(__referenceConstructor, 'Reference.ts has not been loaded');\n    return __referenceConstructor;\n  }\n\n  constructor(\n    public repo: Repo,\n    public path: Path,\n    private queryParams_: QueryParams,\n    private orderByCalled_: boolean\n  ) {}\n\n  /**\n   * Validates start/end values for queries.\n   * @param {!QueryParams} params\n   * @private\n   */\n  private static validateQueryEndpoints_(params: QueryParams) {\n    let startNode = null;\n    let endNode = null;\n    if (params.hasStart()) {\n      startNode = params.getIndexStartValue();\n    }\n    if (params.hasEnd()) {\n      endNode = params.getIndexEndValue();\n    }\n\n    if (params.getIndex() === KEY_INDEX) {\n      const tooManyArgsError =\n        'Query: When ordering by key, you may only pass one argument to ' +\n        'startAt(), endAt(), or equalTo().';\n      const wrongArgTypeError =\n        'Query: When ordering by key, the argument passed to startAt(), endAt(),' +\n        'or equalTo() must be a string.';\n      if (params.hasStart()) {\n        const startName = params.getIndexStartName();\n        if (startName !== MIN_NAME) {\n          throw new Error(tooManyArgsError);\n        } else if (typeof startNode !== 'string') {\n          throw new Error(wrongArgTypeError);\n        }\n      }\n      if (params.hasEnd()) {\n        const endName = params.getIndexEndName();\n        if (endName !== MAX_NAME) {\n          throw new Error(tooManyArgsError);\n        } else if (typeof endNode !== 'string') {\n          throw new Error(wrongArgTypeError);\n        }\n      }\n    } else if (params.getIndex() === PRIORITY_INDEX) {\n      if (\n        (startNode != null && !isValidPriority(startNode)) ||\n        (endNode != null && !isValidPriority(endNode))\n      ) {\n        throw new Error(\n          'Query: When ordering by priority, the first argument passed to startAt(), ' +\n            'endAt(), or equalTo() must be a valid priority value (null, a number, or a string).'\n        );\n      }\n    } else {\n      assert(\n        params.getIndex() instanceof PathIndex ||\n          params.getIndex() === VALUE_INDEX,\n        'unknown index type.'\n      );\n      if (\n        (startNode != null && typeof startNode === 'object') ||\n        (endNode != null && typeof endNode === 'object')\n      ) {\n        throw new Error(\n          'Query: First argument passed to startAt(), endAt(), or equalTo() cannot be ' +\n            'an object.'\n        );\n      }\n    }\n  }\n\n  /**\n   * Validates that limit* has been called with the correct combination of parameters\n   * @param {!QueryParams} params\n   * @private\n   */\n  private static validateLimit_(params: QueryParams) {\n    if (\n      params.hasStart() &&\n      params.hasEnd() &&\n      params.hasLimit() &&\n      !params.hasAnchoredLimit()\n    ) {\n      throw new Error(\n        \"Query: Can't combine startAt(), endAt(), and limit(). Use limitToFirst() or limitToLast() instead.\"\n      );\n    }\n  }\n\n  /**\n   * Validates that no other order by call has been made\n   * @param {!string} fnName\n   * @private\n   */\n  private validateNoPreviousOrderByCall_(fnName: string) {\n    if (this.orderByCalled_ === true) {\n      throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\n    }\n  }\n\n  /**\n   * @return {!QueryParams}\n   */\n  getQueryParams(): QueryParams {\n    return this.queryParams_;\n  }\n\n  /**\n   * @return {!Reference}\n   */\n  getRef(): Reference {\n    validateArgCount('Query.ref', 0, 0, arguments.length);\n    // This is a slight hack. We cannot goog.require('fb.api.Firebase'), since Firebase requires fb.api.Query.\n    // However, we will always export 'Firebase' to the global namespace, so it's guaranteed to exist by the time this\n    // method gets called.\n    return new Query.__referenceConstructor(this.repo, this.path) as Reference;\n  }\n\n  /**\n   * @param {!string} eventType\n   * @param {!function(DataSnapshot, string=)} callback\n   * @param {(function(Error)|Object)=} cancelCallbackOrContext\n   * @param {Object=} context\n   * @return {!function(DataSnapshot, string=)}\n   */\n  on(\n    eventType: string,\n    callback: SnapshotCallback,\n    cancelCallbackOrContext?: ((a: Error) => unknown) | object | null,\n    context?: object | null\n  ): SnapshotCallback {\n    validateArgCount('Query.on', 2, 4, arguments.length);\n    validateEventType('Query.on', 1, eventType, false);\n    validateCallback('Query.on', 2, callback, false);\n\n    const ret = Query.getCancelAndContextArgs_(\n      'Query.on',\n      cancelCallbackOrContext,\n      context\n    );\n\n    if (eventType === 'value') {\n      this.onValueEvent(callback, ret.cancel, ret.context);\n    } else {\n      const callbacks: { [k: string]: typeof callback } = {};\n      callbacks[eventType] = callback;\n      this.onChildEvent(callbacks, ret.cancel, ret.context);\n    }\n    return callback;\n  }\n\n  /**\n   * @param {!function(!DataSnapshot)} callback\n   * @param {?function(Error)} cancelCallback\n   * @param {?Object} context\n   * @protected\n   */\n  protected onValueEvent(\n    callback: (a: DataSnapshot) => void,\n    cancelCallback: ((a: Error) => void) | null,\n    context: object | null\n  ) {\n    const container = new ValueEventRegistration(\n      callback,\n      cancelCallback || null,\n      context || null\n    );\n    this.repo.addEventCallbackForQuery(this, container);\n  }\n\n  /**\n   * @param {!Object.<string, !function(!DataSnapshot, ?string)>} callbacks\n   * @param {?function(Error)} cancelCallback\n   * @param {?Object} context\n   * @protected\n   */\n  onChildEvent(\n    callbacks: { [k: string]: SnapshotCallback },\n    cancelCallback: ((a: Error) => unknown) | null,\n    context: object | null\n  ) {\n    const container = new ChildEventRegistration(\n      callbacks,\n      cancelCallback,\n      context\n    );\n    this.repo.addEventCallbackForQuery(this, container);\n  }\n\n  /**\n   * @param {string=} eventType\n   * @param {(function(!DataSnapshot, ?string=))=} callback\n   * @param {Object=} context\n   */\n  off(\n    eventType?: string,\n    callback?: SnapshotCallback,\n    context?: object | null\n  ): void {\n    validateArgCount('Query.off', 0, 3, arguments.length);\n    validateEventType('Query.off', 1, eventType, true);\n    validateCallback('Query.off', 2, callback, true);\n    validateContextObject('Query.off', 3, context, true);\n\n    let container: EventRegistration | null = null;\n    let callbacks: { [k: string]: typeof callback } | null = null;\n    if (eventType === 'value') {\n      const valueCallback = callback || null;\n      container = new ValueEventRegistration(\n        valueCallback,\n        null,\n        context || null\n      );\n    } else if (eventType) {\n      if (callback) {\n        callbacks = {};\n        callbacks[eventType] = callback;\n      }\n      container = new ChildEventRegistration(callbacks, null, context || null);\n    }\n    this.repo.removeEventCallbackForQuery(this, container);\n  }\n\n  /**\n   * Attaches a listener, waits for the first event, and then removes the listener\n   * @param {!string} eventType\n   * @param {!function(!DataSnapshot, string=)} userCallback\n   * @param failureCallbackOrContext\n   * @param context\n   * @return {!firebase.Promise}\n   */\n  once(\n    eventType: string,\n    userCallback?: SnapshotCallback,\n    failureCallbackOrContext?: ((a: Error) => void) | object | null,\n    context?: object | null\n  ): Promise<DataSnapshot> {\n    validateArgCount('Query.once', 1, 4, arguments.length);\n    validateEventType('Query.once', 1, eventType, false);\n    validateCallback('Query.once', 2, userCallback, true);\n\n    const ret = Query.getCancelAndContextArgs_(\n      'Query.once',\n      failureCallbackOrContext,\n      context\n    );\n\n    // TODO: Implement this more efficiently (in particular, use 'get' wire protocol for 'value' event)\n    // TODO: consider actually wiring the callbacks into the promise. We cannot do this without a breaking change\n    // because the API currently expects callbacks will be called synchronously if the data is cached, but this is\n    // against the Promise specification.\n    let firstCall = true;\n    const deferred = new Deferred<DataSnapshot>();\n\n    // A dummy error handler in case a user wasn't expecting promises\n    deferred.promise.catch(() => {});\n\n    const onceCallback = (snapshot: DataSnapshot) => {\n      // NOTE: Even though we unsubscribe, we may get called multiple times if a single action (e.g. set() with JSON)\n      // triggers multiple events (e.g. child_added or child_changed).\n      if (firstCall) {\n        firstCall = false;\n        this.off(eventType, onceCallback);\n\n        if (userCallback) {\n          userCallback.bind(ret.context)(snapshot);\n        }\n        deferred.resolve(snapshot);\n      }\n    };\n\n    this.on(\n      eventType,\n      onceCallback,\n      /*cancel=*/ err => {\n        this.off(eventType, onceCallback);\n\n        if (ret.cancel) {\n          ret.cancel.bind(ret.context)(err);\n        }\n        deferred.reject(err);\n      }\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * Set a limit and anchor it to the start of the window.\n   * @param {!number} limit\n   * @return {!Query}\n   */\n  limitToFirst(limit: number): Query {\n    validateArgCount('Query.limitToFirst', 1, 1, arguments.length);\n    if (\n      typeof limit !== 'number' ||\n      Math.floor(limit) !== limit ||\n      limit <= 0\n    ) {\n      throw new Error(\n        'Query.limitToFirst: First argument must be a positive integer.'\n      );\n    }\n    if (this.queryParams_.hasLimit()) {\n      throw new Error(\n        'Query.limitToFirst: Limit was already set (by another call to limit, ' +\n          'limitToFirst, or limitToLast).'\n      );\n    }\n\n    return new Query(\n      this.repo,\n      this.path,\n      this.queryParams_.limitToFirst(limit),\n      this.orderByCalled_\n    );\n  }\n\n  /**\n   * Set a limit and anchor it to the end of the window.\n   * @param {!number} limit\n   * @return {!Query}\n   */\n  limitToLast(limit: number): Query {\n    validateArgCount('Query.limitToLast', 1, 1, arguments.length);\n    if (\n      typeof limit !== 'number' ||\n      Math.floor(limit) !== limit ||\n      limit <= 0\n    ) {\n      throw new Error(\n        'Query.limitToLast: First argument must be a positive integer.'\n      );\n    }\n    if (this.queryParams_.hasLimit()) {\n      throw new Error(\n        'Query.limitToLast: Limit was already set (by another call to limit, ' +\n          'limitToFirst, or limitToLast).'\n      );\n    }\n\n    return new Query(\n      this.repo,\n      this.path,\n      this.queryParams_.limitToLast(limit),\n      this.orderByCalled_\n    );\n  }\n\n  /**\n   * Given a child path, return a new query ordered by the specified grandchild path.\n   * @param {!string} path\n   * @return {!Query}\n   */\n  orderByChild(path: string): Query {\n    validateArgCount('Query.orderByChild', 1, 1, arguments.length);\n    if (path === '$key') {\n      throw new Error(\n        'Query.orderByChild: \"$key\" is invalid.  Use Query.orderByKey() instead.'\n      );\n    } else if (path === '$priority') {\n      throw new Error(\n        'Query.orderByChild: \"$priority\" is invalid.  Use Query.orderByPriority() instead.'\n      );\n    } else if (path === '$value') {\n      throw new Error(\n        'Query.orderByChild: \"$value\" is invalid.  Use Query.orderByValue() instead.'\n      );\n    }\n    validatePathString('Query.orderByChild', 1, path, false);\n    this.validateNoPreviousOrderByCall_('Query.orderByChild');\n    const parsedPath = new Path(path);\n    if (parsedPath.isEmpty()) {\n      throw new Error(\n        'Query.orderByChild: cannot pass in empty path.  Use Query.orderByValue() instead.'\n      );\n    }\n    const index = new PathIndex(parsedPath);\n    const newParams = this.queryParams_.orderBy(index);\n    Query.validateQueryEndpoints_(newParams);\n\n    return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n  }\n\n  /**\n   * Return a new query ordered by the KeyIndex\n   * @return {!Query}\n   */\n  orderByKey(): Query {\n    validateArgCount('Query.orderByKey', 0, 0, arguments.length);\n    this.validateNoPreviousOrderByCall_('Query.orderByKey');\n    const newParams = this.queryParams_.orderBy(KEY_INDEX);\n    Query.validateQueryEndpoints_(newParams);\n    return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n  }\n\n  /**\n   * Return a new query ordered by the PriorityIndex\n   * @return {!Query}\n   */\n  orderByPriority(): Query {\n    validateArgCount('Query.orderByPriority', 0, 0, arguments.length);\n    this.validateNoPreviousOrderByCall_('Query.orderByPriority');\n    const newParams = this.queryParams_.orderBy(PRIORITY_INDEX);\n    Query.validateQueryEndpoints_(newParams);\n    return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n  }\n\n  /**\n   * Return a new query ordered by the ValueIndex\n   * @return {!Query}\n   */\n  orderByValue(): Query {\n    validateArgCount('Query.orderByValue', 0, 0, arguments.length);\n    this.validateNoPreviousOrderByCall_('Query.orderByValue');\n    const newParams = this.queryParams_.orderBy(VALUE_INDEX);\n    Query.validateQueryEndpoints_(newParams);\n    return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\n  }\n\n  /**\n   * @param {number|string|boolean|null} value\n   * @param {?string=} name\n   * @return {!Query}\n   */\n  startAt(\n    value: number | string | boolean | null = null,\n    name?: string | null\n  ): Query {\n    validateArgCount('Query.startAt', 0, 2, arguments.length);\n    validateFirebaseDataArg('Query.startAt', 1, value, this.path, true);\n    validateKey('Query.startAt', 2, name, true);\n\n    const newParams = this.queryParams_.startAt(value, name);\n    Query.validateLimit_(newParams);\n    Query.validateQueryEndpoints_(newParams);\n    if (this.queryParams_.hasStart()) {\n      throw new Error(\n        'Query.startAt: Starting point was already set (by another call to startAt ' +\n          'or equalTo).'\n      );\n    }\n\n    // Calling with no params tells us to start at the beginning.\n    if (value === undefined) {\n      value = null;\n      name = null;\n    }\n    return new Query(this.repo, this.path, newParams, this.orderByCalled_);\n  }\n\n  /**\n   * @param {number|string|boolean|null} value\n   * @param {?string=} name\n   * @return {!Query}\n   */\n  endAt(\n    value: number | string | boolean | null = null,\n    name?: string | null\n  ): Query {\n    validateArgCount('Query.endAt', 0, 2, arguments.length);\n    validateFirebaseDataArg('Query.endAt', 1, value, this.path, true);\n    validateKey('Query.endAt', 2, name, true);\n\n    const newParams = this.queryParams_.endAt(value, name);\n    Query.validateLimit_(newParams);\n    Query.validateQueryEndpoints_(newParams);\n    if (this.queryParams_.hasEnd()) {\n      throw new Error(\n        'Query.endAt: Ending point was already set (by another call to endAt or ' +\n          'equalTo).'\n      );\n    }\n\n    return new Query(this.repo, this.path, newParams, this.orderByCalled_);\n  }\n\n  /**\n   * Load the selection of children with exactly the specified value, and, optionally,\n   * the specified name.\n   * @param {number|string|boolean|null} value\n   * @param {string=} name\n   * @return {!Query}\n   */\n  equalTo(value: number | string | boolean | null, name?: string) {\n    validateArgCount('Query.equalTo', 1, 2, arguments.length);\n    validateFirebaseDataArg('Query.equalTo', 1, value, this.path, false);\n    validateKey('Query.equalTo', 2, name, true);\n    if (this.queryParams_.hasStart()) {\n      throw new Error(\n        'Query.equalTo: Starting point was already set (by another call to startAt or ' +\n          'equalTo).'\n      );\n    }\n    if (this.queryParams_.hasEnd()) {\n      throw new Error(\n        'Query.equalTo: Ending point was already set (by another call to endAt or ' +\n          'equalTo).'\n      );\n    }\n    return this.startAt(value, name).endAt(value, name);\n  }\n\n  /**\n   * @return {!string} URL for this location.\n   */\n  toString(): string {\n    validateArgCount('Query.toString', 0, 0, arguments.length);\n\n    return this.repo.toString() + this.path.toUrlEncodedString();\n  }\n\n  // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\n  // for end-users.\n  toJSON() {\n    // An optional spacer argument is unnecessary for a string.\n    validateArgCount('Query.toJSON', 0, 1, arguments.length);\n    return this.toString();\n  }\n\n  /**\n   * An object representation of the query parameters used by this Query.\n   * @return {!Object}\n   */\n  queryObject(): object {\n    return this.queryParams_.getQueryObject();\n  }\n\n  /**\n   * @return {!string}\n   */\n  queryIdentifier(): string {\n    const obj = this.queryObject();\n    const id = ObjectToUniqueKey(obj);\n    return id === '{}' ? 'default' : id;\n  }\n\n  /**\n   * Return true if this query and the provided query are equivalent; otherwise, return false.\n   * @param {Query} other\n   * @return {boolean}\n   */\n  isEqual(other: Query): boolean {\n    validateArgCount('Query.isEqual', 1, 1, arguments.length);\n    if (!(other instanceof Query)) {\n      const error =\n        'Query.isEqual failed: First argument must be an instance of firebase.database.Query.';\n      throw new Error(error);\n    }\n\n    const sameRepo = this.repo === other.repo;\n    const samePath = this.path.equals(other.path);\n    const sameQueryIdentifier =\n      this.queryIdentifier() === other.queryIdentifier();\n\n    return sameRepo && samePath && sameQueryIdentifier;\n  }\n\n  /**\n   * Helper used by .on and .once to extract the context and or cancel arguments.\n   * @param {!string} fnName The function name (on or once)\n   * @param {(function(Error)|Object)=} cancelOrContext\n   * @param {Object=} context\n   * @return {{cancel: ?function(Error), context: ?Object}}\n   * @private\n   */\n  private static getCancelAndContextArgs_(\n    fnName: string,\n    cancelOrContext?: ((a: Error) => void) | object | null,\n    context?: object | null\n  ): { cancel: ((a: Error) => void) | null; context: object | null } {\n    const ret: {\n      cancel: ((a: Error) => void) | null;\n      context: object | null;\n    } = { cancel: null, context: null };\n    if (cancelOrContext && context) {\n      ret.cancel = cancelOrContext as (a: Error) => void;\n      validateCallback(fnName, 3, ret.cancel, true);\n\n      ret.context = context;\n      validateContextObject(fnName, 4, ret.context, true);\n    } else if (cancelOrContext) {\n      // we have either a cancel callback or a context.\n      if (typeof cancelOrContext === 'object' && cancelOrContext !== null) {\n        // it's a context!\n        ret.context = cancelOrContext;\n      } else if (typeof cancelOrContext === 'function') {\n        ret.cancel = cancelOrContext as (a: Error) => void;\n      } else {\n        throw new Error(\n          errorPrefix(fnName, 3, true) +\n            ' must either be a cancel callback or a context object.'\n        );\n      }\n    }\n    return ret;\n  }\n\n  get ref(): Reference {\n    return this.getRef();\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { Path } from './Path';\nimport { SparseSnapshotTree } from '../SparseSnapshotTree';\nimport { LeafNode } from '../snap/LeafNode';\nimport { nodeFromJSON } from '../snap/nodeFromJSON';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { Node } from '../snap/Node';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { SyncTree } from '../SyncTree';\nimport { Indexable } from './misc';\n\n/* It's critical for performance that we do not calculate actual values from a SyncTree\n * unless and until the value is needed. Because we expose both a SyncTree and Node\n * version of deferred value resolution, we ned a wrapper class that will let us share\n * code.\n *\n * @see https://github.com/firebase/firebase-js-sdk/issues/2487\n */\ninterface ValueProvider {\n  getImmediateChild(childName: string): ValueProvider;\n  node(): Node;\n}\n\nclass ExistingValueProvider implements ValueProvider {\n  constructor(readonly node_: Node) {}\n\n  getImmediateChild(childName: string): ValueProvider {\n    const child = this.node_.getImmediateChild(childName);\n    return new ExistingValueProvider(child);\n  }\n\n  node(): Node {\n    return this.node_;\n  }\n}\n\nclass DeferredValueProvider implements ValueProvider {\n  private syncTree_: SyncTree;\n  private path_: Path;\n\n  constructor(syncTree: SyncTree, path: Path) {\n    this.syncTree_ = syncTree;\n    this.path_ = path;\n  }\n\n  getImmediateChild(childName: string): ValueProvider {\n    const childPath = this.path_.child(childName);\n    return new DeferredValueProvider(this.syncTree_, childPath);\n  }\n\n  node(): Node {\n    return this.syncTree_.calcCompleteEventCache(this.path_);\n  }\n}\n\n/**\n * Generate placeholders for deferred values.\n * @param {?Object} values\n * @return {!Object}\n */\nexport const generateWithValues = function(\n  values: {\n    [k: string]: unknown;\n  } | null\n): { [k: string]: unknown } {\n  values = values || {};\n  values['timestamp'] = values['timestamp'] || new Date().getTime();\n  return values;\n};\n\n/**\n * Value to use when firing local events. When writing server values, fire\n * local events with an approximate value, otherwise return value as-is.\n * @param {(Object|string|number|boolean)} value\n * @param {!Object} serverValues\n * @return {!(string|number|boolean)}\n */\nexport const resolveDeferredLeafValue = function(\n  value: { [k: string]: unknown } | string | number | boolean,\n  existingVal: ValueProvider,\n  serverValues: { [k: string]: unknown }\n): string | number | boolean {\n  if (!value || typeof value !== 'object') {\n    return value as string | number | boolean;\n  }\n  assert('.sv' in value, 'Unexpected leaf node or priority contents');\n\n  if (typeof value['.sv'] === 'string') {\n    return resolveScalarDeferredValue(value['.sv'], existingVal, serverValues);\n  } else if (typeof value['.sv'] === 'object') {\n    return resolveComplexDeferredValue(value['.sv'], existingVal, serverValues);\n  } else {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(value, null, 2));\n  }\n};\n\nconst resolveScalarDeferredValue = function(\n  op: string,\n  existing: ValueProvider,\n  serverValues: { [k: string]: unknown }\n): string | number | boolean {\n  switch (op) {\n    case 'timestamp':\n      return serverValues['timestamp'] as string | number | boolean;\n    default:\n      assert(false, 'Unexpected server value: ' + op);\n  }\n};\n\nconst resolveComplexDeferredValue = function(\n  op: object,\n  existing: ValueProvider,\n  unused: { [k: string]: unknown }\n): string | number | boolean {\n  if (!op.hasOwnProperty('increment')) {\n    assert(false, 'Unexpected server value: ' + JSON.stringify(op, null, 2));\n  }\n  const delta = op['increment'];\n  if (typeof delta !== 'number') {\n    assert(false, 'Unexpected increment value: ' + delta);\n  }\n\n  const existingNode = existing.node();\n  assert(\n    existingNode !== null && typeof existingNode !== 'undefined',\n    'Expected ChildrenNode.EMPTY_NODE for nulls'\n  );\n\n  // Incrementing a non-number sets the value to the incremented amount\n  if (!existingNode.isLeafNode()) {\n    return delta;\n  }\n\n  const leaf = existingNode as LeafNode;\n  const existingVal = leaf.getValue();\n  if (typeof existingVal !== 'number') {\n    return delta;\n  }\n\n  // No need to do over/underflow arithmetic here because JS only handles floats under the covers\n  return existingVal + delta;\n};\n\n/**\n * Recursively replace all deferred values and priorities in the tree with the\n * specified generated replacement values.\n * @param {!Path} path path to which write is relative\n * @param {!Node} node new data written at path\n * @param {!SyncTree} syncTree current data\n * @param {!Object} serverValues\n * @return {!SparseSnapshotTree}\n */\nexport const resolveDeferredValueTree = function(\n  path: Path,\n  node: Node,\n  syncTree: SyncTree,\n  serverValues: Indexable\n): Node {\n  return resolveDeferredValue(\n    node,\n    new DeferredValueProvider(syncTree, path),\n    serverValues\n  );\n};\n\n/**\n * Recursively replace all deferred values and priorities in the node with the\n * specified generated replacement values.  If there are no server values in the node,\n * it'll be returned as-is.\n * @param {!Node} node\n * @param {!Object} serverValues\n * @return {!Node}\n */\nexport const resolveDeferredValueSnapshot = function(\n  node: Node,\n  existing: Node,\n  serverValues: Indexable\n): Node {\n  return resolveDeferredValue(\n    node,\n    new ExistingValueProvider(existing),\n    serverValues\n  );\n};\n\nfunction resolveDeferredValue(\n  node: Node,\n  existingVal: ValueProvider,\n  serverValues: Indexable\n): Node {\n  const rawPri = node.getPriority().val() as\n    | Indexable\n    | boolean\n    | null\n    | number\n    | string;\n  const priority = resolveDeferredLeafValue(\n    rawPri,\n    existingVal.getImmediateChild('.priority'),\n    serverValues\n  );\n  let newNode: Node;\n\n  if (node.isLeafNode()) {\n    const leafNode = node as LeafNode;\n    const value = resolveDeferredLeafValue(\n      leafNode.getValue(),\n      existingVal,\n      serverValues\n    );\n    if (\n      value !== leafNode.getValue() ||\n      priority !== leafNode.getPriority().val()\n    ) {\n      return new LeafNode(value, nodeFromJSON(priority));\n    } else {\n      return node;\n    }\n  } else {\n    const childrenNode = node as ChildrenNode;\n    newNode = childrenNode;\n    if (priority !== childrenNode.getPriority().val()) {\n      newNode = newNode.updatePriority(new LeafNode(priority));\n    }\n    childrenNode.forEachChild(PRIORITY_INDEX, (childName, childNode) => {\n      const newChildNode = resolveDeferredValue(\n        childNode,\n        existingVal.getImmediateChild(childName),\n        serverValues\n      );\n      if (newChildNode !== childNode) {\n        newNode = newNode.updateImmediateChild(childName, newChildNode);\n      }\n    });\n    return newNode;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from './util/Path';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { Node } from './snap/Node';\n\n/**\n * Helper class to store a sparse set of snapshots.\n */\nexport class SparseSnapshotTree {\n  private value: Node | null = null;\n\n  private readonly children: Map<string, SparseSnapshotTree> = new Map();\n\n  /**\n   * Gets the node stored at the given path if one exists.\n   *\n   * @param path Path to look up snapshot for.\n   * @return The retrieved node, or null.\n   */\n  find(path: Path): Node | null {\n    if (this.value != null) {\n      return this.value.getChild(path);\n    } else if (!path.isEmpty() && this.children.size > 0) {\n      const childKey = path.getFront();\n      path = path.popFront();\n      if (this.children.has(childKey)) {\n        const childTree = this.children.get(childKey);\n        return childTree.find(path);\n      } else {\n        return null;\n      }\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Stores the given node at the specified path. If there is already a node\n   * at a shallower path, it merges the new data into that snapshot node.\n   *\n   * @param path Path to look up snapshot for.\n   * @param data The new data, or null.\n   */\n  remember(path: Path, data: Node) {\n    if (path.isEmpty()) {\n      this.value = data;\n      this.children.clear();\n    } else if (this.value !== null) {\n      this.value = this.value.updateChild(path, data);\n    } else {\n      const childKey = path.getFront();\n      if (!this.children.has(childKey)) {\n        this.children.set(childKey, new SparseSnapshotTree());\n      }\n\n      const child = this.children.get(childKey);\n      path = path.popFront();\n      child.remember(path, data);\n    }\n  }\n\n  /**\n   * Purge the data at path from the cache.\n   *\n   * @param path Path to look up snapshot for.\n   * @return True if this node should now be removed.\n   */\n  forget(path: Path): boolean {\n    if (path.isEmpty()) {\n      this.value = null;\n      this.children.clear();\n      return true;\n    } else {\n      if (this.value !== null) {\n        if (this.value.isLeafNode()) {\n          // We're trying to forget a node that doesn't exist\n          return false;\n        } else {\n          const value = this.value;\n          this.value = null;\n\n          const self = this;\n          value.forEachChild(PRIORITY_INDEX, (key, tree) => {\n            self.remember(new Path(key), tree);\n          });\n\n          return this.forget(path);\n        }\n      } else if (this.children.size > 0) {\n        const childKey = path.getFront();\n        path = path.popFront();\n        if (this.children.has(childKey)) {\n          const safeToRemove = this.children.get(childKey).forget(path);\n          if (safeToRemove) {\n            this.children.delete(childKey);\n          }\n        }\n\n        return this.children.size === 0;\n      } else {\n        return true;\n      }\n    }\n  }\n\n  /**\n   * Recursively iterates through all of the stored tree and calls the\n   * callback on each one.\n   *\n   * @param prefixPath Path to look up node for.\n   * @param func The function to invoke for each tree.\n   */\n  forEachTree(prefixPath: Path, func: (a: Path, b: Node) => unknown) {\n    if (this.value !== null) {\n      func(prefixPath, this.value);\n    } else {\n      this.forEachChild((key, tree) => {\n        const path = new Path(prefixPath.toString() + '/' + key);\n        tree.forEachTree(path, func);\n      });\n    }\n  }\n\n  /**\n   * Iterates through each immediate child and triggers the callback.\n   *\n   * @param func The function to invoke for each child.\n   */\n  forEachChild(func: (a: string, b: SparseSnapshotTree) => void) {\n    this.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\nimport { assert } from '@firebase/util';\nimport { Path } from '../util/Path';\n\n/**\n *\n * @enum\n */\nexport enum OperationType {\n  OVERWRITE,\n  MERGE,\n  ACK_USER_WRITE,\n  LISTEN_COMPLETE\n}\n\n/**\n * @interface\n */\nexport interface Operation {\n  /**\n   * @type {!OperationSource}\n   */\n  source: OperationSource;\n\n  /**\n   * @type {!OperationType}\n   */\n  type: OperationType;\n\n  /**\n   * @type {!Path}\n   */\n  path: Path;\n\n  /**\n   * @param {string} childName\n   * @return {?Operation}\n   */\n  operationForChild(childName: string): Operation | null;\n}\n\n/**\n * @param {boolean} fromUser\n * @param {boolean} fromServer\n * @param {?string} queryId\n * @param {boolean} tagged\n * @constructor\n */\nexport class OperationSource {\n  constructor(\n    public fromUser: boolean,\n    public fromServer: boolean,\n    public queryId: string | null,\n    public tagged: boolean\n  ) {\n    assert(!tagged || fromServer, 'Tagged queries must be from server.');\n  }\n  /**\n   * @const\n   * @type {!OperationSource}\n   */\n  static User = new OperationSource(\n    /*fromUser=*/ true,\n    false,\n    null,\n    /*tagged=*/ false\n  );\n\n  /**\n   * @const\n   * @type {!OperationSource}\n   */\n  static Server = new OperationSource(\n    false,\n    /*fromServer=*/ true,\n    null,\n    /*tagged=*/ false\n  );\n\n  /**\n   * @param {string} queryId\n   * @return {!OperationSource}\n   */\n  static forServerTaggedQuery = function(queryId: string): OperationSource {\n    return new OperationSource(\n      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 */\n\nimport { assert } from '@firebase/util';\nimport { Path } from '../util/Path';\nimport { Operation, OperationSource, OperationType } from './Operation';\nimport { ImmutableTree } from '../util/ImmutableTree';\n\nexport class AckUserWrite implements Operation {\n  /** @inheritDoc */\n  type = OperationType.ACK_USER_WRITE;\n\n  /** @inheritDoc */\n  source = OperationSource.User;\n\n  /**\n   *\n   * @param {!Path} path\n   * @param {!ImmutableTree<!boolean>} affectedTree A tree containing true for each affected path. Affected paths can't overlap.\n   * @param {!boolean} revert\n   */\n  constructor(\n    /** @inheritDoc */ public path: Path,\n    /** @inheritDoc */ public affectedTree: ImmutableTree<boolean>,\n    /** @inheritDoc */ public revert: boolean\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  operationForChild(childName: string): AckUserWrite {\n    if (!this.path.isEmpty()) {\n      assert(\n        this.path.getFront() === childName,\n        'operationForChild called for unrelated child.'\n      );\n      return new AckUserWrite(\n        this.path.popFront(),\n        this.affectedTree,\n        this.revert\n      );\n    } else if (this.affectedTree.value != null) {\n      assert(\n        this.affectedTree.children.isEmpty(),\n        'affectedTree should not have overlapping affected paths.'\n      );\n      // All child locations are affected as well; just return same operation.\n      return this;\n    } else {\n      const childTree = this.affectedTree.subtree(new Path(childName));\n      return new AckUserWrite(Path.Empty, childTree, this.revert);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { SortedMap } from './SortedMap';\nimport { Path } from './Path';\nimport { stringCompare, each } from './util';\n\nlet emptyChildrenSingleton: SortedMap<string, ImmutableTree<null>>;\n\n/**\n * Singleton empty children collection.\n *\n * @const\n * @type {!SortedMap.<string, !ImmutableTree.<?>>}\n */\nconst EmptyChildren = (): SortedMap<string, ImmutableTree<null>> => {\n  if (!emptyChildrenSingleton) {\n    emptyChildrenSingleton = new SortedMap<string, ImmutableTree<null>>(\n      stringCompare\n    );\n  }\n  return emptyChildrenSingleton;\n};\n\n/**\n * A tree with immutable elements.\n */\nexport class ImmutableTree<T> {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  static Empty = new ImmutableTree<any>(null);\n\n  /**\n   * @template T\n   * @param {!Object.<string, !T>} obj\n   * @return {!ImmutableTree.<!T>}\n   */\n  static fromObject<T>(obj: { [k: string]: T }): ImmutableTree<T> {\n    let tree: ImmutableTree<T> = ImmutableTree.Empty;\n    each(obj, (childPath: string, childSnap: T) => {\n      tree = tree.set(new Path(childPath), childSnap);\n    });\n    return tree;\n  }\n\n  /**\n   * @template T\n   * @param {?T} value\n   * @param {SortedMap.<string, !ImmutableTree.<T>>=} children\n   */\n  constructor(\n    public readonly value: T | null,\n    public readonly children: SortedMap<\n      string,\n      ImmutableTree<T>\n    > = EmptyChildren()\n  ) {}\n\n  /**\n   * True if the value is empty and there are no children\n   * @return {boolean}\n   */\n  isEmpty(): boolean {\n    return this.value === null && this.children.isEmpty();\n  }\n\n  /**\n   * Given a path and predicate, return the first node and the path to that node\n   * where the predicate returns true.\n   *\n   * TODO Do a perf test -- If we're creating a bunch of {path: value:} objects\n   * on the way back out, it may be better to pass down a pathSoFar obj.\n   *\n   * @param {!Path} relativePath The remainder of the path\n   * @param {function(T):boolean} predicate The predicate to satisfy to return a\n   *   node\n   * @return {?{path:!Path, value:!T}}\n   */\n  findRootMostMatchingPathAndValue(\n    relativePath: Path,\n    predicate: (a: T) => boolean\n  ): { path: Path; value: T } | null {\n    if (this.value != null && predicate(this.value)) {\n      return { path: Path.Empty, value: this.value };\n    } else {\n      if (relativePath.isEmpty()) {\n        return null;\n      } else {\n        const front = relativePath.getFront();\n        const child = this.children.get(front);\n        if (child !== null) {\n          const childExistingPathAndValue = child.findRootMostMatchingPathAndValue(\n            relativePath.popFront(),\n            predicate\n          );\n          if (childExistingPathAndValue != null) {\n            const fullPath = new Path(front).child(\n              childExistingPathAndValue.path\n            );\n            return { path: fullPath, value: childExistingPathAndValue.value };\n          } else {\n            return null;\n          }\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  /**\n   * Find, if it exists, the shortest subpath of the given path that points a defined\n   * value in the tree\n   * @param {!Path} relativePath\n   * @return {?{path: !Path, value: !T}}\n   */\n  findRootMostValueAndPath(\n    relativePath: Path\n  ): { path: Path; value: T } | null {\n    return this.findRootMostMatchingPathAndValue(relativePath, () => true);\n  }\n\n  /**\n   * @param {!Path} relativePath\n   * @return {!ImmutableTree.<T>} The subtree at the given path\n   */\n  subtree(relativePath: Path): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      return this;\n    } else {\n      const front = relativePath.getFront();\n      const childTree = this.children.get(front);\n      if (childTree !== null) {\n        return childTree.subtree(relativePath.popFront());\n      } else {\n        return ImmutableTree.Empty;\n      }\n    }\n  }\n\n  /**\n   * Sets a value at the specified path.\n   *\n   * @param {!Path} relativePath Path to set value at.\n   * @param {?T} toSet Value to set.\n   * @return {!ImmutableTree.<T>} Resulting tree.\n   */\n  set(relativePath: Path, toSet: T | null): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      return new ImmutableTree(toSet, this.children);\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front) || ImmutableTree.Empty;\n      const newChild = child.set(relativePath.popFront(), toSet);\n      const newChildren = this.children.insert(front, newChild);\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Removes the value at the specified path.\n   *\n   * @param {!Path} relativePath Path to value to remove.\n   * @return {!ImmutableTree.<T>} Resulting tree.\n   */\n  remove(relativePath: Path): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      if (this.children.isEmpty()) {\n        return ImmutableTree.Empty;\n      } else {\n        return new ImmutableTree(null, this.children);\n      }\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front);\n      if (child) {\n        const newChild = child.remove(relativePath.popFront());\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 ImmutableTree.Empty;\n        } else {\n          return new ImmutableTree(this.value, newChildren);\n        }\n      } else {\n        return this;\n      }\n    }\n  }\n\n  /**\n   * Gets a value from the tree.\n   *\n   * @param {!Path} relativePath Path to get value for.\n   * @return {?T} Value at path, or null.\n   */\n  get(relativePath: Path): T | null {\n    if (relativePath.isEmpty()) {\n      return this.value;\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front);\n      if (child) {\n        return child.get(relativePath.popFront());\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Replace the subtree at the specified path with the given new tree.\n   *\n   * @param {!Path} relativePath Path to replace subtree for.\n   * @param {!ImmutableTree} newTree New tree.\n   * @return {!ImmutableTree} Resulting tree.\n   */\n  setTree(relativePath: Path, newTree: ImmutableTree<T>): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      return newTree;\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front) || ImmutableTree.Empty;\n      const newChild = child.setTree(relativePath.popFront(), newTree);\n      let newChildren;\n      if (newChild.isEmpty()) {\n        newChildren = this.children.remove(front);\n      } else {\n        newChildren = this.children.insert(front, newChild);\n      }\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Performs a depth first fold on this tree. Transforms a tree into a single\n   * value, given a function that operates on the path to a node, an optional\n   * current value, and a map of child names to folded subtrees\n   * @template V\n   * @param {function(Path, ?T, Object.<string, V>):V} fn\n   * @return {V}\n   */\n  fold<V>(fn: (path: Path, value: T, children: { [k: string]: V }) => V): V {\n    return this.fold_(Path.Empty, fn);\n  }\n\n  /**\n   * Recursive helper for public-facing fold() method\n   * @template V\n   * @param {!Path} pathSoFar\n   * @param {function(Path, ?T, Object.<string, V>):V} fn\n   * @return {V}\n   * @private\n   */\n  private fold_<V>(\n    pathSoFar: Path,\n    fn: (path: Path, value: T | null, children: { [k: string]: V }) => V\n  ): V {\n    const accum: { [k: string]: V } = {};\n    this.children.inorderTraversal(\n      (childKey: string, childTree: ImmutableTree<T>) => {\n        accum[childKey] = childTree.fold_(pathSoFar.child(childKey), fn);\n      }\n    );\n    return fn(pathSoFar, this.value, accum);\n  }\n\n  /**\n   * Find the first matching value on the given path. Return the result of applying f to it.\n   * @template V\n   * @param {!Path} path\n   * @param {!function(!Path, !T):?V} f\n   * @return {?V}\n   */\n  findOnPath<V>(path: Path, f: (path: Path, value: T) => V | null): V | null {\n    return this.findOnPath_(path, Path.Empty, f);\n  }\n\n  private findOnPath_<V>(\n    pathToFollow: Path,\n    pathSoFar: Path,\n    f: (path: Path, value: T) => V | null\n  ): V | null {\n    const result = this.value ? f(pathSoFar, this.value) : false;\n    if (result) {\n      return result;\n    } else {\n      if (pathToFollow.isEmpty()) {\n        return null;\n      } else {\n        const front = pathToFollow.getFront()!;\n        const nextChild = this.children.get(front);\n        if (nextChild) {\n          return nextChild.findOnPath_(\n            pathToFollow.popFront(),\n            pathSoFar.child(front),\n            f\n          );\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  /**\n   *\n   * @param {!Path} path\n   * @param {!function(!Path, !T)} f\n   * @returns {!ImmutableTree.<T>}\n   */\n  foreachOnPath(\n    path: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    return this.foreachOnPath_(path, Path.Empty, f);\n  }\n\n  private foreachOnPath_(\n    pathToFollow: Path,\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    if (pathToFollow.isEmpty()) {\n      return this;\n    } else {\n      if (this.value) {\n        f(currentRelativePath, this.value);\n      }\n      const front = pathToFollow.getFront();\n      const nextChild = this.children.get(front);\n      if (nextChild) {\n        return nextChild.foreachOnPath_(\n          pathToFollow.popFront(),\n          currentRelativePath.child(front),\n          f\n        );\n      } else {\n        return ImmutableTree.Empty;\n      }\n    }\n  }\n\n  /**\n   * Calls the given function for each node in the tree that has a value.\n   *\n   * @param {function(!Path, !T)} f A function to be called with\n   *   the path from the root of the tree to a node, and the value at that node.\n   *   Called in depth-first order.\n   */\n  foreach(f: (path: Path, value: T) => void) {\n    this.foreach_(Path.Empty, f);\n  }\n\n  private foreach_(\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ) {\n    this.children.inorderTraversal((childName, childTree) => {\n      childTree.foreach_(currentRelativePath.child(childName), f);\n    });\n    if (this.value) {\n      f(currentRelativePath, this.value);\n    }\n  }\n\n  /**\n   *\n   * @param {function(string, !T)} f\n   */\n  foreachChild(f: (name: string, value: T) => void) {\n    this.children.inorderTraversal(\n      (childName: string, childTree: ImmutableTree<T>) => {\n        if (childTree.value) {\n          f(childName, childTree.value);\n        }\n      }\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from '../util/Path';\nimport { Operation, OperationSource, OperationType } from './Operation';\n\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @constructor\n * @implements {Operation}\n */\nexport class ListenComplete implements Operation {\n  /** @inheritDoc */\n  type = OperationType.LISTEN_COMPLETE;\n\n  constructor(public source: OperationSource, public path: Path) {}\n\n  operationForChild(childName: string): ListenComplete {\n    if (this.path.isEmpty()) {\n      return new ListenComplete(this.source, Path.Empty);\n    } else {\n      return new ListenComplete(this.source, this.path.popFront());\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Operation, OperationSource, OperationType } from './Operation';\nimport { Path } from '../util/Path';\nimport { Node } from '../snap/Node';\n\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @param {!Node} snap\n * @constructor\n * @implements {Operation}\n */\nexport class Overwrite implements Operation {\n  /** @inheritDoc */\n  type = OperationType.OVERWRITE;\n\n  constructor(\n    public source: OperationSource,\n    public path: Path,\n    public snap: Node\n  ) {}\n\n  operationForChild(childName: string): Overwrite {\n    if (this.path.isEmpty()) {\n      return new Overwrite(\n        this.source,\n        Path.Empty,\n        this.snap.getImmediateChild(childName)\n      );\n    } else {\n      return new Overwrite(this.source, this.path.popFront(), this.snap);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Operation, OperationSource, OperationType } from './Operation';\nimport { Overwrite } from './Overwrite';\nimport { Path } from '../util/Path';\nimport { assert } from '@firebase/util';\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport { Node } from '../snap/Node';\n\n/**\n * @param {!OperationSource} source\n * @param {!Path} path\n * @param {!ImmutableTree.<!Node>} children\n * @constructor\n * @implements {Operation}\n */\nexport class Merge implements Operation {\n  /** @inheritDoc */\n  type = OperationType.MERGE;\n\n  constructor(\n    /** @inheritDoc */ public source: OperationSource,\n    /** @inheritDoc */ public path: Path,\n    /** @inheritDoc */ public children: ImmutableTree<Node>\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  operationForChild(childName: string): Operation {\n    if (this.path.isEmpty()) {\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, Path.Empty, childTree.value);\n      } else {\n        // This is a merge at a deeper level\n        return new Merge(this.source, Path.Empty, childTree);\n      }\n    } else {\n      assert(\n        this.path.getFront() === childName,\n        \"Can't get a merge for a child not on the path of the operation\"\n      );\n      return new Merge(this.source, this.path.popFront(), this.children);\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  toString(): string {\n    return (\n      'Operation(' +\n      this.path +\n      ': ' +\n      this.source.toString() +\n      ' merge: ' +\n      this.children.toString() +\n      ')'\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Node } from '../snap/Node';\nimport { Path } from '../util/Path';\n\n/**\n * A cache node only stores complete children. Additionally it holds a flag whether the node can be considered fully\n * initialized in the sense that we know at one point in time this represented a valid state of the world, e.g.\n * initialized with data from the server, or a complete overwrite by the client. The filtered flag also tracks\n * whether a node potentially had children removed due to a filter.\n */\nexport class CacheNode {\n  /**\n   * @param {!Node} node_\n   * @param {boolean} fullyInitialized_\n   * @param {boolean} filtered_\n   */\n  constructor(\n    private node_: Node,\n    private fullyInitialized_: boolean,\n    private filtered_: boolean\n  ) {}\n\n  /**\n   * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\n   * @return {boolean}\n   */\n  isFullyInitialized(): boolean {\n    return this.fullyInitialized_;\n  }\n\n  /**\n   * Returns whether this node is potentially missing children due to a filter applied to the node\n   * @return {boolean}\n   */\n  isFiltered(): boolean {\n    return this.filtered_;\n  }\n\n  /**\n   * @param {!Path} path\n   * @return {boolean}\n   */\n  isCompleteForPath(path: Path): boolean {\n    if (path.isEmpty()) {\n      return this.isFullyInitialized() && !this.filtered_;\n    }\n\n    const childKey = path.getFront();\n    return this.isCompleteForChild(childKey);\n  }\n\n  /**\n   * @param {!string} key\n   * @return {boolean}\n   */\n  isCompleteForChild(key: string): boolean {\n    return (\n      (this.isFullyInitialized() && !this.filtered_) || this.node_.hasChild(key)\n    );\n  }\n\n  /**\n   * @return {!Node}\n   */\n  getNode(): Node {\n    return this.node_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { CacheNode } from './CacheNode';\nimport { Node } from '../snap/Node';\n\n/**\n * Stores the data we have cached for a view.\n *\n * serverSnap is the cached server data, eventSnap is the cached event data (server data plus any local writes).\n *\n * @constructor\n */\nexport class ViewCache {\n  /**\n   *\n   * @param {!CacheNode} eventCache_\n   * @param {!CacheNode} serverCache_\n   */\n  constructor(\n    private readonly eventCache_: CacheNode,\n    private readonly serverCache_: CacheNode\n  ) {}\n\n  /**\n   * @const\n   * @type {ViewCache}\n   */\n  static Empty = new ViewCache(\n    new CacheNode(\n      ChildrenNode.EMPTY_NODE,\n      /*fullyInitialized=*/ false,\n      /*filtered=*/ false\n    ),\n    new CacheNode(\n      ChildrenNode.EMPTY_NODE,\n      /*fullyInitialized=*/ false,\n      /*filtered=*/ false\n    )\n  );\n\n  /**\n   * @param {!Node} eventSnap\n   * @param {boolean} complete\n   * @param {boolean} filtered\n   * @return {!ViewCache}\n   */\n  updateEventSnap(\n    eventSnap: Node,\n    complete: boolean,\n    filtered: boolean\n  ): ViewCache {\n    return new ViewCache(\n      new CacheNode(eventSnap, complete, filtered),\n      this.serverCache_\n    );\n  }\n\n  /**\n   * @param {!Node} serverSnap\n   * @param {boolean} complete\n   * @param {boolean} filtered\n   * @return {!ViewCache}\n   */\n  updateServerSnap(\n    serverSnap: Node,\n    complete: boolean,\n    filtered: boolean\n  ): ViewCache {\n    return new ViewCache(\n      this.eventCache_,\n      new CacheNode(serverSnap, complete, filtered)\n    );\n  }\n\n  /**\n   * @return {!CacheNode}\n   */\n  getEventCache(): CacheNode {\n    return this.eventCache_;\n  }\n\n  /**\n   * @return {?Node}\n   */\n  getCompleteEventSnap(): Node | null {\n    return this.eventCache_.isFullyInitialized()\n      ? this.eventCache_.getNode()\n      : null;\n  }\n\n  /**\n   * @return {!CacheNode}\n   */\n  getServerCache(): CacheNode {\n    return this.serverCache_;\n  }\n\n  /**\n   * @return {?Node}\n   */\n  getCompleteServerSnap(): Node | null {\n    return this.serverCache_.isFullyInitialized()\n      ? this.serverCache_.getNode()\n      : 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\nimport { Node } from '../snap/Node';\n\n/**\n * @constructor\n * @struct\n * @param {!string} type The event type\n * @param {!Node} snapshotNode The data\n * @param {string=} childName The name for this child, if it's a child event\n * @param {Node=} oldSnap Used for intermediate processing of child changed events\n * @param {string=} prevName The name for the previous child, if applicable\n */\nexport class Change {\n  constructor(\n    public type: string,\n    public snapshotNode: Node,\n    public childName?: string,\n    public oldSnap?: Node,\n    public prevName?: string | null\n  ) {}\n\n  /**\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  static valueChange(snapshot: Node): Change {\n    return new Change(Change.VALUE, snapshot);\n  }\n\n  /**\n   * @param {string} childKey\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  static childAddedChange(childKey: string, snapshot: Node): Change {\n    return new Change(Change.CHILD_ADDED, snapshot, childKey);\n  }\n\n  /**\n   * @param {string} childKey\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  static childRemovedChange(childKey: string, snapshot: Node): Change {\n    return new Change(Change.CHILD_REMOVED, snapshot, childKey);\n  }\n\n  /**\n   * @param {string} childKey\n   * @param {!Node} newSnapshot\n   * @param {!Node} oldSnapshot\n   * @return {!Change}\n   */\n  static childChangedChange(\n    childKey: string,\n    newSnapshot: Node,\n    oldSnapshot: Node\n  ): Change {\n    return new Change(Change.CHILD_CHANGED, newSnapshot, childKey, oldSnapshot);\n  }\n\n  /**\n   * @param {string} childKey\n   * @param {!Node} snapshot\n   * @return {!Change}\n   */\n  static childMovedChange(childKey: string, snapshot: Node): Change {\n    return new Change(Change.CHILD_MOVED, snapshot, childKey);\n  }\n\n  //event types\n  /** Event type for a child added */\n  static CHILD_ADDED = 'child_added';\n\n  /** Event type for a child removed */\n  static CHILD_REMOVED = 'child_removed';\n\n  /** Event type for a child changed */\n  static CHILD_CHANGED = 'child_changed';\n\n  /** Event type for a child moved */\n  static CHILD_MOVED = 'child_moved';\n\n  /** Event type for a value change */\n  static VALUE = 'value';\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { Change } from '../Change';\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { PRIORITY_INDEX } from '../../snap/indexes/PriorityIndex';\nimport { NodeFilter } from './NodeFilter';\nimport { Index } from '../../snap/indexes/Index';\nimport { Path } from '../../util/Path';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\nimport { Node } from '../../snap/Node';\n\n/**\n * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\n *\n * @constructor\n * @implements {NodeFilter}\n * @param {!Index} index\n */\nexport class IndexedFilter implements NodeFilter {\n  constructor(private readonly index_: Index) {}\n\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    assert(\n      snap.isIndexed(this.index_),\n      'A node must be indexed if only a child is updated'\n    );\n    const oldChild = snap.getImmediateChild(key);\n    // Check if anything actually changed.\n    if (\n      oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))\n    ) {\n      // There's an edge case where a child can enter or leave the view because affectedPath was set to null.\n      // In this case, affectedPath will appear null in both the old and new snapshots.  So we need\n      // to avoid treating these cases as \"nothing changed.\"\n      if (oldChild.isEmpty() === newChild.isEmpty()) {\n        // Nothing changed.\n\n        // This assert should be valid, but it's expensive (can dominate perf testing) so don't actually do it.\n        //assert(oldChild.equals(newChild), 'Old and new snapshots should be equal.');\n        return snap;\n      }\n    }\n\n    if (optChangeAccumulator != null) {\n      if (newChild.isEmpty()) {\n        if (snap.hasChild(key)) {\n          optChangeAccumulator.trackChildChange(\n            Change.childRemovedChange(key, oldChild)\n          );\n        } else {\n          assert(\n            snap.isLeafNode(),\n            'A child remove without an old child only makes sense on a leaf node'\n          );\n        }\n      } else if (oldChild.isEmpty()) {\n        optChangeAccumulator.trackChildChange(\n          Change.childAddedChange(key, newChild)\n        );\n      } else {\n        optChangeAccumulator.trackChildChange(\n          Change.childChangedChange(key, newChild, oldChild)\n        );\n      }\n    }\n    if (snap.isLeafNode() && newChild.isEmpty()) {\n      return snap;\n    } else {\n      // Make sure the node is indexed\n      return snap.updateImmediateChild(key, newChild).withIndex(this.index_);\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (optChangeAccumulator != null) {\n      if (!oldSnap.isLeafNode()) {\n        oldSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (!newSnap.hasChild(key)) {\n            optChangeAccumulator.trackChildChange(\n              Change.childRemovedChange(key, childNode)\n            );\n          }\n        });\n      }\n      if (!newSnap.isLeafNode()) {\n        newSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n          if (oldSnap.hasChild(key)) {\n            const oldChild = oldSnap.getImmediateChild(key);\n            if (!oldChild.equals(childNode)) {\n              optChangeAccumulator.trackChildChange(\n                Change.childChangedChange(key, childNode, oldChild)\n              );\n            }\n          } else {\n            optChangeAccumulator.trackChildChange(\n              Change.childAddedChange(key, childNode)\n            );\n          }\n        });\n      }\n    }\n    return newSnap.withIndex(this.index_);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    if (oldSnap.isEmpty()) {\n      return ChildrenNode.EMPTY_NODE;\n    } else {\n      return oldSnap.updatePriority(newPriority);\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  filtersNodes(): boolean {\n    return false;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getIndexedFilter(): IndexedFilter {\n    return this;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getIndex(): Index {\n    return this.index_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Change } from './Change';\nimport { assert, assertionError } from '@firebase/util';\n\nexport class ChildChangeAccumulator {\n  private readonly changeMap: Map<string, Change> = new Map();\n\n  trackChildChange(change: Change) {\n    const type = change.type;\n    const childKey = change.childName!;\n    assert(\n      type === Change.CHILD_ADDED ||\n        type === Change.CHILD_CHANGED ||\n        type === Change.CHILD_REMOVED,\n      'Only child changes supported for tracking'\n    );\n    assert(\n      childKey !== '.priority',\n      'Only non-priority child changes can be tracked.'\n    );\n    const oldChange = this.changeMap.get(childKey);\n    if (oldChange) {\n      const oldType = oldChange.type;\n      if (type === Change.CHILD_ADDED && oldType === Change.CHILD_REMOVED) {\n        this.changeMap.set(\n          childKey,\n          Change.childChangedChange(\n            childKey,\n            change.snapshotNode,\n            oldChange.snapshotNode\n          )\n        );\n      } else if (\n        type === Change.CHILD_REMOVED &&\n        oldType === Change.CHILD_ADDED\n      ) {\n        this.changeMap.delete(childKey);\n      } else if (\n        type === Change.CHILD_REMOVED &&\n        oldType === Change.CHILD_CHANGED\n      ) {\n        this.changeMap.set(\n          childKey,\n          Change.childRemovedChange(childKey, oldChange.oldSnap)\n        );\n      } else if (\n        type === Change.CHILD_CHANGED &&\n        oldType === Change.CHILD_ADDED\n      ) {\n        this.changeMap.set(\n          childKey,\n          Change.childAddedChange(childKey, change.snapshotNode)\n        );\n      } else if (\n        type === Change.CHILD_CHANGED &&\n        oldType === Change.CHILD_CHANGED\n      ) {\n        this.changeMap.set(\n          childKey,\n          Change.childChangedChange(\n            childKey,\n            change.snapshotNode,\n            oldChange.oldSnap\n          )\n        );\n      } else {\n        throw assertionError(\n          'Illegal combination of changes: ' +\n            change +\n            ' occurred after ' +\n            oldChange\n        );\n      }\n    } else {\n      this.changeMap.set(childKey, change);\n    }\n  }\n\n  getChanges(): Change[] {\n    return Array.from(this.changeMap.values());\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CacheNode } from './CacheNode';\nimport { NamedNode, Node } from '../snap/Node';\nimport { Index } from '../snap/indexes/Index';\nimport { WriteTreeRef } from '../WriteTree';\nimport { ViewCache } from './ViewCache';\n\n/**\n * Since updates to filtered nodes might require nodes to be pulled in from \"outside\" the node, this interface\n * can help to get complete children that can be pulled in.\n * A class implementing this interface takes potentially multiple sources (e.g. user writes, server data from\n * other views etc.) to try it's best to get a complete child that might be useful in pulling into the view.\n *\n * @interface\n */\nexport interface CompleteChildSource {\n  /**\n   * @param {!string} childKey\n   * @return {?Node}\n   */\n  getCompleteChild(childKey: string): Node | null;\n\n  /**\n   * @param {!Index} index\n   * @param {!NamedNode} child\n   * @param {boolean} reverse\n   * @return {?NamedNode}\n   */\n  getChildAfterChild(\n    index: Index,\n    child: NamedNode,\n    reverse: boolean\n  ): NamedNode | null;\n}\n\n/**\n * An implementation of CompleteChildSource that never returns any additional children\n *\n * @private\n * @constructor\n * @implements CompleteChildSource\n */\n// eslint-disable-next-line @typescript-eslint/class-name-casing\nexport class NoCompleteChildSource_ implements CompleteChildSource {\n  /**\n   * @inheritDoc\n   */\n  getCompleteChild(childKey?: string): Node | null {\n    return null;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getChildAfterChild(\n    index?: Index,\n    child?: NamedNode,\n    reverse?: boolean\n  ): NamedNode | null {\n    return null;\n  }\n}\n\n/**\n * Singleton instance.\n * @const\n * @type {!CompleteChildSource}\n */\nexport const NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\n\n/**\n * An implementation of CompleteChildSource that uses a WriteTree in addition to any other server data or\n * old event caches available to calculate complete children.\n *\n *\n * @implements CompleteChildSource\n */\nexport class WriteTreeCompleteChildSource implements CompleteChildSource {\n  /**\n   * @param {!WriteTreeRef} writes_\n   * @param {!ViewCache} viewCache_\n   * @param {?Node} optCompleteServerCache_\n   */\n  constructor(\n    private writes_: WriteTreeRef,\n    private viewCache_: ViewCache,\n    private optCompleteServerCache_: Node | null = null\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  getCompleteChild(childKey: string): Node | null {\n    const node = this.viewCache_.getEventCache();\n    if (node.isCompleteForChild(childKey)) {\n      return node.getNode().getImmediateChild(childKey);\n    } else {\n      const serverNode =\n        this.optCompleteServerCache_ != null\n          ? new CacheNode(this.optCompleteServerCache_, true, false)\n          : this.viewCache_.getServerCache();\n      return this.writes_.calcCompleteChild(childKey, serverNode);\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getChildAfterChild(\n    index: Index,\n    child: NamedNode,\n    reverse: boolean\n  ): NamedNode | null {\n    const completeServerData =\n      this.optCompleteServerCache_ != null\n        ? this.optCompleteServerCache_\n        : this.viewCache_.getCompleteServerSnap();\n    const nodes = this.writes_.calcIndexedSlice(\n      completeServerData,\n      child,\n      1,\n      reverse,\n      index\n    );\n    if (nodes.length === 0) {\n      return null;\n    } else {\n      return nodes[0];\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Operation, OperationType } from '../operation/Operation';\nimport { assert, assertionError } from '@firebase/util';\nimport { ChildChangeAccumulator } from './ChildChangeAccumulator';\nimport { Change } from './Change';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { KEY_INDEX } from '../snap/indexes/KeyIndex';\nimport { ImmutableTree } from '../util/ImmutableTree';\nimport { Path } from '../util/Path';\nimport {\n  WriteTreeCompleteChildSource,\n  NO_COMPLETE_CHILD_SOURCE,\n  CompleteChildSource\n} from './CompleteChildSource';\nimport { ViewCache } from './ViewCache';\nimport { NodeFilter } from './filter/NodeFilter';\nimport { WriteTreeRef } from '../WriteTree';\nimport { Overwrite } from '../operation/Overwrite';\nimport { Merge } from '../operation/Merge';\nimport { AckUserWrite } from '../operation/AckUserWrite';\nimport { Node } from '../snap/Node';\n\n/**\n * @constructor\n * @struct\n */\nexport class ProcessorResult {\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Array.<!Change>} changes\n   */\n  constructor(\n    public readonly viewCache: ViewCache,\n    public readonly changes: Change[]\n  ) {}\n}\n\n/**\n * @constructor\n */\nexport class ViewProcessor {\n  /**\n   * @param {!NodeFilter} filter_\n   */\n  constructor(private readonly filter_: NodeFilter) {}\n\n  /**\n   * @param {!ViewCache} viewCache\n   */\n  assertIndexed(viewCache: ViewCache) {\n    assert(\n      viewCache\n        .getEventCache()\n        .getNode()\n        .isIndexed(this.filter_.getIndex()),\n      'Event snap not indexed'\n    );\n    assert(\n      viewCache\n        .getServerCache()\n        .getNode()\n        .isIndexed(this.filter_.getIndex()),\n      'Server snap not indexed'\n    );\n  }\n\n  /**\n   * @param {!ViewCache} oldViewCache\n   * @param {!Operation} operation\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeCache\n   * @return {!ProcessorResult}\n   */\n  applyOperation(\n    oldViewCache: ViewCache,\n    operation: Operation,\n    writesCache: WriteTreeRef,\n    completeCache: Node | null\n  ): ProcessorResult {\n    const accumulator = new ChildChangeAccumulator();\n    let newViewCache, filterServerNode;\n    if (operation.type === OperationType.OVERWRITE) {\n      const overwrite = operation as Overwrite;\n      if (overwrite.source.fromUser) {\n        newViewCache = this.applyUserOverwrite_(\n          oldViewCache,\n          overwrite.path,\n          overwrite.snap,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      } else {\n        assert(overwrite.source.fromServer, 'Unknown source.');\n        // We filter the node if it's a tagged update or the node has been previously filtered  and the\n        // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n        // again\n        filterServerNode =\n          overwrite.source.tagged ||\n          (oldViewCache.getServerCache().isFiltered() &&\n            !overwrite.path.isEmpty());\n        newViewCache = this.applyServerOverwrite_(\n          oldViewCache,\n          overwrite.path,\n          overwrite.snap,\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    } else if (operation.type === OperationType.MERGE) {\n      const merge = operation as Merge;\n      if (merge.source.fromUser) {\n        newViewCache = this.applyUserMerge_(\n          oldViewCache,\n          merge.path,\n          merge.children,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      } else {\n        assert(merge.source.fromServer, 'Unknown source.');\n        // We filter the node if it's a tagged update or the node has been previously filtered\n        filterServerNode =\n          merge.source.tagged || oldViewCache.getServerCache().isFiltered();\n        newViewCache = this.applyServerMerge_(\n          oldViewCache,\n          merge.path,\n          merge.children,\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    } else if (operation.type === OperationType.ACK_USER_WRITE) {\n      const ackUserWrite = operation as AckUserWrite;\n      if (!ackUserWrite.revert) {\n        newViewCache = this.ackUserWrite_(\n          oldViewCache,\n          ackUserWrite.path,\n          ackUserWrite.affectedTree,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      } else {\n        newViewCache = this.revertUserWrite_(\n          oldViewCache,\n          ackUserWrite.path,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      }\n    } else if (operation.type === OperationType.LISTEN_COMPLETE) {\n      newViewCache = this.listenComplete_(\n        oldViewCache,\n        operation.path,\n        writesCache,\n        accumulator\n      );\n    } else {\n      throw assertionError('Unknown operation type: ' + operation.type);\n    }\n    const changes = accumulator.getChanges();\n    ViewProcessor.maybeAddValueEvent_(oldViewCache, newViewCache, changes);\n    return new ProcessorResult(newViewCache, changes);\n  }\n\n  /**\n   * @param {!ViewCache} oldViewCache\n   * @param {!ViewCache} newViewCache\n   * @param {!Array.<!Change>} accumulator\n   * @private\n   */\n  private static maybeAddValueEvent_(\n    oldViewCache: ViewCache,\n    newViewCache: ViewCache,\n    accumulator: Change[]\n  ) {\n    const eventSnap = newViewCache.getEventCache();\n    if (eventSnap.isFullyInitialized()) {\n      const isLeafOrEmpty =\n        eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n      const oldCompleteSnap = oldViewCache.getCompleteEventSnap();\n      if (\n        accumulator.length > 0 ||\n        !oldViewCache.getEventCache().isFullyInitialized() ||\n        (isLeafOrEmpty &&\n          !eventSnap.getNode().equals(/** @type {!Node} */ oldCompleteSnap)) ||\n        !eventSnap\n          .getNode()\n          .getPriority()\n          .equals(oldCompleteSnap.getPriority())\n      ) {\n        accumulator.push(\n          Change.valueChange(\n            /** @type {!Node} */ newViewCache.getCompleteEventSnap()\n          )\n        );\n      }\n    }\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} changePath\n   * @param {!WriteTreeRef} writesCache\n   * @param {!CompleteChildSource} source\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private generateEventCacheAfterServerEvent_(\n    viewCache: ViewCache,\n    changePath: Path,\n    writesCache: WriteTreeRef,\n    source: CompleteChildSource,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    const oldEventSnap = viewCache.getEventCache();\n    if (writesCache.shadowingWrite(changePath) != null) {\n      // we have a shadowing write, ignore changes\n      return viewCache;\n    } else {\n      let newEventCache, serverNode;\n      if (changePath.isEmpty()) {\n        // TODO: figure out how this plays with \"sliding ack windows\"\n        assert(\n          viewCache.getServerCache().isFullyInitialized(),\n          'If change path is empty, we must have complete server data'\n        );\n        if (viewCache.getServerCache().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 = viewCache.getCompleteServerSnap();\n          const completeChildren =\n            serverCache instanceof ChildrenNode\n              ? serverCache\n              : ChildrenNode.EMPTY_NODE;\n          const completeEventChildren = writesCache.calcCompleteEventChildren(\n            completeChildren\n          );\n          newEventCache = this.filter_.updateFullNode(\n            viewCache.getEventCache().getNode(),\n            completeEventChildren,\n            accumulator\n          );\n        } else {\n          const completeNode = writesCache.calcCompleteEventCache(\n            viewCache.getCompleteServerSnap()\n          );\n          newEventCache = this.filter_.updateFullNode(\n            viewCache.getEventCache().getNode(),\n            completeNode,\n            accumulator\n          );\n        }\n      } else {\n        const childKey = changePath.getFront();\n        if (childKey === '.priority') {\n          assert(\n            changePath.getLength() === 1,\n            \"Can't have a priority with additional path components\"\n          );\n          const oldEventNode = oldEventSnap.getNode();\n          serverNode = viewCache.getServerCache().getNode();\n          // we might have overwrites for this priority\n          const updatedPriority = writesCache.calcEventCacheAfterServerOverwrite(\n            changePath,\n            oldEventNode,\n            serverNode\n          );\n          if (updatedPriority != null) {\n            newEventCache = this.filter_.updatePriority(\n              oldEventNode,\n              updatedPriority\n            );\n          } else {\n            // priority didn't change, keep old node\n            newEventCache = oldEventSnap.getNode();\n          }\n        } else {\n          const childChangePath = changePath.popFront();\n          // update child\n          let newEventChild;\n          if (oldEventSnap.isCompleteForChild(childKey)) {\n            serverNode = viewCache.getServerCache().getNode();\n            const eventChildUpdate = writesCache.calcEventCacheAfterServerOverwrite(\n              changePath,\n              oldEventSnap.getNode(),\n              serverNode\n            );\n            if (eventChildUpdate != null) {\n              newEventChild = oldEventSnap\n                .getNode()\n                .getImmediateChild(childKey)\n                .updateChild(childChangePath, eventChildUpdate);\n            } else {\n              // Nothing changed, just keep the old child\n              newEventChild = oldEventSnap\n                .getNode()\n                .getImmediateChild(childKey);\n            }\n          } else {\n            newEventChild = writesCache.calcCompleteChild(\n              childKey,\n              viewCache.getServerCache()\n            );\n          }\n          if (newEventChild != null) {\n            newEventCache = this.filter_.updateChild(\n              oldEventSnap.getNode(),\n              childKey,\n              newEventChild,\n              childChangePath,\n              source,\n              accumulator\n            );\n          } else {\n            // no complete child available or no change\n            newEventCache = oldEventSnap.getNode();\n          }\n        }\n      }\n      return viewCache.updateEventSnap(\n        newEventCache,\n        oldEventSnap.isFullyInitialized() || changePath.isEmpty(),\n        this.filter_.filtersNodes()\n      );\n    }\n  }\n\n  /**\n   * @param {!ViewCache} oldViewCache\n   * @param {!Path} changePath\n   * @param {!Node} changedSnap\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeCache\n   * @param {boolean} filterServerNode\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  applyServerOverwrite_(\n    oldViewCache: ViewCache,\n    changePath: Path,\n    changedSnap: Node,\n    writesCache: WriteTreeRef,\n    completeCache: Node | null,\n    filterServerNode: boolean,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    const oldServerSnap = oldViewCache.getServerCache();\n    let newServerCache;\n    const serverFilter = filterServerNode\n      ? this.filter_\n      : this.filter_.getIndexedFilter();\n    if (changePath.isEmpty()) {\n      newServerCache = serverFilter.updateFullNode(\n        oldServerSnap.getNode(),\n        changedSnap,\n        null\n      );\n    } else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\n      // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\n      const newServerNode = oldServerSnap\n        .getNode()\n        .updateChild(changePath, changedSnap);\n      newServerCache = serverFilter.updateFullNode(\n        oldServerSnap.getNode(),\n        newServerNode,\n        null\n      );\n    } else {\n      const childKey = changePath.getFront();\n      if (\n        !oldServerSnap.isCompleteForPath(changePath) &&\n        changePath.getLength() > 1\n      ) {\n        // We don't update incomplete nodes with updates intended for other listeners\n        return oldViewCache;\n      }\n      const childChangePath = changePath.popFront();\n      const childNode = oldServerSnap.getNode().getImmediateChild(childKey);\n      const newChildNode = childNode.updateChild(childChangePath, changedSnap);\n      if (childKey === '.priority') {\n        newServerCache = serverFilter.updatePriority(\n          oldServerSnap.getNode(),\n          newChildNode\n        );\n      } else {\n        newServerCache = serverFilter.updateChild(\n          oldServerSnap.getNode(),\n          childKey,\n          newChildNode,\n          childChangePath,\n          NO_COMPLETE_CHILD_SOURCE,\n          null\n        );\n      }\n    }\n    const newViewCache = oldViewCache.updateServerSnap(\n      newServerCache,\n      oldServerSnap.isFullyInitialized() || changePath.isEmpty(),\n      serverFilter.filtersNodes()\n    );\n    const source = new WriteTreeCompleteChildSource(\n      writesCache,\n      newViewCache,\n      completeCache\n    );\n    return this.generateEventCacheAfterServerEvent_(\n      newViewCache,\n      changePath,\n      writesCache,\n      source,\n      accumulator\n    );\n  }\n\n  /**\n   * @param {!ViewCache} oldViewCache\n   * @param {!Path} changePath\n   * @param {!Node} changedSnap\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  applyUserOverwrite_(\n    oldViewCache: ViewCache,\n    changePath: Path,\n    changedSnap: Node,\n    writesCache: WriteTreeRef,\n    completeCache: Node | null,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    const oldEventSnap = oldViewCache.getEventCache();\n    let newViewCache, newEventCache;\n    const source = new WriteTreeCompleteChildSource(\n      writesCache,\n      oldViewCache,\n      completeCache\n    );\n    if (changePath.isEmpty()) {\n      newEventCache = this.filter_.updateFullNode(\n        oldViewCache.getEventCache().getNode(),\n        changedSnap,\n        accumulator\n      );\n      newViewCache = oldViewCache.updateEventSnap(\n        newEventCache,\n        true,\n        this.filter_.filtersNodes()\n      );\n    } else {\n      const childKey = changePath.getFront();\n      if (childKey === '.priority') {\n        newEventCache = this.filter_.updatePriority(\n          oldViewCache.getEventCache().getNode(),\n          changedSnap\n        );\n        newViewCache = oldViewCache.updateEventSnap(\n          newEventCache,\n          oldEventSnap.isFullyInitialized(),\n          oldEventSnap.isFiltered()\n        );\n      } else {\n        const childChangePath = changePath.popFront();\n        const oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\n        let newChild;\n        if (childChangePath.isEmpty()) {\n          // Child overwrite, we can replace the child\n          newChild = changedSnap;\n        } else {\n          const childNode = source.getCompleteChild(childKey);\n          if (childNode != null) {\n            if (\n              childChangePath.getBack() === '.priority' &&\n              childNode.getChild(childChangePath.parent()).isEmpty()\n            ) {\n              // This is a priority update on an empty node. If this node exists on the server, the\n              // server will send down the priority in the update, so ignore for now\n              newChild = childNode;\n            } else {\n              newChild = childNode.updateChild(childChangePath, changedSnap);\n            }\n          } else {\n            // There is no complete child node available\n            newChild = ChildrenNode.EMPTY_NODE;\n          }\n        }\n        if (!oldChild.equals(newChild)) {\n          const newEventSnap = this.filter_.updateChild(\n            oldEventSnap.getNode(),\n            childKey,\n            newChild,\n            childChangePath,\n            source,\n            accumulator\n          );\n          newViewCache = oldViewCache.updateEventSnap(\n            newEventSnap,\n            oldEventSnap.isFullyInitialized(),\n            this.filter_.filtersNodes()\n          );\n        } else {\n          newViewCache = oldViewCache;\n        }\n      }\n    }\n    return newViewCache;\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {string} childKey\n   * @return {boolean}\n   * @private\n   */\n  private static cacheHasChild_(\n    viewCache: ViewCache,\n    childKey: string\n  ): boolean {\n    return viewCache.getEventCache().isCompleteForChild(childKey);\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} path\n   * @param {ImmutableTree.<!Node>} changedChildren\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} serverCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private applyUserMerge_(\n    viewCache: ViewCache,\n    path: Path,\n    changedChildren: ImmutableTree<Node>,\n    writesCache: WriteTreeRef,\n    serverCache: Node | null,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    // HACK: In the case of a limit query, there may be some changes that bump things out of the\n    // window leaving room for new items.  It's important we process these changes first, so we\n    // iterate the changes twice, first processing any that affect items currently in view.\n    // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n    // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n    // not the other.\n    let curViewCache = viewCache;\n    changedChildren.foreach((relativePath, childNode) => {\n      const writePath = path.child(relativePath);\n      if (ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n        curViewCache = this.applyUserOverwrite_(\n          curViewCache,\n          writePath,\n          childNode,\n          writesCache,\n          serverCache,\n          accumulator\n        );\n      }\n    });\n\n    changedChildren.foreach((relativePath, childNode) => {\n      const writePath = path.child(relativePath);\n      if (!ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n        curViewCache = this.applyUserOverwrite_(\n          curViewCache,\n          writePath,\n          childNode,\n          writesCache,\n          serverCache,\n          accumulator\n        );\n      }\n    });\n\n    return curViewCache;\n  }\n\n  /**\n   * @param {!Node} node\n   * @param {ImmutableTree.<!Node>} merge\n   * @return {!Node}\n   * @private\n   */\n  private applyMerge_(node: Node, merge: ImmutableTree<Node>): Node {\n    merge.foreach((relativePath, childNode) => {\n      node = node.updateChild(relativePath, childNode);\n    });\n    return node;\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} path\n   * @param {!ImmutableTree.<!Node>} changedChildren\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} serverCache\n   * @param {boolean} filterServerNode\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private applyServerMerge_(\n    viewCache: ViewCache,\n    path: Path,\n    changedChildren: ImmutableTree<Node>,\n    writesCache: WriteTreeRef,\n    serverCache: Node | null,\n    filterServerNode: boolean,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n    // wait for the complete data update coming soon.\n    if (\n      viewCache\n        .getServerCache()\n        .getNode()\n        .isEmpty() &&\n      !viewCache.getServerCache().isFullyInitialized()\n    ) {\n      return viewCache;\n    }\n\n    // HACK: In the case of a limit query, there may be some changes that bump things out of the\n    // window leaving room for new items.  It's important we process these changes first, so we\n    // iterate the changes twice, first processing any that affect items currently in view.\n    // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n    // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n    // not the other.\n    let curViewCache = viewCache;\n    let viewMergeTree;\n    if (path.isEmpty()) {\n      viewMergeTree = changedChildren;\n    } else {\n      viewMergeTree = ImmutableTree.Empty.setTree(path, changedChildren);\n    }\n    const serverNode = viewCache.getServerCache().getNode();\n    viewMergeTree.children.inorderTraversal((childKey, childTree) => {\n      if (serverNode.hasChild(childKey)) {\n        const serverChild = viewCache\n          .getServerCache()\n          .getNode()\n          .getImmediateChild(childKey);\n        const newChild = this.applyMerge_(serverChild, childTree);\n        curViewCache = this.applyServerOverwrite_(\n          curViewCache,\n          new Path(childKey),\n          newChild,\n          writesCache,\n          serverCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    });\n    viewMergeTree.children.inorderTraversal((childKey, childMergeTree) => {\n      const isUnknownDeepMerge =\n        !viewCache.getServerCache().isCompleteForChild(childKey) &&\n        childMergeTree.value == null;\n      if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n        const serverChild = viewCache\n          .getServerCache()\n          .getNode()\n          .getImmediateChild(childKey);\n        const newChild = this.applyMerge_(serverChild, childMergeTree);\n        curViewCache = this.applyServerOverwrite_(\n          curViewCache,\n          new Path(childKey),\n          newChild,\n          writesCache,\n          serverCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    });\n\n    return curViewCache;\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} ackPath\n   * @param {!ImmutableTree<!boolean>} affectedTree\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private ackUserWrite_(\n    viewCache: ViewCache,\n    ackPath: Path,\n    affectedTree: ImmutableTree<boolean>,\n    writesCache: WriteTreeRef,\n    completeCache: Node | null,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    if (writesCache.shadowingWrite(ackPath) != null) {\n      return viewCache;\n    }\n\n    // Only filter server node if it is currently filtered\n    const filterServerNode = viewCache.getServerCache().isFiltered();\n\n    // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\n    // now that it won't be shadowed.\n    const serverCache = viewCache.getServerCache();\n    if (affectedTree.value != null) {\n      // This is an overwrite.\n      if (\n        (ackPath.isEmpty() && serverCache.isFullyInitialized()) ||\n        serverCache.isCompleteForPath(ackPath)\n      ) {\n        return this.applyServerOverwrite_(\n          viewCache,\n          ackPath,\n          serverCache.getNode().getChild(ackPath),\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      } else if (ackPath.isEmpty()) {\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 = ImmutableTree.Empty;\n        serverCache.getNode().forEachChild(KEY_INDEX, (name, node) => {\n          changedChildren = changedChildren.set(new Path(name), node);\n        });\n        return this.applyServerMerge_(\n          viewCache,\n          ackPath,\n          changedChildren,\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      } else {\n        return viewCache;\n      }\n    } else {\n      // This is a merge.\n      let changedChildren = ImmutableTree.Empty;\n      affectedTree.foreach((mergePath, value) => {\n        const serverCachePath = ackPath.child(mergePath);\n        if (serverCache.isCompleteForPath(serverCachePath)) {\n          changedChildren = changedChildren.set(\n            mergePath,\n            serverCache.getNode().getChild(serverCachePath)\n          );\n        }\n      });\n      return this.applyServerMerge_(\n        viewCache,\n        ackPath,\n        changedChildren,\n        writesCache,\n        completeCache,\n        filterServerNode,\n        accumulator\n      );\n    }\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} path\n   * @param {!WriteTreeRef} writesCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private listenComplete_(\n    viewCache: ViewCache,\n    path: Path,\n    writesCache: WriteTreeRef,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    const oldServerNode = viewCache.getServerCache();\n    const newViewCache = viewCache.updateServerSnap(\n      oldServerNode.getNode(),\n      oldServerNode.isFullyInitialized() || path.isEmpty(),\n      oldServerNode.isFiltered()\n    );\n    return this.generateEventCacheAfterServerEvent_(\n      newViewCache,\n      path,\n      writesCache,\n      NO_COMPLETE_CHILD_SOURCE,\n      accumulator\n    );\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} path\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeServerCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private revertUserWrite_(\n    viewCache: ViewCache,\n    path: Path,\n    writesCache: WriteTreeRef,\n    completeServerCache: Node | null,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    let complete;\n    if (writesCache.shadowingWrite(path) != null) {\n      return viewCache;\n    } else {\n      const source = new WriteTreeCompleteChildSource(\n        writesCache,\n        viewCache,\n        completeServerCache\n      );\n      const oldEventCache = viewCache.getEventCache().getNode();\n      let newEventCache;\n      if (path.isEmpty() || path.getFront() === '.priority') {\n        let newNode;\n        if (viewCache.getServerCache().isFullyInitialized()) {\n          newNode = writesCache.calcCompleteEventCache(\n            viewCache.getCompleteServerSnap()\n          );\n        } else {\n          const serverChildren = viewCache.getServerCache().getNode();\n          assert(\n            serverChildren instanceof ChildrenNode,\n            'serverChildren would be complete if leaf node'\n          );\n          newNode = writesCache.calcCompleteEventChildren(\n            serverChildren as ChildrenNode\n          );\n        }\n        newNode = newNode as Node;\n        newEventCache = this.filter_.updateFullNode(\n          oldEventCache,\n          newNode,\n          accumulator\n        );\n      } else {\n        const childKey = path.getFront();\n        let newChild = writesCache.calcCompleteChild(\n          childKey,\n          viewCache.getServerCache()\n        );\n        if (\n          newChild == null &&\n          viewCache.getServerCache().isCompleteForChild(childKey)\n        ) {\n          newChild = oldEventCache.getImmediateChild(childKey);\n        }\n        if (newChild != null) {\n          newEventCache = this.filter_.updateChild(\n            oldEventCache,\n            childKey,\n            newChild,\n            path.popFront(),\n            source,\n            accumulator\n          );\n        } else if (\n          viewCache\n            .getEventCache()\n            .getNode()\n            .hasChild(childKey)\n        ) {\n          // No complete child available, delete the existing one, if any\n          newEventCache = this.filter_.updateChild(\n            oldEventCache,\n            childKey,\n            ChildrenNode.EMPTY_NODE,\n            path.popFront(),\n            source,\n            accumulator\n          );\n        } else {\n          newEventCache = oldEventCache;\n        }\n        if (\n          newEventCache.isEmpty() &&\n          viewCache.getServerCache().isFullyInitialized()\n        ) {\n          // We might have reverted all child writes. Maybe the old event was a leaf node\n          complete = writesCache.calcCompleteEventCache(\n            viewCache.getCompleteServerSnap()\n          );\n          if (complete.isLeafNode()) {\n            newEventCache = this.filter_.updateFullNode(\n              newEventCache,\n              complete,\n              accumulator\n            );\n          }\n        }\n      }\n      complete =\n        viewCache.getServerCache().isFullyInitialized() ||\n        writesCache.shadowingWrite(Path.Empty) != null;\n      return viewCache.updateEventSnap(\n        newEventCache,\n        complete,\n        this.filter_.filtersNodes()\n      );\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { NamedNode, Node } from '../snap/Node';\nimport { Change } from './Change';\nimport { assertionError } from '@firebase/util';\nimport { Query } from '../../api/Query';\nimport { Index } from '../snap/indexes/Index';\nimport { EventRegistration } from './EventRegistration';\nimport { Event } from './Event';\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 * @constructor\n */\nexport class EventGenerator {\n  private index_: Index;\n\n  /**\n   *\n   * @param {!Query} query_\n   */\n  constructor(private query_: Query) {\n    /**\n     * @private\n     * @type {!Index}\n     */\n    this.index_ = this.query_.getQueryParams().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   *\n   * @param {!Array.<!Change>} changes\n   * @param {!Node} eventCache\n   * @param {!Array.<!EventRegistration>} eventRegistrations\n   * @return {!Array.<!Event>}\n   */\n  generateEventsForChanges(\n    changes: Change[],\n    eventCache: Node,\n    eventRegistrations: EventRegistration[]\n  ): Event[] {\n    const events: Event[] = [];\n    const moves: Change[] = [];\n\n    changes.forEach(change => {\n      if (\n        change.type === Change.CHILD_CHANGED &&\n        this.index_.indexedValueChanged(\n          change.oldSnap as Node,\n          change.snapshotNode\n        )\n      ) {\n        moves.push(\n          Change.childMovedChange(\n            change.childName as string,\n            change.snapshotNode\n          )\n        );\n      }\n    });\n\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_REMOVED,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_ADDED,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_MOVED,\n      moves,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_CHANGED,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.VALUE,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n\n    return events;\n  }\n\n  /**\n   * Given changes of a single change type, generate the corresponding events.\n   *\n   * @param {!Array.<!Event>} events\n   * @param {!string} eventType\n   * @param {!Array.<!Change>} changes\n   * @param {!Array.<!EventRegistration>} registrations\n   * @param {!Node} eventCache\n   * @private\n   */\n  private generateEventsForType_(\n    events: Event[],\n    eventType: string,\n    changes: Change[],\n    registrations: EventRegistration[],\n    eventCache: Node\n  ) {\n    const filteredChanges = changes.filter(change => change.type === eventType);\n\n    filteredChanges.sort(this.compareChanges_.bind(this));\n    filteredChanges.forEach(change => {\n      const materializedChange = this.materializeSingleChange_(\n        change,\n        eventCache\n      );\n      registrations.forEach(registration => {\n        if (registration.respondsTo(change.type)) {\n          events.push(\n            registration.createEvent(materializedChange, this.query_)\n          );\n        }\n      });\n    });\n  }\n\n  /**\n   * @param {!Change} change\n   * @param {!Node} eventCache\n   * @return {!Change}\n   * @private\n   */\n  private materializeSingleChange_(change: Change, eventCache: Node): Change {\n    if (change.type === 'value' || change.type === 'child_removed') {\n      return change;\n    } else {\n      change.prevName = eventCache.getPredecessorChildName(\n        /** @type {!string} */\n        change.childName,\n        change.snapshotNode,\n        this.index_\n      );\n      return change;\n    }\n  }\n\n  /**\n   * @param {!Change} a\n   * @param {!Change} b\n   * @return {number}\n   * @private\n   */\n  private compareChanges_(a: Change, b: Change) {\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 this.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 */\n\nimport { IndexedFilter } from './filter/IndexedFilter';\nimport { ViewProcessor } from './ViewProcessor';\nimport { ChildrenNode } from '../snap/ChildrenNode';\nimport { CacheNode } from './CacheNode';\nimport { ViewCache } from './ViewCache';\nimport { EventGenerator } from './EventGenerator';\nimport { assert } from '@firebase/util';\nimport { Operation, OperationType } from '../operation/Operation';\nimport { Change } from './Change';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { Query } from '../../api/Query';\nimport { EventRegistration } from './EventRegistration';\nimport { Node } from '../snap/Node';\nimport { Path } from '../util/Path';\nimport { WriteTreeRef } from '../WriteTree';\nimport { CancelEvent, Event } from './Event';\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 * @constructor\n */\nexport class View {\n  private processor_: ViewProcessor;\n  private viewCache_: ViewCache;\n  private eventRegistrations_: EventRegistration[] = [];\n  private eventGenerator_: EventGenerator;\n\n  /**\n   *\n   * @param {!Query} query_\n   * @param {!ViewCache} initialViewCache\n   */\n  constructor(private query_: Query, initialViewCache: ViewCache) {\n    const params = this.query_.getQueryParams();\n\n    const indexFilter = new IndexedFilter(params.getIndex());\n    const filter = params.getNodeFilter();\n\n    /**\n     * @type {ViewProcessor}\n     * @private\n     */\n    this.processor_ = new ViewProcessor(filter);\n\n    const initialServerCache = initialViewCache.getServerCache();\n    const initialEventCache = initialViewCache.getEventCache();\n\n    // Don't filter server node with other filter than index, wait for tagged listen\n    const serverSnap = indexFilter.updateFullNode(\n      ChildrenNode.EMPTY_NODE,\n      initialServerCache.getNode(),\n      null\n    );\n    const eventSnap = filter.updateFullNode(\n      ChildrenNode.EMPTY_NODE,\n      initialEventCache.getNode(),\n      null\n    );\n    const newServerCache = new CacheNode(\n      serverSnap,\n      initialServerCache.isFullyInitialized(),\n      indexFilter.filtersNodes()\n    );\n    const newEventCache = new CacheNode(\n      eventSnap,\n      initialEventCache.isFullyInitialized(),\n      filter.filtersNodes()\n    );\n\n    /**\n     * @type {!ViewCache}\n     * @private\n     */\n    this.viewCache_ = new ViewCache(newEventCache, newServerCache);\n\n    /**\n     * @type {!EventGenerator}\n     * @private\n     */\n    this.eventGenerator_ = new EventGenerator(this.query_);\n  }\n\n  /**\n   * @return {!Query}\n   */\n  getQuery(): Query {\n    return this.query_;\n  }\n\n  /**\n   * @return {?Node}\n   */\n  getServerCache(): Node | null {\n    return this.viewCache_.getServerCache().getNode();\n  }\n\n  /**\n   * @param {!Path} path\n   * @return {?Node}\n   */\n  getCompleteServerCache(path: Path): Node | null {\n    const cache = this.viewCache_.getCompleteServerSnap();\n    if (cache) {\n      // If this isn't a \"loadsAllData\" view, then cache isn't actually a complete cache and\n      // we need to see if it contains the child we're interested in.\n      if (\n        this.query_.getQueryParams().loadsAllData() ||\n        (!path.isEmpty() && !cache.getImmediateChild(path.getFront()).isEmpty())\n      ) {\n        return cache.getChild(path);\n      }\n    }\n    return null;\n  }\n\n  /**\n   * @return {boolean}\n   */\n  isEmpty(): boolean {\n    return this.eventRegistrations_.length === 0;\n  }\n\n  /**\n   * @param {!EventRegistration} eventRegistration\n   */\n  addEventRegistration(eventRegistration: EventRegistration) {\n    this.eventRegistrations_.push(eventRegistration);\n  }\n\n  /**\n   * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n   * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n   * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\n   */\n  removeEventRegistration(\n    eventRegistration: EventRegistration | null,\n    cancelError?: Error\n  ): Event[] {\n    const cancelEvents: CancelEvent[] = [];\n    if (cancelError) {\n      assert(\n        eventRegistration == null,\n        'A cancel should cancel all event registrations.'\n      );\n      const path = this.query_.path;\n      this.eventRegistrations_.forEach(registration => {\n        cancelError /** @type {!Error} */ = cancelError;\n        const maybeEvent = registration.createCancelEvent(cancelError, path);\n        if (maybeEvent) {\n          cancelEvents.push(maybeEvent);\n        }\n      });\n    }\n\n    if (eventRegistration) {\n      let remaining = [];\n      for (let i = 0; i < this.eventRegistrations_.length; ++i) {\n        const existing = this.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(this.eventRegistrations_.slice(i + 1));\n          break;\n        }\n      }\n      this.eventRegistrations_ = remaining;\n    } else {\n      this.eventRegistrations_ = [];\n    }\n    return cancelEvents;\n  }\n\n  /**\n   * Applies the given Operation, updates our cache, and returns the appropriate events.\n   *\n   * @param {!Operation} operation\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeServerCache\n   * @return {!Array.<!Event>}\n   */\n  applyOperation(\n    operation: Operation,\n    writesCache: WriteTreeRef,\n    completeServerCache: Node | null\n  ): Event[] {\n    if (\n      operation.type === OperationType.MERGE &&\n      operation.source.queryId !== null\n    ) {\n      assert(\n        this.viewCache_.getCompleteServerSnap(),\n        'We should always have a full cache before handling merges'\n      );\n      assert(\n        this.viewCache_.getCompleteEventSnap(),\n        'Missing event cache, even though we have a server cache'\n      );\n    }\n\n    const oldViewCache = this.viewCache_;\n    const result = this.processor_.applyOperation(\n      oldViewCache,\n      operation,\n      writesCache,\n      completeServerCache\n    );\n    this.processor_.assertIndexed(result.viewCache);\n\n    assert(\n      result.viewCache.getServerCache().isFullyInitialized() ||\n        !oldViewCache.getServerCache().isFullyInitialized(),\n      'Once a server snap is complete, it should never go back'\n    );\n\n    this.viewCache_ = result.viewCache;\n\n    return this.generateEventsForChanges_(\n      result.changes,\n      result.viewCache.getEventCache().getNode(),\n      null\n    );\n  }\n\n  /**\n   * @param {!EventRegistration} registration\n   * @return {!Array.<!Event>}\n   */\n  getInitialEvents(registration: EventRegistration): Event[] {\n    const eventSnap = this.viewCache_.getEventCache();\n    const initialChanges: Change[] = [];\n    if (!eventSnap.getNode().isLeafNode()) {\n      const eventNode = eventSnap.getNode() as ChildrenNode;\n      eventNode.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n        initialChanges.push(Change.childAddedChange(key, childNode));\n      });\n    }\n    if (eventSnap.isFullyInitialized()) {\n      initialChanges.push(Change.valueChange(eventSnap.getNode()));\n    }\n    return this.generateEventsForChanges_(\n      initialChanges,\n      eventSnap.getNode(),\n      registration\n    );\n  }\n\n  /**\n   * @private\n   * @param {!Array.<!Change>} changes\n   * @param {!Node} eventCache\n   * @param {EventRegistration=} eventRegistration\n   * @return {!Array.<!Event>}\n   */\n  generateEventsForChanges_(\n    changes: Change[],\n    eventCache: Node,\n    eventRegistration?: EventRegistration\n  ): Event[] {\n    const registrations = eventRegistration\n      ? [eventRegistration]\n      : this.eventRegistrations_;\n    return this.eventGenerator_.generateEventsForChanges(\n      changes,\n      eventCache,\n      registrations\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CacheNode } from './view/CacheNode';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { assert } from '@firebase/util';\nimport { ViewCache } from './view/ViewCache';\nimport { View } from './view/View';\nimport { Operation } from './operation/Operation';\nimport { WriteTreeRef } from './WriteTree';\nimport { Query } from '../api/Query';\nimport { EventRegistration } from './view/EventRegistration';\nimport { Node } from './snap/Node';\nimport { Path } from './util/Path';\nimport { Event } from './view/Event';\nimport { Reference, ReferenceConstructor } from '../api/Reference';\n\nlet __referenceConstructor: ReferenceConstructor;\n\n/**\n * SyncPoint represents a single location in a SyncTree with 1 or more event registrations, meaning we need to\n * maintain 1 or more Views at this location to cache server data and raise appropriate events for server changes\n * and user writes (set, transaction, update).\n *\n * It's responsible for:\n *  - Maintaining the set of 1 or more views necessary at this location (a SyncPoint with 0 views should be removed).\n *  - Proxying user / server operations to the views as appropriate (i.e. applyServerOverwrite,\n *    applyUserOverwrite, etc.)\n */\nexport class SyncPoint {\n  static set __referenceConstructor(val: ReferenceConstructor) {\n    assert(\n      !__referenceConstructor,\n      '__referenceConstructor has already been defined'\n    );\n    __referenceConstructor = val;\n  }\n\n  static get __referenceConstructor() {\n    assert(__referenceConstructor, 'Reference.ts has not been loaded');\n    return __referenceConstructor;\n  }\n\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  private readonly views: Map<string, View> = new Map();\n\n  isEmpty(): boolean {\n    return this.views.size === 0;\n  }\n\n  applyOperation(\n    operation: Operation,\n    writesCache: WriteTreeRef,\n    optCompleteServerCache: Node | null\n  ): Event[] {\n    const queryId = operation.source.queryId;\n    if (queryId !== null) {\n      const view = this.views.get(queryId);\n      assert(view != null, 'SyncTree gave us an op for an invalid query.');\n      return view.applyOperation(\n        operation,\n        writesCache,\n        optCompleteServerCache\n      );\n    } else {\n      let events: Event[] = [];\n\n      for (const view of this.views.values()) {\n        events = events.concat(\n          view.applyOperation(operation, writesCache, optCompleteServerCache)\n        );\n      }\n\n      return events;\n    }\n  }\n\n  /**\n   * Add an event callback for the specified query.\n   *\n   * @param {!Query} query\n   * @param {!EventRegistration} eventRegistration\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} serverCache Complete server cache, if we have it.\n   * @param {boolean} serverCacheComplete\n   * @return {!Array.<!Event>} Events to raise.\n   */\n  addEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration,\n    writesCache: WriteTreeRef,\n    serverCache: Node | null,\n    serverCacheComplete: boolean\n  ): Event[] {\n    const queryId = query.queryIdentifier();\n    let view = this.views.get(queryId);\n    if (!view) {\n      // TODO: make writesCache take flag for complete server node\n      let eventCache = writesCache.calcCompleteEventCache(\n        serverCacheComplete ? serverCache : null\n      );\n      let eventCacheComplete = false;\n      if (eventCache) {\n        eventCacheComplete = true;\n      } else if (serverCache instanceof ChildrenNode) {\n        eventCache = writesCache.calcCompleteEventChildren(serverCache);\n        eventCacheComplete = false;\n      } else {\n        eventCache = ChildrenNode.EMPTY_NODE;\n        eventCacheComplete = false;\n      }\n      const viewCache = new ViewCache(\n        new CacheNode(\n          /** @type {!Node} */ eventCache,\n          eventCacheComplete,\n          false\n        ),\n        new CacheNode(\n          /** @type {!Node} */ serverCache,\n          serverCacheComplete,\n          false\n        )\n      );\n      view = new View(query, viewCache);\n      this.views.set(queryId, view);\n    }\n\n    // This is guaranteed to exist now, we just created anything that was missing\n    view.addEventRegistration(eventRegistration);\n    return view.getInitialEvents(eventRegistration);\n  }\n\n  /**\n   * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\n   *\n   * If query is the default query, we'll check all views for the specified eventRegistration.\n   * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\n   *\n   * @param {!Query} query\n   * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n   * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n   * @return {{removed:!Array.<!Query>, events:!Array.<!Event>}} removed queries and any cancel events\n   */\n  removeEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration | null,\n    cancelError?: Error\n  ): { removed: Query[]; events: Event[] } {\n    const queryId = query.queryIdentifier();\n    const removed: Query[] = [];\n    let cancelEvents: Event[] = [];\n    const hadCompleteView = this.hasCompleteView();\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 this.views.entries()) {\n        cancelEvents = cancelEvents.concat(\n          view.removeEventRegistration(eventRegistration, cancelError)\n        );\n        if (view.isEmpty()) {\n          this.views.delete(viewQueryId);\n\n          // We'll deal with complete views later.\n          if (\n            !view\n              .getQuery()\n              .getQueryParams()\n              .loadsAllData()\n          ) {\n            removed.push(view.getQuery());\n          }\n        }\n      }\n    } else {\n      // remove the callback from the specific view.\n      const view = this.views.get(queryId);\n      if (view) {\n        cancelEvents = cancelEvents.concat(\n          view.removeEventRegistration(eventRegistration, cancelError)\n        );\n        if (view.isEmpty()) {\n          this.views.delete(queryId);\n\n          // We'll deal with complete views later.\n          if (\n            !view\n              .getQuery()\n              .getQueryParams()\n              .loadsAllData()\n          ) {\n            removed.push(view.getQuery());\n          }\n        }\n      }\n    }\n\n    if (hadCompleteView && !this.hasCompleteView()) {\n      // We removed our last complete view.\n      removed.push(\n        new SyncPoint.__referenceConstructor(query.repo, query.path)\n      );\n    }\n\n    return { removed, events: cancelEvents };\n  }\n\n  getQueryViews(): View[] {\n    const result = [];\n    for (const view of this.views.values()) {\n      if (\n        !view\n          .getQuery()\n          .getQueryParams()\n          .loadsAllData()\n      ) {\n        result.push(view);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * @param path The path to the desired complete snapshot\n   * @return A complete cache, if it exists\n   */\n  getCompleteServerCache(path: Path): Node | null {\n    let serverCache: Node | null = null;\n    for (const view of this.views.values()) {\n      serverCache = serverCache || view.getCompleteServerCache(path);\n    }\n    return serverCache;\n  }\n\n  viewForQuery(query: Query): View | null {\n    const params = query.getQueryParams();\n    if (params.loadsAllData()) {\n      return this.getCompleteView();\n    } else {\n      const queryId = query.queryIdentifier();\n      return this.views.get(queryId);\n    }\n  }\n\n  viewExistsForQuery(query: Query): boolean {\n    return this.viewForQuery(query) != null;\n  }\n\n  hasCompleteView(): boolean {\n    return this.getCompleteView() != null;\n  }\n\n  getCompleteView(): View | null {\n    for (const view of this.views.values()) {\n      if (\n        view\n          .getQuery()\n          .getQueryParams()\n          .loadsAllData()\n      ) {\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 */\n\nimport { ImmutableTree } from './util/ImmutableTree';\nimport { Path } from './util/Path';\nimport { Node, NamedNode } from './snap/Node';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { assert } from '@firebase/util';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { each } from './util/util';\n\n/**\n * This class holds a collection of writes that can be applied to nodes in unison. It abstracts away the logic with\n * dealing with priority writes and multiple nested writes. At any given path there is only allowed to be one write\n * modifying that path. Any write to an existing path or shadowing an existing path will modify that existing write\n * to reflect the write added.\n */\nexport class CompoundWrite {\n  constructor(private writeTree_: ImmutableTree<Node>) {}\n\n  static Empty = new CompoundWrite(new ImmutableTree(null));\n\n  addWrite(path: Path, node: Node): CompoundWrite {\n    if (path.isEmpty()) {\n      return new CompoundWrite(new ImmutableTree(node));\n    } else {\n      const rootmost = this.writeTree_.findRootMostValueAndPath(path);\n      if (rootmost != null) {\n        const rootMostPath = rootmost.path;\n        let value = rootmost.value;\n        const relativePath = Path.relativePath(rootMostPath, path);\n        value = value.updateChild(relativePath, node);\n        return new CompoundWrite(this.writeTree_.set(rootMostPath, value));\n      } else {\n        const subtree = new ImmutableTree(node);\n        const newWriteTree = this.writeTree_.setTree(path, subtree);\n        return new CompoundWrite(newWriteTree);\n      }\n    }\n  }\n\n  addWrites(path: Path, updates: { [name: string]: Node }): CompoundWrite {\n    let newWrite = this as CompoundWrite;\n    each(updates, (childKey: string, node: Node) => {\n      newWrite = newWrite.addWrite(path.child(childKey), node);\n    });\n    return newWrite;\n  }\n\n  /**\n   * Will remove a write at the given path and deeper paths. This will <em>not</em> modify a write at a higher\n   * location, which must be removed by calling this method with that path.\n   *\n   * @param path The path at which a write and all deeper writes should be removed\n   * @return {!CompoundWrite} The new CompoundWrite with the removed path\n   */\n  removeWrite(path: Path): CompoundWrite {\n    if (path.isEmpty()) {\n      return CompoundWrite.Empty;\n    } else {\n      const newWriteTree = this.writeTree_.setTree(path, ImmutableTree.Empty);\n      return new CompoundWrite(newWriteTree);\n    }\n  }\n\n  /**\n   * Returns whether this CompoundWrite will fully overwrite a node at a given location and can therefore be\n   * considered \"complete\".\n   *\n   * @param path The path to check for\n   * @return Whether there is a complete write at that path\n   */\n  hasCompleteWrite(path: Path): boolean {\n    return this.getCompleteNode(path) != null;\n  }\n\n  /**\n   * Returns a node for a path if and only if the node is a \"complete\" overwrite at that path. This will not aggregate\n   * writes from deeper paths, but will return child nodes from a more shallow path.\n   *\n   * @param path The path to get a complete write\n   * @return The node if complete at that path, or null otherwise.\n   */\n  getCompleteNode(path: Path): Node | null {\n    const rootmost = this.writeTree_.findRootMostValueAndPath(path);\n    if (rootmost != null) {\n      return this.writeTree_\n        .get(rootmost.path)\n        .getChild(Path.relativePath(rootmost.path, path));\n    } else {\n      return null;\n    }\n  }\n\n  /**\n   * Returns all children that are guaranteed to be a complete overwrite.\n   *\n   * @return A list of all complete children.\n   */\n  getCompleteChildren(): NamedNode[] {\n    const children: NamedNode[] = [];\n    const node = this.writeTree_.value;\n    if (node != null) {\n      // If it's a leaf node, it has no children; so nothing to do.\n      if (!node.isLeafNode()) {\n        (node as ChildrenNode).forEachChild(\n          PRIORITY_INDEX,\n          (childName, childNode) => {\n            children.push(new NamedNode(childName, childNode));\n          }\n        );\n      }\n    } else {\n      this.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  }\n\n  childCompoundWrite(path: Path): CompoundWrite {\n    if (path.isEmpty()) {\n      return this;\n    } else {\n      const shadowingNode = this.getCompleteNode(path);\n      if (shadowingNode != null) {\n        return new CompoundWrite(new ImmutableTree(shadowingNode));\n      } else {\n        return new CompoundWrite(this.writeTree_.subtree(path));\n      }\n    }\n  }\n\n  /**\n   * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\n   * @return Whether this CompoundWrite is empty\n   */\n  isEmpty(): boolean {\n    return this.writeTree_.isEmpty();\n  }\n\n  /**\n   * Applies this CompoundWrite to a node. The node is returned with all writes from this CompoundWrite applied to the\n   * node\n   * @param node The node to apply this CompoundWrite to\n   * @return The node with all writes applied\n   */\n  apply(node: Node): Node {\n    return applySubtreeWrite(Path.Empty, this.writeTree_, node);\n  }\n}\n\nfunction applySubtreeWrite(\n  relativePath: Path,\n  writeTree: ImmutableTree<Node>,\n  node: Node\n): Node {\n  if (writeTree.value != null) {\n    // Since there a write is always a leaf, we're done here\n    return node.updateChild(relativePath, writeTree.value);\n  } else {\n    let priorityWrite = null;\n    writeTree.children.inorderTraversal((childKey, childTree) => {\n      if (childKey === '.priority') {\n        // Apply priorities at the end so we don't update priorities for either empty nodes or forget\n        // to apply priorities to empty nodes that are later filled\n        assert(\n          childTree.value !== null,\n          'Priority writes must always be leaf nodes'\n        );\n        priorityWrite = childTree.value;\n      } else {\n        node = applySubtreeWrite(relativePath.child(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(relativePath.child('.priority'), priorityWrite);\n    }\n    return node;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { safeGet, assert, assertionError } from '@firebase/util';\n\nimport { Path } from './util/Path';\nimport { CompoundWrite } from './CompoundWrite';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { NamedNode, Node } from './snap/Node';\nimport { CacheNode } from './view/CacheNode';\nimport { Index } from './snap/indexes/Index';\nimport { each } from './util/util';\n\n/**\n * Defines a single user-initiated write operation. May be the result of a set(), transaction(), or update() call. In\n * the case of a set() or transaction, snap wil be non-null.  In the case of an update(), children will be non-null.\n */\nexport interface WriteRecord {\n  writeId: number;\n  path: Path;\n  snap?: Node | null;\n  children?: { [k: string]: Node } | null;\n  visible: boolean;\n}\n\n/**\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\n * and addMerge(), and removed with removeWrite().\n *\n * @constructor\n */\nexport class WriteTree {\n  /**\n   * A tree tracking the result of applying all visible writes.  This does not include transactions with\n   * applyLocally=false or writes that are completely shadowed by other writes.\n   *\n   * @type {!CompoundWrite}\n   * @private\n   */\n  private visibleWrites_: CompoundWrite = CompoundWrite.Empty;\n\n  /**\n   * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\n   * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\n   * used by transactions).\n   *\n   * @type {!Array.<!WriteRecord>}\n   * @private\n   */\n  private allWrites_: WriteRecord[] = [];\n\n  private lastWriteId_ = -1;\n\n  /**\n   * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n   *\n   * @param {!Path} path\n   * @return {!WriteTreeRef}\n   */\n  childWrites(path: Path): WriteTreeRef {\n    return new WriteTreeRef(path, this);\n  }\n\n  /**\n   * Record a new overwrite from user code.\n   *\n   * @param {!Path} path\n   * @param {!Node} snap\n   * @param {!number} writeId\n   * @param {boolean=} visible This is set to false by some transactions. It should be excluded from event caches\n   */\n  addOverwrite(path: Path, snap: Node, writeId: number, visible?: boolean) {\n    assert(\n      writeId > this.lastWriteId_,\n      'Stacking an older write on top of newer ones'\n    );\n    if (visible === undefined) {\n      visible = true;\n    }\n    this.allWrites_.push({\n      path,\n      snap,\n      writeId,\n      visible\n    });\n\n    if (visible) {\n      this.visibleWrites_ = this.visibleWrites_.addWrite(path, snap);\n    }\n    this.lastWriteId_ = writeId;\n  }\n\n  /**\n   * Record a new merge from user code.\n   *\n   * @param {!Path} path\n   * @param {!Object.<string, !Node>} changedChildren\n   * @param {!number} writeId\n   */\n  addMerge(\n    path: Path,\n    changedChildren: { [k: string]: Node },\n    writeId: number\n  ) {\n    assert(\n      writeId > this.lastWriteId_,\n      'Stacking an older merge on top of newer ones'\n    );\n    this.allWrites_.push({\n      path,\n      children: changedChildren,\n      writeId,\n      visible: true\n    });\n\n    this.visibleWrites_ = this.visibleWrites_.addWrites(path, changedChildren);\n    this.lastWriteId_ = writeId;\n  }\n\n  /**\n   * @param {!number} writeId\n   * @return {?WriteRecord}\n   */\n  getWrite(writeId: number): WriteRecord | null {\n    for (let i = 0; i < this.allWrites_.length; i++) {\n      const record = this.allWrites_[i];\n      if (record.writeId === writeId) {\n        return record;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Remove a write (either an overwrite or merge) that has been successfully acknowledge by the server. Recalculates\n   * the tree if necessary.  We return true if it may have been visible, meaning views need to reevaluate.\n   *\n   * @param {!number} writeId\n   * @return {boolean} true if the write may have been visible (meaning we'll need to reevaluate / raise\n   * events as a result).\n   */\n  removeWrite(writeId: number): boolean {\n    // Note: disabling this check. It could be a transaction that preempted another transaction, and thus was applied\n    // out of order.\n    //const validClear = revert || this.allWrites_.length === 0 || writeId <= this.allWrites_[0].writeId;\n    //assert(validClear, \"Either we don't have this write, or it's the first one in the queue\");\n\n    const idx = this.allWrites_.findIndex(s => {\n      return s.writeId === writeId;\n    });\n    assert(idx >= 0, 'removeWrite called with nonexistent writeId.');\n    const writeToRemove = this.allWrites_[idx];\n    this.allWrites_.splice(idx, 1);\n\n    let removedWriteWasVisible = writeToRemove.visible;\n    let removedWriteOverlapsWithOtherWrites = false;\n\n    let i = this.allWrites_.length - 1;\n\n    while (removedWriteWasVisible && i >= 0) {\n      const currentWrite = this.allWrites_[i];\n      if (currentWrite.visible) {\n        if (\n          i >= idx &&\n          this.recordContainsPath_(currentWrite, writeToRemove.path)\n        ) {\n          // The removed write was completely shadowed by a subsequent write.\n          removedWriteWasVisible = false;\n        } else if (writeToRemove.path.contains(currentWrite.path)) {\n          // Either we're covering some writes or they're covering part of us (depending on which came first).\n          removedWriteOverlapsWithOtherWrites = true;\n        }\n      }\n      i--;\n    }\n\n    if (!removedWriteWasVisible) {\n      return false;\n    } else if (removedWriteOverlapsWithOtherWrites) {\n      // There's some shadowing going on. Just rebuild the visible writes from scratch.\n      this.resetTree_();\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        this.visibleWrites_ = this.visibleWrites_.removeWrite(\n          writeToRemove.path\n        );\n      } else {\n        const children = writeToRemove.children;\n        each(children, (childName: string) => {\n          this.visibleWrites_ = this.visibleWrites_.removeWrite(\n            writeToRemove.path.child(childName)\n          );\n        });\n      }\n      return true;\n    }\n  }\n\n  /**\n   * Return a complete snapshot for the given path if there's visible write data at that path, else null.\n   * No server data is considered.\n   *\n   * @param {!Path} path\n   * @return {?Node}\n   */\n  getCompleteWriteData(path: Path): Node | null {\n    return this.visibleWrites_.getCompleteNode(path);\n  }\n\n  /**\n   * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\n   * writes), attempt to calculate a complete snapshot for the given path\n   *\n   * @param {!Path} treePath\n   * @param {?Node} completeServerCache\n   * @param {Array.<number>=} writeIdsToExclude An optional set to be excluded\n   * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n   * @return {?Node}\n   */\n  calcCompleteEventCache(\n    treePath: Path,\n    completeServerCache: Node | null,\n    writeIdsToExclude?: number[],\n    includeHiddenWrites?: boolean\n  ): Node | null {\n    if (!writeIdsToExclude && !includeHiddenWrites) {\n      const shadowingNode = this.visibleWrites_.getCompleteNode(treePath);\n      if (shadowingNode != null) {\n        return shadowingNode;\n      } else {\n        const subMerge = this.visibleWrites_.childCompoundWrite(treePath);\n        if (subMerge.isEmpty()) {\n          return completeServerCache;\n        } else if (\n          completeServerCache == null &&\n          !subMerge.hasCompleteWrite(Path.Empty)\n        ) {\n          // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\n          return null;\n        } else {\n          const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n          return subMerge.apply(layeredCache);\n        }\n      }\n    } else {\n      const merge = this.visibleWrites_.childCompoundWrite(treePath);\n      if (!includeHiddenWrites && merge.isEmpty()) {\n        return completeServerCache;\n      } else {\n        // If the server cache is null, and we don't have a complete cache, we need to return null\n        if (\n          !includeHiddenWrites &&\n          completeServerCache == null &&\n          !merge.hasCompleteWrite(Path.Empty)\n        ) {\n          return null;\n        } else {\n          const filter = function(write: WriteRecord) {\n            return (\n              (write.visible || includeHiddenWrites) &&\n              (!writeIdsToExclude ||\n                !~writeIdsToExclude.indexOf(write.writeId)) &&\n              (write.path.contains(treePath) || treePath.contains(write.path))\n            );\n          };\n          const mergeAtPath = WriteTree.layerTree_(\n            this.allWrites_,\n            filter,\n            treePath\n          );\n          const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n          return mergeAtPath.apply(layeredCache);\n        }\n      }\n    }\n  }\n\n  /**\n   * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\n   * Used when creating new views, to pre-fill their complete event children snapshot.\n   *\n   * @param {!Path} treePath\n   * @param {?ChildrenNode} completeServerChildren\n   * @return {!ChildrenNode}\n   */\n  calcCompleteEventChildren(\n    treePath: Path,\n    completeServerChildren: ChildrenNode | null\n  ) {\n    let completeChildren = ChildrenNode.EMPTY_NODE as Node;\n    const topLevelSet = this.visibleWrites_.getCompleteNode(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(\n            childName,\n            childSnap\n          );\n        });\n      }\n      return completeChildren;\n    } else if (completeServerChildren) {\n      // Layer any children we have on top of this\n      // We know we don't have a top-level set, so just enumerate existing children\n      const merge = this.visibleWrites_.childCompoundWrite(treePath);\n      completeServerChildren.forEachChild(\n        PRIORITY_INDEX,\n        (childName, childNode) => {\n          const node = merge\n            .childCompoundWrite(new Path(childName))\n            .apply(childNode);\n          completeChildren = completeChildren.updateImmediateChild(\n            childName,\n            node\n          );\n        }\n      );\n      // Add any complete children we have from the set\n      merge.getCompleteChildren().forEach(namedNode => {\n        completeChildren = completeChildren.updateImmediateChild(\n          namedNode.name,\n          namedNode.node\n        );\n      });\n      return completeChildren;\n    } else {\n      // We don't have anything to layer on top of. Layer on any children we have\n      // Note that we can return an empty snap if we have a defined delete\n      const merge = this.visibleWrites_.childCompoundWrite(treePath);\n      merge.getCompleteChildren().forEach(namedNode => {\n        completeChildren = completeChildren.updateImmediateChild(\n          namedNode.name,\n          namedNode.node\n        );\n      });\n      return completeChildren;\n    }\n  }\n\n  /**\n   * Given that the underlying server data has updated, determine what, if anything, needs to be\n   * applied to the event cache.\n   *\n   * Possibilities:\n   *\n   * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n   *\n   * 2. Some write is completely shadowing. No events to be raised\n   *\n   * 3. Is partially shadowed. Events\n   *\n   * Either existingEventSnap or existingServerSnap must exist\n   *\n   * @param {!Path} treePath\n   * @param {!Path} childPath\n   * @param {?Node} existingEventSnap\n   * @param {?Node} existingServerSnap\n   * @return {?Node}\n   */\n  calcEventCacheAfterServerOverwrite(\n    treePath: Path,\n    childPath: Path,\n    existingEventSnap: Node | null,\n    existingServerSnap: Node | null\n  ): Node | null {\n    assert(\n      existingEventSnap || existingServerSnap,\n      'Either existingEventSnap or existingServerSnap must exist'\n    );\n    const path = treePath.child(childPath);\n    if (this.visibleWrites_.hasCompleteWrite(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 = this.visibleWrites_.childCompoundWrite(path);\n      if (childMerge.isEmpty()) {\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 childMerge.apply(existingServerSnap.getChild(childPath));\n      }\n    }\n  }\n\n  /**\n   * Returns a complete child for a given server snap after applying all user writes or null if there is no\n   * complete child for this ChildKey.\n   *\n   * @param {!Path} treePath\n   * @param {!string} childKey\n   * @param {!CacheNode} existingServerSnap\n   * @return {?Node}\n   */\n  calcCompleteChild(\n    treePath: Path,\n    childKey: string,\n    existingServerSnap: CacheNode\n  ): Node | null {\n    const path = treePath.child(childKey);\n    const shadowingNode = this.visibleWrites_.getCompleteNode(path);\n    if (shadowingNode != null) {\n      return shadowingNode;\n    } else {\n      if (existingServerSnap.isCompleteForChild(childKey)) {\n        const childMerge = this.visibleWrites_.childCompoundWrite(path);\n        return childMerge.apply(\n          existingServerSnap.getNode().getImmediateChild(childKey)\n        );\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n   * a higher path, this will return the child of that write relative to the write and this path.\n   * Returns null if there is no write at this path.\n   */\n  shadowingWrite(path: Path): Node | null {\n    return this.visibleWrites_.getCompleteNode(path);\n  }\n\n  /**\n   * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n   * the window, but may now be in the window.\n   */\n  calcIndexedSlice(\n    treePath: Path,\n    completeServerData: Node | null,\n    startPost: NamedNode,\n    count: number,\n    reverse: boolean,\n    index: Index\n  ): NamedNode[] {\n    let toIterate: Node;\n    const merge = this.visibleWrites_.childCompoundWrite(treePath);\n    const shadowingNode = merge.getCompleteNode(Path.Empty);\n    if (shadowingNode != null) {\n      toIterate = shadowingNode;\n    } else if (completeServerData != null) {\n      toIterate = merge.apply(completeServerData);\n    } else {\n      // no children to iterate on\n      return [];\n    }\n    toIterate = toIterate.withIndex(index);\n    if (!toIterate.isEmpty() && !toIterate.isLeafNode()) {\n      const nodes = [];\n      const cmp = index.getCompare();\n      const iter = reverse\n        ? (toIterate as ChildrenNode).getReverseIteratorFrom(startPost, index)\n        : (toIterate as ChildrenNode).getIteratorFrom(startPost, index);\n      let next = iter.getNext();\n      while (next && nodes.length < count) {\n        if (cmp(next, startPost) !== 0) {\n          nodes.push(next);\n        }\n        next = iter.getNext();\n      }\n      return nodes;\n    } else {\n      return [];\n    }\n  }\n\n  private recordContainsPath_(writeRecord: WriteRecord, path: Path): boolean {\n    if (writeRecord.snap) {\n      return writeRecord.path.contains(path);\n    } else {\n      for (const childName in writeRecord.children) {\n        if (\n          writeRecord.children.hasOwnProperty(childName) &&\n          writeRecord.path.child(childName).contains(path)\n        ) {\n          return true;\n        }\n      }\n      return false;\n    }\n  }\n\n  /**\n   * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n   */\n  private resetTree_() {\n    this.visibleWrites_ = WriteTree.layerTree_(\n      this.allWrites_,\n      WriteTree.DefaultFilter_,\n      Path.Empty\n    );\n    if (this.allWrites_.length > 0) {\n      this.lastWriteId_ = this.allWrites_[this.allWrites_.length - 1].writeId;\n    } else {\n      this.lastWriteId_ = -1;\n    }\n  }\n\n  /**\n   * The default filter used when constructing the tree. Keep everything that's visible.\n   */\n  private static DefaultFilter_(write: WriteRecord) {\n    return write.visible;\n  }\n\n  /**\n   * Static method. Given an array of WriteRecords, a filter for which ones to include, and a path, construct the tree of\n   * event data at that path.\n   */\n  private static layerTree_(\n    writes: WriteRecord[],\n    filter: (w: WriteRecord) => boolean,\n    treeRoot: Path\n  ): CompoundWrite {\n    let compoundWrite = CompoundWrite.Empty;\n    for (let i = 0; i < writes.length; ++i) {\n      const write = writes[i];\n      // Theory, a later set will either:\n      // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\n      // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\n      if (filter(write)) {\n        const writePath = write.path;\n        let relativePath;\n        if (write.snap) {\n          if (treeRoot.contains(writePath)) {\n            relativePath = Path.relativePath(treeRoot, writePath);\n            compoundWrite = compoundWrite.addWrite(relativePath, write.snap);\n          } else if (writePath.contains(treeRoot)) {\n            relativePath = Path.relativePath(writePath, treeRoot);\n            compoundWrite = compoundWrite.addWrite(\n              Path.Empty,\n              write.snap.getChild(relativePath)\n            );\n          } else {\n            // There is no overlap between root path and write path, ignore write\n          }\n        } else if (write.children) {\n          if (treeRoot.contains(writePath)) {\n            relativePath = Path.relativePath(treeRoot, writePath);\n            compoundWrite = compoundWrite.addWrites(\n              relativePath,\n              write.children\n            );\n          } else if (writePath.contains(treeRoot)) {\n            relativePath = Path.relativePath(writePath, treeRoot);\n            if (relativePath.isEmpty()) {\n              compoundWrite = compoundWrite.addWrites(\n                Path.Empty,\n                write.children\n              );\n            } else {\n              const child = safeGet(write.children, relativePath.getFront());\n              if (child) {\n                // There exists a child in this node that matches the root path\n                const deepNode = child.getChild(relativePath.popFront());\n                compoundWrite = compoundWrite.addWrite(Path.Empty, deepNode);\n              }\n            }\n          } else {\n            // There is no overlap between root path and write path, ignore write\n          }\n        } else {\n          throw assertionError('WriteRecord should have .snap or .children');\n        }\n      }\n    }\n    return compoundWrite;\n  }\n}\n\n/**\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\n * just proxy to the underlying WriteTree.\n *\n * @constructor\n */\nexport class WriteTreeRef {\n  /**\n   * The path to this particular write tree ref. Used for calling methods on writeTree_ while exposing a simpler\n   * interface to callers.\n   *\n   * @type {!Path}\n   * @private\n   * @const\n   */\n  private readonly treePath_: Path;\n\n  /**\n   * * A reference to the actual tree of write data. All methods are pass-through to the tree, but with the appropriate\n   * path prefixed.\n   *\n   * This lets us make cheap references to points in the tree for sync points without having to copy and maintain all of\n   * the data.\n   *\n   * @type {!WriteTree}\n   * @private\n   * @const\n   */\n  private readonly writeTree_: WriteTree;\n\n  /**\n   * @param {!Path} path\n   * @param {!WriteTree} writeTree\n   */\n  constructor(path: Path, writeTree: WriteTree) {\n    this.treePath_ = path;\n    this.writeTree_ = writeTree;\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 {?Node} completeServerCache\n   * @param {Array.<number>=} writeIdsToExclude Optional writes to exclude.\n   * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n   * @return {?Node}\n   */\n  calcCompleteEventCache(\n    completeServerCache: Node | null,\n    writeIdsToExclude?: number[],\n    includeHiddenWrites?: boolean\n  ): Node | null {\n    return this.writeTree_.calcCompleteEventCache(\n      this.treePath_,\n      completeServerCache,\n      writeIdsToExclude,\n      includeHiddenWrites\n    );\n  }\n\n  /**\n   * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\n   * mix of the given server data and write data.\n   *\n   * @param {?ChildrenNode} completeServerChildren\n   * @return {!ChildrenNode}\n   */\n  calcCompleteEventChildren(\n    completeServerChildren: ChildrenNode | null\n  ): ChildrenNode {\n    return this.writeTree_.calcCompleteEventChildren(\n      this.treePath_,\n      completeServerChildren\n    ) as ChildrenNode;\n  }\n\n  /**\n   * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\n   * if anything, needs to be applied to the event cache.\n   *\n   * Possibilities:\n   *\n   * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n   *\n   * 2. Some write is completely shadowing. No events to be raised\n   *\n   * 3. Is partially shadowed. Events should be raised\n   *\n   * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\n   *\n   * @param {!Path} path\n   * @param {?Node} existingEventSnap\n   * @param {?Node} existingServerSnap\n   * @return {?Node}\n   */\n  calcEventCacheAfterServerOverwrite(\n    path: Path,\n    existingEventSnap: Node | null,\n    existingServerSnap: Node | null\n  ): Node | null {\n    return this.writeTree_.calcEventCacheAfterServerOverwrite(\n      this.treePath_,\n      path,\n      existingEventSnap,\n      existingServerSnap\n    );\n  }\n\n  /**\n   * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n   * a higher path, this will return the child of that write relative to the write and this path.\n   * Returns null if there is no write at this path.\n   *\n   * @param {!Path} path\n   * @return {?Node}\n   */\n  shadowingWrite(path: Path): Node | null {\n    return this.writeTree_.shadowingWrite(this.treePath_.child(path));\n  }\n\n  /**\n   * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n   * the window, but may now be in the window\n   *\n   * @param {?Node} completeServerData\n   * @param {!NamedNode} startPost\n   * @param {!number} count\n   * @param {boolean} reverse\n   * @param {!Index} index\n   * @return {!Array.<!NamedNode>}\n   */\n  calcIndexedSlice(\n    completeServerData: Node | null,\n    startPost: NamedNode,\n    count: number,\n    reverse: boolean,\n    index: Index\n  ): NamedNode[] {\n    return this.writeTree_.calcIndexedSlice(\n      this.treePath_,\n      completeServerData,\n      startPost,\n      count,\n      reverse,\n      index\n    );\n  }\n\n  /**\n   * Returns a complete child for a given server snap after applying all user writes or null if there is no\n   * complete child for this ChildKey.\n   *\n   * @param {!string} childKey\n   * @param {!CacheNode} existingServerCache\n   * @return {?Node}\n   */\n  calcCompleteChild(\n    childKey: string,\n    existingServerCache: CacheNode\n  ): Node | null {\n    return this.writeTree_.calcCompleteChild(\n      this.treePath_,\n      childKey,\n      existingServerCache\n    );\n  }\n\n  /**\n   * Return a WriteTreeRef for a child.\n   *\n   * @param {string} childName\n   * @return {!WriteTreeRef}\n   */\n  child(childName: string): WriteTreeRef {\n    return new WriteTreeRef(this.treePath_.child(childName), this.writeTree_);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\nimport { errorForServerCode, each } from './util/util';\nimport { AckUserWrite } from './operation/AckUserWrite';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { ImmutableTree } from './util/ImmutableTree';\nimport { ListenComplete } from './operation/ListenComplete';\nimport { Merge } from './operation/Merge';\nimport { Operation, OperationSource } from './operation/Operation';\nimport { Overwrite } from './operation/Overwrite';\nimport { Path } from './util/Path';\nimport { SyncPoint } from './SyncPoint';\nimport { WriteTree, WriteTreeRef } from './WriteTree';\nimport { Query } from '../api/Query';\nimport { Node } from './snap/Node';\nimport { Event } from './view/Event';\nimport { EventRegistration } from './view/EventRegistration';\nimport { View } from './view/View';\n\n/**\n * @typedef {{\n *   startListening: function(\n *     !Query,\n *     ?number,\n *     function():string,\n *     function(!string, *):!Array.<!Event>\n *   ):!Array.<!Event>,\n *\n *   stopListening: function(!Query, ?number)\n * }}\n */\nexport interface ListenProvider {\n  startListening(\n    query: Query,\n    tag: number | null,\n    hashFn: () => string,\n    onComplete: (a: string, b?: unknown) => Event[]\n  ): Event[];\n\n  stopListening(a: Query, b: number | null): void;\n}\n\n/**\n * SyncTree is the central class for managing event callback registration, data caching, views\n * (query processing), and event generation.  There are typically two SyncTree instances for\n * each Repo, one for the normal Firebase data, and one for the .info data.\n *\n * It has a number of responsibilities, including:\n *  - Tracking all user event callbacks (registered via addEventRegistration() and removeEventRegistration()).\n *  - Applying and caching data changes for user set(), transaction(), and update() calls\n *    (applyUserOverwrite(), applyUserMerge()).\n *  - Applying and caching data changes for server data changes (applyServerOverwrite(),\n *    applyServerMerge()).\n *  - Generating user-facing events for server and user changes (all of the apply* methods\n *    return the set of events that need to be raised as a result).\n *  - Maintaining the appropriate set of server listens to ensure we are always subscribed\n *    to the correct set of paths and queries to satisfy the current set of user event\n *    callbacks (listens are started/stopped using the provided listenProvider).\n *\n * NOTE: Although SyncTree tracks event callbacks and calculates events to raise, the actual\n * events are returned to the caller rather than raised synchronously.\n *\n * @constructor\n */\nexport class SyncTree {\n  /**\n   * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\n   */\n  private syncPointTree_: ImmutableTree<SyncPoint> = ImmutableTree.Empty;\n\n  /**\n   * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n   */\n  private pendingWriteTree_ = new WriteTree();\n\n  private readonly tagToQueryMap: Map<number, string> = new Map();\n  private readonly queryToTagMap: Map<string, number> = new Map();\n\n  /**\n   * @param {!ListenProvider} listenProvider_ Used by SyncTree to start / stop listening\n   *   to server data.\n   */\n  constructor(private listenProvider_: ListenProvider) {}\n\n  /**\n   * Apply the data changes for a user-generated set() or transaction() call.\n   *\n   * @return Events to raise.\n   */\n  applyUserOverwrite(\n    path: Path,\n    newData: Node,\n    writeId: number,\n    visible?: boolean\n  ): Event[] {\n    // Record pending write.\n    this.pendingWriteTree_.addOverwrite(path, newData, writeId, visible);\n\n    if (!visible) {\n      return [];\n    } else {\n      return this.applyOperationToSyncPoints_(\n        new Overwrite(OperationSource.User, path, newData)\n      );\n    }\n  }\n\n  /**\n   * Apply the data from a user-generated update() call\n   *\n   * @return Events to raise.\n   */\n  applyUserMerge(\n    path: Path,\n    changedChildren: { [k: string]: Node },\n    writeId: number\n  ): Event[] {\n    // Record pending merge.\n    this.pendingWriteTree_.addMerge(path, changedChildren, writeId);\n\n    const changeTree = ImmutableTree.fromObject(changedChildren);\n\n    return this.applyOperationToSyncPoints_(\n      new Merge(OperationSource.User, path, changeTree)\n    );\n  }\n\n  /**\n   * Acknowledge a pending user write that was previously registered with applyUserOverwrite() or applyUserMerge().\n   *\n   * @param revert True if the given write failed and needs to be reverted\n   * @return Events to raise.\n   */\n  ackUserWrite(writeId: number, revert: boolean = false) {\n    const write = this.pendingWriteTree_.getWrite(writeId);\n    const needToReevaluate = this.pendingWriteTree_.removeWrite(writeId);\n    if (!needToReevaluate) {\n      return [];\n    } else {\n      let affectedTree = ImmutableTree.Empty;\n      if (write.snap != null) {\n        // overwrite\n        affectedTree = affectedTree.set(Path.Empty, true);\n      } else {\n        each(write.children, (pathString: string, node: Node) => {\n          affectedTree = affectedTree.set(new Path(pathString), node);\n        });\n      }\n      return this.applyOperationToSyncPoints_(\n        new AckUserWrite(write.path, affectedTree, revert)\n      );\n    }\n  }\n\n  /**\n   * Apply new server data for the specified path..\n   *\n   * @return Events to raise.\n   */\n  applyServerOverwrite(path: Path, newData: Node): Event[] {\n    return this.applyOperationToSyncPoints_(\n      new Overwrite(OperationSource.Server, path, newData)\n    );\n  }\n\n  /**\n   * Apply new server data to be merged in at the specified path.\n   *\n   * @return Events to raise.\n   */\n  applyServerMerge(\n    path: Path,\n    changedChildren: { [k: string]: Node }\n  ): Event[] {\n    const changeTree = ImmutableTree.fromObject(changedChildren);\n\n    return this.applyOperationToSyncPoints_(\n      new Merge(OperationSource.Server, path, changeTree)\n    );\n  }\n\n  /**\n   * Apply a listen complete for a query\n   *\n   * @return Events to raise.\n   */\n  applyListenComplete(path: Path): Event[] {\n    return this.applyOperationToSyncPoints_(\n      new ListenComplete(OperationSource.Server, path)\n    );\n  }\n\n  /**\n   * Apply new server data for the specified tagged query.\n   *\n   * @return Events to raise.\n   */\n  applyTaggedQueryOverwrite(path: Path, snap: Node, tag: number): Event[] {\n    const queryKey = this.queryKeyForTag_(tag);\n    if (queryKey != null) {\n      const r = SyncTree.parseQueryKey_(queryKey);\n      const queryPath = r.path,\n        queryId = r.queryId;\n      const relativePath = Path.relativePath(queryPath, path);\n      const op = new Overwrite(\n        OperationSource.forServerTaggedQuery(queryId),\n        relativePath,\n        snap\n      );\n      return this.applyTaggedOperation_(queryPath, op);\n    } else {\n      // Query must have been removed already\n      return [];\n    }\n  }\n\n  /**\n   * Apply server data to be merged in for the specified tagged query.\n   *\n   * @return Events to raise.\n   */\n  applyTaggedQueryMerge(\n    path: Path,\n    changedChildren: { [k: string]: Node },\n    tag: number\n  ): Event[] {\n    const queryKey = this.queryKeyForTag_(tag);\n    if (queryKey) {\n      const r = SyncTree.parseQueryKey_(queryKey);\n      const queryPath = r.path,\n        queryId = r.queryId;\n      const relativePath = Path.relativePath(queryPath, path);\n      const changeTree = ImmutableTree.fromObject(changedChildren);\n      const op = new Merge(\n        OperationSource.forServerTaggedQuery(queryId),\n        relativePath,\n        changeTree\n      );\n      return this.applyTaggedOperation_(queryPath, op);\n    } else {\n      // We've already removed the query. No big deal, ignore the update\n      return [];\n    }\n  }\n\n  /**\n   * Apply a listen complete for a tagged query\n   *\n   * @return Events to raise.\n   */\n  applyTaggedListenComplete(path: Path, tag: number): Event[] {\n    const queryKey = this.queryKeyForTag_(tag);\n    if (queryKey) {\n      const r = SyncTree.parseQueryKey_(queryKey);\n      const queryPath = r.path,\n        queryId = r.queryId;\n      const relativePath = Path.relativePath(queryPath, path);\n      const op = new ListenComplete(\n        OperationSource.forServerTaggedQuery(queryId),\n        relativePath\n      );\n      return this.applyTaggedOperation_(queryPath, op);\n    } else {\n      // We've already removed the query. No big deal, ignore the update\n      return [];\n    }\n  }\n\n  /**\n   * Add an event callback for the specified query.\n   *\n   * @return Events to raise.\n   */\n  addEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration\n  ): Event[] {\n    const path = query.path;\n\n    let serverCache: Node | null = null;\n    let foundAncestorDefaultView = false;\n    // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\n    // Consider optimizing this once there's a better understanding of what actual behavior will be.\n    this.syncPointTree_.foreachOnPath(path, (pathToSyncPoint, sp) => {\n      const relativePath = Path.relativePath(pathToSyncPoint, path);\n      serverCache = serverCache || sp.getCompleteServerCache(relativePath);\n      foundAncestorDefaultView =\n        foundAncestorDefaultView || sp.hasCompleteView();\n    });\n    let syncPoint = this.syncPointTree_.get(path);\n    if (!syncPoint) {\n      syncPoint = new SyncPoint();\n      this.syncPointTree_ = this.syncPointTree_.set(path, syncPoint);\n    } else {\n      foundAncestorDefaultView =\n        foundAncestorDefaultView || syncPoint.hasCompleteView();\n      serverCache = serverCache || syncPoint.getCompleteServerCache(Path.Empty);\n    }\n\n    let serverCacheComplete;\n    if (serverCache != null) {\n      serverCacheComplete = true;\n    } else {\n      serverCacheComplete = false;\n      serverCache = ChildrenNode.EMPTY_NODE;\n      const subtree = this.syncPointTree_.subtree(path);\n      subtree.foreachChild((childName, childSyncPoint) => {\n        const completeCache = childSyncPoint.getCompleteServerCache(Path.Empty);\n        if (completeCache) {\n          serverCache = serverCache.updateImmediateChild(\n            childName,\n            completeCache\n          );\n        }\n      });\n    }\n\n    const viewAlreadyExists = syncPoint.viewExistsForQuery(query);\n    if (!viewAlreadyExists && !query.getQueryParams().loadsAllData()) {\n      // We need to track a tag for this query\n      const queryKey = SyncTree.makeQueryKey_(query);\n      assert(\n        !this.queryToTagMap.has(queryKey),\n        'View does not exist, but we have a tag'\n      );\n      const tag = SyncTree.getNextQueryTag_();\n      this.queryToTagMap.set(queryKey, tag);\n      this.tagToQueryMap.set(tag, queryKey);\n    }\n    const writesCache = this.pendingWriteTree_.childWrites(path);\n    let events = syncPoint.addEventRegistration(\n      query,\n      eventRegistration,\n      writesCache,\n      serverCache,\n      serverCacheComplete\n    );\n    if (!viewAlreadyExists && !foundAncestorDefaultView) {\n      const view /** @type !View */ = syncPoint.viewForQuery(query);\n      events = events.concat(this.setupListener_(query, view));\n    }\n    return events;\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   * @return Cancel events, if cancelError was provided.\n   */\n  removeEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration | null,\n    cancelError?: Error\n  ): Event[] {\n    // Find the syncPoint first. Then deal with whether or not it has matching listeners\n    const path = query.path;\n    const maybeSyncPoint = this.syncPointTree_.get(path);\n    let cancelEvents: Event[] = [];\n    // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\n    // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\n    // not loadsAllData().\n    if (\n      maybeSyncPoint &&\n      (query.queryIdentifier() === 'default' ||\n        maybeSyncPoint.viewExistsForQuery(query))\n    ) {\n      /**\n       * @type {{removed: !Array.<!Query>, events: !Array.<!Event>}}\n       */\n      const removedAndEvents = maybeSyncPoint.removeEventRegistration(\n        query,\n        eventRegistration,\n        cancelError\n      );\n      if (maybeSyncPoint.isEmpty()) {\n        this.syncPointTree_ = this.syncPointTree_.remove(path);\n      }\n      const removed = removedAndEvents.removed;\n      cancelEvents = removedAndEvents.events;\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 =\n        -1 !==\n        removed.findIndex(query => {\n          return query.getQueryParams().loadsAllData();\n        });\n      const covered = this.syncPointTree_.findOnPath(\n        path,\n        (relativePath, parentSyncPoint) => {\n          return parentSyncPoint.hasCompleteView();\n        }\n      );\n\n      if (removingDefault && !covered) {\n        const subtree = this.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 = this.collectDistinctViewsForSubTree_(subtree);\n\n          // Ok, we've collected all the listens we need. Set them up.\n          for (let i = 0; i < newViews.length; ++i) {\n            const view = newViews[i],\n              newQuery = view.getQuery();\n            const listener = this.createListenerForView_(view);\n            this.listenProvider_.startListening(\n              SyncTree.queryForListening_(newQuery),\n              this.tagForQuery_(newQuery),\n              listener.hashFn,\n              listener.onComplete\n            );\n          }\n        } else {\n          // There's nothing below us, so nothing we need to start listening on\n        }\n      }\n      // If we removed anything and we're not covered by a higher up listen, we need to stop listening on this query\n      // The above block has us covered in terms of making sure we're set up on listens lower in the tree.\n      // Also, note that if we have a cancelError, it's already been removed at the provider level.\n      if (!covered && removed.length > 0 && !cancelError) {\n        // If we removed a default, then we weren't listening on any of the other queries here. Just cancel the one\n        // default. Otherwise, we need to iterate through and cancel each individual query\n        if (removingDefault) {\n          // We don't tag default listeners\n          const defaultTag: number | null = null;\n          this.listenProvider_.stopListening(\n            SyncTree.queryForListening_(query),\n            defaultTag\n          );\n        } else {\n          removed.forEach((queryToRemove: Query) => {\n            const tagToRemove = this.queryToTagMap.get(\n              SyncTree.makeQueryKey_(queryToRemove)\n            );\n            this.listenProvider_.stopListening(\n              SyncTree.queryForListening_(queryToRemove),\n              tagToRemove\n            );\n          });\n        }\n      }\n      // Now, clear all of the tags we're tracking for the removed listens\n      this.removeTags_(removed);\n    } else {\n      // No-op, this listener must've been already removed\n    }\n    return cancelEvents;\n  }\n\n  /**\n   * Returns a complete cache, if we have one, of the data at a particular path. If the location does not have a\n   * listener above it, we will get a false \"null\". This shouldn't be a problem because transactions will always\n   * have a listener above, and atomic operations would correctly show a jitter of <increment value> ->\n   *     <incremented total> as the write is applied locally and then acknowledged at the server.\n   *\n   * Note: this method will *include* hidden writes from transaction with applyLocally set to false.\n   *\n   * @param path The path to the data we want\n   * @param writeIdsToExclude A specific set to be excluded\n   */\n  calcCompleteEventCache(path: Path, writeIdsToExclude?: number[]): Node {\n    const includeHiddenSets = true;\n    const writeTree = this.pendingWriteTree_;\n    const serverCache = this.syncPointTree_.findOnPath(\n      path,\n      (pathSoFar, syncPoint) => {\n        const relativePath = Path.relativePath(pathSoFar, path);\n        const serverCache = syncPoint.getCompleteServerCache(relativePath);\n        if (serverCache) {\n          return serverCache;\n        }\n      }\n    );\n    return writeTree.calcCompleteEventCache(\n      path,\n      serverCache,\n      writeIdsToExclude,\n      includeHiddenSets\n    );\n  }\n\n  /**\n   * This collapses multiple unfiltered views into a single view, since we only need a single\n   * listener for them.\n   */\n  private collectDistinctViewsForSubTree_(\n    subtree: ImmutableTree<SyncPoint>\n  ): View[] {\n    return subtree.fold<View[]>(\n      (relativePath, maybeChildSyncPoint, childMap) => {\n        if (maybeChildSyncPoint && maybeChildSyncPoint.hasCompleteView()) {\n          const completeView = maybeChildSyncPoint.getCompleteView();\n          return [completeView];\n        } else {\n          // No complete view here, flatten any deeper listens into an array\n          let views: View[] = [];\n          if (maybeChildSyncPoint) {\n            views = maybeChildSyncPoint.getQueryViews();\n          }\n          each(childMap, (_key: string, childViews: View[]) => {\n            views = views.concat(childViews);\n          });\n          return views;\n        }\n      }\n    );\n  }\n\n  private removeTags_(queries: Query[]) {\n    for (let j = 0; j < queries.length; ++j) {\n      const removedQuery = queries[j];\n      if (!removedQuery.getQueryParams().loadsAllData()) {\n        // We should have a tag for this\n        const removedQueryKey = SyncTree.makeQueryKey_(removedQuery);\n        const removedQueryTag = this.queryToTagMap.get(removedQueryKey);\n        this.queryToTagMap.delete(removedQueryKey);\n        this.tagToQueryMap.delete(removedQueryTag);\n      }\n    }\n  }\n\n  /**\n   * Normalizes a query to a query we send the server for listening\n   *\n   * @return The normalized query\n   */\n  private static queryForListening_(query: Query): Query {\n    if (\n      query.getQueryParams().loadsAllData() &&\n      !query.getQueryParams().isDefault()\n    ) {\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 query.getRef()!;\n    } else {\n      return query;\n    }\n  }\n\n  /**\n   * For a given new listen, manage the de-duplication of outstanding subscriptions.\n   *\n   * @return This method can return events to support synchronous data sources\n   */\n  private setupListener_(query: Query, view: View): Event[] {\n    const path = query.path;\n    const tag = this.tagForQuery_(query);\n    const listener = this.createListenerForView_(view);\n\n    const events = this.listenProvider_.startListening(\n      SyncTree.queryForListening_(query),\n      tag,\n      listener.hashFn,\n      listener.onComplete\n    );\n\n    const subtree = this.syncPointTree_.subtree(path);\n    // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\n    // may need to shadow other listens as well.\n    if (tag) {\n      assert(\n        !subtree.value.hasCompleteView(),\n        \"If we're adding a query, it shouldn't be shadowed\"\n      );\n    } else {\n      // Shadow everything at or below this location, this is a default listener.\n      const queriesToStop = subtree.fold<Query[]>(\n        (relativePath, maybeChildSyncPoint, childMap) => {\n          if (\n            !relativePath.isEmpty() &&\n            maybeChildSyncPoint &&\n            maybeChildSyncPoint.hasCompleteView()\n          ) {\n            return [maybeChildSyncPoint.getCompleteView().getQuery()];\n          } else {\n            // No default listener here, flatten any deeper queries into an array\n            let queries: Query[] = [];\n            if (maybeChildSyncPoint) {\n              queries = queries.concat(\n                maybeChildSyncPoint.getQueryViews().map(view => view.getQuery())\n              );\n            }\n            each(childMap, (_key: string, childQueries: Query[]) => {\n              queries = queries.concat(childQueries);\n            });\n            return queries;\n          }\n        }\n      );\n      for (let i = 0; i < queriesToStop.length; ++i) {\n        const queryToStop = queriesToStop[i];\n        this.listenProvider_.stopListening(\n          SyncTree.queryForListening_(queryToStop),\n          this.tagForQuery_(queryToStop)\n        );\n      }\n    }\n    return events;\n  }\n\n  private createListenerForView_(\n    view: View\n  ): { hashFn(): string; onComplete(a: string, b?: unknown): Event[] } {\n    const query = view.getQuery();\n    const tag = this.tagForQuery_(query);\n\n    return {\n      hashFn: () => {\n        const cache = view.getServerCache() || ChildrenNode.EMPTY_NODE;\n        return cache.hash();\n      },\n      onComplete: (status: string): Event[] => {\n        if (status === 'ok') {\n          if (tag) {\n            return this.applyTaggedListenComplete(query.path, tag);\n          } else {\n            return this.applyListenComplete(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 this.removeEventRegistration(\n            query,\n            /*eventRegistration*/ null,\n            error\n          );\n        }\n      }\n    };\n  }\n\n  /**\n   * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\n   */\n  private static makeQueryKey_(query: Query): string {\n    return query.path.toString() + '$' + query.queryIdentifier();\n  }\n\n  /**\n   * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\n   */\n  private static parseQueryKey_(\n    queryKey: string\n  ): { queryId: string; path: Path } {\n    const splitIndex = queryKey.indexOf('$');\n    assert(\n      splitIndex !== -1 && splitIndex < queryKey.length - 1,\n      'Bad queryKey.'\n    );\n    return {\n      queryId: queryKey.substr(splitIndex + 1),\n      path: new Path(queryKey.substr(0, splitIndex))\n    };\n  }\n\n  /**\n   * Return the query associated with the given tag, if we have one\n   */\n  private queryKeyForTag_(tag: number): string | null {\n    return this.tagToQueryMap.get(tag);\n  }\n\n  /**\n   * Return the tag associated with the given query.\n   */\n  private tagForQuery_(query: Query): number | null {\n    const queryKey = SyncTree.makeQueryKey_(query);\n    return this.queryToTagMap.get(queryKey);\n  }\n\n  /**\n   * Static tracker for next query tag.\n   */\n  private static nextQueryTag_ = 1;\n\n  /**\n   * Static accessor for query tags.\n   */\n  private static getNextQueryTag_(): number {\n    return SyncTree.nextQueryTag_++;\n  }\n\n  /**\n   * A helper method to apply tagged operations\n   */\n  private applyTaggedOperation_(\n    queryPath: Path,\n    operation: Operation\n  ): Event[] {\n    const syncPoint = this.syncPointTree_.get(queryPath);\n    assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\n    const writesCache = this.pendingWriteTree_.childWrites(queryPath);\n    return syncPoint.applyOperation(\n      operation,\n      writesCache,\n      /*serverCache=*/ null\n    );\n  }\n\n  /**\n   * A helper method that visits all descendant and ancestor SyncPoints, applying the operation.\n   *\n   * NOTES:\n   * - Descendant SyncPoints will be visited first (since we raise events depth-first).\n   *\n   * - We call applyOperation() on each SyncPoint passing three things:\n   *   1. A version of the Operation that has been made relative to the SyncPoint location.\n   *   2. A WriteTreeRef of any writes we have cached at the SyncPoint location.\n   *   3. A snapshot Node with cached server data, if we have it.\n   *\n   * - We concatenate all of the events returned by each SyncPoint and return the result.\n   */\n  private applyOperationToSyncPoints_(operation: Operation): Event[] {\n    return this.applyOperationHelper_(\n      operation,\n      this.syncPointTree_,\n      /*serverCache=*/ null,\n      this.pendingWriteTree_.childWrites(Path.Empty)\n    );\n  }\n\n  /**\n   * Recursive helper for applyOperationToSyncPoints_\n   */\n  private applyOperationHelper_(\n    operation: Operation,\n    syncPointTree: ImmutableTree<SyncPoint>,\n    serverCache: Node | null,\n    writesCache: WriteTreeRef\n  ): Event[] {\n    if (operation.path.isEmpty()) {\n      return this.applyOperationDescendantsHelper_(\n        operation,\n        syncPointTree,\n        serverCache,\n        writesCache\n      );\n    } else {\n      const syncPoint = syncPointTree.get(Path.Empty);\n\n      // If we don't have cached server data, see if we can get it from this SyncPoint.\n      if (serverCache == null && syncPoint != null) {\n        serverCache = syncPoint.getCompleteServerCache(Path.Empty);\n      }\n\n      let events: Event[] = [];\n      const childName = operation.path.getFront();\n      const childOperation = operation.operationForChild(childName);\n      const childTree = syncPointTree.children.get(childName);\n      if (childTree && childOperation) {\n        const childServerCache = serverCache\n          ? serverCache.getImmediateChild(childName)\n          : null;\n        const childWritesCache = writesCache.child(childName);\n        events = events.concat(\n          this.applyOperationHelper_(\n            childOperation,\n            childTree,\n            childServerCache,\n            childWritesCache\n          )\n        );\n      }\n\n      if (syncPoint) {\n        events = events.concat(\n          syncPoint.applyOperation(operation, writesCache, serverCache)\n        );\n      }\n\n      return events;\n    }\n  }\n\n  /**\n   * Recursive helper for applyOperationToSyncPoints_\n   */\n  private applyOperationDescendantsHelper_(\n    operation: Operation,\n    syncPointTree: ImmutableTree<SyncPoint>,\n    serverCache: Node | null,\n    writesCache: WriteTreeRef\n  ): Event[] {\n    const syncPoint = syncPointTree.get(Path.Empty);\n\n    // If we don't have cached server data, see if we can get it from this SyncPoint.\n    if (serverCache == null && syncPoint != null) {\n      serverCache = syncPoint.getCompleteServerCache(Path.Empty);\n    }\n\n    let events: Event[] = [];\n    syncPointTree.children.inorderTraversal((childName, childTree) => {\n      const childServerCache = serverCache\n        ? serverCache.getImmediateChild(childName)\n        : null;\n      const childWritesCache = writesCache.child(childName);\n      const childOperation = operation.operationForChild(childName);\n      if (childOperation) {\n        events = events.concat(\n          this.applyOperationDescendantsHelper_(\n            childOperation,\n            childTree,\n            childServerCache,\n            childWritesCache\n          )\n        );\n      }\n    });\n\n    if (syncPoint) {\n      events = events.concat(\n        syncPoint.applyOperation(operation, writesCache, serverCache)\n      );\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 */\n\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Path } from './util/Path';\nimport { Node } from './snap/Node';\n\n/**\n * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\n *\n * @constructor\n */\nexport class SnapshotHolder {\n  private rootNode_: Node = ChildrenNode.EMPTY_NODE;\n\n  getNode(path: Path): Node {\n    return this.rootNode_.getChild(path);\n  }\n\n  updateSnapshot(path: Path, newSnapshotNode: Node) {\n    this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseAuthTokenData } from '@firebase/app-types/private';\nimport {\n  FirebaseAuthInternal,\n  FirebaseAuthInternalName\n} from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\nimport { log, warn } from './util/util';\nimport { FirebaseApp } from '@firebase/app-types';\n\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nexport class AuthTokenProvider {\n  private auth_: FirebaseAuthInternal | null = null;\n  constructor(\n    private app_: FirebaseApp,\n    private authProvider_: Provider<FirebaseAuthInternalName>\n  ) {\n    this.auth_ = authProvider_.getImmediate({ optional: true });\n    if (!this.auth_) {\n      authProvider_.get().then(auth => (this.auth_ = auth));\n    }\n  }\n\n  /**\n   * @param {boolean} forceRefresh\n   * @return {!Promise<FirebaseAuthTokenData>}\n   */\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\n    if (!this.auth_) {\n      return Promise.resolve(null);\n    }\n\n    return this.auth_.getToken(forceRefresh).catch(error => {\n      // TODO: Need to figure out all the cases this is raised and whether\n      // this makes sense.\n      if (error && error.code === 'auth/token-not-initialized') {\n        log('Got auth/token-not-initialized error.  Treating as null token.');\n        return null;\n      } else {\n        return Promise.reject(error);\n      }\n    });\n  }\n\n  addTokenChangeListener(listener: (token: string | null) => void) {\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      setTimeout(() => listener(null), 0);\n      this.authProvider_\n        .get()\n        .then(auth => auth.addAuthTokenListener(listener));\n    }\n  }\n\n  removeTokenChangeListener(listener: (token: string | null) => void) {\n    this.authProvider_\n      .get()\n      .then(auth => auth.removeAuthTokenListener(listener));\n  }\n\n  notifyForInvalidToken() {\n    let errorMessage =\n      'Provided authentication credentials for the app named \"' +\n      this.app_.name +\n      '\" are invalid. This usually indicates your app was not ' +\n      'initialized correctly. ';\n    if ('credential' in this.app_.options) {\n      errorMessage +=\n        'Make sure the \"credential\" property provided to initializeApp() ' +\n        'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n        'project.';\n    } else if ('serviceAccount' in this.app_.options) {\n      errorMessage +=\n        'Make sure the \"serviceAccount\" property provided to initializeApp() ' +\n        'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n        'project.';\n    } else {\n      errorMessage +=\n        'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' +\n        'initializeApp() match the values provided for your app at ' +\n        'https://console.firebase.google.com/.';\n    }\n    warn(errorMessage);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { deepCopy, contains } from '@firebase/util';\n\n/**\n * Tracks a collection of stats.\n *\n * @constructor\n */\nexport class StatsCollection {\n  private counters_: { [k: string]: number } = {};\n\n  incrementCounter(name: string, amount: number = 1) {\n    if (!contains(this.counters_, name)) {\n      this.counters_[name] = 0;\n    }\n\n    this.counters_[name] += amount;\n  }\n\n  get() {\n    return deepCopy(this.counters_);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { StatsCollection } from './StatsCollection';\nimport { RepoInfo } from '../RepoInfo';\n\nexport class StatsManager {\n  private static collections_: { [k: string]: StatsCollection } = {};\n  private static reporters_: { [k: string]: unknown } = {};\n\n  static getCollection(repoInfo: RepoInfo): StatsCollection {\n    const hashString = repoInfo.toString();\n\n    if (!this.collections_[hashString]) {\n      this.collections_[hashString] = new StatsCollection();\n    }\n\n    return this.collections_[hashString];\n  }\n\n  static getOrCreateReporter<T>(\n    repoInfo: RepoInfo,\n    creatorFunction: () => T\n  ): T {\n    const hashString = repoInfo.toString();\n\n    if (!this.reporters_[hashString]) {\n      this.reporters_[hashString] = creatorFunction();\n    }\n\n    return this.reporters_[hashString] as T;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { StatsCollection } from './StatsCollection';\nimport { each } from '../util/util';\n\n/**\n * Returns the delta from the previous call to get stats.\n *\n * @param collection_ The collection to \"listen\" to.\n * @constructor\n */\nexport class StatsListener {\n  private last_: { [k: string]: number } | null = null;\n\n  constructor(private collection_: StatsCollection) {}\n\n  get(): { [k: string]: number } {\n    const newStats = this.collection_.get();\n\n    const delta = { ...newStats };\n    if (this.last_) {\n      each(this.last_, (stat: string, value: number) => {\n        delta[stat] = delta[stat] - value;\n      });\n    }\n    this.last_ = newStats;\n\n    return delta;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { contains } from '@firebase/util';\nimport { setTimeoutNonBlocking, each } from '../util/util';\nimport { StatsListener } from './StatsListener';\nimport { StatsCollection } from './StatsCollection';\nimport { ServerActions } from '../ServerActions';\n\n// Assuming some apps may have a short amount of time on page, and a bulk of firebase operations probably\n// happen on page load, we try to report our first set of stats pretty quickly, but we wait at least 10\n// seconds to try to ensure the Firebase connection is established / settled.\nconst FIRST_STATS_MIN_TIME = 10 * 1000;\nconst FIRST_STATS_MAX_TIME = 30 * 1000;\n\n// We'll continue to report stats on average every 5 minutes.\nconst REPORT_STATS_INTERVAL = 5 * 60 * 1000;\n\n/**\n * @constructor\n */\nexport class StatsReporter {\n  private statsListener_: StatsListener;\n  private statsToReport_: { [k: string]: boolean } = {};\n\n  /**\n   * @param collection\n   * @param server_\n   */\n  constructor(collection: StatsCollection, private server_: ServerActions) {\n    this.statsListener_ = new StatsListener(collection);\n\n    const timeout =\n      FIRST_STATS_MIN_TIME +\n      (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\n    setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\n  }\n\n  includeStat(stat: string) {\n    this.statsToReport_[stat] = true;\n  }\n\n  private reportStats_() {\n    const stats = this.statsListener_.get();\n    const reportedStats: typeof stats = {};\n    let haveStatsToReport = false;\n\n    each(stats, (stat: string, value: number) => {\n      if (value > 0 && contains(this.statsToReport_, stat)) {\n        reportedStats[stat] = value;\n        haveStatsToReport = true;\n      }\n    });\n\n    if (haveStatsToReport) {\n      this.server_.reportStats(reportedStats);\n    }\n\n    // queue our next run.\n    setTimeoutNonBlocking(\n      this.reportStats_.bind(this),\n      Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL)\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Path } from '../util/Path';\nimport { log, logger, exceptionGuard } from '../util/util';\nimport { Event } from './Event';\n\n/**\n * The event queue serves a few purposes:\n * 1. It ensures we maintain event order in the face of event callbacks doing operations that result in more\n *    events being queued.\n * 2. raiseQueuedEvents() handles being called reentrantly nicely.  That is, if in the course of raising events,\n *    raiseQueuedEvents() is called again, the \"inner\" call will pick up raising events where the \"outer\" call\n *    left off, ensuring that the events are still raised synchronously and in order.\n * 3. You can use raiseEventsAtPath and raiseEventsForChangedPath to ensure only relevant previously-queued\n *    events are raised synchronously.\n *\n * NOTE: This can all go away if/when we move to async events.\n *\n * @constructor\n */\nexport class EventQueue {\n  /**\n   * @private\n   * @type {!Array.<EventList>}\n   */\n  private eventLists_: EventList[] = [];\n\n  /**\n   * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n   * @private\n   * @type {!number}\n   */\n  private recursionDepth_ = 0;\n\n  /**\n   * @param {!Array.<Event>} eventDataList The new events to queue.\n   */\n  queueEvents(eventDataList: Event[]) {\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 eventData = eventDataList[i];\n      const eventPath = eventData.getPath();\n      if (currList !== null && !eventPath.equals(currList.getPath())) {\n        this.eventLists_.push(currList);\n        currList = null;\n      }\n\n      if (currList === null) {\n        currList = new EventList(eventPath);\n      }\n\n      currList.add(eventData);\n    }\n    if (currList) {\n      this.eventLists_.push(currList);\n    }\n  }\n\n  /**\n   * Queues the specified events and synchronously raises all events (including previously queued ones)\n   * for the specified path.\n   *\n   * It is assumed that the new events are all for the specified path.\n   *\n   * @param {!Path} path The path to raise events for.\n   * @param {!Array.<Event>} eventDataList The new events to raise.\n   */\n  raiseEventsAtPath(path: Path, eventDataList: Event[]) {\n    this.queueEvents(eventDataList);\n    this.raiseQueuedEventsMatchingPredicate_((eventPath: Path) =>\n      eventPath.equals(path)\n    );\n  }\n\n  /**\n   * Queues the specified events and synchronously raises all events (including previously queued ones) for\n   * locations related to the specified change path (i.e. all ancestors and descendants).\n   *\n   * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\n   *\n   * @param {!Path} changedPath The path to raise events for.\n   * @param {!Array.<!Event>} eventDataList The events to raise\n   */\n  raiseEventsForChangedPath(changedPath: Path, eventDataList: Event[]) {\n    this.queueEvents(eventDataList);\n\n    this.raiseQueuedEventsMatchingPredicate_((eventPath: Path) => {\n      return eventPath.contains(changedPath) || changedPath.contains(eventPath);\n    });\n  }\n\n  /**\n   * @param {!function(!Path):boolean} predicate\n   * @private\n   */\n  private raiseQueuedEventsMatchingPredicate_(\n    predicate: (path: Path) => boolean\n  ) {\n    this.recursionDepth_++;\n\n    let sentAll = true;\n    for (let i = 0; i < this.eventLists_.length; i++) {\n      const eventList = this.eventLists_[i];\n      if (eventList) {\n        const eventPath = eventList.getPath();\n        if (predicate(eventPath)) {\n          this.eventLists_[i].raise();\n          this.eventLists_[i] = null;\n        } else {\n          sentAll = false;\n        }\n      }\n    }\n\n    if (sentAll) {\n      this.eventLists_ = [];\n    }\n\n    this.recursionDepth_--;\n  }\n}\n\n/**\n * @param {!Path} path\n * @constructor\n */\nexport class EventList {\n  /**\n   * @type {!Array.<Event>}\n   * @private\n   */\n  private events_: Event[] = [];\n\n  constructor(private readonly path_: Path) {}\n\n  /**\n   * @param {!Event} eventData\n   */\n  add(eventData: Event) {\n    this.events_.push(eventData);\n  }\n\n  /**\n   * Iterates through the list and raises each event\n   */\n  raise() {\n    for (let i = 0; i < this.events_.length; i++) {\n      const eventData = this.events_[i];\n      if (eventData !== null) {\n        this.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   * @return {!Path}\n   */\n  getPath(): Path {\n    return this.path_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from '@firebase/util';\n\n/**\n * Base class to be used if you want to emit events. Call the constructor with\n * the set of allowed event names.\n */\nexport abstract class EventEmitter {\n  private listeners_: {\n    [eventType: string]: Array<{\n      callback(...args: unknown[]): void;\n      context: unknown;\n    }>;\n  } = {};\n\n  /**\n   * @param {!Array.<string>} allowedEvents_\n   */\n  constructor(private allowedEvents_: string[]) {\n    assert(\n      Array.isArray(allowedEvents_) && allowedEvents_.length > 0,\n      'Requires a non-empty array'\n    );\n  }\n\n  /**\n   * To be overridden by derived classes in order to fire an initial event when\n   * somebody subscribes for data.\n   *\n   * @param {!string} eventType\n   * @return {Array.<*>} Array of parameters to trigger initial event with.\n   */\n  abstract getInitialEvent(eventType: string): unknown[];\n\n  /**\n   * To be called by derived classes to trigger events.\n   * @param {!string} eventType\n   * @param {...*} varArgs\n   */\n  protected trigger(eventType: string, ...varArgs: unknown[]) {\n    if (Array.isArray(this.listeners_[eventType])) {\n      // Clone the list, since callbacks could add/remove listeners.\n      const listeners = [...this.listeners_[eventType]];\n\n      for (let i = 0; i < listeners.length; i++) {\n        listeners[i].callback.apply(listeners[i].context, varArgs);\n      }\n    }\n  }\n\n  on(eventType: string, callback: (a: unknown) => void, context: unknown) {\n    this.validateEventType_(eventType);\n    this.listeners_[eventType] = this.listeners_[eventType] || [];\n    this.listeners_[eventType].push({ callback, context });\n\n    const eventData = this.getInitialEvent(eventType);\n    if (eventData) {\n      callback.apply(context, eventData);\n    }\n  }\n\n  off(eventType: string, callback: (a: unknown) => void, context: unknown) {\n    this.validateEventType_(eventType);\n    const listeners = this.listeners_[eventType] || [];\n    for (let i = 0; i < listeners.length; i++) {\n      if (\n        listeners[i].callback === callback &&\n        (!context || context === listeners[i].context)\n      ) {\n        listeners.splice(i, 1);\n        return;\n      }\n    }\n  }\n\n  private validateEventType_(eventType: string) {\n    assert(\n      this.allowedEvents_.find(et => {\n        return et === eventType;\n      }),\n      'Unknown event: ' + eventType\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { EventEmitter } from './EventEmitter';\nimport { assert } from '@firebase/util';\n\ndeclare const document: Document;\n\n/**\n * @extends {EventEmitter}\n */\nexport class VisibilityMonitor extends EventEmitter {\n  private visible_: boolean;\n\n  static getInstance() {\n    return new VisibilityMonitor();\n  }\n\n  constructor() {\n    super(['visible']);\n    let hidden: string;\n    let visibilityChange: string;\n    if (\n      typeof document !== 'undefined' &&\n      typeof document.addEventListener !== 'undefined'\n    ) {\n      if (typeof document['hidden'] !== 'undefined') {\n        // Opera 12.10 and Firefox 18 and later support\n        visibilityChange = 'visibilitychange';\n        hidden = 'hidden';\n      } else if (typeof document['mozHidden'] !== 'undefined') {\n        visibilityChange = 'mozvisibilitychange';\n        hidden = 'mozHidden';\n      } else if (typeof document['msHidden'] !== 'undefined') {\n        visibilityChange = 'msvisibilitychange';\n        hidden = 'msHidden';\n      } else if (typeof document['webkitHidden'] !== 'undefined') {\n        visibilityChange = 'webkitvisibilitychange';\n        hidden = 'webkitHidden';\n      }\n    }\n\n    // Initially, we always assume we are visible. This ensures that in browsers\n    // without page visibility support or in cases where we are never visible\n    // (e.g. chrome extension), we act as if we are visible, i.e. don't delay\n    // reconnects\n    this.visible_ = true;\n\n    if (visibilityChange) {\n      document.addEventListener(\n        visibilityChange,\n        () => {\n          const visible = !document[hidden];\n          if (visible !== this.visible_) {\n            this.visible_ = visible;\n            this.trigger('visible', visible);\n          }\n        },\n        false\n      );\n    }\n  }\n\n  /**\n   * @param {!string} eventType\n   * @return {Array.<boolean>}\n   */\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n    return [this.visible_];\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, isMobileCordova } from '@firebase/util';\nimport { EventEmitter } from './EventEmitter';\n\n/**\n * Monitors online state (as reported by window.online/offline events).\n *\n * The expectation is that this could have many false positives (thinks we are online\n * when we're not), but no false negatives.  So we can safely use it to determine when\n * we definitely cannot reach the internet.\n *\n * @extends {EventEmitter}\n */\nexport class OnlineMonitor extends EventEmitter {\n  private online_ = true;\n\n  static getInstance() {\n    return new OnlineMonitor();\n  }\n\n  constructor() {\n    super(['online']);\n\n    // We've had repeated complaints that Cordova apps can get stuck \"offline\", e.g.\n    // https://forum.ionicframework.com/t/firebase-connection-is-lost-and-never-come-back/43810\n    // It would seem that the 'online' event does not always fire consistently. So we disable it\n    // for Cordova.\n    if (\n      typeof window !== 'undefined' &&\n      typeof window.addEventListener !== 'undefined' &&\n      !isMobileCordova()\n    ) {\n      window.addEventListener(\n        'online',\n        () => {\n          if (!this.online_) {\n            this.online_ = true;\n            this.trigger('online', true);\n          }\n        },\n        false\n      );\n\n      window.addEventListener(\n        'offline',\n        () => {\n          if (this.online_) {\n            this.online_ = false;\n            this.trigger('online', false);\n          }\n        },\n        false\n      );\n    }\n  }\n\n  /**\n   * @param {!string} eventType\n   * @return {Array.<boolean>}\n   */\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'online', 'Unknown event type: ' + eventType);\n    return [this.online_];\n  }\n\n  /**\n   * @return {boolean}\n   */\n  currentlyOnline(): boolean {\n    return this.online_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { exceptionGuard } from '../../core/util/util';\n\n/**\n * This class ensures the packets from the server arrive in order\n * This class takes data from the server and ensures it gets passed into the callbacks in order.\n * @constructor\n */\nexport class PacketReceiver {\n  pendingResponses: unknown[] = [];\n  currentResponseNum = 0;\n  closeAfterResponse = -1;\n  onClose: (() => void) | null = null;\n\n  /**\n   * @param onMessage_\n   */\n  constructor(private onMessage_: (a: {}) => void) {}\n\n  closeAfter(responseNum: number, callback: () => void) {\n    this.closeAfterResponse = responseNum;\n    this.onClose = callback;\n    if (this.closeAfterResponse < this.currentResponseNum) {\n      this.onClose();\n      this.onClose = null;\n    }\n  }\n\n  /**\n   * Each message from the server comes with a response number, and an array of data. The responseNumber\n   * allows us to ensure that we process them in the right order, since we can't be guaranteed that all\n   * browsers will respond in the same order as the requests we sent\n   * @param {number} requestNum\n   * @param {Array} data\n   */\n  handleResponse(requestNum: number, data: unknown[]) {\n    this.pendingResponses[requestNum] = data;\n    while (this.pendingResponses[this.currentResponseNum]) {\n      const toProcess = this.pendingResponses[\n        this.currentResponseNum\n      ] as unknown[];\n      delete this.pendingResponses[this.currentResponseNum];\n      for (let i = 0; i < toProcess.length; ++i) {\n        if (toProcess[i]) {\n          exceptionGuard(() => {\n            this.onMessage_(toProcess[i]);\n          });\n        }\n      }\n      if (this.currentResponseNum === this.closeAfterResponse) {\n        if (this.onClose) {\n          this.onClose();\n          this.onClose = null;\n        }\n        break;\n      }\n      this.currentResponseNum++;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  executeWhenDOMReady,\n  isChromeExtensionContentScript,\n  isWindowsStoreApp,\n  log,\n  logWrapper,\n  LUIDGenerator,\n  splitStringBySize\n} from '../core/util/util';\nimport { StatsManager } from '../core/stats/StatsManager';\nimport { PacketReceiver } from './polling/PacketReceiver';\nimport {\n  FORGE_DOMAIN,\n  FORGE_REF,\n  LAST_SESSION_PARAM,\n  LONG_POLLING,\n  PROTOCOL_VERSION,\n  REFERER_PARAM,\n  TRANSPORT_SESSION_PARAM,\n  VERSION_PARAM\n} from './Constants';\nimport { base64Encode, stringify, isNodeSdk } from '@firebase/util';\n\nimport { Transport } from './Transport';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { StatsCollection } from '../core/stats/StatsCollection';\n\n// URL query parameters associated with longpolling\nexport const FIREBASE_LONGPOLL_START_PARAM = 'start';\nexport const FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\nexport const FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\nexport const FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\nexport const FIREBASE_LONGPOLL_ID_PARAM = 'id';\nexport const FIREBASE_LONGPOLL_PW_PARAM = 'pw';\nexport const FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\nexport const FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\nexport const FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\nexport const FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\nexport const FIREBASE_LONGPOLL_DATA_PARAM = 'd';\nexport const FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM = 'disconn';\nexport const FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\n\n//Data size constants.\n//TODO: Perf: the maximum length actually differs from browser to browser.\n// We should check what browser we're on and set accordingly.\nconst MAX_URL_DATA_SIZE = 1870;\nconst SEG_HEADER_SIZE = 30; //ie: &seg=8299234&ts=982389123&d=\nconst MAX_PAYLOAD_SIZE = MAX_URL_DATA_SIZE - SEG_HEADER_SIZE;\n\n/**\n * Keepalive period\n * send a fresh request at minimum every 25 seconds. Opera has a maximum request\n * length of 30 seconds that we can't exceed.\n * @const\n * @type {number}\n */\nconst KEEPALIVE_REQUEST_INTERVAL = 25000;\n\n/**\n * How long to wait before aborting a long-polling connection attempt.\n * @const\n * @type {number}\n */\nconst LP_CONNECT_TIMEOUT = 30000;\n\n/**\n * This class manages a single long-polling connection.\n *\n * @constructor\n * @implements {Transport}\n */\nexport class BrowserPollConnection implements Transport {\n  bytesSent = 0;\n  bytesReceived = 0;\n  urlFn: (params: object) => string;\n  scriptTagHolder: FirebaseIFrameScriptHolder;\n  myDisconnFrame: HTMLIFrameElement;\n  curSegmentNum: number;\n  myPacketOrderer: PacketReceiver;\n  id: string;\n  password: string;\n  private log_: (...a: unknown[]) => void;\n  private stats_: StatsCollection;\n  private everConnected_ = false;\n  private isClosed_: boolean;\n  private connectTimeoutTimer_: number | null;\n  private onDisconnect_: ((a?: boolean) => void) | null;\n\n  /**\n   * @param {string} connId An identifier for this connection, used for logging\n   * @param {RepoInfo} repoInfo The info for the endpoint to send data to.\n   * @param {string=} transportSessionId Optional transportSessionid if we are reconnecting for an existing\n   *                                         transport session\n   * @param {string=}  lastSessionId Optional lastSessionId if the PersistentConnection has already created a\n   *                                     connection previously\n   */\n  constructor(\n    public connId: string,\n    public repoInfo: RepoInfo,\n    public transportSessionId?: string,\n    public lastSessionId?: string\n  ) {\n    this.log_ = logWrapper(connId);\n    this.stats_ = StatsManager.getCollection(repoInfo);\n    this.urlFn = (params: { [k: string]: string }) =>\n      repoInfo.connectionURL(LONG_POLLING, params);\n  }\n\n  /**\n   *\n   * @param {function(Object)} onMessage Callback when messages arrive\n   * @param {function()} onDisconnect Callback with connection lost.\n   */\n  open(onMessage: (msg: {}) => void, onDisconnect: (a?: boolean) => void) {\n    this.curSegmentNum = 0;\n    this.onDisconnect_ = onDisconnect;\n    this.myPacketOrderer = new PacketReceiver(onMessage);\n    this.isClosed_ = false;\n\n    this.connectTimeoutTimer_ = setTimeout(() => {\n      this.log_('Timed out trying to connect.');\n      // Make sure we clear the host cache\n      this.onClosed_();\n      this.connectTimeoutTimer_ = null;\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(LP_CONNECT_TIMEOUT)) as any;\n\n    // Ensure we delay the creation of the iframe until the DOM is loaded.\n    executeWhenDOMReady(() => {\n      if (this.isClosed_) {\n        return;\n      }\n\n      //Set up a callback that gets triggered once a connection is set up.\n      this.scriptTagHolder = new FirebaseIFrameScriptHolder(\n        (...args) => {\n          const [command, arg1, arg2, arg3, arg4] = args;\n          this.incrementIncomingBytes_(args);\n          if (!this.scriptTagHolder) {\n            return; // we closed the connection.\n          }\n\n          if (this.connectTimeoutTimer_) {\n            clearTimeout(this.connectTimeoutTimer_);\n            this.connectTimeoutTimer_ = null;\n          }\n          this.everConnected_ = true;\n          if (command === FIREBASE_LONGPOLL_START_PARAM) {\n            this.id = arg1 as string;\n            this.password = arg2 as string;\n          } else if (command === FIREBASE_LONGPOLL_CLOSE_COMMAND) {\n            // Don't clear the host cache. We got a response from the server, so we know it's reachable\n            if (arg1) {\n              // We aren't expecting any more data (other than what the server's already in the process of sending us\n              // through our already open polls), so don't send any more.\n              this.scriptTagHolder.sendNewPolls = false;\n\n              // arg1 in this case is the last response number sent by the server. We should try to receive\n              // all of the responses up to this one before closing\n              this.myPacketOrderer.closeAfter(arg1 as number, () => {\n                this.onClosed_();\n              });\n            } else {\n              this.onClosed_();\n            }\n          } else {\n            throw new Error('Unrecognized command received: ' + command);\n          }\n        },\n        (...args) => {\n          const [pN, data] = args;\n          this.incrementIncomingBytes_(args);\n          this.myPacketOrderer.handleResponse(pN as number, data as unknown[]);\n        },\n        () => {\n          this.onClosed_();\n        },\n        this.urlFn\n      );\n\n      //Send the initial request to connect. The serial number is simply to keep the browser from pulling previous results\n      //from cache.\n      const urlParams: { [k: string]: string | number } = {};\n      urlParams[FIREBASE_LONGPOLL_START_PARAM] = 't';\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(\n        Math.random() * 100000000\n      );\n      if (this.scriptTagHolder.uniqueCallbackIdentifier) {\n        urlParams[\n          FIREBASE_LONGPOLL_CALLBACK_ID_PARAM\n        ] = this.scriptTagHolder.uniqueCallbackIdentifier;\n      }\n      urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n      if (this.transportSessionId) {\n        urlParams[TRANSPORT_SESSION_PARAM] = this.transportSessionId;\n      }\n      if (this.lastSessionId) {\n        urlParams[LAST_SESSION_PARAM] = this.lastSessionId;\n      }\n      if (\n        typeof location !== 'undefined' &&\n        location.href &&\n        location.href.indexOf(FORGE_DOMAIN) !== -1\n      ) {\n        urlParams[REFERER_PARAM] = FORGE_REF;\n      }\n      const connectURL = this.urlFn(urlParams);\n      this.log_('Connecting via long-poll to ' + connectURL);\n      this.scriptTagHolder.addTag(connectURL, () => {\n        /* do nothing */\n      });\n    });\n  }\n\n  /**\n   * Call this when a handshake has completed successfully and we want to consider the connection established\n   */\n  start() {\n    this.scriptTagHolder.startLongPoll(this.id, this.password);\n    this.addDisconnectPingFrame(this.id, this.password);\n  }\n\n  private static forceAllow_: boolean;\n\n  /**\n   * Forces long polling to be considered as a potential transport\n   */\n  static forceAllow() {\n    BrowserPollConnection.forceAllow_ = true;\n  }\n\n  private static forceDisallow_: boolean;\n\n  /**\n   * Forces longpolling to not be considered as a potential transport\n   */\n  static forceDisallow() {\n    BrowserPollConnection.forceDisallow_ = true;\n  }\n\n  // Static method, use string literal so it can be accessed in a generic way\n  static isAvailable() {\n    if (isNodeSdk()) {\n      return false;\n    } else if (BrowserPollConnection.forceAllow_) {\n      return true;\n    } else {\n      // NOTE: In React-Native there's normally no 'document', but if you debug a React-Native app in\n      // the Chrome debugger, 'document' is defined, but document.createElement is null (2015/06/08).\n      return (\n        !BrowserPollConnection.forceDisallow_ &&\n        typeof document !== 'undefined' &&\n        document.createElement != null &&\n        !isChromeExtensionContentScript() &&\n        !isWindowsStoreApp()\n      );\n    }\n  }\n\n  /**\n   * No-op for polling\n   */\n  markConnectionHealthy() {}\n\n  /**\n   * Stops polling and cleans up the iframe\n   * @private\n   */\n  private shutdown_() {\n    this.isClosed_ = true;\n\n    if (this.scriptTagHolder) {\n      this.scriptTagHolder.close();\n      this.scriptTagHolder = null;\n    }\n\n    //remove the disconnect frame, which will trigger an XHR call to the server to tell it we're leaving.\n    if (this.myDisconnFrame) {\n      document.body.removeChild(this.myDisconnFrame);\n      this.myDisconnFrame = null;\n    }\n\n    if (this.connectTimeoutTimer_) {\n      clearTimeout(this.connectTimeoutTimer_);\n      this.connectTimeoutTimer_ = null;\n    }\n  }\n\n  /**\n   * Triggered when this transport is closed\n   * @private\n   */\n  private onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is closing itself');\n      this.shutdown_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_(this.everConnected_);\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  /**\n   * External-facing close handler. RealTime has requested we shut down. Kill our connection and tell the server\n   * that we've left.\n   */\n  close() {\n    if (!this.isClosed_) {\n      this.log_('Longpoll is being closed.');\n      this.shutdown_();\n    }\n  }\n\n  /**\n   * Send the JSON object down to the server. It will need to be stringified, base64 encoded, and then\n   * broken into chunks (since URLs have a small maximum length).\n   * @param {!Object} data The JSON data to transmit.\n   */\n  send(data: {}) {\n    const dataStr = stringify(data);\n    this.bytesSent += dataStr.length;\n    this.stats_.incrementCounter('bytes_sent', dataStr.length);\n\n    //first, lets get the base64-encoded data\n    const base64data = base64Encode(dataStr);\n\n    //We can only fit a certain amount in each URL, so we need to split this request\n    //up into multiple pieces if it doesn't fit in one request.\n    const dataSegs = splitStringBySize(base64data, MAX_PAYLOAD_SIZE);\n\n    //Enqueue each segment for transmission. We assign each chunk a sequential ID and a total number\n    //of segments so that we can reassemble the packet on the server.\n    for (let i = 0; i < dataSegs.length; i++) {\n      this.scriptTagHolder.enqueueSegment(\n        this.curSegmentNum,\n        dataSegs.length,\n        dataSegs[i]\n      );\n      this.curSegmentNum++;\n    }\n  }\n\n  /**\n   * This is how we notify the server that we're leaving.\n   * We aren't able to send requests with DHTML on a window close event, but we can\n   * trigger XHR requests in some browsers (everything but Opera basically).\n   * @param {!string} id\n   * @param {!string} pw\n   */\n  addDisconnectPingFrame(id: string, pw: string) {\n    if (isNodeSdk()) {\n      return;\n    }\n    this.myDisconnFrame = document.createElement('iframe');\n    const urlParams: { [k: string]: string } = {};\n    urlParams[FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM] = 't';\n    urlParams[FIREBASE_LONGPOLL_ID_PARAM] = id;\n    urlParams[FIREBASE_LONGPOLL_PW_PARAM] = pw;\n    this.myDisconnFrame.src = this.urlFn(urlParams);\n    this.myDisconnFrame.style.display = 'none';\n\n    document.body.appendChild(this.myDisconnFrame);\n  }\n\n  /**\n   * Used to track the bytes received by this client\n   * @param {*} args\n   * @private\n   */\n  private incrementIncomingBytes_(args: unknown) {\n    // TODO: This is an annoying perf hit just to track the number of incoming bytes.  Maybe it should be opt-in.\n    const bytesReceived = stringify(args).length;\n    this.bytesReceived += bytesReceived;\n    this.stats_.incrementCounter('bytes_received', bytesReceived);\n  }\n}\n\n// eslint-disable-next-line @typescript-eslint/interface-name-prefix\nexport interface IFrameElement extends HTMLIFrameElement {\n  doc: Document;\n}\n\n/*********************************************************************************************\n * A wrapper around an iframe that is used as a long-polling script holder.\n * @constructor\n *********************************************************************************************/\nexport class FirebaseIFrameScriptHolder {\n  //We maintain a count of all of the outstanding requests, because if we have too many active at once it can cause\n  //problems in some browsers.\n  outstandingRequests = new Set<number>();\n\n  //A queue of the pending segments waiting for transmission to the server.\n  pendingSegs: Array<{ seg: number; ts: number; d: unknown }> = [];\n\n  //A serial number. We use this for two things:\n  // 1) A way to ensure the browser doesn't cache responses to polls\n  // 2) A way to make the server aware when long-polls arrive in a different order than we started them. The\n  //    server needs to release both polls in this case or it will cause problems in Opera since Opera can only execute\n  //    JSONP code in the order it was added to the iframe.\n  currentSerial = Math.floor(Math.random() * 100000000);\n\n  // This gets set to false when we're \"closing down\" the connection (e.g. we're switching transports but there's still\n  // incoming data from the server that we're waiting for).\n  sendNewPolls = true;\n\n  uniqueCallbackIdentifier: number;\n  myIFrame: IFrameElement;\n  alive: boolean;\n  myID: string;\n  myPW: string;\n  commandCB: (command: string, ...args: unknown[]) => void;\n  onMessageCB: (...args: unknown[]) => void;\n\n  /**\n   * @param commandCB - The callback to be called when control commands are recevied from the server.\n   * @param onMessageCB - The callback to be triggered when responses arrive from the server.\n   * @param onDisconnect - The callback to be triggered when this tag holder is closed\n   * @param urlFn - A function that provides the URL of the endpoint to send data to.\n   */\n  constructor(\n    commandCB: (command: string, ...args: unknown[]) => void,\n    onMessageCB: (...args: unknown[]) => void,\n    public onDisconnect: () => void,\n    public urlFn: (a: object) => string\n  ) {\n    if (!isNodeSdk()) {\n      //Each script holder registers a couple of uniquely named callbacks with the window. These are called from the\n      //iframes where we put the long-polling script tags. We have two callbacks:\n      //   1) Command Callback - Triggered for control issues, like starting a connection.\n      //   2) Message Callback - Triggered when new data arrives.\n      this.uniqueCallbackIdentifier = LUIDGenerator();\n      window[\n        FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier\n      ] = commandCB;\n      window[\n        FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier\n      ] = onMessageCB;\n\n      //Create an iframe for us to add script tags to.\n      this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\n\n      // Set the iframe's contents.\n      let script = '';\n      // if we set a javascript url, it's IE and we need to set the document domain. The javascript url is sufficient\n      // for ie9, but ie8 needs to do it again in the document itself.\n      if (\n        this.myIFrame.src &&\n        this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:'\n      ) {\n        const currentDomain = document.domain;\n        script = '<script>document.domain=\"' + currentDomain + '\";</script>';\n      }\n      const iframeContents = '<html><body>' + script + '</body></html>';\n      try {\n        this.myIFrame.doc.open();\n        this.myIFrame.doc.write(iframeContents);\n        this.myIFrame.doc.close();\n      } catch (e) {\n        log('frame writing exception');\n        if (e.stack) {\n          log(e.stack);\n        }\n        log(e);\n      }\n    } else {\n      this.commandCB = commandCB;\n      this.onMessageCB = onMessageCB;\n    }\n  }\n\n  /**\n   * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\n   * actually use.\n   * @private\n   * @return {Element}\n   */\n  private static createIFrame_(): IFrameElement {\n    const iframe = document.createElement('iframe') as IFrameElement;\n    iframe.style.display = 'none';\n\n    // This is necessary in order to initialize the document inside the iframe\n    if (document.body) {\n      document.body.appendChild(iframe);\n      try {\n        // If document.domain has been modified in IE, this will throw an error, and we need to set the\n        // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\n        // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\n        const a = iframe.contentWindow.document;\n        if (!a) {\n          // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\n          log('No IE domain setting required');\n        }\n      } catch (e) {\n        const domain = document.domain;\n        iframe.src =\n          \"javascript:void((function(){document.open();document.domain='\" +\n          domain +\n          \"';document.close();})())\";\n      }\n    } else {\n      // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\n      // never gets hit.\n      throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\n    }\n\n    // Get the document of the iframe in a browser-specific way.\n    if (iframe.contentDocument) {\n      iframe.doc = iframe.contentDocument; // Firefox, Opera, Safari\n    } else if (iframe.contentWindow) {\n      iframe.doc = iframe.contentWindow.document; // Internet Explorer\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    } else if ((iframe as any).document) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      iframe.doc = (iframe as any).document; //others?\n    }\n\n    return iframe;\n  }\n\n  /**\n   * Cancel all outstanding queries and remove the frame.\n   */\n  close() {\n    //Mark this iframe as dead, so no new requests are sent.\n    this.alive = false;\n\n    if (this.myIFrame) {\n      //We have to actually remove all of the html inside this iframe before removing it from the\n      //window, or IE will continue loading and executing the script tags we've already added, which\n      //can lead to some errors being thrown. Setting innerHTML seems to be the easiest way to do this.\n      this.myIFrame.doc.body.innerHTML = '';\n      setTimeout(() => {\n        if (this.myIFrame !== null) {\n          document.body.removeChild(this.myIFrame);\n          this.myIFrame = null;\n        }\n      }, Math.floor(0));\n    }\n\n    // Protect from being called recursively.\n    const onDisconnect = this.onDisconnect;\n    if (onDisconnect) {\n      this.onDisconnect = null;\n      onDisconnect();\n    }\n  }\n\n  /**\n   * Actually start the long-polling session by adding the first script tag(s) to the iframe.\n   * @param {!string} id - The ID of this connection\n   * @param {!string} pw - The password for this connection\n   */\n  startLongPoll(id: string, pw: string) {\n    this.myID = id;\n    this.myPW = pw;\n    this.alive = true;\n\n    //send the initial request. If there are requests queued, make sure that we transmit as many as we are currently able to.\n    while (this.newRequest_()) {}\n  }\n\n  /**\n   * This is called any time someone might want a script tag to be added. It adds a script tag when there aren't\n   * too many outstanding requests and we are still alive.\n   *\n   * If there are outstanding packet segments to send, it sends one. If there aren't, it sends a long-poll anyways if\n   * needed.\n   */\n  private newRequest_() {\n    // We keep one outstanding request open all the time to receive data, but if we need to send data\n    // (pendingSegs.length > 0) then we create a new request to send the data.  The server will automatically\n    // close the old request.\n    if (\n      this.alive &&\n      this.sendNewPolls &&\n      this.outstandingRequests.size < (this.pendingSegs.length > 0 ? 2 : 1)\n    ) {\n      //construct our url\n      this.currentSerial++;\n      const urlParams: { [k: string]: string | number } = {};\n      urlParams[FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n      urlParams[FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n      urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = this.currentSerial;\n      let theURL = this.urlFn(urlParams);\n      //Now add as much data as we can.\n      let curDataString = '';\n      let i = 0;\n\n      while (this.pendingSegs.length > 0) {\n        //first, lets see if the next segment will fit.\n        const nextSeg = this.pendingSegs[0];\n        if (\n          (nextSeg.d as unknown[]).length +\n            SEG_HEADER_SIZE +\n            curDataString.length <=\n          MAX_URL_DATA_SIZE\n        ) {\n          //great, the segment will fit. Lets append it.\n          const theSeg = this.pendingSegs.shift();\n          curDataString =\n            curDataString +\n            '&' +\n            FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM +\n            i +\n            '=' +\n            theSeg.seg +\n            '&' +\n            FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET +\n            i +\n            '=' +\n            theSeg.ts +\n            '&' +\n            FIREBASE_LONGPOLL_DATA_PARAM +\n            i +\n            '=' +\n            theSeg.d;\n          i++;\n        } else {\n          break;\n        }\n      }\n\n      theURL = theURL + curDataString;\n      this.addLongPollTag_(theURL, this.currentSerial);\n\n      return true;\n    } else {\n      return false;\n    }\n  }\n\n  /**\n   * Queue a packet for transmission to the server.\n   * @param segnum - A sequential id for this packet segment used for reassembly\n   * @param totalsegs - The total number of segments in this packet\n   * @param data - The data for this segment.\n   */\n  enqueueSegment(segnum: number, totalsegs: number, data: unknown) {\n    //add this to the queue of segments to send.\n    this.pendingSegs.push({ seg: segnum, ts: totalsegs, d: data });\n\n    //send the data immediately if there isn't already data being transmitted, unless\n    //startLongPoll hasn't been called yet.\n    if (this.alive) {\n      this.newRequest_();\n    }\n  }\n\n  /**\n   * Add a script tag for a regular long-poll request.\n   * @param {!string} url - The URL of the script tag.\n   * @param {!number} serial - The serial number of the request.\n   * @private\n   */\n  private addLongPollTag_(url: string, serial: number) {\n    //remember that we sent this request.\n    this.outstandingRequests.add(serial);\n\n    const doNewRequest = () => {\n      this.outstandingRequests.delete(serial);\n      this.newRequest_();\n    };\n\n    // If this request doesn't return on its own accord (by the server sending us some data), we'll\n    // create a new one after the KEEPALIVE interval to make sure we always keep a fresh request open.\n    const keepaliveTimeout = setTimeout(\n      doNewRequest,\n      Math.floor(KEEPALIVE_REQUEST_INTERVAL)\n    );\n\n    const readyStateCB = () => {\n      // Request completed.  Cancel the keepalive.\n      clearTimeout(keepaliveTimeout);\n\n      // Trigger a new request so we can continue receiving data.\n      doNewRequest();\n    };\n\n    this.addTag(url, readyStateCB);\n  }\n\n  /**\n   * Add an arbitrary script tag to the iframe.\n   * @param {!string} url - The URL for the script tag source.\n   * @param {!function()} loadCB - A callback to be triggered once the script has loaded.\n   */\n  addTag(url: string, loadCB: () => void) {\n    if (isNodeSdk()) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      (this as any).doNodeLongPoll(url, loadCB);\n    } else {\n      setTimeout(() => {\n        try {\n          // if we're already closed, don't add this poll\n          if (!this.sendNewPolls) {\n            return;\n          }\n          const newScript = this.myIFrame.doc.createElement('script');\n          newScript.type = 'text/javascript';\n          newScript.async = true;\n          newScript.src = url;\n          // eslint-disable-next-line @typescript-eslint/no-explicit-any\n          newScript.onload = (newScript as any).onreadystatechange = function() {\n            // eslint-disable-next-line @typescript-eslint/no-explicit-any\n            const rstate = (newScript as any).readyState;\n            if (!rstate || rstate === 'loaded' || rstate === 'complete') {\n              // eslint-disable-next-line @typescript-eslint/no-explicit-any\n              newScript.onload = (newScript as any).onreadystatechange = null;\n              if (newScript.parentNode) {\n                newScript.parentNode.removeChild(newScript);\n              }\n              loadCB();\n            }\n          };\n          newScript.onerror = () => {\n            log('Long-poll script failed to load: ' + url);\n            this.sendNewPolls = false;\n            this.close();\n          };\n          this.myIFrame.doc.body.appendChild(newScript);\n        } catch (e) {\n          // TODO: we should make this error visible somehow\n        }\n      }, Math.floor(1));\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/** The semver (www.semver.org) version of the SDK. */\nexport let SDK_VERSION = '';\n\n// SDK_VERSION should be set before any database instance is created\nexport function setSDKVersion(version: string): void {\n  SDK_VERSION = version;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RepoInfo } from '../core/RepoInfo';\nimport {\n  assert,\n  CONSTANTS as ENV_CONSTANTS,\n  jsonEval,\n  stringify,\n  isNodeSdk\n} from '@firebase/util';\nimport { logWrapper, splitStringBySize } from '../core/util/util';\nimport { StatsManager } from '../core/stats/StatsManager';\nimport {\n  FORGE_DOMAIN,\n  FORGE_REF,\n  LAST_SESSION_PARAM,\n  PROTOCOL_VERSION,\n  REFERER_PARAM,\n  TRANSPORT_SESSION_PARAM,\n  VERSION_PARAM,\n  WEBSOCKET\n} from './Constants';\nimport { PersistentStorage } from '../core/storage/storage';\nimport { Transport } from './Transport';\nimport { StatsCollection } from '../core/stats/StatsCollection';\nimport { SDK_VERSION } from '../core/version';\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\ndeclare const MozWebSocket: any;\n\nconst WEBSOCKET_MAX_FRAME_SIZE = 16384;\nconst WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\n\nlet WebSocketImpl = null;\nif (typeof MozWebSocket !== 'undefined') {\n  WebSocketImpl = MozWebSocket;\n} else if (typeof WebSocket !== 'undefined') {\n  WebSocketImpl = WebSocket;\n}\n\nexport function setWebSocketImpl(impl) {\n  WebSocketImpl = impl;\n}\n\n/**\n * Create a new websocket connection with the given callbacks.\n * @constructor\n * @implements {Transport}\n */\nexport class WebSocketConnection implements Transport {\n  keepaliveTimer: number | null = null;\n  frames: string[] | null = null;\n  totalFrames = 0;\n  bytesSent = 0;\n  bytesReceived = 0;\n  connURL: string;\n  onDisconnect: (a?: boolean) => void;\n  onMessage: (msg: {}) => void;\n  mySock: WebSocket | null;\n  private log_: (...a: unknown[]) => void;\n  private stats_: StatsCollection;\n  private everConnected_: boolean;\n  private isClosed_: boolean;\n\n  /**\n   * @param {string} connId identifier for this transport\n   * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n   * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n   *                                         session\n   * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n   */\n  constructor(\n    public connId: string,\n    repoInfo: RepoInfo,\n    transportSessionId?: string,\n    lastSessionId?: string\n  ) {\n    this.log_ = logWrapper(this.connId);\n    this.stats_ = StatsManager.getCollection(repoInfo);\n    this.connURL = WebSocketConnection.connectionURL_(\n      repoInfo,\n      transportSessionId,\n      lastSessionId\n    );\n  }\n\n  /**\n   * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n   * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n   *                                         session\n   * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n   * @return {string} connection url\n   * @private\n   */\n  private static connectionURL_(\n    repoInfo: RepoInfo,\n    transportSessionId?: string,\n    lastSessionId?: string\n  ): string {\n    const urlParams: { [k: string]: string } = {};\n    urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n\n    if (\n      !isNodeSdk() &&\n      typeof location !== 'undefined' &&\n      location.href &&\n      location.href.indexOf(FORGE_DOMAIN) !== -1\n    ) {\n      urlParams[REFERER_PARAM] = FORGE_REF;\n    }\n    if (transportSessionId) {\n      urlParams[TRANSPORT_SESSION_PARAM] = transportSessionId;\n    }\n    if (lastSessionId) {\n      urlParams[LAST_SESSION_PARAM] = lastSessionId;\n    }\n    return repoInfo.connectionURL(WEBSOCKET, urlParams);\n  }\n\n  /**\n   *\n   * @param onMessage Callback when messages arrive\n   * @param onDisconnect Callback with connection lost.\n   */\n  open(onMessage: (msg: {}) => void, onDisconnect: (a?: boolean) => void) {\n    this.onDisconnect = onDisconnect;\n    this.onMessage = onMessage;\n\n    this.log_('Websocket connecting to ' + this.connURL);\n\n    this.everConnected_ = false;\n    // Assume failure until proven otherwise.\n    PersistentStorage.set('previous_websocket_failure', true);\n\n    try {\n      if (isNodeSdk()) {\n        const device = ENV_CONSTANTS.NODE_ADMIN ? 'AdminNode' : 'Node';\n        // UA Format: Firebase/<wire_protocol>/<sdk_version>/<platform>/<device>\n        const options: { [k: string]: object } = {\n          headers: {\n            'User-Agent': `Firebase/${PROTOCOL_VERSION}/${SDK_VERSION}/${process.platform}/${device}`\n          }\n        };\n\n        // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n        const env = process['env'];\n        const proxy =\n          this.connURL.indexOf('wss://') === 0\n            ? env['HTTPS_PROXY'] || env['https_proxy']\n            : env['HTTP_PROXY'] || env['http_proxy'];\n\n        if (proxy) {\n          options['proxy'] = { origin: proxy };\n        }\n\n        this.mySock = new WebSocketImpl(this.connURL, [], options);\n      } else {\n        this.mySock = new WebSocketImpl(this.connURL);\n      }\n    } catch (e) {\n      this.log_('Error instantiating WebSocket.');\n      const error = e.message || e.data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n      return;\n    }\n\n    this.mySock.onopen = () => {\n      this.log_('Websocket connected.');\n      this.everConnected_ = true;\n    };\n\n    this.mySock.onclose = () => {\n      this.log_('Websocket connection was disconnected.');\n      this.mySock = null;\n      this.onClosed_();\n    };\n\n    this.mySock.onmessage = m => {\n      this.handleIncomingFrame(m as {});\n    };\n\n    this.mySock.onerror = e => {\n      this.log_('WebSocket error.  Closing connection.');\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      const error = (e as any).message || (e as any).data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n    };\n  }\n\n  /**\n   * No-op for websockets, we don't need to do anything once the connection is confirmed as open\n   */\n  start() {}\n\n  static forceDisallow_: boolean;\n\n  static forceDisallow() {\n    WebSocketConnection.forceDisallow_ = true;\n  }\n\n  static isAvailable(): boolean {\n    let isOldAndroid = false;\n    if (typeof navigator !== 'undefined' && navigator.userAgent) {\n      const oldAndroidRegex = /Android ([0-9]{0,}\\.[0-9]{0,})/;\n      const oldAndroidMatch = navigator.userAgent.match(oldAndroidRegex);\n      if (oldAndroidMatch && oldAndroidMatch.length > 1) {\n        if (parseFloat(oldAndroidMatch[1]) < 4.4) {\n          isOldAndroid = true;\n        }\n      }\n    }\n\n    return (\n      !isOldAndroid &&\n      WebSocketImpl !== null &&\n      !WebSocketConnection.forceDisallow_\n    );\n  }\n\n  /**\n   * Number of response before we consider the connection \"healthy.\"\n   * @type {number}\n   */\n  static responsesRequiredToBeHealthy = 2;\n\n  /**\n   * Time to wait for the connection te become healthy before giving up.\n   * @type {number}\n   */\n  static healthyTimeout = 30000;\n\n  /**\n   * Returns true if we previously failed to connect with this transport.\n   * @return {boolean}\n   */\n  static previouslyFailed(): boolean {\n    // If our persistent storage is actually only in-memory storage,\n    // we default to assuming that it previously failed to be safe.\n    return (\n      PersistentStorage.isInMemoryStorage ||\n      PersistentStorage.get('previous_websocket_failure') === true\n    );\n  }\n\n  markConnectionHealthy() {\n    PersistentStorage.remove('previous_websocket_failure');\n  }\n\n  private appendFrame_(data: string) {\n    this.frames.push(data);\n    if (this.frames.length === this.totalFrames) {\n      const fullMess = this.frames.join('');\n      this.frames = null;\n      const jsonMess = jsonEval(fullMess) as object;\n\n      //handle the message\n      this.onMessage(jsonMess);\n    }\n  }\n\n  /**\n   * @param {number} frameCount The number of frames we are expecting from the server\n   * @private\n   */\n  private handleNewFrameCount_(frameCount: number) {\n    this.totalFrames = frameCount;\n    this.frames = [];\n  }\n\n  /**\n   * Attempts to parse a frame count out of some text. If it can't, assumes a value of 1\n   * @param {!String} data\n   * @return {?String} Any remaining data to be process, or null if there is none\n   * @private\n   */\n  private extractFrameCount_(data: string): string | null {\n    assert(this.frames === null, 'We already have a frame buffer');\n    // TODO: The server is only supposed to send up to 9999 frames (i.e. length <= 4), but that isn't being enforced\n    // currently.  So allowing larger frame counts (length <= 6).  See https://app.asana.com/0/search/8688598998380/8237608042508\n    if (data.length <= 6) {\n      const frameCount = Number(data);\n      if (!isNaN(frameCount)) {\n        this.handleNewFrameCount_(frameCount);\n        return null;\n      }\n    }\n    this.handleNewFrameCount_(1);\n    return data;\n  }\n\n  /**\n   * Process a websocket frame that has arrived from the server.\n   * @param mess The frame data\n   */\n  handleIncomingFrame(mess: { [k: string]: unknown }) {\n    if (this.mySock === null) {\n      return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\n    }\n    const data = mess['data'] as string;\n    this.bytesReceived += data.length;\n    this.stats_.incrementCounter('bytes_received', data.length);\n\n    this.resetKeepAlive();\n\n    if (this.frames !== null) {\n      // we're buffering\n      this.appendFrame_(data);\n    } else {\n      // try to parse out a frame count, otherwise, assume 1 and process it\n      const remainingData = this.extractFrameCount_(data);\n      if (remainingData !== null) {\n        this.appendFrame_(remainingData);\n      }\n    }\n  }\n\n  /**\n   * Send a message to the server\n   * @param {Object} data The JSON object to transmit\n   */\n  send(data: {}) {\n    this.resetKeepAlive();\n\n    const dataStr = stringify(data);\n    this.bytesSent += dataStr.length;\n    this.stats_.incrementCounter('bytes_sent', dataStr.length);\n\n    //We can only fit a certain amount in each websocket frame, so we need to split this request\n    //up into multiple pieces if it doesn't fit in one request.\n\n    const dataSegs = splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\n\n    //Send the length header\n    if (dataSegs.length > 1) {\n      this.sendString_(String(dataSegs.length));\n    }\n\n    //Send the actual data in segments.\n    for (let i = 0; i < dataSegs.length; i++) {\n      this.sendString_(dataSegs[i]);\n    }\n  }\n\n  private shutdown_() {\n    this.isClosed_ = true;\n    if (this.keepaliveTimer) {\n      clearInterval(this.keepaliveTimer);\n      this.keepaliveTimer = null;\n    }\n\n    if (this.mySock) {\n      this.mySock.close();\n      this.mySock = null;\n    }\n  }\n\n  private onClosed_() {\n    if (!this.isClosed_) {\n      this.log_('WebSocket is closing itself');\n      this.shutdown_();\n\n      // since this is an internal close, trigger the close listener\n      if (this.onDisconnect) {\n        this.onDisconnect(this.everConnected_);\n        this.onDisconnect = null;\n      }\n    }\n  }\n\n  /**\n   * External-facing close handler.\n   * Close the websocket and kill the connection.\n   */\n  close() {\n    if (!this.isClosed_) {\n      this.log_('WebSocket is being closed');\n      this.shutdown_();\n    }\n  }\n\n  /**\n   * Kill the current keepalive timer and start a new one, to ensure that it always fires N seconds after\n   * the last activity.\n   */\n  resetKeepAlive() {\n    clearInterval(this.keepaliveTimer);\n    this.keepaliveTimer = setInterval(() => {\n      //If there has been no websocket activity for a while, send a no-op\n      if (this.mySock) {\n        this.sendString_('0');\n      }\n      this.resetKeepAlive();\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(WEBSOCKET_KEEPALIVE_INTERVAL)) as any;\n  }\n\n  /**\n   * Send a string over the websocket.\n   *\n   * @param {string} str String to send.\n   * @private\n   */\n  private sendString_(str: string) {\n    // Firefox seems to sometimes throw exceptions (NS_ERROR_UNEXPECTED) from websocket .send()\n    // calls for some unknown reason.  We treat these as an error and disconnect.\n    // See https://app.asana.com/0/58926111402292/68021340250410\n    try {\n      this.mySock.send(str);\n    } catch (e) {\n      this.log_(\n        'Exception thrown from WebSocket.send():',\n        e.message || e.data,\n        'Closing connection.'\n      );\n      setTimeout(this.onClosed_.bind(this), 0);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { BrowserPollConnection } from './BrowserPollConnection';\nimport { WebSocketConnection } from './WebSocketConnection';\nimport { warn, each } from '../core/util/util';\nimport { TransportConstructor } from './Transport';\nimport { RepoInfo } from '../core/RepoInfo';\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 * @constructor\n */\nexport class TransportManager {\n  private transports_: TransportConstructor[];\n\n  /**\n   * @const\n   * @type {!Array.<function(new:Transport, string, RepoInfo, string=)>}\n   */\n  static get ALL_TRANSPORTS() {\n    return [BrowserPollConnection, WebSocketConnection];\n  }\n\n  /**\n   * @param {!RepoInfo} repoInfo Metadata around the namespace we're connecting to\n   */\n  constructor(repoInfo: RepoInfo) {\n    this.initTransports_(repoInfo);\n  }\n\n  /**\n   * @param {!RepoInfo} repoInfo\n   * @private\n   */\n  private initTransports_(repoInfo: RepoInfo) {\n    const isWebSocketsAvailable: boolean =\n      WebSocketConnection && WebSocketConnection['isAvailable']();\n    let isSkipPollConnection =\n      isWebSocketsAvailable && !WebSocketConnection.previouslyFailed();\n\n    if (repoInfo.webSocketOnly) {\n      if (!isWebSocketsAvailable) {\n        warn(\n          \"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\"\n        );\n      }\n\n      isSkipPollConnection = true;\n    }\n\n    if (isSkipPollConnection) {\n      this.transports_ = [WebSocketConnection];\n    } else {\n      const transports = (this.transports_ = [] as TransportConstructor[]);\n      for (const transport of TransportManager.ALL_TRANSPORTS) {\n        if (transport && transport['isAvailable']()) {\n          transports.push(transport);\n        }\n      }\n    }\n  }\n\n  /**\n   * @return {function(new:Transport, !string, !RepoInfo, string=, string=)} The constructor for the\n   * initial transport to use\n   */\n  initialTransport(): TransportConstructor {\n    if (this.transports_.length > 0) {\n      return this.transports_[0];\n    } else {\n      throw new Error('No transports available');\n    }\n  }\n\n  /**\n   * @return {?function(new:Transport, function(),function(), string=)} The constructor for the next\n   * transport, or null\n   */\n  upgradeTransport(): TransportConstructor | null {\n    if (this.transports_.length > 1) {\n      return this.transports_[1];\n    } else {\n      return null;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  error,\n  logWrapper,\n  requireKey,\n  setTimeoutNonBlocking,\n  warn\n} from '../core/util/util';\nimport { PersistentStorage } from '../core/storage/storage';\nimport { PROTOCOL_VERSION } from './Constants';\nimport { TransportManager } from './TransportManager';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { Transport, TransportConstructor } from './Transport';\nimport { Indexable } from '../core/util/misc';\n\n// Abort upgrade attempt if it takes longer than 60s.\nconst UPGRADE_TIMEOUT = 60000;\n\n// For some transports (WebSockets), we need to \"validate\" the transport by exchanging a few requests and responses.\n// If we haven't sent enough requests within 5s, we'll start sending noop ping requests.\nconst DELAY_BEFORE_SENDING_EXTRA_REQUESTS = 5000;\n\n// If the initial data sent triggers a lot of bandwidth (i.e. it's a large put or a listen for a large amount of data)\n// then we may not be able to exchange our ping/pong requests within the healthy timeout.  So if we reach the timeout\n// but we've sent/received enough bytes, we don't cancel the connection.\nconst BYTES_SENT_HEALTHY_OVERRIDE = 10 * 1024;\nconst BYTES_RECEIVED_HEALTHY_OVERRIDE = 100 * 1024;\n\nconst enum RealtimeState {\n  CONNECTING,\n  CONNECTED,\n  DISCONNECTED\n}\n\nconst MESSAGE_TYPE = 't';\nconst MESSAGE_DATA = 'd';\nconst CONTROL_SHUTDOWN = 's';\nconst CONTROL_RESET = 'r';\nconst CONTROL_ERROR = 'e';\nconst CONTROL_PONG = 'o';\nconst SWITCH_ACK = 'a';\nconst END_TRANSMISSION = 'n';\nconst PING = 'p';\n\nconst SERVER_HELLO = 'h';\n\n/**\n * Creates a new real-time connection to the server using whichever method works\n * best in the current browser.\n *\n * @constructor\n */\nexport class Connection {\n  connectionCount = 0;\n  pendingDataMessages: unknown[] = [];\n  sessionId: string;\n\n  private conn_: Transport;\n  private healthyTimeout_: number;\n  private isHealthy_: boolean;\n  private log_: (...args: unknown[]) => void;\n  private primaryResponsesRequired_: number;\n  private rx_: Transport;\n  private secondaryConn_: Transport;\n  private secondaryResponsesRequired_: number;\n  private state_ = RealtimeState.CONNECTING;\n  private transportManager_: TransportManager;\n  private tx_: Transport;\n\n  /**\n   * @param {!string} id - an id for this connection\n   * @param {!RepoInfo} repoInfo_ - the info for the endpoint to connect to\n   * @param {function(Object)} onMessage_ - the callback to be triggered when a server-push message arrives\n   * @param {function(number, string)} onReady_ - the callback to be triggered when this connection is ready to send messages.\n   * @param {function()} onDisconnect_ - the callback to be triggered when a connection was lost\n   * @param {function(string)} onKill_ - the callback to be triggered when this connection has permanently shut down.\n   * @param {string=} lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n   */\n  constructor(\n    public id: string,\n    private repoInfo_: RepoInfo,\n    private onMessage_: (a: {}) => void,\n    private onReady_: (a: number, b: string) => void,\n    private onDisconnect_: () => void,\n    private onKill_: (a: string) => void,\n    public lastSessionId?: string\n  ) {\n    this.log_ = logWrapper('c:' + this.id + ':');\n    this.transportManager_ = new TransportManager(repoInfo_);\n    this.log_('Connection created');\n    this.start_();\n  }\n\n  /**\n   * Starts a connection attempt\n   * @private\n   */\n  private start_(): void {\n    const conn = this.transportManager_.initialTransport();\n    this.conn_ = new conn(\n      this.nextTransportId_(),\n      this.repoInfo_,\n      undefined,\n      this.lastSessionId\n    );\n\n    // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n    // can consider the transport healthy.\n    this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n\n    const onMessageReceived = this.connReceiver_(this.conn_);\n    const onConnectionLost = this.disconnReceiver_(this.conn_);\n    this.tx_ = this.conn_;\n    this.rx_ = this.conn_;\n    this.secondaryConn_ = null;\n    this.isHealthy_ = false;\n\n    /*\n     * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\n     * This can occur in the case of a redirect, i.e. we guessed wrong on what server to connect to and received a reset.\n     * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\n     * still have the context of your originating frame.\n     */\n    setTimeout(() => {\n      // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\n      this.conn_ && this.conn_.open(onMessageReceived, onConnectionLost);\n    }, Math.floor(0));\n\n    const healthyTimeoutMS = conn['healthyTimeout'] || 0;\n    if (healthyTimeoutMS > 0) {\n      this.healthyTimeout_ = setTimeoutNonBlocking(() => {\n        this.healthyTimeout_ = null;\n        if (!this.isHealthy_) {\n          if (\n            this.conn_ &&\n            this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE\n          ) {\n            this.log_(\n              'Connection exceeded healthy timeout but has received ' +\n                this.conn_.bytesReceived +\n                ' bytes.  Marking connection healthy.'\n            );\n            this.isHealthy_ = true;\n            this.conn_.markConnectionHealthy();\n          } else if (\n            this.conn_ &&\n            this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE\n          ) {\n            this.log_(\n              'Connection exceeded healthy timeout but has sent ' +\n                this.conn_.bytesSent +\n                ' bytes.  Leaving connection alive.'\n            );\n            // NOTE: We don't want to mark it healthy, since we have no guarantee that the bytes have made it to\n            // the server.\n          } else {\n            this.log_('Closing unhealthy connection after timeout.');\n            this.close();\n          }\n        }\n        // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      }, Math.floor(healthyTimeoutMS)) as any;\n    }\n  }\n\n  /**\n   * @return {!string}\n   * @private\n   */\n  private nextTransportId_(): string {\n    return 'c:' + this.id + ':' + this.connectionCount++;\n  }\n\n  private disconnReceiver_(conn) {\n    return everConnected => {\n      if (conn === this.conn_) {\n        this.onConnectionLost_(everConnected);\n      } else if (conn === this.secondaryConn_) {\n        this.log_('Secondary connection lost.');\n        this.onSecondaryConnectionLost_();\n      } else {\n        this.log_('closing an old connection');\n      }\n    };\n  }\n\n  private connReceiver_(conn: Transport) {\n    return (message: Indexable) => {\n      if (this.state_ !== RealtimeState.DISCONNECTED) {\n        if (conn === this.rx_) {\n          this.onPrimaryMessageReceived_(message);\n        } else if (conn === this.secondaryConn_) {\n          this.onSecondaryMessageReceived_(message);\n        } else {\n          this.log_('message on old connection');\n        }\n      }\n    };\n  }\n\n  /**\n   *\n   * @param {Object} dataMsg An arbitrary data message to be sent to the server\n   */\n  sendRequest(dataMsg: object) {\n    // wrap in a data message envelope and send it on\n    const msg = { t: 'd', d: dataMsg };\n    this.sendData_(msg);\n  }\n\n  tryCleanupConnection() {\n    if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\n      this.log_(\n        'cleaning up and promoting a connection: ' + this.secondaryConn_.connId\n      );\n      this.conn_ = this.secondaryConn_;\n      this.secondaryConn_ = null;\n      // the server will shutdown the old connection\n    }\n  }\n\n  private onSecondaryControl_(controlData: { [k: string]: unknown }) {\n    if (MESSAGE_TYPE in controlData) {\n      const cmd = controlData[MESSAGE_TYPE] as string;\n      if (cmd === SWITCH_ACK) {\n        this.upgradeIfSecondaryHealthy_();\n      } else if (cmd === CONTROL_RESET) {\n        // Most likely the session wasn't valid. Abandon the switch attempt\n        this.log_('Got a reset on secondary, closing it');\n        this.secondaryConn_.close();\n        // If we were already using this connection for something, than we need to fully close\n        if (\n          this.tx_ === this.secondaryConn_ ||\n          this.rx_ === this.secondaryConn_\n        ) {\n          this.close();\n        }\n      } else if (cmd === CONTROL_PONG) {\n        this.log_('got pong on secondary.');\n        this.secondaryResponsesRequired_--;\n        this.upgradeIfSecondaryHealthy_();\n      }\n    }\n  }\n\n  private onSecondaryMessageReceived_(parsedData: Indexable) {\n    const layer: string = requireKey('t', parsedData) as string;\n    const data: unknown = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onSecondaryControl_(data as Indexable);\n    } else if (layer === 'd') {\n      // got a data message, but we're still second connection. Need to buffer it up\n      this.pendingDataMessages.push(data);\n    } else {\n      throw new Error('Unknown protocol layer: ' + layer);\n    }\n  }\n\n  private upgradeIfSecondaryHealthy_() {\n    if (this.secondaryResponsesRequired_ <= 0) {\n      this.log_('Secondary connection is healthy.');\n      this.isHealthy_ = true;\n      this.secondaryConn_.markConnectionHealthy();\n      this.proceedWithUpgrade_();\n    } else {\n      // Send a ping to make sure the connection is healthy.\n      this.log_('sending ping on secondary.');\n      this.secondaryConn_.send({ t: 'c', d: { t: PING, d: {} } });\n    }\n  }\n\n  private proceedWithUpgrade_() {\n    // tell this connection to consider itself open\n    this.secondaryConn_.start();\n    // send ack\n    this.log_('sending client ack on secondary');\n    this.secondaryConn_.send({ t: 'c', d: { t: SWITCH_ACK, d: {} } });\n\n    // send end packet on primary transport, switch to sending on this one\n    // can receive on this one, buffer responses until end received on primary transport\n    this.log_('Ending transmission on primary');\n    this.conn_.send({ t: 'c', d: { t: END_TRANSMISSION, d: {} } });\n    this.tx_ = this.secondaryConn_;\n\n    this.tryCleanupConnection();\n  }\n\n  private onPrimaryMessageReceived_(parsedData: { [k: string]: unknown }) {\n    // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n    const layer: string = requireKey('t', parsedData) as string;\n    const data: unknown = requireKey('d', parsedData);\n    if (layer === 'c') {\n      this.onControl_(data as { [k: string]: unknown });\n    } else if (layer === 'd') {\n      this.onDataMessage_(data);\n    }\n  }\n\n  private onDataMessage_(message: unknown) {\n    this.onPrimaryResponse_();\n\n    // We don't do anything with data messages, just kick them up a level\n    this.onMessage_(message);\n  }\n\n  private onPrimaryResponse_() {\n    if (!this.isHealthy_) {\n      this.primaryResponsesRequired_--;\n      if (this.primaryResponsesRequired_ <= 0) {\n        this.log_('Primary connection is healthy.');\n        this.isHealthy_ = true;\n        this.conn_.markConnectionHealthy();\n      }\n    }\n  }\n\n  private onControl_(controlData: { [k: string]: unknown }) {\n    const cmd: string = requireKey(MESSAGE_TYPE, controlData) as string;\n    if (MESSAGE_DATA in controlData) {\n      const payload = controlData[MESSAGE_DATA];\n      if (cmd === SERVER_HELLO) {\n        this.onHandshake_(\n          payload as {\n            ts: number;\n            v: string;\n            h: string;\n            s: string;\n          }\n        );\n      } else if (cmd === END_TRANSMISSION) {\n        this.log_('recvd end transmission on primary');\n        this.rx_ = this.secondaryConn_;\n        for (let i = 0; i < this.pendingDataMessages.length; ++i) {\n          this.onDataMessage_(this.pendingDataMessages[i]);\n        }\n        this.pendingDataMessages = [];\n        this.tryCleanupConnection();\n      } else if (cmd === CONTROL_SHUTDOWN) {\n        // This was previously the 'onKill' callback passed to the lower-level connection\n        // payload in this case is the reason for the shutdown. Generally a human-readable error\n        this.onConnectionShutdown_(payload as string);\n      } else if (cmd === CONTROL_RESET) {\n        // payload in this case is the host we should contact\n        this.onReset_(payload as string);\n      } else if (cmd === CONTROL_ERROR) {\n        error('Server Error: ' + payload);\n      } else if (cmd === CONTROL_PONG) {\n        this.log_('got pong on primary.');\n        this.onPrimaryResponse_();\n        this.sendPingOnPrimaryIfNecessary_();\n      } else {\n        error('Unknown control packet command: ' + cmd);\n      }\n    }\n  }\n\n  /**\n   *\n   * @param {Object} handshake The handshake data returned from the server\n   * @private\n   */\n  private onHandshake_(handshake: {\n    ts: number;\n    v: string;\n    h: string;\n    s: string;\n  }): void {\n    const timestamp = handshake.ts;\n    const version = handshake.v;\n    const host = handshake.h;\n    this.sessionId = handshake.s;\n    this.repoInfo_.updateHost(host);\n    // if we've already closed the connection, then don't bother trying to progress further\n    if (this.state_ === RealtimeState.CONNECTING) {\n      this.conn_.start();\n      this.onConnectionEstablished_(this.conn_, timestamp);\n      if (PROTOCOL_VERSION !== version) {\n        warn('Protocol version mismatch detected');\n      }\n      // TODO: do we want to upgrade? when? maybe a delay?\n      this.tryStartUpgrade_();\n    }\n  }\n\n  private tryStartUpgrade_() {\n    const conn = this.transportManager_.upgradeTransport();\n    if (conn) {\n      this.startUpgrade_(conn);\n    }\n  }\n\n  private startUpgrade_(conn: TransportConstructor) {\n    this.secondaryConn_ = new conn(\n      this.nextTransportId_(),\n      this.repoInfo_,\n      this.sessionId\n    );\n    // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n    // can consider the transport healthy.\n    this.secondaryResponsesRequired_ =\n      conn['responsesRequiredToBeHealthy'] || 0;\n\n    const onMessage = this.connReceiver_(this.secondaryConn_);\n    const onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n    this.secondaryConn_.open(onMessage, onDisconnect);\n\n    // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\n    setTimeoutNonBlocking(() => {\n      if (this.secondaryConn_) {\n        this.log_('Timed out trying to upgrade.');\n        this.secondaryConn_.close();\n      }\n    }, Math.floor(UPGRADE_TIMEOUT));\n  }\n\n  private onReset_(host: string) {\n    this.log_('Reset packet received.  New host: ' + host);\n    this.repoInfo_.updateHost(host);\n    // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\n    // We don't currently support resets after the connection has already been established\n    if (this.state_ === RealtimeState.CONNECTED) {\n      this.close();\n    } else {\n      // Close whatever connections we have open and start again.\n      this.closeConnections_();\n      this.start_();\n    }\n  }\n\n  private onConnectionEstablished_(conn: Transport, timestamp: number) {\n    this.log_('Realtime connection established.');\n    this.conn_ = conn;\n    this.state_ = RealtimeState.CONNECTED;\n\n    if (this.onReady_) {\n      this.onReady_(timestamp, this.sessionId);\n      this.onReady_ = null;\n    }\n\n    // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\n    // send some pings.\n    if (this.primaryResponsesRequired_ === 0) {\n      this.log_('Primary connection is healthy.');\n      this.isHealthy_ = true;\n    } else {\n      setTimeoutNonBlocking(() => {\n        this.sendPingOnPrimaryIfNecessary_();\n      }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\n    }\n  }\n\n  private sendPingOnPrimaryIfNecessary_() {\n    // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n    if (!this.isHealthy_ && this.state_ === RealtimeState.CONNECTED) {\n      this.log_('sending ping on primary.');\n      this.sendData_({ t: 'c', d: { t: PING, d: {} } });\n    }\n  }\n\n  private onSecondaryConnectionLost_() {\n    const conn = this.secondaryConn_;\n    this.secondaryConn_ = null;\n    if (this.tx_ === conn || this.rx_ === conn) {\n      // we are relying on this connection already in some capacity. Therefore, a failure is real\n      this.close();\n    }\n  }\n\n  /**\n   *\n   * @param {boolean} everConnected Whether or not the connection ever reached a server. Used to determine if\n   * we should flush the host cache\n   * @private\n   */\n  private onConnectionLost_(everConnected: boolean) {\n    this.conn_ = null;\n\n    // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\n    // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.\n    if (!everConnected && this.state_ === RealtimeState.CONNECTING) {\n      this.log_('Realtime connection failed.');\n      // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\n      if (this.repoInfo_.isCacheableHost()) {\n        PersistentStorage.remove('host:' + this.repoInfo_.host);\n        // reset the internal host to what we would show the user, i.e. <ns>.firebaseio.com\n        this.repoInfo_.internalHost = this.repoInfo_.host;\n      }\n    } else if (this.state_ === RealtimeState.CONNECTED) {\n      this.log_('Realtime connection lost.');\n    }\n\n    this.close();\n  }\n\n  /**\n   *\n   * @param {string} reason\n   * @private\n   */\n  private onConnectionShutdown_(reason: string) {\n    this.log_('Connection shutdown command received. Shutting down...');\n\n    if (this.onKill_) {\n      this.onKill_(reason);\n      this.onKill_ = null;\n    }\n\n    // We intentionally don't want to fire onDisconnect (kill is a different case),\n    // so clear the callback.\n    this.onDisconnect_ = null;\n\n    this.close();\n  }\n\n  private sendData_(data: object) {\n    if (this.state_ !== RealtimeState.CONNECTED) {\n      throw 'Connection is not connected';\n    } else {\n      this.tx_.send(data);\n    }\n  }\n\n  /**\n   * Cleans up this connection, calling the appropriate callbacks\n   */\n  close() {\n    if (this.state_ !== RealtimeState.DISCONNECTED) {\n      this.log_('Closing realtime connection.');\n      this.state_ = RealtimeState.DISCONNECTED;\n\n      this.closeConnections_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_();\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  /**\n   *\n   * @private\n   */\n  private closeConnections_() {\n    this.log_('Shutting down all connections');\n    if (this.conn_) {\n      this.conn_.close();\n      this.conn_ = null;\n    }\n\n    if (this.secondaryConn_) {\n      this.secondaryConn_.close();\n      this.secondaryConn_ = null;\n    }\n\n    if (this.healthyTimeout_) {\n      clearTimeout(this.healthyTimeout_);\n      this.healthyTimeout_ = null;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { Query } from '../api/Query';\n\n/**\n * Interface defining the set of actions that can be performed against the Firebase server\n * (basically corresponds to our wire protocol).\n *\n * @interface\n */\nexport abstract class ServerActions {\n  /**\n   * @param {!Query} query\n   * @param {function():string} currentHashFn\n   * @param {?number} tag\n   * @param {function(string, *)} onComplete\n   */\n  abstract listen(\n    query: Query,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ): void;\n\n  /**\n   * Remove a listen.\n   *\n   * @param {!Query} query\n   * @param {?number} tag\n   */\n  abstract unlisten(query: Query, tag: number | null): void;\n\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, string)=} onComplete\n   * @param {string=} hash\n   */\n  put(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void,\n    hash?: string\n  ) {}\n\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, ?string)} onComplete\n   * @param {string=} hash\n   */\n  merge(\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {}\n\n  /**\n   * Refreshes the auth token for the current connection.\n   * @param {string} token The authentication token\n   */\n  refreshAuthToken(token: string) {}\n\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, string)=} onComplete\n   */\n  onDisconnectPut(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  /**\n   * @param {string} pathString\n   * @param {*} data\n   * @param {function(string, string)=} onComplete\n   */\n  onDisconnectMerge(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  /**\n   * @param {string} pathString\n   * @param {function(string, string)=} onComplete\n   */\n  onDisconnectCancel(\n    pathString: string,\n    onComplete?: (a: string, b: string) => void\n  ) {}\n\n  /**\n   * @param {Object.<string, *>} stats\n   */\n  reportStats(stats: { [k: string]: unknown }) {}\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  contains,\n  isEmpty,\n  safeGet,\n  CONSTANTS,\n  stringify,\n  assert,\n  isAdmin,\n  isValidFormat,\n  isMobileCordova,\n  isReactNative,\n  isNodeSdk\n} from '@firebase/util';\n\nimport { error, log, logWrapper, warn, ObjectToUniqueKey } from './util/util';\nimport { Path } from './util/Path';\nimport { VisibilityMonitor } from './util/VisibilityMonitor';\nimport { OnlineMonitor } from './util/OnlineMonitor';\n\nimport { Connection } from '../realtime/Connection';\n\nimport { ServerActions } from './ServerActions';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { RepoInfo } from './RepoInfo';\nimport { Query } from '../api/Query';\nimport { SDK_VERSION } from './version';\n\nconst RECONNECT_MIN_DELAY = 1000;\nconst RECONNECT_MAX_DELAY_DEFAULT = 60 * 5 * 1000; // 5 minutes in milliseconds (Case: 1858)\nconst RECONNECT_MAX_DELAY_FOR_ADMINS = 30 * 1000; // 30 seconds for admin clients (likely to be a backend server)\nconst RECONNECT_DELAY_MULTIPLIER = 1.3;\nconst RECONNECT_DELAY_RESET_TIMEOUT = 30000; // Reset delay back to MIN_DELAY after being connected for 30sec.\nconst SERVER_KILL_INTERRUPT_REASON = 'server_kill';\n\n// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\nconst INVALID_AUTH_TOKEN_THRESHOLD = 3;\n\ninterface ListenSpec {\n  onComplete(s: string, p?: unknown): void;\n\n  hashFn(): string;\n\n  query: Query;\n  tag: number | null;\n}\n\ninterface OnDisconnectRequest {\n  pathString: string;\n  action: string;\n  data: unknown;\n  onComplete?: (a: string, b: string) => void;\n}\n\ninterface OutstandingPut {\n  action: string;\n  request: object;\n  queued?: boolean;\n  onComplete: (a: string, b?: string) => void;\n}\n\n/**\n * Firebase connection.  Abstracts wire protocol and handles reconnecting.\n *\n * NOTE: All JSON objects sent to the realtime connection must have property names enclosed\n * in quotes to make sure the closure compiler does not minify them.\n */\nexport class PersistentConnection extends ServerActions {\n  // Used for diagnostic logging.\n  id = PersistentConnection.nextPersistentConnectionId_++;\n  private log_ = logWrapper('p:' + this.id + ':');\n\n  private interruptReasons_: { [reason: string]: boolean } = {};\n  /** Map<path, Map<queryId, ListenSpec>> */\n  private readonly listens: Map<\n    /* path */ string,\n    Map</* queryId */ string, ListenSpec>\n  > = new Map();\n  private outstandingPuts_: OutstandingPut[] = [];\n  private outstandingPutCount_ = 0;\n  private onDisconnectRequestQueue_: OnDisconnectRequest[] = [];\n  private connected_ = false;\n  private reconnectDelay_ = RECONNECT_MIN_DELAY;\n  private maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\n  private securityDebugCallback_: ((a: object) => void) | null = null;\n  lastSessionId: string | null = null;\n\n  private establishConnectionTimer_: number | null = null;\n\n  private visible_: boolean = false;\n\n  // Before we get connected, we keep a queue of pending messages to send.\n  private requestCBHash_: { [k: number]: (a: unknown) => void } = {};\n  private requestNumber_ = 0;\n\n  private realtime_: {\n    sendRequest(a: object): void;\n    close(): void;\n  } | null = null;\n\n  private authToken_: string | null = null;\n  private forceTokenRefresh_ = false;\n  private invalidAuthTokenCount_ = 0;\n\n  private firstConnection_ = true;\n  private lastConnectionAttemptTime_: number | null = null;\n  private lastConnectionEstablishedTime_: number | null = null;\n\n  private static nextPersistentConnectionId_ = 0;\n\n  /**\n   * Counter for number of connections created. Mainly used for tagging in the logs\n   */\n  private static nextConnectionId_ = 0;\n\n  /**\n   * @implements {ServerActions}\n   * @param repoInfo_ Data about the namespace we are connecting to\n   * @param onDataUpdate_ A callback for new data from the server\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private onConnectStatus_: (a: boolean) => void,\n    private onServerInfoUpdate_: (a: unknown) => void,\n    private authTokenProvider_: AuthTokenProvider,\n    private authOverride_?: object | null\n  ) {\n    super();\n\n    if (authOverride_ && !isNodeSdk()) {\n      throw new Error(\n        'Auth override specified in options, but not supported on non Node.js platforms'\n      );\n    }\n    this.scheduleConnect_(0);\n\n    VisibilityMonitor.getInstance().on('visible', this.onVisible_, this);\n\n    if (repoInfo_.host.indexOf('fblocal') === -1) {\n      OnlineMonitor.getInstance().on('online', this.onOnline_, this);\n    }\n  }\n\n  protected sendRequest(\n    action: string,\n    body: unknown,\n    onResponse?: (a: unknown) => void\n  ) {\n    const curReqNum = ++this.requestNumber_;\n\n    const msg = { r: curReqNum, a: action, b: body };\n    this.log_(stringify(msg));\n    assert(\n      this.connected_,\n      \"sendRequest call when we're not connected not allowed.\"\n    );\n    this.realtime_.sendRequest(msg);\n    if (onResponse) {\n      this.requestCBHash_[curReqNum] = onResponse;\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  listen(\n    query: Query,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ) {\n    const queryId = query.queryIdentifier();\n    const pathString = query.path.toString();\n    this.log_('Listen called for ' + pathString + ' ' + queryId);\n    if (!this.listens.has(pathString)) {\n      this.listens.set(pathString, new Map());\n    }\n    assert(\n      query.getQueryParams().isDefault() ||\n        !query.getQueryParams().loadsAllData(),\n      'listen() called for non-default but complete query'\n    );\n    assert(\n      !this.listens.get(pathString)!.has(queryId),\n      'listen() called twice for same path/queryId.'\n    );\n    const listenSpec: ListenSpec = {\n      onComplete,\n      hashFn: currentHashFn,\n      query,\n      tag\n    };\n    this.listens.get(pathString)!.set(queryId, listenSpec);\n\n    if (this.connected_) {\n      this.sendListen_(listenSpec);\n    }\n  }\n\n  private sendListen_(listenSpec: ListenSpec) {\n    const query = listenSpec.query;\n    const pathString = query.path.toString();\n    const queryId = query.queryIdentifier();\n    this.log_('Listen on ' + pathString + ' for ' + queryId);\n    const req: { [k: string]: unknown } = { /*path*/ p: pathString };\n\n    const action = 'q';\n\n    // Only bother to send query if it's non-default.\n    if (listenSpec.tag) {\n      req['q'] = query.queryObject();\n      req['t'] = listenSpec.tag;\n    }\n\n    req[/*hash*/ 'h'] = listenSpec.hashFn();\n\n    this.sendRequest(action, req, (message: { [k: string]: unknown }) => {\n      const payload: unknown = message[/*data*/ 'd'];\n      const status = message[/*status*/ 's'] as string;\n\n      // print warnings in any case...\n      PersistentConnection.warnOnListenWarnings_(payload, query);\n\n      const currentListenSpec =\n        this.listens.get(pathString) &&\n        this.listens.get(pathString)!.get(queryId);\n      // only trigger actions if the listen hasn't been removed and readded\n      if (currentListenSpec === listenSpec) {\n        this.log_('listen response', message);\n\n        if (status !== 'ok') {\n          this.removeListen_(pathString, queryId);\n        }\n\n        if (listenSpec.onComplete) {\n          listenSpec.onComplete(status, payload);\n        }\n      }\n    });\n  }\n\n  private static warnOnListenWarnings_(payload: unknown, query: 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 as any, 'w');\n      if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n        const indexSpec =\n          '\".indexOn\": \"' +\n          query\n            .getQueryParams()\n            .getIndex()\n            .toString() +\n          '\"';\n        const indexPath = query.path.toString();\n        warn(\n          `Using an unspecified index. Your data will be downloaded and ` +\n            `filtered on the client. Consider adding ${indexSpec} at ` +\n            `${indexPath} to your security rules for better performance.`\n        );\n      }\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  refreshAuthToken(token: string) {\n    this.authToken_ = token;\n    this.log_('Auth token refreshed');\n    if (this.authToken_) {\n      this.tryAuth();\n    } else {\n      //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\n      //the credential so we dont become authenticated next time we connect.\n      if (this.connected_) {\n        this.sendRequest('unauth', {}, () => {});\n      }\n    }\n\n    this.reduceReconnectDelayIfAdminCredential_(token);\n  }\n\n  private reduceReconnectDelayIfAdminCredential_(credential: string) {\n    // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\n    // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\n    const isFirebaseSecret = credential && credential.length === 40;\n    if (isFirebaseSecret || isAdmin(credential)) {\n      this.log_(\n        'Admin auth credential detected.  Reducing max reconnect time.'\n      );\n      this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n    }\n  }\n\n  /**\n   * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\n   * a auth revoked (the connection is closed).\n   */\n  tryAuth() {\n    if (this.connected_ && this.authToken_) {\n      const token = this.authToken_;\n      const authMethod = isValidFormat(token) ? 'auth' : 'gauth';\n      const requestData: { [k: string]: unknown } = { cred: token };\n      if (this.authOverride_ === null) {\n        requestData['noauth'] = true;\n      } else if (typeof this.authOverride_ === 'object') {\n        requestData['authvar'] = this.authOverride_;\n      }\n      this.sendRequest(\n        authMethod,\n        requestData,\n        (res: { [k: string]: unknown }) => {\n          const status = res[/*status*/ 's'] as string;\n          const data = (res[/*data*/ 'd'] as string) || 'error';\n\n          if (this.authToken_ === token) {\n            if (status === 'ok') {\n              this.invalidAuthTokenCount_ = 0;\n            } else {\n              // Triggers reconnect and force refresh for auth token\n              this.onAuthRevoked_(status, data);\n            }\n          }\n        }\n      );\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  unlisten(query: Query, tag: number | null) {\n    const pathString = query.path.toString();\n    const queryId = query.queryIdentifier();\n\n    this.log_('Unlisten called for ' + pathString + ' ' + queryId);\n\n    assert(\n      query.getQueryParams().isDefault() ||\n        !query.getQueryParams().loadsAllData(),\n      'unlisten() called for non-default but complete query'\n    );\n    const listen = this.removeListen_(pathString, queryId);\n    if (listen && this.connected_) {\n      this.sendUnlisten_(pathString, queryId, query.queryObject(), tag);\n    }\n  }\n\n  private sendUnlisten_(\n    pathString: string,\n    queryId: string,\n    queryObj: object,\n    tag: number | null\n  ) {\n    this.log_('Unlisten on ' + pathString + ' for ' + queryId);\n\n    const req: { [k: string]: unknown } = { /*path*/ p: pathString };\n    const action = 'n';\n    // Only bother sending queryId if it's non-default.\n    if (tag) {\n      req['q'] = queryObj;\n      req['t'] = tag;\n    }\n\n    this.sendRequest(action, req);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  onDisconnectPut(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    if (this.connected_) {\n      this.sendOnDisconnect_('o', pathString, data, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'o',\n        data,\n        onComplete\n      });\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  onDisconnectMerge(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    if (this.connected_) {\n      this.sendOnDisconnect_('om', pathString, data, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'om',\n        data,\n        onComplete\n      });\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  onDisconnectCancel(\n    pathString: string,\n    onComplete?: (a: string, b: string) => void\n  ) {\n    if (this.connected_) {\n      this.sendOnDisconnect_('oc', pathString, null, onComplete);\n    } else {\n      this.onDisconnectRequestQueue_.push({\n        pathString,\n        action: 'oc',\n        data: null,\n        onComplete\n      });\n    }\n  }\n\n  private sendOnDisconnect_(\n    action: string,\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string) => void\n  ) {\n    const request = { /*path*/ p: pathString, /*data*/ d: data };\n    this.log_('onDisconnect ' + action, request);\n    this.sendRequest(action, request, (response: { [k: string]: unknown }) => {\n      if (onComplete) {\n        setTimeout(() => {\n          onComplete(\n            response[/*status*/ 's'] as string,\n            response[/* data */ 'd'] as string\n          );\n        }, Math.floor(0));\n      }\n    });\n  }\n\n  /**\n   * @inheritDoc\n   */\n  put(\n    pathString: string,\n    data: unknown,\n    onComplete?: (a: string, b: string) => void,\n    hash?: string\n  ) {\n    this.putInternal('p', pathString, data, onComplete, hash);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  merge(\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {\n    this.putInternal('m', pathString, data, onComplete, hash);\n  }\n\n  putInternal(\n    action: string,\n    pathString: string,\n    data: unknown,\n    onComplete: (a: string, b: string | null) => void,\n    hash?: string\n  ) {\n    const request: { [k: string]: unknown } = {\n      /*path*/ p: pathString,\n      /*data*/ d: data\n    };\n\n    if (hash !== undefined) {\n      request[/*hash*/ 'h'] = hash;\n    }\n\n    // TODO: Only keep track of the most recent put for a given path?\n    this.outstandingPuts_.push({\n      action,\n      request,\n      onComplete\n    });\n\n    this.outstandingPutCount_++;\n    const index = this.outstandingPuts_.length - 1;\n\n    if (this.connected_) {\n      this.sendPut_(index);\n    } else {\n      this.log_('Buffering put: ' + pathString);\n    }\n  }\n\n  private sendPut_(index: number) {\n    const action = this.outstandingPuts_[index].action;\n    const request = this.outstandingPuts_[index].request;\n    const onComplete = this.outstandingPuts_[index].onComplete;\n    this.outstandingPuts_[index].queued = this.connected_;\n\n    this.sendRequest(action, request, (message: { [k: string]: unknown }) => {\n      this.log_(action + ' response', message);\n\n      delete this.outstandingPuts_[index];\n      this.outstandingPutCount_--;\n\n      // Clean up array occasionally.\n      if (this.outstandingPutCount_ === 0) {\n        this.outstandingPuts_ = [];\n      }\n\n      if (onComplete) {\n        onComplete(\n          message[/*status*/ 's'] as string,\n          message[/* data */ 'd'] as string\n        );\n      }\n    });\n  }\n\n  /**\n   * @inheritDoc\n   */\n  reportStats(stats: { [k: string]: unknown }) {\n    // If we're not connected, we just drop the stats.\n    if (this.connected_) {\n      const request = { /*counters*/ c: stats };\n      this.log_('reportStats', request);\n\n      this.sendRequest(/*stats*/ 's', request, result => {\n        const status = result[/*status*/ 's'];\n        if (status !== 'ok') {\n          const errorReason = result[/* data */ 'd'];\n          this.log_('reportStats', 'Error sending stats: ' + errorReason);\n        }\n      });\n    }\n  }\n\n  private onDataMessage_(message: { [k: string]: unknown }) {\n    if ('r' in message) {\n      // this is a response\n      this.log_('from server: ' + stringify(message));\n      const reqNum = message['r'] as string;\n      const onResponse = this.requestCBHash_[reqNum];\n      if (onResponse) {\n        delete this.requestCBHash_[reqNum];\n        onResponse(message[/*body*/ 'b']);\n      }\n    } else if ('error' in message) {\n      throw 'A server-side error has occurred: ' + message['error'];\n    } else if ('a' in message) {\n      // a and b are action and body, respectively\n      this.onDataPush_(message['a'] as string, message['b'] as {});\n    }\n  }\n\n  private onDataPush_(action: string, body: { [k: string]: unknown }) {\n    this.log_('handleServerMessage', action, body);\n    if (action === 'd') {\n      this.onDataUpdate_(\n        body[/*path*/ 'p'] as string,\n        body[/*data*/ 'd'],\n        /*isMerge*/ false,\n        body['t'] as number\n      );\n    } else if (action === 'm') {\n      this.onDataUpdate_(\n        body[/*path*/ 'p'] as string,\n        body[/*data*/ 'd'],\n        /*isMerge=*/ true,\n        body['t'] as number\n      );\n    } else if (action === 'c') {\n      this.onListenRevoked_(\n        body[/*path*/ 'p'] as string,\n        body[/*query*/ 'q'] as unknown[]\n      );\n    } else if (action === 'ac') {\n      this.onAuthRevoked_(\n        body[/*status code*/ 's'] as string,\n        body[/* explanation */ 'd'] as string\n      );\n    } else if (action === 'sd') {\n      this.onSecurityDebugPacket_(body);\n    } else {\n      error(\n        'Unrecognized action received from server: ' +\n          stringify(action) +\n          '\\nAre you using the latest client?'\n      );\n    }\n  }\n\n  private onReady_(timestamp: number, sessionId: string) {\n    this.log_('connection ready');\n    this.connected_ = true;\n    this.lastConnectionEstablishedTime_ = new Date().getTime();\n    this.handleTimestamp_(timestamp);\n    this.lastSessionId = sessionId;\n    if (this.firstConnection_) {\n      this.sendConnectStats_();\n    }\n    this.restoreState_();\n    this.firstConnection_ = false;\n    this.onConnectStatus_(true);\n  }\n\n  private scheduleConnect_(timeout: number) {\n    assert(\n      !this.realtime_,\n      \"Scheduling a connect when we're already connected/ing?\"\n    );\n\n    if (this.establishConnectionTimer_) {\n      clearTimeout(this.establishConnectionTimer_);\n    }\n\n    // NOTE: Even when timeout is 0, it's important to do a setTimeout to work around an infuriating \"Security Error\" in\n    // Firefox when trying to write to our long-polling iframe in some scenarios (e.g. Forge or our unit tests).\n\n    this.establishConnectionTimer_ = setTimeout(() => {\n      this.establishConnectionTimer_ = null;\n      this.establishConnection_();\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    }, Math.floor(timeout)) as any;\n  }\n\n  private onVisible_(visible: boolean) {\n    // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\n    if (\n      visible &&\n      !this.visible_ &&\n      this.reconnectDelay_ === this.maxReconnectDelay_\n    ) {\n      this.log_('Window became visible.  Reducing delay.');\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    }\n    this.visible_ = visible;\n  }\n\n  private onOnline_(online: boolean) {\n    if (online) {\n      this.log_('Browser went online.');\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    } else {\n      this.log_('Browser went offline.  Killing connection.');\n      if (this.realtime_) {\n        this.realtime_.close();\n      }\n    }\n  }\n\n  private onRealtimeDisconnect_() {\n    this.log_('data client disconnected');\n    this.connected_ = false;\n    this.realtime_ = null;\n\n    // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\n    this.cancelSentTransactions_();\n\n    // Clear out the pending requests.\n    this.requestCBHash_ = {};\n\n    if (this.shouldReconnect_()) {\n      if (!this.visible_) {\n        this.log_(\"Window isn't visible.  Delaying reconnect.\");\n        this.reconnectDelay_ = this.maxReconnectDelay_;\n        this.lastConnectionAttemptTime_ = new Date().getTime();\n      } else if (this.lastConnectionEstablishedTime_) {\n        // If we've been connected long enough, reset reconnect delay to minimum.\n        const timeSinceLastConnectSucceeded =\n          new Date().getTime() - this.lastConnectionEstablishedTime_;\n        if (timeSinceLastConnectSucceeded > RECONNECT_DELAY_RESET_TIMEOUT) {\n          this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n        }\n        this.lastConnectionEstablishedTime_ = null;\n      }\n\n      const timeSinceLastConnectAttempt =\n        new Date().getTime() - this.lastConnectionAttemptTime_;\n      let reconnectDelay = Math.max(\n        0,\n        this.reconnectDelay_ - timeSinceLastConnectAttempt\n      );\n      reconnectDelay = Math.random() * reconnectDelay;\n\n      this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\n      this.scheduleConnect_(reconnectDelay);\n\n      // Adjust reconnect delay for next time.\n      this.reconnectDelay_ = Math.min(\n        this.maxReconnectDelay_,\n        this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER\n      );\n    }\n    this.onConnectStatus_(false);\n  }\n\n  private 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 self = this;\n      const lastSessionId = this.lastSessionId;\n      let canceled = false;\n      let connection: Connection | null = null;\n      const closeFn = function() {\n        if (connection) {\n          connection.close();\n        } else {\n          canceled = true;\n          onDisconnect();\n        }\n      };\n      const sendRequestFn = function(msg: object) {\n        assert(\n          connection,\n          \"sendRequest call when we're not connected not allowed.\"\n        );\n        connection.sendRequest(msg);\n      };\n\n      this.realtime_ = {\n        close: closeFn,\n        sendRequest: sendRequestFn\n      };\n\n      const forceRefresh = this.forceTokenRefresh_;\n      this.forceTokenRefresh_ = false;\n\n      // First fetch auth token, and establish connection after fetching the token was successful\n      this.authTokenProvider_\n        .getToken(forceRefresh)\n        .then(result => {\n          if (!canceled) {\n            log('getToken() completed. Creating connection.');\n            self.authToken_ = result && result.accessToken;\n            connection = new Connection(\n              connId,\n              self.repoInfo_,\n              onDataMessage,\n              onReady,\n              onDisconnect,\n              /* onKill= */ reason => {\n                warn(reason + ' (' + self.repoInfo_.toString() + ')');\n                self.interrupt(SERVER_KILL_INTERRUPT_REASON);\n              },\n              lastSessionId\n            );\n          } else {\n            log('getToken() completed but was canceled');\n          }\n        })\n        .then(null, error => {\n          self.log_('Failed to get token: ' + error);\n          if (!canceled) {\n            if (CONSTANTS.NODE_ADMIN) {\n              // This may be a critical error for the Admin Node.js SDK, so log a warning.\n              // But getToken() may also just have temporarily failed, so we still want to\n              // continue retrying.\n              warn(error);\n            }\n            closeFn();\n          }\n        });\n    }\n  }\n\n  interrupt(reason: string) {\n    log('Interrupting connection for reason: ' + reason);\n    this.interruptReasons_[reason] = true;\n    if (this.realtime_) {\n      this.realtime_.close();\n    } else {\n      if (this.establishConnectionTimer_) {\n        clearTimeout(this.establishConnectionTimer_);\n        this.establishConnectionTimer_ = null;\n      }\n      if (this.connected_) {\n        this.onRealtimeDisconnect_();\n      }\n    }\n  }\n\n  resume(reason: string) {\n    log('Resuming connection for reason: ' + reason);\n    delete this.interruptReasons_[reason];\n    if (isEmpty(this.interruptReasons_)) {\n      this.reconnectDelay_ = RECONNECT_MIN_DELAY;\n      if (!this.realtime_) {\n        this.scheduleConnect_(0);\n      }\n    }\n  }\n\n  private handleTimestamp_(timestamp: number) {\n    const delta = timestamp - new Date().getTime();\n    this.onServerInfoUpdate_({ serverTimeOffset: delta });\n  }\n\n  private cancelSentTransactions_() {\n    for (let i = 0; i < this.outstandingPuts_.length; i++) {\n      const put = this.outstandingPuts_[i];\n      if (put && /*hash*/ 'h' in put.request && put.queued) {\n        if (put.onComplete) {\n          put.onComplete('disconnect');\n        }\n\n        delete this.outstandingPuts_[i];\n        this.outstandingPutCount_--;\n      }\n    }\n\n    // Clean up array occasionally.\n    if (this.outstandingPutCount_ === 0) {\n      this.outstandingPuts_ = [];\n    }\n  }\n\n  private onListenRevoked_(pathString: string, query?: unknown[]) {\n    // Remove the listen and manufacture a \"permission_denied\" error for the failed listen.\n    let queryId;\n    if (!query) {\n      queryId = 'default';\n    } else {\n      queryId = query.map(q => ObjectToUniqueKey(q)).join('$');\n    }\n    const listen = this.removeListen_(pathString, queryId);\n    if (listen && listen.onComplete) {\n      listen.onComplete('permission_denied');\n    }\n  }\n\n  private removeListen_(pathString: string, queryId: string): ListenSpec {\n    const normalizedPathString = new Path(pathString).toString(); // normalize path.\n    let listen;\n    if (this.listens.has(normalizedPathString)) {\n      const map = this.listens.get(normalizedPathString)!;\n      listen = map.get(queryId);\n      map.delete(queryId);\n      if (map.size === 0) {\n        this.listens.delete(normalizedPathString);\n      }\n    } else {\n      // all listens for this path has already been removed\n      listen = undefined;\n    }\n    return listen;\n  }\n\n  private onAuthRevoked_(statusCode: string, explanation: string) {\n    log('Auth token revoked: ' + statusCode + '/' + explanation);\n    this.authToken_ = null;\n    this.forceTokenRefresh_ = true;\n    this.realtime_.close();\n    if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\n      // We'll wait a couple times before logging the warning / increasing the\n      // retry period since oauth tokens will report as \"invalid\" if they're\n      // just expired. Plus there may be transient issues that resolve themselves.\n      this.invalidAuthTokenCount_++;\n      if (this.invalidAuthTokenCount_ >= INVALID_AUTH_TOKEN_THRESHOLD) {\n        // Set a long reconnect delay because recovery is unlikely\n        this.reconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n\n        // Notify the auth token provider that the token is invalid, which will log\n        // a warning\n        this.authTokenProvider_.notifyForInvalidToken();\n      }\n    }\n  }\n\n  private onSecurityDebugPacket_(body: { [k: string]: unknown }) {\n    if (this.securityDebugCallback_) {\n      this.securityDebugCallback_(body);\n    } else {\n      if ('msg' in body) {\n        console.log(\n          'FIREBASE: ' + (body['msg'] as string).replace('\\n', '\\nFIREBASE: ')\n        );\n      }\n    }\n  }\n\n  private restoreState_() {\n    //Re-authenticate ourselves if we have a credential stored.\n    this.tryAuth();\n\n    // Puts depend on having received the corresponding data update from the server before they complete, so we must\n    // make sure to send listens before puts.\n    for (const queries of this.listens.values()) {\n      for (const listenSpec of queries.values()) {\n        this.sendListen_(listenSpec);\n      }\n    }\n\n    for (let i = 0; i < this.outstandingPuts_.length; i++) {\n      if (this.outstandingPuts_[i]) {\n        this.sendPut_(i);\n      }\n    }\n\n    while (this.onDisconnectRequestQueue_.length) {\n      const request = this.onDisconnectRequestQueue_.shift();\n      this.sendOnDisconnect_(\n        request.action,\n        request.pathString,\n        request.data,\n        request.onComplete\n      );\n    }\n  }\n\n  /**\n   * Sends client stats for first connection\n   */\n  private sendConnectStats_() {\n    const stats: { [k: string]: number } = {};\n\n    let clientName = 'js';\n    if (CONSTANTS.NODE_ADMIN) {\n      clientName = 'admin_node';\n    } else if (CONSTANTS.NODE_CLIENT) {\n      clientName = 'node';\n    }\n\n    stats['sdk.' + clientName + '.' + SDK_VERSION.replace(/\\./g, '-')] = 1;\n\n    if (isMobileCordova()) {\n      stats['framework.cordova'] = 1;\n    } else if (isReactNative()) {\n      stats['framework.reactnative'] = 1;\n    }\n    this.reportStats(stats);\n  }\n\n  private shouldReconnect_(): boolean {\n    const online = OnlineMonitor.getInstance().currentlyOnline();\n    return isEmpty(this.interruptReasons_) && online;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, jsonEval, safeGet, querystring } from '@firebase/util';\nimport { logWrapper, warn } from './util/util';\n\nimport { ServerActions } from './ServerActions';\nimport { RepoInfo } from './RepoInfo';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { Query } from '../api/Query';\n\n/**\n * An implementation of ServerActions that communicates with the server via REST requests.\n * This is mostly useful for compatibility with crawlers, where we don't want to spin up a full\n * persistent connection (using WebSockets or long-polling)\n */\nexport class ReadonlyRestClient extends ServerActions {\n  reportStats(stats: { [k: string]: unknown }): void {\n    throw new Error('Method not implemented.');\n  }\n\n  /** @private {function(...[*])} */\n  private log_: (...args: unknown[]) => void = logWrapper('p:rest:');\n\n  /**\n   * We don't actually need to track listens, except to prevent us calling an onComplete for a listen\n   * that's been removed. :-/\n   *\n   * @private {!Object.<string, !Object>}\n   */\n  private listens_: { [k: string]: object } = {};\n\n  /**\n   * @param {!Query} query\n   * @param {?number=} tag\n   * @return {string}\n   * @private\n   */\n  static getListenId_(query: Query, tag?: number | null): string {\n    if (tag !== undefined) {\n      return 'tag$' + tag;\n    } else {\n      assert(\n        query.getQueryParams().isDefault(),\n        \"should have a tag if it's not a default query.\"\n      );\n      return query.path.toString();\n    }\n  }\n\n  /**\n   * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\n   * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\n   * @param {AuthTokenProvider} authTokenProvider_\n   * @implements {ServerActions}\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private authTokenProvider_: AuthTokenProvider\n  ) {\n    super();\n  }\n\n  /** @inheritDoc */\n  listen(\n    query: Query,\n    currentHashFn: () => string,\n    tag: number | null,\n    onComplete: (a: string, b: unknown) => void\n  ) {\n    const pathString = query.path.toString();\n    this.log_(\n      'Listen called for ' + pathString + ' ' + query.queryIdentifier()\n    );\n\n    // Mark this listener so we can tell if it's removed.\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    const thisListen = {};\n    this.listens_[listenId] = thisListen;\n\n    const queryStringParameters = query\n      .getQueryParams()\n      .toRestQueryStringParameters();\n\n    this.restRequest_(\n      pathString + '.json',\n      queryStringParameters,\n      (error, result) => {\n        let data = result;\n\n        if (error === 404) {\n          data = null;\n          error = null;\n        }\n\n        if (error === null) {\n          this.onDataUpdate_(pathString, data, /*isMerge=*/ false, tag);\n        }\n\n        if (safeGet(this.listens_, listenId) === thisListen) {\n          let status;\n          if (!error) {\n            status = 'ok';\n          } else if (error === 401) {\n            status = 'permission_denied';\n          } else {\n            status = 'rest_error:' + error;\n          }\n\n          onComplete(status, null);\n        }\n      }\n    );\n  }\n\n  /** @inheritDoc */\n  unlisten(query: Query, tag: number | null) {\n    const listenId = ReadonlyRestClient.getListenId_(query, tag);\n    delete this.listens_[listenId];\n  }\n\n  /** @inheritDoc */\n  refreshAuthToken(token: string) {\n    // no-op since we just always call getToken.\n  }\n\n  /**\n   * Performs a REST request to the given path, with the provided query string parameters,\n   * and any auth credentials we have.\n   *\n   * @param {!string} pathString\n   * @param {!Object.<string, *>} queryStringParameters\n   * @param {?function(?number, *=)} callback\n   * @private\n   */\n  private restRequest_(\n    pathString: string,\n    queryStringParameters: { [k: string]: string | number } = {},\n    callback: ((a: number | null, b?: unknown) => void) | null\n  ) {\n    queryStringParameters['format'] = 'export';\n\n    this.authTokenProvider_\n      .getToken(/*forceRefresh=*/ false)\n      .then(authTokenData => {\n        const authToken = authTokenData && authTokenData.accessToken;\n        if (authToken) {\n          queryStringParameters['auth'] = authToken;\n        }\n\n        const url =\n          (this.repoInfo_.secure ? 'https://' : 'http://') +\n          this.repoInfo_.host +\n          pathString +\n          '?' +\n          'ns=' +\n          this.repoInfo_.namespace +\n          querystring(queryStringParameters);\n\n        this.log_('Sending REST request for ' + url);\n        const xhr = new XMLHttpRequest();\n        xhr.onreadystatechange = () => {\n          if (callback && xhr.readyState === 4) {\n            this.log_(\n              'REST Response for ' + url + ' received. status:',\n              xhr.status,\n              'response:',\n              xhr.responseText\n            );\n            let res = null;\n            if (xhr.status >= 200 && xhr.status < 300) {\n              try {\n                res = jsonEval(xhr.responseText);\n              } catch (e) {\n                warn(\n                  'Failed to parse JSON response for ' +\n                    url +\n                    ': ' +\n                    xhr.responseText\n                );\n              }\n              callback(null, res);\n            } else {\n              // 401 and 404 are expected.\n              if (xhr.status !== 401 && xhr.status !== 404) {\n                warn(\n                  'Got unsuccessful REST response for ' +\n                    url +\n                    ' Status: ' +\n                    xhr.status\n                );\n              }\n              callback(xhr.status);\n            }\n            callback = null;\n          }\n        };\n\n        xhr.open('GET', url, /*asynchronous=*/ true);\n        xhr.send();\n      });\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a\n * params object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n */\nexport function querystring(querystringParams: {\n  [key: string]: string | number;\n}): string {\n  const params = [];\n  for (const [key, value] of Object.entries(querystringParams)) {\n    if (Array.isArray(value)) {\n      value.forEach(arrayVal => {\n        params.push(\n          encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal)\n        );\n      });\n    } else {\n      params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n    }\n  }\n  return params.length ? '&' + params.join('&') : '';\n}\n\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object\n * (e.g. {arg: 'val', arg2: 'val2'})\n */\nexport function querystringDecode(querystring: string): object {\n  const obj: { [key: string]: unknown } = {};\n  const tokens = querystring.replace(/^\\?/, '').split('&');\n\n  tokens.forEach(token => {\n    if (token) {\n      const key = token.split('=');\n      obj[key[0]] = key[1];\n    }\n  });\n  return obj;\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n  generateWithValues,\n  resolveDeferredValueSnapshot,\n  resolveDeferredValueTree\n} from './util/ServerValues';\nimport { nodeFromJSON } from './snap/nodeFromJSON';\nimport { Path } from './util/Path';\nimport { SparseSnapshotTree } from './SparseSnapshotTree';\nimport { SyncTree } from './SyncTree';\nimport { SnapshotHolder } from './SnapshotHolder';\nimport { stringify, map, isEmpty } from '@firebase/util';\nimport { beingCrawled, each, exceptionGuard, warn, log } from './util/util';\n\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { StatsManager } from './stats/StatsManager';\nimport { StatsReporter } from './stats/StatsReporter';\nimport { StatsListener } from './stats/StatsListener';\nimport { EventQueue } from './view/EventQueue';\nimport { PersistentConnection } from './PersistentConnection';\nimport { ReadonlyRestClient } from './ReadonlyRestClient';\nimport { FirebaseApp } from '@firebase/app-types';\nimport { RepoInfo } from './RepoInfo';\nimport { Database } from '../api/Database';\nimport { ServerActions } from './ServerActions';\nimport { Query } from '../api/Query';\nimport { EventRegistration } from './view/EventRegistration';\nimport { StatsCollection } from './stats/StatsCollection';\nimport { Event } from './view/Event';\nimport { Node } from './snap/Node';\nimport { FirebaseAuthInternalName } from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\nimport { Indexable } from './util/misc';\n\nconst INTERRUPT_REASON = 'repo_interrupt';\n\n/**\n * A connection to a single data repository.\n */\nexport class Repo {\n  dataUpdateCount = 0;\n  private infoSyncTree_: SyncTree;\n  private serverSyncTree_: SyncTree;\n\n  private stats_: StatsCollection;\n  private statsListener_: StatsListener | null = null;\n  private eventQueue_ = new EventQueue();\n  private nextWriteId_ = 1;\n  private server_: ServerActions;\n  private statsReporter_: StatsReporter;\n  private transactionsInit_: () => void;\n  private infoData_: SnapshotHolder;\n  private abortTransactions_: (path: Path) => Path;\n  private rerunTransactions_: (changedPath: Path) => Path;\n  private interceptServerDataCallback_:\n    | ((a: string, b: unknown) => void)\n    | null = null;\n  private __database: Database;\n\n  /** A list of data pieces and paths to be set when this client disconnects. */\n  private onDisconnect_ = new SparseSnapshotTree();\n\n  // TODO: This should be @private but it's used by test_access.js and internal.js\n  persistentConnection_: PersistentConnection | null = null;\n\n  constructor(\n    public repoInfo_: RepoInfo,\n    forceRestClient: boolean,\n    public app: FirebaseApp,\n    authProvider: Provider<FirebaseAuthInternalName>\n  ) {\n    const authTokenProvider = new AuthTokenProvider(app, authProvider);\n\n    this.stats_ = StatsManager.getCollection(repoInfo_);\n\n    if (forceRestClient || beingCrawled()) {\n      this.server_ = new ReadonlyRestClient(\n        this.repoInfo_,\n        this.onDataUpdate_.bind(this),\n        authTokenProvider\n      );\n\n      // Minor hack: Fire onConnect immediately, since there's no actual connection.\n      setTimeout(this.onConnectStatus_.bind(this, true), 0);\n    } else {\n      const authOverride = app.options['databaseAuthVariableOverride'];\n      // Validate authOverride\n      if (typeof authOverride !== 'undefined' && authOverride !== null) {\n        if (typeof authOverride !== 'object') {\n          throw new Error(\n            'Only objects are supported for option databaseAuthVariableOverride'\n          );\n        }\n        try {\n          stringify(authOverride);\n        } catch (e) {\n          throw new Error('Invalid authOverride provided: ' + e);\n        }\n      }\n\n      this.persistentConnection_ = new PersistentConnection(\n        this.repoInfo_,\n        this.onDataUpdate_.bind(this),\n        this.onConnectStatus_.bind(this),\n        this.onServerInfoUpdate_.bind(this),\n        authTokenProvider,\n        authOverride\n      );\n\n      this.server_ = this.persistentConnection_;\n    }\n\n    authTokenProvider.addTokenChangeListener(token => {\n      this.server_.refreshAuthToken(token);\n    });\n\n    // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\n    // we only want to create one StatsReporter.  As such, we'll report stats over the first Repo created.\n    this.statsReporter_ = StatsManager.getOrCreateReporter(\n      repoInfo_,\n      () => new StatsReporter(this.stats_, this.server_)\n    );\n\n    this.transactionsInit_();\n\n    // Used for .info.\n    this.infoData_ = new SnapshotHolder();\n    this.infoSyncTree_ = new SyncTree({\n      startListening: (query, tag, currentHashFn, onComplete) => {\n        let infoEvents: Event[] = [];\n        const node = this.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 = this.infoSyncTree_.applyServerOverwrite(\n            query.path,\n            node\n          );\n          setTimeout(() => {\n            onComplete('ok');\n          }, 0);\n        }\n        return infoEvents;\n      },\n      stopListening: () => {}\n    });\n    this.updateInfo_('connected', false);\n\n    this.serverSyncTree_ = new SyncTree({\n      startListening: (query, tag, currentHashFn, onComplete) => {\n        this.server_.listen(query, currentHashFn, tag, (status, data) => {\n          const events = onComplete(status, data);\n          this.eventQueue_.raiseEventsForChangedPath(query.path, events);\n        });\n        // No synchronous events for network-backed sync trees\n        return [];\n      },\n      stopListening: (query, tag) => {\n        this.server_.unlisten(query, tag);\n      }\n    });\n  }\n\n  /**\n   * @return The URL corresponding to the root of this Firebase.\n   */\n  toString(): string {\n    return (\n      (this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host\n    );\n  }\n\n  /**\n   * @return The namespace represented by the repo.\n   */\n  name(): string {\n    return this.repoInfo_.namespace;\n  }\n\n  /**\n   * @return The time in milliseconds, taking the server offset into account if we have one.\n   */\n  serverTime(): number {\n    const offsetNode = this.infoData_.getNode(\n      new Path('.info/serverTimeOffset')\n    );\n    const offset = (offsetNode.val() as number) || 0;\n    return new Date().getTime() + offset;\n  }\n\n  /**\n   * Generate ServerValues using some variables from the repo object.\n   */\n  generateServerValues(): Indexable {\n    return generateWithValues({\n      timestamp: this.serverTime()\n    });\n  }\n\n  /**\n   * Called by realtime when we get new messages from the server.\n   */\n  private onDataUpdate_(\n    pathString: string,\n    data: unknown,\n    isMerge: boolean,\n    tag: number | null\n  ) {\n    // For testing.\n    this.dataUpdateCount++;\n    const path = new Path(pathString);\n    data = this.interceptServerDataCallback_\n      ? this.interceptServerDataCallback_(pathString, data)\n      : data;\n    let events = [];\n    if (tag) {\n      if (isMerge) {\n        const taggedChildren = map(\n          data as { [k: string]: unknown },\n          (raw: unknown) => nodeFromJSON(raw)\n        );\n        events = this.serverSyncTree_.applyTaggedQueryMerge(\n          path,\n          taggedChildren,\n          tag\n        );\n      } else {\n        const taggedSnap = nodeFromJSON(data);\n        events = this.serverSyncTree_.applyTaggedQueryOverwrite(\n          path,\n          taggedSnap,\n          tag\n        );\n      }\n    } else if (isMerge) {\n      const changedChildren = map(\n        data as { [k: string]: unknown },\n        (raw: unknown) => nodeFromJSON(raw)\n      );\n      events = this.serverSyncTree_.applyServerMerge(path, changedChildren);\n    } else {\n      const snap = nodeFromJSON(data);\n      events = this.serverSyncTree_.applyServerOverwrite(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 = this.rerunTransactions_(path);\n    }\n    this.eventQueue_.raiseEventsForChangedPath(affectedPath, events);\n  }\n\n  // TODO: This should be @private but it's used by test_access.js and internal.js\n  interceptServerData_(callback: ((a: string, b: unknown) => unknown) | null) {\n    this.interceptServerDataCallback_ = callback;\n  }\n\n  private onConnectStatus_(connectStatus: boolean) {\n    this.updateInfo_('connected', connectStatus);\n    if (connectStatus === false) {\n      this.runOnDisconnectEvents_();\n    }\n  }\n\n  private onServerInfoUpdate_(updates: object) {\n    each(updates, (key: string, value: unknown) => {\n      this.updateInfo_(key, value);\n    });\n  }\n\n  private updateInfo_(pathString: string, value: unknown) {\n    const path = new Path('/.info/' + pathString);\n    const newNode = nodeFromJSON(value);\n    this.infoData_.updateSnapshot(path, newNode);\n    const events = this.infoSyncTree_.applyServerOverwrite(path, newNode);\n    this.eventQueue_.raiseEventsForChangedPath(path, events);\n  }\n\n  private getNextWriteId_(): number {\n    return this.nextWriteId_++;\n  }\n\n  setWithPriority(\n    path: Path,\n    newVal: unknown,\n    newPriority: number | string | null,\n    onComplete: ((status: Error | null, errorReason?: string) => void) | null\n  ) {\n    this.log_('set', {\n      path: path.toString(),\n      value: newVal,\n      priority: newPriority\n    });\n\n    // TODO: Optimize this behavior to either (a) store flag to skip resolving where possible and / or\n    // (b) store unresolved paths on JSON parse\n    const serverValues = this.generateServerValues();\n    const newNodeUnresolved = nodeFromJSON(newVal, newPriority);\n    const existing = this.serverSyncTree_.calcCompleteEventCache(path);\n    const newNode = resolveDeferredValueSnapshot(\n      newNodeUnresolved,\n      existing,\n      serverValues\n    );\n\n    const writeId = this.getNextWriteId_();\n    const events = this.serverSyncTree_.applyUserOverwrite(\n      path,\n      newNode,\n      writeId,\n      true\n    );\n    this.eventQueue_.queueEvents(events);\n    this.server_.put(\n      path.toString(),\n      newNodeUnresolved.val(/*export=*/ true),\n      (status, errorReason) => {\n        const success = status === 'ok';\n        if (!success) {\n          warn('set at ' + path + ' failed: ' + status);\n        }\n\n        const clearEvents = this.serverSyncTree_.ackUserWrite(\n          writeId,\n          !success\n        );\n        this.eventQueue_.raiseEventsForChangedPath(path, clearEvents);\n        this.callOnCompleteCallback(onComplete, status, errorReason);\n      }\n    );\n    const affectedPath = this.abortTransactions_(path);\n    this.rerunTransactions_(affectedPath);\n    // We queued the events above, so just flush the queue here\n    this.eventQueue_.raiseEventsForChangedPath(affectedPath, []);\n  }\n\n  update(\n    path: Path,\n    childrenToMerge: { [k: string]: unknown },\n    onComplete: ((status: Error | null, errorReason?: string) => void) | null\n  ) {\n    this.log_('update', { path: path.toString(), value: childrenToMerge });\n\n    // Start with our existing data and merge each child into it.\n    let empty = true;\n    const serverValues = this.generateServerValues();\n    const changedChildren: { [k: string]: Node } = {};\n    each(childrenToMerge, (changedKey: string, changedValue: unknown) => {\n      empty = false;\n      changedChildren[changedKey] = resolveDeferredValueTree(\n        path.child(changedKey),\n        nodeFromJSON(changedValue),\n        this.serverSyncTree_,\n        serverValues\n      );\n    });\n\n    if (!empty) {\n      const writeId = this.getNextWriteId_();\n      const events = this.serverSyncTree_.applyUserMerge(\n        path,\n        changedChildren,\n        writeId\n      );\n      this.eventQueue_.queueEvents(events);\n      this.server_.merge(\n        path.toString(),\n        childrenToMerge,\n        (status, errorReason) => {\n          const success = status === 'ok';\n          if (!success) {\n            warn('update at ' + path + ' failed: ' + status);\n          }\n\n          const clearEvents = this.serverSyncTree_.ackUserWrite(\n            writeId,\n            !success\n          );\n          const affectedPath =\n            clearEvents.length > 0 ? this.rerunTransactions_(path) : path;\n          this.eventQueue_.raiseEventsForChangedPath(affectedPath, clearEvents);\n          this.callOnCompleteCallback(onComplete, status, errorReason);\n        }\n      );\n\n      each(childrenToMerge, (changedPath: string) => {\n        const affectedPath = this.abortTransactions_(path.child(changedPath));\n        this.rerunTransactions_(affectedPath);\n      });\n\n      // We queued the events above, so just flush the queue here\n      this.eventQueue_.raiseEventsForChangedPath(path, []);\n    } else {\n      log(\"update() called with empty data.  Don't do anything.\");\n      this.callOnCompleteCallback(onComplete, 'ok');\n    }\n  }\n\n  /**\n   * Applies all of the changes stored up in the onDisconnect_ tree.\n   */\n  private runOnDisconnectEvents_() {\n    this.log_('onDisconnectEvents');\n\n    const serverValues = this.generateServerValues();\n    const resolvedOnDisconnectTree = new SparseSnapshotTree();\n    this.onDisconnect_.forEachTree(Path.Empty, (path, node) => {\n      const resolved = resolveDeferredValueTree(\n        path,\n        node,\n        this.serverSyncTree_,\n        serverValues\n      );\n      resolvedOnDisconnectTree.remember(path, resolved);\n    });\n    let events: Event[] = [];\n\n    resolvedOnDisconnectTree.forEachTree(Path.Empty, (path, snap) => {\n      events = events.concat(\n        this.serverSyncTree_.applyServerOverwrite(path, snap)\n      );\n      const affectedPath = this.abortTransactions_(path);\n      this.rerunTransactions_(affectedPath);\n    });\n\n    this.onDisconnect_ = new SparseSnapshotTree();\n    this.eventQueue_.raiseEventsForChangedPath(Path.Empty, events);\n  }\n\n  onDisconnectCancel(\n    path: Path,\n    onComplete: ((status: Error | null, errorReason?: string) => void) | null\n  ) {\n    this.server_.onDisconnectCancel(path.toString(), (status, errorReason) => {\n      if (status === 'ok') {\n        this.onDisconnect_.forget(path);\n      }\n      this.callOnCompleteCallback(onComplete, status, errorReason);\n    });\n  }\n\n  onDisconnectSet(\n    path: Path,\n    value: unknown,\n    onComplete: ((status: Error | null, errorReason?: string) => void) | null\n  ) {\n    const newNode = nodeFromJSON(value);\n    this.server_.onDisconnectPut(\n      path.toString(),\n      newNode.val(/*export=*/ true),\n      (status, errorReason) => {\n        if (status === 'ok') {\n          this.onDisconnect_.remember(path, newNode);\n        }\n        this.callOnCompleteCallback(onComplete, status, errorReason);\n      }\n    );\n  }\n\n  onDisconnectSetWithPriority(\n    path: Path,\n    value: unknown,\n    priority: unknown,\n    onComplete: ((status: Error | null, errorReason?: string) => void) | null\n  ) {\n    const newNode = nodeFromJSON(value, priority);\n    this.server_.onDisconnectPut(\n      path.toString(),\n      newNode.val(/*export=*/ true),\n      (status, errorReason) => {\n        if (status === 'ok') {\n          this.onDisconnect_.remember(path, newNode);\n        }\n        this.callOnCompleteCallback(onComplete, status, errorReason);\n      }\n    );\n  }\n\n  onDisconnectUpdate(\n    path: Path,\n    childrenToMerge: { [k: string]: unknown },\n    onComplete: ((status: Error | null, errorReason?: string) => void) | null\n  ) {\n    if (isEmpty(childrenToMerge)) {\n      log(\n        \"onDisconnect().update() called with empty data.  Don't do anything.\"\n      );\n      this.callOnCompleteCallback(onComplete, 'ok');\n      return;\n    }\n\n    this.server_.onDisconnectMerge(\n      path.toString(),\n      childrenToMerge,\n      (status, errorReason) => {\n        if (status === 'ok') {\n          each(childrenToMerge, (childName: string, childNode: unknown) => {\n            const newChildNode = nodeFromJSON(childNode);\n            this.onDisconnect_.remember(path.child(childName), newChildNode);\n          });\n        }\n        this.callOnCompleteCallback(onComplete, status, errorReason);\n      }\n    );\n  }\n\n  addEventCallbackForQuery(query: Query, eventRegistration: EventRegistration) {\n    let events;\n    if (query.path.getFront() === '.info') {\n      events = this.infoSyncTree_.addEventRegistration(\n        query,\n        eventRegistration\n      );\n    } else {\n      events = this.serverSyncTree_.addEventRegistration(\n        query,\n        eventRegistration\n      );\n    }\n    this.eventQueue_.raiseEventsAtPath(query.path, events);\n  }\n\n  removeEventCallbackForQuery(\n    query: Query,\n    eventRegistration: EventRegistration\n  ) {\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 (query.path.getFront() === '.info') {\n      events = this.infoSyncTree_.removeEventRegistration(\n        query,\n        eventRegistration\n      );\n    } else {\n      events = this.serverSyncTree_.removeEventRegistration(\n        query,\n        eventRegistration\n      );\n    }\n    this.eventQueue_.raiseEventsAtPath(query.path, events);\n  }\n\n  interrupt() {\n    if (this.persistentConnection_) {\n      this.persistentConnection_.interrupt(INTERRUPT_REASON);\n    }\n  }\n\n  resume() {\n    if (this.persistentConnection_) {\n      this.persistentConnection_.resume(INTERRUPT_REASON);\n    }\n  }\n\n  stats(showDelta: boolean = false) {\n    if (typeof console === 'undefined') {\n      return;\n    }\n\n    let stats: { [k: string]: unknown };\n    if (showDelta) {\n      if (!this.statsListener_) {\n        this.statsListener_ = new StatsListener(this.stats_);\n      }\n      stats = this.statsListener_.get();\n    } else {\n      stats = this.stats_.get();\n    }\n\n    const longestName = Object.keys(stats).reduce(\n      (previousValue, currentValue) =>\n        Math.max(currentValue.length, previousValue),\n      0\n    );\n\n    each(stats, (stat: string, value: unknown) => {\n      let paddedStat = stat;\n      // pad stat names to be the same length (plus 2 extra spaces).\n      for (let i = stat.length; i < longestName + 2; i++) {\n        paddedStat += ' ';\n      }\n      console.log(paddedStat + value);\n    });\n  }\n\n  statsIncrementCounter(metric: string) {\n    this.stats_.incrementCounter(metric);\n    this.statsReporter_.includeStat(metric);\n  }\n\n  private log_(...varArgs: unknown[]) {\n    let prefix = '';\n    if (this.persistentConnection_) {\n      prefix = this.persistentConnection_.id + ':';\n    }\n    log(prefix, ...varArgs);\n  }\n\n  callOnCompleteCallback(\n    callback: ((status: Error | null, errorReason?: string) => void) | null,\n    status: string,\n    errorReason?: string | null\n  ) {\n    if (callback) {\n      exceptionGuard(() => {\n        if (status === 'ok') {\n          callback(null);\n        } else {\n          const code = (status || 'error').toUpperCase();\n          let message = code;\n          if (errorReason) {\n            message += ': ' + errorReason;\n          }\n\n          const error = new Error(message);\n          // eslint-disable-next-line @typescript-eslint/no-explicit-any\n          (error as any).code = code;\n          callback(error);\n        }\n      });\n    }\n  }\n\n  get database(): Database {\n    return this.__database || (this.__database = new Database(this));\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { IndexedFilter } from './IndexedFilter';\nimport { PRIORITY_INDEX } from '../../snap/indexes/PriorityIndex';\nimport { NamedNode, Node } from '../../../core/snap/Node';\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { NodeFilter } from './NodeFilter';\nimport { QueryParams } from '../QueryParams';\nimport { Index } from '../../snap/indexes/Index';\nimport { Path } from '../../util/Path';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\n\n/**\n * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\n *\n * @constructor\n * @implements {NodeFilter}\n */\nexport class RangedFilter implements NodeFilter {\n  /**\n   * @type {!IndexedFilter}\n   * @const\n   * @private\n   */\n  private indexedFilter_: IndexedFilter;\n\n  /**\n   * @const\n   * @type {!Index}\n   * @private\n   */\n  private index_: Index;\n\n  /**\n   * @const\n   * @type {!NamedNode}\n   * @private\n   */\n  private startPost_: NamedNode;\n\n  /**\n   * @const\n   * @type {!NamedNode}\n   * @private\n   */\n  private endPost_: NamedNode;\n\n  /**\n   * @param {!QueryParams} params\n   */\n  constructor(params: QueryParams) {\n    this.indexedFilter_ = new IndexedFilter(params.getIndex());\n    this.index_ = params.getIndex();\n    this.startPost_ = RangedFilter.getStartPost_(params);\n    this.endPost_ = RangedFilter.getEndPost_(params);\n  }\n\n  /**\n   * @return {!NamedNode}\n   */\n  getStartPost(): NamedNode {\n    return this.startPost_;\n  }\n\n  /**\n   * @return {!NamedNode}\n   */\n  getEndPost(): NamedNode {\n    return this.endPost_;\n  }\n\n  /**\n   * @param {!NamedNode} node\n   * @return {boolean}\n   */\n  matches(node: NamedNode): boolean {\n    return (\n      this.index_.compare(this.getStartPost(), node) <= 0 &&\n      this.index_.compare(node, this.getEndPost()) <= 0\n    );\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (!this.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    return this.indexedFilter_.updateChild(\n      snap,\n      key,\n      newChild,\n      affectedPath,\n      source,\n      optChangeAccumulator\n    );\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (newSnap.isLeafNode()) {\n      // Make sure we have a children node with the correct index, not a leaf node;\n      newSnap = ChildrenNode.EMPTY_NODE;\n    }\n    let filtered = newSnap.withIndex(this.index_);\n    // Don't support priorities on queries\n    filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);\n    const self = this;\n    newSnap.forEachChild(PRIORITY_INDEX, (key, childNode) => {\n      if (!self.matches(new NamedNode(key, childNode))) {\n        filtered = filtered.updateImmediateChild(key, ChildrenNode.EMPTY_NODE);\n      }\n    });\n    return this.indexedFilter_.updateFullNode(\n      oldSnap,\n      filtered,\n      optChangeAccumulator\n    );\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  filtersNodes(): boolean {\n    return true;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getIndexedFilter(): IndexedFilter {\n    return this.indexedFilter_;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  /**\n   * @param {!QueryParams} params\n   * @return {!NamedNode}\n   * @private\n   */\n  private static getStartPost_(params: QueryParams): NamedNode {\n    if (params.hasStart()) {\n      const startName = params.getIndexStartName();\n      return params.getIndex().makePost(params.getIndexStartValue(), startName);\n    } else {\n      return params.getIndex().minPost();\n    }\n  }\n\n  /**\n   * @param {!QueryParams} params\n   * @return {!NamedNode}\n   * @private\n   */\n  private static getEndPost_(params: QueryParams): NamedNode {\n    if (params.hasEnd()) {\n      const endName = params.getIndexEndName();\n      return params.getIndex().makePost(params.getIndexEndValue(), endName);\n    } else {\n      return params.getIndex().maxPost();\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RangedFilter } from './RangedFilter';\nimport { ChildrenNode } from '../../snap/ChildrenNode';\nimport { Node, NamedNode } from '../../snap/Node';\nimport { assert } from '@firebase/util';\nimport { Change } from '../Change';\nimport { NodeFilter } from './NodeFilter';\nimport { Index } from '../../snap/indexes/Index';\nimport { IndexedFilter } from './IndexedFilter';\nimport { QueryParams } from '../QueryParams';\nimport { Path } from '../../util/Path';\nimport { CompleteChildSource } from '../CompleteChildSource';\nimport { ChildChangeAccumulator } from '../ChildChangeAccumulator';\n\n/**\n * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\n *\n * @constructor\n * @implements {NodeFilter}\n */\nexport class LimitedFilter implements NodeFilter {\n  /**\n   * @const\n   * @type {RangedFilter}\n   * @private\n   */\n  private readonly rangedFilter_: RangedFilter;\n\n  /**\n   * @const\n   * @type {!Index}\n   * @private\n   */\n  private readonly index_: Index;\n\n  /**\n   * @const\n   * @type {number}\n   * @private\n   */\n  private readonly limit_: number;\n\n  /**\n   * @const\n   * @type {boolean}\n   * @private\n   */\n  private readonly reverse_: boolean;\n\n  /**\n   * @param {!QueryParams} params\n   */\n  constructor(params: QueryParams) {\n    this.rangedFilter_ = new RangedFilter(params);\n    this.index_ = params.getIndex();\n    this.limit_ = params.getLimit();\n    this.reverse_ = !params.isViewFromLeft();\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updateChild(\n    snap: Node,\n    key: string,\n    newChild: Node,\n    affectedPath: Path,\n    source: CompleteChildSource,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    if (!this.rangedFilter_.matches(new NamedNode(key, newChild))) {\n      newChild = ChildrenNode.EMPTY_NODE;\n    }\n    if (snap.getImmediateChild(key).equals(newChild)) {\n      // No change\n      return snap;\n    } else if (snap.numChildren() < this.limit_) {\n      return this.rangedFilter_\n        .getIndexedFilter()\n        .updateChild(\n          snap,\n          key,\n          newChild,\n          affectedPath,\n          source,\n          optChangeAccumulator\n        );\n    } else {\n      return this.fullLimitUpdateChild_(\n        snap,\n        key,\n        newChild,\n        source,\n        optChangeAccumulator\n      );\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updateFullNode(\n    oldSnap: Node,\n    newSnap: Node,\n    optChangeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    let filtered;\n    if (newSnap.isLeafNode() || newSnap.isEmpty()) {\n      // Make sure we have a children node with the correct index, not a leaf node;\n      filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n    } else {\n      if (\n        this.limit_ * 2 < newSnap.numChildren() &&\n        newSnap.isIndexed(this.index_)\n      ) {\n        // Easier to build up a snapshot, since what we're given has more than twice the elements we want\n        filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\n        // anchor to the startPost, endPost, or last element as appropriate\n        let iterator;\n        if (this.reverse_) {\n          iterator = (newSnap as ChildrenNode).getReverseIteratorFrom(\n            this.rangedFilter_.getEndPost(),\n            this.index_\n          );\n        } else {\n          iterator = (newSnap as ChildrenNode).getIteratorFrom(\n            this.rangedFilter_.getStartPost(),\n            this.index_\n          );\n        }\n        let count = 0;\n        while (iterator.hasNext() && count < this.limit_) {\n          const next = iterator.getNext();\n          let inRange;\n          if (this.reverse_) {\n            inRange =\n              this.index_.compare(this.rangedFilter_.getStartPost(), next) <= 0;\n          } else {\n            inRange =\n              this.index_.compare(next, this.rangedFilter_.getEndPost()) <= 0;\n          }\n          if (inRange) {\n            filtered = filtered.updateImmediateChild(next.name, next.node);\n            count++;\n          } else {\n            // if we have reached the end post, we cannot keep adding elemments\n            break;\n          }\n        }\n      } else {\n        // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\n        filtered = newSnap.withIndex(this.index_);\n        // Don't support priorities on queries\n        filtered = filtered.updatePriority(\n          ChildrenNode.EMPTY_NODE\n        ) as ChildrenNode;\n        let startPost;\n        let endPost;\n        let cmp;\n        let iterator;\n        if (this.reverse_) {\n          iterator = filtered.getReverseIterator(this.index_);\n          startPost = this.rangedFilter_.getEndPost();\n          endPost = this.rangedFilter_.getStartPost();\n          const indexCompare = this.index_.getCompare();\n          cmp = (a: NamedNode, b: NamedNode) => indexCompare(b, a);\n        } else {\n          iterator = filtered.getIterator(this.index_);\n          startPost = this.rangedFilter_.getStartPost();\n          endPost = this.rangedFilter_.getEndPost();\n          cmp = this.index_.getCompare();\n        }\n\n        let count = 0;\n        let foundStartPost = false;\n        while (iterator.hasNext()) {\n          const next = iterator.getNext();\n          if (!foundStartPost && cmp(startPost, next) <= 0) {\n            // start adding\n            foundStartPost = true;\n          }\n          const inRange =\n            foundStartPost && count < this.limit_ && cmp(next, endPost) <= 0;\n          if (inRange) {\n            count++;\n          } else {\n            filtered = filtered.updateImmediateChild(\n              next.name,\n              ChildrenNode.EMPTY_NODE\n            );\n          }\n        }\n      }\n    }\n    return this.rangedFilter_\n      .getIndexedFilter()\n      .updateFullNode(oldSnap, filtered, optChangeAccumulator);\n  }\n\n  /**\n   * @inheritDoc\n   */\n  updatePriority(oldSnap: Node, newPriority: Node): Node {\n    // Don't support priorities on queries\n    return oldSnap;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  filtersNodes(): boolean {\n    return true;\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getIndexedFilter(): IndexedFilter {\n    return this.rangedFilter_.getIndexedFilter();\n  }\n\n  /**\n   * @inheritDoc\n   */\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  /**\n   * @param {!Node} snap\n   * @param {string} childKey\n   * @param {!Node} childSnap\n   * @param {!CompleteChildSource} source\n   * @param {?ChildChangeAccumulator} changeAccumulator\n   * @return {!Node}\n   * @private\n   */\n  private fullLimitUpdateChild_(\n    snap: Node,\n    childKey: string,\n    childSnap: Node,\n    source: CompleteChildSource,\n    changeAccumulator: ChildChangeAccumulator | null\n  ): Node {\n    // TODO: rename all cache stuff etc to general snap terminology\n    let cmp;\n    if (this.reverse_) {\n      const indexCmp = this.index_.getCompare();\n      cmp = (a: NamedNode, b: NamedNode) => indexCmp(b, a);\n    } else {\n      cmp = this.index_.getCompare();\n    }\n    const oldEventCache = snap as ChildrenNode;\n    assert(oldEventCache.numChildren() === this.limit_, '');\n    const newChildNamedNode = new NamedNode(childKey, childSnap);\n    const windowBoundary = this.reverse_\n      ? oldEventCache.getFirstChild(this.index_)\n      : (oldEventCache.getLastChild(this.index_) as NamedNode);\n    const inRange = this.rangedFilter_.matches(newChildNamedNode);\n    if (oldEventCache.hasChild(childKey)) {\n      const oldChildSnap = oldEventCache.getImmediateChild(childKey);\n      let nextChild = source.getChildAfterChild(\n        this.index_,\n        windowBoundary,\n        this.reverse_\n      );\n      while (\n        nextChild != null &&\n        (nextChild.name === childKey || oldEventCache.hasChild(nextChild.name))\n      ) {\n        // There is a weird edge case where a node is updated as part of a merge in the write tree, but hasn't\n        // been applied to the limited filter yet. Ignore this next child which will be updated later in\n        // the limited filter...\n        nextChild = source.getChildAfterChild(\n          this.index_,\n          nextChild,\n          this.reverse_\n        );\n      }\n      const compareNext =\n        nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\n      const remainsInWindow =\n        inRange && !childSnap.isEmpty() && compareNext >= 0;\n      if (remainsInWindow) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            Change.childChangedChange(childKey, childSnap, oldChildSnap)\n          );\n        }\n        return oldEventCache.updateImmediateChild(childKey, childSnap);\n      } else {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            Change.childRemovedChange(childKey, oldChildSnap)\n          );\n        }\n        const newEventCache = oldEventCache.updateImmediateChild(\n          childKey,\n          ChildrenNode.EMPTY_NODE\n        );\n        const nextChildInRange =\n          nextChild != null && this.rangedFilter_.matches(nextChild);\n        if (nextChildInRange) {\n          if (changeAccumulator != null) {\n            changeAccumulator.trackChildChange(\n              Change.childAddedChange(nextChild.name, nextChild.node)\n            );\n          }\n          return newEventCache.updateImmediateChild(\n            nextChild.name,\n            nextChild.node\n          );\n        } else {\n          return newEventCache;\n        }\n      }\n    } else if (childSnap.isEmpty()) {\n      // we're deleting a node, but it was not in the window, so ignore it\n      return snap;\n    } else if (inRange) {\n      if (cmp(windowBoundary, newChildNamedNode) >= 0) {\n        if (changeAccumulator != null) {\n          changeAccumulator.trackChildChange(\n            Change.childRemovedChange(windowBoundary.name, windowBoundary.node)\n          );\n          changeAccumulator.trackChildChange(\n            Change.childAddedChange(childKey, childSnap)\n          );\n        }\n        return oldEventCache\n          .updateImmediateChild(childKey, childSnap)\n          .updateImmediateChild(windowBoundary.name, ChildrenNode.EMPTY_NODE);\n      } else {\n        return snap;\n      }\n    } else {\n      return snap;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, stringify } from '@firebase/util';\nimport { MIN_NAME, MAX_NAME } from '../util/util';\nimport { KEY_INDEX } from '../snap/indexes/KeyIndex';\nimport { PRIORITY_INDEX } from '../snap/indexes/PriorityIndex';\nimport { VALUE_INDEX } from '../snap/indexes/ValueIndex';\nimport { PathIndex } from '../snap/indexes/PathIndex';\nimport { IndexedFilter } from './filter/IndexedFilter';\nimport { LimitedFilter } from './filter/LimitedFilter';\nimport { RangedFilter } from './filter/RangedFilter';\nimport { NodeFilter } from './filter/NodeFilter';\nimport { Index } from '../snap/indexes/Index';\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 * @constructor\n */\nexport class QueryParams {\n  private limitSet_ = false;\n  private startSet_ = false;\n  private startNameSet_ = false;\n  private endSet_ = false;\n  private endNameSet_ = false;\n\n  private limit_ = 0;\n  private viewFrom_ = '';\n  private indexStartValue_: unknown | null = null;\n  private indexStartName_ = '';\n  private indexEndValue_: unknown | null = null;\n  private indexEndName_ = '';\n\n  private index_ = PRIORITY_INDEX;\n\n  /**\n   * Wire Protocol Constants\n   * @const\n   * @enum {string}\n   * @private\n   */\n  private static readonly WIRE_PROTOCOL_CONSTANTS_ = {\n    INDEX_START_VALUE: 'sp',\n    INDEX_START_NAME: 'sn',\n    INDEX_END_VALUE: 'ep',\n    INDEX_END_NAME: 'en',\n    LIMIT: 'l',\n    VIEW_FROM: 'vf',\n    VIEW_FROM_LEFT: 'l',\n    VIEW_FROM_RIGHT: 'r',\n    INDEX: 'i'\n  };\n\n  /**\n   * REST Query Constants\n   * @const\n   * @enum {string}\n   * @private\n   */\n  private static readonly REST_QUERY_CONSTANTS_ = {\n    ORDER_BY: 'orderBy',\n    PRIORITY_INDEX: '$priority',\n    VALUE_INDEX: '$value',\n    KEY_INDEX: '$key',\n    START_AT: 'startAt',\n    END_AT: 'endAt',\n    LIMIT_TO_FIRST: 'limitToFirst',\n    LIMIT_TO_LAST: 'limitToLast'\n  };\n\n  /**\n   * Default, empty query parameters\n   * @type {!QueryParams}\n   * @const\n   */\n  static readonly DEFAULT = new QueryParams();\n\n  /**\n   * @return {boolean}\n   */\n  hasStart(): boolean {\n    return this.startSet_;\n  }\n\n  /**\n   * @return {boolean} True if it would return from left.\n   */\n  isViewFromLeft(): boolean {\n    if (this.viewFrom_ === '') {\n      // limit(), rather than limitToFirst or limitToLast was called.\n      // This means that only one of startSet_ and endSet_ is true. Use them\n      // to calculate which side of the view to anchor to. If neither is set,\n      // anchor to the end.\n      return this.startSet_;\n    } else {\n      return (\n        this.viewFrom_ === QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT\n      );\n    }\n  }\n\n  /**\n   * Only valid to call if hasStart() returns true\n   * @return {*}\n   */\n  getIndexStartValue(): unknown {\n    assert(this.startSet_, 'Only valid if start has been set');\n    return this.indexStartValue_;\n  }\n\n  /**\n   * Only valid to call if hasStart() returns true.\n   * Returns the starting key name for the range defined by these query parameters\n   * @return {!string}\n   */\n  getIndexStartName(): string {\n    assert(this.startSet_, 'Only valid if start has been set');\n    if (this.startNameSet_) {\n      return this.indexStartName_;\n    } else {\n      return MIN_NAME;\n    }\n  }\n\n  /**\n   * @return {boolean}\n   */\n  hasEnd(): boolean {\n    return this.endSet_;\n  }\n\n  /**\n   * Only valid to call if hasEnd() returns true.\n   * @return {*}\n   */\n  getIndexEndValue(): unknown {\n    assert(this.endSet_, 'Only valid if end has been set');\n    return this.indexEndValue_;\n  }\n\n  /**\n   * Only valid to call if hasEnd() returns true.\n   * Returns the end key name for the range defined by these query parameters\n   * @return {!string}\n   */\n  getIndexEndName(): string {\n    assert(this.endSet_, 'Only valid if end has been set');\n    if (this.endNameSet_) {\n      return this.indexEndName_;\n    } else {\n      return MAX_NAME;\n    }\n  }\n\n  /**\n   * @return {boolean}\n   */\n  hasLimit(): boolean {\n    return this.limitSet_;\n  }\n\n  /**\n   * @return {boolean} True if a limit has been set and it has been explicitly anchored\n   */\n  hasAnchoredLimit(): boolean {\n    return this.limitSet_ && this.viewFrom_ !== '';\n  }\n\n  /**\n   * Only valid to call if hasLimit() returns true\n   * @return {!number}\n   */\n  getLimit(): number {\n    assert(this.limitSet_, 'Only valid if limit has been set');\n    return this.limit_;\n  }\n\n  /**\n   * @return {!Index}\n   */\n  getIndex(): Index {\n    return this.index_;\n  }\n\n  /**\n   * @return {!QueryParams}\n   * @private\n   */\n  private copy_(): QueryParams {\n    const copy = new QueryParams();\n    copy.limitSet_ = this.limitSet_;\n    copy.limit_ = this.limit_;\n    copy.startSet_ = this.startSet_;\n    copy.indexStartValue_ = this.indexStartValue_;\n    copy.startNameSet_ = this.startNameSet_;\n    copy.indexStartName_ = this.indexStartName_;\n    copy.endSet_ = this.endSet_;\n    copy.indexEndValue_ = this.indexEndValue_;\n    copy.endNameSet_ = this.endNameSet_;\n    copy.indexEndName_ = this.indexEndName_;\n    copy.index_ = this.index_;\n    copy.viewFrom_ = this.viewFrom_;\n    return copy;\n  }\n\n  /**\n   * @param {!number} newLimit\n   * @return {!QueryParams}\n   */\n  limit(newLimit: number): QueryParams {\n    const newParams = this.copy_();\n    newParams.limitSet_ = true;\n    newParams.limit_ = newLimit;\n    newParams.viewFrom_ = '';\n    return newParams;\n  }\n\n  /**\n   * @param {!number} newLimit\n   * @return {!QueryParams}\n   */\n  limitToFirst(newLimit: number): QueryParams {\n    const newParams = this.copy_();\n    newParams.limitSet_ = true;\n    newParams.limit_ = newLimit;\n    newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT;\n    return newParams;\n  }\n\n  /**\n   * @param {!number} newLimit\n   * @return {!QueryParams}\n   */\n  limitToLast(newLimit: number): QueryParams {\n    const newParams = this.copy_();\n    newParams.limitSet_ = true;\n    newParams.limit_ = newLimit;\n    newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_RIGHT;\n    return newParams;\n  }\n\n  /**\n   * @param {*} indexValue\n   * @param {?string=} key\n   * @return {!QueryParams}\n   */\n  startAt(indexValue: unknown, key?: string | null): QueryParams {\n    const newParams = this.copy_();\n    newParams.startSet_ = true;\n    if (indexValue === undefined) {\n      indexValue = null;\n    }\n    newParams.indexStartValue_ = indexValue;\n    if (key != null) {\n      newParams.startNameSet_ = true;\n      newParams.indexStartName_ = key;\n    } else {\n      newParams.startNameSet_ = false;\n      newParams.indexStartName_ = '';\n    }\n    return newParams;\n  }\n\n  /**\n   * @param {*} indexValue\n   * @param {?string=} key\n   * @return {!QueryParams}\n   */\n  endAt(indexValue: unknown, key?: string | null): QueryParams {\n    const newParams = this.copy_();\n    newParams.endSet_ = true;\n    if (indexValue === undefined) {\n      indexValue = null;\n    }\n    newParams.indexEndValue_ = indexValue;\n    if (key !== undefined) {\n      newParams.endNameSet_ = true;\n      newParams.indexEndName_ = key;\n    } else {\n      newParams.endNameSet_ = false;\n      newParams.indexEndName_ = '';\n    }\n    return newParams;\n  }\n\n  /**\n   * @param {!Index} index\n   * @return {!QueryParams}\n   */\n  orderBy(index: Index): QueryParams {\n    const newParams = this.copy_();\n    newParams.index_ = index;\n    return newParams;\n  }\n\n  /**\n   * @return {!Object}\n   */\n  getQueryObject(): {} {\n    const WIRE_PROTOCOL_CONSTANTS = QueryParams.WIRE_PROTOCOL_CONSTANTS_;\n    const obj: { [k: string]: unknown } = {};\n    if (this.startSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE] = this.indexStartValue_;\n      if (this.startNameSet_) {\n        obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME] = this.indexStartName_;\n      }\n    }\n    if (this.endSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE] = this.indexEndValue_;\n      if (this.endNameSet_) {\n        obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME] = this.indexEndName_;\n      }\n    }\n    if (this.limitSet_) {\n      obj[WIRE_PROTOCOL_CONSTANTS.LIMIT] = this.limit_;\n      let viewFrom = this.viewFrom_;\n      if (viewFrom === '') {\n        if (this.isViewFromLeft()) {\n          viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\n        } else {\n          viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\n        }\n      }\n      obj[WIRE_PROTOCOL_CONSTANTS.VIEW_FROM] = viewFrom;\n    }\n    // For now, priority index is the default, so we only specify if it's some other index\n    if (this.index_ !== PRIORITY_INDEX) {\n      obj[WIRE_PROTOCOL_CONSTANTS.INDEX] = this.index_.toString();\n    }\n    return obj;\n  }\n\n  /**\n   * @return {boolean}\n   */\n  loadsAllData(): boolean {\n    return !(this.startSet_ || this.endSet_ || this.limitSet_);\n  }\n\n  /**\n   * @return {boolean}\n   */\n  isDefault(): boolean {\n    return this.loadsAllData() && this.index_ === PRIORITY_INDEX;\n  }\n\n  /**\n   * @return {!NodeFilter}\n   */\n  getNodeFilter(): NodeFilter {\n    if (this.loadsAllData()) {\n      return new IndexedFilter(this.getIndex());\n    } else if (this.hasLimit()) {\n      return new LimitedFilter(this);\n    } else {\n      return new RangedFilter(this);\n    }\n  }\n\n  /**\n   * Returns a set of REST query string parameters representing this query.\n   *\n   * @return {!Object.<string,*>} query string parameters\n   */\n  toRestQueryStringParameters(): { [k: string]: string | number } {\n    const REST_CONSTANTS = QueryParams.REST_QUERY_CONSTANTS_;\n    const qs: { [k: string]: string | number } = {};\n\n    if (this.isDefault()) {\n      return qs;\n    }\n\n    let orderBy;\n    if (this.index_ === PRIORITY_INDEX) {\n      orderBy = REST_CONSTANTS.PRIORITY_INDEX;\n    } else if (this.index_ === VALUE_INDEX) {\n      orderBy = REST_CONSTANTS.VALUE_INDEX;\n    } else if (this.index_ === KEY_INDEX) {\n      orderBy = REST_CONSTANTS.KEY_INDEX;\n    } else {\n      assert(this.index_ instanceof PathIndex, 'Unrecognized index type!');\n      orderBy = this.index_.toString();\n    }\n    qs[REST_CONSTANTS.ORDER_BY] = stringify(orderBy);\n\n    if (this.startSet_) {\n      qs[REST_CONSTANTS.START_AT] = stringify(this.indexStartValue_);\n      if (this.startNameSet_) {\n        qs[REST_CONSTANTS.START_AT] += ',' + stringify(this.indexStartName_);\n      }\n    }\n\n    if (this.endSet_) {\n      qs[REST_CONSTANTS.END_AT] = stringify(this.indexEndValue_);\n      if (this.endNameSet_) {\n        qs[REST_CONSTANTS.END_AT] += ',' + stringify(this.indexEndName_);\n      }\n    }\n\n    if (this.limitSet_) {\n      if (this.isViewFromLeft()) {\n        qs[REST_CONSTANTS.LIMIT_TO_FIRST] = this.limit_;\n      } else {\n        qs[REST_CONSTANTS.LIMIT_TO_LAST] = this.limit_;\n      }\n    }\n\n    return qs;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { OnDisconnect } from './onDisconnect';\nimport { TransactionResult } from './TransactionResult';\nimport { warn } from '../core/util/util';\nimport { nextPushId } from '../core/util/NextPushId';\nimport { Query } from './Query';\nimport { Repo } from '../core/Repo';\nimport { Path } from '../core/util/Path';\nimport { QueryParams } from '../core/view/QueryParams';\nimport {\n  validateRootPathString,\n  validatePathString,\n  validateFirebaseMergeDataArg,\n  validateBoolean,\n  validatePriority,\n  validateFirebaseDataArg,\n  validateWritablePath\n} from '../core/util/validation';\nimport { validateArgCount, validateCallback, Deferred } from '@firebase/util';\n\nimport { SyncPoint } from '../core/SyncPoint';\nimport { Database } from './Database';\nimport { DataSnapshot } from './DataSnapshot';\nimport * as types from '@firebase/database-types';\n\nexport interface ReferenceConstructor {\n  new (repo: Repo, path: Path): Reference;\n}\n\nexport class Reference extends Query {\n  then: Promise<Reference>['then'];\n  catch: Promise<Reference>['catch'];\n\n  /**\n   * Call options:\n   *   new Reference(Repo, Path) or\n   *   new Reference(url: string, string|RepoManager)\n   *\n   * Externally - this is the firebase.database.Reference type.\n   *\n   * @param {!Repo} repo\n   * @param {(!Path)} path\n   * @extends {Query}\n   */\n  constructor(repo: Repo, path: Path) {\n    if (!(repo instanceof Repo)) {\n      throw new Error(\n        'new Reference() no longer supported - use app.database().'\n      );\n    }\n\n    // call Query's constructor, passing in the repo and path.\n    super(repo, path, QueryParams.DEFAULT, false);\n  }\n\n  /** @return {?string} */\n  getKey(): string | null {\n    validateArgCount('Reference.key', 0, 0, arguments.length);\n\n    if (this.path.isEmpty()) {\n      return null;\n    } else {\n      return this.path.getBack();\n    }\n  }\n\n  /**\n   * @param {!(string|Path)} pathString\n   * @return {!Reference}\n   */\n  child(pathString: string | Path): Reference {\n    validateArgCount('Reference.child', 1, 1, arguments.length);\n    if (typeof pathString === 'number') {\n      pathString = String(pathString);\n    } else if (!(pathString instanceof Path)) {\n      if (this.path.getFront() === null) {\n        validateRootPathString('Reference.child', 1, pathString, false);\n      } else {\n        validatePathString('Reference.child', 1, pathString, false);\n      }\n    }\n\n    return new Reference(this.repo, this.path.child(pathString));\n  }\n\n  /** @return {?Reference} */\n  getParent(): Reference | null {\n    validateArgCount('Reference.parent', 0, 0, arguments.length);\n\n    const parentPath = this.path.parent();\n    return parentPath === null ? null : new Reference(this.repo, parentPath);\n  }\n\n  /** @return {!Reference} */\n  getRoot(): Reference {\n    validateArgCount('Reference.root', 0, 0, arguments.length);\n\n    let ref: Reference = this;\n    while (ref.getParent() !== null) {\n      ref = ref.getParent();\n    }\n    return ref;\n  }\n\n  /** @return {!Database} */\n  databaseProp(): Database {\n    return this.repo.database;\n  }\n\n  /**\n   * @param {*} newVal\n   * @param {function(?Error)=} onComplete\n   * @return {!Promise}\n   */\n  set(\n    newVal: unknown,\n    onComplete?: (a: Error | null) => void\n  ): Promise<unknown> {\n    validateArgCount('Reference.set', 1, 2, arguments.length);\n    validateWritablePath('Reference.set', this.path);\n    validateFirebaseDataArg('Reference.set', 1, newVal, this.path, false);\n    validateCallback('Reference.set', 2, onComplete, true);\n\n    const deferred = new Deferred();\n    this.repo.setWithPriority(\n      this.path,\n      newVal,\n      /*priority=*/ null,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {!Object} objectToMerge\n   * @param {function(?Error)=} onComplete\n   * @return {!Promise}\n   */\n  update(\n    objectToMerge: object,\n    onComplete?: (a: Error | null) => void\n  ): Promise<unknown> {\n    validateArgCount('Reference.update', 1, 2, arguments.length);\n    validateWritablePath('Reference.update', this.path);\n\n    if (Array.isArray(objectToMerge)) {\n      const newObjectToMerge: { [k: string]: unknown } = {};\n      for (let i = 0; i < objectToMerge.length; ++i) {\n        newObjectToMerge['' + i] = objectToMerge[i];\n      }\n      objectToMerge = newObjectToMerge;\n      warn(\n        'Passing an Array to Firebase.update() is deprecated. ' +\n          'Use set() if you want to overwrite the existing data, or ' +\n          'an Object with integer keys if you really do want to ' +\n          'only update some of the children.'\n      );\n    }\n    validateFirebaseMergeDataArg(\n      'Reference.update',\n      1,\n      objectToMerge,\n      this.path,\n      false\n    );\n    validateCallback('Reference.update', 2, onComplete, true);\n    const deferred = new Deferred();\n    this.repo.update(\n      this.path,\n      objectToMerge as { [k: string]: unknown },\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {*} newVal\n   * @param {string|number|null} newPriority\n   * @param {function(?Error)=} onComplete\n   * @return {!Promise}\n   */\n  setWithPriority(\n    newVal: unknown,\n    newPriority: string | number | null,\n    onComplete?: (a: Error | null) => void\n  ): Promise<unknown> {\n    validateArgCount('Reference.setWithPriority', 2, 3, arguments.length);\n    validateWritablePath('Reference.setWithPriority', this.path);\n    validateFirebaseDataArg(\n      'Reference.setWithPriority',\n      1,\n      newVal,\n      this.path,\n      false\n    );\n    validatePriority('Reference.setWithPriority', 2, newPriority, false);\n    validateCallback('Reference.setWithPriority', 3, onComplete, true);\n\n    if (this.getKey() === '.length' || this.getKey() === '.keys') {\n      throw 'Reference.setWithPriority failed: ' +\n        this.getKey() +\n        ' is a read-only object.';\n    }\n\n    const deferred = new Deferred();\n    this.repo.setWithPriority(\n      this.path,\n      newVal,\n      newPriority,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {function(?Error)=} onComplete\n   * @return {!Promise}\n   */\n  remove(onComplete?: (a: Error | null) => void): Promise<unknown> {\n    validateArgCount('Reference.remove', 0, 1, arguments.length);\n    validateWritablePath('Reference.remove', this.path);\n    validateCallback('Reference.remove', 1, onComplete, true);\n\n    return this.set(null, onComplete);\n  }\n\n  /**\n   * @param {function(*):*} transactionUpdate\n   * @param {(function(?Error, boolean, ?DataSnapshot))=} onComplete\n   * @param {boolean=} applyLocally\n   * @return {!Promise}\n   */\n  transaction(\n    transactionUpdate: (a: unknown) => unknown,\n    onComplete?: (a: Error | null, b: boolean, c: DataSnapshot | null) => void,\n    applyLocally?: boolean\n  ): Promise<TransactionResult> {\n    validateArgCount('Reference.transaction', 1, 3, arguments.length);\n    validateWritablePath('Reference.transaction', this.path);\n    validateCallback('Reference.transaction', 1, transactionUpdate, false);\n    validateCallback('Reference.transaction', 2, onComplete, true);\n    // NOTE: applyLocally is an internal-only option for now.  We need to decide if we want to keep it and how\n    // to expose it.\n    validateBoolean('Reference.transaction', 3, applyLocally, true);\n\n    if (this.getKey() === '.length' || this.getKey() === '.keys') {\n      throw 'Reference.transaction failed: ' +\n        this.getKey() +\n        ' is a read-only object.';\n    }\n\n    if (applyLocally === undefined) {\n      applyLocally = true;\n    }\n\n    const deferred = new Deferred<TransactionResult>();\n    if (typeof onComplete === 'function') {\n      deferred.promise.catch(() => {});\n    }\n\n    const promiseComplete = function(\n      error: Error,\n      committed: boolean,\n      snapshot: DataSnapshot\n    ) {\n      if (error) {\n        deferred.reject(error);\n      } else {\n        deferred.resolve(new TransactionResult(committed, snapshot));\n      }\n      if (typeof onComplete === 'function') {\n        onComplete(error, committed, snapshot);\n      }\n    };\n    this.repo.startTransaction(\n      this.path,\n      transactionUpdate,\n      promiseComplete,\n      applyLocally\n    );\n\n    return deferred.promise;\n  }\n\n  /**\n   * @param {string|number|null} priority\n   * @param {function(?Error)=} onComplete\n   * @return {!Promise}\n   */\n  setPriority(\n    priority: string | number | null,\n    onComplete?: (a: Error | null) => void\n  ): Promise<unknown> {\n    validateArgCount('Reference.setPriority', 1, 2, arguments.length);\n    validateWritablePath('Reference.setPriority', this.path);\n    validatePriority('Reference.setPriority', 1, priority, false);\n    validateCallback('Reference.setPriority', 2, onComplete, true);\n\n    const deferred = new Deferred();\n    this.repo.setWithPriority(\n      this.path.child('.priority'),\n      priority,\n      null,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {*=} value\n   * @param {function(?Error)=} onComplete\n   * @return {!Reference}\n   */\n  push(value?: unknown, onComplete?: (a: Error | null) => void): Reference {\n    validateArgCount('Reference.push', 0, 2, arguments.length);\n    validateWritablePath('Reference.push', this.path);\n    validateFirebaseDataArg('Reference.push', 1, value, this.path, true);\n    validateCallback('Reference.push', 2, onComplete, true);\n\n    const now = this.repo.serverTime();\n    const name = nextPushId(now);\n\n    // push() returns a ThennableReference whose promise is fulfilled with a regular Reference.\n    // We use child() to create handles to two different references. The first is turned into a\n    // ThennableReference below by adding then() and catch() methods and is used as the\n    // return value of push(). The second remains a regular Reference and is used as the fulfilled\n    // value of the first ThennableReference.\n    const thennablePushRef = this.child(name);\n    const pushRef = this.child(name);\n\n    let promise;\n    if (value != null) {\n      promise = thennablePushRef.set(value, onComplete).then(() => pushRef);\n    } else {\n      promise = Promise.resolve(pushRef);\n    }\n\n    thennablePushRef.then = promise.then.bind(promise);\n    thennablePushRef.catch = promise.then.bind(promise, undefined);\n\n    if (typeof onComplete === 'function') {\n      promise.catch(() => {});\n    }\n\n    return thennablePushRef;\n  }\n\n  /**\n   * @return {!OnDisconnect}\n   */\n  onDisconnect(): OnDisconnect {\n    validateWritablePath('Reference.onDisconnect', this.path);\n    return new OnDisconnect(this.repo, this.path);\n  }\n\n  get database(): Database {\n    return this.databaseProp();\n  }\n\n  get key(): string | null {\n    return this.getKey();\n  }\n\n  get parent(): Reference | null {\n    return this.getParent();\n  }\n\n  get root(): Reference {\n    return this.getRoot();\n  }\n}\n\n/**\n * Define reference constructor in various modules\n *\n * We are doing this here to avoid several circular\n * dependency issues\n */\nQuery.__referenceConstructor = Reference;\nSyncPoint.__referenceConstructor = Reference;\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, contains, safeGet } from '@firebase/util';\nimport { Path } from './Path';\n\nimport { each } from './util';\n\n/**\n * Node in a Tree.\n */\nexport class TreeNode<T> {\n  // TODO: Consider making accessors that create children and value lazily or\n  // separate Internal / Leaf 'types'.\n  children: { [name: string]: TreeNode<T> } = {};\n  childCount = 0;\n  value: T | null = null;\n}\n\n/**\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\n * children.\n */\nexport class Tree<T> {\n  /**\n   * @template T\n   * @param {string=} name_ Optional name of the node.\n   * @param {Tree=} parent_ Optional parent node.\n   * @param {TreeNode=} node_ Optional node to wrap.\n   */\n  constructor(\n    private name_: string = '',\n    private parent_: Tree<T> | null = null,\n    private node_: TreeNode<T> = new TreeNode<T>()\n  ) {}\n\n  /**\n   * Returns a sub-Tree for the given path.\n   *\n   * @param {!(string|Path)} pathObj Path to look up.\n   * @return {!Tree.<T>} Tree for path.\n   */\n  subTree(pathObj: string | Path): Tree<T> {\n    // TODO: Require pathObj to be Path?\n    let path = pathObj instanceof Path ? pathObj : new Path(pathObj);\n    let child = this as Tree<T>,\n      next = path.getFront();\n    while (next !== null) {\n      const childNode = safeGet(child.node_.children, next) || new TreeNode();\n      child = new Tree(next, child, childNode);\n      path = path.popFront();\n      next = path.getFront();\n    }\n\n    return child;\n  }\n\n  /**\n   * Returns the data associated with this tree node.\n   *\n   * @return {?T} The data or null if no data exists.\n   */\n  getValue(): T | null {\n    return this.node_.value;\n  }\n\n  /**\n   * Sets data to this tree node.\n   *\n   * @param {!T} value Value to set.\n   */\n  setValue(value: T) {\n    assert(typeof value !== 'undefined', 'Cannot set value to undefined');\n    this.node_.value = value;\n    this.updateParents_();\n  }\n\n  /**\n   * Clears the contents of the tree node (its value and all children).\n   */\n  clear() {\n    this.node_.value = null;\n    this.node_.children = {};\n    this.node_.childCount = 0;\n    this.updateParents_();\n  }\n\n  /**\n   * @return {boolean} Whether the tree has any children.\n   */\n  hasChildren(): boolean {\n    return this.node_.childCount > 0;\n  }\n\n  /**\n   * @return {boolean} Whether the tree is empty (no value or children).\n   */\n  isEmpty(): boolean {\n    return this.getValue() === null && !this.hasChildren();\n  }\n\n  /**\n   * Calls action for each child of this tree node.\n   *\n   * @param {function(!Tree.<T>)} action Action to be called for each child.\n   */\n  forEachChild(action: (tree: Tree<T>) => void) {\n    each(this.node_.children, (child: string, childTree: TreeNode<T>) => {\n      action(new Tree<T>(child, this, childTree));\n    });\n  }\n\n  /**\n   * Does a depth-first traversal of this node's descendants, calling action for each one.\n   *\n   * @param {function(!Tree.<T>)} action Action to be called for each child.\n   * @param {boolean=} includeSelf Whether to call action on this node as well. Defaults to\n   *   false.\n   * @param {boolean=} childrenFirst Whether to call action on children before calling it on\n   *   parent.\n   */\n  forEachDescendant(\n    action: (tree: Tree<T>) => void,\n    includeSelf?: boolean,\n    childrenFirst?: boolean\n  ) {\n    if (includeSelf && !childrenFirst) {\n      action(this);\n    }\n\n    this.forEachChild(child => {\n      child.forEachDescendant(action, /*includeSelf=*/ true, childrenFirst);\n    });\n\n    if (includeSelf && childrenFirst) {\n      action(this);\n    }\n  }\n\n  /**\n   * Calls action on each ancestor node.\n   *\n   * @param {function(!Tree.<T>)} action Action to be called on each parent; return\n   *   true to abort.\n   * @param {boolean=} includeSelf Whether to call action on this node as well.\n   * @return {boolean} true if the action callback returned true.\n   */\n  forEachAncestor(\n    action: (tree: Tree<T>) => unknown,\n    includeSelf?: boolean\n  ): boolean {\n    let node = includeSelf ? this : this.parent();\n    while (node !== null) {\n      if (action(node)) {\n        return true;\n      }\n      node = node.parent();\n    }\n    return false;\n  }\n\n  /**\n   * Does a depth-first traversal of this node's descendants.  When a descendant with a value\n   * is found, action is called on it and traversal does not continue inside the node.\n   * Action is *not* called on this node.\n   *\n   * @param {function(!Tree.<T>)} action Action to be called for each child.\n   */\n  forEachImmediateDescendantWithValue(action: (tree: Tree<T>) => void) {\n    this.forEachChild(child => {\n      if (child.getValue() !== null) {\n        action(child);\n      } else {\n        child.forEachImmediateDescendantWithValue(action);\n      }\n    });\n  }\n\n  /**\n   * @return {!Path} The path of this tree node, as a Path.\n   */\n  path(): Path {\n    return new Path(\n      this.parent_ === null\n        ? this.name_\n        : this.parent_.path() + '/' + this.name_\n    );\n  }\n\n  /**\n   * @return {string} The name of the tree node.\n   */\n  name(): string {\n    return this.name_;\n  }\n\n  /**\n   * @return {?Tree} The parent tree node, or null if this is the root of the tree.\n   */\n  parent(): Tree<T> | null {\n    return this.parent_;\n  }\n\n  /**\n   * Adds or removes this child from its parent based on whether it's empty or not.\n   *\n   * @private\n   */\n  private updateParents_() {\n    if (this.parent_ !== null) {\n      this.parent_.updateChild_(this.name_, this);\n    }\n  }\n\n  /**\n   * Adds or removes the passed child to this tree node, depending on whether it's empty.\n   *\n   * @param {string} childName The name of the child to update.\n   * @param {!Tree.<T>} child The child to update.\n   * @private\n   */\n  private updateChild_(childName: string, child: Tree<T>) {\n    const childEmpty = child.isEmpty();\n    const childExists = contains(this.node_.children, childName);\n    if (childEmpty && childExists) {\n      delete this.node_.children[childName];\n      this.node_.childCount--;\n      this.updateParents_();\n    } else if (!childEmpty && !childExists) {\n      this.node_.children[childName] = child.node_;\n      this.node_.childCount++;\n      this.updateParents_();\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert, contains, safeGet } from '@firebase/util';\nimport { Reference } from '../api/Reference';\nimport { DataSnapshot } from '../api/DataSnapshot';\nimport { Path } from './util/Path';\nimport { Tree } from './util/Tree';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { Node } from './snap/Node';\nimport { LUIDGenerator, warn, exceptionGuard } from './util/util';\nimport { resolveDeferredValueSnapshot } from './util/ServerValues';\nimport { isValidPriority, validateFirebaseData } from './util/validation';\n\nimport { nodeFromJSON } from './snap/nodeFromJSON';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { Repo } from './Repo';\nimport { Event } from './view/Event';\n\n// TODO: This is pretty messy.  Ideally, a lot of this would move into FirebaseData, or a transaction-specific\n// component used by FirebaseData, but it has ties to user callbacks (transaction update and onComplete) as well\n// as the realtime connection (to send transactions to the server).  So that all needs to be decoupled first.\n// For now it's part of Repo, but in its own file.\n\n/**\n * @enum {number}\n */\nexport enum TransactionStatus {\n  // We've run the transaction and updated transactionResultData_ with the result, but it isn't currently sent to the\n  // server. A transaction will go from RUN -> SENT -> RUN if it comes back from the server as rejected due to\n  // mismatched hash.\n  RUN,\n\n  // We've run the transaction and sent it to the server and it's currently outstanding (hasn't come back as accepted\n  // or rejected yet).\n  SENT,\n\n  // Temporary state used to mark completed transactions (whether successful or aborted).  The transaction will be\n  // removed when we get a chance to prune completed ones.\n  COMPLETED,\n\n  // Used when an already-sent transaction needs to be aborted (e.g. due to a conflicting set() call that was made).\n  // If it comes back as unsuccessful, we'll abort it.\n  SENT_NEEDS_ABORT,\n\n  // Temporary state used to mark transactions that need to be aborted.\n  NEEDS_ABORT\n}\n\n/**\n * If a transaction does not succeed after 25 retries, we abort it.  Among other things this ensure that if there's\n * ever a bug causing a mismatch between client / server hashes for some data, we won't retry indefinitely.\n * @type {number}\n * @const\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo as any).MAX_TRANSACTION_RETRIES_ = 25;\n\n/**\n * @typedef {{\n *   path: !Path,\n *   update: function(*):*,\n *   onComplete: ?function(?Error, boolean, ?DataSnapshot),\n *   status: ?TransactionStatus,\n *   order: !number,\n *   applyLocally: boolean,\n *   retryCount: !number,\n *   unwatcher: function(),\n *   abortReason: ?string,\n *   currentWriteId: !number,\n *   currentInputSnapshot: ?Node,\n *   currentOutputSnapshotRaw: ?Node,\n *   currentOutputSnapshotResolved: ?Node\n * }}\n */\ninterface Transaction {\n  path: Path;\n  update: (a: unknown) => unknown;\n  onComplete: (a: Error | null, b: boolean, c: DataSnapshot | null) => void;\n  status: TransactionStatus;\n  order: number;\n  applyLocally: boolean;\n  retryCount: number;\n  unwatcher: () => void;\n  abortReason: string | null;\n  currentWriteId: number;\n  currentInputSnapshot: Node | null;\n  currentOutputSnapshotRaw: Node | null;\n  currentOutputSnapshotResolved: Node | null;\n}\n\n/**\n * Setup the transaction data structures\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).transactionsInit_ = function() {\n  /**\n   * Stores queues of outstanding transactions for Firebase locations.\n   *\n   * @type {!Tree.<Array.<!Transaction>>}\n   * @private\n   */\n  this.transactionQueueTree_ = new Tree<Transaction[]>();\n};\n\ndeclare module './Repo' {\n  interface Repo {\n    startTransaction(\n      path: Path,\n      transactionUpdate: (a: unknown) => void,\n      onComplete: ((a: Error, b: boolean, c: DataSnapshot) => void) | null,\n      applyLocally: boolean\n    ): void;\n  }\n}\n\n/**\n * Creates a new transaction, adds it to the transactions we're tracking, and sends it to the server if possible.\n *\n * @param {!Path} path Path at which to do transaction.\n * @param {function(*):*} transactionUpdate Update callback.\n * @param {?function(?Error, boolean, ?DataSnapshot)} onComplete Completion callback.\n * @param {boolean} applyLocally Whether or not to make intermediate results visible\n */\nRepo.prototype.startTransaction = function(\n  path: Path,\n  transactionUpdate: (a: unknown) => unknown,\n  onComplete: ((a: Error, b: boolean, c: DataSnapshot) => void) | null,\n  applyLocally: boolean\n) {\n  this.log_('transaction on ' + path);\n\n  // Add a watch to make sure we get server updates.\n  const valueCallback = function() {};\n  const watchRef = new Reference(this, path);\n  watchRef.on('value', valueCallback);\n  const unwatcher = function() {\n    watchRef.off('value', valueCallback);\n  };\n\n  // Initialize transaction.\n  const transaction: Transaction = {\n    path,\n    update: transactionUpdate,\n    onComplete,\n\n    // One of TransactionStatus enums.\n    status: null,\n\n    // Used when combining transactions at different locations to figure out which one goes first.\n    order: LUIDGenerator(),\n\n    // Whether to raise local events for this transaction.\n    applyLocally,\n\n    // Count of how many times we've retried the transaction.\n    retryCount: 0,\n\n    // Function to call to clean up our .on() listener.\n    unwatcher,\n\n    // Stores why a transaction was aborted.\n    abortReason: null,\n\n    currentWriteId: null,\n\n    currentInputSnapshot: null,\n\n    currentOutputSnapshotRaw: null,\n\n    currentOutputSnapshotResolved: null\n  };\n\n  // Run transaction initially.\n  const currentState = this.getLatestState_(path);\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      // We just set the input snapshot, so this cast should be safe\n      const snapshot = new DataSnapshot(\n        transaction.currentInputSnapshot,\n        new Reference(this, transaction.path),\n        PRIORITY_INDEX\n      );\n      transaction.onComplete(null, false, snapshot);\n    }\n  } else {\n    validateFirebaseData(\n      'transaction failed: Data returned ',\n      newVal,\n      transaction.path\n    );\n\n    // Mark as run and add to our queue.\n    transaction.status = TransactionStatus.RUN;\n    const queueNode = this.transactionQueueTree_.subTree(path);\n    const nodeQueue = queueNode.getValue() || [];\n    nodeQueue.push(transaction);\n\n    queueNode.setValue(nodeQueue);\n\n    // Update visibleData and raise events\n    // Note: We intentionally raise events after updating all of our transaction state, since the user could\n    // start new transactions from the event callbacks.\n    let priorityForNode;\n    if (\n      typeof newVal === 'object' &&\n      newVal !== null &&\n      contains(newVal, '.priority')\n    ) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      priorityForNode = safeGet(newVal as any, '.priority');\n      assert(\n        isValidPriority(priorityForNode),\n        'Invalid priority returned by transaction. ' +\n          'Priority must be a valid string, finite number, server value, or null.'\n      );\n    } else {\n      const currentNode =\n        this.serverSyncTree_.calcCompleteEventCache(path) ||\n        ChildrenNode.EMPTY_NODE;\n      priorityForNode = currentNode.getPriority().val();\n    }\n    priorityForNode /** @type {null|number|string} */ = priorityForNode;\n\n    const serverValues = this.generateServerValues();\n    const newNodeUnresolved = nodeFromJSON(newVal, priorityForNode);\n    const newNode = resolveDeferredValueSnapshot(\n      newNodeUnresolved,\n      currentState,\n      serverValues\n    );\n    transaction.currentOutputSnapshotRaw = newNodeUnresolved;\n    transaction.currentOutputSnapshotResolved = newNode;\n    transaction.currentWriteId = this.getNextWriteId_();\n\n    const events = this.serverSyncTree_.applyUserOverwrite(\n      path,\n      newNode,\n      transaction.currentWriteId,\n      transaction.applyLocally\n    );\n    this.eventQueue_.raiseEventsForChangedPath(path, events);\n\n    this.sendReadyTransactions_();\n  }\n};\n\n/**\n * @param {!Path} path\n * @param {Array.<number>=} excludeSets A specific set to exclude\n * @return {Node}\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).getLatestState_ = function(\n  path: Path,\n  excludeSets?: number[]\n): Node {\n  return (\n    this.serverSyncTree_.calcCompleteEventCache(path, excludeSets) ||\n    ChildrenNode.EMPTY_NODE\n  );\n};\n\n/**\n * Sends any already-run transactions that aren't waiting for outstanding transactions to\n * complete.\n *\n * Externally it's called with no arguments, but it calls itself recursively with a particular\n * transactionQueueTree node to recurse through the tree.\n *\n * @param {Tree.<Array.<Transaction>>=} node  transactionQueueTree node to start at.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).sendReadyTransactions_ = function(\n  node: Tree<Transaction[]> = this.transactionQueueTree_\n) {\n  // Before recursing, make sure any completed transactions are removed.\n  if (!node) {\n    this.pruneCompletedTransactionsBelowNode_(node);\n  }\n\n  if (node.getValue() !== null) {\n    const queue = this.buildTransactionQueue_(node);\n    assert(queue.length > 0, 'Sending zero length transaction queue');\n\n    const allRun = queue.every(\n      (transaction: Transaction) => transaction.status === TransactionStatus.RUN\n    );\n\n    // If they're all run (and not sent), we can send them.  Else, we must wait.\n    if (allRun) {\n      this.sendTransactionQueue_(node.path(), queue);\n    }\n  } else if (node.hasChildren()) {\n    node.forEachChild(childNode => {\n      this.sendReadyTransactions_(childNode);\n    });\n  }\n};\n\n/**\n * Given a list of run transactions, send them to the server and then handle the result (success or failure).\n *\n * @param {!Path} path The location of the queue.\n * @param {!Array.<Transaction>} queue Queue of transactions under the specified location.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).sendTransactionQueue_ = function(\n  path: Path,\n  queue: Transaction[]\n) {\n  // Mark transactions as sent and increment retry count!\n  const setsToIgnore = queue.map(txn => {\n    return txn.currentWriteId;\n  });\n  const latestState = this.getLatestState_(path, setsToIgnore);\n  let snapToSend = latestState;\n  const latestHash = latestState.hash();\n  for (let i = 0; i < queue.length; i++) {\n    const txn = queue[i];\n    assert(\n      txn.status === TransactionStatus.RUN,\n      'tryToSendTransactionQueue_: items in queue should all be run.'\n    );\n    txn.status = TransactionStatus.SENT;\n    txn.retryCount++;\n    const relativePath = Path.relativePath(path, txn.path);\n    // If we've gotten to this point, the output snapshot must be defined.\n    snapToSend = snapToSend.updateChild(\n      relativePath /** @type {!Node} */,\n      txn.currentOutputSnapshotRaw\n    );\n  }\n\n  const dataToSend = snapToSend.val(true);\n  const pathToSend = path;\n\n  // Send the put.\n  this.server_.put(\n    pathToSend.toString(),\n    dataToSend,\n    (status: string) => {\n      this.log_('transaction put response', {\n        path: pathToSend.toString(),\n        status\n      });\n\n      let events: Event[] = [];\n      if (status === 'ok') {\n        // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n        // the callback could trigger more transactions or sets.\n        const callbacks = [];\n        for (let i = 0; i < queue.length; i++) {\n          queue[i].status = TransactionStatus.COMPLETED;\n          events = events.concat(\n            this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId)\n          );\n          if (queue[i].onComplete) {\n            // We never unset the output snapshot, and given that this transaction is complete, it should be set\n            const node = queue[i].currentOutputSnapshotResolved as Node;\n            const ref = new Reference(this, queue[i].path);\n            const snapshot = new DataSnapshot(node, ref, PRIORITY_INDEX);\n            callbacks.push(\n              queue[i].onComplete.bind(null, null, true, snapshot)\n            );\n          }\n          queue[i].unwatcher();\n        }\n\n        // Now remove the completed transactions.\n        this.pruneCompletedTransactionsBelowNode_(\n          this.transactionQueueTree_.subTree(path)\n        );\n        // There may be pending transactions that we can now send.\n        this.sendReadyTransactions_();\n\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\n\n        // Finally, trigger onComplete callbacks.\n        for (let i = 0; i < callbacks.length; i++) {\n          exceptionGuard(callbacks[i]);\n        }\n      } else {\n        // transactions are no longer sent.  Update their status appropriately.\n        if (status === 'datastale') {\n          for (let i = 0; i < queue.length; i++) {\n            if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n              queue[i].status = TransactionStatus.NEEDS_ABORT;\n            } else {\n              queue[i].status = TransactionStatus.RUN;\n            }\n          }\n        } else {\n          warn(\n            'transaction at ' + pathToSend.toString() + ' failed: ' + status\n          );\n          for (let i = 0; i < queue.length; i++) {\n            queue[i].status = TransactionStatus.NEEDS_ABORT;\n            queue[i].abortReason = status;\n          }\n        }\n\n        this.rerunTransactions_(path);\n      }\n    },\n    latestHash\n  );\n};\n\n/**\n * Finds all transactions dependent on the data at changedPath and reruns them.\n *\n * Should be called any time cached data changes.\n *\n * Return the highest path that was affected by rerunning transactions.  This is the path at which events need to\n * be raised for.\n *\n * @param {!Path} changedPath The path in mergedData that changed.\n * @return {!Path} The rootmost path that was affected by rerunning transactions.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).rerunTransactions_ = function(changedPath: Path): Path {\n  const rootMostTransactionNode = this.getAncestorTransactionNode_(changedPath);\n  const path = rootMostTransactionNode.path();\n\n  const queue = this.buildTransactionQueue_(rootMostTransactionNode);\n  this.rerunTransactionQueue_(queue, path);\n\n  return path;\n};\n\n/**\n * Does all the work of rerunning transactions (as well as cleans up aborted transactions and whatnot).\n *\n * @param {Array.<Transaction>} queue The queue of transactions to run.\n * @param {!Path} path The path the queue is for.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).rerunTransactionQueue_ = function(\n  queue: Transaction[],\n  path: Path\n) {\n  if (queue.length === 0) {\n    return; // Nothing to do!\n  }\n\n  // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n  // the callback could trigger more transactions or sets.\n  const callbacks = [];\n  let events: Event[] = [];\n  // Ignore all of the sets we're going to re-run.\n  const txnsToRerun = queue.filter(q => {\n    return q.status === TransactionStatus.RUN;\n  });\n  const setsToIgnore = txnsToRerun.map(q => {\n    return q.currentWriteId;\n  });\n  for (let i = 0; i < queue.length; i++) {\n    const transaction = queue[i];\n    const relativePath = Path.relativePath(path, transaction.path);\n    let abortTransaction = false,\n      abortReason;\n    assert(\n      relativePath !== null,\n      'rerunTransactionsUnderNode_: relativePath should not be null.'\n    );\n\n    if (transaction.status === TransactionStatus.NEEDS_ABORT) {\n      abortTransaction = true;\n      abortReason = transaction.abortReason;\n      events = events.concat(\n        this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true)\n      );\n    } else if (transaction.status === TransactionStatus.RUN) {\n      // eslint-disable-next-line @typescript-eslint/no-explicit-any\n      if (transaction.retryCount >= (Repo as any).MAX_TRANSACTION_RETRIES_) {\n        abortTransaction = true;\n        abortReason = 'maxretry';\n        events = events.concat(\n          this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true)\n        );\n      } else {\n        // This code reruns a transaction\n        const currentNode = this.getLatestState_(\n          transaction.path,\n          setsToIgnore\n        );\n        transaction.currentInputSnapshot = currentNode;\n        const newData = queue[i].update(currentNode.val());\n        if (newData !== undefined) {\n          validateFirebaseData(\n            'transaction failed: Data returned ',\n            newData,\n            transaction.path\n          );\n          let newDataNode = nodeFromJSON(newData);\n          const hasExplicitPriority =\n            typeof newData === 'object' &&\n            newData != null &&\n            contains(newData, '.priority');\n          if (!hasExplicitPriority) {\n            // Keep the old priority if there wasn't a priority explicitly specified.\n            newDataNode = newDataNode.updatePriority(currentNode.getPriority());\n          }\n\n          const oldWriteId = transaction.currentWriteId;\n          const serverValues = this.generateServerValues();\n          const newNodeResolved = resolveDeferredValueSnapshot(\n            newDataNode,\n            currentNode,\n            serverValues\n          );\n\n          transaction.currentOutputSnapshotRaw = newDataNode;\n          transaction.currentOutputSnapshotResolved = newNodeResolved;\n          transaction.currentWriteId = this.getNextWriteId_();\n          // Mutates setsToIgnore in place\n          setsToIgnore.splice(setsToIgnore.indexOf(oldWriteId), 1);\n          events = events.concat(\n            this.serverSyncTree_.applyUserOverwrite(\n              transaction.path,\n              newNodeResolved,\n              transaction.currentWriteId,\n              transaction.applyLocally\n            )\n          );\n          events = events.concat(\n            this.serverSyncTree_.ackUserWrite(oldWriteId, true)\n          );\n        } else {\n          abortTransaction = true;\n          abortReason = 'nodata';\n          events = events.concat(\n            this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true)\n          );\n        }\n      }\n    }\n    this.eventQueue_.raiseEventsForChangedPath(path, events);\n    events = [];\n    if (abortTransaction) {\n      // Abort.\n      queue[i].status = TransactionStatus.COMPLETED;\n\n      // Removing a listener can trigger pruning which can muck with mergedData/visibleData (as it prunes data).\n      // So defer the unwatcher until we're done.\n      (function(unwatcher) {\n        setTimeout(unwatcher, Math.floor(0));\n      })(queue[i].unwatcher);\n\n      if (queue[i].onComplete) {\n        if (abortReason === 'nodata') {\n          const ref = new Reference(this, queue[i].path);\n          // We set this field immediately, so it's safe to cast to an actual snapshot\n          const lastInput /** @type {!Node} */ = queue[i].currentInputSnapshot;\n          const snapshot = new DataSnapshot(lastInput, ref, PRIORITY_INDEX);\n          callbacks.push(queue[i].onComplete.bind(null, null, false, snapshot));\n        } else {\n          callbacks.push(\n            queue[i].onComplete.bind(null, new Error(abortReason), false, null)\n          );\n        }\n      }\n    }\n  }\n\n  // Clean up completed transactions.\n  this.pruneCompletedTransactionsBelowNode_(this.transactionQueueTree_);\n\n  // Now fire callbacks, now that we're in a good, known state.\n  for (let i = 0; i < callbacks.length; i++) {\n    exceptionGuard(callbacks[i]);\n  }\n\n  // Try to send the transaction result to the server.\n  this.sendReadyTransactions_();\n};\n\n/**\n * Returns the rootmost ancestor node of the specified path that has a pending transaction on it, or just returns\n * the node for the given path if there are no pending transactions on any ancestor.\n *\n * @param {!Path} path The location to start at.\n * @return {!Tree.<Array.<!Transaction>>} The rootmost node with a transaction.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).getAncestorTransactionNode_ = function(\n  path: Path\n): Tree<Transaction[]> {\n  let front;\n\n  // Start at the root and walk deeper into the tree towards path until we find a node with pending transactions.\n  let transactionNode = this.transactionQueueTree_;\n  front = path.getFront();\n  while (front !== null && transactionNode.getValue() === null) {\n    transactionNode = transactionNode.subTree(front);\n    path = path.popFront();\n    front = path.getFront();\n  }\n\n  return transactionNode;\n};\n\n/**\n * Builds the queue of all transactions at or below the specified transactionNode.\n *\n * @param {!Tree.<Array.<Transaction>>} transactionNode\n * @return {Array.<Transaction>} The generated queue.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).buildTransactionQueue_ = function(\n  transactionNode: Tree<Transaction[]>\n): Transaction[] {\n  // Walk any child transaction queues and aggregate them into a single queue.\n  const transactionQueue: Transaction[] = [];\n  this.aggregateTransactionQueuesForNode_(transactionNode, transactionQueue);\n\n  // Sort them by the order the transactions were created.\n  transactionQueue.sort((a, b) => {\n    return a.order - b.order;\n  });\n\n  return transactionQueue;\n};\n\n/**\n * @param {!Tree.<Array.<Transaction>>} node\n * @param {Array.<Transaction>} queue\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).aggregateTransactionQueuesForNode_ = function(\n  node: Tree<Transaction[]>,\n  queue: Transaction[]\n) {\n  const nodeQueue = node.getValue();\n  if (nodeQueue !== null) {\n    for (let i = 0; i < nodeQueue.length; i++) {\n      queue.push(nodeQueue[i]);\n    }\n  }\n\n  node.forEachChild(child => {\n    this.aggregateTransactionQueuesForNode_(child, queue);\n  });\n};\n\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n *\n * @param {!Tree.<Array.<!Transaction>>} node\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).pruneCompletedTransactionsBelowNode_ = function(\n  node: Tree<Transaction[]>\n) {\n  const queue = node.getValue();\n  if (queue) {\n    let to = 0;\n    for (let from = 0; from < queue.length; from++) {\n      if (queue[from].status !== TransactionStatus.COMPLETED) {\n        queue[to] = queue[from];\n        to++;\n      }\n    }\n    queue.length = to;\n    node.setValue(queue.length > 0 ? queue : null);\n  }\n\n  node.forEachChild(childNode => {\n    this.pruneCompletedTransactionsBelowNode_(childNode);\n  });\n};\n\n/**\n * Aborts all transactions on ancestors or descendants of the specified path.  Called when doing a set() or update()\n * since we consider them incompatible with transactions.\n *\n * @param {!Path} path Path for which we want to abort related transactions.\n * @return {!Path}\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).abortTransactions_ = function(path: Path): Path {\n  const affectedPath = this.getAncestorTransactionNode_(path).path();\n\n  const transactionNode = this.transactionQueueTree_.subTree(path);\n\n  transactionNode.forEachAncestor((node: Tree<Transaction[]>) => {\n    this.abortTransactionsOnNode_(node);\n  });\n\n  this.abortTransactionsOnNode_(transactionNode);\n\n  transactionNode.forEachDescendant((node: Tree<Transaction[]>) => {\n    this.abortTransactionsOnNode_(node);\n  });\n\n  return affectedPath;\n};\n\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param {!Tree.<Array.<Transaction>>} node Node to abort transactions for.\n * @private\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(Repo.prototype as any).abortTransactionsOnNode_ = function(\n  node: Tree<Transaction[]>\n) {\n  const queue = node.getValue();\n  if (queue !== null) {\n    // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n    // the callback could trigger more transactions or sets.\n    const callbacks = [];\n\n    // Go through queue.  Any already-sent transactions must be marked for abort, while the unsent ones\n    // can be immediately aborted and removed.\n    let events: Event[] = [];\n    let lastSent = -1;\n    for (let i = 0; i < queue.length; i++) {\n      if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n        // Already marked.  No action needed.\n      } else if (queue[i].status === TransactionStatus.SENT) {\n        assert(\n          lastSent === i - 1,\n          'All SENT items should be at beginning of queue.'\n        );\n        lastSent = i;\n        // Mark transaction for abort when it comes back.\n        queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\n        queue[i].abortReason = 'set';\n      } else {\n        assert(\n          queue[i].status === TransactionStatus.RUN,\n          'Unexpected transaction status in abort'\n        );\n        // We can abort it immediately.\n        queue[i].unwatcher();\n        events = events.concat(\n          this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId, true)\n        );\n        if (queue[i].onComplete) {\n          const snapshot: DataSnapshot | null = null;\n          callbacks.push(\n            queue[i].onComplete.bind(null, new Error('set'), false, snapshot)\n          );\n        }\n      }\n    }\n    if (lastSent === -1) {\n      // We're not waiting for any sent transactions.  We can clear the queue.\n      node.setValue(null);\n    } else {\n      // Remove the transactions we aborted.\n      queue.length = lastSent + 1;\n    }\n\n    // Now fire the callbacks.\n    this.eventQueue_.raiseEventsForChangedPath(node.path(), events);\n    for (let i = 0; i < callbacks.length; i++) {\n      exceptionGuard(callbacks[i]);\n    }\n  }\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseApp } from '@firebase/app-types';\nimport { safeGet } from '@firebase/util';\nimport { Repo } from './Repo';\nimport { fatal } from './util/util';\nimport { parseRepoInfo } from './util/libs/parser';\nimport { validateUrl } from './util/validation';\nimport './Repo_transaction';\nimport { Database } from '../api/Database';\nimport { RepoInfo } from './RepoInfo';\nimport { FirebaseAuthInternalName } from '@firebase/auth-interop-types';\nimport { Provider } from '@firebase/component';\n\n/** @const {string} */\nconst DATABASE_URL_OPTION = 'databaseURL';\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\nlet _staticInstance: RepoManager;\n\n/**\n * Creates and caches Repo instances.\n */\nexport class RepoManager {\n  /**\n   * @private {!Object.<string, Object<string, !fb.core.Repo>>}\n   */\n  private repos_: {\n    [appName: string]: {\n      [dbUrl: string]: Repo;\n    };\n  } = {};\n\n  /**\n   * If true, new Repos will be created to use ReadonlyRestClient (for testing purposes).\n   * @private {boolean}\n   */\n  private useRestClient_: boolean = false;\n\n  static getInstance(): RepoManager {\n    if (!_staticInstance) {\n      _staticInstance = new RepoManager();\n    }\n    return _staticInstance;\n  }\n\n  // TODO(koss): Remove these functions unless used in tests?\n  interrupt() {\n    for (const appName of Object.keys(this.repos_)) {\n      for (const dbUrl of Object.keys(this.repos_[appName])) {\n        this.repos_[appName][dbUrl].interrupt();\n      }\n    }\n  }\n\n  resume() {\n    for (const appName of Object.keys(this.repos_)) {\n      for (const dbUrl of Object.keys(this.repos_[appName])) {\n        this.repos_[appName][dbUrl].resume();\n      }\n    }\n  }\n\n  /**\n   * This function should only ever be called to CREATE a new database instance.\n   *\n   * @param {!FirebaseApp} app\n   * @return {!Database}\n   */\n  databaseFromApp(\n    app: FirebaseApp,\n    authProvider: Provider<FirebaseAuthInternalName>,\n    url?: string\n  ): Database {\n    let dbUrl: string | undefined = url || app.options[DATABASE_URL_OPTION];\n    if (dbUrl === undefined) {\n      fatal(\n        \"Can't determine Firebase Database URL.  Be sure to include \" +\n          DATABASE_URL_OPTION +\n          ' option when calling firebase.initializeApp().'\n      );\n    }\n\n    let parsedUrl = parseRepoInfo(dbUrl);\n    let repoInfo = parsedUrl.repoInfo;\n\n    let dbEmulatorHost: string | undefined = undefined;\n    if (typeof process !== 'undefined') {\n      dbEmulatorHost = process.env[FIREBASE_DATABASE_EMULATOR_HOST_VAR];\n    }\n    if (dbEmulatorHost) {\n      dbUrl = `http://${dbEmulatorHost}?ns=${repoInfo.namespace}`;\n      parsedUrl = parseRepoInfo(dbUrl);\n      repoInfo = parsedUrl.repoInfo;\n    }\n\n    validateUrl('Invalid Firebase Database URL', 1, parsedUrl);\n    if (!parsedUrl.path.isEmpty()) {\n      fatal(\n        'Database URL must point to the root of a Firebase Database ' +\n          '(not including a child path).'\n      );\n    }\n\n    const repo = this.createRepo(repoInfo, app, authProvider);\n\n    return repo.database;\n  }\n\n  /**\n   * Remove the repo and make sure it is disconnected.\n   *\n   * @param {!Repo} repo\n   */\n  deleteRepo(repo: Repo) {\n    const appRepos = safeGet(this.repos_, repo.app.name);\n    // This should never happen...\n    if (!appRepos || safeGet(appRepos, repo.repoInfo_.toURLString()) !== repo) {\n      fatal(\n        `Database ${repo.app.name}(${repo.repoInfo_}) has already been deleted.`\n      );\n    }\n    repo.interrupt();\n    delete appRepos[repo.repoInfo_.toURLString()];\n  }\n\n  /**\n   * Ensures a repo doesn't already exist and then creates one using the\n   * provided app.\n   *\n   * @param {!RepoInfo} repoInfo The metadata about the Repo\n   * @param {!FirebaseApp} app\n   * @return {!Repo} The Repo object for the specified server / repoName.\n   */\n  createRepo(\n    repoInfo: RepoInfo,\n    app: FirebaseApp,\n    authProvider: Provider<FirebaseAuthInternalName>\n  ): Repo {\n    let appRepos = safeGet(this.repos_, app.name);\n\n    if (!appRepos) {\n      appRepos = {};\n      this.repos_[app.name] = appRepos;\n    }\n\n    let repo = safeGet(appRepos, repoInfo.toURLString());\n    if (repo) {\n      fatal(\n        'Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.'\n      );\n    }\n    repo = new Repo(repoInfo, this.useRestClient_, app, authProvider);\n    appRepos[repoInfo.toURLString()] = repo;\n\n    return repo;\n  }\n\n  /**\n   * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\n   * @param {boolean} forceRestClient\n   */\n  forceRestClient(forceRestClient: boolean) {\n    this.useRestClient_ = forceRestClient;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { fatal } from '../core/util/util';\nimport { parseRepoInfo } from '../core/util/libs/parser';\nimport { Path } from '../core/util/Path';\nimport { Reference } from './Reference';\nimport { Repo } from '../core/Repo';\nimport { RepoManager } from '../core/RepoManager';\nimport { validateArgCount } from '@firebase/util';\nimport { validateUrl } from '../core/util/validation';\nimport { FirebaseApp } from '@firebase/app-types';\nimport { FirebaseService } from '@firebase/app-types/private';\nimport { RepoInfo } from '../core/RepoInfo';\nimport { FirebaseDatabase } from '@firebase/database-types';\n\n/**\n * Class representing a firebase database.\n * @implements {FirebaseService}\n */\nexport class Database implements FirebaseService {\n  INTERNAL: DatabaseInternals;\n  private root_: Reference;\n\n  static readonly ServerValue = {\n    TIMESTAMP: {\n      '.sv': 'timestamp'\n    },\n    increment: (delta: number) => {\n      return {\n        '.sv': {\n          'increment': delta\n        }\n      };\n    }\n  };\n\n  /**\n   * The constructor should not be called by users of our public API.\n   * @param {!Repo} repo_\n   */\n  constructor(private repo_: Repo) {\n    if (!(repo_ instanceof Repo)) {\n      fatal(\n        \"Don't call new Database() directly - please use firebase.database().\"\n      );\n    }\n\n    /** @type {Reference} */\n    this.root_ = new Reference(repo_, Path.Empty);\n\n    this.INTERNAL = new DatabaseInternals(this);\n  }\n\n  get app(): FirebaseApp {\n    return this.repo_.app;\n  }\n\n  /**\n   * Returns a reference to the root or to the path specified in the provided\n   * argument.\n   *\n   * @param {string|Reference=} path The relative string path or an existing\n   * Reference to a database location.\n   * @throws If a Reference is provided, throws if it does not belong to the\n   * same project.\n   * @return {!Reference} Firebase reference.\n   */\n  ref(path?: string): Reference;\n  ref(path?: Reference): Reference;\n  ref(path?: string | Reference): Reference {\n    this.checkDeleted_('ref');\n    validateArgCount('database.ref', 0, 1, arguments.length);\n\n    if (path instanceof Reference) {\n      return this.refFromURL(path.toString());\n    }\n\n    return path !== undefined ? this.root_.child(path) : this.root_;\n  }\n\n  /**\n   * Returns a reference to the root or the path specified in url.\n   * We throw a exception if the url is not in the same domain as the\n   * current repo.\n   * @param {string} url\n   * @return {!Reference} Firebase reference.\n   */\n  refFromURL(url: string): Reference {\n    /** @const {string} */\n    const apiName = 'database.refFromURL';\n    this.checkDeleted_(apiName);\n    validateArgCount(apiName, 1, 1, arguments.length);\n    const parsedURL = parseRepoInfo(url);\n    validateUrl(apiName, 1, parsedURL);\n\n    const repoInfo = parsedURL.repoInfo;\n    if (repoInfo.host !== (this.repo_.repoInfo_ as RepoInfo).host) {\n      fatal(\n        apiName +\n          ': Host name does not match the current database: ' +\n          '(found ' +\n          repoInfo.host +\n          ' but expected ' +\n          (this.repo_.repoInfo_ as RepoInfo).host +\n          ')'\n      );\n    }\n\n    return this.ref(parsedURL.path.toString());\n  }\n\n  /**\n   * @param {string} apiName\n   */\n  private checkDeleted_(apiName: string) {\n    if (this.repo_ === null) {\n      fatal('Cannot call ' + apiName + ' on a deleted database.');\n    }\n  }\n\n  // Make individual repo go offline.\n  goOffline() {\n    validateArgCount('database.goOffline', 0, 0, arguments.length);\n    this.checkDeleted_('goOffline');\n    this.repo_.interrupt();\n  }\n\n  goOnline() {\n    validateArgCount('database.goOnline', 0, 0, arguments.length);\n    this.checkDeleted_('goOnline');\n    this.repo_.resume();\n  }\n}\n\nexport class DatabaseInternals {\n  /** @param {!Database} database */\n  constructor(public database: Database) {}\n\n  /** @return {Promise<void>} */\n  async delete(): Promise<void> {\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    (this.database as any).checkDeleted_('delete');\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    RepoManager.getInstance().deleteRepo((this.database as any).repo_ as Repo);\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    (this.database as any).repo_ = null;\n    // eslint-disable-next-line @typescript-eslint/no-explicit-any\n    (this.database as any).root_ = null;\n    this.database.INTERNAL = null;\n    this.database = 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\nimport { WebSocketConnection } from '../realtime/WebSocketConnection';\nimport { BrowserPollConnection } from '../realtime/BrowserPollConnection';\nimport { Reference } from './Reference';\n\n/**\n * INTERNAL methods for internal-use only (tests, etc.).\n *\n * Customers shouldn't use these or else should be aware that they could break at any time.\n *\n * @const\n */\n\nexport const forceLongPolling = function() {\n  WebSocketConnection.forceDisallow();\n  BrowserPollConnection.forceAllow();\n};\n\nexport const forceWebSockets = function() {\n  BrowserPollConnection.forceDisallow();\n};\n\n/* Used by App Manager */\nexport const isWebSocketsAvailable = function(): boolean {\n  return WebSocketConnection['isAvailable']();\n};\n\nexport const setSecurityDebugCallback = function(\n  ref: Reference,\n  callback: (a: object) => void\n) {\n  // eslint-disable-next-line @typescript-eslint/no-explicit-any\n  (ref.repo.persistentConnection_ as any).securityDebugCallback_ = callback;\n};\n\nexport const stats = function(ref: Reference, showDelta?: boolean) {\n  ref.repo.stats(showDelta);\n};\n\nexport const statsIncrementCounter = function(ref: Reference, metric: string) {\n  ref.repo.statsIncrementCounter(metric);\n};\n\nexport const dataUpdateCount = function(ref: Reference): number {\n  return ref.repo.dataUpdateCount;\n};\n\nexport const interceptServerData = function(\n  ref: Reference,\n  callback: ((a: string, b: unknown) => void) | null\n) {\n  return ref.repo.interceptServerData_(callback);\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { RepoInfo } from '../core/RepoInfo';\nimport { PersistentConnection } from '../core/PersistentConnection';\nimport { RepoManager } from '../core/RepoManager';\nimport { Connection } from '../realtime/Connection';\nimport { Query } from './Query';\n\nexport const DataConnection = PersistentConnection;\n\n/**\n * @param {!string} pathString\n * @param {function(*)} onComplete\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(PersistentConnection.prototype as any).simpleListen = function(\n  pathString: string,\n  onComplete: (a: unknown) => void\n) {\n  this.sendRequest('q', { p: pathString }, onComplete);\n};\n\n/**\n * @param {*} data\n * @param {function(*)} onEcho\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\n(PersistentConnection.prototype as any).echo = function(\n  data: unknown,\n  onEcho: (a: unknown) => void\n) {\n  this.sendRequest('echo', { d: data }, onEcho);\n};\n\n// RealTimeConnection properties that we use in tests.\nexport const RealTimeConnection = Connection;\n\n/**\n * @param {function(): string} newHash\n * @return {function()}\n */\nexport const hijackHash = function(newHash: () => string) {\n  const oldPut = PersistentConnection.prototype.put;\n  PersistentConnection.prototype.put = function(\n    pathString,\n    data,\n    onComplete,\n    hash\n  ) {\n    if (hash !== undefined) {\n      hash = newHash();\n    }\n    oldPut.call(this, pathString, data, onComplete, hash);\n  };\n  return function() {\n    PersistentConnection.prototype.put = oldPut;\n  };\n};\n\n/**\n * @type {function(new:RepoInfo, !string, boolean, !string, boolean): undefined}\n */\nexport const ConnectionTarget = RepoInfo;\n\n/**\n * @param {!Query} query\n * @return {!string}\n */\nexport const queryIdentifier = function(query: Query) {\n  return query.queryIdentifier();\n};\n\n/**\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\n *\n * @param {boolean} forceRestClient\n */\nexport const forceRestClient = function(forceRestClient: boolean) {\n  RepoManager.getInstance().forceRestClient(forceRestClient);\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n// eslint-disable-next-line import/no-extraneous-dependencies\nimport firebase from '@firebase/app';\nimport { FirebaseNamespace } from '@firebase/app-types';\nimport { _FirebaseNamespace } from '@firebase/app-types/private';\nimport { Database } from './src/api/Database';\nimport { DataSnapshot } from './src/api/DataSnapshot';\nimport { Query } from './src/api/Query';\nimport { Reference } from './src/api/Reference';\nimport { enableLogging } from './src/core/util/util';\nimport { RepoManager } from './src/core/RepoManager';\nimport * as INTERNAL from './src/api/internal';\nimport * as TEST_ACCESS from './src/api/test_access';\nimport { isNodeSdk } from '@firebase/util';\nimport * as types from '@firebase/database-types';\nimport { setSDKVersion } from './src/core/version';\nimport { Component, ComponentType } from '@firebase/component';\n\nimport { name, version } from './package.json';\n\nconst ServerValue = Database.ServerValue;\n\nexport function registerDatabase(instance: FirebaseNamespace) {\n  // set SDK_VERSION\n  setSDKVersion(instance.SDK_VERSION);\n\n  // Register the Database Service with the 'firebase' namespace.\n  const namespace = (instance as _FirebaseNamespace).INTERNAL.registerComponent(\n    new Component(\n      'database',\n      (container, url) => {\n        /* Dependencies */\n        // getImmediate for FirebaseApp will always succeed\n        const app = container.getProvider('app').getImmediate();\n        const authProvider = container.getProvider('auth-internal');\n\n        return RepoManager.getInstance().databaseFromApp(\n          app,\n          authProvider,\n          url\n        );\n      },\n      ComponentType.PUBLIC\n    )\n      .setServiceProps(\n        // firebase.database namespace properties\n        {\n          Reference,\n          Query,\n          Database,\n          DataSnapshot,\n          enableLogging,\n          INTERNAL,\n          ServerValue,\n          TEST_ACCESS\n        }\n      )\n      .setMultipleInstances(true)\n  );\n\n  instance.registerVersion(name, version);\n\n  if (isNodeSdk()) {\n    module.exports = namespace;\n  }\n}\n\nregisterDatabase(firebase);\n\n// Types to export for the admin SDK\nexport { Database, Query, Reference, enableLogging, ServerValue };\n\nexport { DataSnapshot } from './src/api/DataSnapshot';\nexport { OnDisconnect } from './src/api/onDisconnect';\n\ndeclare module '@firebase/app-types' {\n  interface FirebaseNamespace {\n    database?: {\n      (app?: FirebaseApp): types.FirebaseDatabase;\n      enableLogging: typeof types.enableLogging;\n      ServerValue: types.ServerValue;\n      Database: typeof types.FirebaseDatabase;\n    };\n  }\n  interface FirebaseApp {\n    database?(databaseURL?: string): types.FirebaseDatabase;\n  }\n}\n"],"names":["extendStatics","d","b","Object","setPrototypeOf","__proto__","Array","p","hasOwnProperty","__extends","__","this","constructor","prototype","create","__assign","assign","t","s","i","n","arguments","length","call","apply","__awaiter","thisArg","_arguments","P","generator","Promise","resolve","reject","fulfilled","value","step","next","e","rejected","result","done","then","__generator","body","f","y","g","_","label","sent","trys","ops","verb","throw","return","Symbol","iterator","v","op","TypeError","pop","push","__values","o","m","__read","r","ar","error","__spread","concat","stringToByteArray","str","out","c","charCodeAt","base64Decode","base64","decodeString","console","CONSTANTS","NODE_CLIENT","NODE_ADMIN","SDK_VERSION","assert","assertion","message","assertionError","Error","byteToCharMap_","charToByteMap_","byteToCharMapWebSafe_","charToByteMapWebSafe_","ENCODED_VALS_BASE","ENCODED_VALS","ENCODED_VALS_WEBSAFE","HAS_NATIVE_SUPPORT","atob","encodeByteArray","input","webSafe","isArray","init_","byteToCharMap","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","join","encodeString","btoa","bytes","pos","c1","String","fromCharCode","c2","u","c3","byteArrayToString","decodeStringToByteArray","charToByteMap","charAt","byte4","deepCopy","deepExtend","target","source","Date","dateValue","getTime","undefined","prop","Deferred","callback","_this","promise","catch","isMobileCordova","window","test","navigator","isNodeSdk","code","_super","FirebaseError","captureStackTrace","ErrorFactory","_i","data","customData","fullCode","service","template","errors","replace","PATTERN","key","toString","fullMessage","serviceName","_b","keys","_a","slice","warn","jsonEval","JSON","parse","stringify","decode","token","header","claims","signature","parts","split","contains","obj","safeGet","isEmpty","map","fn","contextObj","res","Sha1","chain_","inbuf_","total_","buf","offset","W","W_","k","a","lengthMinusBlock","blockSize","buf_","inbuf","compress_","digest","totalBits","update","pad_","j","reset","validateArgCount","fnName","minCount","maxCount","argCount","argError","errorPrefix","argumentNumber","optional","argName","validateCallback","validateContextObject","context","stringLength","LogLevel","DEBUG","VERBOSE","INFO","WARN","ERROR","SILENT","defaultLogHandler","instance","logType","args","logLevel","now","toISOString","method","ConsoleMethod","name","defaultLogLevel","Logger","_logLevel","val","_logHandler","_userLogHandler","Component","mode","instantiationMode","multipleInstances","props","serviceProps","instanceFactory","type","DOMStorageWrapper","domStorage_","removeItem","prefixedName_","setItem","storedVal","getItem","prefix_","MemoryStorage","cache_","createStoragefor","domStorageName","domStorage","sha1","utf8Bytes","high","sha1Bytes","enableLogging","logger_","persistent","logClient","logger","log","bind","SessionStorage","set","remove","varArgs","firstLog_","get","buildLogMessage_","logWrapper","prefix","fatal","isInvalidJSONNumber","Number","POSITIVE_INFINITY","NEGATIVE_INFINITY","stringCompare","requireKey","splitStringBySize","segsize","len","dataSegs","substring","id","PersistentStorage","LUIDGenerator","arg","MIN_NAME","MAX_NAME","nameCompare","aAsInt","tryParseInt","bAsInt","ObjectToUniqueKey","sort","each","doubleToIEEE754String","ln","Infinity","Math","abs","pow","min","floor","LN2","round","bits","reverse","hexByteString","hexByte","parseInt","substr","toLowerCase","exceptionGuard","setTimeout","stack","setTimeoutNonBlocking","time","timeout","INTEGER_REGEXP_","RegExp","intVal","Path","pieceNum_","pieces_","pieceNum","pathString","encodeURIComponent","begin","pieces","childPathObj","childPieces","outerPath","innerPath","outer","getFront","inner","relativePath","popFront","left","right","leftKeys","rightKeys","cmp","other","getLength","pathOrString","copyTo","ValidationPath","child","parts_","byteLength_","checkValid_","last","MAX_PATH_LENGTH_BYTES","errorPrefix_","MAX_PATH_DEPTH","toErrorString","path","max","FORGE_DOMAIN","WEBSOCKET","LONG_POLLING","RepoInfo","host","internalHost","isCustomHost","includeNamespaceInQueryParams","domain","newHost","isCacheableHost","params","connURL","secure","needsQueryParam","namespace","pairs","toURLString","persistenceKey","webSocketOnly","indexOf","parseRepoInfo","dataURL","parsedUrl","parseDatabaseURL","location","protocol","scheme","repoInfo","subdomain","isValidKey","INVALID_KEY_REGEX_","isValidPathString","INVALID_PATH_REGEX_","isValidPriority","priority","validateFirebaseDataArg","validateFirebaseData","errorPrefixFxn","validateFirebaseMergeDataArg","mergePaths","curPath","getBack","comparePaths","prevPath","validateFirebaseMergePaths","validatePriority","validateEventType","eventType","validateKey","validatePathString","validateWritablePath","validateUrl","port","colonInd","slashInd","questionMarkInd","pathStringDecoded","piece","decodeURIComponent","decodePath","queryParams","queryString","results","segment","kv","decodeQuery","hostWithoutPort","dotInd","MAX_LEAF_SIZE_","path_","hasDotValue_1","hasActualChild_1","OnDisconnect","onComplete","deferred","repo_","onDisconnectCancel","wrapCallback","onDisconnectSet","onDisconnectSetWithPriority","objectToMerge","newObjectToMerge","onDisconnectUpdate","TransactionResult","committed","snapshot","toJSON","PUSH_CHARS","lastPushTime","lastRandChars","nextPushId","duplicateTime","timeStampChars","random","NamedNode","node","__EMPTY_NODE","Index","compare","oldNode","newNode","oldWrapped","newWrapped","MIN","KeyIndex","indexValue","MAX_NODE","KEY_INDEX","priorityHashText","validatePriorityNode","priorityNode","isLeafNode","getPriority","__childrenNodeConstructor","nodeFromJSON","LeafNode","priorityNode_","newPriorityNode","value_","childName","EMPTY_NODE","childNode","newChildNode","updatePriority","updateImmediateChild","front","updateChild","index","action","exportFormat",".value","getValue",".priority","lazyHash_","toHash","compareToLeafNode_","otherLeaf","otherLeafType","thisLeafType","otherIndex","VALUE_TYPE_ORDER","thisIndex","equals","PRIORITY_INDEX","PriorityIndex","aPriority","bPriority","indexCmp","compareTo","SortedMapIterator","nodeStack_","resultGenerator_","isReverse_","startKey","comparator","LLRBNode","color","count","inorderTraversal","reverseTraversal","min_","maxKey","copy","insert","fixUp_","SortedMap","isRed_","moveRedLeft_","removeMin_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","RED","nr","blackDepth","check_","LLRBEmptyNode","comparator_","root_","BLACK","rightParent","minKey","resultGenerator","LOG_2","Base12Num","bits_","current_","num","mask","_defaultIndexMap","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","low","namedNode","middle","root","base12","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","nextBitIsOne","buildFrom12Array","fallbackObject","IndexMap","indexKey","sortedMap","indexes_","indexDefinition","indexSet_","existingChildren","newIndex","sawIndexedValue","iter","getIterator","Wrap","getNext","isDefinedOn","getCompare","indexName","newIndexSet","newIndexes","indexedChildren","existingSnap","newChildren","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","ChildrenNode","Default","children_","indexMap_","getImmediateChild","getChild","newIndexMap","removeFromIndexes","addToIndexes","newPriority","newImmediateChild","numKeys","allIntegerKeys","forEachChild","array","toHash_1","childHash","hash","idx","resolveIndex_","predecessor","getPredecessorKey","getFirstChildName","getLastChildName","wrappedNode","getIteratorFrom","minPost","startPost","peek","getReverseIteratorFrom","maxPost","endPost","hasIndex","addIndex","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","MaxNode","defineProperties","MAX","USE_HINZE","json","node_1","childData","children_1","childrenHavePriority_1","childSet","sortedChildSet","VALUE_INDEX","ValueIndex","valueNode","PathIndex","snap","indexPath_","aChild","extractChild","bChild","DataSnapshot","node_","exportVal","childPathString","childPath","childRef","ref_","index_","getKey","numChildren","getRef","DataEvent","ref","getParent","eventRegistration","getEventRunner","getPath","prevName","CancelEvent","ValueEventRegistration","change","query","getQueryParams","getIndex","snapshotNode","eventData","ctx","context_","getEventType","cancelCallback_","cancelCB_1","cb_1","callback_","__referenceConstructor","ChildEventRegistration","eventToCheck","callbacks_","cancelCB_2","cb_2","otherKeys","thisKeys","otherCount","every","otherKey","thisKey","Query","startNode","endNode","hasStart","getIndexStartValue","hasEnd","getIndexEndValue","tooManyArgsError","wrongArgTypeError","getIndexStartName","getIndexEndName","hasLimit","hasAnchoredLimit","orderByCalled_","queryParams_","repo","cancelCallbackOrContext","ret","getCancelAndContextArgs_","onValueEvent","cancel","callbacks","onChildEvent","cancelCallback","container","addEventCallbackForQuery","removeEventCallbackForQuery","userCallback","failureCallbackOrContext","firstCall","onceCallback","off","on","err","limit","limitToFirst","limitToLast","validateNoPreviousOrderByCall_","parsedPath","newParams","orderBy","validateQueryEndpoints_","startAt","validateLimit_","endAt","toUrlEncodedString","getQueryObject","queryObject","sameRepo","samePath","sameQueryIdentifier","queryIdentifier","cancelOrContext","ExistingValueProvider","DeferredValueProvider","syncTree_","calcCompleteEventCache","syncTree","resolveDeferredValueTree","serverValues","resolveDeferredValue","resolveDeferredValueSnapshot","existing","resolveDeferredLeafValue","existingVal","resolveScalarDeferredValue","resolveComplexDeferredValue","unused","delta","existingNode","rawPri","leafNode","childrenNode","OperationType","SparseSnapshotTree","children","size","childKey","has","find","clear","remember","self_1","tree","forget","delete","prefixPath","func","forEachTree","forEach","Map","OperationSource","queryId","fromUser","fromServer","tagged","emptyChildrenSingleton","AckUserWrite","affectedTree","subtree","Empty","revert","ACK_USER_WRITE","User","ImmutableTree","childSnap","predicate","childExistingPathAndValue","findRootMostMatchingPathAndValue","toSet","newChild","newTree","setTree","fold_","pathSoFar","accum","findOnPath_","pathToFollow","nextChild","foreachOnPath_","currentRelativePath","foreach_","ListenComplete","LISTEN_COMPLETE","Overwrite","OVERWRITE","Merge","MERGE","CacheNode","fullyInitialized_","filtered_","isFullyInitialized","isCompleteForChild","hasChild","ViewCache","eventSnap","complete","filtered","serverCache_","serverSnap","eventCache_","getNode","Change","VALUE","CHILD_ADDED","CHILD_REMOVED","newSnapshot","oldSnapshot","CHILD_CHANGED","CHILD_MOVED","oldSnap","IndexedFilter","affectedPath","optChangeAccumulator","isIndexed","oldChild","trackChildChange","childRemovedChange","childAddedChange","childChangedChange","withIndex","newSnap","ChildChangeAccumulator","oldChange","changeMap","oldType","from","values","NO_COMPLETE_CHILD_SOURCE","NoCompleteChildSource_","WriteTreeCompleteChildSource","viewCache_","getEventCache","serverNode","optCompleteServerCache_","getServerCache","writes_","calcCompleteChild","completeServerData","getCompleteServerSnap","nodes","calcIndexedSlice","viewCache","changes","ViewProcessor","filter_","oldViewCache","operation","writesCache","completeCache","newViewCache","filterServerNode","accumulator","overwrite","applyUserOverwrite_","isFiltered","applyServerOverwrite_","merge","applyUserMerge_","applyServerMerge_","ackUserWrite","revertUserWrite_","ackUserWrite_","listenComplete_","getChanges","maybeAddValueEvent_","ProcessorResult","isLeafOrEmpty","oldCompleteSnap","getCompleteEventSnap","valueChange","changePath","oldEventSnap","shadowingWrite","newEventCache","serverCache","completeChildren","completeEventChildren","calcCompleteEventChildren","updateFullNode","completeNode","oldEventNode","updatedPriority","calcEventCacheAfterServerOverwrite","childChangePath","newEventChild","eventChildUpdate","updateEventSnap","filtersNodes","changedSnap","newServerCache","oldServerSnap","serverFilter","getIndexedFilter","newServerNode","isCompleteForPath","updateServerSnap","generateEventCacheAfterServerEvent_","getCompleteChild","parent","newEventSnap","changedChildren","curViewCache","foreach","writePath","cacheHasChild_","viewMergeTree","serverChild","applyMerge_","childMergeTree","isUnknownDeepMerge","ackPath","changedChildren_1","changedChildren_2","mergePath","serverCachePath","oldServerNode","completeServerCache","oldEventCache","serverChildren","EventGenerator","eventCache","eventRegistrations","events","moves","indexedValueChanged","childMovedChange","generateEventsForType_","registrations","filteredChanges","filter","compareChanges_","materializedChange","materializeSingleChange_","registration","respondsTo","createEvent","query_","getPredecessorChildName","aWrapped","bWrapped","View","cache","loadsAllData","eventRegistrations_","cancelError","cancelEvents","path_1","maybeEvent","createCancelEvent","remaining","matches","hasAnyCallback","processor_","applyOperation","assertIndexed","generateEventsForChanges_","initialChanges","eventGenerator_","generateEventsForChanges","initialViewCache","indexFilter","getNodeFilter","initialServerCache","initialEventCache","SyncPoint","views","optCompleteServerCache","view","serverCacheComplete","eventCacheComplete","addEventRegistration","getInitialEvents","removed","hadCompleteView","hasCompleteView","entries","_d","viewQueryId","removeEventRegistration","getQuery","getCompleteServerCache","getCompleteView","viewForQuery","CompoundWrite","rootmost","writeTree_","findRootMostValueAndPath","rootMostPath","updates","newWrite","addWrite","getCompleteNode","shadowingNode","applySubtreeWrite","writeTree","priorityWrite_1","WriteTree","WriteTreeRef","writeId","visible","lastWriteId_","allWrites_","visibleWrites_","addWrites","record","findIndex","writeToRemove","splice","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","recordContainsPath_","resetTree_","removeWrite","treePath","writeIdsToExclude","includeHiddenWrites","childCompoundWrite","hasCompleteWrite","mergeAtPath","layerTree_","write","layeredCache","subMerge","completeServerChildren","topLevelSet","merge_1","getCompleteChildren","existingEventSnap","existingServerSnap","childMerge","toIterate","writeRecord","DefaultFilter_","writes","treeRoot","compoundWrite","deepNode","treePath_","existingServerCache","SyncTree","newData","pendingWriteTree_","addOverwrite","applyOperationToSyncPoints_","addMerge","changeTree","fromObject","getWrite","affectedTree_1","Server","tag","queryKey","queryKeyForTag_","parseQueryKey_","queryPath","forServerTaggedQuery","applyTaggedOperation_","foundAncestorDefaultView","syncPointTree_","foreachOnPath","pathToSyncPoint","sp","syncPoint","foreachChild","childSyncPoint","viewAlreadyExists","viewExistsForQuery","makeQueryKey_","queryToTagMap","getNextQueryTag_","tagToQueryMap","childWrites","setupListener_","maybeSyncPoint","removedAndEvents","removingDefault","covered","findOnPath","parentSyncPoint","newViews","collectDistinctViewsForSubTree_","newQuery","listener","createListenerForView_","listenProvider_","startListening","queryForListening_","tagForQuery_","hashFn","stopListening","queryToRemove","tagToRemove","removeTags_","fold","maybeChildSyncPoint","childMap","views_1","getQueryViews","_key","childViews","queries","removedQuery","removedQueryKey","removedQueryTag","isDefault","queriesToStop","queries_1","childQueries","queryToStop","status","applyTaggedListenComplete","applyListenComplete","reason","toUpperCase","errorForServerCode","splitIndex","nextQueryTag_","applyOperationHelper_","syncPointTree","applyOperationDescendantsHelper_","childOperation","operationForChild","childServerCache","childWritesCache","SnapshotHolder","rootNode_","newSnapshotNode","AuthTokenProvider","forceRefresh","auth_","getToken","addAuthTokenListener","authProvider_","auth","removeAuthTokenListener","errorMessage","app_","options","getImmediate","StatsCollection","amount","counters_","StatsManager","hashString","collections_","creatorFunction","reporters_","StatsListener","newStats","collection_","last_","stat","StatsReporter","statsToReport_","stats","statsListener_","reportedStats","haveStatsToReport","server_","reportStats","reportStats_","collection","EventQueue","eventDataList","currList","eventPath","eventLists_","EventList","add","queueEvents","raiseQueuedEventsMatchingPredicate_","changedPath","recursionDepth_","sentAll","eventList","raise","events_","eventFn","EventEmitter","listeners_","listeners","validateEventType_","getInitialEvent","allowedEvents_","et","VisibilityMonitor","visible_","hidden","visibilityChange","document","addEventListener","trigger","OnlineMonitor","online_","PacketReceiver","responseNum","closeAfterResponse","onClose","currentResponseNum","requestNum","pendingResponses","toProcess","this_1","onMessage_","BrowserPollConnection","onMessage","onDisconnect","curSegmentNum","onDisconnect_","myPacketOrderer","isClosed_","connectTimeoutTimer_","log_","onClosed_","readyState","called_1","wrappedFn_1","attachEvent","executeWhenDOMReady","scriptTagHolder","FirebaseIFrameScriptHolder","command","arg1","arg2","incrementIncomingBytes_","clearTimeout","everConnected_","password","sendNewPolls","closeAfter","pN","handleResponse","urlFn","urlParams","start","uniqueCallbackIdentifier","transportSessionId","lastSessionId","href","connectURL","addTag","startLongPoll","addDisconnectPingFrame","forceAllow_","forceDisallow_","createElement","Windows","UI","close","myDisconnFrame","removeChild","shutdown_","dataStr","bytesSent","stats_","incrementCounter","base64data","MAX_URL_DATA_SIZE","enqueueSegment","pw","dframe","src","style","display","appendChild","bytesReceived","connId","getCollection","connectionURL","iframe","contentWindow","contentDocument","doc","alive","myIFrame","innerHTML","myID","myPW","newRequest_","outstandingRequests","pendingSegs","currentSerial","theURL","curDataString","theSeg","shift","seg","ts","addLongPollTag_","segnum","totalsegs","url","serial","doNewRequest","keepaliveTimeout","loadCB","newScript_1","async","onload","onreadystatechange","rstate","parentNode","onerror","commandCB","onMessageCB","Set","createIFrame_","script","iframeContents","open","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","device","ENV_CONSTANTS","headers","User-Agent","process","platform","env","proxy","origin","mySock","onopen","onclose","onmessage","handleIncomingFrame","isOldAndroid","userAgent","oldAndroidMatch","match","parseFloat","isInMemoryStorage","frames","totalFrames","fullMess","jsonMess","frameCount","isNaN","handleNewFrameCount_","mess","resetKeepAlive","appendFrame_","remainingData","extractFrameCount_","sendString_","keepaliveTimer","clearInterval","setInterval","send","connectionURL_","TransportManager","isWebSocketsAvailable","isSkipPollConnection","previouslyFailed","transports_","transports","ALL_TRANSPORTS","transport","initTransports_","Connection","conn","transportManager_","initialTransport","conn_","nextTransportId_","repoInfo_","primaryResponsesRequired_","onMessageReceived","connReceiver_","onConnectionLost","disconnReceiver_","tx_","rx_","secondaryConn_","isHealthy_","healthyTimeoutMS","healthyTimeout_","markConnectionHealthy","connectionCount","everConnected","onConnectionLost_","onSecondaryConnectionLost_","state_","onPrimaryMessageReceived_","onSecondaryMessageReceived_","dataMsg","msg","sendData_","controlData","cmd","upgradeIfSecondaryHealthy_","secondaryResponsesRequired_","parsedData","layer","onSecondaryControl_","pendingDataMessages","proceedWithUpgrade_","tryCleanupConnection","onControl_","onDataMessage_","onPrimaryResponse_","payload","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","timestamp","version","h","sessionId","updateHost","onConnectionEstablished_","tryStartUpgrade_","upgradeTransport","startUpgrade_","closeConnections_","start_","onReady_","onKill_","ServerActions","PersistentConnection","onResponse","curReqNum","requestNumber_","connected_","realtime_","sendRequest","requestCBHash_","currentHashFn","listens","listenSpec","sendListen_","req","warnOnListenWarnings_","removeListen_","warnings","indexSpec","indexPath","authToken_","tryAuth","reduceReconnectDelayIfAdminCredential_","credential","maxReconnectDelay_","token_1","authMethod","requestData","cred","authOverride_","invalidAuthTokenCount_","onAuthRevoked_","sendUnlisten_","queryObj","sendOnDisconnect_","onDisconnectRequestQueue_","request","response","putInternal","outstandingPuts_","outstandingPutCount_","sendPut_","queued","errorReason","reqNum","onDataPush_","onDataUpdate_","onListenRevoked_","onSecurityDebugPacket_","lastConnectionEstablishedTime_","handleTimestamp_","firstConnection_","sendConnectStats_","restoreState_","onConnectStatus_","establishConnectionTimer_","establishConnection_","reconnectDelay_","scheduleConnect_","online","cancelSentTransactions_","shouldReconnect_","lastConnectionAttemptTime_","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage_1","onReady_1","onDisconnect_1","onRealtimeDisconnect_","connId_1","nextConnectionId_","lastSessionId_1","canceled_1","connection_1","closeFn_1","forceTokenRefresh_","authTokenProvider_","accessToken","interrupt","interruptReasons_","onServerInfoUpdate_","serverTimeOffset","put","q","listen","normalizedPathString","statusCode","explanation","notifyForInvalidToken","securityDebugCallback_","_c","_e","getInstance","currentlyOnline","nextPersistentConnectionId_","onVisible_","onOnline_","ReadonlyRestClient","listenId","getListenId_","thisListen","listens_","queryStringParameters","toRestQueryStringParameters","restRequest_","authTokenData","authToken","querystringParams","arrayVal","querystring","xhr","XMLHttpRequest","responseText","INTERRUPT_REASON","Repo","infoData_","serverTime","isMerge","dataUpdateCount","interceptServerDataCallback_","taggedChildren","raw","serverSyncTree_","applyTaggedQueryMerge","taggedSnap","applyTaggedQueryOverwrite","applyServerMerge","applyServerOverwrite","rerunTransactions_","eventQueue_","raiseEventsForChangedPath","connectStatus","updateInfo_","runOnDisconnectEvents_","updateSnapshot","infoSyncTree_","nextWriteId_","newVal","generateServerValues","newNodeUnresolved","getNextWriteId_","applyUserOverwrite","success","clearEvents","callOnCompleteCallback","abortTransactions_","childrenToMerge","empty","changedKey","changedValue","writeId_1","applyUserMerge","resolvedOnDisconnectTree","resolved","onDisconnectPut","onDisconnectMerge","raiseEventsAtPath","persistentConnection_","resume","showDelta","longestName","reduce","previousValue","currentValue","paddedStat","metric","statsReporter_","includeStat","__database","Database","forceRestClient","app","authProvider","authTokenProvider","search","authOverride","addTokenChangeListener","refreshAuthToken","getOrCreateReporter","transactionsInit_","infoEvents","unlisten","RangedFilter","startPost_","endPost_","getStartPost","getEndPost","indexedFilter_","self","startName","makePost","endName","getStartPost_","getEndPost_","LimitedFilter","rangedFilter_","limit_","fullLimitUpdateChild_","reverse_","hasNext","getReverseIterator","indexCompare_1","foundStartPost","changeAccumulator","indexCmp_1","newChildNamedNode","windowBoundary","getFirstChild","getLastChild","inRange","oldChildSnap","getChildAfterChild","compareNext","getLimit","isViewFromLeft","QueryParams","startSet_","viewFrom_","WIRE_PROTOCOL_CONSTANTS_","VIEW_FROM_LEFT","indexStartValue_","startNameSet_","indexStartName_","endSet_","indexEndValue_","endNameSet_","indexEndName_","limitSet_","newLimit","copy_","VIEW_FROM_RIGHT","WIRE_PROTOCOL_CONSTANTS","INDEX_START_VALUE","INDEX_START_NAME","INDEX_END_VALUE","INDEX_END_NAME","LIMIT","viewFrom","VIEW_FROM","INDEX","REST_CONSTANTS","REST_QUERY_CONSTANTS_","qs","ORDER_BY","START_AT","END_AT","LIMIT_TO_FIRST","LIMIT_TO_LAST","Reference","parentPath","database","setWithPriority","transactionUpdate","applyLocally","bool","validateBoolean","startTransaction","thennablePushRef","pushRef","databaseProp","getRoot","DEFAULT","TransactionStatus","Tree","pathObj","TreeNode","updateParents_","childCount","hasChildren","includeSelf","childrenFirst","forEachDescendant","forEachImmediateDescendantWithValue","parent_","name_","updateChild_","childEmpty","childExists","MAX_TRANSACTION_RETRIES_","transactionQueueTree_","valueCallback","watchRef","transaction","order","retryCount","unwatcher","abortReason","currentWriteId","currentInputSnapshot","currentOutputSnapshotRaw","currentOutputSnapshotResolved","currentState","getLatestState_","RUN","queueNode","subTree","nodeQueue","setValue","priorityForNode","sendReadyTransactions_","excludeSets","pruneCompletedTransactionsBelowNode_","queue","buildTransactionQueue_","sendTransactionQueue_","setsToIgnore","txn","latestState","snapToSend","latestHash","SENT","dataToSend","pathToSend","COMPLETED","SENT_NEEDS_ABORT","NEEDS_ABORT","rootMostTransactionNode","getAncestorTransactionNode_","rerunTransactionQueue_","abortTransaction","currentNode","newDataNode","oldWriteId","newNodeResolved","lastInput","transactionNode","transactionQueue","aggregateTransactionQueuesForNode_","to","forEachAncestor","abortTransactionsOnNode_","lastSent","_staticInstance","DATABASE_URL_OPTION","RepoManager","repos_","appName","dbUrl","dbEmulatorHost","createRepo","appRepos","useRestClient_","checkDeleted_","refFromURL","apiName","parsedURL","TIMESTAMP",".sv","increment","INTERNAL","DatabaseInternals","deleteRepo","forceDisallow","forceAllow","statsIncrementCounter","interceptServerData_","DataConnection","simpleListen","echo","onEcho","RealTimeConnection","ConnectionTarget","newHash","oldPut","ServerValue","firebase","registerComponent","getProvider","databaseFromApp","setServiceProps","TEST_ACCESS","setMultipleInstances","registerVersion"],"mappings":"kTAgBA,IAAIA,EAAgB,SAASC,EAAGC,GAI5B,OAHAF,EAAgBG,OAAOC,gBAClB,CAAEC,UAAW,cAAgBC,OAAS,SAAUL,EAAGC,GAAKD,EAAEI,UAAYH,IACvE,SAAUD,EAAGC,GAAK,IAAK,IAAIK,KAAKL,EAAOA,EAAEM,eAAeD,KAAIN,EAAEM,GAAKL,EAAEK,MACpDN,EAAGC,IAGrB,SAASO,EAAUR,EAAGC,GAEzB,SAASQ,IAAOC,KAAKC,YAAcX,EADnCD,EAAcC,EAAGC,GAEjBD,EAAEY,UAAkB,OAANX,EAAaC,OAAOW,OAAOZ,IAAMQ,EAAGG,UAAYX,EAAEW,UAAW,IAAIH,GAG5E,IAAIK,EAAW,WAQlB,OAPAA,EAAWZ,OAAOa,QAAU,SAAkBC,GAC1C,IAAK,IAAIC,EAAGC,EAAI,EAAGC,EAAIC,UAAUC,OAAQH,EAAIC,EAAGD,IAE5C,IAAK,IAAIZ,KADTW,EAAIG,UAAUF,GACOhB,OAAOU,UAAUL,eAAee,KAAKL,EAAGX,KAAIU,EAAEV,GAAKW,EAAEX,IAE9E,OAAOU,IAEKO,MAAMb,KAAMU,YA8BzB,SAASI,EAAUC,EAASC,EAAYC,EAAGC,GAE9C,OAAO,IAAWD,EAANA,GAAUE,SAAU,SAAUC,EAASC,GAC/C,SAASC,EAAUC,GAAS,IAAMC,EAAKN,EAAUO,KAAKF,IAAW,MAAOG,GAAKL,EAAOK,IACpF,SAASC,EAASJ,GAAS,IAAMC,EAAKN,EAAiB,MAAEK,IAAW,MAAOG,GAAKL,EAAOK,IACvF,SAASF,EAAKI,GAJlB,IAAeL,EAIaK,EAAOC,KAAOT,EAAQQ,EAAOL,SAJ1CA,EAIyDK,EAAOL,iBAJ/BN,EAAIM,EAAQ,IAAIN,EAAE,SAAUG,GAAWA,EAAQG,MAITO,KAAKR,EAAWK,GAClGH,GAAMN,EAAYA,EAAUL,MAAME,EAASC,GAAc,KAAKS,UAI/D,SAASM,EAAYhB,EAASiB,GACjC,IAAsGC,EAAGC,EAAG5B,EAAG6B,EAA3GC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPhC,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,IAAOiC,KAAM,GAAIC,IAAK,IAChG,OAAOL,EAAI,CAAEV,KAAMgB,EAAK,GAAIC,MAASD,EAAK,GAAIE,OAAUF,EAAK,IAAwB,mBAAXG,SAA0BT,EAAES,OAAOC,UAAY,WAAa,OAAO7C,OAAUmC,EACvJ,SAASM,EAAKhC,GAAK,OAAO,SAAUqC,GAAK,OACzC,SAAcC,GACV,GAAId,EAAG,MAAM,IAAIe,UAAU,mCAC3B,KAAOZ,GAAG,IACN,GAAIH,EAAI,EAAGC,IAAM5B,EAAY,EAARyC,EAAG,GAASb,EAAU,OAAIa,EAAG,GAAKb,EAAS,SAAO5B,EAAI4B,EAAU,SAAM5B,EAAEM,KAAKsB,GAAI,GAAKA,EAAET,SAAWnB,EAAIA,EAAEM,KAAKsB,EAAGa,EAAG,KAAKlB,KAAM,OAAOvB,EAE3J,OADI4B,EAAI,EAAG5B,IAAGyC,EAAK,CAAS,EAARA,EAAG,GAAQzC,EAAEiB,QACzBwB,EAAG,IACP,KAAK,EAAG,KAAK,EAAGzC,EAAIyC,EAAI,MACxB,KAAK,EAAc,OAAXX,EAAEC,QAAgB,CAAEd,MAAOwB,EAAG,GAAIlB,MAAM,GAChD,KAAK,EAAGO,EAAEC,QAASH,EAAIa,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKX,EAAEI,IAAIS,MAAOb,EAAEG,KAAKU,MAAO,SACxC,QACI,KAAkB3C,EAAe,GAA3BA,EAAI8B,EAAEG,MAAY5B,QAAcL,EAAEA,EAAEK,OAAS,MAAkB,IAAVoC,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEX,EAAI,EAAG,SACjG,GAAc,IAAVW,EAAG,MAAczC,GAAMyC,EAAG,GAAKzC,EAAE,IAAMyC,EAAG,GAAKzC,EAAE,IAAM,CAAE8B,EAAEC,MAAQU,EAAG,GAAI,MAC9E,GAAc,IAAVA,EAAG,IAAYX,EAAEC,MAAQ/B,EAAE,GAAI,CAAE8B,EAAEC,MAAQ/B,EAAE,GAAIA,EAAIyC,EAAI,MAC7D,GAAIzC,GAAK8B,EAAEC,MAAQ/B,EAAE,GAAI,CAAE8B,EAAEC,MAAQ/B,EAAE,GAAI8B,EAAEI,IAAIU,KAAKH,GAAK,MACvDzC,EAAE,IAAI8B,EAAEI,IAAIS,MAChBb,EAAEG,KAAKU,MAAO,SAEtBF,EAAKf,EAAKpB,KAAKG,EAASqB,GAC1B,MAAOV,GAAKqB,EAAK,CAAC,EAAGrB,GAAIQ,EAAI,UAAeD,EAAI3B,EAAI,EACtD,GAAY,EAARyC,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAExB,MAAOwB,EAAG,GAAKA,EAAG,QAAK,EAAQlB,MAAM,GArB9BL,CAAK,CAACf,EAAGqC,MA6BtD,SAASK,EAASC,GACrB,IAAI7C,EAAsB,mBAAXqC,QAAyBA,OAAOC,SAAUQ,EAAI9C,GAAK6C,EAAE7C,GAAIC,EAAI,EAC5E,GAAI6C,EAAG,OAAOA,EAAEzC,KAAKwC,GACrB,GAAIA,GAAyB,iBAAbA,EAAEzC,OAAqB,MAAO,CAC1Cc,KAAM,WAEF,OADI2B,GAAK5C,GAAK4C,EAAEzC,SAAQyC,OAAI,GACrB,CAAE7B,MAAO6B,GAAKA,EAAE5C,KAAMqB,MAAOuB,KAG5C,MAAM,IAAIJ,UAAUzC,EAAI,0BAA4B,mCAGjD,SAAS+C,EAAOF,EAAG3C,GACtB,IAAI4C,EAAsB,mBAAXT,QAAyBQ,EAAER,OAAOC,UACjD,IAAKQ,EAAG,OAAOD,EACf,IAAmBG,EAAY7B,EAA3BlB,EAAI6C,EAAEzC,KAAKwC,GAAOI,EAAK,GAC3B,IACI,WAAc,IAAN/C,GAAsB,EAANA,QAAc8C,EAAI/C,EAAEiB,QAAQI,MAAM2B,EAAGN,KAAKK,EAAEhC,OAExE,MAAOkC,GAAS/B,EAAI,CAAE+B,MAAOA,WAEzB,IACQF,IAAMA,EAAE1B,OAASwB,EAAI7C,EAAU,SAAI6C,EAAEzC,KAAKJ,WAExC,GAAIkB,EAAG,MAAMA,EAAE+B,OAE7B,OAAOD,EAGJ,SAASE,IACZ,IAAK,IAAIF,EAAK,GAAIhD,EAAI,EAAGA,EAAIE,UAAUC,OAAQH,IAC3CgD,EAAKA,EAAGG,OAAOL,EAAO5C,UAAUF,KACpC,OAAOgD,EC5He,SAApBI,EAA6BC,GAIjC,IAFA,IAAMC,EAAgB,GAClBlE,EAAI,EACCY,EAAI,EAAGA,EAAIqD,EAAIlD,OAAQH,IAAK,CACnC,IAAIuD,EAAIF,EAAIG,WAAWxD,GACnBuD,EAAI,IACND,EAAIlE,KAAOmE,GACFA,EAAI,KACbD,EAAIlE,KAAQmE,GAAK,EAAK,KAGL,QAAZ,MAAJA,IACDvD,EAAI,EAAIqD,EAAIlD,QACyB,QAAZ,MAAxBkD,EAAIG,WAAWxD,EAAI,KAGpBuD,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBF,EAAIG,aAAaxD,IACvDsD,EAAIlE,KAAQmE,GAAK,GAAM,IACvBD,EAAIlE,KAASmE,GAAK,GAAM,GAAM,KAI9BD,EAAIlE,KAAQmE,GAAK,GAAM,IAHvBD,EAAIlE,KAASmE,GAAK,EAAK,GAAM,KAV7BD,EAAIlE,KAAY,GAAJmE,EAAU,KAkB1B,OAAOD,EAmTmB,SAAfG,EAAwBJ,GACnC,IACE,OAAOK,EAAOC,aAAaN,GAAK,GAChC,MAAOnC,GACP0C,QAAQX,MAAM,wBAAyB/B,GAEzC,OAAO,SCjVI2C,EAAY,CAIvBC,aAAa,EAIbC,YAAY,EAKZC,YAAa,qBCZFC,EAAS,SAASC,EAAoBC,GACjD,IAAKD,EACH,MAAME,EAAeD,IAOZC,EAAiB,SAASD,GACrC,OAAO,IAAIE,MACT,sBACER,EAAUG,YACV,6BACAG,IFsEOT,EAAiB,CAI5BY,eAAgB,KAKhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBACE,iEAKFC,mBACE,OAAOnF,KAAKkF,kBAAoB,OAMlCE,2BACE,OAAOpF,KAAKkF,kBAAoB,OAUlCG,mBAAoC,mBAATC,KAW3BC,gBAAA,SAAgBC,EAA8BC,GAC5C,IAAK9F,MAAM+F,QAAQF,GACjB,MAAMX,MAAM,iDAGd7E,KAAK2F,QAQL,IANA,IAAMC,EAAgBH,EAClBzF,KAAKgF,sBACLhF,KAAK8E,eAEHe,EAAS,GAENrF,EAAI,EAAGA,EAAIgF,EAAM7E,OAAQH,GAAK,EAAG,CACxC,IAAMsF,EAAQN,EAAMhF,GACduF,EAAYvF,EAAI,EAAIgF,EAAM7E,OAC1BqF,EAAQD,EAAYP,EAAMhF,EAAI,GAAK,EACnCyF,EAAYzF,EAAI,EAAIgF,EAAM7E,OAC1BuF,EAAQD,EAAYT,EAAMhF,EAAI,GAAK,EAEnC2F,EAAWL,GAAS,EACpBM,GAAqB,EAARN,IAAiB,EAAME,GAAS,EAC/CK,GAAqB,GAARL,IAAiB,EAAME,GAAS,EAC7CI,EAAmB,GAARJ,EAEVD,IACHK,EAAW,GAENP,IACHM,EAAW,KAIfR,EAAO3C,KACL0C,EAAcO,GACdP,EAAcQ,GACdR,EAAcS,GACdT,EAAcU,IAIlB,OAAOT,EAAOU,KAAK,KAWrBC,aAAA,SAAahB,EAAeC,GAG1B,OAAIzF,KAAKqF,qBAAuBI,EACvBgB,KAAKjB,GAEPxF,KAAKuF,gBAAgB3B,EAAkB4B,GAAQC,IAWxDtB,aAAA,SAAaqB,EAAeC,GAG1B,OAAIzF,KAAKqF,qBAAuBI,EACvBH,KAAKE,GA3LQ,SAASkB,GAKjC,IAHA,IAAM5C,EAAgB,GAClB6C,EAAM,EACR5C,EAAI,EACC4C,EAAMD,EAAM/F,QAAQ,CACzB,IAAMiG,EAAKF,EAAMC,KACjB,GAAIC,EAAK,IACP9C,EAAIC,KAAO8C,OAAOC,aAAaF,QAC1B,GAAS,IAALA,GAAYA,EAAK,IAAK,CAC/B,IAAMG,EAAKL,EAAMC,KACjB7C,EAAIC,KAAO8C,OAAOC,cAAoB,GAALF,IAAY,EAAW,GAALG,QAC9C,GAAS,IAALH,GAAYA,EAAK,IAAK,CAE/B,IAGMI,IACI,EAALJ,IAAW,IAAa,IAJvBG,EAAKL,EAAMC,QAImB,IAAa,IAH3CM,EAAKP,EAAMC,QAGuC,EAAW,GAFxDD,EAAMC,MAGf,MACF7C,EAAIC,KAAO8C,OAAOC,aAAa,OAAUE,GAAK,KAC9ClD,EAAIC,KAAO8C,OAAOC,aAAa,OAAc,KAAJE,QACpC,CACCD,EAAKL,EAAMC,KAAjB,IACMM,EAAKP,EAAMC,KACjB7C,EAAIC,KAAO8C,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,IAI9C,OAAOnD,EAAIyC,KAAK,IA+JPW,CAAkBlH,KAAKmH,wBAAwB3B,EAAOC,KAkB/D0B,wBAAA,SAAwB3B,EAAeC,GACrCzF,KAAK2F,QAQL,IANA,IAAMyB,EAAgB3B,EAClBzF,KAAKiF,sBACLjF,KAAK+E,eAEHc,EAAmB,GAEhBrF,EAAI,EAAGA,EAAIgF,EAAM7E,QAAU,CAClC,IAAMmF,EAAQsB,EAAc5B,EAAM6B,OAAO7G,MAGnCwF,EADYxF,EAAIgF,EAAM7E,OACFyG,EAAc5B,EAAM6B,OAAO7G,IAAM,EAIrD0F,IAHJ1F,EAEoBgF,EAAM7E,OACFyG,EAAc5B,EAAM6B,OAAO7G,IAAM,GAIrD8G,IAHJ9G,EAEoBgF,EAAM7E,OACFyG,EAAc5B,EAAM6B,OAAO7G,IAAM,GAG3D,KAFEA,EAEW,MAATsF,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAAToB,EACrD,MAAMzC,QAGR,IAAMsB,EAAYL,GAAS,EAAME,GAAS,EAG1C,GAFAH,EAAO3C,KAAKiD,GAEE,KAAVD,EAAc,CAChB,IAAME,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGnD,GAFAL,EAAO3C,KAAKkD,GAEE,KAAVkB,EAAc,CAChB,IAAMjB,EAAaH,GAAS,EAAK,IAAQoB,EACzCzB,EAAO3C,KAAKmD,KAKlB,OAAOR,GAQTF,iBACE,IAAK3F,KAAK8E,eAAgB,CACxB9E,KAAK8E,eAAiB,GACtB9E,KAAK+E,eAAiB,GACtB/E,KAAKgF,sBAAwB,GAC7BhF,KAAKiF,sBAAwB,GAG7B,IAAK,IAAIzE,EAAI,EAAGA,EAAIR,KAAKmF,aAAaxE,OAAQH,IAC5CR,KAAK8E,eAAetE,GAAKR,KAAKmF,aAAakC,OAAO7G,GAClDR,KAAK+E,eAAe/E,KAAK8E,eAAetE,IAAMA,EAC9CR,KAAKgF,sBAAsBxE,GAAKR,KAAKoF,qBAAqBiC,OAAO7G,IACjER,KAAKiF,sBAAsBjF,KAAKgF,sBAAsBxE,IAAMA,IAGnDR,KAAKkF,kBAAkBvE,SAC9BX,KAAK+E,eAAe/E,KAAKoF,qBAAqBiC,OAAO7G,IAAMA,EAC3DR,KAAKiF,sBAAsBjF,KAAKmF,aAAakC,OAAO7G,IAAMA,eGpTpD+G,EAAYhG,GAC1B,gBAeciG,EAAWC,EAAiBC,GAC1C,KAAMA,aAAkBlI,QACtB,OAAOkI,EAGT,OAAQA,EAAOzH,aACb,KAAK0H,KAGH,IAAMC,EAAYF,EAClB,OAAO,IAAIC,KAAKC,EAAUC,WAE5B,KAAKrI,YACYsI,IAAXL,IACFA,EAAS,IAEX,MACF,KAAK9H,MAEH8H,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,IAAMK,KAAQL,EACZA,EAAO7H,eAAekI,KAG1BN,EAAsCM,GAAQP,EAC5CC,EAAsCM,GACtCL,EAAsCK,KAI3C,OAAON,EApDAD,MAAWM,EAAWvG,UCY7ByG,yBAAA,SACEC,GADF,WAGE,OAAO,SAACxE,EAAOlC,GACTkC,EACFyE,EAAK7G,OAAOoC,GAEZyE,EAAK9G,QAAQG,GAES,mBAAb0G,IAGTC,EAAKC,QAAQC,MAAM,cAIK,IAApBH,EAAStH,OACXsH,EAASxE,GAETwE,EAASxE,EAAOlC,SA/BxB,aAAA,WAFAvB,YAAoC,aACpCA,aAAqC,aAEnCA,KAAKmI,QAAU,IAAIhH,QAAQ,SAACC,EAASC,GACnC6G,EAAK9G,QAAUA,EACf8G,EAAK7G,OAASA,aCiBJgH,IACd,MACoB,oBAAXC,SAGJA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDC,KAtB/B,oBAAdC,WAC2B,iBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,aA8FKC,IACd,OAAkE,IAAzBpE,EAAUE,WChErD,SA0BmCzE,MAAA+E,UAGjC,WAAqB6D,EAAc/D,GAAnC,MACEgE,YAAMhE,gBADauD,OAAAQ,EAFZR,OA3BQ,gBAkCf1I,OAAOC,eAAeyI,EAAMU,EAAc1I,WAItC2E,MAAMgE,mBACRhE,MAAMgE,kBAAkBX,EAAMY,EAAa5I,UAAUC,iBAezD2I,mBAAA,SACEJ,OACA,aAAAK,mBAAAA,IAAAC,oBAeA,IAbA,IA4BuCA,EA5BjCC,EAAcD,EAAK,IAAoB,GACvCE,EAAclJ,KAAKmJ,YAAWT,EAC9BU,EAAWpJ,KAAKqJ,OAAOX,GAEvB/D,EAAUyE,GAwBuBJ,EAxBcC,EAAVG,EAyB7BE,QAAQC,EAAS,SAACnH,EAAGoH,GACnC,IAAMjI,EAAQyH,EAAKQ,GACnB,OAAgB,MAATjI,EAAgBA,EAAMkI,WAAa,IAAID,UA3BqB,QAE7DE,EAAiB1J,KAAK2J,iBAAgBhF,OAAYuE,OAElDzF,EAAQ,IAAImF,EAAcM,EAAUQ,OAKxBE,EAAApK,OAAOqK,KAAKZ,GAAZa,WAAAA,IAAyB,CAAtC,IAAMN,OACa,MAAlBA,EAAIO,OAAO,KACTP,KAAO/F,GACTW,QAAQ4F,KACN,yCAAyCR,sCAG7C/F,EAAM+F,GAAOP,EAAWO,IAI5B,OAAO/F,MAlCT,WACmB0F,EACAQ,EACAN,GAFArJ,aAAAmJ,EACAnJ,iBAAA2J,EACA3J,YAAAqJ,EA0CrB,IAAME,EAAU,yBCnIAU,EAASpG,GACvB,OAAOqG,KAAKC,MAAMtG,YAQJuG,EAAUpB,GACxB,OAAOkB,KAAKE,UAAUpB,GCKF,SAATqB,EAAkBC,GAC7B,IAAIC,EAAS,GACXC,EAAiB,GACjBxB,EAAO,GACPyB,EAAY,GAEd,IACE,IAAMC,EAAQJ,EAAMK,MAAM,KAC1BJ,EAASN,EAAShG,EAAayG,EAAM,KAAO,IAC5CF,EAASP,EAAShG,EAAayG,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClB1B,EAAOwB,EAAU,GAAK,UACfA,EAAU,EACjB,MAAO9I,IAET,MAAO,CACL6I,SACAC,SACAxB,OACAyB,sBCxCYG,EAA2BC,EAAQrB,GACjD,OAAOhK,OAAOU,UAAUL,eAAee,KAAKiK,EAAKrB,YAGnCsB,EACdD,EACArB,GAEA,OAAIhK,OAAOU,UAAUL,eAAee,KAAKiK,EAAKrB,GACrCqB,EAAIrB,QAEX,WAIYuB,EAAQF,GACtB,IAAK,IAAMrB,KAAOqB,EAChB,GAAIrL,OAAOU,UAAUL,eAAee,KAAKiK,EAAKrB,GAC5C,OAAO,EAGX,OAAO,WAGOwB,EACdH,EACAI,EACAC,GAEA,IAAMC,EAAkC,GACxC,IAAK,IAAM3B,KAAOqB,EACZrL,OAAOU,UAAUL,eAAee,KAAKiK,EAAKrB,KAC5C2B,EAAI3B,GAAOyB,EAAGrK,KAAKsK,EAAYL,EAAIrB,GAAMA,EAAKqB,IAGlD,OAAOM,SCuCPC,kBAAA,WACEpL,KAAKqL,OAAO,GAAK,WACjBrL,KAAKqL,OAAO,GAAK,WACjBrL,KAAKqL,OAAO,GAAK,WACjBrL,KAAKqL,OAAO,GAAK,UACjBrL,KAAKqL,OAAO,GAAK,WAEjBrL,KAAKsL,OAAS,EACdtL,KAAKuL,OAAS,GAShBH,sBAAA,SAAUI,EAAqCC,GAE3CA,EADGA,GACM,EAGX,IAAMC,EAAI1L,KAAK2L,GAGf,GAAmB,iBAARH,EACT,IAAK,IAAIhL,EAAI,EAAGA,EAAI,GAAIA,IAStBkL,EAAElL,GACCgL,EAAIxH,WAAWyH,IAAW,GAC1BD,EAAIxH,WAAWyH,EAAS,IAAM,GAC9BD,EAAIxH,WAAWyH,EAAS,IAAM,EAC/BD,EAAIxH,WAAWyH,EAAS,GAC1BA,GAAU,OAGZ,IAASjL,EAAI,EAAGA,EAAI,GAAIA,IACtBkL,EAAElL,GACCgL,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAASjL,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMF,EAAIoL,EAAElL,EAAI,GAAKkL,EAAElL,EAAI,GAAKkL,EAAElL,EAAI,IAAMkL,EAAElL,EAAI,IAClDkL,EAAElL,GAA+B,YAAxBF,GAAK,EAAMA,IAAM,IAG5B,IAKI2B,EAAG2J,EALHC,EAAI7L,KAAKqL,OAAO,GAChB9L,EAAIS,KAAKqL,OAAO,GAChBtH,EAAI/D,KAAKqL,OAAO,GAChB/L,EAAIU,KAAKqL,OAAO,GAChB3J,EAAI1B,KAAKqL,OAAO,GAIpB,IAAS7K,EAAI,EAAGA,EAAI,GAAIA,IAIlBoL,EAHApL,EAAI,GACFA,EAAI,IACNyB,EAAI3C,EAAKC,GAAKwE,EAAIzE,GACd,aAEJ2C,EAAI1C,EAAIwE,EAAIzE,EACR,YAGFkB,EAAI,IACNyB,EAAK1C,EAAIwE,EAAMzE,GAAKC,EAAIwE,GACpB,aAEJ9B,EAAI1C,EAAIwE,EAAIzE,EACR,YAIFgB,GAAOuL,GAAK,EAAMA,IAAM,IAAO5J,EAAIP,EAAIkK,EAAIF,EAAElL,GAAM,WACzDkB,EAAIpC,EACJA,EAAIyE,EACJA,EAA8B,YAAxBxE,GAAK,GAAOA,IAAM,GACxBA,EAAIsM,EACJA,EAAIvL,EAGNN,KAAKqL,OAAO,GAAMrL,KAAKqL,OAAO,GAAKQ,EAAK,WACxC7L,KAAKqL,OAAO,GAAMrL,KAAKqL,OAAO,GAAK9L,EAAK,WACxCS,KAAKqL,OAAO,GAAMrL,KAAKqL,OAAO,GAAKtH,EAAK,WACxC/D,KAAKqL,OAAO,GAAMrL,KAAKqL,OAAO,GAAK/L,EAAK,WACxCU,KAAKqL,OAAO,GAAMrL,KAAKqL,OAAO,GAAK3J,EAAK,YAG1C0J,mBAAA,SAAO1E,EAAwC/F,GAE7C,GAAa,MAAT+F,EAAJ,MAIeoB,IAAXnH,IACFA,EAAS+F,EAAM/F,QAUjB,IAPA,IAAMmL,EAAmBnL,EAASX,KAAK+L,UACnCtL,EAAI,EAEF+K,EAAMxL,KAAKgM,KACbC,EAAQjM,KAAKsL,OAGV7K,EAAIE,GAAQ,CAKjB,GAAc,IAAVsL,EACF,KAAOxL,GAAKqL,GACV9L,KAAKkM,UAAUxF,EAAOjG,GACtBA,GAAKT,KAAK+L,UAId,GAAqB,iBAAVrF,GACT,KAAOjG,EAAIE,GAIT,GAHA6K,EAAIS,GAASvF,EAAM1C,WAAWvD,KAE5BA,IADAwL,IAEYjM,KAAK+L,UAAW,CAC5B/L,KAAKkM,UAAUV,GACfS,EAAQ,EAER,YAIJ,KAAOxL,EAAIE,GAIT,GAHA6K,EAAIS,GAASvF,EAAMjG,KAEjBA,IADAwL,IAEYjM,KAAK+L,UAAW,CAC5B/L,KAAKkM,UAAUV,GACfS,EAAQ,EAER,OAMRjM,KAAKsL,OAASW,EACdjM,KAAKuL,QAAU5K,IAIjByK,mBAAA,WACE,IAAMe,EAAmB,GACrBC,EAA0B,EAAdpM,KAAKuL,OAGjBvL,KAAKsL,OAAS,GAChBtL,KAAKqM,OAAOrM,KAAKsM,KAAM,GAAKtM,KAAKsL,QAEjCtL,KAAKqM,OAAOrM,KAAKsM,KAAMtM,KAAK+L,WAAa/L,KAAKsL,OAAS,KAIzD,IAAK,IAAI9K,EAAIR,KAAK+L,UAAY,EAAQ,IAALvL,EAASA,IACxCR,KAAKgM,KAAKxL,GAAiB,IAAZ4L,EACfA,GAAa,IAGfpM,KAAKkM,UAAUlM,KAAKgM,MAEpB,IAAIvL,EAAI,EACR,IAASD,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAI+L,EAAI,GAAS,GAALA,EAAQA,GAAK,EAC5BJ,EAAO1L,GAAMT,KAAKqL,OAAO7K,IAAM+L,EAAK,MAClC9L,EAGN,OAAO0L,MAvMT,aAjCQnM,YAAmB,GAMnBA,UAAiB,GAOjBA,QAAe,GAMfA,UAAiB,GAKjBA,YAAiB,EAKjBA,YAAiB,EAKvBA,KAAK+L,UAAY,GAEjB/L,KAAKsM,KAAK,GAAK,IACf,IAAK,IAAI9L,EAAI,EAAGA,EAAIR,KAAK+L,YAAavL,EACpCR,KAAKsM,KAAK9L,GAAK,EAGjBR,KAAKwM,QC9DuB,SAAnBC,EACXC,EACAC,EACAC,EACAC,GAEA,IAAIC,EAMJ,GALID,EAAWF,EACbG,EAAW,YAAcH,EACLC,EAAXC,IACTC,EAAwB,IAAbF,EAAiB,OAAS,gBAAkBA,GAErDE,EASF,MAAM,IAAIjI,MAPR6H,EACA,4BACAG,GACc,IAAbA,EAAiB,aAAe,eACjC,YACAC,EACA,cAaUC,EACdL,EACAM,EACAC,GAEA,IAAIC,EAAU,GACd,OAAQF,GACN,KAAK,EACHE,EAAUD,EAAW,QAAU,QAC/B,MACF,KAAK,EACHC,EAAUD,EAAW,SAAW,SAChC,MACF,KAAK,EACHC,EAAUD,EAAW,QAAU,QAC/B,MACF,KAAK,EACHC,EAAUD,EAAW,SAAW,SAChC,MACF,QACE,MAAM,IAAIpI,MACR,mEAIN,IAAIpB,EAAQiJ,EAAS,YAGrB,OADAjJ,GAASyJ,EAAU,sBA4BLC,EACdT,EACAM,EACA/E,EACAgF,GAEA,KAAIA,GAAahF,IAGO,mBAAbA,EACT,MAAM,IAAIpD,MACRkI,EAAYL,EAAQM,EAAgBC,GAClC,sCAKQG,EACdV,EACAM,EACAK,EACAJ,GAEA,KAAIA,GAAaI,KAGM,iBAAZA,GAAoC,OAAZA,GACjC,MAAM,IAAIxI,MACRkI,EAAYL,EAAQM,EAAgBC,GAClC,mCCtEoB,SAAfK,EAAwBzJ,GAEnC,IADA,IAAIjE,EAAI,EACCY,EAAI,EAAGA,EAAIqD,EAAIlD,OAAQH,IAAK,CACnC,IAAMuD,EAAIF,EAAIG,WAAWxD,GACrBuD,EAAI,IACNnE,IACSmE,EAAI,KACbnE,GAAK,EACS,OAALmE,GAAeA,GAAK,OAE7BnE,GAAK,EACLY,KAEAZ,GAAK,EAGT,OAAOA,QCnCG2N,EAAAA,0LAAAA,EAAAA,EAAAA,0BAEVA,yBACAA,mBACAA,mBACAA,qBACAA,uBAISA,EAASC,MACPD,EAASE,QACZF,EAASG,KACTH,EAASI,KACRJ,EAASK,MACRL,EAASM,OAsCiB,SAAhCC,EAAiCC,EAAUC,OAAS,aAAAjF,mBAAAA,IAAAkF,oBACxD,KAAID,EAAUD,EAASG,UAAvB,CAGA,IAAMC,GAAM,IAAIxG,MAAOyG,cACjBC,EAASC,EAAcN,GAC7B,IAAIK,EAMF,MAAM,IAAIxJ,MACR,8DAA8DmJ,OANhE5J,QAAQiK,SAARjK,WACE,IAAI+J,QAASJ,EAASQ,UACnBN,KArDT,IAYMO,EAA4BjB,EAASG,KAmBrCY,UACHf,EAASC,OAAQ,MAClB1D,EAACyD,EAASE,SAAU,MACpB3D,EAACyD,EAASG,MAAO,OACjB5D,EAACyD,EAASI,MAAO,OACjB7D,EAACyD,EAASK,OAAQ,cA4ClBpO,sBAAIiP,4BAAJ,WACE,OAAOzO,KAAK0O,eAEd,SAAaC,GACX,KAAMA,KAAOpB,GACX,MAAM,IAAIvK,UAAU,wCAEtBhD,KAAK0O,UAAYC,mCAQnBnP,sBAAIiP,8BAAJ,WACE,OAAOzO,KAAK4O,iBAEd,SAAeD,GACb,GAAmB,mBAARA,EACT,MAAM,IAAI3L,UAAU,qDAEtBhD,KAAK4O,YAAcD,mCAOrBnP,sBAAIiP,kCAAJ,WACE,OAAOzO,KAAK6O,qBAEd,SAAmBF,GACjB3O,KAAK6O,gBAAkBF,mCAOzBF,kBAAA,eAAM,aAAA1F,mBAAAA,IAAAkF,kBACJjO,KAAK6O,iBAAmB7O,KAAK6O,sBAAL7O,QAAqBA,KAAMuN,EAASC,OAAUS,IACtEjO,KAAK4O,kBAAL5O,QAAiBA,KAAMuN,EAASC,OAAUS,KAE5CQ,gBAAA,eAAI,aAAA1F,mBAAAA,IAAAkF,kBACFjO,KAAK6O,iBACH7O,KAAK6O,sBAAL7O,QAAqBA,KAAMuN,EAASE,SAAYQ,IAClDjO,KAAK4O,kBAAL5O,QAAiBA,KAAMuN,EAASE,SAAYQ,KAE9CQ,iBAAA,eAAK,aAAA1F,mBAAAA,IAAAkF,kBACHjO,KAAK6O,iBAAmB7O,KAAK6O,sBAAL7O,QAAqBA,KAAMuN,EAASG,MAASO,IACrEjO,KAAK4O,kBAAL5O,QAAiBA,KAAMuN,EAASG,MAASO,KAE3CQ,iBAAA,eAAK,aAAA1F,mBAAAA,IAAAkF,kBACHjO,KAAK6O,iBAAmB7O,KAAK6O,sBAAL7O,QAAqBA,KAAMuN,EAASI,MAASM,IACrEjO,KAAK4O,kBAAL5O,QAAiBA,KAAMuN,EAASI,MAASM,KAE3CQ,kBAAA,eAAM,aAAA1F,mBAAAA,IAAAkF,kBACJjO,KAAK6O,iBAAmB7O,KAAK6O,sBAAL7O,QAAqBA,KAAMuN,EAASK,OAAUK,IACtEjO,KAAK4O,kBAAL5O,QAAiBA,KAAMuN,EAASK,OAAUK,QAtE5C,WAAmBM,GAAAvO,UAAAuO,EAUXvO,eAAYwO,EAeZxO,iBAA0B8N,EAc1B9N,qBAAqC,YC3H7C8O,iCAAA,SAAqBC,GAEnB,OADA/O,KAAKgP,kBAAoBD,EAClB/O,MAGT8O,iCAAA,SAAqBG,GAEnB,OADAjP,KAAKiP,kBAAoBA,EAClBjP,MAGT8O,4BAAA,SAAgBI,GAEd,OADAlP,KAAKmP,aAAeD,EACblP,SAlBT,WACWuO,EACAa,EACAC,GAFArP,UAAAuO,EACAvO,qBAAAoP,EACApP,UAAAqP,EAjBXrP,wBAAoB,EAIpBA,kBAA2B,GAE3BA,8BCLF,OAaEsP,gBAAA,SAAI9F,EAAajI,GACF,MAATA,EACFvB,KAAKuP,YAAYC,WAAWxP,KAAKyP,cAAcjG,IAE/CxJ,KAAKuP,YAAYG,QAAQ1P,KAAKyP,cAAcjG,GAAMY,EAAU7I,KAQhE+N,gBAAA,SAAI9F,GACF,IAAMmG,EAAY3P,KAAKuP,YAAYK,QAAQ5P,KAAKyP,cAAcjG,IAC9D,OAAiB,MAAbmG,EACK,KAEA1F,EAAS0F,IAOpBL,mBAAA,SAAO9F,GACLxJ,KAAKuP,YAAYC,WAAWxP,KAAKyP,cAAcjG,KASjD8F,0BAAA,SAAcf,GACZ,OAAOvO,KAAK6P,QAAUtB,GAGxBe,qBAAA,WACE,OAAOtP,KAAKuP,YAAY9F,eA7C1B,WAAoB8F,GAAAvP,iBAAAuP,EALZvP,aAAU,YCNpB,OAGE8P,gBAAA,SAAItG,EAAajI,GACF,MAATA,SACKvB,KAAK+P,OAAOvG,GAEnBxJ,KAAK+P,OAAOvG,GAAOjI,GAIvBuO,gBAAA,SAAItG,GACF,OAAIoB,EAAS5K,KAAK+P,OAAQvG,GACjBxJ,KAAK+P,OAAOvG,GAEd,MAGTsG,mBAAA,SAAOtG,UACExJ,KAAK+P,OAAOvG,OAnBvB,aACUxJ,YAAmC,GAqB3CA,wBAAoB,EChBG,SAAnBgQ,GACJC,GAEA,IAGE,GACoB,oBAAX3H,aAC2B,IAA3BA,OAAO2H,GACd,CAEA,IAAMC,EAAa5H,OAAO2H,GAG1B,OAFAC,EAAWR,QAAQ,oBAAqB,SACxCQ,EAAWV,WAAW,qBACf,IAAIF,EAAkBY,IAE/B,MAAOxO,IAIT,OAAO,IAAIoO,ECAO,SAAPK,GAAgBtM,GAC3B,IAAMuM,ENlByB,SAASvM,GAGxC,IAFA,IAAMC,EAAgB,GAClBlE,EAAI,EACCY,EAAI,EAAGA,EAAIqD,EAAIlD,OAAQH,IAAK,CACnC,IAAIuD,EAAIF,EAAIG,WAAWxD,GAGvB,GAAS,OAALuD,GAAeA,GAAK,MAAQ,CAC9B,IAAMsM,EAAOtM,EAAI,MAEjBU,IADAjE,EACWqD,EAAIlD,OAAQ,2CAEvBoD,EAAI,OAAWsM,GAAQ,KADXxM,EAAIG,WAAWxD,GAAK,OAI9BuD,EAAI,IACND,EAAIlE,KAAOmE,GACFA,EAAI,KACbD,EAAIlE,KAAQmE,GAAK,EAAK,KAEbA,EAAI,MACbD,EAAIlE,KAAQmE,GAAK,GAAM,KAIvBD,EAAIlE,KAAQmE,GAAK,GAAM,IACvBD,EAAIlE,KAASmE,GAAK,GAAM,GAAM,KAJ9BD,EAAIlE,KAASmE,GAAK,EAAK,GAAM,KAH7BD,EAAIlE,KAAY,GAAJmE,EAAU,KAY1B,OAAOD,EMbWF,CAAkBC,GAC9BsM,EAAO,IAAI/E,EACjB+E,EAAK9D,OAAO+D,GACZ,IAAME,EAAYH,EAAKhE,SACvB,OAAOjI,EAAOqB,gBAAgB+K,GAiDH,SAAhBC,GACXC,EACAC,GAEAhM,GACGgM,IAA0B,IAAZD,IAAgC,IAAZA,EACnC,+CAEc,IAAZA,GACFE,GAAUxC,SAAWX,EAASE,QAC9BkD,GAASD,GAAUE,IAAIC,KAAKH,IACxBD,GACFK,GAAeC,IAAI,mBAAmB,IAEZ,mBAAZP,EAChBG,GAASH,GAETG,GAAS,KACTG,GAAeE,OAAO,oBAQP,SAANJ,SAAe,aAAA7H,mBAAAA,IAAAkI,kBAQ1B,IAPkB,IAAdC,KACFA,IAAY,EACG,OAAXP,KAA6D,IAA1CG,GAAeK,IAAI,oBACxCZ,IAAc,IAIdI,GAAQ,CACV,IAAMhM,EAAUyM,GAAiBvQ,MAAM,KAAMoQ,GAC7CN,GAAOhM,IAQe,SAAb0M,GACXC,GAEA,OAAO,eAAS,aAAAvI,mBAAAA,IAAAkI,kBACdL,mBAAIU,GAAWL,KAOE,SAARxN,SAAiB,aAAAsF,mBAAAA,IAAAkI,kBAC5B,IAAMtM,EAAU,4BAA8ByM,kBAAoBH,IAClEP,GAAUjN,MAAMkB,GAMG,SAAR4M,SAAiB,aAAAxI,mBAAAA,IAAAkI,kBAC5B,IAAMtM,EAAU,yBAAyByM,kBAAoBH,IAE7D,MADAP,GAAUjN,MAAMkB,GACV,IAAIE,MAAMF,GAME,SAAPqF,SAAgB,aAAAjB,mBAAAA,IAAAkI,kBAC3B,IAAMtM,EAAU,qBAAuByM,kBAAoBH,IAC3DP,GAAU1G,KAAKrF,GAsCkB,SAAtB6M,GAA+BxI,GAC1C,MACkB,iBAATA,IACNA,GAASA,GACRA,IAASyI,OAAOC,mBAChB1I,IAASyI,OAAOE,mBAmGO,SAAhBC,GAAyB/F,EAAWtM,GAC/C,OAAIsM,IAAMtM,EACD,EACEsM,EAAItM,GACL,EAED,EASe,SAAbsS,GACXrI,EACAqB,GAEA,GAAIA,GAAOrB,KAAOqB,EAChB,OAAOA,EAAIrB,GAEX,MAAM,IAAI3E,MACR,yBAA2B2E,EAAM,gBAAkBY,EAAUS,IA0ClC,SAApBiH,GACXjO,EACAkO,GAEA,IAAMC,EAAMnO,EAAIlD,OAEhB,GAAIqR,GAAOD,EACT,MAAO,CAAClO,GAIV,IADA,IAAMoO,EAAW,GACRlO,EAAI,EAAGA,EAAIiO,EAAKjO,GAAKgO,EACVC,EAAdjO,EAAIgO,EACNE,EAAS/O,KAAKW,EAAIqO,UAAUnO,EAAGiO,IAE/BC,EAAS/O,KAAKW,EAAIqO,UAAUnO,EAAGA,EAAIgO,IAGvC,OAAOE,EDrXT,ICSME,GDeOC,GAAoBpC,GAAiB,gBAGrCc,GAAiBd,GAAiB,kBCzBzCU,GAAY,IAAIjC,EAAO,sBAMhB4D,IACPF,GAAK,EACF,WACL,OAAOA,OAsBLf,GAAmB,eAAS,aAAArI,mBAAAA,IAAAkI,kBAEhC,IADA,IAAItM,EAAU,GACLnE,EAAI,EAAGA,EAAIyQ,EAAQtQ,OAAQH,IAAK,CACvC,IAAM8R,EAAMrB,EAAQzQ,GAElBb,MAAM+F,QAAQ4M,IACbA,GACgB,iBAARA,GAEwB,iBAAvBA,EAAY3R,OAEtBgE,GAAWyM,GAAiBvQ,MAAM,KAAMyR,GAExC3N,GADwB,iBAAR2N,EACLlI,EAAUkI,GAEVA,EAEb3N,GAAW,IAGb,OAAOA,GAOEgM,GAAuC,KAO9CO,IAAY,EAmLHqB,GAAW,aAMXC,GAAW,aAQXC,GAAc,SAAS5G,EAAWtM,GAC7C,GAAIsM,IAAMtM,EACR,OAAO,EACF,GAAIsM,IAAM0G,IAAYhT,IAAMiT,GACjC,OAAQ,EACH,GAAIjT,IAAMgT,IAAY1G,IAAM2G,GACjC,OAAO,EAEP,IAAME,EAASC,GAAY9G,GACzB+G,EAASD,GAAYpT,GAEvB,OAAe,OAAXmT,EACa,OAAXE,EACKF,EAASE,GAAW,EAAI/G,EAAElL,OAASpB,EAAEoB,OAAS+R,EAASE,GAEtD,EAEU,OAAXA,GAGF/G,EAAItM,GAAK,EAFT,GA4CAsT,GAAoB,SAAShI,GACxC,GAAmB,iBAARA,GAA4B,OAARA,EAC7B,OAAOT,EAAUS,GAGnB,IAAMhB,EAAO,GAEb,IAAK,IAAM+B,KAAKf,EACdhB,EAAK3G,KAAK0I,GAIZ/B,EAAKiJ,OAEL,IADA,IAAItJ,EAAM,IACDhJ,EAAI,EAAGA,EAAIqJ,EAAKlJ,OAAQH,IACrB,IAANA,IACFgJ,GAAO,KAETA,GAAOY,EAAUP,EAAKrJ,IACtBgJ,GAAO,IACPA,GAAOqJ,GAAkBhI,EAAIhB,EAAKrJ,KAIpC,OADAgJ,GAAO,cAqCOuJ,GAAKlI,EAAaI,GAChC,IAAK,IAAMzB,KAAOqB,EACZA,EAAIhL,eAAe2J,IACrByB,EAAGzB,EAAKqB,EAAIrB,IAyBmB,SAAxBwJ,GAAiClQ,GAG5C,IAGIvC,EAAGmB,EAAGO,EAAGgR,EAAIzS,EALjBiE,GAAQ+M,GAAoB1O,GAAI,uBAStB,IAANA,EAGFvC,EAAI,EAAIuC,IAAOoQ,GADfjR,EADAP,EAAI,GAEsB,EAAI,GAE9BnB,EAAIuC,EAAI,EAONb,GANFa,EAAIqQ,KAAKC,IAAItQ,KAEJqQ,KAAKE,IAAI,GAAG,OAGnB3R,GADAuR,EAAKE,KAAKG,IAAIH,KAAKI,MAAMJ,KAAKvC,IAAI9N,GAAKqQ,KAAKK,KAfnC,OAAA,KAiBLL,KAAKM,MAAM3Q,EAAIqQ,KAAKE,IAAI,EAlBtB,GAkBiCJ,GAAME,KAAKE,IAAI,EAlBhD,OAqBN3R,EAAI,EACAyR,KAAKM,MAAM3Q,EAAIqQ,KAAKE,IAAI,GAAG,SAKnC,IAAMK,EAAO,GACb,IAAKlT,EA5BK,GA4BMA,IAAGA,EACjBkT,EAAKxQ,KAAKjB,EAAI,EAAI,EAAI,GACtBA,EAAIkR,KAAKI,MAAMtR,EAAI,GAErB,IAAKzB,EAjCS,GAiCEA,IAAGA,EACjBkT,EAAKxQ,KAAKxB,EAAI,EAAI,EAAI,GACtBA,EAAIyR,KAAKI,MAAM7R,EAAI,GAErBgS,EAAKxQ,KAAK3C,EAAI,EAAI,GAClBmT,EAAKC,UACL,IAAM9P,EAAM6P,EAAKnN,KAAK,IAGlBqN,EAAgB,GACpB,IAAKpT,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAIqT,EAAUC,SAASjQ,EAAIkQ,OAAOvT,EAAG,GAAI,GAAGiJ,SAAS,IAC9B,IAAnBoK,EAAQlT,SACVkT,EAAU,IAAMA,GAElBD,GAAgCC,EAElC,OAAOD,EAAcI,cA2FO,SAAjBC,GAA0BhJ,GACrC,IACEA,IACA,MAAOvJ,GAEPwS,WAAW,WAKT,IAAMC,EAAQzS,EAAEyS,OAAS,GAEzB,MADAnK,GAAK,yCAA0CmK,GACzCzS,GACLyR,KAAKI,MAAM,KAoEmB,SAAxBa,GACXnJ,EACAoJ,GAEA,IAAMC,EAA2BJ,WAAWjJ,EAAIoJ,GAMhD,MAJuB,iBAAZC,GAAyBA,EAAuB,OAExDA,EAAuB,QAEnBA,EA3OF,IA8GMC,GAAkB,IAAIC,OAAO,qBAO7B7B,GAAc,SAAS9O,GAClC,GAAI0Q,GAAgBhM,KAAK1E,GAAM,CAC7B,IAAM4Q,EAAShD,OAAO5N,GACtB,IAAe,YAAX4Q,GAAyBA,GAAU,WACrC,OAAOA,EAGX,OAAO,UCnhBPjV,sBAAWkV,gBAAX,WACE,OAAO,IAAIA,GAAK,qCA6BlBA,sBAAA,WACE,OAAI1U,KAAK2U,WAAa3U,KAAK4U,QAAQjU,OAC1B,KAGFX,KAAK4U,QAAQ5U,KAAK2U,YAM3BD,uBAAA,WACE,OAAO1U,KAAK4U,QAAQjU,OAASX,KAAK2U,WAMpCD,sBAAA,WACE,IAAIG,EAAW7U,KAAK2U,UAIpB,OAHIE,EAAW7U,KAAK4U,QAAQjU,QAC1BkU,IAEK,IAAIH,GAAK1U,KAAK4U,QAASC,IAMhCH,qBAAA,WACE,OAAI1U,KAAK2U,UAAY3U,KAAK4U,QAAQjU,OACzBX,KAAK4U,QAAQ5U,KAAK4U,QAAQjU,OAAS,GAGrC,MAGT+T,sBAAA,WAEE,IADA,IAAII,EAAa,GACRtU,EAAIR,KAAK2U,UAAWnU,EAAIR,KAAK4U,QAAQjU,OAAQH,IAC5B,KAApBR,KAAK4U,QAAQpU,KACfsU,GAAc,IAAM9U,KAAK4U,QAAQpU,IAIrC,OAAOsU,GAAc,KAGvBJ,gCAAA,WAEE,IADA,IAAII,EAAa,GACRtU,EAAIR,KAAK2U,UAAWnU,EAAIR,KAAK4U,QAAQjU,OAAQH,IAC5B,KAApBR,KAAK4U,QAAQpU,KACfsU,GAAc,IAAMC,mBAAmBlO,OAAO7G,KAAK4U,QAAQpU,MAI/D,OAAOsU,GAAc,KASvBJ,mBAAA,SAAMM,GACJ,oBADIA,KACGhV,KAAK4U,QAAQ7K,MAAM/J,KAAK2U,UAAYK,IAM7CN,oBAAA,WACE,GAAI1U,KAAK2U,WAAa3U,KAAK4U,QAAQjU,OACjC,OAAO,KAIT,IADA,IAAMsU,EAAS,GACNzU,EAAIR,KAAK2U,UAAWnU,EAAIR,KAAK4U,QAAQjU,OAAS,EAAGH,IACxDyU,EAAO/R,KAAKlD,KAAK4U,QAAQpU,IAG3B,OAAO,IAAIkU,GAAKO,EAAQ,IAO1BP,mBAAA,SAAMQ,GAEJ,IADA,IAAMD,EAAS,GACNzU,EAAIR,KAAK2U,UAAWnU,EAAIR,KAAK4U,QAAQjU,OAAQH,IACpDyU,EAAO/R,KAAKlD,KAAK4U,QAAQpU,IAG3B,GAAI0U,aAAwBR,GAC1B,IACMlU,EAAI0U,EAAaP,UACrBnU,EAAI0U,EAAaN,QAAQjU,OACzBH,IAEAyU,EAAO/R,KAAKgS,EAAaN,QAAQpU,QAGnC,CAAA,IAAM2U,EAAcD,EAAavK,MAAM,KACvC,IAASnK,EAAI,EAAGA,EAAI2U,EAAYxU,OAAQH,IACV,EAAxB2U,EAAY3U,GAAGG,QACjBsU,EAAO/R,KAAKiS,EAAY3U,IAK9B,OAAO,IAAIkU,GAAKO,EAAQ,IAM1BP,qBAAA,WACE,OAAO1U,KAAK2U,WAAa3U,KAAK4U,QAAQjU,QAQjC+T,gBAAP,SAAoBU,EAAiBC,GACnC,IAAMC,EAAQF,EAAUG,WACtBC,EAAQH,EAAUE,WACpB,GAAc,OAAVD,EACF,OAAOD,EACF,GAAIC,IAAUE,EACnB,OAAOd,GAAKe,aAAaL,EAAUM,WAAYL,EAAUK,YAEzD,MAAM,IAAI7Q,MACR,8BACEwQ,EACA,8BAEAD,EACA,MAUDV,gBAAP,SAAoBiB,EAAYC,GAG9B,IAFA,IAAMC,EAAWF,EAAK5L,QAChB+L,EAAYF,EAAM7L,QACfvJ,EAAI,EAAGA,EAAIqV,EAASlV,QAAUH,EAAIsV,EAAUnV,OAAQH,IAAK,CAChE,IAAMuV,EAAMtD,GAAYoD,EAASrV,GAAIsV,EAAUtV,IAC/C,GAAY,IAARuV,EACF,OAAOA,EAGX,OAAIF,EAASlV,SAAWmV,EAAUnV,OACzB,EAEFkV,EAASlV,OAASmV,EAAUnV,QAAU,EAAI,GAQnD+T,oBAAA,SAAOsB,GACL,GAAIhW,KAAKiW,cAAgBD,EAAMC,YAC7B,OAAO,EAGT,IACE,IAAIzV,EAAIR,KAAK2U,UAAWpI,EAAIyJ,EAAMrB,UAClCnU,GAAKR,KAAK4U,QAAQjU,OAClBH,IAAK+L,IAEL,GAAIvM,KAAK4U,QAAQpU,KAAOwV,EAAMpB,QAAQrI,GACpC,OAAO,EAIX,OAAO,GAQTmI,sBAAA,SAASsB,GACP,IAAIxV,EAAIR,KAAK2U,UACTpI,EAAIyJ,EAAMrB,UACd,GAAI3U,KAAKiW,YAAcD,EAAMC,YAC3B,OAAO,EAET,KAAOzV,EAAIR,KAAK4U,QAAQjU,QAAQ,CAC9B,GAAIX,KAAK4U,QAAQpU,KAAOwV,EAAMpB,QAAQrI,GACpC,OAAO,IAEP/L,IACA+L,EAEJ,OAAO,OApOT,YAAY2J,EAAiCrB,GAC3C,QAAiB,IAAbA,EAAqB,CACvB7U,KAAK4U,QAAWsB,EAAwBvL,MAAM,KAI9C,IADA,IAAIwL,EAAS,EACJ3V,EAAI,EAAGA,EAAIR,KAAK4U,QAAQjU,OAAQH,IACV,EAAzBR,KAAK4U,QAAQpU,GAAGG,SAClBX,KAAK4U,QAAQuB,GAAUnW,KAAK4U,QAAQpU,GACpC2V,KAGJnW,KAAK4U,QAAQjU,OAASwV,EAEtBnW,KAAK2U,UAAY,OAEjB3U,KAAK4U,QAAUsB,EACflW,KAAK2U,UAAYE,EAiOvB,QAuBErV,sBAAW4W,yBAAX,WACE,OAAO,oCAIT5W,sBAAW4W,gCAAX,WACE,OAAO,qCAITA,kBAAA,SAAKC,GAEsB,EAArBrW,KAAKsW,OAAO3V,SACdX,KAAKuW,aAAe,GAEtBvW,KAAKsW,OAAOpT,KAAKmT,GACjBrW,KAAKuW,aAAejJ,EAAa+I,GACjCrW,KAAKwW,eAGPJ,iBAAA,WACE,IAAMK,EAAOzW,KAAKsW,OAAOrT,MACzBjD,KAAKuW,aAAejJ,EAAamJ,GAER,EAArBzW,KAAKsW,OAAO3V,UACdX,KAAKuW,aAIDH,yBAAR,WACE,GAAIpW,KAAKuW,YAAcH,GAAeM,sBACpC,MAAM,IAAI7R,MACR7E,KAAK2W,aACH,8BACAP,GAAeM,sBACf,WACA1W,KAAKuW,YACL,MAGN,GAAIvW,KAAKsW,OAAO3V,OAASyV,GAAeQ,eACtC,MAAM,IAAI/R,MACR7E,KAAK2W,aACH,iEACAP,GAAeQ,eACf,gCACA5W,KAAK6W,kBAUbT,2BAAA,WACE,OAA2B,IAAvBpW,KAAKsW,OAAO3V,OACP,GAEF,gBAAkBX,KAAKsW,OAAO/P,KAAK,KAAO,SAzEnD,YAAYuQ,EAAoBH,GAAA3W,kBAAA2W,EAE9B3W,KAAKsW,OAASQ,EAAK/M,QAEnB/J,KAAKuW,YAAcpD,KAAK4D,IAAI,EAAG/W,KAAKsW,OAAO3V,QAE3C,IAAK,IAAIH,EAAI,EAAGA,EAAIR,KAAKsW,OAAO3V,OAAQH,IACtCR,KAAKuW,aAAejJ,EAAatN,KAAKsW,OAAO9V,IAE/CR,KAAKwW,cC/RF,IAUMQ,GAAe,iBAIfC,GAAY,YAEZC,GAAe,mBCoB1BC,6BAAA,WACE,OACEnX,KAAKoX,OAASpX,KAAKqX,cACnBrX,KAAKsX,gBACLtX,KAAKuX,+BAITJ,6BAAA,WACE,MAA0C,OAAnCnX,KAAKqX,aAAatD,OAAO,EAAG,IAGrCoD,wBAAA,WACE,MAAuB,wBAAhBnX,KAAKwX,QAGdL,0BAAA,WACE,MACkB,mBAAhBnX,KAAKwX,QAA+C,wBAAhBxX,KAAKwX,QAI7CL,wBAAA,SAAWM,GACLA,IAAYzX,KAAKqX,eACnBrX,KAAKqX,aAAeI,EAChBzX,KAAK0X,mBACPtF,GAAkBrB,IAAI,QAAU/Q,KAAKoX,KAAMpX,KAAKqX,gBAWtDF,2BAAA,SAAc9H,EAAcsI,GAI1B,IAAIC,EACJ,GAJAnT,EAAuB,iBAAT4K,EAAmB,8BACjC5K,EAAyB,iBAAXkT,EAAqB,gCAG/BtI,IAAS4H,GACXW,GACG5X,KAAK6X,OAAS,SAAW,SAAW7X,KAAKqX,aAAe,YACtD,CAAA,GAAIhI,IAAS6H,GAIlB,MAAM,IAAIrS,MAAM,4BAA8BwK,GAH9CuI,GACG5X,KAAK6X,OAAS,WAAa,WAAa7X,KAAKqX,aAAe,QAI7DrX,KAAK8X,oBACPH,EAAW,GAAI3X,KAAK+X,WAGtB,IAAMC,EAAkB,GAMxB,OAJAjF,GAAK4E,EAAQ,SAACnO,EAAajI,GACzByW,EAAM9U,KAAKsG,EAAM,IAAMjI,KAGlBqW,EAAUI,EAAMzR,KAAK,MAI9B4Q,sBAAA,WACE,IAAItT,EAAM7D,KAAKiY,cAIf,OAHIjY,KAAKkY,iBACPrU,GAAO,IAAM7D,KAAKkY,eAAiB,KAE9BrU,GAITsT,yBAAA,WACE,OAAQnX,KAAK6X,OAAS,WAAa,WAAa7X,KAAKoX,UAzFvD,YACEA,EACOS,EACAE,EACAI,EACAD,EACAX,gBADAW,mBACAX,MAJAvX,YAAA6X,EACA7X,eAAA+X,EACA/X,mBAAAmY,EACAnY,oBAAAkY,EACAlY,mCAAAuX,EAEPvX,KAAKoX,KAAOA,EAAKpD,cACjBhU,KAAKwX,OAASxX,KAAKoX,KAAKrD,OAAO/T,KAAKoX,KAAKgB,QAAQ,KAAO,GACxDpY,KAAKqX,aACFjF,GAAkBjB,IAAI,QAAUiG,IAAoBpX,KAAKoX,KCkBnC,SAAhBiB,GACXC,GAEA,IAAMC,EAAYC,GAAiBF,GACjCP,EAAYQ,EAAUR,UAEC,iBAArBQ,EAAUf,QACZjG,GACEgH,EAAUnB,KACR,8EAOFW,GAA2B,cAAdA,GACM,cAArBQ,EAAUf,QAEVjG,GACE,gFAICgH,EAAUV,QJiGK,oBAAXvP,QACPA,OAAOmQ,UACPnQ,OAAOmQ,SAASC,WACgC,IAAhDpQ,OAAOmQ,SAASC,SAASN,QAAQ,WAEjCpO,GACE,6FInGJ,IAAMmO,EAAqC,OAArBI,EAAUI,QAAwC,QAArBJ,EAAUI,OAE7D,MAAO,CACLC,SAAU,IAAIzB,GACZoB,EAAUnB,KACVmB,EAAUV,OACVE,EACAI,EACoB,GACeJ,IAAcQ,EAAUM,WAE7D/B,KAAM,IAAIpC,GAAK6D,EAAUzD,aCrDH,SAAbgE,GAAsBtP,GACjC,MACiB,iBAARA,GAAmC,IAAfA,EAAI7I,SAAiBoY,GAAmBxQ,KAAKiB,GAQ3C,SAApBwP,GAA6BlE,GACxC,MACwB,iBAAfA,GACe,IAAtBA,EAAWnU,SACVsY,GAAoB1Q,KAAKuM,GAqBC,SAAlBoE,GAA2BC,GACtC,OACe,OAAbA,GACoB,iBAAbA,GACc,iBAAbA,IAA0B3H,GAAoB2H,IACrDA,GACqB,iBAAbA,GAEPvO,EAASuO,EAAiB,OAaO,SAA1BC,GACX1M,EACAM,EACAhE,EACA8N,EACA7J,GAEIA,QAAqBnF,IAATkB,GAIhBqQ,GACEC,EAAe5M,EAAQM,EAAgBC,GACvCjE,EACA8N,GA2JwC,SAA/ByC,GACX7M,EACAM,EACAhE,EACA8N,EACA7J,GAEA,IAAIA,QAAqBnF,IAATkB,EAAhB,CAIA,IAAM+D,EAAcuM,EAAe5M,EAAQM,EAAgBC,GAE3D,IAAMjE,GAAwB,iBAATA,GAAsBrJ,MAAM+F,QAAQsD,GACvD,MAAM,IAAInE,MACRkI,EAAc,0DAIlB,IAAMyM,EAAqB,GAC3BzG,GAAK/J,EAAM,SAACQ,EAAajI,GACvB,IAAMkY,EAAU,IAAI/E,GAAKlL,GAEzB,GADA6P,GAAqBtM,EAAaxL,EAAOuV,EAAKT,MAAMoD,IAC1B,cAAtBA,EAAQC,YACLR,GAAgB3X,GACnB,MAAM,IAAIsD,MACRkI,EACE,kCACA0M,EAAQhQ,WACR,gGAKR+P,EAAWtW,KAAKuW,KAzFsB,SACxC1M,EACAyM,GAEA,IAAIhZ,EAAGiZ,EACP,IAAKjZ,EAAI,EAAGA,EAAIgZ,EAAW7Y,OAAQH,IAGjC,IADA,IAAMqJ,GADN4P,EAAUD,EAAWhZ,IACAuJ,QACZwC,EAAI,EAAGA,EAAI1C,EAAKlJ,OAAQ4L,IAC/B,IAAgB,cAAZ1C,EAAK0C,IAAsBA,IAAM1C,EAAKlJ,OAAS,KAEvCmY,GAAWjP,EAAK0C,IAC1B,MAAM,IAAI1H,MACRkI,EACE,4BACAlD,EAAK0C,GACL,aACAkN,EAAQhQ,WACR,uFAUV+P,EAAW1G,KAAK4B,GAAKiF,cACrB,IAAIC,EAAwB,KAC5B,IAAKpZ,EAAI,EAAGA,EAAIgZ,EAAW7Y,OAAQH,IAAK,CAEtC,GADAiZ,EAAUD,EAAWhZ,GACJ,OAAboZ,GAAqBA,EAAShP,SAAS6O,GACzC,MAAM,IAAI5U,MACRkI,EACE,mBACA6M,EAASnQ,WACT,qCACAgQ,EAAQhQ,YAGdmQ,EAAWH,GAkDbI,CAA2B9M,EAAayM,IAGV,SAAnBM,GACXpN,EACAM,EACAmM,EACAlM,GAEA,IAAIA,QAAyBnF,IAAbqR,EAAhB,CAGA,GAAI3H,GAAoB2H,GACtB,MAAM,IAAItU,MACRyU,EAAe5M,EAAQM,EAAgBC,GACrC,MACAkM,EAAS1P,WACT,6FAKN,IAAKyP,GAAgBC,GACnB,MAAM,IAAItU,MACRyU,EAAe5M,EAAQM,EAAgBC,GACrC,wFAMyB,SAApB8M,GACXrN,EACAM,EACAgN,EACA/M,GAEA,IAAIA,QAA0BnF,IAAdkS,EAIhB,OAAQA,GACN,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACH,MACF,QACE,MAAM,IAAInV,MACRyU,EAAe5M,EAAQM,EAAgBC,GACrC,6GAMiB,SAAdgN,GACXvN,EACAM,EACAxD,EACAyD,GAEA,KAAIA,QAAoBnF,IAAR0B,GAGXsP,GAAWtP,IACd,MAAM,IAAI3E,MACRyU,EAAe5M,EAAQM,EAAgBC,GACrC,yBACAzD,EACA,oGAM0B,SAArB0Q,GACXxN,EACAM,EACA8H,EACA7H,GAEA,KAAIA,QAA2BnF,IAAfgN,GAIXkE,GAAkBlE,IACrB,MAAM,IAAIjQ,MACRyU,EAAe5M,EAAQM,EAAgBC,GACrC,0BACA6H,EACA,oFAoB4B,SAAvBqF,GAAgCzN,EAAgBoK,GAC3D,GAAwB,UAApBA,EAAKvB,WACP,MAAM,IAAI1Q,MAAM6H,EAAS,6CAIF,SAAd0N,GACX1N,EACAM,EACAuL,GAGA,IA3W4CzD,EA2WtCA,EAAayD,EAAUzB,KAAKrN,WAClC,GACuC,iBAA5B8O,EAAUK,SAASxB,MACO,IAAnCmB,EAAUK,SAASxB,KAAKzW,SACtBmY,GAAWP,EAAUK,SAASb,YACY,cAA1CQ,EAAUK,SAASxB,KAAKzM,MAAM,KAAK,IACd,IAAtBmK,EAAWnU,SA9WZmU,GAH0CA,EAiXSA,IA9WtCA,EAAWxL,QAAQ,mBAAoB,MAG/C0P,GAAkBlE,IA6WvB,MAAM,IAAIjQ,MACRyU,EAAe5M,EAAQM,GAAgB,GACrC,wFD7XD,IAgDMwL,GAAmB,SAC9BF,GAYA,IAAIlB,EAAO,GACTI,EAAS,GACTqB,EAAY,GACZ/D,EAAa,GACbiD,EAAY,GAGVF,GAAS,EACXc,EAAS,QACT0B,EAAO,IAGT,GAAuB,iBAAZ/B,EAAsB,CAE/B,IAAIgC,EAAWhC,EAAQF,QAAQ,MACf,GAAZkC,IACF3B,EAASL,EAAQpG,UAAU,EAAGoI,EAAW,GACzChC,EAAUA,EAAQpG,UAAUoI,EAAW,IAIzC,IAAIC,EAAWjC,EAAQF,QAAQ,MACb,IAAdmC,IACFA,EAAWjC,EAAQ3X,QAErB,IAAI6Z,EAAkBlC,EAAQF,QAAQ,MACb,IAArBoC,IACFA,EAAkBlC,EAAQ3X,QAE5ByW,EAAOkB,EAAQpG,UAAU,EAAGiB,KAAKG,IAAIiH,EAAUC,IAC3CD,EAAWC,IAEb1F,EAxIN,SAAoBA,GAGlB,IAFA,IAAI2F,EAAoB,GAClBxF,EAASH,EAAWnK,MAAM,KACvBnK,EAAI,EAAGA,EAAIyU,EAAOtU,OAAQH,IACjC,GAAuB,EAAnByU,EAAOzU,GAAGG,OAAY,CACxB,IAAI+Z,EAAQzF,EAAOzU,GACnB,IACEka,EAAQC,mBAAmBD,EAAMpR,QAAQ,MAAO,MAChD,MAAO5H,IACT+Y,GAAqB,IAAMC,EAG/B,OAAOD,EA4HUG,CAAWtC,EAAQpG,UAAUqI,EAAUC,KAEtD,IAAMK,EAvHV,SAAqBC,WACbC,EAAU,GACc,MAA1BD,EAAYzT,OAAO,KACrByT,EAAcA,EAAY5I,UAAU,QAEtC,IAAsB,IAAAtI,EAAAzG,EAAA2X,EAAYnQ,MAAM,oCAAM,CAAzC,IAAMqQ,UACT,GAAuB,IAAnBA,EAAQra,OAAZ,CAGA,IAAMsa,EAAKD,EAAQrQ,MAAM,KACP,IAAdsQ,EAAGta,OACLoa,EAAQJ,mBAAmBM,EAAG,KAAON,mBAAmBM,EAAG,IAE3DjR,GAAK,0BAA0BgR,iBAAsBF,0GAGzD,OAAOC,EAuGeG,CAClB5C,EAAQpG,UAAUiB,KAAKG,IAAIgF,EAAQ3X,OAAQ6Z,KAK7B,IADhBF,EAAWlD,EAAKgB,QAAQ,OAEtBP,EAAoB,UAAXc,GAAiC,QAAXA,EAC/B0B,EAAOvG,SAASsD,EAAKlF,UAAUoI,EAAW,GAAI,KAE9CA,EAAWlD,EAAKzW,OAGlB,IAAMwa,EAAkB/D,EAAKrN,MAAM,EAAGuQ,GACtC,GAAsC,cAAlCa,EAAgBnH,cAClBwD,EAAS,iBACJ,GAAI2D,EAAgBxQ,MAAM,KAAKhK,QAAU,EAC9C6W,EAAS2D,MACJ,CAEL,IAAMC,EAAShE,EAAKgB,QAAQ,KAC5BS,EAAYzB,EAAKlF,UAAU,EAAGkJ,GAAQpH,cACtCwD,EAASJ,EAAKlF,UAAUkJ,EAAS,GAEjCrD,EAAYc,EAGV,OAAQgC,IACV9C,EAAY8C,EAAgB,IAIhC,MAAO,CACLzD,OACAiD,OACA7C,SACAqB,YACAhB,SACAc,SACA7D,aACAiD,cC1KSgB,GAAqB,iCAQrBE,GAAsB,+BAOtBoC,GAAiB,SAuFjBhC,GAAuB,SAClCtM,EACA/D,EACAsS,GAEA,IAAMxE,EACJwE,aAAiB5G,GAAO,IAAI0B,GAAekF,EAAOvO,GAAeuO,EAEnE,QAAaxT,IAATkB,EACF,MAAM,IAAInE,MAAMkI,EAAc,sBAAwB+J,EAAKD,iBAE7D,GAAoB,mBAAT7N,EACT,MAAM,IAAInE,MACRkI,EACE,uBACA+J,EAAKD,gBACL,oBACA7N,EAAKS,YAGX,GAAI+H,GAAoBxI,GACtB,MAAM,IAAInE,MACRkI,EAAc,YAAc/D,EAAKS,WAAa,IAAMqN,EAAKD,iBAK7D,GACkB,iBAAT7N,GACPA,EAAKrI,OAAS0a,GAAiB,GAC/B/N,EAAatE,GAAQqS,GAErB,MAAM,IAAIxW,MACRkI,EACE,kCACAsO,GACA,eACAvE,EAAKD,gBACL,MACA7N,EAAKkJ,UAAU,EAAG,IAClB,SAMN,GAAIlJ,GAAwB,iBAATA,EAAmB,CACpC,IAAIuS,GAAc,EACdC,GAAiB,EAwBrB,GAvBAzI,GAAK/J,EAAM,SAACQ,EAAajI,GACvB,GAAY,WAARiI,EACF+R,GAAc,OACT,GAAY,cAAR/R,GAA+B,QAARA,IAChCgS,GAAiB,GACZ1C,GAAWtP,IACd,MAAM,IAAI3E,MACRkI,EACE,6BACAvD,EACA,KACAsN,EAAKD,gBACL,wFAMRC,EAAK5T,KAAKsG,GACV6P,GAAqBtM,EAAaxL,EAAOuV,GACzCA,EAAK7T,QAGHsY,GAAeC,EACjB,MAAM,IAAI3W,MACRkI,EACE,4BACA+J,EAAKD,gBACL,0CCxKR4E,oBAAA,SAAOC,GACLjP,EAAiB,sBAAuB,EAAG,EAAG/L,UAAUC,QACxDwM,EAAiB,sBAAuB,EAAGuO,GAAY,GACvD,IAAMC,EAAW,IAAI3T,EAKrB,OAJAhI,KAAK4b,MAAMC,mBACT7b,KAAKsb,MACLK,EAASG,aAAaJ,IAEjBC,EAASxT,SAOlBsT,oBAAA,SAAOC,GACLjP,EAAiB,sBAAuB,EAAG,EAAG/L,UAAUC,QACxDwZ,GAAqB,sBAAuBna,KAAKsb,OACjDnO,EAAiB,sBAAuB,EAAGuO,GAAY,GACvD,IAAMC,EAAW,IAAI3T,EAMrB,OALAhI,KAAK4b,MAAMG,gBACT/b,KAAKsb,MACL,KACAK,EAASG,aAAaJ,IAEjBC,EAASxT,SAQlBsT,iBAAA,SAAIla,EAAgBma,GAClBjP,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QACrDwZ,GAAqB,mBAAoBna,KAAKsb,OAC9ClC,GAAwB,mBAAoB,EAAG7X,EAAOvB,KAAKsb,OAAO,GAClEnO,EAAiB,mBAAoB,EAAGuO,GAAY,GACpD,IAAMC,EAAW,IAAI3T,EAMrB,OALAhI,KAAK4b,MAAMG,gBACT/b,KAAKsb,MACL/Z,EACAoa,EAASG,aAAaJ,IAEjBC,EAASxT,SASlBsT,6BAAA,SACEla,EACA4X,EACAuC,GAEAjP,EAAiB,+BAAgC,EAAG,EAAG/L,UAAUC,QACjEwZ,GAAqB,+BAAgCna,KAAKsb,OAC1DlC,GACE,+BACA,EACA7X,EACAvB,KAAKsb,OACL,GAEFxB,GAAiB,+BAAgC,EAAGX,GAAU,GAC9DhM,EAAiB,+BAAgC,EAAGuO,GAAY,GAEhE,IAAMC,EAAW,IAAI3T,EAOrB,OANAhI,KAAK4b,MAAMI,4BACThc,KAAKsb,MACL/Z,EACA4X,EACAwC,EAASG,aAAaJ,IAEjBC,EAASxT,SAQlBsT,oBAAA,SACEQ,EACAP,GAIA,GAFAjP,EAAiB,sBAAuB,EAAG,EAAG/L,UAAUC,QACxDwZ,GAAqB,sBAAuBna,KAAKsb,OAC7C3b,MAAM+F,QAAQuW,GAAgB,CAEhC,IADA,IAAMC,EAA6C,GAC1C1b,EAAI,EAAGA,EAAIyb,EAActb,SAAUH,EAC1C0b,EAAiB,GAAK1b,GAAKyb,EAAczb,GAE3Cyb,EAAgBC,EAChBlS,GACE,gOAIJuP,GACE,sBACA,EACA0C,EACAjc,KAAKsb,OACL,GAEFnO,EAAiB,sBAAuB,EAAGuO,GAAY,GACvD,IAAMC,EAAW,IAAI3T,EAMrB,OALAhI,KAAK4b,MAAMO,mBACTnc,KAAKsb,MACLW,EACAN,EAASG,aAAaJ,IAEjBC,EAASxT,aA1HlB,YAAoByT,EAAqBN,GAArBtb,WAAA4b,EAAqB5b,WAAAsb,EClB3C,QAYEc,oBAAA,WAEE,OADA3P,EAAiB,2BAA4B,EAAG,EAAG/L,UAAUC,QACtD,CAAE0b,UAAWrc,KAAKqc,UAAWC,SAAUtc,KAAKsc,SAASC,eAN9D,YAAmBF,EAA2BC,GAA3Btc,eAAAqc,EAA2Brc,cAAAsc,ECKzC,IAECE,GAKFC,GAMEC,GAbKC,IAELH,GACJ,mEAIEC,GAAe,EAMbC,GAA0B,GAEzB,SAASvO,GACd,IAGI3N,EAHEoc,EAAgBzO,IAAQsO,GAC9BA,GAAetO,EAGf,IAAM0O,EAAiB,IAAIld,MAAM,GACjC,IAAKa,EAAI,EAAQ,GAALA,EAAQA,IAClBqc,EAAerc,GAAKgc,GAAWnV,OAAO8G,EAAM,IAG5CA,EAAMgF,KAAKI,MAAMpF,EAAM,IAEzB1J,EAAe,IAAR0J,EAAW,4BAElB,IAAIgE,EAAK0K,EAAetW,KAAK,IAE7B,GAAKqW,EAIE,CAGL,IAAKpc,EAAI,GAAS,GAALA,GAA+B,KAArBkc,GAAclc,GAAWA,IAC9Ckc,GAAclc,GAAK,EAErBkc,GAAclc,UATd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBkc,GAAclc,GAAK2S,KAAKI,MAAsB,GAAhBJ,KAAK2J,UAUvC,IAAKtc,EAAI,EAAGA,EAAI,GAAIA,IAClB2R,GAAMqK,GAAWnV,OAAOqV,GAAclc,IAIxC,OAFAiE,EAAqB,KAAd0N,EAAGxR,OAAe,oCAElBwR,QCwFF4K,QAAP,SAAYxO,EAAcyO,GACxB,OAAO,IAAID,GAAUxO,EAAMyO,QAT7B,YAAmBzO,EAAqByO,GAArBhd,UAAAuO,EAAqBvO,UAAAgd,ECxI1C,ICFIC,ODoBFC,wBAAA,WACE,OAAOld,KAAKmd,QAAQtM,KAAK7Q,OAW3Bkd,iCAAA,SAAoBE,EAAeC,GACjC,IAAMC,EAAa,IAAIP,GAAUxK,GAAU6K,GACrCG,EAAa,IAAIR,GAAUxK,GAAU8K,GAC3C,OAAgD,IAAzCrd,KAAKmd,QAAQG,EAAYC,IAOlCL,qBAAA,WAEE,OAAQH,GAAkBS,SA1C9B,eCAA,WAA8B1d,QAAAod,IAC5B1d,sBAAWie,uBAAX,WACE,OAAOR,QAGT,SAAwBtO,GACtBsO,GAAetO,mCAMjB8O,qBAAA,SAAQ5R,EAActM,GACpB,OAAOkT,GAAY5G,EAAE0C,KAAMhP,EAAEgP,OAM/BkP,yBAAA,SAAYT,GAGV,MAAMpY,EAAe,oDAMvB6Y,iCAAA,SAAoBL,EAAeC,GACjC,OAAO,GAMTI,qBAAA,WAEE,OAAQV,GAAkBS,KAM5BC,qBAAA,WAGE,OAAO,IAAIV,GAAUvK,GAAUyK,KAQjCQ,sBAAA,SAASC,EAAoBnP,GAM3B,OALA9J,EACwB,iBAAfiZ,EACP,gDAGK,IAAIX,GAAUW,EAAYT,KAMnCQ,sBAAA,WACE,MAAO,YAnEX,+DAuEO,ICzEHE,GDyESC,GAAY,IAAIH,GC/DG,SAAnBI,GAA4B1E,GACvC,MAAwB,iBAAbA,EACF,UAAYnG,GAAsBmG,GAElC,UAAYA,EASa,SAAvB2E,GAAgCC,GAC3C,GAAIA,EAAaC,aAAc,CAC7B,IAAMrP,EAAMoP,EAAapP,MACzBlK,EACiB,iBAARkK,GACU,iBAARA,GACS,iBAARA,GAAoB/D,EAAS+D,EAAkB,OACzD,6CAGFlK,EACEsZ,IAAiBJ,IAAYI,EAAahT,UAC1C,gCAIJtG,EACEsZ,IAAiBJ,IAAYI,EAAaE,cAAclT,UACxD,sDA/BG,ICPHmT,GCJAC,GACAR,UDWFne,sBAAW4e,oCAIX,WACE,OAAOF,QALT,SAAqCvP,GACnCuP,GAA4BvP,mCAoC9ByP,wBAAA,WACE,OAAO,GAITA,yBAAA,WACE,OAAOpe,KAAKqe,eAIdD,4BAAA,SAAeE,GACb,OAAO,IAAIF,GAASpe,KAAKue,OAAQD,IAInCF,+BAAA,SAAkBI,GAEhB,MAAkB,cAAdA,EACKxe,KAAKqe,cAELD,GAASF,0BAA0BO,YAK9CL,sBAAA,SAAStH,GACP,OAAIA,EAAK/L,UACA/K,KACsB,cAApB8W,EAAKvB,WACPvV,KAAKqe,cAELD,GAASF,0BAA0BO,YAO9CL,sBAAA,WACE,OAAO,GAITA,qCAAA,SAAwBI,EAAmBE,GACzC,OAAO,MAITN,kCAAA,SAAqBI,EAAmBG,GACtC,MAAkB,cAAdH,EACKxe,KAAK4e,eAAeD,GAClBA,EAAa5T,WAA2B,cAAdyT,EAC5Bxe,KAEAoe,GAASF,0BAA0BO,WAAWI,qBACnDL,EACAG,GACAC,eAAe5e,KAAKqe,gBAK1BD,yBAAA,SAAYtH,EAAY6H,GACtB,IAAMG,EAAQhI,EAAKvB,WACnB,OAAc,OAAVuJ,EACKH,EACEA,EAAa5T,WAAuB,cAAV+T,EAC5B9e,MAEPyE,EACY,cAAVqa,GAA8C,IAArBhI,EAAKb,YAC9B,8CAGKjW,KAAK6e,qBACVC,EACAV,GAASF,0BAA0BO,WAAWM,YAC5CjI,EAAKpB,WACLiJ,MAORP,qBAAA,WACE,OAAO,GAITA,yBAAA,WACE,OAAO,GAITA,0BAAA,SAAaY,EAAcC,GACzB,OAAO,GAMTb,iBAAA,SAAIc,GACF,OAAIA,IAAiBlf,KAAKie,cAAclT,UAC/B,CACLoU,SAAUnf,KAAKof,WACfC,YAAarf,KAAKie,cAActP,OAG3B3O,KAAKof,YAKhBhB,kBAAA,WACE,GAAuB,OAAnBpe,KAAKsf,UAAoB,CAC3B,IAAIC,EAAS,GACRvf,KAAKqe,cAActT,YACtBwU,GACE,YACA1B,GAAiB7d,KAAKqe,cAAc1P,OACpC,KAGJ,IAAMU,SAAcrP,KAAKue,OACzBgB,GAAUlQ,EAAO,IAEfkQ,GADW,UAATlQ,EACQ2D,GAAsBhT,KAAKue,QAE3Bve,KAAKue,OAEjBve,KAAKsf,UAAYnP,GAAKoP,GAExB,OAAOvf,KAAKsf,WAOdlB,sBAAA,WACE,OAAOpe,KAAKue,QAMdH,uBAAA,SAAUpI,GACR,OAAIA,IAAUoI,GAASF,0BAA0BO,WACxC,EACEzI,aAAiBoI,GAASF,2BAC3B,GAERzZ,EAAOuR,EAAMgI,aAAc,qBACpBhe,KAAKwf,mBAAmBxJ,KAU3BoI,gCAAR,SAA2BqB,GACzB,IAAMC,SAAuBD,EAAUlB,OACjCoB,SAAsB3f,KAAKue,OAC3BqB,EAAaxB,GAASyB,iBAAiBzH,QAAQsH,GAC/CI,EAAY1B,GAASyB,iBAAiBzH,QAAQuH,GAGpD,OAFAlb,EAAqB,GAAdmb,EAAiB,sBAAwBF,GAChDjb,EAAoB,GAAbqb,EAAgB,sBAAwBH,GAC3CC,IAAeE,EAEI,UAAjBH,EAEK,EAGH3f,KAAKue,OAASkB,EAAUlB,QAClB,EACCve,KAAKue,SAAWkB,EAAUlB,OAC5B,EAEA,EAIJuB,EAAYF,GAOvBxB,uBAAA,WACE,OAAOpe,MAMToe,uBAAA,WACE,OAAO,GAMTA,oBAAA,SAAOpI,GAIL,OAAIA,IAAUhW,QAEHgW,EAAMgI,eAGbhe,KAAKue,SAFWvI,EAEUuI,QAC1Bve,KAAKqe,cAAc0B,OAHH/J,EAGoBqI,iBAjPnCD,oBAAmB,CAAC,SAAU,UAAW,SAAU,cAU1D,YACmBG,EACTF,gBAAAA,EAAsBD,GAASF,0BAA0BO,YADhDze,YAAAue,EACTve,mBAAAqe,EAVFre,eAA2B,KAYjCyE,OACkBqD,IAAhB9H,KAAKue,QAAwC,OAAhBve,KAAKue,OAClC,4DAGFT,GAAqB9d,KAAKqe,eC7B9B,+DA8DO,IAAM2B,GAAiB,IA9DKlgB,QAAAod,IAIjC+C,qBAAA,SAAQpU,EAActM,GACpB,IAAM2gB,EAAYrU,EAAEmR,KAAKiB,cACnBkC,EAAY5gB,EAAEyd,KAAKiB,cACnBmC,EAAWF,EAAUG,UAAUF,GACrC,OAAiB,IAAbC,EACK3N,GAAY5G,EAAE0C,KAAMhP,EAAEgP,MAEtB6R,GAOXH,yBAAA,SAAYjD,GACV,OAAQA,EAAKiB,cAAclT,WAM7BkV,iCAAA,SAAoB7C,EAAeC,GACjC,OAAQD,EAAQa,cAAc8B,OAAO1C,EAAQY,gBAM/CgC,qBAAA,WAEE,OAAQlD,GAAkBS,KAM5ByC,qBAAA,WACE,OAAO,IAAIlD,GAAUvK,GAAU,IAAI4L,GAAS,kBAAmBT,MAQjEsC,sBAAA,SAASvC,EAAqBnP,GAC5B,IAAMwP,EAAeI,GAAaT,GAClC,OAAO,IAAIX,GAAUxO,EAAM,IAAI6P,GAAS,kBAAmBL,KAM7DkC,sBAAA,WACE,MAAO,qBCDTK,qBAAA,WACE,GAA+B,IAA3BtgB,KAAKugB,WAAW5f,OAClB,OAAO,KAGT,IACIiB,EADAob,EAAOhd,KAAKugB,WAAWtd,MAQ3B,GALErB,EADE5B,KAAKwgB,iBACExgB,KAAKwgB,iBAAiBxD,EAAKxT,IAAKwT,EAAKzb,OAEpC,CAAEiI,IAAKwT,EAAKxT,IAAKjI,MAAOyb,EAAKzb,OAGrCvB,KAAKygB,WAEP,IADAzD,EAAOA,EAAKrH,MACJqH,EAAKjS,WACX/K,KAAKugB,WAAWrd,KAAK8Z,GACrBA,EAAOA,EAAKpH,WAId,IADAoH,EAAOA,EAAKpH,OACJoH,EAAKjS,WACX/K,KAAKugB,WAAWrd,KAAK8Z,GACrBA,EAAOA,EAAKrH,KAIhB,OAAO/T,GAGT0e,qBAAA,WACE,OAAgC,EAAzBtgB,KAAKugB,WAAW5f,QAGzB2f,kBAAA,WACE,GAA+B,IAA3BtgB,KAAKugB,WAAW5f,OAClB,OAAO,KAGT,IAAMqc,EAAOhd,KAAKugB,WAAWvgB,KAAKugB,WAAW5f,OAAS,GACtD,OAAIX,KAAKwgB,iBACAxgB,KAAKwgB,iBAAiBxD,EAAKxT,IAAKwT,EAAKzb,OAEpC,CAAEiI,IAAKwT,EAAKxT,IAAKjI,MAAOyb,EAAKzb,YAlFzC,YACEyb,EACA0D,EACAC,EACQF,EACAD,gBAAAA,QADAxgB,gBAAAygB,EACAzgB,sBAAAwgB,EAfFxgB,gBAA0D,GAkBhE,IADA,IAAI+V,EAAM,GACFiH,EAAKjS,WAQX,GAPAiS,EAAOA,EACPjH,EAAM2K,EAAWC,EAAW3D,EAAKxT,IAAKkX,GAAY,EAE9CD,IACF1K,IAAQ,GAGNA,EAAM,EAGNiH,EADEhd,KAAKygB,WACAzD,EAAKrH,KAELqH,EAAKpH,UAET,CAAA,GAAY,IAARG,EAAW,CAEpB/V,KAAKugB,WAAWrd,KAAK8Z,GACrB,MAGAhd,KAAKugB,WAAWrd,KAAK8Z,GAEnBA,EADEhd,KAAKygB,WACAzD,EAAKpH,MAELoH,EAAKrH,MAyDtB,QAwCEiL,kBAAA,SACEpX,EACAjI,EACAsf,EACAlL,EACAC,GAEA,OAAO,IAAIgL,GACF,MAAPpX,EAAcA,EAAMxJ,KAAKwJ,IAChB,MAATjI,EAAgBA,EAAQvB,KAAKuB,MACpB,MAATsf,EAAgBA,EAAQ7gB,KAAK6gB,MACrB,MAARlL,EAAeA,EAAO3V,KAAK2V,KAClB,MAATC,EAAgBA,EAAQ5V,KAAK4V,QAOjCgL,mBAAA,WACE,OAAO5gB,KAAK2V,KAAKmL,QAAU,EAAI9gB,KAAK4V,MAAMkL,SAM5CF,qBAAA,WACE,OAAO,GAYTA,8BAAA,SAAiB3B,GACf,OACEjf,KAAK2V,KAAKoL,iBAAiB9B,MACzBA,EAAOjf,KAAKwJ,IAAKxJ,KAAKuB,QACxBvB,KAAK4V,MAAMmL,iBAAiB9B,IAYhC2B,8BAAA,SAAiB3B,GACf,OACEjf,KAAK4V,MAAMoL,iBAAiB/B,IAC5BA,EAAOjf,KAAKwJ,IAAKxJ,KAAKuB,QACtBvB,KAAK2V,KAAKqL,iBAAiB/B,IAQvB2B,kBAAR,WACE,OAAI5gB,KAAK2V,KAAK5K,UACL/K,KAECA,KAAK2V,KAAwBsL,QAOzCL,oBAAA,WACE,OAAO5gB,KAAKihB,OAAOzX,KAMrBoX,oBAAA,WACE,OAAI5gB,KAAK4V,MAAM7K,UACN/K,KAAKwJ,IAELxJ,KAAK4V,MAAMsL,UAWtBN,oBAAA,SAAOpX,EAAQjI,EAAUof,GACvB,IAAIlgB,EAAoBT,KAClB+V,EAAM4K,EAAWnX,EAAK/I,EAAE+I,KAc9B,OAZE/I,EADEsV,EAAM,EACJtV,EAAE0gB,KAAK,KAAM,KAAM,KAAM1gB,EAAEkV,KAAKyL,OAAO5X,EAAKjI,EAAOof,GAAa,MACnD,IAAR5K,EACLtV,EAAE0gB,KAAK,KAAM5f,EAAO,KAAM,KAAM,MAEhCd,EAAE0gB,KACJ,KACA,KACA,KACA,KACA1gB,EAAEmV,MAAMwL,OAAO5X,EAAKjI,EAAOof,KAGtBU,UAOHT,wBAAR,WACE,GAAI5gB,KAAK2V,KAAK5K,UACZ,OAAOuW,GAAU7C,WAEnB,IAAIhe,EAAoBT,KAKxB,OAJKS,EAAEkV,KAAK4L,UAAa9gB,EAAEkV,KAAKA,KAAK4L,WACnC9gB,EAAIA,EAAE+gB,iBAER/gB,EAAIA,EAAE0gB,KAAK,KAAM,KAAM,KAAO1gB,EAAEkV,KAAwB8L,aAAc,OAC7DJ,UAQXT,oBAAA,SACEpX,EACAmX,GAEA,IAAIlgB,EAAGihB,EAEP,GAAIf,EAAWnX,GADf/I,EAAIT,MACkBwJ,KAAO,EACtB/I,EAAEkV,KAAK5K,WAActK,EAAEkV,KAAK4L,UAAa9gB,EAAEkV,KAAKA,KAAK4L,WACxD9gB,EAAIA,EAAE+gB,gBAER/gB,EAAIA,EAAE0gB,KAAK,KAAM,KAAM,KAAM1gB,EAAEkV,KAAK3E,OAAOxH,EAAKmX,GAAa,UACxD,CAOL,GANIlgB,EAAEkV,KAAK4L,WACT9gB,EAAIA,EAAEkhB,gBAEHlhB,EAAEmV,MAAM7K,WAActK,EAAEmV,MAAM2L,UAAa9gB,EAAEmV,MAAMD,KAAK4L,WAC3D9gB,EAAIA,EAAEmhB,iBAEuB,IAA3BjB,EAAWnX,EAAK/I,EAAE+I,KAAY,CAChC,GAAI/I,EAAEmV,MAAM7K,UACV,OAAOuW,GAAU7C,WAEjBiD,EAAYjhB,EAAEmV,MAAyBqL,OACvCxgB,EAAIA,EAAE0gB,KACJO,EAASlY,IACTkY,EAASngB,MACT,KACA,KACCd,EAAEmV,MAAyB6L,cAIlChhB,EAAIA,EAAE0gB,KAAK,KAAM,KAAM,KAAM,KAAM1gB,EAAEmV,MAAM5E,OAAOxH,EAAKmX,IAEzD,OAAOlgB,EAAE4gB,UAOXT,oBAAA,WACE,OAAO5gB,KAAK6gB,OAOND,oBAAR,WACE,IAAIngB,EAAoBT,KAUxB,OATIS,EAAEmV,MAAM2L,WAAa9gB,EAAEkV,KAAK4L,WAC9B9gB,EAAIA,EAAEohB,eAEJphB,EAAEkV,KAAK4L,UAAY9gB,EAAEkV,KAAKA,KAAK4L,WACjC9gB,EAAIA,EAAEkhB,gBAEJlhB,EAAEkV,KAAK4L,UAAY9gB,EAAEmV,MAAM2L,WAC7B9gB,EAAIA,EAAEqhB,cAEDrhB,GAODmgB,0BAAR,WACE,IAAIngB,EAAIT,KAAK8hB,aAYb,OAXIrhB,EAAEmV,MAAMD,KAAK4L,WASf9gB,GADAA,GAPAA,EAAIA,EAAE0gB,KACJ,KACA,KACA,KACA,KACC1gB,EAAEmV,MAAyB+L,iBAExBE,eACAC,cAEDrhB,GAODmgB,2BAAR,WACE,IAAIngB,EAAIT,KAAK8hB,aAKb,OAJIrhB,EAAEkV,KAAKA,KAAK4L,WAEd9gB,GADAA,EAAIA,EAAEkhB,gBACAG,cAEDrhB,GAODmgB,yBAAR,WACE,IAAMmB,EAAK/hB,KAAKmhB,KAAK,KAAM,KAAMP,GAASoB,IAAK,KAAMhiB,KAAK4V,MAAMD,MAChE,OAAO3V,KAAK4V,MAAMuL,KAAK,KAAM,KAAMnhB,KAAK6gB,MAAOkB,EAAI,OAO7CnB,0BAAR,WACE,IAAMqB,EAAKjiB,KAAKmhB,KAAK,KAAM,KAAMP,GAASoB,IAAKhiB,KAAK2V,KAAKC,MAAO,MAChE,OAAO5V,KAAK2V,KAAKwL,KAAK,KAAM,KAAMnhB,KAAK6gB,MAAO,KAAMoB,IAO9CrB,wBAAR,WACE,IAAMjL,EAAO3V,KAAK2V,KAAKwL,KAAK,KAAM,MAAOnhB,KAAK2V,KAAKkL,MAAO,KAAM,MAC1DjL,EAAQ5V,KAAK4V,MAAMuL,KAAK,KAAM,MAAOnhB,KAAK4V,MAAMiL,MAAO,KAAM,MACnE,OAAO7gB,KAAKmhB,KAAK,KAAM,MAAOnhB,KAAK6gB,MAAOlL,EAAMC,IAS1CgL,4BAAR,WACE,IAAMsB,EAAaliB,KAAKmiB,SACxB,OAAOhP,KAAKE,IAAI,EAAK6O,IAAeliB,KAAK8gB,QAAU,GAOrDF,oBAAA,WACE,GAAI5gB,KAAKuhB,UAAYvhB,KAAK2V,KAAK4L,SAC7B,MAAM,IAAI1c,MACR,0BAA4B7E,KAAKwJ,IAAM,IAAMxJ,KAAKuB,MAAQ,KAG9D,GAAIvB,KAAK4V,MAAM2L,SACb,MAAM,IAAI1c,MACR,mBAAqB7E,KAAKwJ,IAAM,IAAMxJ,KAAKuB,MAAQ,YAGvD,IAAM2gB,EAAaliB,KAAK2V,KAAKwM,SAC7B,GAAID,IAAeliB,KAAK4V,MAAMuM,SAC5B,MAAM,IAAItd,MAAM,uBAEhB,OAAOqd,GAAcliB,KAAKuhB,SAAW,EAAI,IAnTtCX,QAAM,EACNA,UAAQ,MAff,YACSpX,EACAjI,EACPsf,EACAlL,EACAC,GAJO5V,SAAAwJ,EACAxJ,WAAAuB,EAKPvB,KAAK6gB,MAAiB,MAATA,EAAgBA,EAAQD,GAASoB,IAC9ChiB,KAAK2V,KACK,MAARA,EAAeA,EAAQ2L,GAAU7C,WACnCze,KAAK4V,MACM,MAATA,EAAgBA,EAAS0L,GAAU7C,WA8TzC,QAYE2D,kBAAA,SACE5Y,EACAjI,EACAsf,EACAlL,EACAC,GAEA,OAAO5V,MAWToiB,oBAAA,SAAO5Y,EAAQjI,EAAUof,GACvB,OAAO,IAAIC,GAASpX,EAAKjI,EAAO,OAUlC6gB,oBAAA,SAAO5Y,EAAQmX,GACb,OAAO3gB,MAMToiB,mBAAA,WACE,OAAO,GAMTA,qBAAA,WACE,OAAO,GAWTA,8BAAA,SAAiBnD,GACf,OAAO,GAWTmD,8BAAA,SAAiBnD,GACf,OAAO,GAMTmD,oBAAA,WACE,OAAO,MAMTA,oBAAA,WACE,OAAO,MAOTA,oBAAA,WACE,OAAO,GAOTA,oBAAA,WACE,OAAO,OA9GX,eAsHA,QA2BEd,oBAAA,SAAO9X,EAAQjI,GACb,OAAO,IAAI+f,GACTthB,KAAKqiB,YACLriB,KAAKsiB,MACFlB,OAAO5X,EAAKjI,EAAOvB,KAAKqiB,aACxBlB,KAAK,KAAM,KAAMP,GAAS2B,MAAO,KAAM,QAU9CjB,oBAAA,SAAO9X,GACL,OAAO,IAAI8X,GACTthB,KAAKqiB,YACLriB,KAAKsiB,MACFtR,OAAOxH,EAAKxJ,KAAKqiB,aACjBlB,KAAK,KAAM,KAAMP,GAAS2B,MAAO,KAAM,QAW9CjB,iBAAA,SAAI9X,GAGF,IAFA,IAAIuM,EACAiH,EAAOhd,KAAKsiB,OACRtF,EAAKjS,WAAW,CAEtB,GAAY,KADZgL,EAAM/V,KAAKqiB,YAAY7Y,EAAKwT,EAAKxT,MAE/B,OAAOwT,EAAKzb,MACHwU,EAAM,EACfiH,EAAOA,EAAKrH,KACG,EAANI,IACTiH,EAAOA,EAAKpH,OAGhB,OAAO,MAQT0L,+BAAA,SAAkB9X,GAIhB,IAHA,IAAIuM,EACFiH,EAAOhd,KAAKsiB,MACZE,EAAc,MACRxF,EAAKjS,WAAW,CAEtB,GAAY,KADZgL,EAAM/V,KAAKqiB,YAAY7Y,EAAKwT,EAAKxT,MAClB,CACb,GAAKwT,EAAKrH,KAAK5K,UAMR,OAAIyX,EACFA,EAAYhZ,IAEZ,KAPP,IADAwT,EAAOA,EAAKrH,MACJqH,EAAKpH,MAAM7K,WACjBiS,EAAOA,EAAKpH,MAEd,OAAOoH,EAAKxT,IAMLuM,EAAM,EACfiH,EAAOA,EAAKrH,KACG,EAANI,IAETiH,GADAwF,EAAcxF,GACFpH,OAIhB,MAAM,IAAI/Q,MACR,0EAOJyc,qBAAA,WACE,OAAOthB,KAAKsiB,MAAMvX,WAMpBuW,mBAAA,WACE,OAAOthB,KAAKsiB,MAAMxB,SAMpBQ,oBAAA,WACE,OAAOthB,KAAKsiB,MAAMG,UAMpBnB,oBAAA,WACE,OAAOthB,KAAKsiB,MAAMpB,UAYpBI,8BAAA,SAAiBrC,GACf,OAAOjf,KAAKsiB,MAAMvB,iBAAiB9B,IAWrCqC,8BAAA,SAAiBrC,GACf,OAAOjf,KAAKsiB,MAAMtB,iBAAiB/B,IASrCqC,yBAAA,SACEoB,GAEA,OAAO,IAAIpC,GACTtgB,KAAKsiB,MACL,KACAtiB,KAAKqiB,aACL,EACAK,IAIJpB,6BAAA,SACE9X,EACAkZ,GAEA,OAAO,IAAIpC,GACTtgB,KAAKsiB,MACL9Y,EACAxJ,KAAKqiB,aACL,EACAK,IAIJpB,oCAAA,SACE9X,EACAkZ,GAEA,OAAO,IAAIpC,GACTtgB,KAAKsiB,MACL9Y,EACAxJ,KAAKqiB,aACL,EACAK,IAIJpB,gCAAA,SACEoB,GAEA,OAAO,IAAIpC,GACTtgB,KAAKsiB,MACL,KACAtiB,KAAKqiB,aACL,EACAK,IAlNGpB,cAAa,IAAIc,OAOxB,YACUC,EACAC,gBAAAA,EAEkBhB,GAAU7C,YAH5Bze,iBAAAqiB,EACAriB,WAAAsiB,ECvlBZ,IAAMK,GAAQxP,KAAKvC,IAAI,OA2BrBgS,0BAAA,WAEE,IAAMhhB,IAAW5B,KAAK6iB,MAAS,GAAO7iB,KAAK8iB,UAE3C,OADA9iB,KAAK8iB,WACElhB,OAlBT,YAAYjB,GACV,IAAkBoiB,EAIlB/iB,KAAK8gB,OAJaiC,EAIIpiB,EAAS,EAF7BmT,SAAUX,KAAKvC,IAAImS,GAAOJ,GAAe,KAG3C3iB,KAAK8iB,SAAW9iB,KAAK8gB,MAAQ,EAC7B,IAHiBpN,EAGXsP,GAHWtP,EAGI1T,KAAK8gB,MAHQhN,SAASnU,MAAM+T,EAAO,GAAGnN,KAAK,KAAM,IAItEvG,KAAK6iB,MAASliB,EAAS,EAAKqiB,EA6BzB,IC7CHC,GCkBAxE,GF2BSyE,GAAgB,SAC3BC,EACApN,EACAqN,EACAC,GAEAF,EAAUrQ,KAAKiD,GAEf,IAAMuN,EAAoB,SACxBC,EACAlT,GAEA,IACImT,EACAha,EAFE7I,EAAS0P,EAAOkT,EAGtB,GAAe,GAAX5iB,EACF,OAAO,KACF,GAAe,GAAXA,EAGT,OAFA6iB,EAAYL,EAAUI,GACtB/Z,EAAM4Z,EAAQA,EAAMI,GAAeA,EAC5B,IAAI5C,GACTpX,EACCga,EAAUxG,KACX4D,GAAS2B,MACT,KACA,MAIF,IAAMkB,EAAS3P,SAAUnT,EAAS,EAAW,IAAM4iB,EAC7C5N,EAAO2N,EAAkBC,EAAKE,GAC9B7N,EAAQ0N,EAAkBG,EAAS,EAAGpT,GAG5C,OAFAmT,EAAYL,EAAUM,GACtBja,EAAM4Z,EAAQA,EAAMI,GAAeA,EAC5B,IAAI5C,GACTpX,EACCga,EAAUxG,KACX4D,GAAS2B,MACT5M,EACAC,IAsDA8N,EAjDmB,SAASC,GAiChC,IAhCA,IAAI3G,EAAuB,KACvB0G,EAAO,KACP1E,EAAQmE,EAAUxiB,OAEhBijB,EAAe,SAASC,EAAmBhD,GAC/C,IAAM0C,EAAMvE,EAAQ6E,EACdxT,EAAO2O,EACbA,GAAS6E,EACT,IAAMC,EAAYR,EAAwB,EAANC,EAASlT,GACvCmT,EAAYL,EAAUI,GACtB/Z,EAAS4Z,EAAQA,EAAMI,GAAeA,EAC5CO,EACE,IAAInD,GACFpX,EACCga,EAAUxG,KACX6D,EACA,KACAiD,KAKAC,EAAgB,SAASC,GAG3BhH,EAFEA,EACFA,EAAKrH,KAAOqO,EAGZN,EAAOM,GAKFxjB,EAAI,EAAGA,EAAImjB,EAAO7C,QAAStgB,EAAG,CACrC,IAAMyjB,EAAQN,EAAOO,eAEfL,EAAY1Q,KAAKE,IAAI,EAAGsQ,EAAO7C,OAAStgB,EAAI,IAC9CyjB,EACFL,EAAaC,EAAWjD,GAAS2B,QAGjCqB,EAAaC,EAAWjD,GAAS2B,OACjCqB,EAAaC,EAAWjD,GAASoB,MAGrC,OAAO0B,EAIIS,CADE,IAAIvB,GAAUO,EAAUxiB,SAGvC,OAAO,IAAI2gB,GAAgB+B,GAActN,EAAa2N,IC1IlDU,GAAiB,OAMrB5kB,sBAAW6kB,kBAAX,WAWE,OAVA5f,EACoBub,GAClB,uCAEFiD,GACEA,IACA,IAAIoB,GACF,CAAEhF,YAAa+E,IACf,CAAE/E,YAAaW,sCAYrBqE,iBAAA,SAAIC,GACF,IAAMC,EAAYzZ,EAAQ9K,KAAKwkB,SAAUF,GACzC,IAAKC,EACH,MAAM,IAAI1f,MAAM,wBAA0Byf,GAG5C,OAAIC,aAAqBjD,GAChBiD,EAIA,MAIXF,sBAAA,SAASI,GACP,OAAO7Z,EAAS5K,KAAK0kB,UAAWD,EAAgBhb,aAGlD4a,sBAAA,SACEI,EACAE,GAEAlgB,EACEggB,IAAoB7G,GACpB,uEAMF,IAJA,IAUIgH,EAVEzB,EAAY,GACd0B,GAAkB,EAChBC,EAAOH,EAAiBI,YAAYhI,GAAUiI,MAChDvjB,EAAOqjB,EAAKG,UACTxjB,GACLojB,EACEA,GAAmBJ,EAAgBS,YAAYzjB,EAAKub,MACtDmG,EAAUjgB,KAAKzB,GACfA,EAAOqjB,EAAKG,UAIZL,EADEC,EACS3B,GAAcC,EAAWsB,EAAgBU,cAEzCf,GAEb,IAAMgB,EAAYX,EAAgBhb,WAC5B4b,OAAmBrlB,KAAK0kB,WAC9BW,EAAYD,GAAaX,EACzB,IAAMa,OAAkBtlB,KAAKwkB,UAE7B,OADAc,EAAWF,GAAaR,EACjB,IAAIP,GAASiB,EAAYD,IAMlChB,0BAAA,SACEb,EACAmB,GAFF,WAwCE,OAAO,IAAIN,GApCQrZ,EACjBhL,KAAKwkB,SACL,SAACe,EAA6CH,GAC5C,IAAMpG,EAAQlU,EAAQ5C,EAAKwc,UAAWU,GAEtC,GADA3gB,EAAOua,EAAO,oCAAsCoG,GAChDG,IAAoBnB,GAAgB,CAEtC,GAAIpF,EAAMkG,YAAY1B,EAAUxG,MAAO,CAKrC,IAHA,IAAMmG,EAAY,GACZ2B,EAAOH,EAAiBI,YAAYhI,GAAUiI,MAChDvjB,EAAOqjB,EAAKG,UACTxjB,GACDA,EAAK8M,OAASiV,EAAUjV,MAC1B4U,EAAUjgB,KAAKzB,GAEjBA,EAAOqjB,EAAKG,UAGd,OADA9B,EAAUjgB,KAAKsgB,GACRN,GAAcC,EAAWnE,EAAMmG,cAGtC,OAAOf,GAGT,IAAMoB,EAAeb,EAAiBxT,IAAIqS,EAAUjV,MAChDkX,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAYzU,OACxB,IAAI+L,GAAUyG,EAAUjV,KAAMiX,KAG3BC,EAAYrE,OAAOoC,EAAWA,EAAUxG,QAIrBhd,KAAK0kB,YAMvCL,+BAAA,SACEb,EACAmB,GAqBA,OAAO,IAAIN,GAnBQrZ,EACjBhL,KAAKwkB,SACL,SAACe,GACC,GAAIA,IAAoBnB,GAEtB,OAAOmB,EAEP,IAAMC,EAAeb,EAAiBxT,IAAIqS,EAAUjV,MACpD,OAAIiX,EACKD,EAAgBvU,OACrB,IAAI+L,GAAUyG,EAAUjV,KAAMiX,IAIzBD,IAKiBvlB,KAAK0kB,gBAlIvC,YACUF,EAGAE,GAHA1kB,cAAAwkB,EAGAxkB,eAAA0kB,WEhCIgB,GAAqB/P,EAAiBC,GACpD,OAAOnD,GAAYkD,EAAKpH,KAAMqH,EAAMrH,eAGtBoX,GAAgBhQ,EAAcC,GAC5C,OAAOnD,GAAYkD,EAAMC,GD6B3B,WAGEpW,sBAAWomB,qBAAX,WACE,OAEGnH,GADDA,IACc,IAAImH,GAChB,IAAItE,GAAwBqE,IAC5B,KACAtB,GAASwB,0CAmCfD,wBAAA,WACE,OAAO,GAITA,yBAAA,WACE,OAAO5lB,KAAKqe,eAAiBI,IAI/BmH,4BAAA,SAAetH,GACb,OAAIte,KAAK8lB,UAAU/a,UAEV/K,KAEA,IAAI4lB,GAAa5lB,KAAK8lB,UAAWxH,EAAiBte,KAAK+lB,YAKlEH,+BAAA,SAAkBpH,GAEhB,GAAkB,cAAdA,EACF,OAAOxe,KAAKie,cAEZ,IAAM5H,EAAQrW,KAAK8lB,UAAU3U,IAAIqN,GACjC,OAAiB,OAAVnI,EAAiBoI,GAAapI,GAKzCuP,sBAAA,SAAS9O,GACP,IAAMgI,EAAQhI,EAAKvB,WACnB,OAAc,OAAVuJ,EACK9e,KAGFA,KAAKgmB,kBAAkBlH,GAAOmH,SAASnP,EAAKpB,aAIrDkQ,sBAAA,SAASpH,GACP,OAAyC,OAAlCxe,KAAK8lB,UAAU3U,IAAIqN,IAI5BoH,kCAAA,SAAqBpH,EAAmBG,GAEtC,GADAla,EAAOka,EAAc,8CACH,cAAdH,EACF,OAAOxe,KAAK4e,eAAeD,GAE3B,IAAM6E,EAAY,IAAIzG,GAAUyB,EAAWG,GACvC8G,SAAaS,SAGfA,EAFEvH,EAAa5T,WACf0a,EAAczlB,KAAK8lB,UAAU9U,OAAOwN,GACtBxe,KAAK+lB,UAAUI,kBAC3B3C,EACAxjB,KAAK8lB,aAGPL,EAAczlB,KAAK8lB,UAAU1E,OAAO5C,EAAWG,GACjC3e,KAAK+lB,UAAUK,aAAa5C,EAAWxjB,KAAK8lB,YAG5D,IAAMO,EAAcZ,EAAY1a,UAC5B0T,GACAze,KAAKqe,cACT,OAAO,IAAIuH,GAAaH,EAAaY,EAAaH,IAKtDN,yBAAA,SAAY9O,EAAY6H,GACtB,IAAMG,EAAQhI,EAAKvB,WACnB,GAAc,OAAVuJ,EACF,OAAOH,EAEPla,EACsB,cAApBqS,EAAKvB,YAAmD,IAArBuB,EAAKb,YACxC,8CAEF,IAAMqQ,EAAoBtmB,KAAKgmB,kBAAkBlH,GAAOC,YACtDjI,EAAKpB,WACLiJ,GAEF,OAAO3e,KAAK6e,qBAAqBC,EAAOwH,IAK5CV,qBAAA,WACE,OAAO5lB,KAAK8lB,UAAU/a,WAIxB6a,yBAAA,WACE,OAAO5lB,KAAK8lB,UAAUhF,SAUxB8E,iBAAA,SAAI1G,GACF,GAAIlf,KAAK+K,UACP,OAAO,KAGT,IAAMF,EAAgC,GAClC0b,EAAU,EACZrF,EAAS,EACTsF,GAAiB,EAYnB,GAXAxmB,KAAKymB,aAAazG,GAAgB,SAACxW,EAAakV,GAC9C7T,EAAIrB,GAAOkV,EAAU/P,IAAIuQ,GAEzBqH,IACIC,GAAkBZ,GAAarR,gBAAgBhM,KAAKiB,GACtD0X,EAAS/N,KAAK4D,IAAImK,EAAQzP,OAAOjI,IAEjCgd,GAAiB,KAIhBtH,GAAgBsH,GAAkBtF,EAAS,EAAIqF,EAAS,CAE3D,IAAMG,EAAmB,GAEzB,IAAK,IAAMld,KAAOqB,EAChB6b,EAAOld,GAA6BqB,EAAIrB,GAG1C,OAAOkd,EAKP,OAHIxH,IAAiBlf,KAAKie,cAAclT,YACtCF,EAAI,aAAe7K,KAAKie,cAActP,OAEjC9D,GAKX+a,kBAAA,WACE,GAAuB,OAAnB5lB,KAAKsf,UAAoB,CAC3B,IAAIqH,EAAS,GACR3mB,KAAKie,cAAclT,YACtB4b,GACE,YACA9I,GAAiB7d,KAAKie,cAActP,OACpC,KAGJ3O,KAAKymB,aAAazG,GAAgB,SAACxW,EAAKkV,GACtC,IAAMkI,EAAYlI,EAAUmI,OACV,KAAdD,IACFD,GAAU,IAAMnd,EAAM,IAAMod,KAIhC5mB,KAAKsf,UAAuB,KAAXqH,EAAgB,GAAKxW,GAAKwW,GAE7C,OAAO3mB,KAAKsf,WAIdsG,qCAAA,SACEpH,EACAE,EACAM,GAEA,IAAM8H,EAAM9mB,KAAK+mB,cAAc/H,GAC/B,GAAI8H,EAAK,CACP,IAAME,EAAcF,EAAIG,kBACtB,IAAIlK,GAAUyB,EAAWE,IAE3B,OAAOsI,EAAcA,EAAYzY,KAAO,KAExC,OAAOvO,KAAK8lB,UAAUmB,kBAAkBzI,IAQ5CoH,+BAAA,SAAkBnB,GAChB,IAAMqC,EAAM9mB,KAAK+mB,cAActC,GAC/B,GAAIqC,EAAK,CACP,IAAMrE,EAASqE,EAAIrE,SACnB,OAAOA,GAAUA,EAAOlU,KAExB,OAAOvO,KAAK8lB,UAAUrD,UAQ1BmD,2BAAA,SAAcnB,GACZ,IAAMhC,EAASziB,KAAKknB,kBAAkBzC,GACtC,OAAIhC,EACK,IAAI1F,GAAU0F,EAAQziB,KAAK8lB,UAAU3U,IAAIsR,IAEzC,MASXmD,8BAAA,SAAiBnB,GACf,IAAMqC,EAAM9mB,KAAK+mB,cAActC,GAC/B,GAAIqC,EAAK,CACP,IAAM5F,EAAS4F,EAAI5F,SACnB,OAAOA,GAAUA,EAAO3S,KAExB,OAAOvO,KAAK8lB,UAAU5E,UAQ1B0E,0BAAA,SAAanB,GACX,IAAMvD,EAASlhB,KAAKmnB,iBAAiB1C,GACrC,OAAIvD,EACK,IAAInE,GAAUmE,EAAQlhB,KAAK8lB,UAAU3U,IAAI+P,IAEzC,MAOX0E,0BAAA,SACE5G,EACAC,GAEA,IAAM6H,EAAM9mB,KAAK+mB,cAAc/H,GAC/B,OAAI8H,EACKA,EAAI/F,iBAAiB,SAAAqG,GAC1B,OAAOnI,EAAOmI,EAAY7Y,KAAM6Y,EAAYpK,QAGvChd,KAAK8lB,UAAU/E,iBAAiB9B,IAQ3C2G,yBAAA,SACEnB,GAEA,OAAOzkB,KAAKqnB,gBAAgB5C,EAAgB6C,UAAW7C,IASzDmB,6BAAA,SACE2B,EACA9C,GAEA,IAAMqC,EAAM9mB,KAAK+mB,cAActC,GAC/B,GAAIqC,EACF,OAAOA,EAAIO,gBAAgBE,EAAW,SAAA/d,GAAO,OAAAA,IAO7C,IALA,IAAM3G,EAAW7C,KAAK8lB,UAAUuB,gBAC9BE,EAAUhZ,KACVwO,GAAUiI,MAERvjB,EAAOoB,EAAS2kB,OACL,MAAR/lB,GAAgBgjB,EAAgBtH,QAAQ1b,EAAM8lB,GAAa,GAChE1kB,EAASoiB,UACTxjB,EAAOoB,EAAS2kB,OAElB,OAAO3kB,GAQX+iB,gCAAA,SACEnB,GAEA,OAAOzkB,KAAKynB,uBACVhD,EAAgBiD,UAChBjD,IASJmB,oCAAA,SACE+B,EACAlD,GAEA,IAAMqC,EAAM9mB,KAAK+mB,cAActC,GAC/B,GAAIqC,EACF,OAAOA,EAAIW,uBAAuBE,EAAS,SAAAne,GACzC,OAAOA,IAQT,IALA,IAAM3G,EAAW7C,KAAK8lB,UAAU2B,uBAC9BE,EAAQpZ,KACRwO,GAAUiI,MAERvjB,EAAOoB,EAAS2kB,OACL,MAAR/lB,GAAyD,EAAzCgjB,EAAgBtH,QAAQ1b,EAAMkmB,IACnD9kB,EAASoiB,UACTxjB,EAAOoB,EAAS2kB,OAElB,OAAO3kB,GAOX+iB,uBAAA,SAAU5P,GACR,OAAIhW,KAAK+K,UACHiL,EAAMjL,UACD,GAEC,EAEDiL,EAAMgI,cAAgBhI,EAAMjL,UAC9B,EACEiL,IAAU2H,IACX,EAGD,GAOXiI,uBAAA,SAAUnB,GACR,GACEA,IAAoB7G,IACpB5d,KAAK+lB,UAAU6B,SAASnD,GAExB,OAAOzkB,KAEP,IAAMkmB,EAAclmB,KAAK+lB,UAAU8B,SACjCpD,EACAzkB,KAAK8lB,WAEP,OAAO,IAAIF,GAAa5lB,KAAK8lB,UAAW9lB,KAAKqe,cAAe6H,IAOhEN,uBAAA,SAAU5G,GACR,OAAOA,IAAUpB,IAAa5d,KAAK+lB,UAAU6B,SAAS5I,IAMxD4G,oBAAA,SAAO5P,GACL,GAAIA,IAAUhW,KACZ,OAAO,EACF,GAAIgW,EAAMgI,aACf,OAAO,EAEP,IAAM8J,EAAoB9R,EAC1B,GAAKhW,KAAKie,cAAc8B,OAAO+H,EAAkB7J,eAE1C,CAAA,GACLje,KAAK8lB,UAAUhF,UAAYgH,EAAkBhC,UAAUhF,QAkBvD,OAAO,EAZP,IAJA,IAAMiH,EAAW/nB,KAAK+kB,YAAY/E,IAC5BgI,EAAYF,EAAkB/C,YAAY/E,IAC5CiI,EAAcF,EAAS9C,UACvBiD,EAAeF,EAAU/C,UACtBgD,GAAeC,GAAc,CAClC,GACED,EAAY1Z,OAAS2Z,EAAa3Z,OACjC0Z,EAAYjL,KAAK+C,OAAOmI,EAAalL,MAEtC,OAAO,EAETiL,EAAcF,EAAS9C,UACvBiD,EAAeF,EAAU/C,UAE3B,OAAuB,OAAhBgD,GAAyC,OAAjBC,EAlB/B,OAAO,GAiCLtC,2BAAR,SACEnB,GAEA,OAAIA,IAAoB7G,GACf,KAEA5d,KAAK+lB,UAAU5U,IAAIsT,EAAgBhb,aArU/Bmc,mBAAkB,qBA9HjC,YACmBE,EACAzH,EACT0H,GAFS/lB,eAAA8lB,EACA9lB,mBAAAqe,EACTre,eAAA+lB,EAvBF/lB,eAA2B,KA8B7BA,KAAKqe,eACPP,GAAqB9d,KAAKqe,eAGxBre,KAAK8lB,UAAU/a,WACjBtG,GACGzE,KAAKqe,eAAiBre,KAAKqe,cAActT,UAC1C,wCA6bN,qBACEpC,aACE,IAAI2Y,GAAwBqE,IAC5BC,GAAanH,WACb4F,GAASwB,eAmCR,IAAMlI,GAAW,IAxCK7d,QAAA8lB,IAS3BuC,uBAAA,SAAUnS,GACR,OAAIA,IAAUhW,KACL,EAEA,GAIXmoB,oBAAA,SAAOnS,GAEL,OAAOA,IAAUhW,MAGnBmoB,yBAAA,WACE,OAAOnoB,MAGTmoB,+BAAA,SAAkB3J,GAChB,OAAOoH,GAAanH,YAGtB0J,qBAAA,WACE,OAAO,OAqBX3oB,OAAO4oB,iBAAiBrL,GAAW,CACjCS,IAAK,CACHjc,MAAO,IAAIwb,GAAUxK,GAAUqT,GAAanH,aAE9C4J,IAAK,CACH9mB,MAAO,IAAIwb,GAAUvK,GAAUmL,OAOnCF,GAASR,aAAe2I,GAAanH,WACrCL,GAASF,0BAA4B0H,GN/jBnCjI,GMgkBSA,GJ5jBTA,GI6jBiBA,GE7jBnB,OAAM2K,IAAY,WASFnK,GACdoK,EACApP,GAEA,gBAFAA,QAEa,OAAToP,EACF,OAAO3C,GAAanH,WAoBtB,GAjBoB,iBAAT8J,GAAqB,cAAeA,IAC7CpP,EAAWoP,EAAK,cAGlB9jB,EACe,OAAb0U,GACsB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,iBAAToP,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,iBAATA,GAAqB,QAASA,EAEvC,OAAO,IAAInK,GADMmK,EACapK,GAAahF,IAG7C,GAAMoP,aAAgB5oB,QAAU2oB,GA8CzB,CACL,IAAIE,EAAa5C,GAAanH,WAa9B,OAZA1L,GAAKwV,EAAM,SAAC/e,EAAaif,GACvB,GAAI7d,EAAS2d,EAAgB/e,IACC,MAAxBA,EAAI0I,UAAU,EAAG,GAAY,CAE/B,IAAMwM,EAAYP,GAAasK,IAC3B/J,EAAUV,cAAiBU,EAAU3T,YACvCyd,EAAOA,EAAK3J,qBAAqBrV,EAAKkV,OAMvC8J,EAAK5J,eAAeT,GAAahF,IA3DxC,IAAMuP,EAAwB,GAC1BC,GAAuB,EAc3B,GAZA5V,GADqBwV,EACF,SAAC/e,EAAK6M,GACvB,GAA4B,MAAxB7M,EAAI0I,UAAU,EAAG,GAAY,CAE/B,IAAMwM,EAAYP,GAAa9H,GAC1BqI,EAAU3T,YACb4d,EACEA,IAAyBjK,EAAUT,cAAclT,UACnD2d,EAASxlB,KAAK,IAAI6Z,GAAUvT,EAAKkV,QAKf,IAApBgK,EAAS/nB,OACX,OAAOilB,GAAanH,WAGtB,IAAMmK,EAAW1F,GACfwF,EACAhD,GACA,SAAAlC,GAAa,OAAAA,EAAUjV,MACvBoX,IAEF,GAAIgD,EAAsB,CACxB,IAAME,EAAiB3F,GACrBwF,EACA1I,GAAemF,cAEjB,OAAO,IAAIS,GACTgD,EACAzK,GAAahF,GACb,IAAIkL,GACF,CAAEhF,YAAawJ,GACf,CAAExJ,YAAaW,MAInB,OAAO,IAAI4F,GACTgD,EACAzK,GAAahF,GACbkL,GAASwB,SCrFjB,+DPDE1H,GM2GcA,GC7CT,OAAM2K,GAAc,IA7DKhpB,QAAAod,IAI9B6L,qBAAA,SAAQld,EAActM,GACpB,IAAM6gB,EAAWvU,EAAEmR,KAAKqD,UAAU9gB,EAAEyd,MACpC,OAAiB,IAAboD,EACK3N,GAAY5G,EAAE0C,KAAMhP,EAAEgP,MAEtB6R,GAOX2I,yBAAA,SAAY/L,GACV,OAAO,GAMT+L,iCAAA,SAAoB3L,EAAeC,GACjC,OAAQD,EAAQ2C,OAAO1C,IAMzB0L,qBAAA,WAEE,OAAQhM,GAAkBS,KAM5BuL,qBAAA,WAEE,OAAQhM,GAAkBsL,KAQ5BU,sBAAA,SAASrL,EAAoBnP,GAC3B,IAAMya,EAAY7K,GAAaT,GAC/B,OAAO,IAAIX,GAAUxO,EAAMya,IAM7BD,sBAAA,WACE,MAAO,kBCtDoBjpB,QAAAod,IAenB+L,0BAAV,SAAuBC,GACrB,OAAOA,EAAKjD,SAASjmB,KAAKmpB,aAM5BF,yBAAA,SAAYjM,GACV,OAAQA,EAAKiJ,SAASjmB,KAAKmpB,YAAYpe,WAMzCke,qBAAA,SAAQpd,EAActM,GACpB,IAAM6pB,EAASppB,KAAKqpB,aAAaxd,EAAEmR,MAC7BsM,EAAStpB,KAAKqpB,aAAa9pB,EAAEyd,MAC7BoD,EAAWgJ,EAAO/I,UAAUiJ,GAClC,OAAiB,IAAblJ,EACK3N,GAAY5G,EAAE0C,KAAMhP,EAAEgP,MAEtB6R,GAOX6I,sBAAA,SAASvL,EAAoBnP,GAC3B,IAAMya,EAAY7K,GAAaT,GACzBV,EAAO4I,GAAanH,WAAWM,YACnC/e,KAAKmpB,WACLH,GAEF,OAAO,IAAIjM,GAAUxO,EAAMyO,IAM7BiM,qBAAA,WACE,IAAMjM,EAAO4I,GAAanH,WAAWM,YAAY/e,KAAKmpB,WAAYxL,IAClE,OAAO,IAAIZ,GAAUvK,GAAUwK,IAMjCiM,sBAAA,WACE,OAAOjpB,KAAKmpB,WAAWpf,QAAQxD,KAAK,UA/DtC,YAAoB4iB,GAApB,MACExgB,2BADkBT,aAAAihB,EAGlB1kB,GACG0kB,EAAWpe,WAAuC,cAA1Boe,EAAW5T,WACpC,qECYJgU,iBAAA,WAEE,OADA9c,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QAC9CX,KAAKwpB,MAAM7a,OAQpB4a,uBAAA,WAEE,OADA9c,EAAiB,yBAA0B,EAAG,EAAG/L,UAAUC,QACpDX,KAAKwpB,MAAM7a,KAAI,IAKxB4a,oBAAA,WAGE,OADA9c,EAAiB,sBAAuB,EAAG,EAAG/L,UAAUC,QACjDX,KAAKypB,aAQdF,oBAAA,WAEE,OADA9c,EAAiB,sBAAuB,EAAG,EAAG/L,UAAUC,SAChDX,KAAKwpB,MAAMze,WASrBwe,mBAAA,SAAMG,GACJjd,EAAiB,qBAAsB,EAAG,EAAG/L,UAAUC,QAEvD+oB,EAAkB7iB,OAAO6iB,GACzBxP,GAAmB,qBAAsB,EAAGwP,GAAiB,GAE7D,IAAMC,EAAY,IAAIjV,GAAKgV,GACrBE,EAAW5pB,KAAK6pB,KAAKxT,MAAMsT,GACjC,OAAO,IAAIJ,GACTvpB,KAAKwpB,MAAMvD,SAAS0D,GACpBC,EACA5J,KAUJuJ,sBAAA,SAASG,GACPjd,EAAiB,wBAAyB,EAAG,EAAG/L,UAAUC,QAC1DuZ,GAAmB,wBAAyB,EAAGwP,GAAiB,GAEhE,IAAMC,EAAY,IAAIjV,GAAKgV,GAC3B,OAAQ1pB,KAAKwpB,MAAMvD,SAAS0D,GAAW5e,WAQzCwe,yBAAA,WAIE,OAHA9c,EAAiB,2BAA4B,EAAG,EAAG/L,UAAUC,QAGtDX,KAAKwpB,MAAMvL,cAActP,OAWlC4a,qBAAA,SAAQtK,GAAR,WAIE,OAHAxS,EAAiB,uBAAwB,EAAG,EAAG/L,UAAUC,QACzDwM,EAAiB,uBAAwB,EAAG8R,GAAQ,IAEhDjf,KAAKwpB,MAAMxL,gBAIMhe,KAAKwpB,MAEJ/C,aAAazmB,KAAK8pB,OAAQ,SAACtgB,EAAKwT,GACpD,OAAOiC,EACL,IAAIsK,GAAavM,EAAM9U,EAAK2hB,KAAKxT,MAAM7M,GAAMwW,QASnDuJ,yBAAA,WAGE,OAFA9c,EAAiB,2BAA4B,EAAG,EAAG/L,UAAUC,SAEzDX,KAAKwpB,MAAMxL,eAGLhe,KAAKwpB,MAAMze,WAIvBvL,sBAAI+pB,wBAAJ,WACE,OAAOvpB,KAAK6pB,KAAKE,0CAOnBR,yBAAA,WAGE,OAFA9c,EAAiB,2BAA4B,EAAG,EAAG/L,UAAUC,QAEtDX,KAAKwpB,MAAMQ,eAMpBT,oBAAA,WAGE,OAFA9c,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QAE9CX,KAAK6pB,MAGdrqB,sBAAI+pB,wBAAJ,WACE,OAAOvpB,KAAKiqB,8CA3Jd,YACmBT,EACAK,EACAC,GAFA9pB,WAAAwpB,EACAxpB,UAAA6pB,EACA7pB,YAAA8pB,ECoBrB,QAiBEI,qBAAA,WACE,IAAMC,EAAMnqB,KAAKsc,SAAS2N,SAC1B,MAAuB,UAAnBjqB,KAAKga,UACAmQ,EAAIrT,KAEJqT,EAAIC,YAAYtT,MAO3BoT,0BAAA,WACE,OAAOlqB,KAAKga,WAMdkQ,4BAAA,WACE,OAAOlqB,KAAKqqB,kBAAkBC,eAAetqB,OAM/CkqB,sBAAA,WACE,OACElqB,KAAKuqB,UAAU9gB,WACf,IACAzJ,KAAKga,UACL,IACA5P,EAAUpK,KAAKsc,SAASmN,kBA1C5B,YACSzP,EACAqQ,EACA/N,EACAkO,GAHAxqB,eAAAga,EACAha,uBAAAqqB,EACArqB,cAAAsc,EACAtc,cAAAwqB,EA2CX,QAeEC,qBAAA,WACE,OAAOzqB,KAAK8W,MAMd2T,0BAAA,WACE,MAAO,UAMTA,4BAAA,WACE,OAAOzqB,KAAKqqB,kBAAkBC,eAAetqB,OAM/CyqB,sBAAA,WACE,OAAOzqB,KAAK8W,KAAKrN,WAAa,eA/BhC,YACS4gB,EACA5mB,EACAqT,GAFA9W,uBAAAqqB,EACArqB,WAAAyD,EACAzD,UAAA8W,ECvCX,QAeE4T,wBAAA,SAAW1Q,GACT,MAAqB,UAAdA,GAMT0Q,yBAAA,SAAYC,EAAgBC,GAC1B,IAAM5L,EAAQ4L,EAAMC,iBAAiBC,WACrC,OAAO,IAAIZ,GACT,QACAlqB,KACA,IAAIupB,GAAaoB,EAAOI,aAAcH,EAAMX,SAAUjL,KAO1D0L,4BAAA,SAAeM,GACb,IAAMC,EAAMjrB,KAAKkrB,SACjB,GAAiC,WAA7BF,EAAUG,eAA6B,CACzC1mB,EACEzE,KAAKorB,gBACL,gEAEF,IAAMC,EAAWrrB,KAAKorB,gBACtB,OAAO,WAELC,EAASzqB,KAAKqqB,EAAMD,EAA0BvnB,QAGhD,IAAM6nB,EAAKtrB,KAAKurB,UAChB,OAAO,WACLD,EAAG1qB,KAAKqqB,EAAMD,EAAwB1O,YAQ5CoO,+BAAA,SAAkBjnB,EAAcqT,GAC9B,OAAI9W,KAAKorB,gBACA,IAAIX,GAAYzqB,KAAMyD,EAAOqT,GAE7B,MAOX4T,qBAAA,SAAQ1U,GACN,OAAMA,aAAiB0U,MAEX1U,EAAMuV,YAAcvrB,KAAKurB,WAKjCvV,EAAMuV,YAAcvrB,KAAKurB,WAAavV,EAAMkV,WAAalrB,KAAKkrB,WAQpER,4BAAA,WACE,OAA0B,OAAnB1qB,KAAKurB,eA/Ed,YACUA,EACAH,EACAF,GAFAlrB,eAAAurB,EACAvrB,qBAAAorB,EACAprB,cAAAkrB,EAyFZ,ICnIIM,ODoJFC,wBAAA,SAAWzR,GACT,IAAI0R,EACY,mBAAd1R,EAAiC,cAAgBA,EAGnD,OAFA0R,EACmB,qBAAjBA,EAAsC,gBAAkBA,EACnD9gB,EAAS5K,KAAK2rB,WAAYD,IAMnCD,+BAAA,SAAkBhoB,EAAcqT,GAC9B,OAAI9W,KAAKorB,gBACA,IAAIX,GAAYzqB,KAAMyD,EAAOqT,GAE7B,MAOX2U,yBAAA,SAAYd,EAAgBC,GAC1BnmB,EAA2B,MAApBkmB,EAAOnM,UAAmB,yCACjC,IAAM2L,EAAMS,EAAMX,SAAS5T,MAA6BsU,EAAOnM,WACzDQ,EAAQ4L,EAAMC,iBAAiBC,WACrC,OAAO,IAAIZ,GACTS,EAAOtb,KACPrP,KACA,IAAIupB,GAAaoB,EAAOI,aAAcZ,EAAKnL,GAC3C2L,EAAOH,WAOXiB,4BAAA,SAAeT,GACb,IAAMC,EAAMjrB,KAAKkrB,SACjB,GAAiC,WAA7BF,EAAUG,eAA6B,CACzC1mB,EACEzE,KAAKorB,gBACL,gEAEF,IAAMQ,EAAW5rB,KAAKorB,gBACtB,OAAO,WAELQ,EAAShrB,KAAKqqB,EAAMD,EAA0BvnB,QAGhD,IAAMooB,EAAK7rB,KAAK2rB,WAAYX,EAAwBhR,WACpD,OAAO,WACL6R,EAAGjrB,KACDqqB,EACCD,EAAwB1O,SACxB0O,EAAwBR,YASjCiB,qBAAA,SAAQzV,GAAR,WACE,GAAIA,aAAiByV,GAAwB,CAC3C,IAAKzrB,KAAK2rB,aAAe3V,EAAM2V,WAC7B,OAAO,EACF,GAAI3rB,KAAKkrB,WAAalV,EAAMkV,SAAU,CAC3C,IAAMY,EAAYtsB,OAAOqK,KAAKmM,EAAM2V,YAC9BI,EAAWvsB,OAAOqK,KAAK7J,KAAK2rB,YAC5BK,EAAaF,EAAUnrB,OAE7B,GAAIqrB,IADcD,EAASprB,OACG,CAK5B,GAAmB,IAAfqrB,EAWF,OAAOD,EAASE,MACd,SAAAjS,GACE,OAAAhE,EAAM2V,WAAW3R,KAAe9R,EAAKyjB,WAAW3R,KAZpD,IAAMkS,EAAWJ,EAAU,GACrBK,EAAUJ,EAAS,GACzB,QACEI,IAAYD,GACVlW,EAAM2V,WAAWO,IAChBlsB,KAAK2rB,WAAWQ,IACjBnW,EAAM2V,WAAWO,KAAclsB,KAAK2rB,WAAWQ,MAa3D,OAAO,GAMTV,4BAAA,WACE,OAA2B,OAApBzrB,KAAK2rB,gBApHd,YACUA,EAGAP,EACAF,GAJAlrB,gBAAA2rB,EAGA3rB,qBAAAorB,EACAprB,cAAAkrB,UCjIV1rB,sBAAW4sB,iCAIX,WAEE,OADA3nB,EAAO+mB,GAAwB,oCACxBA,QANT,SAAkC7c,GAChC6c,GAAyB7c,mCAoBZyd,2BAAf,SAAuCzU,GACrC,IAAI0U,EAAY,KACZC,EAAU,KAQd,GAPI3U,EAAO4U,aACTF,EAAY1U,EAAO6U,sBAEjB7U,EAAO8U,WACTH,EAAU3U,EAAO+U,oBAGf/U,EAAOmT,aAAelN,GAAW,CACnC,IAAM+O,EACJ,mGAEIC,EACJ,wGAEF,GAAIjV,EAAO4U,WAAY,CAErB,GADkB5U,EAAOkV,sBACPta,GAChB,MAAM,IAAI1N,MAAM8nB,GACX,GAAyB,iBAAdN,EAChB,MAAM,IAAIxnB,MAAM+nB,GAGpB,GAAIjV,EAAO8U,SAAU,CAEnB,GADgB9U,EAAOmV,oBACPta,GACd,MAAM,IAAI3N,MAAM8nB,GACX,GAAuB,iBAAZL,EAChB,MAAM,IAAIznB,MAAM+nB,SAGf,GAAIjV,EAAOmT,aAAe9K,IAC/B,GACgB,MAAbqM,IAAsBnT,GAAgBmT,IAC3B,MAAXC,IAAoBpT,GAAgBoT,GAErC,MAAM,IAAIznB,MACR,sKAUJ,GALAJ,EACEkT,EAAOmT,qBAAsB7B,IAC3BtR,EAAOmT,aAAehC,GACxB,uBAGc,MAAbuD,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAE3B,MAAM,IAAIznB,MACR,0FAYOunB,kBAAf,SAA8BzU,GAC5B,GACEA,EAAO4U,YACP5U,EAAO8U,UACP9U,EAAOoV,aACNpV,EAAOqV,mBAER,MAAM,IAAInoB,MACR,uGAUEunB,4CAAR,SAAuC1f,GACrC,IAA4B,IAAxB1M,KAAKitB,eACP,MAAM,IAAIpoB,MAAM6H,EAAS,gDAO7B0f,4BAAA,WACE,OAAOpsB,KAAKktB,cAMdd,oBAAA,WAKE,OAJA3f,EAAiB,YAAa,EAAG,EAAG/L,UAAUC,QAIvC,IAAIyrB,GAAMZ,uBAAuBxrB,KAAKmtB,KAAMntB,KAAK8W,OAU1DsV,gBAAA,SACEpS,EACA/R,EACAmlB,EACA/f,GAEAZ,EAAiB,WAAY,EAAG,EAAG/L,UAAUC,QAC7CoZ,GAAkB,WAAY,EAAGC,GAAW,GAC5C7M,EAAiB,WAAY,EAAGlF,GAAU,GAE1C,IAAMolB,EAAMjB,GAAMkB,yBAChB,WACAF,EACA/f,GAGF,GAAkB,UAAd2M,EACFha,KAAKutB,aAAatlB,EAAUolB,EAAIG,OAAQH,EAAIhgB,aACvC,CACL,IAAMogB,EAA8C,GACpDA,EAAUzT,GAAa/R,EACvBjI,KAAK0tB,aAAaD,EAAWJ,EAAIG,OAAQH,EAAIhgB,SAE/C,OAAOpF,GASCmkB,0BAAV,SACEnkB,EACA0lB,EACAtgB,GAEA,IAAMugB,EAAY,IAAIlD,GACpBziB,EACA0lB,GAAkB,KAClBtgB,GAAW,MAEbrN,KAAKmtB,KAAKU,yBAAyB7tB,KAAM4tB,IAS3CxB,0BAAA,SACEqB,EACAE,EACAtgB,GAEA,IAAMugB,EAAY,IAAInC,GACpBgC,EACAE,EACAtgB,GAEFrN,KAAKmtB,KAAKU,yBAAyB7tB,KAAM4tB,IAQ3CxB,iBAAA,SACEpS,EACA/R,EACAoF,GAEAZ,EAAiB,YAAa,EAAG,EAAG/L,UAAUC,QAC9CoZ,GAAkB,YAAa,EAAGC,GAAW,GAC7C7M,EAAiB,YAAa,EAAGlF,GAAU,GAC3CmF,EAAsB,YAAa,EAAGC,GAAS,GAE/C,IAAIugB,EAAsC,KACtCH,EAAqD,KACvC,UAAdzT,EAEF4T,EAAY,IAAIlD,GADMziB,GAAY,KAGhC,KACAoF,GAAW,MAEJ2M,IACL/R,KACFwlB,EAAY,IACFzT,GAAa/R,GAEzB2lB,EAAY,IAAInC,GAAuBgC,EAAW,KAAMpgB,GAAW,OAErErN,KAAKmtB,KAAKW,4BAA4B9tB,KAAM4tB,IAW9CxB,kBAAA,SACEpS,EACA+T,EACAC,EACA3gB,GAJF,WAMEZ,EAAiB,aAAc,EAAG,EAAG/L,UAAUC,QAC/CoZ,GAAkB,aAAc,EAAGC,GAAW,GAC9C7M,EAAiB,aAAc,EAAG4gB,GAAc,GAEhD,IAAMV,EAAMjB,GAAMkB,yBAChB,aACAU,EACA3gB,GAOE4gB,GAAY,EACVtS,EAAW,IAAI3T,EAGrB2T,EAASxT,QAAQC,MAAM,cAEvB,IAAM8lB,EAAe,SAAC5R,GAGhB2R,IACFA,GAAY,EACZ/lB,EAAKimB,IAAInU,EAAWkU,GAEhBH,GACFA,EAAald,KAAKwc,EAAIhgB,QAAtB0gB,CAA+BzR,GAEjCX,EAASva,QAAQkb,KAgBrB,OAZAtc,KAAKouB,GACHpU,EACAkU,EACY,SAAAG,GACVnmB,EAAKimB,IAAInU,EAAWkU,GAEhBb,EAAIG,QACNH,EAAIG,OAAO3c,KAAKwc,EAAIhgB,QAApBggB,CAA6BgB,GAE/B1S,EAASta,OAAOgtB,KAGb1S,EAASxT,SAQlBikB,0BAAA,SAAakC,GAEX,GADA7hB,EAAiB,qBAAsB,EAAG,EAAG/L,UAAUC,QAEpC,iBAAV2tB,GACPnb,KAAKI,MAAM+a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAIzpB,MACR,kEAGJ,GAAI7E,KAAKktB,aAAaH,WACpB,MAAM,IAAIloB,MACR,uGAKJ,OAAO,IAAIunB,GACTpsB,KAAKmtB,KACLntB,KAAK8W,KACL9W,KAAKktB,aAAaqB,aAAaD,GAC/BtuB,KAAKitB,iBASTb,yBAAA,SAAYkC,GAEV,GADA7hB,EAAiB,oBAAqB,EAAG,EAAG/L,UAAUC,QAEnC,iBAAV2tB,GACPnb,KAAKI,MAAM+a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAIzpB,MACR,iEAGJ,GAAI7E,KAAKktB,aAAaH,WACpB,MAAM,IAAIloB,MACR,sGAKJ,OAAO,IAAIunB,GACTpsB,KAAKmtB,KACLntB,KAAK8W,KACL9W,KAAKktB,aAAasB,YAAYF,GAC9BtuB,KAAKitB,iBASTb,0BAAA,SAAatV,GAEX,GADArK,EAAiB,qBAAsB,EAAG,EAAG/L,UAAUC,QAC1C,SAATmW,EACF,MAAM,IAAIjS,MACR,2EAEG,GAAa,cAATiS,EACT,MAAM,IAAIjS,MACR,qFAEG,GAAa,WAATiS,EACT,MAAM,IAAIjS,MACR,+EAGJqV,GAAmB,qBAAsB,EAAGpD,GAAM,GAClD9W,KAAKyuB,+BAA+B,sBACpC,IAAMC,EAAa,IAAIha,GAAKoC,GAC5B,GAAI4X,EAAW3jB,UACb,MAAM,IAAIlG,MACR,qFAGJ,IAAMma,EAAQ,IAAIiK,GAAUyF,GACtBC,EAAY3uB,KAAKktB,aAAa0B,QAAQ5P,GAG5C,OAFAoN,GAAMyC,wBAAwBF,GAEvB,IAAIvC,GAAMpsB,KAAKmtB,KAAMntB,KAAK8W,KAAM6X,GAA8B,IAOvEvC,wBAAA,WACE3f,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QACrDX,KAAKyuB,+BAA+B,oBACpC,IAAME,EAAY3uB,KAAKktB,aAAa0B,QAAQhR,IAE5C,OADAwO,GAAMyC,wBAAwBF,GACvB,IAAIvC,GAAMpsB,KAAKmtB,KAAMntB,KAAK8W,KAAM6X,GAA8B,IAOvEvC,6BAAA,WACE3f,EAAiB,wBAAyB,EAAG,EAAG/L,UAAUC,QAC1DX,KAAKyuB,+BAA+B,yBACpC,IAAME,EAAY3uB,KAAKktB,aAAa0B,QAAQ5O,IAE5C,OADAoM,GAAMyC,wBAAwBF,GACvB,IAAIvC,GAAMpsB,KAAKmtB,KAAMntB,KAAK8W,KAAM6X,GAA8B,IAOvEvC,0BAAA,WACE3f,EAAiB,qBAAsB,EAAG,EAAG/L,UAAUC,QACvDX,KAAKyuB,+BAA+B,sBACpC,IAAME,EAAY3uB,KAAKktB,aAAa0B,QAAQ9F,IAE5C,OADAsD,GAAMyC,wBAAwBF,GACvB,IAAIvC,GAAMpsB,KAAKmtB,KAAMntB,KAAK8W,KAAM6X,GAA8B,IAQvEvC,qBAAA,SACE7qB,EACAgN,gBADAhN,QAGAkL,EAAiB,gBAAiB,EAAG,EAAG/L,UAAUC,QAClDyY,GAAwB,gBAAiB,EAAG7X,EAAOvB,KAAK8W,MAAM,GAC9DmD,GAAY,gBAAiB,EAAG1L,GAAM,GAEtC,IAAMogB,EAAY3uB,KAAKktB,aAAa4B,QAAQvtB,EAAOgN,GAGnD,GAFA6d,GAAM2C,eAAeJ,GACrBvC,GAAMyC,wBAAwBF,GAC1B3uB,KAAKktB,aAAaX,WACpB,MAAM,IAAI1nB,MACR,0FAUJ,YAJciD,IAAVvG,IAEFgN,EADAhN,EAAQ,MAGH,IAAI6qB,GAAMpsB,KAAKmtB,KAAMntB,KAAK8W,KAAM6X,EAAW3uB,KAAKitB,iBAQzDb,mBAAA,SACE7qB,EACAgN,gBADAhN,QAGAkL,EAAiB,cAAe,EAAG,EAAG/L,UAAUC,QAChDyY,GAAwB,cAAe,EAAG7X,EAAOvB,KAAK8W,MAAM,GAC5DmD,GAAY,cAAe,EAAG1L,GAAM,GAEpC,IAAMogB,EAAY3uB,KAAKktB,aAAa8B,MAAMztB,EAAOgN,GAGjD,GAFA6d,GAAM2C,eAAeJ,GACrBvC,GAAMyC,wBAAwBF,GAC1B3uB,KAAKktB,aAAaT,SACpB,MAAM,IAAI5nB,MACR,oFAKJ,OAAO,IAAIunB,GAAMpsB,KAAKmtB,KAAMntB,KAAK8W,KAAM6X,EAAW3uB,KAAKitB,iBAUzDb,qBAAA,SAAQ7qB,EAAyCgN,GAI/C,GAHA9B,EAAiB,gBAAiB,EAAG,EAAG/L,UAAUC,QAClDyY,GAAwB,gBAAiB,EAAG7X,EAAOvB,KAAK8W,MAAM,GAC9DmD,GAAY,gBAAiB,EAAG1L,GAAM,GAClCvO,KAAKktB,aAAaX,WACpB,MAAM,IAAI1nB,MACR,0FAIJ,GAAI7E,KAAKktB,aAAaT,SACpB,MAAM,IAAI5nB,MACR,sFAIJ,OAAO7E,KAAK8uB,QAAQvtB,EAAOgN,GAAMygB,MAAMztB,EAAOgN,IAMhD6d,sBAAA,WAGE,OAFA3f,EAAiB,iBAAkB,EAAG,EAAG/L,UAAUC,QAE5CX,KAAKmtB,KAAK1jB,WAAazJ,KAAK8W,KAAKmY,sBAK1C7C,oBAAA,WAGE,OADA3f,EAAiB,eAAgB,EAAG,EAAG/L,UAAUC,QAC1CX,KAAKyJ,YAOd2iB,yBAAA,WACE,OAAOpsB,KAAKktB,aAAagC,kBAM3B9C,6BAAA,WACE,IAAMvhB,EAAM7K,KAAKmvB,cACXhd,EAAKU,GAAkBhI,GAC7B,MAAc,OAAPsH,EAAc,UAAYA,GAQnCia,qBAAA,SAAQpW,GAEN,GADAvJ,EAAiB,gBAAiB,EAAG,EAAG/L,UAAUC,UAC5CqV,aAAiBoW,IAGrB,MAAM,IAAIvnB,MADR,wFAIJ,IAAMuqB,EAAWpvB,KAAKmtB,OAASnX,EAAMmX,KAC/BkC,EAAWrvB,KAAK8W,KAAKiJ,OAAO/J,EAAMc,MAClCwY,EACJtvB,KAAKuvB,oBAAsBvZ,EAAMuZ,kBAEnC,OAAOH,GAAYC,GAAYC,GAWlBlD,4BAAf,SACE1f,EACA8iB,EACAniB,GAEA,IAAMggB,EAGF,CAAEG,OAAQ,KAAMngB,QAAS,MAC7B,GAAImiB,GAAmBniB,EACrBggB,EAAIG,OAASgC,EACbriB,EAAiBT,EAAQ,EAAG2gB,EAAIG,QAAQ,GAExCH,EAAIhgB,QAAUA,EACdD,EAAsBV,EAAQ,EAAG2gB,EAAIhgB,SAAS,QACzC,GAAImiB,EAET,GAA+B,iBAApBA,GAAoD,OAApBA,EAEzCnC,EAAIhgB,QAAUmiB,MACT,CAAA,GAA+B,mBAApBA,EAGhB,MAAM,IAAI3qB,MACRkI,EAAYL,EAAQ,GAAG,GACrB,0DAJJ2gB,EAAIG,OAASgC,EAQjB,OAAOnC,GAGT7tB,sBAAI4sB,wBAAJ,WACE,OAAOpsB,KAAKiqB,8CAxlBd,YACSkD,EACArW,EACCoW,EACAD,GAHDjtB,UAAAmtB,EACAntB,UAAA8W,EACC9W,kBAAAktB,EACAltB,oBAAAitB,ECpCZ,QAGEwC,+BAAA,SAAkBjR,GAEhB,OAAO,IAAIiR,GADGzvB,KAAKwpB,MAAMxD,kBAAkBxH,KAI7CiR,kBAAA,WACE,OAAOzvB,KAAKwpB,WARd,YAAqBA,GAAAxpB,WAAAwpB,EAYvB,QASEkG,+BAAA,SAAkBlR,GAChB,IAAMmL,EAAY3pB,KAAKsb,MAAMjF,MAAMmI,GACnC,OAAO,IAAIkR,GAAsB1vB,KAAK2vB,UAAWhG,IAGnD+F,kBAAA,WACE,OAAO1vB,KAAK2vB,UAAUC,uBAAuB5vB,KAAKsb,YAXpD,YAAYuU,EAAoB/Y,GAC9B9W,KAAK2vB,UAAYE,EACjB7vB,KAAKsb,MAAQxE,EA8GuB,SAA3BgZ,GACXhZ,EACAkG,EACA6S,EACAE,GAEA,OAAOC,GACLhT,EACA,IAAI0S,GAAsBG,EAAU/Y,GACpCiZ,GAYwC,SAA/BE,GACXjT,EACAkT,EACAH,GAEA,OAAOC,GACLhT,EACA,IAAIyS,GAAsBS,GAC1BH,GAzHG,IAiBMI,GAA2B,SACtC5uB,EACA6uB,EACAL,GAEA,OAAKxuB,GAA0B,iBAAVA,GAGrBkD,EAAO,QAASlD,EAAO,6CAEK,iBAAjBA,EAAM,OACR8uB,GAA2B9uB,EAAM,OAAQ6uB,EAAaL,GAC5B,iBAAjBxuB,EAAM,OACf+uB,GAA4B/uB,EAAM,OAAQ6uB,QAEjD3rB,GAAO,EAAO,4BAA8ByF,KAAKE,UAAU7I,EAAO,KAAM,KATjEA,GAaL8uB,GAA6B,SACjCttB,EACAmtB,EACAH,GAEA,OAAQhtB,GACN,IAAK,YACH,OAAOgtB,EAAwB,UACjC,QACEtrB,GAAO,EAAO,4BAA8B1B,KAI5CutB,GAA8B,SAClCvtB,EACAmtB,EACAK,GAEKxtB,EAAGlD,eAAe,cACrB4E,GAAO,EAAO,4BAA8ByF,KAAKE,UAAUrH,EAAI,KAAM,IAEvE,IAAMytB,EAAQztB,EAAc,UACP,iBAAVytB,GACT/rB,GAAO,EAAO,+BAAiC+rB,GAGjD,IAAMC,EAAeP,EAASlT,OAO9B,GANAvY,EACEgsB,MAAAA,EACA,+CAIGA,EAAazS,aAChB,OAAOwS,EAGT,IACMJ,EADOK,EACYrR,WACzB,MAA2B,iBAAhBgR,EACFI,EAIFJ,EAAcI,GA6CvB,SAASR,GACPhT,EACAoT,EACAL,GAEA,IAWI1S,EAXEqT,EAAS1T,EAAKiB,cAActP,MAM5BwK,EAAWgX,GACfO,EACAN,EAAYpK,kBAAkB,aAC9B+J,GAIF,GAAI/S,EAAKgB,aAAc,CACrB,IAAM2S,EAAW3T,EACXzb,EAAQ4uB,GACZQ,EAASvR,WACTgR,EACAL,GAEF,OACExuB,IAAUovB,EAASvR,YACnBjG,IAAawX,EAAS1S,cAActP,MAE7B,IAAIyP,GAAS7c,EAAO4c,GAAahF,IAEjC6D,EAGT,IAAM4T,EAAe5T,EAerB,OAbI7D,KADJkE,EAAUuT,GACoB3S,cAActP,QAC1C0O,EAAUA,EAAQuB,eAAe,IAAIR,GAASjF,KAEhDyX,EAAanK,aAAazG,GAAgB,SAACxB,EAAWE,GACpD,IAAMC,EAAeqR,GACnBtR,EACA0R,EAAYpK,kBAAkBxH,GAC9BuR,GAEEpR,IAAiBD,IACnBrB,EAAUA,EAAQwB,qBAAqBL,EAAWG,MAG/CtB,ECnOX,ICAYwT,GAAAA,ODWVC,kBAAA,SAAKha,GACH,GAAkB,MAAd9W,KAAKuB,MACP,OAAOvB,KAAKuB,MAAM0kB,SAASnP,GACtB,IAAKA,EAAK/L,WAAkC,EAArB/K,KAAK+wB,SAASC,KAAU,CACpD,IAAMC,EAAWna,EAAKvB,WAEtB,OADAuB,EAAOA,EAAKpB,WACR1V,KAAK+wB,SAASG,IAAID,GACFjxB,KAAK+wB,SAAS5f,IAAI8f,GACnBE,KAAKra,GAEf,KAGT,OAAO,MAWXga,sBAAA,SAASha,EAAY9N,GACnB,GAAI8N,EAAK/L,UACP/K,KAAKuB,MAAQyH,EACbhJ,KAAK+wB,SAASK,aACT,GAAmB,OAAfpxB,KAAKuB,MACdvB,KAAKuB,MAAQvB,KAAKuB,MAAMwd,YAAYjI,EAAM9N,OACrC,CACL,IAAMioB,EAAWna,EAAKvB,WACjBvV,KAAK+wB,SAASG,IAAID,IACrBjxB,KAAK+wB,SAAShgB,IAAIkgB,EAAU,IAAIH,IAGlC,IAAMza,EAAQrW,KAAK+wB,SAAS5f,IAAI8f,GAChCna,EAAOA,EAAKpB,WACZW,EAAMgb,SAASva,EAAM9N,KAUzB8nB,oBAAA,SAAOha,GACL,GAAIA,EAAK/L,UAGP,OAFA/K,KAAKuB,MAAQ,KACbvB,KAAK+wB,SAASK,SACP,EAEP,GAAmB,OAAfpxB,KAAKuB,MAAgB,CACvB,GAAIvB,KAAKuB,MAAMyc,aAEb,OAAO,EAEP,IAAMzc,EAAQvB,KAAKuB,MACnBvB,KAAKuB,MAAQ,KAEb,IAAM+vB,EAAOtxB,KAKb,OAJAuB,EAAMklB,aAAazG,GAAgB,SAACxW,EAAK+nB,GACvCD,EAAKD,SAAS,IAAI3c,GAAKlL,GAAM+nB,KAGxBvxB,KAAKwxB,OAAO1a,GAEhB,GAAyB,EAArB9W,KAAK+wB,SAASC,KAAU,CACjC,IAAMC,EAAWna,EAAKvB,WAStB,OARAuB,EAAOA,EAAKpB,YACR1V,KAAK+wB,SAASG,IAAID,IACCjxB,KAAK+wB,SAAS5f,IAAI8f,GAAUO,OAAO1a,IAEtD9W,KAAK+wB,SAASU,OAAOR,GAIK,IAAvBjxB,KAAK+wB,SAASC,KAErB,OAAO,GAYbF,yBAAA,SAAYY,EAAkBC,GACT,OAAf3xB,KAAKuB,MACPowB,EAAKD,EAAY1xB,KAAKuB,OAEtBvB,KAAKymB,aAAa,SAACjd,EAAK+nB,GACtB,IAAMza,EAAO,IAAIpC,GAAKgd,EAAWjoB,WAAa,IAAMD,GACpD+nB,EAAKK,YAAY9a,EAAM6a,MAU7Bb,0BAAA,SAAaa,GACX3xB,KAAK+wB,SAASc,QAAQ,SAACN,EAAM/nB,GAC3BmoB,EAAKnoB,EAAK+nB,UA1HhB,cACUvxB,WAAqB,KAEZA,cAA4C,IAAI8xB,KCHvDjB,GAAAA,GAAAA,oCAEVA,uBACAA,yCACAA,2CAoCF,QAaSkB,QAAO,IAAIA,IACF,GACd,EACA,MACY,GAOPA,UAAS,IAAIA,IAClB,GACgB,EAChB,MACY,GAOPA,wBAAuB,SAASC,GACrC,OAAO,IAAID,IACT,GACgB,EAChBC,GACY,QAvChB,YACSC,EACAC,EACAF,EACAG,GAHAnyB,cAAAiyB,EACAjyB,gBAAAkyB,EACAlyB,aAAAgyB,EACAhyB,YAAAmyB,EAEP1tB,GAAQ0tB,GAAUD,EAAY,uCCjDlC,ICDIE,ODuBFC,+BAAA,SAAkB7T,GAChB,GAAKxe,KAAK8W,KAAK/L,UAUR,CAAA,GAA+B,MAA3B/K,KAAKsyB,aAAa/wB,MAM3B,OALAkD,EACEzE,KAAKsyB,aAAavB,SAAShmB,UAC3B,4DAGK/K,KAEP,IAAM8jB,EAAY9jB,KAAKsyB,aAAaC,QAAQ,IAAI7d,GAAK8J,IACrD,OAAO,IAAI6T,GAAa3d,GAAK8d,MAAO1O,EAAW9jB,KAAKyyB,QAdpD,OAJAhuB,EACEzE,KAAK8W,KAAKvB,aAAeiJ,EACzB,iDAEK,IAAI6T,GACTryB,KAAK8W,KAAKpB,WACV1V,KAAKsyB,aACLtyB,KAAKyyB,aAlBX,YAC4B3b,EACAwb,EACAG,GAFAzyB,UAAA8W,EACA9W,kBAAAsyB,EACAtyB,YAAAyyB,EAd5BzyB,UAAO6wB,GAAc6B,eAGrB1yB,YAAS+xB,GAAgBY,KCE3B,QAqBSC,cAAP,SAAqB/nB,GACnB,IAAI0mB,EAAyBqB,GAAcJ,MAI3C,OAHAzf,GAAKlI,EAAK,SAAC8e,EAAmBkJ,GAC5BtB,EAAOA,EAAKxgB,IAAI,IAAI2D,GAAKiV,GAAYkJ,KAEhCtB,GAoBTqB,qBAAA,WACE,OAAsB,OAAf5yB,KAAKuB,OAAkBvB,KAAK+wB,SAAShmB,WAe9C6nB,8CAAA,SACEnd,EACAqd,GAEA,GAAkB,MAAd9yB,KAAKuB,OAAiBuxB,EAAU9yB,KAAKuB,OACvC,MAAO,CAAEuV,KAAMpC,GAAK8d,MAAOjxB,MAAOvB,KAAKuB,OAEvC,GAAIkU,EAAa1K,UACf,OAAO,KAEP,IAAM+T,EAAQrJ,EAAaF,WACrBc,EAAQrW,KAAK+wB,SAAS5f,IAAI2N,GAChC,GAAc,OAAVzI,EAcF,OAAO,KAbP,IAAM0c,EAA4B1c,EAAM2c,iCACtCvd,EAAaC,WACbod,GAEF,OAAiC,MAA7BC,EAMK,KAFA,CAAEjc,KAHQ,IAAIpC,GAAKoK,GAAOzI,MAC/B0c,EAA0Bjc,MAEHvV,MAAOwxB,EAA0BxxB,QAiBpEqxB,sCAAA,SACEnd,GAEA,OAAOzV,KAAKgzB,iCAAiCvd,EAAc,WAAM,OAAA,KAOnEmd,qBAAA,SAAQnd,GACN,GAAIA,EAAa1K,UACf,OAAO/K,KAEP,IAAM8e,EAAQrJ,EAAaF,WACrBuO,EAAY9jB,KAAK+wB,SAAS5f,IAAI2N,GACpC,OAAkB,OAAdgF,EACKA,EAAUyO,QAAQ9c,EAAaC,YAE/Bkd,GAAcJ,OAY3BI,iBAAA,SAAInd,EAAoBwd,GACtB,GAAIxd,EAAa1K,UACf,OAAO,IAAI6nB,GAAcK,EAAOjzB,KAAK+wB,UAErC,IAAMjS,EAAQrJ,EAAaF,WAErB2d,GADQlzB,KAAK+wB,SAAS5f,IAAI2N,IAAU8T,GAAcJ,OACjCzhB,IAAI0E,EAAaC,WAAYud,GAC9CxN,EAAczlB,KAAK+wB,SAAS3P,OAAOtC,EAAOoU,GAChD,OAAO,IAAIN,GAAc5yB,KAAKuB,MAAOkkB,IAUzCmN,oBAAA,SAAOnd,GACL,GAAIA,EAAa1K,UACf,OAAI/K,KAAK+wB,SAAShmB,UACT6nB,GAAcJ,MAEd,IAAII,GAAc,KAAM5yB,KAAK+wB,UAGtC,IAAMjS,EAAQrJ,EAAaF,WACrBc,EAAQrW,KAAK+wB,SAAS5f,IAAI2N,GAChC,GAAIzI,EAAO,CACT,IAAM6c,EAAW7c,EAAMrF,OAAOyE,EAAaC,YACvC+P,SAMJ,OAJEA,EADEyN,EAASnoB,UACG/K,KAAK+wB,SAAS/f,OAAO8N,GAErB9e,KAAK+wB,SAAS3P,OAAOtC,EAAOoU,GAEzB,OAAflzB,KAAKuB,OAAkBkkB,EAAY1a,UAC9B6nB,GAAcJ,MAEd,IAAII,GAAc5yB,KAAKuB,MAAOkkB,GAGvC,OAAOzlB,MAWb4yB,iBAAA,SAAInd,GACF,GAAIA,EAAa1K,UACf,OAAO/K,KAAKuB,MAEZ,IAAMud,EAAQrJ,EAAaF,WACrBc,EAAQrW,KAAK+wB,SAAS5f,IAAI2N,GAChC,OAAIzI,EACKA,EAAMlF,IAAIsE,EAAaC,YAEvB,MAYbkd,qBAAA,SAAQnd,EAAoB0d,GAC1B,GAAI1d,EAAa1K,UACf,OAAOooB,EAEP,IAAMrU,EAAQrJ,EAAaF,WAErB2d,GADQlzB,KAAK+wB,SAAS5f,IAAI2N,IAAU8T,GAAcJ,OACjCY,QAAQ3d,EAAaC,WAAYyd,GACpD1N,SAMJ,OAJEA,EADEyN,EAASnoB,UACG/K,KAAK+wB,SAAS/f,OAAO8N,GAErB9e,KAAK+wB,SAAS3P,OAAOtC,EAAOoU,GAErC,IAAIN,GAAc5yB,KAAKuB,MAAOkkB,IAYzCmN,kBAAA,SAAQ3nB,GACN,OAAOjL,KAAKqzB,MAAM3e,GAAK8d,MAAOvnB,IAWxB2nB,mBAAR,SACEU,EACAroB,GAEA,IAAMsoB,EAA4B,GAMlC,OALAvzB,KAAK+wB,SAAShQ,iBACZ,SAACkQ,EAAkBnN,GACjByP,EAAMtC,GAAYnN,EAAUuP,MAAMC,EAAUjd,MAAM4a,GAAWhmB,KAG1DA,EAAGqoB,EAAWtzB,KAAKuB,MAAOgyB,IAUnCX,wBAAA,SAAc9b,EAAY7U,GACxB,OAAOjC,KAAKwzB,YAAY1c,EAAMpC,GAAK8d,MAAOvwB,IAGpC2wB,yBAAR,SACEa,EACAH,EACArxB,GAEA,IAAML,IAAS5B,KAAKuB,OAAQU,EAAEqxB,EAAWtzB,KAAKuB,OAC9C,GAAIK,EACF,OAAOA,EAEP,GAAI6xB,EAAa1oB,UACf,OAAO,KAEP,IAAM+T,EAAQ2U,EAAale,WACrBme,EAAY1zB,KAAK+wB,SAAS5f,IAAI2N,GACpC,OAAI4U,EACKA,EAAUF,YACfC,EAAa/d,WACb4d,EAAUjd,MAAMyI,GAChB7c,GAGK,MAYf2wB,2BAAA,SACE9b,EACA7U,GAEA,OAAOjC,KAAK2zB,eAAe7c,EAAMpC,GAAK8d,MAAOvwB,IAGvC2wB,4BAAR,SACEa,EACAG,EACA3xB,GAEA,GAAIwxB,EAAa1oB,UACf,OAAO/K,KAEHA,KAAKuB,OACPU,EAAE2xB,EAAqB5zB,KAAKuB,OAE9B,IAAMud,EAAQ2U,EAAale,WACrBme,EAAY1zB,KAAK+wB,SAAS5f,IAAI2N,GACpC,OAAI4U,EACKA,EAAUC,eACfF,EAAa/d,WACbke,EAAoBvd,MAAMyI,GAC1B7c,GAGK2wB,GAAcJ,OAY3BI,qBAAA,SAAQ3wB,GACNjC,KAAK6zB,SAASnf,GAAK8d,MAAOvwB,IAGpB2wB,sBAAR,SACEgB,EACA3xB,GAEAjC,KAAK+wB,SAAShQ,iBAAiB,SAACvC,EAAWsF,GACzCA,EAAU+P,SAASD,EAAoBvd,MAAMmI,GAAYvc,KAEvDjC,KAAKuB,OACPU,EAAE2xB,EAAqB5zB,KAAKuB,QAQhCqxB,0BAAA,SAAa3wB,GACXjC,KAAK+wB,SAAShQ,iBACZ,SAACvC,EAAmBsF,GACdA,EAAUviB,OACZU,EAAEuc,EAAWsF,EAAUviB,UA5VxBqxB,SAAQ,IAAIA,GAAmB,UAoBtC,YACkBrxB,EACAwvB,gBAAAA,EAlChBqB,GADGA,IACsB,IAAI9Q,GAC3B1P,KAgCc5R,WAAAuB,EACAvB,cAAA+wB,ECvCpB,QAME+C,+BAAA,SAAkBtV,GAChB,OAAIxe,KAAK8W,KAAK/L,UACL,IAAI+oB,GAAe9zB,KAAK0H,OAAQgN,GAAK8d,OAErC,IAAIsB,GAAe9zB,KAAK0H,OAAQ1H,KAAK8W,KAAKpB,iBANrD,YAAmBhO,EAAgCoP,GAAhC9W,YAAA0H,EAAgC1H,UAAA8W,EAFnD9W,UAAO6wB,GAAckD,gBCAvB,QAUEC,+BAAA,SAAkBxV,GAChB,OAAIxe,KAAK8W,KAAK/L,UACL,IAAIipB,GACTh0B,KAAK0H,OACLgN,GAAK8d,MACLxyB,KAAKkpB,KAAKlD,kBAAkBxH,IAGvB,IAAIwV,GAAUh0B,KAAK0H,OAAQ1H,KAAK8W,KAAKpB,WAAY1V,KAAKkpB,WAdjE,YACSxhB,EACAoP,EACAoS,GAFAlpB,YAAA0H,EACA1H,UAAA8W,EACA9W,UAAAkpB,EALTlpB,UAAO6wB,GAAcoD,UCCvB,QAaEC,+BAAA,SAAkB1V,GAChB,GAAIxe,KAAK8W,KAAK/L,UAAW,CACvB,IAAM+Y,EAAY9jB,KAAK+wB,SAASwB,QAAQ,IAAI7d,GAAK8J,IACjD,OAAIsF,EAAU/Y,UAEL,KACE+Y,EAAUviB,MAEZ,IAAIyyB,GAAUh0B,KAAK0H,OAAQgN,GAAK8d,MAAO1O,EAAUviB,OAGjD,IAAI2yB,GAAMl0B,KAAK0H,OAAQgN,GAAK8d,MAAO1O,GAO5C,OAJArf,EACEzE,KAAK8W,KAAKvB,aAAeiJ,EACzB,kEAEK,IAAI0V,GAAMl0B,KAAK0H,OAAQ1H,KAAK8W,KAAKpB,WAAY1V,KAAK+wB,WAO7DmD,sBAAA,WACE,MACE,aACAl0B,KAAK8W,KACL,KACA9W,KAAK0H,OAAO+B,WACZ,WACAzJ,KAAK+wB,SAAStnB,WACd,SA1CJ,YAC4B/B,EACAoP,EACAia,GAFA/wB,YAAA0H,EACA1H,UAAA8W,EACA9W,cAAA+wB,EAL5B/wB,UAAO6wB,GAAcsD,MCPvB,QAgBEC,gCAAA,WACE,OAAOp0B,KAAKq0B,mBAOdD,wBAAA,WACE,OAAOp0B,KAAKs0B,WAOdF,+BAAA,SAAkBtd,GAChB,GAAIA,EAAK/L,UACP,OAAO/K,KAAKu0B,uBAAyBv0B,KAAKs0B,UAG5C,IAAMrD,EAAWna,EAAKvB,WACtB,OAAOvV,KAAKw0B,mBAAmBvD,IAOjCmD,gCAAA,SAAmB5qB,GACjB,OACGxJ,KAAKu0B,uBAAyBv0B,KAAKs0B,WAAct0B,KAAKwpB,MAAMiL,SAASjrB,IAO1E4qB,qBAAA,WACE,OAAOp0B,KAAKwpB,WAjDd,YACUA,EACA6K,EACAC,GAFAt0B,WAAAwpB,EACAxpB,uBAAAq0B,EACAr0B,eAAAs0B,ECPZ,QAkCEI,6BAAA,SACEC,EACAC,EACAC,GAEA,OAAO,IAAIH,GACT,IAAIN,GAAUO,EAAWC,EAAUC,GACnC70B,KAAK80B,eAUTJ,8BAAA,SACEK,EACAH,EACAC,GAEA,OAAO,IAAIH,GACT10B,KAAKg1B,YACL,IAAIZ,GAAUW,EAAYH,EAAUC,KAOxCH,2BAAA,WACE,OAAO10B,KAAKg1B,aAMdN,kCAAA,WACE,OAAO10B,KAAKg1B,YAAYT,qBACpBv0B,KAAKg1B,YAAYC,UACjB,MAMNP,4BAAA,WACE,OAAO10B,KAAK80B,cAMdJ,mCAAA,WACE,OAAO10B,KAAK80B,aAAaP,qBACrBv0B,KAAK80B,aAAaG,UAClB,MA5ECP,SAAQ,IAAIA,GACjB,IAAIN,GACFxO,GAAanH,YACS,GACR,GAEhB,IAAI2V,GACFxO,GAAanH,YACS,GACR,QAlBlB,YACmBuW,EACAF,GADA90B,iBAAAg1B,EACAh1B,kBAAA80B,ECRrB,QAaSI,eAAP,SAAmB5Y,GACjB,OAAO,IAAI4Y,GAAOA,GAAOC,MAAO7Y,IAQ3B4Y,oBAAP,SAAwBjE,EAAkB3U,GACxC,OAAO,IAAI4Y,GAAOA,GAAOE,YAAa9Y,EAAU2U,IAQ3CiE,sBAAP,SAA0BjE,EAAkB3U,GAC1C,OAAO,IAAI4Y,GAAOA,GAAOG,cAAe/Y,EAAU2U,IAS7CiE,sBAAP,SACEjE,EACAqE,EACAC,GAEA,OAAO,IAAIL,GAAOA,GAAOM,cAAeF,EAAarE,EAAUsE,IAQ1DL,oBAAP,SAAwBjE,EAAkB3U,GACxC,OAAO,IAAI4Y,GAAOA,GAAOO,YAAanZ,EAAU2U,IAK3CiE,eAAc,cAGdA,iBAAgB,gBAGhBA,iBAAgB,gBAGhBA,eAAc,cAGdA,SAAQ,YAvEf,YACS7lB,EACA0b,EACAvM,EACAkX,EACAlL,GAJAxqB,UAAAqP,EACArP,kBAAA+qB,EACA/qB,eAAAwe,EACAxe,aAAA01B,EACA11B,cAAAwqB,ECCX,QAGEmL,yBAAA,SACEzM,EACA1f,EACA0pB,EACA0C,EACAluB,EACAmuB,GAEApxB,EACEykB,EAAK4M,UAAU91B,KAAK8pB,QACpB,qDAEF,IAAMiM,EAAW7M,EAAKlD,kBAAkBxc,GAExC,OACEusB,EAAS9P,SAAS2P,GAAc7V,OAAOmT,EAASjN,SAAS2P,KAKrDG,EAAShrB,YAAcmoB,EAASnoB,UAK3Bme,GAIiB,MAAxB2M,IACE3C,EAASnoB,UACPme,EAAKuL,SAASjrB,GAChBqsB,EAAqBG,iBACnBd,GAAOe,mBAAmBzsB,EAAKusB,IAGjCtxB,EACEykB,EAAKlL,aACL,uEAGK+X,EAAShrB,UAClB8qB,EAAqBG,iBACnBd,GAAOgB,iBAAiB1sB,EAAK0pB,IAG/B2C,EAAqBG,iBACnBd,GAAOiB,mBAAmB3sB,EAAK0pB,EAAU6C,KAI3C7M,EAAKlL,cAAgBkV,EAASnoB,UACzBme,EAGAA,EAAKrK,qBAAqBrV,EAAK0pB,GAAUkD,UAAUp2B,KAAK8pB,UAOnE6L,4BAAA,SACED,EACAW,EACAR,GA6BA,OA3B4B,MAAxBA,IACGH,EAAQ1X,cACX0X,EAAQjP,aAAazG,GAAgB,SAACxW,EAAKkV,GACpC2X,EAAQ5B,SAASjrB,IACpBqsB,EAAqBG,iBACnBd,GAAOe,mBAAmBzsB,EAAKkV,MAKlC2X,EAAQrY,cACXqY,EAAQ5P,aAAazG,GAAgB,SAACxW,EAAKkV,GACzC,GAAIgX,EAAQjB,SAASjrB,GAAM,CACzB,IAAMusB,EAAWL,EAAQ1P,kBAAkBxc,GACtCusB,EAAShW,OAAOrB,IACnBmX,EAAqBG,iBACnBd,GAAOiB,mBAAmB3sB,EAAKkV,EAAWqX,SAI9CF,EAAqBG,iBACnBd,GAAOgB,iBAAiB1sB,EAAKkV,OAMhC2X,EAAQD,UAAUp2B,KAAK8pB,SAMhC6L,4BAAA,SAAeD,EAAerP,GAC5B,OAAIqP,EAAQ3qB,UACH6a,GAAanH,WAEbiX,EAAQ9W,eAAeyH,IAOlCsP,0BAAA,WACE,OAAO,GAMTA,8BAAA,WACE,OAAO31B,MAMT21B,sBAAA,WACE,OAAO31B,KAAK8pB,YAhId,YAA6BA,GAAA9pB,YAAA8pB,EChB/B,QAGEwM,8BAAA,SAAiB3L,GACf,IAAMtb,EAAOsb,EAAOtb,KACd4hB,EAAWtG,EAAOnM,UACxB/Z,EACE4K,IAAS6lB,GAAOE,aACd/lB,IAAS6lB,GAAOM,eAChBnmB,IAAS6lB,GAAOG,cAClB,6CAEF5wB,EACe,cAAbwsB,EACA,mDAEF,IAAMsF,EAAYv2B,KAAKw2B,UAAUrlB,IAAI8f,GACrC,GAAIsF,EAAW,CACb,IAAME,EAAUF,EAAUlnB,KAC1B,GAAIA,IAAS6lB,GAAOE,aAAeqB,IAAYvB,GAAOG,cACpDr1B,KAAKw2B,UAAUzlB,IACbkgB,EACAiE,GAAOiB,mBACLlF,EACAtG,EAAOI,aACPwL,EAAUxL,oBAGT,GACL1b,IAAS6lB,GAAOG,eAChBoB,IAAYvB,GAAOE,YAEnBp1B,KAAKw2B,UAAU/E,OAAOR,QACjB,GACL5hB,IAAS6lB,GAAOG,eAChBoB,IAAYvB,GAAOM,cAEnBx1B,KAAKw2B,UAAUzlB,IACbkgB,EACAiE,GAAOe,mBAAmBhF,EAAUsF,EAAUb,eAE3C,GACLrmB,IAAS6lB,GAAOM,eAChBiB,IAAYvB,GAAOE,YAEnBp1B,KAAKw2B,UAAUzlB,IACbkgB,EACAiE,GAAOgB,iBAAiBjF,EAAUtG,EAAOI,mBAEtC,CAAA,GACL1b,IAAS6lB,GAAOM,eAChBiB,IAAYvB,GAAOM,cAWnB,MAAM5wB,EACJ,mCACE+lB,EACA,mBACA4L,GAbJv2B,KAAKw2B,UAAUzlB,IACbkgB,EACAiE,GAAOiB,mBACLlF,EACAtG,EAAOI,aACPwL,EAAUb,gBAYhB11B,KAAKw2B,UAAUzlB,IAAIkgB,EAAUtG,IAIjC2L,wBAAA,WACE,OAAO32B,MAAM+2B,KAAK12B,KAAKw2B,UAAUG,eA3ErC,cACmB32B,eAAiC,IAAI8xB,ICsCxD,eAyBO,IAAM8E,GAA2B,IArBtCC,8BAAA,SAAiB5F,GACf,OAAO,MAMT4F,gCAAA,SACE7X,EACA3I,EACA1C,GAEA,OAAO,cAiCTmjB,8BAAA,SAAiB7F,GACf,IAAMjU,EAAOhd,KAAK+2B,WAAWC,gBAC7B,GAAIha,EAAKwX,mBAAmBvD,GAC1B,OAAOjU,EAAKiY,UAAUjP,kBAAkBiL,GAExC,IAAMgG,EAC4B,MAAhCj3B,KAAKk3B,wBACD,IAAI9C,GAAUp0B,KAAKk3B,yBAAyB,GAAM,GAClDl3B,KAAK+2B,WAAWI,iBACtB,OAAOn3B,KAAKo3B,QAAQC,kBAAkBpG,EAAUgG,IAOpDH,gCAAA,SACE9X,EACA3I,EACA1C,GAEA,IAAM2jB,EAC4B,MAAhCt3B,KAAKk3B,wBACDl3B,KAAKk3B,wBACLl3B,KAAK+2B,WAAWQ,wBAChBC,EAAQx3B,KAAKo3B,QAAQK,iBACzBH,EACAjhB,EACA,EACA1C,EACAqL,GAEF,OAAqB,IAAjBwY,EAAM72B,OACD,KAEA62B,EAAM,QA5CjB,YACUJ,EACAL,EACAG,gBAAAA,QAFAl3B,aAAAo3B,EACAp3B,gBAAA+2B,EACA/2B,6BAAAk3B,EC5DZ,OAKE,SACkBQ,EACAC,GADA33B,eAAA03B,EACA13B,aAAA23B,OAgBlBC,2BAAA,SAAcF,GACZjzB,EACEizB,EACGV,gBACA/B,UACAa,UAAU91B,KAAK63B,QAAQ/M,YAC1B,0BAEFrmB,EACEizB,EACGP,iBACAlC,UACAa,UAAU91B,KAAK63B,QAAQ/M,YAC1B,4BAWJ8M,4BAAA,SACEE,EACAC,EACAC,EACAC,GAEA,IACIC,EAAcC,EADZC,EAAc,IAAI9B,GAExB,GAAIyB,EAAU1oB,OAASwhB,GAAcoD,UAAW,CAC9C,IAAMoE,EAAYN,EAEhBG,EADEG,EAAU3wB,OAAOuqB,SACJjyB,KAAKs4B,oBAClBR,EACAO,EAAUvhB,KACVuhB,EAAUnP,KACV8O,EACAC,EACAG,IAGF3zB,EAAO4zB,EAAU3wB,OAAOwqB,WAAY,mBAIpCiG,EACEE,EAAU3wB,OAAOyqB,QAChB2F,EAAaX,iBAAiBoB,eAC5BF,EAAUvhB,KAAK/L,UACL/K,KAAKw4B,sBAClBV,EACAO,EAAUvhB,KACVuhB,EAAUnP,KACV8O,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAU1oB,OAASwhB,GAAcsD,MAAO,CACjD,IAAMsE,EAAQV,EAEZG,EADEO,EAAM/wB,OAAOuqB,SACAjyB,KAAK04B,gBAClBZ,EACAW,EAAM3hB,KACN2hB,EAAM1H,SACNiH,EACAC,EACAG,IAGF3zB,EAAOg0B,EAAM/wB,OAAOwqB,WAAY,mBAEhCiG,EACEM,EAAM/wB,OAAOyqB,QAAU2F,EAAaX,iBAAiBoB,aACxCv4B,KAAK24B,kBAClBb,EACAW,EAAM3hB,KACN2hB,EAAM1H,SACNiH,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAU1oB,OAASwhB,GAAc6B,eAAgB,CAC1D,IAAMkG,EAAeb,EAWnBG,EAVGU,EAAanG,OAUDzyB,KAAK64B,iBAClBf,EACAc,EAAa9hB,KACbkhB,EACAC,EACAG,GAdap4B,KAAK84B,cAClBhB,EACAc,EAAa9hB,KACb8hB,EAAatG,aACb0F,EACAC,EACAG,OAWC,CAAA,GAAIL,EAAU1oB,OAASwhB,GAAckD,gBAQ1C,MAAMnvB,EAAe,2BAA6BmzB,EAAU1oB,MAP5D6oB,EAAel4B,KAAK+4B,gBAClBjB,EACAC,EAAUjhB,KACVkhB,EACAI,GAKJ,IAAMT,EAAUS,EAAYY,aAE5B,OADApB,GAAcqB,oBAAoBnB,EAAcI,EAAcP,GACvD,IAAIuB,GAAgBhB,EAAcP,IAS5BC,uBAAf,SACEE,EACAI,EACAE,GAEA,IAAMzD,EAAYuD,EAAalB,gBAC/B,GAAIrC,EAAUJ,qBAAsB,CAClC,IAAM4E,EACJxE,EAAUM,UAAUjX,cAAgB2W,EAAUM,UAAUlqB,UACpDquB,EAAkBtB,EAAauB,wBAEd,EAArBjB,EAAYz3B,SACXm3B,EAAad,gBAAgBzC,sBAC7B4E,IACExE,EAAUM,UAAUlV,OAA4BqZ,KAClDzE,EACEM,UACAhX,cACA8B,OAAOqZ,EAAgBnb,iBAE1Bma,EAAYl1B,KACVgyB,GAAOoE,YACgBpB,EAAamB,2BAgBpCzB,iDAAR,SACEF,EACA6B,EACAvB,EACAtwB,EACA0wB,GAEA,IAAMoB,EAAe9B,EAAUV,gBAC/B,GAA8C,MAA1CgB,EAAYyB,eAAeF,GAE7B,OAAO7B,EAEP,IAAIgC,SAAezC,SACnB,GAAIsC,EAAWxuB,UAMb,GAJAtG,EACEizB,EAAUP,iBAAiB5C,qBAC3B,8DAEEmD,EAAUP,iBAAiBoB,aAAc,CAI3C,IAAMoB,EAAcjC,EAAUH,wBACxBqC,EACJD,aAAuB/T,GACnB+T,EACA/T,GAAanH,WACbob,EAAwB7B,EAAY8B,0BACxCF,GAEFF,EAAgB15B,KAAK63B,QAAQkC,eAC3BrC,EAAUV,gBAAgB/B,UAC1B4E,EACAzB,OAEG,CACL,IAAM4B,EAAehC,EAAYpI,uBAC/B8H,EAAUH,yBAEZmC,EAAgB15B,KAAK63B,QAAQkC,eAC3BrC,EAAUV,gBAAgB/B,UAC1B+E,EACA5B,OAGC,CACL,IAAMnH,EAAWsI,EAAWhkB,WAC5B,GAAiB,cAAb0b,EAA0B,CAC5BxsB,EAC6B,IAA3B80B,EAAWtjB,YACX,yDAEF,IAAMgkB,EAAeT,EAAavE,UAClCgC,EAAaS,EAAUP,iBAAiBlC,UAExC,IAAMiF,EAAkBlC,EAAYmC,mCAClCZ,EACAU,EACAhD,GAGAyC,EADqB,MAAnBQ,EACcl6B,KAAK63B,QAAQjZ,eAC3Bqb,EACAC,GAIcV,EAAavE,cAE1B,CACL,IAAMmF,EAAkBb,EAAW7jB,WAE/B2kB,SACJ,GAAIb,EAAahF,mBAAmBvD,GAAW,CAC7CgG,EAAaS,EAAUP,iBAAiBlC,UACxC,IAAMqF,EAAmBtC,EAAYmC,mCACnCZ,EACAC,EAAavE,UACbgC,GAGAoD,EADsB,MAApBC,EACcd,EACbvE,UACAjP,kBAAkBiL,GAClBlS,YAAYqb,EAAiBE,GAGhBd,EACbvE,UACAjP,kBAAkBiL,QAGvBoJ,EAAgBrC,EAAYX,kBAC1BpG,EACAyG,EAAUP,kBAIZuC,EADmB,MAAjBW,EACcr6B,KAAK63B,QAAQ9Y,YAC3Bya,EAAavE,UACbhE,EACAoJ,EACAD,EACA1yB,EACA0wB,GAIcoB,EAAavE,WAInC,OAAOyC,EAAU6C,gBACfb,EACAF,EAAajF,sBAAwBgF,EAAWxuB,UAChD/K,KAAK63B,QAAQ2C,iBAgBnB5C,mCAAA,SACEE,EACAyB,EACAkB,EACAzC,EACAC,EACAE,EACAC,GAEA,IACIsC,EADEC,EAAgB7C,EAAaX,iBAE7ByD,EAAezC,EACjBn4B,KAAK63B,QACL73B,KAAK63B,QAAQgD,mBACjB,GAAItB,EAAWxuB,UACb2vB,EAAiBE,EAAab,eAC5BY,EAAc1F,UACdwF,EACA,WAEG,GAAIG,EAAaJ,iBAAmBG,EAAcpC,aAAc,CAErE,IAAMuC,EAAgBH,EACnB1F,UACAlW,YAAYwa,EAAYkB,GAC3BC,EAAiBE,EAAab,eAC5BY,EAAc1F,UACd6F,EACA,UAEG,CACL,IAAM7J,EAAWsI,EAAWhkB,WAC5B,IACGolB,EAAcI,kBAAkBxB,IACR,EAAzBA,EAAWtjB,YAGX,OAAO6hB,EAET,IAAMsC,EAAkBb,EAAW7jB,WAE7BiJ,EADYgc,EAAc1F,UAAUjP,kBAAkBiL,GAC7BlS,YAAYqb,EAAiBK,GAE1DC,EADe,cAAbzJ,EACe2J,EAAahc,eAC5B+b,EAAc1F,UACdtW,GAGeic,EAAa7b,YAC5B4b,EAAc1F,UACdhE,EACAtS,EACAyb,EACAxD,GACA,MAIN,IAAMsB,EAAeJ,EAAakD,iBAChCN,EACAC,EAAcpG,sBAAwBgF,EAAWxuB,UACjD6vB,EAAaJ,gBAET9yB,EAAS,IAAIovB,GACjBkB,EACAE,EACAD,GAEF,OAAOj4B,KAAKi7B,oCACV/C,EACAqB,EACAvB,EACAtwB,EACA0wB,IAcJR,iCAAA,SACEE,EACAyB,EACAkB,EACAzC,EACAC,EACAG,GAEA,IACIF,EAAcwB,EADZF,EAAe1B,EAAad,gBAE5BtvB,EAAS,IAAIovB,GACjBkB,EACAF,EACAG,GAEF,GAAIsB,EAAWxuB,UACb2uB,EAAgB15B,KAAK63B,QAAQkC,eAC3BjC,EAAad,gBAAgB/B,UAC7BwF,EACArC,GAEFF,EAAeJ,EAAayC,gBAC1Bb,GACA,EACA15B,KAAK63B,QAAQ2C,oBAEV,CACL,IAAMvJ,EAAWsI,EAAWhkB,WAC5B,GAAiB,cAAb0b,EACFyI,EAAgB15B,KAAK63B,QAAQjZ,eAC3BkZ,EAAad,gBAAgB/B,UAC7BwF,GAEFvC,EAAeJ,EAAayC,gBAC1Bb,EACAF,EAAajF,qBACbiF,EAAajB,kBAEV,CACL,IAAM6B,EAAkBb,EAAW7jB,WAC7BqgB,EAAWyD,EAAavE,UAAUjP,kBAAkBiL,GACtDiC,SACJ,GAAIkH,EAAgBrvB,UAElBmoB,EAAWuH,MACN,CACL,IAAM/b,EAAYhX,EAAOwzB,iBAAiBjK,GAQtCiC,EAPa,MAAbxU,EAE8B,cAA9B0b,EAAgB1gB,WAChBgF,EAAUuH,SAASmU,EAAgBe,UAAUpwB,UAIlC2T,EAEAA,EAAUK,YAAYqb,EAAiBK,GAIzC7U,GAAanH,WAG5B,GAAKsX,EAAShW,OAAOmT,GAenBgF,EAAeJ,MAfe,CAC9B,IAAMsD,EAAep7B,KAAK63B,QAAQ9Y,YAChCya,EAAavE,UACbhE,EACAiC,EACAkH,EACA1yB,EACA0wB,GAEFF,EAAeJ,EAAayC,gBAC1Ba,EACA5B,EAAajF,qBACbv0B,KAAK63B,QAAQ2C,kBAOrB,OAAOtC,GASMN,kBAAf,SACEF,EACAzG,GAEA,OAAOyG,EAAUV,gBAAgBxC,mBAAmBvD,IAa9C2G,6BAAR,SACEF,EACA5gB,EACAukB,EACArD,EACA2B,EACAvB,GANF,WAcMkD,EAAe5D,EA6BnB,OA5BA2D,EAAgBE,QAAQ,SAAC9lB,EAAciJ,GACrC,IAAM8c,EAAY1kB,EAAKT,MAAMZ,GACzBmiB,GAAc6D,eAAe/D,EAAW8D,EAAUjmB,cACpD+lB,EAAepzB,EAAKowB,oBAClBgD,EACAE,EACA9c,EACAsZ,EACA2B,EACAvB,MAKNiD,EAAgBE,QAAQ,SAAC9lB,EAAciJ,GACrC,IAAM8c,EAAY1kB,EAAKT,MAAMZ,GACxBmiB,GAAc6D,eAAe/D,EAAW8D,EAAUjmB,cACrD+lB,EAAepzB,EAAKowB,oBAClBgD,EACAE,EACA9c,EACAsZ,EACA2B,EACAvB,MAKCkD,GASD1D,yBAAR,SAAoB5a,EAAYyb,GAI9B,OAHAA,EAAM8C,QAAQ,SAAC9lB,EAAciJ,GAC3B1B,EAAOA,EAAK+B,YAAYtJ,EAAciJ,KAEjC1B,GAcD4a,+BAAR,SACEF,EACA5gB,EACAukB,EACArD,EACA2B,EACAxB,EACAC,GAPF,WAWE,GACEV,EACGP,iBACAlC,UACAlqB,YACF2sB,EAAUP,iBAAiB5C,qBAE5B,OAAOmD,EAST,IACIgE,EADAJ,EAAe5D,EAGjBgE,EADE5kB,EAAK/L,UACSswB,EAEAzI,GAAcJ,MAAMY,QAAQtc,EAAMukB,GAEpD,IAAMpE,EAAaS,EAAUP,iBAAiBlC,UAyC9C,OAxCAyG,EAAc3K,SAAShQ,iBAAiB,SAACkQ,EAAUnN,GACjD,GAAImT,EAAWxC,SAASxD,GAAW,CACjC,IAAM0K,EAAcjE,EACjBP,iBACAlC,UACAjP,kBAAkBiL,GACfiC,EAAWhrB,EAAK0zB,YAAYD,EAAa7X,GAC/CwX,EAAepzB,EAAKswB,sBAClB8C,EACA,IAAI5mB,GAAKuc,GACTiC,EACA8E,EACA2B,EACAxB,EACAC,MAINsD,EAAc3K,SAAShQ,iBAAiB,SAACkQ,EAAU4K,GACjD,IAAMC,GACHpE,EAAUP,iBAAiB3C,mBAAmBvD,IACvB,MAAxB4K,EAAet6B,MACjB,IAAK01B,EAAWxC,SAASxD,KAAc6K,EAAoB,CACzD,IAAMH,EAAcjE,EACjBP,iBACAlC,UACAjP,kBAAkBiL,GACfiC,EAAWhrB,EAAK0zB,YAAYD,EAAaE,GAC/CP,EAAepzB,EAAKswB,sBAClB8C,EACA,IAAI5mB,GAAKuc,GACTiC,EACA8E,EACA2B,EACAxB,EACAC,MAKCkD,GAaD1D,2BAAR,SACEF,EACAqE,EACAzJ,EACA0F,EACAC,EACAG,GAEA,GAA2C,MAAvCJ,EAAYyB,eAAesC,GAC7B,OAAOrE,EAIT,IAAMS,EAAmBT,EAAUP,iBAAiBoB,aAI9CoB,EAAcjC,EAAUP,iBAC9B,GAA0B,MAAtB7E,EAAa/wB,MAAe,CAE9B,GACGw6B,EAAQhxB,WAAa4uB,EAAYpF,sBAClCoF,EAAYoB,kBAAkBgB,GAE9B,OAAO/7B,KAAKw4B,sBACVd,EACAqE,EACApC,EAAY1E,UAAUhP,SAAS8V,GAC/B/D,EACAC,EACAE,EACAC,GAEG,GAAI2D,EAAQhxB,UAAW,CAG5B,IAAIixB,EAAkBpJ,GAAcJ,MAIpC,OAHAmH,EAAY1E,UAAUxO,aAAa7I,GAAW,SAACrP,EAAMyO,GACnDgf,EAAkBA,EAAgBjrB,IAAI,IAAI2D,GAAKnG,GAAOyO,KAEjDhd,KAAK24B,kBACVjB,EACAqE,EACAC,EACAhE,EACAC,EACAE,EACAC,GAGF,OAAOV,EAIT,IAAIuE,EAAkBrJ,GAAcJ,MAUpC,OATAF,EAAaiJ,QAAQ,SAACW,EAAW36B,GAC/B,IAAM46B,EAAkBJ,EAAQ1lB,MAAM6lB,GAClCvC,EAAYoB,kBAAkBoB,KAChCF,EAAkBA,EAAgBlrB,IAChCmrB,EACAvC,EAAY1E,UAAUhP,SAASkW,OAI9Bn8B,KAAK24B,kBACVjB,EACAqE,EACAE,EACAjE,EACAC,EACAE,EACAC,IAaER,6BAAR,SACEF,EACA5gB,EACAkhB,EACAI,GAEA,IAAMgE,EAAgB1E,EAAUP,iBAC1Be,EAAeR,EAAUsD,iBAC7BoB,EAAcnH,UACdmH,EAAc7H,sBAAwBzd,EAAK/L,UAC3CqxB,EAAc7D,cAEhB,OAAOv4B,KAAKi7B,oCACV/C,EACAphB,EACAkhB,EACApB,GACAwB,IAaIR,8BAAR,SACEF,EACA5gB,EACAkhB,EACAqE,EACAjE,GAEA,IAAIxD,EACJ,GAAwC,MAApCoD,EAAYyB,eAAe3iB,GAC7B,OAAO4gB,EAEP,IAAMhwB,EAAS,IAAIovB,GACjBkB,EACAN,EACA2E,GAEIC,EAAgB5E,EAAUV,gBAAgB/B,UAC5CyE,SACJ,GAAI5iB,EAAK/L,WAAiC,cAApB+L,EAAKvB,WAA4B,CACrD,IAAI8H,SACJ,GAAIqa,EAAUP,iBAAiB5C,qBAC7BlX,EAAU2a,EAAYpI,uBACpB8H,EAAUH,6BAEP,CACL,IAAMgF,EAAiB7E,EAAUP,iBAAiBlC,UAClDxwB,EACE83B,aAA0B3W,GAC1B,iDAEFvI,EAAU2a,EAAY8B,0BACpByC,GAGJlf,EAAUA,EACVqc,EAAgB15B,KAAK63B,QAAQkC,eAC3BuC,EACAjf,EACA+a,OAEG,CACL,IAAMnH,EAAWna,EAAKvB,WAClB2d,EAAW8E,EAAYX,kBACzBpG,EACAyG,EAAUP,kBAGE,MAAZjE,GACAwE,EAAUP,iBAAiB3C,mBAAmBvD,KAE9CiC,EAAWoJ,EAActW,kBAAkBiL,KAG3CyI,EADc,MAAZxG,EACclzB,KAAK63B,QAAQ9Y,YAC3Bud,EACArL,EACAiC,EACApc,EAAKpB,WACLhO,EACA0wB,GAGFV,EACGV,gBACA/B,UACAR,SAASxD,GAGIjxB,KAAK63B,QAAQ9Y,YAC3Bud,EACArL,EACArL,GAAanH,WACb3H,EAAKpB,WACLhO,EACA0wB,GAGckE,GAGFvxB,WACd2sB,EAAUP,iBAAiB5C,uBAG3BK,EAAWoD,EAAYpI,uBACrB8H,EAAUH,0BAECvZ,eACX0b,EAAgB15B,KAAK63B,QAAQkC,eAC3BL,EACA9E,EACAwD,IAQR,OAHAxD,EACE8C,EAAUP,iBAAiB5C,sBACe,MAA1CyD,EAAYyB,eAAe/kB,GAAK8d,OAC3BkF,EAAU6C,gBACfb,EACA9E,EACA50B,KAAK63B,QAAQ2C,qBAz2BnB,YAA6B3C,GAAA73B,aAAA63B,EC5B/B,QA6BE2E,sCAAA,SACE7E,EACA8E,EACAC,GAHF,WAKQC,EAAkB,GAClBC,EAAkB,GAuDxB,OArDAjF,EAAQ9F,QAAQ,SAAAlH,GAEZA,EAAOtb,OAAS6lB,GAAOM,eACvBttB,EAAK4hB,OAAO+S,oBACVlS,EAAO+K,QACP/K,EAAOI,eAGT6R,EAAM15B,KACJgyB,GAAO4H,iBACLnS,EAAOnM,UACPmM,EAAOI,iBAMf/qB,KAAK+8B,uBACHJ,EACAzH,GAAOG,cACPsC,EACA+E,EACAD,GAEFz8B,KAAK+8B,uBACHJ,EACAzH,GAAOE,YACPuC,EACA+E,EACAD,GAEFz8B,KAAK+8B,uBACHJ,EACAzH,GAAOO,YACPmH,EACAF,EACAD,GAEFz8B,KAAK+8B,uBACHJ,EACAzH,GAAOM,cACPmC,EACA+E,EACAD,GAEFz8B,KAAK+8B,uBACHJ,EACAzH,GAAOC,MACPwC,EACA+E,EACAD,GAGKE,GAaDH,oCAAR,SACEG,EACA3iB,EACA2d,EACAqF,EACAP,GALF,WAOQQ,EAAkBtF,EAAQuF,OAAO,SAAAvS,GAAU,OAAAA,EAAOtb,OAAS2K,IAEjEijB,EAAgBnqB,KAAK9S,KAAKm9B,gBAAgBtsB,KAAK7Q,OAC/Ci9B,EAAgBpL,QAAQ,SAAAlH,GACtB,IAAMyS,EAAqBl1B,EAAKm1B,yBAC9B1S,EACA8R,GAEFO,EAAcnL,QAAQ,SAAAyL,GAChBA,EAAaC,WAAW5S,EAAOtb,OACjCstB,EAAOz5B,KACLo6B,EAAaE,YAAYJ,EAAoBl1B,EAAKu1B,cAapDjB,sCAAR,SAAiC7R,EAAgB8R,GAC/C,MAAoB,UAAhB9R,EAAOtb,MAAoC,kBAAhBsb,EAAOtb,OAGpCsb,EAAOH,SAAWiS,EAAWiB,wBAE3B/S,EAAOnM,UACPmM,EAAOI,aACP/qB,KAAK8pB,SANAa,GAkBH6R,6BAAR,SAAwB3wB,EAAWtM,GACjC,GAAmB,MAAfsM,EAAE2S,WAAoC,MAAfjf,EAAEif,UAC3B,MAAM5Z,EAAe,sCAEvB,IAAM+4B,EAAW,IAAI5gB,GAAUlR,EAAE2S,UAAW3S,EAAEkf,cACxC6S,EAAW,IAAI7gB,GAAUxd,EAAEif,UAAWjf,EAAEwrB,cAC9C,OAAO/qB,KAAK8pB,OAAO3M,QAAQwgB,EAAUC,QAzJvC,YAAoBH,GAAAz9B,YAAAy9B,EAKlBz9B,KAAK8pB,OAAS9pB,KAAKy9B,OAAO5S,iBAAiBC,WCA/C,ICbIU,OD6EFqS,sBAAA,WACE,OAAO79B,KAAKy9B,QAMdI,4BAAA,WACE,OAAO79B,KAAK+2B,WAAWI,iBAAiBlC,WAO1C4I,oCAAA,SAAuB/mB,GACrB,IAAMgnB,EAAQ99B,KAAK+2B,WAAWQ,wBAC9B,OAAIuG,IAIA99B,KAAKy9B,OAAO5S,iBAAiBkT,iBAC3BjnB,EAAK/L,YAAc+yB,EAAM9X,kBAAkBlP,EAAKvB,YAAYxK,WAEvD+yB,EAAM7X,SAASnP,GAGnB,MAMT+mB,qBAAA,WACE,OAA2C,IAApC79B,KAAKg+B,oBAAoBr9B,QAMlCk9B,kCAAA,SAAqBxT,GACnBrqB,KAAKg+B,oBAAoB96B,KAAKmnB,IAQhCwT,qCAAA,SACExT,EACA4T,GAEA,IAAMC,EAA8B,GACpC,GAAID,EAAa,CACfx5B,EACuB,MAArB4lB,EACA,mDAEF,IAAM8T,EAAOn+B,KAAKy9B,OAAO3mB,KACzB9W,KAAKg+B,oBAAoBnM,QAAQ,SAAAyL,GAC/BW,EAAoCA,EACpC,IAAMG,EAAad,EAAae,kBAAkBJ,EAAaE,GAC3DC,GACFF,EAAah7B,KAAKk7B,KAKxB,GAAI/T,EAAmB,CAErB,IADA,IAAIiU,EAAY,GACP99B,EAAI,EAAGA,EAAIR,KAAKg+B,oBAAoBr9B,SAAUH,EAAG,CACxD,IAAM0vB,EAAWlwB,KAAKg+B,oBAAoBx9B,GAC1C,GAAK0vB,EAASqO,QAAQlU,IAEf,GAAIA,EAAkBmU,iBAAkB,CAE7CF,EAAYA,EAAU36B,OAAO3D,KAAKg+B,oBAAoBj0B,MAAMvJ,EAAI,IAChE,YAJA89B,EAAUp7B,KAAKgtB,GAOnBlwB,KAAKg+B,oBAAsBM,OAE3Bt+B,KAAKg+B,oBAAsB,GAE7B,OAAOE,GAWTL,4BAAA,SACE9F,EACAC,EACAqE,GAGEtE,EAAU1oB,OAASwhB,GAAcsD,OACJ,OAA7B4D,EAAUrwB,OAAOsqB,UAEjBvtB,EACEzE,KAAK+2B,WAAWQ,wBAChB,6DAEF9yB,EACEzE,KAAK+2B,WAAWsC,uBAChB,4DAIJ,IAAMvB,EAAe93B,KAAK+2B,WACpBn1B,EAAS5B,KAAKy+B,WAAWC,eAC7B5G,EACAC,EACAC,EACAqE,GAYF,OAVAr8B,KAAKy+B,WAAWE,cAAc/8B,EAAO81B,WAErCjzB,EACE7C,EAAO81B,UAAUP,iBAAiB5C,uBAC/BuD,EAAaX,iBAAiB5C,qBACjC,2DAGFv0B,KAAK+2B,WAAan1B,EAAO81B,UAElB13B,KAAK4+B,0BACVh9B,EAAO+1B,QACP/1B,EAAO81B,UAAUV,gBAAgB/B,UACjC,OAQJ4I,8BAAA,SAAiBP,GACf,IAAM3I,EAAY30B,KAAK+2B,WAAWC,gBAC5B6H,EAA2B,GAUjC,OATKlK,EAAUM,UAAUjX,cACL2W,EAAUM,UAClBxO,aAAazG,GAAgB,SAACxW,EAAKkV,GAC3CmgB,EAAe37B,KAAKgyB,GAAOgB,iBAAiB1sB,EAAKkV,MAGjDiW,EAAUJ,sBACZsK,EAAe37B,KAAKgyB,GAAOoE,YAAY3E,EAAUM,YAE5Cj1B,KAAK4+B,0BACVC,EACAlK,EAAUM,UACVqI,IAWJO,uCAAA,SACElG,EACA8E,EACApS,GAEA,IAAM2S,EAAgB3S,EAClB,CAACA,GACDrqB,KAAKg+B,oBACT,OAAOh+B,KAAK8+B,gBAAgBC,yBAC1BpH,EACA8E,EACAO,QAzOJ,YAAoBS,EAAeuB,GAAfh/B,YAAAy9B,EARZz9B,yBAA2C,GASjD,IAAM2X,EAAS3X,KAAKy9B,OAAO5S,iBAErBoU,EAAc,IAAItJ,GAAche,EAAOmT,YACvCoS,EAASvlB,EAAOunB,gBAMtBl/B,KAAKy+B,WAAa,IAAI7G,GAAcsF,GAEpC,IAAMiC,EAAqBH,EAAiB7H,iBACtCiI,EAAoBJ,EAAiBhI,gBAGrCjC,EAAakK,EAAYlF,eAC7BnU,GAAanH,WACb0gB,EAAmBlK,UACnB,MAEIN,EAAYuI,EAAOnD,eACvBnU,GAAanH,WACb2gB,EAAkBnK,UAClB,MAEIyF,EAAiB,IAAItG,GACzBW,EACAoK,EAAmB5K,qBACnB0K,EAAYzE,gBAERd,EAAgB,IAAItF,GACxBO,EACAyK,EAAkB7K,qBAClB2I,EAAO1C,gBAOTx6B,KAAK+2B,WAAa,IAAIrC,GAAUgF,EAAegB,GAM/C16B,KAAK8+B,gBAAkB,IAAItC,GAAex8B,KAAKy9B,QC3DnD,QACEj+B,sBAAW6/B,iCAQX,WAEE,OADA56B,EAAO+mB,GAAwB,oCACxBA,QAVT,SAAkC7c,GAChClK,GACG+mB,GACD,mDAEFA,GAAyB7c,mCAgB3B0wB,qBAAA,WACE,OAA2B,IAApBr/B,KAAKs/B,MAAMtO,MAGpBqO,4BAAA,SACEtH,EACAC,EACAuH,WAEMvN,EAAU+F,EAAUrwB,OAAOsqB,QACjC,GAAgB,OAAZA,EAAkB,CACpB,IAAMwN,EAAOx/B,KAAKs/B,MAAMnuB,IAAI6gB,GAE5B,OADAvtB,EAAe,MAAR+6B,EAAc,gDACdA,EAAKd,eACV3G,EACAC,EACAuH,GAGF,IAAI5C,EAAkB,OAEtB,IAAmB,IAAA/yB,EAAAzG,EAAAnD,KAAKs/B,MAAM3I,wCAAnB6I,UACT7C,EAASA,EAAOh5B,OACd67B,EAAKd,eAAe3G,EAAWC,EAAauH,qGAIhD,OAAO5C,GAcX0C,kCAAA,SACEzU,EACAP,EACA2N,EACA2B,EACA8F,GAEA,IAAMzN,EAAUpH,EAAM2E,kBAClBiQ,EAAOx/B,KAAKs/B,MAAMnuB,IAAI6gB,GAC1B,IAAKwN,EAAM,CAET,IAAI/C,EAAazE,EAAYpI,uBAC3B6P,EAAsB9F,EAAc,MAElC+F,GAAqB,EAEvBA,IADEjD,IAGFA,EADS9C,aAAuB/T,GACnBoS,EAAY8B,0BAA0BH,GAGtC/T,GAAanH,YAFL,GAKvB,IAAMiZ,EAAY,IAAIhD,GACpB,IAAIN,GACmBqI,EACrBiD,GACA,GAEF,IAAItL,GACmBuF,EACrB8F,GACA,IAGJD,EAAO,IAAI3B,GAAKjT,EAAO8M,GACvB13B,KAAKs/B,MAAMvuB,IAAIihB,EAASwN,GAK1B,OADAA,EAAKG,qBAAqBtV,GACnBmV,EAAKI,iBAAiBvV,IAc/BgV,qCAAA,SACEzU,EACAP,EACA4T,WAEMjM,EAAUpH,EAAM2E,kBAChBsQ,EAAmB,GACrB3B,EAAwB,GACtB4B,EAAkB9/B,KAAK+/B,kBAC7B,GAAgB,YAAZ/N,MAEF,IAAkC,IAAApoB,EAAAzG,EAAAnD,KAAKs/B,MAAMU,yCAAW,CAA7C,IAAAC,eAACC,OAAaV,OACvBtB,EAAeA,EAAav6B,OAC1B67B,EAAKW,wBAAwB9V,EAAmB4T,IAE9CuB,EAAKz0B,YACP/K,KAAKs/B,MAAM7N,OAAOyO,GAIfV,EACEY,WACAvV,iBACAkT,gBAEH8B,EAAQ38B,KAAKs8B,EAAKY,oHAMlBZ,EAAOx/B,KAAKs/B,MAAMnuB,IAAI6gB,MAE1BkM,EAAeA,EAAav6B,OAC1B67B,EAAKW,wBAAwB9V,EAAmB4T,IAE9CuB,EAAKz0B,YACP/K,KAAKs/B,MAAM7N,OAAOO,GAIfwN,EACEY,WACAvV,iBACAkT,gBAEH8B,EAAQ38B,KAAKs8B,EAAKY,cAa1B,OAPIN,IAAoB9/B,KAAK+/B,mBAE3BF,EAAQ38B,KACN,IAAIm8B,GAAU7T,uBAAuBZ,EAAMuC,KAAMvC,EAAM9T,OAIpD,CAAE+oB,UAASlD,OAAQuB,IAG5BmB,2BAAA,mBACQz9B,EAAS,OACf,IAAmB,IAAAgI,EAAAzG,EAAAnD,KAAKs/B,MAAM3I,wCAAU,CAAnC,IAAM6I,UAENA,EACEY,WACAvV,iBACAkT,gBAEHn8B,EAAOsB,KAAKs8B,qGAGhB,OAAO59B,GAOTy9B,oCAAA,SAAuBvoB,WACjB6iB,EAA2B,SAC/B,IAAmB,IAAA/vB,EAAAzG,EAAAnD,KAAKs/B,MAAM3I,wCAAU,CAAnC,IAAM6I,UACT7F,EAAcA,GAAe6F,EAAKa,uBAAuBvpB,qGAE3D,OAAO6iB,GAGT0F,0BAAA,SAAazU,GAEX,GADeA,EAAMC,iBACVkT,eACT,OAAO/9B,KAAKsgC,kBAEZ,IAAMtO,EAAUpH,EAAM2E,kBACtB,OAAOvvB,KAAKs/B,MAAMnuB,IAAI6gB,IAI1BqN,gCAAA,SAAmBzU,GACjB,OAAmC,MAA5B5qB,KAAKugC,aAAa3V,IAG3ByU,6BAAA,WACE,OAAiC,MAA1Br/B,KAAKsgC,mBAGdjB,6BAAA,uBACE,IAAmB,IAAAz1B,EAAAzG,EAAAnD,KAAKs/B,MAAM3I,wCAAU,CAAnC,IAAM6I,UACT,GACEA,EACGY,WACAvV,iBACAkT,eAEH,OAAOyB,oGAGX,OAAO,UA7OX,cAoBmBx/B,WAA2B,IAAI8xB,IChClD,QAKE0O,sBAAA,SAAS1pB,EAAYkG,GACnB,GAAIlG,EAAK/L,UACP,OAAO,IAAIy1B,GAAc,IAAI5N,GAAc5V,IAE3C,IAAMyjB,EAAWzgC,KAAK0gC,WAAWC,yBAAyB7pB,GAC1D,GAAgB,MAAZ2pB,EAAkB,CACpB,IAAMG,EAAeH,EAAS3pB,KAC1BvV,EAAQk/B,EAASl/B,MACfkU,EAAef,GAAKe,aAAamrB,EAAc9pB,GAErD,OADAvV,EAAQA,EAAMwd,YAAYtJ,EAAcuH,GACjC,IAAIwjB,GAAcxgC,KAAK0gC,WAAW3vB,IAAI6vB,EAAcr/B,IAE3D,IAAMgxB,EAAU,IAAIK,GAAc5V,GAElC,OAAO,IAAIwjB,GADUxgC,KAAK0gC,WAAWtN,QAAQtc,EAAMyb,KAMzDiO,uBAAA,SAAU1pB,EAAY+pB,GACpB,IAAIC,EAAW9gC,KAIf,OAHA+S,GAAK8tB,EAAS,SAAC5P,EAAkBjU,GAC/B8jB,EAAWA,EAASC,SAASjqB,EAAKT,MAAM4a,GAAWjU,KAE9C8jB,GAUTN,yBAAA,SAAY1pB,GACV,OAAIA,EAAK/L,UACAy1B,GAAchO,MAGd,IAAIgO,GADUxgC,KAAK0gC,WAAWtN,QAAQtc,EAAM8b,GAAcJ,SAYrEgO,8BAAA,SAAiB1pB,GACf,OAAqC,MAA9B9W,KAAKghC,gBAAgBlqB,IAU9B0pB,6BAAA,SAAgB1pB,GACd,IAAM2pB,EAAWzgC,KAAK0gC,WAAWC,yBAAyB7pB,GAC1D,OAAgB,MAAZ2pB,EACKzgC,KAAK0gC,WACTvvB,IAAIsvB,EAAS3pB,MACbmP,SAASvR,GAAKe,aAAagrB,EAAS3pB,KAAMA,IAEtC,MASX0pB,iCAAA,WACE,IAAMzP,EAAwB,GACxB/T,EAAOhd,KAAK0gC,WAAWn/B,MAkB7B,OAjBY,MAARyb,EAEGA,EAAKgB,cACPhB,EAAsByJ,aACrBzG,GACA,SAACxB,EAAWE,GACVqS,EAAS7tB,KAAK,IAAI6Z,GAAUyB,EAAWE,MAK7C1e,KAAK0gC,WAAW3P,SAAShQ,iBAAiB,SAACvC,EAAWsF,GAC7B,MAAnBA,EAAUviB,OACZwvB,EAAS7tB,KAAK,IAAI6Z,GAAUyB,EAAWsF,EAAUviB,UAIhDwvB,GAGTyP,gCAAA,SAAmB1pB,GACjB,GAAIA,EAAK/L,UACP,OAAO/K,KAEP,IAAMihC,EAAgBjhC,KAAKghC,gBAAgBlqB,GAC3C,OACS,IAAI0pB,GADQ,MAAjBS,EACuB,IAAIrO,GAAcqO,GAElBjhC,KAAK0gC,WAAWnO,QAAQzb,KASvD0pB,qBAAA,WACE,OAAOxgC,KAAK0gC,WAAW31B,WASzBy1B,mBAAA,SAAMxjB,GACJ,OAIJ,SAASkkB,EACPzrB,EACA0rB,EACAnkB,GAEA,GAAuB,MAAnBmkB,EAAU5/B,MAEZ,OAAOyb,EAAK+B,YAAYtJ,EAAc0rB,EAAU5/B,OAEhD,IAAI6/B,EAAgB,KAkBpB,OAjBAD,EAAUpQ,SAAShQ,iBAAiB,SAACkQ,EAAUnN,GAC5B,cAAbmN,GAGFxsB,EACsB,OAApBqf,EAAUviB,MACV,6CAEF6/B,EAAgBtd,EAAUviB,OAE1Byb,EAAOkkB,EAAkBzrB,EAAaY,MAAM4a,GAAWnN,EAAW9G,KAIjEA,EAAKiJ,SAASxQ,GAAc1K,WAA+B,OAAlBq2B,IAC5CpkB,EAAOA,EAAK+B,YAAYtJ,EAAaY,MAAM,aAAc+qB,IAEpDpkB,EA/BAkkB,CAAkBxsB,GAAK8d,MAAOxyB,KAAK0gC,WAAY1jB,IAlIjDwjB,SAAQ,IAAIA,GAAc,IAAI5N,GAAc,WAFnD,YAAoB8N,GAAA1gC,gBAAA0gC,ECetB,QA4BEW,yBAAA,SAAYvqB,GACV,OAAO,IAAIwqB,GAAaxqB,EAAM9W,OAWhCqhC,0BAAA,SAAavqB,EAAYoS,EAAYqY,EAAiBC,GACpD/8B,EACE88B,EAAUvhC,KAAKyhC,aACf,qDAEc35B,IAAZ05B,IACFA,GAAU,GAEZxhC,KAAK0hC,WAAWx+B,KAAK,CACnB4T,OACAoS,OACAqY,UACAC,YAGEA,IACFxhC,KAAK2hC,eAAiB3hC,KAAK2hC,eAAeZ,SAASjqB,EAAMoS,IAE3DlpB,KAAKyhC,aAAeF,GAUtBF,sBAAA,SACEvqB,EACAukB,EACAkG,GAEA98B,EACE88B,EAAUvhC,KAAKyhC,aACf,gDAEFzhC,KAAK0hC,WAAWx+B,KAAK,CACnB4T,OACAia,SAAUsK,EACVkG,UACAC,SAAS,IAGXxhC,KAAK2hC,eAAiB3hC,KAAK2hC,eAAeC,UAAU9qB,EAAMukB,GAC1Dr7B,KAAKyhC,aAAeF,GAOtBF,sBAAA,SAASE,GACP,IAAK,IAAI/gC,EAAI,EAAGA,EAAIR,KAAK0hC,WAAW/gC,OAAQH,IAAK,CAC/C,IAAMqhC,EAAS7hC,KAAK0hC,WAAWlhC,GAC/B,GAAIqhC,EAAON,UAAYA,EACrB,OAAOM,EAGX,OAAO,MAWTR,yBAAA,SAAYE,GAAZ,WAMQza,EAAM9mB,KAAK0hC,WAAWI,UAAU,SAAAvhC,GACpC,OAAOA,EAAEghC,UAAYA,IAEvB98B,EAAc,GAAPqiB,EAAU,gDACjB,IAAMib,EAAgB/hC,KAAK0hC,WAAW5a,GACtC9mB,KAAK0hC,WAAWM,OAAOlb,EAAK,GAO5B,IALA,IAAImb,EAAyBF,EAAcP,QACvCU,GAAsC,EAEtC1hC,EAAIR,KAAK0hC,WAAW/gC,OAAS,EAE1BshC,GAA+B,GAALzhC,GAAQ,CACvC,IAAM2hC,EAAeniC,KAAK0hC,WAAWlhC,GACjC2hC,EAAaX,UAER1a,GAALtmB,GACAR,KAAKoiC,oBAAoBD,EAAcJ,EAAcjrB,MAGrDmrB,GAAyB,EAChBF,EAAcjrB,KAAKlM,SAASu3B,EAAarrB,QAElDorB,GAAsC,IAG1C1hC,IAGF,QAAKyhC,IAEMC,EAETliC,KAAKqiC,aAIDN,EAAc7Y,KAChBlpB,KAAK2hC,eAAiB3hC,KAAK2hC,eAAeW,YACxCP,EAAcjrB,MAIhB/D,GADiBgvB,EAAchR,SAChB,SAACvS,GACdtW,EAAKy5B,eAAiBz5B,EAAKy5B,eAAeW,YACxCP,EAAcjrB,KAAKT,MAAMmI,OAXxB,IA0BX6iB,kCAAA,SAAqBvqB,GACnB,OAAO9W,KAAK2hC,eAAeX,gBAAgBlqB,IAa7CuqB,oCAAA,SACEkB,EACAlG,EACAmG,EACAC,GAEA,GAAKD,GAAsBC,EAmBpB,CACL,IAAMhK,EAAQz4B,KAAK2hC,eAAee,mBAAmBH,GACrD,IAAKE,GAAuBhK,EAAM1tB,UAChC,OAAOsxB,EAGP,GACGoG,GACsB,MAAvBpG,GACC5D,EAAMkK,iBAAiBjuB,GAAK8d,OAGxB,CACL,IAQMoQ,EAAcvB,GAAUwB,WAC5B7iC,KAAK0hC,WATQ,SAASoB,GACtB,OACGA,EAAMtB,SAAWiB,MAChBD,KACEA,EAAkBpqB,QAAQ0qB,EAAMvB,YACnCuB,EAAMhsB,KAAKlM,SAAS23B,IAAaA,EAAS33B,SAASk4B,EAAMhsB,QAM5DyrB,GAGF,OADMQ,EAAe1G,GAAuBzW,GAAanH,WAClDmkB,EAAY/hC,MAAMkiC,GAhBzB,OAAO,KA7BX,IAAM9B,EAAgBjhC,KAAK2hC,eAAeX,gBAAgBuB,GAC1D,GAAqB,MAAjBtB,EACF,OAAOA,EAEP,IAAM+B,EAAWhjC,KAAK2hC,eAAee,mBAAmBH,GACxD,GAAIS,EAASj4B,UACX,OAAOsxB,EACF,GACkB,MAAvBA,GACC2G,EAASL,iBAAiBjuB,GAAK8d,OAI3B,CACL,IAAMuQ,EAAe1G,GAAuBzW,GAAanH,WACzD,OAAOukB,EAASniC,MAAMkiC,GAHtB,OAAO,MA+Cf1B,uCAAA,SACEkB,EACAU,GAEA,IAAIrJ,EAAmBhU,GAAanH,WAC9BykB,EAAcljC,KAAK2hC,eAAeX,gBAAgBuB,GACxD,GAAIW,EAUF,OATKA,EAAYllB,cAEfklB,EAAYzc,aAAazG,GAAgB,SAACxB,EAAWqU,GACnD+G,EAAmBA,EAAiB/a,qBAClCL,EACAqU,KAIC+G,EACF,GAAIqJ,EAAwB,CAGjC,IAAME,EAAQnjC,KAAK2hC,eAAee,mBAAmBH,GAoBrD,OAnBAU,EAAuBxc,aACrBzG,GACA,SAACxB,EAAWE,GACV,IAAM1B,EAAOmmB,EACVT,mBAAmB,IAAIhuB,GAAK8J,IAC5B3d,MAAM6d,GACTkb,EAAmBA,EAAiB/a,qBAClCL,EACAxB,KAKNmmB,EAAMC,sBAAsBvR,QAAQ,SAAArO,GAClCoW,EAAmBA,EAAiB/a,qBAClC2E,EAAUjV,KACViV,EAAUxG,QAGP4c,EAWP,OAPc55B,KAAK2hC,eAAee,mBAAmBH,GAC/Ca,sBAAsBvR,QAAQ,SAAArO,GAClCoW,EAAmBA,EAAiB/a,qBAClC2E,EAAUjV,KACViV,EAAUxG,QAGP4c,GAwBXyH,gDAAA,SACEkB,EACA5Y,EACA0Z,EACAC,GAEA7+B,EACE4+B,GAAqBC,EACrB,6DAEF,IAAMxsB,EAAOyrB,EAASlsB,MAAMsT,GAC5B,GAAI3pB,KAAK2hC,eAAegB,iBAAiB7rB,GAGvC,OAAO,KAGP,IAAMysB,EAAavjC,KAAK2hC,eAAee,mBAAmB5rB,GAC1D,OAAIysB,EAAWx4B,UAENu4B,EAAmBrd,SAAS0D,GAQ5B4Z,EAAW1iC,MAAMyiC,EAAmBrd,SAAS0D,KAc1D0X,+BAAA,SACEkB,EACAtR,EACAqS,GAEA,IAAMxsB,EAAOyrB,EAASlsB,MAAM4a,GACtBgQ,EAAgBjhC,KAAK2hC,eAAeX,gBAAgBlqB,GAC1D,OAAqB,MAAjBmqB,EACKA,EAEHqC,EAAmB9O,mBAAmBvD,GACrBjxB,KAAK2hC,eAAee,mBAAmB5rB,GACxCjW,MAChByiC,EAAmBrO,UAAUjP,kBAAkBiL,IAG1C,MAUboQ,4BAAA,SAAevqB,GACb,OAAO9W,KAAK2hC,eAAeX,gBAAgBlqB,IAO7CuqB,8BAAA,SACEkB,EACAjL,EACA/P,EACAzG,EACAnN,EACAqL,GAEA,IAAIwkB,EACE/K,EAAQz4B,KAAK2hC,eAAee,mBAAmBH,GAC/CtB,EAAgBxI,EAAMuI,gBAAgBtsB,GAAK8d,OACjD,GAAqB,MAAjByO,EACFuC,EAAYvC,MACP,CAAA,GAA0B,MAAtB3J,EAIT,MAAO,GAHPkM,EAAY/K,EAAM53B,MAAMy2B,GAM1B,IADAkM,EAAYA,EAAUpN,UAAUpX,IACjBjU,WAAcy4B,EAAUxlB,aAerC,MAAO,GARP,IANA,IAAMwZ,EAAQ,GACRzhB,EAAMiJ,EAAMmG,aACZL,EAAOnR,EACR6vB,EAA2B/b,uBAAuBF,EAAWvI,GAC7DwkB,EAA2Bnc,gBAAgBE,EAAWvI,GACvDvd,EAAOqjB,EAAKG,UACTxjB,GAAQ+1B,EAAM72B,OAASmgB,GACC,IAAzB/K,EAAItU,EAAM8lB,IACZiQ,EAAMt0B,KAAKzB,GAEbA,EAAOqjB,EAAKG,UAEd,OAAOuS,GAMH6J,iCAAR,SAA4BoC,EAA0B3sB,GACpD,GAAI2sB,EAAYva,KACd,OAAOua,EAAY3sB,KAAKlM,SAASkM,GAEjC,IAAK,IAAM0H,KAAailB,EAAY1S,SAClC,GACE0S,EAAY1S,SAASlxB,eAAe2e,IACpCilB,EAAY3sB,KAAKT,MAAMmI,GAAW5T,SAASkM,GAE3C,OAAO,EAGX,OAAO,GAOHuqB,wBAAR,WACErhC,KAAK2hC,eAAiBN,GAAUwB,WAC9B7iC,KAAK0hC,WACLL,GAAUqC,eACVhvB,GAAK8d,OAEsB,EAAzBxyB,KAAK0hC,WAAW/gC,OAClBX,KAAKyhC,aAAezhC,KAAK0hC,WAAW1hC,KAAK0hC,WAAW/gC,OAAS,GAAG4gC,QAEhEvhC,KAAKyhC,cAAgB,GAOVJ,kBAAf,SAA8ByB,GAC5B,OAAOA,EAAMtB,SAOAH,cAAf,SACEsC,EACAzG,EACA0G,GAGA,IADA,IAAIC,EAAgBrD,GAAchO,MACzBhyB,EAAI,EAAGA,EAAImjC,EAAOhjC,SAAUH,EAAG,CACtC,IAAMsiC,EAAQa,EAAOnjC,GAIrB,GAAI08B,EAAO4F,GAAQ,CACjB,IAAMtH,EAAYsH,EAAMhsB,KACpBrB,SACJ,GAAIqtB,EAAM5Z,KACJ0a,EAASh5B,SAAS4wB,IACpB/lB,EAAef,GAAKe,aAAamuB,EAAUpI,GAC3CqI,EAAgBA,EAAc9C,SAAStrB,EAAcqtB,EAAM5Z,OAClDsS,EAAU5wB,SAASg5B,KAC5BnuB,EAAef,GAAKe,aAAa+lB,EAAWoI,GAC5CC,EAAgBA,EAAc9C,SAC5BrsB,GAAK8d,MACLsQ,EAAM5Z,KAAKjD,SAASxQ,SAKnB,CAAA,IAAIqtB,EAAM/R,SA0Bf,MAAMnsB,EAAe,8CAzBrB,GAAIg/B,EAASh5B,SAAS4wB,GACpB/lB,EAAef,GAAKe,aAAamuB,EAAUpI,GAC3CqI,EAAgBA,EAAcjC,UAC5BnsB,EACAqtB,EAAM/R,eAEH,GAAIyK,EAAU5wB,SAASg5B,GAE5B,IADAnuB,EAAef,GAAKe,aAAa+lB,EAAWoI,IAC3B74B,UACf84B,EAAgBA,EAAcjC,UAC5BltB,GAAK8d,MACLsQ,EAAM/R,cAEH,CACL,IAAM1a,EAAQvL,EAAQg4B,EAAM/R,SAAUtb,EAAaF,YACnD,GAAIc,EAAO,CAET,IAAMytB,EAAWztB,EAAM4P,SAASxQ,EAAaC,YAC7CmuB,EAAgBA,EAAc9C,SAASrsB,GAAK8d,MAAOsR,OAW/D,OAAOD,OAliBX,cAQU7jC,oBAAgCwgC,GAAchO,MAU9CxyB,gBAA4B,GAE5BA,mBAAgB,EAwhB1B,QA2CEshC,oCAAA,SACEjF,EACAmG,EACAC,GAEA,OAAOziC,KAAK0gC,WAAW9Q,uBACrB5vB,KAAK+jC,UACL1H,EACAmG,EACAC,IAWJnB,uCAAA,SACE2B,GAEA,OAAOjjC,KAAK0gC,WAAW5G,0BACrB95B,KAAK+jC,UACLd,IAuBJ3B,gDAAA,SACExqB,EACAusB,EACAC,GAEA,OAAOtjC,KAAK0gC,WAAWvG,mCACrBn6B,KAAK+jC,UACLjtB,EACAusB,EACAC,IAYJhC,4BAAA,SAAexqB,GACb,OAAO9W,KAAK0gC,WAAWjH,eAAez5B,KAAK+jC,UAAU1tB,MAAMS,KAc7DwqB,8BAAA,SACEhK,EACA/P,EACAzG,EACAnN,EACAqL,GAEA,OAAOhf,KAAK0gC,WAAWjJ,iBACrBz3B,KAAK+jC,UACLzM,EACA/P,EACAzG,EACAnN,EACAqL,IAYJsiB,+BAAA,SACErQ,EACA+S,GAEA,OAAOhkC,KAAK0gC,WAAWrJ,kBACrBr3B,KAAK+jC,UACL9S,EACA+S,IAUJ1C,mBAAA,SAAM9iB,GACJ,OAAO,IAAI8iB,GAAathC,KAAK+jC,UAAU1tB,MAAMmI,GAAYxe,KAAK0gC,iBA9IhE,YAAY5pB,EAAYqqB,GACtBnhC,KAAK+jC,UAAYjtB,EACjB9W,KAAK0gC,WAAaS,ECziBtB,QAyBE8C,gCAAA,SACEntB,EACAotB,EACA3C,EACAC,GAKA,OAFAxhC,KAAKmkC,kBAAkBC,aAAattB,EAAMotB,EAAS3C,EAASC,GAEvDA,EAGIxhC,KAAKqkC,4BACV,IAAIrQ,GAAUjC,GAAgBY,KAAM7b,EAAMotB,IAHrC,IAaXD,4BAAA,SACEntB,EACAukB,EACAkG,GAGAvhC,KAAKmkC,kBAAkBG,SAASxtB,EAAMukB,EAAiBkG,GAEvD,IAAMgD,EAAa3R,GAAc4R,WAAWnJ,GAE5C,OAAOr7B,KAAKqkC,4BACV,IAAInQ,GAAMnC,GAAgBY,KAAM7b,EAAMytB,KAU1CN,0BAAA,SAAa1C,EAAiB9O,gBAAAA,MAC5B,IAAMqQ,EAAQ9iC,KAAKmkC,kBAAkBM,SAASlD,GAE9C,GADyBvhC,KAAKmkC,kBAAkB7B,YAAYf,GAGrD,CACL,IAAImD,EAAe9R,GAAcJ,MASjC,OARkB,MAAdsQ,EAAM5Z,KAERwb,EAAeA,EAAa3zB,IAAI2D,GAAK8d,OAAO,GAE5Czf,GAAK+vB,EAAM/R,SAAU,SAACjc,EAAoBkI,GACxC0nB,EAAeA,EAAa3zB,IAAI,IAAI2D,GAAKI,GAAakI,KAGnDhd,KAAKqkC,4BACV,IAAIhS,GAAayQ,EAAMhsB,KAAM4tB,EAAcjS,IAZ7C,MAAO,IAsBXwR,kCAAA,SAAqBntB,EAAYotB,GAC/B,OAAOlkC,KAAKqkC,4BACV,IAAIrQ,GAAUjC,GAAgB4S,OAAQ7tB,EAAMotB,KAShDD,8BAAA,SACEntB,EACAukB,GAEA,IAAMkJ,EAAa3R,GAAc4R,WAAWnJ,GAE5C,OAAOr7B,KAAKqkC,4BACV,IAAInQ,GAAMnC,GAAgB4S,OAAQ7tB,EAAMytB,KAS5CN,iCAAA,SAAoBntB,GAClB,OAAO9W,KAAKqkC,4BACV,IAAIvQ,GAAe/B,GAAgB4S,OAAQ7tB,KAS/CmtB,uCAAA,SAA0BntB,EAAYoS,EAAY0b,GAChD,IAAMC,EAAW7kC,KAAK8kC,gBAAgBF,GACtC,GAAgB,MAAZC,EAaF,MAAO,GAZP,IAAMthC,EAAI0gC,GAASc,eAAeF,GAC5BG,EAAYzhC,EAAEuT,KAClBkb,EAAUzuB,EAAEyuB,QACRvc,EAAef,GAAKe,aAAauvB,EAAWluB,GAC5C/T,EAAK,IAAIixB,GACbjC,GAAgBkT,qBAAqBjT,GACrCvc,EACAyT,GAEF,OAAOlpB,KAAKklC,sBAAsBF,EAAWjiC,IAYjDkhC,mCAAA,SACEntB,EACAukB,EACAuJ,GAEA,IAAMC,EAAW7kC,KAAK8kC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAMthC,EAAI0gC,GAASc,eAAeF,GAC5BG,EAAYzhC,EAAEuT,KAClBkb,EAAUzuB,EAAEyuB,QACRvc,EAAef,GAAKe,aAAauvB,EAAWluB,GAC5CytB,EAAa3R,GAAc4R,WAAWnJ,GACtCt4B,EAAK,IAAImxB,GACbnC,GAAgBkT,qBAAqBjT,GACrCvc,EACA8uB,GAEF,OAAOvkC,KAAKklC,sBAAsBF,EAAWjiC,GAG7C,MAAO,IASXkhC,uCAAA,SAA0BntB,EAAY8tB,GACpC,IAAMC,EAAW7kC,KAAK8kC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAMthC,EAAI0gC,GAASc,eAAeF,GAC5BG,EAAYzhC,EAAEuT,KAClBkb,EAAUzuB,EAAEyuB,QACRvc,EAAef,GAAKe,aAAauvB,EAAWluB,GAC5C/T,EAAK,IAAI+wB,GACb/B,GAAgBkT,qBAAqBjT,GACrCvc,GAEF,OAAOzV,KAAKklC,sBAAsBF,EAAWjiC,GAG7C,MAAO,IASXkhC,kCAAA,SACErZ,EACAP,GAEA,IAAMvT,EAAO8T,EAAM9T,KAEf6iB,EAA2B,KAC3BwL,GAA2B,EAG/BnlC,KAAKolC,eAAeC,cAAcvuB,EAAM,SAACwuB,EAAiBC,GACxD,IAAM9vB,EAAef,GAAKe,aAAa6vB,EAAiBxuB,GACxD6iB,EAAcA,GAAe4L,EAAGlF,uBAAuB5qB,GACvD0vB,EACEA,GAA4BI,EAAGxF,oBAEnC,IAUIN,EAVA+F,EAAYxlC,KAAKolC,eAAej0B,IAAI2F,GACnC0uB,GAIHL,EACEA,GAA4BK,EAAUzF,kBACxCpG,EAAcA,GAAe6L,EAAUnF,uBAAuB3rB,GAAK8d,SALnEgT,EAAY,IAAInG,GAChBr/B,KAAKolC,eAAiBplC,KAAKolC,eAAer0B,IAAI+F,EAAM0uB,IAQnC,MAAf7L,EACF8F,GAAsB,GAEtBA,GAAsB,EACtB9F,EAAc/T,GAAanH,WACXze,KAAKolC,eAAe7S,QAAQzb,GACpC2uB,aAAa,SAACjnB,EAAWknB,GAC/B,IAAMzN,EAAgByN,EAAerF,uBAAuB3rB,GAAK8d,OAC7DyF,IACF0B,EAAcA,EAAY9a,qBACxBL,EACAyZ,OAMR,IAAM0N,EAAoBH,EAAUI,mBAAmBhb,GACvD,IAAK+a,IAAsB/a,EAAMC,iBAAiBkT,eAAgB,CAEhE,IAAM8G,EAAWZ,GAAS4B,cAAcjb,GACxCnmB,GACGzE,KAAK8lC,cAAc5U,IAAI2T,GACxB,0CAEF,IAAMD,EAAMX,GAAS8B,mBACrB/lC,KAAK8lC,cAAc/0B,IAAI8zB,EAAUD,GACjC5kC,KAAKgmC,cAAcj1B,IAAI6zB,EAAKC,GAE9B,IAAM7M,EAAch4B,KAAKmkC,kBAAkB8B,YAAYnvB,GACnD6lB,EAAS6I,EAAU7F,qBACrB/U,EACAP,EACA2N,EACA2B,EACA8F,GAEF,IAAKkG,IAAsBR,EAA0B,CACnD,IAAM3F,EAA0BgG,EAAUjF,aAAa3V,GACvD+R,EAASA,EAAOh5B,OAAO3D,KAAKkmC,eAAetb,EAAO4U,IAEpD,OAAO7C,GAaTsH,qCAAA,SACErZ,EACAP,EACA4T,GAHF,WAMQnnB,EAAO8T,EAAM9T,KACbqvB,EAAiBnmC,KAAKolC,eAAej0B,IAAI2F,GAC3ConB,EAAwB,GAI5B,GACEiI,IAC6B,YAA5Bvb,EAAM2E,mBACL4W,EAAeP,mBAAmBhb,IACpC,CAIA,IAAMwb,EAAmBD,EAAehG,wBACtCvV,EACAP,EACA4T,GAEEkI,EAAep7B,YACjB/K,KAAKolC,eAAiBplC,KAAKolC,eAAep0B,OAAO8F,IAEnD,IAAM+oB,EAAUuG,EAAiBvG,QACjC3B,EAAekI,EAAiBzJ,OAOhC,IAAM0J,GACH,IACDxG,EAAQiC,UAAU,SAAAlX,GAChB,OAAOA,EAAMC,iBAAiBkT,iBAE5BuI,EAAUtmC,KAAKolC,eAAemB,WAClCzvB,EACA,SAACrB,EAAc+wB,GACb,OAAOA,EAAgBzG,oBAI3B,GAAIsG,IAAoBC,EAAS,CAC/B,IAAM/T,EAAUvyB,KAAKolC,eAAe7S,QAAQzb,GAG5C,IAAKyb,EAAQxnB,UAKX,IAHA,IAAM07B,EAAWzmC,KAAK0mC,gCAAgCnU,GAG7C/xB,EAAI,EAAGA,EAAIimC,EAAS9lC,SAAUH,EAAG,CACxC,IAAMg/B,EAAOiH,EAASjmC,GACpBmmC,EAAWnH,EAAKY,WACZwG,EAAW5mC,KAAK6mC,uBAAuBrH,GAC7Cx/B,KAAK8mC,gBAAgBC,eACnB9C,GAAS+C,mBAAmBL,GAC5B3mC,KAAKinC,aAAaN,GAClBC,EAASM,OACTN,EAASlrB,cAUZ4qB,GAA4B,EAAjBzG,EAAQl/B,SAAes9B,IAGjCoI,EAGFrmC,KAAK8mC,gBAAgBK,cACnBlD,GAAS+C,mBAAmBpc,GAFI,MAMlCiV,EAAQhO,QAAQ,SAACuV,GACf,IAAMC,EAAcn/B,EAAK49B,cAAc30B,IACrC8yB,GAAS4B,cAAcuB,IAEzBl/B,EAAK4+B,gBAAgBK,cACnBlD,GAAS+C,mBAAmBI,GAC5BC,MAMRrnC,KAAKsnC,YAAYzH,GAInB,OAAO3B,GAcT+F,oCAAA,SAAuBntB,EAAY0rB,GACjC,IACMrB,EAAYnhC,KAAKmkC,kBACjBxK,EAAc35B,KAAKolC,eAAemB,WACtCzvB,EACA,SAACwc,EAAWkS,GACV,IAAM/vB,EAAef,GAAKe,aAAa6d,EAAWxc,GAC5C6iB,EAAc6L,EAAUnF,uBAAuB5qB,GACrD,GAAIkkB,EACF,OAAOA,IAIb,OAAOwH,EAAUvR,uBACf9Y,EACA6iB,EACA6I,GAfwB,IAwBpByB,6CAAR,SACE1R,GAEA,OAAOA,EAAQgV,KACb,SAAC9xB,EAAc+xB,EAAqBC,GAClC,GAAID,GAAuBA,EAAoBzH,kBAE7C,MAAO,CADcyH,EAAoBlH,mBAIzC,IAAIoH,EAAgB,GAOpB,OANIF,IACFE,EAAQF,EAAoBG,iBAE9B50B,GAAK00B,EAAU,SAACG,EAAcC,GAC5BH,EAAQA,EAAM/jC,OAAOkkC,KAEhBH,KAMPzD,yBAAR,SAAoB6D,GAClB,IAAK,IAAIv7B,EAAI,EAAGA,EAAIu7B,EAAQnnC,SAAU4L,EAAG,CACvC,IAAMw7B,EAAeD,EAAQv7B,GAC7B,IAAKw7B,EAAald,iBAAiBkT,eAAgB,CAEjD,IAAMiK,EAAkB/D,GAAS4B,cAAckC,GACzCE,EAAkBjoC,KAAK8lC,cAAc30B,IAAI62B,GAC/ChoC,KAAK8lC,cAAcrU,OAAOuW,GAC1BhoC,KAAKgmC,cAAcvU,OAAOwW,MAUjBhE,sBAAf,SAAkCrZ,GAChC,OACEA,EAAMC,iBAAiBkT,iBACtBnT,EAAMC,iBAAiBqd,YAKjBtd,EAAMX,SAENW,GASHqZ,4BAAR,SAAuBrZ,EAAc4U,GACnC,IAAM1oB,EAAO8T,EAAM9T,KACb8tB,EAAM5kC,KAAKinC,aAAarc,GACxBgc,EAAW5mC,KAAK6mC,uBAAuBrH,GAEvC7C,EAAS38B,KAAK8mC,gBAAgBC,eAClC9C,GAAS+C,mBAAmBpc,GAC5Bga,EACAgC,EAASM,OACTN,EAASlrB,YAGL6W,EAAUvyB,KAAKolC,eAAe7S,QAAQzb,GAG5C,GAAI8tB,EACFngC,GACG8tB,EAAQhxB,MAAMw+B,kBACf,0DA2BF,IAvBA,IAAMoI,EAAgB5V,EAAQgV,KAC5B,SAAC9xB,EAAc+xB,EAAqBC,GAClC,IACGhyB,EAAa1K,WACdy8B,GACAA,EAAoBzH,kBAEpB,MAAO,CAACyH,EAAoBlH,kBAAkBF,YAG9C,IAAIgI,EAAmB,GASvB,OARIZ,IACFY,EAAUA,EAAQzkC,OAChB6jC,EAAoBG,gBAAgB38B,IAAI,SAAAw0B,GAAQ,OAAAA,EAAKY,eAGzDrtB,GAAK00B,EAAU,SAACG,EAAcS,GAC5BD,EAAUA,EAAQzkC,OAAO0kC,KAEpBD,IAIJ5nC,EAAI,EAAGA,EAAI2nC,EAAcxnC,SAAUH,EAAG,CAC7C,IAAM8nC,EAAcH,EAAc3nC,GAClCR,KAAK8mC,gBAAgBK,cACnBlD,GAAS+C,mBAAmBsB,GAC5BtoC,KAAKinC,aAAaqB,IAIxB,OAAO3L,GAGDsH,oCAAR,SACEzE,GADF,WAGQ5U,EAAQ4U,EAAKY,WACbwE,EAAM5kC,KAAKinC,aAAarc,GAE9B,MAAO,CACLsc,OAAQ,WAEN,OADc1H,EAAKrI,kBAAoBvR,GAAanH,YACvCoI,QAEfnL,WAAY,SAAC6sB,GACX,GAAe,OAAXA,EACF,OAAI3D,EACK18B,EAAKsgC,0BAA0B5d,EAAM9T,KAAM8tB,GAE3C18B,EAAKugC,oBAAoB7d,EAAM9T,MAKxC,IAAMrT,E/C1HkB,SAASiF,EAAckiB,GACvD,IAAI8d,EAAS,gBACA,YAAThgC,EACFggC,EACE,0FAEgB,sBAAThgC,EACTggC,EAAS,6DACS,gBAAThgC,IACTggC,EAAS,8BAGX,IAAMjlC,EAAQ,IAAIoB,MAChB6D,EAAO,OAASkiB,EAAM9T,KAAKrN,WAAa,KAAOi/B,GAIjD,OADCjlC,EAAciF,KAAOA,EAAKigC,cACpBllC,E+CyGemlC,CAAmBL,EAAQ3d,GACzC,OAAO1iB,EAAKi4B,wBACVvV,EACsB,KACtBnnB,MAUKwgC,iBAAf,SAA6BrZ,GAC3B,OAAOA,EAAM9T,KAAKrN,WAAa,IAAMmhB,EAAM2E,mBAM9B0U,kBAAf,SACEY,GAEA,IAAMgE,EAAahE,EAASzsB,QAAQ,KAKpC,OAJA3T,GACkB,IAAhBokC,GAAqBA,EAAahE,EAASlkC,OAAS,EACpD,iBAEK,CACLqxB,QAAS6S,EAAS9wB,OAAO80B,EAAa,GACtC/xB,KAAM,IAAIpC,GAAKmwB,EAAS9wB,OAAO,EAAG80B,MAO9B5E,6BAAR,SAAwBW,GACtB,OAAO5kC,KAAKgmC,cAAc70B,IAAIyzB,IAMxBX,0BAAR,SAAqBrZ,GACnB,IAAMia,EAAWZ,GAAS4B,cAAcjb,GACxC,OAAO5qB,KAAK8lC,cAAc30B,IAAI0zB,IAWjBZ,oBAAf,WACE,OAAOA,GAAS6E,iBAMV7E,mCAAR,SACEe,EACAjN,GAEA,IAAMyN,EAAYxlC,KAAKolC,eAAej0B,IAAI6zB,GAC1CvgC,EAAO+gC,EAAW,wDAClB,IAAMxN,EAAch4B,KAAKmkC,kBAAkB8B,YAAYjB,GACvD,OAAOQ,EAAU9G,eACf3G,EACAC,EACiB,OAiBbiM,yCAAR,SAAoClM,GAClC,OAAO/3B,KAAK+oC,sBACVhR,EACA/3B,KAAKolC,eACY,KACjBplC,KAAKmkC,kBAAkB8B,YAAYvxB,GAAK8d,SAOpCyR,mCAAR,SACElM,EACAiR,EACArP,EACA3B,GAEA,GAAID,EAAUjhB,KAAK/L,UACjB,OAAO/K,KAAKipC,iCACVlR,EACAiR,EACArP,EACA3B,GAGF,IAAMwN,EAAYwD,EAAc73B,IAAIuD,GAAK8d,OAGtB,MAAfmH,GAAoC,MAAb6L,IACzB7L,EAAc6L,EAAUnF,uBAAuB3rB,GAAK8d,QAGtD,IAAImK,EAAkB,GAChBne,EAAYuZ,EAAUjhB,KAAKvB,WAC3B2zB,EAAiBnR,EAAUoR,kBAAkB3qB,GAC7CsF,EAAYklB,EAAcjY,SAAS5f,IAAIqN,GAC7C,GAAIsF,GAAaolB,EAAgB,CAC/B,IAAME,EAAmBzP,EACrBA,EAAY3T,kBAAkBxH,GAC9B,KACE6qB,EAAmBrR,EAAY3hB,MAAMmI,GAC3Cme,EAASA,EAAOh5B,OACd3D,KAAK+oC,sBACHG,EACAplB,EACAslB,EACAC,IAWN,OANI7D,IACF7I,EAASA,EAAOh5B,OACd6hC,EAAU9G,eAAe3G,EAAWC,EAAa2B,KAI9CgD,GAOHsH,8CAAR,SACElM,EACAiR,EACArP,EACA3B,GAJF,WAMQwN,EAAYwD,EAAc73B,IAAIuD,GAAK8d,OAGtB,MAAfmH,GAAoC,MAAb6L,IACzB7L,EAAc6L,EAAUnF,uBAAuB3rB,GAAK8d,QAGtD,IAAImK,EAAkB,GAyBtB,OAxBAqM,EAAcjY,SAAShQ,iBAAiB,SAACvC,EAAWsF,GAClD,IAAMslB,EAAmBzP,EACrBA,EAAY3T,kBAAkBxH,GAC9B,KACE6qB,EAAmBrR,EAAY3hB,MAAMmI,GACrC0qB,EAAiBnR,EAAUoR,kBAAkB3qB,GAC/C0qB,IACFvM,EAASA,EAAOh5B,OACduE,EAAK+gC,iCACHC,EACAplB,EACAslB,EACAC,OAMJ7D,IACF7I,EAASA,EAAOh5B,OACd6hC,EAAU9G,eAAe3G,EAAWC,EAAa2B,KAI9CgD,GA9IMsH,iBAAgB,MA3lB/B,YAAoB6C,GAAA9mC,qBAAA8mC,EAdZ9mC,oBAA2C4yB,GAAcJ,MAKzDxyB,uBAAoB,IAAIqhC,GAEfrhC,mBAAqC,IAAI8xB,IACzC9xB,mBAAqC,IAAI8xB,IClE5D,QAGEwX,qBAAA,SAAQxyB,GACN,OAAO9W,KAAKupC,UAAUtjB,SAASnP,IAGjCwyB,4BAAA,SAAexyB,EAAY0yB,GACzBxpC,KAAKupC,UAAYvpC,KAAKupC,UAAUxqB,YAAYjI,EAAM0yB,QARtD,cACUxpC,eAAkB4lB,GAAanH,WCEzC,QAgBEgrB,sBAAA,SAASC,GACP,OAAK1pC,KAAK2pC,MAIH3pC,KAAK2pC,MAAMC,SAASF,GAActhC,MAAM,SAAA3E,GAG7C,OAAIA,GAAwB,+BAAfA,EAAMiF,MACjBkI,GAAI,kEACG,MAEAzP,QAAQE,OAAOoC,KAVjBtC,QAAQC,QAAQ,OAe3BqoC,oCAAA,SAAuB7C,GAGjB5mC,KAAK2pC,MACP3pC,KAAK2pC,MAAME,qBAAqBjD,IAEhC1yB,WAAW,WAAM,OAAA0yB,EAAS,OAAO,GACjC5mC,KAAK8pC,cACF34B,MACArP,KAAK,SAAAioC,GAAQ,OAAAA,EAAKF,qBAAqBjD,OAI9C6C,uCAAA,SAA0B7C,GACxB5mC,KAAK8pC,cACF34B,MACArP,KAAK,SAAAioC,GAAQ,OAAAA,EAAKC,wBAAwBpD,MAG/C6C,mCAAA,WACE,IAAIQ,EACF,0DACAjqC,KAAKkqC,KAAK37B,KACV,iFAEE,eAAgBvO,KAAKkqC,KAAKC,QAC5BF,GACE,uJAGO,mBAAoBjqC,KAAKkqC,KAAKC,QACvCF,GACE,2JAIFA,GACE,kKAIJjgC,GAAKigC,QAxEP,YACUC,EACAJ,GAFV,WACU9pC,UAAAkqC,EACAlqC,mBAAA8pC,EAHF9pC,WAAqC,KAK3CA,KAAK2pC,MAAQG,EAAcM,aAAa,CAAEn9B,UAAU,IAC/CjN,KAAK2pC,OACRG,EAAc34B,MAAMrP,KAAK,SAAAioC,GAAQ,OAAC7hC,EAAKyhC,MAAQI,ICbrD,QAGEM,8BAAA,SAAiB97B,EAAc+7B,gBAAAA,KACxB1/B,EAAS5K,KAAKuqC,UAAWh8B,KAC5BvO,KAAKuqC,UAAUh8B,GAAQ,GAGzBvO,KAAKuqC,UAAUh8B,IAAS+7B,GAG1BD,iBAAA,WACE,OAAO9iC,EAASvH,KAAKuqC,gBAZzB,cACUvqC,eAAqC,GCL/C,QAISwqC,iBAAP,SAAqB5xB,GACnB,IAAM6xB,EAAa7xB,EAASnP,WAM5B,OAJKzJ,KAAK0qC,aAAaD,KACrBzqC,KAAK0qC,aAAaD,GAAc,IAAIJ,IAG/BrqC,KAAK0qC,aAAaD,IAGpBD,uBAAP,SACE5xB,EACA+xB,GAEA,IAAMF,EAAa7xB,EAASnP,WAM5B,OAJKzJ,KAAK4qC,WAAWH,KACnBzqC,KAAK4qC,WAAWH,GAAcE,KAGzB3qC,KAAK4qC,WAAWH,IAvBVD,gBAAiD,GACjDA,cAAuC,OAFxD,eCMA,QAKEK,iBAAA,WACE,IAAMC,EAAW9qC,KAAK+qC,YAAY55B,MAE5Bqf,OAAasa,GAQnB,OAPI9qC,KAAKgrC,OACPj4B,GAAK/S,KAAKgrC,MAAO,SAACC,EAAc1pC,GAC9BivB,EAAMya,GAAQza,EAAMya,GAAQ1pC,IAGhCvB,KAAKgrC,MAAQF,EAENta,OAbT,YAAoBua,GAAA/qC,iBAAA+qC,EAFZ/qC,WAAwC,KCDlD,QA0BEkrC,yBAAA,SAAYD,GACVjrC,KAAKmrC,eAAeF,IAAQ,GAGtBC,0BAAR,WAAA,WACQE,EAAQprC,KAAKqrC,eAAel6B,MAC5Bm6B,EAA8B,GAChCC,GAAoB,EAExBx4B,GAAKq4B,EAAO,SAACH,EAAc1pC,GACb,EAARA,GAAaqJ,EAAS1C,EAAKijC,eAAgBF,KAC7CK,EAAcL,GAAQ1pC,EACtBgqC,GAAoB,KAIpBA,GACFvrC,KAAKwrC,QAAQC,YAAYH,GAI3Bl3B,GACEpU,KAAK0rC,aAAa76B,KAAK7Q,MACvBmT,KAAKI,MAAsB,EAAhBJ,KAAK2J,SA7CQ,WAa5B,YAAY6uB,EAAqCH,GAAAxrC,aAAAwrC,EANzCxrC,oBAA2C,GAOjDA,KAAKqrC,eAAiB,IAAIR,GAAcc,GAExC,IAAMr3B,EApBmB,IAsBvB,IAAgDnB,KAAK2J,SACvD1I,GAAsBpU,KAAK0rC,aAAa76B,KAAK7Q,MAAOmT,KAAKI,MAAMe,ICdnE,QAiBEs3B,yBAAA,SAAYC,GAGV,IADA,IAAIC,EAAW,KACNtrC,EAAI,EAAGA,EAAIqrC,EAAclrC,OAAQH,IAAK,CAC7C,IAAMwqB,EAAY6gB,EAAcrrC,GAC1BurC,EAAY/gB,EAAUT,UACX,OAAbuhB,GAAsBC,EAAUhsB,OAAO+rB,EAASvhB,aAClDvqB,KAAKgsC,YAAY9oC,KAAK4oC,GACtBA,EAAW,MAGI,OAAbA,IACFA,EAAW,IAAIG,GAAUF,IAG3BD,EAASI,IAAIlhB,GAEX8gB,GACF9rC,KAAKgsC,YAAY9oC,KAAK4oC,IAa1BF,+BAAA,SAAkB90B,EAAY+0B,GAC5B7rC,KAAKmsC,YAAYN,GACjB7rC,KAAKosC,oCAAoC,SAACL,GACxC,OAAAA,EAAUhsB,OAAOjJ,MAarB80B,uCAAA,SAA0BS,EAAmBR,GAC3C7rC,KAAKmsC,YAAYN,GAEjB7rC,KAAKosC,oCAAoC,SAACL,GACxC,OAAOA,EAAUnhC,SAASyhC,IAAgBA,EAAYzhC,SAASmhC,MAQ3DH,iDAAR,SACE9Y,GAEA9yB,KAAKssC,kBAGL,IADA,IAAIC,GAAU,EACL/rC,EAAI,EAAGA,EAAIR,KAAKgsC,YAAYrrC,OAAQH,IAAK,CAChD,IAAMgsC,EAAYxsC,KAAKgsC,YAAYxrC,GAC/BgsC,IAEE1Z,EADc0Z,EAAUjiB,YAE1BvqB,KAAKgsC,YAAYxrC,GAAGisC,QACpBzsC,KAAKgsC,YAAYxrC,GAAK,MAEtB+rC,GAAU,GAKZA,IACFvsC,KAAKgsC,YAAc,IAGrBhsC,KAAKssC,uBAnGT,cAKUtsC,iBAA2B,GAO3BA,qBAAkB,EA+F5B,QAYEisC,iBAAA,SAAIjhB,GACFhrB,KAAK0sC,QAAQxpC,KAAK8nB,IAMpBihB,mBAAA,WACE,IAAK,IAAIzrC,EAAI,EAAGA,EAAIR,KAAK0sC,QAAQ/rC,OAAQH,IAAK,CAC5C,IAAMwqB,EAAYhrB,KAAK0sC,QAAQlsC,GAC/B,GAAkB,OAAdwqB,EAAoB,CACtBhrB,KAAK0sC,QAAQlsC,GAAK,KAClB,IAAMmsC,EAAU3hB,EAAUV,iBACtB3Z,IACFC,GAAI,UAAYoa,EAAUvhB,YAE5BwK,GAAe04B,MAQrBV,qBAAA,WACE,OAAOjsC,KAAKsb,WA9Bd,YAA6BA,GAAAtb,WAAAsb,EAFrBtb,aAAmB,GC5H7B,QAgCY4sC,qBAAV,SAAkB5yB,OAAmB,aAAAjR,mBAAAA,IAAAkI,oBACnC,GAAItR,MAAM+F,QAAQ1F,KAAK6sC,WAAW7yB,IAIhC,IAFA,IAAM8yB,IAAgB9sC,KAAK6sC,WAAW7yB,IAE7BxZ,EAAI,EAAGA,EAAIssC,EAAUnsC,OAAQH,IACpCssC,EAAUtsC,GAAGyH,SAASpH,MAAMisC,EAAUtsC,GAAG6M,QAAS4D,IAKxD27B,gBAAA,SAAG5yB,EAAmB/R,EAAgCoF,GACpDrN,KAAK+sC,mBAAmB/yB,GACxBha,KAAK6sC,WAAW7yB,GAAaha,KAAK6sC,WAAW7yB,IAAc,GAC3Dha,KAAK6sC,WAAW7yB,GAAW9W,KAAK,CAAE+E,WAAUoF,YAE5C,IAAM2d,EAAYhrB,KAAKgtC,gBAAgBhzB,GACnCgR,GACF/iB,EAASpH,MAAMwM,EAAS2d,IAI5B4hB,iBAAA,SAAI5yB,EAAmB/R,EAAgCoF,GACrDrN,KAAK+sC,mBAAmB/yB,GAExB,IADA,IAAM8yB,EAAY9sC,KAAK6sC,WAAW7yB,IAAc,GACvCxZ,EAAI,EAAGA,EAAIssC,EAAUnsC,OAAQH,IACpC,GACEssC,EAAUtsC,GAAGyH,WAAaA,KACxBoF,GAAWA,IAAYy/B,EAAUtsC,GAAG6M,SAGtC,YADAy/B,EAAU9K,OAAOxhC,EAAG,IAMlBosC,gCAAR,SAA2B5yB,GACzBvV,EACEzE,KAAKitC,eAAe9b,KAAK,SAAA+b,GACvB,OAAOA,IAAOlzB,IAEhB,kBAAoBA,QA9DxB,YAAoBizB,GAAAjtC,oBAAAitC,EAVZjtC,gBAKJ,GAMFyE,EACE9E,MAAM+F,QAAQunC,IAA2C,EAAxBA,EAAetsC,OAChD,8BCZN,WAAuCb,QAAA8sC,IAG9BO,eAAP,WACE,OAAO,IAAIA,IAoDbA,6BAAA,SAAgBnzB,GAEd,OADAvV,EAAqB,YAAduV,EAAyB,uBAAyBA,GAClD,CAACha,KAAKotC,eAnDf,cAAA,IAEMC,EACAC,IAFJ3kC,aAAM,CAAC,wBAIe,oBAAb4kC,eAC8B,IAA9BA,SAASC,wBAEkB,IAAvBD,SAAiB,QAE1BD,EAAmB,mBACnBD,EAAS,eACiC,IAA1BE,SAAoB,WACpCD,EAAmB,sBACnBD,EAAS,kBACgC,IAAzBE,SAAmB,UACnCD,EAAmB,qBACnBD,EAAS,iBACoC,IAA7BE,SAAuB,eACvCD,EAAmB,yBACnBD,EAAS,iBAQbnlC,EAAKklC,UAAW,EAEZE,GACFC,SAASC,iBACPF,EACA,WACE,IAAM9L,GAAW+L,SAASF,GACtB7L,IAAYt5B,EAAKklC,WACnBllC,EAAKklC,SAAW5L,EAChBt5B,EAAKulC,QAAQ,UAAWjM,MAG5B,KC3CR,WAAmC1hC,QAAA8sC,IAG1Bc,eAAP,WACE,OAAO,IAAIA,IA2CbA,6BAAA,SAAgB1zB,GAEd,OADAvV,EAAqB,WAAduV,EAAwB,uBAAyBA,GACjD,CAACha,KAAK2tC,UAMfD,6BAAA,WACE,OAAO1tC,KAAK2tC,aAjDd,cAAA,MACEhlC,aAAM,CAAC,wBAPDT,WAAU,EAcI,oBAAXI,aAC4B,IAA5BA,OAAOklC,kBACbnlC,MAEDC,OAAOklC,iBACL,SACA,WACOtlC,EAAKylC,UACRzlC,EAAKylC,SAAU,EACfzlC,EAAKulC,QAAQ,UAAU,MAG3B,GAGFnlC,OAAOklC,iBACL,UACA,WACMtlC,EAAKylC,UACPzlC,EAAKylC,SAAU,EACfzlC,EAAKulC,QAAQ,UAAU,MAG3B,MC3CR,QAWEG,wBAAA,SAAWC,EAAqB5lC,GAC9BjI,KAAK8tC,mBAAqBD,EAC1B7tC,KAAK+tC,QAAU9lC,EACXjI,KAAK8tC,mBAAqB9tC,KAAKguC,qBACjChuC,KAAK+tC,UACL/tC,KAAK+tC,QAAU,OAWnBH,4BAAA,SAAeK,EAAoBjlC,GAAnC,WACEhJ,KAAKkuC,iBAAiBD,GAAcjlC,EACpC,qBACE,IAAMmlC,EAAYC,EAAKF,iBACrBE,EAAKJ,2BAEAI,EAAKF,iBAAiBE,EAAKJ,oBAClC,mBAASxtC,GACH2tC,EAAU3tC,IACZyT,GAAe,WACb/L,EAAKmmC,WAAWF,EAAU3tC,OAHvBA,EAAI,EAAGA,EAAI2tC,EAAUxtC,SAAUH,IAA/BA,GAOT,GAAI4tC,EAAKJ,qBAAuBI,EAAKN,0BAC/BM,EAAKL,UACPK,EAAKL,UACLK,EAAKL,QAAU,cAInBK,EAAKJ,6BAnBAhuC,KAAKkuC,iBAAiBluC,KAAKguC,2CApBpC,YAAoBK,GAAAruC,gBAAAquC,EARpBruC,sBAA8B,GAC9BA,wBAAqB,EACrBA,yBAAsB,EACtBA,aAA+B,KCiB1B,QAqFLsuC,kBAAA,SAAKC,EAA8BC,GAAnC,WACExuC,KAAKyuC,cAAgB,EACrBzuC,KAAK0uC,cAAgBF,EACrBxuC,KAAK2uC,gBAAkB,IAAIf,GAAeW,GAC1CvuC,KAAK4uC,WAAY,EAEjB5uC,KAAK6uC,qBAAuB36B,WAAW,WACrChM,EAAK4mC,KAAK,gCAEV5mC,EAAK6mC,YACL7mC,EAAK2mC,qBAAuB,MAE3B17B,KAAKI,MA9De,M3DqJQ,SAAStI,GAC1C,GAA2C,aAAxBsiC,SAASyB,WAC1B/jC,QACK,CAIL,IAAIgkC,GAAS,EACPC,EAAY,WACX3B,SAASvrC,KAKTitC,IACHA,GAAS,EACThkC,KANAiJ,WAAWg7B,EAAW/7B,KAAKI,MAAM,MAUjCg6B,SAASC,kBACXD,SAASC,iBAAiB,mBAAoB0B,GAAW,GAEzD5mC,OAAOklC,iBAAiB,OAAQ0B,GAAW,IAEjC3B,SAAiB4B,cAG1B5B,SAAiB4B,YAAY,qBAAsB,WACtB,aAAxB5B,SAASyB,YACXE,MAKH5mC,OAAe6mC,YAAY,SAAUD,K2DvHxCE,CAAoB,WAClB,IAAIlnC,EAAK0mC,UAAT,CAKA1mC,EAAKmnC,gBAAkB,IAAIC,GACzB,eAAC,aAAAvmC,mBAAAA,IAAAkF,kBACO,IAAAnE,SAACylC,OAASC,OAAMC,OAEtB,aADAvnC,EAAKwnC,wBAAwBzhC,GACxB/F,EAAKmnC,gBASV,GALInnC,EAAK2mC,uBACPc,aAAaznC,EAAK2mC,sBAClB3mC,EAAK2mC,qBAAuB,MAE9B3mC,EAAK0nC,gBAAiB,EAtHa,UAuH/BL,EACFrnC,EAAKiK,GAAKq9B,EACVtnC,EAAK2nC,SAAWJ,MACX,CAAA,GAzH8B,UAyH1BF,EAgBT,MAAM,IAAI1qC,MAAM,kCAAoC0qC,GAdhDC,GAGFtnC,EAAKmnC,gBAAgBS,cAAe,EAIpC5nC,EAAKymC,gBAAgBoB,WAAWP,EAAgB,WAC9CtnC,EAAK6mC,eAGP7mC,EAAK6mC,cAMX,eAAC,aAAAhmC,mBAAAA,IAAAkF,kBACO,IAAAnE,SAACkmC,OAAIhnC,OACXd,EAAKwnC,wBAAwBzhC,GAC7B/F,EAAKymC,gBAAgBsB,eAAeD,EAAchnC,IAEpD,WACEd,EAAK6mC,aAEP7mC,EAAKgoC,OAKP,IAAMC,EAA8C,CACpDC,MAA2C,KAC3CD,EAAwC,IAAIh9B,KAAKI,MAC/B,IAAhBJ,KAAK2J,UAEH5U,EAAKmnC,gBAAgBgB,2BACvBF,EACqC,GACjCjoC,EAAKmnC,gBAAgBgB,0BAE3BF,EAAuB,EzDhMG,IyDiMtBjoC,EAAKooC,qBACPH,EAAiC,EAAIjoC,EAAKooC,oBAExCpoC,EAAKqoC,gBACPJ,EAA4B,GAAIjoC,EAAKqoC,eAGjB,oBAAb93B,UACPA,SAAS+3B,OACgC,IAAzC/3B,SAAS+3B,KAAKp4B,QAAQpB,MAEtBm5B,EAAuB,EzDpMN,KyDsMnB,IAAMM,EAAavoC,EAAKgoC,MAAMC,GAC9BjoC,EAAK4mC,KAAK,+BAAiC2B,GAC3CvoC,EAAKmnC,gBAAgBqB,OAAOD,EAAY,kBAS5CnC,mBAAA,WACEtuC,KAAKqvC,gBAAgBsB,cAAc3wC,KAAKmS,GAAInS,KAAK6vC,UACjD7vC,KAAK4wC,uBAAuB5wC,KAAKmS,GAAInS,KAAK6vC,WAQrCvB,cAAP,WACEA,GAAsBuC,aAAc,GAQ/BvC,iBAAP,WACEA,GAAsBwC,gBAAiB,GAIlCxC,eAAP,WAGS,QAAIA,GAAsBuC,eAM5BvC,GAAsBwC,gBACH,oBAAbvD,UACmB,MAA1BA,SAASwD,e3D2OK,iBAAXzoC,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAOmQ,SAAS+3B,OAUR,iBAAZQ,SAA8C,iBAAfA,QAAQC,K2D9OrD3C,mCAAA,aAMQA,uBAAR,WACEtuC,KAAK4uC,WAAY,EAEb5uC,KAAKqvC,kBACPrvC,KAAKqvC,gBAAgB6B,QACrBlxC,KAAKqvC,gBAAkB,MAIrBrvC,KAAKmxC,iBACP5D,SAASvrC,KAAKovC,YAAYpxC,KAAKmxC,gBAC/BnxC,KAAKmxC,eAAiB,MAGpBnxC,KAAK6uC,uBACPc,aAAa3vC,KAAK6uC,sBAClB7uC,KAAK6uC,qBAAuB,OAQxBP,uBAAR,WACOtuC,KAAK4uC,YACR5uC,KAAK8uC,KAAK,8BACV9uC,KAAKqxC,YAEDrxC,KAAK0uC,gBACP1uC,KAAK0uC,cAAc1uC,KAAK4vC,gBACxB5vC,KAAK0uC,cAAgB,QAS3BJ,mBAAA,WACOtuC,KAAK4uC,YACR5uC,KAAK8uC,KAAK,6BACV9uC,KAAKqxC,cAST/C,kBAAA,SAAKtlC,GACH,IAAMsoC,EAAUlnC,EAAUpB,GAC1BhJ,KAAKuxC,WAAaD,EAAQ3wC,OAC1BX,KAAKwxC,OAAOC,iBAAiB,aAAcH,EAAQ3wC,QAWnD,IARA,I7EJIyP,E6EIEshC,G7EJFthC,EAAYxM,E6EIgB0tC,G7EH3BptC,EAAOqB,gBAAgB6K,GAAW,I6EOjC6B,EAAWH,GAAkB4/B,EA3RdC,MA+RZnxC,EAAI,EAAGA,EAAIyR,EAAStR,OAAQH,IACnCR,KAAKqvC,gBAAgBuC,eACnB5xC,KAAKyuC,cACLx8B,EAAStR,OACTsR,EAASzR,IAEXR,KAAKyuC,iBAWTH,oCAAA,SAAuBn8B,EAAY0/B,GAIjC7xC,KAAKmxC,eAAiB5D,SAASwD,cAAc,UAC7C,IAAMZ,EAAqC,CAC3C2B,OAA2D,KAC3D3B,EAAoC,GAAIh+B,EACxCg+B,EAAoC,GAAI0B,EACxC7xC,KAAKmxC,eAAeY,IAAM/xC,KAAKkwC,MAAMC,GACrCnwC,KAAKmxC,eAAea,MAAMC,QAAU,OAEpC1E,SAASvrC,KAAKkwC,YAAYlyC,KAAKmxC,iBAQzB7C,qCAAR,SAAgCrgC,GAE9B,IAAMkkC,EAAgB/nC,EAAU6D,GAAMtN,OACtCX,KAAKmyC,eAAiBA,EACtBnyC,KAAKwxC,OAAOC,iBAAiB,iBAAkBU,QAvRjD,YACSC,EACAx5B,EACA03B,EACAC,GAHAvwC,YAAAoyC,EACApyC,cAAA4Y,EACA5Y,wBAAAswC,EACAtwC,mBAAAuwC,EA5BTvwC,eAAY,EACZA,mBAAgB,EAURA,qBAAiB,EAmBvBA,KAAK8uC,KAAOz9B,GAAW+gC,GACvBpyC,KAAKwxC,OAAShH,GAAa6H,cAAcz5B,GACzC5Y,KAAKkwC,MAAQ,SAACv4B,GACZ,OAAAiB,EAAS05B,cAAcp7B,GAAcS,IA2R3C,QA0FiB23B,iBAAf,WACE,IAAMiD,EAAShF,SAASwD,cAAc,UAItC,GAHAwB,EAAOP,MAAMC,QAAU,QAGnB1E,SAASvrC,KAqBX,KAAM,oGApBNurC,SAASvrC,KAAKkwC,YAAYK,GAC1B,IAIYA,EAAOC,cAAcjF,UAG7B38B,GAAI,iCAEN,MAAOlP,GACP,IAAM8V,EAAS+1B,SAAS/1B,OACxB+6B,EAAOR,IACL,gEACAv6B,EACA,2BAmBN,OAVI+6B,EAAOE,gBACTF,EAAOG,IAAMH,EAAOE,gBACXF,EAAOC,cAChBD,EAAOG,IAAMH,EAAOC,cAAcjF,SAExBgF,EAAehF,WAEzBgF,EAAOG,IAAOH,EAAehF,UAGxBgF,GAMTjD,mBAAA,WAAA,WAEEtvC,KAAK2yC,OAAQ,EAET3yC,KAAK4yC,WAIP5yC,KAAK4yC,SAASF,IAAI1wC,KAAK6wC,UAAY,GACnC3+B,WAAW,WACa,OAAlBhM,EAAK0qC,WACPrF,SAASvrC,KAAKovC,YAAYlpC,EAAK0qC,UAC/B1qC,EAAK0qC,SAAW,OAEjBz/B,KAAKI,MAAM,KAIhB,IAAMi7B,EAAexuC,KAAKwuC,aACtBA,IACFxuC,KAAKwuC,aAAe,KACpBA,MASJc,2BAAA,SAAcn9B,EAAY0/B,GAMxB,IALA7xC,KAAK8yC,KAAO3gC,EACZnS,KAAK+yC,KAAOlB,EACZ7xC,KAAK2yC,OAAQ,EAGN3yC,KAAKgzC,kBAUN1D,yBAAR,WAIE,GACEtvC,KAAK2yC,OACL3yC,KAAK8vC,cACL9vC,KAAKizC,oBAAoBjiB,MAAkC,EAA1BhxB,KAAKkzC,YAAYvyC,OAAa,EAAI,GACnE,CAEAX,KAAKmzC,gBACL,IAAMhD,EAA8C,GACpDA,EAAoC,GAAInwC,KAAK8yC,KAC7C3C,EAAoC,GAAInwC,KAAK+yC,KAC7C5C,EAAwC,IAAInwC,KAAKmzC,cAMjD,IALA,IAAIC,EAASpzC,KAAKkwC,MAAMC,GAEpBkD,EAAgB,GAChB7yC,EAAI,EAEyB,EAA1BR,KAAKkzC,YAAYvyC,QAENX,KAAKkzC,YAAY,GAEtB5zC,EAAgBqB,OApiBX,GAsiBZ0yC,EAAc1yC,QAviBA,MAiiBgB,CAUhC,IAAM2yC,EAAStzC,KAAKkzC,YAAYK,QAChCF,EACEA,EACA,OAEA7yC,EACA,IACA8yC,EAAOE,IACP,MAEAhzC,EACA,IACA8yC,EAAOG,GACP,KAEAjzC,EACA,IACA8yC,EAAOh0C,EACTkB,IASJ,OAHA4yC,GAAkBC,EAClBrzC,KAAK0zC,gBAAgBN,EAAQpzC,KAAKmzC,gBAE3B,EAEP,OAAO,GAUX7D,4BAAA,SAAeqE,EAAgBC,EAAmB5qC,GAEhDhJ,KAAKkzC,YAAYhwC,KAAK,CAAEswC,IAAKG,EAAQF,GAAIG,EAAWt0C,EAAG0J,IAInDhJ,KAAK2yC,OACP3yC,KAAKgzC,eAUD1D,6BAAR,SAAwBuE,EAAaC,GAArC,WAIuB,SAAfC,IACJ7rC,EAAK+qC,oBAAoBxhB,OAAOqiB,GAChC5rC,EAAK8qC,cAJPhzC,KAAKizC,oBAAoB/G,IAAI4H,GAE7B,IAOME,EAAmB9/B,WACvB6/B,EACA5gC,KAAKI,MArmBwB,OAgnB/BvT,KAAK0wC,OAAOmD,EARS,WAEnBlE,aAAaqE,GAGbD,OAWJzE,oBAAA,SAAOuE,EAAaI,GAApB,WAKI//B,WAAW,WACT,IAEE,IAAKhM,EAAK4nC,aACR,OAEF,IAAMoE,EAAYhsC,EAAK0qC,SAASF,IAAI3B,cAAc,UAClDmD,EAAU7kC,KAAO,kBACjB6kC,EAAUC,OAAQ,EAClBD,EAAUnC,IAAM8B,EAEhBK,EAAUE,OAAUF,EAAkBG,mBAAqB,WAEzD,IAAMC,EAAUJ,EAAkBlF,WAC7BsF,GAAqB,WAAXA,GAAkC,aAAXA,IAEpCJ,EAAUE,OAAUF,EAAkBG,mBAAqB,KACvDH,EAAUK,YACZL,EAAUK,WAAWnD,YAAY8C,GAEnCD,MAGJC,EAAUM,QAAU,WAClB5jC,GAAI,oCAAsCijC,GAC1C3rC,EAAK4nC,cAAe,EACpB5nC,EAAKgpC,SAEPhpC,EAAK0qC,SAASF,IAAI1wC,KAAKkwC,YAAYgC,GACnC,MAAOxyC,MAGRyR,KAAKI,MAAM,SAhTlB,YACEkhC,EACAC,EACOlG,EACA0B,GADAlwC,kBAAAwuC,EACAxuC,WAAAkwC,EAlCTlwC,yBAAsB,IAAI20C,IAG1B30C,iBAA8D,GAO9DA,mBAAgBmT,KAAKI,MAAsB,IAAhBJ,KAAK2J,UAIhC9c,mBAAe,EA2BXA,KAAKqwC,yBAA2Bh+B,KAChC/J,OAnZ2C,aAoZLtI,KAAKqwC,0BACvCoE,EACJnsC,OArZwC,UAsZLtI,KAAKqwC,0BACpCqE,EAGJ10C,KAAK4yC,SAAWtD,GAA2BsF,gBAG3C,IAAIC,EAAS,GAIX70C,KAAK4yC,SAASb,KACwC,gBAAtD/xC,KAAK4yC,SAASb,IAAIh+B,OAAO,EAAG,cAAcpT,UAG1Ck0C,EAAS,4BADatH,SAAS/1B,OACwB,gBAEzD,IAAMs9B,EAAiB,eAAiBD,EAAS,iBACjD,IACE70C,KAAK4yC,SAASF,IAAIqC,OAClB/0C,KAAK4yC,SAASF,IAAI5P,MAAMgS,GACxB90C,KAAK4yC,SAASF,IAAIxB,QAClB,MAAOxvC,GACPkP,GAAI,2BACAlP,EAAEyS,OACJvD,GAAIlP,EAAEyS,OAERvD,GAAIlP,IC/cL,IAAI8C,GAAc,GC2BzB,IAGIwwC,GAAgB,KACQ,oBAAjBC,aACTD,GAAgBC,aACc,oBAAdC,YAChBF,GAAgBE,WAYlB,QA6CiBC,kBAAf,SACEv8B,EACA03B,EACAC,GAEA,IAAMJ,EAAqC,CAC3CrtC,E3DlG4B,K2DkH5B,MAZsB,oBAAb2V,UACPA,SAAS+3B,OACgC,IAAzC/3B,SAAS+3B,KAAKp4B,QAAQpB,MAEtBm5B,EAAuB,E3DlGJ,K2DoGjBG,IACFH,EAAiC,EAAIG,GAEnCC,IACFJ,EAA4B,GAAII,GAE3B33B,EAAS05B,cAAcr7B,GAAWk5B,IAQ3CgF,kBAAA,SAAK5G,EAA8BC,GAAnC,WACExuC,KAAKwuC,aAAeA,EACpBxuC,KAAKuuC,UAAYA,EAEjBvuC,KAAK8uC,KAAK,2BAA6B9uC,KAAK4X,SAE5C5X,KAAK4vC,gBAAiB,EAEtBx9B,GAAkBrB,IAAI,8BAA8B,GAEpD,IACE,GAAItI,IAAa,CACf,IAAM2sC,EAASC,EAAc9wC,WAAa,YAAc,OAElD4lC,EAAmC,CACvCmL,QAAS,CACPC,aAAc,cAAgC/wC,OAAegxC,QAAQC,aAAYL,IAK/EM,EAAMF,QAAa,IACnBG,EAC+B,IAAnC31C,KAAK4X,QAAQQ,QAAQ,UACjBs9B,EAAiB,aAAKA,EAAiB,YACvCA,EAAgB,YAAKA,EAAgB,WAEvCC,IACFxL,EAAe,MAAI,CAAEyL,OAAQD,IAG/B31C,KAAK61C,OAAS,IAAIb,GAAch1C,KAAK4X,QAAS,GAAIuyB,QAElDnqC,KAAK61C,OAAS,IAAIb,GAAch1C,KAAK4X,SAEvC,MAAOlW,GACP1B,KAAK8uC,KAAK,kCACV,IAAMrrC,EAAQ/B,EAAEiD,SAAWjD,EAAEsH,KAK7B,OAJIvF,GACFzD,KAAK8uC,KAAKrrC,QAEZzD,KAAK+uC,YAIP/uC,KAAK61C,OAAOC,OAAS,WACnB5tC,EAAK4mC,KAAK,wBACV5mC,EAAK0nC,gBAAiB,GAGxB5vC,KAAK61C,OAAOE,QAAU,WACpB7tC,EAAK4mC,KAAK,0CACV5mC,EAAK2tC,OAAS,KACd3tC,EAAK6mC,aAGP/uC,KAAK61C,OAAOG,UAAY,SAAA3yC,GACtB6E,EAAK+tC,oBAAoB5yC,IAG3BrD,KAAK61C,OAAOrB,QAAU,SAAA9yC,GACpBwG,EAAK4mC,KAAK,yCAEV,IAAMrrC,EAAS/B,EAAUiD,SAAYjD,EAAUsH,KAC3CvF,GACFyE,EAAK4mC,KAAKrrC,GAEZyE,EAAK6mC,cAOToG,mBAAA,aAIOA,iBAAP,WACEA,GAAoBrE,gBAAiB,GAGhCqE,eAAP,WACE,IAAIe,GAAe,EACnB,GAAyB,oBAAd1tC,WAA6BA,UAAU2tC,UAAW,CAC3D,IACMC,EAAkB5tC,UAAU2tC,UAAUE,MADpB,kCAEpBD,GAA4C,EAAzBA,EAAgBz1C,QACjC21C,WAAWF,EAAgB,IAAM,MACnCF,GAAe,GAKrB,OACGA,GACiB,OAAlBlB,KACCG,GAAoBrE,gBAoBlBqE,oBAAP,WAGE,OACE/iC,GAAkBmkC,oBACsC,IAAxDnkC,GAAkBjB,IAAI,+BAI1BgkC,mCAAA,WACE/iC,GAAkBpB,OAAO,+BAGnBmkC,0BAAR,SAAqBnsC,GAEnB,GADAhJ,KAAKw2C,OAAOtzC,KAAK8F,GACbhJ,KAAKw2C,OAAO71C,SAAWX,KAAKy2C,YAAa,CAC3C,IAAMC,EAAW12C,KAAKw2C,OAAOjwC,KAAK,IAClCvG,KAAKw2C,OAAS,KACd,IAAMG,EAAW1sC,EAASysC,GAG1B12C,KAAKuuC,UAAUoI,KAQXxB,kCAAR,SAA6ByB,GAC3B52C,KAAKy2C,YAAcG,EACnB52C,KAAKw2C,OAAS,IASRrB,gCAAR,SAA2BnsC,GAIzB,GAHAvE,EAAuB,OAAhBzE,KAAKw2C,OAAiB,kCAGzBxtC,EAAKrI,QAAU,EAAG,CACpB,IAAMi2C,EAAanlC,OAAOzI,GAC1B,IAAK6tC,MAAMD,GAET,OADA52C,KAAK82C,qBAAqBF,GACnB,KAIX,OADA52C,KAAK82C,qBAAqB,GACnB9tC,GAOTmsC,iCAAA,SAAoB4B,GAClB,GAAoB,OAAhB/2C,KAAK61C,OAAT,CAGA,IAAM7sC,EAAO+tC,EAAW,KAMxB,GALA/2C,KAAKmyC,eAAiBnpC,EAAKrI,OAC3BX,KAAKwxC,OAAOC,iBAAiB,iBAAkBzoC,EAAKrI,QAEpDX,KAAKg3C,iBAEe,OAAhBh3C,KAAKw2C,OAEPx2C,KAAKi3C,aAAajuC,OACb,CAEL,IAAMkuC,EAAgBl3C,KAAKm3C,mBAAmBnuC,GACxB,OAAlBkuC,GACFl3C,KAAKi3C,aAAaC,MASxB/B,kBAAA,SAAKnsC,GACHhJ,KAAKg3C,iBAEL,IAAM1F,EAAUlnC,EAAUpB,GAC1BhJ,KAAKuxC,WAAaD,EAAQ3wC,OAC1BX,KAAKwxC,OAAOC,iBAAiB,aAAcH,EAAQ3wC,QAKnD,IAAMsR,EAAWH,GAAkBw/B,EAlTN,OAqTP,EAAlBr/B,EAAStR,QACXX,KAAKo3C,YAAYvwC,OAAOoL,EAAStR,SAInC,IAAK,IAAIH,EAAI,EAAGA,EAAIyR,EAAStR,OAAQH,IACnCR,KAAKo3C,YAAYnlC,EAASzR,KAItB20C,uBAAR,WACEn1C,KAAK4uC,WAAY,EACb5uC,KAAKq3C,iBACPC,cAAct3C,KAAKq3C,gBACnBr3C,KAAKq3C,eAAiB,MAGpBr3C,KAAK61C,SACP71C,KAAK61C,OAAO3E,QACZlxC,KAAK61C,OAAS,OAIVV,uBAAR,WACOn1C,KAAK4uC,YACR5uC,KAAK8uC,KAAK,+BACV9uC,KAAKqxC,YAGDrxC,KAAKwuC,eACPxuC,KAAKwuC,aAAaxuC,KAAK4vC,gBACvB5vC,KAAKwuC,aAAe,QAS1B2G,mBAAA,WACOn1C,KAAK4uC,YACR5uC,KAAK8uC,KAAK,6BACV9uC,KAAKqxC,cAQT8D,4BAAA,WAAA,WACEmC,cAAct3C,KAAKq3C,gBACnBr3C,KAAKq3C,eAAiBE,YAAY,WAE5BrvC,EAAK2tC,QACP3tC,EAAKkvC,YAAY,KAEnBlvC,EAAK8uC,kBAEJ7jC,KAAKI,MAhXyB,QAyX3B4hC,yBAAR,SAAoBtxC,GAIlB,IACE7D,KAAK61C,OAAO2B,KAAK3zC,GACjB,MAAOnC,GACP1B,KAAK8uC,KACH,0CACAptC,EAAEiD,SAAWjD,EAAEsH,KACf,uBAEFkL,WAAWlU,KAAK+uC,UAAUl+B,KAAK7Q,MAAO,KA/LnCm1C,gCAA+B,EAM/BA,kBAAiB,QApKxB,YACS/C,EACPx5B,EACA03B,EACAC,GAHOvwC,YAAAoyC,EAtBTpyC,oBAAgC,KAChCA,YAA0B,KAC1BA,iBAAc,EACdA,eAAY,EACZA,mBAAgB,EAuBdA,KAAK8uC,KAAOz9B,GAAWrR,KAAKoyC,QAC5BpyC,KAAKwxC,OAAShH,GAAa6H,cAAcz5B,GACzC5Y,KAAK4X,QAAUu9B,GAAoBsC,eACjC7+B,EACA03B,EACAC,GClEN,QAOE/wC,sBAAWk4C,yBAAX,WACE,MAAO,CAACpJ,GAAuB6G,qCAczBuC,6BAAR,SAAwB9+B,WAChB++B,EACJxC,IAAuBA,GAAiC,cACtDyC,EACFD,IAA0BxC,GAAoB0C,mBAYhD,GAVIj/B,EAAST,gBACNw/B,GACH3tC,GACE,mFAIJ4tC,GAAuB,GAGrBA,EACF53C,KAAK83C,YAAc,CAAC3C,QACf,CACL,IAAM4C,EAAc/3C,KAAK83C,YAAc,OACvC,IAAwB,IAAAluC,EAAAzG,EAAAu0C,GAAiBM,8CAAgB,CAApD,IAAMC,UACLA,GAAaA,EAAuB,eACtCF,EAAW70C,KAAK+0C,wGAUxBP,8BAAA,WACE,GAA8B,EAA1B13C,KAAK83C,YAAYn3C,OACnB,OAAOX,KAAK83C,YAAY,GAExB,MAAM,IAAIjzC,MAAM,4BAQpB6yC,8BAAA,WACE,OAA8B,EAA1B13C,KAAK83C,YAAYn3C,OACZX,KAAK83C,YAAY,GAEjB,UAxDX,YAAYl/B,GACV5Y,KAAKk4C,gBAAgBt/B,GCdzB,QAiFUu/B,oBAAR,WAAA,WACQC,EAAOp4C,KAAKq4C,kBAAkBC,mBACpCt4C,KAAKu4C,MAAQ,IAAIH,EACfp4C,KAAKw4C,mBACLx4C,KAAKy4C,eACL3wC,EACA9H,KAAKuwC,eAKPvwC,KAAK04C,0BAA4BN,EAAmC,8BAAK,EAEzE,IAAMO,EAAoB34C,KAAK44C,cAAc54C,KAAKu4C,OAC5CM,EAAmB74C,KAAK84C,iBAAiB94C,KAAKu4C,OACpDv4C,KAAK+4C,IAAM/4C,KAAKu4C,MAChBv4C,KAAKg5C,IAAMh5C,KAAKu4C,MAChBv4C,KAAKi5C,eAAiB,KACtBj5C,KAAKk5C,YAAa,EAQlBhlC,WAAW,WAEThM,EAAKqwC,OAASrwC,EAAKqwC,MAAMxD,KAAK4D,EAAmBE,IAChD1lC,KAAKI,MAAM,IAEd,IAAM4lC,EAAmBf,EAAqB,gBAAK,EAC5B,EAAnBe,IACFn5C,KAAKo5C,gBAAkBhlC,GAAsB,WAC3ClM,EAAKkxC,gBAAkB,KAClBlxC,EAAKgxC,aAENhxC,EAAKqwC,OA5GuB,OA6G5BrwC,EAAKqwC,MAAMpG,eAEXjqC,EAAK4mC,KACH,wDACE5mC,EAAKqwC,MAAMpG,cACX,wCAEJjqC,EAAKgxC,YAAa,EAClBhxC,EAAKqwC,MAAMc,yBAEXnxC,EAAKqwC,OAxHmB,MAyHxBrwC,EAAKqwC,MAAMhH,UAEXrpC,EAAK4mC,KACH,oDACE5mC,EAAKqwC,MAAMhH,UACX,uCAKJrpC,EAAK4mC,KAAK,+CACV5mC,EAAKgpC,WAIR/9B,KAAKI,MAAM4lC,MAQVhB,8BAAR,WACE,MAAO,KAAOn4C,KAAKmS,GAAK,IAAMnS,KAAKs5C,mBAG7BnB,8BAAR,SAAyBC,GAAzB,WACE,OAAO,SAAAmB,GACDnB,IAASlwC,EAAKqwC,MAChBrwC,EAAKsxC,kBAAkBD,GACdnB,IAASlwC,EAAK+wC,gBACvB/wC,EAAK4mC,KAAK,8BACV5mC,EAAKuxC,8BAELvxC,EAAK4mC,KAAK,+BAKRqJ,2BAAR,SAAsBC,GAAtB,WACE,OAAO,SAACzzC,OACFuD,EAAKwxC,SACHtB,IAASlwC,EAAK8wC,IAChB9wC,EAAKyxC,0BAA0Bh1C,GACtByzC,IAASlwC,EAAK+wC,eACvB/wC,EAAK0xC,4BAA4Bj1C,GAEjCuD,EAAK4mC,KAAK,gCAUlBqJ,yBAAA,SAAY0B,GAEV,IAAMC,EAAM,CAAEx5C,EAAG,IAAKhB,EAAGu6C,GACzB75C,KAAK+5C,UAAUD,IAGjB3B,kCAAA,WACMn4C,KAAK+4C,MAAQ/4C,KAAKi5C,gBAAkBj5C,KAAKg5C,MAAQh5C,KAAKi5C,iBACxDj5C,KAAK8uC,KACH,2CAA6C9uC,KAAKi5C,eAAe7G,QAEnEpyC,KAAKu4C,MAAQv4C,KAAKi5C,eAClBj5C,KAAKi5C,eAAiB,OAKlBd,iCAAR,SAA4B6B,GAC1B,GA5LiB,MA4LGA,EAAa,CAC/B,IAAMC,EAAMD,EAAwB,EAvLvB,MAwLTC,EACFj6C,KAAKk6C,6BA5LS,MA6LLD,GAETj6C,KAAK8uC,KAAK,wCACV9uC,KAAKi5C,eAAe/H,QAGlBlxC,KAAK+4C,MAAQ/4C,KAAKi5C,gBAClBj5C,KAAKg5C,MAAQh5C,KAAKi5C,gBAElBj5C,KAAKkxC,SApMM,MAsMJ+I,IACTj6C,KAAK8uC,KAAK,0BACV9uC,KAAKm6C,8BACLn6C,KAAKk6C,gCAKH/B,yCAAR,SAAoCiC,GAClC,IAAMC,EAAgBxoC,GAAW,IAAKuoC,GAChCpxC,EAAgB6I,GAAW,IAAKuoC,GACtC,GAAc,MAAVC,EACFr6C,KAAKs6C,oBAAoBtxC,OACpB,CAAA,GAAc,MAAVqxC,EAIT,MAAM,IAAIx1C,MAAM,2BAA6Bw1C,GAF7Cr6C,KAAKu6C,oBAAoBr3C,KAAK8F,KAM1BmvC,wCAAR,WACMn4C,KAAKm6C,6BAA+B,GACtCn6C,KAAK8uC,KAAK,oCACV9uC,KAAKk5C,YAAa,EAClBl5C,KAAKi5C,eAAeI,wBACpBr5C,KAAKw6C,wBAGLx6C,KAAK8uC,KAAK,8BACV9uC,KAAKi5C,eAAezB,KAAK,CAAEl3C,EAAG,IAAKhB,EAAG,CAAEgB,EAjOjC,IAiO0ChB,EAAG,QAIhD64C,iCAAR,WAEEn4C,KAAKi5C,eAAe7I,QAEpBpwC,KAAK8uC,KAAK,mCACV9uC,KAAKi5C,eAAezB,KAAK,CAAEl3C,EAAG,IAAKhB,EAAG,CAAEgB,EA5OzB,IA4OwChB,EAAG,MAI1DU,KAAK8uC,KAAK,kCACV9uC,KAAKu4C,MAAMf,KAAK,CAAEl3C,EAAG,IAAKhB,EAAG,CAAEgB,EAhPV,IAgP+BhB,EAAG,MACvDU,KAAK+4C,IAAM/4C,KAAKi5C,eAEhBj5C,KAAKy6C,wBAGCtC,uCAAR,SAAkCiC,GAEhC,IAAMC,EAAgBxoC,GAAW,IAAKuoC,GAChCpxC,EAAgB6I,GAAW,IAAKuoC,GACxB,MAAVC,EACFr6C,KAAK06C,WAAW1xC,GACG,MAAVqxC,GACTr6C,KAAK26C,eAAe3xC,IAIhBmvC,4BAAR,SAAuBxzC,GACrB3E,KAAK46C,qBAGL56C,KAAKquC,WAAW1pC,IAGVwzC,gCAAR,WACOn4C,KAAKk5C,aACRl5C,KAAK04C,4BACD14C,KAAK04C,2BAA6B,IACpC14C,KAAK8uC,KAAK,kCACV9uC,KAAKk5C,YAAa,EAClBl5C,KAAKu4C,MAAMc,2BAKTlB,wBAAR,SAAmB6B,GACjB,IAAMC,EAAcpoC,GA3RH,IA2R4BmoC,GAC7C,GA3RiB,MA2RGA,EAAa,CAC/B,IAAMa,EAAUb,EAAwB,EACxC,GApRe,MAoRXC,EACFj6C,KAAK86C,aACHD,QAOG,GAhSY,MAgSRZ,EAA0B,CACnCj6C,KAAK8uC,KAAK,qCACV9uC,KAAKg5C,IAAMh5C,KAAKi5C,eAChB,IAAK,IAAIz4C,EAAI,EAAGA,EAAIR,KAAKu6C,oBAAoB55C,SAAUH,EACrDR,KAAK26C,eAAe36C,KAAKu6C,oBAAoB/5C,IAE/CR,KAAKu6C,oBAAsB,GAC3Bv6C,KAAKy6C,2BA5SY,MA6SRR,EAGTj6C,KAAK+6C,sBAAsBF,GA/Sb,MAgTLZ,EAETj6C,KAAKg7C,SAASH,GAjTA,MAkTLZ,EACTx2C,GAAM,iBAAmBo3C,GAlTZ,MAmTJZ,GACTj6C,KAAK8uC,KAAK,wBACV9uC,KAAK46C,qBACL56C,KAAKi7C,iCAELx3C,GAAM,mCAAqCw2C,KAUzC9B,0BAAR,SAAqB+C,GAMnB,IAAMC,EAAYD,EAAUzH,GACtB2H,EAAUF,EAAUp4C,EACpBsU,EAAO8jC,EAAUG,EACvBr7C,KAAKs7C,UAAYJ,EAAU36C,EAC3BP,KAAKy4C,UAAU8C,WAAWnkC,OAEtBpX,KAAK05C,SACP15C,KAAKu4C,MAAMnI,QACXpwC,KAAKw7C,yBAAyBx7C,KAAKu4C,MAAO4C,G7DtXhB,M6DuXDC,GACvBpxC,GAAK,sCAGPhK,KAAKy7C,qBAIDtD,8BAAR,WACE,IAAMC,EAAOp4C,KAAKq4C,kBAAkBqD,mBAChCtD,GACFp4C,KAAK27C,cAAcvD,IAIfD,2BAAR,SAAsBC,GAAtB,WACEp4C,KAAKi5C,eAAiB,IAAIb,EACxBp4C,KAAKw4C,mBACLx4C,KAAKy4C,UACLz4C,KAAKs7C,WAIPt7C,KAAKm6C,4BACH/B,EAAmC,8BAAK,EAE1C,IAAM7J,EAAYvuC,KAAK44C,cAAc54C,KAAKi5C,gBACpCzK,EAAexuC,KAAK84C,iBAAiB94C,KAAKi5C,gBAChDj5C,KAAKi5C,eAAelE,KAAKxG,EAAWC,GAGpCp6B,GAAsB,WAChBlM,EAAK+wC,iBACP/wC,EAAK4mC,KAAK,gCACV5mC,EAAK+wC,eAAe/H,UAErB/9B,KAAKI,MA5YY,OA+Yd4kC,sBAAR,SAAiB/gC,GACfpX,KAAK8uC,KAAK,qCAAuC13B,GACjDpX,KAAKy4C,UAAU8C,WAAWnkC,OAGtBpX,KAAK05C,OACP15C,KAAKkxC,SAGLlxC,KAAK47C,oBACL57C,KAAK67C,WAID1D,sCAAR,SAAiCC,EAAiB+C,GAAlD,WACEn7C,KAAK8uC,KAAK,oCACV9uC,KAAKu4C,MAAQH,EACbp4C,KAAK05C,SAED15C,KAAK87C,WACP97C,KAAK87C,SAASX,EAAWn7C,KAAKs7C,WAC9Bt7C,KAAK87C,SAAW,MAKqB,IAAnC97C,KAAK04C,2BACP14C,KAAK8uC,KAAK,kCACV9uC,KAAKk5C,YAAa,GAElB9kC,GAAsB,WACpBlM,EAAK+yC,iCACJ9nC,KAAKI,MA3a8B,OA+alC4kC,2CAAR,WAEOn4C,KAAKk5C,gBAAcl5C,KAAK05C,SAC3B15C,KAAK8uC,KAAK,4BACV9uC,KAAK+5C,UAAU,CAAEz5C,EAAG,IAAKhB,EAAG,CAAEgB,EA7ZvB,IA6ZgChB,EAAG,QAItC64C,wCAAR,WACE,IAAMC,EAAOp4C,KAAKi5C,eAClBj5C,KAAKi5C,eAAiB,KAClBj5C,KAAK+4C,MAAQX,GAAQp4C,KAAKg5C,MAAQZ,GAEpCp4C,KAAKkxC,SAUDiH,+BAAR,SAA0BoB,GACxBv5C,KAAKu4C,MAAQ,KAIRgB,OAAiBv5C,KAAK05C,WAQhB15C,KAAK05C,QACd15C,KAAK8uC,KAAK,8BARV9uC,KAAK8uC,KAAK,+BAEN9uC,KAAKy4C,UAAU/gC,oBACjBtF,GAAkBpB,OAAO,QAAUhR,KAAKy4C,UAAUrhC,MAElDpX,KAAKy4C,UAAUphC,aAAerX,KAAKy4C,UAAUrhC,OAMjDpX,KAAKkxC,SAQCiH,mCAAR,SAA8BzP,GAC5B1oC,KAAK8uC,KAAK,0DAEN9uC,KAAK+7C,UACP/7C,KAAK+7C,QAAQrT,GACb1oC,KAAK+7C,QAAU,MAKjB/7C,KAAK0uC,cAAgB,KAErB1uC,KAAKkxC,SAGCiH,uBAAR,SAAkBnvC,GAChB,OAAIhJ,KAAK05C,OACP,KAAM,8BAEN15C,KAAK+4C,IAAIvB,KAAKxuC,IAOlBmvC,mBAAA,eACMn4C,KAAK05C,SACP15C,KAAK8uC,KAAK,gCACV9uC,KAAK05C,SAEL15C,KAAK47C,oBAED57C,KAAK0uC,gBACP1uC,KAAK0uC,gBACL1uC,KAAK0uC,cAAgB,QASnByJ,+BAAR,WACEn4C,KAAK8uC,KAAK,iCACN9uC,KAAKu4C,QACPv4C,KAAKu4C,MAAMrH,QACXlxC,KAAKu4C,MAAQ,MAGXv4C,KAAKi5C,iBACPj5C,KAAKi5C,eAAe/H,QACpBlxC,KAAKi5C,eAAiB,MAGpBj5C,KAAKo5C,kBACPzJ,aAAa3vC,KAAKo5C,iBAClBp5C,KAAKo5C,gBAAkB,WA/d3B,YACSjnC,EACCsmC,EACApK,EACAyN,EACApN,EACAqN,EACDxL,GANAvwC,QAAAmS,EACCnS,eAAAy4C,EACAz4C,gBAAAquC,EACAruC,cAAA87C,EACA97C,mBAAA0uC,EACA1uC,aAAA+7C,EACD/7C,mBAAAuwC,EAhCTvwC,qBAAkB,EAClBA,yBAAiC,GAWzBA,cAsBNA,KAAK8uC,KAAOz9B,GAAW,KAAOrR,KAAKmS,GAAK,KACxCnS,KAAKq4C,kBAAoB,IAAIX,GAAiBe,GAC9Cz4C,KAAK8uC,KAAK,sBACV9uC,KAAK67C,SCjFT,QA4BEG,iBAAA,SACElnC,EACA9L,EACA0S,EACAmL,KASFm1B,mBAAA,SACElnC,EACA9L,EACA0S,EACAmL,KAOFm1B,8BAAA,SAAiB1xC,KAOjB0xC,6BAAA,SACElnC,EACA9L,EACA0S,KAQFsgC,+BAAA,SACElnC,EACA9L,EACA0S,KAOFsgC,gCAAA,SACElnC,EACA4G,KAMFsgC,yBAAA,SAAY5Q,SAxFd,eCmBA,WAuC0CtrC,QAAAk8C,IAkF9BC,yBAAV,SACEh9B,EACAjd,EACAk6C,GAEA,IAAMC,IAAcn8C,KAAKo8C,eAEnBtC,EAAM,CAAEv2C,EAAG44C,EAAWtwC,EAAGoT,EAAQ1f,EAAGyC,GAC1ChC,KAAK8uC,KAAK1kC,EAAU0vC,IACpBr1C,EACEzE,KAAKq8C,WACL,0DAEFr8C,KAAKs8C,UAAUC,YAAYzC,GACvBoC,IACFl8C,KAAKw8C,eAAeL,GAAaD,IAOrCD,oBAAA,SACErxB,EACA6xB,EACA7X,EACAlpB,GAEA,IAAMsW,EAAUpH,EAAM2E,kBAChBza,EAAa8V,EAAM9T,KAAKrN,WAC9BzJ,KAAK8uC,KAAK,qBAAuBh6B,EAAa,IAAMkd,GAC/ChyB,KAAK08C,QAAQxrB,IAAIpc,IACpB9U,KAAK08C,QAAQ3rC,IAAI+D,EAAY,IAAIgd,KAEnCrtB,EACEmmB,EAAMC,iBAAiBqd,cACpBtd,EAAMC,iBAAiBkT,eAC1B,sDAEFt5B,GACGzE,KAAK08C,QAAQvrC,IAAI2D,GAAaoc,IAAIc,GACnC,gDAEF,IAAM2qB,EAAyB,CAC7BjhC,aACAwrB,OAAQuV,EACR7xB,QACAga,OAEF5kC,KAAK08C,QAAQvrC,IAAI2D,GAAa/D,IAAIihB,EAAS2qB,GAEvC38C,KAAKq8C,YACPr8C,KAAK48C,YAAYD,IAIbV,yBAAR,SAAoBU,GAApB,WACQ/xB,EAAQ+xB,EAAW/xB,MACnB9V,EAAa8V,EAAM9T,KAAKrN,WACxBuoB,EAAUpH,EAAM2E,kBACtBvvB,KAAK8uC,KAAK,aAAeh6B,EAAa,QAAUkd,GAChD,IAAM6qB,EAAgC,CAAWj9C,EAAGkV,GAKhD6nC,EAAW/X,MACbiY,EAAO,EAAIjyB,EAAMuE,cACjB0tB,EAAO,EAAIF,EAAW/X,KAGxBiY,EAAgB,EAAIF,EAAWzV,SAE/BlnC,KAAKu8C,YAVU,IAUUM,EAAK,SAACl4C,GAC7B,IAAMk2C,EAAmBl2C,EAAoB,EACvC4jC,EAAS5jC,EAAsB,EAGrCs3C,GAAqBa,sBAAsBjC,EAASjwB,IAGlD1iB,EAAKw0C,QAAQvrC,IAAI2D,IACjB5M,EAAKw0C,QAAQvrC,IAAI2D,GAAa3D,IAAI6gB,MAEV2qB,IACxBz0C,EAAK4mC,KAAK,kBAAmBnqC,GAEd,OAAX4jC,GACFrgC,EAAK60C,cAAcjoC,EAAYkd,GAG7B2qB,EAAWjhC,YACbihC,EAAWjhC,WAAW6sB,EAAQsS,OAMvBoB,yBAAf,SAAqCpB,EAAkBjwB,GACrD,GAAIiwB,GAA8B,iBAAZA,GAAwBjwC,EAASiwC,EAAS,KAAM,CAEpE,IAAMmC,EAAWlyC,EAAQ+vC,EAAgB,KACzC,GAAIl7C,MAAM+F,QAAQs3C,KAAcA,EAAS5kC,QAAQ,YAAa,CAC5D,IAAM6kC,EACJ,gBACAryB,EACGC,iBACAC,WACArhB,WACH,IACIyzC,EAAYtyB,EAAM9T,KAAKrN,WAC7BO,GACE,wGAC6CizC,SACxCC,wDASbjB,8BAAA,SAAiB3xC,GACftK,KAAKm9C,WAAa7yC,EAClBtK,KAAK8uC,KAAK,wBACN9uC,KAAKm9C,WACPn9C,KAAKo9C,UAIDp9C,KAAKq8C,YACPr8C,KAAKu8C,YAAY,SAAU,GAAI,cAInCv8C,KAAKq9C,uCAAuC/yC,IAGtC2xC,oDAAR,SAA+CqB,GAG7C,I3EpKI9yC,G2EoKqB8yC,GAAoC,KAAtBA,EAAW38C,Q3EnK3B,iBADnB6J,EAAiBH,E2EqKWizC,G3ErKG9yC,UACoB,IAApBA,EAAc,S2EqK/CxK,KAAK8uC,KACH,iEAEF9uC,KAAKu9C,mBA1Q4B,MAkRrCtB,qBAAA,WAAA,I3E9LEzxC,S2E+LA,GAAIxK,KAAKq8C,YAAcr8C,KAAKm9C,WAAY,CACtC,IAAMK,EAAQx9C,KAAKm9C,WACbM,G3EjMRjzC,EADcH,E2EkMqBmzC,G3EjMlBhzC,SAEkB,iBAAXA,GAAuBA,EAAO3K,eAAe,O2E+LzB,OAAS,QAC7C69C,EAAwC,CAAEC,KAAMH,GAC3B,OAAvBx9C,KAAK49C,cACPF,EAAoB,QAAI,EACe,iBAAvB19C,KAAK49C,gBACrBF,EAAqB,QAAI19C,KAAK49C,eAEhC59C,KAAKu8C,YACHkB,EACAC,EACA,SAACvyC,GACC,IAAMo9B,EAASp9B,EAAkB,EAC3BnC,EAAQmC,EAAgB,GAAgB,QAE1CjD,EAAKi1C,aAAeK,IACP,OAAXjV,EACFrgC,EAAK21C,uBAAyB,EAG9B31C,EAAK41C,eAAevV,EAAQv/B,QAWxCizC,sBAAA,SAASrxB,EAAcga,GACrB,IAAM9vB,EAAa8V,EAAM9T,KAAKrN,WACxBuoB,EAAUpH,EAAM2E,kBAEtBvvB,KAAK8uC,KAAK,uBAAyBh6B,EAAa,IAAMkd,GAEtDvtB,EACEmmB,EAAMC,iBAAiBqd,cACpBtd,EAAMC,iBAAiBkT,eAC1B,wDAEa/9B,KAAK+8C,cAAcjoC,EAAYkd,IAChChyB,KAAKq8C,YACjBr8C,KAAK+9C,cAAcjpC,EAAYkd,EAASpH,EAAMuE,cAAeyV,IAIzDqX,2BAAR,SACEnnC,EACAkd,EACAgsB,EACApZ,GAEA5kC,KAAK8uC,KAAK,eAAiBh6B,EAAa,QAAUkd,GAElD,IAAM6qB,EAAgC,CAAWj9C,EAAGkV,GAGhD8vB,IACFiY,EAAO,EAAImB,EACXnB,EAAO,EAAIjY,GAGb5kC,KAAKu8C,YAPU,IAOUM,IAM3BZ,6BAAA,SACEnnC,EACA9L,EACA0S,GAEI1b,KAAKq8C,WACPr8C,KAAKi+C,kBAAkB,IAAKnpC,EAAY9L,EAAM0S,GAE9C1b,KAAKk+C,0BAA0Bh7C,KAAK,CAClC4R,aACAmK,OAAQ,IACRjW,OACA0S,gBAQNugC,+BAAA,SACEnnC,EACA9L,EACA0S,GAEI1b,KAAKq8C,WACPr8C,KAAKi+C,kBAAkB,KAAMnpC,EAAY9L,EAAM0S,GAE/C1b,KAAKk+C,0BAA0Bh7C,KAAK,CAClC4R,aACAmK,OAAQ,KACRjW,OACA0S,gBAQNugC,gCAAA,SACEnnC,EACA4G,GAEI1b,KAAKq8C,WACPr8C,KAAKi+C,kBAAkB,KAAMnpC,EAAY,KAAM4G,GAE/C1b,KAAKk+C,0BAA0Bh7C,KAAK,CAClC4R,aACAmK,OAAQ,KACRjW,KAAM,KACN0S,gBAKEugC,+BAAR,SACEh9B,EACAnK,EACA9L,EACA0S,GAEA,IAAMyiC,EAAU,CAAWv+C,EAAGkV,EAAqBxV,EAAG0J,GACtDhJ,KAAK8uC,KAAK,gBAAkB7vB,EAAQk/B,GACpCn+C,KAAKu8C,YAAYt9B,EAAQk/B,EAAS,SAACC,GAC7B1iC,GACFxH,WAAW,WACTwH,EACE0iC,EAAuB,EACvBA,EAAuB,IAExBjrC,KAAKI,MAAM,OAQpB0oC,iBAAA,SACEnnC,EACA9L,EACA0S,EACAmL,GAEA7mB,KAAKq+C,YAAY,IAAKvpC,EAAY9L,EAAM0S,EAAYmL,IAMtDo1B,mBAAA,SACEnnC,EACA9L,EACA0S,EACAmL,GAEA7mB,KAAKq+C,YAAY,IAAKvpC,EAAY9L,EAAM0S,EAAYmL,IAGtDo1B,yBAAA,SACEh9B,EACAnK,EACA9L,EACA0S,EACAmL,GAEA,IAAMs3B,EAAoC,CAC/Bv+C,EAAGkV,EACHxV,EAAG0J,QAGDlB,IAAT+e,IACFs3B,EAAoB,EAAIt3B,GAI1B7mB,KAAKs+C,iBAAiBp7C,KAAK,CACzB+b,SACAk/B,UACAziC,eAGF1b,KAAKu+C,uBACL,IAAMv/B,EAAQhf,KAAKs+C,iBAAiB39C,OAAS,EAEzCX,KAAKq8C,WACPr8C,KAAKw+C,SAASx/B,GAEdhf,KAAK8uC,KAAK,kBAAoBh6B,IAI1BmnC,sBAAR,SAAiBj9B,GAAjB,WACQC,EAASjf,KAAKs+C,iBAAiBt/B,GAAOC,OACtCk/B,EAAUn+C,KAAKs+C,iBAAiBt/B,GAAOm/B,QACvCziC,EAAa1b,KAAKs+C,iBAAiBt/B,GAAOtD,WAChD1b,KAAKs+C,iBAAiBt/B,GAAOy/B,OAASz+C,KAAKq8C,WAE3Cr8C,KAAKu8C,YAAYt9B,EAAQk/B,EAAS,SAACx5C,GACjCuD,EAAK4mC,KAAK7vB,EAAS,YAAata,UAEzBuD,EAAKo2C,iBAAiBt/B,GAC7B9W,EAAKq2C,uBAG6B,IAA9Br2C,EAAKq2C,uBACPr2C,EAAKo2C,iBAAmB,IAGtB5iC,GACFA,EACE/W,EAAsB,EACtBA,EAAsB,MAS9Bs3C,yBAAA,SAAY7Q,GAAZ,WAEE,GAAIprC,KAAKq8C,WAAY,CACnB,IAAM8B,EAAU,CAAep6C,EAAGqnC,GAClCprC,KAAK8uC,KAAK,cAAeqP,GAEzBn+C,KAAKu8C,YAAsB,IAAK4B,EAAS,SAAAv8C,GAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,IAAM88C,EAAc98C,EAAqB,EACzCsG,EAAK4mC,KAAK,cAAe,wBAA0B4P,QAMnDzC,4BAAR,SAAuBt3C,GACrB,GAAI,MAAOA,EAAS,CAElB3E,KAAK8uC,KAAK,gBAAkB1kC,EAAUzF,IACtC,IAAMg6C,EAASh6C,EAAW,EACpBu3C,EAAal8C,KAAKw8C,eAAemC,GACnCzC,WACKl8C,KAAKw8C,eAAemC,GAC3BzC,EAAWv3C,EAAoB,QAE5B,CAAA,GAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhB3E,KAAK4+C,YAAYj6C,EAAW,EAAaA,EAAW,KAIhDs3C,yBAAR,SAAoBh9B,EAAgBjd,GAClChC,KAAK8uC,KAAK,sBAAuB7vB,EAAQjd,GAC1B,MAAXid,EACFjf,KAAK6+C,cACH78C,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEU,MAAXid,EACTjf,KAAK6+C,cACH78C,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEU,MAAXid,EACTjf,KAAK8+C,iBACH98C,EAAiB,EACjBA,EAAkB,GAEA,OAAXid,EACTjf,KAAK89C,eACH97C,EAAwB,EACxBA,EAA0B,GAER,OAAXid,EACTjf,KAAK++C,uBAAuB/8C,GAE5ByB,GACE,6CACE2G,EAAU6U,GACV,uCAKAg9B,sBAAR,SAAiBd,EAAmBG,GAClCt7C,KAAK8uC,KAAK,oBACV9uC,KAAKq8C,YAAa,EAClBr8C,KAAKg/C,gCAAiC,IAAIr3C,MAAOE,UACjD7H,KAAKi/C,iBAAiB9D,GACtBn7C,KAAKuwC,cAAgB+K,EACjBt7C,KAAKk/C,kBACPl/C,KAAKm/C,oBAEPn/C,KAAKo/C,gBACLp/C,KAAKk/C,kBAAmB,EACxBl/C,KAAKq/C,kBAAiB,IAGhBpD,8BAAR,SAAyB3nC,GAAzB,WACE7P,GACGzE,KAAKs8C,UACN,0DAGEt8C,KAAKs/C,2BACP3P,aAAa3vC,KAAKs/C,2BAMpBt/C,KAAKs/C,0BAA4BprC,WAAW,WAC1ChM,EAAKo3C,0BAA4B,KACjCp3C,EAAKq3C,wBAEJpsC,KAAKI,MAAMe,KAGR2nC,wBAAR,SAAmBza,GAGfA,IACCxhC,KAAKotC,UACNptC,KAAKw/C,kBAAoBx/C,KAAKu9C,qBAE9Bv9C,KAAK8uC,KAAK,2CACV9uC,KAAKw/C,gBA/mBiB,IAinBjBx/C,KAAKs8C,WACRt8C,KAAKy/C,iBAAiB,IAG1Bz/C,KAAKotC,SAAW5L,GAGVya,uBAAR,SAAkByD,GACZA,GACF1/C,KAAK8uC,KAAK,wBACV9uC,KAAKw/C,gBA3nBiB,IA4nBjBx/C,KAAKs8C,WACRt8C,KAAKy/C,iBAAiB,KAGxBz/C,KAAK8uC,KAAK,8CACN9uC,KAAKs8C,WACPt8C,KAAKs8C,UAAUpL,UAKb+K,mCAAR,WAWE,GAVAj8C,KAAK8uC,KAAK,4BACV9uC,KAAKq8C,YAAa,EAClBr8C,KAAKs8C,UAAY,KAGjBt8C,KAAK2/C,0BAGL3/C,KAAKw8C,eAAiB,GAElBx8C,KAAK4/C,mBAAoB,CACtB5/C,KAAKotC,SAICptC,KAAKg/C,iCAnpBgB,KAspB5B,IAAIr3C,MAAOE,UAAY7H,KAAKg/C,iCAE5Bh/C,KAAKw/C,gBA5pBa,KA8pBpBx/C,KAAKg/C,+BAAiC,OAVtCh/C,KAAK8uC,KAAK,8CACV9uC,KAAKw/C,gBAAkBx/C,KAAKu9C,mBAC5Bv9C,KAAK6/C,4BAA6B,IAAIl4C,MAAOE,WAW/C,IAAMi4C,GACJ,IAAIn4C,MAAOE,UAAY7H,KAAK6/C,2BAC1BE,EAAiB5sC,KAAK4D,IACxB,EACA/W,KAAKw/C,gBAAkBM,GAEzBC,EAAiB5sC,KAAK2J,SAAWijC,EAEjC//C,KAAK8uC,KAAK,0BAA4BiR,EAAiB,MACvD//C,KAAKy/C,iBAAiBM,GAGtB//C,KAAKw/C,gBAAkBrsC,KAAKG,IAC1BtT,KAAKu9C,mBA3qBsB,IA4qB3Bv9C,KAAKw/C,iBAGTx/C,KAAKq/C,kBAAiB,IAGhBpD,kCAAR,WACE,GAAIj8C,KAAK4/C,mBAAoB,CAC3B5/C,KAAK8uC,KAAK,+BACV9uC,KAAK6/C,4BAA6B,IAAIl4C,MAAOE,UAC7C7H,KAAKg/C,+BAAiC,KACtC,IAAMgB,EAAgBhgD,KAAK26C,eAAe9pC,KAAK7Q,MACzCigD,EAAUjgD,KAAK87C,SAASjrC,KAAK7Q,MAC7BkgD,EAAelgD,KAAKmgD,sBAAsBtvC,KAAK7Q,MAC/CogD,EAASpgD,KAAKmS,GAAK,IAAM8pC,GAAqBoE,oBAC9C/uB,EAAOtxB,KACPsgD,EAAgBtgD,KAAKuwC,cACvBgQ,GAAW,EACXC,EAAgC,KAC9BC,EAAU,WACVD,EACFA,EAAWtP,SAEXqP,GAAW,EACXL,MAWJlgD,KAAKs8C,UAAY,CACfpL,MAAOuP,EACPlE,YAVoB,SAASzC,GAC7Br1C,EACE+7C,EACA,0DAEFA,EAAWjE,YAAYzC,KAQzB,IAAMpQ,EAAe1pC,KAAK0gD,mBAC1B1gD,KAAK0gD,oBAAqB,EAG1B1gD,KAAK2gD,mBACF/W,SAASF,GACT5nC,KAAK,SAAAF,GACC2+C,EAgBH3vC,GAAI,0CAfJA,GAAI,8CACJ0gB,EAAK6rB,WAAav7C,GAAUA,EAAOg/C,YACnCJ,EAAa,IAAIrI,GACfiI,EACA9uB,EAAKmnB,UACLuH,EACAC,EACAC,EACc,SAAAxX,GACZ1+B,GAAK0+B,EAAS,KAAOpX,EAAKmnB,UAAUhvC,WAAa,KACjD6nB,EAAKuvB,UApuBgB,gBAsuBvBP,MAMLx+C,KAAK,KAAM,SAAA2B,GACV6tB,EAAKwd,KAAK,wBAA0BrrC,GAC/B88C,GAOHE,QAMVxE,uBAAA,SAAUvT,GACR93B,GAAI,uCAAyC83B,GAC7C1oC,KAAK8gD,kBAAkBpY,IAAU,EAC7B1oC,KAAKs8C,UACPt8C,KAAKs8C,UAAUpL,SAEXlxC,KAAKs/C,4BACP3P,aAAa3vC,KAAKs/C,2BAClBt/C,KAAKs/C,0BAA4B,MAE/Bt/C,KAAKq8C,YACPr8C,KAAKmgD,0BAKXlE,oBAAA,SAAOvT,GACL93B,GAAI,mCAAqC83B,UAClC1oC,KAAK8gD,kBAAkBpY,GAC1B39B,EAAQ/K,KAAK8gD,qBACf9gD,KAAKw/C,gBApxBiB,IAqxBjBx/C,KAAKs8C,WACRt8C,KAAKy/C,iBAAiB,KAKpBxD,8BAAR,SAAyBd,GACvB,IAAM3qB,EAAQ2qB,GAAY,IAAIxzC,MAAOE,UACrC7H,KAAK+gD,oBAAoB,CAAEC,iBAAkBxwB,KAGvCyrB,qCAAR,WACE,IAAK,IAAIz7C,EAAI,EAAGA,EAAIR,KAAKs+C,iBAAiB39C,OAAQH,IAAK,CACrD,IAAMygD,EAAMjhD,KAAKs+C,iBAAiB99C,GAC9BygD,GAAgB,MAAOA,EAAI9C,SAAW8C,EAAIxC,SACxCwC,EAAIvlC,YACNulC,EAAIvlC,WAAW,qBAGV1b,KAAKs+C,iBAAiB99C,GAC7BR,KAAKu+C,wBAKyB,IAA9Bv+C,KAAKu+C,uBACPv+C,KAAKs+C,iBAAmB,KAIpBrC,8BAAR,SAAyBnnC,EAAoB8V,GAE3C,IAAIoH,EAIFA,EAHGpH,EAGOA,EAAM5f,IAAI,SAAAk2C,GAAK,OAAAruC,GAAkBquC,KAAI36C,KAAK,KAF1C,UAIZ,IAAM46C,EAASnhD,KAAK+8C,cAAcjoC,EAAYkd,GAC1CmvB,GAAUA,EAAOzlC,YACnBylC,EAAOzlC,WAAW,sBAIdugC,2BAAR,SAAsBnnC,EAAoBkd,GACxC,IACImvB,EADEC,EAAuB,IAAI1sC,GAAKI,GAAYrL,WAElD,GAAIzJ,KAAK08C,QAAQxrB,IAAIkwB,GAAuB,CAC1C,IAAMp2C,EAAMhL,KAAK08C,QAAQvrC,IAAIiwC,GAC7BD,EAASn2C,EAAImG,IAAI6gB,GACjBhnB,EAAIymB,OAAOO,GACM,IAAbhnB,EAAIgmB,MACNhxB,KAAK08C,QAAQjrB,OAAO2vB,QAItBD,OAASr5C,EAEX,OAAOq5C,GAGDlF,4BAAR,SAAuBoF,EAAoBC,GACzC1wC,GAAI,uBAAyBywC,EAAa,IAAMC,GAChDthD,KAAKm9C,WAAa,KAClBn9C,KAAK0gD,oBAAqB,EAC1B1gD,KAAKs8C,UAAUpL,QACI,kBAAfmQ,GAAiD,sBAAfA,IAIpCrhD,KAAK69C,yBAn1B0B,GAo1B3B79C,KAAK69C,yBAEP79C,KAAKw/C,gBA51B0B,IAg2B/Bx/C,KAAK2gD,mBAAmBY,2BAKtBtF,oCAAR,SAA+Bj6C,GACzBhC,KAAKwhD,uBACPxhD,KAAKwhD,uBAAuBx/C,GAExB,QAASA,GACXoC,QAAQwM,IACN,aAAgB5O,EAAU,IAAasH,QAAQ,KAAM,kBAMrD2yC,2BAAR,uBAEEj8C,KAAKo9C,cAIL,IAAsB,IAAAqE,EAAAt+C,EAAAnD,KAAK08C,QAAQ/lB,wCAAU,CAAxC,IAAMmR,cACT,IAAyB,IAAA4Z,YAAAv+C,EAAA2kC,EAAQnR,yCAAU,CAAtC,IAAMgmB,UACT38C,KAAK48C,YAAYD,wMAIrB,IAAK,IAAIn8C,EAAI,EAAGA,EAAIR,KAAKs+C,iBAAiB39C,OAAQH,IAC5CR,KAAKs+C,iBAAiB99C,IACxBR,KAAKw+C,SAASh+C,GAIlB,KAAOR,KAAKk+C,0BAA0Bv9C,QAAQ,CAC5C,IAAMw9C,EAAUn+C,KAAKk+C,0BAA0B3K,QAC/CvzC,KAAKi+C,kBACHE,EAAQl/B,OACRk/B,EAAQrpC,WACRqpC,EAAQn1C,KACRm1C,EAAQziC,cAQNugC,+BAAR,WACE,IAAM7Q,EAAiC,GASvCA,EAAM,UAA4B5mC,GAAY8E,QAAQ,MAAO,MAAQ,EAEjEjB,IACF+iC,EAAM,qBAAuB,E9Ez2BV,iBAAd5iC,WAAmD,gBAAzBA,UAAmB,U8E22BlD4iC,EAAM,yBAA2B,GAEnCprC,KAAKyrC,YAAYL,IAGX6Q,8BAAR,WACE,IAAMyD,EAAShS,GAAciU,cAAcC,kBAC3C,OAAO72C,EAAQ/K,KAAK8gD,oBAAsBpB,GAz1B7BzD,+BAA8B,EAK9BA,qBAAoB,MAOnC,YACUxD,EACAoG,EAMAQ,EACA0B,EACAJ,EACA/C,GAXV,MAaEj1C,oBAEA,GAdQT,YAAAuwC,EACAvwC,gBAAA22C,EAMA32C,mBAAAm3C,EACAn3C,sBAAA64C,EACA74C,qBAAAy4C,EACAz4C,gBAAA01C,EA9DV11C,KAAK+zC,GAAqB4F,8BAClB35C,OAAOmJ,GAAW,KAAOnJ,EAAKiK,GAAK,KAEnCjK,oBAAmD,GAE1CA,UAGb,IAAI4pB,IACA5pB,mBAAqC,GACrCA,uBAAuB,EACvBA,4BAAmD,GACnDA,cAAa,EACbA,kBAtDkB,IAuDlBA,qBAtD0B,IAuD1BA,yBAAuD,KAC/DA,gBAA+B,KAEvBA,4BAA2C,KAE3CA,YAAoB,EAGpBA,iBAAwD,GACxDA,iBAAiB,EAEjBA,YAGG,KAEHA,aAA4B,KAC5BA,sBAAqB,EACrBA,yBAAyB,EAEzBA,oBAAmB,EACnBA,6BAA4C,KAC5CA,iCAAgD,KA6BlD01C,IAAkBn1C,IACpB,MAAM,IAAI5D,MACR,yFAGJqD,EAAKu3C,iBAAiB,GAEtBtS,GAAkBwU,cAAcvzB,GAAG,UAAWlmB,EAAK45C,WAAY55C,IAEpB,IAAvCuwC,EAAUrhC,KAAKgB,QAAQ,YACzBs1B,GAAciU,cAAcvzB,GAAG,SAAUlmB,EAAK65C,UAAW75C,KCnI/D,WAAwCpI,QAAAk8C,IACtCgG,yBAAA,SAAY5W,GACV,MAAM,IAAIvmC,MAAM,4BAoBXm9C,gBAAP,SAAoBp3B,EAAcga,GAChC,YAAY98B,IAAR88B,EACK,OAASA,GAEhBngC,EACEmmB,EAAMC,iBAAiBqd,YACvB,kDAEKtd,EAAM9T,KAAKrN,aAwBtBu4C,oBAAA,SACEp3B,EACA6xB,EACA7X,EACAlpB,GAJF,WAMQ5G,EAAa8V,EAAM9T,KAAKrN,WAC9BzJ,KAAK8uC,KACH,qBAAuBh6B,EAAa,IAAM8V,EAAM2E,mBAIlD,IAAM0yB,EAAWD,GAAmBE,aAAat3B,EAAOga,GAClDud,EAAa,GACnBniD,KAAKoiD,SAASH,GAAYE,EAE1B,IAAME,EAAwBz3B,EAC3BC,iBACAy3B,8BAEHtiD,KAAKuiD,aACHztC,EAAa,QACbutC,EACA,SAAC5+C,EAAO7B,GACN,IAAIoH,EAAOpH,EAEG,MAAV6B,IAEFA,EADAuF,EAAO,MAIK,OAAVvF,GACFyE,EAAK22C,cAAc/pC,EAAY9L,GAAmB,EAAO47B,GAGvD95B,EAAQ5C,EAAKk6C,SAAUH,KAAcE,GAUvCzmC,EARKjY,EAEgB,MAAVA,EACA,oBAEA,cAAgBA,EAJhB,KAOQ,SAO3Bu+C,sBAAA,SAASp3B,EAAcga,GACrB,IAAMqd,EAAWD,GAAmBE,aAAat3B,EAAOga,UACjD5kC,KAAKoiD,SAASH,IAIvBD,8BAAA,SAAiB13C,KAaT03C,0BAAR,SACEltC,EACAutC,EACAp6C,GAHF,wBAEEo6C,MAGAA,EAA8B,OAAI,SAElCriD,KAAK2gD,mBACF/W,UAA2B,GAC3B9nC,KAAK,SAAA0gD,GACJ,IAAMC,EAAYD,GAAiBA,EAAc5B,YAC7C6B,IACFJ,EAA4B,KAAII,GAGlC,IAAM5O,GACH3rC,EAAKuwC,UAAU5gC,OAAS,WAAa,WACtC3P,EAAKuwC,UAAUrhC,KACftC,EACA,OAEA5M,EAAKuwC,UAAU1gC,mBC1JG2qC,GAI1B,IADA,IAAM/qC,EAAS,cACHnO,EAAKjI,GACX5B,MAAM+F,QAAQnE,GAChBA,EAAMswB,QAAQ,SAAA8wB,GACZhrC,EAAOzU,KACL6R,mBAAmBvL,GAAO,IAAMuL,mBAAmB4tC,MAIvDhrC,EAAOzU,KAAK6R,mBAAmBvL,GAAO,IAAMuL,mBAAmBxT,SARxCuI,EAAAtK,OAAOwgC,QAAQ0iB,GAAf35C,WAAAA,KAAhB,IAAAa,oBAWX,OAAO+N,EAAOhX,OAAS,IAAMgX,EAAOpR,KAAK,KAAO,GD4IxCq8C,CAAYP,GAEdn6C,EAAK4mC,KAAK,4BAA8B+E,GACxC,IAAMgP,EAAM,IAAIC,eAChBD,EAAIxO,mBAAqB,WACvB,GAAIpsC,GAA+B,IAAnB46C,EAAI7T,WAAkB,CACpC9mC,EAAK4mC,KACH,qBAAuB+E,EAAM,qBAC7BgP,EAAIta,OACJ,YACAsa,EAAIE,cAEN,IAAI53C,EAAM,KACV,GAAkB,KAAd03C,EAAIta,QAAiBsa,EAAIta,OAAS,IAAK,CACzC,IACEp9B,EAAMlB,EAAS44C,EAAIE,cACnB,MAAOrhD,GACPsI,GACE,qCACE6pC,EACA,KACAgP,EAAIE,cAGV96C,EAAS,KAAMkD,QAGI,MAAf03C,EAAIta,QAAiC,MAAfsa,EAAIta,QAC5Bv+B,GACE,sCACE6pC,EACA,YACAgP,EAAIta,QAGVtgC,EAAS46C,EAAIta,QAEftgC,EAAW,OAIf46C,EAAI9N,KAAK,MAAOlB,GAAuB,GACvCgP,EAAIrL,cArJV,YACUiB,EACAoG,EAMA8B,GARV,MAUEh4C,2BATQT,YAAAuwC,EACAvwC,gBAAA22C,EAMA32C,qBAAAy4C,EA1CFz4C,OAAqCmJ,GAAW,WAQhDnJ,WAAoC,KEM9C,IAAM86C,GAAmB,qBAoIvBC,sBAAA,WACE,OACGjjD,KAAKy4C,UAAU5gC,OAAS,WAAa,WAAa7X,KAAKy4C,UAAUrhC,MAOtE6rC,kBAAA,WACE,OAAOjjD,KAAKy4C,UAAU1gC,WAMxBkrC,wBAAA,WACE,IAGMx3C,EAHazL,KAAKkjD,UAAUjuB,QAChC,IAAIvgB,GAAK,2BAEgB/F,OAAoB,EAC/C,OAAO,IAAIhH,MAAOE,UAAY4D,GAMhCw3C,kCAAA,WACE,OzChIFtsB,EAJAA,EyCoI4B,CACxBwkB,UAAWn7C,KAAKmjD,ezChIF,UAAIxsB,EAAkB,YAAK,IAAIhvB,MAAOE,UACjD8uB,EAPyB,IAChCA,GyC4IQssB,2BAAR,SACEnuC,EACA9L,EACAo6C,EACAxe,GAGA5kC,KAAKqjD,kBACL,IAAMvsC,EAAO,IAAIpC,GAAKI,GACtB9L,EAAOhJ,KAAKsjD,6BACRtjD,KAAKsjD,6BAA6BxuC,EAAY9L,GAC9CA,EACJ,IAAI2zB,EAAS,GACb,GAAIiI,EACF,GAAIwe,EAAS,CACX,IAAMG,EAAiBv4C,EACrBhC,EACA,SAACw6C,GAAiB,OAAArlC,GAAaqlC,KAEjC7mB,EAAS38B,KAAKyjD,gBAAgBC,sBAC5B5sC,EACAysC,EACA3e,OAEG,CACL,IAAM+e,EAAaxlC,GAAanV,GAChC2zB,EAAS38B,KAAKyjD,gBAAgBG,0BAC5B9sC,EACA6sC,EACA/e,QAGC,GAAIwe,EAAS,CAClB,IAAM/nB,EAAkBrwB,EACtBhC,EACA,SAACw6C,GAAiB,OAAArlC,GAAaqlC,KAEjC7mB,EAAS38B,KAAKyjD,gBAAgBI,iBAAiB/sC,EAAMukB,OAChD,CACL,IAAMnS,EAAO/K,GAAanV,GAC1B2zB,EAAS38B,KAAKyjD,gBAAgBK,qBAAqBhtC,EAAMoS,GAE3D,IAAI0M,EAAe9e,EACC,EAAhB6lB,EAAOh8B,SAGTi1B,EAAe51B,KAAK+jD,mBAAmBjtC,IAEzC9W,KAAKgkD,YAAYC,0BAA0BruB,EAAc+G,IAI3DsmB,kCAAA,SAAqBh7C,GACnBjI,KAAKsjD,6BAA+Br7C,GAG9Bg7C,8BAAR,SAAyBiB,GACvBlkD,KAAKmkD,YAAY,YAAaD,IACR,IAAlBA,GACFlkD,KAAKokD,0BAIDnB,iCAAR,SAA4BpiB,GAA5B,WACE9tB,GAAK8tB,EAAS,SAACr3B,EAAajI,GAC1B2G,EAAKi8C,YAAY36C,EAAKjI,MAIlB0hD,yBAAR,SAAoBnuC,EAAoBvT,GACtC,IAAMuV,EAAO,IAAIpC,GAAK,UAAYI,GAC5BuI,EAAUc,GAAa5c,GAC7BvB,KAAKkjD,UAAUmB,eAAevtC,EAAMuG,GACpC,IAAMsf,EAAS38B,KAAKskD,cAAcR,qBAAqBhtC,EAAMuG,GAC7Drd,KAAKgkD,YAAYC,0BAA0BntC,EAAM6lB,IAG3CsmB,6BAAR,WACE,OAAOjjD,KAAKukD,gBAGdtB,6BAAA,SACEnsC,EACA0tC,EACAn+B,EACA3K,GAJF,WAME1b,KAAK8uC,KAAK,MAAO,CACfh4B,KAAMA,EAAKrN,WACXlI,MAAOijD,EACPrrC,SAAUkN,IAKZ,IAAM0J,EAAe/vB,KAAKykD,uBACpBC,EAAoBvmC,GAAaqmC,EAAQn+B,GACzC6J,EAAWlwB,KAAKyjD,gBAAgB7zB,uBAAuB9Y,GACvDuG,EAAU4S,GACdy0B,EACAx0B,EACAH,GAGIwR,EAAUvhC,KAAK2kD,kBACfhoB,EAAS38B,KAAKyjD,gBAAgBmB,mBAClC9tC,EACAuG,EACAkkB,GACA,GAEFvhC,KAAKgkD,YAAY7X,YAAYxP,GAC7B38B,KAAKwrC,QAAQyV,IACXnqC,EAAKrN,WACLi7C,EAAkB/1C,KAAgB,GAClC,SAAC45B,EAAQmW,GACP,IAAMmG,EAAqB,OAAXtc,EACXsc,GACH76C,GAAK,UAAY8M,EAAO,YAAcyxB,GAGxC,IAAMuc,EAAc58C,EAAKu7C,gBAAgB7qB,aACvC2I,GACCsjB,GAEH38C,EAAK87C,YAAYC,0BAA0BntC,EAAMguC,GACjD58C,EAAK68C,uBAAuBrpC,EAAY6sB,EAAQmW,KAGpD,IAAM9oB,EAAe51B,KAAKglD,mBAAmBluC,GAC7C9W,KAAK+jD,mBAAmBnuB,GAExB51B,KAAKgkD,YAAYC,0BAA0BruB,EAAc,KAG3DqtB,oBAAA,SACEnsC,EACAmuC,EACAvpC,GAHF,WAKE1b,KAAK8uC,KAAK,SAAU,CAAEh4B,KAAMA,EAAKrN,WAAYlI,MAAO0jD,IAGpD,IAAIC,GAAQ,EACNn1B,EAAe/vB,KAAKykD,uBACpBppB,EAAyC,GAW/C,GAVAtoB,GAAKkyC,EAAiB,SAACE,EAAoBC,GACzCF,GAAQ,EACR7pB,EAAgB8pB,GAAcr1B,GAC5BhZ,EAAKT,MAAM8uC,GACXhnC,GAAainC,GACbl9C,EAAKu7C,gBACL1zB,KAICm1B,EAoCHt0C,GAAI,wDACJ5Q,KAAK+kD,uBAAuBrpC,EAAY,UArC9B,CACV,IAAM2pC,EAAUrlD,KAAK2kD,kBACfhoB,EAAS38B,KAAKyjD,gBAAgB6B,eAClCxuC,EACAukB,EACAgqB,GAEFrlD,KAAKgkD,YAAY7X,YAAYxP,GAC7B38B,KAAKwrC,QAAQ/S,MACX3hB,EAAKrN,WACLw7C,EACA,SAAC1c,EAAQmW,GACP,IAAMmG,EAAqB,OAAXtc,EACXsc,GACH76C,GAAK,aAAe8M,EAAO,YAAcyxB,GAG3C,IAAMuc,EAAc58C,EAAKu7C,gBAAgB7qB,aACvCysB,GACCR,GAEGjvB,EACiB,EAArBkvB,EAAYnkD,OAAauH,EAAK67C,mBAAmBjtC,GAAQA,EAC3D5O,EAAK87C,YAAYC,0BAA0BruB,EAAckvB,GACzD58C,EAAK68C,uBAAuBrpC,EAAY6sB,EAAQmW,KAIpD3rC,GAAKkyC,EAAiB,SAAC5Y,GACrB,IAAMzW,EAAe1tB,EAAK88C,mBAAmBluC,EAAKT,MAAMg2B,IACxDnkC,EAAK67C,mBAAmBnuB,KAI1B51B,KAAKgkD,YAAYC,0BAA0BntC,EAAM,MAU7CmsC,oCAAR,WAAA,WACEjjD,KAAK8uC,KAAK,sBAEV,IAAM/e,EAAe/vB,KAAKykD,uBACpBc,EAA2B,IAAIz0B,GACrC9wB,KAAK0uC,cAAc9c,YAAYld,GAAK8d,MAAO,SAAC1b,EAAMkG,GAChD,IAAMwoC,EAAW11B,GACfhZ,EACAkG,EACA9U,EAAKu7C,gBACL1zB,GAEFw1B,EAAyBl0B,SAASva,EAAM0uC,KAE1C,IAAI7oB,EAAkB,GAEtB4oB,EAAyB3zB,YAAYld,GAAK8d,MAAO,SAAC1b,EAAMoS,GACtDyT,EAASA,EAAOh5B,OACduE,EAAKu7C,gBAAgBK,qBAAqBhtC,EAAMoS,IAElD,IAAM0M,EAAe1tB,EAAK88C,mBAAmBluC,GAC7C5O,EAAK67C,mBAAmBnuB,KAG1B51B,KAAK0uC,cAAgB,IAAI5d,GACzB9wB,KAAKgkD,YAAYC,0BAA0BvvC,GAAK8d,MAAOmK,IAGzDsmB,gCAAA,SACEnsC,EACA4E,GAFF,WAIE1b,KAAKwrC,QAAQ3vB,mBAAmB/E,EAAKrN,WAAY,SAAC8+B,EAAQmW,GACzC,OAAXnW,GACFrgC,EAAKwmC,cAAcld,OAAO1a,GAE5B5O,EAAK68C,uBAAuBrpC,EAAY6sB,EAAQmW,MAIpDuE,6BAAA,SACEnsC,EACAvV,EACAma,GAHF,WAKQ2B,EAAUc,GAAa5c,GAC7BvB,KAAKwrC,QAAQia,gBACX3uC,EAAKrN,WACL4T,EAAQ1O,KAAgB,GACxB,SAAC45B,EAAQmW,GACQ,OAAXnW,GACFrgC,EAAKwmC,cAAcrd,SAASva,EAAMuG,GAEpCnV,EAAK68C,uBAAuBrpC,EAAY6sB,EAAQmW,MAKtDuE,yCAAA,SACEnsC,EACAvV,EACA4X,EACAuC,GAJF,WAMQ2B,EAAUc,GAAa5c,EAAO4X,GACpCnZ,KAAKwrC,QAAQia,gBACX3uC,EAAKrN,WACL4T,EAAQ1O,KAAgB,GACxB,SAAC45B,EAAQmW,GACQ,OAAXnW,GACFrgC,EAAKwmC,cAAcrd,SAASva,EAAMuG,GAEpCnV,EAAK68C,uBAAuBrpC,EAAY6sB,EAAQmW,MAKtDuE,gCAAA,SACEnsC,EACAmuC,EACAvpC,GAHF,WAKE,GAAI3Q,EAAQk6C,GAKV,OAJAr0C,GACE,4EAEF5Q,KAAK+kD,uBAAuBrpC,EAAY,MAI1C1b,KAAKwrC,QAAQka,kBACX5uC,EAAKrN,WACLw7C,EACA,SAAC1c,EAAQmW,GACQ,OAAXnW,GACFx1B,GAAKkyC,EAAiB,SAACzmC,EAAmBE,GACxC,IAAMC,EAAeR,GAAaO,GAClCxW,EAAKwmC,cAAcrd,SAASva,EAAKT,MAAMmI,GAAYG,KAGvDzW,EAAK68C,uBAAuBrpC,EAAY6sB,EAAQmW,MAKtDuE,sCAAA,SAAyBr4B,EAAcP,GACrC,IAAIsS,EAEFA,EAD4B,UAA1B/R,EAAM9T,KAAKvB,WACJvV,KAAKskD,cAAc3kB,qBAC1B/U,EACAP,GAGOrqB,KAAKyjD,gBAAgB9jB,qBAC5B/U,EACAP,GAGJrqB,KAAKgkD,YAAY2B,kBAAkB/6B,EAAM9T,KAAM6lB,IAGjDsmB,yCAAA,SACEr4B,EACAP,GAIA,IAAIsS,EAEFA,EAD4B,UAA1B/R,EAAM9T,KAAKvB,WACJvV,KAAKskD,cAAcnkB,wBAC1BvV,EACAP,GAGOrqB,KAAKyjD,gBAAgBtjB,wBAC5BvV,EACAP,GAGJrqB,KAAKgkD,YAAY2B,kBAAkB/6B,EAAM9T,KAAM6lB,IAGjDsmB,uBAAA,WACMjjD,KAAK4lD,uBACP5lD,KAAK4lD,sBAAsB/E,UAAUmC,KAIzCC,oBAAA,WACMjjD,KAAK4lD,uBACP5lD,KAAK4lD,sBAAsBC,OAAO7C,KAItCC,mBAAA,SAAM6C,GACJ,gBADIA,MACmB,oBAAZ1hD,QAAX,CAIA,IAAIgnC,EAKFA,EAJE0a,GACG9lD,KAAKqrC,iBACRrrC,KAAKqrC,eAAiB,IAAIR,GAAc7qC,KAAKwxC,SAEvCxxC,KAAKqrC,eAAel6B,OAEpBnR,KAAKwxC,OAAOrgC,MAGtB,IAAM40C,EAAcvmD,OAAOqK,KAAKuhC,GAAO4a,OACrC,SAACC,EAAeC,GACd,OAAA/yC,KAAK4D,IAAImvC,EAAavlD,OAAQslD,IAChC,GAGFlzC,GAAKq4B,EAAO,SAACH,EAAc1pC,GAGzB,IAFA,IAAI4kD,EAAalb,EAERzqC,EAAIyqC,EAAKtqC,OAAQH,EAAIulD,EAAc,EAAGvlD,IAC7C2lD,GAAc,IAEhB/hD,QAAQwM,IAAIu1C,EAAa5kD,OAI7B0hD,mCAAA,SAAsBmD,GACpBpmD,KAAKwxC,OAAOC,iBAAiB2U,GAC7BpmD,KAAKqmD,eAAeC,YAAYF,IAG1BnD,kBAAR,eAAa,aAAAl6C,mBAAAA,IAAAkI,kBACX,IAAIK,EAAS,GACTtR,KAAK4lD,wBACPt0C,EAAStR,KAAK4lD,sBAAsBzzC,GAAK,KAE3CvB,mBAAIU,GAAWL,KAGjBgyC,oCAAA,SACEh7C,EACAsgC,EACAmW,GAEIz2C,GACFgM,GAAe,WACb,GAAe,OAAXs0B,EACFtgC,EAAS,UACJ,CACL,IAAMS,GAAQ6/B,GAAU,SAASI,cAC7BhkC,EAAU+D,EACVg2C,IACF/5C,GAAW,KAAO+5C,GAGpB,IAAMj7C,EAAQ,IAAIoB,MAAMF,GAEvBlB,EAAciF,KAAOA,EACtBT,EAASxE,OAMjBjE,sBAAIyjD,6BAAJ,WACE,OAAOjjD,KAAKumD,aAAevmD,KAAKumD,WAAa,IAAIC,GAASxmD,4CAjjB5D,YACSy4C,EACPgO,EACOC,EACPC,GAJF,WACS3mD,eAAAy4C,EAEAz4C,SAAA0mD,EA5BT1mD,qBAAkB,EAKVA,oBAAuC,KACvCA,iBAAc,IAAI4rC,GAClB5rC,kBAAe,EAOfA,kCAEG,KAIHA,mBAAgB,IAAI8wB,GAG5B9wB,2BAAqD,KAQnD,IAAM4mD,EAAoB,IAAInd,GAAkBid,EAAKC,GAIrD,GAFA3mD,KAAKwxC,OAAShH,GAAa6H,cAAcoG,GAErCgO,GpEmiBC,IAZc,iBAAXn+C,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOUu+C,OACR,4FoEjiBA7mD,KAAKwrC,QAAU,IAAIwW,GACjBhiD,KAAKy4C,UACLz4C,KAAK6+C,cAAchuC,KAAK7Q,MACxB4mD,GAIF1yC,WAAWlU,KAAKq/C,iBAAiBxuC,KAAK7Q,MAAM,GAAO,OAC9C,CACL,IAAM8mD,EAAeJ,EAAIvc,QAAsC,6BAE/D,GAAI,MAAO2c,EAAuD,CAChE,GAA4B,iBAAjBA,EACT,MAAM,IAAIjiD,MACR,sEAGJ,IACEuF,EAAU08C,GACV,MAAOplD,GACP,MAAM,IAAImD,MAAM,kCAAoCnD,IAIxD1B,KAAK4lD,sBAAwB,IAAI3J,GAC/Bj8C,KAAKy4C,UACLz4C,KAAK6+C,cAAchuC,KAAK7Q,MACxBA,KAAKq/C,iBAAiBxuC,KAAK7Q,MAC3BA,KAAK+gD,oBAAoBlwC,KAAK7Q,MAC9B4mD,EACAE,GAGF9mD,KAAKwrC,QAAUxrC,KAAK4lD,sBAGtBgB,EAAkBG,uBAAuB,SAAAz8C,GACvCpC,EAAKsjC,QAAQwb,iBAAiB18C,KAKhCtK,KAAKqmD,eAAiB7b,GAAayc,oBACjCxO,EACA,WAAM,OAAA,IAAIvN,GAAchjC,EAAKspC,OAAQtpC,EAAKsjC,WAG5CxrC,KAAKknD,oBAGLlnD,KAAKkjD,UAAY,IAAI5Z,GACrBtpC,KAAKskD,cAAgB,IAAIrgB,GAAS,CAChC8C,eAAgB,SAACnc,EAAOga,EAAK6X,EAAe/gC,GAC1C,IAAIyrC,EAAsB,GACpBnqC,EAAO9U,EAAKg7C,UAAUjuB,QAAQrK,EAAM9T,MAY1C,OATKkG,EAAKjS,YACRo8C,EAAaj/C,EAAKo8C,cAAcR,qBAC9Bl5B,EAAM9T,KACNkG,GAEF9I,WAAW,WACTwH,EAAW,OACV,IAEEyrC,GAEThgB,cAAe,eAEjBnnC,KAAKmkD,YAAY,aAAa,GAE9BnkD,KAAKyjD,gBAAkB,IAAIxf,GAAS,CAClC8C,eAAgB,SAACnc,EAAOga,EAAK6X,EAAe/gC,GAM1C,OALAxT,EAAKsjC,QAAQ2V,OAAOv2B,EAAO6xB,EAAe7X,EAAK,SAAC2D,EAAQv/B,GACtD,IAAM2zB,EAASjhB,EAAW6sB,EAAQv/B,GAClCd,EAAK87C,YAAYC,0BAA0Br5B,EAAM9T,KAAM6lB,KAGlD,IAETwK,cAAe,SAACvc,EAAOga,GACrB18B,EAAKsjC,QAAQ4b,SAASx8B,EAAOga,MC5IrC,QA0CEyiB,0BAAA,WACE,OAAOrnD,KAAKsnD,YAMdD,wBAAA,WACE,OAAOrnD,KAAKunD,UAOdF,qBAAA,SAAQrqC,GACN,OACEhd,KAAK8pB,OAAO3M,QAAQnd,KAAKwnD,eAAgBxqC,IAAS,GAClDhd,KAAK8pB,OAAO3M,QAAQH,EAAMhd,KAAKynD,eAAiB,GAOpDJ,yBAAA,SACEn+B,EACA1f,EACA0pB,EACA0C,EACAluB,EACAmuB,GAKA,OAHK71B,KAAKu+B,QAAQ,IAAIxhB,GAAUvT,EAAK0pB,MACnCA,EAAWtN,GAAanH,YAEnBze,KAAK0nD,eAAe3oC,YACzBmK,EACA1f,EACA0pB,EACA0C,EACAluB,EACAmuB,IAOJwxB,4BAAA,SACE3xB,EACAW,EACAR,GAEIQ,EAAQrY,eAEVqY,EAAUzQ,GAAanH,YAEzB,IAAIoW,EAAWwB,EAAQD,UAAUp2B,KAAK8pB,QAEtC+K,EAAWA,EAASjW,eAAegH,GAAanH,YAChD,IAAMkpC,EAAO3nD,KAMb,OALAq2B,EAAQ5P,aAAazG,GAAgB,SAACxW,EAAKkV,GACpCipC,EAAKppB,QAAQ,IAAIxhB,GAAUvT,EAAKkV,MACnCmW,EAAWA,EAAShW,qBAAqBrV,EAAKoc,GAAanH,eAGxDze,KAAK0nD,eAAe3tB,eACzBrE,EACAb,EACAgB,IAOJwxB,4BAAA,SAAe3xB,EAAerP,GAE5B,OAAOqP,GAMT2xB,0BAAA,WACE,OAAO,GAMTA,8BAAA,WACE,OAAOrnD,KAAK0nD,gBAMdL,sBAAA,WACE,OAAOrnD,KAAK8pB,QAQCu9B,iBAAf,SAA6B1vC,GAC3B,GAAIA,EAAO4U,WAAY,CACrB,IAAMq7B,EAAYjwC,EAAOkV,oBACzB,OAAOlV,EAAOmT,WAAW+8B,SAASlwC,EAAO6U,qBAAsBo7B,GAE/D,OAAOjwC,EAAOmT,WAAWxD,WASd+/B,eAAf,SAA2B1vC,GACzB,GAAIA,EAAO8U,SAAU,CACnB,IAAMq7B,EAAUnwC,EAAOmV,kBACvB,OAAOnV,EAAOmT,WAAW+8B,SAASlwC,EAAO+U,mBAAoBo7B,GAE7D,OAAOnwC,EAAOmT,WAAWpD,eAzI7B,YAAY/P,GACV3X,KAAK0nD,eAAiB,IAAI/xB,GAAche,EAAOmT,YAC/C9qB,KAAK8pB,OAASnS,EAAOmT,WACrB9qB,KAAKsnD,WAAaD,GAAaU,cAAcpwC,GAC7C3X,KAAKunD,SAAWF,GAAaW,YAAYrwC,GClC7C,QA0CEswC,yBAAA,SACE/+B,EACA1f,EACA0pB,EACA0C,EACAluB,EACAmuB,GAKA,OAHK71B,KAAKkoD,cAAc3pB,QAAQ,IAAIxhB,GAAUvT,EAAK0pB,MACjDA,EAAWtN,GAAanH,YAEtByK,EAAKlD,kBAAkBxc,GAAKuW,OAAOmT,GAE9BhK,EACEA,EAAKc,cAAgBhqB,KAAKmoD,OAC5BnoD,KAAKkoD,cACTrtB,mBACA9b,YACCmK,EACA1f,EACA0pB,EACA0C,EACAluB,EACAmuB,GAGG71B,KAAKooD,sBACVl/B,EACA1f,EACA0pB,EACAxrB,EACAmuB,IAQNoyB,4BAAA,SACEvyB,EACAW,EACAR,GAEA,IAAIhB,EACJ,GAAIwB,EAAQrY,cAAgBqY,EAAQtrB,UAElC8pB,EAAWjP,GAAanH,WAAW2X,UAAUp2B,KAAK8pB,aAElD,GACgB,EAAd9pB,KAAKmoD,OAAa9xB,EAAQrM,eAC1BqM,EAAQP,UAAU91B,KAAK8pB,QACvB,CAEA+K,EAAWjP,GAAanH,WAAW2X,UAAUp2B,KAAK8pB,QAElD,IAAIjnB,SAEFA,EADE7C,KAAKqoD,SACKhyB,EAAyB5O,uBACnCznB,KAAKkoD,cAAcT,aACnBznD,KAAK8pB,QAGKuM,EAAyBhP,gBACnCrnB,KAAKkoD,cAAcV,eACnBxnD,KAAK8pB,QAIT,IADA,IAAIhJ,EAAQ,EACLje,EAASylD,WAAaxnC,EAAQ9gB,KAAKmoD,QAAQ,CAChD,IAAM1mD,EAAOoB,EAASoiB,UAStB,KAPIjlB,KAAKqoD,SAELroD,KAAK8pB,OAAO3M,QAAQnd,KAAKkoD,cAAcV,eAAgB/lD,IAAS,EAGhEzB,KAAK8pB,OAAO3M,QAAQ1b,EAAMzB,KAAKkoD,cAAcT,eAAiB,GAOhE,MAJA5yB,EAAWA,EAAShW,qBAAqBpd,EAAK8M,KAAM9M,EAAKub,MACzD8D,SAMC,CAIL+T,GAFAA,EAAWwB,EAAQD,UAAUp2B,KAAK8pB,SAEdlL,eAClBgH,GAAanH,YAEf,IAAI8I,SACAI,SACA5R,SAEJ,GADIlT,SACA7C,KAAKqoD,SAAU,CACjBxlD,EAAWgyB,EAAS0zB,mBAAmBvoD,KAAK8pB,QAC5CvC,EAAYvnB,KAAKkoD,cAAcT,aAC/B9/B,EAAU3nB,KAAKkoD,cAAcV,eAC7B,IAAMgB,EAAexoD,KAAK8pB,OAAO3E,aACjCpP,EAAM,SAAClK,EAActM,GAAiB,OAAAipD,EAAajpD,EAAGsM,SAEtDhJ,EAAWgyB,EAAS9P,YAAY/kB,KAAK8pB,QACrCvC,EAAYvnB,KAAKkoD,cAAcV,eAC/B7/B,EAAU3nB,KAAKkoD,cAAcT,aAC7B1xC,EAAM/V,KAAK8pB,OAAO3E,aAGhBrE,EAAQ,EAEZ,IAFA,IACI2nC,GAAiB,EACd5lD,EAASylD,WACR7mD,EAAOoB,EAASoiB,WACjBwjC,GAAkB1yC,EAAIwR,EAAW9lB,IAAS,IAE7CgnD,GAAiB,GAGjBA,GAAkB3nC,EAAQ9gB,KAAKmoD,QAAUpyC,EAAItU,EAAMkmB,IAAY,EAE/D7G,IAEA+T,EAAWA,EAAShW,qBAClBpd,EAAK8M,KACLqX,GAAanH,YAMvB,OAAOze,KAAKkoD,cACTrtB,mBACAd,eAAerE,EAASb,EAAUgB,IAMvCoyB,4BAAA,SAAevyB,EAAerP,GAE5B,OAAOqP,GAMTuyB,0BAAA,WACE,OAAO,GAMTA,8BAAA,WACE,OAAOjoD,KAAKkoD,cAAcrtB,oBAM5BotB,sBAAA,WACE,OAAOjoD,KAAK8pB,QAYNm+B,mCAAR,SACE/+B,EACA+H,EACA4B,EACAnrB,EACAghD,GAGA,IAAI3yC,EACJ,GAAI/V,KAAKqoD,SAAU,CACjB,IAAMM,EAAW3oD,KAAK8pB,OAAO3E,aAC7BpP,EAAM,SAAClK,EAActM,GAAiB,OAAAopD,EAASppD,EAAGsM,SAElDkK,EAAM/V,KAAK8pB,OAAO3E,aAEpB,IAAMmX,EAAgBpT,EACtBzkB,EAAO63B,EAActS,gBAAkBhqB,KAAKmoD,OAAQ,IACpD,IAAMS,EAAoB,IAAI7rC,GAAUkU,EAAU4B,GAC5Cg2B,EAAiB7oD,KAAKqoD,SACxB/rB,EAAcwsB,cAAc9oD,KAAK8pB,QAChCwS,EAAcysB,aAAa/oD,KAAK8pB,QAC/Bk/B,EAAUhpD,KAAKkoD,cAAc3pB,QAAQqqB,GAC3C,GAAItsB,EAAc7H,SAASxD,GAAW,CAOpC,IANA,IAAMg4B,EAAe3sB,EAActW,kBAAkBiL,GACjDyC,EAAYhsB,EAAOwhD,mBACrBlpD,KAAK8pB,OACL++B,EACA7oD,KAAKqoD,UAGQ,MAAb30B,IACCA,EAAUnlB,OAAS0iB,GAAYqL,EAAc7H,SAASf,EAAUnlB,QAKjEmlB,EAAYhsB,EAAOwhD,mBACjBlpD,KAAK8pB,OACL4J,EACA1zB,KAAKqoD,UAGT,IAAMc,EACS,MAAbz1B,EAAoB,EAAI3d,EAAI2d,EAAWk1B,GAGzC,GADEI,IAAYn2B,EAAU9nB,WAA4B,GAAfo+C,EAOnC,OALyB,MAArBT,GACFA,EAAkB1yB,iBAChBd,GAAOiB,mBAAmBlF,EAAU4B,EAAWo2B,IAG5C3sB,EAAczd,qBAAqBoS,EAAU4B,GAE3B,MAArB61B,GACFA,EAAkB1yB,iBAChBd,GAAOe,mBAAmBhF,EAAUg4B,IAGxC,IAAMvvB,EAAgB4C,EAAczd,qBAClCoS,EACArL,GAAanH,YAIf,OADe,MAAbiV,GAAqB1zB,KAAKkoD,cAAc3pB,QAAQ7K,IAEvB,MAArBg1B,GACFA,EAAkB1yB,iBAChBd,GAAOgB,iBAAiBxC,EAAUnlB,KAAMmlB,EAAU1W,OAG/C0c,EAAc7a,qBACnB6U,EAAUnlB,KACVmlB,EAAU1W,OAGL0c,EAGN,OAAI7G,EAAU9nB,WAGVi+C,GACqC,GAA1CjzC,EAAI8yC,EAAgBD,IACG,MAArBF,IACFA,EAAkB1yB,iBAChBd,GAAOe,mBAAmB4yB,EAAet6C,KAAMs6C,EAAe7rC,OAEhE0rC,EAAkB1yB,iBAChBd,GAAOgB,iBAAiBjF,EAAU4B,KAG/ByJ,EACJzd,qBAAqBoS,EAAU4B,GAC/BhU,qBAAqBgqC,EAAet6C,KAAMqX,GAAanH,aAbrDyK,OA1QX,YAAYvR,GACV3X,KAAKkoD,cAAgB,IAAIb,GAAa1vC,GACtC3X,KAAK8pB,OAASnS,EAAOmT,WACrB9qB,KAAKmoD,OAASxwC,EAAOyxC,WACrBppD,KAAKqoD,UAAY1wC,EAAO0xC,iBCrC5B,QA6DEC,sBAAA,WACE,OAAOtpD,KAAKupD,WAMdD,4BAAA,WACE,MAAuB,KAAnBtpD,KAAKwpD,UAKAxpD,KAAKupD,UAGVvpD,KAAKwpD,YAAcF,GAAYG,yBAAyBC,gBAS9DJ,gCAAA,WAEE,OADA7kD,EAAOzE,KAAKupD,UAAW,oCAChBvpD,KAAK2pD,kBAQdL,+BAAA,WAEE,OADA7kD,EAAOzE,KAAKupD,UAAW,oCACnBvpD,KAAK4pD,cACA5pD,KAAK6pD,gBAELt3C,IAOX+2C,oBAAA,WACE,OAAOtpD,KAAK8pD,SAOdR,8BAAA,WAEE,OADA7kD,EAAOzE,KAAK8pD,QAAS,kCACd9pD,KAAK+pD,gBAQdT,6BAAA,WAEE,OADA7kD,EAAOzE,KAAK8pD,QAAS,kCACjB9pD,KAAKgqD,YACAhqD,KAAKiqD,cAELz3C,IAOX82C,sBAAA,WACE,OAAOtpD,KAAKkqD,WAMdZ,8BAAA,WACE,OAAOtpD,KAAKkqD,WAAgC,KAAnBlqD,KAAKwpD,WAOhCF,sBAAA,WAEE,OADA7kD,EAAOzE,KAAKkqD,UAAW,oCAChBlqD,KAAKmoD,QAMdmB,sBAAA,WACE,OAAOtpD,KAAK8pB,QAONw/B,mBAAR,WACE,IAAMnoC,EAAO,IAAImoC,GAajB,OAZAnoC,EAAK+oC,UAAYlqD,KAAKkqD,UACtB/oC,EAAKgnC,OAASnoD,KAAKmoD,OACnBhnC,EAAKooC,UAAYvpD,KAAKupD,UACtBpoC,EAAKwoC,iBAAmB3pD,KAAK2pD,iBAC7BxoC,EAAKyoC,cAAgB5pD,KAAK4pD,cAC1BzoC,EAAK0oC,gBAAkB7pD,KAAK6pD,gBAC5B1oC,EAAK2oC,QAAU9pD,KAAK8pD,QACpB3oC,EAAK4oC,eAAiB/pD,KAAK+pD,eAC3B5oC,EAAK6oC,YAAchqD,KAAKgqD,YACxB7oC,EAAK8oC,cAAgBjqD,KAAKiqD,cAC1B9oC,EAAK2I,OAAS9pB,KAAK8pB,OACnB3I,EAAKqoC,UAAYxpD,KAAKwpD,UACfroC,GAOTmoC,mBAAA,SAAMa,GACJ,IAAMx7B,EAAY3uB,KAAKoqD,QAIvB,OAHAz7B,EAAUu7B,WAAY,EACtBv7B,EAAUw5B,OAASgC,EACnBx7B,EAAU66B,UAAY,GACf76B,GAOT26B,0BAAA,SAAaa,GACX,IAAMx7B,EAAY3uB,KAAKoqD,QAIvB,OAHAz7B,EAAUu7B,WAAY,EACtBv7B,EAAUw5B,OAASgC,EACnBx7B,EAAU66B,UAAYF,GAAYG,yBAAyBC,eACpD/6B,GAOT26B,yBAAA,SAAYa,GACV,IAAMx7B,EAAY3uB,KAAKoqD,QAIvB,OAHAz7B,EAAUu7B,WAAY,EACtBv7B,EAAUw5B,OAASgC,EACnBx7B,EAAU66B,UAAYF,GAAYG,yBAAyBY,gBACpD17B,GAQT26B,qBAAA,SAAQ5rC,EAAqBlU,GAC3B,IAAMmlB,EAAY3uB,KAAKoqD,QAavB,OAZAz7B,EAAU46B,WAAY,OACHzhD,IAAf4V,IACFA,EAAa,MAEfiR,EAAUg7B,iBAAmBjsC,EAClB,MAAPlU,GACFmlB,EAAUi7B,eAAgB,EAC1Bj7B,EAAUk7B,gBAAkBrgD,IAE5BmlB,EAAUi7B,eAAgB,EAC1Bj7B,EAAUk7B,gBAAkB,IAEvBl7B,GAQT26B,mBAAA,SAAM5rC,EAAqBlU,GACzB,IAAMmlB,EAAY3uB,KAAKoqD,QAavB,OAZAz7B,EAAUm7B,SAAU,OACDhiD,IAAf4V,IACFA,EAAa,MAEfiR,EAAUo7B,eAAiBrsC,OACf5V,IAAR0B,GACFmlB,EAAUq7B,aAAc,EACxBr7B,EAAUs7B,cAAgBzgD,IAE1BmlB,EAAUq7B,aAAc,EACxBr7B,EAAUs7B,cAAgB,IAErBt7B,GAOT26B,qBAAA,SAAQtqC,GACN,IAAM2P,EAAY3uB,KAAKoqD,QAEvB,OADAz7B,EAAU7E,OAAS9K,EACZ2P,GAMT26B,4BAAA,WACE,IAAMgB,EAA0BhB,GAAYG,yBACtC5+C,EAAgC,GAatC,GAZI7K,KAAKupD,YACP1+C,EAAIy/C,EAAwBC,mBAAqBvqD,KAAK2pD,iBAClD3pD,KAAK4pD,gBACP/+C,EAAIy/C,EAAwBE,kBAAoBxqD,KAAK6pD,kBAGrD7pD,KAAK8pD,UACPj/C,EAAIy/C,EAAwBG,iBAAmBzqD,KAAK+pD,eAChD/pD,KAAKgqD,cACPn/C,EAAIy/C,EAAwBI,gBAAkB1qD,KAAKiqD,gBAGnDjqD,KAAKkqD,UAAW,CAClBr/C,EAAIy/C,EAAwBK,OAAS3qD,KAAKmoD,OAC1C,IAAIyC,EAAW5qD,KAAKwpD,UACH,KAAboB,IAEAA,EADE5qD,KAAKqpD,iBACIiB,EAAwBZ,eAExBY,EAAwBD,iBAGvCx/C,EAAIy/C,EAAwBO,WAAaD,EAM3C,OAHI5qD,KAAK8pB,SAAW9J,KAClBnV,EAAIy/C,EAAwBQ,OAAS9qD,KAAK8pB,OAAOrgB,YAE5CoB,GAMTy+C,0BAAA,WACE,QAAStpD,KAAKupD,WAAavpD,KAAK8pD,SAAW9pD,KAAKkqD,YAMlDZ,uBAAA,WACE,OAAOtpD,KAAK+9B,gBAAkB/9B,KAAK8pB,SAAW9J,IAMhDspC,2BAAA,WACE,OAAItpD,KAAK+9B,eACA,IAAIpI,GAAc31B,KAAK8qB,YAEvB,IADE9qB,KAAK+sB,WACHk7B,GAEAZ,IAFcrnD,OAW7BspD,yCAAA,WACE,IAOI16B,EAPEm8B,EAAiBzB,GAAY0B,sBAC7BC,EAAuC,GAE7C,OAAIjrD,KAAKkoC,cAMPtZ,EADE5uB,KAAK8pB,SAAW9J,GACR+qC,EAAe/qC,eAChBhgB,KAAK8pB,SAAWhB,GACfiiC,EAAejiC,YAChB9oB,KAAK8pB,SAAWlM,GACfmtC,EAAentC,WAEzBnZ,EAAOzE,KAAK8pB,kBAAkBb,GAAW,4BAC/BjpB,KAAK8pB,OAAOrgB,YAExBwhD,EAAGF,EAAeG,UAAY9gD,EAAUwkB,GAEpC5uB,KAAKupD,YACP0B,EAAGF,EAAeI,UAAY/gD,EAAUpK,KAAK2pD,kBACzC3pD,KAAK4pD,gBACPqB,EAAGF,EAAeI,WAAa,IAAM/gD,EAAUpK,KAAK6pD,mBAIpD7pD,KAAK8pD,UACPmB,EAAGF,EAAeK,QAAUhhD,EAAUpK,KAAK+pD,gBACvC/pD,KAAKgqD,cACPiB,EAAGF,EAAeK,SAAW,IAAMhhD,EAAUpK,KAAKiqD,iBAIlDjqD,KAAKkqD,YACHlqD,KAAKqpD,iBACP4B,EAAGF,EAAeM,gBAAkBrrD,KAAKmoD,OAEzC8C,EAAGF,EAAeO,eAAiBtrD,KAAKmoD,SAlCnC8C,GAxUa3B,4BAA2B,CACjDiB,kBAAmB,KACnBC,iBAAkB,KAClBC,gBAAiB,KACjBC,eAAgB,KAChBC,MAAO,IACPE,UAAW,KACXnB,eAAgB,IAChBW,gBAAiB,IACjBS,MAAO,KASexB,yBAAwB,CAC9C4B,SAAU,UACVlrC,eAAgB,YAChB8I,YAAa,SACblL,UAAW,OACXutC,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAQDhC,WAAU,IAAIA,OAxDhC,cACUtpD,gBAAY,EACZA,gBAAY,EACZA,oBAAgB,EAChBA,cAAU,EACVA,kBAAc,EAEdA,YAAS,EACTA,eAAY,GACZA,sBAAmC,KACnCA,qBAAkB,GAClBA,oBAAiC,KACjCA,mBAAgB,GAEhBA,YAASggB,cCJYlgB,QAAAssB,IA2B7Bm/B,oBAAA,WAGE,OAFA9+C,EAAiB,gBAAiB,EAAG,EAAG/L,UAAUC,QAE9CX,KAAK8W,KAAK/L,UACL,KAEA/K,KAAK8W,KAAK4C,WAQrB6xC,mBAAA,SAAMz2C,GnEuU8B,IACpCpI,EACAM,EACA8H,EACA7H,EmE/TE,OAXAR,EAAiB,kBAAmB,EAAG,EAAG/L,UAAUC,QAC1B,iBAAfmU,EACTA,EAAajO,OAAOiO,GACTA,aAAsBJ,KACJ,OAAzB1U,KAAK8W,KAAKvB,YnEmUlB7I,EmElU6B,kBnEqU7BO,IAFAD,EmEnUgD,GnEyU9C8H,GALFA,EmEpUmDA,InEyUpCA,EAAWxL,QAAQ,mBAAoB,KAGtD4Q,GAAmBxN,EAAQM,EAAgB8H,EAAY7H,ImE1UjDiN,GAAmB,kBAAmB,EAAGpF,GAAY,IAIlD,IAAIy2C,GAAUvrD,KAAKmtB,KAAMntB,KAAK8W,KAAKT,MAAMvB,KAIlDy2C,uBAAA,WACE9+C,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QAErD,IAAM6qD,EAAaxrD,KAAK8W,KAAKqkB,SAC7B,OAAsB,OAAfqwB,EAAsB,KAAO,IAAID,GAAUvrD,KAAKmtB,KAAMq+B,IAI/DD,qBAAA,WACE9+C,EAAiB,iBAAkB,EAAG,EAAG/L,UAAUC,QAGnD,IADA,IAAIwpB,EAAiBnqB,KACM,OAApBmqB,EAAIC,aACTD,EAAMA,EAAIC,YAEZ,OAAOD,GAITohC,0BAAA,WACE,OAAOvrD,KAAKmtB,KAAKs+B,UAQnBF,iBAAA,SACE/G,EACA9oC,GAEAjP,EAAiB,gBAAiB,EAAG,EAAG/L,UAAUC,QAClDwZ,GAAqB,gBAAiBna,KAAK8W,MAC3CsC,GAAwB,gBAAiB,EAAGorC,EAAQxkD,KAAK8W,MAAM,GAC/D3J,EAAiB,gBAAiB,EAAGuO,GAAY,GAEjD,IAAMC,EAAW,IAAI3T,EAOrB,OANAhI,KAAKmtB,KAAKu+B,gBACR1rD,KAAK8W,KACL0tC,EACc,KACd7oC,EAASG,aAAaJ,IAEjBC,EAASxT,SAQlBojD,oBAAA,SACEtvC,EACAP,GAKA,GAHAjP,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QACrDwZ,GAAqB,mBAAoBna,KAAK8W,MAE1CnX,MAAM+F,QAAQuW,GAAgB,CAEhC,IADA,IAAMC,EAA6C,GAC1C1b,EAAI,EAAGA,EAAIyb,EAActb,SAAUH,EAC1C0b,EAAiB,GAAK1b,GAAKyb,EAAczb,GAE3Cyb,EAAgBC,EAChBlS,GACE,wMAMJuP,GACE,mBACA,EACA0C,EACAjc,KAAK8W,MACL,GAEF3J,EAAiB,mBAAoB,EAAGuO,GAAY,GACpD,IAAMC,EAAW,IAAI3T,EAMrB,OALAhI,KAAKmtB,KAAK9gB,OACRrM,KAAK8W,KACLmF,EACAN,EAASG,aAAaJ,IAEjBC,EAASxT,SASlBojD,6BAAA,SACE/G,EACAn+B,EACA3K,GAcA,GAZAjP,EAAiB,4BAA6B,EAAG,EAAG/L,UAAUC,QAC9DwZ,GAAqB,4BAA6Bna,KAAK8W,MACvDsC,GACE,4BACA,EACAorC,EACAxkD,KAAK8W,MACL,GAEFgD,GAAiB,4BAA6B,EAAGuM,GAAa,GAC9DlZ,EAAiB,4BAA6B,EAAGuO,GAAY,GAEvC,YAAlB1b,KAAK+pB,UAA4C,UAAlB/pB,KAAK+pB,SACtC,KAAM,qCACJ/pB,KAAK+pB,SACL,0BAGJ,IAAMpO,EAAW,IAAI3T,EAOrB,OANAhI,KAAKmtB,KAAKu+B,gBACR1rD,KAAK8W,KACL0tC,EACAn+B,EACA1K,EAASG,aAAaJ,IAEjBC,EAASxT,SAOlBojD,oBAAA,SAAO7vC,GAKL,OAJAjP,EAAiB,mBAAoB,EAAG,EAAG/L,UAAUC,QACrDwZ,GAAqB,mBAAoBna,KAAK8W,MAC9C3J,EAAiB,mBAAoB,EAAGuO,GAAY,GAE7C1b,KAAK+Q,IAAI,KAAM2K,IASxB6vC,yBAAA,SACEI,EACAjwC,EACAkwC,GAUA,GARAn/C,EAAiB,wBAAyB,EAAG,EAAG/L,UAAUC,QAC1DwZ,GAAqB,wBAAyBna,KAAK8W,MACnD3J,EAAiB,wBAAyB,EAAGw+C,GAAmB,GAChEx+C,EAAiB,wBAAyB,EAAGuO,GAAY,GnEwN9B,SAC7BhP,EACAM,EACA6+C,EACA5+C,GAEA,KAAIA,QAAqBnF,IAAT+jD,IAGI,kBAATA,EACT,MAAM,IAAIhnD,MACRyU,EAAe5M,EAAQM,EAAgBC,GAAY,sBmEhOrD6+C,CAAgB,wBAAyB,EAAGF,GAAc,GAEpC,YAAlB5rD,KAAK+pB,UAA4C,UAAlB/pB,KAAK+pB,SACtC,KAAM,iCACJ/pB,KAAK+pB,SACL,+BAGiBjiB,IAAjB8jD,IACFA,GAAe,GAGjB,IAAMjwC,EAAW,IAAI3T,EA0BrB,MAzB0B,mBAAf0T,GACTC,EAASxT,QAAQC,MAAM,cAiBzBpI,KAAKmtB,KAAK4+B,iBACR/rD,KAAK8W,KACL60C,EAhBsB,SACtBloD,EACA4Y,EACAC,GAEI7Y,EACFkY,EAASta,OAAOoC,GAEhBkY,EAASva,QAAQ,IAAIgb,GAAkBC,EAAWC,IAE1B,mBAAfZ,GACTA,EAAWjY,EAAO4Y,EAAWC,IAO/BsvC,GAGKjwC,EAASxT,SAQlBojD,yBAAA,SACEpyC,EACAuC,GAEAjP,EAAiB,wBAAyB,EAAG,EAAG/L,UAAUC,QAC1DwZ,GAAqB,wBAAyBna,KAAK8W,MACnDgD,GAAiB,wBAAyB,EAAGX,GAAU,GACvDhM,EAAiB,wBAAyB,EAAGuO,GAAY,GAEzD,IAAMC,EAAW,IAAI3T,EAOrB,OANAhI,KAAKmtB,KAAKu+B,gBACR1rD,KAAK8W,KAAKT,MAAM,aAChB8C,EACA,KACAwC,EAASG,aAAaJ,IAEjBC,EAASxT,SAQlBojD,kBAAA,SAAKhqD,EAAiBma,GACpBjP,EAAiB,iBAAkB,EAAG,EAAG/L,UAAUC,QACnDwZ,GAAqB,iBAAkBna,KAAK8W,MAC5CsC,GAAwB,iBAAkB,EAAG7X,EAAOvB,KAAK8W,MAAM,GAC/D3J,EAAiB,iBAAkB,EAAGuO,GAAY,GAElD,IAWIvT,EAXEgG,EAAMnO,KAAKmtB,KAAKg2B,aAChB50C,EAAOoO,GAAWxO,GAOlB69C,EAAmBhsD,KAAKqW,MAAM9H,GAC9B09C,EAAUjsD,KAAKqW,MAAM9H,GAgB3B,OAZEpG,EADW,MAAT5G,EACQyqD,EAAiBj7C,IAAIxP,EAAOma,GAAY5Z,KAAK,WAAM,OAAAmqD,IAEnD9qD,QAAQC,QAAQ6qD,GAG5BD,EAAiBlqD,KAAOqG,EAAQrG,KAAK+O,KAAK1I,GAC1C6jD,EAAiB5jD,MAAQD,EAAQrG,KAAK+O,KAAK1I,OAASL,GAE1B,mBAAf4T,GACTvT,EAAQC,MAAM,cAGT4jD,GAMTT,0BAAA,WAEE,OADApxC,GAAqB,yBAA0Bna,KAAK8W,MAC7C,IAAI2E,GAAazb,KAAKmtB,KAAMntB,KAAK8W,OAG1CtX,sBAAI+rD,6BAAJ,WACE,OAAOvrD,KAAKksD,gDAGd1sD,sBAAI+rD,wBAAJ,WACE,OAAOvrD,KAAK+pB,0CAGdvqB,sBAAI+rD,2BAAJ,WACE,OAAOvrD,KAAKoqB,6CAGd5qB,sBAAI+rD,yBAAJ,WACE,OAAOvrD,KAAKmsD,+CApUd,YAAYh/B,EAAYrW,GACtB,KAAMqW,aAAgB81B,IACpB,MAAM,IAAIp+C,MACR,oEAKJ8D,aAAMwkB,EAAMrW,EAAMwyC,GAAY8C,SAAS,SAsU3ChgC,GAAMZ,uBAAyB+/B,GAC/BlsB,GAAU7T,uBAAyB+/B,GClXnC,ICgBYc,GAAAA,MDhBZ,WAGErsD,cAA4C,GAC5CA,gBAAa,EACbA,WAAkB,UA2BlBssD,qBAAA,SAAQC,GAKN,IAHA,IAAIz1C,EAAOy1C,aAAmB73C,GAAO63C,EAAU,IAAI73C,GAAK63C,GACpDl2C,EAAQrW,KACVyB,EAAOqV,EAAKvB,WACE,OAAT9T,GAEL4U,EAAQ,IAAIi2C,GAAK7qD,EAAM4U,EADLvL,EAAQuL,EAAMmT,MAAMuH,SAAUtvB,IAAS,IAAI+qD,IAG7D/qD,GADAqV,EAAOA,EAAKpB,YACAH,WAGd,OAAOc,GAQTi2C,sBAAA,WACE,OAAOtsD,KAAKwpB,MAAMjoB,OAQpB+qD,sBAAA,SAAS/qD,GACPkD,OAAwB,IAAVlD,EAAuB,iCACrCvB,KAAKwpB,MAAMjoB,MAAQA,EACnBvB,KAAKysD,kBAMPH,mBAAA,WACEtsD,KAAKwpB,MAAMjoB,MAAQ,KACnBvB,KAAKwpB,MAAMuH,SAAW,GACtB/wB,KAAKwpB,MAAMkjC,WAAa,EACxB1sD,KAAKysD,kBAMPH,yBAAA,WACE,OAA+B,EAAxBtsD,KAAKwpB,MAAMkjC,YAMpBJ,qBAAA,WACE,OAA2B,OAApBtsD,KAAKof,aAAwBpf,KAAK2sD,eAQ3CL,0BAAA,SAAartC,GAAb,WACElM,GAAK/S,KAAKwpB,MAAMuH,SAAU,SAAC1a,EAAeyN,GACxC7E,EAAO,IAAIqtC,GAAQj2C,EAAOnO,EAAM4b,OAapCwoC,+BAAA,SACErtC,EACA2tC,EACAC,GAEID,IAAgBC,GAClB5tC,EAAOjf,MAGTA,KAAKymB,aAAa,SAAApQ,GAChBA,EAAMy2C,kBAAkB7tC,GAAyB,EAAM4tC,KAGrDD,GAAeC,GACjB5tC,EAAOjf,OAYXssD,6BAAA,SACErtC,EACA2tC,GAGA,IADA,IAAI5vC,EAAO4vC,EAAc5sD,KAAOA,KAAKm7B,SACrB,OAATne,GAAe,CACpB,GAAIiC,EAAOjC,GACT,OAAO,EAETA,EAAOA,EAAKme,SAEd,OAAO,GAUTmxB,iDAAA,SAAoCrtC,GAClCjf,KAAKymB,aAAa,SAAApQ,GACS,OAArBA,EAAM+I,WACRH,EAAO5I,GAEPA,EAAM02C,oCAAoC9tC,MAQhDqtC,kBAAA,WACE,OAAO,IAAI53C,GACQ,OAAjB1U,KAAKgtD,QACDhtD,KAAKitD,MACLjtD,KAAKgtD,QAAQl2C,OAAS,IAAM9W,KAAKitD,QAOzCX,kBAAA,WACE,OAAOtsD,KAAKitD,OAMdX,oBAAA,WACE,OAAOtsD,KAAKgtD,SAQNV,4BAAR,WACuB,OAAjBtsD,KAAKgtD,SACPhtD,KAAKgtD,QAAQE,aAAaltD,KAAKitD,MAAOjtD,OAWlCssD,0BAAR,SAAqB9tC,EAAmBnI,GACtC,IAAM82C,EAAa92C,EAAMtL,UACnBqiD,EAAcxiD,EAAS5K,KAAKwpB,MAAMuH,SAAUvS,GAC9C2uC,GAAcC,UACTptD,KAAKwpB,MAAMuH,SAASvS,GAC3Bxe,KAAKwpB,MAAMkjC,aACX1sD,KAAKysD,kBACKU,GAAeC,IACzBptD,KAAKwpB,MAAMuH,SAASvS,GAAanI,EAAMmT,MACvCxpB,KAAKwpB,MAAMkjC,aACX1sD,KAAKysD,uBAzMT,YACUQ,EACAD,EACAxjC,gBAFAyjC,mBACAD,qBACAxjC,MAAyBgjC,IAFzBxsD,WAAAitD,EACAjtD,aAAAgtD,EACAhtD,WAAAwpB,GCPA6iC,GAAAA,GAAAA,wBAQVA,qBAIAA,+BAIAA,6CAGAA,mCAWDpJ,GAAaoK,yBAA2B,GAwCxCpK,GAAK/iD,UAAkBgnD,kBAAoB,WAO1ClnD,KAAKstD,sBAAwB,IAAIhB,IAsBnCrJ,GAAK/iD,UAAU6rD,iBAAmB,SAChCj1C,EACA60C,EACAjwC,EACAkwC,GAEA5rD,KAAK8uC,KAAK,kBAAoBh4B,GAGR,SAAhBy2C,KAAN,IACMC,EAAW,IAAIjC,GAAUvrD,KAAM8W,GACrC02C,EAASp/B,GAAG,QAASm/B,GACrB,IAKME,EAA2B,CAC/B32C,OACAzK,OAAQs/C,EACRjwC,aAGA6sB,OAAQ,KAGRmlB,MAAOr7C,KAGPu5C,eAGA+B,WAAY,EAGZC,UAvBgB,WAChBJ,EAASr/B,IAAI,QAASo/B,IAyBtBM,YAAa,KAEbC,eAAgB,KAEhBC,qBAAsB,KAEtBC,yBAA0B,KAE1BC,8BAA+B,MAI3BC,EAAeluD,KAAKmuD,gBAAgBr3C,GAC1C22C,EAAYM,qBAAuBG,EACnC,IAAM1J,EAASiJ,EAAYphD,OAAO6hD,EAAav/C,OAC/C,QAAe7G,IAAX08C,GAKF,GAHAiJ,EAAYG,YACZH,EAAYO,yBAA2B,KACvCP,EAAYQ,8BAAgC,KACxCR,EAAY/xC,WAAY,CAE1B,IAAMY,EAAW,IAAIiN,GACnBkkC,EAAYM,qBACZ,IAAIxC,GAAUvrD,KAAMytD,EAAY32C,MAChCkJ,IAEFytC,EAAY/xC,WAAW,MAAM,EAAOY,QAEjC,CACLjD,GACE,qCACAmrC,EACAiJ,EAAY32C,MAId22C,EAAYllB,OAAS8jB,GAAkB+B,IACvC,IAAMC,EAAYruD,KAAKstD,sBAAsBgB,QAAQx3C,GAC/Cy3C,EAAYF,EAAUjvC,YAAc,GAC1CmvC,EAAUrrD,KAAKuqD,GAEfY,EAAUG,SAASD,GAKnB,IAAIE,SACJ,GACoB,iBAAXjK,GACI,OAAXA,GACA55C,EAAS45C,EAAQ,aAGjBiK,EAAkB3jD,EAAQ05C,EAAe,aACzC//C,EACEyU,GAAgBu1C,GAChB,yHAOFA,GAFEzuD,KAAKyjD,gBAAgB7zB,uBAAuB9Y,IAC5C8O,GAAanH,YACeR,cAActP,MAE9C8/C,EAAoDA,EAEpD,IAAM1+B,EAAe/vB,KAAKykD,uBACpBC,EAAoBvmC,GAAaqmC,EAAQiK,GACzCpxC,EAAU4S,GACdy0B,EACAwJ,EACAn+B,GAEF09B,EAAYO,yBAA2BtJ,EACvC+I,EAAYQ,8BAAgC5wC,EAC5CowC,EAAYK,eAAiB9tD,KAAK2kD,kBAElC,IAAMhoB,EAAS38B,KAAKyjD,gBAAgBmB,mBAClC9tC,EACAuG,EACAowC,EAAYK,eACZL,EAAY7B,cAEd5rD,KAAKgkD,YAAYC,0BAA0BntC,EAAM6lB,GAEjD38B,KAAK0uD,2BAWRzL,GAAK/iD,UAAkBiuD,gBAAkB,SACxCr3C,EACA63C,GAEA,OACE3uD,KAAKyjD,gBAAgB7zB,uBAAuB9Y,EAAM63C,IAClD/oC,GAAanH,YAehBwkC,GAAK/iD,UAAkBwuD,uBAAyB,SAC/C1xC,GAD+C,WAQ/C,gBAPAA,EAA4Bhd,KAAKstD,uBAG5BtwC,GACHhd,KAAK4uD,qCAAqC5xC,GAGpB,OAApBA,EAAKoC,WAAqB,CAC5B,IAAMyvC,EAAQ7uD,KAAK8uD,uBAAuB9xC,GAC1CvY,EAAsB,EAAfoqD,EAAMluD,OAAY,yCAEVkuD,EAAM5iC,MACnB,SAACwhC,GAA6B,OAAAA,EAAYllB,SAAW8jB,GAAkB+B,OAKvEpuD,KAAK+uD,sBAAsB/xC,EAAKlG,OAAQ+3C,QAEjC7xC,EAAK2vC,eACd3vC,EAAKyJ,aAAa,SAAA/H,GAChBxW,EAAKwmD,uBAAuBhwC,MAajCukC,GAAK/iD,UAAkB6uD,sBAAwB,SAC9Cj4C,EACA+3C,GASA,IAX8C,WAKxCG,EAAeH,EAAM7jD,IAAI,SAAAikD,GAC7B,OAAOA,EAAInB,iBAEPoB,EAAclvD,KAAKmuD,gBAAgBr3C,EAAMk4C,GAC3CG,EAAaD,EACXE,EAAaF,EAAYroC,OACtBrmB,EAAI,EAAGA,EAAIquD,EAAMluD,OAAQH,IAAK,CACrC,IAAMyuD,EAAMJ,EAAMruD,GAClBiE,EACEwqD,EAAI1mB,SAAW8jB,GAAkB+B,IACjC,iEAEFa,EAAI1mB,OAAS8jB,GAAkBgD,KAC/BJ,EAAItB,aACJ,IAAMl4C,EAAef,GAAKe,aAAaqB,EAAMm4C,EAAIn4C,MAEjDq4C,EAAaA,EAAWpwC,YACtBtJ,EACAw5C,EAAIjB,0BAIR,IAAMsB,EAAaH,EAAWxgD,KAAI,GAC5B4gD,EAAaz4C,EAGnB9W,KAAKwrC,QAAQyV,IACXsO,EAAW9lD,WACX6lD,EACA,SAAC/mB,GACCrgC,EAAK4mC,KAAK,2BAA4B,CACpCh4B,KAAMy4C,EAAW9lD,WACjB8+B,WAGF,IAAI5L,EAAkB,GACtB,GAAe,OAAX4L,EAAiB,CAInB,IADA,IAAM9a,EAAY,GACTjtB,EAAI,EAAGA,EAAIquD,EAAMluD,OAAQH,IAAK,CAKrC,GAJAquD,EAAMruD,GAAG+nC,OAAS8jB,GAAkBmD,UACpC7yB,EAASA,EAAOh5B,OACduE,EAAKu7C,gBAAgB7qB,aAAai2B,EAAMruD,GAAGstD,iBAEzCe,EAAMruD,GAAGkb,WAAY,CAEvB,IAAMsB,EAAO6xC,EAAMruD,GAAGytD,8BAChB9jC,EAAM,IAAIohC,GAAUrjD,EAAM2mD,EAAMruD,GAAGsW,MACnCwF,EAAW,IAAIiN,GAAavM,EAAMmN,EAAKnK,IAC7CyN,EAAUvqB,KACR2rD,EAAMruD,GAAGkb,WAAW7K,KAAK,KAAM,MAAM,EAAMyL,IAG/CuyC,EAAMruD,GAAGotD,YAIX1lD,EAAK0mD,qCACH1mD,EAAKolD,sBAAsBgB,QAAQx3C,IAGrC5O,EAAKwmD,yBAELxmD,EAAK87C,YAAYC,0BAA0BntC,EAAM6lB,GAGjD,IAASn8B,EAAI,EAAGA,EAAIitB,EAAU9sB,OAAQH,IACpCyT,GAAewZ,EAAUjtB,QAEtB,CAEL,GAAe,cAAX+nC,EACF,IAAS/nC,EAAI,EAAGA,EAAIquD,EAAMluD,OAAQH,IAC5BquD,EAAMruD,GAAG+nC,SAAW8jB,GAAkBoD,iBACxCZ,EAAMruD,GAAG+nC,OAAS8jB,GAAkBqD,YAEpCb,EAAMruD,GAAG+nC,OAAS8jB,GAAkB+B,QAGnC,CACLpkD,GACE,kBAAoBulD,EAAW9lD,WAAa,YAAc8+B,GAE5D,IAAS/nC,EAAI,EAAGA,EAAIquD,EAAMluD,OAAQH,IAChCquD,EAAMruD,GAAG+nC,OAAS8jB,GAAkBqD,YACpCb,EAAMruD,GAAGqtD,YAActlB,EAI3BrgC,EAAK67C,mBAAmBjtC,KAG5Bs4C,IAiBHnM,GAAK/iD,UAAkB6jD,mBAAqB,SAAS1X,GACpD,IAAMsjB,EAA0B3vD,KAAK4vD,4BAA4BvjB,GAC3Dv1B,EAAO64C,EAAwB74C,OAE/B+3C,EAAQ7uD,KAAK8uD,uBAAuBa,GAG1C,OAFA3vD,KAAK6vD,uBAAuBhB,EAAO/3C,GAE5BA,GAWRmsC,GAAK/iD,UAAkB2vD,uBAAyB,SAC/ChB,EACA/3C,GAEA,GAAqB,IAAjB+3C,EAAMluD,OAAV,CAeA,IATA,IAkGcitD,EAlGRngC,EAAY,GACdkP,EAAkB,GAKhBqyB,EAHcH,EAAM3xB,OAAO,SAAAgkB,GAC/B,OAAOA,EAAE3Y,SAAW8jB,GAAkB+B,MAEPpjD,IAAI,SAAAk2C,GACnC,OAAOA,EAAE4M,iBAEFttD,EAAI,EAAGA,EAAIquD,EAAMluD,OAAQH,IAAK,CACrC,IAAMitD,EAAcoB,EAAMruD,GACpBiV,EAAef,GAAKe,aAAaqB,EAAM22C,EAAY32C,MACrDg5C,GAAmB,EACrBjC,SAMF,GALAppD,EACmB,OAAjBgR,EACA,iEAGEg4C,EAAYllB,SAAW8jB,GAAkBqD,YAC3CI,GAAmB,EACnBjC,EAAcJ,EAAYI,YAC1BlxB,EAASA,EAAOh5B,OACd3D,KAAKyjD,gBAAgB7qB,aAAa60B,EAAYK,gBAAgB,SAE3D,GAAIL,EAAYllB,SAAW8jB,GAAkB+B,IAElD,GAAIX,EAAYE,YAAe1K,GAAaoK,yBAC1CyC,GAAmB,EACnBjC,EAAc,WACdlxB,EAASA,EAAOh5B,OACd3D,KAAKyjD,gBAAgB7qB,aAAa60B,EAAYK,gBAAgB,QAE3D,CAEL,IAAMiC,EAAc/vD,KAAKmuD,gBACvBV,EAAY32C,KACZk4C,GAEFvB,EAAYM,qBAAuBgC,EACnC,IAAM7rB,EAAU2qB,EAAMruD,GAAG6L,OAAO0jD,EAAYphD,OAC5C,QAAgB7G,IAAZo8B,EAAuB,CACzB7qB,GACE,qCACA6qB,EACAupB,EAAY32C,MAEd,IAAIk5C,EAAc7xC,GAAa+lB,GAEV,iBAAZA,GACI,MAAXA,GACAt5B,EAASs5B,EAAS,eAGlB8rB,EAAcA,EAAYpxC,eAAemxC,EAAY9xC,gBAGvD,IAAMgyC,EAAaxC,EAAYK,eACzB/9B,EAAe/vB,KAAKykD,uBACpByL,EAAkBjgC,GACtB+/B,EACAD,EACAhgC,GAGF09B,EAAYO,yBAA2BgC,EACvCvC,EAAYQ,8BAAgCiC,EAC5CzC,EAAYK,eAAiB9tD,KAAK2kD,kBAElCqK,EAAahtB,OAAOgtB,EAAa52C,QAAQ63C,GAAa,GAStDtzB,GARAA,EAASA,EAAOh5B,OACd3D,KAAKyjD,gBAAgBmB,mBACnB6I,EAAY32C,KACZo5C,EACAzC,EAAYK,eACZL,EAAY7B,gBAGAjoD,OACd3D,KAAKyjD,gBAAgB7qB,aAAaq3B,GAAY,SAGhDH,GAAmB,EACnBjC,EAAc,SACdlxB,EAASA,EAAOh5B,OACd3D,KAAKyjD,gBAAgB7qB,aAAa60B,EAAYK,gBAAgB,IAOtE,GAFA9tD,KAAKgkD,YAAYC,0BAA0BntC,EAAM6lB,GACjDA,EAAS,GACLmzB,IAEFjB,EAAMruD,GAAG+nC,OAAS8jB,GAAkBmD,UAI1B5B,EAEPiB,EAAMruD,GAAGotD,UADV15C,WAAW05C,EAAWz6C,KAAKI,MAAM,IAG/Bs7C,EAAMruD,GAAGkb,YACX,GAAoB,WAAhBmyC,EAA0B,CAC5B,IAAM1jC,EAAM,IAAIohC,GAAUvrD,KAAM6uD,EAAMruD,GAAGsW,MAEnCq5C,EAAiCtB,EAAMruD,GAAGutD,qBAC1CzxC,EAAW,IAAIiN,GAAa4mC,EAAWhmC,EAAKnK,IAClDyN,EAAUvqB,KAAK2rD,EAAMruD,GAAGkb,WAAW7K,KAAK,KAAM,MAAM,EAAOyL,SAE3DmR,EAAUvqB,KACR2rD,EAAMruD,GAAGkb,WAAW7K,KAAK,KAAM,IAAIhM,MAAMgpD,IAAc,EAAO,OAQxE7tD,KAAK4uD,qCAAqC5uD,KAAKstD,uBAG/C,IAAS9sD,EAAI,EAAGA,EAAIitB,EAAU9sB,OAAQH,IACpCyT,GAAewZ,EAAUjtB,IAI3BR,KAAK0uD,2BAYNzL,GAAK/iD,UAAkB0vD,4BAA8B,SACpD94C,GAEA,IAAIgI,EAGAsxC,EAAkBpwD,KAAKstD,sBAE3B,IADAxuC,EAAQhI,EAAKvB,WACI,OAAVuJ,GAAiD,OAA/BsxC,EAAgBhxC,YACvCgxC,EAAkBA,EAAgB9B,QAAQxvC,GAE1CA,GADAhI,EAAOA,EAAKpB,YACCH,WAGf,OAAO66C,GAWRnN,GAAK/iD,UAAkB4uD,uBAAyB,SAC/CsB,GAGA,IAAMC,EAAkC,GAQxC,OAPArwD,KAAKswD,mCAAmCF,EAAiBC,GAGzDA,EAAiBv9C,KAAK,SAACjH,EAAGtM,GACxB,OAAOsM,EAAE6hD,MAAQnuD,EAAEmuD,QAGd2C,GASRpN,GAAK/iD,UAAkBowD,mCAAqC,SAC3DtzC,EACA6xC,GAF2D,WAIrDN,EAAYvxC,EAAKoC,WACvB,GAAkB,OAAdmvC,EACF,IAAK,IAAI/tD,EAAI,EAAGA,EAAI+tD,EAAU5tD,OAAQH,IACpCquD,EAAM3rD,KAAKqrD,EAAU/tD,IAIzBwc,EAAKyJ,aAAa,SAAApQ,GAChBnO,EAAKooD,mCAAmCj6C,EAAOw4C,MAWlD5L,GAAK/iD,UAAkB0uD,qCAAuC,SAC7D5xC,GAD6D,WAGvD6xC,EAAQ7xC,EAAKoC,WACnB,GAAIyvC,EAAO,CAET,IADA,IAAI0B,EAAK,EACA75B,EAAO,EAAGA,EAAOm4B,EAAMluD,OAAQ+1B,IAClCm4B,EAAMn4B,GAAM6R,SAAW8jB,GAAkBmD,YAC3CX,EAAM0B,GAAM1B,EAAMn4B,GAClB65B,KAGJ1B,EAAMluD,OAAS4vD,EACfvzC,EAAKwxC,SAAwB,EAAfK,EAAMluD,OAAakuD,EAAQ,MAG3C7xC,EAAKyJ,aAAa,SAAA/H,GAChBxW,EAAK0mD,qCAAqClwC,MAa7CukC,GAAK/iD,UAAkB8kD,mBAAqB,SAASluC,GAAT,WACrC8e,EAAe51B,KAAK4vD,4BAA4B94C,GAAMA,OAEtDs5C,EAAkBpwD,KAAKstD,sBAAsBgB,QAAQx3C,GAY3D,OAVAs5C,EAAgBI,gBAAgB,SAACxzC,GAC/B9U,EAAKuoD,yBAAyBzzC,KAGhChd,KAAKywD,yBAAyBL,GAE9BA,EAAgBtD,kBAAkB,SAAC9vC,GACjC9U,EAAKuoD,yBAAyBzzC,KAGzB4Y,GAURqtB,GAAK/iD,UAAkBuwD,yBAA2B,SACjDzzC,GAEA,IAAM6xC,EAAQ7xC,EAAKoC,WACnB,GAAc,OAAVyvC,EAAgB,CASlB,IANA,IAAMphC,EAAY,GAIdkP,EAAkB,GAClB+zB,GAAY,EACPlwD,EAAI,EAAGA,EAAIquD,EAAMluD,OAAQH,IAChC,GAAIquD,EAAMruD,GAAG+nC,SAAW8jB,GAAkBoD,iBAEnC,GAAIZ,EAAMruD,GAAG+nC,SAAW8jB,GAAkBgD,KAC/C5qD,EACEisD,IAAalwD,EAAI,EACjB,mDAIFquD,EAFA6B,EAAWlwD,GAEF+nC,OAAS8jB,GAAkBoD,iBACpCZ,EAAMruD,GAAGqtD,YAAc,WAWvB,GATAppD,EACEoqD,EAAMruD,GAAG+nC,SAAW8jB,GAAkB+B,IACtC,0CAGFS,EAAMruD,GAAGotD,YACTjxB,EAASA,EAAOh5B,OACd3D,KAAKyjD,gBAAgB7qB,aAAai2B,EAAMruD,GAAGstD,gBAAgB,IAEzDe,EAAMruD,GAAGkb,WAAY,CAEvB+R,EAAUvqB,KACR2rD,EAAMruD,GAAGkb,WAAW7K,KAAK,KAAM,IAAIhM,MAAM,QAAQ,EAFb,QAO1B,IAAd6rD,EAEF1zC,EAAKwxC,SAAS,MAGdK,EAAMluD,OAAS+vD,EAAW,EAI5B1wD,KAAKgkD,YAAYC,0BAA0BjnC,EAAKlG,OAAQ6lB,GACxD,IAASn8B,EAAI,EAAGA,EAAIitB,EAAU9sB,OAAQH,IACpCyT,GAAewZ,EAAUjtB,MC1vB/B,IAYImwD,GAZEC,GAAsB,kBAiCnBC,eAAP,WAIE,OAFEF,GADGA,IACe,IAAIE,IAM1BA,uBAAA,2BACE,IAAsB,IAAApP,EAAAt+C,EAAA3D,OAAOqK,KAAK7J,KAAK8wD,uCAAS,CAA3C,IAAMC,cACT,IAAoB,IAAArP,YAAAv+C,EAAA3D,OAAOqK,KAAK7J,KAAK8wD,OAAOC,oCAAW,CAAlD,IAAMC,UACThxD,KAAK8wD,OAAOC,GAASC,GAAOnQ,mNAKlCgQ,oBAAA,2BACE,IAAsB,IAAApP,EAAAt+C,EAAA3D,OAAOqK,KAAK7J,KAAK8wD,uCAAS,CAA3C,IAAMC,cACT,IAAoB,IAAArP,YAAAv+C,EAAA3D,OAAOqK,KAAK7J,KAAK8wD,OAAOC,oCAAW,CAAlD,IAAMC,UACThxD,KAAK8wD,OAAOC,GAASC,GAAOnL,gNAWlCgL,6BAAA,SACEnK,EACAC,EACA9S,GAEA,IAAImd,EAA4Bnd,GAAO6S,EAAIvc,QAAQymB,SACrC9oD,IAAVkpD,GACFz/C,GACE,8DACEq/C,GACA,kDAIN,IAAIr4C,EAAYF,GAAc24C,GAC1Bp4C,EAAWL,EAAUK,SAErBq4C,OAAqCnpD,EAoBzC,MAnBuB,oBAAZ0tC,UACTyb,EAAiBzb,QAAQE,IAAuC,iCAE9Dub,IACFD,EAAQ,UAAUC,SAAqBr4C,EAASb,UAEhDa,GADAL,EAAYF,GAAc24C,IACLp4C,UAGvBwB,GAAY,gCAAiC,EAAG7B,GAC3CA,EAAUzB,KAAK/L,WAClBwG,GACE,4FAKSvR,KAAKkxD,WAAWt4C,EAAU8tC,EAAKC,GAEhC8E,UAQdoF,wBAAA,SAAW1jC,GACT,IAAMgkC,EAAWrmD,EAAQ9K,KAAK8wD,OAAQ3jC,EAAKu5B,IAAIn4C,MAE1C4iD,GAAYrmD,EAAQqmD,EAAUhkC,EAAKsrB,UAAUxgC,iBAAmBkV,GACnE5b,GACE,YAAY4b,EAAKu5B,IAAIn4C,SAAQ4e,EAAKsrB,yCAGtCtrB,EAAK0zB,mBACEsQ,EAAShkC,EAAKsrB,UAAUxgC,gBAWjC44C,wBAAA,SACEj4C,EACA8tC,EACAC,GAEA,IAAIwK,EAAWrmD,EAAQ9K,KAAK8wD,OAAQpK,EAAIn4C,MAEnC4iD,IACHA,EAAW,GACXnxD,KAAK8wD,OAAOpK,EAAIn4C,MAAQ4iD,GAG1B,IAAIhkC,EAAOriB,EAAQqmD,EAAUv4C,EAASX,eAStC,OARIkV,GACF5b,GACE,2HAGJ4b,EAAO,IAAI81B,GAAKrqC,EAAU5Y,KAAKoxD,eAAgB1K,EAAKC,GACpDwK,EAASv4C,EAASX,eAAiBkV,GASrC0jC,6BAAA,SAAgBpK,GACdzmD,KAAKoxD,eAAiB3K,OA5I1B,cAIUzmD,YAIJ,GAMIA,qBAA0B,UCOlCR,sBAAIgnD,wBAAJ,WACE,OAAOxmD,KAAK4b,MAAM8qC,qCAepBF,iBAAA,SAAI1vC,GAIF,OAHA9W,KAAKqxD,cAAc,OACnB5kD,EAAiB,eAAgB,EAAG,EAAG/L,UAAUC,QAE7CmW,aAAgBy0C,GACXvrD,KAAKsxD,WAAWx6C,EAAKrN,iBAGd3B,IAATgP,EAAqB9W,KAAKsiB,MAAMjM,MAAMS,GAAQ9W,KAAKsiB,OAU5DkkC,wBAAA,SAAW3S,GAET,IAAM0d,EAAU,sBAChBvxD,KAAKqxD,cAAcE,GACnB9kD,EAAiB8kD,EAAS,EAAG,EAAG7wD,UAAUC,QAC1C,IAAM6wD,EAAYn5C,GAAcw7B,GAChCz5B,GAAYm3C,EAAS,EAAGC,GAExB,IAAM54C,EAAW44C,EAAU54C,SAa3B,OAZIA,EAASxB,OAAUpX,KAAK4b,MAAM68B,UAAuBrhC,MACvD7F,GACEggD,EACE,2DAEA34C,EAASxB,KACT,iBACCpX,KAAK4b,MAAM68B,UAAuBrhC,KACnC,KAICpX,KAAKmqB,IAAIqnC,EAAU16C,KAAKrN,aAMzB+8C,2BAAR,SAAsB+K,GACD,OAAfvxD,KAAK4b,OACPrK,GAAM,eAAiBggD,EAAU,4BAKrC/K,uBAAA,WACE/5C,EAAiB,qBAAsB,EAAG,EAAG/L,UAAUC,QACvDX,KAAKqxD,cAAc,aACnBrxD,KAAK4b,MAAMilC,aAGb2F,sBAAA,WACE/5C,EAAiB,oBAAqB,EAAG,EAAG/L,UAAUC,QACtDX,KAAKqxD,cAAc,YACnBrxD,KAAK4b,MAAMiqC,UA3GGW,eAAc,CAC5BiL,UAAW,CACTC,MAAO,aAETC,UAAW,SAACnhC,GACV,MAAO,CACLkhC,MAAO,CACLC,UAAanhC,UAUrB,YAAoB5U,IAAA5b,WAAA4b,aACKqnC,IACrB1xC,GACE,wEAKJvR,KAAKsiB,MAAQ,IAAIipC,GAAU3vC,EAAOlH,GAAK8d,OAEvCxyB,KAAK4xD,SAAW,IAAIC,GAAkB7xD,MAoF1C,QAKQ6xD,oBAAN,mFAEG7xD,KAAKyrD,SAAiB4F,cAAc,UAErCR,GAAYlP,cAAcmQ,WAAY9xD,KAAKyrD,SAAiB7vC,OAE3D5b,KAAKyrD,SAAiB7vC,MAAQ,KAE9B5b,KAAKyrD,SAAiBnpC,MAAQ,KAC/BtiB,KAAKyrD,SAASmG,SAAW,KACzB5xD,KAAKyrD,SAAW,kBAblB,YAAmBA,GAAAzrD,cAAAyrD,EC1Hd,sDAAyB,WAC9BtW,GAAoB4c,gBACpBzjB,GAAsB0jB,8BAGO,WAC7B1jB,GAAsByjB,uCAIa,WACnC,OAAO5c,GAAiC,wCAGF,SACtChrB,EACAliB,GAGCkiB,EAAIgD,KAAKy4B,sBAA8BpE,uBAAyBv5C,SAG9C,SAASkiB,EAAgB27B,GAC5C37B,EAAIgD,KAAKie,MAAM0a,0BAGoB,SAAS37B,EAAgBi8B,GAC5Dj8B,EAAIgD,KAAK8kC,sBAAsB7L,oBAGF,SAASj8B,GACtC,OAAOA,EAAIgD,KAAKk2B,qCAGiB,SACjCl5B,EACAliB,GAEA,OAAOkiB,EAAIgD,KAAK+kC,qBAAqBjqD,MC5C1BkqD,GAAiBlW,GAO7BA,GAAqB/7C,UAAkBkyD,aAAe,SACrDt9C,EACA4G,GAEA1b,KAAKu8C,YAAY,IAAK,CAAE38C,EAAGkV,GAAc4G,IAQ1CugC,GAAqB/7C,UAAkBmyD,KAAO,SAC7CrpD,EACAspD,GAEAtyD,KAAKu8C,YAAY,OAAQ,CAAEj9C,EAAG0J,GAAQspD,IAIjC,ICb0BvkD,GnBhBHqtC,GkB6BjBmX,GAAqBpa,GA2BrBqa,GAAmBr7C,uFArBN,SAASs7C,GACjC,IAAMC,EAASzW,GAAqB/7C,UAAU+gD,IAY9C,OAXAhF,GAAqB/7C,UAAU+gD,IAAM,SACnCnsC,EACA9L,EACA0S,EACAmL,QAEa/e,IAAT+e,IACFA,EAAO4rC,KAETC,EAAO9xD,KAAKZ,KAAM8U,EAAY9L,EAAM0S,EAAYmL,IAE3C,WACLo1B,GAAqB/7C,UAAU+gD,IAAMyR,wCAaV,SAAS9nC,GACtC,OAAOA,EAAM2E,mCAQgB,SAASk3B,GACtCoK,GAAYlP,cAAc8E,gBAAgBA,MC1DtCkM,GAAcnM,GAASmM,YnBdCvX,ImBgBGrtC,GA6ChB6kD,IA3CQpuD,YnBjBvBA,GAAc42C,GmBoBKrtC,GAAgC6jD,SAASiB,kBAC1D,IAAI/jD,EACF,WACA,SAAC8e,EAAWimB,GAGV,IAAM6S,EAAM94B,EAAUklC,YAAY,OAAO1oB,eACnCuc,EAAe/4B,EAAUklC,YAAY,iBAE3C,OAAOjC,GAAYlP,cAAcoR,gBAC/BrM,EACAC,EACA9S,cAKHmf,gBAEC,CACEzH,aACAn/B,SACAo6B,YACAj9B,gBACAhZ,iBACAqhD,YACAe,eACAM,iBAGHC,sBAAqB,IAG1BnlD,GAASolD"}