{"version":3,"file":"firebase-database.js","sources":["../../node_modules/tslib/tslib.es6.js","../util/src/constants.ts","../util/src/assert.ts","../util/src/crypt.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","../database/src/core/util/util.ts","../database/src/core/storage/DOMStorageWrapper.ts","../database/src/core/storage/MemoryStorage.ts","../database/src/core/storage/storage.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/NextPushId.ts","../database/src/core/snap/indexes/KeyIndex.ts","../database/src/core/snap/snap.ts","../database/src/core/util/validation.ts","../database/src/api/onDisconnect.ts","../database/src/api/TransactionResult.ts","../database/src/core/snap/Node.ts","../database/src/core/snap/indexes/Index.ts","../database/src/core/snap/LeafNode.ts","../database/src/core/snap/indexes/PriorityIndex.ts","../database/src/core/snap/IndexMap.ts","../database/src/core/snap/ChildrenNode.ts","../database/src/core/util/SortedMap.ts","../database/src/core/snap/childSet.ts","../database/src/core/snap/comparators.ts","../database/src/core/snap/nodeFromJSON.ts","../database/src/core/snap/indexes/ValueIndex.ts","../database/src/api/Query.ts","../database/src/core/operation/Operation.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/core/SparseSnapshotTree.ts","../database/src/core/util/ServerValues.ts","../database/src/core/util/ImmutableTree.ts","../database/src/core/SyncPoint.ts","../database/src/core/operation/AckUserWrite.ts","../database/src/core/operation/ListenComplete.ts","../database/src/core/operation/Overwrite.ts","../database/src/core/operation/Merge.ts","../database/src/core/view/CacheNode.ts","../database/src/core/view/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/CompoundWrite.ts","../database/src/core/WriteTree.ts","../database/src/core/SyncTree.ts","../database/src/core/SnapshotHolder.ts","../database/src/core/AuthTokenProvider.ts","../database/src/core/stats/StatsCollection.ts","../database/src/core/stats/StatsManager.ts","../database/src/core/stats/StatsListener.ts","../database/src/core/stats/StatsReporter.ts","../database/src/core/view/EventQueue.ts","../database/src/core/util/EventEmitter.ts","../database/src/core/util/VisibilityMonitor.ts","../database/src/core/util/OnlineMonitor.ts","../database/src/realtime/polling/PacketReceiver.ts","../database/src/realtime/BrowserPollConnection.ts","../database/src/core/version.ts","../database/src/realtime/WebSocketConnection.ts","../database/src/realtime/TransportManager.ts","../database/src/realtime/Connection.ts","../database/src/core/ServerActions.ts","../database/src/core/PersistentConnection.ts","../database/src/core/ReadonlyRestClient.ts","../util/src/query.ts","../database/src/core/Repo.ts","../database/src/core/view/filter/RangedFilter.ts","../database/src/core/view/filter/LimitedFilter.ts","../database/src/core/view/QueryParams.ts","../database/src/api/Reference.ts","../database/src/core/util/Tree.ts","../database/src/core/Repo_transaction.ts","../database/src/core/RepoManager.ts","../database/src/api/Database.ts","../database/src/api/internal.ts","../database/src/api/test_access.ts","../database/index.ts"],"sourcesContent":["/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n }\r\n return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) if (e.indexOf(p[i]) < 0)\r\n t[p[i]] = s[p[i]];\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 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) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n if (m) return m.call(o);\r\n 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}\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 __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","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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\n// Static lookup maps, lazily populated by init_()\nclass Base64 {\n /**\n * Maps bytes to characters.\n */\n byteToCharMap_: { [key: number]: string } | null = null;\n\n /**\n * Maps characters to bytes.\n */\n charToByteMap_: { [key: string]: number } | null = null;\n\n /**\n * Maps bytes to websafe characters.\n */\n byteToCharMapWebSafe_: { [key: number]: string } | null = null;\n\n /**\n * Maps websafe characters to bytes.\n */\n charToByteMapWebSafe_: { [key: string]: number } | null = null;\n\n /**\n * Our default alphabet shared between\n * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n */\n ENCODED_VALS_BASE: string =\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789';\n\n /**\n * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n */\n get ENCODED_VALS(): string {\n return this.ENCODED_VALS_BASE + '+/=';\n }\n\n /**\n * Our websafe alphabet.\n */\n get ENCODED_VALS_WEBSAFE(): string {\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 HAS_NATIVE_SUPPORT: boolean = 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_(): void {\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\nexport const base64 = new Base64();\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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(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\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 {\n promise: Promise;\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 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/**\n * Detect whether the current SDK build is the Node version.\n *\n * @return true if it's the Node SDK build.\n */\nexport function isNodeSdk(): boolean {\n return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 = {\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('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 = {\n readonly [K in ErrorCode]: string\n};\n\nconst ERROR_NAME = 'FirebaseError';\n\nexport interface StringLike {\n toString(): string;\n}\n\nexport interface ErrorData {\n [key: string]: StringLike | undefined;\n}\n\nexport interface FirebaseError extends Error, ErrorData {\n // Unique code for error - format is service/error-code-string.\n readonly code: string;\n\n // Developer-friendly error message.\n readonly message: string;\n\n // Always 'FirebaseError'.\n readonly name: typeof ERROR_NAME;\n\n // Where available - stack backtrace in a string.\n readonly stack?: string;\n}\n\n// Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\nexport class FirebaseError extends Error {\n readonly name = ERROR_NAME;\n\n constructor(readonly code: string, message: string) {\n super(message);\n\n // Fix For ES5\n // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n Object.setPrototypeOf(this, FirebaseError.prototype);\n\n // Maintains proper stack trace for where our error was thrown.\n // Only available on V8.\n if (Error.captureStackTrace) {\n Error.captureStackTrace(this, ErrorFactory.prototype.create);\n }\n }\n}\n\nexport class ErrorFactory<\n ErrorCode extends string,\n ErrorParams extends { readonly [K in ErrorCode]?: ErrorData } = {}\n> {\n constructor(\n private readonly service: string,\n private readonly serviceName: string,\n private readonly errors: ErrorMap\n ) {}\n\n create(\n code: K,\n ...data: K extends keyof ErrorParams ? [ErrorParams[K]] : []\n ): FirebaseError {\n const customData = (data[0] as ErrorData) || {};\n const fullCode = `${this.service}/${code}`;\n const template = this.errors[code];\n\n const message = template ? replaceTemplate(template, customData) : 'Error';\n // Service Name: Error message (service/code).\n const fullMessage = `${this.serviceName}: ${message} (${fullCode}).`;\n\n const error = new FirebaseError(fullCode, fullMessage);\n\n // Keys with an underscore at the end of their name are not included in\n // error.data for some reason.\n // TODO: Replace with Object.entries when lib is updated to es2017.\n for (const key of Object.keys(customData)) {\n if (key.slice(-1) !== '_') {\n if (key in error) {\n console.warn(\n `Overwriting FirebaseError base field \"${key}\" can cause unexpected behavior.`\n );\n }\n error[key] = customData[key];\n }\n }\n\n return error;\n }\n}\n\nfunction replaceTemplate(template: string, data: ErrorData): string {\n return template.replace(PATTERN, (_, key) => {\n const value = data[key];\n return value != null ? value.toString() : `<${key}?>`;\n });\n}\n\nconst PATTERN = /\\{\\$([^}]+)}/g;\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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(obj: T, key: keyof T): boolean {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexport function safeGet(\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(\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 * 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\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 * 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 switch (logType) {\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 */\n case LogLevel.DEBUG:\n console.log(`[${now}] ${instance.name}:`, ...args);\n break;\n case LogLevel.VERBOSE:\n console.log(`[${now}] ${instance.name}:`, ...args);\n break;\n case LogLevel.INFO:\n console.info(`[${now}] ${instance.name}:`, ...args);\n break;\n case LogLevel.WARN:\n console.warn(`[${now}] ${instance.name}:`, ...args);\n break;\n case LogLevel.ERROR:\n console.error(`[${now}] ${instance.name}:`, ...args);\n break;\n default:\n throw new Error(\n `Attempted to log a message with an invalid logType (value: ${logType})`\n );\n }\n};\n\nexport class Logger {\n /**\n * Gives you an instance of a Logger to capture messages according to\n * Firebase's logging scheme.\n *\n * @param name The name that the logs will be associated with\n */\n constructor(public name: string) {\n /**\n * Capture the current instance for later use\n */\n instances.push(this);\n }\n\n /**\n * The log level of the given Logger instance.\n */\n private _logLevel = defaultLogLevel;\n get logLevel(): LogLevel {\n return this._logLevel;\n }\n set logLevel(val: LogLevel) {\n if (!(val in LogLevel)) {\n throw new TypeError('Invalid value assigned to `logLevel`');\n }\n this._logLevel = val;\n }\n\n /**\n * The log handler for the Logger instance.\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 functions below are all based on the `console` interface\n */\n\n debug(...args: unknown[]): void {\n this._logHandler(this, LogLevel.DEBUG, ...args);\n }\n log(...args: unknown[]): void {\n this._logHandler(this, LogLevel.VERBOSE, ...args);\n }\n info(...args: unknown[]): void {\n this._logHandler(this, LogLevel.INFO, ...args);\n }\n warn(...args: unknown[]): void {\n this._logHandler(this, LogLevel.WARN, ...args);\n }\n error(...args: unknown[]): void {\n this._logHandler(this, LogLevel.ERROR, ...args);\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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\ndeclare const window: any;\ndeclare const Windows: any;\n\nimport { assert } from '@firebase/util';\nimport { base64 } from '@firebase/util';\nimport { Sha1 } from '@firebase/util';\nimport { stringToByteArray } from '@firebase/util';\nimport { stringify } from '@firebase/util';\nimport { SessionStorage } from '../storage/storage';\nimport { isNodeSdk } from '@firebase/util';\nimport { Logger, LogLevel } from '@firebase/logger';\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 {...*} var_args\n * @return {string}\n * @private\n */\nconst buildLogMessage_ = function(...var_args: any[]): string {\n let message = '';\n for (let i = 0; i < var_args.length; i++) {\n if (\n Array.isArray(var_args[i]) ||\n (var_args[i] &&\n typeof var_args[i] === 'object' &&\n typeof var_args[i].length === 'number')\n ) {\n message += buildLogMessage_.apply(null, var_args[i]);\n } else if (typeof var_args[i] === 'object') {\n message += stringify(var_args[i]);\n } else {\n message += var_args[i];\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) SessionStorage.set('logging_enabled', true);\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)} var_args\n */\nexport const log = function(...var_args: string[]) {\n if (firstLog_ === true) {\n firstLog_ = false;\n if (logger === null && SessionStorage.get('logging_enabled') === true)\n enableLogging(true);\n }\n\n if (logger) {\n const message = buildLogMessage_.apply(null, var_args);\n logger(message);\n }\n};\n\n/**\n * @param {!string} prefix\n * @return {function(...[*])}\n */\nexport const logWrapper = function(\n prefix: string\n): (...var_args: any[]) => void {\n return function(...var_args: any[]) {\n log(prefix, ...var_args);\n };\n};\n\n/**\n * @param {...string} var_args\n */\nexport const error = function(...var_args: string[]) {\n const message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_(...var_args);\n logClient.error(message);\n};\n\n/**\n * @param {...string} var_args\n */\nexport const fatal = function(...var_args: string[]) {\n const message = `FIREBASE FATAL ERROR: ${buildLogMessage_(...var_args)}`;\n logClient.error(message);\n throw new Error(message);\n};\n\n/**\n * @param {...*} var_args\n */\nexport const warn = function(...var_args: any[]) {\n const message = 'FIREBASE WARNING: ' + buildLogMessage_(...var_args);\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: any): 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 let 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 } else if ((document as any).attachEvent) {\n // IE.\n (document as any).attachEvent('onreadystatechange', function() {\n if (document.readyState === 'complete') wrappedFn();\n });\n // fallback to onload.\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]: any }\n): any {\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: any): string {\n if (typeof obj !== 'object' || obj === null) return stringify(obj);\n\n const keys = [];\n for (let 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) key += ',';\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.} 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: any) => 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: any) => 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 let bias = (1 << (ebits - 1)) - 1,\n s,\n e,\n f,\n ln,\n i,\n bits,\n str;\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 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 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) hexByte = '0' + hexByte;\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 (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('^-?\\\\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(function() {\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 {...*} var_args Arbitrary args to be passed to opt_onComplete\n */\nexport const callUserCallback = function(\n callback?: Function | null,\n ...var_args: any[]\n) {\n if (typeof callback === 'function') {\n exceptionGuard(function() {\n callback(...var_args);\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: () => any\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 if (typeof timeout === 'object' && (timeout as any)['unref']) {\n (timeout as any)['unref']();\n }\n return timeout;\n};\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any | 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): any {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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]: any } = {};\n\n set(key: string, value: any | null) {\n if (value == null) {\n delete this.cache_[key];\n } else {\n this.cache_[key] = value;\n }\n }\n\n get(key: string): any {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any;\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.} 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) return null;\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 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] !== '') pathString += '/' + this.pieces_[i];\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 return pathString || '/';\n }\n\n /**\n * Shallow copy of the parts of the path.\n *\n * @param {number=} begin\n * @return {!Array}\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) return null;\n\n const pieces = [];\n for (let i = this.pieceNum_; i < this.pieces_.length - 1; i++)\n pieces.push(this.pieces_[i]);\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 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) pieces.push(childPieces[i]);\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) return cmp;\n }\n if (leftKeys.length === rightKeys.length) return 0;\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} */\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} */\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport const PROTOCOL_VERSION = '5';\n\nexport const VERSION_PARAM = 'v';\n\nexport const TRANSPORT_SESSION_PARAM = 's';\n\nexport const REFERER_PARAM = 'r';\n\nexport const FORGE_REF = 'f';\n\nexport const FORGE_DOMAIN = 'firebaseio.com';\n\nexport const LAST_SESSION_PARAM = 'ls';\n\nexport const WEBSOCKET = 'websocket';\n\nexport const LONG_POLLING = 'long_polling';\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 ) {\n this.host = host.toLowerCase();\n this.domain = this.host.substr(this.host.indexOf('.') + 1);\n this.internalHost = PersistentStorage.get('host:' + host) || this.host;\n }\n\n needsQueryParam(): boolean {\n return this.host !== this.internalHost || this.isCustomHost();\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 let 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 = parseURL(dataURL),\n namespace = parsedUrl.subdomain;\n\n if (parsedUrl.domain === 'firebase') {\n fatal(\n parsedUrl.host +\n ' is no longer supported. ' +\n 'Please use .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://.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 ),\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}}\n */\nexport const parseURL = 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} {\n // Default to empty strings in the event of a malformed string.\n let host = '',\n domain = '',\n subdomain = '',\n pathString = '';\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 let 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 = dataURL.length;\n }\n\n const parts = host.split('.');\n if (parts.length === 3) {\n // Normalize namespaces to lowercase to share storage / connection.\n domain = parts[1];\n subdomain = parts[0].toLowerCase();\n } else if (parts.length === 2) {\n domain = parts[0];\n } else if (parts[0].slice(0, colonInd).toLowerCase() === 'localhost') {\n domain = 'localhost';\n }\n // Support `ns` query param if subdomain not already set\n if (subdomain === '' && 'ns' in queryParams) {\n subdomain = queryParams['ns'];\n }\n }\n\n return {\n host,\n port,\n domain,\n subdomain,\n secure,\n scheme,\n pathString\n };\n};\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '../util/util';\nimport { contains } from '@firebase/util';\nimport { Node } from './Node';\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 return 'string:' + priority;\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' &&\n contains(val as { [key: string]: unknown }, '.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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { contains, safeGet } from '@firebase/util';\nimport { isInvalidJSONNumber, each } from './util';\nimport { errorPrefix as errorPrefixFxn } from '@firebase/util';\nimport { stringLength } from '@firebase/util';\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: any): 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: any): boolean {\n return (\n priority === null ||\n typeof priority === 'string' ||\n (typeof priority === 'number' && !isInvalidJSONNumber(priority)) ||\n (priority && typeof priority === 'object' && contains(priority, '.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: any,\n path: Path,\n optional: boolean\n) {\n if (optional && data === undefined) return;\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: any,\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, function(key: string, value: any) {\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} 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: any,\n path: Path,\n optional: boolean\n) {\n if (optional && data === undefined) return;\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, function(key: string, value: any) {\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: any,\n optional: boolean\n) {\n if (optional && priority === undefined) return;\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 // 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\nexport const validateEventType = function(\n fnName: string,\n argumentNumber: number,\n eventType: string,\n optional: boolean\n) {\n if (optional && eventType === undefined) return;\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) return;\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\nexport const validatePathString = function(\n fnName: string,\n argumentNumber: number,\n pathString: string,\n optional: boolean\n) {\n if (optional && pathString === undefined) return;\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\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: any,\n optional: boolean\n) {\n if (optional && cred === undefined) return;\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\nexport const validateBoolean = function(\n fnName: string,\n argumentNumber: number,\n bool: any,\n optional: boolean\n) {\n if (optional && bool === undefined) return;\n if (typeof bool !== 'boolean')\n throw new Error(\n errorPrefixFxn(fnName, argumentNumber, optional) + 'must be a boolean.'\n );\n};\n\nexport const validateString = function(\n fnName: string,\n argumentNumber: number,\n string: any,\n optional: boolean\n) {\n if (optional && string === undefined) return;\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: any,\n optional: boolean\n) {\n if (optional && obj === undefined) return;\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: any,\n key: string,\n optional: boolean,\n opt_type?: string\n) {\n const objectContainsKey =\n obj && typeof obj === 'object' && contains(obj, 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 (opt_type) {\n const val = safeGet(obj, key);\n if (\n (opt_type === 'number' && !(typeof val === 'number')) ||\n (opt_type === 'string' && !(typeof val === 'string')) ||\n (opt_type === 'boolean' && !(typeof val === 'boolean')) ||\n (opt_type === 'function' && !(typeof val === 'function')) ||\n (opt_type === '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 opt_type +\n '\")'\n );\n } else {\n throw new Error(\n errorPrefixFxn(fnName, argumentNumber, optional) +\n 'must contain the key \"' +\n key +\n '\" with type \"' +\n opt_type +\n '\"'\n );\n }\n }\n }\n};\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 {\n validateWritablePath,\n validateFirebaseDataArg,\n validatePriority,\n validateFirebaseMergeDataArg\n} from '../core/util/validation';\nimport { warn } from '../core/util/util';\nimport { Deferred } from '@firebase/util';\nimport { Repo } from '../core/Repo';\nimport { Path } from '../core/util/Path';\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 {\n validateArgCount('OnDisconnect.cancel', 0, 1, arguments.length);\n validateCallback('OnDisconnect.cancel', 1, onComplete, true);\n const deferred = new Deferred();\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 {\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();\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: any, onComplete?: (a: Error | null) => void): Promise {\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();\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: any,\n priority: number | string | null,\n onComplete?: (a: Error | null) => void\n ): Promise {\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();\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: object,\n onComplete?: (a: Error | null) => void\n ): Promise {\n validateArgCount('OnDisconnect.update', 1, 2, arguments.length);\n validateWritablePath('OnDisconnect.update', this.path_);\n if (Array.isArray(objectToMerge)) {\n const newObjectToMerge: { [k: string]: any } = {};\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();\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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): any;\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 {\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 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: any, 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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';\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.}\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 | object,\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): any {\n return false;\n }\n\n /**\n * @inheritDoc\n */\n val(exportFormat?: boolean): Object {\n if (exportFormat && !this.getPriority().isEmpty())\n return {\n '.value': this.getValue(),\n '.priority': this.getPriority().val()\n };\n else return this.getValue();\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 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(): object | 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any) => Node;\nlet MAX_NODE: Node;\n\nexport function setNodeFromJSON(val: (a: any) => 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 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: any, 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { buildChildSet } from './childSet';\nimport { contains, map, safeGet } from '@firebase/util';\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 | /*FallbackType*/ object;\n },\n private indexSet_: { [k: string]: Index }\n ) {}\n\n get(indexKey: string): SortedMap | null {\n const sortedMap = safeGet(this.indexes_, indexKey);\n if (!sortedMap) throw new Error('No index defined for ' + indexKey);\n\n if (sortedMap instanceof SortedMap) {\n return sortedMap;\n } else {\n // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\n // regular child map\n return null;\n }\n }\n\n hasIndex(indexDefinition: Index): boolean {\n return contains(this.indexSet_, indexDefinition.toString());\n }\n\n addIndex(\n indexDefinition: Index,\n existingChildren: SortedMap\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\n ): IndexMap {\n const newIndexes = map(\n this.indexes_,\n (indexedChildren: SortedMap, 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\n ): IndexMap {\n const newIndexes = map(this.indexes_, function(\n indexedChildren: SortedMap\n ) {\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 return new IndexMap(newIndexes, this.indexSet_);\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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,\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(NAME_COMPARATOR),\n null,\n IndexMap.Default\n ))\n );\n }\n\n /**\n *\n * @param {!SortedMap.} 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,\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) return this;\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, newPriority;\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 newPriority = newChildren.isEmpty() ? EMPTY_NODE : 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()) return null;\n\n const obj: { [k: string]: unknown } = {};\n let numKeys = 0,\n maxKey = 0,\n allIntegerKeys = true;\n this.forEachChild(PRIORITY_INDEX, function(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 for (let key in obj) array[(key as any) as number] = obj[key];\n\n return array;\n } else {\n if (exportFormat && !this.getPriority().isEmpty()) {\n obj['.priority'] = this.getPriority().val();\n }\n return obj;\n }\n }\n\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 this.forEachChild(PRIORITY_INDEX, function(key, childNode) {\n const childHash = childNode.hash();\n if (childHash !== '') toHash += ':' + key + ':' + childHash;\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(function(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 {\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 {\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 {\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 {\n const idx = this.resolveIndex_(indexDefinition);\n if (idx) {\n return idx.getReverseIteratorFrom(endPost, function(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.}\n */\n private resolveIndex_(\n indexDefinition: Index\n ): SortedMap | 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(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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 = (key1: K, key2: K) => number;\n\n/**\n * An iterator over an LLRBNode.\n */\nexport class SortedMapIterator {\n /** @private\n * @type {Array.}\n */\n private nodeStack_: (LLRBNode | LLRBEmptyNode)[] = [];\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 | LLRBEmptyNode,\n startKey: K | null,\n comparator: Comparator,\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;\n cmp = startKey ? comparator(node.key, startKey) : 1;\n // flip the comparison if we're going in reverse\n if (isReverse_) cmp *= -1;\n\n if (cmp < 0) {\n // This node is less than our start key. ignore it\n if (this.isReverse_) {\n node = node.left;\n } else {\n node = node.right;\n }\n } else if (cmp === 0) {\n // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\n this.nodeStack_.push(node);\n break;\n } else {\n // This node is greater than our start key, add it to the stack and move to the next one\n this.nodeStack_.push(node);\n if (this.isReverse_) {\n node = node.right;\n } else {\n node = node.left;\n }\n }\n }\n }\n\n getNext(): T {\n if (this.nodeStack_.length === 0) return null;\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 result = { key: node.key, value: node.value } as any;\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) return null;\n\n const node = this.nodeStack_[this.nodeStack_.length - 1];\n if (this.resultGenerator_) {\n return this.resultGenerator_(node.key, node.value);\n } else {\n return { key: node.key, value: node.value } as any;\n }\n }\n}\n\n/**\n * Represents a node in a Left-leaning Red-Black tree.\n */\nexport class LLRBNode {\n color: boolean;\n left: LLRBNode | LLRBEmptyNode;\n right: LLRBNode | LLRBEmptyNode;\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 | LLRBEmptyNode | null,\n right?: LLRBNode | LLRBEmptyNode | null\n ) {\n this.color = color != null ? color : LLRBNode.RED;\n this.left =\n left != null ? left : (SortedMap.EMPTY_NODE as LLRBEmptyNode);\n this.right =\n right != null ? right : (SortedMap.EMPTY_NODE as LLRBEmptyNode);\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 | LLRBEmptyNode | null,\n right: LLRBNode | LLRBEmptyNode | null\n ): LLRBNode {\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) => any): 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 {\n if (this.left.isEmpty()) {\n return this;\n } else {\n return (this.left as LLRBNode).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): LLRBNode {\n let cmp, n;\n n = this;\n 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 | LLRBEmptyNode {\n if (this.left.isEmpty()) {\n return SortedMap.EMPTY_NODE as LLRBEmptyNode;\n }\n let n: LLRBNode = this;\n if (!n.left.isRed_() && !n.left.left.isRed_()) n = n.moveRedLeft_();\n n = n.copy(null, null, null, (n.left as LLRBNode).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\n ): LLRBNode | LLRBEmptyNode {\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.rotateRight_();\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;\n } else {\n smallest = (n.right as LLRBNode).min_();\n n = n.copy(\n smallest.key,\n smallest.value,\n null,\n null,\n (n.right as LLRBNode).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 {\n let n = this as any;\n if (n.right.isRed_() && !n.left.isRed_()) n = n.rotateLeft_();\n if (n.left.isRed_() && n.left.left.isRed_()) n = n.rotateRight_();\n if (n.left.isRed_() && n.right.isRed_()) n = n.colorFlip_();\n return n;\n }\n\n /**\n * @private\n * @return {!LLRBNode} New tree, after moveRedLeft.\n */\n private moveRedLeft_(): LLRBNode {\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).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 {\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 {\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;\n }\n\n /**\n * @private\n * @return {!LLRBNode} New tree, after rotateRight.\n */\n private rotateRight_(): LLRBNode {\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;\n }\n\n /**\n * @private\n * @return {!LLRBNode} New tree, after colorFlip.\n */\n private colorFlip_(): LLRBNode {\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 let blackDepth;\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 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 {\n key: K;\n value: V;\n left: LLRBNode | LLRBEmptyNode;\n right: LLRBNode | LLRBEmptyNode;\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 | LLRBEmptyNode | null,\n right: LLRBNode | LLRBEmptyNode | null\n ): LLRBEmptyNode {\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): LLRBNode {\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): LLRBEmptyNode {\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) => any): 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 {\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,\n private root_:\n | LLRBNode\n | LLRBEmptyNode = SortedMap.EMPTY_NODE as LLRBEmptyNode\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.} New map, with item added.\n */\n insert(key: K, value: V): SortedMap {\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.} New map, with item removed.\n */\n remove(key: K): SortedMap {\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()) node = node.right;\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) => any): 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.} The iterator.\n */\n getIterator(\n resultGenerator?: (k: K, v: V) => T\n ): SortedMapIterator {\n return new SortedMapIterator(\n this.root_,\n null,\n this.comparator_,\n false,\n resultGenerator\n );\n }\n\n getIteratorFrom(\n key: K,\n resultGenerator?: (k: K, v: V) => T\n ): SortedMapIterator {\n return new SortedMapIterator(\n this.root_,\n key,\n this.comparator_,\n false,\n resultGenerator\n );\n }\n\n getReverseIteratorFrom(\n key: K,\n resultGenerator?: (k: K, v: V) => T\n ): SortedMapIterator {\n return new SortedMapIterator(\n this.root_,\n key,\n this.comparator_,\n true,\n resultGenerator\n );\n }\n\n getReverseIterator(\n resultGenerator?: (k: K, v: V) => T\n ): SortedMapIterator {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '../util/SortedMap';\nimport { SortedMap } from '../util/SortedMap';\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 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.} 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.}\n */\nexport const buildChildSet = function(\n childList: NamedNode[],\n cmp: (a: NamedNode, b: NamedNode) => number,\n keyFn?: (a: NamedNode) => K,\n mapSortFn?: (a: K, b: K) => number\n): SortedMap {\n childList.sort(cmp);\n\n const buildBalancedTree = function(\n low: number,\n high: number\n ): LLRBNode | 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 any) as K);\n return new LLRBNode(\n key,\n (namedNode.node as any) as V,\n LLRBNode.BLACK,\n null,\n null\n );\n } else {\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 any) as K);\n return new LLRBNode(\n key,\n (namedNode.node as any) as V,\n LLRBNode.BLACK,\n left,\n right\n );\n }\n };\n\n const buildFrom12Array = function(base12: Base12Num): LLRBNode {\n let node: LLRBNode = 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 any) as K);\n attachPennant(\n new LLRBNode(key, (namedNode.node as any) as V, color, null, childTree)\n );\n };\n\n const attachPennant = function(pennant: LLRBNode) {\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\n return new SortedMap(mapSortFn || (cmp as any), root);\n};\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '@firebase/util';\nimport { assert } from '@firebase/util';\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';\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: any | null,\n priority: string | number | null = 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 | object;\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: { [k: string]: any } = 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;\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: any) => {\n if (contains(json, key)) {\n if (key.substring(0, 1) !== '.') {\n // ignore metadata nodes.\n const childNode = nodeFromJSON(childData);\n if (childNode.isLeafNode() || !childNode.isEmpty())\n node = node.updateImmediateChild(key, childNode);\n }\n }\n });\n\n return node.updatePriority(nodeFromJSON(priority));\n }\n}\n\nsetNodeFromJSON(nodeFromJSON);\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 return (NamedNode as any).MIN;\n }\n\n /**\n * @inheritDoc\n */\n maxPost(): NamedNode {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { 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';\nimport {\n errorPrefix,\n validateArgCount,\n validateCallback,\n validateContextObject\n} from '@firebase/util';\nimport {\n ValueEventRegistration,\n ChildEventRegistration,\n EventRegistration\n} from '../core/view/EventRegistration';\nimport { Deferred } from '@firebase/util';\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): any;\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) => any) | 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.} callbacks\n * @param {?function(Error)} cancelCallback\n * @param {?Object} context\n * @protected\n */\n onChildEvent(\n callbacks: { [k: string]: SnapshotCallback },\n cancelCallback: ((a: Error) => any) | 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 {\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();\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) ret.cancel.bind(ret.context)(err);\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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(): any {\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(): any {\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(): any {\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()) return false;\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()) return false;\n else return !this.node_.isEmpty();\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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\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:\n | 'value'\n | ' child_added'\n | ' child_changed'\n | ' child_moved'\n | ' child_removed',\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from './Event';\nimport { contains } from '@firebase/util';\nimport { assert } from '@firebase/util';\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_: Object | 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.} 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_?: Object\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 any,\n this,\n new DataSnapshot(change.snapshotNode, ref, index as any),\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 = 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, function(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) => any) {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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';\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]: any;\n } | null\n): { [k: string]: any } {\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 resolveDeferredValue = function(\n value: { [k: string]: any } | string | number | boolean,\n serverValues: { [k: string]: any }\n): string | number | boolean {\n if (!value || typeof value !== 'object') {\n return value as string | number | boolean;\n } else {\n assert('.sv' in value, 'Unexpected leaf node or priority contents');\n return serverValues[value['.sv']];\n }\n};\n\n/**\n * Recursively replace all deferred values and priorities in the tree with the\n * specified generated replacement values.\n * @param {!SparseSnapshotTree} tree\n * @param {!Object} serverValues\n * @return {!SparseSnapshotTree}\n */\nexport const resolveDeferredValueTree = function(\n tree: SparseSnapshotTree,\n serverValues: Object\n): SparseSnapshotTree {\n const resolvedTree = new SparseSnapshotTree();\n tree.forEachTree(new Path(''), function(path, node) {\n resolvedTree.remember(\n path,\n resolveDeferredValueSnapshot(node, serverValues)\n );\n });\n return resolvedTree;\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 serverValues: Object\n): Node {\n const rawPri = node.getPriority().val() as\n | object\n | boolean\n | null\n | number\n | string;\n const priority = resolveDeferredValue(rawPri, serverValues);\n let newNode: Node;\n\n if (node.isLeafNode()) {\n const leafNode = node as LeafNode;\n const value = resolveDeferredValue(leafNode.getValue(), serverValues);\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, function(childName, childNode) {\n const newChildNode = resolveDeferredValueSnapshot(\n childNode,\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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>;\n\n/**\n * Singleton empty children collection.\n *\n * @const\n * @type {!SortedMap.>}\n */\nconst EmptyChildren = (): SortedMap> => {\n if (!emptyChildrenSingleton) {\n emptyChildrenSingleton = new SortedMap>(\n stringCompare\n );\n }\n return emptyChildrenSingleton;\n};\n\n/**\n * A tree with immutable elements.\n */\nexport class ImmutableTree {\n static Empty = new ImmutableTree(null);\n\n /**\n * @template T\n * @param {!Object.} obj\n * @return {!ImmutableTree.}\n */\n static fromObject(obj: { [k: string]: T }): ImmutableTree {\n let tree: ImmutableTree = 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.>=} children\n */\n constructor(\n public readonly value: T | null,\n public readonly children: SortedMap<\n string,\n ImmutableTree\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.} The subtree at the given path\n */\n subtree(relativePath: Path): ImmutableTree {\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.} Resulting tree.\n */\n set(relativePath: Path, toSet: T | null): ImmutableTree {\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.} Resulting tree.\n */\n remove(relativePath: Path): ImmutableTree {\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): ImmutableTree {\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.):V} fn\n * @return {V}\n */\n fold(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.):V} fn\n * @return {V}\n * @private\n */\n private fold_(\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(function(\n childKey: string,\n childTree: ImmutableTree\n ) {\n accum[childKey] = childTree.fold_(pathSoFar.child(childKey), fn);\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(path: Path, f: (path: Path, value: T) => V | null): V | null {\n return this.findOnPath_(path, Path.Empty, f);\n }\n\n private findOnPath_(\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.}\n */\n foreachOnPath(\n path: Path,\n f: (path: Path, value: T) => void\n ): ImmutableTree {\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 {\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(function(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) => {\n if (childTree.value) {\n f(childName, childTree.value);\n }\n }\n );\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 = 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.} 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., events:!Array.}} removed queries and any cancel events\n */\n removeEventRegistration(\n query: Query,\n eventRegistration: EventRegistration | null,\n cancelError?: Error\n ): { removed: Query[]; events: Event[] } {\n const queryId = query.queryIdentifier();\n const removed: Query[] = [];\n let cancelEvents: Event[] = [];\n const hadCompleteView = this.hasCompleteView();\n if (queryId === 'default') {\n // When you do ref.off(...), we search all views for the registration to remove.\n for (const [viewQueryId, view] of this.views.entries()) {\n cancelEvents = cancelEvents.concat(\n view.removeEventRegistration(eventRegistration, cancelError)\n );\n if (view.isEmpty()) {\n this.views.delete(viewQueryId);\n\n // We'll deal with complete views later.\n if (\n !view\n .getQuery()\n .getQueryParams()\n .loadsAllData()\n ) {\n removed.push(view.getQuery());\n }\n }\n }\n } else {\n // remove the callback from the specific view.\n const view = this.views.get(queryId);\n if (view) {\n cancelEvents = cancelEvents.concat(\n view.removeEventRegistration(eventRegistration, cancelError)\n );\n if (view.isEmpty()) {\n this.views.delete(queryId);\n\n // We'll deal with complete views later.\n if (\n !view\n .getQuery()\n .getQueryParams()\n .loadsAllData()\n ) {\n removed.push(view.getQuery());\n }\n }\n }\n }\n\n if (hadCompleteView && !this.hasCompleteView()) {\n // We removed our last complete view.\n removed.push(\n new SyncPoint.__referenceConstructor(query.repo, query.path)\n );\n }\n\n return { removed: removed, events: cancelEvents };\n }\n\n getQueryViews(): View[] {\n const result = [];\n for (const view of this.views.values()) {\n if (\n !view\n .getQuery()\n .getQueryParams()\n .loadsAllData()\n ) {\n result.push(view);\n }\n }\n return result;\n }\n\n /**\n * @param path The path to the desired complete snapshot\n * @return A complete cache, if it exists\n */\n getCompleteServerCache(path: Path): Node | null {\n let serverCache: Node | null = null;\n for (const view of this.views.values()) {\n serverCache = serverCache || view.getCompleteServerCache(path);\n }\n return serverCache;\n }\n\n viewForQuery(query: Query): View | null {\n const params = query.getQueryParams();\n if (params.loadsAllData()) {\n return this.getCompleteView();\n } else {\n const queryId = query.queryIdentifier();\n return this.views.get(queryId);\n }\n }\n\n viewExistsForQuery(query: Query): boolean {\n return this.viewForQuery(query) != null;\n }\n\n hasCompleteView(): boolean {\n return this.getCompleteView() != null;\n }\n\n getCompleteView(): View | null {\n for (const view of this.views.values()) {\n if (\n view\n .getQuery()\n .getQueryParams()\n .loadsAllData()\n ) {\n return view;\n }\n }\n return null;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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} 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,\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.} 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\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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, function(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, function(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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 = 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 */\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.} changes\n */\n constructor(\n public readonly viewCache: ViewCache,\n public readonly changes: Change[]\n ) {}\n}\n\n/**\n * @constructor\n */\nexport class ViewProcessor {\n /**\n * @param {!NodeFilter} filter_\n */\n constructor(private readonly filter_: NodeFilter) {}\n\n /**\n * @param {!ViewCache} viewCache\n */\n assertIndexed(viewCache: ViewCache) {\n assert(\n viewCache\n .getEventCache()\n .getNode()\n .isIndexed(this.filter_.getIndex()),\n 'Event snap not indexed'\n );\n assert(\n viewCache\n .getServerCache()\n .getNode()\n .isIndexed(this.filter_.getIndex()),\n 'Server snap not indexed'\n );\n }\n\n /**\n * @param {!ViewCache} oldViewCache\n * @param {!Operation} operation\n * @param {!WriteTreeRef} writesCache\n * @param {?Node} completeCache\n * @return {!ProcessorResult}\n */\n applyOperation(\n oldViewCache: ViewCache,\n operation: Operation,\n writesCache: WriteTreeRef,\n completeCache: Node | null\n ): ProcessorResult {\n const accumulator = new ChildChangeAccumulator();\n let newViewCache, filterServerNode;\n if (operation.type === OperationType.OVERWRITE) {\n const overwrite = operation as Overwrite;\n if (overwrite.source.fromUser) {\n newViewCache = this.applyUserOverwrite_(\n oldViewCache,\n overwrite.path,\n overwrite.snap,\n writesCache,\n completeCache,\n accumulator\n );\n } else {\n assert(overwrite.source.fromServer, 'Unknown source.');\n // We filter the node if it's a tagged update or the node has been previously filtered and the\n // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n // again\n filterServerNode =\n overwrite.source.tagged ||\n (oldViewCache.getServerCache().isFiltered() &&\n !overwrite.path.isEmpty());\n newViewCache = this.applyServerOverwrite_(\n oldViewCache,\n overwrite.path,\n overwrite.snap,\n writesCache,\n completeCache,\n filterServerNode,\n accumulator\n );\n }\n } else if (operation.type === OperationType.MERGE) {\n const merge = operation as Merge;\n if (merge.source.fromUser) {\n newViewCache = this.applyUserMerge_(\n oldViewCache,\n merge.path,\n merge.children,\n writesCache,\n completeCache,\n accumulator\n );\n } else {\n assert(merge.source.fromServer, 'Unknown source.');\n // We filter the node if it's a tagged update or the node has been previously filtered\n filterServerNode =\n merge.source.tagged || oldViewCache.getServerCache().isFiltered();\n newViewCache = this.applyServerMerge_(\n oldViewCache,\n merge.path,\n merge.children,\n writesCache,\n completeCache,\n filterServerNode,\n accumulator\n );\n }\n } else if (operation.type === OperationType.ACK_USER_WRITE) {\n const ackUserWrite = operation as AckUserWrite;\n if (!ackUserWrite.revert) {\n newViewCache = this.ackUserWrite_(\n oldViewCache,\n ackUserWrite.path,\n ackUserWrite.affectedTree,\n writesCache,\n completeCache,\n accumulator\n );\n } else {\n newViewCache = this.revertUserWrite_(\n oldViewCache,\n ackUserWrite.path,\n writesCache,\n completeCache,\n accumulator\n );\n }\n } else if (operation.type === OperationType.LISTEN_COMPLETE) {\n newViewCache = this.listenComplete_(\n oldViewCache,\n operation.path,\n writesCache,\n accumulator\n );\n } else {\n throw assertionError('Unknown operation type: ' + operation.type);\n }\n const changes = accumulator.getChanges();\n ViewProcessor.maybeAddValueEvent_(oldViewCache, newViewCache, changes);\n return new ProcessorResult(newViewCache, changes);\n }\n\n /**\n * @param {!ViewCache} oldViewCache\n * @param {!ViewCache} newViewCache\n * @param {!Array.} 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\n .getNode()\n .equals(/** @type {!Node} */ (oldCompleteSnap))) ||\n !eventSnap\n .getNode()\n .getPriority()\n .equals(oldCompleteSnap.getPriority())\n ) {\n accumulator.push(\n Change.valueChange(\n /** @type {!Node} */ newViewCache.getCompleteEventSnap()\n )\n );\n }\n }\n }\n\n /**\n * @param {!ViewCache} viewCache\n * @param {!Path} changePath\n * @param {!WriteTreeRef} writesCache\n * @param {!CompleteChildSource} source\n * @param {!ChildChangeAccumulator} accumulator\n * @return {!ViewCache}\n * @private\n */\n private generateEventCacheAfterServerEvent_(\n viewCache: ViewCache,\n changePath: Path,\n writesCache: WriteTreeRef,\n source: CompleteChildSource,\n accumulator: ChildChangeAccumulator\n ): ViewCache {\n const oldEventSnap = viewCache.getEventCache();\n if (writesCache.shadowingWrite(changePath) != null) {\n // we have a shadowing write, ignore changes\n return viewCache;\n } else {\n let newEventCache, serverNode;\n if (changePath.isEmpty()) {\n // TODO: figure out how this plays with \"sliding ack windows\"\n assert(\n viewCache.getServerCache().isFullyInitialized(),\n 'If change path is empty, we must have complete server data'\n );\n if (viewCache.getServerCache().isFiltered()) {\n // We need to special case this, because we need to only apply writes to complete children, or\n // we might end up raising events for incomplete children. If the server data is filtered deep\n // writes cannot be guaranteed to be complete\n const serverCache = viewCache.getCompleteServerSnap();\n const completeChildren =\n serverCache instanceof ChildrenNode\n ? serverCache\n : ChildrenNode.EMPTY_NODE;\n const completeEventChildren = writesCache.calcCompleteEventChildren(\n completeChildren\n );\n newEventCache = this.filter_.updateFullNode(\n viewCache.getEventCache().getNode(),\n completeEventChildren,\n accumulator\n );\n } else {\n const completeNode = writesCache.calcCompleteEventCache(\n viewCache.getCompleteServerSnap()\n );\n newEventCache = this.filter_.updateFullNode(\n viewCache.getEventCache().getNode(),\n completeNode,\n accumulator\n );\n }\n } else {\n const childKey = changePath.getFront();\n if (childKey == '.priority') {\n assert(\n changePath.getLength() == 1,\n \"Can't have a priority with additional path components\"\n );\n const oldEventNode = oldEventSnap.getNode();\n serverNode = viewCache.getServerCache().getNode();\n // we might have overwrites for this priority\n const updatedPriority = writesCache.calcEventCacheAfterServerOverwrite(\n changePath,\n oldEventNode,\n serverNode\n );\n if (updatedPriority != null) {\n newEventCache = this.filter_.updatePriority(\n oldEventNode,\n updatedPriority\n );\n } else {\n // priority didn't change, keep old node\n newEventCache = oldEventSnap.getNode();\n }\n } else {\n const childChangePath = changePath.popFront();\n // update child\n let newEventChild;\n if (oldEventSnap.isCompleteForChild(childKey)) {\n serverNode = viewCache.getServerCache().getNode();\n const eventChildUpdate = writesCache.calcEventCacheAfterServerOverwrite(\n changePath,\n oldEventSnap.getNode(),\n serverNode\n );\n if (eventChildUpdate != null) {\n newEventChild = oldEventSnap\n .getNode()\n .getImmediateChild(childKey)\n .updateChild(childChangePath, eventChildUpdate);\n } else {\n // Nothing changed, just keep the old child\n newEventChild = oldEventSnap\n .getNode()\n .getImmediateChild(childKey);\n }\n } else {\n newEventChild = writesCache.calcCompleteChild(\n childKey,\n viewCache.getServerCache()\n );\n }\n if (newEventChild != null) {\n newEventCache = this.filter_.updateChild(\n oldEventSnap.getNode(),\n childKey,\n newEventChild,\n childChangePath,\n source,\n accumulator\n );\n } else {\n // no complete child available or no change\n newEventCache = oldEventSnap.getNode();\n }\n }\n }\n return viewCache.updateEventSnap(\n newEventCache,\n oldEventSnap.isFullyInitialized() || changePath.isEmpty(),\n this.filter_.filtersNodes()\n );\n }\n }\n\n /**\n * @param {!ViewCache} oldViewCache\n * @param {!Path} changePath\n * @param {!Node} changedSnap\n * @param {!WriteTreeRef} writesCache\n * @param {?Node} completeCache\n * @param {boolean} filterServerNode\n * @param {!ChildChangeAccumulator} accumulator\n * @return {!ViewCache}\n * @private\n */\n applyServerOverwrite_(\n oldViewCache: ViewCache,\n changePath: Path,\n changedSnap: Node,\n writesCache: WriteTreeRef,\n completeCache: Node | null,\n filterServerNode: boolean,\n accumulator: ChildChangeAccumulator\n ): ViewCache {\n const oldServerSnap = oldViewCache.getServerCache();\n let newServerCache;\n const serverFilter = filterServerNode\n ? this.filter_\n : this.filter_.getIndexedFilter();\n if (changePath.isEmpty()) {\n newServerCache = serverFilter.updateFullNode(\n oldServerSnap.getNode(),\n changedSnap,\n null\n );\n } else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\n // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\n const newServerNode = oldServerSnap\n .getNode()\n .updateChild(changePath, changedSnap);\n newServerCache = serverFilter.updateFullNode(\n oldServerSnap.getNode(),\n newServerNode,\n null\n );\n } else {\n const childKey = changePath.getFront();\n if (\n !oldServerSnap.isCompleteForPath(changePath) &&\n changePath.getLength() > 1\n ) {\n // We don't update incomplete nodes with updates intended for other listeners\n return oldViewCache;\n }\n const childChangePath = changePath.popFront();\n const childNode = oldServerSnap.getNode().getImmediateChild(childKey);\n const newChildNode = childNode.updateChild(childChangePath, changedSnap);\n if (childKey == '.priority') {\n newServerCache = serverFilter.updatePriority(\n oldServerSnap.getNode(),\n newChildNode\n );\n } else {\n newServerCache = serverFilter.updateChild(\n oldServerSnap.getNode(),\n childKey,\n newChildNode,\n childChangePath,\n NO_COMPLETE_CHILD_SOURCE,\n null\n );\n }\n }\n const newViewCache = oldViewCache.updateServerSnap(\n newServerCache,\n oldServerSnap.isFullyInitialized() || changePath.isEmpty(),\n serverFilter.filtersNodes()\n );\n const source = new WriteTreeCompleteChildSource(\n writesCache,\n newViewCache,\n completeCache\n );\n return this.generateEventCacheAfterServerEvent_(\n newViewCache,\n changePath,\n writesCache,\n source,\n accumulator\n );\n }\n\n /**\n * @param {!ViewCache} oldViewCache\n * @param {!Path} changePath\n * @param {!Node} changedSnap\n * @param {!WriteTreeRef} writesCache\n * @param {?Node} completeCache\n * @param {!ChildChangeAccumulator} accumulator\n * @return {!ViewCache}\n * @private\n */\n applyUserOverwrite_(\n oldViewCache: ViewCache,\n changePath: Path,\n changedSnap: Node,\n writesCache: WriteTreeRef,\n completeCache: Node | null,\n accumulator: ChildChangeAccumulator\n ): ViewCache {\n const oldEventSnap = oldViewCache.getEventCache();\n let newViewCache, newEventCache;\n const source = new WriteTreeCompleteChildSource(\n writesCache,\n oldViewCache,\n completeCache\n );\n if (changePath.isEmpty()) {\n newEventCache = this.filter_.updateFullNode(\n oldViewCache.getEventCache().getNode(),\n changedSnap,\n accumulator\n );\n newViewCache = oldViewCache.updateEventSnap(\n newEventCache,\n true,\n this.filter_.filtersNodes()\n );\n } else {\n const childKey = changePath.getFront();\n if (childKey === '.priority') {\n newEventCache = this.filter_.updatePriority(\n oldViewCache.getEventCache().getNode(),\n changedSnap\n );\n newViewCache = oldViewCache.updateEventSnap(\n newEventCache,\n oldEventSnap.isFullyInitialized(),\n oldEventSnap.isFiltered()\n );\n } else {\n const childChangePath = changePath.popFront();\n const oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\n let newChild;\n if (childChangePath.isEmpty()) {\n // Child overwrite, we can replace the child\n newChild = changedSnap;\n } else {\n const childNode = source.getCompleteChild(childKey);\n if (childNode != null) {\n if (\n childChangePath.getBack() === '.priority' &&\n childNode.getChild(childChangePath.parent()).isEmpty()\n ) {\n // This is a priority update on an empty node. If this node exists on the server, the\n // server will send down the priority in the update, so ignore for now\n newChild = childNode;\n } else {\n newChild = childNode.updateChild(childChangePath, changedSnap);\n }\n } else {\n // There is no complete child node available\n newChild = ChildrenNode.EMPTY_NODE;\n }\n }\n if (!oldChild.equals(newChild)) {\n const newEventSnap = this.filter_.updateChild(\n oldEventSnap.getNode(),\n childKey,\n newChild,\n childChangePath,\n source,\n accumulator\n );\n newViewCache = oldViewCache.updateEventSnap(\n newEventSnap,\n oldEventSnap.isFullyInitialized(),\n this.filter_.filtersNodes()\n );\n } else {\n newViewCache = oldViewCache;\n }\n }\n }\n return newViewCache;\n }\n\n /**\n * @param {!ViewCache} viewCache\n * @param {string} childKey\n * @return {boolean}\n * @private\n */\n private static cacheHasChild_(\n viewCache: ViewCache,\n childKey: string\n ): boolean {\n return viewCache.getEventCache().isCompleteForChild(childKey);\n }\n\n /**\n * @param {!ViewCache} viewCache\n * @param {!Path} path\n * @param {ImmutableTree.} 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,\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.} merge\n * @return {!Node}\n * @private\n */\n private applyMerge_(node: Node, merge: ImmutableTree): Node {\n merge.foreach(function(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.} 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,\n writesCache: WriteTreeRef,\n serverCache: Node | null,\n filterServerNode: boolean,\n accumulator: ChildChangeAccumulator\n ): ViewCache {\n // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n // wait for the complete data update coming soon.\n if (\n viewCache\n .getServerCache()\n .getNode()\n .isEmpty() &&\n !viewCache.getServerCache().isFullyInitialized()\n ) {\n return viewCache;\n }\n\n // HACK: In the case of a limit query, there may be some changes that bump things out of the\n // window leaving room for new items. It's important we process these changes first, so we\n // iterate the changes twice, first processing any that affect items currently in view.\n // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n // and event snap. I'm not sure if this will result in edge cases when a child is in one but\n // not the other.\n let curViewCache = viewCache;\n let viewMergeTree;\n if (path.isEmpty()) {\n viewMergeTree = changedChildren;\n } else {\n viewMergeTree = ImmutableTree.Empty.setTree(path, changedChildren);\n }\n const serverNode = viewCache.getServerCache().getNode();\n viewMergeTree.children.inorderTraversal((childKey, childTree) => {\n if (serverNode.hasChild(childKey)) {\n const serverChild = viewCache\n .getServerCache()\n .getNode()\n .getImmediateChild(childKey);\n const newChild = this.applyMerge_(serverChild, childTree);\n curViewCache = this.applyServerOverwrite_(\n curViewCache,\n new Path(childKey),\n newChild,\n writesCache,\n serverCache,\n filterServerNode,\n accumulator\n );\n }\n });\n viewMergeTree.children.inorderTraversal((childKey, childMergeTree) => {\n const isUnknownDeepMerge =\n !viewCache.getServerCache().isCompleteForChild(childKey) &&\n childMergeTree.value == null;\n if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n const serverChild = viewCache\n .getServerCache()\n .getNode()\n .getImmediateChild(childKey);\n const newChild = this.applyMerge_(serverChild, childMergeTree);\n curViewCache = this.applyServerOverwrite_(\n curViewCache,\n new Path(childKey),\n newChild,\n writesCache,\n serverCache,\n filterServerNode,\n accumulator\n );\n }\n });\n\n return curViewCache;\n }\n\n /**\n * @param {!ViewCache} viewCache\n * @param {!Path} ackPath\n * @param {!ImmutableTree} 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,\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, function(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(function(mergePath, value) {\n const serverCachePath = ackPath.child(mergePath);\n if (serverCache.isCompleteForPath(serverCachePath)) {\n changedChildren = changedChildren.set(\n mergePath,\n serverCache.getNode().getChild(serverCachePath)\n );\n }\n });\n return this.applyServerMerge_(\n viewCache,\n ackPath,\n changedChildren,\n writesCache,\n completeCache,\n filterServerNode,\n accumulator\n );\n }\n }\n\n /**\n * @param {!ViewCache} viewCache\n * @param {!Path} path\n * @param {!WriteTreeRef} writesCache\n * @param {!ChildChangeAccumulator} accumulator\n * @return {!ViewCache}\n * @private\n */\n private listenComplete_(\n viewCache: ViewCache,\n path: Path,\n writesCache: WriteTreeRef,\n accumulator: ChildChangeAccumulator\n ): ViewCache {\n const oldServerNode = viewCache.getServerCache();\n const newViewCache = viewCache.updateServerSnap(\n oldServerNode.getNode(),\n oldServerNode.isFullyInitialized() || path.isEmpty(),\n oldServerNode.isFiltered()\n );\n return this.generateEventCacheAfterServerEvent_(\n newViewCache,\n path,\n writesCache,\n NO_COMPLETE_CHILD_SOURCE,\n accumulator\n );\n }\n\n /**\n * @param {!ViewCache} viewCache\n * @param {!Path} path\n * @param {!WriteTreeRef} writesCache\n * @param {?Node} completeServerCache\n * @param {!ChildChangeAccumulator} accumulator\n * @return {!ViewCache}\n * @private\n */\n private revertUserWrite_(\n viewCache: ViewCache,\n path: Path,\n writesCache: WriteTreeRef,\n completeServerCache: Node | null,\n accumulator: ChildChangeAccumulator\n ): ViewCache {\n let complete;\n if (writesCache.shadowingWrite(path) != null) {\n return viewCache;\n } else {\n const source = new WriteTreeCompleteChildSource(\n writesCache,\n viewCache,\n completeServerCache\n );\n const oldEventCache = viewCache.getEventCache().getNode();\n let newEventCache;\n if (path.isEmpty() || path.getFront() === '.priority') {\n let newNode;\n if (viewCache.getServerCache().isFullyInitialized()) {\n newNode = writesCache.calcCompleteEventCache(\n viewCache.getCompleteServerSnap()\n );\n } else {\n const serverChildren = viewCache.getServerCache().getNode();\n assert(\n serverChildren instanceof ChildrenNode,\n 'serverChildren would be complete if leaf node'\n );\n newNode = writesCache.calcCompleteEventChildren(\n serverChildren as ChildrenNode\n );\n }\n newNode = newNode as Node;\n newEventCache = this.filter_.updateFullNode(\n oldEventCache,\n newNode,\n accumulator\n );\n } else {\n const childKey = path.getFront();\n let newChild = writesCache.calcCompleteChild(\n childKey,\n viewCache.getServerCache()\n );\n if (\n newChild == null &&\n viewCache.getServerCache().isCompleteForChild(childKey)\n ) {\n newChild = oldEventCache.getImmediateChild(childKey);\n }\n if (newChild != null) {\n newEventCache = this.filter_.updateChild(\n oldEventCache,\n childKey,\n newChild,\n path.popFront(),\n source,\n accumulator\n );\n } else if (\n viewCache\n .getEventCache()\n .getNode()\n .hasChild(childKey)\n ) {\n // No complete child available, delete the existing one, if any\n newEventCache = this.filter_.updateChild(\n oldEventCache,\n childKey,\n ChildrenNode.EMPTY_NODE,\n path.popFront(),\n source,\n accumulator\n );\n } else {\n newEventCache = oldEventCache;\n }\n if (\n newEventCache.isEmpty() &&\n viewCache.getServerCache().isFullyInitialized()\n ) {\n // We might have reverted all child writes. Maybe the old event was a leaf node\n complete = writesCache.calcCompleteEventCache(\n viewCache.getCompleteServerSnap()\n );\n if (complete.isLeafNode()) {\n newEventCache = this.filter_.updateFullNode(\n newEventCache,\n complete,\n accumulator\n );\n }\n }\n }\n complete =\n viewCache.getServerCache().isFullyInitialized() ||\n writesCache.shadowingWrite(Path.Empty) != null;\n return viewCache.updateEventSnap(\n newEventCache,\n complete,\n this.filter_.filtersNodes()\n );\n }\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.} changes\n * @param {!Node} eventCache\n * @param {!Array.} eventRegistrations\n * @return {!Array.}\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.} events\n * @param {!string} eventType\n * @param {!Array.} changes\n * @param {!Array.} 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.} 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(function(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.}\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.}\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, function(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.} changes\n * @param {!Node} eventCache\n * @param {EventRegistration=} eventRegistration\n * @return {!Array.}\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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) {}\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, function(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 not 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 let 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(PRIORITY_INDEX, function(\n childName,\n childNode\n ) {\n children.push(new NamedNode(childName, childNode));\n });\n }\n } else {\n this.writeTree_.children.inorderTraversal(function(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,\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(function(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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '@firebase/util';\nimport { assert, assertionError } from '@firebase/util';\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.}\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: path,\n snap: snap,\n writeId: writeId,\n visible: 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.} 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: path,\n children: changedChildren,\n writeId: 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(function(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.=} 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, function(\n childName,\n childSnap\n ) {\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(PRIORITY_INDEX, function(\n childName,\n childNode\n ) {\n const node = merge\n .childCompoundWrite(new Path(childName))\n .apply(childNode);\n completeChildren = completeChildren.updateImmediateChild(\n childName,\n node\n );\n });\n // Add any complete children we have from the set\n merge.getCompleteChildren().forEach(function(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(function(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.=} 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.}\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.\n * ):!Array.,\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?: any) => 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 = 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 = new Map();\n private readonly queryToTagMap: Map = 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, function(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, function(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(function(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., events: !Array.}}\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(function(query) {\n return query.getQueryParams().loadsAllData();\n });\n const covered = this.syncPointTree_.findOnPath(path, function(\n relativePath,\n parentSyncPoint\n ) {\n return parentSyncPoint.hasCompleteView();\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. The location must have a listener above\n * it, but as this is only used by transaction code, that should always be the case anyways.\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(\n path: Path,\n writeIdsToExclude?: number[]\n ): Node | null {\n const includeHiddenSets = true;\n const writeTree = this.pendingWriteTree_;\n const serverCache = this.syncPointTree_.findOnPath(path, function(\n pathSoFar,\n syncPoint\n ) {\n const relativePath = Path.relativePath(pathSoFar, path);\n const serverCache = syncPoint.getCompleteServerCache(relativePath);\n if (serverCache) {\n return serverCache;\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\n ): View[] {\n return subtree.fold(\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, function(_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(function(\n relativePath,\n maybeChildSyncPoint,\n childMap\n ) {\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, function(_key: string, childQueries: Query[]) {\n queries = queries.concat(childQueries);\n });\n return queries;\n }\n });\n for (let i = 0; i < queriesToStop.length; ++i) {\n const queryToStop = queriesToStop[i];\n 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?: any): 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,\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,\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { FirebaseAuthTokenData } from '@firebase/app-types/private';\nimport { log, warn } from './util/util';\n\n/**\n * Abstraction around FirebaseApp's token fetching capabilities.\n */\nexport class AuthTokenProvider {\n /**\n * @param {!FirebaseApp} app_\n */\n constructor(private app_: FirebaseApp) {}\n\n /**\n * @param {boolean} forceRefresh\n * @return {!Promise}\n */\n getToken(forceRefresh: boolean): Promise {\n return this.app_['INTERNAL']['getToken'](forceRefresh).then(\n null,\n // .catch\n function(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\n addTokenChangeListener(listener: (token: string | null) => void) {\n // TODO: We might want to wrap the listener and call it with no args to\n // avoid a leaky abstraction, but that makes removing the listener harder.\n this.app_['INTERNAL']['addAuthTokenListener'](listener);\n }\n\n removeTokenChangeListener(listener: (token: string | null) => void) {\n this.app_['INTERNAL']['removeAuthTokenListener'](listener);\n }\n\n notifyForInvalidToken() {\n let errorMessage =\n 'Provided authentication credentials for the app named \"' +\n this.app_.name +\n '\" are invalid. This usually indicates your app was not ' +\n 'initialized correctly. ';\n if ('credential' in this.app_.options) {\n errorMessage +=\n 'Make sure the \"credential\" property provided to initializeApp() ' +\n 'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n 'project.';\n } else if ('serviceAccount' in this.app_.options) {\n errorMessage +=\n 'Make sure the \"serviceAccount\" property provided to initializeApp() ' +\n 'is authorized to access the specified \"databaseURL\" and is from the correct ' +\n 'project.';\n } else {\n errorMessage +=\n 'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' +\n 'initializeApp() match the values provided for your app at ' +\n 'https://console.firebase.google.com/.';\n }\n warn(errorMessage);\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '@firebase/util';\nimport { 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)) this.counters_[name] = 0;\n\n this.counters_[name] += amount;\n }\n\n get() {\n return deepCopy(this.counters_);\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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]: any } = {};\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(\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];\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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.}\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.} 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.} 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.} 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.}\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any[]): void;\n context: any;\n }>;\n } = {};\n\n /**\n * @param {!Array.} allowedEvents_\n */\n constructor(private allowedEvents_: Array) {\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): any[];\n\n /**\n * To be called by derived classes to trigger events.\n * @param {!string} eventType\n * @param {...*} var_args\n */\n protected trigger(eventType: string, ...var_args: any[]) {\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, var_args);\n }\n }\n }\n\n on(eventType: string, callback: (a: any) => void, context: any) {\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: any) => void, context: any) {\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(function(et) {\n return et === eventType;\n }),\n 'Unknown event: ' + eventType\n );\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any;\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.}\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { EventEmitter } from './EventEmitter';\nimport { isMobileCordova } from '@firebase/util';\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.}\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any[] = [];\n currentResponseNum = 0;\n closeAfterResponse = -1;\n onClose: (() => void) | null = null;\n\n /**\n * @param onMessage_\n */\n constructor(private onMessage_: (a: Object) => 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: any[]) {\n this.pendingResponses[requestNum] = data;\n while (this.pendingResponses[this.currentResponseNum]) {\n const toProcess = this.pendingResponses[this.currentResponseNum];\n delete this.pendingResponses[this.currentResponseNum];\n for (let i = 0; i < toProcess.length; ++i) {\n if (toProcess[i]) {\n exceptionGuard(() => {\n this.onMessage_(toProcess[i]);\n });\n }\n }\n if (this.currentResponseNum === this.closeAfterResponse) {\n if (this.onClose) {\n this.onClose();\n this.onClose = null;\n }\n break;\n }\n this.currentResponseNum++;\n }\n }\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport {\n executeWhenDOMReady,\n isChromeExtensionContentScript,\n isWindowsStoreApp,\n log,\n logWrapper,\n LUIDGenerator,\n splitStringBySize\n} from '../core/util/util';\nimport { StatsManager } from '../core/stats/StatsManager';\nimport { PacketReceiver } from './polling/PacketReceiver';\nimport {\n FORGE_DOMAIN,\n FORGE_REF,\n LAST_SESSION_PARAM,\n LONG_POLLING,\n PROTOCOL_VERSION,\n REFERER_PARAM,\n TRANSPORT_SESSION_PARAM,\n VERSION_PARAM\n} from './Constants';\nimport { base64Encode, stringify } from '@firebase/util';\nimport { isNodeSdk } from '@firebase/util';\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: any[]) => void;\n private stats_: StatsCollection;\n private everConnected_ = false;\n private isClosed_: boolean;\n private connectTimeoutTimer_: number | null;\n private onDisconnect_: ((a?: boolean) => void) | null;\n\n /**\n * @param {string} connId An identifier for this connection, used for logging\n * @param {RepoInfo} repoInfo The info for the endpoint to send data to.\n * @param {string=} transportSessionId Optional transportSessionid if we are reconnecting for an existing\n * transport session\n * @param {string=} lastSessionId Optional lastSessionId if the PersistentConnection has already created a\n * connection previously\n */\n constructor(\n public connId: string,\n public repoInfo: RepoInfo,\n public transportSessionId?: string,\n public lastSessionId?: string\n ) {\n this.log_ = logWrapper(connId);\n this.stats_ = StatsManager.getCollection(repoInfo);\n this.urlFn = (params: { [k: string]: string }) =>\n repoInfo.connectionURL(LONG_POLLING, params);\n }\n\n /**\n *\n * @param {function(Object)} onMessage Callback when messages arrive\n * @param {function()} onDisconnect Callback with connection lost.\n */\n open(onMessage: (msg: Object) => 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 }, 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_) return;\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) return; // we closed the connection.\n\n if (this.connectTimeoutTimer_) {\n clearTimeout(this.connectTimeoutTimer_);\n this.connectTimeoutTimer_ = null;\n }\n this.everConnected_ = true;\n if (command == FIREBASE_LONGPOLL_START_PARAM) {\n this.id = arg1;\n this.password = arg2;\n } else if (command === FIREBASE_LONGPOLL_CLOSE_COMMAND) {\n // Don't clear the host cache. We got a response from the server, so we know it's reachable\n if (arg1) {\n // We aren't expecting any more data (other than what the server's already in the process of sending us\n // through our already open polls), so don't send any more.\n this.scriptTagHolder.sendNewPolls = false;\n\n // arg1 in this case is the last response number sent by the server. We should try to receive\n // all of the responses up to this one before closing\n this.myPacketOrderer.closeAfter(arg1, () => {\n this.onClosed_();\n });\n } else {\n this.onClosed_();\n }\n } else {\n throw new Error('Unrecognized command received: ' + command);\n }\n },\n (...args) => {\n const [pN, data] = args;\n this.incrementIncomingBytes_(args);\n this.myPacketOrderer.handleResponse(pN, data);\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 urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n if (this.transportSessionId) {\n urlParams[TRANSPORT_SESSION_PARAM] = this.transportSessionId;\n }\n if (this.lastSessionId) {\n urlParams[LAST_SESSION_PARAM] = this.lastSessionId;\n }\n if (\n !isNodeSdk() &&\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 // 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.forceAllow_ ||\n (!BrowserPollConnection.forceDisallow_ &&\n typeof document !== 'undefined' &&\n document.createElement != null &&\n !isChromeExtensionContentScript() &&\n !isWindowsStoreApp() &&\n !isNodeSdk())\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: Object) {\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()) return;\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: any) {\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\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();\n\n //A queue of the pending segments waiting for transmission to the server.\n pendingSegs: { seg: number; ts: number; d: any }[] = [];\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: any[]) => void;\n onMessageCB: (...args: any[]) => 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: any[]) => void,\n onMessageCB: (...args: any[]) => 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 as any)[\n FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier\n ] = commandCB;\n (window as any)[\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 = '';\n }\n const iframeContents = '' + script + '';\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 as any).doc = iframe.contentDocument; // Firefox, Opera, Safari\n } else if (iframe.contentWindow) {\n (iframe as any).doc = iframe.contentWindow.document; // Internet Explorer\n } else if ((iframe as any).document) {\n (iframe as any).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 if (isNodeSdk() && this.myID) {\n const urlParams: { [k: string]: string } = {};\n urlParams[FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM] = 't';\n urlParams[FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\n urlParams[FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\n const theURL = this.urlFn(urlParams);\n (FirebaseIFrameScriptHolder as any).nodeRestRequest(theURL);\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.length + SEG_HEADER_SIZE + 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: any) {\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 (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) return;\n const newScript = this.myIFrame.doc.createElement('script');\n newScript.type = 'text/javascript';\n newScript.async = true;\n newScript.src = url;\n newScript.onload = (newScript as any).onreadystatechange = function() {\n const rstate = (newScript as any).readyState;\n if (!rstate || rstate === 'loaded' || rstate === 'complete') {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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';\n\ndeclare const MozWebSocket: any;\n\nimport { assert, CONSTANTS as ENV_CONSTANTS } 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 { jsonEval, stringify } from '@firebase/util';\nimport { isNodeSdk } from '@firebase/util';\nimport { Transport } from './Transport';\nimport { StatsCollection } from '../core/stats/StatsCollection';\nimport { SDK_VERSION } from '../core/version';\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: Object) => void;\n mySock: any | null;\n private log_: (...a: any[]) => void;\n private stats_: StatsCollection;\n private everConnected_: boolean;\n private isClosed_: boolean;\n\n /**\n * @param {string} connId identifier for this transport\n * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n * session\n * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n */\n constructor(\n public connId: string,\n repoInfo: RepoInfo,\n transportSessionId?: string,\n lastSessionId?: string\n ) {\n this.log_ = logWrapper(this.connId);\n this.stats_ = StatsManager.getCollection(repoInfo);\n this.connURL = WebSocketConnection.connectionURL_(\n repoInfo,\n transportSessionId,\n lastSessionId\n );\n }\n\n /**\n * @param {RepoInfo} repoInfo The info for the websocket endpoint.\n * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\n * session\n * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\n * @return {string} connection url\n * @private\n */\n private static connectionURL_(\n repoInfo: RepoInfo,\n transportSessionId?: string,\n lastSessionId?: string\n ): string {\n const urlParams: { [k: string]: string } = {};\n urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\n\n if (\n !isNodeSdk() &&\n typeof location !== 'undefined' &&\n location.href &&\n location.href.indexOf(FORGE_DOMAIN) !== -1\n ) {\n urlParams[REFERER_PARAM] = FORGE_REF;\n }\n if (transportSessionId) {\n urlParams[TRANSPORT_SESSION_PARAM] = transportSessionId;\n }\n if (lastSessionId) {\n urlParams[LAST_SESSION_PARAM] = lastSessionId;\n }\n return repoInfo.connectionURL(WEBSOCKET, urlParams);\n }\n\n /**\n *\n * @param onMessage Callback when messages arrive\n * @param onDisconnect Callback with connection lost.\n */\n open(onMessage: (msg: Object) => 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////\n const options: { [k: string]: object } = {\n headers: {\n 'User-Agent': `Firebase/${PROTOCOL_VERSION}/${SDK_VERSION}/${\n process.platform\n }/${device}`\n }\n };\n\n // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n const env = process['env'];\n const proxy =\n this.connURL.indexOf('wss://') == 0\n ? env['HTTPS_PROXY'] || env['https_proxy']\n : env['HTTP_PROXY'] || env['http_proxy'];\n\n if (proxy) {\n options['proxy'] = { origin: proxy };\n }\n\n this.mySock = new WebSocketImpl(this.connURL, [], options);\n } else {\n this.mySock = new WebSocketImpl(this.connURL);\n }\n } catch (e) {\n this.log_('Error instantiating WebSocket.');\n const error = e.message || e.data;\n if (error) {\n this.log_(error);\n }\n this.onClosed_();\n return;\n }\n\n this.mySock.onopen = () => {\n this.log_('Websocket connected.');\n this.everConnected_ = true;\n };\n\n this.mySock.onclose = () => {\n this.log_('Websocket connection was disconnected.');\n this.mySock = null;\n this.onClosed_();\n };\n\n this.mySock.onmessage = (m: object) => {\n this.handleIncomingFrame(m);\n };\n\n this.mySock.onerror = (e: any) => {\n this.log_('WebSocket error. Closing connection.');\n const error = e.message || e.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]: any }) {\n if (this.mySock === null) return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\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: Object) {\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 }, 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { BrowserPollConnection } from './BrowserPollConnection';\nimport { WebSocketConnection } from './WebSocketConnection';\nimport { warn, each } from '../core/util/util';\nimport { TransportConstructor } from './Transport';\nimport { RepoInfo } from '../core/RepoInfo';\n\n/**\n * Currently simplistic, this class manages what transport a Connection should use at various stages of its\n * lifecycle.\n *\n * It starts with longpolling in a browser, and httppolling on node. It then upgrades to websockets if\n * they are available.\n * @constructor\n */\nexport class TransportManager {\n private transports_: TransportConstructor[];\n\n /**\n * @const\n * @type {!Array.}\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 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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';\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: any[] = [];\n sessionId: string;\n\n private conn_: Transport;\n private healthyTimeout_: number;\n private isHealthy_: boolean;\n private log_: (...args: any[]) => void;\n private primaryResponsesRequired_: number;\n private rx_: Transport;\n private secondaryConn_: Transport;\n private secondaryResponsesRequired_: number;\n private state_ = RealtimeState.CONNECTING;\n private transportManager_: TransportManager;\n private tx_: Transport;\n\n /**\n * @param {!string} id - an id for this connection\n * @param {!RepoInfo} repoInfo_ - the info for the endpoint to connect to\n * @param {function(Object)} onMessage_ - the callback to be triggered when a server-push message arrives\n * @param {function(number, string)} onReady_ - the callback to be triggered when this connection is ready to send messages.\n * @param {function()} onDisconnect_ - the callback to be triggered when a connection was lost\n * @param {function(string)} onKill_ - the callback to be triggered when this connection has permanently shut down.\n * @param {string=} lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\n */\n constructor(\n public id: string,\n private repoInfo_: RepoInfo,\n private onMessage_: (a: Object) => 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_() {\n const conn = this.transportManager_.initialTransport();\n this.conn_ = new conn(\n this.nextTransportId_(),\n this.repoInfo_,\n undefined,\n this.lastSessionId\n );\n\n // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n // can consider the transport healthy.\n this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\n\n const onMessageReceived = this.connReceiver_(this.conn_);\n const onConnectionLost = this.disconnReceiver_(this.conn_);\n this.tx_ = this.conn_;\n this.rx_ = this.conn_;\n this.secondaryConn_ = null;\n this.isHealthy_ = false;\n\n /*\n * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\n * This can occur in the case of a redirect, i.e. we guessed wrong on what server to connect to and received a reset.\n * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\n * still have the context of your originating frame.\n */\n setTimeout(() => {\n // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\n this.conn_ && this.conn_.open(onMessageReceived, onConnectionLost);\n }, Math.floor(0));\n\n const healthyTimeout_ms = conn['healthyTimeout'] || 0;\n if (healthyTimeout_ms > 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 }, Math.floor(healthyTimeout_ms)) 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: object) => {\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]: any }) {\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: object) {\n const layer: string = requireKey('t', parsedData);\n const data: any = requireKey('d', parsedData);\n if (layer == 'c') {\n this.onSecondaryControl_(data);\n } else if (layer == 'd') {\n // got a data message, but we're still second connection. Need to buffer it up\n this.pendingDataMessages.push(data);\n } else {\n throw new Error('Unknown protocol layer: ' + layer);\n }\n }\n\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]: any }) {\n // Must refer to parsedData properties in quotes, so closure doesn't touch them.\n const layer: string = requireKey('t', parsedData);\n const data: any = requireKey('d', parsedData);\n if (layer == 'c') {\n this.onControl_(data);\n } else if (layer == 'd') {\n this.onDataMessage_(data);\n }\n }\n\n private onDataMessage_(message: any) {\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]: any }) {\n const cmd: string = requireKey(MESSAGE_TYPE, controlData);\n if (MESSAGE_DATA in controlData) {\n const payload = controlData[MESSAGE_DATA];\n if (cmd === SERVER_HELLO) {\n this.onHandshake_(payload);\n } else if (cmd === END_TRANSMISSION) {\n this.log_('recvd end transmission on primary');\n this.rx_ = this.secondaryConn_;\n for (let i = 0; i < this.pendingDataMessages.length; ++i) {\n this.onDataMessage_(this.pendingDataMessages[i]);\n }\n this.pendingDataMessages = [];\n this.tryCleanupConnection();\n } else if (cmd === CONTROL_SHUTDOWN) {\n // This was previously the 'onKill' callback passed to the lower-level connection\n // payload in this case is the reason for the shutdown. Generally a human-readable error\n this.onConnectionShutdown_(payload);\n } else if (cmd === CONTROL_RESET) {\n // payload in this case is the host we should contact\n this.onReset_(payload);\n } else if (cmd === CONTROL_ERROR) {\n error('Server Error: ' + payload);\n } else if (cmd === CONTROL_PONG) {\n this.log_('got pong on primary.');\n this.onPrimaryResponse_();\n this.sendPingOnPrimaryIfNecessary_();\n } else {\n error('Unknown control packet command: ' + cmd);\n }\n }\n }\n\n /**\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 }) {\n const timestamp = handshake.ts;\n const version = handshake.v;\n const host = handshake.h;\n this.sessionId = handshake.s;\n this.repoInfo_.updateHost(host);\n // if we've already closed the connection, then don't bother trying to progress further\n if (this.state_ == RealtimeState.CONNECTING) {\n this.conn_.start();\n this.onConnectionEstablished_(this.conn_, timestamp);\n if (PROTOCOL_VERSION !== version) {\n warn('Protocol version mismatch detected');\n }\n // TODO: do we want to upgrade? when? maybe a delay?\n this.tryStartUpgrade_();\n }\n }\n\n private tryStartUpgrade_() {\n const conn = this.transportManager_.upgradeTransport();\n if (conn) {\n this.startUpgrade_(conn);\n }\n }\n\n private startUpgrade_(conn: TransportConstructor) {\n this.secondaryConn_ = new conn(\n this.nextTransportId_(),\n this.repoInfo_,\n this.sessionId\n );\n // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\n // can consider the transport healthy.\n this.secondaryResponsesRequired_ =\n conn['responsesRequiredToBeHealthy'] || 0;\n\n const onMessage = this.connReceiver_(this.secondaryConn_);\n const onDisconnect = this.disconnReceiver_(this.secondaryConn_);\n this.secondaryConn_.open(onMessage, onDisconnect);\n\n // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\n setTimeoutNonBlocking(() => {\n if (this.secondaryConn_) {\n this.log_('Timed out trying to upgrade.');\n this.secondaryConn_.close();\n }\n }, Math.floor(UPGRADE_TIMEOUT));\n }\n\n private onReset_(host: string) {\n this.log_('Reset packet received. New host: ' + host);\n this.repoInfo_.updateHost(host);\n // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\n // We don't currently support resets after the connection has already been established\n if (this.state_ === RealtimeState.CONNECTED) {\n this.close();\n } else {\n // Close whatever connections we have open and start again.\n this.closeConnections_();\n this.start_();\n }\n }\n\n private onConnectionEstablished_(conn: Transport, timestamp: number) {\n this.log_('Realtime connection established.');\n this.conn_ = conn;\n this.state_ = RealtimeState.CONNECTED;\n\n if (this.onReady_) {\n this.onReady_(timestamp, this.sessionId);\n this.onReady_ = null;\n }\n\n // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\n // send some pings.\n if (this.primaryResponsesRequired_ === 0) {\n this.log_('Primary connection is healthy.');\n this.isHealthy_ = true;\n } else {\n setTimeoutNonBlocking(() => {\n this.sendPingOnPrimaryIfNecessary_();\n }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\n }\n }\n\n private sendPingOnPrimaryIfNecessary_() {\n // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\n if (!this.isHealthy_ && this.state_ === RealtimeState.CONNECTED) {\n this.log_('sending ping on primary.');\n this.sendData_({ t: 'c', d: { t: PING, d: {} } });\n }\n }\n\n private onSecondaryConnectionLost_() {\n const conn = this.secondaryConn_;\n this.secondaryConn_ = null;\n if (this.tx_ === conn || this.rx_ === conn) {\n // we are relying on this connection already in some capacity. Therefore, a failure is real\n this.close();\n }\n }\n\n /**\n *\n * @param {boolean} everConnected Whether or not the connection ever reached a server. Used to determine if\n * we should flush the host cache\n * @private\n */\n private onConnectionLost_(everConnected: boolean) {\n this.conn_ = null;\n\n // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\n // called on window close and RealtimeState.CONNECTING is no longer defined. Just a guess.\n if (!everConnected && this.state_ === RealtimeState.CONNECTING) {\n this.log_('Realtime connection failed.');\n // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\n if (this.repoInfo_.isCacheableHost()) {\n PersistentStorage.remove('host:' + this.repoInfo_.host);\n // reset the internal host to what we would show the user, i.e. .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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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: any) => 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: any,\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: any,\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: any,\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: any,\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.} stats\n */\n reportStats(stats: { [k: string]: any }) {}\n}\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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, isEmpty, safeGet, CONSTANTS } from '@firebase/util';\nimport { stringify } from '@firebase/util';\nimport { assert } from '@firebase/util';\nimport { error, log, logWrapper, warn, ObjectToUniqueKey } from './util/util';\nimport { Path } from './util/Path';\nimport { VisibilityMonitor } from './util/VisibilityMonitor';\nimport { OnlineMonitor } from './util/OnlineMonitor';\nimport { isAdmin, isValidFormat } from '@firebase/util';\nimport { Connection } from '../realtime/Connection';\nimport { isMobileCordova, isReactNative, isNodeSdk } from '@firebase/util';\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?: any): 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: any;\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> */\n private readonly listens: Map<\n /* path */ string,\n Map\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: any) => void } = {};\n private requestNumber_ = 0;\n\n private realtime_: {\n sendRequest(a: Object): void;\n close(): void;\n } | null = null;\n\n private authToken_: string | null = null;\n private forceTokenRefresh_ = false;\n private invalidAuthTokenCount_ = 0;\n\n private firstConnection_ = true;\n private lastConnectionAttemptTime_: number | null = null;\n private lastConnectionEstablishedTime_: number | null = null;\n\n private static nextPersistentConnectionId_ = 0;\n\n /**\n * Counter for number of connections created. Mainly used for tagging in the logs\n */\n private static nextConnectionId_ = 0;\n\n /**\n * @implements {ServerActions}\n * @param repoInfo_ Data about the namespace we are connecting to\n * @param onDataUpdate_ A callback for new data from the server\n */\n constructor(\n private repoInfo_: RepoInfo,\n private onDataUpdate_: (\n a: string,\n b: any,\n c: boolean,\n d: number | null\n ) => void,\n private onConnectStatus_: (a: boolean) => void,\n private onServerInfoUpdate_: (a: any) => 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: any,\n onResponse?: (a: any) => 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: any) => 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: onComplete,\n hashFn: currentHashFn,\n query: query,\n tag: 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]: any } = { /*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]: any }) => {\n const payload: any = message[/*data*/ 'd'];\n const status: string = message[/*status*/ 's'];\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: any, query: Query) {\n if (payload && typeof payload === 'object' && contains(payload, 'w')) {\n const warnings = safeGet(payload, 'w');\n if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\n const indexSpec =\n '\".indexOn\": \"' +\n query\n .getQueryParams()\n .getIndex()\n .toString() +\n '\"';\n const indexPath = query.path.toString();\n warn(\n `Using an unspecified index. Your data will be downloaded and ` +\n `filtered on the client. Consider adding ${indexSpec} at ` +\n `${indexPath} to your security rules for better performance.`\n );\n }\n }\n }\n\n /**\n * @inheritDoc\n */\n refreshAuthToken(token: string) {\n this.authToken_ = token;\n this.log_('Auth token refreshed');\n if (this.authToken_) {\n this.tryAuth();\n } else {\n //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\n //the credential so we dont become authenticated next time we connect.\n if (this.connected_) {\n this.sendRequest('unauth', {}, () => {});\n }\n }\n\n this.reduceReconnectDelayIfAdminCredential_(token);\n }\n\n private reduceReconnectDelayIfAdminCredential_(credential: string) {\n // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\n // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\n const isFirebaseSecret = credential && credential.length === 40;\n if (isFirebaseSecret || isAdmin(credential)) {\n this.log_(\n 'Admin auth credential detected. Reducing max reconnect time.'\n );\n this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\n }\n }\n\n /**\n * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\n * a auth revoked (the connection is closed).\n */\n tryAuth() {\n if (this.connected_ && this.authToken_) {\n const token = this.authToken_;\n const authMethod = isValidFormat(token) ? 'auth' : 'gauth';\n const requestData: { [k: string]: any } = { 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(authMethod, requestData, (res: { [k: string]: any }) => {\n const status: string = res[/*status*/ 's'];\n const data: string = res[/*data*/ 'd'] || '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 * @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]: any } = { /*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: any,\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: any,\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: any,\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]: any }) => {\n if (onComplete) {\n setTimeout(function() {\n onComplete(response[/*status*/ 's'], response[/* data */ 'd']);\n }, Math.floor(0));\n }\n });\n }\n\n /**\n * @inheritDoc\n */\n put(\n pathString: string,\n data: any,\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: any,\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: any,\n onComplete: (a: string, b: string | null) => void,\n hash?: string\n ) {\n const request: { [k: string]: any } = {\n /*path*/ p: pathString,\n /*data*/ d: data\n };\n\n if (hash !== undefined) request[/*hash*/ 'h'] = hash;\n\n // TODO: Only keep track of the most recent put for a given path?\n this.outstandingPuts_.push({\n action,\n request,\n onComplete\n });\n\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]: any }) => {\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(message[/*status*/ 's'], message[/* data */ 'd']);\n });\n }\n\n /**\n * @inheritDoc\n */\n reportStats(stats: { [k: string]: any }) {\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]: any }) {\n if ('r' in message) {\n // this is a response\n this.log_('from server: ' + stringify(message));\n const reqNum = message['r'];\n const onResponse = this.requestCBHash_[reqNum];\n if (onResponse) {\n delete this.requestCBHash_[reqNum];\n onResponse(message[/*body*/ 'b']);\n }\n } else if ('error' in message) {\n throw 'A server-side error has occurred: ' + message['error'];\n } else if ('a' in message) {\n // a and b are action and body, respectively\n this.onDataPush_(message['a'], message['b']);\n }\n }\n\n private onDataPush_(action: string, body: { [k: string]: any }) {\n this.log_('handleServerMessage', action, body);\n if (action === 'd')\n this.onDataUpdate_(\n body[/*path*/ 'p'],\n body[/*data*/ 'd'],\n /*isMerge*/ false,\n body['t']\n );\n else if (action === 'm')\n this.onDataUpdate_(\n body[/*path*/ 'p'],\n body[/*data*/ 'd'],\n /*isMerge=*/ true,\n body['t']\n );\n else if (action === 'c')\n this.onListenRevoked_(body[/*path*/ 'p'], body[/*query*/ 'q']);\n else if (action === 'ac')\n this.onAuthRevoked_(\n body[/*status code*/ 's'],\n body[/* explanation */ 'd']\n );\n else if (action === 'sd') 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 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 }, 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 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(function(result) {\n if (!canceled) {\n log('getToken() completed. Creating connection.');\n self.authToken_ = result && result.accessToken;\n connection = new Connection(\n connId,\n self.repoInfo_,\n onDataMessage,\n onReady,\n onDisconnect,\n /* onKill= */ function(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, function(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) put.onComplete('disconnect');\n\n delete this.outstandingPuts_[i];\n this.outstandingPutCount_--;\n }\n }\n\n // Clean up array occasionally.\n if (this.outstandingPutCount_ === 0) this.outstandingPuts_ = [];\n }\n\n private onListenRevoked_(pathString: string, query?: any[]) {\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) listen.onComplete('permission_denied');\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]: any }) {\n if (this.securityDebugCallback_) {\n this.securityDebugCallback_(body);\n } else {\n if ('msg' in body) {\n console.log('FIREBASE: ' + body['msg'].replace('\\n', '\\nFIREBASE: '));\n }\n }\n }\n\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]) this.sendPut_(i);\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { logWrapper, warn } from './util/util';\nimport { jsonEval } from '@firebase/util';\nimport { safeGet } from '@firebase/util';\nimport { querystring } from '@firebase/util';\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]: any }): void {\n throw new Error('Method not implemented.');\n }\n\n /** @private {function(...[*])} */\n private log_: (...args: any[]) => 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.}\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: any,\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: any) => 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.} queryStringParameters\n * @param {?function(?number, *=)} callback\n * @private\n */\n private restRequest_(\n pathString: string,\n queryStringParameters: { [k: string]: any } = {},\n callback: ((a: number | null, b?: any) => 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF 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;\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '@firebase/util';\nimport { beingCrawled, each, exceptionGuard, warn, log } from './util/util';\nimport { map, isEmpty } from '@firebase/util';\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';\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 transactions_init_: () => void;\n private infoData_: SnapshotHolder;\n private abortTransactions_: (path: Path) => Path;\n private rerunTransactions_: (changedPath: Path) => Path;\n private interceptServerDataCallback_:\n | ((a: string, b: any) => 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 ) {\n const authTokenProvider = new AuthTokenProvider(app);\n\n this.stats_ = StatsManager.getCollection(repoInfo_);\n\n if (forceRestClient || beingCrawled()) {\n this.server_ = new ReadonlyRestClient(\n this.repoInfo_,\n this.onDataUpdate_.bind(this),\n authTokenProvider\n );\n\n // Minor hack: Fire onConnect immediately, since there's no actual connection.\n setTimeout(this.onConnectStatus_.bind(this, true), 0);\n } else {\n const authOverride = app.options['databaseAuthVariableOverride'];\n // Validate authOverride\n if (typeof authOverride !== 'undefined' && authOverride !== null) {\n if (typeof authOverride !== 'object') {\n throw new Error(\n 'Only objects are supported for option databaseAuthVariableOverride'\n );\n }\n try {\n stringify(authOverride);\n } catch (e) {\n throw new Error('Invalid authOverride provided: ' + e);\n }\n }\n\n this.persistentConnection_ = new PersistentConnection(\n this.repoInfo_,\n this.onDataUpdate_.bind(this),\n this.onConnectStatus_.bind(this),\n this.onServerInfoUpdate_.bind(this),\n authTokenProvider,\n authOverride\n );\n\n this.server_ = this.persistentConnection_;\n }\n\n authTokenProvider.addTokenChangeListener(token => {\n this.server_.refreshAuthToken(token);\n });\n\n // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\n // we only want to create one StatsReporter. As such, we'll report stats over the first Repo created.\n this.statsReporter_ = StatsManager.getOrCreateReporter(\n repoInfo_,\n () => new StatsReporter(this.stats_, this.server_)\n );\n\n this.transactions_init_();\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(): Object {\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: any,\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(data as { [k: string]: any }, (raw: any) =>\n 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(data as { [k: string]: any }, (raw: any) =>\n 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: any) => any) | 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, (value: any, key: string) => {\n this.updateInfo_(key, value);\n });\n }\n\n private updateInfo_(pathString: string, value: any) {\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: any,\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 newNode = resolveDeferredValueSnapshot(\n newNodeUnresolved,\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]: any },\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: any) => {\n empty = false;\n const newNodeUnresolved = nodeFromJSON(changedValue);\n changedChildren[changedKey] = resolveDeferredValueSnapshot(\n newNodeUnresolved,\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 = resolveDeferredValueTree(\n this.onDisconnect_,\n serverValues\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: any,\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: any,\n priority: any,\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]: any },\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: any) => {\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') return;\n\n let stats: { [k: string]: any };\n if (showDelta) {\n if (!this.statsListener_)\n this.statsListener_ = new StatsListener(this.stats_);\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: any) => {\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_(...var_args: any[]) {\n let prefix = '';\n if (this.persistentConnection_) {\n prefix = this.persistentConnection_.id + ':';\n }\n log(prefix, ...var_args);\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(function() {\n if (status == 'ok') {\n callback(null);\n } else {\n const code = (status || 'error').toUpperCase();\n let message = code;\n if (errorReason) message += ': ' + errorReason;\n\n const error = new Error(message);\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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, function(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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 let next = iterator.getNext();\n if (!foundStartPost && cmp(startPost, next) <= 0) {\n // start adding\n foundStartPost = true;\n }\n let 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { 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 { stringify } from '@firebase/util';\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_: any | null = null;\n private indexStartName_ = '';\n private indexEndValue_: any | 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(): any {\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(): any {\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: any, 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: any, 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(): Object {\n const WIRE_PROTOCOL_CONSTANTS = QueryParams.WIRE_PROTOCOL_CONSTANTS_;\n const obj: { [k: string]: any } = {};\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.} query string parameters\n */\n toRestQueryStringParameters(): { [k: string]: any } {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 } from '@firebase/util';\nimport { Deferred } from '@firebase/util';\nimport { SyncPoint } from '../core/SyncPoint';\nimport { Database } from './Database';\nimport { DataSnapshot } from './DataSnapshot';\n\nexport interface ReferenceConstructor {\n new (repo: Repo, path: Path): Reference;\n}\n\nexport class Reference extends Query {\n public then: (a?: any) => Promise;\n public catch: (a?: Error) => Promise;\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()) return null;\n else return this.path.getBack();\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 validatePathString('Reference.child', 1, pathString, false);\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 = this as any;\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(newVal: any, onComplete?: (a: Error | null) => void): Promise {\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 {\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]: any } = {};\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,\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: any,\n newPriority: string | number | null,\n onComplete?: (a: Error | null) => void\n ): Promise {\n validateArgCount('Reference.setWithPriority', 2, 3, arguments.length);\n validateWritablePath('Reference.setWithPriority', this.path);\n validateFirebaseDataArg(\n 'Reference.setWithPriority',\n 1,\n newVal,\n this.path,\n false\n );\n validatePriority('Reference.setWithPriority', 2, newPriority, false);\n validateCallback('Reference.setWithPriority', 3, onComplete, true);\n\n if (this.getKey() === '.length' || this.getKey() === '.keys')\n throw 'Reference.setWithPriority failed: ' +\n this.getKey() +\n ' is a read-only object.';\n\n 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 {\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: any) => any,\n onComplete?: (a: Error | null, b: boolean, c: DataSnapshot | null) => void,\n applyLocally?: boolean\n ): Promise {\n validateArgCount('Reference.transaction', 1, 3, arguments.length);\n validateWritablePath('Reference.transaction', this.path);\n validateCallback('Reference.transaction', 1, transactionUpdate, false);\n validateCallback('Reference.transaction', 2, onComplete, true);\n // NOTE: applyLocally is an internal-only option for now. We need to decide if we want to keep it and how\n // to expose it.\n validateBoolean('Reference.transaction', 3, applyLocally, true);\n\n if (this.getKey() === '.length' || this.getKey() === '.keys')\n throw 'Reference.transaction failed: ' +\n this.getKey() +\n ' is a read-only object.';\n\n if (applyLocally === undefined) applyLocally = true;\n\n const deferred = new Deferred();\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 {\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?: any, 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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { contains, safeGet } from '@firebase/util';\nimport { each } from './util';\n\n/**\n * Node in a Tree.\n */\nexport class TreeNode {\n // TODO: Consider making accessors that create children and value lazily or\n // separate Internal / Leaf 'types'.\n children: { [name: string]: TreeNode } = {};\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 {\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 | null = null,\n private node_: TreeNode = new TreeNode()\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.} Tree for path.\n */\n subTree(pathObj: string | Path): Tree {\n // TODO: Require pathObj to be Path?\n let path = pathObj instanceof Path ? pathObj : new Path(pathObj);\n let child = this as Tree,\n next;\n while ((next = path.getFront()) !== null) {\n const childNode = safeGet(child.node_.children, next) || new TreeNode();\n child = new Tree(next, child, childNode);\n path = path.popFront();\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.)} action Action to be called for each child.\n */\n forEachChild(action: (tree: Tree) => void) {\n each(this.node_.children, (child: string, childTree: TreeNode) => {\n action(new Tree(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.)} 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) => void,\n includeSelf?: boolean,\n childrenFirst?: boolean\n ) {\n if (includeSelf && !childrenFirst) action(this);\n\n this.forEachChild(function(child) {\n child.forEachDescendant(action, /*includeSelf=*/ true, childrenFirst);\n });\n\n if (includeSelf && childrenFirst) action(this);\n }\n\n /**\n * Calls action on each ancestor node.\n *\n * @param {function(!Tree.)} 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) => 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.)} action Action to be called for each child.\n */\n forEachImmediateDescendantWithValue(action: (tree: Tree) => void) {\n this.forEachChild(function(child) {\n if (child.getValue() !== null) action(child);\n else child.forEachImmediateDescendantWithValue(action);\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 | 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) this.parent_.updateChild_(this.name_, this);\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.} child The child to update.\n * @private\n */\n private updateChild_(childName: string, child: Tree) {\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 { 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';\nimport { contains, safeGet } from '@firebase/util';\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(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 */\ntype Transaction = {\n path: Path;\n update: (a: any) => any;\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(Repo.prototype as any).transactions_init_ = function() {\n /**\n * Stores queues of outstanding transactions for Firebase locations.\n *\n * @type {!Tree.>}\n * @private\n */\n this.transactionQueueTree_ = new Tree();\n};\n\ndeclare module './Repo' {\n interface Repo {\n startTransaction(\n path: Path,\n transactionUpdate: (a: any) => 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: any) => any,\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: 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 priorityForNode = safeGet(newVal, '.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 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.=} excludeSets A specific set to exclude\n * @return {Node}\n * @private\n */\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.>=} node transactionQueueTree node to start at.\n * @private\n */\n(Repo.prototype as any).sendReadyTransactions_ = function(\n node: Tree = 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.} queue Queue of transactions under the specified location.\n * @private\n */\n(Repo.prototype as any).sendTransactionQueue_ = function(\n path: Path,\n queue: Array\n) {\n // Mark transactions as sent and increment retry count!\n const setsToIgnore = queue.map(function(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 queue[i].status = TransactionStatus.RUN;\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(Repo.prototype as any).rerunTransactions_ = function(changedPath: Path): Path {\n const rootMostTransactionNode = this.getAncestorTransactionNode_(changedPath);\n const path = rootMostTransactionNode.path();\n\n const queue = this.buildTransactionQueue_(rootMostTransactionNode);\n this.rerunTransactionQueue_(queue, path);\n\n return path;\n};\n\n/**\n * Does all the work of rerunning transactions (as well as cleans up aborted transactions and whatnot).\n *\n * @param {Array.} queue The queue of transactions to run.\n * @param {!Path} path The path the queue is for.\n * @private\n */\n(Repo.prototype as any).rerunTransactionQueue_ = function(\n queue: Array,\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(function(q) {\n return q.status === TransactionStatus.RUN;\n });\n const setsToIgnore = txnsToRerun.map(function(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 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 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.>} The rootmost node with a transaction.\n * @private\n */\n(Repo.prototype as any).getAncestorTransactionNode_ = function(\n path: Path\n): Tree {\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 while (\n (front = path.getFront()) !== null &&\n transactionNode.getValue() === null\n ) {\n transactionNode = transactionNode.subTree(front);\n path = path.popFront();\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.>} transactionNode\n * @return {Array.} The generated queue.\n * @private\n */\n(Repo.prototype as any).buildTransactionQueue_ = function(\n transactionNode: Tree\n): Array {\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(function(a, b) {\n return a.order - b.order;\n });\n\n return transactionQueue;\n};\n\n/**\n * @param {!Tree.>} node\n * @param {Array.} queue\n * @private\n */\n(Repo.prototype as any).aggregateTransactionQueuesForNode_ = function(\n node: Tree,\n queue: Array\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.>} node\n * @private\n */\n(Repo.prototype as any).pruneCompletedTransactionsBelowNode_ = function(\n node: Tree\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(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) => {\n this.abortTransactionsOnNode_(node);\n });\n\n this.abortTransactionsOnNode_(transactionNode);\n\n transactionNode.forEachDescendant((node: Tree) => {\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.>} node Node to abort transactions for.\n * @private\n */\n(Repo.prototype as any).abortTransactionsOnNode_ = function(\n node: Tree\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { FirebaseApp } from '@firebase/app-types';\nimport { safeGet } from '@firebase/util';\nimport { Repo } from './Repo';\nimport { fatal } from './util/util';\nimport { parseRepoInfo } from './util/libs/parser';\nimport { validateUrl } from './util/validation';\nimport './Repo_transaction';\nimport { Database } from '../api/Database';\nimport { RepoInfo } from './RepoInfo';\n\n/** @const {string} */\nconst DATABASE_URL_OPTION = 'databaseURL';\n\nlet _staticInstance: RepoManager;\n\n/**\n * Creates and caches Repo instances.\n */\nexport class RepoManager {\n /**\n * @private {!Object.>}\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 in this.repos_) {\n for (const dbUrl in this.repos_[appName]) {\n this.repos_[appName][dbUrl].interrupt();\n }\n }\n }\n\n resume() {\n for (const appName in this.repos_) {\n for (const dbUrl in 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(app: FirebaseApp, url?: string): Database {\n const dbUrl: string = 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 const parsedUrl = parseRepoInfo(dbUrl);\n const repoInfo = parsedUrl.repoInfo;\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);\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(repoInfo: RepoInfo, app: FirebaseApp): 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);\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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';\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 };\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_ as any).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_ as any).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} */\n async delete(): Promise {\n (this.database as any).checkDeleted_('delete');\n RepoManager.getInstance().deleteRepo((this.database as any).repo_ as Repo);\n\n (this.database as any).repo_ = null;\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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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 (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: any) => void) | null\n) {\n return ref.repo.interceptServerData_(callback);\n};\n","/**\n * @license\n * Copyright 2017 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY 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(PersistentConnection.prototype as any).simpleListen = function(\n pathString: string,\n onComplete: (a: any) => void\n) {\n this.sendRequest('q', { p: pathString }, onComplete);\n};\n\n/**\n * @param {*} data\n * @param {function(*)} onEcho\n */\n(PersistentConnection.prototype as any).echo = function(\n data: any,\n onEcho: (a: any) => 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 opt_onComplete,\n opt_hash\n ) {\n if (opt_hash !== undefined) {\n opt_hash = newHash();\n }\n oldPut.call(this, pathString, data, opt_onComplete, opt_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 Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\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';\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.registerService(\n 'database',\n (app, unused, url) => RepoManager.getInstance().databaseFromApp(app, url),\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 null,\n true\n );\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","__generator","thisArg","body","f","y","g","_","label","sent","trys","ops","next","verb","throw","return","Symbol","iterator","v","op","TypeError","done","value","pop","push","e","step","__values","o","m","__read","r","ar","error","__spread","concat","CONSTANTS","NODE_CLIENT","NODE_ADMIN","SDK_VERSION","assert","assertion","message","assertionError","Error","stringToByteArray","str","out","c","charCodeAt","atob","Base64","ENCODED_VALS_BASE","input","webSafe","isArray","init_","byteToCharMap","byteToCharMapWebSafe_","byteToCharMap_","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","join","HAS_NATIVE_SUPPORT","btoa","encodeByteArray","bytes","pos","c1","String","fromCharCode","c2","u","c3","byteArrayToString","decodeStringToByteArray","charToByteMap","charToByteMapWebSafe_","charToByteMap_","charAt","byte4","ENCODED_VALS","ENCODED_VALS_WEBSAFE","base64Decode","base64","decodeString","console","deepCopy","deepExtend","target","source","Date","dateValue","getTime","undefined","prop","promise","Promise","resolve","reject","_this","Deferred","callback","catch","isMobileCordova","window","test","navigator","isNodeSdk","code","_super","FirebaseError","captureStackTrace","ErrorFactory","tslib_1.__extends","service","serviceName","errors","_i","data","customData","fullCode","template","replace","PATTERN","key","toString","fullMessage","_b","tslib_1.__values","keys","slice","warn","jsonEval","JSON","parse","stringify","decode","token","header","claims","signature","parts","split","contains","obj","safeGet","isEmpty","map","fn","contextObj","res","blockSize","pad_","reset","Sha1","chain_","inbuf_","total_","buf","offset","W","W_","k","a","lengthMinusBlock","buf_","inbuf","compress_","digest","totalBits","update","j","validateArgCount","fnName","minCount","maxCount","argCount","argError","errorPrefix","argumentNumber","optional","argName","validateCallback","validateContextObject","context","LogLevel","stringLength","id","defaultLogLevel","INFO","defaultLogHandler","instance","logType","args","logLevel","now","toISOString","DEBUG","VERBOSE","log","name","info","WARN","ERROR","Logger","_logLevel","val","_logHandler","domStorage_","DOMStorageWrapper","removeItem","prefixedName_","setItem","storedVal","getItem","prefix_","MemoryStorage","cache_","createStoragefor","domStorageName","domStorage","PersistentStorage","SessionStorage","logClient","LUIDGenerator","sha1","utf8Bytes","high","sha1Bytes","buildLogMessage_","var_args","logger","firstLog_","enableLogging","logger_","persistent","bind","set","remove","get","logWrapper","prefix","fatal","isInvalidJSONNumber","Number","POSITIVE_INFINITY","NEGATIVE_INFINITY","MIN_NAME","MAX_NAME","nameCompare","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","ObjectToUniqueKey","sort","splitStringBySize","segsize","len","dataSegs","substring","each","doubleToIEEE754String","ln","bits","Infinity","Math","abs","pow","min","floor","LN2","round","reverse","hexByteString","hexByte","parseInt","substr","toLowerCase","INTEGER_REGEXP_","RegExp","intVal","exceptionGuard","setTimeout","stack","setTimeoutNonBlocking","time","timeout","pathOrString","pieceNum","pieces_","copyTo","pieceNum_","Path","pathString","encodeURIComponent","begin","pieces","childPathObj","childPieces","outerPath","innerPath","outer","getFront","inner","relativePath","popFront","left","right","leftKeys","rightKeys","cmp","other","getLength","path","errorPrefix_","parts_","byteLength_","max","checkValid_","ValidationPath","child","last","MAX_PATH_LENGTH_BYTES","MAX_PATH_DEPTH","toErrorString","FORGE_DOMAIN","WEBSOCKET","LONG_POLLING","host","secure","namespace","webSocketOnly","persistenceKey","domain","indexOf","internalHost","RepoInfo","isCustomHost","newHost","isCacheableHost","type","params","connURL","needsQueryParam","pairs","toURLString","PUSH_CHARS","lastPushTime","lastRandChars","__EMPTY_NODE","MAX_NODE","parseRepoInfo","dataURL","parsedUrl","parseURL","subdomain","location","protocol","scheme","repoInfo","port","colonInd","slashInd","questionMarkInd","pathStringDecoded","piece","decodeURIComponent","decodePath","queryParams","queryString","results","segment","kv","decodeQuery","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","MAX_LEAF_SIZE_","isValidKey","isValidPathString","isValidPriority","priority","validateFirebaseDataArg","validateFirebaseData","errorPrefixFxn","path_","hasDotValue_1","hasActualChild_1","validateFirebaseMergeDataArg","mergePaths","curPath","getBack","comparePaths","prevPath","validateFirebaseMergePaths","validatePriority","validateEventType","eventType","validateKey","validatePathString","validateWritablePath","validateUrl","repo_","OnDisconnect","onComplete","deferred","onDisconnectCancel","wrapCallback","onDisconnectSet","onDisconnectSetWithPriority","objectToMerge","newObjectToMerge","onDisconnectUpdate","committed","snapshot","TransactionResult","toJSON","nextPushId","duplicateTime","timeStampChars","random","node","NamedNode","Index","compare","oldNode","newNode","oldWrapped","newWrapped","MIN","KeyIndex","indexValue","KEY_INDEX","__childrenNodeConstructor","nodeFromJSON","priorityHashText","validatePriorityNode","priorityNode","isLeafNode","getPriority","value_","priorityNode_","LeafNode","EMPTY_NODE","newPriorityNode","childName","childNode","newChildNode","updatePriority","updateImmediateChild","front","updateChild","index","action","exportFormat",".value","getValue",".priority","lazyHash_","toHash","compareToLeafNode_","otherLeaf","otherLeafType","thisLeafType","otherIndex","VALUE_TYPE_ORDER","thisIndex","equals","_defaultIndexMap","PRIORITY_INDEX","PriorityIndex","aPriority","bPriority","indexCmp","compareTo","startKey","comparator","isReverse_","resultGenerator_","nodeStack_","SortedMapIterator","result","color","LLRBNode","RED","SortedMap","count","inorderTraversal","reverseTraversal","min_","maxKey","copy","insert","fixUp_","isRed_","moveRedLeft_","removeMin_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","nr","blackDepth","check_","LLRBEmptyNode","comparator_","root_","BLACK","rightParent","minKey","resultGenerator","LOG_2","num","current_","mask","bits_","Base12Num","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","low","namedNode","middle","root","base12","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","nextBitIsOne","buildFrom12Array","fallbackObject","indexes_","indexSet_","IndexMap","indexKey","sortedMap","indexDefinition","existingChildren","newIndex","sawIndexedValue","iter","getIterator","Wrap","getNext","isDefinedOn","getCompare","indexName","newIndexSet","newIndexes","indexedChildren","existingSnap","newChildren","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","children_","indexMap_","ChildrenNode","Default","getImmediateChild","getChild","newIndexMap","removeFromIndexes","addToIndexes","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","__referenceConstructor","OperationType","VALUE_INDEX","ValueIndex","valueNode","indexPath_","PathIndex","snap","aChild","extractChild","bChild","node_","ref_","index_","DataSnapshot","exportVal","childPathString","childPath","childRef","getKey","numChildren","getRef","eventRegistration","prevName","DataEvent","ref","getParent","getEventRunner","getPath","CancelEvent","callback_","cancelCallback_","context_","ValueEventRegistration","change","query","getQueryParams","getIndex","snapshotNode","eventData","ctx","getEventType","cancelCB_1","cb_1","callbacks_","ChildEventRegistration","eventToCheck","cancelCB_2","cb_2","otherKeys","thisKeys","otherCount","every","otherKey","thisKey","repo","queryParams_","orderByCalled_","Query","startNode","endNode","hasStart","getIndexStartValue","hasEnd","getIndexEndValue","tooManyArgsError","wrongArgTypeError","getIndexStartName","getIndexEndName","hasLimit","hasAnchoredLimit","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","Map","SparseSnapshotTree","children","size","childKey","has","find","clear","remember","self_1","tree","forget","delete","prefixPath","func","forEachTree","forEach","resolveDeferredValue","serverValues","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","emptyChildrenSingleton","fromUser","fromServer","queryId","tagged","OperationSource","affectedTree","revert","ACK_USER_WRITE","User","AckUserWrite","subtree","Empty","ImmutableTree","childSnap","predicate","childExistingPathAndValue","findRootMostMatchingPathAndValue","toSet","newChild","newTree","setTree","fold_","pathSoFar","accum","findOnPath_","pathToFollow","nextChild","foreachOnPath_","currentRelativePath","foreach_","LISTEN_COMPLETE","ListenComplete","OVERWRITE","Overwrite","MERGE","Merge","fullyInitialized_","filtered_","CacheNode","isFullyInitialized","isCompleteForChild","hasChild","eventCache_","serverCache_","ViewCache","eventSnap","complete","filtered","serverSnap","getNode","oldSnap","Change","VALUE","CHILD_ADDED","CHILD_REMOVED","newSnapshot","oldSnapshot","CHILD_CHANGED","CHILD_MOVED","IndexedFilter","affectedPath","optChangeAccumulator","isIndexed","oldChild","trackChildChange","childRemovedChange","childAddedChange","childChangedChange","withIndex","newSnap","newPriority","ChildChangeAccumulator","oldChange","changeMap","oldType","from","values","NO_COMPLETE_CHILD_SOURCE","NoCompleteChildSource_","writes_","viewCache_","optCompleteServerCache_","WriteTreeCompleteChildSource","getEventCache","serverNode","getServerCache","calcCompleteChild","completeServerData","getCompleteServerSnap","nodes","calcIndexedSlice","viewCache","changes","filter_","ViewProcessor","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","calcCompleteEventCache","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","query_","EventGenerator","eventCache","eventRegistrations","events","moves","indexedValueChanged","childMovedChange","generateEventsForType_","registrations","filteredChanges","filter","compareChanges_","materializedChange","materializeSingleChange_","registration","respondsTo","createEvent","getPredecessorChildName","aWrapped","bWrapped","initialViewCache","indexFilter","getNodeFilter","processor_","initialServerCache","initialEventCache","eventGenerator_","View","cache","loadsAllData","eventRegistrations_","cancelError","cancelEvents","path_1","maybeEvent","createCancelEvent","remaining","existing","matches","hasAnyCallback","applyOperation","assertIndexed","generateEventsForChanges_","initialChanges","generateEventsForChanges","SyncPoint","views","optCompleteServerCache","view","serverCacheComplete","eventCacheComplete","addEventRegistration","getInitialEvents","removed","hadCompleteView","hasCompleteView","entries","_d","viewQueryId","removeEventRegistration","getQuery","getCompleteServerCache","getCompleteView","viewForQuery","writeTree_","CompoundWrite","rootmost","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","listenProvider_","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_","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","app_","AuthTokenProvider","forceRefresh","then","errorMessage","options","StatsCollection","amount","counters_","StatsManager","hashString","collections_","creatorFunction","reporters_","collection_","StatsListener","newStats","delta","last_","stat","collection","server_","statsListener_","reportStats_","StatsReporter","statsToReport_","stats","reportedStats","haveStatsToReport","reportStats","EventQueue","eventDataList","currList","eventPath","eventLists_","EventList","add","queueEvents","raiseQueuedEventsMatchingPredicate_","changedPath","recursionDepth_","sentAll","eventList","raise","events_","eventFn","allowedEvents_","EventEmitter","listeners_","listeners","validateEventType_","getInitialEvent","et","hidden","visibilityChange","document","addEventListener","visible_","trigger","VisibilityMonitor","online_","OnlineMonitor","onMessage_","PacketReceiver","responseNum","closeAfterResponse","onClose","currentResponseNum","requestNum","pendingResponses","toProcess","this_1","connId","transportSessionId","lastSessionId","log_","stats_","getCollection","urlFn","connectionURL","BrowserPollConnection","onMessage","onDisconnect","curSegmentNum","onDisconnect_","myPacketOrderer","isClosed_","connectTimeoutTimer_","onClosed_","readyState","called_1","wrappedFn_1","attachEvent","executeWhenDOMReady","scriptTagHolder","FirebaseIFrameScriptHolder","_a","command","arg1","arg2","incrementIncomingBytes_","clearTimeout","everConnected_","password","sendNewPolls","closeAfter","pN","handleResponse","urlParams","start","uniqueCallbackIdentifier","href","connectURL","addTag","startLongPoll","addDisconnectPingFrame","forceAllow_","forceDisallow_","createElement","Windows","UI","close","myDisconnFrame","removeChild","shutdown_","dataStr","bytesSent","incrementCounter","base64data","MAX_URL_DATA_SIZE","enqueueSegment","pw","dframe","src","style","display","appendChild","bytesReceived","commandCB","onMessageCB","Set","myIFrame","createIFrame_","script","iframeContents","doc","open","iframe","contentWindow","contentDocument","alive","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","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","connectionURL_","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","initTransports_","TransportManager","isWebSocketsAvailable","isSkipPollConnection","previouslyFailed","transports_","transports","ALL_TRANSPORTS","transport","repoInfo_","onReady_","onKill_","transportManager_","start_","Connection","conn","initialTransport","conn_","nextTransportId_","primaryResponsesRequired_","onMessageReceived","connReceiver_","onConnectionLost","disconnReceiver_","tx_","rx_","secondaryConn_","isHealthy_","healthyTimeout_ms","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_","ServerActions","onDataUpdate_","onConnectStatus_","onServerInfoUpdate_","authTokenProvider_","authOverride_","PersistentConnection","nextPersistentConnectionId_","scheduleConnect_","getInstance","onVisible_","onOnline_","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","invalidAuthTokenCount_","onAuthRevoked_","sendUnlisten_","queryObj","sendOnDisconnect_","onDisconnectRequestQueue_","request","response","putInternal","outstandingPuts_","outstandingPutCount_","sendPut_","queued","errorReason","reqNum","onDataPush_","onListenRevoked_","onSecurityDebugPacket_","lastConnectionEstablishedTime_","handleTimestamp_","firstConnection_","sendConnectStats_","restoreState_","establishConnectionTimer_","establishConnection_","reconnectDelay_","online","cancelSentTransactions_","shouldReconnect_","lastConnectionAttemptTime_","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage_1","onReady_1","onDisconnect_1","onRealtimeDisconnect_","connId_1","nextConnectionId_","lastSessionId_1","canceled_1","connection_1","closeFn_1","forceTokenRefresh_","getToken","accessToken","interrupt","interruptReasons_","serverTimeOffset","put","q","listen","normalizedPathString","statusCode","explanation","notifyForInvalidToken","securityDebugCallback_","_c","_e","currentlyOnline","ReadonlyRestClient","listenId","getListenId_","thisListen","listens_","queryStringParameters","toRestQueryStringParameters","restRequest_","authTokenData","authToken","querystringParams","arrayVal","querystring","xhr","XMLHttpRequest","responseText","INTERRUPT_REASON","forceRestClient","app","authTokenProvider","search","authOverride","persistentConnection_","addTokenChangeListener","refreshAuthToken","statsReporter_","getOrCreateReporter","transactions_init_","infoData_","infoSyncTree_","infoEvents","applyServerOverwrite","updateInfo_","serverSyncTree_","eventQueue_","raiseEventsForChangedPath","unlisten","Repo","serverTime","isMerge","dataUpdateCount","interceptServerDataCallback_","taggedChildren","raw","applyTaggedQueryMerge","taggedSnap","applyTaggedQueryOverwrite","applyServerMerge","rerunTransactions_","connectStatus","runOnDisconnectEvents_","updateSnapshot","nextWriteId_","newVal","generateServerValues","newNodeUnresolved","getNextWriteId_","applyUserOverwrite","success","clearEvents","callOnCompleteCallback","abortTransactions_","childrenToMerge","empty","changedKey","changedValue","writeId_1","applyUserMerge","resolvedTree","resolvedOnDisconnectTree","onDisconnectPut","onDisconnectMerge","raiseEventsAtPath","resume","showDelta","longestName","reduce","previousValue","currentValue","paddedStat","metric","includeStat","__database","Database","indexedFilter_","startPost_","RangedFilter","getStartPost_","endPost_","getEndPost_","getStartPost","getEndPost","self","startName","makePost","endName","rangedFilter_","limit_","getLimit","reverse_","isViewFromLeft","LimitedFilter","fullLimitUpdateChild_","hasNext","getReverseIterator","indexCompare_1","foundStartPost","changeAccumulator","indexCmp_1","newChildNamedNode","windowBoundary","getFirstChild","getLastChild","inRange","oldChildSnap","getChildAfterChild","compareNext","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","DEFAULT","Reference","parentPath","database","setWithPriority","transactionUpdate","applyLocally","bool","validateBoolean","startTransaction","thennablePushRef","pushRef","databaseProp","getRoot","TransactionStatus","name_","parent_","TreeNode","Tree","pathObj","updateParents_","childCount","hasChildren","includeSelf","childrenFirst","forEachDescendant","forEachImmediateDescendantWithValue","updateChild_","childEmpty","childExists","MAX_TRANSACTION_RETRIES_","transactionQueueTree_","valueCallback","watchRef","transaction","order","retryCount","unwatcher","abortReason","currentWriteId","currentInputSnapshot","currentOutputSnapshotRaw","currentOutputSnapshotResolved","currentState","getLatestState_","RUN","queueNode","subTree","nodeQueue","setValue","priorityForNode","sendReadyTransactions_","excludeSets","pruneCompletedTransactionsBelowNode_","queue","buildTransactionQueue_","sendTransactionQueue_","setsToIgnore","txn","latestState","snapToSend","latestHash","SENT","dataToSend","pathToSend","COMPLETED","SENT_NEEDS_ABORT","NEEDS_ABORT","rootMostTransactionNode","getAncestorTransactionNode_","rerunTransactionQueue_","abortTransaction","currentNode","newDataNode","oldWriteId","newNodeResolved","lastInput","transactionNode","transactionQueue","aggregateTransactionQueuesForNode_","to","forEachAncestor","abortTransactionsOnNode_","lastSent","_staticInstance","DATABASE_URL_OPTION","RepoManager","appName","repos_","dbUrl","createRepo","appRepos","useRestClient_","INTERNAL","DatabaseInternals","checkDeleted_","refFromURL","apiName","parsedURL","TIMESTAMP",".sv","generator","deleteRepo","P","_arguments","fulfilled","rejected","forceDisallow","forceAllow","statsIncrementCounter","interceptServerData_","DataConnection","simpleListen","echo","onEcho","RealTimeConnection","ConnectionTarget","newHash","oldPut","opt_onComplete","opt_hash","ServerValue","firebase","registerService","unused","databaseFromApp","TEST_ACCESS"],"mappings":"4RAgBA,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,YAqCzB,SAASI,EAAYC,EAASC,GACjC,IAAsGC,EAAGC,EAAGZ,EAAGa,EAA3GC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPhB,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,IAAOiB,KAAM,GAAIC,IAAK,IAChG,OAAOL,EAAI,CAAEM,KAAMC,EAAK,GAAIC,MAASD,EAAK,GAAIE,OAAUF,EAAK,IAAwB,mBAAXG,SAA0BV,EAAEU,OAAOC,UAAY,WAAa,OAAO9B,OAAUmB,EACvJ,SAASO,EAAKjB,GAAK,OAAO,SAAUsB,GAAK,OACzC,SAAcC,GACV,GAAIf,EAAG,MAAM,IAAIgB,UAAU,mCAC3B,KAAOb,GAAG,IACN,GAAIH,EAAI,EAAGC,IAAMZ,EAAY,EAAR0B,EAAG,GAASd,EAAU,OAAIc,EAAG,GAAKd,EAAS,SAAOZ,EAAIY,EAAU,SAAMZ,EAAEM,KAAKM,GAAI,GAAKA,EAAEO,SAAWnB,EAAIA,EAAEM,KAAKM,EAAGc,EAAG,KAAKE,KAAM,OAAO5B,EAE3J,OADIY,EAAI,EAAGZ,IAAG0B,EAAK,CAAS,EAARA,EAAG,GAAQ1B,EAAE6B,QACzBH,EAAG,IACP,KAAK,EAAG,KAAK,EAAG1B,EAAI0B,EAAI,MACxB,KAAK,EAAc,OAAXZ,EAAEC,QAAgB,CAAEc,MAAOH,EAAG,GAAIE,MAAM,GAChD,KAAK,EAAGd,EAAEC,QAASH,EAAIc,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKZ,EAAEI,IAAIY,MAAOhB,EAAEG,KAAKa,MAAO,SACxC,QACI,KAAkB9B,EAAe,GAA3BA,EAAIc,EAAEG,MAAYZ,QAAcL,EAAEA,EAAEK,OAAS,MAAkB,IAAVqB,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEZ,EAAI,EAAG,SACjG,GAAc,IAAVY,EAAG,MAAc1B,GAAM0B,EAAG,GAAK1B,EAAE,IAAM0B,EAAG,GAAK1B,EAAE,IAAM,CAAEc,EAAEC,MAAQW,EAAG,GAAI,MAC9E,GAAc,IAAVA,EAAG,IAAYZ,EAAEC,MAAQf,EAAE,GAAI,CAAEc,EAAEC,MAAQf,EAAE,GAAIA,EAAI0B,EAAI,MAC7D,GAAI1B,GAAKc,EAAEC,MAAQf,EAAE,GAAI,CAAEc,EAAEC,MAAQf,EAAE,GAAIc,EAAEI,IAAIa,KAAKL,GAAK,MACvD1B,EAAE,IAAIc,EAAEI,IAAIY,MAChBhB,EAAEG,KAAKa,MAAO,SAEtBJ,EAAKhB,EAAKJ,KAAKG,EAASK,GAC1B,MAAOkB,GAAKN,EAAK,CAAC,EAAGM,GAAIpB,EAAI,UAAeD,EAAIX,EAAI,EACtD,GAAY,EAAR0B,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEG,MAAOH,EAAG,GAAKA,EAAG,QAAK,EAAQE,MAAM,GArB9BK,CAAK,CAAC9B,EAAGsB,MA6BtD,SAASS,EAASC,GACrB,IAAIC,EAAsB,mBAAXb,QAAyBY,EAAEZ,OAAOC,UAAWtB,EAAI,EAChE,OAAIkC,EAAUA,EAAE9B,KAAK6B,GACd,CACHhB,KAAM,WAEF,OADIgB,GAAKjC,GAAKiC,EAAE9B,SAAQ8B,OAAI,GACrB,CAAEN,MAAOM,GAAKA,EAAEjC,KAAM0B,MAAOO,KAKzC,SAASE,EAAOF,EAAGhC,GACtB,IAAIiC,EAAsB,mBAAXb,QAAyBY,EAAEZ,OAAOC,UACjD,IAAKY,EAAG,OAAOD,EACf,IAAmBG,EAAYN,EAA3B9B,EAAIkC,EAAE9B,KAAK6B,GAAOI,EAAK,GAC3B,IACI,WAAc,IAANpC,GAAsB,EAANA,QAAcmC,EAAIpC,EAAEiB,QAAQS,MAAMW,EAAGR,KAAKO,EAAET,OAExE,MAAOW,GAASR,EAAI,CAAEQ,MAAOA,WAEzB,IACQF,IAAMA,EAAEV,OAASQ,EAAIlC,EAAU,SAAIkC,EAAE9B,KAAKJ,WAExC,GAAI8B,EAAG,MAAMA,EAAEQ,OAE7B,OAAOD,EAGJ,SAASE,IACZ,IAAK,IAAIF,EAAK,GAAIrC,EAAI,EAAGA,EAAIE,UAAUC,OAAQH,IAC3CqC,EAAKA,EAAGG,OAAOL,EAAOjC,UAAUF,KACpC,OAAOqC,ECpHX,IAAaI,EAAY,CAIvBC,aAAa,EAIbC,YAAY,EAKZC,YAAa,qBCZFC,EAAS,SAASC,EAAoBC,GACjD,IAAKD,EACH,MAAME,EAAeD,IAOZC,EAAiB,SAASD,GACrC,OAAO,IAAIE,MACT,sBACER,EAAUG,YACV,6BACAG,ICnBAG,EAAoB,SAASC,GAIjC,IAFA,IAAMC,EAAgB,GAClBhE,EAAI,EACCY,EAAI,EAAGA,EAAImD,EAAIhD,OAAQH,IAAK,CACnC,IAAIqD,EAAIF,EAAIG,WAAWtD,GAErBoD,EAAIhE,KADFiE,EAAI,IACKA,GAEXD,EAAIhE,KADKiE,EAAI,KACDA,GAAK,EAAK,KAGL,QAAZ,MAAJA,IACDrD,EAAI,EAAImD,EAAIhD,QACyB,QAAZ,MAAxBgD,EAAIG,WAAWtD,EAAI,KAGpBqD,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBF,EAAIG,aAAatD,IACvDoD,EAAIhE,KAAQiE,GAAK,GAAM,IACvBD,EAAIhE,KAASiE,GAAK,GAAM,GAAM,KAI9BD,EAAIhE,KAAQiE,GAAK,GAAM,IAHVA,GAAK,EAAK,GAAM,KAVb,GAAJA,EAAU,KAkB1B,OAAOD,gBA2CT,aAIE5D,oBAAmD,KAKnDA,oBAAmD,KAKnDA,2BAA0D,KAK1DA,2BAA0D,KAM1DA,uBACE,iEAsBFA,wBAA8C,mBAAT+D,KAgLvC,OAjMEvE,sBAAIwE,gCAAJ,WACE,OAAOhE,KAAKiE,kBAAoB,uCAMlCzE,sBAAIwE,wCAAJ,WACE,OAAOhE,KAAKiE,kBAAoB,uCAoBlCD,4BAAA,SAAgBE,EAA8BC,GAC5C,IAAKxE,MAAMyE,QAAQF,GACjB,MAAMT,MAAM,iDAGdzD,KAAKqE,QAQL,IANA,IAAMC,EAAgBH,EAClBnE,KAAKuE,sBACLvE,KAAKwE,eAEHC,EAAS,GAENjE,EAAI,EAAGA,EAAI0D,EAAMvD,OAAQH,GAAK,EAAG,CACxC,IAAMkE,EAAQR,EAAM1D,GACdmE,EAAYnE,EAAI,EAAI0D,EAAMvD,OAC1BiE,EAAQD,EAAYT,EAAM1D,EAAI,GAAK,EACnCqE,EAAYrE,EAAI,EAAI0D,EAAMvD,OAC1BmE,EAAQD,EAAYX,EAAM1D,EAAI,GAAK,EAEnCuE,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,EAAOpC,KACLiC,EAAcS,GACdT,EAAcU,GACdV,EAAcW,GACdX,EAAcY,IAIlB,OAAOT,EAAOU,KAAK,KAWrBnB,yBAAA,SAAaE,EAAeC,GAG1B,OAAInE,KAAKoF,qBAAuBjB,EACvBkB,KAAKnB,GAEPlE,KAAKsF,gBAAgB5B,EAAkBQ,GAAQC,IAWxDH,yBAAA,SAAaE,EAAeC,GAG1B,OAAInE,KAAKoF,qBAAuBjB,EACvBJ,KAAKG,GAtKQ,SAASqB,GAKjC,IAHA,IAAM3B,EAAgB,GAClB4B,EAAM,EACR3B,EAAI,EACC2B,EAAMD,EAAM5E,QAAQ,CACzB,IAAM8E,EAAKF,EAAMC,KACjB,GAAIC,EAAK,IACP7B,EAAIC,KAAO6B,OAAOC,aAAaF,QAC1B,GAAS,IAALA,GAAYA,EAAK,IAAK,CAC/B,IAAMG,EAAKL,EAAMC,KACjB5B,EAAIC,KAAO6B,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,MACF5B,EAAIC,KAAO6B,OAAOC,aAAa,OAAUE,GAAK,KAC9CjC,EAAIC,KAAO6B,OAAOC,aAAa,OAAc,KAAJE,QACpC,CACCD,EAAKL,EAAMC,KAAjB,IACMM,EAAKP,EAAMC,KACjB5B,EAAIC,KAAO6B,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,IAI9C,OAAOlC,EAAIuB,KAAK,IA0IPY,CAAkB/F,KAAKgG,wBAAwB9B,EAAOC,KAkB/DH,oCAAA,SAAwBE,EAAeC,GACrCnE,KAAKqE,QAQL,IANA,IAAM4B,EAAgB9B,EAClBnE,KAAKkG,sBACLlG,KAAKmG,eAEH1B,EAAmB,GAEhBjE,EAAI,EAAGA,EAAI0D,EAAMvD,QAAU,CAClC,IAAM+D,EAAQuB,EAAc/B,EAAMkC,OAAO5F,MAGnCoE,EADYpE,EAAI0D,EAAMvD,OACFsF,EAAc/B,EAAMkC,OAAO5F,IAAM,EAIrDsE,IAHJtE,EAEoB0D,EAAMvD,OACFsF,EAAc/B,EAAMkC,OAAO5F,IAAM,GAIrD6F,IAHJ7F,EAEoB0D,EAAMvD,OACFsF,EAAc/B,EAAMkC,OAAO5F,IAAM,GAG3D,KAFEA,EAEW,MAATkE,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATuB,EACrD,MAAM5C,QAGR,IAAMsB,EAAYL,GAAS,EAAME,GAAS,EAG1C,GAFAH,EAAOpC,KAAK0C,GAEE,KAAVD,EAAc,CAChB,IAAME,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGnD,GAFAL,EAAOpC,KAAK2C,GAEE,KAAVqB,EAAc,CAChB,IAAMpB,EAAaH,GAAS,EAAK,IAAQuB,EACzC5B,EAAOpC,KAAK4C,KAKlB,OAAOR,GAQTT,kBAAA,WACE,IAAKhE,KAAKwE,eAAgB,CACxBxE,KAAKwE,eAAiB,GACtBxE,KAAKmG,eAAiB,GACtBnG,KAAKuE,sBAAwB,GAC7BvE,KAAKkG,sBAAwB,GAG7B,IAAK,IAAI1F,EAAI,EAAGA,EAAIR,KAAKsG,aAAa3F,OAAQH,IAC5CR,KAAKwE,eAAehE,GAAKR,KAAKsG,aAAaF,OAAO5F,GAClDR,KAAKmG,eAAenG,KAAKwE,eAAehE,IAAMA,EAC9CR,KAAKuE,sBAAsB/D,GAAKR,KAAKuG,qBAAqBH,OAAO5F,IACjER,KAAKkG,sBAAsBlG,KAAKuE,sBAAsB/D,IAAMA,IAGnDR,KAAKiE,kBAAkBtD,SAC9BX,KAAKmG,eAAenG,KAAKuG,qBAAqBH,OAAO5F,IAAMA,EAC3DR,KAAKkG,sBAAsBlG,KAAKsG,aAAaF,OAAO5F,IAAMA,UAwBvDgG,EAAe,SAAS7C,GACnC,IACE,OAAO8C,EAAOC,aAAa/C,GAAK,GAChC,MAAOrB,GACPqE,QAAQ7D,MAAM,wBAAyBR,GAEzC,OAAO,MAGImE,EAAS,IAAIzC,EChU1B,SAAgB4C,EAAYzE,GAC1B,OAeF,SAAgB0E,EAAWC,EAAiBC,GAC1C,KAAMA,aAAkBvH,QACtB,OAAOuH,EAGT,OAAQA,EAAO9G,aACb,KAAK+G,KAGH,IAAMC,EAAYF,EAClB,OAAO,IAAIC,KAAKC,EAAUC,WAE5B,KAAK1H,YACY2H,IAAXL,IACFA,EAAS,IAEX,MAEF,KAAKnH,MAEHmH,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,IAAMK,KAAQL,EACZA,EAAOlH,eAAeuH,KAG1BN,EAAsCM,GAAQP,EAC5CC,EAAsCM,GACtCL,EAAsCK,KAI3C,OAAON,EArDAD,MAAWM,EAAWhF,GCJ/B,iBAIE,aAAA,WAFAnC,YAAoC,aACpCA,aAAqC,aAEnCA,KAAKqH,QAAU,IAAIC,QAAQ,SAACC,EAASC,GACnCC,EAAKF,QAAUA,EACfE,EAAKD,OAASA,IAiCpB,OAxBEE,yBAAA,SACEC,GADF,WAGE,OAAO,SAAC7E,EAAOX,GACTW,EACF2E,EAAKD,OAAO1E,GAEZ2E,EAAKF,QAAQpF,GAES,mBAAbwF,IAGTF,EAAKJ,QAAQO,MAAM,cAIK,IAApBD,EAAShH,OACXgH,EAAS7E,GAET6E,EAAS7E,EAAOX,WCX1B,SAAgB0F,IACd,MACoB,oBAAXC,WAGJA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDC,KAtB/B,oBAAdC,WAC2B,iBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,IA4DX,SAAgBC,IACd,OAAkE,IAA3DhF,EAA4CE,WC9BrD,kBA6BE,WAAqB+E,EAAc3E,GAAnC,MACE4E,YAAM5E,gBADakE,OAAAS,EAFZT,OA3BQ,gBAkCfjI,OAAOC,eAAegI,EAAMW,EAAclI,WAItCuD,MAAM4E,mBACR5E,MAAM4E,kBAAkBZ,EAAMa,EAAapI,UAAUC,UAG3D,OAhBmCoI,UAAA9E,oBAsBjC,WACmB+E,EACAC,EACAC,GAFA1I,aAAAwI,EACAxI,iBAAAyI,EACAzI,YAAA0I,EAiCrB,OA9BEJ,mBAAA,SACEJ,wBACAS,mBAAAA,IAAAC,oBAEA,IA4BuCA,EA5BjCC,EAAcD,EAAK,IAAoB,GACvCE,EAAc9I,KAAKwI,YAAWN,EAC9Ba,EAAW/I,KAAK0I,OAAOR,GAEvB3E,EAAUwF,GAwBuBH,EAxBcC,EAAVE,EAyB7BC,QAAQC,EAAS,SAAC7H,EAAG8H,GACnC,IAAM/G,EAAQyG,EAAKM,GACnB,OAAgB,MAAT/G,EAAgBA,EAAMgH,WAAa,IAAID,UA3BqB,QAE7DE,EAAiBpJ,KAAKyI,iBAAgBlF,OAAYuF,OAElDhG,EAAQ,IAAIsF,EAAcU,EAAUM,OAK1C,IAAkB,IAAAC,EAAAC,EAAA9J,OAAO+J,KAAKV,kCAAa,CAAtC,IAAMK,UACa,MAAlBA,EAAIM,OAAO,KACTN,KAAOpG,GACT6D,QAAQ8C,KACN,yCAAyCP,sCAG7CpG,EAAMoG,GAAOL,EAAWK,sGAI5B,OAAOpG,QAWX,IAAMmG,EAAU,gBCnIhB,SAAgBS,EAAS/F,GACvB,OAAOgG,KAAKC,MAAMjG,GAQpB,SAAgBkG,EAAUjB,GACxB,OAAOe,KAAKE,UAAUjB,GCKxB,IAAakB,EAAS,SAASC,GAC7B,IAAIC,EAAS,GACXC,EAAiB,GACjBrB,EAAO,GACPsB,EAAY,GAEd,IACE,IAAMC,EAAQJ,EAAMK,MAAM,KAC1BJ,EAASN,EAASlD,EAAa2D,EAAM,KAAO,IAC5CF,EAASP,EAASlD,EAAa2D,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBvB,EAAOqB,EAAU,GAAK,UACfA,EAAU,EACjB,MAAO3H,IAET,MAAO,CACL0H,SACAC,SACArB,OACAsB,cCxCJ,SAAgBG,EAA2BC,EAAQpB,GACjD,OAAO1J,OAAOU,UAAUL,eAAee,KAAK0J,EAAKpB,GAGnD,SAAgBqB,EACdD,EACApB,GAEA,OAAI1J,OAAOU,UAAUL,eAAee,KAAK0J,EAAKpB,GACrCoB,EAAIpB,QAEX,EAIJ,SAAgBsB,EAAQF,GACtB,IAAK,IAAMpB,KAAOoB,EAChB,GAAI9K,OAAOU,UAAUL,eAAee,KAAK0J,EAAKpB,GAC5C,OAAO,EAGX,OAAO,EAGT,SAAgBuB,EACdH,EACAI,EACAC,GAEA,IAAMC,EAAkC,GACxC,IAAK,IAAM1B,KAAOoB,EACZ9K,OAAOU,UAAUL,eAAee,KAAK0J,EAAKpB,KAC5C0B,EAAI1B,GAAOwB,EAAG9J,KAAK+J,EAAYL,EAAIpB,GAAMA,EAAKoB,IAGlD,OAAOM,ECXT,iBAuCE,aAjCQ5K,YAAmB,GAMnBA,UAAiB,GAOjBA,QAAe,GAMfA,UAAiB,GAKjBA,YAAiB,EAKjBA,YAAiB,EAKvBA,KAAK6K,UAAY,GAEjB7K,KAAK8K,KAAK,GAAK,IACf,IAAK,IAAItK,EAAI,EAAGA,EAAIR,KAAK6K,YAAarK,EACpCR,KAAK8K,KAAKtK,GAAK,EAGjBR,KAAK+K,QAiMT,OA9LEC,kBAAA,WACEhL,KAAKiL,OAAO,GAAK,WACjBjL,KAAKiL,OAAO,GAAK,WACjBjL,KAAKiL,OAAO,GAAK,WACjBjL,KAAKiL,OAAO,GAAK,UACjBjL,KAAKiL,OAAO,GAAK,WAEjBjL,KAAKkL,OAAS,EACdlL,KAAKmL,OAAS,GAShBH,sBAAA,SAAUI,EAAqCC,GACxCA,IACHA,EAAS,GAGX,IAAMC,EAAItL,KAAKuL,GAGf,GAAmB,iBAARH,EACT,IAAK,IAAI5K,EAAI,EAAGA,EAAI,GAAIA,IAStB8K,EAAE9K,GACC4K,EAAItH,WAAWuH,IAAW,GAC1BD,EAAItH,WAAWuH,EAAS,IAAM,GAC9BD,EAAItH,WAAWuH,EAAS,IAAM,EAC/BD,EAAItH,WAAWuH,EAAS,GAC1BA,GAAU,OAGZ,IAAS7K,EAAI,EAAGA,EAAI,GAAIA,IACtB8K,EAAE9K,GACC4K,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAAS7K,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAMF,EAAIgL,EAAE9K,EAAI,GAAK8K,EAAE9K,EAAI,GAAK8K,EAAE9K,EAAI,IAAM8K,EAAE9K,EAAI,IAClD8K,EAAE9K,GAA+B,YAAxBF,GAAK,EAAMA,IAAM,IAG5B,IAKIW,EAAGuK,EALHC,EAAIzL,KAAKiL,OAAO,GAChB1L,EAAIS,KAAKiL,OAAO,GAChBpH,EAAI7D,KAAKiL,OAAO,GAChB3L,EAAIU,KAAKiL,OAAO,GAChB3I,EAAItC,KAAKiL,OAAO,GAIpB,IAASzK,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAIvBgL,EAHAhL,EAAI,GACFA,EAAI,IACNS,EAAI3B,EAAKC,GAAKsE,EAAIvE,GACd,aAEJ2B,EAAI1B,EAAIsE,EAAIvE,EACR,YAGFkB,EAAI,IACNS,EAAK1B,EAAIsE,EAAMvE,GAAKC,EAAIsE,GACpB,aAEJ5C,EAAI1B,EAAIsE,EAAIvE,EACR,YAIFgB,GAAOmL,GAAK,EAAMA,IAAM,IAAOxK,EAAIqB,EAAIkJ,EAAIF,EAAE9K,GAAM,WACzD8B,EAAIhD,EACJA,EAAIuE,EACJA,EAA8B,YAAxBtE,GAAK,GAAOA,IAAM,GACxBA,EAAIkM,EACJA,EAAInL,EAGNN,KAAKiL,OAAO,GAAMjL,KAAKiL,OAAO,GAAKQ,EAAK,WACxCzL,KAAKiL,OAAO,GAAMjL,KAAKiL,OAAO,GAAK1L,EAAK,WACxCS,KAAKiL,OAAO,GAAMjL,KAAKiL,OAAO,GAAKpH,EAAK,WACxC7D,KAAKiL,OAAO,GAAMjL,KAAKiL,OAAO,GAAK3L,EAAK,WACxCU,KAAKiL,OAAO,GAAMjL,KAAKiL,OAAO,GAAK3I,EAAK,YAG1C0I,mBAAA,SAAOzF,EAAwC5E,GAE7C,GAAa,MAAT4E,EAAJ,MAIe4B,IAAXxG,IACFA,EAAS4E,EAAM5E,QAUjB,IAPA,IAAM+K,EAAmB/K,EAASX,KAAK6K,UACnCpK,EAAI,EAEF2K,EAAMpL,KAAK2L,KACbC,EAAQ5L,KAAKkL,OAGVzK,EAAIE,GAAQ,CAKjB,GAAc,IAAViL,EACF,KAAOnL,GAAKiL,GACV1L,KAAK6L,UAAUtG,EAAO9E,GACtBA,GAAKT,KAAK6K,UAId,GAAqB,iBAAVtF,GACT,KAAO9E,EAAIE,GAIT,GAHAyK,EAAIQ,GAASrG,EAAMzB,WAAWrD,KAE5BA,IADAmL,IAEY5L,KAAK6K,UAAW,CAC5B7K,KAAK6L,UAAUT,GACfQ,EAAQ,EAER,YAIJ,KAAOnL,EAAIE,GAIT,GAHAyK,EAAIQ,GAASrG,EAAM9E,KAEjBA,IADAmL,IAEY5L,KAAK6K,UAAW,CAC5B7K,KAAK6L,UAAUT,GACfQ,EAAQ,EAER,OAMR5L,KAAKkL,OAASU,EACd5L,KAAKmL,QAAUxK,IAIjBqK,mBAAA,WACE,IAAMc,EAAmB,GACrBC,EAA0B,EAAd/L,KAAKmL,OAGjBnL,KAAKkL,OAAS,GAChBlL,KAAKgM,OAAOhM,KAAK8K,KAAM,GAAK9K,KAAKkL,QAEjClL,KAAKgM,OAAOhM,KAAK8K,KAAM9K,KAAK6K,WAAa7K,KAAKkL,OAAS,KAIzD,IAAK,IAAI1K,EAAIR,KAAK6K,UAAY,EAAQ,IAALrK,EAASA,IACxCR,KAAK2L,KAAKnL,GAAiB,IAAZuL,EACfA,GAAa,IAGf/L,KAAK6L,UAAU7L,KAAK2L,MAEpB,IAAIlL,EAAI,EACR,IAASD,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIyL,EAAI,GAAS,GAALA,EAAQA,GAAK,EAC5BH,EAAOrL,GAAMT,KAAKiL,OAAOzK,IAAMyL,EAAK,MAClCxL,EAGN,OAAOqL,QC7PEI,EAAmB,SAC9BC,EACAC,EACAC,EACAC,GAEA,IAAIC,EAMJ,GALID,EAAWF,EACbG,EAAW,YAAcH,EACLC,EAAXC,IACTC,EAAwB,IAAbF,EAAiB,OAAS,gBAAkBA,GAErDE,EASF,MAAM,IAAI9I,MAPR0I,EACA,4BACAG,GACc,IAAbA,EAAiB,aAAe,eACjC,YACAC,EACA,MAaN,SAAgBC,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,IAAIjJ,MACR,mEAIN,IAAIX,EAAQqJ,EAAS,YAGrB,OADArJ,GAAS6J,EAAU,aA4BrB,SAAgBC,EACdT,EACAM,EACA9E,EACA+E,GAEA,KAAIA,GAAa/E,IAGO,mBAAbA,EACT,MAAM,IAAIlE,MACR+I,EAAYL,EAAQM,EAAgBC,GAClC,6BAKR,SAAgBG,EACdV,EACAM,EACAK,EACAJ,GAEA,KAAIA,GAAaI,KAGM,iBAAZA,GAAoC,OAAZA,GACjC,MAAM,IAAIrJ,MACR+I,EAAYL,EAAQM,EAAgBC,GAClC,mCC7GR,ICDYK,EAAAA,EDwCCC,EAAe,SAASrJ,GAEnC,IADA,IAAI/D,EAAI,EACCY,EAAI,EAAGA,EAAImD,EAAIhD,OAAQH,IAAK,CACnC,IAAMqD,EAAIF,EAAIG,WAAWtD,GACrBqD,EAAI,IACNjE,IACSiE,EAAI,KACbjE,GAAK,EACS,OAALiE,GAAeA,GAAK,OAE7BjE,GAAK,EACLY,KAEAZ,GAAK,EAGT,OAAOA,sXCxDGmN,EAAAA,IAAAA,0BAEVA,yBACAA,mBACAA,mBACAA,qBACAA,uBAMF,ICPME,EDOAC,EAA4BH,EAASI,KAkBrCC,EAAgC,SAACC,EAAUC,OAAS,aAAA3E,mBAAAA,IAAA4E,oBACxD,KAAID,EAAUD,EAASG,UAAvB,CAGA,IAAMC,GAAM,IAAIzG,MAAO0G,cACvB,OAAQJ,GAON,KAAKP,EAASY,MAGd,KAAKZ,EAASa,QACZjH,QAAQkH,UAARlH,WAAY,IAAI8G,QAASJ,EAASS,UAAYP,IAC9C,MACF,KAAKR,EAASI,KACZxG,QAAQoH,WAARpH,WAAa,IAAI8G,QAASJ,EAASS,UAAYP,IAC/C,MACF,KAAKR,EAASiB,KACZrH,QAAQ8C,WAAR9C,WAAa,IAAI8G,QAASJ,EAASS,UAAYP,IAC/C,MACF,KAAKR,EAASkB,MACZtH,QAAQ7D,YAAR6D,WAAc,IAAI8G,QAASJ,EAASS,UAAYP,IAChD,MACF,QACE,MAAM,IAAI9J,MACR,8DAA8D6J,uBAYpE,WAAmBQ,GAAA9N,UAAA8N,EAUX9N,eAAYkN,EAcZlN,iBAA0BoN,EA8BpC,OA3CE5N,sBAAI0O,4BAAJ,WACE,OAAOlO,KAAKmO,eAEd,SAAaC,GACX,KAAMA,KAAOrB,GACX,MAAM,IAAI9K,UAAU,wCAEtBjC,KAAKmO,UAAYC,mCAOnB5O,sBAAI0O,8BAAJ,WACE,OAAOlO,KAAKqO,iBAEd,SAAeD,GACb,GAAmB,mBAARA,EACT,MAAM,IAAInM,UAAU,qDAEtBjC,KAAKqO,YAAcD,mCAOrBF,kBAAA,eAAM,aAAAvF,mBAAAA,IAAA4E,kBACJvN,KAAKqO,kBAALrO,QAAiBA,KAAM+M,EAASY,OAAUJ,KAE5CW,gBAAA,eAAI,aAAAvF,mBAAAA,IAAA4E,kBACFvN,KAAKqO,kBAALrO,QAAiBA,KAAM+M,EAASa,SAAYL,KAE9CW,iBAAA,eAAK,aAAAvF,mBAAAA,IAAA4E,kBACHvN,KAAKqO,kBAALrO,QAAiBA,KAAM+M,EAASI,MAASI,KAE3CW,iBAAA,eAAK,aAAAvF,mBAAAA,IAAA4E,kBACHvN,KAAKqO,kBAALrO,QAAiBA,KAAM+M,EAASiB,MAAST,KAE3CW,kBAAA,eAAM,aAAAvF,mBAAAA,IAAA4E,kBACJvN,KAAKqO,kBAALrO,QAAiBA,KAAM+M,EAASkB,OAAUV,uBExH5C,WAAoBe,GAAAtO,iBAAAsO,EALZtO,aAAU,YAoDpB,OAzCEuO,gBAAA,SAAIrF,EAAa/G,GACF,MAATA,EACFnC,KAAKsO,YAAYE,WAAWxO,KAAKyO,cAAcvF,IAE/ClJ,KAAKsO,YAAYI,QAAQ1O,KAAKyO,cAAcvF,GAAMW,EAAU1H,KAQhEoM,gBAAA,SAAIrF,GACF,IAAMyF,EAAY3O,KAAKsO,YAAYM,QAAQ5O,KAAKyO,cAAcvF,IAC9D,OAAiB,MAAbyF,EACK,KAEAjF,EAASiF,IAOpBJ,mBAAA,SAAOrF,GACLlJ,KAAKsO,YAAYE,WAAWxO,KAAKyO,cAAcvF,KASjDqF,0BAAA,SAAcT,GACZ,OAAO9N,KAAK6O,QAAUf,GAGxBS,qBAAA,WACE,OAAOvO,KAAKsO,YAAYnF,8BCxD5B,aACUnJ,YAA+B,GAqBvCA,wBAAoB,EACtB,OApBE8O,gBAAA,SAAI5F,EAAa/G,GACF,MAATA,SACKnC,KAAK+O,OAAO7F,GAEnBlJ,KAAK+O,OAAO7F,GAAO/G,GAIvB2M,gBAAA,SAAI5F,GACF,OAAImB,EAASrK,KAAK+O,OAAQ7F,GACjBlJ,KAAK+O,OAAO7F,GAEd,MAGT4F,mBAAA,SAAO5F,UACElJ,KAAK+O,OAAO7F,SCbjB8F,EAAmB,SACvBC,GAEA,IAGE,GACoB,oBAAXnH,aAC2B,IAA3BA,OAAOmH,GACd,CAEA,IAAMC,EAAapH,OAAOmH,GAG1B,OAFAC,EAAWR,QAAQ,oBAAqB,SACxCQ,EAAWV,WAAW,qBACf,IAAID,EAAkBW,IAE/B,MAAO5M,IAIT,OAAO,IAAIwM,GAIAK,EAAoBH,EAAiB,gBAGrCI,EAAiBJ,EAAiB,kBH3BzCK,EAAY,IAAInB,EAAO,sBAMhBoB,GACPrC,EAAK,EACF,WACL,OAAOA,MASEsC,EAAO,SAAS5L,GAC3B,IAAM6L,EFhByB,SAAS7L,GAGxC,IAFA,IAAMC,EAAgB,GAClBhE,EAAI,EACCY,EAAI,EAAGA,EAAImD,EAAIhD,OAAQH,IAAK,CACnC,IAAIqD,EAAIF,EAAIG,WAAWtD,GAGvB,GAAS,OAALqD,GAAeA,GAAK,MAAQ,CAC9B,IAAM4L,EAAO5L,EAAI,MAEjBR,IADA7C,EACWmD,EAAIhD,OAAQ,2CAEvBkD,EAAI,OAAW4L,GAAQ,KADX9L,EAAIG,WAAWtD,GAAK,OAKhCoD,EAAIhE,KADFiE,EAAI,IACKA,GAEXD,EAAIhE,KADKiE,EAAI,KACDA,GAAK,EAAK,KAGtBD,EAAIhE,KADKiE,EAAI,MACDA,GAAK,GAAM,KAIvBD,EAAIhE,KAAQiE,GAAK,GAAM,IACVA,GAAK,GAAM,GAAM,KAJjBA,GAAK,EAAK,GAAM,KAHb,GAAJA,EAAU,KAY1B,OAAOD,EEfWF,CAAkBC,GAC9B4L,EAAO,IAAIvE,EACjBuE,EAAKvD,OAAOwD,GACZ,IAAME,EAAYH,EAAKzD,SACvB,OAAOrF,EAAOnB,gBAAgBoK,IAQ1BC,EAAmB,eAAS,aAAAhH,mBAAAA,IAAAiH,kBAEhC,IADA,IAAIrM,EAAU,GACL/C,EAAI,EAAGA,EAAIoP,EAASjP,OAAQH,IAEjCb,MAAMyE,QAAQwL,EAASpP,KACtBoP,EAASpP,IACe,iBAAhBoP,EAASpP,IACc,iBAAvBoP,EAASpP,GAAGG,OAErB4C,GAAWoM,EAAiB9O,MAAM,KAAM+O,EAASpP,IACjB,iBAAhBoP,EAASpP,GACzB+C,GAAWsG,EAAU+F,EAASpP,IAE9B+C,GAAWqM,EAASpP,GAEtB+C,GAAW,IAGb,OAAOA,GAOEsM,EAAuC,KAO9CC,GAAY,EAOHC,EAAgB,SAC3BC,EACAC,GAEA5M,GACG4M,IAA2B,IAAZD,IAAgC,IAAZA,EACpC,+CAEc,IAAZA,GACFX,EAAU7B,SAAWT,EAASa,QAC9BiC,EAASR,EAAUxB,IAAIqC,KAAKb,GACxBY,GAAYb,EAAee,IAAI,mBAAmB,IAC1B,mBAAZH,EAChBH,EAASG,GAETH,EAAS,KACTT,EAAegB,OAAO,qBAQbvC,GAAM,eAAS,aAAAlF,mBAAAA,IAAAiH,kBAO1B,IANkB,IAAdE,IACFA,GAAY,EACG,OAAXD,IAA6D,IAA1CT,EAAeiB,IAAI,oBACxCN,GAAc,IAGdF,EAAQ,CACV,IAAMtM,EAAUoM,EAAiB9O,MAAM,KAAM+O,GAC7CC,EAAOtM,KAQE+M,GAAa,SACxBC,GAEA,OAAO,eAAS,aAAA5H,mBAAAA,IAAAiH,kBACd/B,mBAAI0C,GAAWX,MAON9M,GAAQ,eAAS,aAAA6F,mBAAAA,IAAAiH,kBAC5B,IAAMrM,EAAU,4BAA8BoM,iBAAoBC,IAClEP,EAAUvM,MAAMS,IAMLiN,GAAQ,eAAS,aAAA7H,mBAAAA,IAAAiH,kBAC5B,IAAMrM,EAAU,yBAAyBoM,iBAAoBC,IAE7D,MADAP,EAAUvM,MAAMS,GACV,IAAIE,MAAMF,IAMLkG,GAAO,eAAS,aAAAd,mBAAAA,IAAAiH,kBAC3B,IAAMrM,EAAU,qBAAuBoM,iBAAoBC,IAC3DP,EAAU5F,KAAKlG,IAsCJkN,GAAsB,SAAS7H,GAC1C,MACkB,iBAATA,IACNA,GAAQA,GACPA,GAAQ8H,OAAOC,mBACf/H,GAAQ8H,OAAOE,oBAkDRC,GAAW,aAMXC,GAAW,aAQXC,GAAc,SAAStF,EAAWlM,GAC7C,GAAIkM,IAAMlM,EACR,OAAO,EACF,GAAIkM,IAAMoF,IAAYtR,IAAMuR,GACjC,OAAQ,EACH,GAAIvR,IAAMsR,IAAYpF,IAAMqF,GACjC,OAAO,EAEP,IAAME,EAASC,GAAYxF,GACzByF,EAASD,GAAY1R,GAEvB,OAAe,OAAXyR,EACa,OAAXE,EACKF,EAASE,GAAU,EAAIzF,EAAE9K,OAASpB,EAAEoB,OAASqQ,EAASE,GAErD,EAEU,OAAXA,EACF,EAEAzF,EAAIlM,GAAK,EAAI,GAUb4R,GAAgB,SAAS1F,EAAWlM,GAC/C,OAAIkM,IAAMlM,EACD,EACEkM,EAAIlM,GACL,EAED,GASE6R,GAAa,SACxBlI,EACAoB,GAEA,GAAIA,GAAOpB,KAAOoB,EAChB,OAAOA,EAAIpB,GAEX,MAAM,IAAIzF,MACR,yBAA2ByF,EAAM,gBAAkBW,EAAUS,KAStD+G,GAAoB,SAAS/G,GACxC,GAAmB,iBAARA,GAA4B,OAARA,EAAc,OAAOT,EAAUS,GAE9D,IAAMf,EAAO,GACb,IAAK,IAAIiC,KAAKlB,EACZf,EAAKlH,KAAKmJ,GAIZjC,EAAK+H,OAEL,IADA,IAAIpI,EAAM,IACD1I,EAAI,EAAGA,EAAI+I,EAAK5I,OAAQH,IACrB,IAANA,IAAS0I,GAAO,KACpBA,GAAOW,EAAUN,EAAK/I,IACtB0I,GAAO,IACPA,GAAOmI,GAAkB/G,EAAIf,EAAK/I,KAIpC,OADA0I,GAAO,KAUIqI,GAAoB,SAC/B5N,EACA6N,GAEA,IAAMC,EAAM9N,EAAIhD,OAEhB,GAAI8Q,GAAOD,EACT,MAAO,CAAC7N,GAIV,IADA,IAAM+N,EAAW,GACR7N,EAAI,EAAGA,EAAI4N,EAAK5N,GAAK2N,EACVC,EAAd5N,EAAI2N,EACNE,EAASrP,KAAKsB,EAAIgO,UAAU9N,EAAG4N,IAE/BC,EAASrP,KAAKsB,EAAIgO,UAAU9N,EAAGA,EAAI2N,IAGvC,OAAOE,GAST,SAAgBE,GAAKtH,EAAaI,GAChC,IAAK,IAAMxB,KAAOoB,EACZA,EAAIzK,eAAeqJ,IACrBwB,EAAGxB,EAAKoB,EAAIpB,IAyBX,IAAM2I,GAAwB,SAAS9P,GAC5CsB,GAAQoN,GAAoB1O,GAAI,uBAEhC,IAGExB,EACA+B,EACArB,EACA6Q,EACAtR,EACAuR,EACApO,EA0BF,IAtBU,IAAN5B,EAGFxB,EAAI,EAAIwB,IAAOiQ,GADf/Q,EADAqB,EAAI,GAEsB,EAAI,GAE9B/B,EAAIwB,EAAI,EAONd,GANFc,EAAIkQ,KAAKC,IAAInQ,KAEJkQ,KAAKE,IAAI,GAAG,OAGnB7P,GADAwP,EAAKG,KAAKG,IAAIH,KAAKI,MAAMJ,KAAKpE,IAAI9L,GAAKkQ,KAAKK,KArBrC,OAAA,KAuBHL,KAAKM,MAAMxQ,EAAIkQ,KAAKE,IAAI,EAxBtB,GAwBiCL,GAAMG,KAAKE,IAAI,EAxBhD,OA2BN7P,EAAI,EACA2P,KAAKM,MAAMxQ,EAAIkQ,KAAKE,IAAI,GAAG,SAKnCJ,EAAO,GACFvR,EAlCK,GAkCMA,EAAGA,GAAK,EACtBuR,EAAK1P,KAAKpB,EAAI,EAAI,EAAI,GACtBA,EAAIgR,KAAKI,MAAMpR,EAAI,GAErB,IAAKT,EAvCS,GAuCEA,EAAGA,GAAK,EACtBuR,EAAK1P,KAAKC,EAAI,EAAI,EAAI,GACtBA,EAAI2P,KAAKI,MAAM/P,EAAI,GAErByP,EAAK1P,KAAK9B,EAAI,EAAI,GAClBwR,EAAKS,UACL7O,EAAMoO,EAAK5M,KAAK,IAGhB,IAAIsN,EAAgB,GACpB,IAAKjS,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAIkS,EAAUC,SAAShP,EAAIiP,OAAOpS,EAAG,GAAI,GAAG2I,SAAS,IAC9B,IAAnBuJ,EAAQ/R,SAAc+R,EAAU,IAAMA,GAC1CD,GAAgCC,EAElC,OAAOD,EAAcI,eAwDVC,GAAkB,IAAIC,OAAO,iBAO7B9B,GAAc,SAAStN,GAClC,GAAImP,GAAgB/K,KAAKpE,GAAM,CAC7B,IAAMqP,EAAStC,OAAO/M,GACtB,IAAe,YAAXqP,GAAyBA,GAAU,WACrC,OAAOA,EAGX,OAAO,MAoBIC,GAAiB,SAASvI,GACrC,IACEA,IACA,MAAOpI,GAEP4Q,WAAW,WAKT,IAAMC,EAAQ7Q,EAAE6Q,OAAS,GAEzB,MADA1J,GAAK,yCAA0C0J,GACzC7Q,GACL2P,KAAKI,MAAM,MAoELe,GAAwB,SACnC1I,EACA2I,GAEA,IAAMC,EAA2BJ,WAAWxI,EAAI2I,GAIhD,MAHuB,iBAAZC,GAAyBA,EAAuB,OACxDA,EAAuB,QAEnBA,iBIzmBP,WAAYC,EAAiCC,GAC3C,QAAiB,IAAbA,EAAqB,CACvBxT,KAAKyT,QAAWF,EAAwBnJ,MAAM,KAI9C,IADA,IAAIsJ,EAAS,EACJlT,EAAI,EAAGA,EAAIR,KAAKyT,QAAQ9S,OAAQH,IACV,EAAzBR,KAAKyT,QAAQjT,GAAGG,SAClBX,KAAKyT,QAAQC,GAAU1T,KAAKyT,QAAQjT,GACpCkT,KAGJ1T,KAAKyT,QAAQ9S,OAAS+S,EAEtB1T,KAAK2T,UAAY,OAEjB3T,KAAKyT,QAAUF,EACfvT,KAAK2T,UAAYH,EAqMvB,OA/NEhU,sBAAWoU,eAAX,WACE,OAAO,IAAIA,EAAK,qCA6BlBA,qBAAA,WACE,OAAI5T,KAAK2T,WAAa3T,KAAKyT,QAAQ9S,OAAe,KAE3CX,KAAKyT,QAAQzT,KAAK2T,YAM3BC,sBAAA,WACE,OAAO5T,KAAKyT,QAAQ9S,OAASX,KAAK2T,WAMpCC,qBAAA,WACE,IAAIJ,EAAWxT,KAAK2T,UAIpB,OAHIH,EAAWxT,KAAKyT,QAAQ9S,QAC1B6S,IAEK,IAAII,EAAK5T,KAAKyT,QAASD,IAMhCI,oBAAA,WACE,OAAI5T,KAAK2T,UAAY3T,KAAKyT,QAAQ9S,OACzBX,KAAKyT,QAAQzT,KAAKyT,QAAQ9S,OAAS,GAErC,MAGTiT,qBAAA,WAEE,IADA,IAAIC,EAAa,GACRrT,EAAIR,KAAK2T,UAAWnT,EAAIR,KAAKyT,QAAQ9S,OAAQH,IAC5B,KAApBR,KAAKyT,QAAQjT,KAAWqT,GAAc,IAAM7T,KAAKyT,QAAQjT,IAG/D,OAAOqT,GAAc,KAGvBD,+BAAA,WAEE,IADA,IAAIC,EAAa,GACRrT,EAAIR,KAAK2T,UAAWnT,EAAIR,KAAKyT,QAAQ9S,OAAQH,IAC5B,KAApBR,KAAKyT,QAAQjT,KACfqT,GAAc,IAAMC,mBAAmBpO,OAAO1F,KAAKyT,QAAQjT,MAG/D,OAAOqT,GAAc,KASvBD,kBAAA,SAAMG,GACJ,oBADIA,KACG/T,KAAKyT,QAAQjK,MAAMxJ,KAAK2T,UAAYI,IAM7CH,mBAAA,WACE,GAAI5T,KAAK2T,WAAa3T,KAAKyT,QAAQ9S,OAAQ,OAAO,KAGlD,IADA,IAAMqT,EAAS,GACNxT,EAAIR,KAAK2T,UAAWnT,EAAIR,KAAKyT,QAAQ9S,OAAS,EAAGH,IACxDwT,EAAO3R,KAAKrC,KAAKyT,QAAQjT,IAE3B,OAAO,IAAIoT,EAAKI,EAAQ,IAO1BJ,kBAAA,SAAMK,GAEJ,IADA,IAAMD,EAAS,GACNxT,EAAIR,KAAK2T,UAAWnT,EAAIR,KAAKyT,QAAQ9S,OAAQH,IACpDwT,EAAO3R,KAAKrC,KAAKyT,QAAQjT,IAE3B,GAAIyT,aAAwBL,EAC1B,IACMpT,EAAIyT,EAAaN,UACrBnT,EAAIyT,EAAaR,QAAQ9S,OACzBH,IAEAwT,EAAO3R,KAAK4R,EAAaR,QAAQjT,QAGnC,CAAA,IAAM0T,EAAcD,EAAa7J,MAAM,KACvC,IAAS5J,EAAI,EAAGA,EAAI0T,EAAYvT,OAAQH,IACV,EAAxB0T,EAAY1T,GAAGG,QAAYqT,EAAO3R,KAAK6R,EAAY1T,IAI3D,OAAO,IAAIoT,EAAKI,EAAQ,IAM1BJ,oBAAA,WACE,OAAO5T,KAAK2T,WAAa3T,KAAKyT,QAAQ9S,QAQjCiT,eAAP,SAAoBO,EAAiBC,GACnC,IAAMC,EAAQF,EAAUG,WACtBC,EAAQH,EAAUE,WACpB,GAAc,OAAVD,EACF,OAAOD,EACF,GAAIC,IAAUE,EACnB,OAAOX,EAAKY,aAAaL,EAAUM,WAAYL,EAAUK,YAEzD,MAAM,IAAIhR,MACR,8BACE2Q,EACA,8BAEAD,EACA,MAUDP,eAAP,SAAoBc,EAAYC,GAG9B,IAFA,IAAMC,EAAWF,EAAKlL,QAChBqL,EAAYF,EAAMnL,QACfhJ,EAAI,EAAGA,EAAIoU,EAASjU,QAAUH,EAAIqU,EAAUlU,OAAQH,IAAK,CAChE,IAAMsU,EAAM/D,GAAY6D,EAASpU,GAAIqU,EAAUrU,IAC/C,GAAY,IAARsU,EAAW,OAAOA,EAExB,OAAIF,EAASjU,SAAWkU,EAAUlU,OAAe,EAC1CiU,EAASjU,OAASkU,EAAUlU,QAAU,EAAI,GAQnDiT,mBAAA,SAAOmB,GACL,GAAI/U,KAAKgV,cAAgBD,EAAMC,YAC7B,OAAO,EAGT,IACE,IAAIxU,EAAIR,KAAK2T,UAAW1H,EAAI8I,EAAMpB,UAClCnT,GAAKR,KAAKyT,QAAQ9S,OAClBH,IAAKyL,IAEL,GAAIjM,KAAKyT,QAAQjT,KAAOuU,EAAMtB,QAAQxH,GACpC,OAAO,EAIX,OAAO,GAQT2H,qBAAA,SAASmB,GACP,IAAIvU,EAAIR,KAAK2T,UACT1H,EAAI8I,EAAMpB,UACd,GAAI3T,KAAKgV,YAAcD,EAAMC,YAC3B,OAAO,EAET,KAAOxU,EAAIR,KAAKyT,QAAQ9S,QAAQ,CAC9B,GAAIX,KAAKyT,QAAQjT,KAAOuU,EAAMtB,QAAQxH,GACpC,OAAO,IAEPzL,IACAyL,EAEJ,OAAO,sBAwBT,WAAYgJ,EAAoBC,GAAAlV,kBAAAkV,EAE9BlV,KAAKmV,OAASF,EAAKzL,QAEnBxJ,KAAKoV,YAAcnD,KAAKoD,IAAI,EAAGrV,KAAKmV,OAAOxU,QAE3C,IAAK,IAAIH,EAAI,EAAGA,EAAIR,KAAKmV,OAAOxU,OAAQH,IACtCR,KAAKoV,aAAepI,EAAahN,KAAKmV,OAAO3U,IAE/CR,KAAKsV,cAkET,OA9DE9V,sBAAW+V,wBAAX,WACE,OAAO,oCAIT/V,sBAAW+V,+BAAX,WACE,OAAO,qCAITA,iBAAA,SAAKC,GAEsB,EAArBxV,KAAKmV,OAAOxU,SACdX,KAAKoV,aAAe,GAEtBpV,KAAKmV,OAAO9S,KAAKmT,GACjBxV,KAAKoV,aAAepI,EAAawI,GACjCxV,KAAKsV,eAGPC,gBAAA,WACE,IAAME,EAAOzV,KAAKmV,OAAO/S,MACzBpC,KAAKoV,aAAepI,EAAayI,GAER,EAArBzV,KAAKmV,OAAOxU,SACdX,KAAKoV,aAAe,IAIhBG,wBAAR,WACE,GAAIvV,KAAKoV,YAAcG,EAAeG,sBACpC,MAAM,IAAIjS,MACRzD,KAAKkV,aACH,8BACAK,EAAeG,sBACf,WACA1V,KAAKoV,YACL,MAGN,GAAIpV,KAAKmV,OAAOxU,OAAS4U,EAAeI,eACtC,MAAM,IAAIlS,MACRzD,KAAKkV,aACH,iEACAK,EAAeI,eACf,gCACA3V,KAAK4V,kBAUbL,0BAAA,WACE,OAA0B,GAAtBvV,KAAKmV,OAAOxU,OACP,GAEF,gBAAkBX,KAAKmV,OAAOhQ,KAAK,KAAO,UCrUxC0Q,GAAe,iBAIfC,GAAY,YAEZC,GAAe,6BCM1B,WACEC,EACOC,EACAC,EACAC,EACAC,gBAAAA,MAHApW,YAAAiW,EACAjW,eAAAkW,EACAlW,mBAAAmW,EACAnW,oBAAAoW,EAEPpW,KAAKgW,KAAOA,EAAKnD,cACjB7S,KAAKqW,OAASrW,KAAKgW,KAAKpD,OAAO5S,KAAKgW,KAAKM,QAAQ,KAAO,GACxDtW,KAAKuW,aAAepH,EAAkBkB,IAAI,QAAU2F,IAAShW,KAAKgW,KA4EtE,OAzEEQ,4BAAA,WACE,OAAOxW,KAAKgW,OAAShW,KAAKuW,cAAgBvW,KAAKyW,gBAGjDD,4BAAA,WACE,MAA0C,OAAnCxW,KAAKuW,aAAa3D,OAAO,EAAG,IAGrC4D,uBAAA,WACE,MAAuB,wBAAhBxW,KAAKqW,QAGdG,yBAAA,WACE,MACkB,mBAAhBxW,KAAKqW,QAA+C,wBAAhBrW,KAAKqW,QAI7CG,uBAAA,SAAWE,GACLA,IAAY1W,KAAKuW,eACnBvW,KAAKuW,aAAeG,EAChB1W,KAAK2W,mBACPxH,EAAkBgB,IAAI,QAAUnQ,KAAKgW,KAAMhW,KAAKuW,gBAWtDC,0BAAA,SAAcI,EAAcC,GAI1B,IAAIC,EACJ,GAJAzT,EAAuB,iBAATuT,EAAmB,8BACjCvT,EAAyB,iBAAXwT,EAAqB,gCAG/BD,IAASd,GACXgB,GACG9W,KAAKiW,OAAS,SAAW,SAAWjW,KAAKuW,aAAe,YACtD,CAAA,GAAIK,IAASb,GAIlB,MAAM,IAAItS,MAAM,4BAA8BmT,GAH9CE,GACG9W,KAAKiW,OAAS,WAAa,WAAajW,KAAKuW,aAAe,QAI7DvW,KAAK+W,oBACPF,EAAW,GAAI7W,KAAKkW,WAGtB,IAAMc,EAAkB,GAMxB,OAJApF,GAAKiF,EAAQ,SAAC3N,EAAa/G,GACzB6U,EAAM3U,KAAK6G,EAAM,IAAM/G,KAGlB2U,EAAUE,EAAM7R,KAAK,MAI9BqR,qBAAA,WACE,IAAI7S,EAAM3D,KAAKiX,cAIf,OAHIjX,KAAKoW,iBACPzS,GAAO,IAAM3D,KAAKoW,eAAiB,KAE9BzS,GAIT6S,wBAAA,WACE,OAAQxW,KAAKiW,OAAS,WAAa,WAAajW,KAAKgW,WCtDlD,ICjCCkB,GAKFC,GAMEC,GCvBJC,GCDAC,GH8CSC,GAAgB,SAC3BC,GAEA,IAAMC,EAAYC,GAASF,GACzBtB,EAAYuB,EAAUE,UAEC,aAArBF,EAAUpB,QACZ7F,GACEiH,EAAUzB,KACR,8EAOFE,GAA0B,aAAbA,GACM,cAArBuB,EAAUpB,QAEV7F,GACE,gFAICiH,EAAUxB,QP0FK,oBAAXnO,QACPA,OAAO8P,UACP9P,OAAO8P,SAASC,WACgC,IAAhD/P,OAAO8P,SAASC,SAASvB,QAAQ,WAEjC7M,GACE,6FO5FJ,IAAM0M,EAAqC,OAArBsB,EAAUK,QAAwC,QAArBL,EAAUK,OAE7D,MAAO,CACLC,SAAU,IAAIvB,GACZiB,EAAUzB,KACVyB,EAAUxB,OACVC,EACAC,GAEFlB,KAAM,IAAIrB,GAAK6D,EAAU5D,cAShB6D,GAAW,SACtBF,GAWA,IAAIxB,EAAO,GACTK,EAAS,GACTsB,EAAY,GACZ9D,EAAa,GAGXoC,GAAS,EACX6B,EAAS,QACTE,EAAO,IAGT,GAAuB,iBAAZR,EAAsB,CAE/B,IAAIS,EAAWT,EAAQlB,QAAQ,MACf,GAAZ2B,IACFH,EAASN,EAAQ7F,UAAU,EAAGsG,EAAW,GACzCT,EAAUA,EAAQ7F,UAAUsG,EAAW,IAIzC,IAAIC,EAAWV,EAAQlB,QAAQ,MACb,IAAd4B,IACFA,EAAWV,EAAQ7W,QAErB,IAAIwX,EAAkBX,EAAQlB,QAAQ,MACb,IAArB6B,IACFA,EAAkBX,EAAQ7W,QAE5BqV,EAAOwB,EAAQ7F,UAAU,EAAGM,KAAKG,IAAI8F,EAAUC,IAC3CD,EAAWC,IAEbtE,EApIN,SAAoBA,GAGlB,IAFA,IAAIuE,EAAoB,GAClBpE,EAASH,EAAWzJ,MAAM,KACvB5J,EAAI,EAAGA,EAAIwT,EAAOrT,OAAQH,IACjC,GAAuB,EAAnBwT,EAAOxT,GAAGG,OAAY,CACxB,IAAI0X,EAAQrE,EAAOxT,GACnB,IACE6X,EAAQC,mBAAmBD,EAAMrP,QAAQ,MAAO,MAChD,MAAO1G,IACT8V,GAAqB,IAAMC,EAG/B,OAAOD,EAwHUG,CAAWf,EAAQ7F,UAAUuG,EAAUC,KAEtD,IAAIK,EAnHR,SAAqBC,WACfC,EAAU,GACgB,MAA1BD,EAAYrS,OAAO,KACrBqS,EAAcA,EAAY9G,UAAU,QAEtC,IAAsB,IAAAtI,EAAAC,EAAAmP,EAAYrO,MAAM,oCAAM,CAAzC,IAAMuO,UACT,GAAuB,IAAnBA,EAAQhY,OAAZ,CAGA,IAAMiY,EAAKD,EAAQvO,MAAM,KACP,IAAdwO,EAAGjY,OACL+X,EAAQJ,mBAAmBM,EAAG,KAAON,mBAAmBM,EAAG,IAE3DnP,GAAK,0BAA0BkP,iBAAsBF,0GAGzD,OAAOC,EAmGaG,CAChBrB,EAAQ7F,UAAUM,KAAKG,IAAIoF,EAAQ7W,OAAQwX,KAK7B,IADhBF,EAAWjC,EAAKM,QAAQ,OAEtBL,EAAoB,UAAX6B,GAAiC,QAAXA,EAC/BE,EAAOrF,SAASqD,EAAKrE,UAAUsG,EAAW,GAAI,KAE9CA,EAAWT,EAAQ7W,OAGrB,IAAMwJ,EAAQ6L,EAAK5L,MAAM,KACJ,IAAjBD,EAAMxJ,QAER0V,EAASlM,EAAM,GACfwN,EAAYxN,EAAM,GAAG0I,eACK,IAAjB1I,EAAMxJ,OACf0V,EAASlM,EAAM,GACwC,cAA9CA,EAAM,GAAGX,MAAM,EAAGyO,GAAUpF,gBACrCwD,EAAS,aAGO,KAAdsB,GAAoB,OAAQa,IAC9Bb,EAAYa,EAAgB,IAIhC,MAAO,CACLxC,OACAgC,OACA3B,SACAsB,YACA1B,SACA6B,SACAjE,eItKSiF,GAAqB,iCAQrBC,GAAsB,+BAOtBC,GAAiB,SAMjBC,GAAa,SAAS/P,GACjC,MACiB,iBAARA,GAAmC,IAAfA,EAAIvI,SAAiBmY,GAAmB/Q,KAAKmB,IAQ/DgQ,GAAoB,SAASrF,GACxC,MACwB,iBAAfA,GACe,IAAtBA,EAAWlT,SACVoY,GAAoBhR,KAAK8L,IAqBjBsF,GAAkB,SAASC,GACtC,OACe,OAAbA,GACoB,iBAAbA,GACc,iBAAbA,IAA0B3I,GAAoB2I,IACrDA,GAAgC,iBAAbA,GAAyB/O,EAAS+O,EAAU,QAavDC,GAA0B,SACrClN,EACAM,EACA7D,EACAqM,EACAvI,GAEIA,QAAqBvF,IAATyB,GAEhB0Q,GACEC,EAAepN,EAAQM,EAAgBC,GACvC9D,EACAqM,IAWSqE,GAAuB,SAClC9M,EACA5D,EACA4Q,GAEA,IAAMvE,EACJuE,aAAiB5F,GAAO,IAAI2B,GAAeiE,EAAOhN,GAAegN,EAEnE,QAAarS,IAATyB,EACF,MAAM,IAAInF,MAAM+I,EAAc,sBAAwByI,EAAKW,iBAE7D,GAAoB,mBAAThN,EACT,MAAM,IAAInF,MACR+I,EACE,uBACAyI,EAAKW,gBACL,oBACAhN,EAAKO,YAGX,GAAIsH,GAAoB7H,GACtB,MAAM,IAAInF,MACR+I,EAAc,YAAc5D,EAAKO,WAAa,IAAM8L,EAAKW,iBAK7D,GACkB,iBAAThN,GACPA,EAAKjI,OAASqY,GAAiB,GAC/BhM,EAAapE,GAAQoQ,GAErB,MAAM,IAAIvV,MACR+I,EACE,kCACAwM,GACA,eACA/D,EAAKW,gBACL,MACAhN,EAAK+I,UAAU,EAAG,IAClB,SAMN,GAAI/I,GAAwB,iBAATA,EAAmB,CACpC,IAAI6Q,GAAc,EACdC,GAAiB,EAwBrB,GAvBA9H,GAAKhJ,EAAM,SAASM,EAAa/G,GAC/B,GAAY,WAAR+G,EACFuQ,GAAc,OACT,GAAY,cAARvQ,GAA+B,QAARA,IAChCwQ,GAAiB,GACZT,GAAW/P,IACd,MAAM,IAAIzF,MACR+I,EACE,6BACAtD,EACA,KACA+L,EAAKW,gBACL,wFAMRX,EAAK5S,KAAK6G,GACVoQ,GAAqB9M,EAAarK,EAAO8S,GACzCA,EAAK7S,QAGHqX,GAAeC,EACjB,MAAM,IAAIjW,MACR+I,EACE,4BACAyI,EAAKW,gBACL,sCAmEG+D,GAA+B,SAC1CxN,EACAM,EACA7D,EACAqM,EACAvI,GAEA,IAAIA,QAAqBvF,IAATyB,EAAhB,CAEA,IAAM4D,EAAc+M,EAAepN,EAAQM,EAAgBC,GAE3D,IAAM9D,GAAwB,iBAATA,GAAsBjJ,MAAMyE,QAAQwE,GACvD,MAAM,IAAInF,MACR+I,EAAc,0DAIlB,IAAMoN,EAAqB,GAC3BhI,GAAKhJ,EAAM,SAASM,EAAa/G,GAC/B,IAAM0X,EAAU,IAAIjG,GAAK1K,GAEzB,GADAoQ,GAAqB9M,EAAarK,EAAO8S,EAAKO,MAAMqE,IAC1B,cAAtBA,EAAQC,YACLX,GAAgBhX,GACnB,MAAM,IAAIsB,MACR+I,EACE,kCACAqN,EAAQ1Q,WACR,gGAKRyQ,EAAWvX,KAAKwX,KAvFsB,SACxCrN,EACAoN,GAEA,IAAIpZ,EAAGqZ,EACP,IAAKrZ,EAAI,EAAGA,EAAIoZ,EAAWjZ,OAAQH,IAGjC,IADA,IAAM+I,GADNsQ,EAAUD,EAAWpZ,IACAgJ,QACZyC,EAAI,EAAGA,EAAI1C,EAAK5I,OAAQsL,IAC/B,GAAgB,cAAZ1C,EAAK0C,IAAsBA,IAAM1C,EAAK5I,OAAS,QAE5C,IAAKsY,GAAW1P,EAAK0C,IAC1B,MAAM,IAAIxI,MACR+I,EACE,4BACAjD,EAAK0C,GACL,aACA4N,EAAQ1Q,WACR,uFAUVyQ,EAAWtI,KAAKsC,GAAKmG,cACrB,IAAIC,EAAwB,KAC5B,IAAKxZ,EAAI,EAAGA,EAAIoZ,EAAWjZ,OAAQH,IAAK,CAEtC,GADAqZ,EAAUD,EAAWpZ,GACJ,OAAbwZ,GAAqBA,EAAS3P,SAASwP,GACzC,MAAM,IAAIpW,MACR+I,EACE,mBACAwN,EAAS7Q,WACT,qCACA0Q,EAAQ1Q,YAGd6Q,EAAWH,GAgDbI,CAA2BzN,EAAaoN,KAG7BM,GAAmB,SAC9B/N,EACAM,EACA2M,EACA1M,GAEA,IAAIA,QAAyBvF,IAAbiS,EAAhB,CACA,GAAI3I,GAAoB2I,GACtB,MAAM,IAAI3V,MACR8V,EAAepN,EAAQM,EAAgBC,GACrC,MACA0M,EAASjQ,WACT,6FAIN,IAAKgQ,GAAgBC,GACnB,MAAM,IAAI3V,MACR8V,EAAepN,EAAQM,EAAgBC,GACrC,yFAKKyN,GAAoB,SAC/BhO,EACAM,EACA2N,EACA1N,GAEA,IAAIA,QAA0BvF,IAAdiT,EAEhB,OAAQA,GACN,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACH,MACF,QACE,MAAM,IAAI3W,MACR8V,EAAepN,EAAQM,EAAgBC,GACrC,8GAMG2N,GAAc,SACzBlO,EACAM,EACAvD,EACAwD,GAEA,KAAIA,QAAoBvF,IAAR+B,GACX+P,GAAW/P,IACd,MAAM,IAAIzF,MACR8V,EAAepN,EAAQM,EAAgBC,GACrC,yBACAxD,EACA,qGAKKoR,GAAqB,SAChCnO,EACAM,EACAoH,EACAnH,GAEA,KAAIA,QAA2BvF,IAAf0M,GAEXqF,GAAkBrF,IACrB,MAAM,IAAIpQ,MACR8V,EAAepN,EAAQM,EAAgBC,GACrC,0BACAmH,EACA,qFAmBK0G,GAAuB,SAASpO,EAAgB8I,GAC3D,GAAwB,UAApBA,EAAKX,WACP,MAAM,IAAI7Q,MAAM0I,EAAS,8CAIhBqO,GAAc,SACzBrO,EACAM,EACAgL,GAGA,IAxV4C5D,EAwVtCA,EAAa4D,EAAUxC,KAAK9L,WAClC,GACuC,iBAA5BsO,EAAUM,SAAS/B,MACO,IAAnCyB,EAAUM,SAAS/B,KAAKrV,SACtBsY,GAAWxB,EAAUM,SAAS7B,YACY,cAA1CuB,EAAUM,SAAS/B,KAAK5L,MAAM,KAAK,IACd,IAAtByJ,EAAWlT,UA9V8BkT,EA8VSA,KA3VnDA,EAAaA,EAAW7K,QAAQ,mBAAoB,OAG/CkQ,GAAkBrF,IA0VvB,MAAM,IAAIpQ,MACR8V,EAAepN,EAAQM,GAAgB,GACrC,uGCrYN,WAAoBgO,EAAqBjB,GAArBxZ,WAAAya,EAAqBza,WAAAwZ,EA4H3C,OAtHEkB,mBAAA,SAAOC,GACLzO,EAAiB,sBAAuB,EAAG,EAAGxL,UAAUC,QACxDiM,EAAiB,sBAAuB,EAAG+N,GAAY,GACvD,IAAMC,EAAW,IAAIlT,EAKrB,OAJA1H,KAAKya,MAAMI,mBACT7a,KAAKwZ,MACLoB,EAASE,aAAaH,IAEjBC,EAASvT,SAOlBqT,mBAAA,SAAOC,GACLzO,EAAiB,sBAAuB,EAAG,EAAGxL,UAAUC,QACxD4Z,GAAqB,sBAAuBva,KAAKwZ,OACjD5M,EAAiB,sBAAuB,EAAG+N,GAAY,GACvD,IAAMC,EAAW,IAAIlT,EAMrB,OALA1H,KAAKya,MAAMM,gBACT/a,KAAKwZ,MACL,KACAoB,EAASE,aAAaH,IAEjBC,EAASvT,SAQlBqT,gBAAA,SAAIvY,EAAYwY,GACdzO,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QACrD4Z,GAAqB,mBAAoBva,KAAKwZ,OAC9CH,GAAwB,mBAAoB,EAAGlX,EAAOnC,KAAKwZ,OAAO,GAClE5M,EAAiB,mBAAoB,EAAG+N,GAAY,GACpD,IAAMC,EAAW,IAAIlT,EAMrB,OALA1H,KAAKya,MAAMM,gBACT/a,KAAKwZ,MACLrX,EACAyY,EAASE,aAAaH,IAEjBC,EAASvT,SASlBqT,4BAAA,SACEvY,EACAiX,EACAuB,GAEAzO,EAAiB,+BAAgC,EAAG,EAAGxL,UAAUC,QACjE4Z,GAAqB,+BAAgCva,KAAKwZ,OAC1DH,GACE,+BACA,EACAlX,EACAnC,KAAKwZ,OACL,GAEFU,GAAiB,+BAAgC,EAAGd,GAAU,GAC9DxM,EAAiB,+BAAgC,EAAG+N,GAAY,GAEhE,IAAMC,EAAW,IAAIlT,EAOrB,OANA1H,KAAKya,MAAMO,4BACThb,KAAKwZ,MACLrX,EACAiX,EACAwB,EAASE,aAAaH,IAEjBC,EAASvT,SAQlBqT,mBAAA,SACEO,EACAN,GAIA,GAFAzO,EAAiB,sBAAuB,EAAG,EAAGxL,UAAUC,QACxD4Z,GAAqB,sBAAuBva,KAAKwZ,OAC7C7Z,MAAMyE,QAAQ6W,GAAgB,CAEhC,IADA,IAAMC,EAAyC,GACtC1a,EAAI,EAAGA,EAAIya,EAActa,SAAUH,EAC1C0a,EAAiB,GAAK1a,GAAKya,EAAcza,GAE3Cya,EAAgBC,EAChBzR,GACE,gOAIJkQ,GACE,sBACA,EACAsB,EACAjb,KAAKwZ,OACL,GAEF5M,EAAiB,sBAAuB,EAAG+N,GAAY,GACvD,IAAMC,EAAW,IAAIlT,EAMrB,OALA1H,KAAKya,MAAMU,mBACTnb,KAAKwZ,MACLyB,EACAL,EAASE,aAAaH,IAEjBC,EAASvT,4BCnIlB,WAAmB+T,EAA2BC,GAA3Brb,eAAAob,EAA2Bpb,cAAAqb,EAQhD,OAJEC,mBAAA,WAEE,OADApP,EAAiB,2BAA4B,EAAG,EAAGxL,UAAUC,QACtD,CAAEya,UAAWpb,KAAKob,UAAWC,SAAUrb,KAAKqb,SAASE,gBLDnDC,IAELtE,GACJ,mEAIEC,GAAe,EAMbC,GAA0B,GAEzB,SAAS3J,GACd,IAGIjN,EAHEib,EAAgBhO,IAAQ0J,GAC9BA,GAAe1J,EAGf,IAAMiO,EAAiB,IAAI/b,MAAM,GACjC,IAAKa,EAAI,EAAQ,GAALA,EAAQA,IAClBkb,EAAelb,GAAK0W,GAAW9Q,OAAOqH,EAAM,IAG5CA,EAAMwE,KAAKI,MAAM5E,EAAM,IAEzBpK,EAAe,IAARoK,EAAW,4BAElB,IAAIR,EAAKyO,EAAevW,KAAK,IAE7B,GAAKsW,EAIE,CAGL,IAAKjb,EAAI,GAAS,GAALA,GAA+B,KAArB4W,GAAc5W,GAAWA,IAC9C4W,GAAc5W,GAAK,EAErB4W,GAAc5W,UATd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClB4W,GAAc5W,GAAKyR,KAAKI,MAAsB,GAAhBJ,KAAK0J,UAUvC,IAAKnb,EAAI,EAAGA,EAAI,GAAIA,IAClByM,GAAMiK,GAAW9Q,OAAOgR,GAAc5W,IAIxC,OAFA6C,EAAqB,KAAd4J,EAAGtM,OAAe,oCAElBsM,kBMgFT,WAAmBa,EAAqB8N,GAArB5b,UAAA8N,EAAqB9N,UAAA4b,EAW1C,OAHSC,OAAP,SAAY/N,EAAc8N,GACxB,OAAO,IAAIC,EAAU/N,EAAM8N,uBCjJ/B,cA6DA,OA3CEE,uBAAA,WACE,OAAO9b,KAAK+b,QAAQ7L,KAAKlQ,OAW3B8b,gCAAA,SAAoBE,EAAeC,GACjC,IAAMC,EAAa,IAAIL,GAAUhL,GAAUmL,GACrCG,EAAa,IAAIN,GAAUhL,GAAUoL,GAC3C,OAAgD,IAAzCjc,KAAK+b,QAAQG,EAAYC,IAOlCL,oBAAA,WACE,OAAQD,GAAkBO,yBNzC9B,4DAoEA,OApE8B7T,OAC5B/I,sBAAW6c,sBAAX,WACE,OAAOhF,QAGT,SAAwBjJ,GACtBiJ,GAAejJ,mCAMjBiO,oBAAA,SAAQ5Q,EAAclM,GACpB,OAAOwR,GAAYtF,EAAEqC,KAAMvO,EAAEuO,OAM/BuO,wBAAA,SAAYT,GAGV,MAAMpY,EAAe,oDAMvB6Y,gCAAA,SAAoBL,EAAeC,GACjC,OAAO,GAMTI,oBAAA,WACE,OAAQR,GAAkBO,KAM5BC,oBAAA,WAGE,OAAO,IAAIR,GAAU/K,GAAUuG,KAQjCgF,qBAAA,SAASC,EAAoBxO,GAM3B,OALAzK,EACwB,iBAAfiZ,EACP,gDAGK,IAAIT,GAAUS,EAAYjF,KAMnCgF,qBAAA,WACE,MAAO,WAlEmBP,IAsEjBS,GAAY,IAAIF,GC/DtB,IMPHG,GCHAC,GACAnF,GPSSoF,GAAmB,SAAStD,GACvC,MAAwB,iBAAbA,EACF,UAAYvH,GAAsBuH,GAC/B,UAAYA,GAQbuD,GAAuB,SAASC,GAC3C,GAAIA,EAAaC,aAAc,CAC7B,IAAMzO,EAAMwO,EAAaxO,MACzB/K,EACiB,iBAAR+K,GACU,iBAARA,GACS,iBAARA,GACN/D,EAAS+D,EAAmC,OAChD,6CAGF/K,EACEuZ,IAAiBtF,IAAYsF,EAAapS,UAC1C,gCAIJnH,EACEuZ,IAAiBtF,IAAYsF,EAAaE,cAActS,UACxD,qEMLF,WACmBuS,EACTC,gBAAAA,EAAsBC,EAAST,0BAA0BU,YADhDld,YAAA+c,EACT/c,mBAAAgd,EAVFhd,eAA2B,KAYjCqD,OACkB8D,IAAhBnH,KAAK+c,QAAwC,OAAhB/c,KAAK+c,OAClC,4DAGFJ,GAAqB3c,KAAKgd,eAiO9B,OAlQExd,sBAAWyd,mCAIX,WACE,OAAOT,QALT,SAAqCpO,GACnCoO,GAA4BpO,mCAoC9B6O,uBAAA,WACE,OAAO,GAITA,wBAAA,WACE,OAAOjd,KAAKgd,eAIdC,2BAAA,SAAeE,GACb,OAAO,IAAIF,EAASjd,KAAK+c,OAAQI,IAInCF,8BAAA,SAAkBG,GAEhB,MAAkB,cAAdA,EACKpd,KAAKgd,cAELC,EAAST,0BAA0BU,YAK9CD,qBAAA,SAAShI,GACP,OAAIA,EAAKzK,UACAxK,KACsB,cAApBiV,EAAKX,WACPtU,KAAKgd,cAELC,EAAST,0BAA0BU,YAO9CD,qBAAA,WACE,OAAO,GAITA,oCAAA,SAAwBG,EAAmBC,GACzC,OAAO,MAITJ,iCAAA,SAAqBG,EAAmBE,GACtC,MAAkB,cAAdF,EACKpd,KAAKud,eAAeD,GAClBA,EAAa9S,WAA2B,cAAd4S,EAC5Bpd,KAEAid,EAAST,0BAA0BU,WAAWM,qBACnDJ,EACAE,GACAC,eAAevd,KAAKgd,gBAK1BC,wBAAA,SAAYhI,EAAYqI,GACtB,IAAMG,EAAQxI,EAAKX,WACnB,OAAc,OAAVmJ,EACKH,EACEA,EAAa9S,WAAuB,cAAViT,EAC5Bzd,MAEPqD,EACY,cAAVoa,GAA8C,IAArBxI,EAAKD,YAC9B,8CAGKhV,KAAKwd,qBACVC,EACAR,EAAST,0BAA0BU,WAAWQ,YAC5CzI,EAAKR,WACL6I,MAORL,oBAAA,WACE,OAAO,GAITA,wBAAA,WACE,OAAO,GAITA,yBAAA,SAAaU,EAAcC,GACzB,OAAO,GAMTX,gBAAA,SAAIY,GACF,OAAIA,IAAiB7d,KAAK8c,cAActS,UAC/B,CACLsT,SAAU9d,KAAK+d,WACfC,YAAahe,KAAK8c,cAAc1O,OAExBpO,KAAK+d,YAInBd,iBAAA,WACE,GAAuB,OAAnBjd,KAAKie,UAAoB,CAC3B,IAAIC,EAAS,GACRle,KAAKgd,cAAcxS,YACtB0T,GACE,YACAxB,GAAiB1c,KAAKgd,cAAc5O,OACpC,KAEJ,IAAMwI,SAAc5W,KAAK+c,OACzBmB,GAAUtH,EAAO,IAEfsH,GADW,WAATtH,EACQ/E,GAAsB7R,KAAK+c,QAE3B/c,KAAK+c,OAEjB/c,KAAKie,UAAY1O,EAAK2O,GAExB,OAAOle,KAAKie,WAOdhB,qBAAA,WACE,OAAOjd,KAAK+c,QAMdE,sBAAA,SAAUlI,GACR,OAAIA,IAAUkI,EAAST,0BAA0BU,WACxC,EACEnI,aAAiBkI,EAAST,2BAC3B,GAERnZ,EAAO0R,EAAM8H,aAAc,qBACpB7c,KAAKme,mBAAmBpJ,KAU3BkI,+BAAR,SAA2BmB,GACzB,IAAMC,SAAuBD,EAAUrB,OACjCuB,SAAsBte,KAAK+c,OAC3BwB,EAAatB,EAASuB,iBAAiBlI,QAAQ+H,GAC/CI,EAAYxB,EAASuB,iBAAiBlI,QAAQgI,GAGpD,OAFAjb,EAAqB,GAAdkb,EAAiB,sBAAwBF,GAChDhb,EAAoB,GAAbob,EAAgB,sBAAwBH,GAC3CC,IAAeE,EAEI,WAAjBH,EAEK,EAGHte,KAAK+c,OAASqB,EAAUrB,QAClB,EACC/c,KAAK+c,SAAWqB,EAAUrB,OAC5B,EAEA,EAIJ0B,EAAYF,GAOvBtB,sBAAA,WACE,OAAOjd,MAMTid,sBAAA,WACE,OAAO,GAMTA,mBAAA,SAAOlI,GAIL,GAAIA,IAAU/U,KACZ,OAAO,EACF,GAAI+U,EAAM8H,aAAc,CAC7B,IAAMuB,EAAYrJ,EAClB,OACE/U,KAAK+c,SAAWqB,EAAUrB,QAC1B/c,KAAKgd,cAAc0B,OAAON,EAAUpB,eAGtC,OAAO,GAjPJC,mBAAmB,CAAC,SAAU,UAAW,SAAU,eCT5D,ICZI0B,GCkBAzB,GFuDS0B,GAAiB,gBA7D9B,4DA2DA,OA3DmCrW,OAIjCsW,oBAAA,SAAQpT,EAAclM,GACpB,IAAMuf,EAAYrT,EAAEmQ,KAAKkB,cACnBiC,EAAYxf,EAAEqc,KAAKkB,cACnBkC,EAAWF,EAAUG,UAAUF,GACrC,OAAiB,IAAbC,EACKjO,GAAYtF,EAAEqC,KAAMvO,EAAEuO,MAEtBkR,GAOXH,wBAAA,SAAYjD,GACV,OAAQA,EAAKkB,cAActS,WAM7BqU,gCAAA,SAAoB7C,EAAeC,GACjC,OAAQD,EAAQc,cAAc4B,OAAOzC,EAAQa,gBAM/C+B,oBAAA,WACE,OAAQhD,GAAkBO,KAM5ByC,oBAAA,WACE,OAAO,IAAIhD,GAAU/K,GAAU,IAAImM,GAAS,kBAAmB3F,MAQjEuH,qBAAA,SAASvC,EAAiBxO,GACxB,IAAM8O,EAAeH,GAAaH,GAClC,OAAO,IAAIT,GAAU/N,EAAM,IAAImP,GAAS,kBAAmBL,KAM7DiC,qBAAA,WACE,MAAO,gBAzDwB/C,mBGkBjC,WACEF,EACAsD,EACAC,EACQC,EACAC,gBAAAA,QADArf,gBAAAof,EACApf,sBAAAqf,EAfFrf,gBAAuD,GAkB7D,IADA,IAAI8U,EAAM,GACF8G,EAAKpR,WAMX,GALAoR,EAAOA,EACP9G,EAAMoK,EAAWC,EAAWvD,EAAK1S,IAAKgW,GAAY,EAE9CE,IAAYtK,IAAQ,GAEpBA,EAAM,EAGN8G,EADE5b,KAAKof,WACAxD,EAAKlH,KAELkH,EAAKjH,UAET,CAAA,GAAY,IAARG,EAAW,CAEpB9U,KAAKsf,WAAWjd,KAAKuZ,GACrB,MAGA5b,KAAKsf,WAAWjd,KAAKuZ,GAEnBA,EADE5b,KAAKof,WACAxD,EAAKjH,MAELiH,EAAKlH,MA8CtB,OAxCE6K,oBAAA,WACE,GAA+B,IAA3Bvf,KAAKsf,WAAW3e,OAAc,OAAO,KAEzC,IACI6e,EADA5D,EAAO5b,KAAKsf,WAAWld,MAM3B,GAHEod,EADExf,KAAKqf,iBACErf,KAAKqf,iBAAiBzD,EAAK1S,IAAK0S,EAAKzZ,OAClC,CAAE+G,IAAK0S,EAAK1S,IAAK/G,MAAOyZ,EAAKzZ,OAEvCnC,KAAKof,WAEP,IADAxD,EAAOA,EAAKlH,MACJkH,EAAKpR,WACXxK,KAAKsf,WAAWjd,KAAKuZ,GACrBA,EAAOA,EAAKjH,WAId,IADAiH,EAAOA,EAAKjH,OACJiH,EAAKpR,WACXxK,KAAKsf,WAAWjd,KAAKuZ,GACrBA,EAAOA,EAAKlH,KAIhB,OAAO8K,GAGTD,oBAAA,WACE,OAAgC,EAAzBvf,KAAKsf,WAAW3e,QAGzB4e,iBAAA,WACE,GAA+B,IAA3Bvf,KAAKsf,WAAW3e,OAAc,OAAO,KAEzC,IAAMib,EAAO5b,KAAKsf,WAAWtf,KAAKsf,WAAW3e,OAAS,GACtD,OAAIX,KAAKqf,iBACArf,KAAKqf,iBAAiBzD,EAAK1S,IAAK0S,EAAKzZ,OAErC,CAAE+G,IAAK0S,EAAK1S,IAAK/G,MAAOyZ,EAAKzZ,2BAqBxC,WACS+G,EACA/G,EACPsd,EACA/K,EACAC,GAJO3U,SAAAkJ,EACAlJ,WAAAmC,EAKPnC,KAAKyf,MAAiB,MAATA,EAAgBA,EAAQC,EAASC,IAC9C3f,KAAK0U,KACK,MAARA,EAAeA,EAAQkL,GAAU1C,WACnCld,KAAK2U,MACM,MAATA,EAAgBA,EAASiL,GAAU1C,WAiTzC,OAjSEwC,iBAAA,SACExW,EACA/G,EACAsd,EACA/K,EACAC,GAEA,OAAO,IAAI+K,EACF,MAAPxW,EAAcA,EAAMlJ,KAAKkJ,IAChB,MAAT/G,EAAgBA,EAAQnC,KAAKmC,MACpB,MAATsd,EAAgBA,EAAQzf,KAAKyf,MACrB,MAAR/K,EAAeA,EAAO1U,KAAK0U,KAClB,MAATC,EAAgBA,EAAQ3U,KAAK2U,QAOjC+K,kBAAA,WACE,OAAO1f,KAAK0U,KAAKmL,QAAU,EAAI7f,KAAK2U,MAAMkL,SAM5CH,oBAAA,WACE,OAAO,GAYTA,6BAAA,SAAiB9B,GACf,OACE5d,KAAK0U,KAAKoL,iBAAiBlC,IAC3BA,EAAO5d,KAAKkJ,IAAKlJ,KAAKmC,QACtBnC,KAAK2U,MAAMmL,iBAAiBlC,IAYhC8B,6BAAA,SAAiB9B,GACf,OACE5d,KAAK2U,MAAMoL,iBAAiBnC,IAC5BA,EAAO5d,KAAKkJ,IAAKlJ,KAAKmC,QACtBnC,KAAK0U,KAAKqL,iBAAiBnC,IAQvB8B,iBAAR,WACE,OAAI1f,KAAK0U,KAAKlK,UACLxK,KAECA,KAAK0U,KAAwBsL,QAOzCN,mBAAA,WACE,OAAO1f,KAAKggB,OAAO9W,KAMrBwW,mBAAA,WACE,OAAI1f,KAAK2U,MAAMnK,UACNxK,KAAKkJ,IAELlJ,KAAK2U,MAAMsL,UAWtBP,mBAAA,SAAOxW,EAAQ/G,EAAUgd,GACvB,IAAIrK,EAAKrU,EAgBT,OAZEA,GAFFqU,EAAMqK,EAAWjW,GADjBzI,EAAIT,MACoBkJ,MACd,EACJzI,EAAEyf,KAAK,KAAM,KAAM,KAAMzf,EAAEiU,KAAKyL,OAAOjX,EAAK/G,EAAOgd,GAAa,MACnD,IAARrK,EACLrU,EAAEyf,KAAK,KAAM/d,EAAO,KAAM,KAAM,MAEhC1B,EAAEyf,KACJ,KACA,KACA,KACA,KACAzf,EAAEkU,MAAMwL,OAAOjX,EAAK/G,EAAOgd,KAGtBiB,UAOHV,uBAAR,WACE,GAAI1f,KAAK0U,KAAKlK,UACZ,OAAOoV,GAAU1C,WAEnB,IAAIzc,EAAoBT,KAGxB,OAFKS,EAAEiU,KAAK2L,UAAa5f,EAAEiU,KAAKA,KAAK2L,WAAU5f,EAAIA,EAAE6f,iBACrD7f,EAAIA,EAAEyf,KAAK,KAAM,KAAM,KAAOzf,EAAEiU,KAAwB6L,aAAc,OAC7DH,UAQXV,mBAAA,SACExW,EACAiW,GAEA,IAAI1e,EAAG+f,EAEP,GAAIrB,EAAWjW,GADfzI,EAAIT,MACkBkJ,KAAO,EACtBzI,EAAEiU,KAAKlK,WAAc/J,EAAEiU,KAAK2L,UAAa5f,EAAEiU,KAAKA,KAAK2L,WACxD5f,EAAIA,EAAE6f,gBAER7f,EAAIA,EAAEyf,KAAK,KAAM,KAAM,KAAMzf,EAAEiU,KAAKtE,OAAOlH,EAAKiW,GAAa,UACxD,CAKL,GAJI1e,EAAEiU,KAAK2L,WAAU5f,EAAIA,EAAEggB,gBACtBhgB,EAAEkU,MAAMnK,WAAc/J,EAAEkU,MAAM0L,UAAa5f,EAAEkU,MAAMD,KAAK2L,WAC3D5f,EAAIA,EAAEigB,iBAEuB,IAA3BvB,EAAWjW,EAAKzI,EAAEyI,KAAY,CAChC,GAAIzI,EAAEkU,MAAMnK,UACV,OAAOoV,GAAU1C,WAEjBsD,EAAY/f,EAAEkU,MAAyBqL,OACvCvf,EAAIA,EAAEyf,KACJM,EAAStX,IACTsX,EAASre,MACT,KACA,KACC1B,EAAEkU,MAAyB4L,cAIlC9f,EAAIA,EAAEyf,KAAK,KAAM,KAAM,KAAM,KAAMzf,EAAEkU,MAAMvE,OAAOlH,EAAKiW,IAEzD,OAAO1e,EAAE2f,UAOXV,mBAAA,WACE,OAAO1f,KAAKyf,OAONC,mBAAR,WACE,IAAIjf,EAAIT,KAIR,OAHIS,EAAEkU,MAAM0L,WAAa5f,EAAEiU,KAAK2L,WAAU5f,EAAIA,EAAEkgB,eAC5ClgB,EAAEiU,KAAK2L,UAAY5f,EAAEiU,KAAKA,KAAK2L,WAAU5f,EAAIA,EAAEggB,gBAC/ChgB,EAAEiU,KAAK2L,UAAY5f,EAAEkU,MAAM0L,WAAU5f,EAAIA,EAAEmgB,cACxCngB,GAODif,yBAAR,WACE,IAAIjf,EAAIT,KAAK4gB,aAYb,OAXIngB,EAAEkU,MAAMD,KAAK2L,WASf5f,GADAA,GAPAA,EAAIA,EAAEyf,KACJ,KACA,KACA,KACA,KACCzf,EAAEkU,MAAyB8L,iBAExBE,eACAC,cAEDngB,GAODif,0BAAR,WACE,IAAIjf,EAAIT,KAAK4gB,aAKb,OAJIngB,EAAEiU,KAAKA,KAAK2L,WAEd5f,GADAA,EAAIA,EAAEggB,gBACAG,cAEDngB,GAODif,wBAAR,WACE,IAAMmB,EAAK7gB,KAAKkgB,KAAK,KAAM,KAAMR,EAASC,IAAK,KAAM3f,KAAK2U,MAAMD,MAChE,OAAO1U,KAAK2U,MAAMuL,KAAK,KAAM,KAAMlgB,KAAKyf,MAAOoB,EAAI,OAO7CnB,yBAAR,WACE,IAAMoB,EAAK9gB,KAAKkgB,KAAK,KAAM,KAAMR,EAASC,IAAK3f,KAAK0U,KAAKC,MAAO,MAChE,OAAO3U,KAAK0U,KAAKwL,KAAK,KAAM,KAAMlgB,KAAKyf,MAAO,KAAMqB,IAO9CpB,uBAAR,WACE,IAAMhL,EAAO1U,KAAK0U,KAAKwL,KAAK,KAAM,MAAOlgB,KAAK0U,KAAK+K,MAAO,KAAM,MAC1D9K,EAAQ3U,KAAK2U,MAAMuL,KAAK,KAAM,MAAOlgB,KAAK2U,MAAM8K,MAAO,KAAM,MACnE,OAAOzf,KAAKkgB,KAAK,KAAM,MAAOlgB,KAAKyf,MAAO/K,EAAMC,IAS1C+K,2BAAR,WACE,IAAMqB,EAAa/gB,KAAKghB,SACxB,OAAO/O,KAAKE,IAAI,EAAK4O,IAAe/gB,KAAK6f,QAAU,GAOrDH,mBAAA,WACE,IAAIqB,EACJ,GAAI/gB,KAAKqgB,UAAYrgB,KAAK0U,KAAK2L,SAC7B,MAAM,IAAI5c,MACR,0BAA4BzD,KAAKkJ,IAAM,IAAMlJ,KAAKmC,MAAQ,KAG9D,GAAInC,KAAK2U,MAAM0L,SACb,MAAM,IAAI5c,MACR,mBAAqBzD,KAAKkJ,IAAM,IAAMlJ,KAAKmC,MAAQ,YAIvD,IADA4e,EAAa/gB,KAAK0U,KAAKsM,YACJhhB,KAAK2U,MAAMqM,SAC5B,MAAM,IAAIvd,MAAM,uBAEhB,OAAOsd,GAAc/gB,KAAKqgB,SAAW,EAAI,IA3StCX,OAAM,EACNA,SAAQ,qBAkTjB,cAgHA,OApGEuB,iBAAA,SACE/X,EACA/G,EACAsd,EACA/K,EACAC,GAEA,OAAO3U,MAWTihB,mBAAA,SAAO/X,EAAQ/G,EAAUgd,GACvB,OAAO,IAAIO,GAASxW,EAAK/G,EAAO,OAUlC8e,mBAAA,SAAO/X,EAAQiW,GACb,OAAOnf,MAMTihB,kBAAA,WACE,OAAO,GAMTA,oBAAA,WACE,OAAO,GAWTA,6BAAA,SAAiBrD,GACf,OAAO,GAWTqD,6BAAA,SAAiBrD,GACf,OAAO,GAMTqD,mBAAA,WACE,OAAO,MAMTA,mBAAA,WACE,OAAO,MAOTA,mBAAA,WACE,OAAO,GAOTA,mBAAA,WACE,OAAO,sBAoBT,WACUC,EACAC,gBAAAA,EAEkBvB,EAAU1C,YAH5Bld,iBAAAkhB,EACAlhB,WAAAmhB,EA0MZ,OA7LEvB,mBAAA,SAAO1W,EAAQ/G,GACb,OAAO,IAAIyd,EACT5f,KAAKkhB,YACLlhB,KAAKmhB,MACFhB,OAAOjX,EAAK/G,EAAOnC,KAAKkhB,aACxBhB,KAAK,KAAM,KAAMR,GAAS0B,MAAO,KAAM,QAU9CxB,mBAAA,SAAO1W,GACL,OAAO,IAAI0W,EACT5f,KAAKkhB,YACLlhB,KAAKmhB,MACF/Q,OAAOlH,EAAKlJ,KAAKkhB,aACjBhB,KAAK,KAAM,KAAMR,GAAS0B,MAAO,KAAM,QAW9CxB,gBAAA,SAAI1W,GAGF,IAFA,IAAI4L,EACA8G,EAAO5b,KAAKmhB,OACRvF,EAAKpR,WAAW,CAEtB,GAAY,KADZsK,EAAM9U,KAAKkhB,YAAYhY,EAAK0S,EAAK1S,MAE/B,OAAO0S,EAAKzZ,MACH2S,EAAM,EACf8G,EAAOA,EAAKlH,KACG,EAANI,IACT8G,EAAOA,EAAKjH,OAGhB,OAAO,MAQTiL,8BAAA,SAAkB1W,GAIhB,IAHA,IAAI4L,EACF8G,EAAO5b,KAAKmhB,MACZE,EAAc,MACRzF,EAAKpR,WAAW,CAEtB,GAAY,KADZsK,EAAM9U,KAAKkhB,YAAYhY,EAAK0S,EAAK1S,MAClB,CACb,GAAK0S,EAAKlH,KAAKlK,UAIR,OAAI6W,EACFA,EAAYnY,IAEZ,KALP,IADA0S,EAAOA,EAAKlH,MACJkH,EAAKjH,MAAMnK,WAAWoR,EAAOA,EAAKjH,MAC1C,OAAOiH,EAAK1S,IAML4L,EAAM,EACf8G,EAAOA,EAAKlH,KACG,EAANI,IAET8G,GADAyF,EAAczF,GACFjH,OAIhB,MAAM,IAAIlR,MACR,0EAOJmc,oBAAA,WACE,OAAO5f,KAAKmhB,MAAM3W,WAMpBoV,kBAAA,WACE,OAAO5f,KAAKmhB,MAAMtB,SAMpBD,mBAAA,WACE,OAAO5f,KAAKmhB,MAAMG,UAMpB1B,mBAAA,WACE,OAAO5f,KAAKmhB,MAAMlB,UAYpBL,6BAAA,SAAiBhC,GACf,OAAO5d,KAAKmhB,MAAMrB,iBAAiBlC,IAWrCgC,6BAAA,SAAiBhC,GACf,OAAO5d,KAAKmhB,MAAMpB,iBAAiBnC,IASrCgC,wBAAA,SACE2B,GAEA,OAAO,IAAIhC,GACTvf,KAAKmhB,MACL,KACAnhB,KAAKkhB,aACL,EACAK,IAIJ3B,4BAAA,SACE1W,EACAqY,GAEA,OAAO,IAAIhC,GACTvf,KAAKmhB,MACLjY,EACAlJ,KAAKkhB,aACL,EACAK,IAIJ3B,mCAAA,SACE1W,EACAqY,GAEA,OAAO,IAAIhC,GACTvf,KAAKmhB,MACLjY,EACAlJ,KAAKkhB,aACL,EACAK,IAIJ3B,+BAAA,SACE2B,GAEA,OAAO,IAAIhC,GACTvf,KAAKmhB,MACL,KACAnhB,KAAKkhB,aACL,EACAK,IAhNG3B,aAAa,IAAIqB,QC9jBpBO,GAAQvP,KAAKpE,IAAI,iBAarB,WAAYlN,GACV,IAAkB8gB,EAGlBzhB,KAAK6f,OAHa4B,EAGI9gB,EAAS,EAF7BgS,SAAUV,KAAKpE,IAAI4T,GAAOD,GAAe,KAG3CxhB,KAAK0hB,SAAW1hB,KAAK6f,MAAQ,EAC7B,IAHiB9N,EAGX4P,GAHW5P,EAGI/R,KAAK6f,MAHQlN,SAAShT,MAAMoS,EAAO,GAAG5M,KAAK,KAAM,IAItEnF,KAAK4hB,MAASjhB,EAAS,EAAKghB,EAYhC,OANEE,yBAAA,WAEE,IAAMrC,IAAWxf,KAAK4hB,MAAS,GAAO5hB,KAAK0hB,UAE3C,OADA1hB,KAAK0hB,WACElC,QAmBEsC,GAAgB,SAC3BC,EACAjN,EACAkN,EACAC,GAEAF,EAAUzQ,KAAKwD,GAEf,IAAMoN,EAAoB,SACxBC,EACA1S,GAEA,IACI2S,EACAlZ,EAFEvI,EAAS8O,EAAO0S,EAGtB,GAAc,GAAVxhB,EACF,OAAO,KACF,GAAc,GAAVA,EAGT,OAFAyhB,EAAYL,EAAUI,GACtBjZ,EAAM8Y,EAAQA,EAAMI,GAAeA,EAC5B,IAAI1C,GACTxW,EACCkZ,EAAUxG,KACX8D,GAAS0B,MACT,KACA,MAGF,IAAMiB,EAAS1P,SAAUhS,EAAS,EAAW,IAAMwhB,EAC7CzN,EAAOwN,EAAkBC,EAAKE,GAC9B1N,EAAQuN,EAAkBG,EAAS,EAAG5S,GAG5C,OAFA2S,EAAYL,EAAUM,GACtBnZ,EAAM8Y,EAAQA,EAAMI,GAAeA,EAC5B,IAAI1C,GACTxW,EACCkZ,EAAUxG,KACX8D,GAAS0B,MACT1M,EACAC,IAgDA2N,EA3CmB,SAASC,GA2BhC,IA1BA,IAAI3G,EAAuB,KACvB0G,EAAO,KACP3E,EAAQoE,EAAUphB,OAEhB6hB,EAAe,SAASC,EAAmBhD,GAC/C,IAAM0C,EAAMxE,EAAQ8E,EACdhT,EAAOkO,EACbA,GAAS8E,EACT,IAAMC,EAAYR,EAAkBC,EAAM,EAAG1S,GACvC2S,EAAYL,EAAUI,GACtBjZ,EAAS8Y,EAAQA,EAAMI,GAAeA,EAC5CO,EACE,IAAIjD,GAASxW,EAAMkZ,EAAUxG,KAAmB6D,EAAO,KAAMiD,KAI3DC,EAAgB,SAASC,GAG3BhH,EAFEA,EACFA,EAAKlH,KAAOkO,EAGZN,EAAOM,GAKFpiB,EAAI,EAAGA,EAAI+hB,EAAO1C,QAASrf,EAAG,CACrC,IAAMqiB,EAAQN,EAAOO,eAEfL,EAAYxQ,KAAKE,IAAI,EAAGoQ,EAAO1C,OAASrf,EAAI,IAC9CqiB,EACFL,EAAaC,EAAW/C,GAAS0B,QAGjCoB,EAAaC,EAAW/C,GAAS0B,OACjCoB,EAAaC,EAAW/C,GAASC,MAGrC,OAAO2C,EAIIS,CADE,IAAIlB,GAAUE,EAAUphB,SAGvC,OAAO,IAAIif,GAAgBqC,GAAcnN,EAAawN,IHlIlDU,GAAiB,iBAoBrB,WACUC,EAGAC,GAHAljB,cAAAijB,EAGAjjB,eAAAkjB,EA6HZ,OA/IE1jB,sBAAW2jB,iBAAX,WAWE,OAVA9f,EACoBub,GAClB,uCAEFD,GACEA,IACA,IAAIwE,EACF,CAAEnF,YAAagF,IACf,CAAEhF,YAAaY,sCAYrBuE,gBAAA,SAAIC,GACF,IAAMC,EAAY9Y,EAAQvK,KAAKijB,SAAUG,GACzC,IAAKC,EAAW,MAAM,IAAI5f,MAAM,wBAA0B2f,GAE1D,OAAIC,aAAqBzD,GAChByD,EAIA,MAIXF,qBAAA,SAASG,GACP,OAAOjZ,EAASrK,KAAKkjB,UAAWI,EAAgBna,aAGlDga,qBAAA,SACEG,EACAC,GAEAlgB,EACEigB,IAAoB/G,GACpB,uEAMF,IAJA,IAUIiH,EAVEzB,EAAY,GACd0B,GAAkB,EAChBC,EAAOH,EAAiBI,YAAY9H,GAAU+H,MAChDniB,EAAOiiB,EAAKG,UACTpiB,GACLgiB,EACEA,GAAmBH,EAAgBQ,YAAYriB,EAAKma,MACtDmG,EAAU1f,KAAKZ,GACfA,EAAOiiB,EAAKG,UAIZL,EADEC,EACS3B,GAAcC,EAAWuB,EAAgBS,cAEzCf,GAEb,IAAMgB,EAAYV,EAAgBna,WAC5B8a,OAAmBjkB,KAAKkjB,WAC9Be,EAAYD,GAAaV,EACzB,IAAMY,OAAkBlkB,KAAKijB,UAE7B,OADAiB,EAAWF,GAAaR,EACjB,IAAIL,EAASe,EAAYD,IAMlCd,yBAAA,SACEf,EACAmB,GAFF,WAwCE,OAAO,IAAIJ,EApCQ1Y,EACjBzK,KAAKijB,SACL,SAACkB,EAA6CH,GAC5C,IAAMrG,EAAQpT,EAAQ9C,EAAKyb,UAAWc,GAEtC,GADA3gB,EAAOsa,EAAO,oCAAsCqG,GAChDG,IAAoBnB,GAAgB,CAEtC,GAAIrF,EAAMmG,YAAY1B,EAAUxG,MAAO,CAKrC,IAHA,IAAMmG,EAAY,GACZ2B,EAAOH,EAAiBI,YAAY9H,GAAU+H,MAChDniB,EAAOiiB,EAAKG,UACTpiB,GACDA,EAAKqM,MAAQsU,EAAUtU,MACzBiU,EAAU1f,KAAKZ,GAEjBA,EAAOiiB,EAAKG,UAGd,OADA9B,EAAU1f,KAAK+f,GACRN,GAAcC,EAAWpE,EAAMoG,cAGtC,OAAOf,GAGT,IAAMoB,EAAeb,EAAiBlT,IAAI+R,EAAUtU,MAChDuW,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAYjU,OACxB,IAAIyL,GAAUuG,EAAUtU,KAAMsW,KAG3BC,EAAYlE,OAAOiC,EAAWA,EAAUxG,QAIrB5b,KAAKkjB,YAMvCC,8BAAA,SACEf,EACAmB,GAoBA,OAAO,IAAIJ,EAlBQ1Y,EAAIzK,KAAKijB,SAAU,SACpCkB,GAEA,GAAIA,IAAoBnB,GAEtB,OAAOmB,EAEP,IAAMC,EAAeb,EAAiBlT,IAAI+R,EAAUtU,MACpD,OAAIsW,EACKD,EAAgB/T,OACrB,IAAIyL,GAAUuG,EAAUtU,KAAMsW,IAIzBD,IAImBnkB,KAAKkjB,iBI9JzC,SAGgBoB,GAAqB5P,EAAiBC,GACpD,OAAO5D,GAAY2D,EAAK5G,KAAM6G,EAAM7G,MAGtC,SAAgByW,GAAgB7P,EAAcC,GAC5C,OAAO5D,GAAY2D,EAAMC,GH6B3B,kBAqBE,WACmB6P,EACAxH,EACTyH,GAFSzkB,eAAAwkB,EACAxkB,mBAAAgd,EACThd,eAAAykB,EAvBFzkB,eAA2B,KA8B7BA,KAAKgd,eACPL,GAAqB3c,KAAKgd,eAGxBhd,KAAKwkB,UAAUha,WACjBnH,GACGrD,KAAKgd,eAAiBhd,KAAKgd,cAAcxS,UAC1C,wCAyaR,OA5cEhL,sBAAWklB,oBAAX,WACE,OACExH,KACCA,GAAa,IAAIwH,EAChB,IAAI9E,GAAwB2E,IAC5B,KACApB,GAASwB,2CAmCfD,uBAAA,WACE,OAAO,GAITA,wBAAA,WACE,OAAO1kB,KAAKgd,eAAiBE,IAI/BwH,2BAAA,SAAevH,GACb,OAAInd,KAAKwkB,UAAUha,UAEVxK,KAEA,IAAI0kB,EAAa1kB,KAAKwkB,UAAWrH,EAAiBnd,KAAKykB,YAKlEC,8BAAA,SAAkBtH,GAEhB,GAAkB,cAAdA,EACF,OAAOpd,KAAK8c,cAEZ,IAAMtH,EAAQxV,KAAKwkB,UAAUnU,IAAI+M,GACjC,OAAiB,OAAV5H,EAAiB0H,GAAa1H,GAKzCkP,qBAAA,SAASzP,GACP,IAAMwI,EAAQxI,EAAKX,WACnB,OAAc,OAAVmJ,EAAuBzd,KAEpBA,KAAK4kB,kBAAkBnH,GAAOoH,SAAS5P,EAAKR,aAIrDiQ,qBAAA,SAAStH,GACP,OAAyC,OAAlCpd,KAAKwkB,UAAUnU,IAAI+M,IAI5BsH,iCAAA,SAAqBtH,EAAmBE,GAEtC,GADAja,EAAOia,EAAc,8CACH,cAAdF,EACF,OAAOpd,KAAKud,eAAeD,GAE3B,IAAM8E,EAAY,IAAIvG,GAAUuB,EAAWE,GACvC+G,SAAaS,SAajB,OAVEA,EAFExH,EAAa9S,WACf6Z,EAAcrkB,KAAKwkB,UAAUpU,OAAOgN,GACtBpd,KAAKykB,UAAUM,kBAC3B3C,EACApiB,KAAKwkB,aAGPH,EAAcrkB,KAAKwkB,UAAUrE,OAAO/C,EAAWE,GACjCtd,KAAKykB,UAAUO,aAAa5C,EAAWpiB,KAAKwkB,YAIrD,IAAIE,EAAaL,EADVA,EAAY7Z,UAAY0S,GAAald,KAAKgd,cACN8H,IAKtDJ,wBAAA,SAAYzP,EAAYqI,GACtB,IAAMG,EAAQxI,EAAKX,WACnB,GAAc,OAAVmJ,EACF,OAAOH,EAEPja,EACsB,cAApB4R,EAAKX,YAAmD,IAArBW,EAAKD,YACxC,8CAEF,IAAMiQ,EAAoBjlB,KAAK4kB,kBAAkBnH,GAAOC,YACtDzI,EAAKR,WACL6I,GAEF,OAAOtd,KAAKwd,qBAAqBC,EAAOwH,IAK5CP,oBAAA,WACE,OAAO1kB,KAAKwkB,UAAUha,WAIxBka,wBAAA,WACE,OAAO1kB,KAAKwkB,UAAU3E,SAUxB6E,gBAAA,SAAI7G,GACF,GAAI7d,KAAKwK,UAAW,OAAO,KAE3B,IAAMF,EAAgC,GAClC4a,EAAU,EACZjF,EAAS,EACTkF,GAAiB,EAYnB,GAXAnlB,KAAKolB,aAAaxG,GAAgB,SAAS1V,EAAamU,GACtD/S,EAAIpB,GAAOmU,EAAUjP,IAAIyP,GAEzBqH,IACIC,GAAkBT,EAAa5R,gBAAgB/K,KAAKmB,GACtD+W,EAAShO,KAAKoD,IAAI4K,EAAQvP,OAAOxH,IAEjCic,GAAiB,KAIhBtH,GAAgBsH,GAAkBlF,EAAS,EAAIiF,EAAS,CAE3D,IAAMG,EAAmB,GACzB,IAAK,IAAInc,KAAOoB,EAAK+a,EAAOnc,GAAyBoB,EAAIpB,GAEzD,OAAOmc,EAKP,OAHIxH,IAAiB7d,KAAK8c,cAActS,YACtCF,EAAI,aAAetK,KAAK8c,cAAc1O,OAEjC9D,GAKXoa,iBAAA,WACE,GAAuB,OAAnB1kB,KAAKie,UAAoB,CAC3B,IAAIqH,EAAS,GACRtlB,KAAK8c,cAActS,YACtB8a,GACE,YACA5I,GAAiB1c,KAAK8c,cAAc1O,OACpC,KAEJpO,KAAKolB,aAAaxG,GAAgB,SAAS1V,EAAKmU,GAC9C,IAAMkI,EAAYlI,EAAUmI,OACV,KAAdD,IAAkBD,GAAU,IAAMpc,EAAM,IAAMqc,KAGpDvlB,KAAKie,UAAuB,KAAXqH,EAAgB,GAAK/V,EAAK+V,GAE7C,OAAOtlB,KAAKie,WAIdyG,oCAAA,SACEtH,EACAC,EACAM,GAEA,IAAM8H,EAAMzlB,KAAK0lB,cAAc/H,GAC/B,GAAI8H,EAAK,CACP,IAAME,EAAcF,EAAIG,kBACtB,IAAI/J,GAAUuB,EAAWC,IAE3B,OAAOsI,EAAcA,EAAY7X,KAAO,KAExC,OAAO9N,KAAKwkB,UAAUoB,kBAAkBxI,IAQ5CsH,8BAAA,SAAkBpB,GAChB,IAAMmC,EAAMzlB,KAAK0lB,cAAcpC,GAC/B,GAAImC,EAAK,CACP,IAAMnE,EAASmE,EAAInE,SACnB,OAAOA,GAAUA,EAAOxT,KAExB,OAAO9N,KAAKwkB,UAAUlD,UAQ1BoD,0BAAA,SAAcpB,GACZ,IAAMhC,EAASthB,KAAK6lB,kBAAkBvC,GACtC,OAAIhC,EACK,IAAIzF,GAAUyF,EAAQthB,KAAKwkB,UAAUnU,IAAIiR,IAEzC,MASXoD,6BAAA,SAAiBpB,GACf,IAAMmC,EAAMzlB,KAAK0lB,cAAcpC,GAC/B,GAAImC,EAAK,CACP,IAAMxF,EAASwF,EAAIxF,SACnB,OAAOA,GAAUA,EAAOnS,KAExB,OAAO9N,KAAKwkB,UAAUvE,UAQ1ByE,yBAAA,SAAapB,GACX,IAAMrD,EAASjgB,KAAK8lB,iBAAiBxC,GACrC,OAAIrD,EACK,IAAIpE,GAAUoE,EAAQjgB,KAAKwkB,UAAUnU,IAAI4P,IAEzC,MAOXyE,yBAAA,SACE/G,EACAC,GAEA,IAAM6H,EAAMzlB,KAAK0lB,cAAc/H,GAC/B,OAAI8H,EACKA,EAAI3F,iBAAiB,SAASiG,GACnC,OAAOnI,EAAOmI,EAAYjY,KAAMiY,EAAYnK,QAGvC5b,KAAKwkB,UAAU1E,iBAAiBlC,IAQ3C8G,wBAAA,SACEpB,GAEA,OAAOtjB,KAAKgmB,gBAAgB1C,EAAgB2C,UAAW3C,IASzDoB,4BAAA,SACEwB,EACA5C,GAEA,IAAMmC,EAAMzlB,KAAK0lB,cAAcpC,GAC/B,GAAImC,EACF,OAAOA,EAAIO,gBAAgBE,EAAW,SAAAhd,GAAO,OAAAA,IAO7C,IALA,IAAMpH,EAAW9B,KAAKwkB,UAAUwB,gBAC9BE,EAAUpY,KACV+N,GAAU+H,MAERniB,EAAOK,EAASqkB,OACL,MAAR1kB,GAAgB6hB,EAAgBvH,QAAQta,EAAMykB,GAAa,GAChEpkB,EAAS+hB,UACTpiB,EAAOK,EAASqkB,OAElB,OAAOrkB,GAQX4iB,+BAAA,SACEpB,GAEA,OAAOtjB,KAAKomB,uBACV9C,EAAgB+C,UAChB/C,IASJoB,mCAAA,SACE4B,EACAhD,GAEA,IAAMmC,EAAMzlB,KAAK0lB,cAAcpC,GAC/B,GAAImC,EACF,OAAOA,EAAIW,uBAAuBE,EAAS,SAASpd,GAClD,OAAOA,IAQT,IALA,IAAMpH,EAAW9B,KAAKwkB,UAAU4B,uBAC9BE,EAAQxY,KACR+N,GAAU+H,MAERniB,EAAOK,EAASqkB,OACL,MAAR1kB,GAAyD,EAAzC6hB,EAAgBvH,QAAQta,EAAM6kB,IACnDxkB,EAAS+hB,UACTpiB,EAAOK,EAASqkB,OAElB,OAAOrkB,GAOX4iB,sBAAA,SAAU3P,GACR,OAAI/U,KAAKwK,UACHuK,EAAMvK,UACD,GAEC,EAEDuK,EAAM8H,cAAgB9H,EAAMvK,UAC9B,EACEuK,IAAUuC,IACX,EAGD,GAOXoN,sBAAA,SAAUpB,GACR,GACEA,IAAoB/G,IACpBvc,KAAKykB,UAAU8B,SAASjD,GAExB,OAAOtjB,KAEP,IAAM8kB,EAAc9kB,KAAKykB,UAAU+B,SACjClD,EACAtjB,KAAKwkB,WAEP,OAAO,IAAIE,EAAa1kB,KAAKwkB,UAAWxkB,KAAKgd,cAAe8H,IAOhEJ,sBAAA,SAAU/G,GACR,OAAOA,IAAUpB,IAAavc,KAAKykB,UAAU8B,SAAS5I,IAMxD+G,mBAAA,SAAO3P,GACL,GAAIA,IAAU/U,KACZ,OAAO,EACF,GAAI+U,EAAM8H,aACf,OAAO,EAEP,IAAM4J,EAAoB1R,EAC1B,GAAK/U,KAAK8c,cAAc4B,OAAO+H,EAAkB3J,eAE1C,CAAA,GACL9c,KAAKwkB,UAAU3E,UAAY4G,EAAkBjC,UAAU3E,QAkBvD,OAAO,EAZP,IAJA,IAAM6G,EAAW1mB,KAAK2jB,YAAY/E,IAC5B+H,EAAYF,EAAkB9C,YAAY/E,IAC5CgI,EAAcF,EAAS7C,UACvBgD,EAAeF,EAAU9C,UACtB+C,GAAeC,GAAc,CAClC,GACED,EAAY9Y,OAAS+Y,EAAa/Y,OACjC8Y,EAAYhL,KAAK8C,OAAOmI,EAAajL,MAEtC,OAAO,EAETgL,EAAcF,EAAS7C,UACvBgD,EAAeF,EAAU9C,UAE3B,OAAuB,OAAhB+C,GAAyC,OAAjBC,EAlB/B,OAAO,GAiCLnC,0BAAR,SACEpB,GAEA,OAAIA,IAAoB/G,GACf,KAEAvc,KAAKykB,UAAUpU,IAAIiT,EAAgBna,aA7T/Bub,kBAAkB,sBA+WtBpN,GAAW,gBAvCtB,oBACEnP,YACE,IAAIyX,GAAwB2E,IAC5BG,GAAaxH,WACbiG,GAASwB,eA4Bf,OAjC6Bpc,OAS3Bue,sBAAA,SAAU/R,GACR,OAAIA,IAAU/U,KACL,EAEA,GAIX8mB,mBAAA,SAAO/R,GAEL,OAAOA,IAAU/U,MAGnB8mB,wBAAA,WACE,OAAO9mB,MAGT8mB,8BAAA,SAAkB1J,GAChB,OAAOsH,GAAaxH,YAGtB4J,oBAAA,WACE,OAAO,MA/BkBpC,KAoD7BllB,OAAOunB,iBAAiBlL,GAAW,CACjCO,IAAK,CACHja,MAAO,IAAI0Z,GAAUhL,GAAU6T,GAAaxH,aAE9C8J,IAAK,CACH7kB,MAAO,IAAI0Z,GAAU/K,GAAUwG,OAOnC+E,GAAShF,aAAeqN,GAAaxH,WACrCD,GAAST,0BAA4BkI,GTpjBnCpN,GSqjBSA,GFhjBTA,GEijBiBA,GIljBnB,IAAM2P,IAAY,EASlB,SAAgBxK,GACdyK,EACA9N,GAEA,gBAFAA,QAEa,OAAT8N,EACF,OAAOxC,GAAaxH,WAoBtB,GAjBoB,iBAATgK,GAAqB,cAAeA,IAC7C9N,EAAW8N,EAAK,cAGlB7jB,EACe,OAAb+V,GACsB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,iBAAT8N,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,iBAATA,GAAqB,QAASA,EAEvC,OAAO,IAAIjK,GADMiK,EACazK,GAAarD,IAG7C,GAAM8N,aAAgBvnB,QAAUsnB,GA8CzB,CACL,IAAIE,EAAazC,GAAaxH,WAY9B,OAXAtL,GAAKsV,EAAM,SAAChe,EAAake,GACvB,GAAI/c,EAAS6c,EAAMhe,IACW,MAAxBA,EAAIyI,UAAU,EAAG,GAAY,CAE/B,IAAM0L,EAAYZ,GAAa2K,IAC3B/J,EAAUR,cAAiBQ,EAAU7S,YACvC2c,EAAOA,EAAK3J,qBAAqBtU,EAAKmU,OAKvC8J,EAAK5J,eAAed,GAAarD,IA1DxC,IAAMiO,EAAwB,GAC1BC,GAAuB,EAc3B,GAZA1V,GAD2CsV,EACxB,SAAChe,EAAKsM,GACvB,GAA4B,MAAxBtM,EAAIyI,UAAU,EAAG,GAAY,CAE/B,IAAM0L,EAAYZ,GAAajH,GAC1B6H,EAAU7S,YACb8c,EACEA,IAAyBjK,EAAUP,cAActS,UACnD6c,EAAShlB,KAAK,IAAIwZ,GAAU3S,EAAKmU,QAKhB,GAAnBgK,EAAS1mB,OACX,OAAO+jB,GAAaxH,WAGtB,IAAMqK,EAAWzF,GACfuF,EACA/C,GACA,SAAAlC,GAAa,OAAAA,EAAUtU,MACvByW,IAEF,GAAI+C,EAAsB,CACxB,IAAME,EAAiB1F,GACrBuF,EACAzI,GAAemF,cAEjB,OAAO,IAAIW,GACT6C,EACA9K,GAAarD,GACb,IAAI+J,GACF,CAAEnF,YAAawJ,GACf,CAAExJ,YAAaY,MAInB,OAAO,IAAI8F,GACT6C,EACA9K,GAAarD,GACb+J,GAASwB,SNrFflI,GMyGcA,GCxGhB,ICqBIgL,GCxBQC,GAAAA,GF8DCC,GAAc,gBA3D3B,4DAyDA,OAzDgCpf,OAI9Bqf,oBAAA,SAAQnc,EAAclM,GACpB,IAAMyf,EAAWvT,EAAEmQ,KAAKqD,UAAU1f,EAAEqc,MACpC,OAAiB,IAAboD,EACKjO,GAAYtF,EAAEqC,KAAMvO,EAAEuO,MAEtBkR,GAOX4I,wBAAA,SAAYhM,GACV,OAAO,GAMTgM,gCAAA,SAAoB5L,EAAeC,GACjC,OAAQD,EAAQ0C,OAAOzC,IAMzB2L,oBAAA,WACE,OAAQ/L,GAAkBO,KAM5BwL,oBAAA,WACE,OAAQ/L,GAAkBmL,KAQ5BY,qBAAA,SAAStL,EAAoBxO,GAC3B,IAAM+Z,EAAYpL,GAAaH,GAC/B,OAAO,IAAIT,GAAU/N,EAAM+Z,IAM7BD,qBAAA,WACE,MAAO,aAvDqB9L,oBGI9B,WAAoBgM,GAApB,MACE3f,0BADkBV,aAAAqgB,EAGlBzkB,GACGykB,EAAWtd,WAAuC,cAA1Bsd,EAAWxT,WACpC,6DA4DN,OAlE+B/L,OAenBwf,yBAAV,SAAuBC,GACrB,OAAOA,EAAKnD,SAAS7kB,KAAK8nB,aAM5BC,wBAAA,SAAYnM,GACV,OAAQA,EAAKiJ,SAAS7kB,KAAK8nB,YAAYtd,WAMzCud,oBAAA,SAAQtc,EAAclM,GACpB,IAAM0oB,EAASjoB,KAAKkoB,aAAazc,EAAEmQ,MAC7BuM,EAASnoB,KAAKkoB,aAAa3oB,EAAEqc,MAC7BoD,EAAWiJ,EAAOhJ,UAAUkJ,GAClC,OAAiB,IAAbnJ,EACKjO,GAAYtF,EAAEqC,KAAMvO,EAAEuO,MAEtBkR,GAOX+I,qBAAA,SAASzL,EAAoBxO,GAC3B,IAAM+Z,EAAYpL,GAAaH,GACzBV,EAAO8I,GAAaxH,WAAWQ,YACnC1d,KAAK8nB,WACLD,GAEF,OAAO,IAAIhM,GAAU/N,EAAM8N,IAM7BmM,oBAAA,WACE,IAAMnM,EAAO8I,GAAaxH,WAAWQ,YAAY1d,KAAK8nB,WAAYxQ,IAClE,OAAO,IAAIuE,GAAU/K,GAAU8K,IAMjCmM,qBAAA,WACE,OAAO/nB,KAAK8nB,WAAWte,QAAQrE,KAAK,SAhET2W,kBCM7B,WACmBsM,EACAC,EACAC,GAFAtoB,WAAAooB,EACApoB,UAAAqoB,EACAroB,YAAAsoB,EAqJrB,OA5IEC,gBAAA,WAEE,OADArc,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QAC9CX,KAAKooB,MAAMha,OAQpBma,sBAAA,WAEE,OADArc,EAAiB,yBAA0B,EAAG,EAAGxL,UAAUC,QACpDX,KAAKooB,MAAMha,KAAI,IAKxBma,mBAAA,WAGE,OADArc,EAAiB,sBAAuB,EAAG,EAAGxL,UAAUC,QACjDX,KAAKwoB,aAQdD,mBAAA,WAEE,OADArc,EAAiB,sBAAuB,EAAG,EAAGxL,UAAUC,SAChDX,KAAKooB,MAAM5d,WASrB+d,kBAAA,SAAME,GACJvc,EAAiB,qBAAsB,EAAG,EAAGxL,UAAUC,QAEvD8nB,EAAkB/iB,OAAO+iB,GACzBnO,GAAmB,qBAAsB,EAAGmO,GAAiB,GAE7D,IAAMC,EAAY,IAAI9U,GAAK6U,GACrBE,EAAW3oB,KAAKqoB,KAAK7S,MAAMkT,GACjC,OAAO,IAAIH,EACTvoB,KAAKooB,MAAMvD,SAAS6D,GACpBC,EACA/J,KAUJ2J,qBAAA,SAASE,GACPvc,EAAiB,wBAAyB,EAAG,EAAGxL,UAAUC,QAC1D2Z,GAAmB,wBAAyB,EAAGmO,GAAiB,GAEhE,IAAMC,EAAY,IAAI9U,GAAK6U,GAC3B,OAAQzoB,KAAKooB,MAAMvD,SAAS6D,GAAWle,WAQzC+d,wBAAA,WAIE,OAHArc,EAAiB,2BAA4B,EAAG,EAAGxL,UAAUC,QAGtDX,KAAKooB,MAAMtL,cAAc1O,OAWlCma,oBAAA,SAAQ3K,GAAR,WAIE,OAHA1R,EAAiB,uBAAwB,EAAG,EAAGxL,UAAUC,QACzDiM,EAAiB,uBAAwB,EAAGgR,GAAQ,IAEhD5d,KAAKooB,MAAMvL,gBAEM7c,KAAKooB,MAEJhD,aAAaplB,KAAKsoB,OAAQ,SAACpf,EAAK0S,GACpD,OAAOgC,EACL,IAAI2K,EAAa3M,EAAMnU,EAAK4gB,KAAK7S,MAAMtM,GAAM0V,QASnD2J,wBAAA,WAGE,OAFArc,EAAiB,2BAA4B,EAAG,EAAGxL,UAAUC,SAEzDX,KAAKooB,MAAMvL,eACF7c,KAAKooB,MAAM5d,WAG1BhL,sBAAI+oB,uBAAJ,WACE,OAAOvoB,KAAKqoB,KAAKO,0CAOnBL,wBAAA,WAGE,OAFArc,EAAiB,2BAA4B,EAAG,EAAGxL,UAAUC,QAEtDX,KAAKooB,MAAMS,eAMpBN,mBAAA,WAGE,OAFArc,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QAE9CX,KAAKqoB,MAGd7oB,sBAAI+oB,uBAAJ,WACE,OAAOvoB,KAAK8oB,6DC/Hd,WACS1O,EAMA2O,EACA1N,EACA2N,GARAhpB,eAAAoa,EAMApa,uBAAA+oB,EACA/oB,cAAAqb,EACArb,cAAAgpB,EAyCX,OAnCEC,oBAAA,WACE,IAAMC,EAAMlpB,KAAKqb,SAASyN,SAC1B,MAAuB,UAAnB9oB,KAAKoa,UACA8O,EAAIjU,KAEJiU,EAAIC,YAAYlU,MAO3BgU,yBAAA,WACE,OAAOjpB,KAAKoa,WAMd6O,2BAAA,WACE,OAAOjpB,KAAK+oB,kBAAkBK,eAAeppB,OAM/CipB,qBAAA,WACE,OACEjpB,KAAKqpB,UAAUlgB,WACf,IACAnJ,KAAKoa,UACL,IACAvQ,EAAU7J,KAAKqb,SAASmN,iCAW5B,WACSO,EACAjmB,EACAmS,GAFAjV,uBAAA+oB,EACA/oB,WAAA8C,EACA9C,UAAAiV,EA8BX,OAxBEqU,oBAAA,WACE,OAAOtpB,KAAKiV,MAMdqU,yBAAA,WACE,MAAO,UAMTA,2BAAA,WACE,OAAOtpB,KAAK+oB,kBAAkBK,eAAeppB,OAM/CspB,qBAAA,WACE,OAAOtpB,KAAKiV,KAAK9L,WAAa,8BC3DhC,WACUogB,EACAC,EACAC,GAFAzpB,eAAAupB,EACAvpB,qBAAAwpB,EACAxpB,cAAAypB,EA8EZ,OAxEEC,uBAAA,SAAWtP,GACT,MAAqB,UAAdA,GAMTsP,wBAAA,SAAYC,EAAgBC,GAC1B,IAAMjM,EAAQiM,EAAMC,iBAAiBC,WACrC,OAAO,IAAIb,GACT,QACAjpB,KACA,IAAIuoB,GAAaoB,EAAOI,aAAcH,EAAMd,SAAUnL,KAO1D+L,2BAAA,SAAeM,GACb,IAAMC,EAAMjqB,KAAKypB,SACjB,GAAiC,WAA7BO,EAAUE,eAA6B,CACzC7mB,EACErD,KAAKwpB,gBACL,gEAEF,IAAMW,EAAWnqB,KAAKwpB,gBACtB,OAAO,WAELW,EAASvpB,KAAKqpB,EAAMD,EAA0BlnB,QAGhD,IAAMsnB,EAAKpqB,KAAKupB,UAChB,OAAO,WACLa,EAAGxpB,KAAKqpB,EAAMD,EAAwB3O,YAQ5CqO,8BAAA,SAAkB5mB,EAAcmS,GAC9B,OAAIjV,KAAKwpB,gBACA,IAAIF,GAAYtpB,KAAM8C,EAAOmS,GAE7B,MAOXyU,oBAAA,SAAQ3U,GACN,OAAMA,aAAiB2U,KAEX3U,EAAMwU,YAAcvpB,KAAKupB,WAKjCxU,EAAMwU,YAAcvpB,KAAKupB,WAAaxU,EAAM0U,WAAazpB,KAAKypB,WAQpEC,2BAAA,WACE,OAA0B,OAAnB1pB,KAAKupB,8BAmBd,WACUc,EAGAb,EACAC,GAJAzpB,gBAAAqqB,EAGArqB,qBAAAwpB,EACAxpB,cAAAypB,EAiHZ,OA3GEa,uBAAA,SAAWlQ,GACT,IAAImQ,EACY,mBAAdnQ,EAAiC,cAAgBA,EAGnD,OAFAmQ,EACmB,qBAAjBA,EAAsC,gBAAkBA,EACnDlgB,EAASrK,KAAKqqB,WAAYE,IAMnCD,8BAAA,SAAkBxnB,EAAcmS,GAC9B,OAAIjV,KAAKwpB,gBACA,IAAIF,GAAYtpB,KAAM8C,EAAOmS,GAE7B,MAOXqV,wBAAA,SAAYX,EAAgBC,GAC1BvmB,EAA2B,MAApBsmB,EAAOvM,UAAmB,yCACjC,IAAM8L,EAAMU,EAAMd,SAAStT,MAA8BmU,EAAgB,WACnEhM,EAAQiM,EAAMC,iBAAiBC,WACrC,OAAO,IAAIb,GACTU,EAAO/S,KACP5W,KACA,IAAIuoB,GAAaoB,EAAOI,aAAcb,EAAKvL,GAC3CgM,EAAOX,WAOXsB,2BAAA,SAAeN,GACb,IAAMC,EAAMjqB,KAAKypB,SACjB,GAAiC,WAA7BO,EAAUE,eAA6B,CACzC7mB,EACErD,KAAKwpB,gBACL,gEAEF,IAAMgB,EAAWxqB,KAAKwpB,gBACtB,OAAO,WAELgB,EAAS5pB,KAAKqpB,EAAMD,EAA0BlnB,QAGhD,IAAM2nB,EAAKzqB,KAAKqqB,WAAYL,EAAwB5P,WACpD,OAAO,WACLqQ,EAAG7pB,KACDqpB,EACCD,EAAwB3O,SACxB2O,EAAwBhB,YASjCsB,oBAAA,SAAQvV,GAAR,WACE,GAAIA,aAAiBuV,EAAwB,CAC3C,IAAKtqB,KAAKqqB,aAAetV,EAAMsV,WAC7B,OAAO,EACF,GAAIrqB,KAAKypB,WAAa1U,EAAM0U,SAAU,CAC3C,IAAMiB,EAAYlrB,OAAO+J,KAAKwL,EAAMsV,YAC9BM,EAAWnrB,OAAO+J,KAAKvJ,KAAKqqB,YAC5BO,EAAaF,EAAU/pB,OAE7B,GAAIiqB,IADcD,EAAShqB,OACG,CAK5B,GAAmB,IAAfiqB,EAWF,OAAOD,EAASE,MACd,SAAAzQ,GACE,OAAArF,EAAMsV,WAAWjQ,KAAe3S,EAAK4iB,WAAWjQ,KAZpD,IAAM0Q,EAAWJ,EAAU,GACrBK,EAAUJ,EAAS,GACzB,QACEI,IAAYD,GACV/V,EAAMsV,WAAWS,IAChB9qB,KAAKqqB,WAAWU,IACjBhW,EAAMsV,WAAWS,KAAc9qB,KAAKqqB,WAAWU,MAa3D,OAAO,GAMTT,2BAAA,WACE,OAA2B,OAApBtqB,KAAKqqB,+BLzOd,WACSW,EACA/V,EACCgW,EACAC,GAHDlrB,UAAAgrB,EACAhrB,UAAAiV,EACCjV,kBAAAirB,EACAjrB,oBAAAkrB,EAolBZ,OAjmBE1rB,sBAAW2rB,gCAIX,WAEE,OADA9nB,EAAOokB,GAAwB,oCACxBA,QANT,SAAkCrZ,GAChCqZ,GAAyBrZ,mCAoBZ+c,0BAAf,SAAuCtU,GACrC,IAAIuU,EAAY,KACZC,EAAU,KAQd,GAPIxU,EAAOyU,aACTF,EAAYvU,EAAO0U,sBAEjB1U,EAAO2U,WACTH,EAAUxU,EAAO4U,oBAGf5U,EAAOiT,aAAevN,GAAW,CACnC,IAAMmP,EACJ,mGAEIC,EACJ,wGAEF,GAAI9U,EAAOyU,WAAY,CAErB,GADkBzU,EAAO+U,qBACR/a,GACf,MAAM,IAAIpN,MAAMioB,GACX,GAAyB,iBAAdN,EAChB,MAAM,IAAI3nB,MAAMkoB,GAGpB,GAAI9U,EAAO2U,SAAU,CAEnB,GADgB3U,EAAOgV,mBACR/a,GACb,MAAM,IAAIrN,MAAMioB,GACX,GAAuB,iBAAZL,EAChB,MAAM,IAAI5nB,MAAMkoB,SAGf,GAAI9U,EAAOiT,aAAelL,IAC/B,GACgB,MAAbwM,IAAsBjS,GAAgBiS,IAC3B,MAAXC,IAAoBlS,GAAgBkS,GAErC,MAAM,IAAI5nB,MACR,sKAUJ,GALAJ,EACEwT,EAAOiT,qBAAsB/B,IAC3BlR,EAAOiT,aAAenC,GACxB,uBAGc,MAAbyD,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAE3B,MAAM,IAAI5nB,MACR,0FAYO0nB,iBAAf,SAA8BtU,GAC5B,GACEA,EAAOyU,YACPzU,EAAO2U,UACP3U,EAAOiV,aACNjV,EAAOkV,mBAER,MAAM,IAAItoB,MACR,uGAUE0nB,2CAAR,SAAuChf,GACrC,IAA4B,IAAxBnM,KAAKkrB,eACP,MAAM,IAAIznB,MAAM0I,EAAS,gDAO7Bgf,2BAAA,WACE,OAAOnrB,KAAKirB,cAMdE,mBAAA,WAKE,OAJAjf,EAAiB,YAAa,EAAG,EAAGxL,UAAUC,QAIvC,IAAIwqB,EAAM1D,uBAAuBznB,KAAKgrB,KAAMhrB,KAAKiV,OAU1DkW,eAAA,SACE/Q,EACAzS,EACAqkB,EACAlf,GAEAZ,EAAiB,WAAY,EAAG,EAAGxL,UAAUC,QAC7CwZ,GAAkB,WAAY,EAAGC,GAAW,GAC5CxN,EAAiB,WAAY,EAAGjF,GAAU,GAE1C,IAAMskB,EAAMd,EAAMe,yBAChB,WACAF,EACAlf,GAGF,GAAkB,UAAdsN,EACFpa,KAAKmsB,aAAaxkB,EAAUskB,EAAIG,OAAQH,EAAInf,aACvC,CACL,IAAMuf,EAA8C,GACpDA,EAAUjS,GAAazS,EACvB3H,KAAKssB,aAAaD,EAAWJ,EAAIG,OAAQH,EAAInf,SAE/C,OAAOnF,GASCwjB,yBAAV,SACExjB,EACA4kB,EACAzf,GAEA,IAAM0f,EAAY,IAAI9C,GACpB/hB,EACA4kB,GAAkB,KAClBzf,GAAW,MAEb9M,KAAKgrB,KAAKyB,yBAAyBzsB,KAAMwsB,IAS3CrB,yBAAA,SACEkB,EACAE,EACAzf,GAEA,IAAM0f,EAAY,IAAIlC,GACpB+B,EACAE,EACAzf,GAEF9M,KAAKgrB,KAAKyB,yBAAyBzsB,KAAMwsB,IAQ3CrB,gBAAA,SACE/Q,EACAzS,EACAmF,GAEAZ,EAAiB,YAAa,EAAG,EAAGxL,UAAUC,QAC9CwZ,GAAkB,YAAa,EAAGC,GAAW,GAC7CxN,EAAiB,YAAa,EAAGjF,GAAU,GAC3CkF,EAAsB,YAAa,EAAGC,GAAS,GAE/C,IAAI0f,EAAsC,KACtCH,EAAqD,KACvC,UAAdjS,EAEFoS,EAAY,IAAI9C,GADM/hB,GAAY,KAGhC,KACAmF,GAAW,MAEJsN,IACLzS,KACF0kB,EAAY,IACFjS,GAAazS,GAEzB6kB,EAAY,IAAIlC,GAAuB+B,EAAW,KAAMvf,GAAW,OAErE9M,KAAKgrB,KAAK0B,4BAA4B1sB,KAAMwsB,IAW9CrB,iBAAA,SACE/Q,EACAuS,EACAC,EACA9f,GAJF,WAMEZ,EAAiB,aAAc,EAAG,EAAGxL,UAAUC,QAC/CwZ,GAAkB,aAAc,EAAGC,GAAW,GAC9CxN,EAAiB,aAAc,EAAG+f,GAAc,GAEhD,IAAMV,EAAMd,EAAMe,yBAChB,aACAU,EACA9f,GAOE+f,GAAY,EACVjS,EAAW,IAAIlT,EAGrBkT,EAASvT,QAAQO,MAAM,cAEvB,IAAMklB,EAAe,SAACzR,GAGhBwR,IACFA,GAAY,EACZplB,EAAKslB,IAAI3S,EAAW0S,GAEhBH,GACFA,EAAazc,KAAK+b,EAAInf,QAAtB6f,CAA+BtR,GAEjCT,EAASrT,QAAQ8T,KAcrB,OAVArb,KAAKgtB,GACH5S,EACA0S,EACY,SAAAG,GACVxlB,EAAKslB,IAAI3S,EAAW0S,GAEhBb,EAAIG,QAAQH,EAAIG,OAAOlc,KAAK+b,EAAInf,QAApBmf,CAA6BgB,GAC7CrS,EAASpT,OAAOylB,KAGbrS,EAASvT,SAQlB8jB,yBAAA,SAAa+B,GAEX,GADAhhB,EAAiB,qBAAsB,EAAG,EAAGxL,UAAUC,QAEpC,iBAAVusB,GACPjb,KAAKI,MAAM6a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAIzpB,MACR,kEAGJ,GAAIzD,KAAKirB,aAAaa,WACpB,MAAM,IAAIroB,MACR,uGAKJ,OAAO,IAAI0nB,EACTnrB,KAAKgrB,KACLhrB,KAAKiV,KACLjV,KAAKirB,aAAakC,aAAaD,GAC/BltB,KAAKkrB,iBASTC,wBAAA,SAAY+B,GAEV,GADAhhB,EAAiB,oBAAqB,EAAG,EAAGxL,UAAUC,QAEnC,iBAAVusB,GACPjb,KAAKI,MAAM6a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAIzpB,MACR,iEAGJ,GAAIzD,KAAKirB,aAAaa,WACpB,MAAM,IAAIroB,MACR,sGAKJ,OAAO,IAAI0nB,EACTnrB,KAAKgrB,KACLhrB,KAAKiV,KACLjV,KAAKirB,aAAamC,YAAYF,GAC9BltB,KAAKkrB,iBASTC,yBAAA,SAAalW,GAEX,GADA/I,EAAiB,qBAAsB,EAAG,EAAGxL,UAAUC,QAC1C,SAATsU,EACF,MAAM,IAAIxR,MACR,2EAEG,GAAa,cAATwR,EACT,MAAM,IAAIxR,MACR,qFAEG,GAAa,WAATwR,EACT,MAAM,IAAIxR,MACR,+EAGJ6W,GAAmB,qBAAsB,EAAGrF,GAAM,GAClDjV,KAAKqtB,+BAA+B,sBACpC,IAAMC,EAAa,IAAI1Z,GAAKqB,GAC5B,GAAIqY,EAAW9iB,UACb,MAAM,IAAI/G,MACR,qFAGJ,IAAMka,EAAQ,IAAIoK,GAAUuF,GACtBC,EAAYvtB,KAAKirB,aAAauC,QAAQ7P,GAG5C,OAFAwN,EAAMsC,wBAAwBF,GAEvB,IAAIpC,EAAMnrB,KAAKgrB,KAAMhrB,KAAKiV,KAAMsY,GAA8B,IAOvEpC,uBAAA,WACEjf,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QACrDX,KAAKqtB,+BAA+B,oBACpC,IAAME,EAAYvtB,KAAKirB,aAAauC,QAAQjR,IAE5C,OADA4O,EAAMsC,wBAAwBF,GACvB,IAAIpC,EAAMnrB,KAAKgrB,KAAMhrB,KAAKiV,KAAMsY,GAA8B,IAOvEpC,4BAAA,WACEjf,EAAiB,wBAAyB,EAAG,EAAGxL,UAAUC,QAC1DX,KAAKqtB,+BAA+B,yBACpC,IAAME,EAAYvtB,KAAKirB,aAAauC,QAAQ5O,IAE5C,OADAuM,EAAMsC,wBAAwBF,GACvB,IAAIpC,EAAMnrB,KAAKgrB,KAAMhrB,KAAKiV,KAAMsY,GAA8B,IAOvEpC,yBAAA,WACEjf,EAAiB,qBAAsB,EAAG,EAAGxL,UAAUC,QACvDX,KAAKqtB,+BAA+B,sBACpC,IAAME,EAAYvtB,KAAKirB,aAAauC,QAAQ7F,IAE5C,OADAwD,EAAMsC,wBAAwBF,GACvB,IAAIpC,EAAMnrB,KAAKgrB,KAAMhrB,KAAKiV,KAAMsY,GAA8B,IAQvEpC,oBAAA,SACEhpB,EACA2L,gBADA3L,QAGA+J,EAAiB,gBAAiB,EAAG,EAAGxL,UAAUC,QAClD0Y,GAAwB,gBAAiB,EAAGlX,EAAOnC,KAAKiV,MAAM,GAC9DoF,GAAY,gBAAiB,EAAGvM,GAAM,GAEtC,IAAMyf,EAAYvtB,KAAKirB,aAAayC,QAAQvrB,EAAO2L,GAGnD,GAFAqd,EAAMwC,eAAeJ,GACrBpC,EAAMsC,wBAAwBF,GAC1BvtB,KAAKirB,aAAaK,WACpB,MAAM,IAAI7nB,MACR,0FAUJ,YAJc0D,IAAVhF,IAEF2L,EADA3L,EAAQ,MAGH,IAAIgpB,EAAMnrB,KAAKgrB,KAAMhrB,KAAKiV,KAAMsY,EAAWvtB,KAAKkrB,iBAQzDC,kBAAA,SACEhpB,EACA2L,gBADA3L,QAGA+J,EAAiB,cAAe,EAAG,EAAGxL,UAAUC,QAChD0Y,GAAwB,cAAe,EAAGlX,EAAOnC,KAAKiV,MAAM,GAC5DoF,GAAY,cAAe,EAAGvM,GAAM,GAEpC,IAAMyf,EAAYvtB,KAAKirB,aAAa2C,MAAMzrB,EAAO2L,GAGjD,GAFAqd,EAAMwC,eAAeJ,GACrBpC,EAAMsC,wBAAwBF,GAC1BvtB,KAAKirB,aAAaO,SACpB,MAAM,IAAI/nB,MACR,oFAKJ,OAAO,IAAI0nB,EAAMnrB,KAAKgrB,KAAMhrB,KAAKiV,KAAMsY,EAAWvtB,KAAKkrB,iBAUzDC,oBAAA,SAAQhpB,EAAyC2L,GAI/C,GAHA5B,EAAiB,gBAAiB,EAAG,EAAGxL,UAAUC,QAClD0Y,GAAwB,gBAAiB,EAAGlX,EAAOnC,KAAKiV,MAAM,GAC9DoF,GAAY,gBAAiB,EAAGvM,GAAM,GAClC9N,KAAKirB,aAAaK,WACpB,MAAM,IAAI7nB,MACR,0FAIJ,GAAIzD,KAAKirB,aAAaO,SACpB,MAAM,IAAI/nB,MACR,sFAIJ,OAAOzD,KAAK0tB,QAAQvrB,EAAO2L,GAAM8f,MAAMzrB,EAAO2L,IAMhDqd,qBAAA,WAGE,OAFAjf,EAAiB,iBAAkB,EAAG,EAAGxL,UAAUC,QAE5CX,KAAKgrB,KAAK7hB,WAAanJ,KAAKiV,KAAK4Y,sBAK1C1C,mBAAA,WAGE,OADAjf,EAAiB,eAAgB,EAAG,EAAGxL,UAAUC,QAC1CX,KAAKmJ,YAOdgiB,wBAAA,WACE,OAAOnrB,KAAKirB,aAAa6C,kBAM3B3C,4BAAA,WACE,IAAM7gB,EAAMtK,KAAK+tB,cACX9gB,EAAKoE,GAAkB/G,GAC7B,MAAc,OAAP2C,EAAc,UAAYA,GAQnCke,oBAAA,SAAQpW,GAEN,GADA7I,EAAiB,gBAAiB,EAAG,EAAGxL,UAAUC,UAC5CoU,aAAiBoW,GAAQ,CAG7B,MAAM,IAAI1nB,MADR,wFAIJ,IAAMuqB,EAAWhuB,KAAKgrB,OAASjW,EAAMiW,KAC/BiD,EAAWjuB,KAAKiV,KAAKyJ,OAAO3J,EAAME,MAClCiZ,EACJluB,KAAKmuB,oBAAsBpZ,EAAMoZ,kBAEnC,OAAOH,GAAYC,GAAYC,GAWlB/C,2BAAf,SACEhf,EACAiiB,EACAthB,GAEA,IAAMmf,EAGF,CAAEG,OAAQ,KAAMtf,QAAS,MAC7B,GAAIshB,GAAmBthB,EACrBmf,EAAIG,OAASgC,EACbxhB,EAAiBT,EAAQ,EAAG8f,EAAIG,QAAQ,GAExCH,EAAInf,QAAUA,EACdD,EAAsBV,EAAQ,EAAG8f,EAAInf,SAAS,QACzC,GAAIshB,EAET,GAA+B,iBAApBA,GAAoD,OAApBA,EAEzCnC,EAAInf,QAAUshB,MACT,CAAA,GAA+B,mBAApBA,EAGhB,MAAM,IAAI3qB,MACR+I,EAAYL,EAAQ,GAAG,GACrB,0DAJJ8f,EAAIG,OAASgC,EAQjB,OAAOnC,GAGTzsB,sBAAI2rB,uBAAJ,WACE,OAAOnrB,KAAK8oB,6DMpoBhB,aACU9oB,WAAqB,KAEZA,cAA4C,IAAIquB,IA0HnE,OAlHEC,iBAAA,SAAKrZ,GACH,GAAkB,MAAdjV,KAAKmC,MACP,OAAOnC,KAAKmC,MAAM0iB,SAAS5P,GACtB,IAAKA,EAAKzK,WAAkC,EAArBxK,KAAKuuB,SAASC,KAAU,CACpD,IAAMC,EAAWxZ,EAAKX,WAEtB,OADAW,EAAOA,EAAKR,WACRzU,KAAKuuB,SAASG,IAAID,GACFzuB,KAAKuuB,SAASle,IAAIoe,GACnBE,KAAK1Z,GAEf,KAGT,OAAO,MAWXqZ,qBAAA,SAASrZ,EAAYrM,GACnB,GAAIqM,EAAKzK,UACPxK,KAAKmC,MAAQyG,EACb5I,KAAKuuB,SAASK,aACT,GAAmB,OAAf5uB,KAAKmC,MACdnC,KAAKmC,MAAQnC,KAAKmC,MAAMub,YAAYzI,EAAMrM,OACrC,CACL,IAAM6lB,EAAWxZ,EAAKX,WACjBtU,KAAKuuB,SAASG,IAAID,IACrBzuB,KAAKuuB,SAASpe,IAAIse,EAAU,IAAIH,GAGlC,IAAM9Y,EAAQxV,KAAKuuB,SAASle,IAAIoe,GAChCxZ,EAAOA,EAAKR,WACZe,EAAMqZ,SAAS5Z,EAAMrM,KAUzB0lB,mBAAA,SAAOrZ,GACL,GAAIA,EAAKzK,UAGP,OAFAxK,KAAKmC,MAAQ,KACbnC,KAAKuuB,SAASK,SACP,EAEP,GAAmB,OAAf5uB,KAAKmC,MAAgB,CACvB,GAAInC,KAAKmC,MAAM0a,aAEb,OAAO,EAEP,IAAM1a,EAAQnC,KAAKmC,MACnBnC,KAAKmC,MAAQ,KAEb,IAAM2sB,EAAO9uB,KAKb,OAJAmC,EAAMijB,aAAaxG,GAAgB,SAAS1V,EAAK6lB,GAC/CD,EAAKD,SAAS,IAAIjb,GAAK1K,GAAM6lB,KAGxB/uB,KAAKgvB,OAAO/Z,GAEhB,GAAyB,EAArBjV,KAAKuuB,SAASC,KAAU,CACjC,IAAMC,EAAWxZ,EAAKX,WAEtB,GADAW,EAAOA,EAAKR,WACRzU,KAAKuuB,SAASG,IAAID,GACCzuB,KAAKuuB,SAASle,IAAIoe,GAAUO,OAAO/Z,IAEtDjV,KAAKuuB,SAASU,OAAOR,GAIzB,OAA8B,IAAvBzuB,KAAKuuB,SAASC,KAErB,OAAO,GAYbF,wBAAA,SAAYY,EAAkBC,GACT,OAAfnvB,KAAKmC,MACPgtB,EAAKD,EAAYlvB,KAAKmC,OAEtBnC,KAAKolB,aAAa,SAAClc,EAAK6lB,GACtB,IAAM9Z,EAAO,IAAIrB,GAAKsb,EAAW/lB,WAAa,IAAMD,GACpD6lB,EAAKK,YAAYna,EAAMka,MAU7Bb,yBAAA,SAAaa,GACXnvB,KAAKuuB,SAASc,QAAQ,SAACN,EAAM7lB,GAC3BimB,EAAKjmB,EAAK6lB,WClGHO,GAAuB,SAClCntB,EACAotB,GAEA,OAAKptB,GAA0B,iBAAVA,GAGnBkB,EAAO,QAASlB,EAAO,6CAChBotB,EAAaptB,EAAM,SAHnBA,GAoCEqtB,GAA+B,SAC1C5T,EACA2T,GAEA,IAOItT,EAPEwT,EAAS7T,EAAKkB,cAAc1O,MAM5BgL,EAAWkW,GAAqBG,EAAQF,GAG9C,GAAI3T,EAAKiB,aAAc,CACrB,IAAM6S,EAAW9T,EACXzZ,EAAQmtB,GAAqBI,EAAS3R,WAAYwR,GACxD,OACEptB,IAAUutB,EAAS3R,YACnB3E,IAAasW,EAAS5S,cAAc1O,MAE7B,IAAI6O,GAAS9a,EAAOsa,GAAarD,IAEjCwC,EAGT,IAAM+T,EAAe/T,EAcrB,OAZIxC,KADJ6C,EAAU0T,GACoB7S,cAAc1O,QAC1C6N,EAAUA,EAAQsB,eAAe,IAAIN,GAAS7D,KAEhDuW,EAAavK,aAAaxG,GAAgB,SAASxB,EAAWC,GAC5D,IAAMC,EAAekS,GACnBnS,EACAkS,GAEEjS,IAAiBD,IACnBpB,EAAUA,EAAQuB,qBAAqBJ,EAAWE,MAG/CrB,INxGCyL,GAAAA,KAAAA,oCAEVA,uBACAA,yCACAA,2CAoCF,IO3CIkI,GCUAnI,iBRkCF,WACSoI,EACAC,EACAC,EACAC,GAHAhwB,cAAA6vB,EACA7vB,gBAAA8vB,EACA9vB,aAAA+vB,EACA/vB,YAAAgwB,EAEP3sB,GAAQ2sB,GAAUF,EAAY,uCAoClC,OA9BSG,OAAO,IAAIA,GACF,GACd,EACA,MACY,GAOPA,SAAS,IAAIA,GAClB,GACgB,EAChB,MACY,GAOPA,uBAAuB,SAASF,GACrC,OAAO,IAAIE,GACT,GACgB,EAChBF,GACY,uBSrEhB,WAC2B9a,EACAib,EACAC,GAFAnwB,UAAAiV,EACAjV,kBAAAkwB,EACAlwB,YAAAmwB,EAd3BnwB,UAAO0nB,GAAc0I,eAGrBpwB,YAASiwB,GAAgBI,KAwC3B,OAvBEC,8BAAA,SAAkBlT,GAChB,GAAKpd,KAAKiV,KAAKzK,UAUR,CAAA,GAA+B,MAA3BxK,KAAKkwB,aAAa/tB,MAM3B,OALAkB,EACErD,KAAKkwB,aAAa3B,SAAS/jB,UAC3B,4DAGKxK,KAEP,IAAM0iB,EAAY1iB,KAAKkwB,aAAaK,QAAQ,IAAI3c,GAAKwJ,IACrD,OAAO,IAAIkT,EAAa1c,GAAK4c,MAAO9N,EAAW1iB,KAAKmwB,QAdpD,OAJA9sB,EACErD,KAAKiV,KAAKX,aAAe8I,EACzB,iDAEK,IAAIkT,EACTtwB,KAAKiV,KAAKR,WACVzU,KAAKkwB,aACLlwB,KAAKmwB,4BFSX,WACkBhuB,EACAosB,gBAlCbqB,KACHA,GAAyB,IAAIhQ,GAC3BzO,KAgCcod,EA7BXqB,IA4BW5vB,WAAAmC,EACAnC,cAAAuuB,EA4UpB,OA3VSkC,aAAP,SAAqBnmB,GACnB,IAAIykB,EAAyB0B,EAAcD,MAI3C,OAHA5e,GAAKtH,EAAK,SAACoe,EAAmBgI,GAC5B3B,EAAOA,EAAK5e,IAAI,IAAIyD,GAAK8U,GAAYgI,KAEhC3B,GAoBT0B,oBAAA,WACE,OAAsB,OAAfzwB,KAAKmC,OAAkBnC,KAAKuuB,SAAS/jB,WAe9CimB,6CAAA,SACEjc,EACAmc,GAEA,GAAkB,MAAd3wB,KAAKmC,OAAiBwuB,EAAU3wB,KAAKmC,OACvC,MAAO,CAAE8S,KAAMrB,GAAK4c,MAAOruB,MAAOnC,KAAKmC,OAEvC,GAAIqS,EAAahK,UACf,OAAO,KAEP,IAAMiT,EAAQjJ,EAAaF,WACrBkB,EAAQxV,KAAKuuB,SAASle,IAAIoN,GAChC,GAAc,OAAVjI,EAcF,OAAO,KAbP,IAAMob,EAA4Bpb,EAAMqb,iCACtCrc,EAAaC,WACbkc,GAEF,OAAiC,MAA7BC,EAMK,KAFA,CAAE3b,KAHQ,IAAIrB,GAAK6J,GAAOjI,MAC/Bob,EAA0B3b,MAEH9S,MAAOyuB,EAA0BzuB,QAiBpEsuB,qCAAA,SACEjc,GAEA,OAAOxU,KAAK6wB,iCAAiCrc,EAAc,WAAM,OAAA,KAOnEic,oBAAA,SAAQjc,GACN,GAAIA,EAAahK,UACf,OAAOxK,KAEP,IAAMyd,EAAQjJ,EAAaF,WACrBoO,EAAY1iB,KAAKuuB,SAASle,IAAIoN,GACpC,OAAkB,OAAdiF,EACKA,EAAU6N,QAAQ/b,EAAaC,YAE/Bgc,EAAcD,OAY3BC,gBAAA,SAAIjc,EAAoBsc,GACtB,GAAItc,EAAahK,UACf,OAAO,IAAIimB,EAAcK,EAAO9wB,KAAKuuB,UAErC,IAAM9Q,EAAQjJ,EAAaF,WAErByc,GADQ/wB,KAAKuuB,SAASle,IAAIoN,IAAUgT,EAAcD,OACjCrgB,IAAIqE,EAAaC,WAAYqc,GAC9CzM,EAAcrkB,KAAKuuB,SAASpO,OAAO1C,EAAOsT,GAChD,OAAO,IAAIN,EAAczwB,KAAKmC,MAAOkiB,IAUzCoM,mBAAA,SAAOjc,GACL,GAAIA,EAAahK,UACf,OAAIxK,KAAKuuB,SAAS/jB,UACTimB,EAAcD,MAEd,IAAIC,EAAc,KAAMzwB,KAAKuuB,UAGtC,IAAM9Q,EAAQjJ,EAAaF,WACrBkB,EAAQxV,KAAKuuB,SAASle,IAAIoN,GAChC,GAAIjI,EAAO,CACT,IAAMub,EAAWvb,EAAMpF,OAAOoE,EAAaC,YACvC4P,SAMJ,OAJEA,EADE0M,EAASvmB,UACGxK,KAAKuuB,SAASne,OAAOqN,GAErBzd,KAAKuuB,SAASpO,OAAO1C,EAAOsT,GAEzB,OAAf/wB,KAAKmC,OAAkBkiB,EAAY7Z,UAC9BimB,EAAcD,MAEd,IAAIC,EAAczwB,KAAKmC,MAAOkiB,GAGvC,OAAOrkB,MAWbywB,gBAAA,SAAIjc,GACF,GAAIA,EAAahK,UACf,OAAOxK,KAAKmC,MAEZ,IAAMsb,EAAQjJ,EAAaF,WACrBkB,EAAQxV,KAAKuuB,SAASle,IAAIoN,GAChC,OAAIjI,EACKA,EAAMnF,IAAImE,EAAaC,YAEvB,MAYbgc,oBAAA,SAAQjc,EAAoBwc,GAC1B,GAAIxc,EAAahK,UACf,OAAOwmB,EAEP,IAAMvT,EAAQjJ,EAAaF,WAErByc,GADQ/wB,KAAKuuB,SAASle,IAAIoN,IAAUgT,EAAcD,OACjCS,QAAQzc,EAAaC,WAAYuc,GACpD3M,SAMJ,OAJEA,EADE0M,EAASvmB,UACGxK,KAAKuuB,SAASne,OAAOqN,GAErBzd,KAAKuuB,SAASpO,OAAO1C,EAAOsT,GAErC,IAAIN,EAAczwB,KAAKmC,MAAOkiB,IAYzCoM,iBAAA,SAAQ/lB,GACN,OAAO1K,KAAKkxB,MAAMtd,GAAK4c,MAAO9lB,IAWxB+lB,kBAAR,SACEU,EACAzmB,GAEA,IAAM0mB,EAA4B,GAOlC,OANApxB,KAAKuuB,SAASzO,iBAAiB,SAC7B2O,EACA/L,GAEA0O,EAAM3C,GAAY/L,EAAUwO,MAAMC,EAAU3b,MAAMiZ,GAAW/jB,KAExDA,EAAGymB,EAAWnxB,KAAKmC,MAAOivB,IAUnCX,uBAAA,SAAcxb,EAAYhU,GACxB,OAAOjB,KAAKqxB,YAAYpc,EAAMrB,GAAK4c,MAAOvvB,IAGpCwvB,wBAAR,SACEa,EACAH,EACAlwB,GAEA,IAAMue,IAASxf,KAAKmC,OAAQlB,EAAEkwB,EAAWnxB,KAAKmC,OAC9C,GAAIqd,EACF,OAAOA,EAEP,GAAI8R,EAAa9mB,UACf,OAAO,KAEP,IAAMiT,EAAQ6T,EAAahd,WACrBid,EAAYvxB,KAAKuuB,SAASle,IAAIoN,GACpC,OAAI8T,EACKA,EAAUF,YACfC,EAAa7c,WACb0c,EAAU3b,MAAMiI,GAChBxc,GAGK,MAYfwvB,0BAAA,SACExb,EACAhU,GAEA,OAAOjB,KAAKwxB,eAAevc,EAAMrB,GAAK4c,MAAOvvB,IAGvCwvB,2BAAR,SACEa,EACAG,EACAxwB,GAEA,GAAIqwB,EAAa9mB,UACf,OAAOxK,KAEHA,KAAKmC,OACPlB,EAAEwwB,EAAqBzxB,KAAKmC,OAE9B,IAAMsb,EAAQ6T,EAAahd,WACrBid,EAAYvxB,KAAKuuB,SAASle,IAAIoN,GACpC,OAAI8T,EACKA,EAAUC,eACfF,EAAa7c,WACbgd,EAAoBjc,MAAMiI,GAC1Bxc,GAGKwvB,EAAcD,OAY3BC,oBAAA,SAAQxvB,GACNjB,KAAK0xB,SAAS9d,GAAK4c,MAAOvvB,IAGpBwvB,qBAAR,SACEgB,EACAxwB,GAEAjB,KAAKuuB,SAASzO,iBAAiB,SAAS1C,EAAWsF,GACjDA,EAAUgP,SAASD,EAAoBjc,MAAM4H,GAAYnc,KAEvDjB,KAAKmC,OACPlB,EAAEwwB,EAAqBzxB,KAAKmC,QAQhCsuB,yBAAA,SAAaxvB,GACXjB,KAAKuuB,SAASzO,iBACZ,SAAC1C,EAAmBsF,GACdA,EAAUvgB,OACZlB,EAAEmc,EAAWsF,EAAUvgB,UA7VxBsuB,QAAQ,IAAIA,EAAmB,yBGZtC,WAAmB1pB,EAAgCkO,GAAhCjV,YAAA+G,EAAgC/G,UAAAiV,EAFnDjV,UAAO0nB,GAAciK,gBAWvB,OAPEC,8BAAA,SAAkBxU,GAChB,OAAIpd,KAAKiV,KAAKzK,UACL,IAAIonB,EAAe5xB,KAAK+G,OAAQ6M,GAAK4c,OAErC,IAAIoB,EAAe5xB,KAAK+G,OAAQ/G,KAAKiV,KAAKR,gCCJrD,WACS1N,EACAkO,EACA+S,GAFAhoB,YAAA+G,EACA/G,UAAAiV,EACAjV,UAAAgoB,EALThoB,UAAO0nB,GAAcmK,UAmBvB,OAXEC,8BAAA,SAAkB1U,GAChB,OAAIpd,KAAKiV,KAAKzK,UACL,IAAIsnB,EACT9xB,KAAK+G,OACL6M,GAAK4c,MACLxwB,KAAKgoB,KAAKpD,kBAAkBxH,IAGvB,IAAI0U,EAAU9xB,KAAK+G,OAAQ/G,KAAKiV,KAAKR,WAAYzU,KAAKgoB,0BCXjE,WAC2BjhB,EACAkO,EACAsZ,GAFAvuB,YAAA+G,EACA/G,UAAAiV,EACAjV,cAAAuuB,EAL3BvuB,UAAO0nB,GAAcqK,MA+CvB,OApCEC,8BAAA,SAAkB5U,GAChB,GAAIpd,KAAKiV,KAAKzK,UAAW,CACvB,IAAMkY,EAAY1iB,KAAKuuB,SAASgC,QAAQ,IAAI3c,GAAKwJ,IACjD,OAAIsF,EAAUlY,UAEL,KACEkY,EAAUvgB,MAEZ,IAAI2vB,GAAU9xB,KAAK+G,OAAQ6M,GAAK4c,MAAO9N,EAAUvgB,OAGjD,IAAI6vB,EAAMhyB,KAAK+G,OAAQ6M,GAAK4c,MAAO9N,GAO5C,OAJArf,EACErD,KAAKiV,KAAKX,aAAe8I,EACzB,kEAEK,IAAI4U,EAAMhyB,KAAK+G,OAAQ/G,KAAKiV,KAAKR,WAAYzU,KAAKuuB,WAO7DyD,qBAAA,WACE,MACE,aACAhyB,KAAKiV,KACL,KACAjV,KAAK+G,OAAOoC,WACZ,WACAnJ,KAAKuuB,SAASplB,WACd,wBC7CJ,WACUif,EACA6J,EACAC,GAFAlyB,WAAAooB,EACApoB,uBAAAiyB,EACAjyB,eAAAkyB,EAgDZ,OAzCEC,+BAAA,WACE,OAAOnyB,KAAKiyB,mBAOdE,uBAAA,WACE,OAAOnyB,KAAKkyB,WAOdC,8BAAA,SAAkBld,GAChB,GAAIA,EAAKzK,UACP,OAAOxK,KAAKoyB,uBAAyBpyB,KAAKkyB,UAG5C,IAAMzD,EAAWxZ,EAAKX,WACtB,OAAOtU,KAAKqyB,mBAAmB5D,IAOjC0D,+BAAA,SAAmBjpB,GACjB,OACGlJ,KAAKoyB,uBAAyBpyB,KAAKkyB,WAAclyB,KAAKooB,MAAMkK,SAASppB,IAO1EipB,oBAAA,WACE,OAAOnyB,KAAKooB,0BC/Cd,WACmBmK,EACAC,GADAxyB,iBAAAuyB,EACAvyB,kBAAAwyB,EAqFrB,OA3DEC,4BAAA,SACEC,EACAC,EACAC,GAEA,OAAO,IAAIH,EACT,IAAIN,GAAUO,EAAWC,EAAUC,GACnC5yB,KAAKwyB,eAUTC,6BAAA,SACEI,EACAF,EACAC,GAEA,OAAO,IAAIH,EACTzyB,KAAKuyB,YACL,IAAIJ,GAAUU,EAAYF,EAAUC,KAOxCH,0BAAA,WACE,OAAOzyB,KAAKuyB,aAMdE,iCAAA,WACE,OAAOzyB,KAAKuyB,YAAYH,qBACpBpyB,KAAKuyB,YAAYO,UACjB,MAMNL,2BAAA,WACE,OAAOzyB,KAAKwyB,cAMdC,kCAAA,WACE,OAAOzyB,KAAKwyB,aAAaJ,qBACrBpyB,KAAKwyB,aAAaM,UAClB,MA5ECL,QAAQ,IAAIA,EACjB,IAAIN,GACFzN,GAAaxH,YACS,GACR,GAEhB,IAAIiV,GACFzN,GAAaxH,YACS,GACR,uBCvBlB,WACStG,EACAmT,EACA3M,EACA2V,EACA/J,GAJAhpB,UAAA4W,EACA5W,kBAAA+pB,EACA/pB,eAAAod,EACApd,aAAA+yB,EACA/yB,cAAAgpB,EAmEX,OA5DSgK,cAAP,SAAmB3X,GACjB,OAAO,IAAI2X,EAAOA,EAAOC,MAAO5X,IAQ3B2X,mBAAP,SAAwBvE,EAAkBpT,GACxC,OAAO,IAAI2X,EAAOA,EAAOE,YAAa7X,EAAUoT,IAQ3CuE,qBAAP,SAA0BvE,EAAkBpT,GAC1C,OAAO,IAAI2X,EAAOA,EAAOG,cAAe9X,EAAUoT,IAS7CuE,qBAAP,SACEvE,EACA2E,EACAC,GAEA,OAAO,IAAIL,EAAOA,EAAOM,cAAeF,EAAa3E,EAAU4E,IAQ1DL,mBAAP,SAAwBvE,EAAkBpT,GACxC,OAAO,IAAI2X,EAAOA,EAAOO,YAAalY,EAAUoT,IAK3CuE,cAAc,cAGdA,gBAAgB,gBAGhBA,gBAAgB,gBAGhBA,cAAc,cAGdA,QAAQ,2BChEf,WAA6B1K,GAAAtoB,YAAAsoB,EAkI/B,OAhIEkL,wBAAA,SACExL,EACA9e,EACA6nB,EACA0C,EACA1sB,EACA2sB,GAEArwB,EACE2kB,EAAK2L,UAAU3zB,KAAKsoB,QACpB,qDAEF,IAAMsL,EAAW5L,EAAKpD,kBAAkB1b,GAExC,OACE0qB,EAAS/O,SAAS4O,GAAc/U,OAAOqS,EAASlM,SAAS4O,KAKrDG,EAASppB,WAAaumB,EAASvmB,UAK1Bwd,GAIiB,MAAxB0L,IACE3C,EAASvmB,UACPwd,EAAKsK,SAASppB,GAChBwqB,EAAqBG,iBACnBb,GAAOc,mBAAmB5qB,EAAK0qB,IAGjCvwB,EACE2kB,EAAKnL,aACL,uEAGK+W,EAASppB,UAClBkpB,EAAqBG,iBACnBb,GAAOe,iBAAiB7qB,EAAK6nB,IAG/B2C,EAAqBG,iBACnBb,GAAOgB,mBAAmB9qB,EAAK6nB,EAAU6C,KAI3C5L,EAAKnL,cAAgBkU,EAASvmB,UACzBwd,EAGAA,EAAKxK,qBAAqBtU,EAAK6nB,GAAUkD,UAAUj0B,KAAKsoB,UAOnEkL,2BAAA,SACET,EACAmB,EACAR,GA6BA,OA3B4B,MAAxBA,IACGX,EAAQlW,cACXkW,EAAQ3N,aAAaxG,GAAgB,SAAS1V,EAAKmU,GAC5C6W,EAAQ5B,SAASppB,IACpBwqB,EAAqBG,iBACnBb,GAAOc,mBAAmB5qB,EAAKmU,MAKlC6W,EAAQrX,cACXqX,EAAQ9O,aAAaxG,GAAgB,SAAS1V,EAAKmU,GACjD,GAAI0V,EAAQT,SAASppB,GAAM,CACzB,IAAM0qB,EAAWb,EAAQnO,kBAAkB1b,GACtC0qB,EAASlV,OAAOrB,IACnBqW,EAAqBG,iBACnBb,GAAOgB,mBAAmB9qB,EAAKmU,EAAWuW,SAI9CF,EAAqBG,iBACnBb,GAAOe,iBAAiB7qB,EAAKmU,OAMhC6W,EAAQD,UAAUj0B,KAAKsoB,SAMhCkL,2BAAA,SAAeT,EAAeoB,GAC5B,OAAIpB,EAAQvoB,UACHka,GAAaxH,WAEb6V,EAAQxV,eAAe4W,IAOlCX,yBAAA,WACE,OAAO,GAMTA,6BAAA,WACE,OAAOxzB,MAMTwzB,qBAAA,WACE,OAAOxzB,KAAKsoB,2BChJhB,aACmBtoB,eAAiC,IAAIquB,IA4ExD,OA1EE+F,6BAAA,SAAiBzK,GACf,IAAM/S,EAAO+S,EAAO/S,KACd6X,EAAW9E,EAAOvM,UACxB/Z,EACEuT,GAAQoc,GAAOE,aACbtc,GAAQoc,GAAOM,eACf1c,GAAQoc,GAAOG,cACjB,6CAEF9vB,EACe,cAAborB,EACA,mDAEF,IAAM4F,EAAYr0B,KAAKs0B,UAAUjkB,IAAIoe,GACrC,GAAI4F,EAAW,CACb,IAAME,EAAUF,EAAUzd,KAC1B,GAAIA,GAAQoc,GAAOE,aAAeqB,GAAWvB,GAAOG,cAClDnzB,KAAKs0B,UAAUnkB,IACbse,EACAuE,GAAOgB,mBACLvF,EACA9E,EAAOI,aACPsK,EAAUtK,oBAGT,GACLnT,GAAQoc,GAAOG,eACfoB,GAAWvB,GAAOE,YAElBlzB,KAAKs0B,UAAUrF,OAAOR,QACjB,GACL7X,GAAQoc,GAAOG,eACfoB,GAAWvB,GAAOM,cAElBtzB,KAAKs0B,UAAUnkB,IACbse,EACAuE,GAAOc,mBAAmBrF,EAAU4F,EAAUtB,eAE3C,GACLnc,GAAQoc,GAAOM,eACfiB,GAAWvB,GAAOE,YAElBlzB,KAAKs0B,UAAUnkB,IACbse,EACAuE,GAAOe,iBAAiBtF,EAAU9E,EAAOI,mBAEtC,CAAA,GACLnT,GAAQoc,GAAOM,eACfiB,GAAWvB,GAAOM,cAWlB,MAAM9vB,EACJ,mCACEmmB,EACA,mBACA0K,GAbJr0B,KAAKs0B,UAAUnkB,IACbse,EACAuE,GAAOgB,mBACLvF,EACA9E,EAAOI,aACPsK,EAAUtB,gBAYhB/yB,KAAKs0B,UAAUnkB,IAAIse,EAAU9E,IAIjCyK,uBAAA,WACE,OAAOz0B,MAAM60B,KAAKx0B,KAAKs0B,UAAUG,gBCZxBC,GAA2B,eAzBxC,cAkBA,OAdEC,6BAAA,SAAiBlG,GACf,OAAO,MAMTkG,+BAAA,SACEhX,EACAnI,EACAhD,GAEA,OAAO,0BAwBT,WACUoiB,EACAC,EACAC,gBAAAA,QAFA90B,aAAA40B,EACA50B,gBAAA60B,EACA70B,6BAAA80B,EA4CZ,OAtCEC,6BAAA,SAAiBtG,GACf,IAAM7S,EAAO5b,KAAK60B,WAAWG,gBAC7B,GAAIpZ,EAAKyW,mBAAmB5D,GAC1B,OAAO7S,EAAKkX,UAAUlO,kBAAkB6J,GAExC,IAAMwG,EAC4B,MAAhCj1B,KAAK80B,wBACD,IAAI3C,GAAUnyB,KAAK80B,yBAAyB,GAAM,GAClD90B,KAAK60B,WAAWK,iBACtB,OAAOl1B,KAAK40B,QAAQO,kBAAkB1G,EAAUwG,IAOpDF,+BAAA,SACEpX,EACAnI,EACAhD,GAEA,IAAM4iB,EAC4B,MAAhCp1B,KAAK80B,wBACD90B,KAAK80B,wBACL90B,KAAK60B,WAAWQ,wBAChBC,EAAQt1B,KAAK40B,QAAQW,iBACzBH,EACA5f,EACA,EACAhD,EACAmL,GAEF,OAAqB,IAAjB2X,EAAM30B,OACD,KAEA20B,EAAM,YC/FjB,SACkBE,EACAC,GADAz1B,eAAAw1B,EACAx1B,aAAAy1B,iBAWlB,WAA6BC,GAAA11B,aAAA01B,EA+2B/B,OA12BEC,0BAAA,SAAcH,GACZnyB,EACEmyB,EACGR,gBACAlC,UACAa,UAAU3zB,KAAK01B,QAAQ5L,YAC1B,0BAEFzmB,EACEmyB,EACGN,iBACApC,UACAa,UAAU3zB,KAAK01B,QAAQ5L,YAC1B,4BAWJ6L,2BAAA,SACEC,EACAC,EACAC,EACAC,GAEA,IACIC,EAAcC,EADZC,EAAc,IAAI9B,GAExB,GAAIyB,EAAUjf,OAAS8Q,GAAcmK,UAAW,CAC9C,IAAMsE,EAAYN,EAEhBG,EADEG,EAAUpvB,OAAO8oB,SACJ7vB,KAAKo2B,oBAClBR,EACAO,EAAUlhB,KACVkhB,EAAUnO,KACV8N,EACAC,EACAG,IAGF7yB,EAAO8yB,EAAUpvB,OAAO+oB,WAAY,mBAIpCmG,EACEE,EAAUpvB,OAAOipB,QAChB4F,EAAaV,iBAAiBmB,eAC5BF,EAAUlhB,KAAKzK,UACLxK,KAAKs2B,sBAClBV,EACAO,EAAUlhB,KACVkhB,EAAUnO,KACV8N,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAUjf,OAAS8Q,GAAcqK,MAAO,CACjD,IAAMwE,EAAQV,EAEZG,EADEO,EAAMxvB,OAAO8oB,SACA7vB,KAAKw2B,gBAClBZ,EACAW,EAAMthB,KACNshB,EAAMhI,SACNuH,EACAC,EACAG,IAGF7yB,EAAOkzB,EAAMxvB,OAAO+oB,WAAY,mBAEhCmG,EACEM,EAAMxvB,OAAOipB,QAAU4F,EAAaV,iBAAiBmB,aACxCr2B,KAAKy2B,kBAClBb,EACAW,EAAMthB,KACNshB,EAAMhI,SACNuH,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAUjf,OAAS8Q,GAAc0I,eAAgB,CAC1D,IAAMsG,EAAeb,EAWnBG,EAVGU,EAAavG,OAUDnwB,KAAK22B,iBAClBf,EACAc,EAAazhB,KACb6gB,EACAC,EACAG,GAdal2B,KAAK42B,cAClBhB,EACAc,EAAazhB,KACbyhB,EAAaxG,aACb4F,EACAC,EACAG,OAWC,CAAA,GAAIL,EAAUjf,OAAS8Q,GAAciK,gBAQ1C,MAAMnuB,EAAe,2BAA6BqyB,EAAUjf,MAP5Dof,EAAeh2B,KAAK62B,gBAClBjB,EACAC,EAAU5gB,KACV6gB,EACAI,GAKJ,IAAMT,EAAUS,EAAYY,aAE5B,OADAnB,EAAcoB,oBAAoBnB,EAAcI,EAAcP,GACvD,IAAIuB,GAAgBhB,EAAcP,IAS5BE,sBAAf,SACEC,EACAI,EACAE,GAEA,IAAMxD,EAAYsD,EAAahB,gBAC/B,GAAItC,EAAUN,qBAAsB,CAClC,IAAM6E,EACJvE,EAAUI,UAAUjW,cAAgB6V,EAAUI,UAAUtoB,UACpD0sB,EAAkBtB,EAAauB,wBAEd,EAArBjB,EAAYv1B,SACXi1B,EAAaZ,gBAAgB5C,sBAC7B6E,IACEvE,EACEI,UACApU,YACJgU,EACEI,UACAhW,cACA4B,OAAOwY,EAAgBpa,iBAE1BoZ,EAAY7zB,KACV2wB,GAAOoE,YACgBpB,EAAamB,2BAgBpCxB,gDAAR,SACEH,EACA6B,EACAvB,EACA/uB,EACAmvB,GAEA,IAAMoB,EAAe9B,EAAUR,gBAC/B,GAA8C,MAA1Cc,EAAYyB,eAAeF,GAE7B,OAAO7B,EAEP,IAAIgC,SAAevC,SACnB,GAAIoC,EAAW7sB,UAMb,GAJAnH,EACEmyB,EAAUN,iBAAiB9C,qBAC3B,8DAEEoD,EAAUN,iBAAiBmB,aAAc,CAI3C,IAAMoB,EAAcjC,EAAUH,wBACxBqC,EACJD,aAAuB/S,GACnB+S,EACA/S,GAAaxH,WACbya,EAAwB7B,EAAY8B,0BACxCF,GAEFF,EAAgBx3B,KAAK01B,QAAQmC,eAC3BrC,EAAUR,gBAAgBlC,UAC1B6E,EACAzB,OAEG,CACL,IAAM4B,EAAehC,EAAYiC,uBAC/BvC,EAAUH,yBAEZmC,EAAgBx3B,KAAK01B,QAAQmC,eAC3BrC,EAAUR,gBAAgBlC,UAC1BgF,EACA5B,OAGC,CACL,IAAMzH,EAAW4I,EAAW/iB,WAC5B,GAAgB,aAAZma,EAAyB,CAC3BprB,EAC4B,GAA1Bg0B,EAAWriB,YACX,yDAEF,IAAMgjB,EAAeV,EAAaxE,UAClCmC,EAAaO,EAAUN,iBAAiBpC,UAExC,IAAMmF,EAAkBnC,EAAYoC,mCAClCb,EACAW,EACA/C,GAGAuC,EADqB,MAAnBS,EACcj4B,KAAK01B,QAAQnY,eAC3Bya,EACAC,GAIcX,EAAaxE,cAE1B,CACL,IAAMqF,EAAkBd,EAAW5iB,WAE/B2jB,SACJ,GAAId,EAAajF,mBAAmB5D,GAAW,CAC7CwG,EAAaO,EAAUN,iBAAiBpC,UACxC,IAAMuF,EAAmBvC,EAAYoC,mCACnCb,EACAC,EAAaxE,UACbmC,GAGAmD,EADsB,MAApBC,EACcf,EACbxE,UACAlO,kBAAkB6J,GAClB/Q,YAAYya,EAAiBE,GAGhBf,EACbxE,UACAlO,kBAAkB6J,QAGvB2J,EAAgBtC,EAAYX,kBAC1B1G,EACA+G,EAAUN,kBAIZsC,EADmB,MAAjBY,EACcp4B,KAAK01B,QAAQhY,YAC3B4Z,EAAaxE,UACbrE,EACA2J,EACAD,EACApxB,EACAmvB,GAIcoB,EAAaxE,WAInC,OAAO0C,EAAU8C,gBACfd,EACAF,EAAalF,sBAAwBiF,EAAW7sB,UAChDxK,KAAK01B,QAAQ6C,iBAgBnB5C,kCAAA,SACEC,EACAyB,EACAmB,EACA1C,EACAC,EACAE,EACAC,GAEA,IACIuC,EADEC,EAAgB9C,EAAaV,iBAE7ByD,EAAe1C,EACjBj2B,KAAK01B,QACL11B,KAAK01B,QAAQkD,mBACjB,GAAIvB,EAAW7sB,UACbiuB,EAAiBE,EAAad,eAC5Ba,EAAc5F,UACd0F,EACA,WAEG,GAAIG,EAAaJ,iBAAmBG,EAAcrC,aAAc,CAErE,IAAMwC,EAAgBH,EACnB5F,UACApV,YAAY2Z,EAAYmB,GAC3BC,EAAiBE,EAAad,eAC5Ba,EAAc5F,UACd+F,EACA,UAEG,CACL,IAAMpK,EAAW4I,EAAW/iB,WAC5B,IACGokB,EAAcI,kBAAkBzB,IACR,EAAzBA,EAAWriB,YAGX,OAAO4gB,EAET,IAAMuC,EAAkBd,EAAW5iB,WAE7B6I,EADYob,EAAc5F,UAAUlO,kBAAkB6J,GAC7B/Q,YAAYya,EAAiBK,GAE1DC,EADc,aAAZhK,EACekK,EAAapb,eAC5Bmb,EAAc5F,UACdxV,GAGeqb,EAAajb,YAC5Bgb,EAAc5F,UACdrE,EACAnR,EACA6a,EACAzD,GACA,MAIN,IAAMsB,EAAeJ,EAAamD,iBAChCN,EACAC,EAActG,sBAAwBiF,EAAW7sB,UACjDmuB,EAAaJ,gBAETxxB,EAAS,IAAIguB,GACjBe,EACAE,EACAD,GAEF,OAAO/1B,KAAKg5B,oCACVhD,EACAqB,EACAvB,EACA/uB,EACAmvB,IAcJP,gCAAA,SACEC,EACAyB,EACAmB,EACA1C,EACAC,EACAG,GAEA,IACIF,EAAcwB,EADZF,EAAe1B,EAAaZ,gBAE5BjuB,EAAS,IAAIguB,GACjBe,EACAF,EACAG,GAEF,GAAIsB,EAAW7sB,UACbgtB,EAAgBx3B,KAAK01B,QAAQmC,eAC3BjC,EAAaZ,gBAAgBlC,UAC7B0F,EACAtC,GAEFF,EAAeJ,EAAa0C,gBAC1Bd,GACA,EACAx3B,KAAK01B,QAAQ6C,oBAEV,CACL,IAAM9J,EAAW4I,EAAW/iB,WAC5B,GAAiB,cAAbma,EACF+I,EAAgBx3B,KAAK01B,QAAQnY,eAC3BqY,EAAaZ,gBAAgBlC,UAC7B0F,GAEFxC,EAAeJ,EAAa0C,gBAC1Bd,EACAF,EAAalF,qBACbkF,EAAajB,kBAEV,CACL,IAAM8B,EAAkBd,EAAW5iB,WAC7Bmf,EAAW0D,EAAaxE,UAAUlO,kBAAkB6J,GACtDsC,SACJ,GAAIoH,EAAgB3tB,UAElBumB,EAAWyH,MACN,CACL,IAAMnb,EAAYtW,EAAOkyB,iBAAiBxK,GAQtCsC,EAPa,MAAb1T,EAE8B,cAA9B8a,EAAgBre,WAChBuD,EAAUwH,SAASsT,EAAgBe,UAAU1uB,UAIlC6S,EAEAA,EAAUK,YAAYya,EAAiBK,GAIzC9T,GAAaxH,WAG5B,GAAK0W,EAASlV,OAAOqS,GAenBiF,EAAeJ,MAfe,CAC9B,IAAMuD,EAAen5B,KAAK01B,QAAQhY,YAChC4Z,EAAaxE,UACbrE,EACAsC,EACAoH,EACApxB,EACAmvB,GAEFF,EAAeJ,EAAa0C,gBAC1Ba,EACA7B,EAAalF,qBACbpyB,KAAK01B,QAAQ6C,kBAOrB,OAAOvC,GASML,iBAAf,SACEH,EACA/G,GAEA,OAAO+G,EAAUR,gBAAgB3C,mBAAmB5D,IAa9CkH,4BAAR,SACEH,EACAvgB,EACAmkB,EACAtD,EACA2B,EACAvB,GANF,WAcMmD,EAAe7D,EA6BnB,OA5BA4D,EAAgBE,QAAQ,SAAC9kB,EAAc6I,GACrC,IAAMkc,EAAYtkB,EAAKO,MAAMhB,GACzBmhB,EAAc6D,eAAehE,EAAW+D,EAAUjlB,cACpD+kB,EAAe5xB,EAAK2uB,oBAClBiD,EACAE,EACAlc,EACAyY,EACA2B,EACAvB,MAKNkD,EAAgBE,QAAQ,SAAC9kB,EAAc6I,GACrC,IAAMkc,EAAYtkB,EAAKO,MAAMhB,GACxBmhB,EAAc6D,eAAehE,EAAW+D,EAAUjlB,cACrD+kB,EAAe5xB,EAAK2uB,oBAClBiD,EACAE,EACAlc,EACAyY,EACA2B,EACAvB,MAKCmD,GASD1D,wBAAR,SAAoB/Z,EAAY2a,GAI9B,OAHAA,EAAM+C,QAAQ,SAAS9kB,EAAc6I,GACnCzB,EAAOA,EAAK8B,YAAYlJ,EAAc6I,KAEjCzB,GAcD+Z,8BAAR,SACEH,EACAvgB,EACAmkB,EACAtD,EACA2B,EACAxB,EACAC,GAPF,WAWE,GACEV,EACGN,iBACApC,UACAtoB,YACFgrB,EAAUN,iBAAiB9C,qBAE5B,OAAOoD,EAST,IACIiE,EADAJ,EAAe7D,EAGjBiE,EADExkB,EAAKzK,UACS4uB,EAEA3I,GAAcD,MAAMS,QAAQhc,EAAMmkB,GAEpD,IAAMnE,EAAaO,EAAUN,iBAAiBpC,UAyC9C,OAxCA2G,EAAclL,SAASzO,iBAAiB,SAAC2O,EAAU/L,GACjD,GAAIuS,EAAW3C,SAAS7D,GAAW,CACjC,IAAMiL,EAAclE,EACjBN,iBACApC,UACAlO,kBAAkB6J,GACfsC,EAAWtpB,EAAKkyB,YAAYD,EAAahX,GAC/C2W,EAAe5xB,EAAK6uB,sBAClB+C,EACA,IAAIzlB,GAAK6a,GACTsC,EACA+E,EACA2B,EACAxB,EACAC,MAINuD,EAAclL,SAASzO,iBAAiB,SAAC2O,EAAUmL,GACjD,IAAMC,GACHrE,EAAUN,iBAAiB7C,mBAAmB5D,IACvB,MAAxBmL,EAAez3B,MACjB,IAAK8yB,EAAW3C,SAAS7D,KAAcoL,EAAoB,CACzD,IAAMH,EAAclE,EACjBN,iBACApC,UACAlO,kBAAkB6J,GACfsC,EAAWtpB,EAAKkyB,YAAYD,EAAaE,GAC/CP,EAAe5xB,EAAK6uB,sBAClB+C,EACA,IAAIzlB,GAAK6a,GACTsC,EACA+E,EACA2B,EACAxB,EACAC,MAKCmD,GAaD1D,0BAAR,SACEH,EACAsE,EACA5J,EACA4F,EACAC,EACAG,GAEA,GAA2C,MAAvCJ,EAAYyB,eAAeuC,GAC7B,OAAOtE,EAIT,IAAMS,EAAmBT,EAAUN,iBAAiBmB,aAI9CoB,EAAcjC,EAAUN,iBAC9B,GAA0B,MAAtBhF,EAAa/tB,MAAe,CAE9B,GACG23B,EAAQtvB,WAAaitB,EAAYrF,sBAClCqF,EAAYqB,kBAAkBgB,GAE9B,OAAO95B,KAAKs2B,sBACVd,EACAsE,EACArC,EAAY3E,UAAUjO,SAASiV,GAC/BhE,EACAC,EACAE,EACAC,GAEG,GAAI4D,EAAQtvB,UAAW,CAG5B,IAAIuvB,EAAkBtJ,GAAcD,MAIpC,OAHAiH,EAAY3E,UAAU1N,aAAa7I,GAAW,SAASzO,EAAM8N,GAC3Dme,EAAkBA,EAAgB5pB,IAAI,IAAIyD,GAAK9F,GAAO8N,KAEjD5b,KAAKy2B,kBACVjB,EACAsE,EACAC,EACAjE,EACAC,EACAE,EACAC,GAGF,OAAOV,EAIT,IAAIwE,EAAkBvJ,GAAcD,MAUpC,OATAN,EAAaoJ,QAAQ,SAASW,EAAW93B,GACvC,IAAM+3B,EAAkBJ,EAAQtkB,MAAMykB,GAClCxC,EAAYqB,kBAAkBoB,KAChCF,EAAkBA,EAAgB7pB,IAChC8pB,EACAxC,EAAY3E,UAAUjO,SAASqV,OAI9Bl6B,KAAKy2B,kBACVjB,EACAsE,EACAE,EACAlE,EACAC,EACAE,EACAC,IAaEP,4BAAR,SACEH,EACAvgB,EACA6gB,EACAI,GAEA,IAAMiE,EAAgB3E,EAAUN,iBAC1Bc,EAAeR,EAAUuD,iBAC7BoB,EAAcrH,UACdqH,EAAc/H,sBAAwBnd,EAAKzK,UAC3C2vB,EAAc9D,cAEhB,OAAOr2B,KAAKg5B,oCACVhD,EACA/gB,EACA6gB,EACApB,GACAwB,IAaIP,6BAAR,SACEH,EACAvgB,EACA6gB,EACAsE,EACAlE,GAEA,IAAIvD,EACJ,GAAwC,MAApCmD,EAAYyB,eAAetiB,GAC7B,OAAOugB,EAEP,IAAMzuB,EAAS,IAAIguB,GACjBe,EACAN,EACA4E,GAEIC,EAAgB7E,EAAUR,gBAAgBlC,UAC5C0E,SACJ,GAAIviB,EAAKzK,WAAiC,cAApByK,EAAKX,WAA4B,CACrD,IAAI2H,SACJ,GAAIuZ,EAAUN,iBAAiB9C,qBAC7BnW,EAAU6Z,EAAYiC,uBACpBvC,EAAUH,6BAEP,CACL,IAAMiF,EAAiB9E,EAAUN,iBAAiBpC,UAClDzvB,EACEi3B,aAA0B5V,GAC1B,iDAEFzI,EAAU6Z,EAAY8B,0BACpB0C,GAGJre,EAAUA,EACVub,EAAgBx3B,KAAK01B,QAAQmC,eAC3BwC,EACApe,EACAia,OAEG,CACL,IAAMzH,EAAWxZ,EAAKX,WAClByc,EAAW+E,EAAYX,kBACzB1G,EACA+G,EAAUN,kBAGE,MAAZnE,GACAyE,EAAUN,iBAAiB7C,mBAAmB5D,KAE9CsC,EAAWsJ,EAAczV,kBAAkB6J,KAG3C+I,EADc,MAAZzG,EACc/wB,KAAK01B,QAAQhY,YAC3B2c,EACA5L,EACAsC,EACA9b,EAAKR,WACL1N,EACAmvB,GAGFV,EACGR,gBACAlC,UACAR,SAAS7D,GAGIzuB,KAAK01B,QAAQhY,YAC3B2c,EACA5L,EACA/J,GAAaxH,WACbjI,EAAKR,WACL1N,EACAmvB,GAGcmE,GAGF7vB,WACdgrB,EAAUN,iBAAiB9C,uBAG3BO,EAAWmD,EAAYiC,uBACrBvC,EAAUH,0BAECxY,eACX2a,EAAgBx3B,KAAK01B,QAAQmC,eAC3BL,EACA7E,EACAuD,IAQR,OAHAvD,EACE6C,EAAUN,iBAAiB9C,sBACe,MAA1C0D,EAAYyB,eAAe3jB,GAAK4c,OAC3BgF,EAAU8C,gBACfd,EACA7E,EACA3yB,KAAK01B,QAAQ6C,oCCh4BnB,WAAoBgC,GAAAv6B,YAAAu6B,EAKlBv6B,KAAKsoB,OAAStoB,KAAKu6B,OAAO1Q,iBAAiBC,WAsJ/C,OArIE0Q,qCAAA,SACE/E,EACAgF,EACAC,GAHF,WAKQC,EAAkB,GAClBC,EAAkB,GAuDxB,OArDAnF,EAAQpG,QAAQ,SAAA1F,GAEZA,EAAO/S,OAASoc,GAAOM,eACvB7rB,EAAK6gB,OAAOuS,oBACVlR,EAAOoJ,QACPpJ,EAAOI,eAGT6Q,EAAMv4B,KACJ2wB,GAAO8H,iBACLnR,EAAOvM,UACPuM,EAAOI,iBAMf/pB,KAAK+6B,uBACHJ,EACA3H,GAAOG,cACPsC,EACAiF,EACAD,GAEFz6B,KAAK+6B,uBACHJ,EACA3H,GAAOE,YACPuC,EACAiF,EACAD,GAEFz6B,KAAK+6B,uBACHJ,EACA3H,GAAOO,YACPqH,EACAF,EACAD,GAEFz6B,KAAK+6B,uBACHJ,EACA3H,GAAOM,cACPmC,EACAiF,EACAD,GAEFz6B,KAAK+6B,uBACHJ,EACA3H,GAAOC,MACPwC,EACAiF,EACAD,GAGKE,GAaDH,mCAAR,SACEG,EACAvgB,EACAqb,EACAuF,EACAP,GALF,WAOQQ,EAAkBxF,EAAQyF,OAAO,SAAAvR,GAAU,OAAAA,EAAO/S,OAASwD,IAEjE6gB,EAAgB3pB,KAAKtR,KAAKm7B,gBAAgBjrB,KAAKlQ,OAC/Ci7B,EAAgB5L,QAAQ,SAAA1F,GACtB,IAAMyR,EAAqB3zB,EAAK4zB,yBAC9B1R,EACA8Q,GAEFO,EAAc3L,QAAQ,SAAAiM,GAChBA,EAAaC,WAAW5R,EAAO/S,OACjC+jB,EAAOt4B,KACLi5B,EAAaE,YAAYJ,EAAoB3zB,EAAK8yB,cAapDC,qCAAR,SAAiC7Q,EAAgB8Q,GAC/C,MAAoB,UAAhB9Q,EAAO/S,MAAoC,kBAAhB+S,EAAO/S,OAGpC+S,EAAOX,SAAWyR,EAAWgB,wBAE3B9R,EAAOvM,UACPuM,EAAOI,aACP/pB,KAAKsoB,SANAqB,GAkBH6Q,4BAAR,SAAwB/uB,EAAWlM,GACjC,GAAmB,MAAfkM,EAAE2R,WAAoC,MAAf7d,EAAE6d,UAC3B,MAAM5Z,EAAe,sCAEvB,IAAMk4B,EAAW,IAAI7f,GAAUpQ,EAAE2R,UAAW3R,EAAEse,cACxC4R,EAAW,IAAI9f,GAAUtc,EAAE6d,UAAW7d,EAAEwqB,cAC9C,OAAO/pB,KAAKsoB,OAAOvM,QAAQ2f,EAAUC,uBCzIvC,WAAoBpB,EAAeqB,GAAf57B,YAAAu6B,EARZv6B,yBAA2C,GASjD,IAAM6W,EAAS7W,KAAKu6B,OAAO1Q,iBAErBgS,EAAc,IAAIrI,GAAc3c,EAAOiT,YACvCoR,EAASrkB,EAAOilB,gBAMtB97B,KAAK+7B,WAAa,IAAIpG,GAAcuF,GAEpC,IAAMc,EAAqBJ,EAAiB1G,iBACtC+G,EAAoBL,EAAiB5G,gBAGrCnC,EAAagJ,EAAYhE,eAC7BnT,GAAaxH,WACb8e,EAAmBlJ,UACnB,MAEIJ,EAAYwI,EAAOrD,eACvBnT,GAAaxH,WACb+e,EAAkBnJ,UAClB,MAEI2F,EAAiB,IAAItG,GACzBU,EACAmJ,EAAmB5J,qBACnByJ,EAAYtD,gBAERf,EAAgB,IAAIrF,GACxBO,EACAuJ,EAAkB7J,qBAClB8I,EAAO3C,gBAOTv4B,KAAK60B,WAAa,IAAIpC,GAAU+E,EAAeiB,GAM/Cz4B,KAAKk8B,gBAAkB,IAAI1B,GAAex6B,KAAKu6B,QA6LnD,OAvLE4B,qBAAA,WACE,OAAOn8B,KAAKu6B,QAMd4B,2BAAA,WACE,OAAOn8B,KAAK60B,WAAWK,iBAAiBpC,WAO1CqJ,mCAAA,SAAuBlnB,GACrB,IAAMmnB,EAAQp8B,KAAK60B,WAAWQ,wBAC9B,OAAI+G,IAIAp8B,KAAKu6B,OAAO1Q,iBAAiBwS,iBAC3BpnB,EAAKzK,YAAc4xB,EAAMxX,kBAAkB3P,EAAKX,YAAY9J,WAEvD4xB,EAAMvX,SAAS5P,GAGnB,MAMTknB,oBAAA,WACE,OAA2C,IAApCn8B,KAAKs8B,oBAAoB37B,QAMlCw7B,iCAAA,SAAqBpT,GACnB/oB,KAAKs8B,oBAAoBj6B,KAAK0mB,IAQhCoT,oCAAA,SACEpT,EACAwT,GAEA,IAAMC,EAA8B,GACpC,GAAID,EAAa,CACfl5B,EACuB,MAArB0lB,EACA,mDAEF,IAAM0T,EAAOz8B,KAAKu6B,OAAOtlB,KACzBjV,KAAKs8B,oBAAoBjN,QAAQ,SAASiM,GACxCiB,EAAoCA,EACpC,IAAMG,EAAapB,EAAaqB,kBAAkBJ,EAAaE,GAC3DC,GACFF,EAAan6B,KAAKq6B,KAKxB,GAAI3T,EAAmB,CAErB,IADA,IAAI6T,EAAY,GACPp8B,EAAI,EAAGA,EAAIR,KAAKs8B,oBAAoB37B,SAAUH,EAAG,CACxD,IAAMq8B,EAAW78B,KAAKs8B,oBAAoB97B,GAC1C,GAAKq8B,EAASC,QAAQ/T,IAEf,GAAIA,EAAkBgU,iBAAkB,CAE7CH,EAAYA,EAAU55B,OAAOhD,KAAKs8B,oBAAoB9yB,MAAMhJ,EAAI,IAChE,YAJAo8B,EAAUv6B,KAAKw6B,GAOnB78B,KAAKs8B,oBAAsBM,OAE3B58B,KAAKs8B,oBAAsB,GAE7B,OAAOE,GAWTL,2BAAA,SACEtG,EACAC,EACAsE,GAGEvE,EAAUjf,OAAS8Q,GAAcqK,OACJ,OAA7B8D,EAAU9uB,OAAOgpB,UAEjB1sB,EACErD,KAAK60B,WAAWQ,wBAChB,6DAEFhyB,EACErD,KAAK60B,WAAWsC,uBAChB,4DAIJ,IAAMvB,EAAe51B,KAAK60B,WACpBrV,EAASxf,KAAK+7B,WAAWiB,eAC7BpH,EACAC,EACAC,EACAsE,GAYF,OAVAp6B,KAAK+7B,WAAWkB,cAAczd,EAAOgW,WAErCnyB,EACEmc,EAAOgW,UAAUN,iBAAiB9C,uBAC/BwD,EAAaV,iBAAiB9C,qBACjC,2DAGFpyB,KAAK60B,WAAarV,EAAOgW,UAElBx1B,KAAKk9B,0BACV1d,EAAOiW,QACPjW,EAAOgW,UAAUR,gBAAgBlC,UACjC,OAQJqJ,6BAAA,SAAiBb,GACf,IAAM5I,EAAY1yB,KAAK60B,WAAWG,gBAC5BmI,EAA2B,GAC5BzK,EAAUI,UAAUjW,cACL6V,EAAUI,UAClB1N,aAAaxG,GAAgB,SAAS1V,EAAKmU,GACnD8f,EAAe96B,KAAK2wB,GAAOe,iBAAiB7qB,EAAKmU,MAMrD,OAHIqV,EAAUN,sBACZ+K,EAAe96B,KAAK2wB,GAAOoE,YAAY1E,EAAUI,YAE5C9yB,KAAKk9B,0BACVC,EACAzK,EAAUI,UACVwI,IAWJa,sCAAA,SACE1G,EACAgF,EACA1R,GAEA,IAAMiS,EAAgBjS,EAClB,CAACA,GACD/oB,KAAKs8B,oBACT,OAAOt8B,KAAKk8B,gBAAgBkB,yBAC1B3H,EACAgF,EACAO,uBbrPN,aAoBmBh7B,WAA2B,IAAIquB,IA2NlD,OA9OE7uB,sBAAW69B,gCAQX,WAEE,OADAh6B,EAAOokB,GAAwB,oCACxBA,QAVT,SAAkCrZ,GAChC/K,GACGokB,GACD,mDAEFA,GAAyBrZ,mCAgB3BivB,oBAAA,WACE,OAA2B,IAApBr9B,KAAKs9B,MAAM9O,MAGpB6O,2BAAA,SACExH,EACAC,EACAyH,WAEMxN,EAAU8F,EAAU9uB,OAAOgpB,QACjC,GAAgB,OAAZA,EAAkB,CACpB,IAAMyN,EAAOx9B,KAAKs9B,MAAMjtB,IAAI0f,GAE5B,OADA1sB,EAAe,MAARm6B,EAAc,gDACdA,EAAKR,eACVnH,EACAC,EACAyH,GAGF,IAAI5C,EAAkB,OAEtB,IAAmB,IAAAtxB,EAAAC,EAAAtJ,KAAKs9B,MAAM7I,wCAAU,CAA7B+I,UACT7C,EAASA,EAAO33B,OACdw6B,EAAKR,eAAenH,EAAWC,EAAayH,sGAIhD,OAAO5C,GAcX0C,iCAAA,SACEzT,EACAb,EACA+M,EACA2B,EACAgG,GAEA,IAAM1N,EAAUnG,EAAMuE,kBAClBqP,EAAOx9B,KAAKs9B,MAAMjtB,IAAI0f,GAC1B,IAAKyN,EAAM,CAET,IAAI/C,EAAa3E,EAAYiC,uBAC3B0F,EAAsBhG,EAAc,MAElCiG,GAAqB,EAEvBA,IADEjD,IAGFA,EADShD,aAAuB/S,GACnBoR,EAAY8B,0BAA0BH,GAGtC/S,GAAaxH,YAFL,GAKvB,IAAMsY,EAAY,IAAI/C,GACpB,IAAIN,KAEFuL,GACA,GAEF,IAAIvL,KAEFsL,GACA,IAGJD,EAAO,IAAIrB,GAAKvS,EAAO4L,GACvBx1B,KAAKs9B,MAAMntB,IAAI4f,EAASyN,GAK1B,OADAA,EAAKG,qBAAqB5U,GACnByU,EAAKI,iBAAiB7U,IAc/BsU,oCAAA,SACEzT,EACAb,EACAwT,WAEMxM,EAAUnG,EAAMuE,kBAChB0P,EAAmB,GACrBrB,EAAwB,GACtBsB,EAAkB99B,KAAK+9B,kBAC7B,GAAgB,YAAZhO,MAEF,IAAkC,IAAA1mB,EAAAC,EAAAtJ,KAAKs9B,MAAMU,yCAAW,CAA7C,IAAAC,eAACC,OAAaV,OACvBhB,EAAeA,EAAax5B,OAC1Bw6B,EAAKW,wBAAwBpV,EAAmBwT,IAE9CiB,EAAKhzB,YACPxK,KAAKs9B,MAAMrO,OAAOiP,GAIfV,EACEY,WACAvU,iBACAwS,gBAEHwB,EAAQx7B,KAAKm7B,EAAKY,oHAMlBZ,EAAOx9B,KAAKs9B,MAAMjtB,IAAI0f,MAE1ByM,EAAeA,EAAax5B,OAC1Bw6B,EAAKW,wBAAwBpV,EAAmBwT,IAE9CiB,EAAKhzB,YACPxK,KAAKs9B,MAAMrO,OAAOc,GAIfyN,EACEY,WACAvU,iBACAwS,gBAEHwB,EAAQx7B,KAAKm7B,EAAKY,cAa1B,OAPIN,IAAoB99B,KAAK+9B,mBAE3BF,EAAQx7B,KACN,IAAIg7B,EAAU5V,uBAAuBmC,EAAMoB,KAAMpB,EAAM3U,OAIpD,CAAE4oB,QAASA,EAASlD,OAAQ6B,IAGrCa,0BAAA,mBACQ7d,EAAS,OACf,IAAmB,IAAAnW,EAAAC,EAAAtJ,KAAKs9B,MAAM7I,wCAAU,CAAnC,IAAM+I,UAENA,EACEY,WACAvU,iBACAwS,gBAEH7c,EAAOnd,KAAKm7B,qGAGhB,OAAOhe,GAOT6d,mCAAA,SAAuBpoB,WACjBwiB,EAA2B,SAC/B,IAAmB,IAAApuB,EAAAC,EAAAtJ,KAAKs9B,MAAM7I,wCAAU,CAAnC,IAAM+I,UACT/F,EAAcA,GAAe+F,EAAKa,uBAAuBppB,qGAE3D,OAAOwiB,GAGT4F,yBAAA,SAAazT,GAEX,GADeA,EAAMC,iBACVwS,eACT,OAAOr8B,KAAKs+B,kBAEZ,IAAMvO,EAAUnG,EAAMuE,kBACtB,OAAOnuB,KAAKs9B,MAAMjtB,IAAI0f,IAI1BsN,+BAAA,SAAmBzT,GACjB,OAAmC,MAA5B5pB,KAAKu+B,aAAa3U,IAG3ByT,4BAAA,WACE,OAAiC,MAA1Br9B,KAAKs+B,mBAGdjB,4BAAA,uBACE,IAAmB,IAAAh0B,EAAAC,EAAAtJ,KAAKs9B,MAAM7I,wCAAU,CAAnC,IAAM+I,UACT,GACEA,EACGY,WACAvU,iBACAwS,eAEH,OAAOmB,oGAGX,OAAO,yBcxPT,WAAoBgB,GAAAx+B,gBAAAw+B,EAsItB,OAlIEC,qBAAA,SAASxpB,EAAY2G,GACnB,GAAI3G,EAAKzK,UACP,OAAO,IAAIi0B,EAAc,IAAIhO,GAAc7U,IAE3C,IAAM8iB,EAAW1+B,KAAKw+B,WAAWG,yBAAyB1pB,GAC1D,GAAgB,MAAZypB,EAAkB,CACpB,IAAME,EAAeF,EAASzpB,KAC1B9S,EAAQu8B,EAASv8B,MACfqS,EAAeZ,GAAKY,aAAaoqB,EAAc3pB,GAErD,OADA9S,EAAQA,EAAMub,YAAYlJ,EAAcoH,GACjC,IAAI6iB,EAAcz+B,KAAKw+B,WAAWruB,IAAIyuB,EAAcz8B,IAE3D,IAAMouB,EAAU,IAAIE,GAAc7U,GAElC,OAAO,IAAI6iB,EADUz+B,KAAKw+B,WAAWvN,QAAQhc,EAAMsb,KAMzDkO,sBAAA,SAAUxpB,EAAY4pB,GACpB,IAAIC,EAAW9+B,KAIf,OAHA4R,GAAKitB,EAAS,SAASpQ,EAAkB7S,GACvCkjB,EAAWA,EAASC,SAAS9pB,EAAKO,MAAMiZ,GAAW7S,KAE9CkjB,GAUTL,wBAAA,SAAYxpB,GACV,OAAIA,EAAKzK,UACAi0B,EAAcjO,MAGd,IAAIiO,EADUz+B,KAAKw+B,WAAWvN,QAAQhc,EAAMwb,GAAcD,SAYrEiO,6BAAA,SAAiBxpB,GACf,OAAqC,MAA9BjV,KAAKg/B,gBAAgB/pB,IAU9BwpB,4BAAA,SAAgBxpB,GACd,IAAMypB,EAAW1+B,KAAKw+B,WAAWG,yBAAyB1pB,GAC1D,OAAgB,MAAZypB,EACK1+B,KAAKw+B,WACTnuB,IAAIquB,EAASzpB,MACb4P,SAASjR,GAAKY,aAAakqB,EAASzpB,KAAMA,IAEtC,MASXwpB,gCAAA,WACE,IAAMlQ,EAAwB,GAC1B3S,EAAO5b,KAAKw+B,WAAWr8B,MAkB3B,OAjBY,MAARyZ,EAEGA,EAAKiB,cACPjB,EAAsBwJ,aAAaxG,GAAgB,SAClDxB,EACAC,GAEAkR,EAASlsB,KAAK,IAAIwZ,GAAUuB,EAAWC,MAI3Crd,KAAKw+B,WAAWjQ,SAASzO,iBAAiB,SAAS1C,EAAWsF,GACrC,MAAnBA,EAAUvgB,OACZosB,EAASlsB,KAAK,IAAIwZ,GAAUuB,EAAWsF,EAAUvgB,UAIhDosB,GAGTkQ,+BAAA,SAAmBxpB,GACjB,GAAIA,EAAKzK,UACP,OAAOxK,KAEP,IAAMi/B,EAAgBj/B,KAAKg/B,gBAAgB/pB,GAC3C,OACS,IAAIwpB,EADQ,MAAjBQ,EACuB,IAAIxO,GAAcwO,GAElBj/B,KAAKw+B,WAAWjO,QAAQtb,KASvDwpB,oBAAA,WACE,OAAOz+B,KAAKw+B,WAAWh0B,WASzBi0B,kBAAA,SAAM7iB,GACJ,OAIJ,SAASsjB,EACP1qB,EACA2qB,EACAvjB,GAEA,CAAA,GAAuB,MAAnBujB,EAAUh9B,MAEZ,OAAOyZ,EAAK8B,YAAYlJ,EAAc2qB,EAAUh9B,OAEhD,IAAIi9B,EAAgB,KAkBpB,OAjBAD,EAAU5Q,SAASzO,iBAAiB,SAAS2O,EAAU/L,GACpC,cAAb+L,GAGFprB,EACsB,OAApBqf,EAAUvgB,MACV,6CAEFi9B,EAAgB1c,EAAUvgB,OAE1ByZ,EAAOsjB,EAAkB1qB,EAAagB,MAAMiZ,GAAW/L,EAAW9G,KAIjEA,EAAKiJ,SAASrQ,GAAchK,WAA+B,OAAlB40B,IAC5CxjB,EAAOA,EAAK8B,YAAYlJ,EAAagB,MAAM,aAAc4pB,IAEpDxjB,GA/BAsjB,CAAkBtrB,GAAK4c,MAAOxwB,KAAKw+B,WAAY5iB,IAlIjD6iB,QAAQ,IAAIA,EAAc,IAAIhO,GAAc,YCarD,kBAAA,aAQUzwB,oBAAgCy+B,GAAcjO,MAU9CxwB,gBAA4B,GAE5BA,mBAAgB,EAmhB1B,OA3gBEq/B,wBAAA,SAAYpqB,GACV,OAAO,IAAIqqB,GAAarqB,EAAMjV,OAWhCq/B,yBAAA,SAAapqB,EAAY+S,EAAYuX,EAAiBC,GACpDn8B,EACEk8B,EAAUv/B,KAAKy/B,aACf,qDAEct4B,IAAZq4B,IACFA,GAAU,GAEZx/B,KAAK0/B,WAAWr9B,KAAK,CACnB4S,KAAMA,EACN+S,KAAMA,EACNuX,QAASA,EACTC,QAASA,IAGPA,IACFx/B,KAAK2/B,eAAiB3/B,KAAK2/B,eAAeZ,SAAS9pB,EAAM+S,IAE3DhoB,KAAKy/B,aAAeF,GAUtBF,qBAAA,SACEpqB,EACAmkB,EACAmG,GAEAl8B,EACEk8B,EAAUv/B,KAAKy/B,aACf,gDAEFz/B,KAAK0/B,WAAWr9B,KAAK,CACnB4S,KAAMA,EACNsZ,SAAU6K,EACVmG,QAASA,EACTC,SAAS,IAGXx/B,KAAK2/B,eAAiB3/B,KAAK2/B,eAAeC,UAAU3qB,EAAMmkB,GAC1Dp5B,KAAKy/B,aAAeF,GAOtBF,qBAAA,SAASE,GACP,IAAK,IAAI/+B,EAAI,EAAGA,EAAIR,KAAK0/B,WAAW/+B,OAAQH,IAAK,CAC/C,IAAMq/B,EAAS7/B,KAAK0/B,WAAWl/B,GAC/B,GAAIq/B,EAAON,UAAYA,EACrB,OAAOM,EAGX,OAAO,MAWTR,wBAAA,SAAYE,GAAZ,WAMQ9Z,EAAMzlB,KAAK0/B,WAAWI,UAAU,SAASv/B,GAC7C,OAAOA,EAAEg/B,UAAYA,IAEvBl8B,EAAc,GAAPoiB,EAAU,gDACjB,IAAMsa,EAAgB//B,KAAK0/B,WAAWja,GACtCzlB,KAAK0/B,WAAWM,OAAOva,EAAK,GAO5B,IALA,IAAIwa,EAAyBF,EAAcP,QACvCU,GAAsC,EAEtC1/B,EAAIR,KAAK0/B,WAAW/+B,OAAS,EAE1Bs/B,GAA+B,GAALz/B,GAAQ,CACvC,IAAM2/B,EAAengC,KAAK0/B,WAAWl/B,GACjC2/B,EAAaX,UAER/Z,GAALjlB,GACAR,KAAKogC,oBAAoBD,EAAcJ,EAAc9qB,MAGrDgrB,GAAyB,EAChBF,EAAc9qB,KAAK5K,SAAS81B,EAAalrB,QAElDirB,GAAsC,IAG1C1/B,IAGF,GAAKy/B,EAEE,CAAA,GAAIC,EAGT,OADAlgC,KAAKqgC,cACE,EAGHN,EAAc/X,KAChBhoB,KAAK2/B,eAAiB3/B,KAAK2/B,eAAeW,YACxCP,EAAc9qB,MAIhBrD,GADiBmuB,EAAcxR,SAChB,SAACnR,GACd3V,EAAKk4B,eAAiBl4B,EAAKk4B,eAAeW,YACxCP,EAAc9qB,KAAKO,MAAM4H,MAI/B,OAAO,EAnBP,OAAO,GA8BXiiB,iCAAA,SAAqBpqB,GACnB,OAAOjV,KAAK2/B,eAAeX,gBAAgB/pB,IAa7CoqB,mCAAA,SACEkB,EACAnG,EACAoG,EACAC,GAEA,GAAKD,GAAsBC,EAmBpB,CACL,IAAMlK,EAAQv2B,KAAK2/B,eAAee,mBAAmBH,GACrD,IAAKE,GAAuBlK,EAAM/rB,UAChC,OAAO4vB,EAGP,GACGqG,GACsB,MAAvBrG,GACC7D,EAAMoK,iBAAiB/sB,GAAK4c,OAGxB,CACL,IAQMoQ,EAAcvB,EAAUwB,WAC5B7gC,KAAK0/B,WATQ,SAASoB,GACtB,OACGA,EAAMtB,SAAWiB,MAChBD,KACEA,EAAkBlqB,QAAQwqB,EAAMvB,YACnCuB,EAAM7rB,KAAK5K,SAASk2B,IAAaA,EAASl2B,SAASy2B,EAAM7rB,QAM5DsrB,GAEIQ,EAAe3G,GAAuB1V,GAAaxH,WACzD,OAAO0jB,EAAY//B,MAAMkgC,GAhBzB,OAAO,KA7BX,IAAM9B,EAAgBj/B,KAAK2/B,eAAeX,gBAAgBuB,GAC1D,GAAqB,MAAjBtB,EACF,OAAOA,EAEP,IAAM+B,EAAWhhC,KAAK2/B,eAAee,mBAAmBH,GACxD,GAAIS,EAASx2B,UACX,OAAO4vB,EACF,GACkB,MAAvBA,GACC4G,EAASL,iBAAiB/sB,GAAK4c,OAI3B,CACL,IAAMuQ,EAAe3G,GAAuB1V,GAAaxH,WACzD,OAAO8jB,EAASngC,MAAMkgC,GAHtB,OAAO,MA+Cf1B,sCAAA,SACEkB,EACAU,GAEA,IAAIvJ,EAAmBhT,GAAaxH,WAC9BgkB,EAAclhC,KAAK2/B,eAAeX,gBAAgBuB,GACxD,GAAIW,EAaF,OAZKA,EAAYrkB,cAEfqkB,EAAY9b,aAAaxG,GAAgB,SACvCxB,EACAsT,GAEAgH,EAAmBA,EAAiBla,qBAClCJ,EACAsT,KAICgH,EACF,GAAIuJ,EAAwB,CAGjC,IAAME,EAAQnhC,KAAK2/B,eAAee,mBAAmBH,GAoBrD,OAnBAU,EAAuB7b,aAAaxG,GAAgB,SAClDxB,EACAC,GAEA,IAAMzB,EAAOulB,EACVT,mBAAmB,IAAI9sB,GAAKwJ,IAC5Bvc,MAAMwc,GACTqa,EAAmBA,EAAiBla,qBAClCJ,EACAxB,KAIJulB,EAAMC,sBAAsB/R,QAAQ,SAASjN,GAC3CsV,EAAmBA,EAAiBla,qBAClC4E,EAAUtU,KACVsU,EAAUxG,QAGP8b,EAWP,OAPc13B,KAAK2/B,eAAee,mBAAmBH,GAC/Ca,sBAAsB/R,QAAQ,SAASjN,GAC3CsV,EAAmBA,EAAiBla,qBAClC4E,EAAUtU,KACVsU,EAAUxG,QAGP8b,GAwBX2H,+CAAA,SACEkB,EACA7X,EACA2Y,EACAC,GAEAj+B,EACEg+B,GAAqBC,EACrB,6DAEF,IAAMrsB,EAAOsrB,EAAS/qB,MAAMkT,GAC5B,GAAI1oB,KAAK2/B,eAAegB,iBAAiB1rB,GAGvC,OAAO,KAGP,IAAMssB,EAAavhC,KAAK2/B,eAAee,mBAAmBzrB,GAC1D,OAAIssB,EAAW/2B,UAEN82B,EAAmBzc,SAAS6D,GAQ5B6Y,EAAW1gC,MAAMygC,EAAmBzc,SAAS6D,KAc1D2W,8BAAA,SACEkB,EACA9R,EACA6S,GAEA,IAAMrsB,EAAOsrB,EAAS/qB,MAAMiZ,GACtBwQ,EAAgBj/B,KAAK2/B,eAAeX,gBAAgB/pB,GAC1D,OAAqB,MAAjBgqB,EACKA,EAEHqC,EAAmBjP,mBAAmB5D,GACrBzuB,KAAK2/B,eAAee,mBAAmBzrB,GACxCpU,MAChBygC,EAAmBxO,UAAUlO,kBAAkB6J,IAG1C,MAUb4Q,2BAAA,SAAepqB,GACb,OAAOjV,KAAK2/B,eAAeX,gBAAgB/pB,IAO7CoqB,6BAAA,SACEkB,EACAnL,EACAlP,EACArG,EACArN,EACAmL,GAEA,IAAI6jB,EACEjL,EAAQv2B,KAAK2/B,eAAee,mBAAmBH,GAC/CtB,EAAgB1I,EAAMyI,gBAAgBprB,GAAK4c,OACjD,GAAqB,MAAjByO,EACFuC,EAAYvC,MACP,CAAA,GAA0B,MAAtB7J,EAIT,MAAO,GAHPoM,EAAYjL,EAAM11B,MAAMu0B,GAM1B,IADAoM,EAAYA,EAAUvN,UAAUtW,IACjBnT,WAAcg3B,EAAU3kB,aAerC,MAAO,GARP,IANA,IAAMyY,EAAQ,GACRxgB,EAAM6I,EAAMoG,aACZL,EAAOlR,EACRgvB,EAA2Bpb,uBAAuBF,EAAWvI,GAC7D6jB,EAA2Bxb,gBAAgBE,EAAWvI,GACvDlc,EAAOiiB,EAAKG,UACTpiB,GAAQ6zB,EAAM30B,OAASkf,GACC,IAAzB/K,EAAIrT,EAAMykB,IACZoP,EAAMjzB,KAAKZ,GAEbA,EAAOiiB,EAAKG,UAEd,OAAOyR,GAMH+J,gCAAR,SAA4BoC,EAA0BxsB,GACpD,GAAIwsB,EAAYzZ,KACd,OAAOyZ,EAAYxsB,KAAK5K,SAAS4K,GAEjC,IAAK,IAAMmI,KAAaqkB,EAAYlT,SAClC,GACEkT,EAAYlT,SAAS1uB,eAAeud,IACpCqkB,EAAYxsB,KAAKO,MAAM4H,GAAW/S,SAAS4K,GAE3C,OAAO,EAGX,OAAO,GAOHoqB,uBAAR,WACEr/B,KAAK2/B,eAAiBN,EAAUwB,WAC9B7gC,KAAK0/B,WACLL,EAAUqC,eACV9tB,GAAK4c,OAEsB,EAAzBxwB,KAAK0/B,WAAW/+B,OAClBX,KAAKy/B,aAAez/B,KAAK0/B,WAAW1/B,KAAK0/B,WAAW/+B,OAAS,GAAG4+B,QAEhEv/B,KAAKy/B,cAAgB,GAOVJ,iBAAf,SAA8ByB,GAC5B,OAAOA,EAAMtB,SAOAH,aAAf,SACEsC,EACAzG,EACA0G,GAGA,IADA,IAAIC,EAAgBpD,GAAcjO,MACzBhwB,EAAI,EAAGA,EAAImhC,EAAOhhC,SAAUH,EAAG,CACtC,IAAMsgC,EAAQa,EAAOnhC,GAIrB,GAAI06B,EAAO4F,GAAQ,CACjB,IAAMvH,EAAYuH,EAAM7rB,KACpBT,SACJ,GAAIssB,EAAM9Y,KACJ4Z,EAASv3B,SAASkvB,IACpB/kB,EAAeZ,GAAKY,aAAaotB,EAAUrI,GAC3CsI,EAAgBA,EAAc9C,SAASvqB,EAAcssB,EAAM9Y,OAClDuR,EAAUlvB,SAASu3B,KAC5BptB,EAAeZ,GAAKY,aAAa+kB,EAAWqI,GAC5CC,EAAgBA,EAAc9C,SAC5BnrB,GAAK4c,MACLsQ,EAAM9Y,KAAKnD,SAASrQ,SAKnB,CAAA,IAAIssB,EAAMvS,SA0Bf,MAAM/qB,EAAe,8CAzBrB,GAAIo+B,EAASv3B,SAASkvB,GACpB/kB,EAAeZ,GAAKY,aAAaotB,EAAUrI,GAC3CsI,EAAgBA,EAAcjC,UAC5BprB,EACAssB,EAAMvS,eAEH,GAAIgL,EAAUlvB,SAASu3B,GAE5B,IADAptB,EAAeZ,GAAKY,aAAa+kB,EAAWqI,IAC3Bp3B,UACfq3B,EAAgBA,EAAcjC,UAC5BhsB,GAAK4c,MACLsQ,EAAMvS,cAEH,CACL,IAAM/Y,EAAQjL,EAAQu2B,EAAMvS,SAAU/Z,EAAaF,YACnD,GAAIkB,EAAO,CAET,IAAMssB,EAAWtsB,EAAMqP,SAASrQ,EAAaC,YAC7CotB,EAAgBA,EAAc9C,SAASnrB,GAAK4c,MAAOsR,OAW/D,OAAOD,sBAsCT,WAAY5sB,EAAYkqB,GACtBn/B,KAAK+hC,UAAY9sB,EACjBjV,KAAKw+B,WAAaW,EA8ItB,OAjIEG,mCAAA,SACElF,EACAoG,EACAC,GAEA,OAAOzgC,KAAKw+B,WAAWzG,uBACrB/3B,KAAK+hC,UACL3H,EACAoG,EACAC,IAWJnB,sCAAA,SACE2B,GAEA,OAAOjhC,KAAKw+B,WAAW5G,0BACrB53B,KAAK+hC,UACLd,IAuBJ3B,+CAAA,SACErqB,EACAosB,EACAC,GAEA,OAAOthC,KAAKw+B,WAAWtG,mCACrBl4B,KAAK+hC,UACL9sB,EACAosB,EACAC,IAYJhC,2BAAA,SAAerqB,GACb,OAAOjV,KAAKw+B,WAAWjH,eAAev3B,KAAK+hC,UAAUvsB,MAAMP,KAc7DqqB,6BAAA,SACElK,EACAlP,EACArG,EACArN,EACAmL,GAEA,OAAO3d,KAAKw+B,WAAWjJ,iBACrBv1B,KAAK+hC,UACL3M,EACAlP,EACArG,EACArN,EACAmL,IAYJ2hB,8BAAA,SACE7Q,EACAuT,GAEA,OAAOhiC,KAAKw+B,WAAWrJ,kBACrBn1B,KAAK+hC,UACLtT,EACAuT,IAUJ1C,kBAAA,SAAMliB,GACJ,OAAO,IAAIkiB,EAAat/B,KAAK+hC,UAAUvsB,MAAM4H,GAAYpd,KAAKw+B,gCCtqBhE,WAAoByD,GAAAjiC,qBAAAiiC,EAdZjiC,oBAA2CywB,GAAcD,MAKzDxwB,uBAAoB,IAAIq/B,GAEfr/B,mBAAqC,IAAIquB,IACzCruB,mBAAqC,IAAIquB,IAovB5D,OAvuBE6T,+BAAA,SACEjtB,EACAktB,EACA5C,EACAC,GAKA,OAFAx/B,KAAKoiC,kBAAkBC,aAAaptB,EAAMktB,EAAS5C,EAASC,GAEvDA,EAGIx/B,KAAKsiC,4BACV,IAAIxQ,GAAU7B,GAAgBI,KAAMpb,EAAMktB,IAHrC,IAaXD,2BAAA,SACEjtB,EACAmkB,EACAmG,GAGAv/B,KAAKoiC,kBAAkBG,SAASttB,EAAMmkB,EAAiBmG,GAEvD,IAAMiD,EAAa/R,GAAcgS,WAAWrJ,GAE5C,OAAOp5B,KAAKsiC,4BACV,IAAItQ,GAAM/B,GAAgBI,KAAMpb,EAAMutB,KAU1CN,yBAAA,SAAa3C,EAAiBpP,gBAAAA,MAC5B,IAAM2Q,EAAQ9gC,KAAKoiC,kBAAkBM,SAASnD,GAE9C,GADyBv/B,KAAKoiC,kBAAkB9B,YAAYf,GAGrD,CACL,IAAIoD,EAAelS,GAAcD,MASjC,OARkB,MAAdsQ,EAAM9Y,KAER2a,EAAeA,EAAaxyB,IAAIyD,GAAK4c,OAAO,GAE5C5e,GAAKkvB,EAAMvS,SAAU,SAAS1a,EAAoB+H,GAChD+mB,EAAeA,EAAaxyB,IAAI,IAAIyD,GAAKC,GAAa+H,KAGnD5b,KAAKsiC,4BACV,IAAIhS,GAAawQ,EAAM7rB,KAAM0tB,EAAcxS,IAZ7C,MAAO,IAsBX+R,iCAAA,SAAqBjtB,EAAYktB,GAC/B,OAAOniC,KAAKsiC,4BACV,IAAIxQ,GAAU7B,GAAgB2S,OAAQ3tB,EAAMktB,KAShDD,6BAAA,SACEjtB,EACAmkB,GAEA,IAAMoJ,EAAa/R,GAAcgS,WAAWrJ,GAE5C,OAAOp5B,KAAKsiC,4BACV,IAAItQ,GAAM/B,GAAgB2S,OAAQ3tB,EAAMutB,KAS5CN,gCAAA,SAAoBjtB,GAClB,OAAOjV,KAAKsiC,4BACV,IAAI1Q,GAAe3B,GAAgB2S,OAAQ3tB,KAS/CitB,sCAAA,SAA0BjtB,EAAY+S,EAAY6a,GAChD,IAAMC,EAAW9iC,KAAK+iC,gBAAgBF,GACtC,GAAgB,MAAZC,EAaF,MAAO,GAZP,IAAMlgC,EAAIs/B,EAASc,eAAeF,GAC5BG,EAAYrgC,EAAEqS,KAClB8a,EAAUntB,EAAEmtB,QACRvb,EAAeZ,GAAKY,aAAayuB,EAAWhuB,GAC5CjT,EAAK,IAAI8vB,GACb7B,GAAgBiT,qBAAqBnT,GACrCvb,EACAwT,GAEF,OAAOhoB,KAAKmjC,sBAAsBF,EAAWjhC,IAYjDkgC,kCAAA,SACEjtB,EACAmkB,EACAyJ,GAEA,IAAMC,EAAW9iC,KAAK+iC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAMlgC,EAAIs/B,EAASc,eAAeF,GAC5BG,EAAYrgC,EAAEqS,KAClB8a,EAAUntB,EAAEmtB,QACRvb,EAAeZ,GAAKY,aAAayuB,EAAWhuB,GAC5CutB,EAAa/R,GAAcgS,WAAWrJ,GACtCp3B,EAAK,IAAIgwB,GACb/B,GAAgBiT,qBAAqBnT,GACrCvb,EACAguB,GAEF,OAAOxiC,KAAKmjC,sBAAsBF,EAAWjhC,GAG7C,MAAO,IASXkgC,sCAAA,SAA0BjtB,EAAY4tB,GACpC,IAAMC,EAAW9iC,KAAK+iC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAMlgC,EAAIs/B,EAASc,eAAeF,GAC5BG,EAAYrgC,EAAEqS,KAClB8a,EAAUntB,EAAEmtB,QACRvb,EAAeZ,GAAKY,aAAayuB,EAAWhuB,GAC5CjT,EAAK,IAAI4vB,GACb3B,GAAgBiT,qBAAqBnT,GACrCvb,GAEF,OAAOxU,KAAKmjC,sBAAsBF,EAAWjhC,GAG7C,MAAO,IASXkgC,iCAAA,SACEtY,EACAb,GAEA,IAAM9T,EAAO2U,EAAM3U,KAEfwiB,EAA2B,KAC3B2L,GAA2B,EAG/BpjC,KAAKqjC,eAAeC,cAAcruB,EAAM,SAASsuB,EAAiBC,GAChE,IAAMhvB,EAAeZ,GAAKY,aAAa+uB,EAAiBtuB,GACxDwiB,EAAcA,GAAe+L,EAAGnF,uBAAuB7pB,GACvD4uB,EACEA,GAA4BI,EAAGzF,oBAEnC,IAUIN,EAVAgG,EAAYzjC,KAAKqjC,eAAehzB,IAAI4E,IACnCwuB,GAIHL,EACEA,GAA4BK,EAAU1F,kBACxCtG,EAAcA,GAAegM,EAAUpF,uBAAuBzqB,GAAK4c,SALnEiT,EAAY,IAAIpG,GAChBr9B,KAAKqjC,eAAiBrjC,KAAKqjC,eAAelzB,IAAI8E,EAAMwuB,IAQnC,MAAfhM,GACFgG,GAAsB,GAEtBA,GAAsB,EACtBhG,EAAc/S,GAAaxH,WACXld,KAAKqjC,eAAe9S,QAAQtb,GACpCyuB,aAAa,SAAStmB,EAAWumB,GACvC,IAAM5N,EAAgB4N,EAAetF,uBAAuBzqB,GAAK4c,OAC7DuF,IACF0B,EAAcA,EAAYja,qBACxBJ,EACA2Y,OAMR,IAAM6N,EAAoBH,EAAUI,mBAAmBja,GACvD,IAAKga,IAAsBha,EAAMC,iBAAiBwS,eAAgB,CAEhE,IAAMyG,EAAWZ,EAAS4B,cAAcla,GACxCvmB,GACGrD,KAAK+jC,cAAcrV,IAAIoU,GACxB,0CAEF,IAAMD,EAAMX,EAAS8B,mBACrBhkC,KAAK+jC,cAAc5zB,IAAI2yB,EAAUD,GACjC7iC,KAAKikC,cAAc9zB,IAAI0yB,EAAKC,GAE9B,IAAMhN,EAAc91B,KAAKoiC,kBAAkB8B,YAAYjvB,GACnD0lB,EAAS8I,EAAU9F,qBACrB/T,EACAb,EACA+M,EACA2B,EACAgG,GAEF,IAAKmG,IAAsBR,EAA0B,CACnD,IAAM5F,EAA0BiG,EAAUlF,aAAa3U,GACvD+Q,EAASA,EAAO33B,OAAOhD,KAAKmkC,eAAeva,EAAO4T,IAEpD,OAAO7C,GAaTuH,oCAAA,SACEtY,EACAb,EACAwT,GAHF,WAMQtnB,EAAO2U,EAAM3U,KACbmvB,EAAiBpkC,KAAKqjC,eAAehzB,IAAI4E,GAC3CunB,EAAwB,GAI5B,GACE4H,IAC6B,YAA5Bxa,EAAMuE,mBACLiW,EAAeP,mBAAmBja,IACpC,CAIA,IAAMya,EAAmBD,EAAejG,wBACtCvU,EACAb,EACAwT,GAEE6H,EAAe55B,YACjBxK,KAAKqjC,eAAiBrjC,KAAKqjC,eAAejzB,OAAO6E,IAEnD,IAAM4oB,EAAUwG,EAAiBxG,QACjCrB,EAAe6H,EAAiB1J,OAOhC,IAAM2J,GACH,IACDzG,EAAQiC,UAAU,SAASlW,GACzB,OAAOA,EAAMC,iBAAiBwS,iBAE5BkI,EAAUvkC,KAAKqjC,eAAemB,WAAWvvB,EAAM,SACnDT,EACAiwB,GAEA,OAAOA,EAAgB1G,oBAGzB,GAAIuG,IAAoBC,EAAS,CAC/B,IAAMhU,EAAUvwB,KAAKqjC,eAAe9S,QAAQtb,GAG5C,IAAKsb,EAAQ/lB,UAKX,IAHA,IAAMk6B,EAAW1kC,KAAK2kC,gCAAgCpU,GAG7C/vB,EAAI,EAAGA,EAAIkkC,EAAS/jC,SAAUH,EAAG,CACxC,IAAMg9B,EAAOkH,EAASlkC,GACpBokC,EAAWpH,EAAKY,WACZyG,EAAW7kC,KAAK8kC,uBAAuBtH,GAC7Cx9B,KAAKiiC,gBAAgB8C,eACnB7C,EAAS8C,mBAAmBJ,GAC5B5kC,KAAKilC,aAAaL,GAClBC,EAASK,OACTL,EAASlqB,aAUjB,IAAK4pB,GAA4B,EAAjB1G,EAAQl9B,SAAe47B,EAGrC,GAAI+H,EAAiB,CAGnBtkC,KAAKiiC,gBAAgBkD,cACnBjD,EAAS8C,mBAAmBpb,GAFI,WAMlCiU,EAAQxO,QAAQ,SAAC+V,GACf,IAAMC,EAAc59B,EAAKs8B,cAAc1zB,IACrC6xB,EAAS4B,cAAcsB,IAEzB39B,EAAKw6B,gBAAgBkD,cACnBjD,EAAS8C,mBAAmBI,GAC5BC,KAMRrlC,KAAKslC,YAAYzH,GAInB,OAAOrB,GAYT0F,mCAAA,SACEjtB,EACAurB,GAEA,IACMrB,EAAYn/B,KAAKoiC,kBACjB3K,EAAcz3B,KAAKqjC,eAAemB,WAAWvvB,EAAM,SACvDkc,EACAsS,GAEA,IAAMjvB,EAAeZ,GAAKY,aAAa2c,EAAWlc,GAC5CwiB,EAAcgM,EAAUpF,uBAAuB7pB,GACrD,GAAIijB,EACF,OAAOA,IAGX,OAAO0H,EAAUpH,uBACf9iB,EACAwiB,EACA+I,GAfwB,IAwBpB0B,4CAAR,SACE3R,GAEA,OAAOA,EAAQgV,KACb,SAAC/wB,EAAcgxB,EAAqBC,GAClC,GAAID,GAAuBA,EAAoBzH,kBAE7C,MAAO,CADcyH,EAAoBlH,mBAIzC,IAAIoH,EAAgB,GAOpB,OANIF,IACFE,EAAQF,EAAoBG,iBAE9B/zB,GAAK6zB,EAAU,SAASG,EAAcC,GACpCH,EAAQA,EAAM1iC,OAAO6iC,KAEhBH,KAMPxD,wBAAR,SAAoB4D,GAClB,IAAK,IAAI75B,EAAI,EAAGA,EAAI65B,EAAQnlC,SAAUsL,EAAG,CACvC,IAAM85B,EAAeD,EAAQ75B,GAC7B,IAAK85B,EAAalc,iBAAiBwS,eAAgB,CAEjD,IAAM2J,EAAkB9D,EAAS4B,cAAciC,GACzCE,EAAkBjmC,KAAK+jC,cAAc1zB,IAAI21B,GAC/ChmC,KAAK+jC,cAAc9U,OAAO+W,GAC1BhmC,KAAKikC,cAAchV,OAAOgX,MAUjB/D,qBAAf,SAAkCtY,GAChC,OACEA,EAAMC,iBAAiBwS,iBACtBzS,EAAMC,iBAAiBqc,YAKjBtc,EAAMd,SAENc,GASHsY,2BAAR,SAAuBtY,EAAc4T,GACnC,IAAMvoB,EAAO2U,EAAM3U,KACb4tB,EAAM7iC,KAAKilC,aAAarb,GACxBib,EAAW7kC,KAAK8kC,uBAAuBtH,GAEvC7C,EAAS36B,KAAKiiC,gBAAgB8C,eAClC7C,EAAS8C,mBAAmBpb,GAC5BiZ,EACAgC,EAASK,OACTL,EAASlqB,YAGL4V,EAAUvwB,KAAKqjC,eAAe9S,QAAQtb,GAG5C,GAAI4tB,EACFx/B,GACGktB,EAAQpuB,MAAM47B,kBACf,0DA6BF,IAzBA,IAAMoI,EAAgB5V,EAAQgV,KAAc,SAC1C/wB,EACAgxB,EACAC,GAEA,IACGjxB,EAAahK,WACdg7B,GACAA,EAAoBzH,kBAEpB,MAAO,CAACyH,EAAoBlH,kBAAkBF,YAG9C,IAAIgI,EAAmB,GASvB,OARIZ,IACFY,EAAUA,EAAQpjC,OAChBwiC,EAAoBG,gBAAgBl7B,IAAI,SAAA+yB,GAAQ,OAAAA,EAAKY,eAGzDxsB,GAAK6zB,EAAU,SAASG,EAAcS,GACpCD,EAAUA,EAAQpjC,OAAOqjC,KAEpBD,IAGF5lC,EAAI,EAAGA,EAAI2lC,EAAcxlC,SAAUH,EAAG,CAC7C,IAAM8lC,EAAcH,EAAc3lC,GAClCR,KAAKiiC,gBAAgBkD,cACnBjD,EAAS8C,mBAAmBsB,GAC5BtmC,KAAKilC,aAAaqB,IAIxB,OAAO3L,GAGDuH,mCAAR,SACE1E,GADF,WAGQ5T,EAAQ4T,EAAKY,WACbyE,EAAM7iC,KAAKilC,aAAarb,GAE9B,MAAO,CACLsb,OAAQ,WAEN,OADc1H,EAAKtI,kBAAoBxQ,GAAaxH,YACvCsI,QAEf7K,WAAY,SAAC4rB,GACX,GAAe,OAAXA,EACF,OAAI1D,EACKp7B,EAAK++B,0BAA0B5c,EAAM3U,KAAM4tB,GAE3Cp7B,EAAKg/B,oBAAoB7c,EAAM3U,MAKxC,IAAMnS,ElD1IkB,SAASoF,EAAc0hB,GACvD,IAAI8c,EAAS,gBACA,YAATx+B,EACFw+B,EACE,0FAEe,qBAARx+B,EACTw+B,EAAS,6DACQ,eAARx+B,IACTw+B,EAAS,8BAGX,IAAM5jC,EAAQ,IAAIW,MAChByE,EAAO,OAAS0hB,EAAM3U,KAAK9L,WAAa,KAAOu9B,GAGjD,OADC5jC,EAAcoF,KAAOA,EAAKy+B,cACpB7jC,EkD0He8jC,CAAmBL,EAAQ3c,GACzC,OAAOniB,EAAK02B,wBACVvU,EACsB,KACtB9mB,MAUKo/B,gBAAf,SAA6BtY,GAC3B,OAAOA,EAAM3U,KAAK9L,WAAa,IAAMygB,EAAMuE,mBAM9B+T,iBAAf,SACEY,GAEA,IAAM+D,EAAa/D,EAASxsB,QAAQ,KAKpC,OAJAjT,GACkB,IAAhBwjC,GAAqBA,EAAa/D,EAASniC,OAAS,EACpD,iBAEK,CACLovB,QAAS+S,EAASlwB,OAAOi0B,EAAa,GACtC5xB,KAAM,IAAIrB,GAAKkvB,EAASlwB,OAAO,EAAGi0B,MAO9B3E,4BAAR,SAAwBW,GACtB,OAAO7iC,KAAKikC,cAAc5zB,IAAIwyB,IAMxBX,yBAAR,SAAqBtY,GACnB,IAAMkZ,EAAWZ,EAAS4B,cAAcla,GACxC,OAAO5pB,KAAK+jC,cAAc1zB,IAAIyyB,IAWjBZ,mBAAf,WACE,OAAOA,EAAS4E,iBAMV5E,kCAAR,SACEe,EACApN,GAEA,IAAM4N,EAAYzjC,KAAKqjC,eAAehzB,IAAI4yB,GAC1C5/B,EAAOogC,EAAW,wDAClB,IAAM3N,EAAc91B,KAAKoiC,kBAAkB8B,YAAYjB,GACvD,OAAOQ,EAAUzG,eACfnH,EACAC,EACiB,OAiBboM,wCAAR,SAAoCrM,GAClC,OAAO71B,KAAK+mC,sBACVlR,EACA71B,KAAKqjC,eACY,KACjBrjC,KAAKoiC,kBAAkB8B,YAAYtwB,GAAK4c,SAOpC0R,kCAAR,SACErM,EACAmR,EACAvP,EACA3B,GAEA,GAAID,EAAU5gB,KAAKzK,UACjB,OAAOxK,KAAKinC,iCACVpR,EACAmR,EACAvP,EACA3B,GAGF,IAAM2N,EAAYuD,EAAc32B,IAAIuD,GAAK4c,OAGtB,MAAfiH,GAAoC,MAAbgM,IACzBhM,EAAcgM,EAAUpF,uBAAuBzqB,GAAK4c,QAGtD,IAAImK,EAAkB,GAChBvd,EAAYyY,EAAU5gB,KAAKX,WAC3B4yB,EAAiBrR,EAAUsR,kBAAkB/pB,GAC7CsF,EAAYskB,EAAczY,SAASle,IAAI+M,GAC7C,GAAIsF,GAAawkB,EAAgB,CAC/B,IAAME,EAAmB3P,EACrBA,EAAY7S,kBAAkBxH,GAC9B,KACEiqB,EAAmBvR,EAAYtgB,MAAM4H,GAC3Cud,EAASA,EAAO33B,OACdhD,KAAK+mC,sBACHG,EACAxkB,EACA0kB,EACAC,IAWN,OANI5D,IACF9I,EAASA,EAAO33B,OACdygC,EAAUzG,eAAenH,EAAWC,EAAa2B,KAI9CkD,GAOHuH,6CAAR,SACErM,EACAmR,EACAvP,EACA3B,GAJF,WAMQ2N,EAAYuD,EAAc32B,IAAIuD,GAAK4c,OAGtB,MAAfiH,GAAoC,MAAbgM,IACzBhM,EAAcgM,EAAUpF,uBAAuBzqB,GAAK4c,QAGtD,IAAImK,EAAkB,GAyBtB,OAxBAqM,EAAczY,SAASzO,iBAAiB,SAAC1C,EAAWsF,GAClD,IAAM0kB,EAAmB3P,EACrBA,EAAY7S,kBAAkBxH,GAC9B,KACEiqB,EAAmBvR,EAAYtgB,MAAM4H,GACrC8pB,EAAiBrR,EAAUsR,kBAAkB/pB,GAC/C8pB,IACFvM,EAASA,EAAO33B,OACdyE,EAAKw/B,iCACHC,EACAxkB,EACA0kB,EACAC,OAMJ5D,IACF9I,EAASA,EAAO33B,OACdygC,EAAUzG,eAAenH,EAAWC,EAAa2B,KAI9CkD,GA9IMuH,gBAAgB,qBCtqBjC,aACUliC,eAAkB0kB,GAAaxH,WASzC,OAPEoqB,oBAAA,SAAQryB,GACN,OAAOjV,KAAKunC,UAAU1iB,SAAS5P,IAGjCqyB,2BAAA,SAAeryB,EAAYuyB,GACzBxnC,KAAKunC,UAAYvnC,KAAKunC,UAAU7pB,YAAYzI,EAAMuyB,uBCNpD,WAAoBC,GAAAznC,UAAAynC,EAyDtB,OAnDEC,qBAAA,SAASC,GACP,OAAO3nC,KAAKynC,KAAe,SAAY,SAAEE,GAAcC,KACrD,KAEA,SAAS9kC,GAGP,OAAIA,GAAwB,+BAAfA,EAAMoF,MACjB2F,GAAI,kEACG,MAEAvG,QAAQE,OAAO1E,MAM9B4kC,mCAAA,SAAuB7C,GAGrB7kC,KAAKynC,KAAe,SAAwB,qBAAE5C,IAGhD6C,sCAAA,SAA0B7C,GACxB7kC,KAAKynC,KAAe,SAA2B,wBAAE5C,IAGnD6C,kCAAA,WACE,IAAIG,EACF,0DACA7nC,KAAKynC,KAAK35B,KACV,iFAEE,eAAgB9N,KAAKynC,KAAKK,QAC5BD,GACE,uJAGO,mBAAoB7nC,KAAKynC,KAAKK,QACvCD,GACE,2JAIFA,GACE,kKAIJp+B,GAAKo+B,uBC1DT,aACU7nC,eAAqC,GAW/C,OATE+nC,6BAAA,SAAiBj6B,EAAck6B,gBAAAA,KACxB39B,EAASrK,KAAKioC,UAAWn6B,KAAO9N,KAAKioC,UAAUn6B,GAAQ,GAE5D9N,KAAKioC,UAAUn6B,IAASk6B,GAG1BD,gBAAA,WACE,OAAOnhC,EAAS5G,KAAKioC,+BCfzB,cA0BA,OAtBSC,gBAAP,SAAqBnwB,GACnB,IAAMowB,EAAapwB,EAAS5O,WAM5B,OAJKnJ,KAAKooC,aAAaD,KACrBnoC,KAAKooC,aAAaD,GAAc,IAAIJ,IAG/B/nC,KAAKooC,aAAaD,IAGpBD,sBAAP,SACEnwB,EACAswB,GAEA,IAAMF,EAAapwB,EAAS5O,WAM5B,OAJKnJ,KAAKsoC,WAAWH,KACnBnoC,KAAKsoC,WAAWH,GAAcE,KAGzBroC,KAAKsoC,WAAWH,IAvBVD,eAAiD,GACjDA,aAAmC,sBCOlD,WAAoBK,GAAAvoC,iBAAAuoC,EAFZvoC,WAAwC,KAiBlD,OAbEwoC,gBAAA,WACE,IAAMC,EAAWzoC,KAAKuoC,YAAYl4B,MAE5Bq4B,OAAaD,GAQnB,OAPIzoC,KAAK2oC,OACP/2B,GAAK5R,KAAK2oC,MAAO,SAACC,EAAczmC,GAC9BumC,EAAME,GAAQF,EAAME,GAAQzmC,IAGhCnC,KAAK2oC,MAAQF,EAENC,sBCCT,WAAYG,EAAqCC,GAAA9oC,aAAA8oC,EANzC9oC,oBAA2C,GAOjDA,KAAK+oC,eAAiB,IAAIP,GAAcK,GAExC,IAAMv1B,EApBmB,IAsBvB,IAAgDrB,KAAK0J,SACvDvI,GAAsBpT,KAAKgpC,aAAa94B,KAAKlQ,MAAOiS,KAAKI,MAAMiB,IA6BnE,OA1BE21B,wBAAA,SAAYL,GACV5oC,KAAKkpC,eAAeN,IAAQ,GAGtBK,yBAAR,WAAA,WACQE,EAAQnpC,KAAK+oC,eAAe14B,MAC5B+4B,EAA8B,GAChCC,GAAoB,EAExBz3B,GAAKu3B,EAAO,SAACP,EAAczmC,GACb,EAARA,GAAakI,EAAS5C,EAAKyhC,eAAgBN,KAC7CQ,EAAcR,GAAQzmC,EACtBknC,GAAoB,KAIpBA,GACFrpC,KAAK8oC,QAAQQ,YAAYF,GAI3Bh2B,GACEpT,KAAKgpC,aAAa94B,KAAKlQ,MACvBiS,KAAKI,MAAsB,EAAhBJ,KAAK0J,SA7CQ,0BCK9B,aAKU3b,iBAA2B,GAO3BA,qBAAkB,EAyF5B,OApFEupC,wBAAA,SAAYC,GAGV,IADA,IAAIC,EAAW,KACNjpC,EAAI,EAAGA,EAAIgpC,EAAc7oC,OAAQH,IAAK,CAC7C,IAAMwpB,EAAYwf,EAAchpC,GAC1BkpC,EAAY1f,EAAUX,UACX,OAAbogB,GAAsBC,EAAUhrB,OAAO+qB,EAASpgB,aAClDrpB,KAAK2pC,YAAYtnC,KAAKonC,GACtBA,EAAW,MAGI,OAAbA,IACFA,EAAW,IAAIG,GAAUF,IAG3BD,EAASI,IAAI7f,GAEXyf,GACFzpC,KAAK2pC,YAAYtnC,KAAKonC,IAa1BF,8BAAA,SAAkBt0B,EAAYu0B,GAC5BxpC,KAAK8pC,YAAYN,GACjBxpC,KAAK+pC,oCAAoC,SAACL,GACxC,OAAAA,EAAUhrB,OAAOzJ,MAarBs0B,sCAAA,SAA0BS,EAAmBR,GAC3CxpC,KAAK8pC,YAAYN,GAEjBxpC,KAAK+pC,oCAAoC,SAACL,GACxC,OAAOA,EAAUr/B,SAAS2/B,IAAgBA,EAAY3/B,SAASq/B,MAQ3DH,gDAAR,SACE5Y,GAEA3wB,KAAKiqC,kBAGL,IADA,IAAIC,GAAU,EACL1pC,EAAI,EAAGA,EAAIR,KAAK2pC,YAAYhpC,OAAQH,IAAK,CAChD,IAAM2pC,EAAYnqC,KAAK2pC,YAAYnpC,GACnC,GAAI2pC,EAEExZ,EADcwZ,EAAU9gB,YAE1BrpB,KAAK2pC,YAAYnpC,GAAG4pC,QACpBpqC,KAAK2pC,YAAYnpC,GAAK,MAEtB0pC,GAAU,EAKZA,IACFlqC,KAAK2pC,YAAc,IAGrB3pC,KAAKiqC,sCAeP,WAA6BzwB,GAAAxZ,WAAAwZ,EAFrBxZ,aAAmB,GAkC7B,OA3BE4pC,gBAAA,SAAI5f,GACFhqB,KAAKqqC,QAAQhoC,KAAK2nB,IAMpB4f,kBAAA,WACE,IAAK,IAAIppC,EAAI,EAAGA,EAAIR,KAAKqqC,QAAQ1pC,OAAQH,IAAK,CAC5C,IAAMwpB,EAAYhqB,KAAKqqC,QAAQ7pC,GAC/B,GAAkB,OAAdwpB,EAAoB,CACtBhqB,KAAKqqC,QAAQ7pC,GAAK,KAClB,IAAM8pC,EAAUtgB,EAAUZ,iBACtBvZ,GACFhC,GAAI,UAAYmc,EAAU7gB,YAE5B8J,GAAeq3B,MAQrBV,oBAAA,WACE,OAAO5pC,KAAKwZ,0BCjJd,WAAoB+wB,GAAAvqC,oBAAAuqC,EAVZvqC,gBAKJ,GAMFqD,EACE1D,MAAMyE,QAAQmmC,IAA2C,EAAxBA,EAAe5pC,OAChD,8BA8DN,OA5CY6pC,oBAAV,SAAkBpwB,OAAmB,aAAAzR,mBAAAA,IAAAiH,oBACnC,GAAIjQ,MAAMyE,QAAQpE,KAAKyqC,WAAWrwB,IAIhC,IAFA,IAAMswB,IAAgB1qC,KAAKyqC,WAAWrwB,IAE7B5Z,EAAI,EAAGA,EAAIkqC,EAAU/pC,OAAQH,IACpCkqC,EAAUlqC,GAAGmH,SAAS9G,MAAM6pC,EAAUlqC,GAAGsM,QAAS8C,IAKxD46B,eAAA,SAAGpwB,EAAmBzS,EAA4BmF,GAChD9M,KAAK2qC,mBAAmBvwB,GACxBpa,KAAKyqC,WAAWrwB,GAAapa,KAAKyqC,WAAWrwB,IAAc,GAC3Dpa,KAAKyqC,WAAWrwB,GAAW/X,KAAK,CAAEsF,WAAUmF,YAE5C,IAAMkd,EAAYhqB,KAAK4qC,gBAAgBxwB,GACnC4P,GACFriB,EAAS9G,MAAMiM,EAASkd,IAI5BwgB,gBAAA,SAAIpwB,EAAmBzS,EAA4BmF,GACjD9M,KAAK2qC,mBAAmBvwB,GAExB,IADA,IAAMswB,EAAY1qC,KAAKyqC,WAAWrwB,IAAc,GACvC5Z,EAAI,EAAGA,EAAIkqC,EAAU/pC,OAAQH,IACpC,GACEkqC,EAAUlqC,GAAGmH,WAAaA,KACxBmF,GAAWA,IAAY49B,EAAUlqC,GAAGsM,SAGtC,YADA49B,EAAU1K,OAAOx/B,EAAG,IAMlBgqC,+BAAR,SAA2BpwB,GACzB/W,EACErD,KAAKuqC,eAAe5b,KAAK,SAASkc,GAChC,OAAOA,IAAOzwB,IAEhB,kBAAoBA,wBChExB,aAAA,IAEM0wB,EACAC,IAFJ5iC,YAAM,CAAC,wBAIe,oBAAb6iC,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,iBAQbrjC,EAAKyjC,UAAW,EAEZH,GACFC,SAASC,iBACPF,EACA,WACE,IAAMvL,GAAWwL,SAASF,GACtBtL,IAAY/3B,EAAKyjC,WACnBzjC,EAAKyjC,SAAW1L,EAChB/3B,EAAK0jC,QAAQ,UAAW3L,MAG5B,KAaR,OA5DuCj3B,OAG9B6iC,cAAP,WACE,OAAO,IAAIA,GAoDbA,4BAAA,SAAgBhxB,GAEd,OADA/W,EAAqB,YAAd+W,EAAyB,uBAAyBA,GAClD,CAACpa,KAAKkrC,cA1DsBV,mBCYrC,aAAA,MACEriC,YAAM,CAAC,wBAPDV,WAAU,EAcI,oBAAXK,aAC4B,IAA5BA,OAAOmjC,kBACbpjC,MAEDC,OAAOmjC,iBACL,SACA,WACOxjC,EAAK4jC,UACR5jC,EAAK4jC,SAAU,EACf5jC,EAAK0jC,QAAQ,UAAU,MAG3B,GAGFrjC,OAAOmjC,iBACL,UACA,WACMxjC,EAAK4jC,UACP5jC,EAAK4jC,SAAU,EACf5jC,EAAK0jC,QAAQ,UAAU,MAG3B,MAoBR,OA1DmC5iC,OAG1B+iC,cAAP,WACE,OAAO,IAAIA,GA2CbA,4BAAA,SAAgBlxB,GAEd,OADA/W,EAAqB,WAAd+W,EAAwB,uBAAyBA,GACjD,CAACpa,KAAKqrC,UAMfC,4BAAA,WACE,OAAOtrC,KAAKqrC,YAxDmBb,kBCGjC,WAAoBe,GAAAvrC,gBAAAurC,EARpBvrC,sBAA0B,GAC1BA,wBAAqB,EACrBA,yBAAsB,EACtBA,aAA+B,KA6CjC,OAtCEwrC,uBAAA,SAAWC,EAAqB9jC,GAC9B3H,KAAK0rC,mBAAqBD,EAC1BzrC,KAAK2rC,QAAUhkC,EACX3H,KAAK0rC,mBAAqB1rC,KAAK4rC,qBACjC5rC,KAAK2rC,UACL3rC,KAAK2rC,QAAU,OAWnBH,2BAAA,SAAeK,EAAoBjjC,GAAnC,WACE5I,KAAK8rC,iBAAiBD,GAAcjjC,EACpC,qBACE,IAAMmjC,EAAYC,EAAKF,iBAAiBE,EAAKJ,2BACtCI,EAAKF,iBAAiBE,EAAKJ,oBAClC,mBAASprC,GACHurC,EAAUvrC,IACZyS,GAAe,WACbxL,EAAK8jC,WAAWQ,EAAUvrC,OAHvBA,EAAI,EAAGA,EAAIurC,EAAUprC,SAAUH,IAA/BA,GAOT,GAAIwrC,EAAKJ,qBAAuBI,EAAKN,0BAC/BM,EAAKL,UACPK,EAAKL,UACLK,EAAKL,QAAU,cAInBK,EAAKJ,6BAjBA5rC,KAAK8rC,iBAAiB9rC,KAAK4rC,kEC4DpC,WACSK,EACAl0B,EACAm0B,EACAC,GAHAnsC,YAAAisC,EACAjsC,cAAA+X,EACA/X,wBAAAksC,EACAlsC,mBAAAmsC,EA5BTnsC,eAAY,EACZA,mBAAgB,EAURA,qBAAiB,EAmBvBA,KAAKosC,KAAO97B,GAAW27B,GACvBjsC,KAAKqsC,OAASnE,GAAaoE,cAAcv0B,GACzC/X,KAAKusC,MAAQ,SAAC11B,GACZ,OAAAkB,EAASy0B,cAAcz2B,GAAcc,IAqQ3C,OA7PE41B,iBAAA,SAAKC,EAAkCC,GAAvC,WACE3sC,KAAK4sC,cAAgB,EACrB5sC,KAAK6sC,cAAgBF,EACrB3sC,KAAK8sC,gBAAkB,IAAItB,GAAekB,GAC1C1sC,KAAK+sC,WAAY,EAEjB/sC,KAAKgtC,qBAAuB95B,WAAW,WACrCzL,EAAK2kC,KAAK,gCAEV3kC,EAAKwlC,YACLxlC,EAAKulC,qBAAuB,MAC3B/6B,KAAKI,MA7De,M9D8IQ,SAAS3H,GAC1C,GAA2C,aAAvCsgC,SAAwBkC,WAC1BxiC,QACK,CAIL,IAAIyiC,GAAS,EACTC,EAAY,WACTpC,SAAShqC,KAKTmsC,IACHA,GAAS,EACTziC,KANAwI,WAAWk6B,EAAWn7B,KAAKI,MAAM,MAUjC24B,SAASC,kBACXD,SAASC,iBAAiB,mBAAoBmC,GAAW,GAEzDtlC,OAAOmjC,iBAAiB,OAAQmC,GAAW,IACjCpC,SAAiBqC,cAE1BrC,SAAiBqC,YAAY,qBAAsB,WACtB,aAAxBrC,SAASkC,YAA2BE,MAGzCtlC,OAAeulC,YAAY,SAAUD,K8D5GxCE,CAAoB,WAClB,IAAI7lC,EAAKslC,UAAT,CAGAtlC,EAAK8lC,gBAAkB,IAAIC,GACzB,eAAC,aAAA7kC,mBAAAA,IAAA4E,kBACO,IAAAkgC,SAACC,OAASC,OAAMC,iBAEtB,GADAnmC,EAAKomC,wBAAwBtgC,GACxB9F,EAAK8lC,gBAOV,GALI9lC,EAAKulC,uBACPc,aAAarmC,EAAKulC,sBAClBvlC,EAAKulC,qBAAuB,MAE9BvlC,EAAKsmC,gBAAiB,EAjHa,SAkH/BL,EACFjmC,EAAKwF,GAAK0gC,EACVlmC,EAAKumC,SAAWJ,MACX,CAAA,GApH8B,UAoH1BF,EAgBT,MAAM,IAAIjqC,MAAM,kCAAoCiqC,GAdhDC,GAGFlmC,EAAK8lC,gBAAgBU,cAAe,EAIpCxmC,EAAKqlC,gBAAgBoB,WAAWP,EAAM,WACpClmC,EAAKwlC,eAGPxlC,EAAKwlC,cAMX,eAAC,aAAAtkC,mBAAAA,IAAA4E,kBACO,IAAAkgC,SAACU,OAAIvlC,OACXnB,EAAKomC,wBAAwBtgC,GAC7B9F,EAAKqlC,gBAAgBsB,eAAeD,EAAIvlC,IAE1C,WACEnB,EAAKwlC,aAEPxlC,EAAK8kC,OAKP,IAAM8B,EAA8C,CACpDC,MAA2C,KAC3CD,EAAwC,IAAIp8B,KAAKI,MAC/B,IAAhBJ,KAAK0J,UAEHlU,EAAK8lC,gBAAgBgB,2BACvBF,EACqC,GACjC5mC,EAAK8lC,gBAAgBgB,0BAC3BF,EAAuB,EzD1LG,IyD2LtB5mC,EAAKykC,qBACPmC,EAAiC,EAAI5mC,EAAKykC,oBAExCzkC,EAAK0kC,gBACPkC,EAA4B,GAAI5mC,EAAK0kC,eAIjB,oBAAbv0B,UACPA,SAAS42B,OACgC,IAAzC52B,SAAS42B,KAAKl4B,QAAQT,MAEtBw4B,EAAuB,EzD/LN,KyDiMnB,IAAMI,EAAahnC,EAAK8kC,MAAM8B,GAC9B5mC,EAAK2kC,KAAK,+BAAiCqC,GAC3ChnC,EAAK8lC,gBAAgBmB,OAAOD,EAAY,kBAS5ChC,kBAAA,WACEzsC,KAAKutC,gBAAgBoB,cAAc3uC,KAAKiN,GAAIjN,KAAKguC,UACjDhuC,KAAK4uC,uBAAuB5uC,KAAKiN,GAAIjN,KAAKguC,WAQrCvB,aAAP,WACEA,EAAsBoC,aAAc,GAQ/BpC,gBAAP,WACEA,EAAsBqC,gBAAiB,GAIlCrC,cAAP,WAGE,OACEA,EAAsBoC,cACpBpC,EAAsBqC,gBACF,oBAAb9D,UACmB,MAA1BA,SAAS+D,iB9DuOK,iBAAXjnC,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAO8P,SAAS42B,UAUR,iBAAZQ,SAA8C,iBAAfA,QAAQC,M8DjP9ChnC,KAOPwkC,kCAAA,aAMQA,sBAAR,WACEzsC,KAAK+sC,WAAY,EAEb/sC,KAAKutC,kBACPvtC,KAAKutC,gBAAgB2B,QACrBlvC,KAAKutC,gBAAkB,MAIrBvtC,KAAKmvC,iBACPnE,SAAShqC,KAAKouC,YAAYpvC,KAAKmvC,gBAC/BnvC,KAAKmvC,eAAiB,MAGpBnvC,KAAKgtC,uBACPc,aAAa9tC,KAAKgtC,sBAClBhtC,KAAKgtC,qBAAuB,OAQxBP,sBAAR,WACOzsC,KAAK+sC,YACR/sC,KAAKosC,KAAK,8BACVpsC,KAAKqvC,YAEDrvC,KAAK6sC,gBACP7sC,KAAK6sC,cAAc7sC,KAAK+tC,gBACxB/tC,KAAK6sC,cAAgB,QAS3BJ,kBAAA,WACOzsC,KAAK+sC,YACR/sC,KAAKosC,KAAK,6BACVpsC,KAAKqvC,cAST5C,iBAAA,SAAK7jC,GACH,IAAM0mC,EAAUzlC,EAAUjB,GAC1B5I,KAAKuvC,WAAaD,EAAQ3uC,OAC1BX,KAAKqsC,OAAOmD,iBAAiB,aAAcF,EAAQ3uC,QAWnD,IARA,I1EhBI6O,E0EgBEigC,G1EhBFjgC,EAAY9L,E0EgBgB4rC,G1Ef3B7oC,EAAOnB,gBAAgBkK,GAAW,I0EmBjCkC,EAAWH,GAAkBk+B,EAlRdC,MAsRZlvC,EAAI,EAAGA,EAAIkR,EAAS/Q,OAAQH,IACnCR,KAAKutC,gBAAgBoC,eACnB3vC,KAAK4sC,cACLl7B,EAAS/Q,OACT+Q,EAASlR,IAEXR,KAAK4sC,iBAWTH,mCAAA,SAAuBx/B,EAAY2iC,GAEjC5vC,KAAKmvC,eAAiBnE,SAAS+D,cAAc,UAC7C,IAAMV,EAAqC,CAC3CwB,OAA2D,KAC3DxB,EAAoC,GAAIphC,EACxCohC,EAAoC,GAAIuB,EACxC5vC,KAAKmvC,eAAeW,IAAM9vC,KAAKusC,MAAM8B,GACrCruC,KAAKmvC,eAAeY,MAAMC,QAAU,OAEpChF,SAAShqC,KAAKivC,YAAYjwC,KAAKmvC,iBAQzB1C,oCAAR,SAAgCl/B,GAE9B,IAAM2iC,EAAgBrmC,EAAU0D,GAAM5M,OACtCX,KAAKkwC,eAAiBA,EACtBlwC,KAAKqsC,OAAOmD,iBAAiB,iBAAkBU,uBA6CjD,WACEC,EACAC,EACOzD,EACAJ,GADAvsC,kBAAA2sC,EACA3sC,WAAAusC,EAlCTvsC,yBAAsB,IAAIqwC,IAG1BrwC,iBAAqD,GAOrDA,mBAAgBiS,KAAKI,MAAsB,IAAhBJ,KAAK0J,UAIhC3b,mBAAe,EA2BXA,KAAKuuC,yBAA2Bj/B,IAC/BxH,OAvY0C,aAwYL9H,KAAKuuC,0BACvC4B,EACHroC,OAzYuC,UA0YL9H,KAAKuuC,0BACpC6B,EAGJpwC,KAAKswC,SAAW9C,EAA2B+C,gBAG3C,IAAIC,EAAS,GAIXxwC,KAAKswC,SAASR,KACwC,gBAAtD9vC,KAAKswC,SAASR,IAAIl9B,OAAO,EAAG,cAAcjS,UAG1C6vC,EAAS,4BADaxF,SAAS30B,OACwB,gBAEzD,IAAMo6B,EAAiB,eAAiBD,EAAS,iBACjD,IACExwC,KAAKswC,SAASI,IAAIC,OAClB3wC,KAAKswC,SAASI,IAAI5P,MAAM2P,GACxBzwC,KAAKswC,SAASI,IAAIxB,QAClB,MAAO5sC,GACPuL,GAAI,2BACAvL,EAAE6Q,OACJtF,GAAIvL,EAAE6Q,OAERtF,GAAIvL,IAuQZ,OAzPiBkrC,gBAAf,WACE,IAAMoD,EAAS5F,SAAS+D,cAAc,UAItC,GAHA6B,EAAOb,MAAMC,QAAU,QAGnBhF,SAAShqC,KAqBX,KAAM,oGApBNgqC,SAAShqC,KAAKivC,YAAYW,GAC1B,IAIYA,EAAOC,cAAc7F,UAG7Bn9B,GAAI,iCAEN,MAAOvL,GACP,IAAM+T,EAAS20B,SAAS30B,OACxBu6B,EAAOd,IACL,gEACAz5B,EACA,2BAiBN,OARIu6B,EAAOE,gBACRF,EAAeF,IAAME,EAAOE,gBACpBF,EAAOC,cACfD,EAAeF,IAAME,EAAOC,cAAc7F,SACjC4F,EAAe5F,WACxB4F,EAAeF,IAAOE,EAAe5F,UAGjC4F,GAMTpD,kBAAA,WAAA,WAEExtC,KAAK+wC,OAAQ,EAET/wC,KAAKswC,WAIPtwC,KAAKswC,SAASI,IAAI1vC,KAAKgwC,UAAY,GACnC99B,WAAW,WACa,OAAlBzL,EAAK6oC,WACPtF,SAAShqC,KAAKouC,YAAY3nC,EAAK6oC,UAC/B7oC,EAAK6oC,SAAW,OAEjBr+B,KAAKI,MAAM,KAahB,IAAMs6B,EAAe3sC,KAAK2sC,aACtBA,IACF3sC,KAAK2sC,aAAe,KACpBA,MASJa,0BAAA,SAAcvgC,EAAY2iC,GAMxB,IALA5vC,KAAKixC,KAAOhkC,EACZjN,KAAKkxC,KAAOtB,EACZ5vC,KAAK+wC,OAAQ,EAGN/wC,KAAKmxC,kBAUN3D,wBAAR,WAIE,GACExtC,KAAK+wC,OACL/wC,KAAKiuC,cACLjuC,KAAKoxC,oBAAoB5iB,MAAkC,EAA1BxuB,KAAKqxC,YAAY1wC,OAAa,EAAI,GACnE,CAEAX,KAAKsxC,gBACL,IAAMjD,EAA8C,GACpDA,EAAoC,GAAIruC,KAAKixC,KAC7C5C,EAAoC,GAAIruC,KAAKkxC,KAC7C7C,EAAwC,IAAIruC,KAAKsxC,cAMjD,IALA,IAAIC,EAASvxC,KAAKusC,MAAM8B,GAEpBmD,EAAgB,GAChBhxC,EAAI,EAEyB,EAA1BR,KAAKqxC,YAAY1wC,QAAY,CAGlC,KADgBX,KAAKqxC,YAAY,GAEvB/xC,EAAEqB,OA/hBI,GA+hBuB6wC,EAAc7wC,QAhiBnC,MAwjBhB,MApBA,IAAM8wC,EAASzxC,KAAKqxC,YAAYK,QAChCF,EACEA,EACA,OAEAhxC,EACA,IACAixC,EAAOE,IACP,MAEAnxC,EACA,IACAixC,EAAOG,GACP,KAEApxC,EACA,IACAixC,EAAOnyC,EACTkB,IASJ,OAHA+wC,GAAkBC,EAClBxxC,KAAK6xC,gBAAgBN,EAAQvxC,KAAKsxC,gBAE3B,EAEP,OAAO,GAUX9D,2BAAA,SAAesE,EAAgBC,EAAmBnpC,GAEhD5I,KAAKqxC,YAAYhvC,KAAK,CAAEsvC,IAAKG,EAAQF,GAAIG,EAAWzyC,EAAGsJ,IAInD5I,KAAK+wC,OACP/wC,KAAKmxC,eAUD3D,4BAAR,SAAwBwE,EAAaC,GAArC,WAEEjyC,KAAKoxC,oBAAoBvH,IAAIoI,GAE7B,IAAMC,EAAe,WACnBzqC,EAAK2pC,oBAAoBniB,OAAOgjB,GAChCxqC,EAAK0pC,eAKDgB,EAAmBj/B,WACvBg/B,EACAjgC,KAAKI,MA9lBwB,OAymB/BrS,KAAK0uC,OAAOsD,EARS,WAEnBlE,aAAaqE,GAGbD,OAWJ1E,mBAAA,SAAOwE,EAAaI,GAApB,WAIIl/B,WAAW,WACT,IAEE,IAAKzL,EAAKwmC,aAAc,OACxB,IAAMoE,EAAY5qC,EAAK6oC,SAASI,IAAI3B,cAAc,UAClDsD,EAAUz7B,KAAO,kBACjBy7B,EAAUC,OAAQ,EAClBD,EAAUvC,IAAMkC,EAChBK,EAAUE,OAAUF,EAAkBG,mBAAqB,WACzD,IAAMC,EAAUJ,EAAkBnF,WAC7BuF,GAAqB,WAAXA,GAAkC,aAAXA,IACpCJ,EAAUE,OAAUF,EAAkBG,mBAAqB,KACvDH,EAAUK,YACZL,EAAUK,WAAWtD,YAAYiD,GAEnCD,MAGJC,EAAUM,QAAU,WAClB9kC,GAAI,oCAAsCmkC,GAC1CvqC,EAAKwmC,cAAe,EACpBxmC,EAAKynC,SAEPznC,EAAK6oC,SAASI,IAAI1vC,KAAKivC,YAAYoC,GACnC,MAAO/vC,MAGR2P,KAAKI,MAAM,UCvsBTjP,GAAc,GCuBzB,IAGIwvC,GAAgB,KACQ,oBAAjBC,aACTD,GAAgBC,aACc,oBAAdC,YAChBF,GAAgBE,WAYlB,kBAsBE,WACS7G,EACPl0B,EACAm0B,EACAC,GAHOnsC,YAAAisC,EAtBTjsC,oBAAgC,KAChCA,YAA0B,KAC1BA,iBAAc,EACdA,eAAY,EACZA,mBAAgB,EAuBdA,KAAKosC,KAAO97B,GAAWtQ,KAAKisC,QAC5BjsC,KAAKqsC,OAASnE,GAAaoE,cAAcv0B,GACzC/X,KAAK8W,QAAUi8B,EAAoBC,eACjCj7B,EACAm0B,EACAC,GAmVN,OAvUiB4G,iBAAf,SACEh7B,EACAm0B,EACAC,GAEA,IAAMkC,EAAqC,CAC3CtsC,E3D9F4B,K2D8G5B,MAZsB,oBAAb6V,UACPA,SAAS42B,OACgC,IAAzC52B,SAAS42B,KAAKl4B,QAAQT,MAEtBw4B,EAAuB,E3D9FJ,K2DgGjBnC,IACFmC,EAAiC,EAAInC,GAEnCC,IACFkC,EAA4B,GAAIlC,GAE3Bp0B,EAASy0B,cAAc12B,GAAWu4B,IAQ3C0E,iBAAA,SAAKrG,EAAkCC,GAAvC,WACE3sC,KAAK2sC,aAAeA,EACpB3sC,KAAK0sC,UAAYA,EAEjB1sC,KAAKosC,KAAK,2BAA6BpsC,KAAK8W,SAE5C9W,KAAK+tC,gBAAiB,EAEtB5+B,EAAkBgB,IAAI,8BAA8B,GAEpD,IAyBInQ,KAAKizC,OAAS,IAAIL,GAAc5yC,KAAK8W,SAEvC,MAAOxU,GACPtC,KAAKosC,KAAK,kCACV,IAAMtpC,EAAQR,EAAEiB,SAAWjB,EAAEsG,KAK7B,OAJI9F,GACF9C,KAAKosC,KAAKtpC,QAEZ9C,KAAKitC,YAIPjtC,KAAKizC,OAAOC,OAAS,WACnBzrC,EAAK2kC,KAAK,wBACV3kC,EAAKsmC,gBAAiB,GAGxB/tC,KAAKizC,OAAOE,QAAU,WACpB1rC,EAAK2kC,KAAK,0CACV3kC,EAAKwrC,OAAS,KACdxrC,EAAKwlC,aAGPjtC,KAAKizC,OAAOG,UAAY,SAAC1wC,GACvB+E,EAAK4rC,oBAAoB3wC,IAG3B1C,KAAKizC,OAAON,QAAU,SAACrwC,GACrBmF,EAAK2kC,KAAK,yCACV,IAAMtpC,EAAQR,EAAEiB,SAAWjB,EAAEsG,KACzB9F,GACF2E,EAAK2kC,KAAKtpC,GAEZ2E,EAAKwlC,cAOT8F,kBAAA,aAIOA,gBAAP,WACEA,EAAoBjE,gBAAiB,GAGhCiE,cAAP,WACE,IAAIO,GAAe,EACnB,GAAyB,oBAAdtrC,WAA6BA,UAAUurC,UAAW,CAC3D,IACMC,EAAkBxrC,UAAUurC,UAAUE,MADpB,kCAEpBD,GAA4C,EAAzBA,EAAgB7yC,QACjC+yC,WAAWF,EAAgB,IAAM,MACnCF,GAAe,GAKrB,OACGA,GACiB,OAAlBV,KACCG,EAAoBjE,gBAoBlBiE,mBAAP,WAGE,OACE5jC,EAAkBwkC,oBACsC,IAAxDxkC,EAAkBkB,IAAI,+BAI1B0iC,kCAAA,WACE5jC,EAAkBiB,OAAO,+BAGnB2iC,yBAAR,SAAqBnqC,GAEnB,GADA5I,KAAK4zC,OAAOvxC,KAAKuG,GACb5I,KAAK4zC,OAAOjzC,QAAUX,KAAK6zC,YAAa,CAC1C,IAAMC,EAAW9zC,KAAK4zC,OAAOzuC,KAAK,IAClCnF,KAAK4zC,OAAS,KACd,IAAMG,EAAWrqC,EAASoqC,GAG1B9zC,KAAK0sC,UAAUqH,KAQXhB,iCAAR,SAA6BiB,GAC3Bh0C,KAAK6zC,YAAcG,EACnBh0C,KAAK4zC,OAAS,IASRb,+BAAR,SAA2BnqC,GAIzB,GAHAvF,EAAuB,OAAhBrD,KAAK4zC,OAAiB,kCAGzBhrC,EAAKjI,QAAU,EAAG,CACpB,IAAMqzC,EAAatjC,OAAO9H,GAC1B,IAAKqrC,MAAMD,GAET,OADAh0C,KAAKk0C,qBAAqBF,GACnB,KAIX,OADAh0C,KAAKk0C,qBAAqB,GACnBtrC,GAOTmqC,gCAAA,SAAoBoB,GAClB,GAAoB,OAAhBn0C,KAAKizC,OAAT,CACA,IAAMrqC,EAAOurC,EAAW,KAMxB,GALAn0C,KAAKkwC,eAAiBtnC,EAAKjI,OAC3BX,KAAKqsC,OAAOmD,iBAAiB,iBAAkB5mC,EAAKjI,QAEpDX,KAAKo0C,iBAEe,OAAhBp0C,KAAK4zC,OAEP5zC,KAAKq0C,aAAazrC,OACb,CAEL,IAAM0rC,EAAgBt0C,KAAKu0C,mBAAmB3rC,GACxB,OAAlB0rC,GACFt0C,KAAKq0C,aAAaC,MASxBvB,iBAAA,SAAKnqC,GACH5I,KAAKo0C,iBAEL,IAAM9E,EAAUzlC,EAAUjB,GAC1B5I,KAAKuvC,WAAaD,EAAQ3uC,OAC1BX,KAAKqsC,OAAOmD,iBAAiB,aAAcF,EAAQ3uC,QAKnD,IAAM+Q,EAAWH,GAAkB+9B,EAjTN,OAoTP,EAAlB59B,EAAS/Q,QACXX,KAAKw0C,YAAY9uC,OAAOgM,EAAS/Q,SAInC,IAAK,IAAIH,EAAI,EAAGA,EAAIkR,EAAS/Q,OAAQH,IACnCR,KAAKw0C,YAAY9iC,EAASlR,KAItBuyC,sBAAR,WACE/yC,KAAK+sC,WAAY,EACb/sC,KAAKy0C,iBACPC,cAAc10C,KAAKy0C,gBACnBz0C,KAAKy0C,eAAiB,MAGpBz0C,KAAKizC,SACPjzC,KAAKizC,OAAO/D,QACZlvC,KAAKizC,OAAS,OAIVF,sBAAR,WACO/yC,KAAK+sC,YACR/sC,KAAKosC,KAAK,+BACVpsC,KAAKqvC,YAGDrvC,KAAK2sC,eACP3sC,KAAK2sC,aAAa3sC,KAAK+tC,gBACvB/tC,KAAK2sC,aAAe,QAS1BoG,kBAAA,WACO/yC,KAAK+sC,YACR/sC,KAAKosC,KAAK,6BACVpsC,KAAKqvC,cAQT0D,2BAAA,WAAA,WACE2B,cAAc10C,KAAKy0C,gBACnBz0C,KAAKy0C,eAAiBE,YAAY,WAE5BltC,EAAKwrC,QACPxrC,EAAK+sC,YAAY,KAEnB/sC,EAAK2sC,kBACJniC,KAAKI,MA9WyB,QAuX3B0gC,wBAAR,SAAoBpvC,GAIlB,IACE3D,KAAKizC,OAAO2B,KAAKjxC,GACjB,MAAOrB,GACPtC,KAAKosC,KACH,0CACA9pC,EAAEiB,SAAWjB,EAAEsG,KACf,uBAEFsK,WAAWlT,KAAKitC,UAAU/8B,KAAKlQ,MAAO,KA5LnC+yC,+BAA+B,EAM/BA,iBAAiB,uBC1MxB,WAAYh7B,GACV/X,KAAK60C,gBAAgB98B,GAyDzB,OAjEEvY,sBAAWs1C,wBAAX,WACE,MAAO,CAACrI,GAAuBsG,qCAczB+B,4BAAR,SAAwB/8B,WAChBg9B,EACJhC,IAAuBA,GAAiC,cACtDiC,EACFD,IAA0BhC,GAAoBkC,mBAWhD,GATIl9B,EAAS5B,gBACN4+B,GACHtrC,GACE,mFAGJurC,GAAuB,GAGrBA,EACFh1C,KAAKk1C,YAAc,CAACnC,QACf,CACL,IAAMoC,EAAcn1C,KAAKk1C,YAAc,OACvC,IAAwB,IAAA7rC,EAAAC,EAAAwrC,EAAiBM,8CAAgB,CAApD,IAAMC,UACLA,GAAaA,EAAuB,eACtCF,EAAW9yC,KAAKgzC,wGAUxBP,6BAAA,WACE,GAA8B,EAA1B90C,KAAKk1C,YAAYv0C,OACnB,OAAOX,KAAKk1C,YAAY,GAExB,MAAM,IAAIzxC,MAAM,4BAQpBqxC,6BAAA,WACE,OAA8B,EAA1B90C,KAAKk1C,YAAYv0C,OACZX,KAAKk1C,YAAY,GAEjB,yBCPX,WACSjoC,EACCqoC,EACA/J,EACAgK,EACA1I,EACA2I,EACDrJ,GANAnsC,QAAAiN,EACCjN,eAAAs1C,EACAt1C,gBAAAurC,EACAvrC,cAAAu1C,EACAv1C,mBAAA6sC,EACA7sC,aAAAw1C,EACDx1C,mBAAAmsC,EAhCTnsC,qBAAkB,EAClBA,yBAA6B,GAWrBA,cAsBNA,KAAKosC,KAAO97B,GAAW,KAAOtQ,KAAKiN,GAAK,KACxCjN,KAAKy1C,kBAAoB,IAAIX,GAAiBQ,GAC9Ct1C,KAAKosC,KAAK,sBACVpsC,KAAK01C,SA8cT,OAvcUC,mBAAR,WAAA,WACQC,EAAO51C,KAAKy1C,kBAAkBI,mBACpC71C,KAAK81C,MAAQ,IAAIF,EACf51C,KAAK+1C,mBACL/1C,KAAKs1C,eACLnuC,EACAnH,KAAKmsC,eAKPnsC,KAAKg2C,0BAA4BJ,EAAmC,8BAAK,EAEzE,IAAMK,EAAoBj2C,KAAKk2C,cAAcl2C,KAAK81C,OAC5CK,EAAmBn2C,KAAKo2C,iBAAiBp2C,KAAK81C,OACpD91C,KAAKq2C,IAAMr2C,KAAK81C,MAChB91C,KAAKs2C,IAAMt2C,KAAK81C,MAChB91C,KAAKu2C,eAAiB,KACtBv2C,KAAKw2C,YAAa,EAQlBtjC,WAAW,WAETzL,EAAKquC,OAASruC,EAAKquC,MAAMnF,KAAKsF,EAAmBE,IAChDlkC,KAAKI,MAAM,IAEd,IAAMokC,EAAoBb,EAAqB,gBAAK,EAC5B,EAApBa,IACFz2C,KAAK02C,gBAAkBtjC,GAAsB,WAC3C3L,EAAKivC,gBAAkB,KAClBjvC,EAAK+uC,aAEN/uC,EAAKquC,OA5GuB,OA6G5BruC,EAAKquC,MAAM5F,eAEXzoC,EAAK2kC,KACH,wDACE3kC,EAAKquC,MAAM5F,cACX,wCAEJzoC,EAAK+uC,YAAa,EAClB/uC,EAAKquC,MAAMa,yBAEXlvC,EAAKquC,OAxHmB,MAyHxBruC,EAAKquC,MAAMvG,UAEX9nC,EAAK2kC,KACH,oDACE3kC,EAAKquC,MAAMvG,UACX,uCAKJ9nC,EAAK2kC,KAAK,+CACV3kC,EAAKynC,WAGRj9B,KAAKI,MAAMokC,MAQVd,6BAAR,WACE,MAAO,KAAO31C,KAAKiN,GAAK,IAAMjN,KAAK42C,mBAG7BjB,6BAAR,SAAyBC,GAAzB,WACE,OAAO,SAAAiB,GACDjB,IAASnuC,EAAKquC,MAChBruC,EAAKqvC,kBAAkBD,GACdjB,IAASnuC,EAAK8uC,gBACvB9uC,EAAK2kC,KAAK,8BACV3kC,EAAKsvC,8BAELtvC,EAAK2kC,KAAK,+BAKRuJ,0BAAR,SAAsBC,GAAtB,WACE,OAAO,SAACryC,MACFkE,EAAKuvC,SACHpB,IAASnuC,EAAK6uC,IAChB7uC,EAAKwvC,0BAA0B1zC,GACtBqyC,IAASnuC,EAAK8uC,eACvB9uC,EAAKyvC,4BAA4B3zC,GAEjCkE,EAAK2kC,KAAK,gCAUlBuJ,wBAAA,SAAYwB,GAEV,IAAMC,EAAM,CAAE92C,EAAG,IAAKhB,EAAG63C,GACzBn3C,KAAKq3C,UAAUD,IAGjBzB,iCAAA,WACM31C,KAAKq2C,MAAQr2C,KAAKu2C,gBAAkBv2C,KAAKs2C,MAAQt2C,KAAKu2C,iBACxDv2C,KAAKosC,KACH,2CAA6CpsC,KAAKu2C,eAAetK,QAEnEjsC,KAAK81C,MAAQ91C,KAAKu2C,eAClBv2C,KAAKu2C,eAAiB,OAKlBZ,gCAAR,SAA4B2B,GAC1B,GA3LiB,MA2LGA,EAAa,CAC/B,IAAMC,EAAMD,EAAwB,EAtLvB,MAuLTC,EACFv3C,KAAKw3C,6BA3LS,MA4LLD,GAETv3C,KAAKosC,KAAK,wCACVpsC,KAAKu2C,eAAerH,QAGlBlvC,KAAKq2C,MAAQr2C,KAAKu2C,gBAClBv2C,KAAKs2C,MAAQt2C,KAAKu2C,gBAElBv2C,KAAKkvC,SAnMM,MAqMJqI,IACTv3C,KAAKosC,KAAK,0BACVpsC,KAAKy3C,8BACLz3C,KAAKw3C,gCAKH7B,wCAAR,SAAoC+B,GAClC,IAAMC,EAAgBvmC,GAAW,IAAKsmC,GAChC9uC,EAAYwI,GAAW,IAAKsmC,GAClC,GAAa,KAATC,EACF33C,KAAK43C,oBAAoBhvC,OACpB,CAAA,GAAa,KAAT+uC,EAIT,MAAM,IAAIl0C,MAAM,2BAA6Bk0C,GAF7C33C,KAAK63C,oBAAoBx1C,KAAKuG,KAM1B+sC,uCAAR,WACM31C,KAAKy3C,6BAA+B,GACtCz3C,KAAKosC,KAAK,oCACVpsC,KAAKw2C,YAAa,EAClBx2C,KAAKu2C,eAAeI,wBACpB32C,KAAK83C,wBAGL93C,KAAKosC,KAAK,8BACVpsC,KAAKu2C,eAAe3B,KAAK,CAAEt0C,EAAG,IAAKhB,EAAG,CAAEgB,EAhOjC,IAgO0ChB,EAAG,QAIhDq2C,gCAAR,WAEE31C,KAAKu2C,eAAejI,QAEpBtuC,KAAKosC,KAAK,mCACVpsC,KAAKu2C,eAAe3B,KAAK,CAAEt0C,EAAG,IAAKhB,EAAG,CAAEgB,EA3OzB,IA2OwChB,EAAG,MAI1DU,KAAKosC,KAAK,kCACVpsC,KAAK81C,MAAMlB,KAAK,CAAEt0C,EAAG,IAAKhB,EAAG,CAAEgB,EA/OV,IA+O+BhB,EAAG,MACvDU,KAAKq2C,IAAMr2C,KAAKu2C,eAEhBv2C,KAAK+3C,wBAGCpC,sCAAR,SAAkC+B,GAEhC,IAAMC,EAAgBvmC,GAAW,IAAKsmC,GAChC9uC,EAAYwI,GAAW,IAAKsmC,GACrB,KAATC,EACF33C,KAAKg4C,WAAWpvC,GACE,KAAT+uC,GACT33C,KAAKi4C,eAAervC,IAIhB+sC,2BAAR,SAAuBpyC,GACrBvD,KAAKk4C,qBAGLl4C,KAAKurC,WAAWhoC,IAGVoyC,+BAAR,WACO31C,KAAKw2C,aACRx2C,KAAKg2C,4BACDh2C,KAAKg2C,2BAA6B,IACpCh2C,KAAKosC,KAAK,kCACVpsC,KAAKw2C,YAAa,EAClBx2C,KAAK81C,MAAMa,2BAKThB,uBAAR,SAAmB2B,GACjB,IAAMC,EAAcnmC,GA1RH,IA0R4BkmC,GAC7C,GA1RiB,MA0RGA,EAAa,CAC/B,IAAMa,EAAUb,EAAwB,EACxC,GAnRe,MAmRXC,EACFv3C,KAAKo4C,aAAaD,QACb,GAxRY,MAwRRZ,EAA0B,CACnCv3C,KAAKosC,KAAK,qCACVpsC,KAAKs2C,IAAMt2C,KAAKu2C,eAChB,IAAK,IAAI/1C,EAAI,EAAGA,EAAIR,KAAK63C,oBAAoBl3C,SAAUH,EACrDR,KAAKi4C,eAAej4C,KAAK63C,oBAAoBr3C,IAE/CR,KAAK63C,oBAAsB,GAC3B73C,KAAK+3C,2BApSY,MAqSRR,EAGTv3C,KAAKq4C,sBAAsBF,GAvSb,MAwSLZ,EAETv3C,KAAKs4C,SAASH,GAzSA,MA0SLZ,EACTz0C,GAAM,iBAAmBq1C,GA1SZ,MA2SJZ,GACTv3C,KAAKosC,KAAK,wBACVpsC,KAAKk4C,qBACLl4C,KAAKu4C,iCAELz1C,GAAM,mCAAqCy0C,KAUzC5B,yBAAR,SAAqB6C,GAMnB,IAAMC,EAAYD,EAAU5G,GACtB8G,EAAUF,EAAUz2C,EACpBiU,EAAOwiC,EAAUG,EACvB34C,KAAK44C,UAAYJ,EAAUj4C,EAC3BP,KAAKs1C,UAAUuD,WAAW7iC,MAEtBhW,KAAKg3C,SACPh3C,KAAK81C,MAAMxH,QACXtuC,KAAK84C,yBAAyB94C,KAAK81C,MAAO2C,G7D7WhB,M6D8WDC,GACvBjvC,GAAK,sCAGPzJ,KAAK+4C,qBAIDpD,6BAAR,WACE,IAAMC,EAAO51C,KAAKy1C,kBAAkBuD,mBAChCpD,GACF51C,KAAKi5C,cAAcrD,IAIfD,0BAAR,SAAsBC,GAAtB,WACE51C,KAAKu2C,eAAiB,IAAIX,EACxB51C,KAAK+1C,mBACL/1C,KAAKs1C,UACLt1C,KAAK44C,WAIP54C,KAAKy3C,4BACH7B,EAAmC,8BAAK,EAE1C,IAAMlJ,EAAY1sC,KAAKk2C,cAAcl2C,KAAKu2C,gBACpC5J,EAAe3sC,KAAKo2C,iBAAiBp2C,KAAKu2C,gBAChDv2C,KAAKu2C,eAAe5F,KAAKjE,EAAWC,GAGpCv5B,GAAsB,WAChB3L,EAAK8uC,iBACP9uC,EAAK2kC,KAAK,gCACV3kC,EAAK8uC,eAAerH,UAErBj9B,KAAKI,MApYY,OAuYdsjC,qBAAR,SAAiB3/B,GACfhW,KAAKosC,KAAK,qCAAuCp2B,GACjDhW,KAAKs1C,UAAUuD,WAAW7iC,OAGtBhW,KAAKg3C,OACPh3C,KAAKkvC,SAGLlvC,KAAKk5C,oBACLl5C,KAAK01C,WAIDC,qCAAR,SAAiCC,EAAiB6C,GAAlD,WACEz4C,KAAKosC,KAAK,oCACVpsC,KAAK81C,MAAQF,EACb51C,KAAKg3C,SAEDh3C,KAAKu1C,WACPv1C,KAAKu1C,SAASkD,EAAWz4C,KAAK44C,WAC9B54C,KAAKu1C,SAAW,MAKqB,IAAnCv1C,KAAKg2C,2BACPh2C,KAAKosC,KAAK,kCACVpsC,KAAKw2C,YAAa,GAElBpjC,GAAsB,WACpB3L,EAAK8wC,iCACJtmC,KAAKI,MAna8B,OAualCsjC,0CAAR,WAEO31C,KAAKw2C,gBAAcx2C,KAAKg3C,SAC3Bh3C,KAAKosC,KAAK,4BACVpsC,KAAKq3C,UAAU,CAAE/2C,EAAG,IAAKhB,EAAG,CAAEgB,EArZvB,IAqZgChB,EAAG,QAItCq2C,uCAAR,WACE,IAAMC,EAAO51C,KAAKu2C,eAClBv2C,KAAKu2C,eAAiB,KAClBv2C,KAAKq2C,MAAQT,GAAQ51C,KAAKs2C,MAAQV,GAEpC51C,KAAKkvC,SAUDyG,8BAAR,SAA0BkB,GACxB72C,KAAK81C,MAAQ,KAIRe,OAAiB72C,KAAKg3C,WAQhBh3C,KAAKg3C,QACdh3C,KAAKosC,KAAK,8BARVpsC,KAAKosC,KAAK,+BAENpsC,KAAKs1C,UAAU3+B,oBACjBxH,EAAkBiB,OAAO,QAAUpQ,KAAKs1C,UAAUt/B,MAElDhW,KAAKs1C,UAAU/+B,aAAevW,KAAKs1C,UAAUt/B,OAMjDhW,KAAKkvC,SAQCyG,kCAAR,SAA8BjP,GAC5B1mC,KAAKosC,KAAK,0DAENpsC,KAAKw1C,UACPx1C,KAAKw1C,QAAQ9O,GACb1mC,KAAKw1C,QAAU,MAKjBx1C,KAAK6sC,cAAgB,KAErB7sC,KAAKkvC,SAGCyG,sBAAR,SAAkB/sC,GAChB,OAAI5I,KAAKg3C,OACP,KAAM,8BAENh3C,KAAKq2C,IAAIzB,KAAKhsC,IAOlB+sC,kBAAA,eACM31C,KAAKg3C,SACPh3C,KAAKosC,KAAK,gCACVpsC,KAAKg3C,SAELh3C,KAAKk5C,oBAEDl5C,KAAK6sC,gBACP7sC,KAAK6sC,gBACL7sC,KAAK6sC,cAAgB,QASnB8I,8BAAR,WACE31C,KAAKosC,KAAK,iCACNpsC,KAAK81C,QACP91C,KAAK81C,MAAM5G,QACXlvC,KAAK81C,MAAQ,MAGX91C,KAAKu2C,iBACPv2C,KAAKu2C,eAAerH,QACpBlvC,KAAKu2C,eAAiB,MAGpBv2C,KAAK02C,kBACP5I,aAAa9tC,KAAK02C,iBAClB12C,KAAK02C,gBAAkB,0BC3hB7B,cAyFA,OA7DEyC,gBAAA,SACEtlC,EACAjL,EACA+R,EACA6K,KASF2zB,kBAAA,SACEtlC,EACAjL,EACA+R,EACA6K,KAOF2zB,6BAAA,SAAiBpvC,KAOjBovC,4BAAA,SACEtlC,EACAjL,EACA+R,KAQFw+B,8BAAA,SACEtlC,EACAjL,EACA+R,KAOFw+B,+BAAA,SACEtlC,EACA8G,KAMFw+B,wBAAA,SAAYhQ,yBCYZ,WACUmM,EACA8D,EAMAC,EACAC,EACAC,EACAC,GAXV,MAaErxC,mBAEA,GAdQV,YAAA6tC,EACA7tC,gBAAA2xC,EAMA3xC,mBAAA4xC,EACA5xC,sBAAA6xC,EACA7xC,qBAAA8xC,EACA9xC,gBAAA+xC,EA9DV/xC,KAAKgyC,EAAqBC,8BAClBjyC,OAAO6I,GAAW,KAAO7I,EAAKwF,GAAK,KAEnCxF,oBAAmD,GAE1CA,UAGb,IAAI4mB,IACA5mB,mBAAqC,GACrCA,uBAAuB,EACvBA,4BAAmD,GACnDA,cAAa,EACbA,kBAtDkB,IAuDlBA,qBAtD0B,IAuD1BA,yBAAuD,KAC/DA,gBAA+B,KAEvBA,4BAA2C,KAE3CA,YAAoB,EAGpBA,iBAAoD,GACpDA,iBAAiB,EAEjBA,YAGG,KAEHA,aAA4B,KAC5BA,sBAAqB,EACrBA,yBAAyB,EAEzBA,oBAAmB,EACnBA,6BAA4C,KAC5CA,iCAAgD,KA6BlD+xC,IAAkBvxC,IACpB,MAAM,IAAIxE,MACR,yFAGJgE,EAAKkyC,iBAAiB,GAEtBvO,GAAkBwO,cAAc5sB,GAAG,UAAWvlB,EAAKoyC,WAAYpyC,IAEpB,IAAvC6tC,EAAUt/B,KAAKM,QAAQ,YACzBg1B,GAAcsO,cAAc5sB,GAAG,SAAUvlB,EAAKqyC,UAAWryC,KAuxB/D,OAr2B0Cc,OAkF9BkxC,wBAAV,SACE77B,EACA5c,EACA+4C,GAEA,IAAMC,IAAch6C,KAAKi6C,eAEnB7C,EAAM,CAAEx0C,EAAGo3C,EAAWvuC,EAAGmS,EAAQre,EAAGyB,GAC1ChB,KAAKosC,KAAKviC,EAAUutC,IACpB/zC,EACErD,KAAKk6C,WACL,0DAEFl6C,KAAKm6C,UAAUC,YAAYhD,GACvB2C,IACF/5C,KAAKq6C,eAAeL,GAAaD,IAOrCN,mBAAA,SACE7vB,EACA0wB,EACAzX,EACAloB,GAEA,IAAMoV,EAAUnG,EAAMuE,kBAChBta,EAAa+V,EAAM3U,KAAK9L,WAC9BnJ,KAAKosC,KAAK,qBAAuBv4B,EAAa,IAAMkc,GAC/C/vB,KAAKu6C,QAAQ7rB,IAAI7a,IACpB7T,KAAKu6C,QAAQpqC,IAAI0D,EAAY,IAAIwa,KAEnChrB,EACEumB,EAAMC,iBAAiBqc,cACpBtc,EAAMC,iBAAiBwS,eAC1B,sDAEFh5B,GACGrD,KAAKu6C,QAAQlqC,IAAIwD,GAAa6a,IAAIqB,GACnC,gDAEF,IAAMyqB,EAAyB,CAC7B7/B,WAAYA,EACZuqB,OAAQoV,EACR1wB,MAAOA,EACPiZ,IAAKA,GAEP7iC,KAAKu6C,QAAQlqC,IAAIwD,GAAa1D,IAAI4f,EAASyqB,GAEvCx6C,KAAKk6C,YACPl6C,KAAKy6C,YAAYD,IAIbf,wBAAR,SAAoBe,GAApB,WACQ5wB,EAAQ4wB,EAAW5wB,MACnB/V,EAAa+V,EAAM3U,KAAK9L,WACxB4mB,EAAUnG,EAAMuE,kBACtBnuB,KAAKosC,KAAK,aAAev4B,EAAa,QAAUkc,GAChD,IAAM2qB,EAA4B,CAAW96C,EAAGiU,GAK5C2mC,EAAW3X,MACb6X,EAAO,EAAI9wB,EAAMmE,cACjB2sB,EAAO,EAAIF,EAAW3X,KAGxB6X,EAAgB,EAAIF,EAAWtV,SAE/BllC,KAAKo6C,YAVU,IAUUM,EAAK,SAACn3C,GAC7B,IAAM40C,EAAe50C,EAAoB,EACnCgjC,EAAiBhjC,EAAsB,EAG7Ck2C,EAAqBkB,sBAAsBxC,EAASvuB,IAGlDniB,EAAK8yC,QAAQlqC,IAAIwD,IACjBpM,EAAK8yC,QAAQlqC,IAAIwD,GAAaxD,IAAI0f,MAEVyqB,IACxB/yC,EAAK2kC,KAAK,kBAAmB7oC,GAEd,OAAXgjC,GACF9+B,EAAKmzC,cAAc/mC,EAAYkc,GAG7ByqB,EAAW7/B,YACb6/B,EAAW7/B,WAAW4rB,EAAQ4R,OAMvBsB,wBAAf,SAAqCtB,EAAcvuB,GACjD,GAAIuuB,GAA8B,iBAAZA,GAAwB9tC,EAAS8tC,EAAS,KAAM,CACpE,IAAM0C,EAAWtwC,EAAQ4tC,EAAS,KAClC,GAAIx4C,MAAMyE,QAAQy2C,KAAcA,EAASvkC,QAAQ,YAAa,CAC5D,IAAMwkC,EACJ,gBACAlxB,EACGC,iBACAC,WACA3gB,WACH,IACI4xC,EAAYnxB,EAAM3U,KAAK9L,WAC7BM,GACE,wGAC6CqxC,SACxCC,wDASbtB,6BAAA,SAAiB1vC,GACf/J,KAAKg7C,WAAajxC,EAClB/J,KAAKosC,KAAK,wBACNpsC,KAAKg7C,WACPh7C,KAAKi7C,UAIDj7C,KAAKk6C,YACPl6C,KAAKo6C,YAAY,SAAU,GAAI,cAInCp6C,KAAKk7C,uCAAuCnxC,IAGtC0vC,mDAAR,SAA+C0B,GAG7C,I1ExJIlxC,G0EwJqBkxC,GAAoC,KAAtBA,EAAWx6C,Q1EvJ3B,iBADnBsJ,EAAiBH,E0EyJWqxC,G1EzJGlxC,UACoB,IAApBA,EAAc,S0EyJ/CjK,KAAKosC,KACH,iEAEFpsC,KAAKo7C,mBAzQ4B,MAiRrC3B,oBAAA,WAAA,I1ElLExvC,S0EmLA,GAAIjK,KAAKk6C,YAAcl6C,KAAKg7C,WAAY,CACtC,IAAMK,EAAQr7C,KAAKg7C,WACbM,G1ErLRrxC,EADcH,E0EsLqBuxC,G1ErLlBpxC,SAEkB,iBAAXA,GAAuBA,EAAOpK,eAAe,O0EmLzB,OAAS,QAC7C07C,EAAoC,CAAEC,KAAMH,GACvB,OAAvBr7C,KAAKw5C,cACP+B,EAAoB,QAAI,EACe,iBAAvBv7C,KAAKw5C,gBACrB+B,EAAqB,QAAIv7C,KAAKw5C,eAEhCx5C,KAAKo6C,YAAYkB,EAAYC,EAAa,SAAC3wC,GACzC,IAAM27B,EAAiB37B,EAAkB,EACnChC,EAAegC,EAAgB,GAAK,QAEtCnD,EAAKuzC,aAAeK,IACP,OAAX9U,EACF9+B,EAAKg0C,uBAAyB,EAG9Bh0C,EAAKi0C,eAAenV,EAAQ39B,QAUtC6wC,qBAAA,SAAS7vB,EAAciZ,GACrB,IAAMhvB,EAAa+V,EAAM3U,KAAK9L,WACxB4mB,EAAUnG,EAAMuE,kBAEtBnuB,KAAKosC,KAAK,uBAAyBv4B,EAAa,IAAMkc,GAEtD1sB,EACEumB,EAAMC,iBAAiBqc,cACpBtc,EAAMC,iBAAiBwS,eAC1B,wDAEar8B,KAAK46C,cAAc/mC,EAAYkc,IAChC/vB,KAAKk6C,YACjBl6C,KAAK27C,cAAc9nC,EAAYkc,EAASnG,EAAMmE,cAAe8U,IAIzD4W,0BAAR,SACE5lC,EACAkc,EACA6rB,EACA/Y,GAEA7iC,KAAKosC,KAAK,eAAiBv4B,EAAa,QAAUkc,GAElD,IAAM2qB,EAA4B,CAAW96C,EAAGiU,GAG5CgvB,IACF6X,EAAO,EAAIkB,EACXlB,EAAO,EAAI7X,GAGb7iC,KAAKo6C,YAPU,IAOUM,IAM3BjB,4BAAA,SACE5lC,EACAjL,EACA+R,GAEI3a,KAAKk6C,WACPl6C,KAAK67C,kBAAkB,IAAKhoC,EAAYjL,EAAM+R,GAE9C3a,KAAK87C,0BAA0Bz5C,KAAK,CAClCwR,aACA+J,OAAQ,IACRhV,OACA+R,gBAQN8+B,8BAAA,SACE5lC,EACAjL,EACA+R,GAEI3a,KAAKk6C,WACPl6C,KAAK67C,kBAAkB,KAAMhoC,EAAYjL,EAAM+R,GAE/C3a,KAAK87C,0BAA0Bz5C,KAAK,CAClCwR,aACA+J,OAAQ,KACRhV,OACA+R,gBAQN8+B,+BAAA,SACE5lC,EACA8G,GAEI3a,KAAKk6C,WACPl6C,KAAK67C,kBAAkB,KAAMhoC,EAAY,KAAM8G,GAE/C3a,KAAK87C,0BAA0Bz5C,KAAK,CAClCwR,aACA+J,OAAQ,KACRhV,KAAM,KACN+R,gBAKE8+B,8BAAR,SACE77B,EACA/J,EACAjL,EACA+R,GAEA,IAAMohC,EAAU,CAAWn8C,EAAGiU,EAAqBvU,EAAGsJ,GACtD5I,KAAKosC,KAAK,gBAAkBxuB,EAAQm+B,GACpC/7C,KAAKo6C,YAAYx8B,EAAQm+B,EAAS,SAACC,GAC7BrhC,GACFzH,WAAW,WACTyH,EAAWqhC,EAAuB,EAAGA,EAAuB,IAC3D/pC,KAAKI,MAAM,OAQpBonC,gBAAA,SACE5lC,EACAjL,EACA+R,EACA6K,GAEAxlB,KAAKi8C,YAAY,IAAKpoC,EAAYjL,EAAM+R,EAAY6K,IAMtDi0B,kBAAA,SACE5lC,EACAjL,EACA+R,EACA6K,GAEAxlB,KAAKi8C,YAAY,IAAKpoC,EAAYjL,EAAM+R,EAAY6K,IAGtDi0B,wBAAA,SACE77B,EACA/J,EACAjL,EACA+R,EACA6K,GAEA,IAAMu2B,EAAgC,CAC3Bn8C,EAAGiU,EACHvU,EAAGsJ,QAGDzB,IAATqe,IAAoBu2B,EAAoB,EAAIv2B,GAGhDxlB,KAAKk8C,iBAAiB75C,KAAK,CACzBub,SACAm+B,UACAphC,eAGF3a,KAAKm8C,uBACL,IAAMx+B,EAAQ3d,KAAKk8C,iBAAiBv7C,OAAS,EAEzCX,KAAKk6C,WACPl6C,KAAKo8C,SAASz+B,GAEd3d,KAAKosC,KAAK,kBAAoBv4B,IAI1B4lC,qBAAR,SAAiB97B,GAAjB,WACQC,EAAS5d,KAAKk8C,iBAAiBv+B,GAAOC,OACtCm+B,EAAU/7C,KAAKk8C,iBAAiBv+B,GAAOo+B,QACvCphC,EAAa3a,KAAKk8C,iBAAiBv+B,GAAOhD,WAChD3a,KAAKk8C,iBAAiBv+B,GAAO0+B,OAASr8C,KAAKk6C,WAE3Cl6C,KAAKo6C,YAAYx8B,EAAQm+B,EAAS,SAACx4C,GACjCkE,EAAK2kC,KAAKxuB,EAAS,YAAara,UAEzBkE,EAAKy0C,iBAAiBv+B,GAC7BlW,EAAK00C,uBAG6B,IAA9B10C,EAAK00C,uBACP10C,EAAKy0C,iBAAmB,IAGtBvhC,GACFA,EAAWpX,EAAsB,EAAGA,EAAsB,MAOhEk2C,wBAAA,SAAYtQ,GAAZ,WAEE,GAAInpC,KAAKk6C,WAAY,CACnB,IAAM6B,EAAU,CAAel4C,EAAGslC,GAClCnpC,KAAKosC,KAAK,cAAe2P,GAEzB/7C,KAAKo6C,YAAsB,IAAK2B,EAAS,SAAAv8B,GAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,IAAM88B,EAAc98B,EAAqB,EACzC/X,EAAK2kC,KAAK,cAAe,wBAA0BkQ,QAMnD7C,2BAAR,SAAuBl2C,GACrB,GAAI,MAAOA,EAAS,CAElBvD,KAAKosC,KAAK,gBAAkBviC,EAAUtG,IACtC,IAAMg5C,EAASh5C,EAAW,EACpBw2C,EAAa/5C,KAAKq6C,eAAekC,GACnCxC,WACK/5C,KAAKq6C,eAAekC,GAC3BxC,EAAWx2C,EAAoB,QAE5B,CAAA,GAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhBvD,KAAKw8C,YAAYj5C,EAAW,EAAGA,EAAW,KAItCk2C,wBAAR,SAAoB77B,EAAgB5c,GAClChB,KAAKosC,KAAK,sBAAuBxuB,EAAQ5c,GAC1B,MAAX4c,EACF5d,KAAKo5C,cACHp4C,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEQ,MAAX4c,EACP5d,KAAKo5C,cACHp4C,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEQ,MAAX4c,EACP5d,KAAKy8C,iBAAiBz7C,EAAiB,EAAGA,EAAkB,GAC1C,OAAX4c,EACP5d,KAAK07C,eACH16C,EAAwB,EACxBA,EAA0B,GAEV,OAAX4c,EAAiB5d,KAAK08C,uBAAuB17C,GAEpD8B,GACE,6CACE+G,EAAU+T,GACV,uCAIA67B,qBAAR,SAAiBhB,EAAmBG,GAClC54C,KAAKosC,KAAK,oBACVpsC,KAAKk6C,YAAa,EAClBl6C,KAAK28C,gCAAiC,IAAI31C,MAAOE,UACjDlH,KAAK48C,iBAAiBnE,GACtBz4C,KAAKmsC,cAAgByM,EACjB54C,KAAK68C,kBACP78C,KAAK88C,oBAEP98C,KAAK+8C,gBACL/8C,KAAK68C,kBAAmB,EACxB78C,KAAKq5C,kBAAiB,IAGhBI,6BAAR,SAAyBnmC,GAAzB,WACEjQ,GACGrD,KAAKm6C,UACN,0DAGEn6C,KAAKg9C,2BACPlP,aAAa9tC,KAAKg9C,2BAMpBh9C,KAAKg9C,0BAA4B9pC,WAAW,WAC1CzL,EAAKu1C,0BAA4B,KACjCv1C,EAAKw1C,wBACJhrC,KAAKI,MAAMiB,KAGRmmC,uBAAR,SAAmBja,GAGfA,IACCx/B,KAAKkrC,UACNlrC,KAAKk9C,kBAAoBl9C,KAAKo7C,qBAE9Bp7C,KAAKosC,KAAK,2CACVpsC,KAAKk9C,gBA3lBiB,IA6lBjBl9C,KAAKm6C,WACRn6C,KAAK25C,iBAAiB,IAG1B35C,KAAKkrC,SAAW1L,GAGVia,sBAAR,SAAkB0D,GACZA,GACFn9C,KAAKosC,KAAK,wBACVpsC,KAAKk9C,gBAvmBiB,IAwmBjBl9C,KAAKm6C,WACRn6C,KAAK25C,iBAAiB,KAGxB35C,KAAKosC,KAAK,8CACNpsC,KAAKm6C,WACPn6C,KAAKm6C,UAAUjL,UAKbuK,kCAAR,WAWE,GAVAz5C,KAAKosC,KAAK,4BACVpsC,KAAKk6C,YAAa,EAClBl6C,KAAKm6C,UAAY,KAGjBn6C,KAAKo9C,0BAGLp9C,KAAKq6C,eAAiB,GAElBr6C,KAAKq9C,mBAAoB,CAC3B,GAAKr9C,KAAKkrC,UAIH,GAAIlrC,KAAK28C,+BAAgC,CA/nBhB,KAkoB5B,IAAI31C,MAAOE,UAAYlH,KAAK28C,iCAE5B38C,KAAKk9C,gBAxoBa,KAyoBpBl9C,KAAK28C,+BAAiC,WATtC38C,KAAKosC,KAAK,8CACVpsC,KAAKk9C,gBAAkBl9C,KAAKo7C,mBAC5Bp7C,KAAKs9C,4BAA6B,IAAIt2C,MAAOE,UAU/C,IAAMq2C,GACJ,IAAIv2C,MAAOE,UAAYlH,KAAKs9C,2BAC1BE,EAAiBvrC,KAAKoD,IACxB,EACArV,KAAKk9C,gBAAkBK,GAEzBC,EAAiBvrC,KAAK0J,SAAW6hC,EAEjCx9C,KAAKosC,KAAK,0BAA4BoR,EAAiB,MACvDx9C,KAAK25C,iBAAiB6D,GAGtBx9C,KAAKk9C,gBAAkBjrC,KAAKG,IAC1BpS,KAAKo7C,mBAtpBsB,IAupB3Bp7C,KAAKk9C,iBAGTl9C,KAAKq5C,kBAAiB,IAGhBI,iCAAR,WACE,GAAIz5C,KAAKq9C,mBAAoB,CAC3Br9C,KAAKosC,KAAK,+BACVpsC,KAAKs9C,4BAA6B,IAAIt2C,MAAOE,UAC7ClH,KAAK28C,+BAAiC,KACtC,IAAMc,EAAgBz9C,KAAKi4C,eAAe/nC,KAAKlQ,MACzC09C,EAAU19C,KAAKu1C,SAASrlC,KAAKlQ,MAC7B29C,EAAe39C,KAAK49C,sBAAsB1tC,KAAKlQ,MAC/C69C,EAAS79C,KAAKiN,GAAK,IAAMwsC,EAAqBqE,oBAC9ChvB,EAAO9uB,KACP+9C,EAAgB/9C,KAAKmsC,cACvB6R,GAAW,EACXC,EAAgC,KAC9BC,EAAU,WACVD,EACFA,EAAW/O,SAEX8O,GAAW,EACXL,MAWJ39C,KAAKm6C,UAAY,CACfjL,MAAOgP,EACP9D,YAVoB,SAAShD,GAC7B/zC,EACE46C,EACA,0DAEFA,EAAW7D,YAAYhD,KAQzB,IAAMzP,EAAe3nC,KAAKm+C,mBAC1Bn+C,KAAKm+C,oBAAqB,EAG1Bn+C,KAAKu5C,mBACF6E,SAASzW,GACTC,KAAK,SAASpoB,GACRw+B,EAgBHnwC,GAAI,0CAfJA,GAAI,8CACJihB,EAAKksB,WAAax7B,GAAUA,EAAO6+B,YACnCJ,EAAa,IAAItI,GACfkI,EACA/uB,EAAKwmB,UACLmI,EACAC,EACAC,EACc,SAASjX,GACrBj9B,GAAKi9B,EAAS,KAAO5X,EAAKwmB,UAAUnsC,WAAa,KACjD2lB,EAAKwvB,UA/sBgB,gBAitBvBP,MAMLnW,KAAK,KAAM,SAAS9kC,GACnBgsB,EAAKsd,KAAK,wBAA0BtpC,GAC/Bk7C,GAOHE,QAMVzE,sBAAA,SAAU/S,GACR74B,GAAI,uCAAyC64B,GAC7C1mC,KAAKu+C,kBAAkB7X,IAAU,EAC7B1mC,KAAKm6C,UACPn6C,KAAKm6C,UAAUjL,SAEXlvC,KAAKg9C,4BACPlP,aAAa9tC,KAAKg9C,2BAClBh9C,KAAKg9C,0BAA4B,MAE/Bh9C,KAAKk6C,YACPl6C,KAAK49C,0BAKXnE,mBAAA,SAAO/S,GACL74B,GAAI,mCAAqC64B,UAClC1mC,KAAKu+C,kBAAkB7X,GAC1Bl8B,EAAQxK,KAAKu+C,qBACfv+C,KAAKk9C,gBA/vBiB,IAgwBjBl9C,KAAKm6C,WACRn6C,KAAK25C,iBAAiB,KAKpBF,6BAAR,SAAyBhB,GACvB,IAAM/P,EAAQ+P,GAAY,IAAIzxC,MAAOE,UACrClH,KAAKs5C,oBAAoB,CAAEkF,iBAAkB9V,KAGvC+Q,oCAAR,WACE,IAAK,IAAIj5C,EAAI,EAAGA,EAAIR,KAAKk8C,iBAAiBv7C,OAAQH,IAAK,CACrD,IAAMi+C,EAAMz+C,KAAKk8C,iBAAiB17C,GAC9Bi+C,GAAgB,MAAOA,EAAI1C,SAAW0C,EAAIpC,SACxCoC,EAAI9jC,YAAY8jC,EAAI9jC,WAAW,qBAE5B3a,KAAKk8C,iBAAiB17C,GAC7BR,KAAKm8C,wBAKyB,IAA9Bn8C,KAAKm8C,uBAA4Bn8C,KAAKk8C,iBAAmB,KAGvDzC,6BAAR,SAAyB5lC,EAAoB+V,GAE3C,IAAImG,EAIFA,EAHGnG,EAGOA,EAAMnf,IAAI,SAAAi0C,GAAK,OAAArtC,GAAkBqtC,KAAIv5C,KAAK,KAF1C,UAIZ,IAAMw5C,EAAS3+C,KAAK46C,cAAc/mC,EAAYkc,GAC1C4uB,GAAUA,EAAOhkC,YAAYgkC,EAAOhkC,WAAW,sBAG7C8+B,0BAAR,SAAsB5lC,EAAoBkc,GACxC,IACI4uB,EADEC,EAAuB,IAAIhrC,GAAKC,GAAY1K,WAElD,GAAInJ,KAAKu6C,QAAQ7rB,IAAIkwB,GAAuB,CAC1C,IAAMn0C,EAAMzK,KAAKu6C,QAAQlqC,IAAIuuC,GAC7BD,EAASl0C,EAAI4F,IAAI0f,GACjBtlB,EAAIwkB,OAAOc,GACM,IAAbtlB,EAAI+jB,MACNxuB,KAAKu6C,QAAQtrB,OAAO2vB,QAItBD,OAASx3C,EAEX,OAAOw3C,GAGDlF,2BAAR,SAAuBoF,EAAoBC,GACzCjxC,GAAI,uBAAyBgxC,EAAa,IAAMC,GAChD9+C,KAAKg7C,WAAa,KAClBh7C,KAAKm+C,oBAAqB,EAC1Bn+C,KAAKm6C,UAAUjL,QACI,kBAAf2P,GAAiD,sBAAfA,IAIpC7+C,KAAKy7C,yBAxzB0B,GAyzB3Bz7C,KAAKy7C,yBAEPz7C,KAAKk9C,gBAj0B0B,IAq0B/Bl9C,KAAKu5C,mBAAmBwF,2BAKtBtF,mCAAR,SAA+Bz4C,GACzBhB,KAAKg/C,uBACPh/C,KAAKg/C,uBAAuBh+C,GAExB,QAASA,GACX2F,QAAQkH,IAAI,aAAe7M,EAAU,IAAEgI,QAAQ,KAAM,kBAKnDywC,0BAAR,uBAEEz5C,KAAKi7C,cAIL,IAAsB,IAAAgE,EAAA31C,EAAAtJ,KAAKu6C,QAAQ9lB,wCAAU,CAAxC,IAAMqR,cACT,IAAyB,IAAAoZ,EAAA51C,EAAAw8B,EAAQrR,wCAAU,CAAtC,IAAM+lB,UACTx6C,KAAKy6C,YAAYD,wMAIrB,IAAK,IAAIh6C,EAAI,EAAGA,EAAIR,KAAKk8C,iBAAiBv7C,OAAQH,IAC5CR,KAAKk8C,iBAAiB17C,IAAIR,KAAKo8C,SAAS57C,GAG9C,KAAOR,KAAK87C,0BAA0Bn7C,QAAQ,CAC5C,IAAMo7C,EAAU/7C,KAAK87C,0BAA0BpK,QAC/C1xC,KAAK67C,kBACHE,EAAQn+B,OACRm+B,EAAQloC,WACRkoC,EAAQnzC,KACRmzC,EAAQphC,cAQN8+B,8BAAR,WACE,IAAMtQ,EAAiC,GASvCA,EAAM,UAA4B/lC,GAAY4F,QAAQ,MAAO,MAAQ,EAEjEnB,IACFshC,EAAM,qBAAuB,E7Ej1BV,iBAAdnhC,WAAmD,gBAAzBA,UAAmB,U6Em1BlDmhC,EAAM,yBAA2B,GAEnCnpC,KAAKspC,YAAYH,IAGXsQ,6BAAR,WACE,IAAM0D,EAAS7R,GAAcsO,cAAcuF,kBAC3C,OAAO30C,EAAQxK,KAAKu+C,oBAAsBpB,GA1zB7B1D,8BAA8B,EAK9BA,oBAAoB,KA9CKN,mBCAxC,WACU7D,EACA8D,EAMAG,GARV,MAUEpxC,0BATQV,YAAA6tC,EACA7tC,gBAAA2xC,EAMA3xC,qBAAA8xC,EA1CF9xC,OAAiC6I,GAAW,WAQ5C7I,WAAoC,KAkL9C,OAhMwCc,OACtC62C,wBAAA,SAAYjW,GACV,MAAM,IAAI1lC,MAAM,4BAoBX27C,eAAP,SAAoBx1B,EAAciZ,GAChC,YAAY17B,IAAR07B,EACK,OAASA,GAEhBx/B,EACEumB,EAAMC,iBAAiBqc,YACvB,kDAEKtc,EAAM3U,KAAK9L,aAwBtBi2C,mBAAA,SACEx1B,EACA0wB,EACAzX,EACAloB,GAJF,WAMQ9G,EAAa+V,EAAM3U,KAAK9L,WAC9BnJ,KAAKosC,KACH,qBAAuBv4B,EAAa,IAAM+V,EAAMuE,mBAIlD,IAAMkxB,EAAWD,EAAmBE,aAAa11B,EAAOiZ,GAClD0c,EAAa,GACnBv/C,KAAKw/C,SAASH,GAAYE,EAE1B,IAAME,EAAwB71B,EAC3BC,iBACA61B,8BAEH1/C,KAAK2/C,aACH9rC,EAAa,QACb4rC,EACA,SAAC38C,EAAO0c,GACN,IAAI5W,EAAO4W,GAEG,MAAV1c,IAEFA,EADA8F,EAAO,MAIK,OAAV9F,GACF2E,EAAK2xC,cAAcvlC,EAAYjL,GAAmB,EAAOi6B,GAGvDt4B,EAAQ9C,EAAK+3C,SAAUH,KAAcE,IAUvC5kC,EARK7X,EAEe,KAATA,EACA,oBAEA,cAAgBA,EAJhB,KAOQ,SAO3Bs8C,qBAAA,SAASx1B,EAAciZ,GACrB,IAAMwc,EAAWD,EAAmBE,aAAa11B,EAAOiZ,UACjD7iC,KAAKw/C,SAASH,IAIvBD,6BAAA,SAAiBr1C,KAaTq1C,yBAAR,SACEvrC,EACA4rC,EACA93C,GAHF,wBAEE83C,MAGAA,EAA8B,OAAI,SAElCz/C,KAAKu5C,mBACF6E,UAA2B,GAC3BxW,KAAK,SAAAgY,GACJ,IAAMC,EAAYD,GAAiBA,EAAcvB,YAC7CwB,IACFJ,EAA4B,KAAII,GAGlC,IAAM7N,GACHvqC,EAAK6tC,UAAUr/B,OAAS,WAAa,WACtCxO,EAAK6tC,UAAUt/B,KACfnC,EACA,OAEApM,EAAK6tC,UAAUp/B,UC5JzB,SAA4B4pC,WAGpBjpC,EAAS,cACH3N,EAAK/G,GACXxC,MAAMyE,QAAQjC,GAChBA,EAAMktB,QAAQ,SAAA0wB,GACZlpC,EAAOxU,KACLyR,mBAAmB5K,GAAO,IAAM4K,mBAAmBisC,MAIvDlpC,EAAOxU,KAAKyR,mBAAmB5K,GAAO,IAAM4K,mBAAmB3R,SARnE,IAA2B,IAAAkH,EAAAC,EAAA9J,OAAOw+B,QAAQ8hB,mCAA/B,IAAA7hB,8HAWX,OAAOpnB,EAAOlW,OAAS,IAAMkW,EAAO1R,KAAK,KAAO,GD8IxC66C,CAAYP,GAEdh4C,EAAK2kC,KAAK,4BAA8B4F,GACxC,IAAMiO,EAAM,IAAIC,eAChBD,EAAIzN,mBAAqB,WACvB,GAAI7qC,GAA+B,IAAnBs4C,EAAI/S,WAAkB,CACpCzlC,EAAK2kC,KACH,qBAAuB4F,EAAM,qBAC7BiO,EAAI1Z,OACJ,YACA0Z,EAAIE,cAEN,IAAIv1C,EAAM,KACV,GAAkB,KAAdq1C,EAAI1Z,QAAiB0Z,EAAI1Z,OAAS,IAAK,CACzC,IACE37B,EAAMlB,EAASu2C,EAAIE,cACnB,MAAO79C,GACPmH,GACE,qCACEuoC,EACA,KACAiO,EAAIE,cAGVx4C,EAAS,KAAMiD,QAGI,MAAfq1C,EAAI1Z,QAAiC,MAAf0Z,EAAI1Z,QAC5B98B,GACE,sCACEuoC,EACA,YACAiO,EAAI1Z,QAGV5+B,EAASs4C,EAAI1Z,QAEf5+B,EAAW,OAIfs4C,EAAItP,KAAK,MAAOqB,GAAuB,GACvCiO,EAAIrL,aA7L4BuE,IEelCiH,GAAmB,+BA+BvB,WACS9K,EACP+K,EACOC,GAHT,WACStgD,eAAAs1C,EAEAt1C,SAAAsgD,EA5BTtgD,qBAAkB,EAKVA,oBAAuC,KACvCA,iBAAc,IAAIupC,GAClBvpC,kBAAe,EAOfA,kCAEG,KAIHA,mBAAgB,IAAIsuB,GAG5BtuB,2BAAqD,KAOnD,IAAMugD,EAAoB,IAAI7Y,GAAkB4Y,GAIhD,GAFAtgD,KAAKqsC,OAASnE,GAAaoE,cAAcgJ,GAErC+K,GvEyhBC,IAZc,iBAAXv4C,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOU04C,OACR,4FuEvhBAxgD,KAAK8oC,QAAU,IAAIsW,GACjBp/C,KAAKs1C,UACLt1C,KAAKo5C,cAAclpC,KAAKlQ,MACxBugD,GAIFrtC,WAAWlT,KAAKq5C,iBAAiBnpC,KAAKlQ,MAAM,GAAO,OAC9C,CACL,IAAMygD,EAAeH,EAAIxY,QAAsC,6BAE/D,GAAI,MAAO2Y,EAAuD,CAChE,GAA4B,iBAAjBA,EACT,MAAM,IAAIh9C,MACR,sEAGJ,IACEoG,EAAU42C,GACV,MAAOn+C,GACP,MAAM,IAAImB,MAAM,kCAAoCnB,IAIxDtC,KAAK0gD,sBAAwB,IAAIjH,GAC/Bz5C,KAAKs1C,UACLt1C,KAAKo5C,cAAclpC,KAAKlQ,MACxBA,KAAKq5C,iBAAiBnpC,KAAKlQ,MAC3BA,KAAKs5C,oBAAoBppC,KAAKlQ,MAC9BugD,EACAE,GAGFzgD,KAAK8oC,QAAU9oC,KAAK0gD,sBAGtBH,EAAkBI,uBAAuB,SAAA52C,GACvCtC,EAAKqhC,QAAQ8X,iBAAiB72C,KAKhC/J,KAAK6gD,eAAiB3Y,GAAa4Y,oBACjCxL,EACA,WAAM,OAAA,IAAIrM,GAAcxhC,EAAK4kC,OAAQ5kC,EAAKqhC,WAG5C9oC,KAAK+gD,qBAGL/gD,KAAKghD,UAAY,IAAI1Z,GACrBtnC,KAAKihD,cAAgB,IAAI/e,GAAS,CAChC6C,eAAgB,SAACnb,EAAOiZ,EAAKyX,EAAe3/B,GAC1C,IAAIumC,EAAsB,GACpBtlC,EAAOnU,EAAKu5C,UAAUluB,QAAQlJ,EAAM3U,MAY1C,OATK2G,EAAKpR,YACR02C,EAAaz5C,EAAKw5C,cAAcE,qBAC9Bv3B,EAAM3U,KACN2G,GAEF1I,WAAW,WACTyH,EAAW,OACV,IAEEumC,GAET/b,cAAe,eAEjBnlC,KAAKohD,YAAY,aAAa,GAE9BphD,KAAKqhD,gBAAkB,IAAInf,GAAS,CAClC6C,eAAgB,SAACnb,EAAOiZ,EAAKyX,EAAe3/B,GAM1C,OALAlT,EAAKqhC,QAAQ6V,OAAO/0B,EAAO0wB,EAAezX,EAAK,SAAC0D,EAAQ39B,GACtD,IAAM+xB,EAAShgB,EAAW4rB,EAAQ39B,GAClCnB,EAAK65C,YAAYC,0BAA0B33B,EAAM3U,KAAM0lB,KAGlD,IAETwK,cAAe,SAACvb,EAAOiZ,GACrBp7B,EAAKqhC,QAAQ0Y,SAAS53B,EAAOiZ,MAqcrC,OA7bE4e,qBAAA,WACE,OACGzhD,KAAKs1C,UAAUr/B,OAAS,WAAa,WAAajW,KAAKs1C,UAAUt/B,MAOtEyrC,iBAAA,WACE,OAAOzhD,KAAKs1C,UAAUp/B,WAMxBurC,uBAAA,WACE,IAGMp2C,EAHarL,KAAKghD,UAAUluB,QAChC,IAAIlf,GAAK,2BAEgBxF,OAAoB,EAC/C,OAAO,IAAIpH,MAAOE,UAAYmE,GAMhCo2C,iCAAA,WACE,OvC1KFhtB,GAJAA,EuC8K4B,CACxBgkB,UAAWz4C,KAAK0hD,gBvC3KD,IACD,UAAIjtB,EAAkB,YAAK,IAAIztB,MAAOE,UACjDutB,EAPyB,IAChCA,GuCsLQgtB,0BAAR,SACE5tC,EACAjL,EACA+4C,EACA9e,GAGA7iC,KAAK4hD,kBACL,IAAM3sC,EAAO,IAAIrB,GAAKC,GACtBjL,EAAO5I,KAAK6hD,6BACR7hD,KAAK6hD,6BAA6BhuC,EAAYjL,GAC9CA,EACJ,IAAI+xB,EAAS,GACb,GAAIkI,EACF,GAAI8e,EAAS,CACX,IAAMG,EAAiBr3C,EAAI7B,EAA8B,SAACm5C,GACxD,OAAAtlC,GAAaslC,KAEfpnB,EAAS36B,KAAKqhD,gBAAgBW,sBAC5B/sC,EACA6sC,EACAjf,OAEG,CACL,IAAMof,EAAaxlC,GAAa7T,GAChC+xB,EAAS36B,KAAKqhD,gBAAgBa,0BAC5BjtC,EACAgtC,EACApf,QAGC,GAAI8e,EAAS,CAClB,IAAMvoB,EAAkB3uB,EAAI7B,EAA8B,SAACm5C,GACzD,OAAAtlC,GAAaslC,KAEfpnB,EAAS36B,KAAKqhD,gBAAgBc,iBAAiBltC,EAAMmkB,OAChD,CACL,IAAMpR,EAAOvL,GAAa7T,GAC1B+xB,EAAS36B,KAAKqhD,gBAAgBF,qBAAqBlsC,EAAM+S,GAE3D,IAAIyL,EAAexe,EACC,EAAhB0lB,EAAOh6B,SAGT8yB,EAAezzB,KAAKoiD,mBAAmBntC,IAEzCjV,KAAKshD,YAAYC,0BAA0B9tB,EAAckH,IAI3D8mB,iCAAA,SAAqB95C,GACnB3H,KAAK6hD,6BAA+Bl6C,GAG9B85C,6BAAR,SAAyBY,GACvBriD,KAAKohD,YAAY,YAAaiB,IACR,IAAlBA,GACFriD,KAAKsiD,0BAIDb,gCAAR,SAA4B5iB,GAA5B,WACEjtB,GAAKitB,EAAS,SAAC18B,EAAY+G,GACzBzB,EAAK25C,YAAYl4C,EAAK/G,MAIlBs/C,wBAAR,SAAoB5tC,EAAoB1R,GACtC,IAAM8S,EAAO,IAAIrB,GAAK,UAAYC,GAC5BoI,EAAUQ,GAAata,GAC7BnC,KAAKghD,UAAUuB,eAAettC,EAAMgH,GACpC,IAAM0e,EAAS36B,KAAKihD,cAAcE,qBAAqBlsC,EAAMgH,GAC7Djc,KAAKshD,YAAYC,0BAA0BtsC,EAAM0lB,IAG3C8mB,4BAAR,WACE,OAAOzhD,KAAKwiD,gBAGdf,4BAAA,SACExsC,EACAwtC,EACAtuB,EACAxZ,GAJF,WAME3a,KAAKosC,KAAK,MAAO,CACfn3B,KAAMA,EAAK9L,WACXhH,MAAOsgD,EACPrpC,SAAU+a,IAKZ,IAAM5E,EAAevvB,KAAK0iD,uBACpBC,EAAoBlmC,GAAagmC,EAAQtuB,GACzClY,EAAUuT,GACdmzB,EACApzB,GAGIgQ,EAAUv/B,KAAK4iD,kBACfjoB,EAAS36B,KAAKqhD,gBAAgBwB,mBAClC5tC,EACAgH,EACAsjB,GACA,GAEFv/B,KAAKshD,YAAYxX,YAAYnP,GAC7B36B,KAAK8oC,QAAQ2V,IACXxpC,EAAK9L,WACLw5C,EAAkBv0C,KAAgB,GAClC,SAACm4B,EAAQ+V,GACP,IAAMwG,EAAqB,OAAXvc,EACXuc,GACHr5C,GAAK,UAAYwL,EAAO,YAAcsxB,GAGxC,IAAMwc,EAAct7C,EAAK45C,gBAAgB3qB,aACvC6I,GACCujB,GAEHr7C,EAAK65C,YAAYC,0BAA0BtsC,EAAM8tC,GACjDt7C,EAAKu7C,uBAAuBroC,EAAY4rB,EAAQ+V,KAGpD,IAAM7oB,EAAezzB,KAAKijD,mBAAmBhuC,GAC7CjV,KAAKoiD,mBAAmB3uB,GAExBzzB,KAAKshD,YAAYC,0BAA0B9tB,EAAc,KAG3DguB,mBAAA,SACExsC,EACAiuC,EACAvoC,GAHF,WAKE3a,KAAKosC,KAAK,SAAU,CAAEn3B,KAAMA,EAAK9L,WAAYhH,MAAO+gD,IAGpD,IAAIC,GAAQ,EACN5zB,EAAevvB,KAAK0iD,uBACpBtpB,EAAyC,GAU/C,GATAxnB,GAAKsxC,EAAiB,SAACE,EAAoBC,GACzCF,GAAQ,EACR,IAAMR,EAAoBlmC,GAAa4mC,GACvCjqB,EAAgBgqB,GAAc5zB,GAC5BmzB,EACApzB,KAIC4zB,EAoCHt1C,GAAI,wDACJ7N,KAAKgjD,uBAAuBroC,EAAY,UArC9B,CACV,IAAM2oC,EAAUtjD,KAAK4iD,kBACfjoB,EAAS36B,KAAKqhD,gBAAgBkC,eAClCtuC,EACAmkB,EACAkqB,GAEFtjD,KAAKshD,YAAYxX,YAAYnP,GAC7B36B,KAAK8oC,QAAQvS,MACXthB,EAAK9L,WACL+5C,EACA,SAAC3c,EAAQ+V,GACP,IAAMwG,EAAqB,OAAXvc,EACXuc,GACHr5C,GAAK,aAAewL,EAAO,YAAcsxB,GAG3C,IAAMwc,EAAct7C,EAAK45C,gBAAgB3qB,aACvC4sB,GACCR,GAEGrvB,EACiB,EAArBsvB,EAAYpiD,OAAa8G,EAAK26C,mBAAmBntC,GAAQA,EAC3DxN,EAAK65C,YAAYC,0BAA0B9tB,EAAcsvB,GACzDt7C,EAAKu7C,uBAAuBroC,EAAY4rB,EAAQ+V,KAIpD1qC,GAAKsxC,EAAiB,SAAClZ,GACrB,IAAMvW,EAAehsB,EAAKw7C,mBAAmBhuC,EAAKO,MAAMw0B,IACxDviC,EAAK26C,mBAAmB3uB,KAI1BzzB,KAAKshD,YAAYC,0BAA0BtsC,EAAM,MAU7CwsC,mCAAR,WAAA,WACEzhD,KAAKosC,KAAK,sBAEV,IvCxVFrd,EACAQ,EAEMi0B,EuCqVEj0B,EAAevvB,KAAK0iD,uBACpBe,GvCzVR10B,EuC0VI/uB,KAAK6sC,cvCzVTtd,EuC0VIA,EvCxVEi0B,EAAe,IAAIl1B,GACzBS,EAAKK,YAAY,IAAIxb,GAAK,IAAK,SAASqB,EAAM2G,GAC5C4nC,EAAa30B,SACX5Z,EACAua,GAA6B5T,EAAM2T,MAGhCi0B,GuCmVD7oB,EAAkB,GAEtB8oB,EAAyBr0B,YAAYxb,GAAK4c,MAAO,SAACvb,EAAM+S,GACtD2S,EAASA,EAAO33B,OACdyE,EAAK45C,gBAAgBF,qBAAqBlsC,EAAM+S,IAElD,IAAMyL,EAAehsB,EAAKw7C,mBAAmBhuC,GAC7CxN,EAAK26C,mBAAmB3uB,KAG1BzzB,KAAK6sC,cAAgB,IAAIve,GACzBtuB,KAAKshD,YAAYC,0BAA0B3tC,GAAK4c,MAAOmK,IAGzD8mB,+BAAA,SACExsC,EACA0F,GAFF,WAIE3a,KAAK8oC,QAAQjuB,mBAAmB5F,EAAK9L,WAAY,SAACo9B,EAAQ+V,GACzC,OAAX/V,GACF9+B,EAAKolC,cAAc7d,OAAO/Z,GAE5BxN,EAAKu7C,uBAAuBroC,EAAY4rB,EAAQ+V,MAIpDmF,4BAAA,SACExsC,EACA9S,EACAwY,GAHF,WAKQsB,EAAUQ,GAAata,GAC7BnC,KAAK8oC,QAAQ4a,gBACXzuC,EAAK9L,WACL8S,EAAQ7N,KAAgB,GACxB,SAACm4B,EAAQ+V,GACQ,OAAX/V,GACF9+B,EAAKolC,cAAche,SAAS5Z,EAAMgH,GAEpCxU,EAAKu7C,uBAAuBroC,EAAY4rB,EAAQ+V,MAKtDmF,wCAAA,SACExsC,EACA9S,EACAiX,EACAuB,GAJF,WAMQsB,EAAUQ,GAAata,EAAOiX,GACpCpZ,KAAK8oC,QAAQ4a,gBACXzuC,EAAK9L,WACL8S,EAAQ7N,KAAgB,GACxB,SAACm4B,EAAQ+V,GACQ,OAAX/V,GACF9+B,EAAKolC,cAAche,SAAS5Z,EAAMgH,GAEpCxU,EAAKu7C,uBAAuBroC,EAAY4rB,EAAQ+V,MAKtDmF,+BAAA,SACExsC,EACAiuC,EACAvoC,GAHF,WAKE,GAAInQ,EAAQ04C,GAKV,OAJAr1C,GACE,4EAEF7N,KAAKgjD,uBAAuBroC,EAAY,MAI1C3a,KAAK8oC,QAAQ6a,kBACX1uC,EAAK9L,WACL+5C,EACA,SAAC3c,EAAQ+V,GACQ,OAAX/V,GACF30B,GAAKsxC,EAAiB,SAAC9lC,EAAmBC,GACxC,IAAMC,EAAeb,GAAaY,GAClC5V,EAAKolC,cAAche,SAAS5Z,EAAKO,MAAM4H,GAAYE,KAGvD7V,EAAKu7C,uBAAuBroC,EAAY4rB,EAAQ+V,MAKtDmF,qCAAA,SAAyB73B,EAAcb,GACrC,IAAI4R,EAEFA,EAD4B,UAA1B/Q,EAAM3U,KAAKX,WACJtU,KAAKihD,cAActjB,qBAC1B/T,EACAb,GAGO/oB,KAAKqhD,gBAAgB1jB,qBAC5B/T,EACAb,GAGJ/oB,KAAKshD,YAAYsC,kBAAkBh6B,EAAM3U,KAAM0lB,IAGjD8mB,wCAAA,SACE73B,EACAb,GAIA,IAAI4R,EAEFA,EAD4B,UAA1B/Q,EAAM3U,KAAKX,WACJtU,KAAKihD,cAAc9iB,wBAC1BvU,EACAb,GAGO/oB,KAAKqhD,gBAAgBljB,wBAC5BvU,EACAb,GAGJ/oB,KAAKshD,YAAYsC,kBAAkBh6B,EAAM3U,KAAM0lB,IAGjD8mB,sBAAA,WACMzhD,KAAK0gD,uBACP1gD,KAAK0gD,sBAAsBpC,UAAU8B,KAIzCqB,mBAAA,WACMzhD,KAAK0gD,uBACP1gD,KAAK0gD,sBAAsBmD,OAAOzD,KAItCqB,kBAAA,SAAMqC,GACJ,gBADIA,MACmB,oBAAZn9C,QAAX,CAEA,IAAIwiC,EAIFA,EAHE2a,GACG9jD,KAAK+oC,iBACR/oC,KAAK+oC,eAAiB,IAAIP,GAAcxoC,KAAKqsC,SACvCrsC,KAAK+oC,eAAe14B,OAEpBrQ,KAAKqsC,OAAOh8B,MAGtB,IAAM0zC,EAAcvkD,OAAO+J,KAAK4/B,GAAO6a,OACrC,SAACC,EAAeC,GACd,OAAAjyC,KAAKoD,IAAI6uC,EAAavjD,OAAQsjD,IAChC,GAGFryC,GAAKu3B,EAAO,SAACP,EAAczmC,GAGzB,IAFA,IAAIgiD,EAAavb,EAERpoC,EAAIooC,EAAKjoC,OAAQH,EAAIujD,EAAc,EAAGvjD,IAC7C2jD,GAAc,IAEhBx9C,QAAQkH,IAAIs2C,EAAahiD,OAI7Bs/C,kCAAA,SAAsB2C,GACpBpkD,KAAKqsC,OAAOmD,iBAAiB4U,GAC7BpkD,KAAK6gD,eAAewD,YAAYD,IAG1B3C,iBAAR,eAAa,aAAA94C,mBAAAA,IAAAiH,kBACX,IAAIW,EAAS,GACTvQ,KAAK0gD,wBACPnwC,EAASvQ,KAAK0gD,sBAAsBzzC,GAAK,KAE3CY,mBAAI0C,GAAWX,KAGjB6xC,mCAAA,SACE95C,EACA4+B,EACA+V,GAEI30C,GACFsL,GAAe,WACb,GAAc,MAAVszB,EACF5+B,EAAS,UACJ,CACL,IAAMO,GAAQq+B,GAAU,SAASI,cAC7BpjC,EAAU2E,EACVo0C,IAAa/4C,GAAW,KAAO+4C,GAEnC,IAAMx5C,EAAQ,IAAIW,MAAMF,GACvBT,EAAcoF,KAAOA,EACtBP,EAAS7E,OAMjBtD,sBAAIiiD,4BAAJ,WACE,OAAOzhD,KAAKskD,aAAetkD,KAAKskD,WAAa,IAAIC,GAASvkD,2DC3iB5D,WAAY6W,GACV7W,KAAKwkD,eAAiB,IAAIhxB,GAAc3c,EAAOiT,YAC/C9pB,KAAKsoB,OAASzR,EAAOiT,WACrB9pB,KAAKykD,WAAaC,EAAaC,cAAc9tC,GAC7C7W,KAAK4kD,SAAWF,EAAaG,YAAYhuC,GAwI7C,OAlIE6tC,yBAAA,WACE,OAAO1kD,KAAKykD,YAMdC,uBAAA,WACE,OAAO1kD,KAAK4kD,UAOdF,oBAAA,SAAQ9oC,GACN,OACE5b,KAAKsoB,OAAOvM,QAAQ/b,KAAK8kD,eAAgBlpC,IAAS,GAClD5b,KAAKsoB,OAAOvM,QAAQH,EAAM5b,KAAK+kD,eAAiB,GAOpDL,wBAAA,SACE18B,EACA9e,EACA6nB,EACA0C,EACA1sB,EACA2sB,GAKA,OAHK1zB,KAAK88B,QAAQ,IAAIjhB,GAAU3S,EAAK6nB,MACnCA,EAAWrM,GAAaxH,YAEnBld,KAAKwkD,eAAe9mC,YACzBsK,EACA9e,EACA6nB,EACA0C,EACA1sB,EACA2sB,IAOJgxB,2BAAA,SACE3xB,EACAmB,EACAR,GAEIQ,EAAQrX,eAEVqX,EAAUxP,GAAaxH,YAEzB,IAAI0V,EAAWsB,EAAQD,UAAUj0B,KAAKsoB,QAEtCsK,EAAWA,EAASrV,eAAemH,GAAaxH,YAChD,IAAM8nC,EAAOhlD,KAMb,OALAk0B,EAAQ9O,aAAaxG,GAAgB,SAAS1V,EAAKmU,GAC5C2nC,EAAKloB,QAAQ,IAAIjhB,GAAU3S,EAAKmU,MACnCuV,EAAWA,EAASpV,qBAAqBtU,EAAKwb,GAAaxH,eAGxDld,KAAKwkD,eAAe3sB,eACzB9E,EACAH,EACAc,IAOJgxB,2BAAA,SAAe3xB,EAAeoB,GAE5B,OAAOpB,GAMT2xB,yBAAA,WACE,OAAO,GAMTA,6BAAA,WACE,OAAO1kD,KAAKwkD,gBAMdE,qBAAA,WACE,OAAO1kD,KAAKsoB,QAQCo8B,gBAAf,SAA6B7tC,GAC3B,GAAIA,EAAOyU,WAAY,CACrB,IAAM25B,EAAYpuC,EAAO+U,oBACzB,OAAO/U,EAAOiT,WAAWo7B,SAASruC,EAAO0U,qBAAsB05B,GAE/D,OAAOpuC,EAAOiT,WAAW7D,WASdy+B,cAAf,SAA2B7tC,GACzB,GAAIA,EAAO2U,SAAU,CACnB,IAAM25B,EAAUtuC,EAAOgV,kBACvB,OAAOhV,EAAOiT,WAAWo7B,SAASruC,EAAO4U,mBAAoB05B,GAE7D,OAAOtuC,EAAOiT,WAAWzD,8BCvI7B,WAAYxP,GACV7W,KAAKolD,cAAgB,IAAIV,GAAa7tC,GACtC7W,KAAKsoB,OAASzR,EAAOiT,WACrB9pB,KAAKqlD,OAASxuC,EAAOyuC,WACrBtlD,KAAKulD,UAAY1uC,EAAO2uC,iBA2R5B,OArREC,wBAAA,SACEz9B,EACA9e,EACA6nB,EACA0C,EACA1sB,EACA2sB,GAKA,OAHK1zB,KAAKolD,cAActoB,QAAQ,IAAIjhB,GAAU3S,EAAK6nB,MACjDA,EAAWrM,GAAaxH,YAEtB8K,EAAKpD,kBAAkB1b,GAAKwV,OAAOqS,GAE9B/I,EACEA,EAAKa,cAAgB7oB,KAAKqlD,OAC5BrlD,KAAKolD,cACTxsB,mBACAlb,YACCsK,EACA9e,EACA6nB,EACA0C,EACA1sB,EACA2sB,GAGG1zB,KAAK0lD,sBACV19B,EACA9e,EACA6nB,EACAhqB,EACA2sB,IAQN+xB,2BAAA,SACE1yB,EACAmB,EACAR,GAEA,IAAId,EACJ,GAAIsB,EAAQrX,cAAgBqX,EAAQ1pB,UAElCooB,EAAWlO,GAAaxH,WAAW+W,UAAUj0B,KAAKsoB,aAElD,GACgB,EAAdtoB,KAAKqlD,OAAanxB,EAAQrL,eAC1BqL,EAAQP,UAAU3zB,KAAKsoB,QACvB,CAEAsK,EAAWlO,GAAaxH,WAAW+W,UAAUj0B,KAAKsoB,QAElD,IAAIxmB,SAEFA,EADE9B,KAAKulD,SACKrxB,EAAyB9N,uBACnCpmB,KAAKolD,cAAcL,aACnB/kD,KAAKsoB,QAGK4L,EAAyBlO,gBACnChmB,KAAKolD,cAAcN,eACnB9kD,KAAKsoB,QAIT,IADA,IAAIzI,EAAQ,EACL/d,EAAS6jD,WAAa9lC,EAAQ7f,KAAKqlD,QAAQ,CAChD,IAAM5jD,EAAOK,EAAS+hB,UAStB,KAPI7jB,KAAKulD,SAELvlD,KAAKsoB,OAAOvM,QAAQ/b,KAAKolD,cAAcN,eAAgBrjD,IAAS,EAGhEzB,KAAKsoB,OAAOvM,QAAQta,EAAMzB,KAAKolD,cAAcL,eAAiB,GAOhE,MAJAnyB,EAAWA,EAASpV,qBAAqB/b,EAAKqM,KAAMrM,EAAKma,MACzDiE,SAMC,CAIL+S,GAFAA,EAAWsB,EAAQD,UAAUj0B,KAAKsoB,SAEd/K,eAClBmH,GAAaxH,YAEf,IAAIgJ,SACAI,SACAxR,SACAhT,SACJ,GAAI9B,KAAKulD,SAAU,CACjBzjD,EAAW8wB,EAASgzB,mBAAmB5lD,KAAKsoB,QAC5CpC,EAAYlmB,KAAKolD,cAAcL,aAC/Bz+B,EAAUtmB,KAAKolD,cAAcN,eAC7B,IAAMe,EAAe7lD,KAAKsoB,OAAOvE,aACjCjP,EAAM,SAACrJ,EAAclM,GAAiB,OAAAsmD,EAAatmD,EAAGkM,SAEtD3J,EAAW8wB,EAASjP,YAAY3jB,KAAKsoB,QACrCpC,EAAYlmB,KAAKolD,cAAcN,eAC/Bx+B,EAAUtmB,KAAKolD,cAAcL,aAC7BjwC,EAAM9U,KAAKsoB,OAAOvE,aAGhBlE,EAAQ,EAEZ,IAFA,IACIimC,GAAiB,EACdhkD,EAAS6jD,WAAW,CACrBlkD,EAAOK,EAAS+hB,WACfiiC,GAAkBhxC,EAAIoR,EAAWzkB,IAAS,IAE7CqkD,GAAiB,GAGjBA,GAAkBjmC,EAAQ7f,KAAKqlD,QAAUvwC,EAAIrT,EAAM6kB,IAAY,EAE/DzG,IAEA+S,EAAWA,EAASpV,qBAClB/b,EAAKqM,KACL4W,GAAaxH,aAMvB,OAAOld,KAAKolD,cACTxsB,mBACAf,eAAe9E,EAASH,EAAUc,IAMvC+xB,2BAAA,SAAe1yB,EAAeoB,GAE5B,OAAOpB,GAMT0yB,yBAAA,WACE,OAAO,GAMTA,6BAAA,WACE,OAAOzlD,KAAKolD,cAAcxsB,oBAM5B6sB,qBAAA,WACE,OAAOzlD,KAAKsoB,QAYNm9B,kCAAR,SACEz9B,EACAyG,EACAiC,EACA3pB,EACAg/C,GAGA,IAAIjxC,EACJ,GAAI9U,KAAKulD,SAAU,CACjB,IAAMS,EAAWhmD,KAAKsoB,OAAOvE,aAC7BjP,EAAM,SAACrJ,EAAclM,GAAiB,OAAAymD,EAASzmD,EAAGkM,SAElDqJ,EAAM9U,KAAKsoB,OAAOvE,aAEpB,IAAMsW,EAAgBrS,EACtB3kB,EAAOg3B,EAAcxR,eAAiB7oB,KAAKqlD,OAAQ,IACnD,IAAMY,EAAoB,IAAIpqC,GAAU4S,EAAUiC,GAC5Cw1B,EAAiBlmD,KAAKulD,SACxBlrB,EAAc8rB,cAAcnmD,KAAKsoB,QAChC+R,EAAc+rB,aAAapmD,KAAKsoB,QAC/B+9B,EAAUrmD,KAAKolD,cAActoB,QAAQmpB,GAC3C,GAAI5rB,EAAc/H,SAAS7D,GAAW,CAOpC,IANA,IAAM63B,EAAejsB,EAAczV,kBAAkB6J,GACjD8C,EAAYxqB,EAAOw/C,mBACrBvmD,KAAKsoB,OACL49B,EACAlmD,KAAKulD,UAGQ,MAAbh0B,IACCA,EAAUzjB,MAAQ2gB,GAAY4L,EAAc/H,SAASf,EAAUzjB,QAKhEyjB,EAAYxqB,EAAOw/C,mBACjBvmD,KAAKsoB,OACLiJ,EACAvxB,KAAKulD,UAGT,IAAMiB,EACS,MAAbj1B,EAAoB,EAAIzc,EAAIyc,EAAW00B,GAGzC,GADEI,IAAY31B,EAAUlmB,WAA4B,GAAfg8C,EAOnC,OALyB,MAArBT,GACFA,EAAkBlyB,iBAChBb,GAAOgB,mBAAmBvF,EAAUiC,EAAW41B,IAG5CjsB,EAAc7c,qBAAqBiR,EAAUiC,GAE3B,MAArBq1B,GACFA,EAAkBlyB,iBAChBb,GAAOc,mBAAmBrF,EAAU63B,IAGxC,IAAM9uB,EAAgB6C,EAAc7c,qBAClCiR,EACA/J,GAAaxH,YAIf,OADe,MAAbqU,GAAqBvxB,KAAKolD,cAActoB,QAAQvL,IAEvB,MAArBw0B,GACFA,EAAkBlyB,iBAChBb,GAAOe,iBAAiBxC,EAAUzjB,KAAMyjB,EAAU3V,OAG/C4b,EAAcha,qBACnB+T,EAAUzjB,KACVyjB,EAAU3V,OAGL4b,EAGN,OAAI9G,EAAUlmB,UAEZwd,EACEq+B,GACqC,GAA1CvxC,EAAIoxC,EAAgBD,IACG,MAArBF,IACFA,EAAkBlyB,iBAChBb,GAAOc,mBAAmBoyB,EAAep4C,KAAMo4C,EAAetqC,OAEhEmqC,EAAkBlyB,iBAChBb,GAAOe,iBAAiBtF,EAAUiC,KAG/B2J,EACJ7c,qBAAqBiR,EAAUiC,GAC/BlT,qBAAqB0oC,EAAep4C,KAAM4W,GAAaxH,aAKrD8K,sBC5Tb,aACUhoB,gBAAY,EACZA,gBAAY,EACZA,oBAAgB,EAChBA,cAAU,EACVA,kBAAc,EAEdA,YAAS,EACTA,eAAY,GACZA,sBAA+B,KAC/BA,qBAAkB,GAClBA,oBAA6B,KAC7BA,mBAAgB,GAEhBA,YAAS4e,GAwXnB,OAzUE6nC,qBAAA,WACE,OAAOzmD,KAAK0mD,WAMdD,2BAAA,WACE,MAAuB,KAAnBzmD,KAAK2mD,UAKA3mD,KAAK0mD,UAGV1mD,KAAK2mD,YAAcF,EAAYG,yBAAyBC,gBAS9DJ,+BAAA,WAEE,OADApjD,EAAOrD,KAAK0mD,UAAW,oCAChB1mD,KAAK8mD,kBAQdL,8BAAA,WAEE,OADApjD,EAAOrD,KAAK0mD,UAAW,oCACnB1mD,KAAK+mD,cACA/mD,KAAKgnD,gBAELn2C,IAOX41C,mBAAA,WACE,OAAOzmD,KAAKinD,SAOdR,6BAAA,WAEE,OADApjD,EAAOrD,KAAKinD,QAAS,kCACdjnD,KAAKknD,gBAQdT,4BAAA,WAEE,OADApjD,EAAOrD,KAAKinD,QAAS,kCACjBjnD,KAAKmnD,YACAnnD,KAAKonD,cAELt2C,IAOX21C,qBAAA,WACE,OAAOzmD,KAAKqnD,WAMdZ,6BAAA,WACE,OAAOzmD,KAAKqnD,WAAgC,KAAnBrnD,KAAK2mD,WAOhCF,qBAAA,WAEE,OADApjD,EAAOrD,KAAKqnD,UAAW,oCAChBrnD,KAAKqlD,QAMdoB,qBAAA,WACE,OAAOzmD,KAAKsoB,QAONm+B,kBAAR,WACE,IAAMvmC,EAAO,IAAIumC,EAajB,OAZAvmC,EAAKmnC,UAAYrnD,KAAKqnD,UACtBnnC,EAAKmlC,OAASrlD,KAAKqlD,OACnBnlC,EAAKwmC,UAAY1mD,KAAK0mD,UACtBxmC,EAAK4mC,iBAAmB9mD,KAAK8mD,iBAC7B5mC,EAAK6mC,cAAgB/mD,KAAK+mD,cAC1B7mC,EAAK8mC,gBAAkBhnD,KAAKgnD,gBAC5B9mC,EAAK+mC,QAAUjnD,KAAKinD,QACpB/mC,EAAKgnC,eAAiBlnD,KAAKknD,eAC3BhnC,EAAKinC,YAAcnnD,KAAKmnD,YACxBjnC,EAAKknC,cAAgBpnD,KAAKonD,cAC1BlnC,EAAKoI,OAAStoB,KAAKsoB,OACnBpI,EAAKymC,UAAY3mD,KAAK2mD,UACfzmC,GAOTumC,kBAAA,SAAMa,GACJ,IAAM/5B,EAAYvtB,KAAKunD,QAIvB,OAHAh6B,EAAU85B,WAAY,EACtB95B,EAAU83B,OAASiC,EACnB/5B,EAAUo5B,UAAY,GACfp5B,GAOTk5B,yBAAA,SAAaa,GACX,IAAM/5B,EAAYvtB,KAAKunD,QAIvB,OAHAh6B,EAAU85B,WAAY,EACtB95B,EAAU83B,OAASiC,EACnB/5B,EAAUo5B,UAAYF,EAAYG,yBAAyBC,eACpDt5B,GAOTk5B,wBAAA,SAAYa,GACV,IAAM/5B,EAAYvtB,KAAKunD,QAIvB,OAHAh6B,EAAU85B,WAAY,EACtB95B,EAAU83B,OAASiC,EACnB/5B,EAAUo5B,UAAYF,EAAYG,yBAAyBY,gBACpDj6B,GAQTk5B,oBAAA,SAAQnqC,EAAiBpT,GACvB,IAAMqkB,EAAYvtB,KAAKunD,QAavB,OAZAh6B,EAAUm5B,WAAY,OACHv/C,IAAfmV,IACFA,EAAa,MAEfiR,EAAUu5B,iBAAmBxqC,EAG3BiR,EAAUy5B,gBAFD,MAAP99C,GACFqkB,EAAUw5B,eAAgB,EACE79C,IAE5BqkB,EAAUw5B,eAAgB,EACE,IAEvBx5B,GAQTk5B,kBAAA,SAAMnqC,EAAiBpT,GACrB,IAAMqkB,EAAYvtB,KAAKunD,QAavB,OAZAh6B,EAAU05B,SAAU,OACD9/C,IAAfmV,IACFA,EAAa,MAEfiR,EAAU25B,eAAiB5qC,EAGzBiR,EAAU65B,mBAFAjgD,IAAR+B,GACFqkB,EAAU45B,aAAc,EACEj+C,IAE1BqkB,EAAU45B,aAAc,EACE,IAErB55B,GAOTk5B,oBAAA,SAAQ9oC,GACN,IAAM4P,EAAYvtB,KAAKunD,QAEvB,OADAh6B,EAAUjF,OAAS3K,EACZ4P,GAMTk5B,2BAAA,WACE,IAAMgB,EAA0BhB,EAAYG,yBACtCt8C,EAA4B,GAalC,GAZItK,KAAK0mD,YACPp8C,EAAIm9C,EAAwBC,mBAAqB1nD,KAAK8mD,iBAClD9mD,KAAK+mD,gBACPz8C,EAAIm9C,EAAwBE,kBAAoB3nD,KAAKgnD,kBAGrDhnD,KAAKinD,UACP38C,EAAIm9C,EAAwBG,iBAAmB5nD,KAAKknD,eAChDlnD,KAAKmnD,cACP78C,EAAIm9C,EAAwBI,gBAAkB7nD,KAAKonD,gBAGnDpnD,KAAKqnD,UAAW,CAClB/8C,EAAIm9C,EAAwBK,OAAS9nD,KAAKqlD,OAC1C,IAAI0C,EAAW/nD,KAAK2mD,UACH,KAAboB,IAEAA,EADE/nD,KAAKwlD,iBACIiC,EAAwBZ,eAExBY,EAAwBD,iBAGvCl9C,EAAIm9C,EAAwBO,WAAaD,EAM3C,OAHI/nD,KAAKsoB,SAAW1J,KAClBtU,EAAIm9C,EAAwBQ,OAASjoD,KAAKsoB,OAAOnf,YAE5CmB,GAMTm8C,yBAAA,WACE,QAASzmD,KAAK0mD,WAAa1mD,KAAKinD,SAAWjnD,KAAKqnD,YAMlDZ,sBAAA,WACE,OAAOzmD,KAAKq8B,gBAAkBr8B,KAAKsoB,QAAU1J,IAM/C6nC,0BAAA,WACE,OAAIzmD,KAAKq8B,eACA,IAAI7I,GAAcxzB,KAAK8pB,YACrB9pB,KAAK8rB,WACP,IAAI25B,GAAczlD,MAElB,IAAI0kD,GAAa1kD,OAS5BymD,wCAAA,WACE,IAOIj5B,EAPE06B,EAAiBzB,EAAY0B,sBAC7BC,EAAuC,GAE7C,OAAIpoD,KAAKkmC,cAMP1Y,EADExtB,KAAKsoB,SAAW1J,GACRspC,EAAetpC,eAChB5e,KAAKsoB,SAAWX,GACfugC,EAAevgC,YAChB3nB,KAAKsoB,SAAW/L,GACf2rC,EAAe3rC,WAEzBlZ,EAAOrD,KAAKsoB,kBAAkBP,GAAW,4BAC/B/nB,KAAKsoB,OAAOnf,YAExBi/C,EAAGF,EAAeG,UAAYx+C,EAAU2jB,GAEpCxtB,KAAK0mD,YACP0B,EAAGF,EAAeI,UAAYz+C,EAAU7J,KAAK8mD,kBACzC9mD,KAAK+mD,gBACPqB,EAAGF,EAAeI,WAAa,IAAMz+C,EAAU7J,KAAKgnD,mBAIpDhnD,KAAKinD,UACPmB,EAAGF,EAAeK,QAAU1+C,EAAU7J,KAAKknD,gBACvClnD,KAAKmnD,cACPiB,EAAGF,EAAeK,SAAW,IAAM1+C,EAAU7J,KAAKonD,iBAIlDpnD,KAAKqnD,YACHrnD,KAAKwlD,iBACP4C,EAAGF,EAAeM,gBAAkBxoD,KAAKqlD,OAEzC+C,EAAGF,EAAeO,eAAiBzoD,KAAKqlD,SAlCnC+C,GAxUa3B,2BAA2B,CACjDiB,kBAAmB,KACnBC,iBAAkB,KAClBC,gBAAiB,KACjBC,eAAgB,KAChBC,MAAO,IACPE,UAAW,KACXnB,eAAgB,IAChBW,gBAAiB,IACjBS,MAAO,KASexB,wBAAwB,CAC9C4B,SAAU,UACVzpC,eAAgB,YAChB+I,YAAa,SACbpL,UAAW,OACX+rC,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAQDhC,UAAU,IAAIA,sBCjC9B,WAAYz7B,EAAY/V,GACtB,KAAM+V,aAAgBy2B,IACpB,MAAM,IAAIh+C,MACR,oEAKJ0E,YAAM6iB,EAAM/V,EAAMwxC,GAAYiC,SAAS,SAkT3C,OAzU+BngD,OA2B7BogD,mBAAA,WAGE,OAFAz8C,EAAiB,gBAAiB,EAAG,EAAGxL,UAAUC,QAE9CX,KAAKiV,KAAKzK,UAAkB,KACpBxK,KAAKiV,KAAK6E,WAOxB6uC,kBAAA,SAAM90C,GhEoT8B,IACpC1H,EACAM,EACAoH,EACAnH,EgE9SE,OATAR,EAAiB,kBAAmB,EAAG,EAAGxL,UAAUC,QAC1B,iBAAfkT,EACTA,EAAanO,OAAOmO,GACTA,aAAsBD,KACJ,OAAzB5T,KAAKiV,KAAKX,YhEgTlBnI,EgE/S6B,kBhEkT7BO,IAFAD,EgEhTgD,IhEiThDoH,EgEjTmDA,KhEsTjDA,EAAaA,EAAW7K,QAAQ,mBAAoB,MAGtDsR,GAAmBnO,EAAQM,EAAgBoH,EAAYnH,IgExT9C4N,GAAmB,kBAAmB,EAAGzG,GAAY,IAGrD,IAAI80C,EAAU3oD,KAAKgrB,KAAMhrB,KAAKiV,KAAKO,MAAM3B,KAIlD80C,sBAAA,WACEz8C,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QAErD,IAAMioD,EAAa5oD,KAAKiV,KAAKikB,SAC7B,OAAsB,OAAf0vB,EAAsB,KAAO,IAAID,EAAU3oD,KAAKgrB,KAAM49B,IAI/DD,oBAAA,WACEz8C,EAAiB,iBAAkB,EAAG,EAAGxL,UAAUC,QAGnD,IADA,IAAIuoB,EAAMlpB,KACiB,OAApBkpB,EAAIC,aACTD,EAAMA,EAAIC,YAEZ,OAAOD,GAITy/B,yBAAA,WACE,OAAO3oD,KAAKgrB,KAAK69B,UAQnBF,gBAAA,SAAIlG,EAAa9nC,GACfzO,EAAiB,gBAAiB,EAAG,EAAGxL,UAAUC,QAClD4Z,GAAqB,gBAAiBva,KAAKiV,MAC3CoE,GAAwB,gBAAiB,EAAGopC,EAAQziD,KAAKiV,MAAM,GAC/DrI,EAAiB,gBAAiB,EAAG+N,GAAY,GAEjD,IAAMC,EAAW,IAAIlT,EAOrB,OANA1H,KAAKgrB,KAAK89B,gBACR9oD,KAAKiV,KACLwtC,EACc,KACd7nC,EAASE,aAAaH,IAEjBC,EAASvT,SAQlBshD,mBAAA,SACE1tC,EACAN,GAKA,GAHAzO,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QACrD4Z,GAAqB,mBAAoBva,KAAKiV,MAE1CtV,MAAMyE,QAAQ6W,GAAgB,CAEhC,IADA,IAAMC,EAAyC,GACtC1a,EAAI,EAAGA,EAAIya,EAActa,SAAUH,EAC1C0a,EAAiB,GAAK1a,GAAKya,EAAcza,GAE3Cya,EAAgBC,EAChBzR,GACE,wMAMJkQ,GACE,mBACA,EACAsB,EACAjb,KAAKiV,MACL,GAEFrI,EAAiB,mBAAoB,EAAG+N,GAAY,GACpD,IAAMC,EAAW,IAAIlT,EAMrB,OALA1H,KAAKgrB,KAAKhf,OACRhM,KAAKiV,KACLgG,EACAL,EAASE,aAAaH,IAEjBC,EAASvT,SASlBshD,4BAAA,SACElG,EACAtuB,EACAxZ,GAcA,GAZAzO,EAAiB,4BAA6B,EAAG,EAAGxL,UAAUC,QAC9D4Z,GAAqB,4BAA6Bva,KAAKiV,MACvDoE,GACE,4BACA,EACAopC,EACAziD,KAAKiV,MACL,GAEFiF,GAAiB,4BAA6B,EAAGia,GAAa,GAC9DvnB,EAAiB,4BAA6B,EAAG+N,GAAY,GAEvC,YAAlB3a,KAAK4oB,UAA4C,UAAlB5oB,KAAK4oB,SACtC,KAAM,qCACJ5oB,KAAK4oB,SACL,0BAEJ,IAAMhO,EAAW,IAAIlT,EAOrB,OANA1H,KAAKgrB,KAAK89B,gBACR9oD,KAAKiV,KACLwtC,EACAtuB,EACAvZ,EAASE,aAAaH,IAEjBC,EAASvT,SAOlBshD,mBAAA,SAAOhuC,GAKL,OAJAzO,EAAiB,mBAAoB,EAAG,EAAGxL,UAAUC,QACrD4Z,GAAqB,mBAAoBva,KAAKiV,MAC9CrI,EAAiB,mBAAoB,EAAG+N,GAAY,GAE7C3a,KAAKmQ,IAAI,KAAMwK,IASxBguC,wBAAA,SACEI,EACApuC,EACAquC,GAUA,GARA98C,EAAiB,wBAAyB,EAAG,EAAGxL,UAAUC,QAC1D4Z,GAAqB,wBAAyBva,KAAKiV,MACnDrI,EAAiB,wBAAyB,EAAGm8C,GAAmB,GAChEn8C,EAAiB,wBAAyB,EAAG+N,GAAY,GhEwM9B,SAC7BxO,EACAM,EACAw8C,EACAv8C,GAEA,KAAIA,QAAqBvF,IAAT8hD,IACI,kBAATA,EACT,MAAM,IAAIxlD,MACR8V,EAAepN,EAAQM,EAAgBC,GAAY,sBgE9MrDw8C,CAAgB,wBAAyB,EAAGF,GAAc,GAEpC,YAAlBhpD,KAAK4oB,UAA4C,UAAlB5oB,KAAK4oB,SACtC,KAAM,iCACJ5oB,KAAK4oB,SACL,+BAEiBzhB,IAAjB6hD,IAA4BA,GAAe,GAE/C,IAAMpuC,EAAW,IAAIlT,EACK,mBAAfiT,GACTC,EAASvT,QAAQO,MAAM,cAwBzB,OAPA5H,KAAKgrB,KAAKm+B,iBACRnpD,KAAKiV,KACL8zC,EAhBsB,SACtBjmD,EACAsY,EACAC,GAEIvY,EACF8X,EAASpT,OAAO1E,GAEhB8X,EAASrT,QAAQ,IAAI+T,GAAkBF,EAAWC,IAE1B,mBAAfV,GACTA,EAAW7X,EAAOsY,EAAWC,IAO/B2tC,GAGKpuC,EAASvT,SAQlBshD,wBAAA,SACEvvC,EACAuB,GAEAzO,EAAiB,wBAAyB,EAAG,EAAGxL,UAAUC,QAC1D4Z,GAAqB,wBAAyBva,KAAKiV,MACnDiF,GAAiB,wBAAyB,EAAGd,GAAU,GACvDxM,EAAiB,wBAAyB,EAAG+N,GAAY,GAEzD,IAAMC,EAAW,IAAIlT,EAOrB,OANA1H,KAAKgrB,KAAK89B,gBACR9oD,KAAKiV,KAAKO,MAAM,aAChB4D,EACA,KACAwB,EAASE,aAAaH,IAEjBC,EAASvT,SAQlBshD,iBAAA,SAAKxmD,EAAawY,GAChBzO,EAAiB,iBAAkB,EAAG,EAAGxL,UAAUC,QACnD4Z,GAAqB,iBAAkBva,KAAKiV,MAC5CoE,GAAwB,iBAAkB,EAAGlX,EAAOnC,KAAKiV,MAAM,GAC/DrI,EAAiB,iBAAkB,EAAG+N,GAAY,GAElD,IAWItT,EAXEoG,EAAMzN,KAAKgrB,KAAK02B,aAChB5zC,EAAO0N,GAAW/N,GAOlB27C,EAAmBppD,KAAKwV,MAAM1H,GAC9Bu7C,EAAUrpD,KAAKwV,MAAM1H,GAgB3B,OAZEzG,EADW,MAATlF,EACQinD,EAAiBj5C,IAAIhO,EAAOwY,GAAYitB,KAAK,WAAM,OAAAyhB,IAEnD/hD,QAAQC,QAAQ8hD,GAG5BD,EAAiBxhB,KAAOvgC,EAAQugC,KAAK13B,KAAK7I,GAC1C+hD,EAAiBxhD,MAAQP,EAAQugC,KAAK13B,KAAK7I,OAASF,GAE1B,mBAAfwT,GACTtT,EAAQO,MAAM,cAGTwhD,GAMTT,yBAAA,WAEE,OADApuC,GAAqB,yBAA0Bva,KAAKiV,MAC7C,IAAIyF,GAAa1a,KAAKgrB,KAAMhrB,KAAKiV,OAG1CzV,sBAAImpD,4BAAJ,WACE,OAAO3oD,KAAKspD,gDAGd9pD,sBAAImpD,uBAAJ,WACE,OAAO3oD,KAAK4oB,0CAGdppB,sBAAImpD,0BAAJ,WACE,OAAO3oD,KAAKmpB,6CAGd3pB,sBAAImpD,wBAAJ,WACE,OAAO3oD,KAAKupD,8CAvUep+B,IAiV/BA,GAAM1D,uBAAyBkhC,GAC/BtrB,GAAU5V,uBAAyBkhC,GCrWnC,ICgBYa,GAAAA,MDhBZ,WAGExpD,cAA4C,GAC5CA,gBAAa,EACbA,WAAkB,oBAelB,WACUypD,EACAC,EACAthC,gBAFAqhC,mBACAC,qBACAthC,MAAyBuhC,IAFzB3pD,WAAAypD,EACAzpD,aAAA0pD,EACA1pD,WAAAooB,EA+LZ,OAtLEwhC,oBAAA,SAAQC,GAKN,IAHA,IAEEpoD,EAFEwT,EAAO40C,aAAmBj2C,GAAOi2C,EAAU,IAAIj2C,GAAKi2C,GACpDr0C,EAAQxV,KAEwB,QAA5ByB,EAAOwT,EAAKX,aAAsB,CAExCkB,EAAQ,IAAIo0C,EAAKnoD,EAAM+T,EADLjL,EAAQiL,EAAM4S,MAAMmG,SAAU9sB,IAAS,IAAIkoD,IAE7D10C,EAAOA,EAAKR,WAGd,OAAOe,GAQTo0C,qBAAA,WACE,OAAO5pD,KAAKooB,MAAMjmB,OAQpBynD,qBAAA,SAASznD,GACPkB,OAAwB,IAAVlB,EAAuB,iCACrCnC,KAAKooB,MAAMjmB,MAAQA,EACnBnC,KAAK8pD,kBAMPF,kBAAA,WACE5pD,KAAKooB,MAAMjmB,MAAQ,KACnBnC,KAAKooB,MAAMmG,SAAW,GACtBvuB,KAAKooB,MAAM2hC,WAAa,EACxB/pD,KAAK8pD,kBAMPF,wBAAA,WACE,OAA+B,EAAxB5pD,KAAKooB,MAAM2hC,YAMpBH,oBAAA,WACE,OAA2B,OAApB5pD,KAAK+d,aAAwB/d,KAAKgqD,eAQ3CJ,yBAAA,SAAahsC,GAAb,WACEhM,GAAK5R,KAAKooB,MAAMmG,SAAU,SAAC/Y,EAAekN,GACxC9E,EAAO,IAAIgsC,EAAQp0C,EAAO/N,EAAMib,OAapCknC,8BAAA,SACEhsC,EACAqsC,EACAC,GAEID,IAAgBC,GAAetsC,EAAO5d,MAE1CA,KAAKolB,aAAa,SAAS5P,GACzBA,EAAM20C,kBAAkBvsC,GAAyB,EAAMssC,KAGrDD,GAAeC,GAAetsC,EAAO5d,OAW3C4pD,4BAAA,SACEhsC,EACAqsC,GAGA,IADA,IAAIruC,EAAOquC,EAAcjqD,KAAOA,KAAKk5B,SACrB,OAATtd,GAAe,CACpB,GAAIgC,EAAOhC,GACT,OAAO,EAETA,EAAOA,EAAKsd,SAEd,OAAO,GAUT0wB,gDAAA,SAAoChsC,GAClC5d,KAAKolB,aAAa,SAAS5P,GACA,OAArBA,EAAMuI,WAAqBH,EAAOpI,GACjCA,EAAM40C,oCAAoCxsC,MAOnDgsC,iBAAA,WACE,OAAO,IAAIh2C,GACQ,OAAjB5T,KAAK0pD,QACD1pD,KAAKypD,MACLzpD,KAAK0pD,QAAQz0C,OAAS,IAAMjV,KAAKypD,QAOzCG,iBAAA,WACE,OAAO5pD,KAAKypD,OAMdG,mBAAA,WACE,OAAO5pD,KAAK0pD,SAQNE,2BAAR,WACuB,OAAjB5pD,KAAK0pD,SAAkB1pD,KAAK0pD,QAAQW,aAAarqD,KAAKypD,MAAOzpD,OAU3D4pD,yBAAR,SAAqBxsC,EAAmB5H,GACtC,IAAM80C,EAAa90C,EAAMhL,UACnB+/C,EAAclgD,EAASrK,KAAKooB,MAAMmG,SAAUnR,GAC9CktC,GAAcC,UACTvqD,KAAKooB,MAAMmG,SAASnR,GAC3Bpd,KAAKooB,MAAM2hC,aACX/pD,KAAK8pD,kBACKQ,GAAeC,IACzBvqD,KAAKooB,MAAMmG,SAASnR,GAAa5H,EAAM4S,MACvCpoB,KAAKooB,MAAM2hC,aACX/pD,KAAK8pD,yBCnMCN,GAAAA,KAAAA,wBAQVA,qBAIAA,+BAIAA,6CAGAA,mCAUD/H,GAAa+I,yBAA2B,GAuCxC/I,GAAKvhD,UAAkB6gD,mBAAqB,WAO3C/gD,KAAKyqD,sBAAwB,IAAIb,IAsBnCnI,GAAKvhD,UAAUipD,iBAAmB,SAChCl0C,EACA8zC,EACApuC,EACAquC,GAEAhpD,KAAKosC,KAAK,kBAAoBn3B,GAG9B,IAAMy1C,EAAgB,aAChBC,EAAW,IAAIhC,GAAU3oD,KAAMiV,GACrC01C,EAAS39B,GAAG,QAAS09B,GACrB,IAKME,EAA2B,CAC/B31C,OACAjJ,OAAQ+8C,EACRpuC,aAGA4rB,OAAQ,KAGRskB,MAAOv7C,IAGP05C,aAAcA,EAGd8B,WAAY,EAGZC,UAvBgB,WAChBJ,EAAS59B,IAAI,QAAS29B,IAyBtBM,YAAa,KAEbC,eAAgB,KAEhBC,qBAAsB,KAEtBC,yBAA0B,KAE1BC,8BAA+B,MAI3BC,EAAerrD,KAAKsrD,gBAAgBr2C,GAC1C21C,EAAYM,qBAAuBG,EACnC,IAAM5I,EAASmI,EAAY5+C,OAAOq/C,EAAaj9C,OAC/C,QAAejH,IAAXs7C,GAKF,GAHAmI,EAAYG,YACZH,EAAYO,yBAA2B,KACvCP,EAAYQ,8BAAgC,KACxCR,EAAYjwC,WAAY,CAE1B,IAAMU,EAAW,IAAIkN,GACnBqiC,EAAYM,qBACZ,IAAIvC,GAAU3oD,KAAM4qD,EAAY31C,MAChC2J,IAEFgsC,EAAYjwC,WAAW,MAAM,EAAOU,QAEjC,CACL/B,GACE,qCACAmpC,EACAmI,EAAY31C,MAId21C,EAAYrkB,OAASijB,GAAkB+B,IACvC,IAAMC,EAAYxrD,KAAKyqD,sBAAsBgB,QAAQx2C,GAC/Cy2C,EAAYF,EAAUztC,YAAc,GAC1C2tC,EAAUrpD,KAAKuoD,GAEfY,EAAUG,SAASD,GAKnB,IAAIE,SACJ,GACoB,iBAAXnJ,GACI,OAAXA,GACAp4C,EAASo4C,EAAQ,aAEjBmJ,EAAkBrhD,EAAQk4C,EAAQ,aAClCp/C,EACE8V,GAAgByyC,GAChB,yHAOFA,GAFE5rD,KAAKqhD,gBAAgBtpB,uBAAuB9iB,IAC5CyP,GAAaxH,YACeJ,cAAc1O,MAE9Cw9C,EAAoDA,EAEpD,IAAMr8B,EAAevvB,KAAK0iD,uBACpBC,EAAoBlmC,GAAagmC,EAAQmJ,GACzC3vC,EAAUuT,GACdmzB,EACApzB,GAEFq7B,EAAYO,yBAA2BxI,EACvCiI,EAAYQ,8BAAgCnvC,EAC5C2uC,EAAYK,eAAiBjrD,KAAK4iD,kBAElC,IAAMjoB,EAAS36B,KAAKqhD,gBAAgBwB,mBAClC5tC,EACAgH,EACA2uC,EAAYK,eACZL,EAAY5B,cAEdhpD,KAAKshD,YAAYC,0BAA0BtsC,EAAM0lB,GAEjD36B,KAAK6rD,2BAURpK,GAAKvhD,UAAkBorD,gBAAkB,SACxCr2C,EACA62C,GAEA,OACE9rD,KAAKqhD,gBAAgBtpB,uBAAuB9iB,EAAM62C,IAClDpnC,GAAaxH,YAchBukC,GAAKvhD,UAAkB2rD,uBAAyB,SAC/CjwC,GAD+C,WAQ/C,gBAPAA,EAA4B5b,KAAKyqD,uBAG5B7uC,GACH5b,KAAK+rD,qCAAqCnwC,GAGpB,OAApBA,EAAKmC,WAAqB,CAC5B,IAAMiuC,EAAQhsD,KAAKisD,uBAAuBrwC,GAC1CvY,EAAsB,EAAf2oD,EAAMrrD,OAAY,yCAEVqrD,EAAMnhC,MACnB,SAAC+/B,GAA6B,OAAAA,EAAYrkB,SAAWijB,GAAkB+B,OAKvEvrD,KAAKksD,sBAAsBtwC,EAAK3G,OAAQ+2C,QAEjCpwC,EAAKouC,eACdpuC,EAAKwJ,aAAa,SAAA/H,GAChB5V,EAAKokD,uBAAuBxuC,MAYjCokC,GAAKvhD,UAAkBgsD,sBAAwB,SAC9Cj3C,EACA+2C,GASA,IAX8C,WAKxCG,EAAeH,EAAMvhD,IAAI,SAAS2hD,GACtC,OAAOA,EAAInB,iBAEPoB,EAAcrsD,KAAKsrD,gBAAgBr2C,EAAMk3C,GAC3CG,EAAaD,EACXE,EAAaF,EAAY7mC,OACtBhlB,EAAI,EAAGA,EAAIwrD,EAAMrrD,OAAQH,IAAK,CACrC,IAAM4rD,EAAMJ,EAAMxrD,GAClB6C,EACE+oD,EAAI7lB,SAAWijB,GAAkB+B,IACjC,iEAEFa,EAAI7lB,OAASijB,GAAkBgD,KAC/BJ,EAAItB,aACJ,IAAMt2C,EAAeZ,GAAKY,aAAaS,EAAMm3C,EAAIn3C,MAEjDq3C,EAAaA,EAAW5uC,YACtBlJ,EACA43C,EAAIjB,0BAIR,IAAMsB,EAAaH,EAAWl+C,KAAI,GAC5Bs+C,EAAaz3C,EAGnBjV,KAAK8oC,QAAQ2V,IACXiO,EAAWvjD,WACXsjD,EACA,SAAClmB,GACC9+B,EAAK2kC,KAAK,2BAA4B,CACpCn3B,KAAMy3C,EAAWvjD,WACjBo9B,WAGF,IAAI5L,EAAkB,GACtB,GAAe,OAAX4L,EAAiB,CAInB,IADA,IAAMla,EAAY,GACT7rB,EAAI,EAAGA,EAAIwrD,EAAMrrD,OAAQH,IAAK,CAKrC,GAJAwrD,EAAMxrD,GAAG+lC,OAASijB,GAAkBmD,UACpChyB,EAASA,EAAO33B,OACdyE,EAAK45C,gBAAgB3qB,aAAas1B,EAAMxrD,GAAGyqD,iBAEzCe,EAAMxrD,GAAGma,WAAY,CAEvB,IAAMiB,EAAOowC,EAAMxrD,GAAG4qD,8BAChBliC,EAAM,IAAIy/B,GAAUlhD,EAAMukD,EAAMxrD,GAAGyU,MACnCoG,EAAW,IAAIkN,GAAa3M,EAAMsN,EAAKtK,IAC7CyN,EAAUhqB,KACR2pD,EAAMxrD,GAAGma,WAAWzK,KAAK,KAAM,MAAM,EAAMmL,IAG/C2wC,EAAMxrD,GAAGuqD,YAIXtjD,EAAKskD,qCACHtkD,EAAKgjD,sBAAsBgB,QAAQx2C,IAGrCxN,EAAKokD,yBAELpkD,EAAK65C,YAAYC,0BAA0BtsC,EAAM0lB,GAGjD,IAASn6B,EAAI,EAAGA,EAAI6rB,EAAU1rB,OAAQH,IACpCyS,GAAeoZ,EAAU7rB,QAEtB,CAEL,GAAe,cAAX+lC,EACF,IAAS/lC,EAAI,EAAGA,EAAIwrD,EAAMrrD,OAAQH,IAC5BwrD,EAAMxrD,GAAG+lC,SAAWijB,GAAkBoD,iBACxCZ,EAAMxrD,GAAG+lC,OAASijB,GAAkBqD,YACjCb,EAAMxrD,GAAG+lC,OAASijB,GAAkB+B,QAEtC,CACL9hD,GACE,kBAAoBijD,EAAWvjD,WAAa,YAAco9B,GAE5D,IAAS/lC,EAAI,EAAGA,EAAIwrD,EAAMrrD,OAAQH,IAChCwrD,EAAMxrD,GAAG+lC,OAASijB,GAAkBqD,YACpCb,EAAMxrD,GAAGwqD,YAAczkB,EAI3B9+B,EAAK26C,mBAAmBntC,KAG5Bs3C,IAgBH9K,GAAKvhD,UAAkBkiD,mBAAqB,SAASpY,GACpD,IAAM8iB,EAA0B9sD,KAAK+sD,4BAA4B/iB,GAC3D/0B,EAAO63C,EAAwB73C,OAE/B+2C,EAAQhsD,KAAKisD,uBAAuBa,GAG1C,OAFA9sD,KAAKgtD,uBAAuBhB,EAAO/2C,GAE5BA,GAURwsC,GAAKvhD,UAAkB8sD,uBAAyB,SAC/ChB,EACA/2C,GAEA,GAAqB,IAAjB+2C,EAAMrrD,OAAV,CAeA,IATA,IAgGcoqD,EAhGR1+B,EAAY,GACdsO,EAAkB,GAKhBwxB,EAHcH,EAAM9wB,OAAO,SAASwjB,GACxC,OAAOA,EAAEnY,SAAWijB,GAAkB+B,MAEP9gD,IAAI,SAASi0C,GAC5C,OAAOA,EAAEuM,iBAEFzqD,EAAI,EAAGA,EAAIwrD,EAAMrrD,OAAQH,IAAK,CACrC,IAAMoqD,EAAcoB,EAAMxrD,GACpBgU,EAAeZ,GAAKY,aAAaS,EAAM21C,EAAY31C,MACrDg4C,GAAmB,EACrBjC,SAMF,GALA3nD,EACmB,OAAjBmR,EACA,iEAGEo2C,EAAYrkB,SAAWijB,GAAkBqD,YAC3CI,GAAmB,EACnBjC,EAAcJ,EAAYI,YAC1BrwB,EAASA,EAAO33B,OACdhD,KAAKqhD,gBAAgB3qB,aAAak0B,EAAYK,gBAAgB,SAE3D,GAAIL,EAAYrkB,SAAWijB,GAAkB+B,IAClD,GAAIX,EAAYE,YAAerJ,GAAa+I,yBAC1CyC,GAAmB,EACnBjC,EAAc,WACdrwB,EAASA,EAAO33B,OACdhD,KAAKqhD,gBAAgB3qB,aAAak0B,EAAYK,gBAAgB,QAE3D,CAEL,IAAMiC,EAAcltD,KAAKsrD,gBACvBV,EAAY31C,KACZk3C,GAEFvB,EAAYM,qBAAuBgC,EACnC,IAAM/qB,EAAU6pB,EAAMxrD,GAAGwL,OAAOkhD,EAAY9+C,OAC5C,QAAgBjH,IAAZg7B,EAAuB,CACzB7oB,GACE,qCACA6oB,EACAyoB,EAAY31C,MAEd,IAAIk4C,EAAc1wC,GAAa0lB,GAEV,iBAAZA,GACI,MAAXA,GACA93B,EAAS83B,EAAS,eAGlBgrB,EAAcA,EAAY5vC,eAAe2vC,EAAYpwC,gBAGvD,IAAMswC,EAAaxC,EAAYK,eACzB17B,EAAevvB,KAAK0iD,uBACpB2K,EAAkB79B,GACtB29B,EACA59B,GAGFq7B,EAAYO,yBAA2BgC,EACvCvC,EAAYQ,8BAAgCiC,EAC5CzC,EAAYK,eAAiBjrD,KAAK4iD,kBAElCuJ,EAAansB,OAAOmsB,EAAa71C,QAAQ82C,GAAa,GAStDzyB,GARAA,EAASA,EAAO33B,OACdhD,KAAKqhD,gBAAgBwB,mBACnB+H,EAAY31C,KACZo4C,EACAzC,EAAYK,eACZL,EAAY5B,gBAGAhmD,OACdhD,KAAKqhD,gBAAgB3qB,aAAa02B,GAAY,SAGhDH,GAAmB,EACnBjC,EAAc,SACdrwB,EAASA,EAAO33B,OACdhD,KAAKqhD,gBAAgB3qB,aAAak0B,EAAYK,gBAAgB,IAOtE,GAFAjrD,KAAKshD,YAAYC,0BAA0BtsC,EAAM0lB,GACjDA,EAAS,GACLsyB,IAEFjB,EAAMxrD,GAAG+lC,OAASijB,GAAkBmD,UAI1B5B,EAEPiB,EAAMxrD,GAAGuqD,UADV73C,WAAW63C,EAAW94C,KAAKI,MAAM,IAG/B25C,EAAMxrD,GAAGma,YACX,GAAoB,WAAhBqwC,EAA0B,CAC5B,IAAM9hC,EAAM,IAAIy/B,GAAU3oD,KAAMgsD,EAAMxrD,GAAGyU,MAEnCq4C,EAAiCtB,EAAMxrD,GAAG0qD,qBAC1C7vC,EAAW,IAAIkN,GAAa+kC,EAAWpkC,EAAKtK,IAClDyN,EAAUhqB,KAAK2pD,EAAMxrD,GAAGma,WAAWzK,KAAK,KAAM,MAAM,EAAOmL,SAE3DgR,EAAUhqB,KACR2pD,EAAMxrD,GAAGma,WAAWzK,KAAK,KAAM,IAAIzM,MAAMunD,IAAc,EAAO,OAQxEhrD,KAAK+rD,qCAAqC/rD,KAAKyqD,uBAG/C,IAASjqD,EAAI,EAAGA,EAAI6rB,EAAU1rB,OAAQH,IACpCyS,GAAeoZ,EAAU7rB,IAI3BR,KAAK6rD,2BAWNpK,GAAKvhD,UAAkB6sD,4BAA8B,SACpD93C,GAMA,IAJA,IAAIwI,EAGA8vC,EAAkBvtD,KAAKyqD,sBAEK,QAA7BhtC,EAAQxI,EAAKX,aACiB,OAA/Bi5C,EAAgBxvC,YAEhBwvC,EAAkBA,EAAgB9B,QAAQhuC,GAC1CxI,EAAOA,EAAKR,WAGd,OAAO84C,GAUR9L,GAAKvhD,UAAkB+rD,uBAAyB,SAC/CsB,GAGA,IAAMC,EAAkC,GAQxC,OAPAxtD,KAAKytD,mCAAmCF,EAAiBC,GAGzDA,EAAiBl8C,KAAK,SAAS7F,EAAGlM,GAChC,OAAOkM,EAAEo/C,MAAQtrD,EAAEsrD,QAGd2C,GAQR/L,GAAKvhD,UAAkButD,mCAAqC,SAC3D7xC,EACAowC,GAF2D,WAIrDN,EAAY9vC,EAAKmC,WACvB,GAAkB,OAAd2tC,EACF,IAAK,IAAIlrD,EAAI,EAAGA,EAAIkrD,EAAU/qD,OAAQH,IACpCwrD,EAAM3pD,KAAKqpD,EAAUlrD,IAIzBob,EAAKwJ,aAAa,SAAA5P,GAChB/N,EAAKgmD,mCAAmCj4C,EAAOw2C,MAUlDvK,GAAKvhD,UAAkB6rD,qCAAuC,SAC7DnwC,GAD6D,WAGvDowC,EAAQpwC,EAAKmC,WACnB,GAAIiuC,EAAO,CAET,IADA,IAAI0B,EAAK,EACAl5B,EAAO,EAAGA,EAAOw3B,EAAMrrD,OAAQ6zB,IAClCw3B,EAAMx3B,GAAM+R,SAAWijB,GAAkBmD,YAC3CX,EAAM0B,GAAM1B,EAAMx3B,GAClBk5B,KAGJ1B,EAAMrrD,OAAS+sD,EACf9xC,EAAK+vC,SAAwB,EAAfK,EAAMrrD,OAAaqrD,EAAQ,MAG3CpwC,EAAKwJ,aAAa,SAAA/H,GAChB5V,EAAKskD,qCAAqC1uC,MAY7CokC,GAAKvhD,UAAkB+iD,mBAAqB,SAAShuC,GAAT,WACrCwe,EAAezzB,KAAK+sD,4BAA4B93C,GAAMA,OAEtDs4C,EAAkBvtD,KAAKyqD,sBAAsBgB,QAAQx2C,GAY3D,OAVAs4C,EAAgBI,gBAAgB,SAAC/xC,GAC/BnU,EAAKmmD,yBAAyBhyC,KAGhC5b,KAAK4tD,yBAAyBL,GAE9BA,EAAgBpD,kBAAkB,SAACvuC,GACjCnU,EAAKmmD,yBAAyBhyC,KAGzB6X,GASRguB,GAAKvhD,UAAkB0tD,yBAA2B,SACjDhyC,GAEA,IAAMowC,EAAQpwC,EAAKmC,WACnB,GAAc,OAAViuC,EAAgB,CASlB,IANA,IAAM3/B,EAAY,GAIdsO,EAAkB,GAClBkzB,GAAY,EACPrtD,EAAI,EAAGA,EAAIwrD,EAAMrrD,OAAQH,IAChC,GAAIwrD,EAAMxrD,GAAG+lC,SAAWijB,GAAkBoD,uBAEnC,GAAIZ,EAAMxrD,GAAG+lC,SAAWijB,GAAkBgD,KAC/CnpD,EACEwqD,IAAartD,EAAI,EACjB,mDAIFwrD,EAFA6B,EAAWrtD,GAEF+lC,OAASijB,GAAkBoD,iBACpCZ,EAAMxrD,GAAGwqD,YAAc,WAWvB,GATA3nD,EACE2oD,EAAMxrD,GAAG+lC,SAAWijB,GAAkB+B,IACtC,0CAGFS,EAAMxrD,GAAGuqD,YACTpwB,EAASA,EAAO33B,OACdhD,KAAKqhD,gBAAgB3qB,aAAas1B,EAAMxrD,GAAGyqD,gBAAgB,IAEzDe,EAAMxrD,GAAGma,WAAY,CAEvB0R,EAAUhqB,KACR2pD,EAAMxrD,GAAGma,WAAWzK,KAAK,KAAM,IAAIzM,MAAM,QAAQ,EAFb,QAO1B,IAAdoqD,EAEFjyC,EAAK+vC,SAAS,MAGdK,EAAMrrD,OAASktD,EAAW,EAI5B7tD,KAAKshD,YAAYC,0BAA0B3lC,EAAK3G,OAAQ0lB,GACxD,IAASn6B,EAAI,EAAGA,EAAI6rB,EAAU1rB,OAAQH,IACpCyS,GAAeoZ,EAAU7rB,MC1uB/B,IAEIstD,GAFEC,GAAsB,4BAO5B,aAIU/tD,YAIJ,GAMIA,qBAA0B,EA8GpC,OA5GSguD,cAAP,WAIE,OAHKF,KACHA,GAAkB,IAAIE,GAEjBF,IAITE,sBAAA,WACE,IAAK,IAAMC,KAAWjuD,KAAKkuD,OACzB,IAAK,IAAMC,KAASnuD,KAAKkuD,OAAOD,GAC9BjuD,KAAKkuD,OAAOD,GAASE,GAAO7P,aAKlC0P,mBAAA,WACE,IAAK,IAAMC,KAAWjuD,KAAKkuD,OACzB,IAAK,IAAMC,KAASnuD,KAAKkuD,OAAOD,GAC9BjuD,KAAKkuD,OAAOD,GAASE,GAAOtK,UAWlCmK,4BAAA,SAAgB1N,EAAkBtO,GAChC,IAAMmc,EAAgBnc,GAAOsO,EAAIxY,QAAQimB,SAC3B5mD,IAAVgnD,GACF39C,GACE,8DACEu9C,GACA,kDAIN,IAAMt2C,EAAYF,GAAc42C,GAC1Bp2C,EAAWN,EAAUM,SAY3B,OAVAyC,GAAY,gCAAiC,EAAG/C,GAC3CA,EAAUxC,KAAKzK,WAClBgG,GACE,4FAKSxQ,KAAKouD,WAAWr2C,EAAUuoC,GAE3BuI,UAQdmF,uBAAA,SAAWhjC,GACT,IAAMqjC,EAAW9jD,EAAQvK,KAAKkuD,OAAQljC,EAAKs1B,IAAIxyC,MAE1CugD,GAAY9jD,EAAQ8jD,EAAUrjC,EAAKsqB,UAAUr+B,iBAAmB+T,GACnExa,GACE,YAAYwa,EAAKs1B,IAAIxyC,SAAQkd,EAAKsqB,yCAGtCtqB,EAAKszB,mBACE+P,EAASrjC,EAAKsqB,UAAUr+B,gBAWjC+2C,uBAAA,SAAWj2C,EAAoBuoC,GAC7B,IAAI+N,EAAW9jD,EAAQvK,KAAKkuD,OAAQ5N,EAAIxyC,MAEnCugD,IACHA,EAAW,GACXruD,KAAKkuD,OAAO5N,EAAIxyC,MAAQugD,GAG1B,IAAIrjC,EAAOzgB,EAAQ8jD,EAAUt2C,EAASd,eAStC,OARI+T,GACFxa,GACE,2HAGJwa,EAAO,IAAIy2B,GAAK1pC,EAAU/X,KAAKsuD,eAAgBhO,GAC/C+N,EAASt2C,EAASd,eAAiB+T,GASrCgjC,4BAAA,SAAgB3N,GACdrgD,KAAKsuD,eAAiBjO,sBC9GxB,WAAoB5lC,IAAAza,WAAAya,aACKgnC,IACrBjxC,GACE,wEAKJxQ,KAAKmhB,MAAQ,IAAIwnC,GAAUluC,EAAO7G,GAAK4c,OAEvCxwB,KAAKuuD,SAAW,IAAIC,GAAkBxuD,MAkF1C,OA/EER,sBAAI+kD,uBAAJ,WACE,OAAOvkD,KAAKya,MAAM6lC,qCAepBiE,gBAAA,SAAItvC,GAIF,OAHAjV,KAAKyuD,cAAc,OACnBviD,EAAiB,eAAgB,EAAG,EAAGxL,UAAUC,QAE7CsU,aAAgB0zC,GACX3oD,KAAK0uD,WAAWz5C,EAAK9L,iBAGdhC,IAAT8N,EAAqBjV,KAAKmhB,MAAM3L,MAAMP,GAAQjV,KAAKmhB,OAU5DojC,uBAAA,SAAWvS,GAET,IAAM2c,EAAU,sBAChB3uD,KAAKyuD,cAAcE,GACnBziD,EAAiByiD,EAAS,EAAG,EAAGjuD,UAAUC,QAC1C,IAAMiuD,EAAYr3C,GAAcy6B,GAChCx3B,GAAYm0C,EAAS,EAAGC,GAExB,IAAM72C,EAAW62C,EAAU72C,SAa3B,OAZIA,EAAS/B,OAAWhW,KAAKya,MAAc66B,UAAuBt/B,MAChExF,GACEm+C,EACE,2DAEA52C,EAAS/B,KACT,iBACEhW,KAAKya,MAAc66B,UAAuBt/B,KAC5C,KAIChW,KAAKkpB,IAAI0lC,EAAU35C,KAAK9L,aAMzBo7C,0BAAR,SAAsBoK,GACD,OAAf3uD,KAAKya,OACPjK,GAAM,eAAiBm+C,EAAU,4BAKrCpK,sBAAA,WACEr4C,EAAiB,qBAAsB,EAAG,EAAGxL,UAAUC,QACvDX,KAAKyuD,cAAc,aACnBzuD,KAAKya,MAAM6jC,aAGbiG,qBAAA,WACEr4C,EAAiB,oBAAqB,EAAG,EAAGxL,UAAUC,QACtDX,KAAKyuD,cAAc,YACnBzuD,KAAKya,MAAMopC,UApGGU,cAAc,CAC5BsK,UAAW,CACTC,MAAO,iCAwGX,WAAmBjG,GAAA7oD,cAAA6oD,EAYrB,OATQ2F,mBAAN,kB9FjFwBztD,OAAwBguD,8C8FkF7C/uD,KAAK6oD,SAAiB4F,cAAc,UACrCT,GAAYpU,cAAcoV,WAAYhvD,KAAK6oD,SAAiBpuC,OAE3Dza,KAAK6oD,SAAiBpuC,MAAQ,KAC9Bza,KAAK6oD,SAAiB1nC,MAAQ,KAC/BnhB,KAAK6oD,SAAS0F,SAAW,KACzBvuD,KAAK6oD,SAAW,Y9FvFT,KADoCoG,EAAZC,YACbD,EAAI3nD,UAAU,SAAUC,EAASC,GAC/C,SAAS2nD,EAAUhtD,GAAS,IAAMI,EAAKwsD,EAAUttD,KAAKU,IAAW,MAAOG,GAAKkF,EAAOlF,IACpF,SAAS8sD,EAASjtD,GAAS,IAAMI,EAAKwsD,EAAiB,MAAE5sD,IAAW,MAAOG,GAAKkF,EAAOlF,IACvF,SAASC,EAAKid,GAAUA,EAAOtd,KAAOqF,EAAQiY,EAAOrd,OAAS,IAAI8sD,EAAE,SAAU1nD,GAAWA,EAAQiY,EAAOrd,SAAWylC,KAAKunB,EAAWC,GACnI7sD,GAAMwsD,EAAYA,EAAUluD,MAAME,EAASmuD,GAAc,KAAKztD,UAL/D,IAAmBV,EAASmuD,EAAYD,EAAGF,2C+FpClB,WAC9Bhc,GAAoBsc,gBACpB5iB,GAAsB6iB,8BAGO,WAC7B7iB,GAAsB4iB,uCAIa,WACnC,OAAOtc,GAAiC,wCAGF,SACtC7pB,EACAvhB,GAECuhB,EAAI8B,KAAK01B,sBAA8B1B,uBAAyBr3C,SAG9C,SAASuhB,EAAgB46B,GAC5C56B,EAAI8B,KAAKme,MAAM2a,0BAGoB,SAAS56B,EAAgBk7B,GAC5Dl7B,EAAI8B,KAAKukC,sBAAsBnL,oBAGF,SAASl7B,GACtC,OAAOA,EAAI8B,KAAK42B,qCAGiB,SACjC14B,EACAvhB,GAEA,OAAOuhB,EAAI8B,KAAKwkC,qBAAqB7nD,MC3C1B8nD,GAAiBhW,GAM7BA,GAAqBv5C,UAAkBwvD,aAAe,SACrD77C,EACA8G,GAEA3a,KAAKo6C,YAAY,IAAK,CAAEx6C,EAAGiU,GAAc8G,IAO1C8+B,GAAqBv5C,UAAkByvD,KAAO,SAC7C/mD,EACAgnD,GAEA5vD,KAAKo6C,YAAY,OAAQ,CAAE96C,EAAGsJ,GAAQgnD,IAIjC,ICd0BviD,GnBbHqrC,GkB2BjBmX,GAAqBla,GA2BrBma,GAAmBt5C,wEArBN,SAASu5C,GACjC,IAAMC,EAASvW,GAAqBv5C,UAAUu+C,IAY9C,OAXAhF,GAAqBv5C,UAAUu+C,IAAM,SACnC5qC,EACAjL,EACAqnD,EACAC,QAEiB/oD,IAAb+oD,IACFA,EAAWH,KAEbC,EAAOpvD,KAAKZ,KAAM6T,EAAYjL,EAAMqnD,EAAgBC,IAE/C,WACLzW,GAAqBv5C,UAAUu+C,IAAMuR,wCAaV,SAASpmC,GACtC,OAAOA,EAAMuE,mCAQgB,SAASkyB,GACtC2N,GAAYpU,cAAcyG,gBAAgBA,MC3DtC8P,GAAc5L,GAAS4L,YnBXCzX,ImBaGrrC,GA4BhB+iD,IA1BQhtD,YnBdvBA,GAAcs1C,GmBiBKrrC,GAAgCkhD,SAAS8B,gBAC1D,WACA,SAAC/P,EAAKgQ,EAAQte,GAAQ,OAAAgc,GAAYpU,cAAc2W,gBAAgBjQ,EAAKtO,IAErE,CACE2W,aACAx9B,SACAo5B,YACAh8B,gBACAxY,gBACAw+C,YACA4B,eACAK,gBAEF,MACA"}