{"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/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/AuthTokenProvider.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.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\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 __createBinding(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n    for (var p in m) if (p !== \"default\" && !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/** Returns true if we are running in Safari. */\nexport function isSafari(): boolean {\n  return (\n    !isNode() &&\n    navigator.userAgent.includes('Safari') &&\n    !navigator.userAgent.includes('Chrome')\n  );\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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]: unknown;\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 ? String(value) : `<${key}?>`;\n  });\n}\n\nconst PATTERN = /\\{\\$([^}]+)}/g;\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\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\n  get logLevel(): LogLevel {\n    return this._logLevel;\n  }\n\n  set logLevel(val: LogLevel) {\n    if (!(val in LogLevel)) {\n      throw new TypeError(`Invalid value \"${val}\" assigned to \\`logLevel\\``);\n    }\n    this._logLevel = val;\n  }\n\n  // Workaround for setter/getter having to be the same type.\n  setLogLevel(val: LogLevel | LogLevelString): void {\n    this._logLevel = typeof val === 'string' ? levelStringToEnum[val] : val;\n  }\n\n  /**\n   * The main (internal) log handler for the Logger instance.\n   * Can be set to a new function in internal package code but not by user.\n   */\n  private _logHandler: LogHandler = defaultLogHandler;\n  get logHandler(): LogHandler {\n    return this._logHandler;\n  }\n  set logHandler(val: LogHandler) {\n    if (typeof val !== 'function') {\n      throw new TypeError('Value assigned to `logHandler` must be a function');\n    }\n    this._logHandler = val;\n  }\n\n  /**\n   * The optional, additional, user-defined log handler for the Logger instance.\n   */\n  private _userLogHandler: LogHandler | null = null;\n  get userLogHandler(): LogHandler | null {\n    return this._userLogHandler;\n  }\n  set userLogHandler(val: LogHandler | null) {\n    this._userLogHandler = val;\n  }\n\n  /**\n   * The functions below are all based on the `console` interface\n   */\n\n  debug(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.DEBUG, ...args);\n    this._logHandler(this, LogLevel.DEBUG, ...args);\n  }\n  log(...args: unknown[]): void {\n    this._userLogHandler &&\n      this._userLogHandler(this, LogLevel.VERBOSE, ...args);\n    this._logHandler(this, LogLevel.VERBOSE, ...args);\n  }\n  info(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.INFO, ...args);\n    this._logHandler(this, LogLevel.INFO, ...args);\n  }\n  warn(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.WARN, ...args);\n    this._logHandler(this, LogLevel.WARN, ...args);\n  }\n  error(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.ERROR, ...args);\n    this._logHandler(this, LogLevel.ERROR, ...args);\n  }\n}\n\nexport function setLogLevel(level: LogLevelString | LogLevel): void {\n  instances.forEach(inst => {\n    inst.setLogLevel(level);\n  });\n}\n\nexport function setUserLogHandler(\n  logCallback: LogCallback | null,\n  options?: LogOptions\n): void {\n  for (const instance of instances) {\n    let customLogLevel: LogLevel | null = null;\n    if (options && options.level) {\n      customLogLevel = levelStringToEnum[options.level];\n    }\n    if (logCallback === null) {\n      instance.userLogHandler = null;\n    } else {\n      instance.userLogHandler = (\n        instance: Logger,\n        level: LogLevel,\n        ...args: unknown[]\n      ) => {\n        const message = args\n          .map(arg => {\n            if (arg == null) {\n              return null;\n            } else if (typeof arg === 'string') {\n              return arg;\n            } else if (typeof arg === 'number' || typeof arg === 'boolean') {\n              return arg.toString();\n            } else if (arg instanceof Error) {\n              return arg.message;\n            } else {\n              try {\n                return JSON.stringify(arg);\n              } catch (ignored) {\n                return null;\n              }\n            }\n          })\n          .filter(arg => arg)\n          .join(' ');\n        if (level >= (customLogLevel ?? instance.logLevel)) {\n          logCallback({\n            level: LogLevel[level].toLowerCase() as LogLevelString,\n            message,\n            args,\n            type: instance.name\n          });\n        }\n      };\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\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 APPLICATION_ID_PARAM = 'p';\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.getEventCache().getNode().isIndexed(this.filter_.getIndex()),\n      'Event snap not indexed'\n    );\n    assert(\n      viewCache.getServerCache().getNode().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.getNode().getPriority().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.getServerCache().getNode().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 (viewCache.getEventCache().getNode().hasChild(childKey)) {\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 (!view.getQuery().getQueryParams().loadsAllData()) {\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 (!view.getQuery().getQueryParams().loadsAllData()) {\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 (!view.getQuery().getQueryParams().loadsAllData()) {\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 (view.getQuery().getQueryParams().loadsAllData()) {\n        return view;\n      }\n    }\n    return null;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\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 { 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  APPLICATION_ID_PARAM,\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 connId An identifier for this connection, used for logging\n   * @param repoInfo The info for the endpoint to send data to.\n   * @param applicationId The Firebase App ID for this project.\n   * @param transportSessionId Optional transportSessionid if we are reconnecting for an existing\n   *                                         transport session\n   * @param 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    private applicationId?: string,\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 (this.applicationId) {\n        urlParams[APPLICATION_ID_PARAM] = this.applicationId;\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 connId identifier for this transport\n   * @param repoInfo The info for the websocket endpoint.\n   * @param applicationId The Firebase App ID for this project.\n   * @param transportSessionId Optional transportSessionId if this is connecting to an existing transport\n   *                                         session\n   * @param lastSessionId Optional lastSessionId if there was a previous connection\n   */\n  constructor(\n    public connId: string,\n    repoInfo: RepoInfo,\n    private applicationId?: string,\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            'X-Firebase-GMPID': this.applicationId || ''\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        const options: { [k: string]: object } = {\n          headers: {\n            'X-Firebase-GMPID': this.applicationId || ''\n          }\n        };\n        this.mySock = new WebSocketImpl(this.connURL, [], options);\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 } 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 id - an id for this connection\n   * @param repoInfo_ - the info for the endpoint to connect to\n   * @param applicationId_ - the Firebase App ID for this project\n   * @param onMessage_ - the callback to be triggered when a server-push message arrives\n   * @param onReady_ - the callback to be triggered when this connection is ready to send messages.\n   * @param onDisconnect_ - the callback to be triggered when a connection was lost\n   * @param onKill_ - the callback to be triggered when this connection has permanently shut down.\n   * @param lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n   */\n  constructor(\n    public id: string,\n    private repoInfo_: RepoInfo,\n    private applicationId_: string | undefined,\n    private 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      this.applicationId_,\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.applicationId_,\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 applicationId_ The Firebase App ID for this project\n   * @param onDataUpdate_ A callback for new data from the server\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private applicationId_: string,\n    private onDataUpdate_: (\n      a: string,\n      b: unknown,\n      c: boolean,\n      d: number | null\n    ) => void,\n    private onConnectStatus_: (a: boolean) => void,\n    private onServerInfoUpdate_: (a: unknown) => void,\n    private authTokenProvider_: AuthTokenProvider,\n    private 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\": \"' + query.getQueryParams().getIndex().toString() + '\"';\n        const indexPath = query.path.toString();\n        warn(\n          `Using an unspecified index. Your data will be downloaded and ` +\n            `filtered on the client. Consider adding ${indexSpec} at ` +\n            `${indexPath} to your security rules for better performance.`\n        );\n      }\n    }\n  }\n\n  /**\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              self.applicationId_,\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    authTokenProvider: AuthTokenProvider\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        app.options.appId,\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 (\n        'Reference.setWithPriority failed: ' +\n        this.getKey() +\n        ' is a read-only object.'\n      );\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 (\n        'Reference.transaction failed: ' +\n        this.getKey() +\n        ' is a read-only object.'\n      );\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 (\n  changedPath: Path\n): 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 { 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\nexport interface AuthTokenProvider {\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData>;\n  addTokenChangeListener(listener: (token: string | null) => void): void;\n  removeTokenChangeListener(listener: (token: string | null) => void): void;\n  notifyForInvalidToken(): void;\n}\n\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nexport class FirebaseAuthTokenProvider implements AuthTokenProvider {\n  private auth_: FirebaseAuthInternal | null = null;\n  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): 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): void {\n    this.authProvider_\n      .get()\n      .then(auth => auth.removeAuthTokenListener(listener));\n  }\n\n  notifyForInvalidToken(): void {\n    let errorMessage =\n      'Provided authentication credentials for the app named \"' +\n      this.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/* Auth token provider that the Admin SDK uses to connect to the Emulator. */\nexport class EmulatorAdminTokenProvider implements AuthTokenProvider {\n  private static EMULATOR_AUTH_TOKEN = 'owner';\n\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\n    return Promise.resolve({\n      accessToken: EmulatorAdminTokenProvider.EMULATOR_AUTH_TOKEN\n    });\n  }\n\n  addTokenChangeListener(listener: (token: string | null) => void): void {\n    // Invoke the listener immediately to match the behavior in Firebase Auth\n    // (see packages/auth/src/auth.js#L1807)\n    listener(EmulatorAdminTokenProvider.EMULATOR_AUTH_TOKEN);\n  }\n\n  removeTokenChangeListener(listener: (token: string | null) => void): void {}\n\n  notifyForInvalidToken(): void {}\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseApp } from '@firebase/app-types';\nimport { safeGet, CONSTANTS } 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';\nimport {\n  AuthTokenProvider,\n  EmulatorAdminTokenProvider,\n  FirebaseAuthTokenProvider\n} from './AuthTokenProvider';\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 isEmulator: boolean;\n\n    let dbEmulatorHost: string | undefined = undefined;\n    if (typeof process !== 'undefined') {\n      dbEmulatorHost = process.env[FIREBASE_DATABASE_EMULATOR_HOST_VAR];\n    }\n\n    if (dbEmulatorHost) {\n      isEmulator = true;\n      dbUrl = `http://${dbEmulatorHost}?ns=${repoInfo.namespace}`;\n      parsedUrl = parseRepoInfo(dbUrl);\n      repoInfo = parsedUrl.repoInfo;\n    } else {\n      isEmulator = !parsedUrl.repoInfo.secure;\n    }\n\n    const authTokenProvider =\n      CONSTANTS.NODE_ADMIN && isEmulator\n        ? new EmulatorAdminTokenProvider()\n        : new FirebaseAuthTokenProvider(app, authProvider);\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, authTokenProvider);\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    authTokenProvider: AuthTokenProvider\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, authTokenProvider);\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","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","defaultLogHandler","instance","logType","args","logLevel","now","toISOString","method","ConsoleMethod","name","levelStringToEnum","debug","DEBUG","verbose","VERBOSE","info","INFO","WARN","ERROR","silent","SILENT","defaultLogLevel","Logger","_logLevel","val","_logHandler","_userLogHandler","Component","mode","instantiationMode","multipleInstances","props","serviceProps","instanceFactory","type","DOMStorageWrapper","domStorage_","removeItem","prefixedName_","setItem","storedVal","getItem","prefix_","toString","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","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","applicationId","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","options","headers","User-Agent","process","platform","X-Firebase-GMPID","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_","applicationId_","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","forceRefresh","forceTokenRefresh_","authTokenProvider_","getToken","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","authTokenProvider","search","authOverride","appId","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","FirebaseAuthTokenProvider","auth_","addAuthTokenListener","authProvider_","auth","removeAuthTokenListener","errorMessage","app_","getImmediate","_staticInstance","DATABASE_URL_OPTION","RepoManager","repos_","appName","dbUrl","authProvider","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,MAkCtD,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,ECjIe,SAApBI,EAA8BC,GAIlC,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,EAAyBJ,GACpC,IACE,OAAOK,EAAOC,aAAaN,GAAK,GAChC,MAAOnC,GACP0C,QAAQX,MAAM,wBAAyB/B,GAEzC,OAAO,SCjVI2C,EAAY,CAIvBC,aAAa,EAIbC,YAAY,EAKZC,YAAa,qBCZFC,EAAS,SAAUC,EAAoBC,GAClD,IAAKD,EACH,MAAME,EAAeD,IAOZC,EAAiB,SAAUD,GACtC,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,SAAUkB,GAKlC,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,EAAgBsF,OAAOtF,GAAS,IAAIiI,UA3BwB,QAE7DC,EAAiBzJ,KAAK0J,iBAAgB/E,OAAYuE,OAElDzF,EAAQ,IAAImF,EAAcM,EAAUO,OAKxBE,EAAAnK,OAAOoK,KAAKX,GAAZY,WAAAA,IAAyB,CAAtC,IAAML,OACa,MAAlBA,EAAIM,OAAO,KACTN,KAAO/F,GACTW,QAAQ2F,KACN,yCAAyCP,sCAG7C/F,EAAM+F,GAAOP,EAAWO,IAI5B,OAAO/F,MAlCT,WACmB0F,EACAO,EACAL,GAFArJ,aAAAmJ,EACAnJ,iBAAA0J,EACA1J,YAAAqJ,EA0CrB,IAAME,EAAU,yBCnIAS,EAASnG,GACvB,OAAOoG,KAAKC,MAAMrG,YAQJsG,EAAUnB,GACxB,OAAOiB,KAAKE,UAAUnB,GCKF,SAAToB,EAAmBC,GAC9B,IAAIC,EAAS,GACXC,EAAiB,GACjBvB,EAAO,GACPwB,EAAY,GAEd,IACE,IAAMC,EAAQJ,EAAMK,MAAM,KAC1BJ,EAASN,EAAS/F,EAAawG,EAAM,KAAO,IAC5CF,EAASP,EAAS/F,EAAawG,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBzB,EAAOuB,EAAU,GAAK,UACfA,EAAU,EACjB,MAAO7I,IAET,MAAO,CACL4I,SACAC,SACAvB,OACAwB,sBCxCYG,EAA2BC,EAAQpB,GACjD,OAAOhK,OAAOU,UAAUL,eAAee,KAAKgK,EAAKpB,YAGnCqB,EACdD,EACApB,GAEA,OAAIhK,OAAOU,UAAUL,eAAee,KAAKgK,EAAKpB,GACrCoB,EAAIpB,QAEX,WAIYsB,EAAQF,GACtB,IAAK,IAAMpB,KAAOoB,EAChB,GAAIpL,OAAOU,UAAUL,eAAee,KAAKgK,EAAKpB,GAC5C,OAAO,EAGX,OAAO,WAGOuB,EACdH,EACAI,EACAC,GAEA,IAAMC,EAAkC,GACxC,IAAK,IAAM1B,KAAOoB,EACZpL,OAAOU,UAAUL,eAAee,KAAKgK,EAAKpB,KAC5C0B,EAAI1B,GAAOwB,EAAGpK,KAAKqK,EAAYL,EAAIpB,GAAMA,EAAKoB,IAGlD,OAAOM,SCuCPC,kBAAA,WACEnL,KAAKoL,OAAO,GAAK,WACjBpL,KAAKoL,OAAO,GAAK,WACjBpL,KAAKoL,OAAO,GAAK,WACjBpL,KAAKoL,OAAO,GAAK,UACjBpL,KAAKoL,OAAO,GAAK,WAEjBpL,KAAKqL,OAAS,EACdrL,KAAKsL,OAAS,GAShBH,sBAAA,SAAUI,EAAqCC,GAE3CA,EADGA,GACM,EAGX,IAAMC,EAAIzL,KAAK0L,GAGf,GAAmB,iBAARH,EACT,IAAK,IAAI/K,EAAI,EAAGA,EAAI,GAAIA,IAStBiL,EAAEjL,GACC+K,EAAIvH,WAAWwH,IAAW,GAC1BD,EAAIvH,WAAWwH,EAAS,IAAM,GAC9BD,EAAIvH,WAAWwH,EAAS,IAAM,EAC/BD,EAAIvH,WAAWwH,EAAS,GAC1BA,GAAU,OAGZ,IAAShL,EAAI,EAAGA,EAAI,GAAIA,IACtBiL,EAAEjL,GACC+K,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAAShL,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMF,EAAImL,EAAEjL,EAAI,GAAKiL,EAAEjL,EAAI,GAAKiL,EAAEjL,EAAI,IAAMiL,EAAEjL,EAAI,IAClDiL,EAAEjL,GAA+B,YAAxBF,GAAK,EAAMA,IAAM,IAG5B,IAKI2B,EAAG0J,EALHC,EAAI5L,KAAKoL,OAAO,GAChB7L,EAAIS,KAAKoL,OAAO,GAChBrH,EAAI/D,KAAKoL,OAAO,GAChB9L,EAAIU,KAAKoL,OAAO,GAChB1J,EAAI1B,KAAKoL,OAAO,GAIpB,IAAS5K,EAAI,EAAGA,EAAI,GAAIA,IAIlBmL,EAHAnL,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,GAAOsL,GAAK,EAAMA,IAAM,IAAO3J,EAAIP,EAAIiK,EAAIF,EAAEjL,GAAM,WACzDkB,EAAIpC,EACJA,EAAIyE,EACJA,EAA8B,YAAxBxE,GAAK,GAAOA,IAAM,GACxBA,EAAIqM,EACJA,EAAItL,EAGNN,KAAKoL,OAAO,GAAMpL,KAAKoL,OAAO,GAAKQ,EAAK,WACxC5L,KAAKoL,OAAO,GAAMpL,KAAKoL,OAAO,GAAK7L,EAAK,WACxCS,KAAKoL,OAAO,GAAMpL,KAAKoL,OAAO,GAAKrH,EAAK,WACxC/D,KAAKoL,OAAO,GAAMpL,KAAKoL,OAAO,GAAK9L,EAAK,WACxCU,KAAKoL,OAAO,GAAMpL,KAAKoL,OAAO,GAAK1J,EAAK,YAG1CyJ,mBAAA,SAAOzE,EAAwC/F,GAE7C,GAAa,MAAT+F,EAAJ,MAIeoB,IAAXnH,IACFA,EAAS+F,EAAM/F,QAUjB,IAPA,IAAMkL,EAAmBlL,EAASX,KAAK8L,UACnCrL,EAAI,EAEF8K,EAAMvL,KAAK+L,KACbC,EAAQhM,KAAKqL,OAGV5K,EAAIE,GAAQ,CAKjB,GAAc,IAAVqL,EACF,KAAOvL,GAAKoL,GACV7L,KAAKiM,UAAUvF,EAAOjG,GACtBA,GAAKT,KAAK8L,UAId,GAAqB,iBAAVpF,GACT,KAAOjG,EAAIE,GAIT,GAHA4K,EAAIS,GAAStF,EAAM1C,WAAWvD,KAE5BA,IADAuL,IAEYhM,KAAK8L,UAAW,CAC5B9L,KAAKiM,UAAUV,GACfS,EAAQ,EAER,YAIJ,KAAOvL,EAAIE,GAIT,GAHA4K,EAAIS,GAAStF,EAAMjG,KAEjBA,IADAuL,IAEYhM,KAAK8L,UAAW,CAC5B9L,KAAKiM,UAAUV,GACfS,EAAQ,EAER,OAMRhM,KAAKqL,OAASW,EACdhM,KAAKsL,QAAU3K,IAIjBwK,mBAAA,WACE,IAAMe,EAAmB,GACrBC,EAA0B,EAAdnM,KAAKsL,OAGjBtL,KAAKqL,OAAS,GAChBrL,KAAKoM,OAAOpM,KAAKqM,KAAM,GAAKrM,KAAKqL,QAEjCrL,KAAKoM,OAAOpM,KAAKqM,KAAMrM,KAAK8L,WAAa9L,KAAKqL,OAAS,KAIzD,IAAK,IAAI7K,EAAIR,KAAK8L,UAAY,EAAQ,IAALtL,EAASA,IACxCR,KAAK+L,KAAKvL,GAAiB,IAAZ2L,EACfA,GAAa,IAGfnM,KAAKiM,UAAUjM,KAAK+L,MAEpB,IAAItL,EAAI,EACR,IAASD,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAI8L,EAAI,GAAS,GAALA,EAAQA,GAAK,EAC5BJ,EAAOzL,GAAMT,KAAKoL,OAAO5K,IAAM8L,EAAK,MAClC7L,EAGN,OAAOyL,MAvMT,aAjCQlM,YAAmB,GAMnBA,UAAiB,GAOjBA,QAAe,GAMfA,UAAiB,GAKjBA,YAAiB,EAKjBA,YAAiB,EAKvBA,KAAK8L,UAAY,GAEjB9L,KAAKqM,KAAK,GAAK,IACf,IAAK,IAAI7L,EAAI,EAAGA,EAAIR,KAAK8L,YAAatL,EACpCR,KAAKqM,KAAK7L,GAAK,EAGjBR,KAAKuM,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,IAAIhI,MAPR4H,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,IAAInI,MACR,mEAIN,IAAIpB,EAAQgJ,EAAS,YAGrB,OADAhJ,GAASwJ,EAAU,sBA4BLC,EACdT,EACAM,EACA9E,EACA+E,GAEA,KAAIA,GAAa/E,IAGO,mBAAbA,EACT,MAAM,IAAIpD,MACRiI,EAAYL,EAAQM,EAAgBC,GAClC,sCAKQG,EACdV,EACAM,EACAK,EACAJ,GAEA,KAAIA,GAAaI,KAGM,iBAAZA,GAAoC,OAAZA,GACjC,MAAM,IAAIvI,MACRiI,EAAYL,EAAQM,EAAgBC,GAClC,mCCtEoB,SAAfK,EAAyBxJ,GAEpC,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,QCnCG0N,EAAAA,0LAAAA,EAAAA,EAAAA,0BAEVA,yBACAA,mBACAA,mBACAA,qBACAA,uBA+CoC,SAAhCC,EAAiCC,EAAUC,OAAS,aAAA1E,mBAAAA,IAAA2E,oBACxD,KAAID,EAAUD,EAASG,UAAvB,CAGA,IAAMC,GAAM,IAAIjG,MAAOkG,cACjBC,EAASC,EAAcN,GAC7B,IAAIK,EAMF,MAAM,IAAIjJ,MACR,8DAA8D4I,OANhErJ,QAAQ0J,SAAR1J,WACE,IAAIwJ,QAASJ,EAASQ,UACnBN,KArDT,IAAMO,EAA2D,CAC/DC,MAASZ,EAASa,MAClBC,QAAWd,EAASe,QACpBC,KAAQhB,EAASiB,KACjBxE,KAAQuD,EAASkB,KACjB/K,MAAS6J,EAASmB,MAClBC,OAAUpB,EAASqB,QAMfC,EAA4BtB,EAASiB,KAmBrCR,UACHT,EAASa,OAAQ,MAClBtE,EAACyD,EAASe,SAAU,MACpBxE,EAACyD,EAASiB,MAAO,OACjB1E,EAACyD,EAASkB,MAAO,OACjB3E,EAACyD,EAASmB,OAAQ,cA6ClBjP,sBAAIqP,4BAAJ,WACE,OAAO7O,KAAK8O,eAGd,SAAaC,GACX,KAAMA,KAAOzB,GACX,MAAM,IAAItK,UAAU,kBAAkB+L,8BAExC/O,KAAK8O,UAAYC,mCAInBF,wBAAA,SAAYE,GACV/O,KAAK8O,UAA2B,iBAARC,EAAmBd,EAAkBc,GAAOA,GAQtEvP,sBAAIqP,8BAAJ,WACE,OAAO7O,KAAKgP,iBAEd,SAAeD,GACb,GAAmB,mBAARA,EACT,MAAM,IAAI/L,UAAU,qDAEtBhD,KAAKgP,YAAcD,mCAOrBvP,sBAAIqP,kCAAJ,WACE,OAAO7O,KAAKiP,qBAEd,SAAmBF,GACjB/O,KAAKiP,gBAAkBF,mCAOzBF,kBAAA,eAAM,aAAA9F,mBAAAA,IAAA2E,kBACJ1N,KAAKiP,iBAAmBjP,KAAKiP,sBAALjP,QAAqBA,KAAMsN,EAASa,OAAUT,IACtE1N,KAAKgP,kBAALhP,QAAiBA,KAAMsN,EAASa,OAAUT,KAE5CmB,gBAAA,eAAI,aAAA9F,mBAAAA,IAAA2E,kBACF1N,KAAKiP,iBACHjP,KAAKiP,sBAALjP,QAAqBA,KAAMsN,EAASe,SAAYX,IAClD1N,KAAKgP,kBAALhP,QAAiBA,KAAMsN,EAASe,SAAYX,KAE9CmB,iBAAA,eAAK,aAAA9F,mBAAAA,IAAA2E,kBACH1N,KAAKiP,iBAAmBjP,KAAKiP,sBAALjP,QAAqBA,KAAMsN,EAASiB,MAASb,IACrE1N,KAAKgP,kBAALhP,QAAiBA,KAAMsN,EAASiB,MAASb,KAE3CmB,iBAAA,eAAK,aAAA9F,mBAAAA,IAAA2E,kBACH1N,KAAKiP,iBAAmBjP,KAAKiP,sBAALjP,QAAqBA,KAAMsN,EAASkB,MAASd,IACrE1N,KAAKgP,kBAALhP,QAAiBA,KAAMsN,EAASkB,MAASd,KAE3CmB,kBAAA,eAAM,aAAA9F,mBAAAA,IAAA2E,kBACJ1N,KAAKiP,iBAAmBjP,KAAKiP,sBAALjP,QAAqBA,KAAMsN,EAASmB,OAAUf,IACtE1N,KAAKgP,kBAALhP,QAAiBA,KAAMsN,EAASmB,OAAUf,QA7E5C,WAAmBM,GAAAhO,UAAAgO,EAUXhO,eAAY4O,EAsBZ5O,iBAA0BuN,EAc1BvN,qBAAqC,YClI7CkP,iCAAA,SAAqBC,GAEnB,OADAnP,KAAKoP,kBAAoBD,EAClBnP,MAGTkP,iCAAA,SAAqBG,GAEnB,OADArP,KAAKqP,kBAAoBA,EAClBrP,MAGTkP,4BAAA,SAAgBI,GAEd,OADAtP,KAAKuP,aAAeD,EACbtP,SAlBT,WACWgO,EACAwB,EACAC,GAFAzP,UAAAgO,EACAhO,qBAAAwP,EACAxP,UAAAyP,EAjBXzP,wBAAoB,EAIpBA,kBAA2B,GAE3BA,8BCLF,OAaE0P,gBAAA,SAAIlG,EAAajI,GACF,MAATA,EACFvB,KAAK2P,YAAYC,WAAW5P,KAAK6P,cAAcrG,IAE/CxJ,KAAK2P,YAAYG,QAAQ9P,KAAK6P,cAAcrG,GAAMW,EAAU5I,KAQhEmO,gBAAA,SAAIlG,GACF,IAAMuG,EAAY/P,KAAK2P,YAAYK,QAAQhQ,KAAK6P,cAAcrG,IAC9D,OAAiB,MAAbuG,EACK,KAEA/F,EAAS+F,IAOpBL,mBAAA,SAAOlG,GACLxJ,KAAK2P,YAAYC,WAAW5P,KAAK6P,cAAcrG,KASjDkG,0BAAA,SAAc1B,GACZ,OAAOhO,KAAKiQ,QAAUjC,GAGxB0B,qBAAA,WACE,OAAO1P,KAAK2P,YAAYO,eA7C1B,WAAoBP,GAAA3P,iBAAA2P,EALZ3P,aAAU,YCNpB,OAGEmQ,iBAAA,SAAI3G,EAAajI,GACF,MAATA,SACKvB,KAAKoQ,OAAO5G,GAEnBxJ,KAAKoQ,OAAO5G,GAAOjI,GAIvB4O,iBAAA,SAAI3G,GACF,OAAImB,EAAS3K,KAAKoQ,OAAQ5G,GACjBxJ,KAAKoQ,OAAO5G,GAEd,MAGT2G,oBAAA,SAAO3G,UACExJ,KAAKoQ,OAAO5G,QAnBvB,cACUxJ,YAAmC,GAqB3CA,wBAAoB,EChBG,SAAnBqQ,GACJC,GAEA,IAGE,GACoB,oBAAXhI,aAC2B,IAA3BA,OAAOgI,GACd,CAEA,IAAMC,EAAajI,OAAOgI,GAG1B,OAFAC,EAAWT,QAAQ,oBAAqB,SACxCS,EAAWX,WAAW,qBACf,IAAIF,EAAkBa,IAE/B,MAAO7O,IAIT,OAAO,IAAIyO,ECAO,SAAPK,GAAiB3M,GAC5B,IAAM4M,ENlByB,SAAU5M,GAGzC,IAFA,IAAMC,EAAgB,GAClBlE,EAAI,EACCY,EAAI,EAAGA,EAAIqD,EAAIlD,OAAQH,IAAK,CACnC,IAAIuD,EAAIF,EAAIG,WAAWxD,GAGvB,GAAS,OAALuD,GAAeA,GAAK,MAAQ,CAC9B,IAAM2M,EAAO3M,EAAI,MAEjBU,IADAjE,EACWqD,EAAIlD,OAAQ,2CAEvBoD,EAAI,OAAW2M,GAAQ,KADX7M,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,GAC9B2M,EAAO,IAAIrF,EACjBqF,EAAKpE,OAAOqE,GACZ,IAAME,EAAYH,EAAKtE,SACvB,OAAOhI,EAAOqB,gBAAgBoL,GAiDH,SAAhBC,GACXC,EACAC,GAEArM,GACGqM,IAA0B,IAAZD,IAAgC,IAAZA,EACnC,+CAEc,IAAZA,GACFE,GAAUpD,SAAWL,EAASe,QAC9B2C,GAASD,GAAUE,IAAIC,KAAKH,IACxBD,GACFK,GAAeC,IAAI,mBAAmB,IAEZ,mBAAZP,EAChBG,GAASH,GAETG,GAAS,KACTG,GAAeE,OAAO,oBAQP,SAANJ,SAAgB,aAAAlI,mBAAAA,IAAAuI,kBAQ3B,IAPkB,IAAdC,KACFA,IAAY,EACG,OAAXP,KAA6D,IAA1CG,GAAeK,IAAI,oBACxCZ,IAAc,IAIdI,GAAQ,CACV,IAAMrM,EAAU8M,GAAiB5Q,MAAM,KAAMyQ,GAC7CN,GAAOrM,IAQe,SAAb+M,GACXC,GAEA,OAAO,eAAU,aAAA5I,mBAAAA,IAAAuI,kBACfL,mBAAIU,GAAWL,KAOE,SAAR7N,SAAkB,aAAAsF,mBAAAA,IAAAuI,kBAC7B,IAAM3M,EAAU,4BAA8B8M,kBAAoBH,IAClEP,GAAUtN,MAAMkB,GAMG,SAARiN,SAAkB,aAAA7I,mBAAAA,IAAAuI,kBAC7B,IAAM3M,EAAU,yBAAyB8M,kBAAoBH,IAE7D,MADAP,GAAUtN,MAAMkB,GACV,IAAIE,MAAMF,GAME,SAAPoF,SAAiB,aAAAhB,mBAAAA,IAAAuI,kBAC5B,IAAM3M,EAAU,qBAAuB8M,kBAAoBH,IAC3DP,GAAUhH,KAAKpF,GAsCkB,SAAtBkN,GAAgC7I,GAC3C,MACkB,iBAATA,IACNA,GAASA,GACRA,IAAS8I,OAAOC,mBAChB/I,IAAS8I,OAAOE,mBAmGO,SAAhBC,GAA0BrG,EAAWrM,GAChD,OAAIqM,IAAMrM,EACD,EACEqM,EAAIrM,GACL,EAED,EASe,SAAb2S,GACX1I,EACAoB,GAEA,GAAIA,GAAOpB,KAAOoB,EAChB,OAAOA,EAAIpB,GAEX,MAAM,IAAI3E,MACR,yBAA2B2E,EAAM,gBAAkBW,EAAUS,IA0ClC,SAApBuH,GACXtO,EACAuO,GAEA,IAAMC,EAAMxO,EAAIlD,OAEhB,GAAI0R,GAAOD,EACT,MAAO,CAACvO,GAIV,IADA,IAAMyO,EAAW,GACRvO,EAAI,EAAGA,EAAIsO,EAAKtO,GAAKqO,EACVC,EAAdtO,EAAIqO,EACNE,EAASpP,KAAKW,EAAI0O,UAAUxO,EAAGsO,IAE/BC,EAASpP,KAAKW,EAAI0O,UAAUxO,EAAGA,EAAIqO,IAGvC,OAAOE,EDrXT,ICSME,GDeOC,GAAoBpC,GAAiB,gBAGrCc,GAAiBd,GAAiB,kBCzBzCU,GAAY,IAAIlC,EAAO,sBAMhB6D,IACPF,GAAK,EACF,WACL,OAAOA,OAsBLf,GAAmB,eAAU,aAAA1I,mBAAAA,IAAAuI,kBAEjC,IADA,IAAI3M,EAAU,GACLnE,EAAI,EAAGA,EAAI8Q,EAAQ3Q,OAAQH,IAAK,CACvC,IAAMmS,EAAMrB,EAAQ9Q,GAElBb,MAAM+F,QAAQiN,IACbA,GACgB,iBAARA,GAEwB,iBAAvBA,EAAYhS,OAEtBgE,GAAW8M,GAAiB5Q,MAAM,KAAM8R,GAExChO,GADwB,iBAARgO,EACLxI,EAAUwI,GAEVA,EAEbhO,GAAW,IAGb,OAAOA,GAOEqM,GAAuC,KAO9CO,IAAY,EAmLHqB,GAAW,aAMXC,GAAW,aAQXC,GAAc,SAAUlH,EAAWrM,GAC9C,GAAIqM,IAAMrM,EACR,OAAO,EACF,GAAIqM,IAAMgH,IAAYrT,IAAMsT,GACjC,OAAQ,EACH,GAAItT,IAAMqT,IAAYhH,IAAMiH,GACjC,OAAO,EAEP,IAAME,EAASC,GAAYpH,GACzBqH,EAASD,GAAYzT,GAEvB,OAAe,OAAXwT,EACa,OAAXE,EACKF,EAASE,GAAW,EAAIrH,EAAEjL,OAASpB,EAAEoB,OAASoS,EAASE,GAEtD,EAEU,OAAXA,GAGFrH,EAAIrM,GAAK,EAFT,GA4CA2T,GAAoB,SAAUtI,GACzC,GAAmB,iBAARA,GAA4B,OAARA,EAC7B,OAAOT,EAAUS,GAGnB,IAAMhB,EAAO,GAEb,IAAK,IAAM+B,KAAKf,EACdhB,EAAK1G,KAAKyI,GAIZ/B,EAAKuJ,OAEL,IADA,IAAI3J,EAAM,IACDhJ,EAAI,EAAGA,EAAIoJ,EAAKjJ,OAAQH,IACrB,IAANA,IACFgJ,GAAO,KAETA,GAAOW,EAAUP,EAAKpJ,IACtBgJ,GAAO,IACPA,GAAO0J,GAAkBtI,EAAIhB,EAAKpJ,KAIpC,OADAgJ,GAAO,cAqCO4J,GAAKxI,EAAaI,GAChC,IAAK,IAAMxB,KAAOoB,EACZA,EAAI/K,eAAe2J,IACrBwB,EAAGxB,EAAKoB,EAAIpB,IAyBmB,SAAxB6J,GAAkCvQ,GAG7C,IAGIvC,EAAGmB,EAAGO,EAAGqR,EAAI9S,EALjBiE,GAAQoN,GAAoB/O,GAAI,uBAStB,IAANA,EAGFvC,EAAI,EAAIuC,IAAOyQ,GADftR,EADAP,EAAI,GAEsB,EAAI,GAE9BnB,EAAIuC,EAAI,EAONb,GANFa,EAAI0Q,KAAKC,IAAI3Q,KAEJ0Q,KAAKE,IAAI,GAAG,OAGnBhS,GADA4R,EAAKE,KAAKG,IAAIH,KAAKI,MAAMJ,KAAKvC,IAAInO,GAAK0Q,KAAKK,KAfnC,OAAA,KAiBLL,KAAKM,MAAMhR,EAAI0Q,KAAKE,IAAI,EAlBtB,GAkBiCJ,GAAME,KAAKE,IAAI,EAlBhD,OAqBNhS,EAAI,EACA8R,KAAKM,MAAMhR,EAAI0Q,KAAKE,IAAI,GAAG,SAKnC,IAAMK,EAAO,GACb,IAAKvT,EA5BK,GA4BMA,IAAGA,EACjBuT,EAAK7Q,KAAKjB,EAAI,EAAI,EAAI,GACtBA,EAAIuR,KAAKI,MAAM3R,EAAI,GAErB,IAAKzB,EAjCS,GAiCEA,IAAGA,EACjBuT,EAAK7Q,KAAKxB,EAAI,EAAI,EAAI,GACtBA,EAAI8R,KAAKI,MAAMlS,EAAI,GAErBqS,EAAK7Q,KAAK3C,EAAI,EAAI,GAClBwT,EAAKC,UACL,IAAMnQ,EAAMkQ,EAAKxN,KAAK,IAGlB0N,EAAgB,GACpB,IAAKzT,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAI0T,EAAUC,SAAStQ,EAAIuQ,OAAO5T,EAAG,GAAI,GAAG0P,SAAS,IAC9B,IAAnBgE,EAAQvT,SACVuT,EAAU,IAAMA,GAElBD,GAAgCC,EAElC,OAAOD,EAAcI,cA2FO,SAAjBC,GAA2BtJ,GACtC,IACEA,IACA,MAAOtJ,GAEP6S,WAAW,WAKT,IAAMC,EAAQ9S,EAAE8S,OAAS,GAEzB,MADAzK,GAAK,yCAA0CyK,GACzC9S,GACL8R,KAAKI,MAAM,KAoEmB,SAAxBa,GACXzJ,EACA0J,GAEA,IAAMC,EAA2BJ,WAAWvJ,EAAI0J,GAMhD,MAJuB,iBAAZC,GAAyBA,EAAuB,OAExDA,EAAuB,QAEnBA,EA3OF,IA8GMC,GAAkB,IAAIC,OAAO,qBAO7B7B,GAAc,SAAUnP,GACnC,GAAI+Q,GAAgBrM,KAAK1E,GAAM,CAC7B,IAAMiR,EAAShD,OAAOjO,GACtB,IAAe,YAAXiR,GAAyBA,GAAU,WACrC,OAAOA,EAGX,OAAO,UCnhBPtV,sBAAWuV,gBAAX,WACE,OAAO,IAAIA,GAAK,qCA6BlBA,sBAAA,WACE,OAAI/U,KAAKgV,WAAahV,KAAKiV,QAAQtU,OAC1B,KAGFX,KAAKiV,QAAQjV,KAAKgV,YAM3BD,uBAAA,WACE,OAAO/U,KAAKiV,QAAQtU,OAASX,KAAKgV,WAMpCD,sBAAA,WACE,IAAIG,EAAWlV,KAAKgV,UAIpB,OAHIE,EAAWlV,KAAKiV,QAAQtU,QAC1BuU,IAEK,IAAIH,GAAK/U,KAAKiV,QAASC,IAMhCH,qBAAA,WACE,OAAI/U,KAAKgV,UAAYhV,KAAKiV,QAAQtU,OACzBX,KAAKiV,QAAQjV,KAAKiV,QAAQtU,OAAS,GAGrC,MAGToU,sBAAA,WAEE,IADA,IAAII,EAAa,GACR3U,EAAIR,KAAKgV,UAAWxU,EAAIR,KAAKiV,QAAQtU,OAAQH,IAC5B,KAApBR,KAAKiV,QAAQzU,KACf2U,GAAc,IAAMnV,KAAKiV,QAAQzU,IAIrC,OAAO2U,GAAc,KAGvBJ,gCAAA,WAEE,IADA,IAAII,EAAa,GACR3U,EAAIR,KAAKgV,UAAWxU,EAAIR,KAAKiV,QAAQtU,OAAQH,IAC5B,KAApBR,KAAKiV,QAAQzU,KACf2U,GAAc,IAAMC,mBAAmBvO,OAAO7G,KAAKiV,QAAQzU,MAI/D,OAAO2U,GAAc,KASvBJ,mBAAA,SAAMM,GACJ,oBADIA,KACGrV,KAAKiV,QAAQnL,MAAM9J,KAAKgV,UAAYK,IAM7CN,oBAAA,WACE,GAAI/U,KAAKgV,WAAahV,KAAKiV,QAAQtU,OACjC,OAAO,KAIT,IADA,IAAM2U,EAAS,GACN9U,EAAIR,KAAKgV,UAAWxU,EAAIR,KAAKiV,QAAQtU,OAAS,EAAGH,IACxD8U,EAAOpS,KAAKlD,KAAKiV,QAAQzU,IAG3B,OAAO,IAAIuU,GAAKO,EAAQ,IAO1BP,mBAAA,SAAMQ,GAEJ,IADA,IAAMD,EAAS,GACN9U,EAAIR,KAAKgV,UAAWxU,EAAIR,KAAKiV,QAAQtU,OAAQH,IACpD8U,EAAOpS,KAAKlD,KAAKiV,QAAQzU,IAG3B,GAAI+U,aAAwBR,GAC1B,IACMvU,EAAI+U,EAAaP,UACrBxU,EAAI+U,EAAaN,QAAQtU,OACzBH,IAEA8U,EAAOpS,KAAKqS,EAAaN,QAAQzU,QAGnC,CAAA,IAAMgV,EAAcD,EAAa7K,MAAM,KACvC,IAASlK,EAAI,EAAGA,EAAIgV,EAAY7U,OAAQH,IACV,EAAxBgV,EAAYhV,GAAGG,QACjB2U,EAAOpS,KAAKsS,EAAYhV,IAK9B,OAAO,IAAIuU,GAAKO,EAAQ,IAM1BP,qBAAA,WACE,OAAO/U,KAAKgV,WAAahV,KAAKiV,QAAQtU,QAQjCoU,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,IAAIlR,MACR,8BACE6Q,EACA,8BAEAD,EACA,MAUDV,gBAAP,SAAoBiB,EAAYC,GAG9B,IAFA,IAAMC,EAAWF,EAAKlM,QAChBqM,EAAYF,EAAMnM,QACftJ,EAAI,EAAGA,EAAI0V,EAASvV,QAAUH,EAAI2V,EAAUxV,OAAQH,IAAK,CAChE,IAAM4V,EAAMtD,GAAYoD,EAAS1V,GAAI2V,EAAU3V,IAC/C,GAAY,IAAR4V,EACF,OAAOA,EAGX,OAAIF,EAASvV,SAAWwV,EAAUxV,OACzB,EAEFuV,EAASvV,OAASwV,EAAUxV,QAAU,EAAI,GAQnDoU,oBAAA,SAAOsB,GACL,GAAIrW,KAAKsW,cAAgBD,EAAMC,YAC7B,OAAO,EAGT,IACE,IAAI9V,EAAIR,KAAKgV,UAAW1I,EAAI+J,EAAMrB,UAClCxU,GAAKR,KAAKiV,QAAQtU,OAClBH,IAAK8L,IAEL,GAAItM,KAAKiV,QAAQzU,KAAO6V,EAAMpB,QAAQ3I,GACpC,OAAO,EAIX,OAAO,GAQTyI,sBAAA,SAASsB,GACP,IAAI7V,EAAIR,KAAKgV,UACT1I,EAAI+J,EAAMrB,UACd,GAAIhV,KAAKsW,YAAcD,EAAMC,YAC3B,OAAO,EAET,KAAO9V,EAAIR,KAAKiV,QAAQtU,QAAQ,CAC9B,GAAIX,KAAKiV,QAAQzU,KAAO6V,EAAMpB,QAAQ3I,GACpC,OAAO,IAEP9L,IACA8L,EAEJ,OAAO,OApOT,YAAYiK,EAAiCrB,GAC3C,QAAiB,IAAbA,EAAqB,CACvBlV,KAAKiV,QAAWsB,EAAwB7L,MAAM,KAI9C,IADA,IAAI8L,EAAS,EACJhW,EAAI,EAAGA,EAAIR,KAAKiV,QAAQtU,OAAQH,IACV,EAAzBR,KAAKiV,QAAQzU,GAAGG,SAClBX,KAAKiV,QAAQuB,GAAUxW,KAAKiV,QAAQzU,GACpCgW,KAGJxW,KAAKiV,QAAQtU,OAAS6V,EAEtBxW,KAAKgV,UAAY,OAEjBhV,KAAKiV,QAAUsB,EACfvW,KAAKgV,UAAYE,EAiOvB,QAuBE1V,sBAAWiX,yBAAX,WACE,OAAO,oCAITjX,sBAAWiX,gCAAX,WACE,OAAO,qCAITA,kBAAA,SAAKC,GAEsB,EAArB1W,KAAK2W,OAAOhW,SACdX,KAAK4W,aAAe,GAEtB5W,KAAK2W,OAAOzT,KAAKwT,GACjB1W,KAAK4W,aAAevJ,EAAaqJ,GACjC1W,KAAK6W,eAGPJ,iBAAA,WACE,IAAMK,EAAO9W,KAAK2W,OAAO1T,MACzBjD,KAAK4W,aAAevJ,EAAayJ,GAER,EAArB9W,KAAK2W,OAAOhW,UACdX,KAAK4W,aAIDH,yBAAR,WACE,GAAIzW,KAAK4W,YAAcH,GAAeM,sBACpC,MAAM,IAAIlS,MACR7E,KAAKgX,aACH,8BACAP,GAAeM,sBACf,WACA/W,KAAK4W,YACL,MAGN,GAAI5W,KAAK2W,OAAOhW,OAAS8V,GAAeQ,eACtC,MAAM,IAAIpS,MACR7E,KAAKgX,aACH,iEACAP,GAAeQ,eACf,gCACAjX,KAAKkX,kBAUbT,2BAAA,WACE,OAA2B,IAAvBzW,KAAK2W,OAAOhW,OACP,GAEF,gBAAkBX,KAAK2W,OAAOpQ,KAAK,KAAO,SAzEnD,YAAY4Q,EAAoBH,GAAAhX,kBAAAgX,EAE9BhX,KAAK2W,OAASQ,EAAKrN,QAEnB9J,KAAK4W,YAAcpD,KAAK4D,IAAI,EAAGpX,KAAK2W,OAAOhW,QAE3C,IAAK,IAAIH,EAAI,EAAGA,EAAIR,KAAK2W,OAAOhW,OAAQH,IACtCR,KAAK4W,aAAevJ,EAAarN,KAAK2W,OAAOnW,IAE/CR,KAAK6W,cC/RF,IAUMQ,GAAe,iBAMfC,GAAY,YAEZC,GAAe,mBCkB1BC,6BAAA,WACE,OACExX,KAAKyX,OAASzX,KAAK0X,cACnB1X,KAAK2X,gBACL3X,KAAK4X,+BAITJ,6BAAA,WACE,MAA0C,OAAnCxX,KAAK0X,aAAatD,OAAO,EAAG,IAGrCoD,wBAAA,WACE,MAAuB,wBAAhBxX,KAAK6X,QAGdL,0BAAA,WACE,MACkB,mBAAhBxX,KAAK6X,QAA+C,wBAAhB7X,KAAK6X,QAI7CL,wBAAA,SAAWM,GACLA,IAAY9X,KAAK0X,eACnB1X,KAAK0X,aAAeI,EAChB9X,KAAK+X,mBACPtF,GAAkBrB,IAAI,QAAUpR,KAAKyX,KAAMzX,KAAK0X,gBAWtDF,2BAAA,SAAc/H,EAAcuI,GAI1B,IAAIC,EACJ,GAJAxT,EAAuB,iBAATgL,EAAmB,8BACjChL,EAAyB,iBAAXuT,EAAqB,gCAG/BvI,IAAS6H,GACXW,GACGjY,KAAKkY,OAAS,SAAW,SAAWlY,KAAK0X,aAAe,YACtD,CAAA,GAAIjI,IAAS8H,GAIlB,MAAM,IAAI1S,MAAM,4BAA8B4K,GAH9CwI,GACGjY,KAAKkY,OAAS,WAAa,WAAalY,KAAK0X,aAAe,QAI7D1X,KAAKmY,oBACPH,EAAW,GAAIhY,KAAKoY,WAGtB,IAAMC,EAAkB,GAMxB,OAJAjF,GAAK4E,EAAQ,SAACxO,EAAajI,GACzB8W,EAAMnV,KAAKsG,EAAM,IAAMjI,KAGlB0W,EAAUI,EAAM9R,KAAK,MAI9BiR,sBAAA,WACE,IAAI3T,EAAM7D,KAAKsY,cAIf,OAHItY,KAAKuY,iBACP1U,GAAO,IAAM7D,KAAKuY,eAAiB,KAE9B1U,GAIT2T,yBAAA,WACE,OAAQxX,KAAKkY,OAAS,WAAa,WAAalY,KAAKyX,UAzFvD,YACEA,EACOS,EACAE,EACAI,EACAD,EACAX,gBADAW,mBACAX,MAJA5X,YAAAkY,EACAlY,eAAAoY,EACApY,mBAAAwY,EACAxY,oBAAAuY,EACAvY,mCAAA4X,EAEP5X,KAAKyX,KAAOA,EAAKpD,cACjBrU,KAAK6X,OAAS7X,KAAKyX,KAAKrD,OAAOpU,KAAKyX,KAAKgB,QAAQ,KAAO,GACxDzY,KAAK0X,aACFjF,GAAkBjB,IAAI,QAAUiG,IAAoBzX,KAAKyX,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,oBAAX5P,QACPA,OAAOwQ,UACPxQ,OAAOwQ,SAASC,WACgC,IAAhDzQ,OAAOwQ,SAASC,SAASN,QAAQ,WAEjC1O,GACE,6FInGJ,IAAMyO,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,GAAuB3P,GAClC,MACiB,iBAARA,GAAmC,IAAfA,EAAI7I,SAAiByY,GAAmB7Q,KAAKiB,GAQ3C,SAApB6P,GAA8BlE,GACzC,MACwB,iBAAfA,GACe,IAAtBA,EAAWxU,SACV2Y,GAAoB/Q,KAAK4M,GAqBC,SAAlBoE,GAA4BC,GACvC,OACe,OAAbA,GACoB,iBAAbA,GACc,iBAAbA,IAA0B3H,GAAoB2H,IACrDA,GACqB,iBAAbA,GAEP7O,EAAS6O,EAAiB,OAaO,SAA1BC,GACXhN,EACAM,EACA/D,EACAmO,EACAnK,GAEIA,QAAqBlF,IAATkB,GAIhB0Q,GACEC,EAAelN,EAAQM,EAAgBC,GACvChE,EACAmO,GA2JwC,SAA/ByC,GACXnN,EACAM,EACA/D,EACAmO,EACAnK,GAEA,IAAIA,QAAqBlF,IAATkB,EAAhB,CAIA,IAAM8D,EAAc6M,EAAelN,EAAQM,EAAgBC,GAE3D,IAAMhE,GAAwB,iBAATA,GAAsBrJ,MAAM+F,QAAQsD,GACvD,MAAM,IAAInE,MACRiI,EAAc,0DAIlB,IAAM+M,EAAqB,GAC3BzG,GAAKpK,EAAM,SAACQ,EAAajI,GACvB,IAAMuY,EAAU,IAAI/E,GAAKvL,GAEzB,GADAkQ,GAAqB5M,EAAavL,EAAO4V,EAAKT,MAAMoD,IAC1B,cAAtBA,EAAQC,YACLR,GAAgBhY,GACnB,MAAM,IAAIsD,MACRiI,EACE,kCACAgN,EAAQ5J,WACR,gGAKR2J,EAAW3W,KAAK4W,KAzFsB,SACxChN,EACA+M,GAEA,IAAIrZ,EAAGsZ,EACP,IAAKtZ,EAAI,EAAGA,EAAIqZ,EAAWlZ,OAAQH,IAGjC,IADA,IAAMoJ,GADNkQ,EAAUD,EAAWrZ,IACAsJ,QACZwC,EAAI,EAAGA,EAAI1C,EAAKjJ,OAAQ2L,IAC/B,IAAgB,cAAZ1C,EAAK0C,IAAsBA,IAAM1C,EAAKjJ,OAAS,KAEvCwY,GAAWvP,EAAK0C,IAC1B,MAAM,IAAIzH,MACRiI,EACE,4BACAlD,EAAK0C,GACL,aACAwN,EAAQ5J,WACR,uFAUV2J,EAAW1G,KAAK4B,GAAKiF,cACrB,IAAIC,EAAwB,KAC5B,IAAKzZ,EAAI,EAAGA,EAAIqZ,EAAWlZ,OAAQH,IAAK,CAEtC,GADAsZ,EAAUD,EAAWrZ,GACJ,OAAbyZ,GAAqBA,EAAStP,SAASmP,GACzC,MAAM,IAAIjV,MACRiI,EACE,mBACAmN,EAAS/J,WACT,qCACA4J,EAAQ5J,YAGd+J,EAAWH,GAkDbI,CAA2BpN,EAAa+M,IAGV,SAAnBM,GACX1N,EACAM,EACAyM,EACAxM,GAEA,IAAIA,QAAyBlF,IAAb0R,EAAhB,CAGA,GAAI3H,GAAoB2H,GACtB,MAAM,IAAI3U,MACR8U,EAAelN,EAAQM,EAAgBC,GACrC,MACAwM,EAAStJ,WACT,6FAKN,IAAKqJ,GAAgBC,GACnB,MAAM,IAAI3U,MACR8U,EAAelN,EAAQM,EAAgBC,GACrC,wFAMyB,SAApBoN,GACX3N,EACAM,EACAsN,EACArN,GAEA,IAAIA,QAA0BlF,IAAduS,EAIhB,OAAQA,GACN,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACH,MACF,QACE,MAAM,IAAIxV,MACR8U,EAAelN,EAAQM,EAAgBC,GACrC,6GAMiB,SAAdsN,GACX7N,EACAM,EACAvD,EACAwD,GAEA,KAAIA,QAAoBlF,IAAR0B,GAGX2P,GAAW3P,IACd,MAAM,IAAI3E,MACR8U,EAAelN,EAAQM,EAAgBC,GACrC,yBACAxD,EACA,oGAM0B,SAArB+Q,GACX9N,EACAM,EACAoI,EACAnI,GAEA,KAAIA,QAA2BlF,IAAfqN,GAIXkE,GAAkBlE,IACrB,MAAM,IAAItQ,MACR8U,EAAelN,EAAQM,EAAgBC,GACrC,0BACAmI,EACA,oFAoB4B,SAAvBqF,GAAiC/N,EAAgB0K,GAC5D,GAAwB,UAApBA,EAAKvB,WACP,MAAM,IAAI/Q,MAAM4H,EAAS,6CAIF,SAAdgO,GACXhO,EACAM,EACA6L,GAGA,IA3W6CzD,EA2WvCA,EAAayD,EAAUzB,KAAKjH,WAClC,GACuC,iBAA5B0I,EAAUK,SAASxB,MACO,IAAnCmB,EAAUK,SAASxB,KAAK9W,SACtBwY,GAAWP,EAAUK,SAASb,YACY,cAA1CQ,EAAUK,SAASxB,KAAK/M,MAAM,KAAK,IACd,IAAtByK,EAAWxU,SA9WZwU,GAH2CA,EAiXQA,IA9WtCA,EAAW7L,QAAQ,mBAAoB,MAG/C+P,GAAkBlE,IA6WvB,MAAM,IAAItQ,MACR8U,EAAelN,EAAQM,GAAgB,GACrC,wFD7XD,IAgDM8L,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,EAAQhY,QAErB,IAAIka,EAAkBlC,EAAQF,QAAQ,MACb,IAArBoC,IACFA,EAAkBlC,EAAQhY,QAE5B8W,EAAOkB,EAAQpG,UAAU,EAAGiB,KAAKG,IAAIiH,EAAUC,IAC3CD,EAAWC,IAEb1F,EAxIN,SAAoBA,GAGlB,IAFA,IAAI2F,EAAoB,GAClBxF,EAASH,EAAWzK,MAAM,KACvBlK,EAAI,EAAGA,EAAI8U,EAAO3U,OAAQH,IACjC,GAAuB,EAAnB8U,EAAO9U,GAAGG,OAAY,CACxB,IAAIoa,EAAQzF,EAAO9U,GACnB,IACEua,EAAQC,mBAAmBD,EAAMzR,QAAQ,MAAO,MAChD,MAAO5H,IACToZ,GAAqB,IAAMC,EAG/B,OAAOD,EA4HUG,CAAWtC,EAAQpG,UAAUqI,EAAUC,KAEtD,IAAMK,EAvHV,SAAqBC,WACbC,EAAU,GACc,MAA1BD,EAAY9T,OAAO,KACrB8T,EAAcA,EAAY5I,UAAU,QAEtC,IAAsB,IAAA5I,EAAAxG,EAAAgY,EAAYzQ,MAAM,oCAAM,CAAzC,IAAM2Q,UACT,GAAuB,IAAnBA,EAAQ1a,OAAZ,CAGA,IAAM2a,EAAKD,EAAQ3Q,MAAM,KACP,IAAd4Q,EAAG3a,OACLya,EAAQJ,mBAAmBM,EAAG,KAAON,mBAAmBM,EAAG,IAE3DvR,GAAK,0BAA0BsR,iBAAsBF,0GAGzD,OAAOC,EAuGeG,CAClB5C,EAAQpG,UAAUiB,KAAKG,IAAIgF,EAAQhY,OAAQka,KAK7B,IADhBF,EAAWlD,EAAKgB,QAAQ,OAEtBP,EAAoB,UAAXc,GAAiC,QAAXA,EAC/B0B,EAAOvG,SAASsD,EAAKlF,UAAUoI,EAAW,GAAI,KAE9CA,EAAWlD,EAAK9W,OAGlB,IAAM6a,EAAkB/D,EAAK3N,MAAM,EAAG6Q,GACtC,GAAsC,cAAlCa,EAAgBnH,cAClBwD,EAAS,iBACJ,GAAI2D,EAAgB9Q,MAAM,KAAK/J,QAAU,EAC9CkX,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,SAClC5M,EACA9D,EACA2S,GAEA,IAAMxE,EACJwE,aAAiB5G,GAAO,IAAI0B,GAAekF,EAAO7O,GAAe6O,EAEnE,QAAa7T,IAATkB,EACF,MAAM,IAAInE,MAAMiI,EAAc,sBAAwBqK,EAAKD,iBAE7D,GAAoB,mBAATlO,EACT,MAAM,IAAInE,MACRiI,EACE,uBACAqK,EAAKD,gBACL,oBACAlO,EAAKkH,YAGX,GAAI2B,GAAoB7I,GACtB,MAAM,IAAInE,MACRiI,EAAc,YAAc9D,EAAKkH,WAAa,IAAMiH,EAAKD,iBAK7D,GACkB,iBAATlO,GACPA,EAAKrI,OAAS+a,GAAiB,GAC/BrO,EAAarE,GAAQ0S,GAErB,MAAM,IAAI7W,MACRiI,EACE,kCACA4O,GACA,eACAvE,EAAKD,gBACL,MACAlO,EAAKuJ,UAAU,EAAG,IAClB,SAMN,GAAIvJ,GAAwB,iBAATA,EAAmB,CACpC,IAAI4S,GAAc,EACdC,GAAiB,EAwBrB,GAvBAzI,GAAKpK,EAAM,SAACQ,EAAajI,GACvB,GAAY,WAARiI,EACFoS,GAAc,OACT,GAAY,cAARpS,GAA+B,QAARA,IAChCqS,GAAiB,GACZ1C,GAAW3P,IACd,MAAM,IAAI3E,MACRiI,EACE,6BACAtD,EACA,KACA2N,EAAKD,gBACL,wFAMRC,EAAKjU,KAAKsG,GACVkQ,GAAqB5M,EAAavL,EAAO4V,GACzCA,EAAKlU,QAGH2Y,GAAeC,EACjB,MAAM,IAAIhX,MACRiI,EACE,4BACAqK,EAAKD,gBACL,0CCxKR4E,oBAAA,SAAOC,GACLvP,EAAiB,sBAAuB,EAAG,EAAG9L,UAAUC,QACxDuM,EAAiB,sBAAuB,EAAG6O,GAAY,GACvD,IAAMC,EAAW,IAAIhU,EAKrB,OAJAhI,KAAKic,MAAMC,mBACTlc,KAAK2b,MACLK,EAASG,aAAaJ,IAEjBC,EAAS7T,SAOlB2T,oBAAA,SAAOC,GACLvP,EAAiB,sBAAuB,EAAG,EAAG9L,UAAUC,QACxD6Z,GAAqB,sBAAuBxa,KAAK2b,OACjDzO,EAAiB,sBAAuB,EAAG6O,GAAY,GACvD,IAAMC,EAAW,IAAIhU,EAMrB,OALAhI,KAAKic,MAAMG,gBACTpc,KAAK2b,MACL,KACAK,EAASG,aAAaJ,IAEjBC,EAAS7T,SAQlB2T,iBAAA,SAAIva,EAAgBwa,GAClBvP,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QACrD6Z,GAAqB,mBAAoBxa,KAAK2b,OAC9ClC,GAAwB,mBAAoB,EAAGlY,EAAOvB,KAAK2b,OAAO,GAClEzO,EAAiB,mBAAoB,EAAG6O,GAAY,GACpD,IAAMC,EAAW,IAAIhU,EAMrB,OALAhI,KAAKic,MAAMG,gBACTpc,KAAK2b,MACLpa,EACAya,EAASG,aAAaJ,IAEjBC,EAAS7T,SASlB2T,6BAAA,SACEva,EACAiY,EACAuC,GAEAvP,EAAiB,+BAAgC,EAAG,EAAG9L,UAAUC,QACjE6Z,GAAqB,+BAAgCxa,KAAK2b,OAC1DlC,GACE,+BACA,EACAlY,EACAvB,KAAK2b,OACL,GAEFxB,GAAiB,+BAAgC,EAAGX,GAAU,GAC9DtM,EAAiB,+BAAgC,EAAG6O,GAAY,GAEhE,IAAMC,EAAW,IAAIhU,EAOrB,OANAhI,KAAKic,MAAMI,4BACTrc,KAAK2b,MACLpa,EACAiY,EACAwC,EAASG,aAAaJ,IAEjBC,EAAS7T,SAQlB2T,oBAAA,SACEQ,EACAP,GAIA,GAFAvP,EAAiB,sBAAuB,EAAG,EAAG9L,UAAUC,QACxD6Z,GAAqB,sBAAuBxa,KAAK2b,OAC7Chc,MAAM+F,QAAQ4W,GAAgB,CAEhC,IADA,IAAMC,EAA6C,GAC1C/b,EAAI,EAAGA,EAAI8b,EAAc3b,SAAUH,EAC1C+b,EAAiB,GAAK/b,GAAK8b,EAAc9b,GAE3C8b,EAAgBC,EAChBxS,GACE,gOAIJ6P,GACE,sBACA,EACA0C,EACAtc,KAAK2b,OACL,GAEFzO,EAAiB,sBAAuB,EAAG6O,GAAY,GACvD,IAAMC,EAAW,IAAIhU,EAMrB,OALAhI,KAAKic,MAAMO,mBACTxc,KAAK2b,MACLW,EACAN,EAASG,aAAaJ,IAEjBC,EAAS7T,aA1HlB,YAAoB8T,EAAqBN,GAArB3b,WAAAic,EAAqBjc,WAAA2b,EClB3C,QAYEc,oBAAA,WAEE,OADAjQ,EAAiB,2BAA4B,EAAG,EAAG9L,UAAUC,QACtD,CAAE+b,UAAW1c,KAAK0c,UAAWC,SAAU3c,KAAK2c,SAASC,eAN9D,YAAmBF,EAA2BC,GAA3B3c,eAAA0c,EAA2B1c,cAAA2c,ECKzC,IAECE,GAKFC,GAMEC,GAbKC,IAELH,GACJ,mEAIEC,GAAe,EAMbC,GAA0B,GAEzB,SAAUnP,GACf,IAGIpN,EAHEyc,EAAgBrP,IAAQkP,GAC9BA,GAAelP,EAGf,IAAMsP,EAAiB,IAAIvd,MAAM,GACjC,IAAKa,EAAI,EAAQ,GAALA,EAAQA,IAClB0c,EAAe1c,GAAKqc,GAAWxV,OAAOuG,EAAM,IAG5CA,EAAM4F,KAAKI,MAAMhG,EAAM,IAEzBnJ,EAAe,IAARmJ,EAAW,4BAElB,IAAI4E,EAAK0K,EAAe3W,KAAK,IAE7B,GAAK0W,EAIE,CAGL,IAAKzc,EAAI,GAAS,GAALA,GAA+B,KAArBuc,GAAcvc,GAAWA,IAC9Cuc,GAAcvc,GAAK,EAErBuc,GAAcvc,UATd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBuc,GAAcvc,GAAKgT,KAAKI,MAAsB,GAAhBJ,KAAK2J,UAUvC,IAAK3c,EAAI,EAAGA,EAAI,GAAIA,IAClBgS,GAAMqK,GAAWxV,OAAO0V,GAAcvc,IAIxC,OAFAiE,EAAqB,KAAd+N,EAAG7R,OAAe,oCAElB6R,QCwFF4K,QAAP,SAAYpP,EAAcqP,GACxB,OAAO,IAAID,GAAUpP,EAAMqP,QAT7B,YAAmBrP,EAAqBqP,GAArBrd,UAAAgO,EAAqBhO,UAAAqd,ECxI1C,ICFIC,ODoBFC,wBAAA,WACE,OAAOvd,KAAKwd,QAAQtM,KAAKlR,OAW3Bud,iCAAA,SAAoBE,EAAeC,GACjC,IAAMC,EAAa,IAAIP,GAAUxK,GAAU6K,GACrCG,EAAa,IAAIR,GAAUxK,GAAU8K,GAC3C,OAAgD,IAAzC1d,KAAKwd,QAAQG,EAAYC,IAOlCL,qBAAA,WAEE,OAAQH,GAAkBS,SA1C9B,eCAA,WAA8B/d,QAAAyd,IAC5B/d,sBAAWse,uBAAX,WACE,OAAOR,QAGT,SAAwBvO,GACtBuO,GAAevO,mCAMjB+O,qBAAA,SAAQlS,EAAcrM,GACpB,OAAOuT,GAAYlH,EAAEoC,KAAMzO,EAAEyO,OAM/B8P,yBAAA,SAAYT,GAGV,MAAMzY,EAAe,oDAMvBkZ,iCAAA,SAAoBL,EAAeC,GACjC,OAAO,GAMTI,qBAAA,WAEE,OAAQV,GAAkBS,KAM5BC,qBAAA,WAGE,OAAO,IAAIV,GAAUvK,GAAUyK,KAQjCQ,sBAAA,SAASC,EAAoB/P,GAM3B,OALAvJ,EACwB,iBAAfsZ,EACP,gDAGK,IAAIX,GAAUW,EAAYT,KAMnCQ,sBAAA,WACE,MAAO,YAnEX,+DAuEO,ICzEHE,GDyESC,GAAY,IAAIH,GC/DG,SAAnBI,GAA6B1E,GACxC,MAAwB,iBAAbA,EACF,UAAYnG,GAAsBmG,GAElC,UAAYA,EASa,SAAvB2E,GAAiCC,GAC5C,GAAIA,EAAaC,aAAc,CAC7B,IAAMtP,EAAMqP,EAAarP,MACzBtK,EACiB,iBAARsK,GACU,iBAARA,GACS,iBAARA,GAAoBpE,EAASoE,EAAkB,OACzD,6CAGFtK,EACE2Z,IAAiBJ,IAAYI,EAAatT,UAC1C,gCAIJrG,EACE2Z,IAAiBJ,IAAYI,EAAaE,cAAcxT,UACxD,sDA/BG,ICPHyT,GCJAC,GACAR,UDWFxe,sBAAWif,oCAIX,WACE,OAAOF,QALT,SAAqCxP,GACnCwP,GAA4BxP,mCAoC9B0P,wBAAA,WACE,OAAO,GAITA,yBAAA,WACE,OAAOze,KAAK0e,eAIdD,4BAAA,SAAeE,GACb,OAAO,IAAIF,GAASze,KAAK4e,OAAQD,IAInCF,+BAAA,SAAkBI,GAEhB,MAAkB,cAAdA,EACK7e,KAAK0e,cAELD,GAASF,0BAA0BO,YAK9CL,sBAAA,SAAStH,GACP,OAAIA,EAAKrM,UACA9K,KACsB,cAApBmX,EAAKvB,WACP5V,KAAK0e,cAELD,GAASF,0BAA0BO,YAO9CL,sBAAA,WACE,OAAO,GAITA,qCAAA,SAAwBI,EAAmBE,GACzC,OAAO,MAITN,kCAAA,SAAqBI,EAAmBG,GACtC,MAAkB,cAAdH,EACK7e,KAAKif,eAAeD,GAClBA,EAAalU,WAA2B,cAAd+T,EAC5B7e,KAEAye,GAASF,0BAA0BO,WAAWI,qBACnDL,EACAG,GACAC,eAAejf,KAAK0e,gBAK1BD,yBAAA,SAAYtH,EAAY6H,GACtB,IAAMG,EAAQhI,EAAKvB,WACnB,OAAc,OAAVuJ,EACKH,EACEA,EAAalU,WAAuB,cAAVqU,EAC5Bnf,MAEPyE,EACY,cAAV0a,GAA8C,IAArBhI,EAAKb,YAC9B,8CAGKtW,KAAKkf,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,IAAiBvf,KAAKse,cAAcxT,UAC/B,CACL0U,SAAUxf,KAAKyf,WACfC,YAAa1f,KAAKse,cAAcvP,OAG3B/O,KAAKyf,YAKhBhB,kBAAA,WACE,GAAuB,OAAnBze,KAAK2f,UAAoB,CAC3B,IAAIC,EAAS,GACR5f,KAAK0e,cAAc5T,YACtB8U,GACE,YACA1B,GAAiBle,KAAK0e,cAAc3P,OACpC,KAGJ,IAAMU,SAAczP,KAAK4e,OACzBgB,GAAUnQ,EAAO,IAEfmQ,GADW,UAATnQ,EACQ4D,GAAsBrT,KAAK4e,QAE3B5e,KAAK4e,OAEjB5e,KAAK2f,UAAYnP,GAAKoP,GAExB,OAAO5f,KAAK2f,WAOdlB,sBAAA,WACE,OAAOze,KAAK4e,QAMdH,uBAAA,SAAUpI,GACR,OAAIA,IAAUoI,GAASF,0BAA0BO,WACxC,EACEzI,aAAiBoI,GAASF,2BAC3B,GAER9Z,EAAO4R,EAAMgI,aAAc,qBACpBre,KAAK6f,mBAAmBxJ,KAU3BoI,gCAAR,SAA2BqB,GACzB,IAAMC,SAAuBD,EAAUlB,OACjCoB,SAAsBhgB,KAAK4e,OAC3BqB,EAAaxB,GAASyB,iBAAiBzH,QAAQsH,GAC/CI,EAAY1B,GAASyB,iBAAiBzH,QAAQuH,GAGpD,OAFAvb,EAAqB,GAAdwb,EAAiB,sBAAwBF,GAChDtb,EAAoB,GAAb0b,EAAgB,sBAAwBH,GAC3CC,IAAeE,EAEI,UAAjBH,EAEK,EAGHhgB,KAAK4e,OAASkB,EAAUlB,QAClB,EACC5e,KAAK4e,SAAWkB,EAAUlB,OAC5B,EAEA,EAIJuB,EAAYF,GAOvBxB,uBAAA,WACE,OAAOze,MAMTye,uBAAA,WACE,OAAO,GAMTA,oBAAA,SAAOpI,GAIL,OAAIA,IAAUrW,QAEHqW,EAAMgI,eAGbre,KAAK4e,SAFWvI,EAEUuI,QAC1B5e,KAAK0e,cAAc0B,OAHH/J,EAGoBqI,iBAjPnCD,oBAAmB,CAAC,SAAU,UAAW,SAAU,cAU1D,YACmBG,EACTF,gBAAAA,EAAsBD,GAASF,0BAA0BO,YADhD9e,YAAA4e,EACT5e,mBAAA0e,EAVF1e,eAA2B,KAYjCyE,OACkBqD,IAAhB9H,KAAK4e,QAAwC,OAAhB5e,KAAK4e,OAClC,4DAGFT,GAAqBne,KAAK0e,eC7B9B,+DA8DO,IAAM2B,GAAiB,IA9DKvgB,QAAAyd,IAIjC+C,qBAAA,SAAQ1U,EAAcrM,GACpB,IAAMghB,EAAY3U,EAAEyR,KAAKiB,cACnBkC,EAAYjhB,EAAE8d,KAAKiB,cACnBmC,EAAWF,EAAUG,UAAUF,GACrC,OAAiB,IAAbC,EACK3N,GAAYlH,EAAEoC,KAAMzO,EAAEyO,MAEtByS,GAOXH,yBAAA,SAAYjD,GACV,OAAQA,EAAKiB,cAAcxT,WAM7BwV,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,EAAqB/P,GAC5B,IAAMoQ,EAAeI,GAAaT,GAClC,OAAO,IAAIX,GAAUpP,EAAM,IAAIyQ,GAAS,kBAAmBL,KAM7DkC,sBAAA,WACE,MAAO,qBCDTK,qBAAA,WACE,GAA+B,IAA3B3gB,KAAK4gB,WAAWjgB,OAClB,OAAO,KAGT,IACIiB,EADAyb,EAAOrd,KAAK4gB,WAAW3d,MAQ3B,GALErB,EADE5B,KAAK6gB,iBACE7gB,KAAK6gB,iBAAiBxD,EAAK7T,IAAK6T,EAAK9b,OAEpC,CAAEiI,IAAK6T,EAAK7T,IAAKjI,MAAO8b,EAAK9b,OAGrCvB,KAAK8gB,WAEP,IADAzD,EAAOA,EAAKrH,MACJqH,EAAKvS,WACX9K,KAAK4gB,WAAW1d,KAAKma,GACrBA,EAAOA,EAAKpH,WAId,IADAoH,EAAOA,EAAKpH,OACJoH,EAAKvS,WACX9K,KAAK4gB,WAAW1d,KAAKma,GACrBA,EAAOA,EAAKrH,KAIhB,OAAOpU,GAGT+e,qBAAA,WACE,OAAgC,EAAzB3gB,KAAK4gB,WAAWjgB,QAGzBggB,kBAAA,WACE,GAA+B,IAA3B3gB,KAAK4gB,WAAWjgB,OAClB,OAAO,KAGT,IAAM0c,EAAOrd,KAAK4gB,WAAW5gB,KAAK4gB,WAAWjgB,OAAS,GACtD,OAAIX,KAAK6gB,iBACA7gB,KAAK6gB,iBAAiBxD,EAAK7T,IAAK6T,EAAK9b,OAEpC,CAAEiI,IAAK6T,EAAK7T,IAAKjI,MAAO8b,EAAK9b,YAlFzC,YACE8b,EACA0D,EACAC,EACQF,EACAD,gBAAAA,QADA7gB,gBAAA8gB,EACA9gB,sBAAA6gB,EAfF7gB,gBAA0D,GAkBhE,IADA,IAAIoW,EAAM,GACFiH,EAAKvS,WAQX,GAPAuS,EAAOA,EACPjH,EAAM2K,EAAWC,EAAW3D,EAAK7T,IAAKuX,GAAY,EAE9CD,IACF1K,IAAQ,GAGNA,EAAM,EAGNiH,EADErd,KAAK8gB,WACAzD,EAAKrH,KAELqH,EAAKpH,UAET,CAAA,GAAY,IAARG,EAAW,CAEpBpW,KAAK4gB,WAAW1d,KAAKma,GACrB,MAGArd,KAAK4gB,WAAW1d,KAAKma,GAEnBA,EADErd,KAAK8gB,WACAzD,EAAKpH,MAELoH,EAAKrH,MAyDtB,QAwCEiL,kBAAA,SACEzX,EACAjI,EACA2f,EACAlL,EACAC,GAEA,OAAO,IAAIgL,GACF,MAAPzX,EAAcA,EAAMxJ,KAAKwJ,IAChB,MAATjI,EAAgBA,EAAQvB,KAAKuB,MACpB,MAAT2f,EAAgBA,EAAQlhB,KAAKkhB,MACrB,MAARlL,EAAeA,EAAOhW,KAAKgW,KAClB,MAATC,EAAgBA,EAAQjW,KAAKiW,QAOjCgL,mBAAA,WACE,OAAOjhB,KAAKgW,KAAKmL,QAAU,EAAInhB,KAAKiW,MAAMkL,SAM5CF,qBAAA,WACE,OAAO,GAYTA,8BAAA,SAAiB3B,GACf,OACEtf,KAAKgW,KAAKoL,iBAAiB9B,MACzBA,EAAOtf,KAAKwJ,IAAKxJ,KAAKuB,QACxBvB,KAAKiW,MAAMmL,iBAAiB9B,IAYhC2B,8BAAA,SAAiB3B,GACf,OACEtf,KAAKiW,MAAMoL,iBAAiB/B,IAC5BA,EAAOtf,KAAKwJ,IAAKxJ,KAAKuB,QACtBvB,KAAKgW,KAAKqL,iBAAiB/B,IAQvB2B,kBAAR,WACE,OAAIjhB,KAAKgW,KAAKlL,UACL9K,KAECA,KAAKgW,KAAwBsL,QAOzCL,oBAAA,WACE,OAAOjhB,KAAKshB,OAAO9X,KAMrByX,oBAAA,WACE,OAAIjhB,KAAKiW,MAAMnL,UACN9K,KAAKwJ,IAELxJ,KAAKiW,MAAMsL,UAWtBN,oBAAA,SAAOzX,EAAQjI,EAAUyf,GACvB,IAAIvgB,EAAoBT,KAClBoW,EAAM4K,EAAWxX,EAAK/I,EAAE+I,KAc9B,OAZE/I,EADE2V,EAAM,EACJ3V,EAAE+gB,KAAK,KAAM,KAAM,KAAM/gB,EAAEuV,KAAKyL,OAAOjY,EAAKjI,EAAOyf,GAAa,MACnD,IAAR5K,EACL3V,EAAE+gB,KAAK,KAAMjgB,EAAO,KAAM,KAAM,MAEhCd,EAAE+gB,KACJ,KACA,KACA,KACA,KACA/gB,EAAEwV,MAAMwL,OAAOjY,EAAKjI,EAAOyf,KAGtBU,UAOHT,wBAAR,WACE,GAAIjhB,KAAKgW,KAAKlL,UACZ,OAAO6W,GAAU7C,WAEnB,IAAIre,EAAoBT,KAKxB,OAJKS,EAAEuV,KAAK4L,UAAanhB,EAAEuV,KAAKA,KAAK4L,WACnCnhB,EAAIA,EAAEohB,iBAERphB,EAAIA,EAAE+gB,KAAK,KAAM,KAAM,KAAO/gB,EAAEuV,KAAwB8L,aAAc,OAC7DJ,UAQXT,oBAAA,SACEzX,EACAwX,GAEA,IAAIvgB,EAAGshB,EAEP,GAAIf,EAAWxX,GADf/I,EAAIT,MACkBwJ,KAAO,EACtB/I,EAAEuV,KAAKlL,WAAcrK,EAAEuV,KAAK4L,UAAanhB,EAAEuV,KAAKA,KAAK4L,WACxDnhB,EAAIA,EAAEohB,gBAERphB,EAAIA,EAAE+gB,KAAK,KAAM,KAAM,KAAM/gB,EAAEuV,KAAK3E,OAAO7H,EAAKwX,GAAa,UACxD,CAOL,GANIvgB,EAAEuV,KAAK4L,WACTnhB,EAAIA,EAAEuhB,gBAEHvhB,EAAEwV,MAAMnL,WAAcrK,EAAEwV,MAAM2L,UAAanhB,EAAEwV,MAAMD,KAAK4L,WAC3DnhB,EAAIA,EAAEwhB,iBAEuB,IAA3BjB,EAAWxX,EAAK/I,EAAE+I,KAAY,CAChC,GAAI/I,EAAEwV,MAAMnL,UACV,OAAO6W,GAAU7C,WAEjBiD,EAAYthB,EAAEwV,MAAyBqL,OACvC7gB,EAAIA,EAAE+gB,KACJO,EAASvY,IACTuY,EAASxgB,MACT,KACA,KACCd,EAAEwV,MAAyB6L,cAIlCrhB,EAAIA,EAAE+gB,KAAK,KAAM,KAAM,KAAM,KAAM/gB,EAAEwV,MAAM5E,OAAO7H,EAAKwX,IAEzD,OAAOvgB,EAAEihB,UAOXT,oBAAA,WACE,OAAOjhB,KAAKkhB,OAOND,oBAAR,WACE,IAAIxgB,EAAoBT,KAUxB,OATIS,EAAEwV,MAAM2L,WAAanhB,EAAEuV,KAAK4L,WAC9BnhB,EAAIA,EAAEyhB,eAEJzhB,EAAEuV,KAAK4L,UAAYnhB,EAAEuV,KAAKA,KAAK4L,WACjCnhB,EAAIA,EAAEuhB,gBAEJvhB,EAAEuV,KAAK4L,UAAYnhB,EAAEwV,MAAM2L,WAC7BnhB,EAAIA,EAAE0hB,cAED1hB,GAODwgB,0BAAR,WACE,IAAIxgB,EAAIT,KAAKmiB,aAYb,OAXI1hB,EAAEwV,MAAMD,KAAK4L,WASfnhB,GADAA,GAPAA,EAAIA,EAAE+gB,KACJ,KACA,KACA,KACA,KACC/gB,EAAEwV,MAAyB+L,iBAExBE,eACAC,cAED1hB,GAODwgB,2BAAR,WACE,IAAIxgB,EAAIT,KAAKmiB,aAKb,OAJI1hB,EAAEuV,KAAKA,KAAK4L,WAEdnhB,GADAA,EAAIA,EAAEuhB,gBACAG,cAED1hB,GAODwgB,yBAAR,WACE,IAAMmB,EAAKpiB,KAAKwhB,KAAK,KAAM,KAAMP,GAASoB,IAAK,KAAMriB,KAAKiW,MAAMD,MAChE,OAAOhW,KAAKiW,MAAMuL,KAAK,KAAM,KAAMxhB,KAAKkhB,MAAOkB,EAAI,OAO7CnB,0BAAR,WACE,IAAMqB,EAAKtiB,KAAKwhB,KAAK,KAAM,KAAMP,GAASoB,IAAKriB,KAAKgW,KAAKC,MAAO,MAChE,OAAOjW,KAAKgW,KAAKwL,KAAK,KAAM,KAAMxhB,KAAKkhB,MAAO,KAAMoB,IAO9CrB,wBAAR,WACE,IAAMjL,EAAOhW,KAAKgW,KAAKwL,KAAK,KAAM,MAAOxhB,KAAKgW,KAAKkL,MAAO,KAAM,MAC1DjL,EAAQjW,KAAKiW,MAAMuL,KAAK,KAAM,MAAOxhB,KAAKiW,MAAMiL,MAAO,KAAM,MACnE,OAAOlhB,KAAKwhB,KAAK,KAAM,MAAOxhB,KAAKkhB,MAAOlL,EAAMC,IAS1CgL,4BAAR,WACE,IAAMsB,EAAaviB,KAAKwiB,SACxB,OAAOhP,KAAKE,IAAI,EAAK6O,IAAeviB,KAAKmhB,QAAU,GAOrDF,oBAAA,WACE,GAAIjhB,KAAK4hB,UAAY5hB,KAAKgW,KAAK4L,SAC7B,MAAM,IAAI/c,MACR,0BAA4B7E,KAAKwJ,IAAM,IAAMxJ,KAAKuB,MAAQ,KAG9D,GAAIvB,KAAKiW,MAAM2L,SACb,MAAM,IAAI/c,MACR,mBAAqB7E,KAAKwJ,IAAM,IAAMxJ,KAAKuB,MAAQ,YAGvD,IAAMghB,EAAaviB,KAAKgW,KAAKwM,SAC7B,GAAID,IAAeviB,KAAKiW,MAAMuM,SAC5B,MAAM,IAAI3d,MAAM,uBAEhB,OAAO0d,GAAcviB,KAAK4hB,SAAW,EAAI,IAnTtCX,QAAM,EACNA,UAAQ,MAff,YACSzX,EACAjI,EACP2f,EACAlL,EACAC,GAJOjW,SAAAwJ,EACAxJ,WAAAuB,EAKPvB,KAAKkhB,MAAiB,MAATA,EAAgBA,EAAQD,GAASoB,IAC9CriB,KAAKgW,KACK,MAARA,EAAeA,EAAQ2L,GAAU7C,WACnC9e,KAAKiW,MACM,MAATA,EAAgBA,EAAS0L,GAAU7C,WA8TzC,QAYE2D,kBAAA,SACEjZ,EACAjI,EACA2f,EACAlL,EACAC,GAEA,OAAOjW,MAWTyiB,oBAAA,SAAOjZ,EAAQjI,EAAUyf,GACvB,OAAO,IAAIC,GAASzX,EAAKjI,EAAO,OAUlCkhB,oBAAA,SAAOjZ,EAAQwX,GACb,OAAOhhB,MAMTyiB,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,SAAOnY,EAAQjI,GACb,OAAO,IAAIogB,GACT3hB,KAAK0iB,YACL1iB,KAAK2iB,MACFlB,OAAOjY,EAAKjI,EAAOvB,KAAK0iB,aACxBlB,KAAK,KAAM,KAAMP,GAAS2B,MAAO,KAAM,QAU9CjB,oBAAA,SAAOnY,GACL,OAAO,IAAImY,GACT3hB,KAAK0iB,YACL1iB,KAAK2iB,MACFtR,OAAO7H,EAAKxJ,KAAK0iB,aACjBlB,KAAK,KAAM,KAAMP,GAAS2B,MAAO,KAAM,QAW9CjB,iBAAA,SAAInY,GAGF,IAFA,IAAI4M,EACAiH,EAAOrd,KAAK2iB,OACRtF,EAAKvS,WAAW,CAEtB,GAAY,KADZsL,EAAMpW,KAAK0iB,YAAYlZ,EAAK6T,EAAK7T,MAE/B,OAAO6T,EAAK9b,MACH6U,EAAM,EACfiH,EAAOA,EAAKrH,KACG,EAANI,IACTiH,EAAOA,EAAKpH,OAGhB,OAAO,MAQT0L,+BAAA,SAAkBnY,GAIhB,IAHA,IAAI4M,EACFiH,EAAOrd,KAAK2iB,MACZE,EAAc,MACRxF,EAAKvS,WAAW,CAEtB,GAAY,KADZsL,EAAMpW,KAAK0iB,YAAYlZ,EAAK6T,EAAK7T,MAClB,CACb,GAAK6T,EAAKrH,KAAKlL,UAMR,OAAI+X,EACFA,EAAYrZ,IAEZ,KAPP,IADA6T,EAAOA,EAAKrH,MACJqH,EAAKpH,MAAMnL,WACjBuS,EAAOA,EAAKpH,MAEd,OAAOoH,EAAK7T,IAML4M,EAAM,EACfiH,EAAOA,EAAKrH,KACG,EAANI,IAETiH,GADAwF,EAAcxF,GACFpH,OAIhB,MAAM,IAAIpR,MACR,0EAOJ8c,qBAAA,WACE,OAAO3hB,KAAK2iB,MAAM7X,WAMpB6W,mBAAA,WACE,OAAO3hB,KAAK2iB,MAAMxB,SAMpBQ,oBAAA,WACE,OAAO3hB,KAAK2iB,MAAMG,UAMpBnB,oBAAA,WACE,OAAO3hB,KAAK2iB,MAAMpB,UAYpBI,8BAAA,SAAiBrC,GACf,OAAOtf,KAAK2iB,MAAMvB,iBAAiB9B,IAWrCqC,8BAAA,SAAiBrC,GACf,OAAOtf,KAAK2iB,MAAMtB,iBAAiB/B,IASrCqC,yBAAA,SACEoB,GAEA,OAAO,IAAIpC,GACT3gB,KAAK2iB,MACL,KACA3iB,KAAK0iB,aACL,EACAK,IAIJpB,6BAAA,SACEnY,EACAuZ,GAEA,OAAO,IAAIpC,GACT3gB,KAAK2iB,MACLnZ,EACAxJ,KAAK0iB,aACL,EACAK,IAIJpB,oCAAA,SACEnY,EACAuZ,GAEA,OAAO,IAAIpC,GACT3gB,KAAK2iB,MACLnZ,EACAxJ,KAAK0iB,aACL,EACAK,IAIJpB,gCAAA,SACEoB,GAEA,OAAO,IAAIpC,GACT3gB,KAAK2iB,MACL,KACA3iB,KAAK0iB,aACL,EACAK,IAlNGpB,cAAa,IAAIc,OAOxB,YACUC,EACAC,gBAAAA,EAEkBhB,GAAU7C,YAH5B9e,iBAAA0iB,EACA1iB,WAAA2iB,ECvlBZ,IAAMK,GAAQxP,KAAKvC,IAAI,OA2BrBgS,0BAAA,WAEE,IAAMrhB,IAAW5B,KAAKkjB,MAAS,GAAOljB,KAAKmjB,UAE3C,OADAnjB,KAAKmjB,WACEvhB,OAlBT,YAAYjB,GACV,IAAkByiB,EAIlBpjB,KAAKmhB,OAJaiC,EAIIziB,EAAS,EAF7BwT,SAAUX,KAAKvC,IAAImS,GAAOJ,GAAe,KAG3ChjB,KAAKmjB,SAAWnjB,KAAKmhB,MAAQ,EAC7B,IAHiBpN,EAGXsP,GAHWtP,EAGI/T,KAAKmhB,MAHQhN,SAASxU,MAAMoU,EAAO,GAAGxN,KAAK,KAAM,IAItEvG,KAAKkjB,MAASviB,EAAS,EAAK0iB,EA6BzB,IC7CHC,GCkBAxE,GF2BSyE,GAAgB,SAC3BC,EACApN,EACAqN,EACAC,GAEAF,EAAUrQ,KAAKiD,GAEf,IAAMuN,EAAoB,SACxBC,EACAlT,GAEA,IACImT,EACAra,EAFE7I,EAAS+P,EAAOkT,EAGtB,GAAe,GAAXjjB,EACF,OAAO,KACF,GAAe,GAAXA,EAGT,OAFAkjB,EAAYL,EAAUI,GACtBpa,EAAMia,EAAQA,EAAMI,GAAeA,EAC5B,IAAI5C,GACTzX,EACCqa,EAAUxG,KACX4D,GAAS2B,MACT,KACA,MAIF,IAAMkB,EAAS3P,SAAUxT,EAAS,EAAW,IAAMijB,EAC7C5N,EAAO2N,EAAkBC,EAAKE,GAC9B7N,EAAQ0N,EAAkBG,EAAS,EAAGpT,GAG5C,OAFAmT,EAAYL,EAAUM,GACtBta,EAAMia,EAAQA,EAAMI,GAAeA,EAC5B,IAAI5C,GACTzX,EACCqa,EAAUxG,KACX4D,GAAS2B,MACT5M,EACAC,IAsDA8N,EAjDmB,SAAUC,GAiCjC,IAhCA,IAAI3G,EAAuB,KACvB0G,EAAO,KACP1E,EAAQmE,EAAU7iB,OAEhBsjB,EAAe,SAAUC,EAAmBhD,GAChD,IAAM0C,EAAMvE,EAAQ6E,EACdxT,EAAO2O,EACbA,GAAS6E,EACT,IAAMC,EAAYR,EAAwB,EAANC,EAASlT,GACvCmT,EAAYL,EAAUI,GACtBpa,EAASia,EAAQA,EAAMI,GAAeA,EAC5CO,EACE,IAAInD,GACFzX,EACCqa,EAAUxG,KACX6D,EACA,KACAiD,KAKAC,EAAgB,SAAUC,GAG5BhH,EAFEA,EACFA,EAAKrH,KAAOqO,EAGZN,EAAOM,GAKF7jB,EAAI,EAAGA,EAAIwjB,EAAO7C,QAAS3gB,EAAG,CACrC,IAAM8jB,EAAQN,EAAOO,eAEfL,EAAY1Q,KAAKE,IAAI,EAAGsQ,EAAO7C,OAAS3gB,EAAI,IAC9C8jB,EACFL,EAAaC,EAAWjD,GAAS2B,QAGjCqB,EAAaC,EAAWjD,GAAS2B,OACjCqB,EAAaC,EAAWjD,GAASoB,MAGrC,OAAO0B,EAIIS,CADE,IAAIvB,GAAUO,EAAU7iB,SAGvC,OAAO,IAAIghB,GAAgB+B,GAActN,EAAa2N,IC1IlDU,GAAiB,OAMrBjlB,sBAAWklB,kBAAX,WAWE,OAVAjgB,EACoB4b,GAClB,uCAEFiD,GACEA,IACA,IAAIoB,GACF,CAAEhF,YAAa+E,IACf,CAAE/E,YAAaW,sCAYrBqE,iBAAA,SAAIC,GACF,IAAMC,EAAY/Z,EAAQ7K,KAAK6kB,SAAUF,GACzC,IAAKC,EACH,MAAM,IAAI/f,MAAM,wBAA0B8f,GAG5C,OAAIC,aAAqBjD,GAChBiD,EAIA,MAIXF,sBAAA,SAASI,GACP,OAAOna,EAAS3K,KAAK+kB,UAAWD,EAAgB5U,aAGlDwU,sBAAA,SACEI,EACAE,GAEAvgB,EACEqgB,IAAoB7G,GACpB,uEAMF,IAJA,IAUIgH,EAVEzB,EAAY,GACd0B,GAAkB,EAChBC,EAAOH,EAAiBI,YAAYhI,GAAUiI,MAChD5jB,EAAO0jB,EAAKG,UACT7jB,GACLyjB,EACEA,GAAmBJ,EAAgBS,YAAY9jB,EAAK4b,MACtDmG,EAAUtgB,KAAKzB,GACfA,EAAO0jB,EAAKG,UAIZL,EADEC,EACS3B,GAAcC,EAAWsB,EAAgBU,cAEzCf,GAEb,IAAMgB,EAAYX,EAAgB5U,WAC5BwV,OAAmB1lB,KAAK+kB,WAC9BW,EAAYD,GAAaX,EACzB,IAAMa,OAAkB3lB,KAAK6kB,UAE7B,OADAc,EAAWF,GAAaR,EACjB,IAAIP,GAASiB,EAAYD,IAMlChB,0BAAA,SACEb,EACAmB,GAFF,WAwCE,OAAO,IAAIN,GApCQ3Z,EACjB/K,KAAK6kB,SACL,SAACe,EAA6CH,GAC5C,IAAMpG,EAAQxU,EAAQ3C,EAAK6c,UAAWU,GAEtC,GADAhhB,EAAO4a,EAAO,oCAAsCoG,GAChDG,IAAoBnB,GAAgB,CAEtC,GAAIpF,EAAMkG,YAAY1B,EAAUxG,MAAO,CAKrC,IAHA,IAAMmG,EAAY,GACZ2B,EAAOH,EAAiBI,YAAYhI,GAAUiI,MAChD5jB,EAAO0jB,EAAKG,UACT7jB,GACDA,EAAKuM,OAAS6V,EAAU7V,MAC1BwV,EAAUtgB,KAAKzB,GAEjBA,EAAO0jB,EAAKG,UAGd,OADA9B,EAAUtgB,KAAK2gB,GACRN,GAAcC,EAAWnE,EAAMmG,cAGtC,OAAOf,GAGT,IAAMoB,EAAeb,EAAiBxT,IAAIqS,EAAU7V,MAChD8X,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAYzU,OACxB,IAAI+L,GAAUyG,EAAU7V,KAAM6X,KAG3BC,EAAYrE,OAAOoC,EAAWA,EAAUxG,QAIrBrd,KAAK+kB,YAMvCL,+BAAA,SACEb,EACAmB,GAqBA,OAAO,IAAIN,GAnBQ3Z,EACjB/K,KAAK6kB,SACL,SAACe,GACC,GAAIA,IAAoBnB,GAEtB,OAAOmB,EAEP,IAAMC,EAAeb,EAAiBxT,IAAIqS,EAAU7V,MACpD,OAAI6X,EACKD,EAAgBvU,OACrB,IAAI+L,GAAUyG,EAAU7V,KAAM6X,IAIzBD,IAKiB5lB,KAAK+kB,gBAlIvC,YACUF,EAGAE,GAHA/kB,cAAA6kB,EAGA7kB,eAAA+kB,WEhCIgB,GAAqB/P,EAAiBC,GACpD,OAAOnD,GAAYkD,EAAKhI,KAAMiI,EAAMjI,eAGtBgY,GAAgBhQ,EAAcC,GAC5C,OAAOnD,GAAYkD,EAAMC,GD6B3B,WAGEzW,sBAAWymB,qBAAX,WACE,OAEGnH,GADDA,IACc,IAAImH,GAChB,IAAItE,GAAwBqE,IAC5B,KACAtB,GAASwB,0CAmCfD,wBAAA,WACE,OAAO,GAITA,yBAAA,WACE,OAAOjmB,KAAK0e,eAAiBI,IAI/BmH,4BAAA,SAAetH,GACb,OAAI3e,KAAKmmB,UAAUrb,UAEV9K,KAEA,IAAIimB,GAAajmB,KAAKmmB,UAAWxH,EAAiB3e,KAAKomB,YAKlEH,+BAAA,SAAkBpH,GAEhB,GAAkB,cAAdA,EACF,OAAO7e,KAAKse,cAEZ,IAAM5H,EAAQ1W,KAAKmmB,UAAU3U,IAAIqN,GACjC,OAAiB,OAAVnI,EAAiBoI,GAAapI,GAKzCuP,sBAAA,SAAS9O,GACP,IAAMgI,EAAQhI,EAAKvB,WACnB,OAAc,OAAVuJ,EACKnf,KAGFA,KAAKqmB,kBAAkBlH,GAAOmH,SAASnP,EAAKpB,aAIrDkQ,sBAAA,SAASpH,GACP,OAAyC,OAAlC7e,KAAKmmB,UAAU3U,IAAIqN,IAI5BoH,kCAAA,SAAqBpH,EAAmBG,GAEtC,GADAva,EAAOua,EAAc,8CACH,cAAdH,EACF,OAAO7e,KAAKif,eAAeD,GAE3B,IAAM6E,EAAY,IAAIzG,GAAUyB,EAAWG,GACvC8G,SAAaS,SAGfA,EAFEvH,EAAalU,WACfgb,EAAc9lB,KAAKmmB,UAAU9U,OAAOwN,GACtB7e,KAAKomB,UAAUI,kBAC3B3C,EACA7jB,KAAKmmB,aAGPL,EAAc9lB,KAAKmmB,UAAU1E,OAAO5C,EAAWG,GACjChf,KAAKomB,UAAUK,aAAa5C,EAAW7jB,KAAKmmB,YAG5D,IAAMO,EAAcZ,EAAYhb,UAC5BgU,GACA9e,KAAK0e,cACT,OAAO,IAAIuH,GAAaH,EAAaY,EAAaH,IAKtDN,yBAAA,SAAY9O,EAAY6H,GACtB,IAAMG,EAAQhI,EAAKvB,WACnB,GAAc,OAAVuJ,EACF,OAAOH,EAEPva,EACsB,cAApB0S,EAAKvB,YAAmD,IAArBuB,EAAKb,YACxC,8CAEF,IAAMqQ,EAAoB3mB,KAAKqmB,kBAAkBlH,GAAOC,YACtDjI,EAAKpB,WACLiJ,GAEF,OAAOhf,KAAKkf,qBAAqBC,EAAOwH,IAK5CV,qBAAA,WACE,OAAOjmB,KAAKmmB,UAAUrb,WAIxBmb,yBAAA,WACE,OAAOjmB,KAAKmmB,UAAUhF,SAUxB8E,iBAAA,SAAI1G,GACF,GAAIvf,KAAK8K,UACP,OAAO,KAGT,IAAMF,EAAgC,GAClCgc,EAAU,EACZrF,EAAS,EACTsF,GAAiB,EAYnB,GAXA7mB,KAAK8mB,aAAazG,GAAgB,SAAC7W,EAAauV,GAC9CnU,EAAIpB,GAAOuV,EAAUhQ,IAAIwQ,GAEzBqH,IACIC,GAAkBZ,GAAarR,gBAAgBrM,KAAKiB,GACtD+X,EAAS/N,KAAK4D,IAAImK,EAAQzP,OAAOtI,IAEjCqd,GAAiB,KAIhBtH,GAAgBsH,GAAkBtF,EAAS,EAAIqF,EAAS,CAE3D,IAAMG,EAAmB,GAEzB,IAAK,IAAMvd,KAAOoB,EAChBmc,EAAOvd,GAA6BoB,EAAIpB,GAG1C,OAAOud,EAKP,OAHIxH,IAAiBvf,KAAKse,cAAcxT,YACtCF,EAAI,aAAe5K,KAAKse,cAAcvP,OAEjCnE,GAKXqb,kBAAA,WACE,GAAuB,OAAnBjmB,KAAK2f,UAAoB,CAC3B,IAAIqH,EAAS,GACRhnB,KAAKse,cAAcxT,YACtBkc,GACE,YACA9I,GAAiBle,KAAKse,cAAcvP,OACpC,KAGJ/O,KAAK8mB,aAAazG,GAAgB,SAAC7W,EAAKuV,GACtC,IAAMkI,EAAYlI,EAAUmI,OACV,KAAdD,IACFD,GAAU,IAAMxd,EAAM,IAAMyd,KAIhCjnB,KAAK2f,UAAuB,KAAXqH,EAAgB,GAAKxW,GAAKwW,GAE7C,OAAOhnB,KAAK2f,WAIdsG,qCAAA,SACEpH,EACAE,EACAM,GAEA,IAAM8H,EAAMnnB,KAAKonB,cAAc/H,GAC/B,GAAI8H,EAAK,CACP,IAAME,EAAcF,EAAIG,kBACtB,IAAIlK,GAAUyB,EAAWE,IAE3B,OAAOsI,EAAcA,EAAYrZ,KAAO,KAExC,OAAOhO,KAAKmmB,UAAUmB,kBAAkBzI,IAQ5CoH,+BAAA,SAAkBnB,GAChB,IAAMqC,EAAMnnB,KAAKonB,cAActC,GAC/B,GAAIqC,EAAK,CACP,IAAMrE,EAASqE,EAAIrE,SACnB,OAAOA,GAAUA,EAAO9U,KAExB,OAAOhO,KAAKmmB,UAAUrD,UAQ1BmD,2BAAA,SAAcnB,GACZ,IAAMhC,EAAS9iB,KAAKunB,kBAAkBzC,GACtC,OAAIhC,EACK,IAAI1F,GAAU0F,EAAQ9iB,KAAKmmB,UAAU3U,IAAIsR,IAEzC,MASXmD,8BAAA,SAAiBnB,GACf,IAAMqC,EAAMnnB,KAAKonB,cAActC,GAC/B,GAAIqC,EAAK,CACP,IAAM5F,EAAS4F,EAAI5F,SACnB,OAAOA,GAAUA,EAAOvT,KAExB,OAAOhO,KAAKmmB,UAAU5E,UAQ1B0E,0BAAA,SAAanB,GACX,IAAMvD,EAASvhB,KAAKwnB,iBAAiB1C,GACrC,OAAIvD,EACK,IAAInE,GAAUmE,EAAQvhB,KAAKmmB,UAAU3U,IAAI+P,IAEzC,MAOX0E,0BAAA,SACE5G,EACAC,GAEA,IAAM6H,EAAMnnB,KAAKonB,cAAc/H,GAC/B,OAAI8H,EACKA,EAAI/F,iBAAiB,SAAAqG,GAC1B,OAAOnI,EAAOmI,EAAYzZ,KAAMyZ,EAAYpK,QAGvCrd,KAAKmmB,UAAU/E,iBAAiB9B,IAQ3C2G,yBAAA,SACEnB,GAEA,OAAO9kB,KAAK0nB,gBAAgB5C,EAAgB6C,UAAW7C,IASzDmB,6BAAA,SACE2B,EACA9C,GAEA,IAAMqC,EAAMnnB,KAAKonB,cAActC,GAC/B,GAAIqC,EACF,OAAOA,EAAIO,gBAAgBE,EAAW,SAAApe,GAAO,OAAAA,IAO7C,IALA,IAAM3G,EAAW7C,KAAKmmB,UAAUuB,gBAC9BE,EAAU5Z,KACVoP,GAAUiI,MAER5jB,EAAOoB,EAASglB,OACL,MAARpmB,GAAgBqjB,EAAgBtH,QAAQ/b,EAAMmmB,GAAa,GAChE/kB,EAASyiB,UACT7jB,EAAOoB,EAASglB,OAElB,OAAOhlB,GAQXojB,gCAAA,SACEnB,GAEA,OAAO9kB,KAAK8nB,uBACVhD,EAAgBiD,UAChBjD,IASJmB,oCAAA,SACE+B,EACAlD,GAEA,IAAMqC,EAAMnnB,KAAKonB,cAActC,GAC/B,GAAIqC,EACF,OAAOA,EAAIW,uBAAuBE,EAAS,SAAAxe,GACzC,OAAOA,IAQT,IALA,IAAM3G,EAAW7C,KAAKmmB,UAAU2B,uBAC9BE,EAAQha,KACRoP,GAAUiI,MAER5jB,EAAOoB,EAASglB,OACL,MAARpmB,GAAyD,EAAzCqjB,EAAgBtH,QAAQ/b,EAAMumB,IACnDnlB,EAASyiB,UACT7jB,EAAOoB,EAASglB,OAElB,OAAOhlB,GAOXojB,uBAAA,SAAU5P,GACR,OAAIrW,KAAK8K,UACHuL,EAAMvL,UACD,GAEC,EAEDuL,EAAMgI,cAAgBhI,EAAMvL,UAC9B,EACEuL,IAAU2H,IACX,EAGD,GAOXiI,uBAAA,SAAUnB,GACR,GACEA,IAAoB7G,IACpBje,KAAKomB,UAAU6B,SAASnD,GAExB,OAAO9kB,KAEP,IAAMumB,EAAcvmB,KAAKomB,UAAU8B,SACjCpD,EACA9kB,KAAKmmB,WAEP,OAAO,IAAIF,GAAajmB,KAAKmmB,UAAWnmB,KAAK0e,cAAe6H,IAOhEN,uBAAA,SAAU5G,GACR,OAAOA,IAAUpB,IAAaje,KAAKomB,UAAU6B,SAAS5I,IAMxD4G,oBAAA,SAAO5P,GACL,GAAIA,IAAUrW,KACZ,OAAO,EACF,GAAIqW,EAAMgI,aACf,OAAO,EAEP,IAAM8J,EAAoB9R,EAC1B,GAAKrW,KAAKse,cAAc8B,OAAO+H,EAAkB7J,eAE1C,CAAA,GACLte,KAAKmmB,UAAUhF,UAAYgH,EAAkBhC,UAAUhF,QAkBvD,OAAO,EAZP,IAJA,IAAMiH,EAAWpoB,KAAKolB,YAAY/E,IAC5BgI,EAAYF,EAAkB/C,YAAY/E,IAC5CiI,EAAcF,EAAS9C,UACvBiD,EAAeF,EAAU/C,UACtBgD,GAAeC,GAAc,CAClC,GACED,EAAYta,OAASua,EAAava,OACjCsa,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,KAEAje,KAAKomB,UAAU5U,IAAIsT,EAAgB5U,aArU/B+V,mBAAkB,qBA9HjC,YACmBE,EACAzH,EACT0H,GAFSpmB,eAAAmmB,EACAnmB,mBAAA0e,EACT1e,eAAAomB,EAvBFpmB,eAA2B,KA8B7BA,KAAK0e,eACPP,GAAqBne,KAAK0e,eAGxB1e,KAAKmmB,UAAUrb,WACjBrG,GACGzE,KAAK0e,eAAiB1e,KAAK0e,cAAc5T,UAC1C,wCA6bN,qBACEnC,aACE,IAAIgZ,GAAwBqE,IAC5BC,GAAanH,WACb4F,GAASwB,eAmCR,IAAMlI,GAAW,IAxCKle,QAAAmmB,IAS3BuC,uBAAA,SAAUnS,GACR,OAAIA,IAAUrW,KACL,EAEA,GAIXwoB,oBAAA,SAAOnS,GAEL,OAAOA,IAAUrW,MAGnBwoB,yBAAA,WACE,OAAOxoB,MAGTwoB,+BAAA,SAAkB3J,GAChB,OAAOoH,GAAanH,YAGtB0J,qBAAA,WACE,OAAO,OAqBXhpB,OAAOipB,iBAAiBrL,GAAW,CACjCS,IAAK,CACHtc,MAAO,IAAI6b,GAAUxK,GAAUqT,GAAanH,aAE9C4J,IAAK,CACHnnB,MAAO,IAAI6b,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,cAGlBnkB,EACe,OAAb+U,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,aAAgBjpB,QAAUgpB,GA8CzB,CACL,IAAIE,EAAa5C,GAAanH,WAa9B,OAZA1L,GAAKwV,EAAM,SAACpf,EAAasf,GACvB,GAAIne,EAASie,EAAgBpf,IACC,MAAxBA,EAAI+I,UAAU,EAAG,GAAY,CAE/B,IAAMwM,EAAYP,GAAasK,IAC3B/J,EAAUV,cAAiBU,EAAUjU,YACvC+d,EAAOA,EAAK3J,qBAAqB1V,EAAKuV,OAMvC8J,EAAK5J,eAAeT,GAAahF,IA3DxC,IAAMuP,EAAwB,GAC1BC,GAAuB,EAc3B,GAZA5V,GADqBwV,EACF,SAACpf,EAAKkN,GACvB,GAA4B,MAAxBlN,EAAI+I,UAAU,EAAG,GAAY,CAE/B,IAAMwM,EAAYP,GAAa9H,GAC1BqI,EAAUjU,YACbke,EACEA,IAAyBjK,EAAUT,cAAcxT,UACnDie,EAAS7lB,KAAK,IAAIka,GAAU5T,EAAKuV,QAKf,IAApBgK,EAASpoB,OACX,OAAOslB,GAAanH,WAGtB,IAAMmK,EAAW1F,GACfwF,EACAhD,GACA,SAAAlC,GAAa,OAAAA,EAAU7V,MACvBgY,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,IA7DKrpB,QAAAyd,IAI9B6L,qBAAA,SAAQxd,EAAcrM,GACpB,IAAMkhB,EAAW7U,EAAEyR,KAAKqD,UAAUnhB,EAAE8d,MACpC,OAAiB,IAAboD,EACK3N,GAAYlH,EAAEoC,KAAMzO,EAAEyO,MAEtByS,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,EAAoB/P,GAC3B,IAAMqb,EAAY7K,GAAaT,GAC/B,OAAO,IAAIX,GAAUpP,EAAMqb,IAM7BD,sBAAA,WACE,MAAO,kBCtDoBtpB,QAAAyd,IAenB+L,0BAAV,SAAuBC,GACrB,OAAOA,EAAKjD,SAAStmB,KAAKwpB,aAM5BF,yBAAA,SAAYjM,GACV,OAAQA,EAAKiJ,SAAStmB,KAAKwpB,YAAY1e,WAMzCwe,qBAAA,SAAQ1d,EAAcrM,GACpB,IAAMkqB,EAASzpB,KAAK0pB,aAAa9d,EAAEyR,MAC7BsM,EAAS3pB,KAAK0pB,aAAanqB,EAAE8d,MAC7BoD,EAAWgJ,EAAO/I,UAAUiJ,GAClC,OAAiB,IAAblJ,EACK3N,GAAYlH,EAAEoC,KAAMzO,EAAEyO,MAEtByS,GAOX6I,sBAAA,SAASvL,EAAoB/P,GAC3B,IAAMqb,EAAY7K,GAAaT,GACzBV,EAAO4I,GAAanH,WAAWM,YACnCpf,KAAKwpB,WACLH,GAEF,OAAO,IAAIjM,GAAUpP,EAAMqP,IAM7BiM,qBAAA,WACE,IAAMjM,EAAO4I,GAAanH,WAAWM,YAAYpf,KAAKwpB,WAAYxL,IAClE,OAAO,IAAIZ,GAAUvK,GAAUwK,IAMjCiM,sBAAA,WACE,OAAOtpB,KAAKwpB,WAAW1f,QAAQvD,KAAK,UA/DtC,YAAoBijB,GAApB,MACE7gB,2BADkBT,aAAAshB,EAGlB/kB,GACG+kB,EAAW1e,WAAuC,cAA1B0e,EAAW5T,WACpC,qECYJgU,iBAAA,WAEE,OADApd,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QAC9CX,KAAK6pB,MAAM9a,OAQpB6a,uBAAA,WAEE,OADApd,EAAiB,yBAA0B,EAAG,EAAG9L,UAAUC,QACpDX,KAAK6pB,MAAM9a,KAAI,IAKxB6a,oBAAA,WAGE,OADApd,EAAiB,sBAAuB,EAAG,EAAG9L,UAAUC,QACjDX,KAAK8pB,aAQdF,oBAAA,WAEE,OADApd,EAAiB,sBAAuB,EAAG,EAAG9L,UAAUC,SAChDX,KAAK6pB,MAAM/e,WASrB8e,mBAAA,SAAMG,GACJvd,EAAiB,qBAAsB,EAAG,EAAG9L,UAAUC,QAEvDopB,EAAkBljB,OAAOkjB,GACzBxP,GAAmB,qBAAsB,EAAGwP,GAAiB,GAE7D,IAAMC,EAAY,IAAIjV,GAAKgV,GACrBE,EAAWjqB,KAAKkqB,KAAKxT,MAAMsT,GACjC,OAAO,IAAIJ,GACT5pB,KAAK6pB,MAAMvD,SAAS0D,GACpBC,EACA5J,KAUJuJ,sBAAA,SAASG,GACPvd,EAAiB,wBAAyB,EAAG,EAAG9L,UAAUC,QAC1D4Z,GAAmB,wBAAyB,EAAGwP,GAAiB,GAEhE,IAAMC,EAAY,IAAIjV,GAAKgV,GAC3B,OAAQ/pB,KAAK6pB,MAAMvD,SAAS0D,GAAWlf,WAQzC8e,yBAAA,WAIE,OAHApd,EAAiB,2BAA4B,EAAG,EAAG9L,UAAUC,QAGtDX,KAAK6pB,MAAMvL,cAAcvP,OAWlC6a,qBAAA,SAAQtK,GAAR,WAIE,OAHA9S,EAAiB,uBAAwB,EAAG,EAAG9L,UAAUC,QACzDuM,EAAiB,uBAAwB,EAAGoS,GAAQ,IAEhDtf,KAAK6pB,MAAMxL,gBAIMre,KAAK6pB,MAEJ/C,aAAa9mB,KAAKmqB,OAAQ,SAAC3gB,EAAK6T,GACpD,OAAOiC,EACL,IAAIsK,GAAavM,EAAMnV,EAAKgiB,KAAKxT,MAAMlN,GAAM6W,QASnDuJ,yBAAA,WAGE,OAFApd,EAAiB,2BAA4B,EAAG,EAAG9L,UAAUC,SAEzDX,KAAK6pB,MAAMxL,eAGLre,KAAK6pB,MAAM/e,WAIvBtL,sBAAIoqB,wBAAJ,WACE,OAAO5pB,KAAKkqB,KAAKE,0CAOnBR,yBAAA,WAGE,OAFApd,EAAiB,2BAA4B,EAAG,EAAG9L,UAAUC,QAEtDX,KAAK6pB,MAAMQ,eAMpBT,oBAAA,WAGE,OAFApd,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QAE9CX,KAAKkqB,MAGd1qB,sBAAIoqB,wBAAJ,WACE,OAAO5pB,KAAKsqB,8CA3Jd,YACmBT,EACAK,EACAC,GAFAnqB,WAAA6pB,EACA7pB,UAAAkqB,EACAlqB,YAAAmqB,ECoBrB,QAiBEI,qBAAA,WACE,IAAMC,EAAMxqB,KAAK2c,SAAS2N,SAC1B,MAAuB,UAAnBtqB,KAAKqa,UACAmQ,EAAIrT,KAEJqT,EAAIC,YAAYtT,MAO3BoT,0BAAA,WACE,OAAOvqB,KAAKqa,WAMdkQ,4BAAA,WACE,OAAOvqB,KAAK0qB,kBAAkBC,eAAe3qB,OAM/CuqB,sBAAA,WACE,OACEvqB,KAAK4qB,UAAU1a,WACf,IACAlQ,KAAKqa,UACL,IACAlQ,EAAUnK,KAAK2c,SAASmN,kBA1C5B,YACSzP,EACAqQ,EACA/N,EACAkO,GAHA7qB,eAAAqa,EACAra,uBAAA0qB,EACA1qB,cAAA2c,EACA3c,cAAA6qB,EA2CX,QAeEC,qBAAA,WACE,OAAO9qB,KAAKmX,MAMd2T,0BAAA,WACE,MAAO,UAMTA,4BAAA,WACE,OAAO9qB,KAAK0qB,kBAAkBC,eAAe3qB,OAM/C8qB,sBAAA,WACE,OAAO9qB,KAAKmX,KAAKjH,WAAa,eA/BhC,YACSwa,EACAjnB,EACA0T,GAFAnX,uBAAA0qB,EACA1qB,WAAAyD,EACAzD,UAAAmX,ECvCX,QAeE4T,wBAAA,SAAW1Q,GACT,MAAqB,UAAdA,GAMT0Q,yBAAA,SAAYC,EAAgBC,GAC1B,IAAM5L,EAAQ4L,EAAMC,iBAAiBC,WACrC,OAAO,IAAIZ,GACT,QACAvqB,KACA,IAAI4pB,GAAaoB,EAAOI,aAAcH,EAAMX,SAAUjL,KAO1D0L,4BAAA,SAAeM,GACb,IAAMC,EAAMtrB,KAAKurB,SACjB,GAAiC,WAA7BF,EAAUG,eAA6B,CACzC/mB,EACEzE,KAAKyrB,gBACL,gEAEF,IAAMC,EAAW1rB,KAAKyrB,gBACtB,OAAO,WAELC,EAAS9qB,KAAK0qB,EAAMD,EAA0B5nB,QAGhD,IAAMkoB,EAAK3rB,KAAK4rB,UAChB,OAAO,WACLD,EAAG/qB,KAAK0qB,EAAMD,EAAwB1O,YAQ5CoO,+BAAA,SAAkBtnB,EAAc0T,GAC9B,OAAInX,KAAKyrB,gBACA,IAAIX,GAAY9qB,KAAMyD,EAAO0T,GAE7B,MAOX4T,qBAAA,SAAQ1U,GACN,OAAMA,aAAiB0U,MAEX1U,EAAMuV,YAAc5rB,KAAK4rB,WAKjCvV,EAAMuV,YAAc5rB,KAAK4rB,WAAavV,EAAMkV,WAAavrB,KAAKurB,WAQpER,4BAAA,WACE,OAA0B,OAAnB/qB,KAAK4rB,eA/Ed,YACUA,EACAH,EACAF,GAFAvrB,eAAA4rB,EACA5rB,qBAAAyrB,EACAzrB,cAAAurB,EAyFZ,ICnIIM,ODoJFC,wBAAA,SAAWzR,GACT,IAAI0R,EACY,mBAAd1R,EAAiC,cAAgBA,EAGnD,OAFA0R,EACmB,qBAAjBA,EAAsC,gBAAkBA,EACnDphB,EAAS3K,KAAKgsB,WAAYD,IAMnCD,+BAAA,SAAkBroB,EAAc0T,GAC9B,OAAInX,KAAKyrB,gBACA,IAAIX,GAAY9qB,KAAMyD,EAAO0T,GAE7B,MAOX2U,yBAAA,SAAYd,EAAgBC,GAC1BxmB,EAA2B,MAApBumB,EAAOnM,UAAmB,yCACjC,IAAM2L,EAAMS,EAAMX,SAAS5T,MAA6BsU,EAAOnM,WACzDQ,EAAQ4L,EAAMC,iBAAiBC,WACrC,OAAO,IAAIZ,GACTS,EAAOvb,KACPzP,KACA,IAAI4pB,GAAaoB,EAAOI,aAAcZ,EAAKnL,GAC3C2L,EAAOH,WAOXiB,4BAAA,SAAeT,GACb,IAAMC,EAAMtrB,KAAKurB,SACjB,GAAiC,WAA7BF,EAAUG,eAA6B,CACzC/mB,EACEzE,KAAKyrB,gBACL,gEAEF,IAAMQ,EAAWjsB,KAAKyrB,gBACtB,OAAO,WAELQ,EAASrrB,KAAK0qB,EAAMD,EAA0B5nB,QAGhD,IAAMyoB,EAAKlsB,KAAKgsB,WAAYX,EAAwBhR,WACpD,OAAO,WACL6R,EAAGtrB,KACD0qB,EACCD,EAAwB1O,SACxB0O,EAAwBR,YASjCiB,qBAAA,SAAQzV,GAAR,WACE,GAAIA,aAAiByV,GAAwB,CAC3C,IAAK9rB,KAAKgsB,aAAe3V,EAAM2V,WAC7B,OAAO,EACF,GAAIhsB,KAAKurB,WAAalV,EAAMkV,SAAU,CAC3C,IAAMY,EAAY3sB,OAAOoK,KAAKyM,EAAM2V,YAC9BI,EAAW5sB,OAAOoK,KAAK5J,KAAKgsB,YAC5BK,EAAaF,EAAUxrB,OAE7B,GAAI0rB,IADcD,EAASzrB,OACG,CAK5B,GAAmB,IAAf0rB,EAWF,OAAOD,EAASE,MACd,SAAAjS,GACE,OAAAhE,EAAM2V,WAAW3R,KAAenS,EAAK8jB,WAAW3R,KAZpD,IAAMkS,EAAWJ,EAAU,GACrBK,EAAUJ,EAAS,GACzB,QACEI,IAAYD,GACVlW,EAAM2V,WAAWO,IAChBvsB,KAAKgsB,WAAWQ,IACjBnW,EAAM2V,WAAWO,KAAcvsB,KAAKgsB,WAAWQ,MAa3D,OAAO,GAMTV,4BAAA,WACE,OAA2B,OAApB9rB,KAAKgsB,gBApHd,YACUA,EAGAP,EACAF,GAJAvrB,gBAAAgsB,EAGAhsB,qBAAAyrB,EACAzrB,cAAAurB,UCjIV/rB,sBAAWitB,iCAIX,WAEE,OADAhoB,EAAOonB,GAAwB,oCACxBA,QANT,SAAkC9c,GAChC8c,GAAyB9c,mCAoBZ0d,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,IAAI/N,MAAMmoB,GACX,GAAyB,iBAAdN,EAChB,MAAM,IAAI7nB,MAAMooB,GAGpB,GAAIjV,EAAO8U,SAAU,CAEnB,GADgB9U,EAAOmV,oBACPta,GACd,MAAM,IAAIhO,MAAMmoB,GACX,GAAuB,iBAAZL,EAChB,MAAM,IAAI9nB,MAAMooB,SAGf,GAAIjV,EAAOmT,aAAe9K,IAC/B,GACgB,MAAbqM,IAAsBnT,GAAgBmT,IAC3B,MAAXC,IAAoBpT,GAAgBoT,GAErC,MAAM,IAAI9nB,MACR,sKAUJ,GALAJ,EACEuT,EAAOmT,qBAAsB7B,IAC3BtR,EAAOmT,aAAehC,GACxB,uBAGc,MAAbuD,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAE3B,MAAM,IAAI9nB,MACR,0FAYO4nB,kBAAf,SAA8BzU,GAC5B,GACEA,EAAO4U,YACP5U,EAAO8U,UACP9U,EAAOoV,aACNpV,EAAOqV,mBAER,MAAM,IAAIxoB,MACR,uGAUE4nB,4CAAR,SAAuChgB,GACrC,IAA4B,IAAxBzM,KAAKstB,eACP,MAAM,IAAIzoB,MAAM4H,EAAS,gDAO7BggB,4BAAA,WACE,OAAOzsB,KAAKutB,cAMdd,oBAAA,WAKE,OAJAjgB,EAAiB,YAAa,EAAG,EAAG9L,UAAUC,QAIvC,IAAI8rB,GAAMZ,uBAAuB7rB,KAAKwtB,KAAMxtB,KAAKmX,OAU1DsV,gBAAA,SACEpS,EACApS,EACAwlB,EACArgB,GAEAZ,EAAiB,WAAY,EAAG,EAAG9L,UAAUC,QAC7CyZ,GAAkB,WAAY,EAAGC,GAAW,GAC5CnN,EAAiB,WAAY,EAAGjF,GAAU,GAE1C,IAAMylB,EAAMjB,GAAMkB,yBAChB,WACAF,EACArgB,GAGF,GAAkB,UAAdiN,EACFra,KAAK4tB,aAAa3lB,EAAUylB,EAAIG,OAAQH,EAAItgB,aACvC,CACL,IAAM0gB,EAA8C,GACpDA,EAAUzT,GAAapS,EACvBjI,KAAK+tB,aAAaD,EAAWJ,EAAIG,OAAQH,EAAItgB,SAE/C,OAAOnF,GASCwkB,0BAAV,SACExkB,EACA+lB,EACA5gB,GAEA,IAAM6gB,EAAY,IAAIlD,GACpB9iB,EACA+lB,GAAkB,KAClB5gB,GAAW,MAEbpN,KAAKwtB,KAAKU,yBAAyBluB,KAAMiuB,IAS3CxB,0BAAA,SACEqB,EACAE,EACA5gB,GAEA,IAAM6gB,EAAY,IAAInC,GACpBgC,EACAE,EACA5gB,GAEFpN,KAAKwtB,KAAKU,yBAAyBluB,KAAMiuB,IAQ3CxB,iBAAA,SACEpS,EACApS,EACAmF,GAEAZ,EAAiB,YAAa,EAAG,EAAG9L,UAAUC,QAC9CyZ,GAAkB,YAAa,EAAGC,GAAW,GAC7CnN,EAAiB,YAAa,EAAGjF,GAAU,GAC3CkF,EAAsB,YAAa,EAAGC,GAAS,GAE/C,IAAI6gB,EAAsC,KACtCH,EAAqD,KACvC,UAAdzT,EAEF4T,EAAY,IAAIlD,GADM9iB,GAAY,KAGhC,KACAmF,GAAW,MAEJiN,IACLpS,KACF6lB,EAAY,IACFzT,GAAapS,GAEzBgmB,EAAY,IAAInC,GAAuBgC,EAAW,KAAM1gB,GAAW,OAErEpN,KAAKwtB,KAAKW,4BAA4BnuB,KAAMiuB,IAW9CxB,kBAAA,SACEpS,EACA+T,EACAC,EACAjhB,GAJF,WAMEZ,EAAiB,aAAc,EAAG,EAAG9L,UAAUC,QAC/CyZ,GAAkB,aAAc,EAAGC,GAAW,GAC9CnN,EAAiB,aAAc,EAAGkhB,GAAc,GAEhD,IAAMV,EAAMjB,GAAMkB,yBAChB,aACAU,EACAjhB,GAOEkhB,GAAY,EACVtS,EAAW,IAAIhU,EAGrBgU,EAAS7T,QAAQC,MAAM,cAEvB,IAAMmmB,EAAe,SAAC5R,GAGhB2R,IACFA,GAAY,EACZpmB,EAAKsmB,IAAInU,EAAWkU,GAEhBH,GACFA,EAAald,KAAKwc,EAAItgB,QAAtBghB,CAA+BzR,GAEjCX,EAAS5a,QAAQub,KAgBrB,OAZA3c,KAAKyuB,GACHpU,EACAkU,EACY,SAAAG,GACVxmB,EAAKsmB,IAAInU,EAAWkU,GAEhBb,EAAIG,QACNH,EAAIG,OAAO3c,KAAKwc,EAAItgB,QAApBsgB,CAA6BgB,GAE/B1S,EAAS3a,OAAOqtB,KAGb1S,EAAS7T,SAQlBskB,0BAAA,SAAakC,GAEX,GADAniB,EAAiB,qBAAsB,EAAG,EAAG9L,UAAUC,QAEpC,iBAAVguB,GACPnb,KAAKI,MAAM+a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAI9pB,MACR,kEAGJ,GAAI7E,KAAKutB,aAAaH,WACpB,MAAM,IAAIvoB,MACR,uGAKJ,OAAO,IAAI4nB,GACTzsB,KAAKwtB,KACLxtB,KAAKmX,KACLnX,KAAKutB,aAAaqB,aAAaD,GAC/B3uB,KAAKstB,iBASTb,yBAAA,SAAYkC,GAEV,GADAniB,EAAiB,oBAAqB,EAAG,EAAG9L,UAAUC,QAEnC,iBAAVguB,GACPnb,KAAKI,MAAM+a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAI9pB,MACR,iEAGJ,GAAI7E,KAAKutB,aAAaH,WACpB,MAAM,IAAIvoB,MACR,sGAKJ,OAAO,IAAI4nB,GACTzsB,KAAKwtB,KACLxtB,KAAKmX,KACLnX,KAAKutB,aAAasB,YAAYF,GAC9B3uB,KAAKstB,iBASTb,0BAAA,SAAatV,GAEX,GADA3K,EAAiB,qBAAsB,EAAG,EAAG9L,UAAUC,QAC1C,SAATwW,EACF,MAAM,IAAItS,MACR,2EAEG,GAAa,cAATsS,EACT,MAAM,IAAItS,MACR,qFAEG,GAAa,WAATsS,EACT,MAAM,IAAItS,MACR,+EAGJ0V,GAAmB,qBAAsB,EAAGpD,GAAM,GAClDnX,KAAK8uB,+BAA+B,sBACpC,IAAMC,EAAa,IAAIha,GAAKoC,GAC5B,GAAI4X,EAAWjkB,UACb,MAAM,IAAIjG,MACR,qFAGJ,IAAMwa,EAAQ,IAAIiK,GAAUyF,GACtBC,EAAYhvB,KAAKutB,aAAa0B,QAAQ5P,GAG5C,OAFAoN,GAAMyC,wBAAwBF,GAEvB,IAAIvC,GAAMzsB,KAAKwtB,KAAMxtB,KAAKmX,KAAM6X,GAA8B,IAOvEvC,wBAAA,WACEjgB,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QACrDX,KAAK8uB,+BAA+B,oBACpC,IAAME,EAAYhvB,KAAKutB,aAAa0B,QAAQhR,IAE5C,OADAwO,GAAMyC,wBAAwBF,GACvB,IAAIvC,GAAMzsB,KAAKwtB,KAAMxtB,KAAKmX,KAAM6X,GAA8B,IAOvEvC,6BAAA,WACEjgB,EAAiB,wBAAyB,EAAG,EAAG9L,UAAUC,QAC1DX,KAAK8uB,+BAA+B,yBACpC,IAAME,EAAYhvB,KAAKutB,aAAa0B,QAAQ5O,IAE5C,OADAoM,GAAMyC,wBAAwBF,GACvB,IAAIvC,GAAMzsB,KAAKwtB,KAAMxtB,KAAKmX,KAAM6X,GAA8B,IAOvEvC,0BAAA,WACEjgB,EAAiB,qBAAsB,EAAG,EAAG9L,UAAUC,QACvDX,KAAK8uB,+BAA+B,sBACpC,IAAME,EAAYhvB,KAAKutB,aAAa0B,QAAQ9F,IAE5C,OADAsD,GAAMyC,wBAAwBF,GACvB,IAAIvC,GAAMzsB,KAAKwtB,KAAMxtB,KAAKmX,KAAM6X,GAA8B,IAQvEvC,qBAAA,SACElrB,EACAyM,gBADAzM,QAGAiL,EAAiB,gBAAiB,EAAG,EAAG9L,UAAUC,QAClD8Y,GAAwB,gBAAiB,EAAGlY,EAAOvB,KAAKmX,MAAM,GAC9DmD,GAAY,gBAAiB,EAAGtM,GAAM,GAEtC,IAAMghB,EAAYhvB,KAAKutB,aAAa4B,QAAQ5tB,EAAOyM,GAGnD,GAFAye,GAAM2C,eAAeJ,GACrBvC,GAAMyC,wBAAwBF,GAC1BhvB,KAAKutB,aAAaX,WACpB,MAAM,IAAI/nB,MACR,0FAUJ,YAJciD,IAAVvG,IAEFyM,EADAzM,EAAQ,MAGH,IAAIkrB,GAAMzsB,KAAKwtB,KAAMxtB,KAAKmX,KAAM6X,EAAWhvB,KAAKstB,iBAQzDb,mBAAA,SACElrB,EACAyM,gBADAzM,QAGAiL,EAAiB,cAAe,EAAG,EAAG9L,UAAUC,QAChD8Y,GAAwB,cAAe,EAAGlY,EAAOvB,KAAKmX,MAAM,GAC5DmD,GAAY,cAAe,EAAGtM,GAAM,GAEpC,IAAMghB,EAAYhvB,KAAKutB,aAAa8B,MAAM9tB,EAAOyM,GAGjD,GAFAye,GAAM2C,eAAeJ,GACrBvC,GAAMyC,wBAAwBF,GAC1BhvB,KAAKutB,aAAaT,SACpB,MAAM,IAAIjoB,MACR,oFAKJ,OAAO,IAAI4nB,GAAMzsB,KAAKwtB,KAAMxtB,KAAKmX,KAAM6X,EAAWhvB,KAAKstB,iBAUzDb,qBAAA,SAAQlrB,EAAyCyM,GAI/C,GAHAxB,EAAiB,gBAAiB,EAAG,EAAG9L,UAAUC,QAClD8Y,GAAwB,gBAAiB,EAAGlY,EAAOvB,KAAKmX,MAAM,GAC9DmD,GAAY,gBAAiB,EAAGtM,GAAM,GAClChO,KAAKutB,aAAaX,WACpB,MAAM,IAAI/nB,MACR,0FAIJ,GAAI7E,KAAKutB,aAAaT,SACpB,MAAM,IAAIjoB,MACR,sFAIJ,OAAO7E,KAAKmvB,QAAQ5tB,EAAOyM,GAAMqhB,MAAM9tB,EAAOyM,IAMhDye,sBAAA,WAGE,OAFAjgB,EAAiB,iBAAkB,EAAG,EAAG9L,UAAUC,QAE5CX,KAAKwtB,KAAKtd,WAAalQ,KAAKmX,KAAKmY,sBAK1C7C,oBAAA,WAGE,OADAjgB,EAAiB,eAAgB,EAAG,EAAG9L,UAAUC,QAC1CX,KAAKkQ,YAOduc,yBAAA,WACE,OAAOzsB,KAAKutB,aAAagC,kBAM3B9C,6BAAA,WACE,IAAM7hB,EAAM5K,KAAKwvB,cACXhd,EAAKU,GAAkBtI,GAC7B,MAAc,OAAP4H,EAAc,UAAYA,GAQnCia,qBAAA,SAAQpW,GAEN,GADA7J,EAAiB,gBAAiB,EAAG,EAAG9L,UAAUC,UAC5C0V,aAAiBoW,IAGrB,MAAM,IAAI5nB,MADR,wFAIJ,IAAM4qB,EAAWzvB,KAAKwtB,OAASnX,EAAMmX,KAC/BkC,EAAW1vB,KAAKmX,KAAKiJ,OAAO/J,EAAMc,MAClCwY,EACJ3vB,KAAK4vB,oBAAsBvZ,EAAMuZ,kBAEnC,OAAOH,GAAYC,GAAYC,GAWlBlD,4BAAf,SACEhgB,EACAojB,EACAziB,GAEA,IAAMsgB,EAGF,CAAEG,OAAQ,KAAMzgB,QAAS,MAC7B,GAAIyiB,GAAmBziB,EACrBsgB,EAAIG,OAASgC,EACb3iB,EAAiBT,EAAQ,EAAGihB,EAAIG,QAAQ,GAExCH,EAAItgB,QAAUA,EACdD,EAAsBV,EAAQ,EAAGihB,EAAItgB,SAAS,QACzC,GAAIyiB,EAET,GAA+B,iBAApBA,GAAoD,OAApBA,EAEzCnC,EAAItgB,QAAUyiB,MACT,CAAA,GAA+B,mBAApBA,EAGhB,MAAM,IAAIhrB,MACRiI,EAAYL,EAAQ,GAAG,GACrB,0DAJJihB,EAAIG,OAASgC,EAQjB,OAAOnC,GAGTluB,sBAAIitB,wBAAJ,WACE,OAAOzsB,KAAKsqB,8CAxlBd,YACSkD,EACArW,EACCoW,EACAD,GAHDttB,UAAAwtB,EACAxtB,UAAAmX,EACCnX,kBAAAutB,EACAvtB,oBAAAstB,ECpCZ,QAGEwC,+BAAA,SAAkBjR,GAEhB,OAAO,IAAIiR,GADG9vB,KAAK6pB,MAAMxD,kBAAkBxH,KAI7CiR,kBAAA,WACE,OAAO9vB,KAAK6pB,WARd,YAAqBA,GAAA7pB,WAAA6pB,EAYvB,QASEkG,+BAAA,SAAkBlR,GAChB,IAAMmL,EAAYhqB,KAAK2b,MAAMjF,MAAMmI,GACnC,OAAO,IAAIkR,GAAsB/vB,KAAKgwB,UAAWhG,IAGnD+F,kBAAA,WACE,OAAO/vB,KAAKgwB,UAAUC,uBAAuBjwB,KAAK2b,YAXpD,YAAYuU,EAAoB/Y,GAC9BnX,KAAKgwB,UAAYE,EACjBlwB,KAAK2b,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,SACtCjvB,EACAkvB,EACAL,GAEA,OAAK7uB,GAA0B,iBAAVA,GAGrBkD,EAAO,QAASlD,EAAO,6CAEK,iBAAjBA,EAAM,OACRmvB,GAA2BnvB,EAAM,OAAQkvB,EAAaL,GAC5B,iBAAjB7uB,EAAM,OACfovB,GAA4BpvB,EAAM,OAAQkvB,QAEjDhsB,GAAO,EAAO,4BAA8BwF,KAAKE,UAAU5I,EAAO,KAAM,KATjEA,GAaLmvB,GAA6B,SACjC3tB,EACAwtB,EACAH,GAEA,OAAQrtB,GACN,IAAK,YACH,OAAOqtB,EAAwB,UACjC,QACE3rB,GAAO,EAAO,4BAA8B1B,KAI5C4tB,GAA8B,SAClC5tB,EACAwtB,EACAK,GAEK7tB,EAAGlD,eAAe,cACrB4E,GAAO,EAAO,4BAA8BwF,KAAKE,UAAUpH,EAAI,KAAM,IAEvE,IAAM8tB,EAAQ9tB,EAAc,UACP,iBAAV8tB,GACTpsB,GAAO,EAAO,+BAAiCosB,GAGjD,IAAMC,EAAeP,EAASlT,OAO9B,GANA5Y,EACEqsB,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,cAAcvP,MAM5ByK,EAAWgX,GACfO,EACAN,EAAYpK,kBAAkB,aAC9B+J,GAIF,GAAI/S,EAAKgB,aAAc,CACrB,IAAM2S,EAAW3T,EACX9b,EAAQivB,GACZQ,EAASvR,WACTgR,EACAL,GAEF,OACE7uB,IAAUyvB,EAASvR,YACnBjG,IAAawX,EAAS1S,cAAcvP,MAE7B,IAAI0P,GAASld,EAAOid,GAAahF,IAEjC6D,EAGT,IAAM4T,EAAe5T,EAerB,OAbI7D,KADJkE,EAAUuT,GACoB3S,cAAcvP,QAC1C2O,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,MAAdnX,KAAKuB,MACP,OAAOvB,KAAKuB,MAAM+kB,SAASnP,GACtB,IAAKA,EAAKrM,WAAkC,EAArB9K,KAAKoxB,SAASC,KAAU,CACpD,IAAMC,EAAWna,EAAKvB,WAEtB,OADAuB,EAAOA,EAAKpB,WACR/V,KAAKoxB,SAASG,IAAID,GACFtxB,KAAKoxB,SAAS5f,IAAI8f,GACnBE,KAAKra,GAEf,KAGT,OAAO,MAWXga,sBAAA,SAASha,EAAYnO,GACnB,GAAImO,EAAKrM,UACP9K,KAAKuB,MAAQyH,EACbhJ,KAAKoxB,SAASK,aACT,GAAmB,OAAfzxB,KAAKuB,MACdvB,KAAKuB,MAAQvB,KAAKuB,MAAM6d,YAAYjI,EAAMnO,OACrC,CACL,IAAMsoB,EAAWna,EAAKvB,WACjB5V,KAAKoxB,SAASG,IAAID,IACrBtxB,KAAKoxB,SAAShgB,IAAIkgB,EAAU,IAAIH,IAGlC,IAAMza,EAAQ1W,KAAKoxB,SAAS5f,IAAI8f,GAChCna,EAAOA,EAAKpB,WACZW,EAAMgb,SAASva,EAAMnO,KAUzBmoB,oBAAA,SAAOha,GACL,GAAIA,EAAKrM,UAGP,OAFA9K,KAAKuB,MAAQ,KACbvB,KAAKoxB,SAASK,SACP,EAEP,GAAmB,OAAfzxB,KAAKuB,MAAgB,CACvB,GAAIvB,KAAKuB,MAAM8c,aAEb,OAAO,EAEP,IAAM9c,EAAQvB,KAAKuB,MACnBvB,KAAKuB,MAAQ,KAEb,IAAMowB,EAAO3xB,KAKb,OAJAuB,EAAMulB,aAAazG,GAAgB,SAAC7W,EAAKooB,GACvCD,EAAKD,SAAS,IAAI3c,GAAKvL,GAAMooB,KAGxB5xB,KAAK6xB,OAAO1a,GAEhB,GAAyB,EAArBnX,KAAKoxB,SAASC,KAAU,CACjC,IAAMC,EAAWna,EAAKvB,WAStB,OARAuB,EAAOA,EAAKpB,YACR/V,KAAKoxB,SAASG,IAAID,IACCtxB,KAAKoxB,SAAS5f,IAAI8f,GAAUO,OAAO1a,IAEtDnX,KAAKoxB,SAASU,OAAOR,GAIK,IAAvBtxB,KAAKoxB,SAASC,KAErB,OAAO,GAYbF,yBAAA,SAAYY,EAAkBC,GACT,OAAfhyB,KAAKuB,MACPywB,EAAKD,EAAY/xB,KAAKuB,OAEtBvB,KAAK8mB,aAAa,SAACtd,EAAKooB,GACtB,IAAMza,EAAO,IAAIpC,GAAKgd,EAAW7hB,WAAa,IAAM1G,GACpDooB,EAAKK,YAAY9a,EAAM6a,MAU7Bb,0BAAA,SAAaa,GACXhyB,KAAKoxB,SAASc,QAAQ,SAACN,EAAMpoB,GAC3BwoB,EAAKxoB,EAAKooB,UA1HhB,cACU5xB,WAAqB,KAEZA,cAA4C,IAAImyB,KCHvDjB,GAAAA,GAAAA,oCAEVA,uBACAA,yCACAA,2CAoCF,QAaSkB,QAAO,IAAIA,IACF,GACd,EACA,MACY,GAOPA,UAAS,IAAIA,IAClB,GACgB,EAChB,MACY,GAOPA,wBAAuB,SAAUC,GACtC,OAAO,IAAID,IACT,GACgB,EAChBC,GACY,QAvChB,YACSC,EACAC,EACAF,EACAG,GAHAxyB,cAAAsyB,EACAtyB,gBAAAuyB,EACAvyB,aAAAqyB,EACAryB,YAAAwyB,EAEP/tB,GAAQ+tB,GAAUD,EAAY,uCCjDlC,ICDIE,ODuBFC,+BAAA,SAAkB7T,GAChB,GAAK7e,KAAKmX,KAAKrM,UAUR,CAAA,GAA+B,MAA3B9K,KAAK2yB,aAAapxB,MAM3B,OALAkD,EACEzE,KAAK2yB,aAAavB,SAAStmB,UAC3B,4DAGK9K,KAEP,IAAMmkB,EAAYnkB,KAAK2yB,aAAaC,QAAQ,IAAI7d,GAAK8J,IACrD,OAAO,IAAI6T,GAAa3d,GAAK8d,MAAO1O,EAAWnkB,KAAK8yB,QAdpD,OAJAruB,EACEzE,KAAKmX,KAAKvB,aAAeiJ,EACzB,iDAEK,IAAI6T,GACT1yB,KAAKmX,KAAKpB,WACV/V,KAAK2yB,aACL3yB,KAAK8yB,aAlBX,YAC4B3b,EACAwb,EACAG,GAFA9yB,UAAAmX,EACAnX,kBAAA2yB,EACA3yB,YAAA8yB,EAd5B9yB,UAAOkxB,GAAc6B,eAGrB/yB,YAASoyB,GAAgBY,KCE3B,QAqBSC,cAAP,SAAqBroB,GACnB,IAAIgnB,EAAyBqB,GAAcJ,MAI3C,OAHAzf,GAAKxI,EAAK,SAACof,EAAmBkJ,GAC5BtB,EAAOA,EAAKxgB,IAAI,IAAI2D,GAAKiV,GAAYkJ,KAEhCtB,GAoBTqB,qBAAA,WACE,OAAsB,OAAfjzB,KAAKuB,OAAkBvB,KAAKoxB,SAAStmB,WAe9CmoB,8CAAA,SACEnd,EACAqd,GAEA,GAAkB,MAAdnzB,KAAKuB,OAAiB4xB,EAAUnzB,KAAKuB,OACvC,MAAO,CAAE4V,KAAMpC,GAAK8d,MAAOtxB,MAAOvB,KAAKuB,OAEvC,GAAIuU,EAAahL,UACf,OAAO,KAEP,IAAMqU,EAAQrJ,EAAaF,WACrBc,EAAQ1W,KAAKoxB,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,MAEH5V,MAAO6xB,EAA0B7xB,QAiBpE0xB,sCAAA,SACEnd,GAEA,OAAO9V,KAAKqzB,iCAAiCvd,EAAc,WAAM,OAAA,KAOnEmd,qBAAA,SAAQnd,GACN,GAAIA,EAAahL,UACf,OAAO9K,KAEP,IAAMmf,EAAQrJ,EAAaF,WACrBuO,EAAYnkB,KAAKoxB,SAAS5f,IAAI2N,GACpC,OAAkB,OAAdgF,EACKA,EAAUyO,QAAQ9c,EAAaC,YAE/Bkd,GAAcJ,OAY3BI,iBAAA,SAAInd,EAAoBwd,GACtB,GAAIxd,EAAahL,UACf,OAAO,IAAImoB,GAAcK,EAAOtzB,KAAKoxB,UAErC,IAAMjS,EAAQrJ,EAAaF,WAErB2d,GADQvzB,KAAKoxB,SAAS5f,IAAI2N,IAAU8T,GAAcJ,OACjCzhB,IAAI0E,EAAaC,WAAYud,GAC9CxN,EAAc9lB,KAAKoxB,SAAS3P,OAAOtC,EAAOoU,GAChD,OAAO,IAAIN,GAAcjzB,KAAKuB,MAAOukB,IAUzCmN,oBAAA,SAAOnd,GACL,GAAIA,EAAahL,UACf,OAAI9K,KAAKoxB,SAAStmB,UACTmoB,GAAcJ,MAEd,IAAII,GAAc,KAAMjzB,KAAKoxB,UAGtC,IAAMjS,EAAQrJ,EAAaF,WACrBc,EAAQ1W,KAAKoxB,SAAS5f,IAAI2N,GAChC,GAAIzI,EAAO,CACT,IAAM6c,EAAW7c,EAAMrF,OAAOyE,EAAaC,YACvC+P,SAMJ,OAJEA,EADEyN,EAASzoB,UACG9K,KAAKoxB,SAAS/f,OAAO8N,GAErBnf,KAAKoxB,SAAS3P,OAAOtC,EAAOoU,GAEzB,OAAfvzB,KAAKuB,OAAkBukB,EAAYhb,UAC9BmoB,GAAcJ,MAEd,IAAII,GAAcjzB,KAAKuB,MAAOukB,GAGvC,OAAO9lB,MAWbizB,iBAAA,SAAInd,GACF,GAAIA,EAAahL,UACf,OAAO9K,KAAKuB,MAEZ,IAAM4d,EAAQrJ,EAAaF,WACrBc,EAAQ1W,KAAKoxB,SAAS5f,IAAI2N,GAChC,OAAIzI,EACKA,EAAMlF,IAAIsE,EAAaC,YAEvB,MAYbkd,qBAAA,SAAQnd,EAAoB0d,GAC1B,GAAI1d,EAAahL,UACf,OAAO0oB,EAEP,IAAMrU,EAAQrJ,EAAaF,WAErB2d,GADQvzB,KAAKoxB,SAAS5f,IAAI2N,IAAU8T,GAAcJ,OACjCY,QAAQ3d,EAAaC,WAAYyd,GACpD1N,SAMJ,OAJEA,EADEyN,EAASzoB,UACG9K,KAAKoxB,SAAS/f,OAAO8N,GAErBnf,KAAKoxB,SAAS3P,OAAOtC,EAAOoU,GAErC,IAAIN,GAAcjzB,KAAKuB,MAAOukB,IAYzCmN,kBAAA,SAAQjoB,GACN,OAAOhL,KAAK0zB,MAAM3e,GAAK8d,MAAO7nB,IAWxBioB,mBAAR,SACEU,EACA3oB,GAEA,IAAM4oB,EAA4B,GAMlC,OALA5zB,KAAKoxB,SAAShQ,iBACZ,SAACkQ,EAAkBnN,GACjByP,EAAMtC,GAAYnN,EAAUuP,MAAMC,EAAUjd,MAAM4a,GAAWtmB,KAG1DA,EAAG2oB,EAAW3zB,KAAKuB,MAAOqyB,IAUnCX,wBAAA,SAAc9b,EAAYlV,GACxB,OAAOjC,KAAK6zB,YAAY1c,EAAMpC,GAAK8d,MAAO5wB,IAGpCgxB,yBAAR,SACEa,EACAH,EACA1xB,GAEA,IAAML,IAAS5B,KAAKuB,OAAQU,EAAE0xB,EAAW3zB,KAAKuB,OAC9C,GAAIK,EACF,OAAOA,EAEP,GAAIkyB,EAAahpB,UACf,OAAO,KAEP,IAAMqU,EAAQ2U,EAAale,WACrBme,EAAY/zB,KAAKoxB,SAAS5f,IAAI2N,GACpC,OAAI4U,EACKA,EAAUF,YACfC,EAAa/d,WACb4d,EAAUjd,MAAMyI,GAChBld,GAGK,MAYfgxB,2BAAA,SACE9b,EACAlV,GAEA,OAAOjC,KAAKg0B,eAAe7c,EAAMpC,GAAK8d,MAAO5wB,IAGvCgxB,4BAAR,SACEa,EACAG,EACAhyB,GAEA,GAAI6xB,EAAahpB,UACf,OAAO9K,KAEHA,KAAKuB,OACPU,EAAEgyB,EAAqBj0B,KAAKuB,OAE9B,IAAM4d,EAAQ2U,EAAale,WACrBme,EAAY/zB,KAAKoxB,SAAS5f,IAAI2N,GACpC,OAAI4U,EACKA,EAAUC,eACfF,EAAa/d,WACbke,EAAoBvd,MAAMyI,GAC1Bld,GAGKgxB,GAAcJ,OAY3BI,qBAAA,SAAQhxB,GACNjC,KAAKk0B,SAASnf,GAAK8d,MAAO5wB,IAGpBgxB,sBAAR,SACEgB,EACAhyB,GAEAjC,KAAKoxB,SAAShQ,iBAAiB,SAACvC,EAAWsF,GACzCA,EAAU+P,SAASD,EAAoBvd,MAAMmI,GAAY5c,KAEvDjC,KAAKuB,OACPU,EAAEgyB,EAAqBj0B,KAAKuB,QAQhC0xB,0BAAA,SAAahxB,GACXjC,KAAKoxB,SAAShQ,iBACZ,SAACvC,EAAmBsF,GACdA,EAAU5iB,OACZU,EAAE4c,EAAWsF,EAAU5iB,UA5VxB0xB,SAAQ,IAAIA,GAAmB,UAoBtC,YACkB1xB,EACA6vB,gBAAAA,EAlChBqB,GADGA,IACsB,IAAI9Q,GAC3B1P,KAgCcjS,WAAAuB,EACAvB,cAAAoxB,ECvCpB,QAME+C,+BAAA,SAAkBtV,GAChB,OAAI7e,KAAKmX,KAAKrM,UACL,IAAIqpB,GAAen0B,KAAK0H,OAAQqN,GAAK8d,OAErC,IAAIsB,GAAen0B,KAAK0H,OAAQ1H,KAAKmX,KAAKpB,iBANrD,YAAmBrO,EAAgCyP,GAAhCnX,YAAA0H,EAAgC1H,UAAAmX,EAFnDnX,UAAOkxB,GAAckD,gBCAvB,QAUEC,+BAAA,SAAkBxV,GAChB,OAAI7e,KAAKmX,KAAKrM,UACL,IAAIupB,GACTr0B,KAAK0H,OACLqN,GAAK8d,MACL7yB,KAAKupB,KAAKlD,kBAAkBxH,IAGvB,IAAIwV,GAAUr0B,KAAK0H,OAAQ1H,KAAKmX,KAAKpB,WAAY/V,KAAKupB,WAdjE,YACS7hB,EACAyP,EACAoS,GAFAvpB,YAAA0H,EACA1H,UAAAmX,EACAnX,UAAAupB,EALTvpB,UAAOkxB,GAAcoD,UCCvB,QAaEC,+BAAA,SAAkB1V,GAChB,GAAI7e,KAAKmX,KAAKrM,UAAW,CACvB,IAAMqZ,EAAYnkB,KAAKoxB,SAASwB,QAAQ,IAAI7d,GAAK8J,IACjD,OAAIsF,EAAUrZ,UAEL,KACEqZ,EAAU5iB,MAEZ,IAAI8yB,GAAUr0B,KAAK0H,OAAQqN,GAAK8d,MAAO1O,EAAU5iB,OAGjD,IAAIgzB,GAAMv0B,KAAK0H,OAAQqN,GAAK8d,MAAO1O,GAO5C,OAJA1f,EACEzE,KAAKmX,KAAKvB,aAAeiJ,EACzB,kEAEK,IAAI0V,GAAMv0B,KAAK0H,OAAQ1H,KAAKmX,KAAKpB,WAAY/V,KAAKoxB,WAO7DmD,sBAAA,WACE,MACE,aACAv0B,KAAKmX,KACL,KACAnX,KAAK0H,OAAOwI,WACZ,WACAlQ,KAAKoxB,SAASlhB,WACd,SA1CJ,YAC4BxI,EACAyP,EACAia,GAFApxB,YAAA0H,EACA1H,UAAAmX,EACAnX,cAAAoxB,EAL5BpxB,UAAOkxB,GAAcsD,MCPvB,QAgBEC,gCAAA,WACE,OAAOz0B,KAAK00B,mBAOdD,wBAAA,WACE,OAAOz0B,KAAK20B,WAOdF,+BAAA,SAAkBtd,GAChB,GAAIA,EAAKrM,UACP,OAAO9K,KAAK40B,uBAAyB50B,KAAK20B,UAG5C,IAAMrD,EAAWna,EAAKvB,WACtB,OAAO5V,KAAK60B,mBAAmBvD,IAOjCmD,gCAAA,SAAmBjrB,GACjB,OACGxJ,KAAK40B,uBAAyB50B,KAAK20B,WAAc30B,KAAK6pB,MAAMiL,SAAStrB,IAO1EirB,qBAAA,WACE,OAAOz0B,KAAK6pB,WAjDd,YACUA,EACA6K,EACAC,GAFA30B,WAAA6pB,EACA7pB,uBAAA00B,EACA10B,eAAA20B,ECPZ,QAkCEI,6BAAA,SACEC,EACAC,EACAC,GAEA,OAAO,IAAIH,GACT,IAAIN,GAAUO,EAAWC,EAAUC,GACnCl1B,KAAKm1B,eAUTJ,8BAAA,SACEK,EACAH,EACAC,GAEA,OAAO,IAAIH,GACT/0B,KAAKq1B,YACL,IAAIZ,GAAUW,EAAYH,EAAUC,KAOxCH,2BAAA,WACE,OAAO/0B,KAAKq1B,aAMdN,kCAAA,WACE,OAAO/0B,KAAKq1B,YAAYT,qBACpB50B,KAAKq1B,YAAYC,UACjB,MAMNP,4BAAA,WACE,OAAO/0B,KAAKm1B,cAMdJ,mCAAA,WACE,OAAO/0B,KAAKm1B,aAAaP,qBACrB50B,KAAKm1B,aAAaG,UAClB,MA5ECP,SAAQ,IAAIA,GACjB,IAAIN,GACFxO,GAAanH,YACS,GACR,GAEhB,IAAI2V,GACFxO,GAAanH,YACS,GACR,QAlBlB,YACmBuW,EACAF,GADAn1B,iBAAAq1B,EACAr1B,kBAAAm1B,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,YACS9lB,EACA2b,EACAvM,EACAkX,EACAlL,GAJA7qB,UAAAyP,EACAzP,kBAAAorB,EACAprB,eAAA6e,EACA7e,aAAA+1B,EACA/1B,cAAA6qB,ECCX,QAGEmL,yBAAA,SACEzM,EACA/f,EACA+pB,EACA0C,EACAvuB,EACAwuB,GAEAzxB,EACE8kB,EAAK4M,UAAUn2B,KAAKmqB,QACpB,qDAEF,IAAMiM,EAAW7M,EAAKlD,kBAAkB7c,GAExC,OACE4sB,EAAS9P,SAAS2P,GAAc7V,OAAOmT,EAASjN,SAAS2P,KAKrDG,EAAStrB,YAAcyoB,EAASzoB,UAK3Bye,GAIiB,MAAxB2M,IACE3C,EAASzoB,UACPye,EAAKuL,SAAStrB,GAChB0sB,EAAqBG,iBACnBd,GAAOe,mBAAmB9sB,EAAK4sB,IAGjC3xB,EACE8kB,EAAKlL,aACL,uEAGK+X,EAAStrB,UAClBorB,EAAqBG,iBACnBd,GAAOgB,iBAAiB/sB,EAAK+pB,IAG/B2C,EAAqBG,iBACnBd,GAAOiB,mBAAmBhtB,EAAK+pB,EAAU6C,KAI3C7M,EAAKlL,cAAgBkV,EAASzoB,UACzBye,EAGAA,EAAKrK,qBAAqB1V,EAAK+pB,GAAUkD,UAAUz2B,KAAKmqB,UAOnE6L,4BAAA,SACED,EACAW,EACAR,GA6BA,OA3B4B,MAAxBA,IACGH,EAAQ1X,cACX0X,EAAQjP,aAAazG,GAAgB,SAAC7W,EAAKuV,GACpC2X,EAAQ5B,SAAStrB,IACpB0sB,EAAqBG,iBACnBd,GAAOe,mBAAmB9sB,EAAKuV,MAKlC2X,EAAQrY,cACXqY,EAAQ5P,aAAazG,GAAgB,SAAC7W,EAAKuV,GACzC,GAAIgX,EAAQjB,SAAStrB,GAAM,CACzB,IAAM4sB,EAAWL,EAAQ1P,kBAAkB7c,GACtC4sB,EAAShW,OAAOrB,IACnBmX,EAAqBG,iBACnBd,GAAOiB,mBAAmBhtB,EAAKuV,EAAWqX,SAI9CF,EAAqBG,iBACnBd,GAAOgB,iBAAiB/sB,EAAKuV,OAMhC2X,EAAQD,UAAUz2B,KAAKmqB,SAMhC6L,4BAAA,SAAeD,EAAerP,GAC5B,OAAIqP,EAAQjrB,UACHmb,GAAanH,WAEbiX,EAAQ9W,eAAeyH,IAOlCsP,0BAAA,WACE,OAAO,GAMTA,8BAAA,WACE,OAAOh2B,MAMTg2B,sBAAA,WACE,OAAOh2B,KAAKmqB,YAhId,YAA6BA,GAAAnqB,YAAAmqB,EChB/B,QAGEwM,8BAAA,SAAiB3L,GACf,IAAMvb,EAAOub,EAAOvb,KACd6hB,EAAWtG,EAAOnM,UACxBpa,EACEgL,IAAS8lB,GAAOE,aACdhmB,IAAS8lB,GAAOM,eAChBpmB,IAAS8lB,GAAOG,cAClB,6CAEFjxB,EACe,cAAb6sB,EACA,mDAEF,IAAMsF,EAAY52B,KAAK62B,UAAUrlB,IAAI8f,GACrC,GAAIsF,EAAW,CACb,IAAME,EAAUF,EAAUnnB,KAC1B,GAAIA,IAAS8lB,GAAOE,aAAeqB,IAAYvB,GAAOG,cACpD11B,KAAK62B,UAAUzlB,IACbkgB,EACAiE,GAAOiB,mBACLlF,EACAtG,EAAOI,aACPwL,EAAUxL,oBAGT,GACL3b,IAAS8lB,GAAOG,eAChBoB,IAAYvB,GAAOE,YAEnBz1B,KAAK62B,UAAU/E,OAAOR,QACjB,GACL7hB,IAAS8lB,GAAOG,eAChBoB,IAAYvB,GAAOM,cAEnB71B,KAAK62B,UAAUzlB,IACbkgB,EACAiE,GAAOe,mBAAmBhF,EAAUsF,EAAUb,eAE3C,GACLtmB,IAAS8lB,GAAOM,eAChBiB,IAAYvB,GAAOE,YAEnBz1B,KAAK62B,UAAUzlB,IACbkgB,EACAiE,GAAOgB,iBAAiBjF,EAAUtG,EAAOI,mBAEtC,CAAA,GACL3b,IAAS8lB,GAAOM,eAChBiB,IAAYvB,GAAOM,cAWnB,MAAMjxB,EACJ,mCACEomB,EACA,mBACA4L,GAbJ52B,KAAK62B,UAAUzlB,IACbkgB,EACAiE,GAAOiB,mBACLlF,EACAtG,EAAOI,aACPwL,EAAUb,gBAYhB/1B,KAAK62B,UAAUzlB,IAAIkgB,EAAUtG,IAIjC2L,wBAAA,WACE,OAAOh3B,MAAMo3B,KAAK/2B,KAAK62B,UAAUG,eA3ErC,cACmBh3B,eAAiC,IAAImyB,ICsCxD,eAyBO,IAAM8E,GAA2B,IArBtCC,8BAAA,SAAiB5F,GACf,OAAO,MAMT4F,gCAAA,SACE7X,EACA3I,EACA1C,GAEA,OAAO,cAiCTmjB,8BAAA,SAAiB7F,GACf,IAAMjU,EAAOrd,KAAKo3B,WAAWC,gBAC7B,GAAIha,EAAKwX,mBAAmBvD,GAC1B,OAAOjU,EAAKiY,UAAUjP,kBAAkBiL,GAExC,IAAMgG,EAC4B,MAAhCt3B,KAAKu3B,wBACD,IAAI9C,GAAUz0B,KAAKu3B,yBAAyB,GAAM,GAClDv3B,KAAKo3B,WAAWI,iBACtB,OAAOx3B,KAAKy3B,QAAQC,kBAAkBpG,EAAUgG,IAOpDH,gCAAA,SACE9X,EACA3I,EACA1C,GAEA,IAAM2jB,EAC4B,MAAhC33B,KAAKu3B,wBACDv3B,KAAKu3B,wBACLv3B,KAAKo3B,WAAWQ,wBAChBC,EAAQ73B,KAAKy3B,QAAQK,iBACzBH,EACAjhB,EACA,EACA1C,EACAqL,GAEF,OAAqB,IAAjBwY,EAAMl3B,OACD,KAEAk3B,EAAM,QA5CjB,YACUJ,EACAL,EACAG,gBAAAA,QAFAv3B,aAAAy3B,EACAz3B,gBAAAo3B,EACAp3B,6BAAAu3B,EC5DZ,OAKE,SACkBQ,EACAC,GADAh4B,eAAA+3B,EACA/3B,aAAAg4B,OAgBlBC,2BAAA,SAAcF,GACZtzB,EACEszB,EAAUV,gBAAgB/B,UAAUa,UAAUn2B,KAAKk4B,QAAQ/M,YAC3D,0BAEF1mB,EACEszB,EAAUP,iBAAiBlC,UAAUa,UAAUn2B,KAAKk4B,QAAQ/M,YAC5D,4BAWJ8M,4BAAA,SACEE,EACAC,EACAC,EACAC,GAEA,IACIC,EAAcC,EADZC,EAAc,IAAI9B,GAExB,GAAIyB,EAAU3oB,OAASyhB,GAAcoD,UAAW,CAC9C,IAAMoE,EAAYN,EAEhBG,EADEG,EAAUhxB,OAAO4qB,SACJtyB,KAAK24B,oBAClBR,EACAO,EAAUvhB,KACVuhB,EAAUnP,KACV8O,EACAC,EACAG,IAGFh0B,EAAOi0B,EAAUhxB,OAAO6qB,WAAY,mBAIpCiG,EACEE,EAAUhxB,OAAO8qB,QAChB2F,EAAaX,iBAAiBoB,eAC5BF,EAAUvhB,KAAKrM,UACL9K,KAAK64B,sBAClBV,EACAO,EAAUvhB,KACVuhB,EAAUnP,KACV8O,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAU3oB,OAASyhB,GAAcsD,MAAO,CACjD,IAAMsE,EAAQV,EAEZG,EADEO,EAAMpxB,OAAO4qB,SACAtyB,KAAK+4B,gBAClBZ,EACAW,EAAM3hB,KACN2hB,EAAM1H,SACNiH,EACAC,EACAG,IAGFh0B,EAAOq0B,EAAMpxB,OAAO6qB,WAAY,mBAEhCiG,EACEM,EAAMpxB,OAAO8qB,QAAU2F,EAAaX,iBAAiBoB,aACxC54B,KAAKg5B,kBAClBb,EACAW,EAAM3hB,KACN2hB,EAAM1H,SACNiH,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAU3oB,OAASyhB,GAAc6B,eAAgB,CAC1D,IAAMkG,EAAeb,EAWnBG,EAVGU,EAAanG,OAUD9yB,KAAKk5B,iBAClBf,EACAc,EAAa9hB,KACbkhB,EACAC,EACAG,GAdaz4B,KAAKm5B,cAClBhB,EACAc,EAAa9hB,KACb8hB,EAAatG,aACb0F,EACAC,EACAG,OAWC,CAAA,GAAIL,EAAU3oB,OAASyhB,GAAckD,gBAQ1C,MAAMxvB,EAAe,2BAA6BwzB,EAAU3oB,MAP5D8oB,EAAev4B,KAAKo5B,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,UAAUxqB,UACpD2uB,EAAkBtB,EAAauB,wBAEd,EAArBjB,EAAY93B,SACXw3B,EAAad,gBAAgBzC,sBAC7B4E,IACExE,EAAUM,UAAUlV,OAA4BqZ,KAClDzE,EAAUM,UAAUhX,cAAc8B,OAAOqZ,EAAgBnb,iBAE1Dma,EAAYv1B,KACVqyB,GAAOoE,YACgBpB,EAAamB,2BAgBpCzB,iDAAR,SACEF,EACA6B,EACAvB,EACA3wB,EACA+wB,GAEA,IAAMoB,EAAe9B,EAAUV,gBAC/B,GAA8C,MAA1CgB,EAAYyB,eAAeF,GAE7B,OAAO7B,EAEP,IAAIgC,SAAezC,SACnB,GAAIsC,EAAW9uB,UAMb,GAJArG,EACEszB,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,EAAgB/5B,KAAKk4B,QAAQkC,eAC3BrC,EAAUV,gBAAgB/B,UAC1B4E,EACAzB,OAEG,CACL,IAAM4B,EAAehC,EAAYpI,uBAC/B8H,EAAUH,yBAEZmC,EAAgB/5B,KAAKk4B,QAAQkC,eAC3BrC,EAAUV,gBAAgB/B,UAC1B+E,EACA5B,OAGC,CACL,IAAMnH,EAAWsI,EAAWhkB,WAC5B,GAAiB,cAAb0b,EAA0B,CAC5B7sB,EAC6B,IAA3Bm1B,EAAWtjB,YACX,yDAEF,IAAMgkB,EAAeT,EAAavE,UAClCgC,EAAaS,EAAUP,iBAAiBlC,UAExC,IAAMiF,EAAkBlC,EAAYmC,mCAClCZ,EACAU,EACAhD,GAGAyC,EADqB,MAAnBQ,EACcv6B,KAAKk4B,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,EACc16B,KAAKk4B,QAAQ9Y,YAC3Bya,EAAavE,UACbhE,EACAoJ,EACAD,EACA/yB,EACA+wB,GAIcoB,EAAavE,WAInC,OAAOyC,EAAU6C,gBACfb,EACAF,EAAajF,sBAAwBgF,EAAW9uB,UAChD9K,KAAKk4B,QAAQ2C,iBAgBnB5C,mCAAA,SACEE,EACAyB,EACAkB,EACAzC,EACAC,EACAE,EACAC,GAEA,IACIsC,EADEC,EAAgB7C,EAAaX,iBAE7ByD,EAAezC,EACjBx4B,KAAKk4B,QACLl4B,KAAKk4B,QAAQgD,mBACjB,GAAItB,EAAW9uB,UACbiwB,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,EAAW9uB,UACjDmwB,EAAaJ,gBAETnzB,EAAS,IAAIyvB,GACjBkB,EACAE,EACAD,GAEF,OAAOt4B,KAAKs7B,oCACV/C,EACAqB,EACAvB,EACA3wB,EACA+wB,IAcJR,iCAAA,SACEE,EACAyB,EACAkB,EACAzC,EACAC,EACAG,GAEA,IACIF,EAAcwB,EADZF,EAAe1B,EAAad,gBAE5B3vB,EAAS,IAAIyvB,GACjBkB,EACAF,EACAG,GAEF,GAAIsB,EAAW9uB,UACbivB,EAAgB/5B,KAAKk4B,QAAQkC,eAC3BjC,EAAad,gBAAgB/B,UAC7BwF,EACArC,GAEFF,EAAeJ,EAAayC,gBAC1Bb,GACA,EACA/5B,KAAKk4B,QAAQ2C,oBAEV,CACL,IAAMvJ,EAAWsI,EAAWhkB,WAC5B,GAAiB,cAAb0b,EACFyI,EAAgB/5B,KAAKk4B,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,EAAgB3vB,UAElByoB,EAAWuH,MACN,CACL,IAAM/b,EAAYrX,EAAO6zB,iBAAiBjK,GAQtCiC,EAPa,MAAbxU,EAE8B,cAA9B0b,EAAgB1gB,WAChBgF,EAAUuH,SAASmU,EAAgBe,UAAU1wB,UAIlCiU,EAEAA,EAAUK,YAAYqb,EAAiBK,GAIzC7U,GAAanH,WAG5B,GAAKsX,EAAShW,OAAOmT,GAenBgF,EAAeJ,MAfe,CAC9B,IAAMsD,EAAez7B,KAAKk4B,QAAQ9Y,YAChCya,EAAavE,UACbhE,EACAiC,EACAkH,EACA/yB,EACA+wB,GAEFF,EAAeJ,EAAayC,gBAC1Ba,EACA5B,EAAajF,qBACb50B,KAAKk4B,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,EAAezzB,EAAKywB,oBAClBgD,EACAE,EACA9c,EACAsZ,EACA2B,EACAvB,MAKNiD,EAAgBE,QAAQ,SAAC9lB,EAAciJ,GACrC,IAAM8c,EAAY1kB,EAAKT,MAAMZ,GACxBmiB,GAAc6D,eAAe/D,EAAW8D,EAAUjmB,cACrD+lB,EAAezzB,EAAKywB,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,EAAUP,iBAAiBlC,UAAUxqB,YACpCitB,EAAUP,iBAAiB5C,qBAE5B,OAAOmD,EAST,IACIgE,EADAJ,EAAe5D,EAGjBgE,EADE5kB,EAAKrM,UACS4wB,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,EAAWrrB,EAAK+zB,YAAYD,EAAa7X,GAC/CwX,EAAezzB,EAAK2wB,sBAClB8C,EACA,IAAI5mB,GAAKuc,GACTiC,EACA8E,EACA2B,EACAxB,EACAC,MAINsD,EAAc3K,SAAShQ,iBAAiB,SAACkQ,EAAU4K,GACjD,IAAMC,GACHpE,EAAUP,iBAAiB3C,mBAAmBvD,IACvB,MAAxB4K,EAAe36B,MACjB,IAAK+1B,EAAWxC,SAASxD,KAAc6K,EAAoB,CACzD,IAAMH,EAAcjE,EACjBP,iBACAlC,UACAjP,kBAAkBiL,GACfiC,EAAWrrB,EAAK+zB,YAAYD,EAAaE,GAC/CP,EAAezzB,EAAK2wB,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,EAAapxB,MAAe,CAE9B,GACG66B,EAAQtxB,WAAakvB,EAAYpF,sBAClCoF,EAAYoB,kBAAkBgB,GAE9B,OAAOp8B,KAAK64B,sBACVd,EACAqE,EACApC,EAAY1E,UAAUhP,SAAS8V,GAC/B/D,EACAC,EACAE,EACAC,GAEG,GAAI2D,EAAQtxB,UAAW,CAG5B,IAAIuxB,EAAkBpJ,GAAcJ,MAIpC,OAHAmH,EAAY1E,UAAUxO,aAAa7I,GAAW,SAACjQ,EAAMqP,GACnDgf,EAAkBA,EAAgBjrB,IAAI,IAAI2D,GAAK/G,GAAOqP,KAEjDrd,KAAKg5B,kBACVjB,EACAqE,EACAC,EACAhE,EACAC,EACAE,EACAC,GAGF,OAAOV,EAIT,IAAIuE,EAAkBrJ,GAAcJ,MAUpC,OATAF,EAAaiJ,QAAQ,SAACW,EAAWh7B,GAC/B,IAAMi7B,EAAkBJ,EAAQ1lB,MAAM6lB,GAClCvC,EAAYoB,kBAAkBoB,KAChCF,EAAkBA,EAAgBlrB,IAChCmrB,EACAvC,EAAY1E,UAAUhP,SAASkW,OAI9Bx8B,KAAKg5B,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,EAAKrM,UAC3C2xB,EAAc7D,cAEhB,OAAO54B,KAAKs7B,oCACV/C,EACAphB,EACAkhB,EACApB,GACAwB,IAaIR,8BAAR,SACEF,EACA5gB,EACAkhB,EACAqE,EACAjE,GAEA,IAAIxD,EACJ,GAAwC,MAApCoD,EAAYyB,eAAe3iB,GAC7B,OAAO4gB,EAEP,IAAMrwB,EAAS,IAAIyvB,GACjBkB,EACAN,EACA2E,GAEIC,EAAgB5E,EAAUV,gBAAgB/B,UAC5CyE,SACJ,GAAI5iB,EAAKrM,WAAiC,cAApBqM,EAAKvB,WAA4B,CACrD,IAAI8H,SACJ,GAAIqa,EAAUP,iBAAiB5C,qBAC7BlX,EAAU2a,EAAYpI,uBACpB8H,EAAUH,6BAEP,CACL,IAAMgF,EAAiB7E,EAAUP,iBAAiBlC,UAClD7wB,EACEm4B,aAA0B3W,GAC1B,iDAEFvI,EAAU2a,EAAY8B,0BACpByC,GAGJlf,EAAUA,EACVqc,EAAgB/5B,KAAKk4B,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,EACcvzB,KAAKk4B,QAAQ9Y,YAC3Bud,EACArL,EACAiC,EACApc,EAAKpB,WACLrO,EACA+wB,GAEOV,EAAUV,gBAAgB/B,UAAUR,SAASxD,GAEtCtxB,KAAKk4B,QAAQ9Y,YAC3Bud,EACArL,EACArL,GAAanH,WACb3H,EAAKpB,WACLrO,EACA+wB,GAGckE,GAGF7xB,WACditB,EAAUP,iBAAiB5C,uBAG3BK,EAAWoD,EAAYpI,uBACrB8H,EAAUH,0BAECvZ,eACX0b,EAAgB/5B,KAAKk4B,QAAQkC,eAC3BL,EACA9E,EACAwD,IAQR,OAHAxD,EACE8C,EAAUP,iBAAiB5C,sBACe,MAA1CyD,EAAYyB,eAAe/kB,GAAK8d,OAC3BkF,EAAU6C,gBACfb,EACA9E,EACAj1B,KAAKk4B,QAAQ2C,qBAx1BnB,YAA6B3C,GAAAl4B,aAAAk4B,EC5B/B,QA6BE2E,sCAAA,SACE7E,EACA8E,EACAC,GAHF,WAKQC,EAAkB,GAClBC,EAAkB,GAuDxB,OArDAjF,EAAQ9F,QAAQ,SAAAlH,GAEZA,EAAOvb,OAAS8lB,GAAOM,eACvB3tB,EAAKiiB,OAAO+S,oBACVlS,EAAO+K,QACP/K,EAAOI,eAGT6R,EAAM/5B,KACJqyB,GAAO4H,iBACLnS,EAAOnM,UACPmM,EAAOI,iBAMfprB,KAAKo9B,uBACHJ,EACAzH,GAAOG,cACPsC,EACA+E,EACAD,GAEF98B,KAAKo9B,uBACHJ,EACAzH,GAAOE,YACPuC,EACA+E,EACAD,GAEF98B,KAAKo9B,uBACHJ,EACAzH,GAAOO,YACPmH,EACAF,EACAD,GAEF98B,KAAKo9B,uBACHJ,EACAzH,GAAOM,cACPmC,EACA+E,EACAD,GAEF98B,KAAKo9B,uBACHJ,EACAzH,GAAOC,MACPwC,EACA+E,EACAD,GAGKE,GAaDH,oCAAR,SACEG,EACA3iB,EACA2d,EACAqF,EACAP,GALF,WAOQQ,EAAkBtF,EAAQuF,OAAO,SAAAvS,GAAU,OAAAA,EAAOvb,OAAS4K,IAEjEijB,EAAgBnqB,KAAKnT,KAAKw9B,gBAAgBtsB,KAAKlR,OAC/Cs9B,EAAgBpL,QAAQ,SAAAlH,GACtB,IAAMyS,EAAqBv1B,EAAKw1B,yBAC9B1S,EACA8R,GAEFO,EAAcnL,QAAQ,SAAAyL,GAChBA,EAAaC,WAAW5S,EAAOvb,OACjCutB,EAAO95B,KACLy6B,EAAaE,YAAYJ,EAAoBv1B,EAAK41B,cAapDjB,sCAAR,SAAiC7R,EAAgB8R,GAC/C,MAAoB,UAAhB9R,EAAOvb,MAAoC,kBAAhBub,EAAOvb,OAGpCub,EAAOH,SAAWiS,EAAWiB,wBAE3B/S,EAAOnM,UACPmM,EAAOI,aACPprB,KAAKmqB,SANAa,GAkBH6R,6BAAR,SAAwBjxB,EAAWrM,GACjC,GAAmB,MAAfqM,EAAEiT,WAAoC,MAAftf,EAAEsf,UAC3B,MAAMja,EAAe,sCAEvB,IAAMo5B,EAAW,IAAI5gB,GAAUxR,EAAEiT,UAAWjT,EAAEwf,cACxC6S,EAAW,IAAI7gB,GAAU7d,EAAEsf,UAAWtf,EAAE6rB,cAC9C,OAAOprB,KAAKmqB,OAAO3M,QAAQwgB,EAAUC,QAzJvC,YAAoBH,GAAA99B,YAAA89B,EAKlB99B,KAAKmqB,OAASnqB,KAAK89B,OAAO5S,iBAAiBC,WCA/C,ICbIU,OD6EFqS,sBAAA,WACE,OAAOl+B,KAAK89B,QAMdI,4BAAA,WACE,OAAOl+B,KAAKo3B,WAAWI,iBAAiBlC,WAO1C4I,oCAAA,SAAuB/mB,GACrB,IAAMgnB,EAAQn+B,KAAKo3B,WAAWQ,wBAC9B,OAAIuG,IAIAn+B,KAAK89B,OAAO5S,iBAAiBkT,iBAC3BjnB,EAAKrM,YAAcqzB,EAAM9X,kBAAkBlP,EAAKvB,YAAY9K,WAEvDqzB,EAAM7X,SAASnP,GAGnB,MAMT+mB,qBAAA,WACE,OAA2C,IAApCl+B,KAAKq+B,oBAAoB19B,QAMlCu9B,kCAAA,SAAqBxT,GACnB1qB,KAAKq+B,oBAAoBn7B,KAAKwnB,IAQhCwT,qCAAA,SACExT,EACA4T,GAEA,IAAMC,EAA8B,GACpC,GAAID,EAAa,CACf75B,EACuB,MAArBimB,EACA,mDAEF,IAAM8T,EAAOx+B,KAAK89B,OAAO3mB,KACzBnX,KAAKq+B,oBAAoBnM,QAAQ,SAAAyL,GAC/BW,EAAoCA,EACpC,IAAMG,EAAad,EAAae,kBAAkBJ,EAAaE,GAC3DC,GACFF,EAAar7B,KAAKu7B,KAKxB,GAAI/T,EAAmB,CAErB,IADA,IAAIiU,EAAY,GACPn+B,EAAI,EAAGA,EAAIR,KAAKq+B,oBAAoB19B,SAAUH,EAAG,CACxD,IAAM+vB,EAAWvwB,KAAKq+B,oBAAoB79B,GAC1C,GAAK+vB,EAASqO,QAAQlU,IAEf,GAAIA,EAAkBmU,iBAAkB,CAE7CF,EAAYA,EAAUh7B,OAAO3D,KAAKq+B,oBAAoBv0B,MAAMtJ,EAAI,IAChE,YAJAm+B,EAAUz7B,KAAKqtB,GAOnBvwB,KAAKq+B,oBAAsBM,OAE3B3+B,KAAKq+B,oBAAsB,GAE7B,OAAOE,GAWTL,4BAAA,SACE9F,EACAC,EACAqE,GAGEtE,EAAU3oB,OAASyhB,GAAcsD,OACJ,OAA7B4D,EAAU1wB,OAAO2qB,UAEjB5tB,EACEzE,KAAKo3B,WAAWQ,wBAChB,6DAEFnzB,EACEzE,KAAKo3B,WAAWsC,uBAChB,4DAIJ,IAAMvB,EAAen4B,KAAKo3B,WACpBx1B,EAAS5B,KAAK8+B,WAAWC,eAC7B5G,EACAC,EACAC,EACAqE,GAYF,OAVA18B,KAAK8+B,WAAWE,cAAcp9B,EAAOm2B,WAErCtzB,EACE7C,EAAOm2B,UAAUP,iBAAiB5C,uBAC/BuD,EAAaX,iBAAiB5C,qBACjC,2DAGF50B,KAAKo3B,WAAax1B,EAAOm2B,UAElB/3B,KAAKi/B,0BACVr9B,EAAOo2B,QACPp2B,EAAOm2B,UAAUV,gBAAgB/B,UACjC,OAQJ4I,8BAAA,SAAiBP,GACf,IAAM3I,EAAYh1B,KAAKo3B,WAAWC,gBAC5B6H,EAA2B,GAUjC,OATKlK,EAAUM,UAAUjX,cACL2W,EAAUM,UAClBxO,aAAazG,GAAgB,SAAC7W,EAAKuV,GAC3CmgB,EAAeh8B,KAAKqyB,GAAOgB,iBAAiB/sB,EAAKuV,MAGjDiW,EAAUJ,sBACZsK,EAAeh8B,KAAKqyB,GAAOoE,YAAY3E,EAAUM,YAE5Ct1B,KAAKi/B,0BACVC,EACAlK,EAAUM,UACVqI,IAWJO,uCAAA,SACElG,EACA8E,EACApS,GAEA,IAAM2S,EAAgB3S,EAClB,CAACA,GACD1qB,KAAKq+B,oBACT,OAAOr+B,KAAKm/B,gBAAgBC,yBAC1BpH,EACA8E,EACAO,QAzOJ,YAAoBS,EAAeuB,GAAfr/B,YAAA89B,EARZ99B,yBAA2C,GASjD,IAAMgY,EAAShY,KAAK89B,OAAO5S,iBAErBoU,EAAc,IAAItJ,GAAche,EAAOmT,YACvCoS,EAASvlB,EAAOunB,gBAMtBv/B,KAAK8+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,gBAOT76B,KAAKo3B,WAAa,IAAIrC,GAAUgF,EAAegB,GAM/C/6B,KAAKm/B,gBAAkB,IAAItC,GAAe78B,KAAK89B,QC3DnD,QACEt+B,sBAAWkgC,iCAQX,WAEE,OADAj7B,EAAOonB,GAAwB,oCACxBA,QAVT,SAAkC9c,GAChCtK,GACGonB,GACD,mDAEFA,GAAyB9c,mCAgB3B2wB,qBAAA,WACE,OAA2B,IAApB1/B,KAAK2/B,MAAMtO,MAGpBqO,4BAAA,SACEtH,EACAC,EACAuH,WAEMvN,EAAU+F,EAAU1wB,OAAO2qB,QACjC,GAAgB,OAAZA,EAAkB,CACpB,IAAMwN,EAAO7/B,KAAK2/B,MAAMnuB,IAAI6gB,GAE5B,OADA5tB,EAAe,MAARo7B,EAAc,gDACdA,EAAKd,eACV3G,EACAC,EACAuH,GAGF,IAAI5C,EAAkB,OAEtB,IAAmB,IAAArzB,EAAAxG,EAAAnD,KAAK2/B,MAAM3I,wCAAnB6I,UACT7C,EAASA,EAAOr5B,OACdk8B,EAAKd,eAAe3G,EAAWC,EAAauH,qGAIhD,OAAO5C,GAcX0C,kCAAA,SACEzU,EACAP,EACA2N,EACA2B,EACA8F,GAEA,IAAMzN,EAAUpH,EAAM2E,kBAClBiQ,EAAO7/B,KAAK2/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,GACvB/3B,KAAK2/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,EAAkBngC,KAAKogC,kBAC7B,GAAgB,YAAZ/N,MAEF,IAAkC,IAAA1oB,EAAAxG,EAAAnD,KAAK2/B,MAAMU,yCAAW,CAA7C,IAAAC,EAAAh9B,aAACi9B,OAAaV,OACvBtB,EAAeA,EAAa56B,OAC1Bk8B,EAAKW,wBAAwB9V,EAAmB4T,IAE9CuB,EAAK/0B,YACP9K,KAAK2/B,MAAM7N,OAAOyO,GAGbV,EAAKY,WAAWvV,iBAAiBkT,gBACpC8B,EAAQh9B,KAAK28B,EAAKY,oHAMlBZ,EAAO7/B,KAAK2/B,MAAMnuB,IAAI6gB,MAE1BkM,EAAeA,EAAa56B,OAC1Bk8B,EAAKW,wBAAwB9V,EAAmB4T,IAE9CuB,EAAK/0B,YACP9K,KAAK2/B,MAAM7N,OAAOO,GAGbwN,EAAKY,WAAWvV,iBAAiBkT,gBACpC8B,EAAQh9B,KAAK28B,EAAKY,cAa1B,OAPIN,IAAoBngC,KAAKogC,mBAE3BF,EAAQh9B,KACN,IAAIw8B,GAAU7T,uBAAuBZ,EAAMuC,KAAMvC,EAAM9T,OAIpD,CAAE+oB,UAASlD,OAAQuB,IAG5BmB,2BAAA,mBACQ99B,EAAS,OACf,IAAmB,IAAA+H,EAAAxG,EAAAnD,KAAK2/B,MAAM3I,wCAAU,CAAnC,IAAM6I,UACJA,EAAKY,WAAWvV,iBAAiBkT,gBACpCx8B,EAAOsB,KAAK28B,qGAGhB,OAAOj+B,GAOT89B,oCAAA,SAAuBvoB,WACjB6iB,EAA2B,SAC/B,IAAmB,IAAArwB,EAAAxG,EAAAnD,KAAK2/B,MAAM3I,wCAAU,CAAnC,IAAM6I,UACT7F,EAAcA,GAAe6F,EAAKa,uBAAuBvpB,qGAE3D,OAAO6iB,GAGT0F,0BAAA,SAAazU,GAEX,GADeA,EAAMC,iBACVkT,eACT,OAAOp+B,KAAK2gC,kBAEZ,IAAMtO,EAAUpH,EAAM2E,kBACtB,OAAO5vB,KAAK2/B,MAAMnuB,IAAI6gB,IAI1BqN,gCAAA,SAAmBzU,GACjB,OAAmC,MAA5BjrB,KAAK4gC,aAAa3V,IAG3ByU,6BAAA,WACE,OAAiC,MAA1B1/B,KAAK2gC,mBAGdjB,6BAAA,uBACE,IAAmB,IAAA/1B,EAAAxG,EAAAnD,KAAK2/B,MAAM3I,wCAAU,CAAnC,IAAM6I,UACT,GAAIA,EAAKY,WAAWvV,iBAAiBkT,eACnC,OAAOyB,oGAGX,OAAO,UAzNX,cAoBmB7/B,WAA2B,IAAImyB,IChClD,QAKE0O,sBAAA,SAAS1pB,EAAYkG,GACnB,GAAIlG,EAAKrM,UACP,OAAO,IAAI+1B,GAAc,IAAI5N,GAAc5V,IAE3C,IAAMyjB,EAAW9gC,KAAK+gC,WAAWC,yBAAyB7pB,GAC1D,GAAgB,MAAZ2pB,EAAkB,CACpB,IAAMG,EAAeH,EAAS3pB,KAC1B5V,EAAQu/B,EAASv/B,MACfuU,EAAef,GAAKe,aAAamrB,EAAc9pB,GAErD,OADA5V,EAAQA,EAAM6d,YAAYtJ,EAAcuH,GACjC,IAAIwjB,GAAc7gC,KAAK+gC,WAAW3vB,IAAI6vB,EAAc1/B,IAE3D,IAAMqxB,EAAU,IAAIK,GAAc5V,GAElC,OAAO,IAAIwjB,GADU7gC,KAAK+gC,WAAWtN,QAAQtc,EAAMyb,KAMzDiO,uBAAA,SAAU1pB,EAAY+pB,GACpB,IAAIC,EAAWnhC,KAIf,OAHAoT,GAAK8tB,EAAS,SAAC5P,EAAkBjU,GAC/B8jB,EAAWA,EAASC,SAASjqB,EAAKT,MAAM4a,GAAWjU,KAE9C8jB,GAUTN,yBAAA,SAAY1pB,GACV,OAAIA,EAAKrM,UACA+1B,GAAchO,MAGd,IAAIgO,GADU7gC,KAAK+gC,WAAWtN,QAAQtc,EAAM8b,GAAcJ,SAYrEgO,8BAAA,SAAiB1pB,GACf,OAAqC,MAA9BnX,KAAKqhC,gBAAgBlqB,IAU9B0pB,6BAAA,SAAgB1pB,GACd,IAAM2pB,EAAW9gC,KAAK+gC,WAAWC,yBAAyB7pB,GAC1D,OAAgB,MAAZ2pB,EACK9gC,KAAK+gC,WACTvvB,IAAIsvB,EAAS3pB,MACbmP,SAASvR,GAAKe,aAAagrB,EAAS3pB,KAAMA,IAEtC,MASX0pB,iCAAA,WACE,IAAMzP,EAAwB,GACxB/T,EAAOrd,KAAK+gC,WAAWx/B,MAkB7B,OAjBY,MAAR8b,EAEGA,EAAKgB,cACPhB,EAAsByJ,aACrBzG,GACA,SAACxB,EAAWE,GACVqS,EAASluB,KAAK,IAAIka,GAAUyB,EAAWE,MAK7C/e,KAAK+gC,WAAW3P,SAAShQ,iBAAiB,SAACvC,EAAWsF,GAC7B,MAAnBA,EAAU5iB,OACZ6vB,EAASluB,KAAK,IAAIka,GAAUyB,EAAWsF,EAAU5iB,UAIhD6vB,GAGTyP,gCAAA,SAAmB1pB,GACjB,GAAIA,EAAKrM,UACP,OAAO9K,KAEP,IAAMshC,EAAgBthC,KAAKqhC,gBAAgBlqB,GAC3C,OACS,IAAI0pB,GADQ,MAAjBS,EACuB,IAAIrO,GAAcqO,GAElBthC,KAAK+gC,WAAWnO,QAAQzb,KASvD0pB,qBAAA,WACE,OAAO7gC,KAAK+gC,WAAWj2B,WASzB+1B,mBAAA,SAAMxjB,GACJ,OAIJ,SAASkkB,EACPzrB,EACA0rB,EACAnkB,GAEA,GAAuB,MAAnBmkB,EAAUjgC,MAEZ,OAAO8b,EAAK+B,YAAYtJ,EAAc0rB,EAAUjgC,OAEhD,IAAIkgC,EAAgB,KAkBpB,OAjBAD,EAAUpQ,SAAShQ,iBAAiB,SAACkQ,EAAUnN,GAC5B,cAAbmN,GAGF7sB,EACsB,OAApB0f,EAAU5iB,MACV,6CAEFkgC,EAAgBtd,EAAU5iB,OAE1B8b,EAAOkkB,EAAkBzrB,EAAaY,MAAM4a,GAAWnN,EAAW9G,KAIjEA,EAAKiJ,SAASxQ,GAAchL,WAA+B,OAAlB22B,IAC5CpkB,EAAOA,EAAK+B,YAAYtJ,EAAaY,MAAM,aAAc+qB,IAEpDpkB,EA/BAkkB,CAAkBxsB,GAAK8d,MAAO7yB,KAAK+gC,WAAY1jB,IAlIjDwjB,SAAQ,IAAIA,GAAc,IAAI5N,GAAc,WAFnD,YAAoB8N,GAAA/gC,gBAAA+gC,ECetB,QA4BEW,yBAAA,SAAYvqB,GACV,OAAO,IAAIwqB,GAAaxqB,EAAMnX,OAWhC0hC,0BAAA,SAAavqB,EAAYoS,EAAYqY,EAAiBC,GACpDp9B,EACEm9B,EAAU5hC,KAAK8hC,aACf,qDAEch6B,IAAZ+5B,IACFA,GAAU,GAEZ7hC,KAAK+hC,WAAW7+B,KAAK,CACnBiU,OACAoS,OACAqY,UACAC,YAGEA,IACF7hC,KAAKgiC,eAAiBhiC,KAAKgiC,eAAeZ,SAASjqB,EAAMoS,IAE3DvpB,KAAK8hC,aAAeF,GAUtBF,sBAAA,SACEvqB,EACAukB,EACAkG,GAEAn9B,EACEm9B,EAAU5hC,KAAK8hC,aACf,gDAEF9hC,KAAK+hC,WAAW7+B,KAAK,CACnBiU,OACAia,SAAUsK,EACVkG,UACAC,SAAS,IAGX7hC,KAAKgiC,eAAiBhiC,KAAKgiC,eAAeC,UAAU9qB,EAAMukB,GAC1D17B,KAAK8hC,aAAeF,GAOtBF,sBAAA,SAASE,GACP,IAAK,IAAIphC,EAAI,EAAGA,EAAIR,KAAK+hC,WAAWphC,OAAQH,IAAK,CAC/C,IAAM0hC,EAASliC,KAAK+hC,WAAWvhC,GAC/B,GAAI0hC,EAAON,UAAYA,EACrB,OAAOM,EAGX,OAAO,MAWTR,yBAAA,SAAYE,GAAZ,WAMQza,EAAMnnB,KAAK+hC,WAAWI,UAAU,SAAA5hC,GACpC,OAAOA,EAAEqhC,UAAYA,IAEvBn9B,EAAc,GAAP0iB,EAAU,gDACjB,IAAMib,EAAgBpiC,KAAK+hC,WAAW5a,GACtCnnB,KAAK+hC,WAAWM,OAAOlb,EAAK,GAO5B,IALA,IAAImb,EAAyBF,EAAcP,QACvCU,GAAsC,EAEtC/hC,EAAIR,KAAK+hC,WAAWphC,OAAS,EAE1B2hC,GAA+B,GAAL9hC,GAAQ,CACvC,IAAMgiC,EAAexiC,KAAK+hC,WAAWvhC,GACjCgiC,EAAaX,UAER1a,GAAL3mB,GACAR,KAAKyiC,oBAAoBD,EAAcJ,EAAcjrB,MAGrDmrB,GAAyB,EAChBF,EAAcjrB,KAAKxM,SAAS63B,EAAarrB,QAElDorB,GAAsC,IAG1C/hC,IAGF,QAAK8hC,IAEMC,EAETviC,KAAK0iC,aAIDN,EAAc7Y,KAChBvpB,KAAKgiC,eAAiBhiC,KAAKgiC,eAAeW,YACxCP,EAAcjrB,MAIhB/D,GADiBgvB,EAAchR,SAChB,SAACvS,GACd3W,EAAK85B,eAAiB95B,EAAK85B,eAAeW,YACxCP,EAAcjrB,KAAKT,MAAMmI,OAXxB,IA0BX6iB,kCAAA,SAAqBvqB,GACnB,OAAOnX,KAAKgiC,eAAeX,gBAAgBlqB,IAa7CuqB,oCAAA,SACEkB,EACAlG,EACAmG,EACAC,GAEA,GAAKD,GAAsBC,EAmBpB,CACL,IAAMhK,EAAQ94B,KAAKgiC,eAAee,mBAAmBH,GACrD,IAAKE,GAAuBhK,EAAMhuB,UAChC,OAAO4xB,EAGP,GACGoG,GACsB,MAAvBpG,GACC5D,EAAMkK,iBAAiBjuB,GAAK8d,OAGxB,CACL,IAQMoQ,EAAcvB,GAAUwB,WAC5BljC,KAAK+hC,WATQ,SAAUoB,GACvB,OACGA,EAAMtB,SAAWiB,MAChBD,KACEA,EAAkBpqB,QAAQ0qB,EAAMvB,YACnCuB,EAAMhsB,KAAKxM,SAASi4B,IAAaA,EAASj4B,SAASw4B,EAAMhsB,QAM5DyrB,GAGF,OADMQ,EAAe1G,GAAuBzW,GAAanH,WAClDmkB,EAAYpiC,MAAMuiC,GAhBzB,OAAO,KA7BX,IAAM9B,EAAgBthC,KAAKgiC,eAAeX,gBAAgBuB,GAC1D,GAAqB,MAAjBtB,EACF,OAAOA,EAEP,IAAM+B,EAAWrjC,KAAKgiC,eAAee,mBAAmBH,GACxD,GAAIS,EAASv4B,UACX,OAAO4xB,EACF,GACkB,MAAvBA,GACC2G,EAASL,iBAAiBjuB,GAAK8d,OAI3B,CACL,IAAMuQ,EAAe1G,GAAuBzW,GAAanH,WACzD,OAAOukB,EAASxiC,MAAMuiC,GAHtB,OAAO,MA+Cf1B,uCAAA,SACEkB,EACAU,GAEA,IAAIrJ,EAAmBhU,GAAanH,WAC9BykB,EAAcvjC,KAAKgiC,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,EAAQxjC,KAAKgiC,eAAee,mBAAmBH,GAoBrD,OAnBAU,EAAuBxc,aACrBzG,GACA,SAACxB,EAAWE,GACV,IAAM1B,EAAOmmB,EACVT,mBAAmB,IAAIhuB,GAAK8J,IAC5Bhe,MAAMke,GACTkb,EAAmBA,EAAiB/a,qBAClCL,EACAxB,KAKNmmB,EAAMC,sBAAsBvR,QAAQ,SAAArO,GAClCoW,EAAmBA,EAAiB/a,qBAClC2E,EAAU7V,KACV6V,EAAUxG,QAGP4c,EAWP,OAPcj6B,KAAKgiC,eAAee,mBAAmBH,GAC/Ca,sBAAsBvR,QAAQ,SAAArO,GAClCoW,EAAmBA,EAAiB/a,qBAClC2E,EAAU7V,KACV6V,EAAUxG,QAGP4c,GAwBXyH,gDAAA,SACEkB,EACA5Y,EACA0Z,EACAC,GAEAl/B,EACEi/B,GAAqBC,EACrB,6DAEF,IAAMxsB,EAAOyrB,EAASlsB,MAAMsT,GAC5B,GAAIhqB,KAAKgiC,eAAegB,iBAAiB7rB,GAGvC,OAAO,KAGP,IAAMysB,EAAa5jC,KAAKgiC,eAAee,mBAAmB5rB,GAC1D,OAAIysB,EAAW94B,UAEN64B,EAAmBrd,SAAS0D,GAQ5B4Z,EAAW/iC,MAAM8iC,EAAmBrd,SAAS0D,KAc1D0X,+BAAA,SACEkB,EACAtR,EACAqS,GAEA,IAAMxsB,EAAOyrB,EAASlsB,MAAM4a,GACtBgQ,EAAgBthC,KAAKgiC,eAAeX,gBAAgBlqB,GAC1D,OAAqB,MAAjBmqB,EACKA,EAEHqC,EAAmB9O,mBAAmBvD,GACrBtxB,KAAKgiC,eAAee,mBAAmB5rB,GACxCtW,MAChB8iC,EAAmBrO,UAAUjP,kBAAkBiL,IAG1C,MAUboQ,4BAAA,SAAevqB,GACb,OAAOnX,KAAKgiC,eAAeX,gBAAgBlqB,IAO7CuqB,8BAAA,SACEkB,EACAjL,EACA/P,EACAzG,EACAnN,EACAqL,GAEA,IAAIwkB,EACE/K,EAAQ94B,KAAKgiC,eAAee,mBAAmBH,GAC/CtB,EAAgBxI,EAAMuI,gBAAgBtsB,GAAK8d,OACjD,GAAqB,MAAjByO,EACFuC,EAAYvC,MACP,CAAA,GAA0B,MAAtB3J,EAIT,MAAO,GAHPkM,EAAY/K,EAAMj4B,MAAM82B,GAM1B,IADAkM,EAAYA,EAAUpN,UAAUpX,IACjBvU,WAAc+4B,EAAUxlB,aAerC,MAAO,GARP,IANA,IAAMwZ,EAAQ,GACRzhB,EAAMiJ,EAAMmG,aACZL,EAAOnR,EACR6vB,EAA2B/b,uBAAuBF,EAAWvI,GAC7DwkB,EAA2Bnc,gBAAgBE,EAAWvI,GACvD5d,EAAO0jB,EAAKG,UACT7jB,GAAQo2B,EAAMl3B,OAASwgB,GACC,IAAzB/K,EAAI3U,EAAMmmB,IACZiQ,EAAM30B,KAAKzB,GAEbA,EAAO0jB,EAAKG,UAEd,OAAOuS,GAMH6J,iCAAR,SAA4BoC,EAA0B3sB,GACpD,GAAI2sB,EAAYva,KACd,OAAOua,EAAY3sB,KAAKxM,SAASwM,GAEjC,IAAK,IAAM0H,KAAailB,EAAY1S,SAClC,GACE0S,EAAY1S,SAASvxB,eAAegf,IACpCilB,EAAY3sB,KAAKT,MAAMmI,GAAWlU,SAASwM,GAE3C,OAAO,EAGX,OAAO,GAOHuqB,wBAAR,WACE1hC,KAAKgiC,eAAiBN,GAAUwB,WAC9BljC,KAAK+hC,WACLL,GAAUqC,eACVhvB,GAAK8d,OAEsB,EAAzB7yB,KAAK+hC,WAAWphC,OAClBX,KAAK8hC,aAAe9hC,KAAK+hC,WAAW/hC,KAAK+hC,WAAWphC,OAAS,GAAGihC,QAEhE5hC,KAAK8hC,cAAgB,GAOVJ,kBAAf,SAA8ByB,GAC5B,OAAOA,EAAMtB,SAOAH,cAAf,SACEsC,EACAzG,EACA0G,GAGA,IADA,IAAIC,EAAgBrD,GAAchO,MACzBryB,EAAI,EAAGA,EAAIwjC,EAAOrjC,SAAUH,EAAG,CACtC,IAAM2iC,EAAQa,EAAOxjC,GAIrB,GAAI+8B,EAAO4F,GAAQ,CACjB,IAAMtH,EAAYsH,EAAMhsB,KACpBrB,SACJ,GAAIqtB,EAAM5Z,KACJ0a,EAASt5B,SAASkxB,IACpB/lB,EAAef,GAAKe,aAAamuB,EAAUpI,GAC3CqI,EAAgBA,EAAc9C,SAAStrB,EAAcqtB,EAAM5Z,OAClDsS,EAAUlxB,SAASs5B,KAC5BnuB,EAAef,GAAKe,aAAa+lB,EAAWoI,GAC5CC,EAAgBA,EAAc9C,SAC5BrsB,GAAK8d,MACLsQ,EAAM5Z,KAAKjD,SAASxQ,SAKnB,CAAA,IAAIqtB,EAAM/R,SA0Bf,MAAMxsB,EAAe,8CAzBrB,GAAIq/B,EAASt5B,SAASkxB,GACpB/lB,EAAef,GAAKe,aAAamuB,EAAUpI,GAC3CqI,EAAgBA,EAAcjC,UAC5BnsB,EACAqtB,EAAM/R,eAEH,GAAIyK,EAAUlxB,SAASs5B,GAE5B,IADAnuB,EAAef,GAAKe,aAAa+lB,EAAWoI,IAC3Bn5B,UACfo5B,EAAgBA,EAAcjC,UAC5BltB,GAAK8d,MACLsQ,EAAM/R,cAEH,CACL,IAAM1a,EAAQ7L,EAAQs4B,EAAM/R,SAAUtb,EAAaF,YACnD,GAAIc,EAAO,CAET,IAAMytB,EAAWztB,EAAM4P,SAASxQ,EAAaC,YAC7CmuB,EAAgBA,EAAc9C,SAASrsB,GAAK8d,MAAOsR,OAW/D,OAAOD,OAliBX,cAQUlkC,oBAAgC6gC,GAAchO,MAU9C7yB,gBAA4B,GAE5BA,mBAAgB,EAwhB1B,QA2CE2hC,oCAAA,SACEjF,EACAmG,EACAC,GAEA,OAAO9iC,KAAK+gC,WAAW9Q,uBACrBjwB,KAAKokC,UACL1H,EACAmG,EACAC,IAWJnB,uCAAA,SACE2B,GAEA,OAAOtjC,KAAK+gC,WAAW5G,0BACrBn6B,KAAKokC,UACLd,IAuBJ3B,gDAAA,SACExqB,EACAusB,EACAC,GAEA,OAAO3jC,KAAK+gC,WAAWvG,mCACrBx6B,KAAKokC,UACLjtB,EACAusB,EACAC,IAYJhC,4BAAA,SAAexqB,GACb,OAAOnX,KAAK+gC,WAAWjH,eAAe95B,KAAKokC,UAAU1tB,MAAMS,KAc7DwqB,8BAAA,SACEhK,EACA/P,EACAzG,EACAnN,EACAqL,GAEA,OAAOrf,KAAK+gC,WAAWjJ,iBACrB93B,KAAKokC,UACLzM,EACA/P,EACAzG,EACAnN,EACAqL,IAYJsiB,+BAAA,SACErQ,EACA+S,GAEA,OAAOrkC,KAAK+gC,WAAWrJ,kBACrB13B,KAAKokC,UACL9S,EACA+S,IAUJ1C,mBAAA,SAAM9iB,GACJ,OAAO,IAAI8iB,GAAa3hC,KAAKokC,UAAU1tB,MAAMmI,GAAY7e,KAAK+gC,iBA9IhE,YAAY5pB,EAAYqqB,GACtBxhC,KAAKokC,UAAYjtB,EACjBnX,KAAK+gC,WAAaS,ECziBtB,QAyBE8C,gCAAA,SACEntB,EACAotB,EACA3C,EACAC,GAKA,OAFA7hC,KAAKwkC,kBAAkBC,aAAattB,EAAMotB,EAAS3C,EAASC,GAEvDA,EAGI7hC,KAAK0kC,4BACV,IAAIrQ,GAAUjC,GAAgBY,KAAM7b,EAAMotB,IAHrC,IAaXD,4BAAA,SACEntB,EACAukB,EACAkG,GAGA5hC,KAAKwkC,kBAAkBG,SAASxtB,EAAMukB,EAAiBkG,GAEvD,IAAMgD,EAAa3R,GAAc4R,WAAWnJ,GAE5C,OAAO17B,KAAK0kC,4BACV,IAAInQ,GAAMnC,GAAgBY,KAAM7b,EAAMytB,KAU1CN,0BAAA,SAAa1C,EAAiB9O,gBAAAA,MAC5B,IAAMqQ,EAAQnjC,KAAKwkC,kBAAkBM,SAASlD,GAE9C,GADyB5hC,KAAKwkC,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,KAGnDrd,KAAK0kC,4BACV,IAAIhS,GAAayQ,EAAMhsB,KAAM4tB,EAAcjS,IAZ7C,MAAO,IAsBXwR,kCAAA,SAAqBntB,EAAYotB,GAC/B,OAAOvkC,KAAK0kC,4BACV,IAAIrQ,GAAUjC,GAAgB4S,OAAQ7tB,EAAMotB,KAShDD,8BAAA,SACEntB,EACAukB,GAEA,IAAMkJ,EAAa3R,GAAc4R,WAAWnJ,GAE5C,OAAO17B,KAAK0kC,4BACV,IAAInQ,GAAMnC,GAAgB4S,OAAQ7tB,EAAMytB,KAS5CN,iCAAA,SAAoBntB,GAClB,OAAOnX,KAAK0kC,4BACV,IAAIvQ,GAAe/B,GAAgB4S,OAAQ7tB,KAS/CmtB,uCAAA,SAA0BntB,EAAYoS,EAAY0b,GAChD,IAAMC,EAAWllC,KAAKmlC,gBAAgBF,GACtC,GAAgB,MAAZC,EAaF,MAAO,GAZP,IAAM3hC,EAAI+gC,GAASc,eAAeF,GAC5BG,EAAY9hC,EAAE4T,KAClBkb,EAAU9uB,EAAE8uB,QACRvc,EAAef,GAAKe,aAAauvB,EAAWluB,GAC5CpU,EAAK,IAAIsxB,GACbjC,GAAgBkT,qBAAqBjT,GACrCvc,EACAyT,GAEF,OAAOvpB,KAAKulC,sBAAsBF,EAAWtiC,IAYjDuhC,mCAAA,SACEntB,EACAukB,EACAuJ,GAEA,IAAMC,EAAWllC,KAAKmlC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAM3hC,EAAI+gC,GAASc,eAAeF,GAC5BG,EAAY9hC,EAAE4T,KAClBkb,EAAU9uB,EAAE8uB,QACRvc,EAAef,GAAKe,aAAauvB,EAAWluB,GAC5CytB,EAAa3R,GAAc4R,WAAWnJ,GACtC34B,EAAK,IAAIwxB,GACbnC,GAAgBkT,qBAAqBjT,GACrCvc,EACA8uB,GAEF,OAAO5kC,KAAKulC,sBAAsBF,EAAWtiC,GAG7C,MAAO,IASXuhC,uCAAA,SAA0BntB,EAAY8tB,GACpC,IAAMC,EAAWllC,KAAKmlC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAM3hC,EAAI+gC,GAASc,eAAeF,GAC5BG,EAAY9hC,EAAE4T,KAClBkb,EAAU9uB,EAAE8uB,QACRvc,EAAef,GAAKe,aAAauvB,EAAWluB,GAC5CpU,EAAK,IAAIoxB,GACb/B,GAAgBkT,qBAAqBjT,GACrCvc,GAEF,OAAO9V,KAAKulC,sBAAsBF,EAAWtiC,GAG7C,MAAO,IASXuhC,kCAAA,SACErZ,EACAP,GAEA,IAAMvT,EAAO8T,EAAM9T,KAEf6iB,EAA2B,KAC3BwL,GAA2B,EAG/BxlC,KAAKylC,eAAeC,cAAcvuB,EAAM,SAACwuB,EAAiBC,GACxD,IAAM9vB,EAAef,GAAKe,aAAa6vB,EAAiBxuB,GACxD6iB,EAAcA,GAAe4L,EAAGlF,uBAAuB5qB,GACvD0vB,EACEA,GAA4BI,EAAGxF,oBAEnC,IAUIN,EAVA+F,EAAY7lC,KAAKylC,eAAej0B,IAAI2F,GACnC0uB,GAIHL,EACEA,GAA4BK,EAAUzF,kBACxCpG,EAAcA,GAAe6L,EAAUnF,uBAAuB3rB,GAAK8d,SALnEgT,EAAY,IAAInG,GAChB1/B,KAAKylC,eAAiBzlC,KAAKylC,eAAer0B,IAAI+F,EAAM0uB,IAQnC,MAAf7L,EACF8F,GAAsB,GAEtBA,GAAsB,EACtB9F,EAAc/T,GAAanH,WACX9e,KAAKylC,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,GACxCxmB,GACGzE,KAAKmmC,cAAc5U,IAAI2T,GACxB,0CAEF,IAAMD,EAAMX,GAAS8B,mBACrBpmC,KAAKmmC,cAAc/0B,IAAI8zB,EAAUD,GACjCjlC,KAAKqmC,cAAcj1B,IAAI6zB,EAAKC,GAE9B,IAAM7M,EAAcr4B,KAAKwkC,kBAAkB8B,YAAYnvB,GACnD6lB,EAAS6I,EAAU7F,qBACrB/U,EACAP,EACA2N,EACA2B,EACA8F,GAEF,IAAKkG,IAAsBR,EAA0B,CACnD,IAAM3F,EAA0BgG,EAAUjF,aAAa3V,GACvD+R,EAASA,EAAOr5B,OAAO3D,KAAKumC,eAAetb,EAAO4U,IAEpD,OAAO7C,GAaTsH,qCAAA,SACErZ,EACAP,EACA4T,GAHF,WAMQnnB,EAAO8T,EAAM9T,KACbqvB,EAAiBxmC,KAAKylC,eAAej0B,IAAI2F,GAC3ConB,EAAwB,GAI5B,GACEiI,IAC6B,YAA5Bvb,EAAM2E,mBACL4W,EAAeP,mBAAmBhb,IACpC,CAIA,IAAMwb,EAAmBD,EAAehG,wBACtCvV,EACAP,EACA4T,GAEEkI,EAAe17B,YACjB9K,KAAKylC,eAAiBzlC,KAAKylC,eAAep0B,OAAO8F,IAEnD,IAAM+oB,EAAUuG,EAAiBvG,QACjC3B,EAAekI,EAAiBzJ,OAOhC,IAAM0J,GACH,IACDxG,EAAQiC,UAAU,SAAAlX,GAChB,OAAOA,EAAMC,iBAAiBkT,iBAE5BuI,EAAU3mC,KAAKylC,eAAemB,WAClCzvB,EACA,SAACrB,EAAc+wB,GACb,OAAOA,EAAgBzG,oBAI3B,GAAIsG,IAAoBC,EAAS,CAC/B,IAAM/T,EAAU5yB,KAAKylC,eAAe7S,QAAQzb,GAG5C,IAAKyb,EAAQ9nB,UAKX,IAHA,IAAMg8B,EAAW9mC,KAAK+mC,gCAAgCnU,GAG7CpyB,EAAI,EAAGA,EAAIsmC,EAASnmC,SAAUH,EAAG,CACxC,IAAMq/B,EAAOiH,EAAStmC,GACpBwmC,EAAWnH,EAAKY,WACZwG,EAAWjnC,KAAKknC,uBAAuBrH,GAC7C7/B,KAAKmnC,gBAAgBC,eACnB9C,GAAS+C,mBAAmBL,GAC5BhnC,KAAKsnC,aAAaN,GAClBC,EAASM,OACTN,EAASlrB,cAUZ4qB,GAA4B,EAAjBzG,EAAQv/B,SAAe29B,IAGjCoI,EAGF1mC,KAAKmnC,gBAAgBK,cACnBlD,GAAS+C,mBAAmBpc,GAFI,MAMlCiV,EAAQhO,QAAQ,SAACuV,GACf,IAAMC,EAAcx/B,EAAKi+B,cAAc30B,IACrC8yB,GAAS4B,cAAcuB,IAEzBv/B,EAAKi/B,gBAAgBK,cACnBlD,GAAS+C,mBAAmBI,GAC5BC,MAMR1nC,KAAK2nC,YAAYzH,GAInB,OAAO3B,GAcT+F,oCAAA,SAAuBntB,EAAY0rB,GACjC,IACMrB,EAAYxhC,KAAKwkC,kBACjBxK,EAAch6B,KAAKylC,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,EAAMpkC,OAAOukC,KAEhBH,KAMPzD,yBAAR,SAAoB6D,GAClB,IAAK,IAAI77B,EAAI,EAAGA,EAAI67B,EAAQxnC,SAAU2L,EAAG,CACvC,IAAM87B,EAAeD,EAAQ77B,GAC7B,IAAK87B,EAAald,iBAAiBkT,eAAgB,CAEjD,IAAMiK,EAAkB/D,GAAS4B,cAAckC,GACzCE,EAAkBtoC,KAAKmmC,cAAc30B,IAAI62B,GAC/CroC,KAAKmmC,cAAcrU,OAAOuW,GAC1BroC,KAAKqmC,cAAcvU,OAAOwW,MAUjBhE,sBAAf,SAAkCrZ,GAChC,OACEA,EAAMC,iBAAiBkT,iBACtBnT,EAAMC,iBAAiBqd,YAKjBtd,EAAMX,SAENW,GASHqZ,4BAAR,SAAuBrZ,EAAc4U,GACnC,IAAM1oB,EAAO8T,EAAM9T,KACb8tB,EAAMjlC,KAAKsnC,aAAarc,GACxBgc,EAAWjnC,KAAKknC,uBAAuBrH,GAEvC7C,EAASh9B,KAAKmnC,gBAAgBC,eAClC9C,GAAS+C,mBAAmBpc,GAC5Bga,EACAgC,EAASM,OACTN,EAASlrB,YAGL6W,EAAU5yB,KAAKylC,eAAe7S,QAAQzb,GAG5C,GAAI8tB,EACFxgC,GACGmuB,EAAQrxB,MAAM6+B,kBACf,0DA2BF,IAvBA,IAAMoI,EAAgB5V,EAAQgV,KAC5B,SAAC9xB,EAAc+xB,EAAqBC,GAClC,IACGhyB,EAAahL,WACd+8B,GACAA,EAAoBzH,kBAEpB,MAAO,CAACyH,EAAoBlH,kBAAkBF,YAG9C,IAAIgI,EAAmB,GASvB,OARIZ,IACFY,EAAUA,EAAQ9kC,OAChBkkC,EAAoBG,gBAAgBj9B,IAAI,SAAA80B,GAAQ,OAAAA,EAAKY,eAGzDrtB,GAAK00B,EAAU,SAACG,EAAcS,GAC5BD,EAAUA,EAAQ9kC,OAAO+kC,KAEpBD,IAIJjoC,EAAI,EAAGA,EAAIgoC,EAAc7nC,SAAUH,EAAG,CAC7C,IAAMmoC,EAAcH,EAAchoC,GAClCR,KAAKmnC,gBAAgBK,cACnBlD,GAAS+C,mBAAmBsB,GAC5B3oC,KAAKsnC,aAAaqB,IAIxB,OAAO3L,GAGDsH,oCAAR,SACEzE,GADF,WAGQ5U,EAAQ4U,EAAKY,WACbwE,EAAMjlC,KAAKsnC,aAAarc,GAE9B,MAAO,CACLsc,OAAQ,WAEN,OADc1H,EAAKrI,kBAAoBvR,GAAanH,YACvCoI,QAEfnL,WAAY,SAAC6sB,GACX,GAAe,OAAXA,EACF,OAAI3D,EACK/8B,EAAK2gC,0BAA0B5d,EAAM9T,KAAM8tB,GAE3C/8B,EAAK4gC,oBAAoB7d,EAAM9T,MAKxC,IAAM1T,E/C1HkB,SAAUiF,EAAcuiB,GACxD,IAAI8d,EAAS,gBACA,YAATrgC,EACFqgC,EACE,0FAEgB,sBAATrgC,EACTqgC,EAAS,6DACS,gBAATrgC,IACTqgC,EAAS,8BAGX,IAAMtlC,EAAQ,IAAIoB,MAChB6D,EAAO,OAASuiB,EAAM9T,KAAKjH,WAAa,KAAO64B,GAIjD,OADCtlC,EAAciF,KAAOA,EAAKsgC,cACpBvlC,E+CyGewlC,CAAmBL,EAAQ3d,GACzC,OAAO/iB,EAAKs4B,wBACVvV,EACsB,KACtBxnB,MAUK6gC,iBAAf,SAA6BrZ,GAC3B,OAAOA,EAAM9T,KAAKjH,WAAa,IAAM+a,EAAM2E,mBAM9B0U,kBAAf,SACEY,GAEA,IAAMgE,EAAahE,EAASzsB,QAAQ,KAKpC,OAJAhU,GACkB,IAAhBykC,GAAqBA,EAAahE,EAASvkC,OAAS,EACpD,iBAEK,CACL0xB,QAAS6S,EAAS9wB,OAAO80B,EAAa,GACtC/xB,KAAM,IAAIpC,GAAKmwB,EAAS9wB,OAAO,EAAG80B,MAO9B5E,6BAAR,SAAwBW,GACtB,OAAOjlC,KAAKqmC,cAAc70B,IAAIyzB,IAMxBX,0BAAR,SAAqBrZ,GACnB,IAAMia,EAAWZ,GAAS4B,cAAcjb,GACxC,OAAOjrB,KAAKmmC,cAAc30B,IAAI0zB,IAWjBZ,oBAAf,WACE,OAAOA,GAAS6E,iBAMV7E,mCAAR,SACEe,EACAjN,GAEA,IAAMyN,EAAY7lC,KAAKylC,eAAej0B,IAAI6zB,GAC1C5gC,EAAOohC,EAAW,wDAClB,IAAMxN,EAAcr4B,KAAKwkC,kBAAkB8B,YAAYjB,GACvD,OAAOQ,EAAU9G,eACf3G,EACAC,EACiB,OAiBbiM,yCAAR,SAAoClM,GAClC,OAAOp4B,KAAKopC,sBACVhR,EACAp4B,KAAKylC,eACY,KACjBzlC,KAAKwkC,kBAAkB8B,YAAYvxB,GAAK8d,SAOpCyR,mCAAR,SACElM,EACAiR,EACArP,EACA3B,GAEA,GAAID,EAAUjhB,KAAKrM,UACjB,OAAO9K,KAAKspC,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,EAAOr5B,OACd3D,KAAKopC,sBACHG,EACAplB,EACAslB,EACAC,IAWN,OANI7D,IACF7I,EAASA,EAAOr5B,OACdkiC,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,EAAOr5B,OACduE,EAAKohC,iCACHC,EACAplB,EACAslB,EACAC,OAMJ7D,IACF7I,EAASA,EAAOr5B,OACdkiC,EAAU9G,eAAe3G,EAAWC,EAAa2B,KAI9CgD,GA9IMsH,iBAAgB,MA3lB/B,YAAoB6C,GAAAnnC,qBAAAmnC,EAdZnnC,oBAA2CizB,GAAcJ,MAKzD7yB,uBAAoB,IAAI0hC,GAEf1hC,mBAAqC,IAAImyB,IACzCnyB,mBAAqC,IAAImyB,IClE5D,QAGEwX,qBAAA,SAAQxyB,GACN,OAAOnX,KAAK4pC,UAAUtjB,SAASnP,IAGjCwyB,4BAAA,SAAexyB,EAAY0yB,GACzB7pC,KAAK4pC,UAAY5pC,KAAK4pC,UAAUxqB,YAAYjI,EAAM0yB,QARtD,cACU7pC,eAAkBimB,GAAanH,WCHzC,QAGEgrB,8BAAA,SAAiB97B,EAAc+7B,gBAAAA,KACxBp/B,EAAS3K,KAAKgqC,UAAWh8B,KAC5BhO,KAAKgqC,UAAUh8B,GAAQ,GAGzBhO,KAAKgqC,UAAUh8B,IAAS+7B,GAG1BD,iBAAA,WACE,OAAOviC,EAASvH,KAAKgqC,gBAZzB,cACUhqC,eAAqC,GCL/C,QAISiqC,iBAAP,SAAqBhxB,GACnB,IAAMixB,EAAajxB,EAAS/I,WAM5B,OAJKlQ,KAAKmqC,aAAaD,KACrBlqC,KAAKmqC,aAAaD,GAAc,IAAIJ,IAG/B9pC,KAAKmqC,aAAaD,IAGpBD,uBAAP,SACEhxB,EACAmxB,GAEA,IAAMF,EAAajxB,EAAS/I,WAM5B,OAJKlQ,KAAKqqC,WAAWH,KACnBlqC,KAAKqqC,WAAWH,GAAcE,KAGzBpqC,KAAKqqC,WAAWH,IAvBVD,gBAAiD,GACjDA,cAAuC,OAFxD,eCMA,QAKEK,iBAAA,WACE,IAAMC,EAAWvqC,KAAKwqC,YAAYh5B,MAE5Bqf,OAAa0Z,GAQnB,OAPIvqC,KAAKyqC,OACPr3B,GAAKpT,KAAKyqC,MAAO,SAACC,EAAcnpC,GAC9BsvB,EAAM6Z,GAAQ7Z,EAAM6Z,GAAQnpC,IAGhCvB,KAAKyqC,MAAQF,EAEN1Z,OAbT,YAAoB2Z,GAAAxqC,iBAAAwqC,EAFZxqC,WAAwC,KCDlD,QA0BE2qC,yBAAA,SAAYD,GACV1qC,KAAK4qC,eAAeF,IAAQ,GAGtBC,0BAAR,WAAA,WACQE,EAAQ7qC,KAAK8qC,eAAet5B,MAC5Bu5B,EAA8B,GAChCC,GAAoB,EAExB53B,GAAKy3B,EAAO,SAACH,EAAcnpC,GACb,EAARA,GAAaoJ,EAASzC,EAAK0iC,eAAgBF,KAC7CK,EAAcL,GAAQnpC,EACtBypC,GAAoB,KAIpBA,GACFhrC,KAAKirC,QAAQC,YAAYH,GAI3Bt2B,GACEzU,KAAKmrC,aAAaj6B,KAAKlR,MACvBwT,KAAKI,MAAsB,EAAhBJ,KAAK2J,SA7CQ,WAa5B,YAAYiuB,EAAqCH,GAAAjrC,aAAAirC,EANzCjrC,oBAA2C,GAOjDA,KAAK8qC,eAAiB,IAAIR,GAAcc,GAExC,IAAMz2B,EApBmB,IAsBvB,IAAgDnB,KAAK2J,SACvD1I,GAAsBzU,KAAKmrC,aAAaj6B,KAAKlR,MAAOwT,KAAKI,MAAMe,ICdnE,QAiBE02B,yBAAA,SAAYC,GAGV,IADA,IAAIC,EAAW,KACN/qC,EAAI,EAAGA,EAAI8qC,EAAc3qC,OAAQH,IAAK,CAC7C,IAAM6qB,EAAYigB,EAAc9qC,GAC1BgrC,EAAYngB,EAAUT,UACX,OAAb2gB,GAAsBC,EAAUprB,OAAOmrB,EAAS3gB,aAClD5qB,KAAKyrC,YAAYvoC,KAAKqoC,GACtBA,EAAW,MAGI,OAAbA,IACFA,EAAW,IAAIG,GAAUF,IAG3BD,EAASI,IAAItgB,GAEXkgB,GACFvrC,KAAKyrC,YAAYvoC,KAAKqoC,IAa1BF,+BAAA,SAAkBl0B,EAAYm0B,GAC5BtrC,KAAK4rC,YAAYN,GACjBtrC,KAAK6rC,oCAAoC,SAACL,GACxC,OAAAA,EAAUprB,OAAOjJ,MAarBk0B,uCAAA,SAA0BS,EAAmBR,GAC3CtrC,KAAK4rC,YAAYN,GAEjBtrC,KAAK6rC,oCAAoC,SAACL,GACxC,OAAOA,EAAU7gC,SAASmhC,IAAgBA,EAAYnhC,SAAS6gC,MAQ3DH,iDAAR,SACElY,GAEAnzB,KAAK+rC,kBAGL,IADA,IAAIC,GAAU,EACLxrC,EAAI,EAAGA,EAAIR,KAAKyrC,YAAY9qC,OAAQH,IAAK,CAChD,IAAMyrC,EAAYjsC,KAAKyrC,YAAYjrC,GAC/ByrC,IAEE9Y,EADc8Y,EAAUrhB,YAE1B5qB,KAAKyrC,YAAYjrC,GAAG0rC,QACpBlsC,KAAKyrC,YAAYjrC,GAAK,MAEtBwrC,GAAU,GAKZA,IACFhsC,KAAKyrC,YAAc,IAGrBzrC,KAAK+rC,uBAnGT,cAKU/rC,iBAA2B,GAO3BA,qBAAkB,EA+F5B,QAYE0rC,iBAAA,SAAIrgB,GACFrrB,KAAKmsC,QAAQjpC,KAAKmoB,IAMpBqgB,mBAAA,WACE,IAAK,IAAIlrC,EAAI,EAAGA,EAAIR,KAAKmsC,QAAQxrC,OAAQH,IAAK,CAC5C,IAAM6qB,EAAYrrB,KAAKmsC,QAAQ3rC,GAC/B,GAAkB,OAAd6qB,EAAoB,CACtBrrB,KAAKmsC,QAAQ3rC,GAAK,KAClB,IAAM4rC,EAAU/gB,EAAUV,iBACtB3Z,IACFC,GAAI,UAAYoa,EAAUnb,YAE5BoE,GAAe83B,MAQrBV,qBAAA,WACE,OAAO1rC,KAAK2b,WA9Bd,YAA6BA,GAAA3b,WAAA2b,EAFrB3b,aAAmB,GC5H7B,QAgCYqsC,qBAAV,SAAkBhyB,OAAmB,aAAAtR,mBAAAA,IAAAuI,oBACnC,GAAI3R,MAAM+F,QAAQ1F,KAAKssC,WAAWjyB,IAIhC,IAFA,IAAMkyB,IAAgBvsC,KAAKssC,WAAWjyB,IAE7B7Z,EAAI,EAAGA,EAAI+rC,EAAU5rC,OAAQH,IACpC+rC,EAAU/rC,GAAGyH,SAASpH,MAAM0rC,EAAU/rC,GAAG4M,QAASkE,IAKxD+6B,gBAAA,SAAGhyB,EAAmBpS,EAAgCmF,GACpDpN,KAAKwsC,mBAAmBnyB,GACxBra,KAAKssC,WAAWjyB,GAAara,KAAKssC,WAAWjyB,IAAc,GAC3Dra,KAAKssC,WAAWjyB,GAAWnX,KAAK,CAAE+E,WAAUmF,YAE5C,IAAMie,EAAYrrB,KAAKysC,gBAAgBpyB,GACnCgR,GACFpjB,EAASpH,MAAMuM,EAASie,IAI5BghB,iBAAA,SAAIhyB,EAAmBpS,EAAgCmF,GACrDpN,KAAKwsC,mBAAmBnyB,GAExB,IADA,IAAMkyB,EAAYvsC,KAAKssC,WAAWjyB,IAAc,GACvC7Z,EAAI,EAAGA,EAAI+rC,EAAU5rC,OAAQH,IACpC,GACE+rC,EAAU/rC,GAAGyH,WAAaA,KACxBmF,GAAWA,IAAYm/B,EAAU/rC,GAAG4M,SAGtC,YADAm/B,EAAUlK,OAAO7hC,EAAG,IAMlB6rC,gCAAR,SAA2BhyB,GACzB5V,EACEzE,KAAK0sC,eAAelb,KAAK,SAAAmb,GACvB,OAAOA,IAAOtyB,IAEhB,kBAAoBA,QA9DxB,YAAoBqyB,GAAA1sC,oBAAA0sC,EAVZ1sC,gBAKJ,GAMFyE,EACE9E,MAAM+F,QAAQgnC,IAA2C,EAAxBA,EAAe/rC,OAChD,8BCZN,WAAuCb,QAAAusC,IAG9BO,eAAP,WACE,OAAO,IAAIA,IAoDbA,6BAAA,SAAgBvyB,GAEd,OADA5V,EAAqB,YAAd4V,EAAyB,uBAAyBA,GAClD,CAACra,KAAK6sC,eAnDf,cAAA,IAEMC,EACAC,IAFJpkC,aAAM,CAAC,wBAIe,oBAAbqkC,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,iBAQb5kC,EAAK2kC,UAAW,EAEZE,GACFC,SAASC,iBACPF,EACA,WACE,IAAMlL,GAAWmL,SAASF,GACtBjL,IAAY35B,EAAK2kC,WACnB3kC,EAAK2kC,SAAWhL,EAChB35B,EAAKglC,QAAQ,UAAWrL,MAG5B,KC3CR,WAAmC/hC,QAAAusC,IAG1Bc,eAAP,WACE,OAAO,IAAIA,IA2CbA,6BAAA,SAAgB9yB,GAEd,OADA5V,EAAqB,WAAd4V,EAAwB,uBAAyBA,GACjD,CAACra,KAAKotC,UAMfD,6BAAA,WACE,OAAOntC,KAAKotC,aAjDd,cAAA,MACEzkC,aAAM,CAAC,wBAPDT,WAAU,EAcI,oBAAXI,aAC4B,IAA5BA,OAAO2kC,kBACb5kC,MAEDC,OAAO2kC,iBACL,SACA,WACO/kC,EAAKklC,UACRllC,EAAKklC,SAAU,EACfllC,EAAKglC,QAAQ,UAAU,MAG3B,GAGF5kC,OAAO2kC,iBACL,UACA,WACM/kC,EAAKklC,UACPllC,EAAKklC,SAAU,EACfllC,EAAKglC,QAAQ,UAAU,MAG3B,MC3CR,QAWEG,wBAAA,SAAWC,EAAqBrlC,GAC9BjI,KAAKutC,mBAAqBD,EAC1BttC,KAAKwtC,QAAUvlC,EACXjI,KAAKutC,mBAAqBvtC,KAAKytC,qBACjCztC,KAAKwtC,UACLxtC,KAAKwtC,QAAU,OAWnBH,4BAAA,SAAeK,EAAoB1kC,GAAnC,WACEhJ,KAAK2tC,iBAAiBD,GAAc1kC,EACpC,qBACE,IAAM4kC,EAAYC,EAAKF,iBACrBE,EAAKJ,2BAEAI,EAAKF,iBAAiBE,EAAKJ,oBAClC,mBAASjtC,GACHotC,EAAUptC,IACZ8T,GAAe,WACbpM,EAAK4lC,WAAWF,EAAUptC,OAHvBA,EAAI,EAAGA,EAAIotC,EAAUjtC,SAAUH,IAA/BA,GAOT,GAAIqtC,EAAKJ,qBAAuBI,EAAKN,0BAC/BM,EAAKL,UACPK,EAAKL,UACLK,EAAKL,QAAU,cAInBK,EAAKJ,6BAnBAztC,KAAK2tC,iBAAiB3tC,KAAKytC,2CApBpC,YAAoBK,GAAA9tC,gBAAA8tC,EARpB9tC,sBAA8B,GAC9BA,wBAAqB,EACrBA,yBAAsB,EACtBA,aAA+B,KCkB1B,QAuFL+tC,kBAAA,SAAKC,EAA8BC,GAAnC,WACEjuC,KAAKkuC,cAAgB,EACrBluC,KAAKmuC,cAAgBF,EACrBjuC,KAAKouC,gBAAkB,IAAIf,GAAeW,GAC1ChuC,KAAKquC,WAAY,EAEjBruC,KAAKsuC,qBAAuB/5B,WAAW,WACrCrM,EAAKqmC,KAAK,gCAEVrmC,EAAKsmC,YACLtmC,EAAKomC,qBAAuB,MAE3B96B,KAAKI,MAhEe,M1DoJQ,SAAU5I,GAC3C,GAA2C,aAAxBgiC,SAASyB,WAC1BzjC,QACK,CAIL,IAAI0jC,GAAS,EACPC,EAAY,WACX3B,SAAShrC,KAKT0sC,IACHA,GAAS,EACT1jC,KANAuJ,WAAWo6B,EAAWn7B,KAAKI,MAAM,MAUjCo5B,SAASC,kBACXD,SAASC,iBAAiB,mBAAoB0B,GAAW,GAEzDrmC,OAAO2kC,iBAAiB,OAAQ0B,GAAW,IAEjC3B,SAAiB4B,cAG1B5B,SAAiB4B,YAAY,qBAAsB,WACtB,aAAxB5B,SAASyB,YACXE,MAKHrmC,OAAesmC,YAAY,SAAUD,K0DpHxCE,CAAoB,WAClB,IAAI3mC,EAAKmmC,UAAT,CAKAnmC,EAAK4mC,gBAAkB,IAAIC,GACzB,eAAC,aAAAhmC,mBAAAA,IAAA2E,kBACO,IAAA7D,EAAAvG,EAAoCoK,KAAnCshC,OAASC,OAAMC,OAEtB,aADAhnC,EAAKinC,wBAAwBzhC,GACxBxF,EAAK4mC,gBASV,GALI5mC,EAAKomC,uBACPc,aAAalnC,EAAKomC,sBAClBpmC,EAAKomC,qBAAuB,MAE9BpmC,EAAKmnC,gBAAiB,EAxHa,UAyH/BL,EACF9mC,EAAKsK,GAAKy8B,EACV/mC,EAAKonC,SAAWJ,MACX,CAAA,GA3H8B,UA2H1BF,EAgBT,MAAM,IAAInqC,MAAM,kCAAoCmqC,GAdhDC,GAGF/mC,EAAK4mC,gBAAgBS,cAAe,EAIpCrnC,EAAKkmC,gBAAgBoB,WAAWP,EAAgB,WAC9C/mC,EAAKsmC,eAGPtmC,EAAKsmC,cAMX,eAAC,aAAAzlC,mBAAAA,IAAA2E,kBACO,IAAA7D,EAAAvG,EAAaoK,KAAZ+hC,OAAIzmC,OACXd,EAAKinC,wBAAwBzhC,GAC7BxF,EAAKkmC,gBAAgBsB,eAAeD,EAAczmC,IAEpD,WACEd,EAAKsmC,aAEPtmC,EAAKynC,OAKP,IAAMC,EAA8C,CACpDC,MAA2C,KAC3CD,EAAwC,IAAIp8B,KAAKI,MAC/B,IAAhBJ,KAAK2J,UAEHjV,EAAK4mC,gBAAgBgB,2BACvBF,EACqC,GACjC1nC,EAAK4mC,gBAAgBgB,0BAE3BF,EAAuB,ExDnMG,IwDoMtB1nC,EAAK6nC,qBACPH,EAAiC,EAAI1nC,EAAK6nC,oBAExC7nC,EAAK8nC,gBACPJ,EAA4B,GAAI1nC,EAAK8nC,eAEnC9nC,EAAK+nC,gBACPL,EAA8B,EAAI1nC,EAAK+nC,eAGnB,oBAAbn3B,UACPA,SAASo3B,OACgC,IAAzCp3B,SAASo3B,KAAKz3B,QAAQpB,MAEtBu4B,EAAuB,ExD1MN,KwD4MnB,IAAMO,EAAajoC,EAAKynC,MAAMC,GAC9B1nC,EAAKqmC,KAAK,+BAAiC4B,GAC3CjoC,EAAK4mC,gBAAgBsB,OAAOD,EAAY,kBAS5CpC,mBAAA,WACE/tC,KAAK8uC,gBAAgBuB,cAAcrwC,KAAKwS,GAAIxS,KAAKsvC,UACjDtvC,KAAKswC,uBAAuBtwC,KAAKwS,GAAIxS,KAAKsvC,WAQrCvB,cAAP,WACEA,GAAsBwC,aAAc,GAQ/BxC,iBAAP,WACEA,GAAsByC,gBAAiB,GAIlCzC,eAAP,WAGS,QAAIA,GAAsBwC,eAM5BxC,GAAsByC,gBACH,oBAAbxD,UACmB,MAA1BA,SAASyD,e1DqOK,iBAAXnoC,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAOwQ,SAASo3B,OAUR,iBAAZQ,SAA8C,iBAAfA,QAAQC,K0DxOrD5C,mCAAA,aAMQA,uBAAR,WACE/tC,KAAKquC,WAAY,EAEbruC,KAAK8uC,kBACP9uC,KAAK8uC,gBAAgB8B,QACrB5wC,KAAK8uC,gBAAkB,MAIrB9uC,KAAK6wC,iBACP7D,SAAShrC,KAAK8uC,YAAY9wC,KAAK6wC,gBAC/B7wC,KAAK6wC,eAAiB,MAGpB7wC,KAAKsuC,uBACPc,aAAapvC,KAAKsuC,sBAClBtuC,KAAKsuC,qBAAuB,OAQxBP,uBAAR,WACO/tC,KAAKquC,YACRruC,KAAKuuC,KAAK,8BACVvuC,KAAK+wC,YAED/wC,KAAKmuC,gBACPnuC,KAAKmuC,cAAcnuC,KAAKqvC,gBACxBrvC,KAAKmuC,cAAgB,QAS3BJ,mBAAA,WACO/tC,KAAKquC,YACRruC,KAAKuuC,KAAK,6BACVvuC,KAAK+wC,cASThD,kBAAA,SAAK/kC,GACH,IAAMgoC,EAAU7mC,EAAUnB,GAC1BhJ,KAAKixC,WAAaD,EAAQrwC,OAC1BX,KAAKkxC,OAAOC,iBAAiB,aAAcH,EAAQrwC,QAWnD,IARA,I5EVI8P,E4EUE2gC,G5EVF3gC,EAAY7M,E4EUgBotC,G5ET3B9sC,EAAOqB,gBAAgBkL,GAAW,I4EajC6B,EAAWH,GAAkBi/B,EAhSdC,MAoSZ7wC,EAAI,EAAGA,EAAI8R,EAAS3R,OAAQH,IACnCR,KAAK8uC,gBAAgBwC,eACnBtxC,KAAKkuC,cACL57B,EAAS3R,OACT2R,EAAS9R,IAEXR,KAAKkuC,iBAWTH,oCAAA,SAAuBv7B,EAAY++B,GAIjCvxC,KAAK6wC,eAAiB7D,SAASyD,cAAc,UAC7C,IAAMb,EAAqC,CAC3C4B,OAA2D,KAC3D5B,EAAoC,GAAIp9B,EACxCo9B,EAAoC,GAAI2B,EACxCvxC,KAAK6wC,eAAeY,IAAMzxC,KAAK2vC,MAAMC,GACrC5vC,KAAK6wC,eAAea,MAAMC,QAAU,OAEpC3E,SAAShrC,KAAK4vC,YAAY5xC,KAAK6wC,iBAQzB9C,qCAAR,SAAgCrgC,GAE9B,IAAMmkC,EAAgB1nC,EAAUuD,GAAM/M,OACtCX,KAAK6xC,eAAiBA,EACtB7xC,KAAKkxC,OAAOC,iBAAiB,iBAAkBU,QA3RjD,YACSC,EACA74B,EACCg3B,EACDF,EACAC,GAJAhwC,YAAA8xC,EACA9xC,cAAAiZ,EACCjZ,mBAAAiwC,EACDjwC,wBAAA+vC,EACA/vC,mBAAAgwC,EA9BThwC,eAAY,EACZA,mBAAgB,EAURA,qBAAiB,EAqBvBA,KAAKuuC,KAAO78B,GAAWogC,GACvB9xC,KAAKkxC,OAASjH,GAAa8H,cAAc94B,GACzCjZ,KAAK2vC,MAAQ,SAAC33B,GACZ,OAAAiB,EAAS+4B,cAAcz6B,GAAcS,IA8R3C,QA0FiB+2B,iBAAf,WACE,IAAMkD,EAASjF,SAASyD,cAAc,UAItC,GAHAwB,EAAOP,MAAMC,QAAU,QAGnB3E,SAAShrC,KAqBX,KAAM,oGApBNgrC,SAAShrC,KAAK4vC,YAAYK,GAC1B,IAIYA,EAAOC,cAAclF,UAG7B/7B,GAAI,iCAEN,MAAOvP,GACP,IAAMmW,EAASm1B,SAASn1B,OACxBo6B,EAAOR,IACL,gEACA55B,EACA,2BAmBN,OAVIo6B,EAAOE,gBACTF,EAAOG,IAAMH,EAAOE,gBACXF,EAAOC,cAChBD,EAAOG,IAAMH,EAAOC,cAAclF,SAExBiF,EAAejF,WAEzBiF,EAAOG,IAAOH,EAAejF,UAGxBiF,GAMTlD,mBAAA,WAAA,WAEE/uC,KAAKqyC,OAAQ,EAETryC,KAAKsyC,WAIPtyC,KAAKsyC,SAASF,IAAIpwC,KAAKuwC,UAAY,GACnCh+B,WAAW,WACa,OAAlBrM,EAAKoqC,WACPtF,SAAShrC,KAAK8uC,YAAY5oC,EAAKoqC,UAC/BpqC,EAAKoqC,SAAW,OAEjB9+B,KAAKI,MAAM,KAIhB,IAAMq6B,EAAejuC,KAAKiuC,aACtBA,IACFjuC,KAAKiuC,aAAe,KACpBA,MASJc,2BAAA,SAAcv8B,EAAY++B,GAMxB,IALAvxC,KAAKwyC,KAAOhgC,EACZxS,KAAKyyC,KAAOlB,EACZvxC,KAAKqyC,OAAQ,EAGNryC,KAAK0yC,kBAUN3D,yBAAR,WAIE,GACE/uC,KAAKqyC,OACLryC,KAAKuvC,cACLvvC,KAAK2yC,oBAAoBthB,MAAkC,EAA1BrxB,KAAK4yC,YAAYjyC,OAAa,EAAI,GACnE,CAEAX,KAAK6yC,gBACL,IAAMjD,EAA8C,GACpDA,EAAoC,GAAI5vC,KAAKwyC,KAC7C5C,EAAoC,GAAI5vC,KAAKyyC,KAC7C7C,EAAwC,IAAI5vC,KAAK6yC,cAMjD,IALA,IAAIC,EAAS9yC,KAAK2vC,MAAMC,GAEpBmD,EAAgB,GAChBvyC,EAAI,EAEyB,EAA1BR,KAAK4yC,YAAYjyC,QAENX,KAAK4yC,YAAY,GAEtBtzC,EAAgBqB,OAziBX,GA2iBZoyC,EAAcpyC,QA5iBA,MAsiBgB,CAUhC,IAAMqyC,EAAShzC,KAAK4yC,YAAYK,QAChCF,EACEA,EACA,OAEAvyC,EACA,IACAwyC,EAAOE,IACP,MAEA1yC,EACA,IACAwyC,EAAOG,GACP,KAEA3yC,EACA,IACAwyC,EAAO1zC,EACTkB,IASJ,OAHAsyC,GAAkBC,EAClB/yC,KAAKozC,gBAAgBN,EAAQ9yC,KAAK6yC,gBAE3B,EAEP,OAAO,GAUX9D,4BAAA,SAAesE,EAAgBC,EAAmBtqC,GAEhDhJ,KAAK4yC,YAAY1vC,KAAK,CAAEgwC,IAAKG,EAAQF,GAAIG,EAAWh0C,EAAG0J,IAInDhJ,KAAKqyC,OACPryC,KAAK0yC,eAUD3D,6BAAR,SAAwBwE,EAAaC,GAArC,WAIuB,SAAfC,IACJvrC,EAAKyqC,oBAAoB7gB,OAAO0hB,GAChCtrC,EAAKwqC,cAJP1yC,KAAK2yC,oBAAoBhH,IAAI6H,GAE7B,IAOME,EAAmBn/B,WACvBk/B,EACAjgC,KAAKI,MA1mBwB,OAqnB/B5T,KAAKowC,OAAOmD,EARS,WAEnBnE,aAAasE,GAGbD,OAWJ1E,oBAAA,SAAOwE,EAAaI,GAApB,WAKIp/B,WAAW,WACT,IAEE,IAAKrM,EAAKqnC,aACR,OAEF,IAAMqE,EAAY1rC,EAAKoqC,SAASF,IAAI3B,cAAc,UAClDmD,EAAUnkC,KAAO,kBACjBmkC,EAAUC,OAAQ,EAClBD,EAAUnC,IAAM8B,EAEhBK,EAAUE,OAAUF,EAAkBG,mBAAqB,WAEzD,IAAMC,EAAUJ,EAAkBnF,WAC7BuF,GAAqB,WAAXA,GAAkC,aAAXA,IAEpCJ,EAAUE,OAAUF,EAAkBG,mBAAqB,KACvDH,EAAUK,YACZL,EAAUK,WAAWnD,YAAY8C,GAEnCD,MAGJC,EAAUM,QAAU,WAClBjjC,GAAI,oCAAsCsiC,GAC1CrrC,EAAKqnC,cAAe,EACpBrnC,EAAK0oC,SAEP1oC,EAAKoqC,SAASF,IAAIpwC,KAAK4vC,YAAYgC,GACnC,MAAOlyC,MAGR8R,KAAKI,MAAM,SAhTlB,YACEugC,EACAC,EACOnG,EACA0B,GADA3vC,kBAAAiuC,EACAjuC,WAAA2vC,EAlCT3vC,yBAAsB,IAAIq0C,IAG1Br0C,iBAA8D,GAO9DA,mBAAgBwT,KAAKI,MAAsB,IAAhBJ,KAAK2J,UAIhCnd,mBAAe,EA2BXA,KAAK8vC,yBAA2Bp9B,KAChCpK,OAxZ2C,aAyZLtI,KAAK8vC,0BACvCqE,EACJ7rC,OA1ZwC,UA2ZLtI,KAAK8vC,0BACpCsE,EAGJp0C,KAAKsyC,SAAWvD,GAA2BuF,gBAG3C,IAAIC,EAAS,GAIXv0C,KAAKsyC,SAASb,KACwC,gBAAtDzxC,KAAKsyC,SAASb,IAAIr9B,OAAO,EAAG,cAAczT,UAG1C4zC,EAAS,4BADavH,SAASn1B,OACwB,gBAEzD,IAAM28B,EAAiB,eAAiBD,EAAS,iBACjD,IACEv0C,KAAKsyC,SAASF,IAAIqC,OAClBz0C,KAAKsyC,SAASF,IAAIjP,MAAMqR,GACxBx0C,KAAKsyC,SAASF,IAAIxB,QAClB,MAAOlvC,GACPuP,GAAI,2BACAvP,EAAE8S,OACJvD,GAAIvP,EAAE8S,OAERvD,GAAIvP,ICrdL,IAAI8C,GAAc,GC2BzB,IAGIkwC,GAAgB,KACQ,oBAAjBC,aACTD,GAAgBC,aACc,oBAAdC,YAChBF,GAAgBE,WAYlB,QA+CiBC,kBAAf,SACE57B,EACA82B,EACAC,GAEA,IAAMJ,EAAqC,CAC3C9sC,E1DpG4B,K0DoH5B,MAZsB,oBAAbgW,UACPA,SAASo3B,OACgC,IAAzCp3B,SAASo3B,KAAKz3B,QAAQpB,MAEtBu4B,EAAuB,E1DpGJ,K0DsGjBG,IACFH,EAAiC,EAAIG,GAEnCC,IACFJ,EAA4B,GAAII,GAE3B/2B,EAAS+4B,cAAc16B,GAAWs4B,IAQ3CiF,kBAAA,SAAK7G,EAA8BC,GAAnC,WACEjuC,KAAKiuC,aAAeA,EACpBjuC,KAAKguC,UAAYA,EAEjBhuC,KAAKuuC,KAAK,2BAA6BvuC,KAAKiY,SAE5CjY,KAAKqvC,gBAAiB,EAEtB58B,GAAkBrB,IAAI,8BAA8B,GAEpD,IACE,GAAI3I,IAAa,CACf,IAAMqsC,EAASC,EAAcxwC,WAAa,YAAc,OAElDywC,EAAmC,CACvCC,QAAS,CACPC,aAAc,cAAgC1wC,OAAe2wC,QAAQC,aAAYN,EACjFO,mBAAoBr1C,KAAKiwC,eAAiB,KAKxCqF,EAAMH,QAAa,IACnBI,EAC+B,IAAnCv1C,KAAKiY,QAAQQ,QAAQ,UACjB68B,EAAiB,aAAKA,EAAiB,YACvCA,EAAgB,YAAKA,EAAgB,WAEvCC,IACFP,EAAe,MAAI,CAAEQ,OAAQD,IAG/Bv1C,KAAKy1C,OAAS,IAAIf,GAAc10C,KAAKiY,QAAS,GAAI+8B,QAE5CA,EAAmC,CACvCC,QAAS,CACPI,mBAAoBr1C,KAAKiwC,eAAiB,KAG9CjwC,KAAKy1C,OAAS,IAAIf,GAAc10C,KAAKiY,QAAS,GAAI+8B,GAEpD,MAAOtzC,GACP1B,KAAKuuC,KAAK,kCACV,IAAM9qC,EAAQ/B,EAAEiD,SAAWjD,EAAEsH,KAK7B,OAJIvF,GACFzD,KAAKuuC,KAAK9qC,QAEZzD,KAAKwuC,YAIPxuC,KAAKy1C,OAAOC,OAAS,WACnBxtC,EAAKqmC,KAAK,wBACVrmC,EAAKmnC,gBAAiB,GAGxBrvC,KAAKy1C,OAAOE,QAAU,WACpBztC,EAAKqmC,KAAK,0CACVrmC,EAAKutC,OAAS,KACdvtC,EAAKsmC,aAGPxuC,KAAKy1C,OAAOG,UAAY,SAAAvyC,GACtB6E,EAAK2tC,oBAAoBxyC,IAG3BrD,KAAKy1C,OAAOvB,QAAU,SAAAxyC,GACpBwG,EAAKqmC,KAAK,yCAEV,IAAM9qC,EAAS/B,EAAUiD,SAAYjD,EAAUsH,KAC3CvF,GACFyE,EAAKqmC,KAAK9qC,GAEZyE,EAAKsmC,cAOTqG,mBAAA,aAIOA,iBAAP,WACEA,GAAoBrE,gBAAiB,GAGhCqE,eAAP,WACE,IAAIiB,GAAe,EACnB,GAAyB,oBAAdttC,WAA6BA,UAAUutC,UAAW,CAC3D,IACMC,EAAkBxtC,UAAUutC,UAAUE,MADpB,kCAEpBD,GAA4C,EAAzBA,EAAgBr1C,QACjCu1C,WAAWF,EAAgB,IAAM,MACnCF,GAAe,GAKrB,OACGA,GACiB,OAAlBpB,KACCG,GAAoBrE,gBAoBlBqE,oBAAP,WAGE,OACEpiC,GAAkB0jC,oBACsC,IAAxD1jC,GAAkBjB,IAAI,+BAI1BqjC,mCAAA,WACEpiC,GAAkBpB,OAAO,+BAGnBwjC,0BAAR,SAAqB7rC,GAEnB,GADAhJ,KAAKo2C,OAAOlzC,KAAK8F,GACbhJ,KAAKo2C,OAAOz1C,SAAWX,KAAKq2C,YAAa,CAC3C,IAAMC,EAAWt2C,KAAKo2C,OAAO7vC,KAAK,IAClCvG,KAAKo2C,OAAS,KACd,IAAMG,EAAWvsC,EAASssC,GAG1Bt2C,KAAKguC,UAAUuI,KAQX1B,kCAAR,SAA6B2B,GAC3Bx2C,KAAKq2C,YAAcG,EACnBx2C,KAAKo2C,OAAS,IASRvB,gCAAR,SAA2B7rC,GAIzB,GAHAvE,EAAuB,OAAhBzE,KAAKo2C,OAAiB,kCAGzBptC,EAAKrI,QAAU,EAAG,CACpB,IAAM61C,EAAa1kC,OAAO9I,GAC1B,IAAKytC,MAAMD,GAET,OADAx2C,KAAK02C,qBAAqBF,GACnB,KAIX,OADAx2C,KAAK02C,qBAAqB,GACnB1tC,GAOT6rC,iCAAA,SAAoB8B,GAClB,GAAoB,OAAhB32C,KAAKy1C,OAAT,CAGA,IAAMzsC,EAAO2tC,EAAW,KAMxB,GALA32C,KAAK6xC,eAAiB7oC,EAAKrI,OAC3BX,KAAKkxC,OAAOC,iBAAiB,iBAAkBnoC,EAAKrI,QAEpDX,KAAK42C,iBAEe,OAAhB52C,KAAKo2C,OAEPp2C,KAAK62C,aAAa7tC,OACb,CAEL,IAAM8tC,EAAgB92C,KAAK+2C,mBAAmB/tC,GACxB,OAAlB8tC,GACF92C,KAAK62C,aAAaC,MASxBjC,kBAAA,SAAK7rC,GACHhJ,KAAK42C,iBAEL,IAAM5F,EAAU7mC,EAAUnB,GAC1BhJ,KAAKixC,WAAaD,EAAQrwC,OAC1BX,KAAKkxC,OAAOC,iBAAiB,aAAcH,EAAQrwC,QAKnD,IAAM2R,EAAWH,GAAkB6+B,EA1TN,OA6TP,EAAlB1+B,EAAS3R,QACXX,KAAKg3C,YAAYnwC,OAAOyL,EAAS3R,SAInC,IAAK,IAAIH,EAAI,EAAGA,EAAI8R,EAAS3R,OAAQH,IACnCR,KAAKg3C,YAAY1kC,EAAS9R,KAItBq0C,uBAAR,WACE70C,KAAKquC,WAAY,EACbruC,KAAKi3C,iBACPC,cAAcl3C,KAAKi3C,gBACnBj3C,KAAKi3C,eAAiB,MAGpBj3C,KAAKy1C,SACPz1C,KAAKy1C,OAAO7E,QACZ5wC,KAAKy1C,OAAS,OAIVZ,uBAAR,WACO70C,KAAKquC,YACRruC,KAAKuuC,KAAK,+BACVvuC,KAAK+wC,YAGD/wC,KAAKiuC,eACPjuC,KAAKiuC,aAAajuC,KAAKqvC,gBACvBrvC,KAAKiuC,aAAe,QAS1B4G,mBAAA,WACO70C,KAAKquC,YACRruC,KAAKuuC,KAAK,6BACVvuC,KAAK+wC,cAQT8D,4BAAA,WAAA,WACEqC,cAAcl3C,KAAKi3C,gBACnBj3C,KAAKi3C,eAAiBE,YAAY,WAE5BjvC,EAAKutC,QACPvtC,EAAK8uC,YAAY,KAEnB9uC,EAAK0uC,kBAEJpjC,KAAKI,MAxXyB,QAiY3BihC,yBAAR,SAAoBhxC,GAIlB,IACE7D,KAAKy1C,OAAO2B,KAAKvzC,GACjB,MAAOnC,GACP1B,KAAKuuC,KACH,0CACA7sC,EAAEiD,SAAWjD,EAAEsH,KACf,uBAEFuL,WAAWvU,KAAKwuC,UAAUt9B,KAAKlR,MAAO,KA/LnC60C,gCAA+B,EAM/BA,kBAAiB,QA3KxB,YACS/C,EACP74B,EACQg3B,EACRF,EACAC,GAJOhwC,YAAA8xC,EAEC9xC,mBAAAiwC,EAzBVjwC,oBAAgC,KAChCA,YAA0B,KAC1BA,iBAAc,EACdA,eAAY,EACZA,mBAAgB,EAyBdA,KAAKuuC,KAAO78B,GAAW1R,KAAK8xC,QAC5B9xC,KAAKkxC,OAASjH,GAAa8H,cAAc94B,GACzCjZ,KAAKiY,QAAU48B,GAAoBwC,eACjCp+B,EACA82B,EACAC,GCpEN,QAOExwC,sBAAW83C,yBAAX,WACE,MAAO,CAACvJ,GAAuB8G,qCAczByC,6BAAR,SAAwBr+B,WAChBs+B,EACJ1C,IAAuBA,GAAiC,cACtD2C,EACFD,IAA0B1C,GAAoB4C,mBAYhD,GAVIx+B,EAAST,gBACN++B,GACHxtC,GACE,mFAIJytC,GAAuB,GAGrBA,EACFx3C,KAAK03C,YAAc,CAAC7C,QACf,CACL,IAAM8C,EAAc33C,KAAK03C,YAAc,OACvC,IAAwB,IAAA/tC,EAAAxG,EAAAm0C,GAAiBM,8CAAgB,CAApD,IAAMC,UACLA,GAAaA,EAAuB,eACtCF,EAAWz0C,KAAK20C,wGAUxBP,8BAAA,WACE,GAA8B,EAA1Bt3C,KAAK03C,YAAY/2C,OACnB,OAAOX,KAAK03C,YAAY,GAExB,MAAM,IAAI7yC,MAAM,4BAQpByyC,8BAAA,WACE,OAA8B,EAA1Bt3C,KAAK03C,YAAY/2C,OACZX,KAAK03C,YAAY,GAEjB,UAxDX,YAAYz+B,GACVjZ,KAAK83C,gBAAgB7+B,GCdzB,QAmFU8+B,oBAAR,WAAA,WACQC,EAAOh4C,KAAKi4C,kBAAkBC,mBACpCl4C,KAAKm4C,MAAQ,IAAIH,EACfh4C,KAAKo4C,mBACLp4C,KAAKq4C,UACLr4C,KAAKs4C,oBACLxwC,EACA9H,KAAKgwC,eAKPhwC,KAAKu4C,0BAA4BP,EAAmC,8BAAK,EAEzE,IAAMQ,EAAoBx4C,KAAKy4C,cAAcz4C,KAAKm4C,OAC5CO,EAAmB14C,KAAK24C,iBAAiB34C,KAAKm4C,OACpDn4C,KAAK44C,IAAM54C,KAAKm4C,MAChBn4C,KAAK64C,IAAM74C,KAAKm4C,MAChBn4C,KAAK84C,eAAiB,KACtB94C,KAAK+4C,YAAa,EAQlBxkC,WAAW,WAETrM,EAAKiwC,OAASjwC,EAAKiwC,MAAM1D,KAAK+D,EAAmBE,IAChDllC,KAAKI,MAAM,IAEd,IAAMolC,EAAmBhB,EAAqB,gBAAK,EAC5B,EAAnBgB,IACFh5C,KAAKi5C,gBAAkBxkC,GAAsB,WAC3CvM,EAAK+wC,gBAAkB,KAClB/wC,EAAK6wC,aAEN7wC,EAAKiwC,OA/GuB,OAgH5BjwC,EAAKiwC,MAAMtG,eAEX3pC,EAAKqmC,KACH,wDACErmC,EAAKiwC,MAAMtG,cACX,wCAEJ3pC,EAAK6wC,YAAa,EAClB7wC,EAAKiwC,MAAMe,yBAEXhxC,EAAKiwC,OA3HmB,MA4HxBjwC,EAAKiwC,MAAMlH,UAEX/oC,EAAKqmC,KACH,oDACErmC,EAAKiwC,MAAMlH,UACX,uCAKJ/oC,EAAKqmC,KAAK,+CACVrmC,EAAK0oC,WAIRp9B,KAAKI,MAAMolC,MAQVjB,8BAAR,WACE,MAAO,KAAO/3C,KAAKwS,GAAK,IAAMxS,KAAKm5C,mBAG7BpB,8BAAR,SAAyBC,GAAzB,WACE,OAAO,SAAAoB,GACDpB,IAAS9vC,EAAKiwC,MAChBjwC,EAAKmxC,kBAAkBD,GACdpB,IAAS9vC,EAAK4wC,gBACvB5wC,EAAKqmC,KAAK,8BACVrmC,EAAKoxC,8BAELpxC,EAAKqmC,KAAK,+BAKRwJ,2BAAR,SAAsBC,GAAtB,WACE,OAAO,SAACrzC,OACFuD,EAAKqxC,SACHvB,IAAS9vC,EAAK2wC,IAChB3wC,EAAKsxC,0BAA0B70C,GACtBqzC,IAAS9vC,EAAK4wC,eACvB5wC,EAAKuxC,4BAA4B90C,GAEjCuD,EAAKqmC,KAAK,gCAUlBwJ,yBAAA,SAAY2B,GAEV,IAAMC,EAAM,CAAEr5C,EAAG,IAAKhB,EAAGo6C,GACzB15C,KAAK45C,UAAUD,IAGjB5B,kCAAA,WACM/3C,KAAK44C,MAAQ54C,KAAK84C,gBAAkB94C,KAAK64C,MAAQ74C,KAAK84C,iBACxD94C,KAAKuuC,KACH,2CAA6CvuC,KAAK84C,eAAehH,QAEnE9xC,KAAKm4C,MAAQn4C,KAAK84C,eAClB94C,KAAK84C,eAAiB,OAKlBf,iCAAR,SAA4B8B,GAC1B,GA/LiB,MA+LGA,EAAa,CAC/B,IAAMC,EAAMD,EAAwB,EA1LvB,MA2LTC,EACF95C,KAAK+5C,6BA/LS,MAgMLD,GAET95C,KAAKuuC,KAAK,wCACVvuC,KAAK84C,eAAelI,QAGlB5wC,KAAK44C,MAAQ54C,KAAK84C,gBAClB94C,KAAK64C,MAAQ74C,KAAK84C,gBAElB94C,KAAK4wC,SAvMM,MAyMJkJ,IACT95C,KAAKuuC,KAAK,0BACVvuC,KAAKg6C,8BACLh6C,KAAK+5C,gCAKHhC,yCAAR,SAAoCkC,GAClC,IAAMC,EAAgBhoC,GAAW,IAAK+nC,GAChCjxC,EAAgBkJ,GAAW,IAAK+nC,GACtC,GAAc,MAAVC,EACFl6C,KAAKm6C,oBAAoBnxC,OACpB,CAAA,GAAc,MAAVkxC,EAIT,MAAM,IAAIr1C,MAAM,2BAA6Bq1C,GAF7Cl6C,KAAKo6C,oBAAoBl3C,KAAK8F,KAM1B+uC,wCAAR,WACM/3C,KAAKg6C,6BAA+B,GACtCh6C,KAAKuuC,KAAK,oCACVvuC,KAAK+4C,YAAa,EAClB/4C,KAAK84C,eAAeI,wBACpBl5C,KAAKq6C,wBAGLr6C,KAAKuuC,KAAK,8BACVvuC,KAAK84C,eAAe1B,KAAK,CAAE92C,EAAG,IAAKhB,EAAG,CAAEgB,EApOjC,IAoO0ChB,EAAG,QAIhDy4C,iCAAR,WAEE/3C,KAAK84C,eAAejJ,QAEpB7vC,KAAKuuC,KAAK,mCACVvuC,KAAK84C,eAAe1B,KAAK,CAAE92C,EAAG,IAAKhB,EAAG,CAAEgB,EA/OzB,IA+OwChB,EAAG,MAI1DU,KAAKuuC,KAAK,kCACVvuC,KAAKm4C,MAAMf,KAAK,CAAE92C,EAAG,IAAKhB,EAAG,CAAEgB,EAnPV,IAmP+BhB,EAAG,MACvDU,KAAK44C,IAAM54C,KAAK84C,eAEhB94C,KAAKs6C,wBAGCvC,uCAAR,SAAkCkC,GAEhC,IAAMC,EAAgBhoC,GAAW,IAAK+nC,GAChCjxC,EAAgBkJ,GAAW,IAAK+nC,GACxB,MAAVC,EACFl6C,KAAKu6C,WAAWvxC,GACG,MAAVkxC,GACTl6C,KAAKw6C,eAAexxC,IAIhB+uC,4BAAR,SAAuBpzC,GACrB3E,KAAKy6C,qBAGLz6C,KAAK8tC,WAAWnpC,IAGVozC,gCAAR,WACO/3C,KAAK+4C,aACR/4C,KAAKu4C,4BACDv4C,KAAKu4C,2BAA6B,IACpCv4C,KAAKuuC,KAAK,kCACVvuC,KAAK+4C,YAAa,EAClB/4C,KAAKm4C,MAAMe,2BAKTnB,wBAAR,SAAmB8B,GACjB,IAAMC,EAAc5nC,GA9RH,IA8R4B2nC,GAC7C,GA9RiB,MA8RGA,EAAa,CAC/B,IAAMa,EAAUb,EAAwB,EACxC,GAvRe,MAuRXC,EACF95C,KAAK26C,aACHD,QAOG,GAnSY,MAmSRZ,EAA0B,CACnC95C,KAAKuuC,KAAK,qCACVvuC,KAAK64C,IAAM74C,KAAK84C,eAChB,IAAK,IAAIt4C,EAAI,EAAGA,EAAIR,KAAKo6C,oBAAoBz5C,SAAUH,EACrDR,KAAKw6C,eAAex6C,KAAKo6C,oBAAoB55C,IAE/CR,KAAKo6C,oBAAsB,GAC3Bp6C,KAAKs6C,2BA/SY,MAgTRR,EAGT95C,KAAK46C,sBAAsBF,GAlTb,MAmTLZ,EAET95C,KAAK66C,SAASH,GApTA,MAqTLZ,EACTr2C,GAAM,iBAAmBi3C,GArTZ,MAsTJZ,GACT95C,KAAKuuC,KAAK,wBACVvuC,KAAKy6C,qBACLz6C,KAAK86C,iCAELr3C,GAAM,mCAAqCq2C,KAUzC/B,0BAAR,SAAqBgD,GAMnB,IAAMC,EAAYD,EAAU5H,GACtB8H,EAAUF,EAAUj4C,EACpB2U,EAAOsjC,EAAUG,EACvBl7C,KAAKm7C,UAAYJ,EAAUx6C,EAC3BP,KAAKq4C,UAAU+C,WAAW3jC,OAEtBzX,KAAKu5C,SACPv5C,KAAKm4C,MAAMtI,QACX7vC,KAAKq7C,yBAAyBr7C,KAAKm4C,MAAO6C,G5DzXhB,M4D0XDC,GACvBlxC,GAAK,sCAGP/J,KAAKs7C,qBAIDvD,8BAAR,WACE,IAAMC,EAAOh4C,KAAKi4C,kBAAkBsD,mBAChCvD,GACFh4C,KAAKw7C,cAAcxD,IAIfD,2BAAR,SAAsBC,GAAtB,WACEh4C,KAAK84C,eAAiB,IAAId,EACxBh4C,KAAKo4C,mBACLp4C,KAAKq4C,UACLr4C,KAAKs4C,eACLt4C,KAAKm7C,WAIPn7C,KAAKg6C,4BACHhC,EAAmC,8BAAK,EAE1C,IAAMhK,EAAYhuC,KAAKy4C,cAAcz4C,KAAK84C,gBACpC7K,EAAejuC,KAAK24C,iBAAiB34C,KAAK84C,gBAChD94C,KAAK84C,eAAerE,KAAKzG,EAAWC,GAGpCx5B,GAAsB,WAChBvM,EAAK4wC,iBACP5wC,EAAKqmC,KAAK,gCACVrmC,EAAK4wC,eAAelI,UAErBp9B,KAAKI,MAhZY,OAmZdmkC,sBAAR,SAAiBtgC,GACfzX,KAAKuuC,KAAK,qCAAuC92B,GACjDzX,KAAKq4C,UAAU+C,WAAW3jC,OAGtBzX,KAAKu5C,OACPv5C,KAAK4wC,SAGL5wC,KAAKy7C,oBACLz7C,KAAK07C,WAID3D,sCAAR,SAAiCC,EAAiBgD,GAAlD,WACEh7C,KAAKuuC,KAAK,oCACVvuC,KAAKm4C,MAAQH,EACbh4C,KAAKu5C,SAEDv5C,KAAK27C,WACP37C,KAAK27C,SAASX,EAAWh7C,KAAKm7C,WAC9Bn7C,KAAK27C,SAAW,MAKqB,IAAnC37C,KAAKu4C,2BACPv4C,KAAKuuC,KAAK,kCACVvuC,KAAK+4C,YAAa,GAElBtkC,GAAsB,WACpBvM,EAAK4yC,iCACJtnC,KAAKI,MA/a8B,OAmblCmkC,2CAAR,WAEO/3C,KAAK+4C,gBAAc/4C,KAAKu5C,SAC3Bv5C,KAAKuuC,KAAK,4BACVvuC,KAAK45C,UAAU,CAAEt5C,EAAG,IAAKhB,EAAG,CAAEgB,EAjavB,IAiagChB,EAAG,QAItCy4C,wCAAR,WACE,IAAMC,EAAOh4C,KAAK84C,eAClB94C,KAAK84C,eAAiB,KAClB94C,KAAK44C,MAAQZ,GAAQh4C,KAAK64C,MAAQb,GAEpCh4C,KAAK4wC,SAUDmH,+BAAR,SAA0BqB,GACxBp5C,KAAKm4C,MAAQ,KAIRiB,OAAiBp5C,KAAKu5C,WAQhBv5C,KAAKu5C,QACdv5C,KAAKuuC,KAAK,8BARVvuC,KAAKuuC,KAAK,+BAENvuC,KAAKq4C,UAAUtgC,oBACjBtF,GAAkBpB,OAAO,QAAUrR,KAAKq4C,UAAU5gC,MAElDzX,KAAKq4C,UAAU3gC,aAAe1X,KAAKq4C,UAAU5gC,OAMjDzX,KAAK4wC,SAQCmH,mCAAR,SAA8BhP,GAC5B/oC,KAAKuuC,KAAK,0DAENvuC,KAAK47C,UACP57C,KAAK47C,QAAQ7S,GACb/oC,KAAK47C,QAAU,MAKjB57C,KAAKmuC,cAAgB,KAErBnuC,KAAK4wC,SAGCmH,uBAAR,SAAkB/uC,GAChB,OAAIhJ,KAAKu5C,OACP,KAAM,8BAENv5C,KAAK44C,IAAIxB,KAAKpuC,IAOlB+uC,mBAAA,eACM/3C,KAAKu5C,SACPv5C,KAAKuuC,KAAK,gCACVvuC,KAAKu5C,SAELv5C,KAAKy7C,oBAEDz7C,KAAKmuC,gBACPnuC,KAAKmuC,gBACLnuC,KAAKmuC,cAAgB,QASnB4J,+BAAR,WACE/3C,KAAKuuC,KAAK,iCACNvuC,KAAKm4C,QACPn4C,KAAKm4C,MAAMvH,QACX5wC,KAAKm4C,MAAQ,MAGXn4C,KAAK84C,iBACP94C,KAAK84C,eAAelI,QACpB5wC,KAAK84C,eAAiB,MAGpB94C,KAAKi5C,kBACP7J,aAAapvC,KAAKi5C,iBAClBj5C,KAAKi5C,gBAAkB,WAle3B,YACSzmC,EACC6lC,EACAC,EACAxK,EACA6N,EACAxN,EACAyN,EACD5L,GAPAhwC,QAAAwS,EACCxS,eAAAq4C,EACAr4C,oBAAAs4C,EACAt4C,gBAAA8tC,EACA9tC,cAAA27C,EACA37C,mBAAAmuC,EACAnuC,aAAA47C,EACD57C,mBAAAgwC,EAlCThwC,qBAAkB,EAClBA,yBAAiC,GAWzBA,cAwBNA,KAAKuuC,KAAO78B,GAAW,KAAO1R,KAAKwS,GAAK,KACxCxS,KAAKi4C,kBAAoB,IAAIX,GAAiBe,GAC9Cr4C,KAAKuuC,KAAK,sBACVvuC,KAAK07C,SCnFT,QA4BEG,iBAAA,SACE1mC,EACAnM,EACA+S,EACAmL,KASF20B,mBAAA,SACE1mC,EACAnM,EACA+S,EACAmL,KAOF20B,8BAAA,SAAiBxxC,KAOjBwxC,6BAAA,SACE1mC,EACAnM,EACA+S,KAQF8/B,+BAAA,SACE1mC,EACAnM,EACA+S,KAOF8/B,gCAAA,SACE1mC,EACA4G,KAMF8/B,yBAAA,SAAYhR,SAxFd,eCmBA,WAuC0C/qC,QAAA+7C,IAoF9BC,yBAAV,SACEx8B,EACAtd,EACA+5C,GAEA,IAAMC,IAAch8C,KAAKi8C,eAEnBtC,EAAM,CAAEp2C,EAAGy4C,EAAWpwC,EAAG0T,EAAQ/f,EAAGyC,GAC1ChC,KAAKuuC,KAAKpkC,EAAUwvC,IACpBl1C,EACEzE,KAAKk8C,WACL,0DAEFl8C,KAAKm8C,UAAUC,YAAYzC,GACvBoC,IACF/7C,KAAKq8C,eAAeL,GAAaD,IAOrCD,oBAAA,SACE7wB,EACAqxB,EACArX,EACAlpB,GAEA,IAAMsW,EAAUpH,EAAM2E,kBAChBza,EAAa8V,EAAM9T,KAAKjH,WAC9BlQ,KAAKuuC,KAAK,qBAAuBp5B,EAAa,IAAMkd,GAC/CryB,KAAKu8C,QAAQhrB,IAAIpc,IACpBnV,KAAKu8C,QAAQnrC,IAAI+D,EAAY,IAAIgd,KAEnC1tB,EACEwmB,EAAMC,iBAAiBqd,cACpBtd,EAAMC,iBAAiBkT,eAC1B,sDAEF35B,GACGzE,KAAKu8C,QAAQ/qC,IAAI2D,GAAaoc,IAAIc,GACnC,gDAEF,IAAMmqB,EAAyB,CAC7BzgC,aACAwrB,OAAQ+U,EACRrxB,QACAga,OAEFjlC,KAAKu8C,QAAQ/qC,IAAI2D,GAAa/D,IAAIihB,EAASmqB,GAEvCx8C,KAAKk8C,YACPl8C,KAAKy8C,YAAYD,IAIbV,yBAAR,SAAoBU,GAApB,WACQvxB,EAAQuxB,EAAWvxB,MACnB9V,EAAa8V,EAAM9T,KAAKjH,WACxBmiB,EAAUpH,EAAM2E,kBACtB5vB,KAAKuuC,KAAK,aAAep5B,EAAa,QAAUkd,GAChD,IAAMqqB,EAAgC,CAAW98C,EAAGuV,GAKhDqnC,EAAWvX,MACbyX,EAAO,EAAIzxB,EAAMuE,cACjBktB,EAAO,EAAIF,EAAWvX,KAGxByX,EAAgB,EAAIF,EAAWjV,SAE/BvnC,KAAKo8C,YAVU,IAUUM,EAAK,SAAC/3C,GAC7B,IAAM+1C,EAAmB/1C,EAAoB,EACvCikC,EAASjkC,EAAsB,EAGrCm3C,GAAqBa,sBAAsBjC,EAASzvB,IAGlD/iB,EAAKq0C,QAAQ/qC,IAAI2D,IACjBjN,EAAKq0C,QAAQ/qC,IAAI2D,GAAa3D,IAAI6gB,MAEVmqB,IACxBt0C,EAAKqmC,KAAK,kBAAmB5pC,GAEd,OAAXikC,GACF1gC,EAAK00C,cAAcznC,EAAYkd,GAG7BmqB,EAAWzgC,YACbygC,EAAWzgC,WAAW6sB,EAAQ8R,OAMvBoB,yBAAf,SAAqCpB,EAAkBzvB,GACrD,GAAIyvB,GAA8B,iBAAZA,GAAwB/vC,EAAS+vC,EAAS,KAAM,CAEpE,IAAMmC,EAAWhyC,EAAQ6vC,EAAgB,KACzC,GAAI/6C,MAAM+F,QAAQm3C,KAAcA,EAASpkC,QAAQ,YAAa,CAC5D,IAAMqkC,EACJ,gBAAkB7xB,EAAMC,iBAAiBC,WAAWjb,WAAa,IAC7D6sC,EAAY9xB,EAAM9T,KAAKjH,WAC7BnG,GACE,wGAC6C+yC,SACxCC,wDASbjB,8BAAA,SAAiBzxC,GACfrK,KAAKg9C,WAAa3yC,EAClBrK,KAAKuuC,KAAK,wBACNvuC,KAAKg9C,WACPh9C,KAAKi9C,UAIDj9C,KAAKk8C,YACPl8C,KAAKo8C,YAAY,SAAU,GAAI,cAInCp8C,KAAKk9C,uCAAuC7yC,IAGtCyxC,oDAAR,SAA+CqB,GAG7C,I1EjKI5yC,G0EiKqB4yC,GAAoC,KAAtBA,EAAWx8C,Q1EhK3B,iBADnB4J,EAAiBH,E0EkKW+yC,G1ElKG5yC,UACoB,IAApBA,EAAc,S0EkK/CvK,KAAKuuC,KACH,iEAEFvuC,KAAKo9C,mBAvQ4B,MA+QrCtB,qBAAA,WAAA,I1E3LEvxC,S0E4LA,GAAIvK,KAAKk8C,YAAcl8C,KAAKg9C,WAAY,CACtC,IAAMK,EAAQr9C,KAAKg9C,WACbM,G1E9LR/yC,EADcH,E0E+LqBizC,G1E9LlB9yC,SAEkB,iBAAXA,GAAuBA,EAAO1K,eAAe,O0E4LzB,OAAS,QAC7C09C,EAAwC,CAAEC,KAAMH,GAC3B,OAAvBr9C,KAAKy9C,cACPF,EAAoB,QAAI,EACe,iBAAvBv9C,KAAKy9C,gBACrBF,EAAqB,QAAIv9C,KAAKy9C,eAEhCz9C,KAAKo8C,YACHkB,EACAC,EACA,SAACryC,GACC,IAAM09B,EAAS19B,EAAkB,EAC3BlC,EAAQkC,EAAgB,GAAgB,QAE1ChD,EAAK80C,aAAeK,IACP,OAAXzU,EACF1gC,EAAKw1C,uBAAyB,EAG9Bx1C,EAAKy1C,eAAe/U,EAAQ5/B,QAWxC8yC,sBAAA,SAAS7wB,EAAcga,GACrB,IAAM9vB,EAAa8V,EAAM9T,KAAKjH,WACxBmiB,EAAUpH,EAAM2E,kBAEtB5vB,KAAKuuC,KAAK,uBAAyBp5B,EAAa,IAAMkd,GAEtD5tB,EACEwmB,EAAMC,iBAAiBqd,cACpBtd,EAAMC,iBAAiBkT,eAC1B,wDAEap+B,KAAK48C,cAAcznC,EAAYkd,IAChCryB,KAAKk8C,YACjBl8C,KAAK49C,cAAczoC,EAAYkd,EAASpH,EAAMuE,cAAeyV,IAIzD6W,2BAAR,SACE3mC,EACAkd,EACAwrB,EACA5Y,GAEAjlC,KAAKuuC,KAAK,eAAiBp5B,EAAa,QAAUkd,GAElD,IAAMqqB,EAAgC,CAAW98C,EAAGuV,GAGhD8vB,IACFyX,EAAO,EAAImB,EACXnB,EAAO,EAAIzX,GAGbjlC,KAAKo8C,YAPU,IAOUM,IAM3BZ,6BAAA,SACE3mC,EACAnM,EACA+S,GAEI/b,KAAKk8C,WACPl8C,KAAK89C,kBAAkB,IAAK3oC,EAAYnM,EAAM+S,GAE9C/b,KAAK+9C,0BAA0B76C,KAAK,CAClCiS,aACAmK,OAAQ,IACRtW,OACA+S,gBAQN+/B,+BAAA,SACE3mC,EACAnM,EACA+S,GAEI/b,KAAKk8C,WACPl8C,KAAK89C,kBAAkB,KAAM3oC,EAAYnM,EAAM+S,GAE/C/b,KAAK+9C,0BAA0B76C,KAAK,CAClCiS,aACAmK,OAAQ,KACRtW,OACA+S,gBAQN+/B,gCAAA,SACE3mC,EACA4G,GAEI/b,KAAKk8C,WACPl8C,KAAK89C,kBAAkB,KAAM3oC,EAAY,KAAM4G,GAE/C/b,KAAK+9C,0BAA0B76C,KAAK,CAClCiS,aACAmK,OAAQ,KACRtW,KAAM,KACN+S,gBAKE+/B,+BAAR,SACEx8B,EACAnK,EACAnM,EACA+S,GAEA,IAAMiiC,EAAU,CAAWp+C,EAAGuV,EAAqB7V,EAAG0J,GACtDhJ,KAAKuuC,KAAK,gBAAkBjvB,EAAQ0+B,GACpCh+C,KAAKo8C,YAAY98B,EAAQ0+B,EAAS,SAACC,GAC7BliC,GACFxH,WAAW,WACTwH,EACEkiC,EAAuB,EACvBA,EAAuB,IAExBzqC,KAAKI,MAAM,OAQpBkoC,iBAAA,SACE3mC,EACAnM,EACA+S,EACAmL,GAEAlnB,KAAKk+C,YAAY,IAAK/oC,EAAYnM,EAAM+S,EAAYmL,IAMtD40B,mBAAA,SACE3mC,EACAnM,EACA+S,EACAmL,GAEAlnB,KAAKk+C,YAAY,IAAK/oC,EAAYnM,EAAM+S,EAAYmL,IAGtD40B,yBAAA,SACEx8B,EACAnK,EACAnM,EACA+S,EACAmL,GAEA,IAAM82B,EAAoC,CAC/Bp+C,EAAGuV,EACH7V,EAAG0J,QAGDlB,IAATof,IACF82B,EAAoB,EAAI92B,GAI1BlnB,KAAKm+C,iBAAiBj7C,KAAK,CACzBoc,SACA0+B,UACAjiC,eAGF/b,KAAKo+C,uBACL,IAAM/+B,EAAQrf,KAAKm+C,iBAAiBx9C,OAAS,EAEzCX,KAAKk8C,WACPl8C,KAAKq+C,SAASh/B,GAEdrf,KAAKuuC,KAAK,kBAAoBp5B,IAI1B2mC,sBAAR,SAAiBz8B,GAAjB,WACQC,EAAStf,KAAKm+C,iBAAiB9+B,GAAOC,OACtC0+B,EAAUh+C,KAAKm+C,iBAAiB9+B,GAAO2+B,QACvCjiC,EAAa/b,KAAKm+C,iBAAiB9+B,GAAOtD,WAChD/b,KAAKm+C,iBAAiB9+B,GAAOi/B,OAASt+C,KAAKk8C,WAE3Cl8C,KAAKo8C,YAAY98B,EAAQ0+B,EAAS,SAACr5C,GACjCuD,EAAKqmC,KAAKjvB,EAAS,YAAa3a,UAEzBuD,EAAKi2C,iBAAiB9+B,GAC7BnX,EAAKk2C,uBAG6B,IAA9Bl2C,EAAKk2C,uBACPl2C,EAAKi2C,iBAAmB,IAGtBpiC,GACFA,EACEpX,EAAsB,EACtBA,EAAsB,MAS9Bm3C,yBAAA,SAAYjR,GAAZ,WAEE,GAAI7qC,KAAKk8C,WAAY,CACnB,IAAM8B,EAAU,CAAej6C,EAAG8mC,GAClC7qC,KAAKuuC,KAAK,cAAeyP,GAEzBh+C,KAAKo8C,YAAsB,IAAK4B,EAAS,SAAAp8C,GAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,IAAM28C,EAAc38C,EAAqB,EACzCsG,EAAKqmC,KAAK,cAAe,wBAA0BgQ,QAMnDzC,4BAAR,SAAuBn3C,GACrB,GAAI,MAAOA,EAAS,CAElB3E,KAAKuuC,KAAK,gBAAkBpkC,EAAUxF,IACtC,IAAM65C,EAAS75C,EAAW,EACpBo3C,EAAa/7C,KAAKq8C,eAAemC,GACnCzC,WACK/7C,KAAKq8C,eAAemC,GAC3BzC,EAAWp3C,EAAoB,QAE5B,CAAA,GAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhB3E,KAAKy+C,YAAY95C,EAAW,EAAaA,EAAW,KAIhDm3C,yBAAR,SAAoBx8B,EAAgBtd,GAClChC,KAAKuuC,KAAK,sBAAuBjvB,EAAQtd,GAC1B,MAAXsd,EACFtf,KAAK0+C,cACH18C,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEU,MAAXsd,EACTtf,KAAK0+C,cACH18C,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEU,MAAXsd,EACTtf,KAAK2+C,iBACH38C,EAAiB,EACjBA,EAAkB,GAEA,OAAXsd,EACTtf,KAAK29C,eACH37C,EAAwB,EACxBA,EAA0B,GAER,OAAXsd,EACTtf,KAAK4+C,uBAAuB58C,GAE5ByB,GACE,6CACE0G,EAAUmV,GACV,uCAKAw8B,sBAAR,SAAiBd,EAAmBG,GAClCn7C,KAAKuuC,KAAK,oBACVvuC,KAAKk8C,YAAa,EAClBl8C,KAAK6+C,gCAAiC,IAAIl3C,MAAOE,UACjD7H,KAAK8+C,iBAAiB9D,GACtBh7C,KAAKgwC,cAAgBmL,EACjBn7C,KAAK++C,kBACP/+C,KAAKg/C,oBAEPh/C,KAAKi/C,gBACLj/C,KAAK++C,kBAAmB,EACxB/+C,KAAKk/C,kBAAiB,IAGhBpD,8BAAR,SAAyBnnC,GAAzB,WACElQ,GACGzE,KAAKm8C,UACN,0DAGEn8C,KAAKm/C,2BACP/P,aAAapvC,KAAKm/C,2BAMpBn/C,KAAKm/C,0BAA4B5qC,WAAW,WAC1CrM,EAAKi3C,0BAA4B,KACjCj3C,EAAKk3C,wBAEJ5rC,KAAKI,MAAMe,KAGRmnC,wBAAR,SAAmBja,GAGfA,IACC7hC,KAAK6sC,UACN7sC,KAAKq/C,kBAAoBr/C,KAAKo9C,qBAE9Bp9C,KAAKuuC,KAAK,2CACVvuC,KAAKq/C,gBA5mBiB,IA8mBjBr/C,KAAKm8C,WACRn8C,KAAKs/C,iBAAiB,IAG1Bt/C,KAAK6sC,SAAWhL,GAGVia,uBAAR,SAAkByD,GACZA,GACFv/C,KAAKuuC,KAAK,wBACVvuC,KAAKq/C,gBAxnBiB,IAynBjBr/C,KAAKm8C,WACRn8C,KAAKs/C,iBAAiB,KAGxBt/C,KAAKuuC,KAAK,8CACNvuC,KAAKm8C,WACPn8C,KAAKm8C,UAAUvL,UAKbkL,mCAAR,WAWE,GAVA97C,KAAKuuC,KAAK,4BACVvuC,KAAKk8C,YAAa,EAClBl8C,KAAKm8C,UAAY,KAGjBn8C,KAAKw/C,0BAGLx/C,KAAKq8C,eAAiB,GAElBr8C,KAAKy/C,mBAAoB,CACtBz/C,KAAK6sC,SAIC7sC,KAAK6+C,iCAhpBgB,KAmpB5B,IAAIl3C,MAAOE,UAAY7H,KAAK6+C,iCAE5B7+C,KAAKq/C,gBAzpBa,KA2pBpBr/C,KAAK6+C,+BAAiC,OAVtC7+C,KAAKuuC,KAAK,8CACVvuC,KAAKq/C,gBAAkBr/C,KAAKo9C,mBAC5Bp9C,KAAK0/C,4BAA6B,IAAI/3C,MAAOE,WAW/C,IAAM83C,GACJ,IAAIh4C,MAAOE,UAAY7H,KAAK0/C,2BAC1BE,EAAiBpsC,KAAK4D,IACxB,EACApX,KAAKq/C,gBAAkBM,GAEzBC,EAAiBpsC,KAAK2J,SAAWyiC,EAEjC5/C,KAAKuuC,KAAK,0BAA4BqR,EAAiB,MACvD5/C,KAAKs/C,iBAAiBM,GAGtB5/C,KAAKq/C,gBAAkB7rC,KAAKG,IAC1B3T,KAAKo9C,mBAxqBsB,IAyqB3Bp9C,KAAKq/C,iBAGTr/C,KAAKk/C,kBAAiB,IAGhBpD,kCAAR,WACE,GAAI97C,KAAKy/C,mBAAoB,CAC3Bz/C,KAAKuuC,KAAK,+BACVvuC,KAAK0/C,4BAA6B,IAAI/3C,MAAOE,UAC7C7H,KAAK6+C,+BAAiC,KACtC,IAAMgB,EAAgB7/C,KAAKw6C,eAAetpC,KAAKlR,MACzC8/C,EAAU9/C,KAAK27C,SAASzqC,KAAKlR,MAC7B+/C,EAAe//C,KAAKggD,sBAAsB9uC,KAAKlR,MAC/CigD,EAASjgD,KAAKwS,GAAK,IAAMspC,GAAqBoE,oBAC9CvuB,EAAO3xB,KACPmgD,EAAgBngD,KAAKgwC,cACvBoQ,GAAW,EACXC,EAAgC,KAC9BC,EAAU,WACVD,EACFA,EAAWzP,SAEXwP,GAAW,EACXL,MAWJ//C,KAAKm8C,UAAY,CACfvL,MAAO0P,EACPlE,YAVoB,SAAUzC,GAC9Bl1C,EACE47C,EACA,0DAEFA,EAAWjE,YAAYzC,KAQzB,IAAM4G,EAAevgD,KAAKwgD,mBAC1BxgD,KAAKwgD,oBAAqB,EAG1BxgD,KAAKygD,mBACFC,SAASH,GACTz+C,KAAK,SAAAF,GACCw+C,EAiBHnvC,GAAI,0CAhBJA,GAAI,8CACJ0gB,EAAKqrB,WAAap7C,GAAUA,EAAO++C,YACnCN,EAAa,IAAItI,GACfkI,EACAtuB,EAAK0mB,UACL1mB,EAAK2mB,eACLuH,EACAC,EACAC,EACc,SAAAhX,GACZh/B,GAAKg/B,EAAS,KAAOpX,EAAK0mB,UAAUnoC,WAAa,KACjDyhB,EAAKivB,UAluBgB,gBAouBvBT,MAMLr+C,KAAK,KAAM,SAAA2B,GACVkuB,EAAK4c,KAAK,wBAA0B9qC,GAC/B28C,GAOHE,QAMVxE,uBAAA,SAAU/S,GACR93B,GAAI,uCAAyC83B,GAC7C/oC,KAAK6gD,kBAAkB9X,IAAU,EAC7B/oC,KAAKm8C,UACPn8C,KAAKm8C,UAAUvL,SAEX5wC,KAAKm/C,4BACP/P,aAAapvC,KAAKm/C,2BAClBn/C,KAAKm/C,0BAA4B,MAE/Bn/C,KAAKk8C,YACPl8C,KAAKggD,0BAKXlE,oBAAA,SAAO/S,GACL93B,GAAI,mCAAqC83B,UAClC/oC,KAAK6gD,kBAAkB9X,GAC1Bj+B,EAAQ9K,KAAK6gD,qBACf7gD,KAAKq/C,gBAlxBiB,IAmxBjBr/C,KAAKm8C,WACRn8C,KAAKs/C,iBAAiB,KAKpBxD,8BAAR,SAAyBd,GACvB,IAAMnqB,EAAQmqB,GAAY,IAAIrzC,MAAOE,UACrC7H,KAAK8gD,oBAAoB,CAAEC,iBAAkBlwB,KAGvCirB,qCAAR,WACE,IAAK,IAAIt7C,EAAI,EAAGA,EAAIR,KAAKm+C,iBAAiBx9C,OAAQH,IAAK,CACrD,IAAMwgD,EAAMhhD,KAAKm+C,iBAAiB39C,GAC9BwgD,GAAgB,MAAOA,EAAIhD,SAAWgD,EAAI1C,SACxC0C,EAAIjlC,YACNilC,EAAIjlC,WAAW,qBAGV/b,KAAKm+C,iBAAiB39C,GAC7BR,KAAKo+C,wBAKyB,IAA9Bp+C,KAAKo+C,uBACPp+C,KAAKm+C,iBAAmB,KAIpBrC,8BAAR,SAAyB3mC,EAAoB8V,GAE3C,IAAIoH,EAIFA,EAHGpH,EAGOA,EAAMlgB,IAAI,SAAAk2C,GAAK,OAAA/tC,GAAkB+tC,KAAI16C,KAAK,KAF1C,UAIZ,IAAM26C,EAASlhD,KAAK48C,cAAcznC,EAAYkd,GAC1C6uB,GAAUA,EAAOnlC,YACnBmlC,EAAOnlC,WAAW,sBAId+/B,2BAAR,SAAsB3mC,EAAoBkd,GACxC,IACI6uB,EADEC,EAAuB,IAAIpsC,GAAKI,GAAYjF,WAElD,GAAIlQ,KAAKu8C,QAAQhrB,IAAI4vB,GAAuB,CAC1C,IAAMp2C,EAAM/K,KAAKu8C,QAAQ/qC,IAAI2vC,GAC7BD,EAASn2C,EAAIyG,IAAI6gB,GACjBtnB,EAAI+mB,OAAOO,GACM,IAAbtnB,EAAIsmB,MACNrxB,KAAKu8C,QAAQzqB,OAAOqvB,QAItBD,OAASp5C,EAEX,OAAOo5C,GAGDpF,4BAAR,SAAuBsF,EAAoBC,GACzCpwC,GAAI,uBAAyBmwC,EAAa,IAAMC,GAChDrhD,KAAKg9C,WAAa,KAClBh9C,KAAKwgD,oBAAqB,EAC1BxgD,KAAKm8C,UAAUvL,QACI,kBAAfwQ,GAAiD,sBAAfA,IAIpCphD,KAAK09C,yBAj1B0B,GAk1B3B19C,KAAK09C,yBAEP19C,KAAKq/C,gBA11B0B,IA81B/Br/C,KAAKygD,mBAAmBa,2BAKtBxF,oCAAR,SAA+B95C,GACzBhC,KAAKuhD,uBACPvhD,KAAKuhD,uBAAuBv/C,GAExB,QAASA,GACXoC,QAAQ6M,IACN,aAAgBjP,EAAU,IAAasH,QAAQ,KAAM,kBAMrDwyC,2BAAR,uBAEE97C,KAAKi9C,cAIL,IAAsB,IAAAuE,EAAAr+C,EAAAnD,KAAKu8C,QAAQvlB,wCAAU,CAAxC,IAAMmR,cACT,IAAyB,IAAAsZ,YAAAt+C,EAAAglC,EAAQnR,yCAAU,CAAtC,IAAMwlB,UACTx8C,KAAKy8C,YAAYD,wMAIrB,IAAK,IAAIh8C,EAAI,EAAGA,EAAIR,KAAKm+C,iBAAiBx9C,OAAQH,IAC5CR,KAAKm+C,iBAAiB39C,IACxBR,KAAKq+C,SAAS79C,GAIlB,KAAOR,KAAK+9C,0BAA0Bp9C,QAAQ,CAC5C,IAAMq9C,EAAUh+C,KAAK+9C,0BAA0B9K,QAC/CjzC,KAAK89C,kBACHE,EAAQ1+B,OACR0+B,EAAQ7oC,WACR6oC,EAAQh1C,KACRg1C,EAAQjiC,cAQN+/B,+BAAR,WACE,IAAMjR,EAAiC,GASvCA,EAAM,UAA4BrmC,GAAY8E,QAAQ,MAAO,MAAQ,EAEjEjB,IACFwiC,EAAM,qBAAuB,E7Ev2BV,iBAAdriC,WAAmD,gBAAzBA,UAAmB,U6Ey2BlDqiC,EAAM,yBAA2B,GAEnC7qC,KAAKkrC,YAAYL,IAGXiR,8BAAR,WACE,IAAMyD,EAASpS,GAAcuU,cAAcC,kBAC3C,OAAO72C,EAAQ9K,KAAK6gD,oBAAsBtB,GAv1B7BzD,+BAA8B,EAK9BA,qBAAoB,MAQnC,YACUzD,EACAC,EACAoG,EAMAQ,EACA4B,EACAL,EACAhD,GAZV,MAcE90C,oBAEA,GAfQT,YAAAmwC,EACAnwC,iBAAAowC,EACApwC,gBAAAw2C,EAMAx2C,mBAAAg3C,EACAh3C,sBAAA44C,EACA54C,qBAAAu4C,EACAv4C,gBAAAu1C,EAhEVv1C,KAAK4zC,GAAqB8F,8BAClB15C,OAAOwJ,GAAW,KAAOxJ,EAAKsK,GAAK,KAEnCtK,oBAAmD,GAE1CA,UAGb,IAAIiqB,IACAjqB,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,KA+BlDu1C,IAAkBh1C,IACpB,MAAM,IAAI5D,MACR,yFAGJqD,EAAKo3C,iBAAiB,GAEtB1S,GAAkB8U,cAAcjzB,GAAG,UAAWvmB,EAAK25C,WAAY35C,IAEpB,IAAvCmwC,EAAU5gC,KAAKgB,QAAQ,YACzB00B,GAAcuU,cAAcjzB,GAAG,SAAUvmB,EAAK45C,UAAW55C,KCrI/D,WAAwCpI,QAAA+7C,IACtCkG,yBAAA,SAAYlX,GACV,MAAM,IAAIhmC,MAAM,4BAoBXk9C,gBAAP,SAAoB92B,EAAcga,GAChC,YAAYn9B,IAARm9B,EACK,OAASA,GAEhBxgC,EACEwmB,EAAMC,iBAAiBqd,YACvB,kDAEKtd,EAAM9T,KAAKjH,aAwBtB6xC,oBAAA,SACE92B,EACAqxB,EACArX,EACAlpB,GAJF,WAMQ5G,EAAa8V,EAAM9T,KAAKjH,WAC9BlQ,KAAKuuC,KACH,qBAAuBp5B,EAAa,IAAM8V,EAAM2E,mBAIlD,IAAMoyB,EAAWD,GAAmBE,aAAah3B,EAAOga,GAClDid,EAAa,GACnBliD,KAAKmiD,SAASH,GAAYE,EAE1B,IAAME,EAAwBn3B,EAC3BC,iBACAm3B,8BAEHriD,KAAKsiD,aACHntC,EAAa,QACbitC,EACA,SAAC3+C,EAAO7B,GACN,IAAIoH,EAAOpH,EAEG,MAAV6B,IAEFA,EADAuF,EAAO,MAIK,OAAVvF,GACFyE,EAAKw2C,cAAcvpC,EAAYnM,GAAmB,EAAOi8B,GAGvDp6B,EAAQ3C,EAAKi6C,SAAUH,KAAcE,GAUvCnmC,EARKtY,EAEgB,MAAVA,EACA,oBAEA,cAAgBA,EAJhB,KAOQ,SAO3Bs+C,sBAAA,SAAS92B,EAAcga,GACrB,IAAM+c,EAAWD,GAAmBE,aAAah3B,EAAOga,UACjDjlC,KAAKmiD,SAASH,IAIvBD,8BAAA,SAAiB13C,KAaT03C,0BAAR,SACE5sC,EACAitC,EACAn6C,GAHF,wBAEEm6C,MAGAA,EAA8B,OAAI,SAElCpiD,KAAKygD,mBACFC,UAA2B,GAC3B5+C,KAAK,SAAAygD,GACJ,IAAMC,EAAYD,GAAiBA,EAAc5B,YAC7C6B,IACFJ,EAA4B,KAAII,GAGlC,IAAMjP,GACHrrC,EAAKmwC,UAAUngC,OAAS,WAAa,WACtChQ,EAAKmwC,UAAU5gC,KACftC,EACA,OAEAjN,EAAKmwC,UAAUjgC,mBC1JGqqC,GAI1B,IADA,IAAMzqC,EAAS,cACHxO,EAAKjI,GACX5B,MAAM+F,QAAQnE,GAChBA,EAAM2wB,QAAQ,SAAAwwB,GACZ1qC,EAAO9U,KACLkS,mBAAmB5L,GAAO,IAAM4L,mBAAmBstC,MAIvD1qC,EAAO9U,KAAKkS,mBAAmB5L,GAAO,IAAM4L,mBAAmB7T,SARxCsI,EAAArK,OAAO6gC,QAAQoiB,GAAf15C,WAAAA,KAAhB,IAAAY,oBAWX,OAAOqO,EAAOrX,OAAS,IAAMqX,EAAOzR,KAAK,KAAO,GD4IxCo8C,CAAYP,GAEdl6C,EAAKqmC,KAAK,4BAA8BgF,GACxC,IAAMqP,EAAM,IAAIC,eAChBD,EAAI7O,mBAAqB,WACvB,GAAI9rC,GAA+B,IAAnB26C,EAAInU,WAAkB,CACpCvmC,EAAKqmC,KACH,qBAAuBgF,EAAM,qBAC7BqP,EAAIha,OACJ,YACAga,EAAIE,cAEN,IAAI53C,EAAM,KACV,GAAkB,KAAd03C,EAAIha,QAAiBga,EAAIha,OAAS,IAAK,CACzC,IACE19B,EAAMlB,EAAS44C,EAAIE,cACnB,MAAOphD,GACPqI,GACE,qCACEwpC,EACA,KACAqP,EAAIE,cAGV76C,EAAS,KAAMiD,QAGI,MAAf03C,EAAIha,QAAiC,MAAfga,EAAIha,QAC5B7+B,GACE,sCACEwpC,EACA,YACAqP,EAAIha,QAGV3gC,EAAS26C,EAAIha,QAEf3gC,EAAW,OAIf26C,EAAInO,KAAK,MAAOlB,GAAuB,GACvCqP,EAAIxL,cArJV,YACUiB,EACAqG,EAMA+B,GARV,MAUE93C,2BATQT,YAAAmwC,EACAnwC,gBAAAw2C,EAMAx2C,qBAAAu4C,EA1CFv4C,OAAqCwJ,GAAW,WAQhDxJ,WAAoC,KEM9C,IAAM66C,GAAmB,qBAmIvBC,sBAAA,WACE,OACGhjD,KAAKq4C,UAAUngC,OAAS,WAAa,WAAalY,KAAKq4C,UAAU5gC,MAOtEurC,kBAAA,WACE,OAAOhjD,KAAKq4C,UAAUjgC,WAMxB4qC,wBAAA,WACE,IAGMx3C,EAHaxL,KAAKijD,UAAU3tB,QAChC,IAAIvgB,GAAK,2BAEgBhG,OAAoB,EAC/C,OAAO,IAAIpH,MAAOE,UAAY2D,GAMhCw3C,kCAAA,WACE,OxC/HFhsB,EAJAA,EwCmI4B,CACxBgkB,UAAWh7C,KAAKkjD,exC/HF,UAAIlsB,EAAkB,YAAK,IAAIrvB,MAAOE,UACjDmvB,EAPyB,IAChCA,GwC2IQgsB,2BAAR,SACE7tC,EACAnM,EACAm6C,EACAle,GAGAjlC,KAAKojD,kBACL,IAAMjsC,EAAO,IAAIpC,GAAKI,GACtBnM,EAAOhJ,KAAKqjD,6BACRrjD,KAAKqjD,6BAA6BluC,EAAYnM,GAC9CA,EACJ,IAAIg0B,EAAS,GACb,GAAIiI,EACF,GAAIke,EAAS,CACX,IAAMG,EAAiBv4C,EACrB/B,EACA,SAACu6C,GAAiB,OAAA/kC,GAAa+kC,KAEjCvmB,EAASh9B,KAAKwjD,gBAAgBC,sBAC5BtsC,EACAmsC,EACAre,OAEG,CACL,IAAMye,EAAallC,GAAaxV,GAChCg0B,EAASh9B,KAAKwjD,gBAAgBG,0BAC5BxsC,EACAusC,EACAze,QAGC,GAAIke,EAAS,CAClB,IAAMznB,EAAkB3wB,EACtB/B,EACA,SAACu6C,GAAiB,OAAA/kC,GAAa+kC,KAEjCvmB,EAASh9B,KAAKwjD,gBAAgBI,iBAAiBzsC,EAAMukB,OAChD,CACL,IAAMnS,EAAO/K,GAAaxV,GAC1Bg0B,EAASh9B,KAAKwjD,gBAAgBK,qBAAqB1sC,EAAMoS,GAE3D,IAAI0M,EAAe9e,EACC,EAAhB6lB,EAAOr8B,SAGTs1B,EAAej2B,KAAK8jD,mBAAmB3sC,IAEzCnX,KAAK+jD,YAAYC,0BAA0B/tB,EAAc+G,IAI3DgmB,kCAAA,SAAqB/6C,GACnBjI,KAAKqjD,6BAA+Bp7C,GAG9B+6C,8BAAR,SAAyBiB,GACvBjkD,KAAKkkD,YAAY,YAAaD,IACR,IAAlBA,GACFjkD,KAAKmkD,0BAIDnB,iCAAR,SAA4B9hB,GAA5B,WACE9tB,GAAK8tB,EAAS,SAAC13B,EAAajI,GAC1B2G,EAAKg8C,YAAY16C,EAAKjI,MAIlByhD,yBAAR,SAAoB7tC,EAAoB5T,GACtC,IAAM4V,EAAO,IAAIpC,GAAK,UAAYI,GAC5BuI,EAAUc,GAAajd,GAC7BvB,KAAKijD,UAAUmB,eAAejtC,EAAMuG,GACpC,IAAMsf,EAASh9B,KAAKqkD,cAAcR,qBAAqB1sC,EAAMuG,GAC7D1d,KAAK+jD,YAAYC,0BAA0B7sC,EAAM6lB,IAG3CgmB,6BAAR,WACE,OAAOhjD,KAAKskD,gBAGdtB,6BAAA,SACE7rC,EACAotC,EACA79B,EACA3K,GAJF,WAME/b,KAAKuuC,KAAK,MAAO,CACfp3B,KAAMA,EAAKjH,WACX3O,MAAOgjD,EACP/qC,SAAUkN,IAKZ,IAAM0J,EAAepwB,KAAKwkD,uBACpBC,EAAoBjmC,GAAa+lC,EAAQ79B,GACzC6J,EAAWvwB,KAAKwjD,gBAAgBvzB,uBAAuB9Y,GACvDuG,EAAU4S,GACdm0B,EACAl0B,EACAH,GAGIwR,EAAU5hC,KAAK0kD,kBACf1nB,EAASh9B,KAAKwjD,gBAAgBmB,mBAClCxtC,EACAuG,EACAkkB,GACA,GAEF5hC,KAAK+jD,YAAYnY,YAAY5O,GAC7Bh9B,KAAKirC,QAAQ+V,IACX7pC,EAAKjH,WACLu0C,EAAkB11C,KAAgB,GAClC,SAAC65B,EAAQ2V,GACP,IAAMqG,EAAqB,OAAXhc,EACXgc,GACH76C,GAAK,UAAYoN,EAAO,YAAcyxB,GAGxC,IAAMic,EAAc38C,EAAKs7C,gBAAgBvqB,aACvC2I,GACCgjB,GAEH18C,EAAK67C,YAAYC,0BAA0B7sC,EAAM0tC,GACjD38C,EAAK48C,uBAAuB/oC,EAAY6sB,EAAQ2V,KAGpD,IAAMtoB,EAAej2B,KAAK+kD,mBAAmB5tC,GAC7CnX,KAAK8jD,mBAAmB7tB,GAExBj2B,KAAK+jD,YAAYC,0BAA0B/tB,EAAc,KAG3D+sB,oBAAA,SACE7rC,EACA6tC,EACAjpC,GAHF,WAKE/b,KAAKuuC,KAAK,SAAU,CAAEp3B,KAAMA,EAAKjH,WAAY3O,MAAOyjD,IAGpD,IAAIC,GAAQ,EACN70B,EAAepwB,KAAKwkD,uBACpB9oB,EAAyC,GAW/C,GAVAtoB,GAAK4xC,EAAiB,SAACE,EAAoBC,GACzCF,GAAQ,EACRvpB,EAAgBwpB,GAAc/0B,GAC5BhZ,EAAKT,MAAMwuC,GACX1mC,GAAa2mC,GACbj9C,EAAKs7C,gBACLpzB,KAIC60B,EAoCHh0C,GAAI,wDACJjR,KAAK8kD,uBAAuB/oC,EAAY,UArC9B,CACV,IAAMqpC,EAAUplD,KAAK0kD,kBACf1nB,EAASh9B,KAAKwjD,gBAAgB6B,eAClCluC,EACAukB,EACA0pB,GAEFplD,KAAK+jD,YAAYnY,YAAY5O,GAC7Bh9B,KAAKirC,QAAQnS,MACX3hB,EAAKjH,WACL80C,EACA,SAACpc,EAAQ2V,GACP,IAAMqG,EAAqB,OAAXhc,EACXgc,GACH76C,GAAK,aAAeoN,EAAO,YAAcyxB,GAG3C,IAAMic,EAAc38C,EAAKs7C,gBAAgBvqB,aACvCmsB,GACCR,GAEG3uB,EACiB,EAArB4uB,EAAYlkD,OAAauH,EAAK47C,mBAAmB3sC,GAAQA,EAC3DjP,EAAK67C,YAAYC,0BAA0B/tB,EAAc4uB,GACzD38C,EAAK48C,uBAAuB/oC,EAAY6sB,EAAQ2V,KAIpDnrC,GAAK4xC,EAAiB,SAAClZ,GACrB,IAAM7V,EAAe/tB,EAAK68C,mBAAmB5tC,EAAKT,MAAMo1B,IACxD5jC,EAAK47C,mBAAmB7tB,KAI1Bj2B,KAAK+jD,YAAYC,0BAA0B7sC,EAAM,MAU7C6rC,oCAAR,WAAA,WACEhjD,KAAKuuC,KAAK,sBAEV,IAAMne,EAAepwB,KAAKwkD,uBACpBc,EAA2B,IAAIn0B,GACrCnxB,KAAKmuC,cAAclc,YAAYld,GAAK8d,MAAO,SAAC1b,EAAMkG,GAChD,IAAMkoC,EAAWp1B,GACfhZ,EACAkG,EACAnV,EAAKs7C,gBACLpzB,GAEFk1B,EAAyB5zB,SAASva,EAAMouC,KAE1C,IAAIvoB,EAAkB,GAEtBsoB,EAAyBrzB,YAAYld,GAAK8d,MAAO,SAAC1b,EAAMoS,GACtDyT,EAASA,EAAOr5B,OACduE,EAAKs7C,gBAAgBK,qBAAqB1sC,EAAMoS,IAElD,IAAM0M,EAAe/tB,EAAK68C,mBAAmB5tC,GAC7CjP,EAAK47C,mBAAmB7tB,KAG1Bj2B,KAAKmuC,cAAgB,IAAIhd,GACzBnxB,KAAK+jD,YAAYC,0BAA0BjvC,GAAK8d,MAAOmK,IAGzDgmB,gCAAA,SACE7rC,EACA4E,GAFF,WAIE/b,KAAKirC,QAAQ/uB,mBAAmB/E,EAAKjH,WAAY,SAAC04B,EAAQ2V,GACzC,OAAX3V,GACF1gC,EAAKimC,cAActc,OAAO1a,GAE5BjP,EAAK48C,uBAAuB/oC,EAAY6sB,EAAQ2V,MAIpDyE,6BAAA,SACE7rC,EACA5V,EACAwa,GAHF,WAKQ2B,EAAUc,GAAajd,GAC7BvB,KAAKirC,QAAQua,gBACXruC,EAAKjH,WACLwN,EAAQ3O,KAAgB,GACxB,SAAC65B,EAAQ2V,GACQ,OAAX3V,GACF1gC,EAAKimC,cAAczc,SAASva,EAAMuG,GAEpCxV,EAAK48C,uBAAuB/oC,EAAY6sB,EAAQ2V,MAKtDyE,yCAAA,SACE7rC,EACA5V,EACAiY,EACAuC,GAJF,WAMQ2B,EAAUc,GAAajd,EAAOiY,GACpCxZ,KAAKirC,QAAQua,gBACXruC,EAAKjH,WACLwN,EAAQ3O,KAAgB,GACxB,SAAC65B,EAAQ2V,GACQ,OAAX3V,GACF1gC,EAAKimC,cAAczc,SAASva,EAAMuG,GAEpCxV,EAAK48C,uBAAuB/oC,EAAY6sB,EAAQ2V,MAKtDyE,gCAAA,SACE7rC,EACA6tC,EACAjpC,GAHF,WAKE,GAAIjR,EAAQk6C,GAKV,OAJA/zC,GACE,4EAEFjR,KAAK8kD,uBAAuB/oC,EAAY,MAI1C/b,KAAKirC,QAAQwa,kBACXtuC,EAAKjH,WACL80C,EACA,SAACpc,EAAQ2V,GACQ,OAAX3V,GACFx1B,GAAK4xC,EAAiB,SAACnmC,EAAmBE,GACxC,IAAMC,EAAeR,GAAaO,GAClC7W,EAAKimC,cAAczc,SAASva,EAAKT,MAAMmI,GAAYG,KAGvD9W,EAAK48C,uBAAuB/oC,EAAY6sB,EAAQ2V,MAKtDyE,sCAAA,SAAyB/3B,EAAcP,GACrC,IAAIsS,EAEFA,EAD4B,UAA1B/R,EAAM9T,KAAKvB,WACJ5V,KAAKqkD,cAAcrkB,qBAC1B/U,EACAP,GAGO1qB,KAAKwjD,gBAAgBxjB,qBAC5B/U,EACAP,GAGJ1qB,KAAK+jD,YAAY2B,kBAAkBz6B,EAAM9T,KAAM6lB,IAGjDgmB,yCAAA,SACE/3B,EACAP,GAIA,IAAIsS,EAEFA,EAD4B,UAA1B/R,EAAM9T,KAAKvB,WACJ5V,KAAKqkD,cAAc7jB,wBAC1BvV,EACAP,GAGO1qB,KAAKwjD,gBAAgBhjB,wBAC5BvV,EACAP,GAGJ1qB,KAAK+jD,YAAY2B,kBAAkBz6B,EAAM9T,KAAM6lB,IAGjDgmB,uBAAA,WACMhjD,KAAK2lD,uBACP3lD,KAAK2lD,sBAAsB/E,UAAUmC,KAIzCC,oBAAA,WACMhjD,KAAK2lD,uBACP3lD,KAAK2lD,sBAAsBC,OAAO7C,KAItCC,mBAAA,SAAM6C,GACJ,gBADIA,MACmB,oBAAZzhD,QAAX,CAIA,IAAIymC,EAKFA,EAJEgb,GACG7lD,KAAK8qC,iBACR9qC,KAAK8qC,eAAiB,IAAIR,GAActqC,KAAKkxC,SAEvClxC,KAAK8qC,eAAet5B,OAEpBxR,KAAKkxC,OAAO1/B,MAGtB,IAAMs0C,EAActmD,OAAOoK,KAAKihC,GAAOkb,OACrC,SAACC,EAAeC,GACd,OAAAzyC,KAAK4D,IAAI6uC,EAAatlD,OAAQqlD,IAChC,GAGF5yC,GAAKy3B,EAAO,SAACH,EAAcnpC,GAGzB,IAFA,IAAI2kD,EAAaxb,EAERlqC,EAAIkqC,EAAK/pC,OAAQH,EAAIslD,EAAc,EAAGtlD,IAC7C0lD,GAAc,IAEhB9hD,QAAQ6M,IAAIi1C,EAAa3kD,OAI7ByhD,mCAAA,SAAsBmD,GACpBnmD,KAAKkxC,OAAOC,iBAAiBgV,GAC7BnmD,KAAKomD,eAAeC,YAAYF,IAG1BnD,kBAAR,eAAa,aAAAj6C,mBAAAA,IAAAuI,kBACX,IAAIK,EAAS,GACT3R,KAAK2lD,wBACPh0C,EAAS3R,KAAK2lD,sBAAsBnzC,GAAK,KAE3CvB,mBAAIU,GAAWL,KAGjB0xC,oCAAA,SACE/6C,EACA2gC,EACA2V,GAEIt2C,GACFqM,GAAe,WACb,GAAe,OAAXs0B,EACF3gC,EAAS,UACJ,CACL,IAAMS,GAAQkgC,GAAU,SAASI,cAC7BrkC,EAAU+D,EACV61C,IACF55C,GAAW,KAAO45C,GAGpB,IAAM96C,EAAQ,IAAIoB,MAAMF,GAEvBlB,EAAciF,KAAOA,EACtBT,EAASxE,OAMjBjE,sBAAIwjD,6BAAJ,WACE,OAAOhjD,KAAKsmD,aAAetmD,KAAKsmD,WAAa,IAAIC,GAASvmD,4CAhjB5D,YACSq4C,EACPmO,EACOC,EACPC,GAJF,WAQE,GAPO1mD,eAAAq4C,EAEAr4C,SAAAymD,EA5BTzmD,qBAAkB,EAKVA,oBAAuC,KACvCA,iBAAc,IAAIqrC,GAClBrrC,kBAAe,EAOfA,kCAEG,KAIHA,mBAAgB,IAAImxB,GAG5BnxB,2BAAqD,KAQnDA,KAAKkxC,OAASjH,GAAa8H,cAAcsG,GAErCmO,GnEqiBC,IAZc,iBAAXl+C,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOUq+C,OACR,4FmEniBA3mD,KAAKirC,QAAU,IAAI8W,GACjB/hD,KAAKq4C,UACLr4C,KAAK0+C,cAAcxtC,KAAKlR,MACxB0mD,GAIFnyC,WAAWvU,KAAKk/C,iBAAiBhuC,KAAKlR,MAAM,GAAO,OAC9C,CACL,IAAM4mD,EAAeH,EAAIzR,QAAsC,6BAE/D,GAAI,MAAO4R,EAAuD,CAChE,GAA4B,iBAAjBA,EACT,MAAM,IAAI/hD,MACR,sEAGJ,IACEsF,EAAUy8C,GACV,MAAOllD,GACP,MAAM,IAAImD,MAAM,kCAAoCnD,IAIxD1B,KAAK2lD,sBAAwB,IAAI7J,GAC/B97C,KAAKq4C,UACLoO,EAAIzR,QAAQ6R,MACZ7mD,KAAK0+C,cAAcxtC,KAAKlR,MACxBA,KAAKk/C,iBAAiBhuC,KAAKlR,MAC3BA,KAAK8gD,oBAAoB5vC,KAAKlR,MAC9B0mD,EACAE,GAGF5mD,KAAKirC,QAAUjrC,KAAK2lD,sBAGtBe,EAAkBI,uBAAuB,SAAAz8C,GACvCnC,EAAK+iC,QAAQ8b,iBAAiB18C,KAKhCrK,KAAKomD,eAAiBnc,GAAa+c,oBACjC3O,EACA,WAAM,OAAA,IAAI1N,GAAcziC,EAAKgpC,OAAQhpC,EAAK+iC,WAG5CjrC,KAAKinD,oBAGLjnD,KAAKijD,UAAY,IAAItZ,GACrB3pC,KAAKqkD,cAAgB,IAAI/f,GAAS,CAChC8C,eAAgB,SAACnc,EAAOga,EAAKqX,EAAevgC,GAC1C,IAAImrC,EAAsB,GACpB7pC,EAAOnV,EAAK+6C,UAAU3tB,QAAQrK,EAAM9T,MAY1C,OATKkG,EAAKvS,YACRo8C,EAAah/C,EAAKm8C,cAAcR,qBAC9B54B,EAAM9T,KACNkG,GAEF9I,WAAW,WACTwH,EAAW,OACV,IAEEmrC,GAET1f,cAAe,eAEjBxnC,KAAKkkD,YAAY,aAAa,GAE9BlkD,KAAKwjD,gBAAkB,IAAIlf,GAAS,CAClC8C,eAAgB,SAACnc,EAAOga,EAAKqX,EAAevgC,GAM1C,OALA7T,EAAK+iC,QAAQiW,OAAOj2B,EAAOqxB,EAAerX,EAAK,SAAC2D,EAAQ5/B,GACtD,IAAMg0B,EAASjhB,EAAW6sB,EAAQ5/B,GAClCd,EAAK67C,YAAYC,0BAA0B/4B,EAAM9T,KAAM6lB,KAGlD,IAETwK,cAAe,SAACvc,EAAOga,GACrB/8B,EAAK+iC,QAAQkc,SAASl8B,EAAOga,MC3IrC,QA0CEmiB,0BAAA,WACE,OAAOpnD,KAAKqnD,YAMdD,wBAAA,WACE,OAAOpnD,KAAKsnD,UAOdF,qBAAA,SAAQ/pC,GACN,OACErd,KAAKmqB,OAAO3M,QAAQxd,KAAKunD,eAAgBlqC,IAAS,GAClDrd,KAAKmqB,OAAO3M,QAAQH,EAAMrd,KAAKwnD,eAAiB,GAOpDJ,yBAAA,SACE79B,EACA/f,EACA+pB,EACA0C,EACAvuB,EACAwuB,GAKA,OAHKl2B,KAAK4+B,QAAQ,IAAIxhB,GAAU5T,EAAK+pB,MACnCA,EAAWtN,GAAanH,YAEnB9e,KAAKynD,eAAeroC,YACzBmK,EACA/f,EACA+pB,EACA0C,EACAvuB,EACAwuB,IAOJkxB,4BAAA,SACErxB,EACAW,EACAR,GAEIQ,EAAQrY,eAEVqY,EAAUzQ,GAAanH,YAEzB,IAAIoW,EAAWwB,EAAQD,UAAUz2B,KAAKmqB,QAEtC+K,EAAWA,EAASjW,eAAegH,GAAanH,YAChD,IAAM4oC,EAAO1nD,KAMb,OALA02B,EAAQ5P,aAAazG,GAAgB,SAAC7W,EAAKuV,GACpC2oC,EAAK9oB,QAAQ,IAAIxhB,GAAU5T,EAAKuV,MACnCmW,EAAWA,EAAShW,qBAAqB1V,EAAKyc,GAAanH,eAGxD9e,KAAKynD,eAAertB,eACzBrE,EACAb,EACAgB,IAOJkxB,4BAAA,SAAerxB,EAAerP,GAE5B,OAAOqP,GAMTqxB,0BAAA,WACE,OAAO,GAMTA,8BAAA,WACE,OAAOpnD,KAAKynD,gBAMdL,sBAAA,WACE,OAAOpnD,KAAKmqB,QAQCi9B,iBAAf,SAA6BpvC,GAC3B,GAAIA,EAAO4U,WAAY,CACrB,IAAM+6B,EAAY3vC,EAAOkV,oBACzB,OAAOlV,EAAOmT,WAAWy8B,SAAS5vC,EAAO6U,qBAAsB86B,GAE/D,OAAO3vC,EAAOmT,WAAWxD,WASdy/B,eAAf,SAA2BpvC,GACzB,GAAIA,EAAO8U,SAAU,CACnB,IAAM+6B,EAAU7vC,EAAOmV,kBACvB,OAAOnV,EAAOmT,WAAWy8B,SAAS5vC,EAAO+U,mBAAoB86B,GAE7D,OAAO7vC,EAAOmT,WAAWpD,eAzI7B,YAAY/P,GACVhY,KAAKynD,eAAiB,IAAIzxB,GAAche,EAAOmT,YAC/CnrB,KAAKmqB,OAASnS,EAAOmT,WACrBnrB,KAAKqnD,WAAaD,GAAaU,cAAc9vC,GAC7ChY,KAAKsnD,SAAWF,GAAaW,YAAY/vC,GClC7C,QA0CEgwC,yBAAA,SACEz+B,EACA/f,EACA+pB,EACA0C,EACAvuB,EACAwuB,GAKA,OAHKl2B,KAAKioD,cAAcrpB,QAAQ,IAAIxhB,GAAU5T,EAAK+pB,MACjDA,EAAWtN,GAAanH,YAEtByK,EAAKlD,kBAAkB7c,GAAK4W,OAAOmT,GAE9BhK,EACEA,EAAKc,cAAgBrqB,KAAKkoD,OAC5BloD,KAAKioD,cACT/sB,mBACA9b,YACCmK,EACA/f,EACA+pB,EACA0C,EACAvuB,EACAwuB,GAGGl2B,KAAKmoD,sBACV5+B,EACA/f,EACA+pB,EACA7rB,EACAwuB,IAQN8xB,4BAAA,SACEjyB,EACAW,EACAR,GAEA,IAAIhB,EACJ,GAAIwB,EAAQrY,cAAgBqY,EAAQ5rB,UAElCoqB,EAAWjP,GAAanH,WAAW2X,UAAUz2B,KAAKmqB,aAElD,GACgB,EAAdnqB,KAAKkoD,OAAaxxB,EAAQrM,eAC1BqM,EAAQP,UAAUn2B,KAAKmqB,QACvB,CAEA+K,EAAWjP,GAAanH,WAAW2X,UAAUz2B,KAAKmqB,QAElD,IAAItnB,SAEFA,EADE7C,KAAKooD,SACK1xB,EAAyB5O,uBACnC9nB,KAAKioD,cAAcT,aACnBxnD,KAAKmqB,QAGKuM,EAAyBhP,gBACnC1nB,KAAKioD,cAAcV,eACnBvnD,KAAKmqB,QAIT,IADA,IAAIhJ,EAAQ,EACLte,EAASwlD,WAAalnC,EAAQnhB,KAAKkoD,QAAQ,CAChD,IAAMzmD,EAAOoB,EAASyiB,UAStB,KAPItlB,KAAKooD,SAELpoD,KAAKmqB,OAAO3M,QAAQxd,KAAKioD,cAAcV,eAAgB9lD,IAAS,EAGhEzB,KAAKmqB,OAAO3M,QAAQ/b,EAAMzB,KAAKioD,cAAcT,eAAiB,GAOhE,MAJAtyB,EAAWA,EAAShW,qBAAqBzd,EAAKuM,KAAMvM,EAAK4b,MACzD8D,SAMC,CAIL+T,GAFAA,EAAWwB,EAAQD,UAAUz2B,KAAKmqB,SAEdlL,eAClBgH,GAAanH,YAEf,IAAI8I,SACAI,SACA5R,SAEJ,GADIvT,SACA7C,KAAKooD,SAAU,CACjBvlD,EAAWqyB,EAASozB,mBAAmBtoD,KAAKmqB,QAC5CvC,EAAY5nB,KAAKioD,cAAcT,aAC/Bx/B,EAAUhoB,KAAKioD,cAAcV,eAC7B,IAAMgB,EAAevoD,KAAKmqB,OAAO3E,aACjCpP,EAAM,SAACxK,EAAcrM,GAAiB,OAAAgpD,EAAahpD,EAAGqM,SAEtD/I,EAAWqyB,EAAS9P,YAAYplB,KAAKmqB,QACrCvC,EAAY5nB,KAAKioD,cAAcV,eAC/Bv/B,EAAUhoB,KAAKioD,cAAcT,aAC7BpxC,EAAMpW,KAAKmqB,OAAO3E,aAGhBrE,EAAQ,EAEZ,IAFA,IACIqnC,GAAiB,EACd3lD,EAASwlD,WACR5mD,EAAOoB,EAASyiB,WACjBkjC,GAAkBpyC,EAAIwR,EAAWnmB,IAAS,IAE7C+mD,GAAiB,GAGjBA,GAAkBrnC,EAAQnhB,KAAKkoD,QAAU9xC,EAAI3U,EAAMumB,IAAY,EAE/D7G,IAEA+T,EAAWA,EAAShW,qBAClBzd,EAAKuM,KACLiY,GAAanH,YAMvB,OAAO9e,KAAKioD,cACT/sB,mBACAd,eAAerE,EAASb,EAAUgB,IAMvC8xB,4BAAA,SAAejyB,EAAerP,GAE5B,OAAOqP,GAMTiyB,0BAAA,WACE,OAAO,GAMTA,8BAAA,WACE,OAAOhoD,KAAKioD,cAAc/sB,oBAM5B8sB,sBAAA,WACE,OAAOhoD,KAAKmqB,QAYN69B,mCAAR,SACEz+B,EACA+H,EACA4B,EACAxrB,EACA+gD,GAGA,IAAIryC,EACJ,GAAIpW,KAAKooD,SAAU,CACjB,IAAMM,EAAW1oD,KAAKmqB,OAAO3E,aAC7BpP,EAAM,SAACxK,EAAcrM,GAAiB,OAAAmpD,EAASnpD,EAAGqM,SAElDwK,EAAMpW,KAAKmqB,OAAO3E,aAEpB,IAAMmX,EAAgBpT,EACtB9kB,EAAOk4B,EAActS,gBAAkBrqB,KAAKkoD,OAAQ,IACpD,IAAMS,EAAoB,IAAIvrC,GAAUkU,EAAU4B,GAC5C01B,EAAiB5oD,KAAKooD,SACxBzrB,EAAcksB,cAAc7oD,KAAKmqB,QAChCwS,EAAcmsB,aAAa9oD,KAAKmqB,QAC/B4+B,EAAU/oD,KAAKioD,cAAcrpB,QAAQ+pB,GAC3C,GAAIhsB,EAAc7H,SAASxD,GAAW,CAOpC,IANA,IAAM03B,EAAersB,EAActW,kBAAkBiL,GACjDyC,EAAYrsB,EAAOuhD,mBACrBjpD,KAAKmqB,OACLy+B,EACA5oD,KAAKooD,UAGQ,MAAbr0B,IACCA,EAAU/lB,OAASsjB,GAAYqL,EAAc7H,SAASf,EAAU/lB,QAKjE+lB,EAAYrsB,EAAOuhD,mBACjBjpD,KAAKmqB,OACL4J,EACA/zB,KAAKooD,UAGT,IAAMc,EACS,MAAbn1B,EAAoB,EAAI3d,EAAI2d,EAAW40B,GAGzC,GADEI,IAAY71B,EAAUpoB,WAA4B,GAAfo+C,EAOnC,OALyB,MAArBT,GACFA,EAAkBpyB,iBAChBd,GAAOiB,mBAAmBlF,EAAU4B,EAAW81B,IAG5CrsB,EAAczd,qBAAqBoS,EAAU4B,GAE3B,MAArBu1B,GACFA,EAAkBpyB,iBAChBd,GAAOe,mBAAmBhF,EAAU03B,IAGxC,IAAMjvB,EAAgB4C,EAAczd,qBAClCoS,EACArL,GAAanH,YAIf,OADe,MAAbiV,GAAqB/zB,KAAKioD,cAAcrpB,QAAQ7K,IAEvB,MAArB00B,GACFA,EAAkBpyB,iBAChBd,GAAOgB,iBAAiBxC,EAAU/lB,KAAM+lB,EAAU1W,OAG/C0c,EAAc7a,qBACnB6U,EAAU/lB,KACV+lB,EAAU1W,OAGL0c,EAGN,OAAI7G,EAAUpoB,WAGVi+C,GACqC,GAA1C3yC,EAAIwyC,EAAgBD,IACG,MAArBF,IACFA,EAAkBpyB,iBAChBd,GAAOe,mBAAmBsyB,EAAe56C,KAAM46C,EAAevrC,OAEhEorC,EAAkBpyB,iBAChBd,GAAOgB,iBAAiBjF,EAAU4B,KAG/ByJ,EACJzd,qBAAqBoS,EAAU4B,GAC/BhU,qBAAqB0pC,EAAe56C,KAAMiY,GAAanH,aAbrDyK,OA1QX,YAAYvR,GACVhY,KAAKioD,cAAgB,IAAIb,GAAapvC,GACtChY,KAAKmqB,OAASnS,EAAOmT,WACrBnrB,KAAKkoD,OAASlwC,EAAOmxC,WACrBnpD,KAAKooD,UAAYpwC,EAAOoxC,iBCrC5B,QA6DEC,sBAAA,WACE,OAAOrpD,KAAKspD,WAMdD,4BAAA,WACE,MAAuB,KAAnBrpD,KAAKupD,UAKAvpD,KAAKspD,UAGVtpD,KAAKupD,YAAcF,GAAYG,yBAAyBC,gBAS9DJ,gCAAA,WAEE,OADA5kD,EAAOzE,KAAKspD,UAAW,oCAChBtpD,KAAK0pD,kBAQdL,+BAAA,WAEE,OADA5kD,EAAOzE,KAAKspD,UAAW,oCACnBtpD,KAAK2pD,cACA3pD,KAAK4pD,gBAELh3C,IAOXy2C,oBAAA,WACE,OAAOrpD,KAAK6pD,SAOdR,8BAAA,WAEE,OADA5kD,EAAOzE,KAAK6pD,QAAS,kCACd7pD,KAAK8pD,gBAQdT,6BAAA,WAEE,OADA5kD,EAAOzE,KAAK6pD,QAAS,kCACjB7pD,KAAK+pD,YACA/pD,KAAKgqD,cAELn3C,IAOXw2C,sBAAA,WACE,OAAOrpD,KAAKiqD,WAMdZ,8BAAA,WACE,OAAOrpD,KAAKiqD,WAAgC,KAAnBjqD,KAAKupD,WAOhCF,sBAAA,WAEE,OADA5kD,EAAOzE,KAAKiqD,UAAW,oCAChBjqD,KAAKkoD,QAMdmB,sBAAA,WACE,OAAOrpD,KAAKmqB,QAONk/B,mBAAR,WACE,IAAM7nC,EAAO,IAAI6nC,GAajB,OAZA7nC,EAAKyoC,UAAYjqD,KAAKiqD,UACtBzoC,EAAK0mC,OAASloD,KAAKkoD,OACnB1mC,EAAK8nC,UAAYtpD,KAAKspD,UACtB9nC,EAAKkoC,iBAAmB1pD,KAAK0pD,iBAC7BloC,EAAKmoC,cAAgB3pD,KAAK2pD,cAC1BnoC,EAAKooC,gBAAkB5pD,KAAK4pD,gBAC5BpoC,EAAKqoC,QAAU7pD,KAAK6pD,QACpBroC,EAAKsoC,eAAiB9pD,KAAK8pD,eAC3BtoC,EAAKuoC,YAAc/pD,KAAK+pD,YACxBvoC,EAAKwoC,cAAgBhqD,KAAKgqD,cAC1BxoC,EAAK2I,OAASnqB,KAAKmqB,OACnB3I,EAAK+nC,UAAYvpD,KAAKupD,UACf/nC,GAOT6nC,mBAAA,SAAMa,GACJ,IAAMl7B,EAAYhvB,KAAKmqD,QAIvB,OAHAn7B,EAAUi7B,WAAY,EACtBj7B,EAAUk5B,OAASgC,EACnBl7B,EAAUu6B,UAAY,GACfv6B,GAOTq6B,0BAAA,SAAaa,GACX,IAAMl7B,EAAYhvB,KAAKmqD,QAIvB,OAHAn7B,EAAUi7B,WAAY,EACtBj7B,EAAUk5B,OAASgC,EACnBl7B,EAAUu6B,UAAYF,GAAYG,yBAAyBC,eACpDz6B,GAOTq6B,yBAAA,SAAYa,GACV,IAAMl7B,EAAYhvB,KAAKmqD,QAIvB,OAHAn7B,EAAUi7B,WAAY,EACtBj7B,EAAUk5B,OAASgC,EACnBl7B,EAAUu6B,UAAYF,GAAYG,yBAAyBY,gBACpDp7B,GAQTq6B,qBAAA,SAAQtrC,EAAqBvU,GAC3B,IAAMwlB,EAAYhvB,KAAKmqD,QAavB,OAZAn7B,EAAUs6B,WAAY,OACHxhD,IAAfiW,IACFA,EAAa,MAEfiR,EAAU06B,iBAAmB3rC,EAClB,MAAPvU,GACFwlB,EAAU26B,eAAgB,EAC1B36B,EAAU46B,gBAAkBpgD,IAE5BwlB,EAAU26B,eAAgB,EAC1B36B,EAAU46B,gBAAkB,IAEvB56B,GAQTq6B,mBAAA,SAAMtrC,EAAqBvU,GACzB,IAAMwlB,EAAYhvB,KAAKmqD,QAavB,OAZAn7B,EAAU66B,SAAU,OACD/hD,IAAfiW,IACFA,EAAa,MAEfiR,EAAU86B,eAAiB/rC,OACfjW,IAAR0B,GACFwlB,EAAU+6B,aAAc,EACxB/6B,EAAUg7B,cAAgBxgD,IAE1BwlB,EAAU+6B,aAAc,EACxB/6B,EAAUg7B,cAAgB,IAErBh7B,GAOTq6B,qBAAA,SAAQhqC,GACN,IAAM2P,EAAYhvB,KAAKmqD,QAEvB,OADAn7B,EAAU7E,OAAS9K,EACZ2P,GAMTq6B,4BAAA,WACE,IAAMgB,EAA0BhB,GAAYG,yBACtC5+C,EAAgC,GAatC,GAZI5K,KAAKspD,YACP1+C,EAAIy/C,EAAwBC,mBAAqBtqD,KAAK0pD,iBAClD1pD,KAAK2pD,gBACP/+C,EAAIy/C,EAAwBE,kBAAoBvqD,KAAK4pD,kBAGrD5pD,KAAK6pD,UACPj/C,EAAIy/C,EAAwBG,iBAAmBxqD,KAAK8pD,eAChD9pD,KAAK+pD,cACPn/C,EAAIy/C,EAAwBI,gBAAkBzqD,KAAKgqD,gBAGnDhqD,KAAKiqD,UAAW,CAClBr/C,EAAIy/C,EAAwBK,OAAS1qD,KAAKkoD,OAC1C,IAAIyC,EAAW3qD,KAAKupD,UACH,KAAboB,IAEAA,EADE3qD,KAAKopD,iBACIiB,EAAwBZ,eAExBY,EAAwBD,iBAGvCx/C,EAAIy/C,EAAwBO,WAAaD,EAM3C,OAHI3qD,KAAKmqB,SAAW9J,KAClBzV,EAAIy/C,EAAwBQ,OAAS7qD,KAAKmqB,OAAOja,YAE5CtF,GAMTy+C,0BAAA,WACE,QAASrpD,KAAKspD,WAAatpD,KAAK6pD,SAAW7pD,KAAKiqD,YAMlDZ,uBAAA,WACE,OAAOrpD,KAAKo+B,gBAAkBp+B,KAAKmqB,SAAW9J,IAMhDgpC,2BAAA,WACE,OAAIrpD,KAAKo+B,eACA,IAAIpI,GAAch2B,KAAKmrB,YAEvB,IADEnrB,KAAKotB,WACH46B,GAEAZ,IAFcpnD,OAW7BqpD,yCAAA,WACE,IAOIp6B,EAPE67B,EAAiBzB,GAAY0B,sBAC7BC,EAAuC,GAE7C,OAAIhrD,KAAKuoC,cAMPtZ,EADEjvB,KAAKmqB,SAAW9J,GACRyqC,EAAezqC,eAChBrgB,KAAKmqB,SAAWhB,GACf2hC,EAAe3hC,YAChBnpB,KAAKmqB,SAAWlM,GACf6sC,EAAe7sC,WAEzBxZ,EAAOzE,KAAKmqB,kBAAkBb,GAAW,4BAC/BtpB,KAAKmqB,OAAOja,YAExB86C,EAAGF,EAAeG,UAAY9gD,EAAU8kB,GAEpCjvB,KAAKspD,YACP0B,EAAGF,EAAeI,UAAY/gD,EAAUnK,KAAK0pD,kBACzC1pD,KAAK2pD,gBACPqB,EAAGF,EAAeI,WAAa,IAAM/gD,EAAUnK,KAAK4pD,mBAIpD5pD,KAAK6pD,UACPmB,EAAGF,EAAeK,QAAUhhD,EAAUnK,KAAK8pD,gBACvC9pD,KAAK+pD,cACPiB,EAAGF,EAAeK,SAAW,IAAMhhD,EAAUnK,KAAKgqD,iBAIlDhqD,KAAKiqD,YACHjqD,KAAKopD,iBACP4B,EAAGF,EAAeM,gBAAkBprD,KAAKkoD,OAEzC8C,EAAGF,EAAeO,eAAiBrrD,KAAKkoD,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,UACV5qC,eAAgB,YAChB8I,YAAa,SACblL,UAAW,OACXitC,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAQDhC,WAAU,IAAIA,OAxDhC,cACUrpD,gBAAY,EACZA,gBAAY,EACZA,oBAAgB,EAChBA,cAAU,EACVA,kBAAc,EAEdA,YAAS,EACTA,eAAY,GACZA,sBAAmC,KACnCA,qBAAkB,GAClBA,oBAAiC,KACjCA,mBAAgB,GAEhBA,YAASqgB,cCJYvgB,QAAA2sB,IA2B7B6+B,oBAAA,WAGE,OAFA9+C,EAAiB,gBAAiB,EAAG,EAAG9L,UAAUC,QAE9CX,KAAKmX,KAAKrM,UACL,KAEA9K,KAAKmX,KAAK4C,WAQrBuxC,mBAAA,SAAMn2C,GlEuU8B,IACpC1I,EACAM,EACAoI,EACAnI,EkE/TE,OAXAR,EAAiB,kBAAmB,EAAG,EAAG9L,UAAUC,QAC1B,iBAAfwU,EACTA,EAAatO,OAAOsO,GACTA,aAAsBJ,KACJ,OAAzB/U,KAAKmX,KAAKvB,YlEmUlBnJ,EkElU6B,kBlEqU7BO,IAFAD,EkEnUgD,GlEyU9CoI,GALFA,EkEpUmDA,IlEyUpCA,EAAW7L,QAAQ,mBAAoB,KAGtDiR,GAAmB9N,EAAQM,EAAgBoI,EAAYnI,IkE1UjDuN,GAAmB,kBAAmB,EAAGpF,GAAY,IAIlD,IAAIm2C,GAAUtrD,KAAKwtB,KAAMxtB,KAAKmX,KAAKT,MAAMvB,KAIlDm2C,uBAAA,WACE9+C,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QAErD,IAAM4qD,EAAavrD,KAAKmX,KAAKqkB,SAC7B,OAAsB,OAAf+vB,EAAsB,KAAO,IAAID,GAAUtrD,KAAKwtB,KAAM+9B,IAI/DD,qBAAA,WACE9+C,EAAiB,iBAAkB,EAAG,EAAG9L,UAAUC,QAGnD,IADA,IAAI6pB,EAAiBxqB,KACM,OAApBwqB,EAAIC,aACTD,EAAMA,EAAIC,YAEZ,OAAOD,GAIT8gC,0BAAA,WACE,OAAOtrD,KAAKwtB,KAAKg+B,UAQnBF,iBAAA,SACE/G,EACAxoC,GAEAvP,EAAiB,gBAAiB,EAAG,EAAG9L,UAAUC,QAClD6Z,GAAqB,gBAAiBxa,KAAKmX,MAC3CsC,GAAwB,gBAAiB,EAAG8qC,EAAQvkD,KAAKmX,MAAM,GAC/DjK,EAAiB,gBAAiB,EAAG6O,GAAY,GAEjD,IAAMC,EAAW,IAAIhU,EAOrB,OANAhI,KAAKwtB,KAAKi+B,gBACRzrD,KAAKmX,KACLotC,EACc,KACdvoC,EAASG,aAAaJ,IAEjBC,EAAS7T,SAQlBmjD,oBAAA,SACEhvC,EACAP,GAKA,GAHAvP,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QACrD6Z,GAAqB,mBAAoBxa,KAAKmX,MAE1CxX,MAAM+F,QAAQ4W,GAAgB,CAEhC,IADA,IAAMC,EAA6C,GAC1C/b,EAAI,EAAGA,EAAI8b,EAAc3b,SAAUH,EAC1C+b,EAAiB,GAAK/b,GAAK8b,EAAc9b,GAE3C8b,EAAgBC,EAChBxS,GACE,wMAMJ6P,GACE,mBACA,EACA0C,EACAtc,KAAKmX,MACL,GAEFjK,EAAiB,mBAAoB,EAAG6O,GAAY,GACpD,IAAMC,EAAW,IAAIhU,EAMrB,OALAhI,KAAKwtB,KAAKphB,OACRpM,KAAKmX,KACLmF,EACAN,EAASG,aAAaJ,IAEjBC,EAAS7T,SASlBmjD,6BAAA,SACE/G,EACA79B,EACA3K,GAcA,GAZAvP,EAAiB,4BAA6B,EAAG,EAAG9L,UAAUC,QAC9D6Z,GAAqB,4BAA6Bxa,KAAKmX,MACvDsC,GACE,4BACA,EACA8qC,EACAvkD,KAAKmX,MACL,GAEFgD,GAAiB,4BAA6B,EAAGuM,GAAa,GAC9DxZ,EAAiB,4BAA6B,EAAG6O,GAAY,GAEvC,YAAlB/b,KAAKoqB,UAA4C,UAAlBpqB,KAAKoqB,SACtC,KACE,qCACApqB,KAAKoqB,SACL,0BAIJ,IAAMpO,EAAW,IAAIhU,EAOrB,OANAhI,KAAKwtB,KAAKi+B,gBACRzrD,KAAKmX,KACLotC,EACA79B,EACA1K,EAASG,aAAaJ,IAEjBC,EAAS7T,SAOlBmjD,oBAAA,SAAOvvC,GAKL,OAJAvP,EAAiB,mBAAoB,EAAG,EAAG9L,UAAUC,QACrD6Z,GAAqB,mBAAoBxa,KAAKmX,MAC9CjK,EAAiB,mBAAoB,EAAG6O,GAAY,GAE7C/b,KAAKoR,IAAI,KAAM2K,IASxBuvC,yBAAA,SACEI,EACA3vC,EACA4vC,GAUA,GARAn/C,EAAiB,wBAAyB,EAAG,EAAG9L,UAAUC,QAC1D6Z,GAAqB,wBAAyBxa,KAAKmX,MACnDjK,EAAiB,wBAAyB,EAAGw+C,GAAmB,GAChEx+C,EAAiB,wBAAyB,EAAG6O,GAAY,GlEsN9B,SAC7BtP,EACAM,EACA6+C,EACA5+C,GAEA,KAAIA,QAAqBlF,IAAT8jD,IAGI,kBAATA,EACT,MAAM,IAAI/mD,MACR8U,EAAelN,EAAQM,EAAgBC,GAAY,sBkE9NrD6+C,CAAgB,wBAAyB,EAAGF,GAAc,GAEpC,YAAlB3rD,KAAKoqB,UAA4C,UAAlBpqB,KAAKoqB,SACtC,KACE,iCACApqB,KAAKoqB,SACL,+BAIiBtiB,IAAjB6jD,IACFA,GAAe,GAGjB,IAAM3vC,EAAW,IAAIhU,EA0BrB,MAzB0B,mBAAf+T,GACTC,EAAS7T,QAAQC,MAAM,cAiBzBpI,KAAKwtB,KAAKs+B,iBACR9rD,KAAKmX,KACLu0C,EAhBsB,SACtBjoD,EACAiZ,EACAC,GAEIlZ,EACFuY,EAAS3a,OAAOoC,GAEhBuY,EAAS5a,QAAQ,IAAIqb,GAAkBC,EAAWC,IAE1B,mBAAfZ,GACTA,EAAWtY,EAAOiZ,EAAWC,IAO/BgvC,GAGK3vC,EAAS7T,SAQlBmjD,yBAAA,SACE9xC,EACAuC,GAEAvP,EAAiB,wBAAyB,EAAG,EAAG9L,UAAUC,QAC1D6Z,GAAqB,wBAAyBxa,KAAKmX,MACnDgD,GAAiB,wBAAyB,EAAGX,GAAU,GACvDtM,EAAiB,wBAAyB,EAAG6O,GAAY,GAEzD,IAAMC,EAAW,IAAIhU,EAOrB,OANAhI,KAAKwtB,KAAKi+B,gBACRzrD,KAAKmX,KAAKT,MAAM,aAChB8C,EACA,KACAwC,EAASG,aAAaJ,IAEjBC,EAAS7T,SAQlBmjD,kBAAA,SAAK/pD,EAAiBwa,GACpBvP,EAAiB,iBAAkB,EAAG,EAAG9L,UAAUC,QACnD6Z,GAAqB,iBAAkBxa,KAAKmX,MAC5CsC,GAAwB,iBAAkB,EAAGlY,EAAOvB,KAAKmX,MAAM,GAC/DjK,EAAiB,iBAAkB,EAAG6O,GAAY,GAElD,IAWI5T,EAXEyF,EAAM5N,KAAKwtB,KAAK01B,aAChBl1C,EAAOgP,GAAWpP,GAOlBm+C,EAAmB/rD,KAAK0W,MAAM1I,GAC9Bg+C,EAAUhsD,KAAK0W,MAAM1I,GAgB3B,OAZE7F,EADW,MAAT5G,EACQwqD,EAAiB36C,IAAI7P,EAAOwa,GAAYja,KAAK,WAAM,OAAAkqD,IAEnD7qD,QAAQC,QAAQ4qD,GAG5BD,EAAiBjqD,KAAOqG,EAAQrG,KAAKoP,KAAK/I,GAC1C4jD,EAAiB3jD,MAAQD,EAAQrG,KAAKoP,KAAK/I,OAASL,GAE1B,mBAAfiU,GACT5T,EAAQC,MAAM,cAGT2jD,GAMTT,0BAAA,WAEE,OADA9wC,GAAqB,yBAA0Bxa,KAAKmX,MAC7C,IAAI2E,GAAa9b,KAAKwtB,KAAMxtB,KAAKmX,OAG1C3X,sBAAI8rD,6BAAJ,WACE,OAAOtrD,KAAKisD,gDAGdzsD,sBAAI8rD,wBAAJ,WACE,OAAOtrD,KAAKoqB,0CAGd5qB,sBAAI8rD,2BAAJ,WACE,OAAOtrD,KAAKyqB,6CAGdjrB,sBAAI8rD,yBAAJ,WACE,OAAOtrD,KAAKksD,+CAxUd,YAAY1+B,EAAYrW,GACtB,KAAMqW,aAAgBw1B,IACpB,MAAM,IAAIn+C,MACR,oEAKJ8D,aAAM6kB,EAAMrW,EAAMkyC,GAAY8C,SAAS,SA0U3C1/B,GAAMZ,uBAAyBy/B,GAC/B5rB,GAAU7T,uBAAyBy/B,GCtXnC,ICgBYc,GAAAA,MDhBZ,WAGEpsD,cAA4C,GAC5CA,gBAAa,EACbA,WAAkB,UA2BlBqsD,qBAAA,SAAQC,GAKN,IAHA,IAAIn1C,EAAOm1C,aAAmBv3C,GAAOu3C,EAAU,IAAIv3C,GAAKu3C,GACpD51C,EAAQ1W,KACVyB,EAAO0V,EAAKvB,WACE,OAATnU,GAELiV,EAAQ,IAAI21C,GAAK5qD,EAAMiV,EADL7L,EAAQ6L,EAAMmT,MAAMuH,SAAU3vB,IAAS,IAAI8qD,IAG7D9qD,GADA0V,EAAOA,EAAKpB,YACAH,WAGd,OAAOc,GAQT21C,sBAAA,WACE,OAAOrsD,KAAK6pB,MAAMtoB,OAQpB8qD,sBAAA,SAAS9qD,GACPkD,OAAwB,IAAVlD,EAAuB,iCACrCvB,KAAK6pB,MAAMtoB,MAAQA,EACnBvB,KAAKwsD,kBAMPH,mBAAA,WACErsD,KAAK6pB,MAAMtoB,MAAQ,KACnBvB,KAAK6pB,MAAMuH,SAAW,GACtBpxB,KAAK6pB,MAAM4iC,WAAa,EACxBzsD,KAAKwsD,kBAMPH,yBAAA,WACE,OAA+B,EAAxBrsD,KAAK6pB,MAAM4iC,YAMpBJ,qBAAA,WACE,OAA2B,OAApBrsD,KAAKyf,aAAwBzf,KAAK0sD,eAQ3CL,0BAAA,SAAa/sC,GAAb,WACElM,GAAKpT,KAAK6pB,MAAMuH,SAAU,SAAC1a,EAAeyN,GACxC7E,EAAO,IAAI+sC,GAAQ31C,EAAOxO,EAAMic,OAapCkoC,+BAAA,SACE/sC,EACAqtC,EACAC,GAEID,IAAgBC,GAClBttC,EAAOtf,MAGTA,KAAK8mB,aAAa,SAAApQ,GAChBA,EAAMm2C,kBAAkBvtC,GAAyB,EAAMstC,KAGrDD,GAAeC,GACjBttC,EAAOtf,OAYXqsD,6BAAA,SACE/sC,EACAqtC,GAGA,IADA,IAAItvC,EAAOsvC,EAAc3sD,KAAOA,KAAKw7B,SACrB,OAATne,GAAe,CACpB,GAAIiC,EAAOjC,GACT,OAAO,EAETA,EAAOA,EAAKme,SAEd,OAAO,GAUT6wB,iDAAA,SAAoC/sC,GAClCtf,KAAK8mB,aAAa,SAAApQ,GACS,OAArBA,EAAM+I,WACRH,EAAO5I,GAEPA,EAAMo2C,oCAAoCxtC,MAQhD+sC,kBAAA,WACE,OAAO,IAAIt3C,GACQ,OAAjB/U,KAAK+sD,QACD/sD,KAAKgtD,MACLhtD,KAAK+sD,QAAQ51C,OAAS,IAAMnX,KAAKgtD,QAOzCX,kBAAA,WACE,OAAOrsD,KAAKgtD,OAMdX,oBAAA,WACE,OAAOrsD,KAAK+sD,SAQNV,4BAAR,WACuB,OAAjBrsD,KAAK+sD,SACP/sD,KAAK+sD,QAAQE,aAAajtD,KAAKgtD,MAAOhtD,OAWlCqsD,0BAAR,SAAqBxtC,EAAmBnI,GACtC,IAAMw2C,EAAax2C,EAAM5L,UACnBqiD,EAAcxiD,EAAS3K,KAAK6pB,MAAMuH,SAAUvS,GAC9CquC,GAAcC,UACTntD,KAAK6pB,MAAMuH,SAASvS,GAC3B7e,KAAK6pB,MAAM4iC,aACXzsD,KAAKwsD,kBACKU,GAAeC,IACzBntD,KAAK6pB,MAAMuH,SAASvS,GAAanI,EAAMmT,MACvC7pB,KAAK6pB,MAAM4iC,aACXzsD,KAAKwsD,uBAzMT,YACUQ,EACAD,EACAljC,gBAFAmjC,mBACAD,qBACAljC,MAAyB0iC,IAFzBvsD,WAAAgtD,EACAhtD,aAAA+sD,EACA/sD,WAAA6pB,GCPAuiC,GAAAA,GAAAA,wBAQVA,qBAIAA,+BAIAA,6CAGAA,mCAWDpJ,GAAaoK,yBAA2B,GAwCxCpK,GAAK9iD,UAAkB+mD,kBAAoB,WAO1CjnD,KAAKqtD,sBAAwB,IAAIhB,IAsBnCrJ,GAAK9iD,UAAU4rD,iBAAmB,SAChC30C,EACAu0C,EACA3vC,EACA4vC,GAEA3rD,KAAKuuC,KAAK,kBAAoBp3B,GAGR,SAAhBm2C,KAAN,IACMC,EAAW,IAAIjC,GAAUtrD,KAAMmX,GACrCo2C,EAAS9+B,GAAG,QAAS6+B,GACrB,IAKME,EAA2B,CAC/Br2C,OACA/K,OAAQs/C,EACR3vC,aAGA6sB,OAAQ,KAGR6kB,MAAO/6C,KAGPi5C,eAGA+B,WAAY,EAGZC,UAvBgB,WAChBJ,EAAS/+B,IAAI,QAAS8+B,IAyBtBM,YAAa,KAEbC,eAAgB,KAEhBC,qBAAsB,KAEtBC,yBAA0B,KAE1BC,8BAA+B,MAI3BC,EAAejuD,KAAKkuD,gBAAgB/2C,GAC1Cq2C,EAAYM,qBAAuBG,EACnC,IAAM1J,EAASiJ,EAAYphD,OAAO6hD,EAAal/C,OAC/C,QAAejH,IAAXy8C,GAKF,GAHAiJ,EAAYG,YACZH,EAAYO,yBAA2B,KACvCP,EAAYQ,8BAAgC,KACxCR,EAAYzxC,WAAY,CAE1B,IAAMY,EAAW,IAAIiN,GACnB4jC,EAAYM,qBACZ,IAAIxC,GAAUtrD,KAAMwtD,EAAYr2C,MAChCkJ,IAEFmtC,EAAYzxC,WAAW,MAAM,EAAOY,QAEjC,CACLjD,GACE,qCACA6qC,EACAiJ,EAAYr2C,MAIdq2C,EAAY5kB,OAASwjB,GAAkB+B,IACvC,IAAMC,EAAYpuD,KAAKqtD,sBAAsBgB,QAAQl3C,GAC/Cm3C,EAAYF,EAAU3uC,YAAc,GAC1C6uC,EAAUprD,KAAKsqD,GAEfY,EAAUG,SAASD,GAKnB,IAAIE,SACJ,GACoB,iBAAXjK,GACI,OAAXA,GACA55C,EAAS45C,EAAQ,aAGjBiK,EAAkB3jD,EAAQ05C,EAAe,aACzC9/C,EACE8U,GAAgBi1C,GAChB,yHAOFA,GAFExuD,KAAKwjD,gBAAgBvzB,uBAAuB9Y,IAC5C8O,GAAanH,YACeR,cAAcvP,MAE9Cy/C,EAAoDA,EAEpD,IAAMp+B,EAAepwB,KAAKwkD,uBACpBC,EAAoBjmC,GAAa+lC,EAAQiK,GACzC9wC,EAAU4S,GACdm0B,EACAwJ,EACA79B,GAEFo9B,EAAYO,yBAA2BtJ,EACvC+I,EAAYQ,8BAAgCtwC,EAC5C8vC,EAAYK,eAAiB7tD,KAAK0kD,kBAElC,IAAM1nB,EAASh9B,KAAKwjD,gBAAgBmB,mBAClCxtC,EACAuG,EACA8vC,EAAYK,eACZL,EAAY7B,cAEd3rD,KAAK+jD,YAAYC,0BAA0B7sC,EAAM6lB,GAEjDh9B,KAAKyuD,2BAWRzL,GAAK9iD,UAAkBguD,gBAAkB,SACxC/2C,EACAu3C,GAEA,OACE1uD,KAAKwjD,gBAAgBvzB,uBAAuB9Y,EAAMu3C,IAClDzoC,GAAanH,YAehBkkC,GAAK9iD,UAAkBuuD,uBAAyB,SAC/CpxC,GAD+C,WAQ/C,gBAPAA,EAA4Brd,KAAKqtD,uBAG5BhwC,GACHrd,KAAK2uD,qCAAqCtxC,GAGpB,OAApBA,EAAKoC,WAAqB,CAC5B,IAAMmvC,EAAQ5uD,KAAK6uD,uBAAuBxxC,GAC1C5Y,EAAsB,EAAfmqD,EAAMjuD,OAAY,yCAEViuD,EAAMtiC,MACnB,SAACkhC,GAA6B,OAAAA,EAAY5kB,SAAWwjB,GAAkB+B,OAKvEnuD,KAAK8uD,sBAAsBzxC,EAAKlG,OAAQy3C,QAEjCvxC,EAAKqvC,eACdrvC,EAAKyJ,aAAa,SAAA/H,GAChB7W,EAAKumD,uBAAuB1vC,MAajCikC,GAAK9iD,UAAkB4uD,sBAAwB,SAC9C33C,EACAy3C,GASA,IAX8C,WAKxCG,EAAeH,EAAM7jD,IAAI,SAAAikD,GAC7B,OAAOA,EAAInB,iBAEPoB,EAAcjvD,KAAKkuD,gBAAgB/2C,EAAM43C,GAC3CG,EAAaD,EACXE,EAAaF,EAAY/nC,OACtB1mB,EAAI,EAAGA,EAAIouD,EAAMjuD,OAAQH,IAAK,CACrC,IAAMwuD,EAAMJ,EAAMpuD,GAClBiE,EACEuqD,EAAIpmB,SAAWwjB,GAAkB+B,IACjC,iEAEFa,EAAIpmB,OAASwjB,GAAkBgD,KAC/BJ,EAAItB,aACJ,IAAM53C,EAAef,GAAKe,aAAaqB,EAAM63C,EAAI73C,MAEjD+3C,EAAaA,EAAW9vC,YACtBtJ,EACAk5C,EAAIjB,0BAIR,IAAMsB,EAAaH,EAAWngD,KAAI,GAC5BugD,EAAan4C,EAGnBnX,KAAKirC,QAAQ+V,IACXsO,EAAWp/C,WACXm/C,EACA,SAACzmB,GACC1gC,EAAKqmC,KAAK,2BAA4B,CACpCp3B,KAAMm4C,EAAWp/C,WACjB04B,WAGF,IAAI5L,EAAkB,GACtB,GAAe,OAAX4L,EAAiB,CAInB,IADA,IAAM9a,EAAY,GACTttB,EAAI,EAAGA,EAAIouD,EAAMjuD,OAAQH,IAAK,CAKrC,GAJAouD,EAAMpuD,GAAGooC,OAASwjB,GAAkBmD,UACpCvyB,EAASA,EAAOr5B,OACduE,EAAKs7C,gBAAgBvqB,aAAa21B,EAAMpuD,GAAGqtD,iBAEzCe,EAAMpuD,GAAGub,WAAY,CAEvB,IAAMsB,EAAOuxC,EAAMpuD,GAAGwtD,8BAChBxjC,EAAM,IAAI8gC,GAAUpjD,EAAM0mD,EAAMpuD,GAAG2W,MACnCwF,EAAW,IAAIiN,GAAavM,EAAMmN,EAAKnK,IAC7CyN,EAAU5qB,KACR0rD,EAAMpuD,GAAGub,WAAW7K,KAAK,KAAM,MAAM,EAAMyL,IAG/CiyC,EAAMpuD,GAAGmtD,YAIXzlD,EAAKymD,qCACHzmD,EAAKmlD,sBAAsBgB,QAAQl3C,IAGrCjP,EAAKumD,yBAELvmD,EAAK67C,YAAYC,0BAA0B7sC,EAAM6lB,GAGjD,IAASx8B,EAAI,EAAGA,EAAIstB,EAAUntB,OAAQH,IACpC8T,GAAewZ,EAAUttB,QAEtB,CAEL,GAAe,cAAXooC,EACF,IAASpoC,EAAI,EAAGA,EAAIouD,EAAMjuD,OAAQH,IAC5BouD,EAAMpuD,GAAGooC,SAAWwjB,GAAkBoD,iBACxCZ,EAAMpuD,GAAGooC,OAASwjB,GAAkBqD,YAEpCb,EAAMpuD,GAAGooC,OAASwjB,GAAkB+B,QAGnC,CACLpkD,GACE,kBAAoBulD,EAAWp/C,WAAa,YAAc04B,GAE5D,IAASpoC,EAAI,EAAGA,EAAIouD,EAAMjuD,OAAQH,IAChCouD,EAAMpuD,GAAGooC,OAASwjB,GAAkBqD,YACpCb,EAAMpuD,GAAGotD,YAAchlB,EAI3B1gC,EAAK47C,mBAAmB3sC,KAG5Bg4C,IAiBHnM,GAAK9iD,UAAkB4jD,mBAAqB,SAC3ChY,GAEA,IAAM4jB,EAA0B1vD,KAAK2vD,4BAA4B7jB,GAC3D30B,EAAOu4C,EAAwBv4C,OAE/By3C,EAAQ5uD,KAAK6uD,uBAAuBa,GAG1C,OAFA1vD,KAAK4vD,uBAAuBhB,EAAOz3C,GAE5BA,GAWR6rC,GAAK9iD,UAAkB0vD,uBAAyB,SAC/ChB,EACAz3C,GAEA,GAAqB,IAAjBy3C,EAAMjuD,OAAV,CAeA,IATA,IAkGegtD,EAlGT7/B,EAAY,GACdkP,EAAkB,GAKhB+xB,EAHcH,EAAMrxB,OAAO,SAAA0jB,GAC/B,OAAOA,EAAErY,SAAWwjB,GAAkB+B,MAEPpjD,IAAI,SAAAk2C,GACnC,OAAOA,EAAE4M,iBAEFrtD,EAAI,EAAGA,EAAIouD,EAAMjuD,OAAQH,IAAK,CACrC,IAAMgtD,EAAcoB,EAAMpuD,GACpBsV,EAAef,GAAKe,aAAaqB,EAAMq2C,EAAYr2C,MACrD04C,GAAmB,EACrBjC,SAMF,GALAnpD,EACmB,OAAjBqR,EACA,iEAGE03C,EAAY5kB,SAAWwjB,GAAkBqD,YAC3CI,GAAmB,EACnBjC,EAAcJ,EAAYI,YAC1B5wB,EAASA,EAAOr5B,OACd3D,KAAKwjD,gBAAgBvqB,aAAau0B,EAAYK,gBAAgB,SAE3D,GAAIL,EAAY5kB,SAAWwjB,GAAkB+B,IAElD,GAAIX,EAAYE,YAAe1K,GAAaoK,yBAC1CyC,GAAmB,EACnBjC,EAAc,WACd5wB,EAASA,EAAOr5B,OACd3D,KAAKwjD,gBAAgBvqB,aAAau0B,EAAYK,gBAAgB,QAE3D,CAEL,IAAMiC,EAAc9vD,KAAKkuD,gBACvBV,EAAYr2C,KACZ43C,GAEFvB,EAAYM,qBAAuBgC,EACnC,IAAMvrB,EAAUqqB,EAAMpuD,GAAG4L,OAAO0jD,EAAY/gD,OAC5C,QAAgBjH,IAAZy8B,EAAuB,CACzB7qB,GACE,qCACA6qB,EACAipB,EAAYr2C,MAEd,IAAI44C,EAAcvxC,GAAa+lB,GAEV,iBAAZA,GACI,MAAXA,GACA55B,EAAS45B,EAAS,eAGlBwrB,EAAcA,EAAY9wC,eAAe6wC,EAAYxxC,gBAGvD,IAAM0xC,EAAaxC,EAAYK,eACzBz9B,EAAepwB,KAAKwkD,uBACpByL,EAAkB3/B,GACtBy/B,EACAD,EACA1/B,GAGFo9B,EAAYO,yBAA2BgC,EACvCvC,EAAYQ,8BAAgCiC,EAC5CzC,EAAYK,eAAiB7tD,KAAK0kD,kBAElCqK,EAAa1sB,OAAO0sB,EAAat2C,QAAQu3C,GAAa,GAStDhzB,GARAA,EAASA,EAAOr5B,OACd3D,KAAKwjD,gBAAgBmB,mBACnB6I,EAAYr2C,KACZ84C,EACAzC,EAAYK,eACZL,EAAY7B,gBAGAhoD,OACd3D,KAAKwjD,gBAAgBvqB,aAAa+2B,GAAY,SAGhDH,GAAmB,EACnBjC,EAAc,SACd5wB,EAASA,EAAOr5B,OACd3D,KAAKwjD,gBAAgBvqB,aAAau0B,EAAYK,gBAAgB,IAOtE,GAFA7tD,KAAK+jD,YAAYC,0BAA0B7sC,EAAM6lB,GACjDA,EAAS,GACL6yB,IAEFjB,EAAMpuD,GAAGooC,OAASwjB,GAAkBmD,UAIzB5B,EAERiB,EAAMpuD,GAAGmtD,UADVp5C,WAAWo5C,EAAWn6C,KAAKI,MAAM,IAG/Bg7C,EAAMpuD,GAAGub,YACX,GAAoB,WAAhB6xC,EAA0B,CAC5B,IAAMpjC,EAAM,IAAI8gC,GAAUtrD,KAAM4uD,EAAMpuD,GAAG2W,MAEnC+4C,EAAiCtB,EAAMpuD,GAAGstD,qBAC1CnxC,EAAW,IAAIiN,GAAasmC,EAAW1lC,EAAKnK,IAClDyN,EAAU5qB,KAAK0rD,EAAMpuD,GAAGub,WAAW7K,KAAK,KAAM,MAAM,EAAOyL,SAE3DmR,EAAU5qB,KACR0rD,EAAMpuD,GAAGub,WAAW7K,KAAK,KAAM,IAAIrM,MAAM+oD,IAAc,EAAO,OAQxE5tD,KAAK2uD,qCAAqC3uD,KAAKqtD,uBAG/C,IAAS7sD,EAAI,EAAGA,EAAIstB,EAAUntB,OAAQH,IACpC8T,GAAewZ,EAAUttB,IAI3BR,KAAKyuD,2BAYNzL,GAAK9iD,UAAkByvD,4BAA8B,SACpDx4C,GAEA,IAAIgI,EAGAgxC,EAAkBnwD,KAAKqtD,sBAE3B,IADAluC,EAAQhI,EAAKvB,WACI,OAAVuJ,GAAiD,OAA/BgxC,EAAgB1wC,YACvC0wC,EAAkBA,EAAgB9B,QAAQlvC,GAE1CA,GADAhI,EAAOA,EAAKpB,YACCH,WAGf,OAAOu6C,GAWRnN,GAAK9iD,UAAkB2uD,uBAAyB,SAC/CsB,GAGA,IAAMC,EAAkC,GAQxC,OAPApwD,KAAKqwD,mCAAmCF,EAAiBC,GAGzDA,EAAiBj9C,KAAK,SAACvH,EAAGrM,GACxB,OAAOqM,EAAE6hD,MAAQluD,EAAEkuD,QAGd2C,GASRpN,GAAK9iD,UAAkBmwD,mCAAqC,SAC3DhzC,EACAuxC,GAF2D,WAIrDN,EAAYjxC,EAAKoC,WACvB,GAAkB,OAAd6uC,EACF,IAAK,IAAI9tD,EAAI,EAAGA,EAAI8tD,EAAU3tD,OAAQH,IACpCouD,EAAM1rD,KAAKorD,EAAU9tD,IAIzB6c,EAAKyJ,aAAa,SAAApQ,GAChBxO,EAAKmoD,mCAAmC35C,EAAOk4C,MAWlD5L,GAAK9iD,UAAkByuD,qCAAuC,SAC7DtxC,GAD6D,WAGvDuxC,EAAQvxC,EAAKoC,WACnB,GAAImvC,EAAO,CAET,IADA,IAAI0B,EAAK,EACAv5B,EAAO,EAAGA,EAAO63B,EAAMjuD,OAAQo2B,IAClC63B,EAAM73B,GAAM6R,SAAWwjB,GAAkBmD,YAC3CX,EAAM0B,GAAM1B,EAAM73B,GAClBu5B,KAGJ1B,EAAMjuD,OAAS2vD,EACfjzC,EAAKkxC,SAAwB,EAAfK,EAAMjuD,OAAaiuD,EAAQ,MAG3CvxC,EAAKyJ,aAAa,SAAA/H,GAChB7W,EAAKymD,qCAAqC5vC,MAa7CikC,GAAK9iD,UAAkB6kD,mBAAqB,SAAU5tC,GAAV,WACrC8e,EAAej2B,KAAK2vD,4BAA4Bx4C,GAAMA,OAEtDg5C,EAAkBnwD,KAAKqtD,sBAAsBgB,QAAQl3C,GAY3D,OAVAg5C,EAAgBI,gBAAgB,SAAClzC,GAC/BnV,EAAKsoD,yBAAyBnzC,KAGhCrd,KAAKwwD,yBAAyBL,GAE9BA,EAAgBtD,kBAAkB,SAACxvC,GACjCnV,EAAKsoD,yBAAyBnzC,KAGzB4Y,GAUR+sB,GAAK9iD,UAAkBswD,yBAA2B,SACjDnzC,GAEA,IAAMuxC,EAAQvxC,EAAKoC,WACnB,GAAc,OAAVmvC,EAAgB,CASlB,IANA,IAAM9gC,EAAY,GAIdkP,EAAkB,GAClByzB,GAAY,EACPjwD,EAAI,EAAGA,EAAIouD,EAAMjuD,OAAQH,IAChC,GAAIouD,EAAMpuD,GAAGooC,SAAWwjB,GAAkBoD,iBAEnC,GAAIZ,EAAMpuD,GAAGooC,SAAWwjB,GAAkBgD,KAC/C3qD,EACEgsD,IAAajwD,EAAI,EACjB,mDAIFouD,EAFA6B,EAAWjwD,GAEFooC,OAASwjB,GAAkBoD,iBACpCZ,EAAMpuD,GAAGotD,YAAc,WAWvB,GATAnpD,EACEmqD,EAAMpuD,GAAGooC,SAAWwjB,GAAkB+B,IACtC,0CAGFS,EAAMpuD,GAAGmtD,YACT3wB,EAASA,EAAOr5B,OACd3D,KAAKwjD,gBAAgBvqB,aAAa21B,EAAMpuD,GAAGqtD,gBAAgB,IAEzDe,EAAMpuD,GAAGub,WAAY,CAEvB+R,EAAU5qB,KACR0rD,EAAMpuD,GAAGub,WAAW7K,KAAK,KAAM,IAAIrM,MAAM,QAAQ,EAFb,QAO1B,IAAd4rD,EAEFpzC,EAAKkxC,SAAS,MAGdK,EAAMjuD,OAAS8vD,EAAW,EAI5BzwD,KAAK+jD,YAAYC,0BAA0B3mC,EAAKlG,OAAQ6lB,GACxD,IAASx8B,EAAI,EAAGA,EAAIstB,EAAUntB,OAAQH,IACpC8T,GAAewZ,EAAUttB,MCtvB/B,QAgBEkwD,sBAAA,SAASnQ,GACP,OAAKvgD,KAAK2wD,MAIH3wD,KAAK2wD,MAAMjQ,SAASH,GAAcn4C,MAAM,SAAA3E,GAG7C,OAAIA,GAAwB,+BAAfA,EAAMiF,MACjBuI,GAAI,kEACG,MAEA9P,QAAQE,OAAOoC,KAVjBtC,QAAQC,QAAQ,OAe3BsvD,oCAAA,SAAuBzpB,GAGjBjnC,KAAK2wD,MACP3wD,KAAK2wD,MAAMC,qBAAqB3pB,IAEhC1yB,WAAW,WAAM,OAAA0yB,EAAS,OAAO,GACjCjnC,KAAK6wD,cACFr/C,MACA1P,KAAK,SAAAgvD,GAAQ,OAAAA,EAAKF,qBAAqB3pB,OAI9CypB,uCAAA,SAA0BzpB,GACxBjnC,KAAK6wD,cACFr/C,MACA1P,KAAK,SAAAgvD,GAAQ,OAAAA,EAAKC,wBAAwB9pB,MAG/CypB,mCAAA,WACE,IAAIM,EACF,0DACAhxD,KAAKixD,KAAKjjD,KACV,iFAEE,eAAgBhO,KAAKixD,KAAKjc,QAC5Bgc,GACE,uJAGO,mBAAoBhxD,KAAKixD,KAAKjc,QACvCgc,GACE,2JAIFA,GACE,kKAIJjnD,GAAKinD,QAxEP,YACUC,EACAJ,GAFV,WACU7wD,UAAAixD,EACAjxD,mBAAA6wD,EAHF7wD,WAAqC,KAK3CA,KAAK2wD,MAAQE,EAAcK,aAAa,CAAElkD,UAAU,IAC/ChN,KAAK2wD,OACRE,EAAcr/C,MAAM1P,KAAK,SAAAgvD,GAAQ,OAAC5oD,EAAKyoD,MAAQG,ICTrD,IAYIK,GAZEC,GAAsB,kBAiCnBC,eAAP,WAIE,OAFEF,GADGA,IACe,IAAIE,IAM1BA,uBAAA,2BACE,IAAsB,IAAA7P,EAAAr+C,EAAA3D,OAAOoK,KAAK5J,KAAKsxD,uCAAS,CAA3C,IAAMC,cACT,IAAoB,IAAA9P,YAAAt+C,EAAA3D,OAAOoK,KAAK5J,KAAKsxD,OAAOC,oCAAW,CAAlD,IAAMC,UACTxxD,KAAKsxD,OAAOC,GAASC,GAAO5Q,mNAKlCyQ,oBAAA,2BACE,IAAsB,IAAA7P,EAAAr+C,EAAA3D,OAAOoK,KAAK5J,KAAKsxD,uCAAS,CAA3C,IAAMC,cACT,IAAoB,IAAA9P,YAAAt+C,EAAA3D,OAAOoK,KAAK5J,KAAKsxD,OAAOC,oCAAW,CAAlD,IAAMC,UACTxxD,KAAKsxD,OAAOC,GAASC,GAAO5L,gNAWlCyL,6BAAA,SACE5K,EACAgL,EACAle,GAEA,IAAIie,EAA4Bje,GAAOkT,EAAIzR,QAAQoc,SACrCtpD,IAAV0pD,GACF5/C,GACE,8DACEw/C,GACA,kDAIN,IAAIx4C,EAAYF,GAAc84C,GAC1Bv4C,EAAWL,EAAUK,SAIrBy4C,OAAqC5pD,EAClB,oBAAZqtC,UACTuc,EAAiBvc,QAAQG,IAAuC,iCAG9Doc,GAEFF,EAAQ,UAAUE,SAAqBz4C,EAASb,UAEhDa,GADAL,EAAYF,GAAc84C,IACLv4C,UAEPL,EAAUK,SAASf,OAGnC,IAAMwuC,EAGA,IAAIgK,GAA0BjK,EAAKgL,GAYzC,OAVAh3C,GAAY,gCAAiC,EAAG7B,GAC3CA,EAAUzB,KAAKrM,WAClB8G,GACE,4FAKS5R,KAAK2xD,WAAW14C,EAAUwtC,EAAKC,GAEhC8E,UAQd6F,wBAAA,SAAW7jC,GACT,IAAMokC,EAAW/mD,EAAQ7K,KAAKsxD,OAAQ9jC,EAAKi5B,IAAIz4C,MAE1C4jD,GAAY/mD,EAAQ+mD,EAAUpkC,EAAK6qB,UAAU//B,iBAAmBkV,GACnE5b,GACE,YAAY4b,EAAKi5B,IAAIz4C,SAAQwf,EAAK6qB,yCAGtC7qB,EAAKozB,mBACEgR,EAASpkC,EAAK6qB,UAAU//B,gBAWjC+4C,wBAAA,SACEp4C,EACAwtC,EACAC,GAEA,IAAIkL,EAAW/mD,EAAQ7K,KAAKsxD,OAAQ7K,EAAIz4C,MAEnC4jD,IACHA,EAAW,GACX5xD,KAAKsxD,OAAO7K,EAAIz4C,MAAQ4jD,GAG1B,IAAIpkC,EAAO3iB,EAAQ+mD,EAAU34C,EAASX,eAStC,OARIkV,GACF5b,GACE,2HAGJ4b,EAAO,IAAIw1B,GAAK/pC,EAAUjZ,KAAK6xD,eAAgBpL,EAAKC,GACpDkL,EAAS34C,EAASX,eAAiBkV,GASrC6jC,6BAAA,SAAgB7K,GACdxmD,KAAK6xD,eAAiBrL,OAvJ1B,cAIUxmD,YAIJ,GAMIA,qBAA0B,UCElCR,sBAAI+mD,wBAAJ,WACE,OAAOvmD,KAAKic,MAAMwqC,qCAepBF,iBAAA,SAAIpvC,GAIF,OAHAnX,KAAK8xD,cAAc,OACnBtlD,EAAiB,eAAgB,EAAG,EAAG9L,UAAUC,QAE7CwW,aAAgBm0C,GACXtrD,KAAK+xD,WAAW56C,EAAKjH,iBAGdpI,IAATqP,EAAqBnX,KAAK2iB,MAAMjM,MAAMS,GAAQnX,KAAK2iB,OAU5D4jC,wBAAA,SAAWhT,GAET,IAAMye,EAAU,sBAChBhyD,KAAK8xD,cAAcE,GACnBxlD,EAAiBwlD,EAAS,EAAG,EAAGtxD,UAAUC,QAC1C,IAAMsxD,EAAYv5C,GAAc66B,GAChC94B,GAAYu3C,EAAS,EAAGC,GAExB,IAAMh5C,EAAWg5C,EAAUh5C,SAa3B,OAZIA,EAASxB,OAAUzX,KAAKic,MAAMo8B,UAAuB5gC,MACvD7F,GACEogD,EACE,2DAEA/4C,EAASxB,KACT,iBACCzX,KAAKic,MAAMo8B,UAAuB5gC,KACnC,KAICzX,KAAKwqB,IAAIynC,EAAU96C,KAAKjH,aAMzBq2C,2BAAR,SAAsByL,GACD,OAAfhyD,KAAKic,OACPrK,GAAM,eAAiBogD,EAAU,4BAKrCzL,uBAAA,WACE/5C,EAAiB,qBAAsB,EAAG,EAAG9L,UAAUC,QACvDX,KAAK8xD,cAAc,aACnB9xD,KAAKic,MAAM2kC,aAGb2F,sBAAA,WACE/5C,EAAiB,oBAAqB,EAAG,EAAG9L,UAAUC,QACtDX,KAAK8xD,cAAc,YACnB9xD,KAAKic,MAAM2pC,UA3GGW,eAAc,CAC5B2L,UAAW,CACTC,MAAO,aAETC,UAAW,SAACvhC,GACV,MAAO,CACLshC,MAAO,CACLC,UAAavhC,UAUrB,YAAoB5U,IAAAjc,WAAAic,aACK+mC,IACrBpxC,GACE,wEAKJ5R,KAAK2iB,MAAQ,IAAI2oC,GAAUrvC,EAAOlH,GAAK8d,OAEvC7yB,KAAKqyD,SAAW,IAAIC,GAAkBtyD,MAoF1C,QAKQsyD,oBAAN,mFAEGtyD,KAAKwrD,SAAiBsG,cAAc,UAErCT,GAAY3P,cAAc6Q,WAAYvyD,KAAKwrD,SAAiBvvC,OAE3Djc,KAAKwrD,SAAiBvvC,MAAQ,KAE9Bjc,KAAKwrD,SAAiB7oC,MAAQ,KAC/B3iB,KAAKwrD,SAAS6G,SAAW,KACzBryD,KAAKwrD,SAAW,kBAblB,YAAmBA,GAAAxrD,cAAAwrD,EC1Hd,sDAAyB,WAC9B3W,GAAoB2d,gBACpBzkB,GAAsB0kB,8BAGO,WAC7B1kB,GAAsBykB,uCAIa,WACnC,OAAO3d,GAAiC,wCAGF,SACtCrqB,EACAviB,GAGCuiB,EAAIgD,KAAKm4B,sBAA8BpE,uBAAyBt5C,SAG9C,SAAUuiB,EAAgBq7B,GAC7Cr7B,EAAIgD,KAAKqd,MAAMgb,0BAGoB,SAAUr7B,EAAgB27B,GAC7D37B,EAAIgD,KAAKklC,sBAAsBvM,oBAGF,SAAU37B,GACvC,OAAOA,EAAIgD,KAAK41B,qCAGiB,SACjC54B,EACAviB,GAEA,OAAOuiB,EAAIgD,KAAKmlC,qBAAqB1qD,MC5C1B2qD,GAAiB9W,GAO7BA,GAAqB57C,UAAkB2yD,aAAe,SACrD19C,EACA4G,GAEA/b,KAAKo8C,YAAY,IAAK,CAAEx8C,EAAGuV,GAAc4G,IAQ1C+/B,GAAqB57C,UAAkB4yD,KAAO,SAC7C9pD,EACA+pD,GAEA/yD,KAAKo8C,YAAY,OAAQ,CAAE98C,EAAG0J,GAAQ+pD,IAIjC,ICb0BvlD,GpBhBHytC,GmB6BjB+X,GAAqBjb,GA2BrBkb,GAAmBz7C,uFArBN,SAAU07C,GAClC,IAAMC,EAASrX,GAAqB57C,UAAU8gD,IAY9C,OAXAlF,GAAqB57C,UAAU8gD,IAAM,SACnC7rC,EACAnM,EACA+S,EACAmL,QAEapf,IAATof,IACFA,EAAOgsC,KAETC,EAAOvyD,KAAKZ,KAAMmV,EAAYnM,EAAM+S,EAAYmL,IAE3C,WACL40B,GAAqB57C,UAAU8gD,IAAMmS,wCAaV,SAAUloC,GACvC,OAAOA,EAAM2E,mCAQgB,SAAU42B,GACvC6K,GAAY3P,cAAc8E,gBAAgBA,MC1DtC4M,GAAc7M,GAAS6M,YpBdCnY,IoBgBGztC,GA6ChB6lD,IA3CQ7uD,YpBjBvBA,GAAcy2C,GoBoBKztC,GAAgC6kD,SAASiB,kBAC1D,IAAIpkD,EACF,WACA,SAAC+e,EAAWslB,GAGV,IAAMkT,EAAMx4B,EAAUslC,YAAY,OAAOrC,eACnCO,EAAexjC,EAAUslC,YAAY,iBAE3C,OAAOlC,GAAY3P,cAAc8R,gBAC/B/M,EACAgL,EACAle,cAKHkgB,gBAEC,CACEnI,aACA7+B,SACA85B,YACA38B,gBACAhZ,iBACAyhD,YACAe,eACAM,iBAGHC,sBAAqB,IAG1BnmD,GAASomD"}