{"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/util/CountedSet.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/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 * @param {*} assertion The assertion to be tested for falsiness\n * @param {!string} message The message to display if the check fails\n */\nexport const assert = function(assertion, message) {\n  if (!assertion) {\n    throw assertionError(message);\n  }\n};\n\n/**\n * Returns an Error object suitable for throwing.\n * @param {string} message\n * @return {!Error}\n */\nexport const assertionError = function(message) {\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) {\n  // TODO(user): Use native implementations if/when available\n  var out = [],\n    p = 0;\n  for (var i = 0; i < str.length; i++) {\n    var 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 {Array<number>} bytes Array of numbers representing characters.\n * @return {string} Stringification of the array.\n */\nconst byteArrayToString = function(bytes) {\n  // TODO(user): Use native implementations if/when available\n  var out = [],\n    pos = 0,\n    c = 0;\n  while (pos < bytes.length) {\n    var c1 = bytes[pos++];\n    if (c1 < 128) {\n      out[c++] = String.fromCharCode(c1);\n    } else if (c1 > 191 && c1 < 224) {\n      var c2 = bytes[pos++];\n      out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\n    } else if (c1 > 239 && c1 < 365) {\n      // Surrogate Pair\n      var c2 = bytes[pos++];\n      var c3 = bytes[pos++];\n      var c4 = bytes[pos++];\n      var 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      var c2 = bytes[pos++];\n      var 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_()\nexport const base64 = {\n  /**\n   * Maps bytes to characters.\n   * @type {Object}\n   * @private\n   */\n  byteToCharMap_: null,\n\n  /**\n   * Maps characters to bytes.\n   * @type {Object}\n   * @private\n   */\n  charToByteMap_: null,\n\n  /**\n   * Maps bytes to websafe characters.\n   * @type {Object}\n   * @private\n   */\n  byteToCharMapWebSafe_: null,\n\n  /**\n   * Maps websafe characters to bytes.\n   * @type {Object}\n   * @private\n   */\n  charToByteMapWebSafe_: null,\n\n  /**\n   * Our default alphabet, shared between\n   * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n   * @type {string}\n   */\n  ENCODED_VALS_BASE:\n    'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n  /**\n   * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n   * @type {string}\n   */\n  get ENCODED_VALS() {\n    return this.ENCODED_VALS_BASE + '+/=';\n  },\n\n  /**\n   * Our websafe alphabet.\n   * @type {string}\n   */\n  get ENCODED_VALS_WEBSAFE() {\n    return this.ENCODED_VALS_BASE + '-_.';\n  },\n\n  /**\n   * Whether this browser supports the atob and btoa functions. This extension\n   * started at Mozilla but is now implemented by many browsers. We use the\n   * ASSUME_* variables to avoid pulling in the full useragent detection library\n   * but still allowing the standard per-browser compilations.\n   *\n   * @type {boolean}\n   */\n  HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n  /**\n   * Base64-encode an array of bytes.\n   *\n   * @param {Array<number>|Uint8Array} input An array of bytes (numbers with\n   *     value in [0, 255]) to encode.\n   * @param {boolean=} opt_webSafe Boolean indicating we should use the\n   *     alternative alphabet.\n   * @return {string} The base64 encoded string.\n   */\n  encodeByteArray(input, opt_webSafe?) {\n    if (!Array.isArray(input)) {\n      throw Error('encodeByteArray takes an array as a parameter');\n    }\n\n    this.init_();\n\n    var byteToCharMap = opt_webSafe\n      ? this.byteToCharMapWebSafe_\n      : this.byteToCharMap_;\n\n    var output = [];\n\n    for (var i = 0; i < input.length; i += 3) {\n      var byte1 = input[i];\n      var haveByte2 = i + 1 < input.length;\n      var byte2 = haveByte2 ? input[i + 1] : 0;\n      var haveByte3 = i + 2 < input.length;\n      var byte3 = haveByte3 ? input[i + 2] : 0;\n\n      var outByte1 = byte1 >> 2;\n      var outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n      var outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n      var 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 {string} input A string to encode.\n   * @param {boolean=} opt_webSafe If true, we should use the\n   *     alternative alphabet.\n   * @return {string} The base64 encoded string.\n   */\n  encodeString(input, opt_webSafe) {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\n      return btoa(input);\n    }\n    return this.encodeByteArray(stringToByteArray(input), opt_webSafe);\n  },\n\n  /**\n   * Base64-decode a string.\n   *\n   * @param {string} input to decode.\n   * @param {boolean=} opt_webSafe True if we should use the\n   *     alternative alphabet.\n   * @return {string} string representing the decoded value.\n   */\n  decodeString(input, opt_webSafe) {\n    // Shortcut for Mozilla browsers that implement\n    // a native base64 encoder in the form of \"btoa/atob\"\n    if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\n      return atob(input);\n    }\n    return byteArrayToString(this.decodeStringToByteArray(input, opt_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 {string} input Input to decode.\n   * @param {boolean=} opt_webSafe True if we should use the web-safe alphabet.\n   * @return {!Array<number>} bytes representing the decoded value.\n   */\n  decodeStringToByteArray(input, opt_webSafe) {\n    this.init_();\n\n    var charToByteMap = opt_webSafe\n      ? this.charToByteMapWebSafe_\n      : this.charToByteMap_;\n\n    var output = [];\n\n    for (var i = 0; i < input.length; ) {\n      var byte1 = charToByteMap[input.charAt(i++)];\n\n      var haveByte2 = i < input.length;\n      var byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n      ++i;\n\n      var haveByte3 = i < input.length;\n      var byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n      ++i;\n\n      var haveByte4 = i < input.length;\n      var 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      var outByte1 = (byte1 << 2) | (byte2 >> 4);\n      output.push(outByte1);\n\n      if (byte3 != 64) {\n        var outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n        output.push(outByte2);\n\n        if (byte4 != 64) {\n          var outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n          output.push(outByte3);\n        }\n      }\n    }\n\n    return output;\n  },\n\n  /**\n   * Lazy static initialization function. Called before\n   * accessing any of the static map variables.\n   * @private\n   */\n  init_() {\n    if (!this.byteToCharMap_) {\n      this.byteToCharMap_ = {};\n      this.charToByteMap_ = {};\n      this.byteToCharMapWebSafe_ = {};\n      this.charToByteMapWebSafe_ = {};\n\n      // We want quick mappings back and forth, so we precompute two maps.\n      for (var 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 * @param {!string} str\n * @return {!string}\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 {string} str To be decoded\n * @return {?string} Decoded result, if possible\n */\nexport const base64Decode = function(str: string): string | null {\n  try {\n    return base64.decodeString(str, true);\n  } catch (e) {\n    console.error('base64Decode failed: ', e);\n  }\n  return null;\n};\n","/**\n * @license\n * Copyright 2017 Google 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<T>(value: T): T {\n  return deepExtend(undefined, value);\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: any, source: any): any {\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      let dateValue = (source as any) 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 (let prop in source) {\n    if (!source.hasOwnProperty(prop)) {\n      continue;\n    }\n    target[prop] = deepExtend(target[prop], source[prop]);\n  }\n\n  return target;\n}\n\n// TODO: Really needed (for JSCompiler type checking)?\nexport function patchProperty(obj: any, prop: string, value: any) {\n  obj[prop] = 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\nexport class Deferred<R> {\n  promise: Promise<R>;\n  reject;\n  resolve;\n  constructor() {\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = resolve;\n      this.reject = reject;\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   * @param {((?function(?(Error)): (?|undefined))| (?function(?(Error),?=): (?|undefined)))=} callback\n   * @return {!function(?(Error), ?=)}\n   */\n  wrapCallback(callback?) {\n    return (error, value?) => {\n      if (error) {\n        this.reject(error);\n      } else {\n        this.resolve(value);\n      }\n      if (typeof callback === 'function') {\n        // Attaching noop handler just in case developer wasn't expecting\n        // promises\n        this.promise.catch(() => {});\n\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 {string} user agent string\n */\nexport const getUA = function() {\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 in the Ripple emulator) nor\n * Cordova `onDeviceReady`, which would normally wait for a callback.\n *\n * @return {boolean} isMobileCordova\n */\nexport const isMobileCordova = function() {\n  return (\n    typeof window !== 'undefined' &&\n    !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\n    /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA())\n  );\n};\n\n/**\n * Detect React Native.\n *\n * @return {boolean} True if ReactNative environment is detected.\n */\nexport const isReactNative = function() {\n  return (\n    typeof navigator === 'object' && navigator['product'] === 'ReactNative'\n  );\n};\n\n/**\n * Detect Node.js.\n *\n * @return {boolean} True if Node.js environment is detected.\n */\nexport const isNodeSdk = function() {\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<Err, string> = {\n *     'generic-error': \"Unknown error\",\n *     'file-not-found': \"Could not find file: {$file}\",\n *   };\n *\n *   // Type-safe function - must pass a valid error code as param.\n *   let error = new ErrorFactory<Err>('service', 'Service', errors);\n *\n *   ...\n *   throw error.create(Err.GENERIC);\n *   ...\n *   throw error.create(Err.FILE_NOT_FOUND, {'file': fileName});\n *   ...\n *   // Service: Could not file file: foo.txt (service/file-not-found).\n *\n *   catch (e) {\n *     assert(e.message === \"Could not find file: foo.txt.\");\n *     if (e.code === 'service/file-not-found') {\n *       console.log(\"Could not read file: \" + e['file']);\n *     }\n *   }\n */\nexport type ErrorList<T> = { [code: string]: string };\n\nconst ERROR_NAME = 'FirebaseError';\n\nexport interface StringLike {\n  toString: () => string;\n}\n\nlet captureStackTrace: (obj: Object, fn?: Function) => void = (Error as any)\n  .captureStackTrace;\n\n// Export for faking in tests\nexport function patchCapture(captureFake?: any): any {\n  let result: any = captureStackTrace;\n  captureStackTrace = captureFake;\n  return result;\n}\n\nexport interface FirebaseError {\n  // Unique code for error - format is service/error-code-string\n  code: string;\n\n  // Developer-friendly error message.\n  message: string;\n\n  // Always 'FirebaseError'\n  name: string;\n\n  // Where available - stack backtrace in a string\n  stack: string;\n}\n\nexport class FirebaseError implements FirebaseError {\n  public stack: string;\n  public name: string;\n\n  constructor(public code: string, public message: string) {\n    let stack: string;\n    // We want the stack value, if implemented by Error\n    if (captureStackTrace) {\n      // Patches this.stack, omitted calls above ErrorFactory#create\n      captureStackTrace(this, ErrorFactory.prototype.create);\n    } else {\n      try {\n        // In case of IE11, stack will be set only after error is raised.\n        // https://docs.microsoft.com/en-us/scripting/javascript/reference/stack-property-error-javascript\n        throw Error.apply(this, arguments);\n      } catch (err) {\n        this.name = ERROR_NAME;\n        // Make non-enumerable getter for the property.\n        Object.defineProperty(this, 'stack', {\n          get: function() {\n            return err.stack;\n          }\n        });\n      }\n    }\n  }\n}\n\n// Back-door inheritance\nFirebaseError.prototype = Object.create(Error.prototype) as FirebaseError;\nFirebaseError.prototype.constructor = FirebaseError;\n(FirebaseError.prototype as any).name = ERROR_NAME;\n\nexport class ErrorFactory<T extends string> {\n  // Matches {$name}, by default.\n  public pattern = /\\{\\$([^}]+)}/g;\n\n  constructor(\n    private service: string,\n    private serviceName: string,\n    private errors: ErrorList<T>\n  ) {\n    // empty\n  }\n\n  create(code: T, data?: { [prop: string]: StringLike }): FirebaseError {\n    if (data === undefined) {\n      data = {};\n    }\n\n    let template = this.errors[code as string];\n\n    let fullCode = this.service + '/' + code;\n    let message: string;\n\n    if (template === undefined) {\n      message = 'Error';\n    } else {\n      message = template.replace(this.pattern, (match, key) => {\n        let value = data![key];\n        return value !== undefined ? value.toString() : '<' + key + '?>';\n      });\n    }\n\n    // Service: Error message (service/code).\n    message = this.serviceName + ': ' + message + ' (' + fullCode + ').';\n    let err = new FirebaseError(fullCode, message);\n\n    // Populate the Error object with message parts for programmatic\n    // accesses (e.g., e.file).\n    for (let prop in data) {\n      if (!data.hasOwnProperty(prop) || prop.slice(-1) === '_') {\n        continue;\n      }\n      (err as any)[prop] = data[prop];\n    }\n\n    return err;\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 * 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) {\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) {\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\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 *\n * @param {?string} token\n * @return {{header: *, claims: *, data: *, signature: string}}\n */\nexport const decode = function(token) {\n  var header = {},\n    claims = {},\n    data = {},\n    signature = '';\n\n  try {\n    var parts = token.split('.');\n    header = jsonEval(base64Decode(parts[0]) || '');\n    claims = jsonEval(base64Decode(parts[1]) || '');\n    signature = parts[2];\n    data = claims['d'] || {};\n    delete claims['d'];\n  } catch (e) {}\n\n  return {\n    header: header,\n    claims: claims,\n    data: data,\n    signature: signature\n  };\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 *\n * @param {?string} token\n * @return {boolean}\n */\nexport const isValidTimestamp = function(token) {\n  var claims = decode(token).claims,\n    now = Math.floor(new Date().getTime() / 1000),\n    validSince,\n    validUntil;\n\n  if (typeof claims === 'object') {\n    if (claims.hasOwnProperty('nbf')) {\n      validSince = claims['nbf'];\n    } else if (claims.hasOwnProperty('iat')) {\n      validSince = claims['iat'];\n    }\n\n    if (claims.hasOwnProperty('exp')) {\n      validUntil = claims['exp'];\n    } else {\n      // token will expire after 24h by default\n      validUntil = validSince + 86400;\n    }\n  }\n\n  return (\n    now && validSince && validUntil && now >= validSince && 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 *\n * @param {?string} token\n * @return {?number}\n */\nexport const issuedAtTime = function(token) {\n  var claims = decode(token).claims;\n  if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n    return claims['iat'];\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 *\n * @param {?string} token\n * @return {boolean}\n */\nexport const isValidFormat = function(token) {\n  var 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 *\n * @param {?string} token\n * @return {boolean}\n */\nexport const isAdmin = function(token) {\n  var 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\n// See http://www.devthought.com/2012/01/18/an-object-is-not-a-hash/\n\nexport const contains = function(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nexport const safeGet = function(obj, key) {\n  if (Object.prototype.hasOwnProperty.call(obj, key)) return obj[key];\n  // else return undefined.\n};\n\n/**\n * Enumerates the keys/values in an object, excluding keys defined on the prototype.\n *\n * @param {?Object.<K,V>} obj Object to enumerate.\n * @param {!function(K, V)} fn Function to call for each key and value.\n * @template K,V\n */\nexport const forEach = function(obj, fn) {\n  for (var key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      fn(key, obj[key]);\n    }\n  }\n};\n\n/**\n * Copies all the (own) properties from one object to another.\n * @param {!Object} objTo\n * @param {!Object} objFrom\n * @return {!Object} objTo\n */\nexport const extend = function(objTo, objFrom) {\n  forEach(objFrom, function(key, value) {\n    objTo[key] = value;\n  });\n  return objTo;\n};\n\n/**\n * Returns a clone of the specified object.\n * @param {!Object} obj\n * @return {!Object} cloned obj.\n */\nexport const clone = function(obj) {\n  return extend({}, obj);\n};\n\n/**\n * Returns true if obj has typeof \"object\" and is not null.  Unlike goog.isObject(), does not return true\n * for functions.\n *\n * @param obj {*} A potential object.\n * @returns {boolean} True if it's an object.\n */\nexport const isNonNullObject = function(obj) {\n  return typeof obj === 'object' && obj !== null;\n};\n\nexport const isEmpty = function(obj) {\n  for (var key in obj) {\n    return false;\n  }\n  return true;\n};\n\nexport const getCount = function(obj) {\n  var rv = 0;\n  for (var key in obj) {\n    rv++;\n  }\n  return rv;\n};\n\nexport const map = function(obj, f, opt_obj?) {\n  var res = {};\n  for (var key in obj) {\n    res[key] = f.call(opt_obj, obj[key], key, obj);\n  }\n  return res;\n};\n\nexport const findKey = function(obj, fn, opt_this?) {\n  for (var key in obj) {\n    if (fn.call(opt_this, obj[key], key, obj)) {\n      return key;\n    }\n  }\n  return undefined;\n};\n\nexport const findValue = function(obj, fn, opt_this?) {\n  var key = findKey(obj, fn, opt_this);\n  return key && obj[key];\n};\n\nexport const getAnyKey = function(obj) {\n  for (var key in obj) {\n    return key;\n  }\n};\n\nexport const getValues = function(obj) {\n  var res = [];\n  var i = 0;\n  for (var key in obj) {\n    res[i++] = obj[key];\n  }\n  return res;\n};\n\n/**\n * Tests whether every key/value pair in an object pass the test implemented\n * by the provided function\n *\n * @param {?Object.<K,V>} obj Object to test.\n * @param {!function(K, V)} fn Function to call for each key and value.\n * @template K,V\n */\nexport const every = function<V>(\n  obj: Object,\n  fn: (k: string, v?: V) => boolean\n): boolean {\n  for (let key in obj) {\n    if (Object.prototype.hasOwnProperty.call(obj, key)) {\n      if (!fn(key, obj[key])) {\n        return false;\n      }\n    }\n  }\n  return 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/**\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   * @type {!Array<number>}\n   * @private\n   */\n  private chain_: Array<number> = [];\n\n  /**\n   * A buffer holding the partially computed hash result.\n   * @type {!Array<number>}\n   * @private\n   */\n  private buf_: Array<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   * @type {!Array<number>}\n   * @private\n   */\n  private W_: Array<number> = [];\n\n  /**\n   * Contains data needed to pad messages less than 64 bytes.\n   * @type {!Array<number>}\n   * @private\n   */\n  private pad_: Array<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 (var i = 1; i < this.blockSize; ++i) {\n      this.pad_[i] = 0;\n    }\n\n    this.reset();\n  }\n\n  reset() {\n    this.chain_[0] = 0x67452301;\n    this.chain_[1] = 0xefcdab89;\n    this.chain_[2] = 0x98badcfe;\n    this.chain_[3] = 0x10325476;\n    this.chain_[4] = 0xc3d2e1f0;\n\n    this.inbuf_ = 0;\n    this.total_ = 0;\n  }\n\n  /**\n   * Internal compress helper function.\n   * @param {!Array<number>|!Uint8Array|string} buf Block to compress.\n   * @param {number=} opt_offset Offset of the block in the buffer.\n   * @private\n   */\n  compress_(buf, opt_offset?) {\n    if (!opt_offset) {\n      opt_offset = 0;\n    }\n\n    var W = this.W_;\n\n    // get 16 big endian words\n    if (typeof buf === 'string') {\n      for (var 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(opt_offset) << 24) |\n          (buf.charCodeAt(opt_offset + 1) << 16) |\n          (buf.charCodeAt(opt_offset + 2) << 8) |\n          buf.charCodeAt(opt_offset + 3);\n        opt_offset += 4;\n      }\n    } else {\n      for (var i = 0; i < 16; i++) {\n        W[i] =\n          (buf[opt_offset] << 24) |\n          (buf[opt_offset + 1] << 16) |\n          (buf[opt_offset + 2] << 8) |\n          buf[opt_offset + 3];\n        opt_offset += 4;\n      }\n    }\n\n    // expand to 80 words\n    for (var i = 16; i < 80; i++) {\n      var t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n      W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\n    }\n\n    var a = this.chain_[0];\n    var b = this.chain_[1];\n    var c = this.chain_[2];\n    var d = this.chain_[3];\n    var e = this.chain_[4];\n    var f, k;\n\n    // TODO(user): Try to unroll this loop to speed up the computation.\n    for (var 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      var 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, opt_length?) {\n    // TODO(johnlenz): tighten the function signature and remove this check\n    if (bytes == null) {\n      return;\n    }\n\n    if (opt_length === undefined) {\n      opt_length = bytes.length;\n    }\n\n    var lengthMinusBlock = opt_length - this.blockSize;\n    var n = 0;\n    // Using local instead of member variables gives ~5% speedup on Firefox 16.\n    var buf = this.buf_;\n    var inbuf = this.inbuf_;\n\n    // The outer while loop should execute at most twice.\n    while (n < opt_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 < opt_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 < opt_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_ += opt_length;\n  }\n\n  /** @override */\n  digest() {\n    var digest = [];\n    var 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 (var 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    var n = 0;\n    for (var i = 0; i < 5; i++) {\n      for (var 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 {!string} fnName The function name\n * @param {!number} minCount The minimum number of arguments to allow for the function call\n * @param {!number} maxCount The maximum number of argument to allow for the function call\n * @param {!number} argCount The actual number of arguments provided.\n */\nexport const validateArgCount = function(fnName, minCount, maxCount, argCount) {\n  var 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    var 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 {!string} fnName The function name\n * @param {!number} argumentNumber The index of the argument\n * @param {boolean} optional Whether or not the argument is optional\n * @return {!string} The prefix to add to the error thrown for validation.\n */\nexport function errorPrefix(fnName, argumentNumber, optional) {\n  var 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  var error = fnName + ' failed: ';\n\n  error += argName + ' argument ';\n  return error;\n}\n\n/**\n * @param {!string} fnName\n * @param {!number} argumentNumber\n * @param {!string} namespace\n * @param {boolean} optional\n */\nexport function validateNamespace(fnName, argumentNumber, namespace, optional) {\n  if (optional && !namespace) return;\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(fnName, argumentNumber, callback, optional) {\n  if (optional && !callback) return;\n  if (typeof callback !== 'function')\n    throw new Error(\n      errorPrefix(fnName, argumentNumber, optional) +\n        'must be a valid function.'\n    );\n}\n\nexport function validateContextObject(\n  fnName,\n  argumentNumber,\n  context,\n  optional\n) {\n  if (optional && !context) return;\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 * @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) {\n  var out = [],\n    p = 0;\n  for (var i = 0; i < str.length; i++) {\n    var c = str.charCodeAt(i);\n\n    // Is this the lead surrogate in a surrogate pair?\n    if (c >= 0xd800 && c <= 0xdbff) {\n      var high = c - 0xd800; // the high 10 bits.\n      i++;\n      assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n      var 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) {\n  var p = 0;\n  for (var i = 0; i < str.length; i++) {\n    var 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: any[]\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) => {\n  if (logType < instance.logLevel) return;\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) {\n    this._logHandler(this, LogLevel.DEBUG, ...args);\n  }\n  log(...args) {\n    this._logHandler(this, LogLevel.VERBOSE, ...args);\n  }\n  info(...args) {\n    this._logHandler(this, LogLevel.INFO, ...args);\n  }\n  warn(...args) {\n    this._logHandler(this, LogLevel.WARN, ...args);\n  }\n  error(...args) {\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 { forEach } 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.<string>} The string, split into appropriately-sized chunks\n */\nexport const splitStringBySize = function(\n  str: string,\n  segsize: number\n): string[] {\n  const len = str.length;\n\n  if (len <= segsize) {\n    return [str];\n  }\n\n  const dataSegs = [];\n  for (let c = 0; c < len; c += segsize) {\n    if (c + segsize > len) {\n      dataSegs.push(str.substring(c, len));\n    } else {\n      dataSegs.push(str.substring(c, c + segsize));\n    }\n  }\n  return dataSegs;\n};\n\n/**\n * Apply a function to each (key, value) pair in an object or\n * apply a function to each (index, value) pair in an array\n * @param {!(Object|Array)} obj The object or array to iterate over\n * @param {function(?, ?)} fn The function to apply\n */\nexport const each = function(\n  obj: Object | Array<any>,\n  fn: (v?: any, k?: any) => void\n) {\n  if (Array.isArray(obj)) {\n    for (let i = 0; i < obj.length; ++i) {\n      fn(i, obj[i]);\n    }\n  } else {\n    /**\n     * in the conversion of code we removed the goog.object.forEach\n     * function which did a value,key callback. We standardized on\n     * a single impl that does a key, value callback. So we invert\n     * to not have to touch the `each` code points\n     */\n    forEach(obj, (key: any, val: any) => fn(val, key));\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.<string>} pathOrString Path string to parse,\n   *      or another path, or the raw tokens array\n   * @param {number=} pieceNum\n   */\n  constructor(pathOrString: string | string[], pieceNum?: number) {\n    if (pieceNum === void 0) {\n      this.pieces_ = (pathOrString as string).split('/');\n\n      // Remove empty pieces.\n      let copyTo = 0;\n      for (let i = 0; i < this.pieces_.length; i++) {\n        if (this.pieces_[i].length > 0) {\n          this.pieces_[copyTo] = this.pieces_[i];\n          copyTo++;\n        }\n      }\n      this.pieces_.length = copyTo;\n\n      this.pieceNum_ = 0;\n    } else {\n      this.pieces_ = pathOrString as string[];\n      this.pieceNum_ = pieceNum;\n    }\n  }\n\n  getFront(): string | null {\n    if (this.pieceNum_ >= this.pieces_.length) 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<string>}\n   */\n  slice(begin: number = 0): string[] {\n    return this.pieces_.slice(this.pieceNum_ + begin);\n  }\n\n  /**\n   * @return {?Path}\n   */\n  parent(): Path | null {\n    if (this.pieceNum_ >= this.pieces_.length) 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<string>} */\n  private parts_: string[];\n  /** @type {number} Initialize to number of '/' chars needed in path. */\n  private byteLength_: number;\n\n  /**\n   * @param {!Path} path Initial Path.\n   * @param {string} errorPrefix_ Prefix for any error messages.\n   */\n  constructor(path: Path, private errorPrefix_: string) {\n    /** @type {!Array<string>} */\n    this.parts_ = path.slice();\n    /** @type {number} Initialize to number of '/' chars needed in path. */\n    this.byteLength_ = Math.max(1, this.parts_.length);\n\n    for (let i = 0; i < this.parts_.length; i++) {\n      this.byteLength_ += stringLength(this.parts_[i]);\n    }\n    this.checkValid_();\n  }\n\n  /** @const {number} Maximum key depth. */\n  static get MAX_PATH_DEPTH() {\n    return 32;\n  }\n\n  /** @const {number} Maximum number of (UTF8) bytes in a Firebase path. */\n  static get MAX_PATH_LENGTH_BYTES() {\n    return 768;\n  }\n\n  /** @param {string} child */\n  push(child: string) {\n    // Count the needed '/'\n    if (this.parts_.length > 0) {\n      this.byteLength_ += 1;\n    }\n    this.parts_.push(child);\n    this.byteLength_ += stringLength(child);\n    this.checkValid_();\n  }\n\n  pop() {\n    const last = this.parts_.pop();\n    this.byteLength_ -= stringLength(last);\n    // Un-count the previous '/'\n    if (this.parts_.length > 0) {\n      this.byteLength_ -= 1;\n    }\n  }\n\n  private checkValid_() {\n    if (this.byteLength_ > ValidationPath.MAX_PATH_LENGTH_BYTES) {\n      throw new Error(\n        this.errorPrefix_ +\n          'has a key path longer than ' +\n          ValidationPath.MAX_PATH_LENGTH_BYTES +\n          ' bytes (' +\n          this.byteLength_ +\n          ').'\n      );\n    }\n    if (this.parts_.length > ValidationPath.MAX_PATH_DEPTH) {\n      throw new Error(\n        this.errorPrefix_ +\n          'path specified exceeds the maximum depth that can be written (' +\n          ValidationPath.MAX_PATH_DEPTH +\n          ') or object contains a cycle ' +\n          this.toErrorString()\n      );\n    }\n  }\n\n  /**\n   * String for use in error messages - uses '.' notation for path.\n   *\n   * @return {string}\n   */\n  toErrorString(): string {\n    if (this.parts_.length == 0) {\n      return '';\n    }\n    return \"in property '\" + this.parts_.join('.') + \"'\";\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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 { forEach } from '@firebase/util';\nimport { PersistentStorage } from './storage/storage';\nimport { LONG_POLLING, WEBSOCKET } from '../realtime/Constants';\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    forEach(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 <YOUR FIREBASE>.firebaseio.com instead'\n    );\n  }\n\n  // Catch common error of uninitialized namespace value.\n  if (\n    (!namespace || namespace == 'undefined') &&\n    parsedUrl.domain !== 'localhost'\n  ) {\n    fatal(\n      'Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com'\n    );\n  }\n\n  if (!parsedUrl.secure) {\n    warnIfPageIsSecure();\n  }\n\n  const webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\n\n  return {\n    repoInfo: new RepoInfo(\n      parsedUrl.host,\n      parsedUrl.secure,\n      namespace,\n      webSocketOnly\n    ),\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' && contains(val, '.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 { forEach, contains, safeGet } from '@firebase/util';\nimport { isInvalidJSONNumber } 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      hasActualChild = false;\n    forEach(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<!Path>} mergePaths\n */\nexport const validateFirebaseMergePaths = function(\n  errorPrefix: string,\n  mergePaths: Path[]\n) {\n  let i, curPath;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    const keys = curPath.slice();\n    for (let j = 0; j < keys.length; j++) {\n      if (keys[j] === '.priority' && j === keys.length - 1) {\n        // .priority is OK\n      } else if (!isValidKey(keys[j])) {\n        throw new Error(\n          errorPrefix +\n            'contains an invalid key (' +\n            keys[j] +\n            ') in path ' +\n            curPath.toString() +\n            '. Keys must be non-empty strings ' +\n            'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"'\n        );\n      }\n    }\n  }\n\n  // Check that update keys are not descendants of each other.\n  // We rely on the property that sorting guarantees that ancestors come\n  // right before descendants.\n  mergePaths.sort(Path.comparePaths);\n  let prevPath: Path | null = null;\n  for (i = 0; i < mergePaths.length; i++) {\n    curPath = mergePaths[i];\n    if (prevPath !== null && prevPath.contains(curPath)) {\n      throw new Error(\n        errorPrefix +\n          'contains a path ' +\n          prevPath.toString() +\n          ' that is ancestor of another path ' +\n          curPath.toString()\n      );\n    }\n    prevPath = curPath;\n  }\n};\n\n/**\n * pre-validate an object passed as an argument to firebase function (\n * must be an object - e.g. for firebase.update()).\n *\n * @param {string} fnName\n * @param {number} argumentNumber\n * @param {*} data\n * @param {!Path} path\n * @param {boolean} optional\n */\nexport const validateFirebaseMergeDataArg = function(\n  fnName: string,\n  argumentNumber: number,\n  data: 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  forEach(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<void> {\n    validateArgCount('OnDisconnect.cancel', 0, 1, arguments.length);\n    validateCallback('OnDisconnect.cancel', 1, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectCancel(\n      this.path_,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  remove(onComplete?: (a: Error | null) => void): Promise<void> {\n    validateArgCount('OnDisconnect.remove', 0, 1, arguments.length);\n    validateWritablePath('OnDisconnect.remove', this.path_);\n    validateCallback('OnDisconnect.remove', 1, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectSet(\n      this.path_,\n      null,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {*} value\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  set(value: any, onComplete?: (a: Error | null) => void): Promise<void> {\n    validateArgCount('OnDisconnect.set', 1, 2, arguments.length);\n    validateWritablePath('OnDisconnect.set', this.path_);\n    validateFirebaseDataArg('OnDisconnect.set', 1, value, this.path_, false);\n    validateCallback('OnDisconnect.set', 2, onComplete, true);\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectSet(\n      this.path_,\n      value,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {*} value\n   * @param {number|string|null} priority\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  setWithPriority(\n    value: any,\n    priority: number | string | null,\n    onComplete?: (a: Error | null) => void\n  ): Promise<void> {\n    validateArgCount('OnDisconnect.setWithPriority', 2, 3, arguments.length);\n    validateWritablePath('OnDisconnect.setWithPriority', this.path_);\n    validateFirebaseDataArg(\n      'OnDisconnect.setWithPriority',\n      1,\n      value,\n      this.path_,\n      false\n    );\n    validatePriority('OnDisconnect.setWithPriority', 2, priority, false);\n    validateCallback('OnDisconnect.setWithPriority', 3, onComplete, true);\n\n    const deferred = new Deferred<void>();\n    this.repo_.onDisconnectSetWithPriority(\n      this.path_,\n      value,\n      priority,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n\n  /**\n   * @param {!Object} objectToMerge\n   * @param {function(?Error)=} onComplete\n   * @return {!firebase.Promise}\n   */\n  update(\n    objectToMerge: object,\n    onComplete?: (a: Error | null) => void\n  ): Promise<void> {\n    validateArgCount('OnDisconnect.update', 1, 2, arguments.length);\n    validateWritablePath('OnDisconnect.update', this.path_);\n    if (Array.isArray(objectToMerge)) {\n      const newObjectToMerge: { [k: string]: 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<void>();\n    this.repo_.onDisconnectUpdate(\n      this.path_,\n      objectToMerge,\n      deferred.wrapCallback(onComplete)\n    );\n    return deferred.promise;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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 {boolean=} exportFormat True for export format (also wire protocol format).\n   * @return {*} Value of this node as JSON.\n   */\n  val(exportFormat?: boolean): Object;\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<NamedNode> {\n    return this.compare.bind(this);\n  }\n\n  /**\n   * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\n   * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\n   *\n   * @param {!Node} oldNode\n   * @param {!Node} newNode\n   * @return {boolean} True if the portion of the snapshot being indexed changed between oldNode and newNode\n   */\n  indexedValueChanged(oldNode: Node, newNode: Node): boolean {\n    const oldWrapped = new NamedNode(MIN_NAME, oldNode);\n    const newWrapped = new NamedNode(MIN_NAME, newNode);\n    return this.compare(oldWrapped, newWrapped) !== 0;\n  }\n\n  /**\n   * @return {!NamedNode} a node wrapper that will sort equal to or less than\n   * any other node wrapper, using this index\n   */\n  minPost(): NamedNode {\n    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.<!string>}\n   * @const\n   */\n  static VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\n\n  private lazyHash_: string | null = null;\n\n  /**\n   * @implements {Node}\n   * @param {!(string|number|boolean|Object)} value_ The value to store in this leaf node.\n   *                                         The object type is possible in the event of a deferred value\n   * @param {!Node=} priorityNode_ The priority of this node.\n   */\n  constructor(\n    private readonly value_: string | number | boolean | 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, clone, 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\n/**\n *\n * @param {Object.<string, FallbackType|SortedMap.<NamedNode, Node>>} indexes\n * @param {Object.<string, Index>} indexSet\n * @constructor\n */\nexport class IndexMap {\n  /**\n   * The default IndexMap for nodes without a priority\n   * @type {!IndexMap}\n   * @const\n   */\n  static get Default(): IndexMap {\n    assert(\n      fallbackObject && PRIORITY_INDEX,\n      'ChildrenNode.ts has not been loaded'\n    );\n    _defaultIndexMap =\n      _defaultIndexMap ||\n      new IndexMap(\n        { '.priority': fallbackObject },\n        { '.priority': PRIORITY_INDEX }\n      );\n    return _defaultIndexMap;\n  }\n\n  constructor(\n    private indexes_: {\n      [k: string]: SortedMap<NamedNode, Node> | /*FallbackType*/ object;\n    },\n    private indexSet_: { [k: string]: Index }\n  ) {}\n\n  /**\n   *\n   * @param {!string} indexKey\n   * @return {?SortedMap.<NamedNode, Node>}\n   */\n  get(indexKey: string): SortedMap<NamedNode, Node> | null {\n    const sortedMap = safeGet(this.indexes_, indexKey);\n    if (!sortedMap) throw new Error('No index defined for ' + indexKey);\n\n    if (sortedMap === fallbackObject) {\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    } else {\n      return sortedMap;\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {boolean}\n   */\n  hasIndex(indexDefinition: Index): boolean {\n    return contains(this.indexSet_, indexDefinition.toString());\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @param {!SortedMap.<string, !Node>} existingChildren\n   * @return {!IndexMap}\n   */\n  addIndex(\n    indexDefinition: Index,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    assert(\n      indexDefinition !== KEY_INDEX,\n      \"KeyIndex always exists and isn't meant to be added to the IndexMap.\"\n    );\n    const childList = [];\n    let sawIndexedValue = false;\n    const iter = existingChildren.getIterator(NamedNode.Wrap);\n    let next = iter.getNext();\n    while (next) {\n      sawIndexedValue =\n        sawIndexedValue || indexDefinition.isDefinedOn(next.node);\n      childList.push(next);\n      next = iter.getNext();\n    }\n    let newIndex;\n    if (sawIndexedValue) {\n      newIndex = buildChildSet(childList, indexDefinition.getCompare());\n    } else {\n      newIndex = fallbackObject;\n    }\n    const indexName = indexDefinition.toString();\n    const newIndexSet = clone(this.indexSet_);\n    newIndexSet[indexName] = indexDefinition;\n    const newIndexes = clone(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   * @param {!NamedNode} namedNode\n   * @param {!SortedMap.<string, !Node>} existingChildren\n   * @return {!IndexMap}\n   */\n  addToIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(\n      this.indexes_,\n      (indexedChildren: SortedMap<NamedNode, Node>, indexName: string) => {\n        const index = safeGet(this.indexSet_, indexName);\n        assert(index, 'Missing index implementation for ' + indexName);\n        if (indexedChildren === fallbackObject) {\n          // Check to see if we need to index everything\n          if (index.isDefinedOn(namedNode.node)) {\n            // We need to build this index\n            const childList = [];\n            const iter = existingChildren.getIterator(NamedNode.Wrap);\n            let next = iter.getNext();\n            while (next) {\n              if (next.name != namedNode.name) {\n                childList.push(next);\n              }\n              next = iter.getNext();\n            }\n            childList.push(namedNode);\n            return buildChildSet(childList, index.getCompare());\n          } else {\n            // No change, this remains a fallback\n            return fallbackObject;\n          }\n        } else {\n          const existingSnap = existingChildren.get(namedNode.name);\n          let newChildren = indexedChildren;\n          if (existingSnap) {\n            newChildren = newChildren.remove(\n              new NamedNode(namedNode.name, existingSnap)\n            );\n          }\n          return newChildren.insert(namedNode, namedNode.node);\n        }\n      }\n    );\n    return new IndexMap(newIndexes, this.indexSet_);\n  }\n\n  /**\n   * Create a new IndexMap instance with the given value removed\n   * @param {!NamedNode} namedNode\n   * @param {!SortedMap.<string, !Node>} existingChildren\n   * @return {!IndexMap}\n   */\n  removeFromIndexes(\n    namedNode: NamedNode,\n    existingChildren: SortedMap<string, Node>\n  ): IndexMap {\n    const newIndexes = map(this.indexes_, function(\n      indexedChildren: SortedMap<NamedNode, Node>\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<string, Node>,\n    priorityNode_: Node | null,\n    indexMap_: IndexMap\n  ): ChildrenNode;\n  EMPTY_NODE: ChildrenNode;\n}\n\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\n\nlet EMPTY_NODE: ChildrenNode;\n\n/**\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\n * (i.e. nodes with children).  It implements Node and stores the\n * list of children in the children property, sorted by child name.\n *\n * @constructor\n * @implements {Node}\n */\nexport class ChildrenNode implements Node {\n  private lazyHash_: string | null = null;\n\n  static get EMPTY_NODE(): ChildrenNode {\n    return (\n      EMPTY_NODE ||\n      (EMPTY_NODE = new ChildrenNode(\n        new SortedMap<string, Node>(NAME_COMPARATOR),\n        null,\n        IndexMap.Default\n      ))\n    );\n  }\n\n  /**\n   *\n   * @param {!SortedMap.<string, !Node>} children_ List of children\n   * of this node..\n   * @param {?Node} priorityNode_ The priority of this node (as a snapshot node).\n   * @param {!IndexMap} indexMap_\n   */\n  constructor(\n    private readonly children_: SortedMap<string, Node>,\n    private readonly priorityNode_: Node | null,\n    private indexMap_: IndexMap\n  ) {\n    /**\n     * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\n     * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\n     * class instead of an empty ChildrenNode.\n     */\n    if (this.priorityNode_) {\n      validatePriorityNode(this.priorityNode_);\n    }\n\n    if (this.children_.isEmpty()) {\n      assert(\n        !this.priorityNode_ || this.priorityNode_.isEmpty(),\n        'An empty node cannot have a priority'\n      );\n    }\n  }\n\n  /** @inheritDoc */\n  isLeafNode(): boolean {\n    return false;\n  }\n\n  /** @inheritDoc */\n  getPriority(): Node {\n    return this.priorityNode_ || EMPTY_NODE;\n  }\n\n  /** @inheritDoc */\n  updatePriority(newPriorityNode: Node): Node {\n    if (this.children_.isEmpty()) {\n      // Don't allow priorities on empty nodes\n      return this;\n    } else {\n      return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\n    }\n  }\n\n  /** @inheritDoc */\n  getImmediateChild(childName: string): Node {\n    // Hack to treat priority as a regular child\n    if (childName === '.priority') {\n      return this.getPriority();\n    } else {\n      const child = this.children_.get(childName);\n      return child === null ? EMPTY_NODE : child;\n    }\n  }\n\n  /** @inheritDoc */\n  getChild(path: Path): Node {\n    const front = path.getFront();\n    if (front === null) 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]: Object } = {};\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: Object[] = [];\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<string | NamedNode, Node, NamedNode> {\n    return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\n  }\n\n  /**\n   *\n   * @param {!NamedNode} startPost\n   * @param {!Index} indexDefinition\n   * @return {!SortedMapIterator}\n   */\n  getIteratorFrom(\n    startPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getIteratorFrom(startPost, key => key);\n    } else {\n      const iterator = this.children_.getIteratorFrom(\n        startPost.name,\n        NamedNode.Wrap\n      );\n      let next = iterator.peek();\n      while (next != null && indexDefinition.compare(next, startPost) < 0) {\n        iterator.getNext();\n        next = iterator.peek();\n      }\n      return iterator;\n    }\n  }\n\n  /**\n   * @param {!Index} indexDefinition\n   * @return {!SortedMapIterator}\n   */\n  getReverseIterator(\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    return this.getReverseIteratorFrom(\n      indexDefinition.maxPost(),\n      indexDefinition\n    );\n  }\n\n  /**\n   * @param {!NamedNode} endPost\n   * @param {!Index} indexDefinition\n   * @return {!SortedMapIterator}\n   */\n  getReverseIteratorFrom(\n    endPost: NamedNode,\n    indexDefinition: Index\n  ): SortedMapIterator<string | NamedNode, Node, NamedNode> {\n    const idx = this.resolveIndex_(indexDefinition);\n    if (idx) {\n      return idx.getReverseIteratorFrom(endPost, 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.<NamedNode, Node>}\n   */\n  private resolveIndex_(\n    indexDefinition: Index\n  ): SortedMap<NamedNode, Node> | null {\n    if (indexDefinition === KEY_INDEX) {\n      return null;\n    } else {\n      return this.indexMap_.get(indexDefinition.toString());\n    }\n  }\n}\n\n/**\n * @constructor\n * @extends {ChildrenNode}\n * @private\n */\nexport class MaxNode extends ChildrenNode {\n  constructor() {\n    super(\n      new SortedMap<string, Node>(NAME_COMPARATOR),\n      ChildrenNode.EMPTY_NODE,\n      IndexMap.Default\n    );\n  }\n\n  compareTo(other: Node): number {\n    if (other === this) {\n      return 0;\n    } else {\n      return 1;\n    }\n  }\n\n  equals(other: Node): boolean {\n    // Not that we every compare it, but MAX_NODE is only ever equal to itself\n    return other === this;\n  }\n\n  getPriority(): MaxNode {\n    return this;\n  }\n\n  getImmediateChild(childName: string): ChildrenNode {\n    return ChildrenNode.EMPTY_NODE;\n  }\n\n  isEmpty(): boolean {\n    return false;\n  }\n}\n\n/**\n * Marker that will sort higher than any other snapshot.\n * @type {!MAX_NODE}\n * @const\n */\nexport const MAX_NODE = new MaxNode();\n\n/**\n * Document NamedNode extensions\n */\ndeclare module './Node' {\n  interface NamedNode {\n    MIN: NamedNode;\n    MAX: NamedNode;\n  }\n}\n\nObject.defineProperties(NamedNode, {\n  MIN: {\n    value: new NamedNode(MIN_NAME, ChildrenNode.EMPTY_NODE)\n  },\n  MAX: {\n    value: new NamedNode(MAX_NAME, MAX_NODE)\n  }\n});\n\n/**\n * Reference Extensions\n */\nKeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\nLeafNode.__childrenNodeConstructor = ChildrenNode;\nsetMaxNode(MAX_NODE);\nsetPriorityMaxNode(MAX_NODE);\n","/**\n * @license\n * Copyright 2017 Google 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<K> = (key1: K, key2: K) => number;\n\n/**\n * An iterator over an LLRBNode.\n */\nexport class SortedMapIterator<K, V, T> {\n  /** @private\n   * @type {Array.<!LLRBNode>}\n   */\n  private nodeStack_: (LLRBNode<K, V> | LLRBEmptyNode<K, V>)[] = [];\n\n  /**\n   * @template K, V, T\n   * @param {LLRBNode|LLRBEmptyNode} node Node to iterate.\n   * @param {?K} startKey\n   * @param {function(K, K): number} comparator\n   * @param {boolean} isReverse_ Whether or not to iterate in reverse\n   * @param {(function(K, V):T)=} resultGenerator_\n   */\n  constructor(\n    node: LLRBNode<K, V> | LLRBEmptyNode<K, V>,\n    startKey: K | null,\n    comparator: Comparator<K>,\n    private isReverse_: boolean,\n    private resultGenerator_: ((k: K, v: V) => T) | null = null\n  ) {\n    let cmp = 1;\n    while (!node.isEmpty()) {\n      node = node as LLRBNode<K, V>;\n      cmp = startKey ? comparator(node.key, startKey) : 1;\n      // flip the comparison if we're going in reverse\n      if (isReverse_) 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<K, V> {\n  color: boolean;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n\n  /**\n   * @template K, V\n   * @param {!K} key Key associated with this node.\n   * @param {!V} value Value associated with this node.\n   * @param {?boolean} color Whether this node is red.\n   * @param {?(LLRBNode|LLRBEmptyNode)=} left Left child.\n   * @param {?(LLRBNode|LLRBEmptyNode)=} right Right child.\n   */\n  constructor(\n    public key: K,\n    public value: V,\n    color: boolean | null,\n    left?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right?: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ) {\n    this.color = color != null ? color : LLRBNode.RED;\n    this.left =\n      left != null ? left : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n    this.right =\n      right != null ? right : (SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>);\n  }\n\n  static RED = true;\n  static BLACK = false;\n\n  /**\n   * Returns a copy of the current node, optionally replacing pieces of it.\n   *\n   * @param {?K} key New key for the node, or null.\n   * @param {?V} value New value for the node, or null.\n   * @param {?boolean} color New color for the node, or null.\n   * @param {?LLRBNode|LLRBEmptyNode} left New left child for the node, or null.\n   * @param {?LLRBNode|LLRBEmptyNode} right New right child for the node, or null.\n   * @return {!LLRBNode} The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBNode<K, V> {\n    return new LLRBNode(\n      key != null ? key : this.key,\n      value != null ? value : this.value,\n      color != null ? color : this.color,\n      left != null ? left : this.left,\n      right != null ? right : this.right\n    );\n  }\n\n  /**\n   * @return {number} The total number of nodes in the tree.\n   */\n  count(): number {\n    return this.left.count() + 1 + this.right.count();\n  }\n\n  /**\n   * @return {boolean} True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return false;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param {function(!K, !V):*} action Callback function to be called for each\n   *   node.  If it returns true, traversal is aborted.\n   * @return {*} The first truthy value returned by action, or the last falsey\n   *   value returned by action\n   */\n  inorderTraversal(action: (k: K, v: V) => 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<K, V> {\n    if (this.left.isEmpty()) {\n      return this;\n    } else {\n      return (this.left as LLRBNode<K, V>).min_();\n    }\n  }\n\n  /**\n   * @return {!K} The maximum key in the tree.\n   */\n  minKey(): K {\n    return this.min_().key;\n  }\n\n  /**\n   * @return {!K} The maximum key in the tree.\n   */\n  maxKey(): K {\n    if (this.right.isEmpty()) {\n      return this.key;\n    } else {\n      return this.right.maxKey();\n    }\n  }\n\n  /**\n   *\n   * @param {!Object} key Key to insert.\n   * @param {!Object} value Value to insert.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBNode} New tree, with the key/value added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    let 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<K, V> | LLRBEmptyNode<K, V> {\n    if (this.left.isEmpty()) {\n      return SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>;\n    }\n    let n: LLRBNode<K, V> = this;\n    if (!n.left.isRed_() && !n.left.left.isRed_()) n = n.moveRedLeft_();\n    n = n.copy(null, null, null, (n.left as LLRBNode<K, V>).removeMin_(), null);\n    return n.fixUp_();\n  }\n\n  /**\n   * @param {!Object} key The key of the item to remove.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBNode|LLRBEmptyNode} New tree, with the specified item removed.\n   */\n  remove(\n    key: K,\n    comparator: Comparator<K>\n  ): LLRBNode<K, V> | LLRBEmptyNode<K, V> {\n    let n, smallest;\n    n = this;\n    if (comparator(key, n.key) < 0) {\n      if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\n        n = n.moveRedLeft_();\n      }\n      n = n.copy(null, null, null, n.left.remove(key, comparator), null);\n    } else {\n      if (n.left.isRed_()) n = n.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<K, V>;\n        } else {\n          smallest = (n.right as LLRBNode<K, V>).min_();\n          n = n.copy(\n            smallest.key,\n            smallest.value,\n            null,\n            null,\n            (n.right as LLRBNode<K, V>).removeMin_()\n          );\n        }\n      }\n      n = n.copy(null, null, null, null, n.right.remove(key, comparator));\n    }\n    return n.fixUp_();\n  }\n\n  /**\n   * @private\n   * @return {boolean} Whether this is a RED node.\n   */\n  isRed_(): boolean {\n    return this.color;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree after performing any needed rotations.\n   */\n  private fixUp_(): LLRBNode<K, V> {\n    let n = 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<K, V> {\n    let n = this.colorFlip_();\n    if (n.right.left.isRed_()) {\n      n = n.copy(\n        null,\n        null,\n        null,\n        null,\n        (n.right as LLRBNode<K, V>).rotateRight_()\n      );\n      n = n.rotateLeft_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after moveRedRight.\n   */\n  private moveRedRight_(): LLRBNode<K, V> {\n    let n = this.colorFlip_();\n    if (n.left.left.isRed_()) {\n      n = n.rotateRight_();\n      n = n.colorFlip_();\n    }\n    return n;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after rotateLeft.\n   */\n  private rotateLeft_(): LLRBNode<K, V> {\n    const nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\n    return this.right.copy(null, null, this.color, nl, null) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after rotateRight.\n   */\n  private rotateRight_(): LLRBNode<K, V> {\n    const nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\n    return this.left.copy(null, null, this.color, null, nr) as LLRBNode<K, V>;\n  }\n\n  /**\n   * @private\n   * @return {!LLRBNode} New tree, after colorFlip.\n   */\n  private colorFlip_(): LLRBNode<K, V> {\n    const left = this.left.copy(null, null, !this.left.color, null, null);\n    const right = this.right.copy(null, null, !this.right.color, null, null);\n    return this.copy(null, null, !this.color, left, right);\n  }\n\n  /**\n   * For testing.\n   *\n   * @private\n   * @return {boolean} True if all is well.\n   */\n  private checkMaxDepth_(): boolean {\n    const blackDepth = this.check_();\n    return Math.pow(2.0, blackDepth) <= this.count() + 1;\n  }\n\n  /**\n   * @private\n   * @return {number} Not sure what this returns exactly. :-).\n   */\n  check_(): number {\n    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<K, V> {\n  key: K;\n  value: V;\n  left: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  right: LLRBNode<K, V> | LLRBEmptyNode<K, V>;\n  color: boolean;\n\n  /**\n   * Returns a copy of the current node.\n   *\n   * @return {!LLRBEmptyNode} The node copy.\n   */\n  copy(\n    key: K | null,\n    value: V | null,\n    color: boolean | null,\n    left: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null,\n    right: LLRBNode<K, V> | LLRBEmptyNode<K, V> | null\n  ): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key/value added.\n   *\n   * @param {!K} key Key to be added.\n   * @param {!V} value Value to be added.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBNode} New tree, with item added.\n   */\n  insert(key: K, value: V, comparator: Comparator<K>): LLRBNode<K, V> {\n    return new LLRBNode(key, value, null);\n  }\n\n  /**\n   * Returns a copy of the tree, with the specified key removed.\n   *\n   * @param {!K} key The key to remove.\n   * @param {Comparator} comparator Comparator.\n   * @return {!LLRBEmptyNode} New tree, with item removed.\n   */\n  remove(key: K, comparator: Comparator<K>): LLRBEmptyNode<K, V> {\n    return this;\n  }\n\n  /**\n   * @return {number} The total number of nodes in the tree.\n   */\n  count(): number {\n    return 0;\n  }\n\n  /**\n   * @return {boolean} True if the tree is empty.\n   */\n  isEmpty(): boolean {\n    return true;\n  }\n\n  /**\n   * Traverses the tree in key order and calls the specified action function\n   * for each node.\n   *\n   * @param {function(!K, !V):*} action Callback function to be called for each\n   * node.  If it returns true, traversal is aborted.\n   * @return {boolean} True if traversal was aborted.\n   */\n  inorderTraversal(action: (k: K, v: V) => 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<K, V> {\n  /**\n   * Always use the same empty node, to reduce memory.\n   * @const\n   */\n  static EMPTY_NODE = new LLRBEmptyNode();\n\n  /**\n   * @template K, V\n   * @param {function(K, K):number} comparator_ Key comparator.\n   * @param {LLRBNode=} root_ (Optional) Root node for the map.\n   */\n  constructor(\n    private comparator_: Comparator<K>,\n    private root_:\n      | LLRBNode<K, V>\n      | LLRBEmptyNode<K, V> = SortedMap.EMPTY_NODE as LLRBEmptyNode<K, V>\n  ) {}\n\n  /**\n   * Returns a copy of the map, with the specified key/value added or replaced.\n   * (TODO: We should perhaps rename this method to 'put')\n   *\n   * @param {!K} key Key to be added.\n   * @param {!V} value Value to be added.\n   * @return {!SortedMap.<K, V>} New map, with item added.\n   */\n  insert(key: K, value: V): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .insert(key, value, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns a copy of the map, with the specified key removed.\n   *\n   * @param {!K} key The key to remove.\n   * @return {!SortedMap.<K, V>} New map, with item removed.\n   */\n  remove(key: K): SortedMap<K, V> {\n    return new SortedMap(\n      this.comparator_,\n      this.root_\n        .remove(key, this.comparator_)\n        .copy(null, null, LLRBNode.BLACK, null, null)\n    );\n  }\n\n  /**\n   * Returns the value of the node with the given key, or null.\n   *\n   * @param {!K} key The key to look up.\n   * @return {?V} The value of the node with the given key, or null if the\n   * key doesn't exist.\n   */\n  get(key: K): V | null {\n    let cmp;\n    let node = this.root_;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        return node.value;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else if (cmp > 0) {\n        node = node.right;\n      }\n    }\n    return null;\n  }\n\n  /**\n   * Returns the key of the item *before* the specified key, or null if key is the first item.\n   * @param {K} key The key to find the predecessor of\n   * @return {?K} The predecessor key.\n   */\n  getPredecessorKey(key: K): K | null {\n    let cmp,\n      node = this.root_,\n      rightParent = null;\n    while (!node.isEmpty()) {\n      cmp = this.comparator_(key, node.key);\n      if (cmp === 0) {\n        if (!node.left.isEmpty()) {\n          node = node.left;\n          while (!node.right.isEmpty()) 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.<K, V, T>} The iterator.\n   */\n  getIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      false,\n      resultGenerator\n    );\n  }\n\n  getReverseIteratorFrom<T>(\n    key: K,\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      key,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n\n  getReverseIterator<T>(\n    resultGenerator?: (k: K, v: V) => T\n  ): SortedMapIterator<K, V, T> {\n    return new SortedMapIterator(\n      this.root_,\n      null,\n      this.comparator_,\n      true,\n      resultGenerator\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<!NamedNode>} childList Unsorted list of children\n * @param {function(!NamedNode, !NamedNode):number} cmp The comparison method to be used\n * @param {(function(NamedNode):K)=} keyFn An optional function to extract K from a node wrapper, if K's\n *                                                        type is not NamedNode\n * @param {(function(K, K):number)=} mapSortFn An optional override for comparator used by the generated sorted map\n * @return {SortedMap.<K, V>}\n */\nexport const buildChildSet = function<K, V>(\n  childList: NamedNode[],\n  cmp: (a: NamedNode, b: NamedNode) => number,\n  keyFn?: (a: NamedNode) => K,\n  mapSortFn?: (a: K, b: K) => number\n): SortedMap<K, V> {\n  childList.sort(cmp);\n\n  const buildBalancedTree = function(\n    low: number,\n    high: number\n  ): LLRBNode<K, V> | null {\n    const length = high - low;\n    let namedNode: NamedNode;\n    let key: K;\n    if (length == 0) {\n      return null;\n    } else if (length == 1) {\n      namedNode = childList[low];\n      key = keyFn ? keyFn(namedNode) : ((namedNode as 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<K, V> {\n    let node: LLRBNode<K, V> = null;\n    let root = null;\n    let index = childList.length;\n\n    const buildPennant = function(chunkSize: number, color: boolean) {\n      const low = index - chunkSize;\n      const high = index;\n      index -= chunkSize;\n      const childTree = buildBalancedTree(low + 1, high);\n      const namedNode = childList[low];\n      const key: K = keyFn ? keyFn(namedNode) : ((namedNode as 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<K, V>) {\n      if (node) {\n        node.left = pennant;\n        node = pennant;\n      } else {\n        root = pennant;\n        node = pennant;\n      }\n    };\n\n    for (let i = 0; i < base12.count; ++i) {\n      const isOne = base12.nextBitIsOne();\n      // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\n      const chunkSize = Math.pow(2, base12.count - (i + 1));\n      if (isOne) {\n        buildPennant(chunkSize, LLRBNode.BLACK);\n      } else {\n        // current == 2\n        buildPennant(chunkSize, LLRBNode.BLACK);\n        buildPennant(chunkSize, LLRBNode.RED);\n      }\n    }\n    return root;\n  };\n\n  const base12 = new Base12Num(childList.length);\n  const root = buildFrom12Array(base12);\n\n  return new SortedMap<K, V>(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 { forEach, 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';\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 as object;\n    forEach(hinzeJsonObj, (key: string, child: any) => {\n      if (typeof key !== 'string' || key.substring(0, 1) !== '.') {\n        // Ignore metadata nodes\n        const childNode = nodeFromJSON(hinzeJsonObj[key]);\n        if (!childNode.isEmpty()) {\n          childrenHavePriority =\n            childrenHavePriority || !childNode.getPriority().isEmpty();\n          children.push(new NamedNode(key, childNode));\n        }\n      }\n    });\n\n    if (children.length == 0) {\n      return ChildrenNode.EMPTY_NODE;\n    }\n\n    const childSet = buildChildSet(\n      children,\n      NAME_ONLY_COMPARATOR,\n      namedNode => namedNode.name,\n      NAME_COMPARATOR\n    ) as SortedMap<string, Node>;\n    if (childrenHavePriority) {\n      const sortedChildSet = buildChildSet(\n        children,\n        PRIORITY_INDEX.getCompare()\n      );\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        new IndexMap(\n          { '.priority': sortedChildSet },\n          { '.priority': PRIORITY_INDEX }\n        )\n      );\n    } else {\n      return new ChildrenNode(\n        childSet,\n        nodeFromJSON(priority),\n        IndexMap.Default\n      );\n    }\n  } else {\n    let node: Node = ChildrenNode.EMPTY_NODE;\n    const jsonObj = json as object;\n    forEach(jsonObj, (key: string, childData: any) => {\n      if (contains(jsonObj, 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): 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,\n    context?: Object\n  ): SnapshotCallback {\n    validateArgCount('Query.on', 2, 4, arguments.length);\n    validateEventType('Query.on', 1, eventType, false);\n    validateCallback('Query.on', 2, callback, false);\n\n    const ret = Query.getCancelAndContextArgs_(\n      'Query.on',\n      cancelCallbackOrContext,\n      context\n    );\n\n    if (eventType === 'value') {\n      this.onValueEvent(callback, ret.cancel, ret.context);\n    } else {\n      const callbacks: { [k: string]: typeof callback } = {};\n      callbacks[eventType] = callback;\n      this.onChildEvent(callbacks, ret.cancel, ret.context);\n    }\n    return callback;\n  }\n\n  /**\n   * @param {!function(!DataSnapshot)} callback\n   * @param {?function(Error)} cancelCallback\n   * @param {?Object} context\n   * @protected\n   */\n  protected onValueEvent(\n    callback: (a: DataSnapshot) => void,\n    cancelCallback: ((a: Error) => void) | null,\n    context: Object | null\n  ) {\n    const container = new ValueEventRegistration(\n      callback,\n      cancelCallback || null,\n      context || null\n    );\n    this.repo.addEventCallbackForQuery(this, container);\n  }\n\n  /**\n   * @param {!Object.<string, !function(!DataSnapshot, ?string)>} callbacks\n   * @param {?function(Error)} cancelCallback\n   * @param {?Object} context\n   * @protected\n   */\n  onChildEvent(\n    callbacks: { [k: string]: SnapshotCallback },\n    cancelCallback: ((a: Error) => 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(eventType?: string, callback?: SnapshotCallback, context?: Object) {\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 cancelOrContext\n   * @param context\n   * @return {!firebase.Promise}\n   */\n  once(\n    eventType: string,\n    userCallback?: SnapshotCallback,\n    cancelOrContext?: ((a: Error) => void) | Object,\n    context?: Object\n  ): Promise<DataSnapshot> {\n    validateArgCount('Query.once', 1, 4, arguments.length);\n    validateEventType('Query.once', 1, eventType, false);\n    validateCallback('Query.once', 2, userCallback, true);\n\n    const ret = Query.getCancelAndContextArgs_(\n      'Query.once',\n      cancelOrContext,\n      context\n    );\n\n    // TODO: Implement this more efficiently (in particular, use 'get' wire protocol for 'value' event)\n    // TODO: consider actually wiring the callbacks into the promise. We cannot do this without a breaking change\n    // because the API currently expects callbacks will be called synchronously if the data is cached, but this is\n    // against the Promise specification.\n    let firstCall = true;\n    const deferred = new Deferred<DataSnapshot>();\n\n    // A dummy error handler in case a user wasn't expecting promises\n    deferred.promise.catch(() => {});\n\n    const onceCallback = (snapshot: DataSnapshot) => {\n      // NOTE: Even though we unsubscribe, we may get called multiple times if a single action (e.g. set() with JSON)\n      // triggers multiple events (e.g. child_added or child_changed).\n      if (firstCall) {\n        firstCall = false;\n        this.off(eventType, onceCallback);\n\n        if (userCallback) {\n          userCallback.bind(ret.context)(snapshot);\n        }\n        deferred.resolve(snapshot);\n      }\n    };\n\n    this.on(\n      eventType,\n      onceCallback,\n      /*cancel=*/ err => {\n        this.off(eventType, onceCallback);\n\n        if (ret.cancel) 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,\n    context?: Object\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, getCount, getAnyKey, every } 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.<string, function(!DataSnapshot, ?string=)>} callbacks_\n   * @param {?function(Error)} cancelCallback_\n   * @param {Object=} context_\n   */\n  constructor(\n    private callbacks_:\n      | ({ [k: string]: (d: DataSnapshot, s?: string | null) => void })\n      | null,\n    private cancelCallback_: ((e: Error) => void) | null,\n    private context_?: 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 otherCount = getCount(other.callbacks_);\n        const thisCount = getCount(this.callbacks_);\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 /** @type {!string} */ = getAnyKey(other.callbacks_);\n            const thisKey /** @type {!string} */ = getAnyKey(this.callbacks_);\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 every(\n              this.callbacks_,\n              (eventType, cb) => other.callbacks_[eventType] === cb\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 { isEmpty, getCount, forEach, contains } from '@firebase/util';\n\n/**\n * Implements a set with a count of elements.\n *\n * @template K, V\n */\nexport class CountedSet<K, V> {\n  set: { [k: string]: V } = {};\n\n  /**\n   * @param {!K} item\n   * @param {V} val\n   */\n  add(item: K, val: V) {\n    this.set[item as any] = val !== null ? val : (true as any);\n  }\n\n  /**\n   * @param {!K} key\n   * @return {boolean}\n   */\n  contains(key: K) {\n    return contains(this.set, key);\n  }\n\n  /**\n   * @param {!K} item\n   * @return {V}\n   */\n  get(item: K): V | void {\n    return this.contains(item) ? this.set[item as any] : undefined;\n  }\n\n  /**\n   * @param {!K} item\n   */\n  remove(item: K) {\n    delete this.set[item as any];\n  }\n\n  /**\n   * Deletes everything in the set\n   */\n  clear() {\n    this.set = {};\n  }\n\n  /**\n   * True if there's nothing in the set\n   * @return {boolean}\n   */\n  isEmpty(): boolean {\n    return isEmpty(this.set);\n  }\n\n  /**\n   * @return {number} The number of items in the set\n   */\n  count(): number {\n    return getCount(this.set);\n  }\n\n  /**\n   * Run a function on each k,v pair in the set\n   * @param {function(K, V)} fn\n   */\n  each(fn: (k: K, v: V) => void) {\n    forEach(this.set, (k: K, v: V) => fn(k, v));\n  }\n\n  /**\n   * Mostly for debugging\n   * @return {Array.<K>} The keys present in this CountedSet\n   */\n  keys(): K[] {\n    const keys: K[] = [];\n    forEach(this.set, (k: K) => {\n      keys.push(k);\n    });\n    return keys;\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 { CountedSet } from './util/CountedSet';\nimport { Node } from './snap/Node';\n\n/**\n * Helper class to store a sparse set of snapshots.\n *\n * @constructor\n */\nexport class SparseSnapshotTree {\n  /**\n   * @private\n   * @type {Node}\n   */\n  private value_: Node | null = null;\n\n  /**\n   * @private\n   * @type {CountedSet}\n   */\n  private children_: CountedSet<string, SparseSnapshotTree> | null = null;\n\n  /**\n   * Gets the node stored at the given path if one exists.\n   *\n   * @param {!Path} path Path to look up snapshot for.\n   * @return {?Node} 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_ != null) {\n      const childKey = path.getFront();\n      path = path.popFront();\n      if (this.children_.contains(childKey)) {\n        const childTree = this.children_.get(childKey) as SparseSnapshotTree;\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 Path to look up snapshot for.\n   * @param {!Node} data The new data, or null.\n   */\n  remember(path: Path, data: Node) {\n    if (path.isEmpty()) {\n      this.value_ = data;\n      this.children_ = null;\n    } else if (this.value_ !== null) {\n      this.value_ = this.value_.updateChild(path, data);\n    } else {\n      if (this.children_ == null) {\n        this.children_ = new CountedSet<string, SparseSnapshotTree>();\n      }\n\n      const childKey = path.getFront();\n      if (!this.children_.contains(childKey)) {\n        this.children_.add(childKey, new SparseSnapshotTree());\n      }\n\n      const child = this.children_.get(childKey) as SparseSnapshotTree;\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 Path to look up snapshot for.\n   * @return {boolean} 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_ = null;\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_ !== null) {\n        const childKey = path.getFront();\n        path = path.popFront();\n        if (this.children_.contains(childKey)) {\n          const safeToRemove = (this.children_.get(\n            childKey\n          ) as SparseSnapshotTree).forget(path);\n          if (safeToRemove) {\n            this.children_.remove(childKey);\n          }\n        }\n\n        if (this.children_.isEmpty()) {\n          this.children_ = null;\n          return true;\n        } else {\n          return false;\n        }\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 {!Path} prefixPath Path to look up node for.\n   * @param {!Function} 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 {!Function} func The function to invoke for each child.\n   */\n  forEachChild(func: (a: string, b: SparseSnapshotTree) => void) {\n    if (this.children_ !== null) {\n      this.children_.each((key, tree) => {\n        func(key, tree);\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 { 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 } from './util';\nimport { forEach } from '@firebase/util';\n\nlet emptyChildrenSingleton: SortedMap<string, ImmutableTree<null>>;\n\n/**\n * Singleton empty children collection.\n *\n * @const\n * @type {!SortedMap.<string, !ImmutableTree.<?>>}\n */\nconst EmptyChildren = (): SortedMap<string, ImmutableTree<null>> => {\n  if (!emptyChildrenSingleton) {\n    emptyChildrenSingleton = new SortedMap<string, ImmutableTree<null>>(\n      stringCompare\n    );\n  }\n  return emptyChildrenSingleton;\n};\n\n/**\n * A tree with immutable elements.\n */\nexport class ImmutableTree<T> {\n  static Empty = new ImmutableTree<any>(null);\n\n  /**\n   * @template T\n   * @param {!Object.<string, !T>} obj\n   * @return {!ImmutableTree.<!T>}\n   */\n  static fromObject<T>(obj: { [k: string]: T }): ImmutableTree<T> {\n    let tree: ImmutableTree<T> = ImmutableTree.Empty;\n    forEach(obj, (childPath: string, childSnap: T) => {\n      tree = tree.set(new Path(childPath), childSnap);\n    });\n    return tree;\n  }\n\n  /**\n   * @template T\n   * @param {?T} value\n   * @param {SortedMap.<string, !ImmutableTree.<T>>=} children\n   */\n  constructor(\n    public readonly value: T | null,\n    public readonly children: SortedMap<\n      string,\n      ImmutableTree<T>\n    > = EmptyChildren()\n  ) {}\n\n  /**\n   * True if the value is empty and there are no children\n   * @return {boolean}\n   */\n  isEmpty(): boolean {\n    return this.value === null && this.children.isEmpty();\n  }\n\n  /**\n   * Given a path and predicate, return the first node and the path to that node\n   * where the predicate returns true.\n   *\n   * TODO Do a perf test -- If we're creating a bunch of {path: value:} objects\n   * on the way back out, it may be better to pass down a pathSoFar obj.\n   *\n   * @param {!Path} relativePath The remainder of the path\n   * @param {function(T):boolean} predicate The predicate to satisfy to return a\n   *   node\n   * @return {?{path:!Path, value:!T}}\n   */\n  findRootMostMatchingPathAndValue(\n    relativePath: Path,\n    predicate: (a: T) => boolean\n  ): { path: Path; value: T } | null {\n    if (this.value != null && predicate(this.value)) {\n      return { path: Path.Empty, value: this.value };\n    } else {\n      if (relativePath.isEmpty()) {\n        return null;\n      } else {\n        const front = relativePath.getFront();\n        const child = this.children.get(front);\n        if (child !== null) {\n          const childExistingPathAndValue = child.findRootMostMatchingPathAndValue(\n            relativePath.popFront(),\n            predicate\n          );\n          if (childExistingPathAndValue != null) {\n            const fullPath = new Path(front).child(\n              childExistingPathAndValue.path\n            );\n            return { path: fullPath, value: childExistingPathAndValue.value };\n          } else {\n            return null;\n          }\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  /**\n   * Find, if it exists, the shortest subpath of the given path that points a defined\n   * value in the tree\n   * @param {!Path} relativePath\n   * @return {?{path: !Path, value: !T}}\n   */\n  findRootMostValueAndPath(\n    relativePath: Path\n  ): { path: Path; value: T } | null {\n    return this.findRootMostMatchingPathAndValue(relativePath, () => true);\n  }\n\n  /**\n   * @param {!Path} relativePath\n   * @return {!ImmutableTree.<T>} The subtree at the given path\n   */\n  subtree(relativePath: Path): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      return this;\n    } else {\n      const front = relativePath.getFront();\n      const childTree = this.children.get(front);\n      if (childTree !== null) {\n        return childTree.subtree(relativePath.popFront());\n      } else {\n        return ImmutableTree.Empty;\n      }\n    }\n  }\n\n  /**\n   * Sets a value at the specified path.\n   *\n   * @param {!Path} relativePath Path to set value at.\n   * @param {?T} toSet Value to set.\n   * @return {!ImmutableTree.<T>} Resulting tree.\n   */\n  set(relativePath: Path, toSet: T | null): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      return new ImmutableTree(toSet, this.children);\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front) || ImmutableTree.Empty;\n      const newChild = child.set(relativePath.popFront(), toSet);\n      const newChildren = this.children.insert(front, newChild);\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Removes the value at the specified path.\n   *\n   * @param {!Path} relativePath Path to value to remove.\n   * @return {!ImmutableTree.<T>} Resulting tree.\n   */\n  remove(relativePath: Path): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      if (this.children.isEmpty()) {\n        return ImmutableTree.Empty;\n      } else {\n        return new ImmutableTree(null, this.children);\n      }\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front);\n      if (child) {\n        const newChild = child.remove(relativePath.popFront());\n        let newChildren;\n        if (newChild.isEmpty()) {\n          newChildren = this.children.remove(front);\n        } else {\n          newChildren = this.children.insert(front, newChild);\n        }\n        if (this.value === null && newChildren.isEmpty()) {\n          return ImmutableTree.Empty;\n        } else {\n          return new ImmutableTree(this.value, newChildren);\n        }\n      } else {\n        return this;\n      }\n    }\n  }\n\n  /**\n   * Gets a value from the tree.\n   *\n   * @param {!Path} relativePath Path to get value for.\n   * @return {?T} Value at path, or null.\n   */\n  get(relativePath: Path): T | null {\n    if (relativePath.isEmpty()) {\n      return this.value;\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front);\n      if (child) {\n        return child.get(relativePath.popFront());\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Replace the subtree at the specified path with the given new tree.\n   *\n   * @param {!Path} relativePath Path to replace subtree for.\n   * @param {!ImmutableTree} newTree New tree.\n   * @return {!ImmutableTree} Resulting tree.\n   */\n  setTree(relativePath: Path, newTree: ImmutableTree<T>): ImmutableTree<T> {\n    if (relativePath.isEmpty()) {\n      return newTree;\n    } else {\n      const front = relativePath.getFront();\n      const child = this.children.get(front) || ImmutableTree.Empty;\n      const newChild = child.setTree(relativePath.popFront(), newTree);\n      let newChildren;\n      if (newChild.isEmpty()) {\n        newChildren = this.children.remove(front);\n      } else {\n        newChildren = this.children.insert(front, newChild);\n      }\n      return new ImmutableTree(this.value, newChildren);\n    }\n  }\n\n  /**\n   * Performs a depth first fold on this tree. Transforms a tree into a single\n   * value, given a function that operates on the path to a node, an optional\n   * current value, and a map of child names to folded subtrees\n   * @template V\n   * @param {function(Path, ?T, Object.<string, V>):V} fn\n   * @return {V}\n   */\n  fold<V>(fn: (path: Path, value: T, children: { [k: string]: V }) => V): V {\n    return this.fold_(Path.Empty, fn);\n  }\n\n  /**\n   * Recursive helper for public-facing fold() method\n   * @template V\n   * @param {!Path} pathSoFar\n   * @param {function(Path, ?T, Object.<string, V>):V} fn\n   * @return {V}\n   * @private\n   */\n  private fold_<V>(\n    pathSoFar: Path,\n    fn: (path: Path, value: T | null, children: { [k: string]: V }) => V\n  ): V {\n    const accum: { [k: string]: V } = {};\n    this.children.inorderTraversal(function(\n      childKey: string,\n      childTree: ImmutableTree<T>\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<V>(path: Path, f: (path: Path, value: T) => V | null): V | null {\n    return this.findOnPath_(path, Path.Empty, f);\n  }\n\n  private findOnPath_<V>(\n    pathToFollow: Path,\n    pathSoFar: Path,\n    f: (path: Path, value: T) => V | null\n  ): V | null {\n    const result = this.value ? f(pathSoFar, this.value) : false;\n    if (result) {\n      return result;\n    } else {\n      if (pathToFollow.isEmpty()) {\n        return null;\n      } else {\n        const front = pathToFollow.getFront()!;\n        const nextChild = this.children.get(front);\n        if (nextChild) {\n          return nextChild.findOnPath_(\n            pathToFollow.popFront(),\n            pathSoFar.child(front),\n            f\n          );\n        } else {\n          return null;\n        }\n      }\n    }\n  }\n\n  /**\n   *\n   * @param {!Path} path\n   * @param {!function(!Path, !T)} f\n   * @returns {!ImmutableTree.<T>}\n   */\n  foreachOnPath(\n    path: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    return this.foreachOnPath_(path, Path.Empty, f);\n  }\n\n  private foreachOnPath_(\n    pathToFollow: Path,\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ): ImmutableTree<T> {\n    if (pathToFollow.isEmpty()) {\n      return this;\n    } else {\n      if (this.value) {\n        f(currentRelativePath, this.value);\n      }\n      const front = pathToFollow.getFront();\n      const nextChild = this.children.get(front);\n      if (nextChild) {\n        return nextChild.foreachOnPath_(\n          pathToFollow.popFront(),\n          currentRelativePath.child(front),\n          f\n        );\n      } else {\n        return ImmutableTree.Empty;\n      }\n    }\n  }\n\n  /**\n   * Calls the given function for each node in the tree that has a value.\n   *\n   * @param {function(!Path, !T)} f A function to be called with\n   *   the path from the root of the tree to a node, and the value at that node.\n   *   Called in depth-first order.\n   */\n  foreach(f: (path: Path, value: T) => void) {\n    this.foreach_(Path.Empty, f);\n  }\n\n  private foreach_(\n    currentRelativePath: Path,\n    f: (path: Path, value: T) => void\n  ) {\n    this.children.inorderTraversal(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<T>) => {\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 { isEmpty, forEach, findValue, safeGet } 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   * @type {!Object.<!string, !View>}\n   * @private\n   */\n  private views_: { [k: string]: View } = {};\n\n  /**\n   * @return {boolean}\n   */\n  isEmpty(): boolean {\n    return isEmpty(this.views_);\n  }\n\n  /**\n   *\n   * @param {!Operation} operation\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} optCompleteServerCache\n   * @return {!Array.<!Event>}\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 = safeGet(this.views_, 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      forEach(this.views_, function(key: string, view: View) {\n        events = events.concat(\n          view.applyOperation(operation, writesCache, optCompleteServerCache)\n        );\n      });\n\n      return events;\n    }\n  }\n\n  /**\n   * Add an event callback for the specified query.\n   *\n   * @param {!Query} query\n   * @param {!EventRegistration} eventRegistration\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} serverCache Complete server cache, if we have it.\n   * @param {boolean} serverCacheComplete\n   * @return {!Array.<!Event>} Events to raise.\n   */\n  addEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration,\n    writesCache: WriteTreeRef,\n    serverCache: Node | null,\n    serverCacheComplete: boolean\n  ): Event[] {\n    const queryId = query.queryIdentifier();\n    let view = safeGet(this.views_, 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_[queryId] = view;\n    }\n\n    // This is guaranteed to exist now, we just created anything that was missing\n    view.addEventRegistration(eventRegistration);\n    return view.getInitialEvents(eventRegistration);\n  }\n\n  /**\n   * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\n   *\n   * If query is the default query, we'll check all views for the specified eventRegistration.\n   * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\n   *\n   * @param {!Query} query\n   * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\n   * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n   * @return {{removed:!Array.<!Query>, events:!Array.<!Event>}} removed queries and any cancel events\n   */\n  removeEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration | null,\n    cancelError?: Error\n  ): { removed: Query[]; events: Event[] } {\n    const queryId = query.queryIdentifier();\n    const removed: Query[] = [];\n    let cancelEvents: Event[] = [];\n    const hadCompleteView = this.hasCompleteView();\n    if (queryId === 'default') {\n      // When you do ref.off(...), we search all views for the registration to remove.\n      const self = this;\n      forEach(this.views_, function(viewQueryId: string, view: View) {\n        cancelEvents = cancelEvents.concat(\n          view.removeEventRegistration(eventRegistration, cancelError)\n        );\n        if (view.isEmpty()) {\n          delete self.views_[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 = safeGet(this.views_, queryId);\n      if (view) {\n        cancelEvents = cancelEvents.concat(\n          view.removeEventRegistration(eventRegistration, cancelError)\n        );\n        if (view.isEmpty()) {\n          delete this.views_[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  /**\n   * @return {!Array.<!View>}\n   */\n  getQueryViews(): View[] {\n    const values = Object.keys(this.views_).map(key => this.views_[key]);\n    return values.filter(function(view) {\n      return !view\n        .getQuery()\n        .getQueryParams()\n        .loadsAllData();\n    });\n  }\n\n  /**\n   *\n   * @param {!Path} path The path to the desired complete snapshot\n   * @return {?Node} A complete cache, if it exists\n   */\n  getCompleteServerCache(path: Path): Node | null {\n    let serverCache: Node | null = null;\n    forEach(this.views_, (key: string, view: View) => {\n      serverCache = serverCache || view.getCompleteServerCache(path);\n    });\n    return serverCache;\n  }\n\n  /**\n   * @param {!Query} query\n   * @return {?View}\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 safeGet(this.views_, queryId);\n    }\n  }\n\n  /**\n   * @param {!Query} query\n   * @return {boolean}\n   */\n  viewExistsForQuery(query: Query): boolean {\n    return this.viewForQuery(query) != null;\n  }\n\n  /**\n   * @return {boolean}\n   */\n  hasCompleteView(): boolean {\n    return this.getCompleteView() != null;\n  }\n\n  /**\n   * @return {?View}\n   */\n  getCompleteView(): View | null {\n    const completeView = findValue(this.views_, (view: View) =>\n      view\n        .getQuery()\n        .getQueryParams()\n        .loadsAllData()\n    );\n    return completeView || 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<!boolean>} affectedTree A tree containing true for each affected path. Affected paths can't overlap.\n   * @param {!boolean} revert\n   */\n  constructor(\n    /**@inheritDoc */ public path: Path,\n    /**@inheritDoc */ public affectedTree: ImmutableTree<boolean>,\n    /**@inheritDoc */ public revert: boolean\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  operationForChild(childName: string): AckUserWrite {\n    if (!this.path.isEmpty()) {\n      assert(\n        this.path.getFront() === childName,\n        'operationForChild called for unrelated child.'\n      );\n      return new AckUserWrite(\n        this.path.popFront(),\n        this.affectedTree,\n        this.revert\n      );\n    } else if (this.affectedTree.value != null) {\n      assert(\n        this.affectedTree.children.isEmpty(),\n        'affectedTree should not have overlapping affected paths.'\n      );\n      // All child locations are affected as well; just return same operation.\n      return this;\n    } else {\n      const childTree = this.affectedTree.subtree(new Path(childName));\n      return new AckUserWrite(Path.Empty, childTree, this.revert);\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<!Node>} children\n * @constructor\n * @implements {Operation}\n */\nexport class Merge implements Operation {\n  /** @inheritDoc */\n  type = OperationType.MERGE;\n\n  constructor(\n    /**@inheritDoc */ public source: OperationSource,\n    /**@inheritDoc */ public path: Path,\n    /**@inheritDoc */ public children: ImmutableTree<Node>\n  ) {}\n\n  /**\n   * @inheritDoc\n   */\n  operationForChild(childName: string): Operation {\n    if (this.path.isEmpty()) {\n      const childTree = this.children.subtree(new Path(childName));\n      if (childTree.isEmpty()) {\n        // This child is unaffected\n        return null;\n      } else if (childTree.value) {\n        // We have a snapshot for the child in question.  This becomes an overwrite of the child.\n        return new Overwrite(this.source, Path.Empty, childTree.value);\n      } else {\n        // This is a merge at a deeper level\n        return new Merge(this.source, Path.Empty, childTree);\n      }\n    } else {\n      assert(\n        this.path.getFront() === childName,\n        \"Can't get a merge for a child not on the path of the operation\"\n      );\n      return new Merge(this.source, this.path.popFront(), this.children);\n    }\n  }\n\n  /**\n   * @inheritDoc\n   */\n  toString(): string {\n    return (\n      'Operation(' +\n      this.path +\n      ': ' +\n      this.source.toString() +\n      ' merge: ' +\n      this.children.toString() +\n      ')'\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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\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 { getValues, safeGet } from '@firebase/util';\nimport { Change } from './Change';\nimport { assert, assertionError } from '@firebase/util';\n\n/**\n * @constructor\n */\nexport class ChildChangeAccumulator {\n  private changeMap_: { [k: string]: Change } = {};\n\n  /**\n   * @param {!Change} change\n   */\n  trackChildChange(change: Change) {\n    const type = change.type;\n    const childKey /** @type {!string} */ = 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 = safeGet(this.changeMap_, childKey) as Change;\n    if (oldChange) {\n      const oldType = oldChange.type;\n      if (type == Change.CHILD_ADDED && oldType == Change.CHILD_REMOVED) {\n        this.changeMap_[childKey] = Change.childChangedChange(\n          childKey,\n          change.snapshotNode,\n          oldChange.snapshotNode\n        );\n      } else if (\n        type == Change.CHILD_REMOVED &&\n        oldType == Change.CHILD_ADDED\n      ) {\n        delete this.changeMap_[childKey];\n      } else if (\n        type == Change.CHILD_REMOVED &&\n        oldType == Change.CHILD_CHANGED\n      ) {\n        this.changeMap_[childKey] = Change.childRemovedChange(\n          childKey,\n          oldChange.oldSnap\n        );\n      } else if (\n        type == Change.CHILD_CHANGED &&\n        oldType == Change.CHILD_ADDED\n      ) {\n        this.changeMap_[childKey] = Change.childAddedChange(\n          childKey,\n          change.snapshotNode\n        );\n      } else if (\n        type == Change.CHILD_CHANGED &&\n        oldType == Change.CHILD_CHANGED\n      ) {\n        this.changeMap_[childKey] = Change.childChangedChange(\n          childKey,\n          change.snapshotNode,\n          oldChange.oldSnap\n        );\n      } else {\n        throw assertionError(\n          'Illegal combination of changes: ' +\n            change +\n            ' occurred after ' +\n            oldChange\n        );\n      }\n    } else {\n      this.changeMap_[childKey] = change;\n    }\n  }\n\n  /**\n   * @return {!Array.<!Change>}\n   */\n  getChanges(): Change[] {\n    return getValues(this.changeMap_);\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.<!Change>} changes\n   */\n  constructor(\n    public readonly viewCache: ViewCache,\n    public readonly changes: Change[]\n  ) {}\n}\n\n/**\n * @constructor\n */\nexport class ViewProcessor {\n  /**\n   * @param {!NodeFilter} filter_\n   */\n  constructor(private readonly filter_: NodeFilter) {}\n\n  /**\n   * @param {!ViewCache} viewCache\n   */\n  assertIndexed(viewCache: ViewCache) {\n    assert(\n      viewCache\n        .getEventCache()\n        .getNode()\n        .isIndexed(this.filter_.getIndex()),\n      'Event snap not indexed'\n    );\n    assert(\n      viewCache\n        .getServerCache()\n        .getNode()\n        .isIndexed(this.filter_.getIndex()),\n      'Server snap not indexed'\n    );\n  }\n\n  /**\n   * @param {!ViewCache} oldViewCache\n   * @param {!Operation} operation\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeCache\n   * @return {!ProcessorResult}\n   */\n  applyOperation(\n    oldViewCache: ViewCache,\n    operation: Operation,\n    writesCache: WriteTreeRef,\n    completeCache: Node | null\n  ): ProcessorResult {\n    const accumulator = new ChildChangeAccumulator();\n    let newViewCache, filterServerNode;\n    if (operation.type === OperationType.OVERWRITE) {\n      const overwrite = operation as Overwrite;\n      if (overwrite.source.fromUser) {\n        newViewCache = this.applyUserOverwrite_(\n          oldViewCache,\n          overwrite.path,\n          overwrite.snap,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      } else {\n        assert(overwrite.source.fromServer, 'Unknown source.');\n        // We filter the node if it's a tagged update or the node has been previously filtered  and the\n        // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\n        // again\n        filterServerNode =\n          overwrite.source.tagged ||\n          (oldViewCache.getServerCache().isFiltered() &&\n            !overwrite.path.isEmpty());\n        newViewCache = this.applyServerOverwrite_(\n          oldViewCache,\n          overwrite.path,\n          overwrite.snap,\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    } else if (operation.type === OperationType.MERGE) {\n      const merge = operation as Merge;\n      if (merge.source.fromUser) {\n        newViewCache = this.applyUserMerge_(\n          oldViewCache,\n          merge.path,\n          merge.children,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      } else {\n        assert(merge.source.fromServer, 'Unknown source.');\n        // We filter the node if it's a tagged update or the node has been previously filtered\n        filterServerNode =\n          merge.source.tagged || oldViewCache.getServerCache().isFiltered();\n        newViewCache = this.applyServerMerge_(\n          oldViewCache,\n          merge.path,\n          merge.children,\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    } else if (operation.type === OperationType.ACK_USER_WRITE) {\n      const ackUserWrite = operation as AckUserWrite;\n      if (!ackUserWrite.revert) {\n        newViewCache = this.ackUserWrite_(\n          oldViewCache,\n          ackUserWrite.path,\n          ackUserWrite.affectedTree,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      } else {\n        newViewCache = this.revertUserWrite_(\n          oldViewCache,\n          ackUserWrite.path,\n          writesCache,\n          completeCache,\n          accumulator\n        );\n      }\n    } else if (operation.type === OperationType.LISTEN_COMPLETE) {\n      newViewCache = this.listenComplete_(\n        oldViewCache,\n        operation.path,\n        writesCache,\n        accumulator\n      );\n    } else {\n      throw assertionError('Unknown operation type: ' + operation.type);\n    }\n    const changes = accumulator.getChanges();\n    ViewProcessor.maybeAddValueEvent_(oldViewCache, newViewCache, changes);\n    return new ProcessorResult(newViewCache, changes);\n  }\n\n  /**\n   * @param {!ViewCache} oldViewCache\n   * @param {!ViewCache} newViewCache\n   * @param {!Array.<!Change>} accumulator\n   * @private\n   */\n  private static maybeAddValueEvent_(\n    oldViewCache: ViewCache,\n    newViewCache: ViewCache,\n    accumulator: Change[]\n  ) {\n    const eventSnap = newViewCache.getEventCache();\n    if (eventSnap.isFullyInitialized()) {\n      const isLeafOrEmpty =\n        eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\n      const oldCompleteSnap = oldViewCache.getCompleteEventSnap();\n      if (\n        accumulator.length > 0 ||\n        !oldViewCache.getEventCache().isFullyInitialized() ||\n        (isLeafOrEmpty &&\n          !eventSnap\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.<!Node>} changedChildren\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} serverCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private applyUserMerge_(\n    viewCache: ViewCache,\n    path: Path,\n    changedChildren: ImmutableTree<Node>,\n    writesCache: WriteTreeRef,\n    serverCache: Node | null,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    // HACK: In the case of a limit query, there may be some changes that bump things out of the\n    // window leaving room for new items.  It's important we process these changes first, so we\n    // iterate the changes twice, first processing any that affect items currently in view.\n    // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n    // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n    // not the other.\n    let curViewCache = viewCache;\n    changedChildren.foreach((relativePath, childNode) => {\n      const writePath = path.child(relativePath);\n      if (ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n        curViewCache = this.applyUserOverwrite_(\n          curViewCache,\n          writePath,\n          childNode,\n          writesCache,\n          serverCache,\n          accumulator\n        );\n      }\n    });\n\n    changedChildren.foreach((relativePath, childNode) => {\n      const writePath = path.child(relativePath);\n      if (!ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\n        curViewCache = this.applyUserOverwrite_(\n          curViewCache,\n          writePath,\n          childNode,\n          writesCache,\n          serverCache,\n          accumulator\n        );\n      }\n    });\n\n    return curViewCache;\n  }\n\n  /**\n   * @param {!Node} node\n   * @param {ImmutableTree.<!Node>} merge\n   * @return {!Node}\n   * @private\n   */\n  private applyMerge_(node: Node, merge: ImmutableTree<Node>): Node {\n    merge.foreach(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.<!Node>} changedChildren\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} serverCache\n   * @param {boolean} filterServerNode\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private applyServerMerge_(\n    viewCache: ViewCache,\n    path: Path,\n    changedChildren: ImmutableTree<Node>,\n    writesCache: WriteTreeRef,\n    serverCache: Node | null,\n    filterServerNode: boolean,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\n    // wait for the complete data update coming soon.\n    if (\n      viewCache\n        .getServerCache()\n        .getNode()\n        .isEmpty() &&\n      !viewCache.getServerCache().isFullyInitialized()\n    ) {\n      return viewCache;\n    }\n\n    // HACK: In the case of a limit query, there may be some changes that bump things out of the\n    // window leaving room for new items.  It's important we process these changes first, so we\n    // iterate the changes twice, first processing any that affect items currently in view.\n    // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\n    // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\n    // not the other.\n    let curViewCache = viewCache;\n    let viewMergeTree;\n    if (path.isEmpty()) {\n      viewMergeTree = changedChildren;\n    } else {\n      viewMergeTree = ImmutableTree.Empty.setTree(path, changedChildren);\n    }\n    const serverNode = viewCache.getServerCache().getNode();\n    viewMergeTree.children.inorderTraversal((childKey, childTree) => {\n      if (serverNode.hasChild(childKey)) {\n        const serverChild = viewCache\n          .getServerCache()\n          .getNode()\n          .getImmediateChild(childKey);\n        const newChild = this.applyMerge_(serverChild, childTree);\n        curViewCache = this.applyServerOverwrite_(\n          curViewCache,\n          new Path(childKey),\n          newChild,\n          writesCache,\n          serverCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    });\n    viewMergeTree.children.inorderTraversal((childKey, childMergeTree) => {\n      const isUnknownDeepMerge =\n        !viewCache.getServerCache().isCompleteForChild(childKey) &&\n        childMergeTree.value == null;\n      if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\n        const serverChild = viewCache\n          .getServerCache()\n          .getNode()\n          .getImmediateChild(childKey);\n        const newChild = this.applyMerge_(serverChild, childMergeTree);\n        curViewCache = this.applyServerOverwrite_(\n          curViewCache,\n          new Path(childKey),\n          newChild,\n          writesCache,\n          serverCache,\n          filterServerNode,\n          accumulator\n        );\n      }\n    });\n\n    return curViewCache;\n  }\n\n  /**\n   * @param {!ViewCache} viewCache\n   * @param {!Path} ackPath\n   * @param {!ImmutableTree<!boolean>} affectedTree\n   * @param {!WriteTreeRef} writesCache\n   * @param {?Node} completeCache\n   * @param {!ChildChangeAccumulator} accumulator\n   * @return {!ViewCache}\n   * @private\n   */\n  private ackUserWrite_(\n    viewCache: ViewCache,\n    ackPath: Path,\n    affectedTree: ImmutableTree<boolean>,\n    writesCache: WriteTreeRef,\n    completeCache: Node | null,\n    accumulator: ChildChangeAccumulator\n  ): ViewCache {\n    if (writesCache.shadowingWrite(ackPath) != null) {\n      return viewCache;\n    }\n\n    // Only filter server node if it is currently filtered\n    const filterServerNode = viewCache.getServerCache().isFiltered();\n\n    // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\n    // now that it won't be shadowed.\n    const serverCache = viewCache.getServerCache();\n    if (affectedTree.value != null) {\n      // This is an overwrite.\n      if (\n        (ackPath.isEmpty() && serverCache.isFullyInitialized()) ||\n        serverCache.isCompleteForPath(ackPath)\n      ) {\n        return this.applyServerOverwrite_(\n          viewCache,\n          ackPath,\n          serverCache.getNode().getChild(ackPath),\n          writesCache,\n          completeCache,\n          filterServerNode,\n          accumulator\n        );\n      } else if (ackPath.isEmpty()) {\n        // This is a goofy edge case where we are acking data at this location but don't have full data.  We\n        // should just re-apply whatever we have in our cache as a merge.\n        let changedChildren = ImmutableTree.Empty;\n        serverCache.getNode().forEachChild(KEY_INDEX, 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.<!Change>} changes\n   * @param {!Node} eventCache\n   * @param {!Array.<!EventRegistration>} eventRegistrations\n   * @return {!Array.<!Event>}\n   */\n  generateEventsForChanges(\n    changes: Change[],\n    eventCache: Node,\n    eventRegistrations: EventRegistration[]\n  ): Event[] {\n    const events: Event[] = [];\n    const moves: Change[] = [];\n\n    changes.forEach(change => {\n      if (\n        change.type === Change.CHILD_CHANGED &&\n        this.index_.indexedValueChanged(\n          change.oldSnap as Node,\n          change.snapshotNode\n        )\n      ) {\n        moves.push(\n          Change.childMovedChange(\n            change.childName as string,\n            change.snapshotNode\n          )\n        );\n      }\n    });\n\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_REMOVED,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_ADDED,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_MOVED,\n      moves,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.CHILD_CHANGED,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n    this.generateEventsForType_(\n      events,\n      Change.VALUE,\n      changes,\n      eventRegistrations,\n      eventCache\n    );\n\n    return events;\n  }\n\n  /**\n   * Given changes of a single change type, generate the corresponding events.\n   *\n   * @param {!Array.<!Event>} events\n   * @param {!string} eventType\n   * @param {!Array.<!Change>} changes\n   * @param {!Array.<!EventRegistration>} registrations\n   * @param {!Node} eventCache\n   * @private\n   */\n  private generateEventsForType_(\n    events: Event[],\n    eventType: string,\n    changes: Change[],\n    registrations: EventRegistration[],\n    eventCache: Node\n  ) {\n    const filteredChanges = changes.filter(change => change.type === eventType);\n\n    filteredChanges.sort(this.compareChanges_.bind(this));\n    filteredChanges.forEach(change => {\n      const materializedChange = this.materializeSingleChange_(\n        change,\n        eventCache\n      );\n      registrations.forEach(registration => {\n        if (registration.respondsTo(change.type)) {\n          events.push(\n            registration.createEvent(materializedChange, this.query_)\n          );\n        }\n      });\n    });\n  }\n\n  /**\n   * @param {!Change} change\n   * @param {!Node} eventCache\n   * @return {!Change}\n   * @private\n   */\n  private materializeSingleChange_(change: Change, eventCache: Node): Change {\n    if (change.type === 'value' || change.type === 'child_removed') {\n      return change;\n    } else {\n      change.prevName = eventCache.getPredecessorChildName(\n        /** @type {!string} */\n        change.childName,\n        change.snapshotNode,\n        this.index_\n      );\n      return change;\n    }\n  }\n\n  /**\n   * @param {!Change} a\n   * @param {!Change} b\n   * @return {number}\n   * @private\n   */\n  private compareChanges_(a: Change, b: Change) {\n    if (a.childName == null || b.childName == null) {\n      throw assertionError('Should only compare child_ events.');\n    }\n    const aWrapped = new NamedNode(a.childName, a.snapshotNode);\n    const bWrapped = new NamedNode(b.childName, b.snapshotNode);\n    return this.index_.compare(aWrapped, bWrapped);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<!Event>} Cancel events, if cancelError was provided.\n   */\n  removeEventRegistration(\n    eventRegistration: EventRegistration | null,\n    cancelError?: Error\n  ): Event[] {\n    const cancelEvents: CancelEvent[] = [];\n    if (cancelError) {\n      assert(\n        eventRegistration == null,\n        'A cancel should cancel all event registrations.'\n      );\n      const path = this.query_.path;\n      this.eventRegistrations_.forEach(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.<!Event>}\n   */\n  applyOperation(\n    operation: Operation,\n    writesCache: WriteTreeRef,\n    completeServerCache: Node | null\n  ): Event[] {\n    if (\n      operation.type === OperationType.MERGE &&\n      operation.source.queryId !== null\n    ) {\n      assert(\n        this.viewCache_.getCompleteServerSnap(),\n        'We should always have a full cache before handling merges'\n      );\n      assert(\n        this.viewCache_.getCompleteEventSnap(),\n        'Missing event cache, even though we have a server cache'\n      );\n    }\n\n    const oldViewCache = this.viewCache_;\n    const result = this.processor_.applyOperation(\n      oldViewCache,\n      operation,\n      writesCache,\n      completeServerCache\n    );\n    this.processor_.assertIndexed(result.viewCache);\n\n    assert(\n      result.viewCache.getServerCache().isFullyInitialized() ||\n        !oldViewCache.getServerCache().isFullyInitialized(),\n      'Once a server snap is complete, it should never go back'\n    );\n\n    this.viewCache_ = result.viewCache;\n\n    return this.generateEventsForChanges_(\n      result.changes,\n      result.viewCache.getEventCache().getNode(),\n      null\n    );\n  }\n\n  /**\n   * @param {!EventRegistration} registration\n   * @return {!Array.<!Event>}\n   */\n  getInitialEvents(registration: EventRegistration): Event[] {\n    const eventSnap = this.viewCache_.getEventCache();\n    const initialChanges: Change[] = [];\n    if (!eventSnap.getNode().isLeafNode()) {\n      const eventNode = eventSnap.getNode() as ChildrenNode;\n      eventNode.forEachChild(PRIORITY_INDEX, 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.<!Change>} changes\n   * @param {!Node} eventCache\n   * @param {EventRegistration=} eventRegistration\n   * @return {!Array.<!Event>}\n   */\n  generateEventsForChanges_(\n    changes: Change[],\n    eventCache: Node,\n    eventRegistration?: EventRegistration\n  ): Event[] {\n    const registrations = eventRegistration\n      ? [eventRegistration]\n      : this.eventRegistrations_;\n    return this.eventGenerator_.generateEventsForChanges(\n      changes,\n      eventCache,\n      registrations\n    );\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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 { forEach } from '@firebase/util';\nimport { Node, NamedNode } from './snap/Node';\nimport { PRIORITY_INDEX } from './snap/indexes/PriorityIndex';\nimport { assert } from '@firebase/util';\nimport { ChildrenNode } from './snap/ChildrenNode';\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 *\n * @constructor\n * @param {!ImmutableTree.<!Node>} writeTree\n */\nexport class CompoundWrite {\n  constructor(private writeTree_: ImmutableTree<Node>) {}\n  /**\n   * @type {!CompoundWrite}\n   */\n  static Empty = new CompoundWrite(new ImmutableTree(null));\n\n  /**\n   * @param {!Path} path\n   * @param {!Node} node\n   * @return {!CompoundWrite}\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  /**\n   * @param {!Path} path\n   * @param {!Object.<string, !Node>} updates\n   * @return {!CompoundWrite}\n   */\n  addWrites(path: Path, updates: { [name: string]: Node }): CompoundWrite {\n    let newWrite = this as CompoundWrite;\n    forEach(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 <em>not</em> modify a write at a higher\n   * location, which must be removed by calling this method with that path.\n   *\n   * @param {!Path} 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} path The path to check for\n   * @return {boolean} 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} path The path to get a complete write\n   * @return {?Node} 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 {!Array.<NamedNode>} A list of all complete children.\n   */\n  getCompleteChildren(): Array<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  /**\n   * @param {!Path} path\n   * @return {!CompoundWrite}\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 {boolean} 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} node The node to apply this CompoundWrite to\n   * @return {!Node} The node with all writes applied\n   */\n  apply(node: Node): Node {\n    return CompoundWrite.applySubtreeWrite_(Path.Empty, this.writeTree_, node);\n  }\n\n  /**\n   * @param {!Path} relativePath\n   * @param {!ImmutableTree.<!Node>} writeTree\n   * @param {!Node} node\n   * @return {!Node}\n   * @private\n   */\n  private static applySubtreeWrite_ = function(\n    relativePath: Path,\n    writeTree: ImmutableTree<Node>,\n    node: Node\n  ): Node {\n    if (writeTree.value != null) {\n      // Since there a write is always a leaf, we're done here\n      return node.updateChild(relativePath, writeTree.value);\n    } else {\n      let priorityWrite = null;\n      writeTree.children.inorderTraversal(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 = CompoundWrite.applySubtreeWrite_(\n            relativePath.child(childKey),\n            childTree,\n            node\n          );\n        }\n      });\n      // If there was a priority write, we only apply it if the node is not empty\n      if (!node.getChild(relativePath).isEmpty() && priorityWrite !== null) {\n        node = node.updateChild(relativePath.child('.priority'), priorityWrite);\n      }\n      return node;\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 { findKey, forEach, 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';\n\n/**\n * Defines a single user-initiated write operation. May be the result of a set(), transaction(), or update() call. In\n * the case of a set() or transaction, snap wil be non-null.  In the case of an update(), children will be non-null.\n */\nexport interface WriteRecord {\n  writeId: number;\n  path: Path;\n  snap?: Node | null;\n  children?: { [k: string]: Node } | null;\n  visible: boolean;\n}\n\n/**\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\n * and addMerge(), and removed with removeWrite().\n *\n * @constructor\n */\nexport class WriteTree {\n  /**\n   * A tree tracking the result of applying all visible writes.  This does not include transactions with\n   * applyLocally=false or writes that are completely shadowed by other writes.\n   *\n   * @type {!CompoundWrite}\n   * @private\n   */\n  private visibleWrites_: CompoundWrite = CompoundWrite.Empty;\n\n  /**\n   * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\n   * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\n   * used by transactions).\n   *\n   * @type {!Array.<!WriteRecord>}\n   * @private\n   */\n  private allWrites_: WriteRecord[] = [];\n\n  private lastWriteId_ = -1;\n\n  /**\n   * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\n   *\n   * @param {!Path} path\n   * @return {!WriteTreeRef}\n   */\n  childWrites(path: Path): WriteTreeRef {\n    return new WriteTreeRef(path, this);\n  }\n\n  /**\n   * Record a new overwrite from user code.\n   *\n   * @param {!Path} path\n   * @param {!Node} snap\n   * @param {!number} writeId\n   * @param {boolean=} visible This is set to false by some transactions. It should be excluded from event caches\n   */\n  addOverwrite(path: Path, snap: Node, writeId: number, visible?: boolean) {\n    assert(\n      writeId > this.lastWriteId_,\n      'Stacking an older write on top of newer ones'\n    );\n    if (visible === undefined) {\n      visible = true;\n    }\n    this.allWrites_.push({\n      path: 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.<string, !Node>} changedChildren\n   * @param {!number} writeId\n   */\n  addMerge(\n    path: Path,\n    changedChildren: { [k: string]: Node },\n    writeId: number\n  ) {\n    assert(\n      writeId > this.lastWriteId_,\n      'Stacking an older merge on top of newer ones'\n    );\n    this.allWrites_.push({\n      path: 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        forEach(children, (childName: string) => {\n          this.visibleWrites_ = this.visibleWrites_.removeWrite(\n            writeToRemove.path.child(childName)\n          );\n        });\n      }\n      return true;\n    }\n  }\n\n  /**\n   * Return a complete snapshot for the given path if there's visible write data at that path, else null.\n   * No server data is considered.\n   *\n   * @param {!Path} path\n   * @return {?Node}\n   */\n  getCompleteWriteData(path: Path): Node | null {\n    return this.visibleWrites_.getCompleteNode(path);\n  }\n\n  /**\n   * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\n   * writes), attempt to calculate a complete snapshot for the given path\n   *\n   * @param {!Path} treePath\n   * @param {?Node} completeServerCache\n   * @param {Array.<number>=} writeIdsToExclude An optional set to be excluded\n   * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n   * @return {?Node}\n   */\n  calcCompleteEventCache(\n    treePath: Path,\n    completeServerCache: Node | null,\n    writeIdsToExclude?: number[],\n    includeHiddenWrites?: boolean\n  ): Node | null {\n    if (!writeIdsToExclude && !includeHiddenWrites) {\n      const shadowingNode = this.visibleWrites_.getCompleteNode(treePath);\n      if (shadowingNode != null) {\n        return shadowingNode;\n      } else {\n        const subMerge = this.visibleWrites_.childCompoundWrite(treePath);\n        if (subMerge.isEmpty()) {\n          return completeServerCache;\n        } else if (\n          completeServerCache == null &&\n          !subMerge.hasCompleteWrite(Path.Empty)\n        ) {\n          // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\n          return null;\n        } else {\n          const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n          return subMerge.apply(layeredCache);\n        }\n      }\n    } else {\n      const merge = this.visibleWrites_.childCompoundWrite(treePath);\n      if (!includeHiddenWrites && merge.isEmpty()) {\n        return completeServerCache;\n      } else {\n        // If the server cache is null, and we don't have a complete cache, we need to return null\n        if (\n          !includeHiddenWrites &&\n          completeServerCache == null &&\n          !merge.hasCompleteWrite(Path.Empty)\n        ) {\n          return null;\n        } else {\n          const filter = function(write: WriteRecord) {\n            return (\n              (write.visible || includeHiddenWrites) &&\n              (!writeIdsToExclude ||\n                !~writeIdsToExclude.indexOf(write.writeId)) &&\n              (write.path.contains(treePath) || treePath.contains(write.path))\n            );\n          };\n          const mergeAtPath = WriteTree.layerTree_(\n            this.allWrites_,\n            filter,\n            treePath\n          );\n          const layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\n          return mergeAtPath.apply(layeredCache);\n        }\n      }\n    }\n  }\n\n  /**\n   * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\n   * Used when creating new views, to pre-fill their complete event children snapshot.\n   *\n   * @param {!Path} treePath\n   * @param {?ChildrenNode} completeServerChildren\n   * @return {!ChildrenNode}\n   */\n  calcCompleteEventChildren(\n    treePath: Path,\n    completeServerChildren: ChildrenNode | null\n  ) {\n    let completeChildren = ChildrenNode.EMPTY_NODE as Node;\n    const topLevelSet = this.visibleWrites_.getCompleteNode(treePath);\n    if (topLevelSet) {\n      if (!topLevelSet.isLeafNode()) {\n        // we're shadowing everything. Return the children.\n        topLevelSet.forEachChild(PRIORITY_INDEX, 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   * @param {!Path} path\n   * @return {?Node}\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   * @param {!Path} treePath\n   * @param {?Node} completeServerData\n   * @param {!NamedNode} startPost\n   * @param {!number} count\n   * @param {boolean} reverse\n   * @param {!Index} index\n   * @return {!Array.<!NamedNode>}\n   */\n  calcIndexedSlice(\n    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  /**\n   * @param {!WriteRecord} writeRecord\n   * @param {!Path} path\n   * @return {boolean}\n   * @private\n   */\n  private recordContainsPath_(writeRecord: WriteRecord, path: Path): boolean {\n    if (writeRecord.snap) {\n      return writeRecord.path.contains(path);\n    } else {\n      // findKey can return undefined, so use !! to coerce to boolean\n      return !!findKey(writeRecord.children, function(\n        childSnap: Node,\n        childName: string\n      ) {\n        return writeRecord.path.child(childName).contains(path);\n      });\n    }\n  }\n\n  /**\n   * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\n   * @private\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   * @param {!WriteRecord} write\n   * @return {boolean}\n   * @private\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   * @param {!Array.<!WriteRecord>} writes\n   * @param {!function(!WriteRecord):boolean} filter\n   * @param {!Path} treeRoot\n   * @return {!CompoundWrite}\n   * @private\n   */\n  private static layerTree_(\n    writes: WriteRecord[],\n    filter: (w: WriteRecord) => boolean,\n    treeRoot: Path\n  ): CompoundWrite {\n    let compoundWrite = CompoundWrite.Empty;\n    for (let i = 0; i < writes.length; ++i) {\n      const write = writes[i];\n      // Theory, a later set will either:\n      // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\n      // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\n      if (filter(write)) {\n        const writePath = write.path;\n        let relativePath;\n        if (write.snap) {\n          if (treeRoot.contains(writePath)) {\n            relativePath = Path.relativePath(treeRoot, writePath);\n            compoundWrite = compoundWrite.addWrite(relativePath, write.snap);\n          } else if (writePath.contains(treeRoot)) {\n            relativePath = Path.relativePath(writePath, treeRoot);\n            compoundWrite = compoundWrite.addWrite(\n              Path.Empty,\n              write.snap.getChild(relativePath)\n            );\n          } else {\n            // There is no overlap between root path and write path, ignore write\n          }\n        } else if (write.children) {\n          if (treeRoot.contains(writePath)) {\n            relativePath = Path.relativePath(treeRoot, writePath);\n            compoundWrite = compoundWrite.addWrites(\n              relativePath,\n              write.children\n            );\n          } else if (writePath.contains(treeRoot)) {\n            relativePath = Path.relativePath(writePath, treeRoot);\n            if (relativePath.isEmpty()) {\n              compoundWrite = compoundWrite.addWrites(\n                Path.Empty,\n                write.children\n              );\n            } else {\n              const child = safeGet(write.children, relativePath.getFront());\n              if (child) {\n                // There exists a child in this node that matches the root path\n                const deepNode = child.getChild(relativePath.popFront());\n                compoundWrite = compoundWrite.addWrite(Path.Empty, deepNode);\n              }\n            }\n          } else {\n            // There is no overlap between root path and write path, ignore write\n          }\n        } else {\n          throw assertionError('WriteRecord should have .snap or .children');\n        }\n      }\n    }\n    return compoundWrite;\n  }\n}\n\n/**\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\n * just proxy to the underlying WriteTree.\n *\n * @constructor\n */\nexport class WriteTreeRef {\n  /**\n   * The path to this particular write tree ref. Used for calling methods on writeTree_ while exposing a simpler\n   * interface to callers.\n   *\n   * @type {!Path}\n   * @private\n   * @const\n   */\n  private readonly treePath_: Path;\n\n  /**\n   * * A reference to the actual tree of write data. All methods are pass-through to the tree, but with the appropriate\n   * path prefixed.\n   *\n   * This lets us make cheap references to points in the tree for sync points without having to copy and maintain all of\n   * the data.\n   *\n   * @type {!WriteTree}\n   * @private\n   * @const\n   */\n  private readonly writeTree_: WriteTree;\n\n  /**\n   * @param {!Path} path\n   * @param {!WriteTree} writeTree\n   */\n  constructor(path: Path, writeTree: WriteTree) {\n    this.treePath_ = path;\n    this.writeTree_ = writeTree;\n  }\n\n  /**\n   * If possible, returns a complete event cache, using the underlying server data if possible. In addition, can be used\n   * to get a cache that includes hidden writes, and excludes arbitrary writes. Note that customizing the returned node\n   * can lead to a more expensive calculation.\n   *\n   * @param {?Node} completeServerCache\n   * @param {Array.<number>=} writeIdsToExclude Optional writes to exclude.\n   * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\n   * @return {?Node}\n   */\n  calcCompleteEventCache(\n    completeServerCache: Node | null,\n    writeIdsToExclude?: number[],\n    includeHiddenWrites?: boolean\n  ): Node | null {\n    return this.writeTree_.calcCompleteEventCache(\n      this.treePath_,\n      completeServerCache,\n      writeIdsToExclude,\n      includeHiddenWrites\n    );\n  }\n\n  /**\n   * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\n   * mix of the given server data and write data.\n   *\n   * @param {?ChildrenNode} completeServerChildren\n   * @return {!ChildrenNode}\n   */\n  calcCompleteEventChildren(\n    completeServerChildren: ChildrenNode | null\n  ): ChildrenNode {\n    return this.writeTree_.calcCompleteEventChildren(\n      this.treePath_,\n      completeServerChildren\n    ) as ChildrenNode;\n  }\n\n  /**\n   * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\n   * if anything, needs to be applied to the event cache.\n   *\n   * Possibilities:\n   *\n   * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\n   *\n   * 2. Some write is completely shadowing. No events to be raised\n   *\n   * 3. Is partially shadowed. Events should be raised\n   *\n   * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\n   *\n   * @param {!Path} path\n   * @param {?Node} existingEventSnap\n   * @param {?Node} existingServerSnap\n   * @return {?Node}\n   */\n  calcEventCacheAfterServerOverwrite(\n    path: Path,\n    existingEventSnap: Node | null,\n    existingServerSnap: Node | null\n  ): Node | null {\n    return this.writeTree_.calcEventCacheAfterServerOverwrite(\n      this.treePath_,\n      path,\n      existingEventSnap,\n      existingServerSnap\n    );\n  }\n\n  /**\n   * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\n   * a higher path, this will return the child of that write relative to the write and this path.\n   * Returns null if there is no write at this path.\n   *\n   * @param {!Path} path\n   * @return {?Node}\n   */\n  shadowingWrite(path: Path): Node | null {\n    return this.writeTree_.shadowingWrite(this.treePath_.child(path));\n  }\n\n  /**\n   * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\n   * the window, but may now be in the window\n   *\n   * @param {?Node} completeServerData\n   * @param {!NamedNode} startPost\n   * @param {!number} count\n   * @param {boolean} reverse\n   * @param {!Index} index\n   * @return {!Array.<!NamedNode>}\n   */\n  calcIndexedSlice(\n    completeServerData: Node | null,\n    startPost: NamedNode,\n    count: number,\n    reverse: boolean,\n    index: Index\n  ): NamedNode[] {\n    return this.writeTree_.calcIndexedSlice(\n      this.treePath_,\n      completeServerData,\n      startPost,\n      count,\n      reverse,\n      index\n    );\n  }\n\n  /**\n   * Returns a complete child for a given server snap after applying all user writes or null if there is no\n   * complete child for this ChildKey.\n   *\n   * @param {!string} childKey\n   * @param {!CacheNode} existingServerCache\n   * @return {?Node}\n   */\n  calcCompleteChild(\n    childKey: string,\n    existingServerCache: CacheNode\n  ): Node | null {\n    return this.writeTree_.calcCompleteChild(\n      this.treePath_,\n      childKey,\n      existingServerCache\n    );\n  }\n\n  /**\n   * Return a WriteTreeRef for a child.\n   *\n   * @param {string} childName\n   * @return {!WriteTreeRef}\n   */\n  child(childName: string): WriteTreeRef {\n    return new WriteTreeRef(this.treePath_.child(childName), this.writeTree_);\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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 } from './util/util';\nimport { AckUserWrite } from './operation/AckUserWrite';\nimport { ChildrenNode } from './snap/ChildrenNode';\nimport { forEach, safeGet } from '@firebase/util';\nimport { ImmutableTree } from './util/ImmutableTree';\nimport { ListenComplete } from './operation/ListenComplete';\nimport { Merge } from './operation/Merge';\nimport { Operation, OperationSource } from './operation/Operation';\nimport { Overwrite } from './operation/Overwrite';\nimport { Path } from './util/Path';\nimport { SyncPoint } from './SyncPoint';\nimport { WriteTree, WriteTreeRef } from './WriteTree';\nimport { Query } from '../api/Query';\nimport { Node } from './snap/Node';\nimport { Event } from './view/Event';\nimport { EventRegistration } from './view/EventRegistration';\nimport { View } from './view/View';\n\n/**\n * @typedef {{\n *   startListening: function(\n *     !Query,\n *     ?number,\n *     function():string,\n *     function(!string, *):!Array.<!Event>\n *   ):!Array.<!Event>,\n *\n *   stopListening: function(!Query, ?number)\n * }}\n */\nexport interface ListenProvider {\n  startListening(\n    query: Query,\n    tag: number | null,\n    hashFn: () => string,\n    onComplete: (a: string, b?: 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   * @type {!ImmutableTree.<!SyncPoint>}\n   * @private\n   */\n  private syncPointTree_: ImmutableTree<SyncPoint> = ImmutableTree.Empty;\n\n  /**\n   * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\n   * @type {!WriteTree}\n   * @private\n   */\n  private pendingWriteTree_ = new WriteTree();\n\n  private tagToQueryMap_: { [k: string]: string } = {};\n  private queryToTagMap_: { [k: string]: number } = {};\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   * @param {!Path} path\n   * @param {!Node} newData\n   * @param {number} writeId\n   * @param {boolean=} visible\n   * @return {!Array.<!Event>} 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   * @param {!Path} path\n   * @param {!Object.<string, !Node>} changedChildren\n   * @param {!number} writeId\n   * @return {!Array.<!Event>} 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 {!number} writeId\n   * @param {boolean=} revert True if the given write failed and needs to be reverted\n   * @return {!Array.<!Event>} 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        forEach(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   * @param {!Path} path\n   * @param {!Node} newData\n   * @return {!Array.<!Event>} 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   * @param {!Path} path\n   * @param {!Object.<string, !Node>} changedChildren\n   * @return {!Array.<!Event>} 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   * @param {!Path} path\n   * @return {!Array.<!Event>} 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   * @param {!Path} path\n   * @param {!Node} snap\n   * @param {!number} tag\n   * @return {!Array.<!Event>} 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   * @param {!Path} path\n   * @param {!Object.<string, !Node>} changedChildren\n   * @param {!number} tag\n   * @return {!Array.<!Event>} 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   * @param {!Path} path\n   * @param {!number} tag\n   * @return {!Array.<!Event>} 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   * @param {!Query} query\n   * @param {!EventRegistration} eventRegistration\n   * @return {!Array.<!Event>} 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        !(queryKey in this.queryToTagMap_),\n        'View does not exist, but we have a tag'\n      );\n      const tag = SyncTree.getNextQueryTag_();\n      this.queryToTagMap_[queryKey] = tag;\n      // Coerce to string to avoid sparse arrays.\n      this.tagToQueryMap_['_' + 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 {!Query} query\n   * @param {?EventRegistration} eventRegistration If null, all callbacks are removed.\n   * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\n   * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\n   */\n  removeEventRegistration(\n    query: Query,\n    eventRegistration: EventRegistration | null,\n    cancelError?: Error\n  ): Event[] {\n    // Find the syncPoint first. Then deal with whether or not it has matching listeners\n    const path = query.path;\n    const maybeSyncPoint = this.syncPointTree_.get(path);\n    let cancelEvents: Event[] = [];\n    // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\n    // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\n    // not loadsAllData().\n    if (\n      maybeSyncPoint &&\n      (query.queryIdentifier() === 'default' ||\n        maybeSyncPoint.viewExistsForQuery(query))\n    ) {\n      /**\n       * @type {{removed: !Array.<!Query>, events: !Array.<!Event>}}\n       */\n      const removedAndEvents = maybeSyncPoint.removeEventRegistration(\n        query,\n        eventRegistration,\n        cancelError\n      );\n      if (maybeSyncPoint.isEmpty()) {\n        this.syncPointTree_ = this.syncPointTree_.remove(path);\n      }\n      const removed = removedAndEvents.removed;\n      cancelEvents = removedAndEvents.events;\n      // We may have just removed one of many listeners and can short-circuit this whole process\n      // We may also not have removed a default listener, in which case all of the descendant listeners should already be\n      // properly set up.\n      //\n      // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\n      // queryId === 'default'\n      const removingDefault =\n        -1 !==\n        removed.findIndex(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_[\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   * @param {!Path} path The path to the data we want\n   * @param {Array.<number>=} writeIdsToExclude A specific set to be excluded\n   * @return {?Node}\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   * @param {!ImmutableTree.<!SyncPoint>} subtree\n   * @return {!Array.<!View>}\n   * @private\n   */\n  private collectDistinctViewsForSubTree_(\n    subtree: ImmutableTree<SyncPoint>\n  ): View[] {\n    return subtree.fold<View[]>(\n      (relativePath, maybeChildSyncPoint, childMap) => {\n        if (maybeChildSyncPoint && maybeChildSyncPoint.hasCompleteView()) {\n          const completeView = maybeChildSyncPoint.getCompleteView();\n          return [completeView];\n        } else {\n          // No complete view here, flatten any deeper listens into an array\n          let views: View[] = [];\n          if (maybeChildSyncPoint) {\n            views = maybeChildSyncPoint.getQueryViews();\n          }\n          forEach(childMap, function(key: string, childViews: View[]) {\n            views = views.concat(childViews);\n          });\n          return views;\n        }\n      }\n    );\n  }\n\n  /**\n   * @param {!Array.<!Query>} queries\n   * @private\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_[removedQueryKey];\n        delete this.queryToTagMap_[removedQueryKey];\n        delete this.tagToQueryMap_['_' + removedQueryTag];\n      }\n    }\n  }\n\n  /**\n   * Normalizes a query to a query we send the server for listening\n   * @param {!Query} query\n   * @return {!Query} The normalized query\n   * @private\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 /** @type {!Query} */ 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   * @param {!Query} query\n   * @param {!View} view\n   * @return {!Array.<!Event>} This method can return events to support synchronous data sources\n   * @private\n   */\n  private setupListener_(query: Query, view: View): Event[] {\n    const path = query.path;\n    const tag = this.tagForQuery_(query);\n    const listener = this.createListenerForView_(view);\n\n    const events = this.listenProvider_.startListening(\n      SyncTree.queryForListening_(query),\n      tag,\n      listener.hashFn,\n      listener.onComplete\n    );\n\n    const subtree = this.syncPointTree_.subtree(path);\n    // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\n    // may need to shadow other listens as well.\n    if (tag) {\n      assert(\n        !subtree.value.hasCompleteView(),\n        \"If we're adding a query, it shouldn't be shadowed\"\n      );\n    } else {\n      // Shadow everything at or below this location, this is a default listener.\n      const queriesToStop = subtree.fold<Query[]>(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          forEach(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  /**\n   *\n   * @param {!View} view\n   * @return {{hashFn: function(), onComplete: function(!string, *)}}\n   * @private\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   * @private\n   * @param {!Query} query\n   * @return {string}\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   * @private\n   * @param {!string} queryKey\n   * @return {{queryId: !string, path: !Path}}\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   * @param {!number} tag\n   * @return {?string}\n   * @private\n   */\n  private queryKeyForTag_(tag: number): string | null {\n    return this.tagToQueryMap_['_' + tag];\n  }\n\n  /**\n   * Return the tag associated with the given query.\n   * @param {!Query} query\n   * @return {?number}\n   * @private\n   */\n  private tagForQuery_(query: Query): number | null {\n    const queryKey = SyncTree.makeQueryKey_(query);\n    return safeGet(this.queryToTagMap_, queryKey);\n  }\n\n  /**\n   * Static tracker for next query tag.\n   * @type {number}\n   * @private\n   */\n  private static nextQueryTag_ = 1;\n\n  /**\n   * Static accessor for query tags.\n   * @return {number}\n   * @private\n   */\n  private static getNextQueryTag_(): number {\n    return SyncTree.nextQueryTag_++;\n  }\n\n  /**\n   * A helper method to apply tagged operations\n   *\n   * @param {!Path} queryPath\n   * @param {!Operation} operation\n   * @return {!Array.<!Event>}\n   * @private\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   * @param {!Operation} operation\n   * @return {!Array.<!Event>}\n   * @private\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\n   * @param {!Operation} operation\n   * @param {ImmutableTree.<!SyncPoint>} syncPointTree\n   * @param {?Node} serverCache\n   * @param {!WriteTreeRef} writesCache\n   * @return {!Array.<!Event>}\n   */\n  private applyOperationHelper_(\n    operation: Operation,\n    syncPointTree: ImmutableTree<SyncPoint>,\n    serverCache: Node | null,\n    writesCache: WriteTreeRef\n  ): Event[] {\n    if (operation.path.isEmpty()) {\n      return this.applyOperationDescendantsHelper_(\n        operation,\n        syncPointTree,\n        serverCache,\n        writesCache\n      );\n    } else {\n      const syncPoint = syncPointTree.get(Path.Empty);\n\n      // If we don't have cached server data, see if we can get it from this SyncPoint.\n      if (serverCache == null && syncPoint != null) {\n        serverCache = syncPoint.getCompleteServerCache(Path.Empty);\n      }\n\n      let events: Event[] = [];\n      const childName = operation.path.getFront();\n      const childOperation = operation.operationForChild(childName);\n      const childTree = syncPointTree.children.get(childName);\n      if (childTree && childOperation) {\n        const childServerCache = serverCache\n          ? serverCache.getImmediateChild(childName)\n          : null;\n        const childWritesCache = writesCache.child(childName);\n        events = events.concat(\n          this.applyOperationHelper_(\n            childOperation,\n            childTree,\n            childServerCache,\n            childWritesCache\n          )\n        );\n      }\n\n      if (syncPoint) {\n        events = events.concat(\n          syncPoint.applyOperation(operation, writesCache, serverCache)\n        );\n      }\n\n      return events;\n    }\n  }\n\n  /**\n   * Recursive helper for applyOperationToSyncPoints_\n   *\n   * @private\n   * @param {!Operation} operation\n   * @param {ImmutableTree.<!SyncPoint>} syncPointTree\n   * @param {?Node} serverCache\n   * @param {!WriteTreeRef} writesCache\n   * @return {!Array.<!Event>}\n   */\n  private applyOperationDescendantsHelper_(\n    operation: Operation,\n    syncPointTree: ImmutableTree<SyncPoint>,\n    serverCache: Node | null,\n    writesCache: WriteTreeRef\n  ): Event[] {\n    const syncPoint = syncPointTree.get(Path.Empty);\n\n    // If we don't have cached server data, see if we can get it from this SyncPoint.\n    if (serverCache == null && syncPoint != null) {\n      serverCache = syncPoint.getCompleteServerCache(Path.Empty);\n    }\n\n    let events: Event[] = [];\n    syncPointTree.children.inorderTraversal((childName, childTree) => {\n      const childServerCache = serverCache\n        ? serverCache.getImmediateChild(childName)\n        : null;\n      const childWritesCache = writesCache.child(childName);\n      const childOperation = operation.operationForChild(childName);\n      if (childOperation) {\n        events = events.concat(\n          this.applyOperationDescendantsHelper_(\n            childOperation,\n            childTree,\n            childServerCache,\n            childWritesCache\n          )\n        );\n      }\n    });\n\n    if (syncPoint) {\n      events = events.concat(\n        syncPoint.applyOperation(operation, writesCache, serverCache)\n      );\n    }\n\n    return events;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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<FirebaseAuthTokenData>}\n   */\n  getToken(forceRefresh: boolean): Promise<FirebaseAuthTokenData> {\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<T>(\n    repoInfo: RepoInfo,\n    creatorFunction: () => T\n  ): T {\n    const hashString = repoInfo.toString();\n\n    if (!this.reporters_[hashString]) {\n      this.reporters_[hashString] = creatorFunction();\n    }\n\n    return this.reporters_[hashString];\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 { clone, forEach } from '@firebase/util';\nimport { StatsCollection } from './StatsCollection';\n\n/**\n * Returns the delta from the previous call to get stats.\n *\n * @param collection_ The collection to \"listen\" to.\n * @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: typeof newStats = clone(newStats);\n    if (this.last_) {\n      forEach(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, forEach } from '@firebase/util';\nimport { setTimeoutNonBlocking } 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    forEach(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.<EventList>}\n   */\n  private eventLists_: EventList[] = [];\n\n  /**\n   * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\n   * @private\n   * @type {!number}\n   */\n  private recursionDepth_ = 0;\n\n  /**\n   * @param {!Array.<Event>} eventDataList The new events to queue.\n   */\n  queueEvents(eventDataList: Event[]) {\n    // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\n    let currList = null;\n    for (let i = 0; i < eventDataList.length; i++) {\n      const eventData = eventDataList[i];\n      const eventPath = eventData.getPath();\n      if (currList !== null && !eventPath.equals(currList.getPath())) {\n        this.eventLists_.push(currList);\n        currList = null;\n      }\n\n      if (currList === null) {\n        currList = new EventList(eventPath);\n      }\n\n      currList.add(eventData);\n    }\n    if (currList) {\n      this.eventLists_.push(currList);\n    }\n  }\n\n  /**\n   * Queues the specified events and synchronously raises all events (including previously queued ones)\n   * for the specified path.\n   *\n   * It is assumed that the new events are all for the specified path.\n   *\n   * @param {!Path} path The path to raise events for.\n   * @param {!Array.<Event>} eventDataList The new events to raise.\n   */\n  raiseEventsAtPath(path: Path, eventDataList: Event[]) {\n    this.queueEvents(eventDataList);\n    this.raiseQueuedEventsMatchingPredicate_((eventPath: Path) =>\n      eventPath.equals(path)\n    );\n  }\n\n  /**\n   * Queues the specified events and synchronously raises all events (including previously queued ones) for\n   * locations related to the specified change path (i.e. all ancestors and descendants).\n   *\n   * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\n   *\n   * @param {!Path} changedPath The path to raise events for.\n   * @param {!Array.<!Event>} eventDataList The events to raise\n   */\n  raiseEventsForChangedPath(changedPath: Path, eventDataList: Event[]) {\n    this.queueEvents(eventDataList);\n\n    this.raiseQueuedEventsMatchingPredicate_((eventPath: Path) => {\n      return eventPath.contains(changedPath) || changedPath.contains(eventPath);\n    });\n  }\n\n  /**\n   * @param {!function(!Path):boolean} predicate\n   * @private\n   */\n  private raiseQueuedEventsMatchingPredicate_(\n    predicate: (path: Path) => boolean\n  ) {\n    this.recursionDepth_++;\n\n    let sentAll = true;\n    for (let i = 0; i < this.eventLists_.length; i++) {\n      const eventList = this.eventLists_[i];\n      if (eventList) {\n        const eventPath = eventList.getPath();\n        if (predicate(eventPath)) {\n          this.eventLists_[i].raise();\n          this.eventLists_[i] = null;\n        } else {\n          sentAll = false;\n        }\n      }\n    }\n\n    if (sentAll) {\n      this.eventLists_ = [];\n    }\n\n    this.recursionDepth_--;\n  }\n}\n\n/**\n * @param {!Path} path\n * @constructor\n */\nexport class EventList {\n  /**\n   * @type {!Array.<Event>}\n   * @private\n   */\n  private events_: Event[] = [];\n\n  constructor(private readonly path_: Path) {}\n\n  /**\n   * @param {!Event} eventData\n   */\n  add(eventData: Event) {\n    this.events_.push(eventData);\n  }\n\n  /**\n   * Iterates through the list and raises each event\n   */\n  raise() {\n    for (let i = 0; i < this.events_.length; i++) {\n      const eventData = this.events_[i];\n      if (eventData !== null) {\n        this.events_[i] = null;\n        const eventFn = eventData.getEventRunner();\n        if (logger) {\n          log('event: ' + eventData.toString());\n        }\n        exceptionGuard(eventFn);\n      }\n    }\n  }\n\n  /**\n   * @return {!Path}\n   */\n  getPath(): Path {\n    return this.path_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<string>} allowedEvents_\n   */\n  constructor(private allowedEvents_: Array<string>) {\n    assert(\n      Array.isArray(allowedEvents_) && allowedEvents_.length > 0,\n      'Requires a non-empty array'\n    );\n  }\n\n  /**\n   * To be overridden by derived classes in order to fire an initial event when\n   * somebody subscribes for data.\n   *\n   * @param {!string} eventType\n   * @return {Array.<*>} Array of parameters to trigger initial event with.\n   */\n  abstract getInitialEvent(eventType: string): 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.<boolean>}\n   */\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'visible', 'Unknown event type: ' + eventType);\n    return [this.visible_];\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<boolean>}\n   */\n  getInitialEvent(eventType: string): boolean[] {\n    assert(eventType === 'online', 'Unknown event type: ' + eventType);\n    return [this.online_];\n  }\n\n  /**\n   * @return {boolean}\n   */\n  currentlyOnline(): boolean {\n    return this.online_;\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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 { CountedSet } from '../core/util/CountedSet';\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  /**\n   * @type {CountedSet.<number, number>}\n   */\n  outstandingRequests = new CountedSet<number, number>();\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 = '<script>document.domain=\"' + currentDomain + '\";</script>';\n      }\n      const iframeContents = '<html><body>' + script + '</body></html>';\n      try {\n        this.myIFrame.doc.open();\n        this.myIFrame.doc.write(iframeContents);\n        this.myIFrame.doc.close();\n      } catch (e) {\n        log('frame writing exception');\n        if (e.stack) {\n          log(e.stack);\n        }\n        log(e);\n      }\n    } else {\n      this.commandCB = commandCB;\n      this.onMessageCB = onMessageCB;\n    }\n  }\n\n  /**\n   * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\n   * actually use.\n   * @private\n   * @return {Element}\n   */\n  private static createIFrame_(): IFrameElement {\n    const iframe = document.createElement('iframe') as IFrameElement;\n    iframe.style.display = 'none';\n\n    // This is necessary in order to initialize the document inside the iframe\n    if (document.body) {\n      document.body.appendChild(iframe);\n      try {\n        // If document.domain has been modified in IE, this will throw an error, and we need to set the\n        // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\n        // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\n        const a = iframe.contentWindow.document;\n        if (!a) {\n          // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\n          log('No IE domain setting required');\n        }\n      } catch (e) {\n        const domain = document.domain;\n        iframe.src =\n          \"javascript:void((function(){document.open();document.domain='\" +\n          domain +\n          \"';document.close();})())\";\n      }\n    } else {\n      // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\n      // never gets hit.\n      throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\n    }\n\n    // Get the document of the iframe in a browser-specific way.\n    if (iframe.contentDocument) {\n      (iframe 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.count() < (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, 1);\n\n    const doNewRequest = () => {\n      this.outstandingRequests.remove(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 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 firebase from '@firebase/app';\nimport { assert } 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 { CONSTANTS as ENV_CONSTANTS } from '@firebase/util';\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';\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/<wire_protocol>/<sdk_version>/<platform>/<device>\n        const options: { [k: string]: object } = {\n          headers: {\n            'User-Agent': `Firebase/${PROTOCOL_VERSION}/${\n              firebase.SDK_VERSION\n            }/${process.platform}/${device}`\n          }\n        };\n\n        // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\n        const env = process['env'];\n        const proxy =\n          this.connURL.indexOf('wss://') == 0\n            ? env['HTTPS_PROXY'] || env['https_proxy']\n            : env['HTTP_PROXY'] || env['http_proxy'];\n\n        if (proxy) {\n          options['proxy'] = { origin: proxy };\n        }\n\n        this.mySock = new WebSocketImpl(this.connURL, [], options);\n      } else {\n        this.mySock = new WebSocketImpl(this.connURL);\n      }\n    } catch (e) {\n      this.log_('Error instantiating WebSocket.');\n      const error = e.message || e.data;\n      if (error) {\n        this.log_(error);\n      }\n      this.onClosed_();\n      return;\n    }\n\n    this.mySock.onopen = () => {\n      this.log_('Websocket connected.');\n      this.everConnected_ = true;\n    };\n\n    this.mySock.onclose = () => {\n      this.log_('Websocket connection was disconnected.');\n      this.mySock = null;\n      this.onClosed_();\n    };\n\n    this.mySock.onmessage = (m: 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);\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.<function(new:Transport, string, RepoInfo, string=)>}\n   */\n  static get ALL_TRANSPORTS() {\n    return [BrowserPollConnection, WebSocketConnection];\n  }\n\n  /**\n   * @param {!RepoInfo} repoInfo Metadata around the namespace we're connecting to\n   */\n  constructor(repoInfo: RepoInfo) {\n    this.initTransports_(repoInfo);\n  }\n\n  /**\n   * @param {!RepoInfo} repoInfo\n   * @private\n   */\n  private initTransports_(repoInfo: RepoInfo) {\n    const isWebSocketsAvailable: boolean =\n      WebSocketConnection && WebSocketConnection['isAvailable']();\n    let isSkipPollConnection =\n      isWebSocketsAvailable && !WebSocketConnection.previouslyFailed();\n\n    if (repoInfo.webSocketOnly) {\n      if (!isWebSocketsAvailable)\n        warn(\n          \"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\"\n        );\n\n      isSkipPollConnection = true;\n    }\n\n    if (isSkipPollConnection) {\n      this.transports_ = [WebSocketConnection];\n    } else {\n      const transports = (this.transports_ = [] as TransportConstructor[]);\n      each(\n        TransportManager.ALL_TRANSPORTS,\n        (i: number, transport: TransportConstructor) => {\n          if (transport && transport['isAvailable']()) {\n            transports.push(transport);\n          }\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. <ns>.firebaseio.com\n        this.repoInfo_.internalHost = this.repoInfo_.host;\n      }\n    } else if (this.state_ === RealtimeState.CONNECTED) {\n      this.log_('Realtime connection lost.');\n    }\n\n    this.close();\n  }\n\n  /**\n   *\n   * @param {string} reason\n   * @private\n   */\n  private onConnectionShutdown_(reason: string) {\n    this.log_('Connection shutdown command received. Shutting down...');\n\n    if (this.onKill_) {\n      this.onKill_(reason);\n      this.onKill_ = null;\n    }\n\n    // We intentionally don't want to fire onDisconnect (kill is a different case),\n    // so clear the callback.\n    this.onDisconnect_ = null;\n\n    this.close();\n  }\n\n  private sendData_(data: object) {\n    if (this.state_ !== RealtimeState.CONNECTED) {\n      throw 'Connection is not connected';\n    } else {\n      this.tx_.send(data);\n    }\n  }\n\n  /**\n   * Cleans up this connection, calling the appropriate callbacks\n   */\n  close() {\n    if (this.state_ !== RealtimeState.DISCONNECTED) {\n      this.log_('Closing realtime connection.');\n      this.state_ = RealtimeState.DISCONNECTED;\n\n      this.closeConnections_();\n\n      if (this.onDisconnect_) {\n        this.onDisconnect_();\n        this.onDisconnect_ = null;\n      }\n    }\n  }\n\n  /**\n   *\n   * @private\n   */\n  private closeConnections_() {\n    this.log_('Shutting down all connections');\n    if (this.conn_) {\n      this.conn_.close();\n      this.conn_ = null;\n    }\n\n    if (this.secondaryConn_) {\n      this.secondaryConn_.close();\n      this.secondaryConn_ = null;\n    }\n\n    if (this.healthyTimeout_) {\n      clearTimeout(this.healthyTimeout_);\n      this.healthyTimeout_ = null;\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<string, *>} 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 firebase from '@firebase/app';\nimport { forEach, contains, isEmpty, getCount, safeGet } 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 { CONSTANTS } from '@firebase/util';\nimport { isMobileCordova, isReactNative, isNodeSdk } from '@firebase/util';\nimport { ServerActions } from './ServerActions';\nimport { AuthTokenProvider } from './AuthTokenProvider';\nimport { RepoInfo } from './RepoInfo';\nimport { Query } from '../api/Query';\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 {Object} */\n  private interruptReasons_: { [reason: string]: boolean } = {};\n  private listens_: { [path: string]: { [queryId: string]: ListenSpec } } = {};\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 {number|null} */\n  private establishConnectionTimer_: number | null = null;\n\n  /** @private {boolean} */\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 {?{\n   *   sendRequest(Object),\n   *   close()\n   * }} */\n  private realtime_: {\n    sendRequest(a: Object): void;\n    close(): void;\n  } | null = null;\n\n  /** @private {string|null} */\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  /**\n   * @private\n   */\n  private static nextPersistentConnectionId_ = 0;\n\n  /**\n   * Counter for number of connections created. Mainly used for tagging in the logs\n   * @type {number}\n   * @private\n   */\n  private static nextConnectionId_ = 0;\n\n  /**\n   * @implements {ServerActions}\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 onConnectStatus_\n   * @param onServerInfoUpdate_\n   * @param authTokenProvider_\n   * @param authOverride_\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  /**\n   * @param {!string} action\n   * @param {*} body\n   * @param {function(*)=} onResponse\n   * @protected\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    this.listens_[pathString] = this.listens_[pathString] || {};\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_[pathString][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_[pathString][queryId] = listenSpec;\n\n    if (this.connected_) {\n      this.sendListen_(listenSpec);\n    }\n  }\n\n  /**\n   * @param {!{onComplete(),\n   *           hashFn():!string,\n   *           query: !Query,\n   *           tag: ?number}} listenSpec\n   * @private\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_[pathString] && this.listens_[pathString][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  /**\n   * @param {*} payload\n   * @param {!Query} query\n   * @private\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  /**\n   * @param {!string} credential\n   * @private\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  /**\n   * @param {*} message\n   * @private\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  /**\n   * @param {boolean} visible\n   * @private\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  /**\n   * @param {string} reason\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  /**\n   * @param {string} reason\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  /**\n   * @param {!string} pathString\n   * @param {Array.<*>=} query\n   * @private\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  /**\n   * @param {!string} pathString\n   * @param {!string} queryId\n   * @return {{queries:Array.<Query>, onComplete:function(string)}}\n   * @private\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_[normalizedPathString] !== undefined) {\n      listen = this.listens_[normalizedPathString][queryId];\n      delete this.listens_[normalizedPathString][queryId];\n      if (getCount(this.listens_[normalizedPathString]) === 0) {\n        delete this.listens_[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    forEach(this.listens_, (pathString: string, queries: Object) => {\n      forEach(queries, (key: string, listenSpec: ListenSpec) => {\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   * @private\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[\n      'sdk.' + clientName + '.' + firebase.SDK_VERSION.replace(/\\./g, '-')\n    ] = 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  /**\n   * @return {boolean}\n   * @private\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.<string, !Object>}\n   */\n  private listens_: { [k: string]: Object } = {};\n\n  /**\n   * @param {!Query} query\n   * @param {?number=} tag\n   * @return {string}\n   * @private\n   */\n  static getListenId_(query: Query, tag?: number | null): string {\n    if (tag !== undefined) {\n      return 'tag$' + tag;\n    } else {\n      assert(\n        query.getQueryParams().isDefault(),\n        \"should have a tag if it's not a default query.\"\n      );\n      return query.path.toString();\n    }\n  }\n\n  /**\n   * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\n   * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\n   * @param {AuthTokenProvider} authTokenProvider_\n   * @implements {ServerActions}\n   */\n  constructor(\n    private repoInfo_: RepoInfo,\n    private onDataUpdate_: (\n      a: string,\n      b: 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.<string, *>} 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\nimport { forEach } from './obj';\n\n/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a params\n * object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n *\n * @param {!Object} querystringParams\n * @return {string}\n */\nexport const querystring = function(querystringParams) {\n  var params = [];\n  forEach(querystringParams, function(key, value) {\n    if (Array.isArray(value)) {\n      value.forEach(function(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 (e.g. {arg: 'val', arg2: 'val2'})\n *\n * @param {string} querystring\n * @return {!Object}\n */\nexport const querystringDecode = function(querystring) {\n  var obj = {};\n  var tokens = querystring.replace(/^\\?/, '').split('&');\n\n  tokens.forEach(function(token) {\n    if (token) {\n      var 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, forEach, 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  /**\n   * TODO: This should be @private but it's used by test_access.js and internal.js\n   * @type {?PersistentConnection}\n   */\n  persistentConnection_: PersistentConnection | null = null;\n\n  /**\n   * @param {!RepoInfo} repoInfo_\n   * @param {boolean} forceRestClient\n   * @param {!FirebaseApp} app\n   */\n  constructor(\n    public repoInfo_: RepoInfo,\n    forceRestClient: boolean,\n    public app: FirebaseApp\n  ) {\n    /** @type {!AuthTokenProvider} */\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 {string}  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 {!string} The namespace represented by the repo.\n   */\n  name(): string {\n    return this.repoInfo_.namespace;\n  }\n\n  /**\n   * @return {!number} 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   * @return {!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\n   * @param {string} pathString\n   * @param {*} data\n   * @param {boolean} isMerge\n   * @param {?number} tag\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  /**\n   * TODO: This should be @private but it's used by test_access.js and internal.js\n   * @param {?function(!string, *):*} callback\n   * @private\n   */\n  interceptServerData_(callback: ((a: string, b: any) => any) | null) {\n    this.interceptServerDataCallback_ = callback;\n  }\n\n  /**\n   * @param {!boolean} connectStatus\n   * @private\n   */\n  private onConnectStatus_(connectStatus: boolean) {\n    this.updateInfo_('connected', connectStatus);\n    if (connectStatus === false) {\n      this.runOnDisconnectEvents_();\n    }\n  }\n\n  /**\n   * @param {!Object} updates\n   * @private\n   */\n  private onServerInfoUpdate_(updates: Object) {\n    each(updates, (value: any, key: string) => {\n      this.updateInfo_(key, value);\n    });\n  }\n\n  /**\n   *\n   * @param {!string} pathString\n   * @param {*} value\n   * @private\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  /**\n   * @return {!number}\n   * @private\n   */\n  private getNextWriteId_(): number {\n    return this.nextWriteId_++;\n  }\n\n  /**\n   * @param {!Path} path\n   * @param {*} newVal\n   * @param {number|string|null} newPriority\n   * @param {?function(?Error, *=)} onComplete\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  /**\n   * @param {!Path} path\n   * @param {!Object} childrenToMerge\n   * @param {?function(?Error, *=)} onComplete\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    forEach(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      forEach(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   * @private\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  /**\n   * @param {!Path} path\n   * @param {?function(?Error, *=)} onComplete\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  /**\n   * @param {!Path} path\n   * @param {*} value\n   * @param {?function(?Error, *=)} onComplete\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  /**\n   * @param {!Path} path\n   * @param {*} value\n   * @param {*} priority\n   * @param {?function(?Error, *=)} onComplete\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  /**\n   * @param {!Path} path\n   * @param {*} childrenToMerge\n   * @param {?function(?Error, *=)} onComplete\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          forEach(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  /**\n   * @param {!Query} query\n   * @param {!EventRegistration} eventRegistration\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  /**\n   * @param {!Query} query\n   * @param {?EventRegistration} eventRegistration\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    forEach(stats, (stat: string, value: any) => {\n      // pad stat names to be the same length (plus 2 extra spaces).\n      for (let i = stat.length; i < longestName + 2; i++) stat += ' ';\n      console.log(stat + value);\n    });\n  }\n\n  statsIncrementCounter(metric: string) {\n    this.stats_.incrementCounter(metric);\n    this.statsReporter_.includeStat(metric);\n  }\n\n  /**\n   * @param {...*} var_args\n   * @private\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  /**\n   * @param {?function(?Error, *=)} callback\n   * @param {!string} status\n   * @param {?string=} errorReason\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.<string,*>} 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<any>;\n  public catch: (a?: Error) => Promise<any>;\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<any> {\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<any> {\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<any> {\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<any> {\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<TransactionResult> {\n    validateArgCount('Reference.transaction', 1, 3, arguments.length);\n    validateWritablePath('Reference.transaction', this.path);\n    validateCallback('Reference.transaction', 1, transactionUpdate, false);\n    validateCallback('Reference.transaction', 2, onComplete, true);\n    // NOTE: applyLocally is an internal-only option for now.  We need to decide if we want to keep it and how\n    // to expose it.\n    validateBoolean('Reference.transaction', 3, applyLocally, true);\n\n    if (this.getKey() === '.length' || this.getKey() === '.keys')\n      throw 'Reference.transaction failed: ' +\n        this.getKey() +\n        ' is a read-only object.';\n\n    if (applyLocally === undefined) applyLocally = true;\n\n    const deferred = new Deferred<TransactionResult>();\n    if (typeof onComplete === 'function') {\n      deferred.promise.catch(() => {});\n    }\n\n    const promiseComplete = function(\n      error: Error,\n      committed: boolean,\n      snapshot: DataSnapshot\n    ) {\n      if (error) {\n        deferred.reject(error);\n      } else {\n        deferred.resolve(new TransactionResult(committed, snapshot));\n      }\n      if (typeof onComplete === 'function') {\n        onComplete(error, committed, snapshot);\n      }\n    };\n    this.repo.startTransaction(\n      this.path,\n      transactionUpdate,\n      promiseComplete,\n      applyLocally\n    );\n\n    return deferred.promise;\n  }\n\n  /**\n   * @param {string|number|null} priority\n   * @param {function(?Error)=} onComplete\n   * @return {!Promise}\n   */\n  setPriority(\n    priority: string | number | null,\n    onComplete?: (a: Error | null) => void\n  ): Promise<any> {\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 { forEach, contains, safeGet } from '@firebase/util';\n\n/**\n * Node in a Tree.\n */\nexport class TreeNode<T> {\n  // TODO: Consider making accessors that create children and value lazily or\n  // separate Internal / Leaf 'types'.\n  children: { [name: string]: TreeNode<T> } = {};\n  childCount = 0;\n  value: T | null = null;\n}\n\n/**\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\n * children.\n */\nexport class Tree<T> {\n  /**\n   * @template T\n   * @param {string=} name_ Optional name of the node.\n   * @param {Tree=} parent_ Optional parent node.\n   * @param {TreeNode=} node_ Optional node to wrap.\n   */\n  constructor(\n    private name_: string = '',\n    private parent_: Tree<T> | null = null,\n    private node_: TreeNode<T> = new TreeNode<T>()\n  ) {}\n\n  /**\n   * Returns a sub-Tree for the given path.\n   *\n   * @param {!(string|Path)} pathObj Path to look up.\n   * @return {!Tree.<T>} Tree for path.\n   */\n  subTree(pathObj: string | Path): Tree<T> {\n    // TODO: Require pathObj to be Path?\n    let path = pathObj instanceof Path ? pathObj : new Path(pathObj);\n    let child = this as any,\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.<T>)} action Action to be called for each child.\n   */\n  forEachChild(action: (tree: Tree<T>) => void) {\n    forEach(this.node_.children, (child: string, childTree: TreeNode<T>) => {\n      action(new Tree<T>(child, this, childTree));\n    });\n  }\n\n  /**\n   * Does a depth-first traversal of this node's descendants, calling action for each one.\n   *\n   * @param {function(!Tree.<T>)} action Action to be called for each child.\n   * @param {boolean=} includeSelf Whether to call action on this node as well. Defaults to\n   *   false.\n   * @param {boolean=} childrenFirst Whether to call action on children before calling it on\n   *   parent.\n   */\n  forEachDescendant(\n    action: (tree: Tree<T>) => void,\n    includeSelf?: boolean,\n    childrenFirst?: boolean\n  ) {\n    if (includeSelf && !childrenFirst) 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.<T>)} action Action to be called on each parent; return\n   *   true to abort.\n   * @param {boolean=} includeSelf Whether to call action on this node as well.\n   * @return {boolean} true if the action callback returned true.\n   */\n  forEachAncestor(\n    action: (tree: Tree<T>) => unknown,\n    includeSelf?: boolean\n  ): boolean {\n    let node = includeSelf ? this : this.parent();\n    while (node !== null) {\n      if (action(node)) {\n        return true;\n      }\n      node = node.parent();\n    }\n    return false;\n  }\n\n  /**\n   * Does a depth-first traversal of this node's descendants.  When a descendant with a value\n   * is found, action is called on it and traversal does not continue inside the node.\n   * Action is *not* called on this node.\n   *\n   * @param {function(!Tree.<T>)} action Action to be called for each child.\n   */\n  forEachImmediateDescendantWithValue(action: (tree: Tree<T>) => void) {\n    this.forEachChild(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<T> | null {\n    return this.parent_;\n  }\n\n  /**\n   * Adds or removes this child from its parent based on whether it's empty or not.\n   *\n   * @private\n   */\n  private updateParents_() {\n    if (this.parent_ !== null) 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.<T>} child The child to update.\n   * @private\n   */\n  private updateChild_(childName: string, child: Tree<T>) {\n    const childEmpty = child.isEmpty();\n    const childExists = contains(this.node_.children, childName);\n    if (childEmpty && childExists) {\n      delete this.node_.children[childName];\n      this.node_.childCount--;\n      this.updateParents_();\n    } else if (!childEmpty && !childExists) {\n      this.node_.children[childName] = child.node_;\n      this.node_.childCount++;\n      this.updateParents_();\n    }\n  }\n}\n","/**\n * @license\n * Copyright 2017 Google 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.<Array.<!Transaction>>}\n   * @private\n   */\n  this.transactionQueueTree_ = new Tree<Transaction[]>();\n};\n\ndeclare module './Repo' {\n  interface Repo {\n    startTransaction(\n      path: Path,\n      transactionUpdate: (a: 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.<number>=} 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.<Array.<Transaction>>=} node  transactionQueueTree node to start at.\n * @private\n */\n(Repo.prototype as any).sendReadyTransactions_ = function(\n  node: Tree<Transaction[]> = this.transactionQueueTree_\n) {\n  // Before recursing, make sure any completed transactions are removed.\n  if (!node) {\n    this.pruneCompletedTransactionsBelowNode_(node);\n  }\n\n  if (node.getValue() !== null) {\n    const queue = this.buildTransactionQueue_(node);\n    assert(queue.length > 0, 'Sending zero length transaction queue');\n\n    const allRun = queue.every(\n      (transaction: Transaction) => transaction.status === TransactionStatus.RUN\n    );\n\n    // If they're all run (and not sent), we can send them.  Else, we must wait.\n    if (allRun) {\n      this.sendTransactionQueue_(node.path(), queue);\n    }\n  } else if (node.hasChildren()) {\n    node.forEachChild(childNode => {\n      this.sendReadyTransactions_(childNode);\n    });\n  }\n};\n\n/**\n * Given a list of run transactions, send them to the server and then handle the result (success or failure).\n *\n * @param {!Path} path The location of the queue.\n * @param {!Array.<Transaction>} queue Queue of transactions under the specified location.\n * @private\n */\n(Repo.prototype as any).sendTransactionQueue_ = function(\n  path: Path,\n  queue: Array<Transaction>\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.<Transaction>} 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<Transaction>,\n  path: Path\n) {\n  if (queue.length === 0) {\n    return; // Nothing to do!\n  }\n\n  // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n  // the callback could trigger more transactions or sets.\n  const callbacks = [];\n  let events: Event[] = [];\n  // Ignore all of the sets we're going to re-run.\n  const txnsToRerun = queue.filter(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.<Array.<!Transaction>>} The rootmost node with a transaction.\n * @private\n */\n(Repo.prototype as any).getAncestorTransactionNode_ = function(\n  path: Path\n): Tree<Transaction[]> {\n  let front;\n\n  // Start at the root and walk deeper into the tree towards path until we find a node with pending transactions.\n  let transactionNode = this.transactionQueueTree_;\n  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.<Array.<Transaction>>} transactionNode\n * @return {Array.<Transaction>} The generated queue.\n * @private\n */\n(Repo.prototype as any).buildTransactionQueue_ = function(\n  transactionNode: Tree<Transaction[]>\n): Array<Transaction> {\n  // Walk any child transaction queues and aggregate them into a single queue.\n  const transactionQueue: Transaction[] = [];\n  this.aggregateTransactionQueuesForNode_(transactionNode, transactionQueue);\n\n  // Sort them by the order the transactions were created.\n  transactionQueue.sort(function(a, b) {\n    return a.order - b.order;\n  });\n\n  return transactionQueue;\n};\n\n/**\n * @param {!Tree.<Array.<Transaction>>} node\n * @param {Array.<Transaction>} queue\n * @private\n */\n(Repo.prototype as any).aggregateTransactionQueuesForNode_ = function(\n  node: Tree<Transaction[]>,\n  queue: Array<Transaction>\n) {\n  const nodeQueue = node.getValue();\n  if (nodeQueue !== null) {\n    for (let i = 0; i < nodeQueue.length; i++) {\n      queue.push(nodeQueue[i]);\n    }\n  }\n\n  node.forEachChild(child => {\n    this.aggregateTransactionQueuesForNode_(child, queue);\n  });\n};\n\n/**\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\n *\n * @param {!Tree.<Array.<!Transaction>>} node\n * @private\n */\n(Repo.prototype as any).pruneCompletedTransactionsBelowNode_ = function(\n  node: Tree<Transaction[]>\n) {\n  const queue = node.getValue();\n  if (queue) {\n    let to = 0;\n    for (let from = 0; from < queue.length; from++) {\n      if (queue[from].status !== TransactionStatus.COMPLETED) {\n        queue[to] = queue[from];\n        to++;\n      }\n    }\n    queue.length = to;\n    node.setValue(queue.length > 0 ? queue : null);\n  }\n\n  node.forEachChild(childNode => {\n    this.pruneCompletedTransactionsBelowNode_(childNode);\n  });\n};\n\n/**\n * Aborts all transactions on ancestors or descendants of the specified path.  Called when doing a set() or update()\n * since we consider them incompatible with transactions.\n *\n * @param {!Path} path Path for which we want to abort related transactions.\n * @return {!Path}\n * @private\n */\n(Repo.prototype as any).abortTransactions_ = function(path: Path): Path {\n  const affectedPath = this.getAncestorTransactionNode_(path).path();\n\n  const transactionNode = this.transactionQueueTree_.subTree(path);\n\n  transactionNode.forEachAncestor((node: Tree<Transaction[]>) => {\n    this.abortTransactionsOnNode_(node);\n  });\n\n  this.abortTransactionsOnNode_(transactionNode);\n\n  transactionNode.forEachDescendant((node: Tree<Transaction[]>) => {\n    this.abortTransactionsOnNode_(node);\n  });\n\n  return affectedPath;\n};\n\n/**\n * Abort transactions stored in this transaction queue node.\n *\n * @param {!Tree.<Array.<Transaction>>} node Node to abort transactions for.\n * @private\n */\n(Repo.prototype as any).abortTransactionsOnNode_ = function(\n  node: Tree<Transaction[]>\n) {\n  const queue = node.getValue();\n  if (queue !== null) {\n    // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\n    // the callback could trigger more transactions or sets.\n    const callbacks = [];\n\n    // Go through queue.  Any already-sent transactions must be marked for abort, while the unsent ones\n    // can be immediately aborted and removed.\n    let events: Event[] = [];\n    let lastSent = -1;\n    for (let i = 0; i < queue.length; i++) {\n      if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\n        // Already marked.  No action needed.\n      } else if (queue[i].status === TransactionStatus.SENT) {\n        assert(\n          lastSent === i - 1,\n          'All SENT items should be at beginning of queue.'\n        );\n        lastSent = i;\n        // Mark transaction for abort when it comes back.\n        queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\n        queue[i].abortReason = 'set';\n      } else {\n        assert(\n          queue[i].status === TransactionStatus.RUN,\n          'Unexpected transaction status in abort'\n        );\n        // We can abort it immediately.\n        queue[i].unwatcher();\n        events = events.concat(\n          this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId, true)\n        );\n        if (queue[i].onComplete) {\n          const snapshot: DataSnapshot | null = null;\n          callbacks.push(\n            queue[i].onComplete.bind(null, new Error('set'), false, snapshot)\n          );\n        }\n      }\n    }\n    if (lastSent === -1) {\n      // We're not waiting for any sent transactions.  We can clear the queue.\n      node.setValue(null);\n    } else {\n      // Remove the transactions we aborted.\n      queue.length = lastSent + 1;\n    }\n\n    // Now fire the callbacks.\n    this.eventQueue_.raiseEventsForChangedPath(node.path(), events);\n    for (let i = 0; i < callbacks.length; i++) {\n      exceptionGuard(callbacks[i]);\n    }\n  }\n};\n","/**\n * @license\n * Copyright 2017 Google 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.<string, Object<string, !fb.core.Repo>>}\n   */\n  private repos_: {\n    [appName: string]: {\n      [dbUrl: string]: Repo;\n    };\n  } = {};\n\n  /**\n   * If true, new Repos will be created to use ReadonlyRestClient (for testing purposes).\n   * @private {boolean}\n   */\n  private useRestClient_: boolean = false;\n\n  static getInstance(): RepoManager {\n    if (!_staticInstance) {\n      _staticInstance = new RepoManager();\n    }\n    return _staticInstance;\n  }\n\n  // TODO(koss): Remove these functions unless used in tests?\n  interrupt() {\n    for (const appName 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<void>} */\n  async delete(): Promise<void> {\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 * @param {!Query} firebaseRef\n * @return {!Object}\n */\nexport const listens = function(firebaseRef: Query) {\n  return (firebaseRef.repo.persistentConnection_ as any).listens_;\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 { FirebaseApp, 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';\n\nconst ServerValue = Database.ServerValue;\n\nexport function registerDatabase(instance: FirebaseNamespace) {\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","__generator","thisArg","body","f","y","t","g","_","label","sent","trys","ops","next","verb","throw","return","Symbol","iterator","n","v","op","TypeError","call","done","value","pop","length","push","e","step","CONSTANTS","assert","assertion","message","assertionError","Error","stringToByteArray","str","out","i","c","charCodeAt","base64","byteToCharMap_","charToByteMap_","byteToCharMapWebSafe_","charToByteMapWebSafe_","ENCODED_VALS_BASE","ENCODED_VALS","ENCODED_VALS_WEBSAFE","HAS_NATIVE_SUPPORT","atob","encodeByteArray","input","opt_webSafe","isArray","init_","byteToCharMap","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","join","encodeString","btoa","decodeString","bytes","pos","c1","String","fromCharCode","c2","u","c3","byteArrayToString","decodeStringToByteArray","charToByteMap","charAt","byte4","base64Decode","console","error","deepCopy","deepExtend","target","source","Date","dateValue","getTime","undefined","prop","promise","Promise","resolve","reject","_this","Deferred","callback","catch","isMobileCordova","window","test","navigator","isNodeSdk","ERROR_NAME","captureStackTrace","code","ErrorFactory","apply","arguments","err","name","defineProperty","get","stack","FirebaseError","service","serviceName","errors","data","template","fullCode","replace","pattern","match","key","toString","slice","jsonEval","JSON","parse","stringify","decode","token","header","claims","signature","parts","split","contains","obj","safeGet","forEach","fn","clone","objTo","isEmpty","getCount","rv","map","opt_obj","res","findKey","opt_this","getAnyKey","blockSize","pad_","reset","Sha1","chain_","inbuf_","total_","buf","opt_offset","W","W_","k","a","opt_length","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","_i","args","logLevel","now","toISOString","DEBUG","VERBOSE","log","info","WARN","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","logWrapper","prefix","fatal","isInvalidJSONNumber","Number","POSITIVE_INFINITY","NEGATIVE_INFINITY","MIN_NAME","MAX_NAME","nameCompare","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","ObjectToUniqueKey","keys","sort","splitStringBySize","segsize","len","dataSegs","substring","each","doubleToIEEE754String","s","ln","bits","Infinity","Math","abs","pow","min","floor","LN2","round","reverse","hexByteString","hexByte","parseInt","substr","toLowerCase","INTEGER_REGEXP_","RegExp","intVal","exceptionGuard","setTimeout","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","_a","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","tslib_1.__extends","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","_super","MaxNode","defineProperties","MAX","USE_HINZE","json","node_1","jsonObj_1","childData","children_1","childrenHavePriority_1","hinzeJsonObj_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","otherCount","every","cb","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","cancelOrContext","firstCall","onceCallback","off","on","limit","limitToFirst","limitToLast","validateNoPreviousOrderByCall_","parsedPath","newParams","orderBy","validateQueryEndpoints_","startAt","validateLimit_","endAt","toUrlEncodedString","getQueryObject","queryObject","sameRepo","samePath","sameQueryIdentifier","queryIdentifier","CountedSet","item","SparseSnapshotTree","childKey","find","add","remember","self_1","tree","forget","prefixPath","func","forEachTree","resolveDeferredValue","serverValues","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","emptyChildrenSingleton","fromUser","fromServer","queryId","tagged","OperationSource","affectedTree","revert","ACK_USER_WRITE","User","AckUserWrite","children","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","getValues","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","concat","applyOperation","assertIndexed","generateEventsForChanges_","initialChanges","generateEventsForChanges","SyncPoint","views_","optCompleteServerCache","view","events_1","serverCacheComplete","eventCacheComplete","addEventRegistration","getInitialEvents","removed","hadCompleteView","hasCompleteView","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_","r","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","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","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","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","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","m","handleIncomingFrame","isOldAndroid","userAgent","oldAndroidMatch","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_1","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_","firebase","SDK_VERSION","currentlyOnline","ReadonlyRestClient","listenId","getListenId_","thisListen","queryStringParameters","toRestQueryStringParameters","restRequest_","authTokenData","authToken","arrayVal","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","offset","values","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","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","from","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","firebaseRef","ServerValue","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,GAgD5E,SAASK,EAAYC,EAASC,GACjC,IAAsGC,EAAGC,EAAGC,EAAGC,EAA3GC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPJ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,IAAOK,KAAM,GAAIC,IAAK,IAChG,OAAOL,EAAI,CAAEM,KAAMC,EAAK,GAAIC,MAASD,EAAK,GAAIE,OAAUF,EAAK,IAAwB,mBAAXG,SAA0BV,EAAEU,OAAOC,UAAY,WAAa,OAAOrB,OAAUU,EACvJ,SAASO,EAAKK,GAAK,OAAO,SAAUC,GAAK,OACzC,SAAcC,GACV,GAAIjB,EAAG,MAAM,IAAIkB,UAAU,mCAC3B,KAAOd,GAAG,IACN,GAAIJ,EAAI,EAAGC,IAAMC,EAAY,EAARe,EAAG,GAAShB,EAAU,OAAIgB,EAAG,GAAKhB,EAAS,SAAOC,EAAID,EAAU,SAAMC,EAAEiB,KAAKlB,GAAI,GAAKA,EAAEQ,SAAWP,EAAIA,EAAEiB,KAAKlB,EAAGgB,EAAG,KAAKG,KAAM,OAAOlB,EAE3J,OADID,EAAI,EAAGC,IAAGe,EAAK,CAAS,EAARA,EAAG,GAAQf,EAAEmB,QACzBJ,EAAG,IACP,KAAK,EAAG,KAAK,EAAGf,EAAIe,EAAI,MACxB,KAAK,EAAc,OAAXb,EAAEC,QAAgB,CAAEgB,MAAOJ,EAAG,GAAIG,MAAM,GAChD,KAAK,EAAGhB,EAAEC,QAASJ,EAAIgB,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKb,EAAEI,IAAIc,MAAOlB,EAAEG,KAAKe,MAAO,SACxC,QACI,KAAkBpB,EAAe,GAA3BA,EAAIE,EAAEG,MAAYgB,QAAcrB,EAAEA,EAAEqB,OAAS,MAAkB,IAAVN,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEb,EAAI,EAAG,SACjG,GAAc,IAAVa,EAAG,MAAcf,GAAMe,EAAG,GAAKf,EAAE,IAAMe,EAAG,GAAKf,EAAE,IAAM,CAAEE,EAAEC,MAAQY,EAAG,GAAI,MAC9E,GAAc,IAAVA,EAAG,IAAYb,EAAEC,MAAQH,EAAE,GAAI,CAAEE,EAAEC,MAAQH,EAAE,GAAIA,EAAIe,EAAI,MAC7D,GAAIf,GAAKE,EAAEC,MAAQH,EAAE,GAAI,CAAEE,EAAEC,MAAQH,EAAE,GAAIE,EAAEI,IAAIgB,KAAKP,GAAK,MACvDf,EAAE,IAAIE,EAAEI,IAAIc,MAChBlB,EAAEG,KAAKe,MAAO,SAEtBL,EAAKlB,EAAKoB,KAAKrB,EAASM,GAC1B,MAAOqB,GAAKR,EAAK,CAAC,EAAGQ,GAAIxB,EAAI,UAAeD,EAAIE,EAAI,EACtD,GAAY,EAARe,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEI,MAAOJ,EAAG,GAAKA,EAAG,QAAK,EAAQG,MAAM,GArB9BM,CAAK,CAACX,EAAGC,MCxD7D,IAAaW,GAQC,EARDA,EAaE,oBCVFC,EAAS,SAASC,EAAWC,GACxC,IAAKD,EACH,MAAME,EAAeD,IASZC,EAAiB,SAASD,GACrC,OAAO,IAAIE,MACT,sBACEL,EACA,6BACAG,ICvBAG,EAAoB,SAASC,GAIjC,IAFA,IAAIC,EAAM,GACR9C,EAAI,EACG+C,EAAI,EAAGA,EAAIF,EAAIX,OAAQa,IAAK,CACnC,IAAIC,EAAIH,EAAII,WAAWF,GAErBD,EAAI9C,KADFgD,EAAI,IACKA,GAEXF,EAAI9C,KADKgD,EAAI,KACDA,GAAK,EAAK,KAGN,QAAX,MAAJA,IACDD,EAAI,EAAIF,EAAIX,QACwB,QAAX,MAAxBW,EAAII,WAAWF,EAAI,KAGpBC,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBH,EAAII,aAAaF,IACvDD,EAAI9C,KAAQgD,GAAK,GAAM,IACvBF,EAAI9C,KAASgD,GAAK,GAAM,GAAM,KAI9BF,EAAI9C,KAAQgD,GAAK,GAAM,IAHVA,GAAK,EAAK,GAAM,KAVb,GAAJA,EAAU,KAkB1B,OAAOF,GA2CII,EAAS,CAMpBC,eAAgB,KAOhBC,eAAgB,KAOhBC,sBAAuB,KAOvBC,sBAAuB,KAOvBC,kBACE,iEAMFC,mBACE,OAAOpD,KAAKmD,kBAAoB,OAOlCE,2BACE,OAAOrD,KAAKmD,kBAAoB,OAWlCG,mBAAoC,mBAATC,KAW3BC,yBAAgBC,EAAOC,GACrB,IAAK/D,MAAMgE,QAAQF,GACjB,MAAMlB,MAAM,iDAGdvC,KAAK4D,QAQL,IANA,IAAIC,EAAgBH,EAChB1D,KAAKiD,sBACLjD,KAAK+C,eAELe,EAAS,GAEJnB,EAAI,EAAGA,EAAIc,EAAM3B,OAAQa,GAAK,EAAG,CACxC,IAAIoB,EAAQN,EAAMd,GACdqB,EAAYrB,EAAI,EAAIc,EAAM3B,OAC1BmC,EAAQD,EAAYP,EAAMd,EAAI,GAAK,EACnCuB,EAAYvB,EAAI,EAAIc,EAAM3B,OAC1BqC,EAAQD,EAAYT,EAAMd,EAAI,GAAK,EAEnCyB,EAAWL,GAAS,EACpBM,GAAqB,EAARN,IAAiB,EAAME,GAAS,EAC7CK,GAAqB,GAARL,IAAiB,EAAME,GAAS,EAC7CI,EAAmB,GAARJ,EAEVD,IACHK,EAAW,GAENP,IACHM,EAAW,KAIfR,EAAO/B,KACL8B,EAAcO,GACdP,EAAcQ,GACdR,EAAcS,GACdT,EAAcU,IAIlB,OAAOT,EAAOU,KAAK,KAWrBC,sBAAahB,EAAOC,GAGlB,OAAI1D,KAAKsD,qBAAuBI,EACvBgB,KAAKjB,GAEPzD,KAAKwD,gBAAgBhB,EAAkBiB,GAAQC,IAWxDiB,sBAAalB,EAAOC,GAGlB,OAAI1D,KAAKsD,qBAAuBI,EACvBH,KAAKE,GAnLQ,SAASmB,GAKjC,IAHA,IAAIlC,EAAM,GACRmC,EAAM,EACNjC,EAAI,EACCiC,EAAMD,EAAM9C,QAAQ,CACzB,IAAIgD,EAAKF,EAAMC,KACf,GAAIC,EAAK,IACPpC,EAAIE,KAAOmC,OAAOC,aAAaF,QAC1B,GAAS,IAALA,GAAYA,EAAK,IAAK,CAC/B,IAAIG,EAAKL,EAAMC,KACfnC,EAAIE,KAAOmC,OAAOC,cAAoB,GAALF,IAAY,EAAW,GAALG,QAC9C,GAAS,IAALH,GAAYA,EAAK,IAAK,CAE/B,IAGII,IACM,EAALJ,IAAW,IAAa,IAJzBG,EAAKL,EAAMC,QAIqB,IAAa,IAH7CM,EAAKP,EAAMC,QAGyC,EAAW,GAF1DD,EAAMC,MAGb,MACFnC,EAAIE,KAAOmC,OAAOC,aAAa,OAAUE,GAAK,KAC9CxC,EAAIE,KAAOmC,OAAOC,aAAa,OAAc,KAAJE,QACpC,CACDD,EAAKL,EAAMC,KAAf,IACIM,EAAKP,EAAMC,KACfnC,EAAIE,KAAOmC,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,IAI9C,OAAOzC,EAAI8B,KAAK,IAuJPY,CAAkBpF,KAAKqF,wBAAwB5B,EAAOC,KAkB/D2B,iCAAwB5B,EAAOC,GAC7B1D,KAAK4D,QAQL,IANA,IAAI0B,EAAgB5B,EAChB1D,KAAKkD,sBACLlD,KAAKgD,eAELc,EAAS,GAEJnB,EAAI,EAAGA,EAAIc,EAAM3B,QAAU,CAClC,IAAIiC,EAAQuB,EAAc7B,EAAM8B,OAAO5C,MAGnCsB,EADYtB,EAAIc,EAAM3B,OACFwD,EAAc7B,EAAM8B,OAAO5C,IAAM,EAIrDwB,IAHFxB,EAEkBc,EAAM3B,OACFwD,EAAc7B,EAAM8B,OAAO5C,IAAM,GAIrD6C,IAHF7C,EAEkBc,EAAM3B,OACFwD,EAAc7B,EAAM8B,OAAO5C,IAAM,GAGzD,KAFEA,EAEW,MAAToB,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATqB,EACrD,MAAMjD,QAGR,IAAI6B,EAAYL,GAAS,EAAME,GAAS,EAGxC,GAFAH,EAAO/B,KAAKqC,GAEC,IAATD,EAAa,CACf,IAAIE,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGjD,GAFAL,EAAO/B,KAAKsC,GAEC,IAATmB,EAAa,CACf,IAAIlB,EAAaH,GAAS,EAAK,IAAQqB,EACvC1B,EAAO/B,KAAKuC,KAKlB,OAAOR,GAQTF,iBACE,IAAK5D,KAAK+C,eAAgB,CACxB/C,KAAK+C,eAAiB,GACtB/C,KAAKgD,eAAiB,GACtBhD,KAAKiD,sBAAwB,GAC7BjD,KAAKkD,sBAAwB,GAG7B,IAAK,IAAIP,EAAI,EAAGA,EAAI3C,KAAKoD,aAAatB,OAAQa,IAC5C3C,KAAK+C,eAAeJ,GAAK3C,KAAKoD,aAAamC,OAAO5C,GAClD3C,KAAKgD,eAAehD,KAAK+C,eAAeJ,IAAMA,EAC9C3C,KAAKiD,sBAAsBN,GAAK3C,KAAKqD,qBAAqBkC,OAAO5C,IACjE3C,KAAKkD,sBAAsBlD,KAAKiD,sBAAsBN,IAAMA,IAGnD3C,KAAKmD,kBAAkBrB,SAC9B9B,KAAKgD,eAAehD,KAAKqD,qBAAqBkC,OAAO5C,IAAMA,EAC3D3C,KAAKkD,sBAAsBlD,KAAKoD,aAAamC,OAAO5C,IAAMA,MA0BvD8C,EAAe,SAAShD,GACnC,IACE,OAAOK,EAAO6B,aAAalC,GAAK,GAChC,MAAOT,GACP0D,QAAQC,MAAM,wBAAyB3D,GAEzC,OAAO,MC5UT,SAAgB4D,EAAYhE,GAC1B,OAeF,SAAgBiE,EAAWC,EAAaC,GACtC,KAAMA,aAAkBvG,QACtB,OAAOuG,EAGT,OAAQA,EAAO9F,aACb,KAAK+F,KAGH,IAAIC,EAAaF,EACjB,OAAO,IAAIC,KAAKC,EAAUC,WAE5B,KAAK1G,YACY2G,IAAXL,IACFA,EAAS,IAEX,MAEF,KAAKnG,MAEHmG,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,IAAIK,KAAQL,EACVA,EAAOlG,eAAeuG,KAG3BN,EAAOM,GAAQP,EAAWC,EAAOM,GAAOL,EAAOK,KAGjD,OAAON,EAlDAD,MAAWM,EAAWvE,GCJ/B,iBAIE,aAAA,WACE5B,KAAKqG,QAAU,IAAIC,QAAQ,SAACC,EAASC,GACnCC,EAAKF,QAAUA,EACfE,EAAKD,OAASA,IAiCpB,OAtBEE,yBAAA,SAAaC,GAAb,WACE,OAAO,SAAChB,EAAO/D,GACT+D,EACFc,EAAKD,OAAOb,GAEZc,EAAKF,QAAQ3E,GAES,mBAAb+E,IAGTF,EAAKJ,QAAQO,MAAM,cAIK,IAApBD,EAAS7E,OACX6E,EAAShB,GAETgB,EAAShB,EAAO/D,WCVbiF,EAAkB,WAC7B,MACoB,oBAAXC,WACJA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDC,KArB/B,oBAAdC,WAC2B,iBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,KAoCEC,EAAY,WACvB,OAAkE,IAA3D/E,GCTHgF,EAAa,gBAMfC,EAA2D5E,MAC5D4E,oBA2BD,SAAmBC,EAAqB/E,GAGtC,GAHiBrC,UAAAoH,EAAqBpH,aAAAqC,EAGlC8E,EAEFA,EAAkBnH,KAAMqH,EAAanH,UAAUC,aAE/C,IAGE,MAAMoC,MAAM+E,MAAMtH,KAAMuH,WACxB,MAAOC,GACPxH,KAAKyH,KAAOP,EAEZ1H,OAAOkI,eAAe1H,KAAM,QAAS,CACnC2H,IAAK,WACH,OAAOH,EAAII,WASvBC,EAAc3H,UAAYV,OAAOW,OAAOoC,MAAMrC,YAC9C2H,EAAc3H,UAAUD,YAAc4H,GACvB3H,UAAkBuH,KAAOP,EAExC,iBAIE,WACUY,EACAC,EACAC,GAFAhI,aAAA8H,EACA9H,iBAAA+H,EACA/H,YAAAgI,EALHhI,aAAU,gBA4CnB,OAlCEqH,mBAAA,SAAOD,EAASa,QACD9B,IAAT8B,IACFA,EAAO,IAGT,IAGI5F,EAHA6F,EAAWlI,KAAKgI,OAAOZ,GAEvBe,EAAWnI,KAAK8H,QAAU,IAAMV,EAIlC/E,OADe8D,IAAb+B,EACQ,QAEAA,EAASE,QAAQpI,KAAKqI,QAAS,SAACC,EAAOC,GAC/C,IAAI3G,EAAQqG,EAAMM,GAClB,YAAiBpC,IAAVvE,EAAsBA,EAAM4G,WAAa,IAAMD,EAAM,OAKhElG,EAAUrC,KAAK+H,YAAc,KAAO1F,EAAU,KAAO8F,EAAW,KAChE,IAAIX,EAAM,IAAIK,EAAcM,EAAU9F,GAItC,IAAK,IAAI+D,KAAQ6B,EACVA,EAAKpI,eAAeuG,IAA4B,MAAnBA,EAAKqC,OAAO,KAG7CjB,EAAYpB,GAAQ6B,EAAK7B,IAG5B,OAAOoB,QC9IX,SAAgBkB,EAASjG,GACvB,OAAOkG,KAAKC,MAAMnG,GAQpB,SAAgBoG,EAAUZ,GACxB,OAAOU,KAAKE,UAAUZ,GCHxB,IAAaa,EAAS,SAASC,GAC7B,IAAIC,EAAS,GACXC,EAAS,GACThB,EAAO,GACPiB,EAAY,GAEd,IACE,IAAIC,EAAQJ,EAAMK,MAAM,KACxBJ,EAASN,EAASjD,EAAa0D,EAAM,KAAO,IAC5CF,EAASP,EAASjD,EAAa0D,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBlB,EAAOgB,EAAU,GAAK,UACfA,EAAU,EACjB,MAAOjH,IAET,MAAO,CACLgH,OAAQA,EACRC,OAAQA,EACRhB,KAAMA,EACNiB,UAAWA,IC9BFG,EAAW,SAASC,EAAKf,GACpC,OAAO/I,OAAOU,UAAUL,eAAe6B,KAAK4H,EAAKf,IAGtCgB,EAAU,SAASD,EAAKf,GACnC,GAAI/I,OAAOU,UAAUL,eAAe6B,KAAK4H,EAAKf,GAAM,OAAOe,EAAIf,IAWpDiB,EAAU,SAASF,EAAKG,GACnC,IAAK,IAAIlB,KAAOe,EACV9J,OAAOU,UAAUL,eAAe6B,KAAK4H,EAAKf,IAC5CkB,EAAGlB,EAAKe,EAAIf,KAuBLmB,EAAQ,SAASJ,GAC5B,OAb6BK,EAaf,GAZdH,EAYkBF,EAZD,SAASf,EAAK3G,GAC7B+H,EAAMpB,GAAO3G,IAER+H,EAJa,IAASA,GA2BlBC,EAAU,SAASN,GAC9B,IAAK,IAAIf,KAAOe,EACd,OAAO,EAET,OAAO,GAGIO,EAAW,SAASP,GAC/B,IAAIQ,EAAK,EACT,IAAK,IAAIvB,KAAOe,EACdQ,IAEF,OAAOA,GAGIC,EAAM,SAAST,EAAK/I,EAAGyJ,GAClC,IAAIC,EAAM,GACV,IAAK,IAAI1B,KAAOe,EACdW,EAAI1B,GAAOhI,EAAEmB,KAAKsI,EAASV,EAAIf,GAAMA,EAAKe,GAE5C,OAAOW,GAGIC,EAAU,SAASZ,EAAKG,EAAIU,GACvC,IAAK,IAAI5B,KAAOe,EACd,GAAIG,EAAG/H,KAAKyI,EAAUb,EAAIf,GAAMA,EAAKe,GACnC,OAAOf,GAWA6B,EAAY,SAASd,GAChC,IAAK,IAAIf,KAAOe,EACd,OAAOf,gBC/BT,aApCQvI,YAAwB,GAOxBA,UAAsB,GAQtBA,QAAoB,GAOpBA,UAAsB,GAKtBA,YAAiB,EAKjBA,YAAiB,EAKvBA,KAAKqK,UAAY,GAEjBrK,KAAKsK,KAAK,GAAK,IACf,IAAK,IAAI3H,EAAI,EAAGA,EAAI3C,KAAKqK,YAAa1H,EACpC3C,KAAKsK,KAAK3H,GAAK,EAGjB3C,KAAKuK,QAiMT,OA9LEC,kBAAA,WACExK,KAAKyK,OAAO,GAAK,WACjBzK,KAAKyK,OAAO,GAAK,WACjBzK,KAAKyK,OAAO,GAAK,WACjBzK,KAAKyK,OAAO,GAAK,UACjBzK,KAAKyK,OAAO,GAAK,WAEjBzK,KAAK0K,OAAS,EACd1K,KAAK2K,OAAS,GAShBH,sBAAA,SAAUI,EAAKC,GACRA,IACHA,EAAa,GAGf,IAAIC,EAAI9K,KAAK+K,GAGb,GAAmB,iBAARH,EACT,IAAK,IAAIjI,EAAI,EAAGA,EAAI,GAAIA,IAStBmI,EAAEnI,GACCiI,EAAI/H,WAAWgI,IAAe,GAC9BD,EAAI/H,WAAWgI,EAAa,IAAM,GAClCD,EAAI/H,WAAWgI,EAAa,IAAM,EACnCD,EAAI/H,WAAWgI,EAAa,GAC9BA,GAAc,OAGhB,IAASlI,EAAI,EAAGA,EAAI,GAAIA,IACtBmI,EAAEnI,GACCiI,EAAIC,IAAe,GACnBD,EAAIC,EAAa,IAAM,GACvBD,EAAIC,EAAa,IAAM,EACxBD,EAAIC,EAAa,GACnBA,GAAc,EAKlB,IAASlI,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,IAAIlC,EAAIqK,EAAEnI,EAAI,GAAKmI,EAAEnI,EAAI,GAAKmI,EAAEnI,EAAI,IAAMmI,EAAEnI,EAAI,IAChDmI,EAAEnI,GAA+B,YAAxBlC,GAAK,EAAMA,IAAM,IAG5B,IAKIF,EAAGyK,EALHC,EAAIjL,KAAKyK,OAAO,GAChBlL,EAAIS,KAAKyK,OAAO,GAChB7H,EAAI5C,KAAKyK,OAAO,GAChBnL,EAAIU,KAAKyK,OAAO,GAChBzI,EAAIhC,KAAKyK,OAAO,GAIpB,IAAS9H,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAIvBqI,EAHArI,EAAI,GACFA,EAAI,IACNpC,EAAIjB,EAAKC,GAAKqD,EAAItD,GACd,aAEJiB,EAAIhB,EAAIqD,EAAItD,EACR,YAGFqD,EAAI,IACNpC,EAAKhB,EAAIqD,EAAMtD,GAAKC,EAAIqD,GACpB,aAEJrC,EAAIhB,EAAIqD,EAAItD,EACR,YAIJmB,GAAOwK,GAAK,EAAMA,IAAM,IAAO1K,EAAIyB,EAAIgJ,EAAIF,EAAEnI,GAAM,WACvDX,EAAI1C,EACJA,EAAIsD,EACJA,EAA8B,YAAxBrD,GAAK,GAAOA,IAAM,GACxBA,EAAI0L,EACJA,EAAIxK,EAGNT,KAAKyK,OAAO,GAAMzK,KAAKyK,OAAO,GAAKQ,EAAK,WACxCjL,KAAKyK,OAAO,GAAMzK,KAAKyK,OAAO,GAAKlL,EAAK,WACxCS,KAAKyK,OAAO,GAAMzK,KAAKyK,OAAO,GAAK7H,EAAK,WACxC5C,KAAKyK,OAAO,GAAMzK,KAAKyK,OAAO,GAAKnL,EAAK,WACxCU,KAAKyK,OAAO,GAAMzK,KAAKyK,OAAO,GAAKzI,EAAK,YAG1CwI,mBAAA,SAAO5F,EAAOsG,GAEZ,GAAa,MAATtG,EAAJ,MAImBuB,IAAf+E,IACFA,EAAatG,EAAM9C,QAUrB,IAPA,IAAIqJ,EAAmBD,EAAalL,KAAKqK,UACrC/I,EAAI,EAEJsJ,EAAM5K,KAAKoL,KACXC,EAAQrL,KAAK0K,OAGVpJ,EAAI4J,GAAY,CAKrB,GAAa,GAATG,EACF,KAAO/J,GAAK6J,GACVnL,KAAKsL,UAAU1G,EAAOtD,GACtBA,GAAKtB,KAAKqK,UAId,GAAqB,iBAAVzF,GACT,KAAOtD,EAAI4J,GAIT,GAHAN,EAAIS,GAASzG,EAAM/B,WAAWvB,KAE5BA,IADA+J,GAEWrL,KAAKqK,UAAW,CAC3BrK,KAAKsL,UAAUV,GACfS,EAAQ,EAER,YAIJ,KAAO/J,EAAI4J,GAIT,GAHAN,EAAIS,GAASzG,EAAMtD,KAEjBA,IADA+J,GAEWrL,KAAKqK,UAAW,CAC3BrK,KAAKsL,UAAUV,GACfS,EAAQ,EAER,OAMRrL,KAAK0K,OAASW,EACdrL,KAAK2K,QAAUO,IAIjBV,mBAAA,WACE,IAAIe,EAAS,GACTC,EAA0B,EAAdxL,KAAK2K,OAGjB3K,KAAK0K,OAAS,GAChB1K,KAAKyL,OAAOzL,KAAKsK,KAAM,GAAKtK,KAAK0K,QAEjC1K,KAAKyL,OAAOzL,KAAKsK,KAAMtK,KAAKqK,WAAarK,KAAK0K,OAAS,KAIzD,IAAK,IAAI/H,EAAI3C,KAAKqK,UAAY,EAAQ,IAAL1H,EAASA,IACxC3C,KAAKoL,KAAKzI,GAAiB,IAAZ6I,EACfA,GAAa,IAGfxL,KAAKsL,UAAUtL,KAAKoL,MAEpB,IAAI9J,EAAI,EACR,IAASqB,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAI+I,EAAI,GAAS,GAALA,EAAQA,GAAK,EAC5BH,EAAOjK,GAAMtB,KAAKyK,OAAO9H,IAAM+I,EAAK,MAClCpK,EAGN,OAAOiK,QCjQEI,EAAmB,SAASC,EAAQC,EAAUC,EAAUC,GACnE,IAAIC,EAMJ,GALID,EAAWF,EACbG,EAAW,YAAcH,EACLC,EAAXC,IACTC,EAAwB,IAAbF,EAAiB,OAAS,gBAAkBA,GAErDE,EASF,MAAM,IAAIzJ,MAPRqJ,EACA,4BACAG,GACc,IAAbA,EAAiB,aAAe,eACjC,YACAC,EACA,MAaN,SAAgBC,EAAYL,EAAQM,EAAgBC,GAClD,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,IAAI5J,MACR,mEAIN,IAAIoD,EAAQiG,EAAS,YAGrB,OADAjG,GAASyG,EAAU,aAqBrB,SAAgBC,EAAiBT,EAAQM,EAAgBvF,EAAUwF,GACjE,KAAIA,GAAaxF,IACO,mBAAbA,EACT,MAAM,IAAIpE,MACR0J,EAAYL,EAAQM,EAAgBC,GAClC,6BAIR,SAAgBG,EACdV,EACAM,EACAK,EACAJ,GAEA,KAAIA,GAAaI,KACM,iBAAZA,GAAoC,OAAZA,GACjC,MAAM,IAAIhK,MACR0J,EAAYL,EAAQM,EAAgBC,GAClC,mCCnFR,ICDYK,EAAAA,EDwCCC,EAAe,SAAShK,GAEnC,IADA,IAAI7C,EAAI,EACC+C,EAAI,EAAGA,EAAIF,EAAIX,OAAQa,IAAK,CACnC,IAAIC,EAAIH,EAAII,WAAWF,GACnBC,EAAI,IACNhD,IACSgD,EAAI,KACbhD,GAAK,EACS,OAALgD,GAAeA,GAAK,OAE7BhD,GAAK,EACL+C,KAEA/C,GAAK,EAGT,OAAOA,ICxDG4M,EAAAA,IAAAA,0BAEVA,yBACAA,mBACAA,mBACAA,qBACAA,uBAMF,ICNME,EDMAC,EAA4BH,EAASI,KAkBrCC,EAAgC,SAACC,EAAUC,OAAS,aAAAC,mBAAAA,IAAAC,oBACxD,KAAIF,EAAUD,EAASI,UAAvB,CACA,IAAMC,GAAM,IAAInH,MAAOoH,cACvB,OAAQL,GAON,KAAKP,EAASa,MAGd,KAAKb,EAASc,QACZ5H,QAAQ6H,UAAR7H,SAAY,IAAIyH,QAASL,EAASrF,iBAAYwF,IAC9C,MACF,KAAKT,EAASI,KACZlH,QAAQ8H,WAAR9H,SAAa,IAAIyH,QAASL,EAASrF,iBAAYwF,IAC/C,MACF,KAAKT,EAASiB,KACZ/H,QAAQgI,WAARhI,SAAa,IAAIyH,QAASL,EAASrF,iBAAYwF,IAC/C,MACF,KAAKT,EAASmB,MACZjI,QAAQC,YAARD,SAAc,IAAIyH,QAASL,EAASrF,iBAAYwF,IAChD,MACF,QACE,MAAM,IAAI1K,MACR,8DAA8DwK,uBAYpE,WAAmBtF,GAAAzH,UAAAyH,EAUXzH,eAAY2M,EAcZ3M,iBAA0B6M,EA8BpC,OA3CErN,sBAAIoO,4BAAJ,WACE,OAAO5N,KAAK6N,eAEd,SAAaC,GACX,KAAMA,KAAOtB,GACX,MAAM,IAAI/K,UAAU,wCAEtBzB,KAAK6N,UAAYC,mCAOnBtO,sBAAIoO,8BAAJ,WACE,OAAO5N,KAAK+N,iBAEd,SAAeD,GACb,GAAmB,mBAARA,EACT,MAAM,IAAIrM,UAAU,qDAEtBzB,KAAK+N,YAAcD,mCAOrBF,kBAAA,eAAM,aAAAZ,mBAAAA,IAAAC,kBACJjN,KAAK+N,kBAAL/N,MAAiBA,KAAMwM,EAASa,cAAUJ,KAE5CW,gBAAA,eAAI,aAAAZ,mBAAAA,IAAAC,kBACFjN,KAAK+N,kBAAL/N,MAAiBA,KAAMwM,EAASc,gBAAYL,KAE9CW,iBAAA,eAAK,aAAAZ,mBAAAA,IAAAC,kBACHjN,KAAK+N,kBAAL/N,MAAiBA,KAAMwM,EAASI,aAASK,KAE3CW,iBAAA,eAAK,aAAAZ,mBAAAA,IAAAC,kBACHjN,KAAK+N,kBAAL/N,MAAiBA,KAAMwM,EAASiB,aAASR,KAE3CW,kBAAA,eAAM,aAAAZ,mBAAAA,IAAAC,kBACJjN,KAAK+N,kBAAL/N,MAAiBA,KAAMwM,EAASmB,cAAUV,uBEtH5C,WAAoBe,GAAAhO,iBAAAgO,EALZhO,aAAU,YAoDpB,OAzCEiO,gBAAA,SAAI1F,EAAa3G,GACF,MAATA,EACF5B,KAAKgO,YAAYE,WAAWlO,KAAKmO,cAAc5F,IAE/CvI,KAAKgO,YAAYI,QAAQpO,KAAKmO,cAAc5F,GAAMM,EAAUjH,KAQhEqM,gBAAA,SAAI1F,GACF,IAAM8F,EAAYrO,KAAKgO,YAAYM,QAAQtO,KAAKmO,cAAc5F,IAC9D,OAAiB,MAAb8F,EACK,KAEA3F,EAAS2F,IAOpBJ,mBAAA,SAAO1F,GACLvI,KAAKgO,YAAYE,WAAWlO,KAAKmO,cAAc5F,KASjD0F,0BAAA,SAAcxG,GACZ,OAAOzH,KAAKuO,QAAU9G,GAGxBwG,qBAAA,WACE,OAAOjO,KAAKgO,YAAYxF,8BCxD5B,aACUxI,YAA+B,GAqBvCA,wBAAoB,EACtB,OApBEwO,gBAAA,SAAIjG,EAAa3G,GACF,MAATA,SACK5B,KAAKyO,OAAOlG,GAEnBvI,KAAKyO,OAAOlG,GAAO3G,GAIvB4M,gBAAA,SAAIjG,GACF,OAAIc,EAASrJ,KAAKyO,OAAQlG,GACjBvI,KAAKyO,OAAOlG,GAEd,MAGTiG,mBAAA,SAAOjG,UACEvI,KAAKyO,OAAOlG,SCbjBmG,EAAmB,SACvBC,GAEA,IAGE,GACoB,oBAAX7H,aAC2B,IAA3BA,OAAO6H,GACd,CAEA,IAAMC,EAAa9H,OAAO6H,GAG1B,OAFAC,EAAWR,QAAQ,oBAAqB,SACxCQ,EAAWV,WAAW,qBACf,IAAID,EAAkBW,IAE/B,MAAO5M,IAIT,OAAO,IAAIwM,GAIAK,EAAoBH,EAAiB,gBAGrCI,EAAiBJ,EAAiB,kBH1BzCK,EAAY,IAAInB,EAAO,sBAMhBoB,GACPtC,EAAK,EACF,WACL,OAAOA,MASEuC,EAAO,SAASxM,GAC3B,IAAMyM,EFjByB,SAASzM,GAGxC,IAFA,IAAIC,EAAM,GACR9C,EAAI,EACG+C,EAAI,EAAGA,EAAIF,EAAIX,OAAQa,IAAK,CACnC,IAAIC,EAAIH,EAAII,WAAWF,GAGvB,GAAS,OAALC,GAAeA,GAAK,MAAQ,CAC9B,IAAIuM,EAAOvM,EAAI,MAEfT,IADAQ,EACWF,EAAIX,OAAQ,2CAEvBc,EAAI,OAAWuM,GAAQ,KADb1M,EAAII,WAAWF,GAAK,OAK9BD,EAAI9C,KADFgD,EAAI,IACKA,GAEXF,EAAI9C,KADKgD,EAAI,KACDA,GAAK,EAAK,KAGtBF,EAAI9C,KADKgD,EAAI,MACDA,GAAK,GAAM,KAIvBF,EAAI9C,KAAQgD,GAAK,GAAM,IACVA,GAAK,GAAM,GAAM,KAJjBA,GAAK,EAAK,GAAM,KAHb,GAAJA,EAAU,KAY1B,OAAOF,EEdWF,CAAkBC,GAC9BwM,EAAO,IAAIzE,EACjByE,EAAKxD,OAAOyD,GACZ,IAAME,EAAYH,EAAK1D,SACvB,OAAOzI,EAAOU,gBAAgB4L,IAQ1BC,EAAmB,eAAS,aAAArC,mBAAAA,IAAAsC,kBAEhC,IADA,IAAIjN,EAAU,GACLM,EAAI,EAAGA,EAAI2M,EAASxN,OAAQa,IAEjChD,MAAMgE,QAAQ2L,EAAS3M,KACtB2M,EAAS3M,IACe,iBAAhB2M,EAAS3M,IACc,iBAAvB2M,EAAS3M,GAAGb,OAErBO,GAAWgN,EAAiB/H,MAAM,KAAMgI,EAAS3M,IACjB,iBAAhB2M,EAAS3M,GACzBN,GAAWwG,EAAUyG,EAAS3M,IAE9BN,GAAWiN,EAAS3M,GAEtBN,GAAW,IAGb,OAAOA,GAOEkN,EAAuC,KAO9CC,GAAY,EAOHC,EAAgB,SAC3BC,EACAC,GAEAxN,GACGwN,IAA2B,IAAZD,IAAgC,IAAZA,EACpC,+CAEc,IAAZA,GACFX,EAAU7B,SAAWV,EAASc,QAC9BiC,EAASR,EAAUxB,IAAIqC,KAAKb,GACxBY,GAAYb,EAAee,IAAI,mBAAmB,IAC1B,mBAAZH,EAChBH,EAASG,GAETH,EAAS,KACTT,EAAegB,OAAO,qBAQbvC,GAAM,eAAS,aAAAP,mBAAAA,IAAAsC,kBAO1B,IANkB,IAAdE,IACFA,GAAY,EACG,OAAXD,IAA6D,IAA1CT,EAAenH,IAAI,oBACxC8H,GAAc,IAGdF,EAAQ,CACV,IAAMlN,EAAUgN,EAAiB/H,MAAM,KAAMgI,GAC7CC,EAAOlN,KAQE0N,GAAa,SACxBC,GAEA,OAAO,eAAS,aAAAhD,mBAAAA,IAAAsC,kBACd/B,iBAAIyC,UAAWV,MAON3J,GAAQ,eAAS,aAAAqH,mBAAAA,IAAAsC,kBAC5B,IAAMjN,EAAU,4BAA8BgN,eAAoBC,GAClEP,EAAUpJ,MAAMtD,IAML4N,GAAQ,eAAS,aAAAjD,mBAAAA,IAAAsC,kBAC5B,IAAMjN,EAAU,yBAAyBgN,eAAoBC,GAE7D,MADAP,EAAUpJ,MAAMtD,GACV,IAAIE,MAAMF,IAMLqL,GAAO,eAAS,aAAAV,mBAAAA,IAAAsC,kBAC3B,IAAMjN,EAAU,qBAAuBgN,eAAoBC,GAC3DP,EAAUrB,KAAKrL,IAsCJ6N,GAAsB,SAASjI,GAC1C,MACkB,iBAATA,IACNA,GAAQA,GACPA,GAAQkI,OAAOC,mBACfnI,GAAQkI,OAAOE,oBAkDRC,GAAW,aAMXC,GAAW,aAQXC,GAAc,SAASvF,EAAW1L,GAC7C,GAAI0L,IAAM1L,EACR,OAAO,EACF,GAAI0L,IAAMqF,IAAY/Q,IAAMgR,GACjC,OAAQ,EACH,GAAIhR,IAAM+Q,IAAYrF,IAAMsF,GACjC,OAAO,EAEP,IAAME,EAASC,GAAYzF,GACzB0F,EAASD,GAAYnR,GAEvB,OAAe,OAAXkR,EACa,OAAXE,EACKF,EAASE,GAAU,EAAI1F,EAAEnJ,OAASvC,EAAEuC,OAAS2O,EAASE,GAErD,EAEU,OAAXA,EACF,EAEA1F,EAAI1L,GAAK,EAAI,GAUbqR,GAAgB,SAAS3F,EAAW1L,GAC/C,OAAI0L,IAAM1L,EACD,EACE0L,EAAI1L,GACL,EAED,GASEsR,GAAa,SACxBtI,EACAe,GAEA,GAAIA,GAAOf,KAAOe,EAChB,OAAOA,EAAIf,GAEX,MAAM,IAAIhG,MACR,yBAA2BgG,EAAM,gBAAkBM,EAAUS,KAStDwH,GAAoB,SAASxH,GACxC,GAAmB,iBAARA,GAA4B,OAARA,EAAc,OAAOT,EAAUS,GAE9D,IAAMyH,EAAO,GACb,IAAK,IAAI/F,KAAK1B,EACZyH,EAAKhP,KAAKiJ,GAIZ+F,EAAKC,OAEL,IADA,IAAIzI,EAAM,IACD5F,EAAI,EAAGA,EAAIoO,EAAKjP,OAAQa,IACrB,IAANA,IAAS4F,GAAO,KACpBA,GAAOM,EAAUkI,EAAKpO,IACtB4F,GAAO,IACPA,GAAOuI,GAAkBxH,EAAIyH,EAAKpO,KAIpC,OADA4F,GAAO,KAUI0I,GAAoB,SAC/BxO,EACAyO,GAEA,IAAMC,EAAM1O,EAAIX,OAEhB,GAAIqP,GAAOD,EACT,MAAO,CAACzO,GAIV,IADA,IAAM2O,EAAW,GACRxO,EAAI,EAAGA,EAAIuO,EAAKvO,GAAKsO,EACVC,EAAdvO,EAAIsO,EACNE,EAASrP,KAAKU,EAAI4O,UAAUzO,EAAGuO,IAE/BC,EAASrP,KAAKU,EAAI4O,UAAUzO,EAAGA,EAAIsO,IAGvC,OAAOE,GASIE,GAAO,SAClBhI,EACAG,GAEA,GAAI9J,MAAMgE,QAAQ2F,GAChB,IAAK,IAAI3G,EAAI,EAAGA,EAAI2G,EAAIxH,SAAUa,EAChC8G,EAAG9G,EAAG2G,EAAI3G,SASZ6G,EAAQF,EAAK,SAACf,EAAUuF,GAAa,OAAArE,EAAGqE,EAAKvF,MAwBpCgJ,GAAwB,SAAShQ,GAC5CY,GAAQ+N,GAAoB3O,GAAI,uBAEhC,IAGEiQ,EACAxP,EACAzB,EACAkR,EACA9O,EACA+O,EACAjP,EA0BF,IAtBU,IAANlB,EAGFiQ,EAAI,EAAIjQ,IAAOoQ,GADfpR,EADAyB,EAAI,GAEsB,EAAI,GAE9BwP,EAAIjQ,EAAI,EAONhB,GANFgB,EAAIqQ,KAAKC,IAAItQ,KAEJqQ,KAAKE,IAAI,GAAG,OAGnB9P,GADAyP,EAAKG,KAAKG,IAAIH,KAAKI,MAAMJ,KAAKrE,IAAIhM,GAAKqQ,KAAKK,KArBrC,OAAA,KAuBHL,KAAKM,MAAM3Q,EAAIqQ,KAAKE,IAAI,EAxBtB,GAwBiCL,GAAMG,KAAKE,IAAI,EAxBhD,OA2BN9P,EAAI,EACA4P,KAAKM,MAAM3Q,EAAIqQ,KAAKE,IAAI,GAAG,SAKnCJ,EAAO,GACF/O,EAlCK,GAkCMA,EAAGA,GAAK,EACtB+O,EAAK3P,KAAKxB,EAAI,EAAI,EAAI,GACtBA,EAAIqR,KAAKI,MAAMzR,EAAI,GAErB,IAAKoC,EAvCS,GAuCEA,EAAGA,GAAK,EACtB+O,EAAK3P,KAAKC,EAAI,EAAI,EAAI,GACtBA,EAAI4P,KAAKI,MAAMhQ,EAAI,GAErB0P,EAAK3P,KAAKyP,EAAI,EAAI,GAClBE,EAAKS,UACL1P,EAAMiP,EAAKlN,KAAK,IAGhB,IAAI4N,EAAgB,GACpB,IAAKzP,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAI0P,EAAUC,SAAS7P,EAAI8P,OAAO5P,EAAG,GAAI,GAAG6F,SAAS,IAC9B,IAAnB6J,EAAQvQ,SAAcuQ,EAAU,IAAMA,GAC1CD,GAAgCC,EAElC,OAAOD,EAAcI,eAwDVC,GAAkB,IAAIC,OAAO,iBAO7BhC,GAAc,SAASjO,GAClC,GAAIgQ,GAAgB1L,KAAKtE,GAAM,CAC7B,IAAMkQ,EAASxC,OAAO1N,GACtB,IAAe,YAAXkQ,GAAyBA,GAAU,WACrC,OAAOA,EAGX,OAAO,MAoBIC,GAAiB,SAASnJ,GACrC,IACEA,IACA,MAAOzH,GAEP6Q,WAAW,WAKT,IAAMjL,EAAQ5F,EAAE4F,OAAS,GAEzB,MADA8F,GAAK,yCAA0C9F,GACzC5F,GACL4P,KAAKI,MAAM,MAoELc,GAAwB,SACnCrJ,EACAsJ,GAEA,IAAMC,EAA2BH,WAAWpJ,EAAIsJ,GAIhD,MAHuB,iBAAZC,GAAyBA,EAAuB,OACxDA,EAAuB,QAEnBA,iBIrnBP,WAAYC,EAAiCC,GAC3C,QAAiB,IAAbA,EAAqB,CACvBlT,KAAKmT,QAAWF,EAAwB7J,MAAM,KAI9C,IADA,IAAIgK,EAAS,EACJzQ,EAAI,EAAGA,EAAI3C,KAAKmT,QAAQrR,OAAQa,IACV,EAAzB3C,KAAKmT,QAAQxQ,GAAGb,SAClB9B,KAAKmT,QAAQC,GAAUpT,KAAKmT,QAAQxQ,GACpCyQ,KAGJpT,KAAKmT,QAAQrR,OAASsR,EAEtBpT,KAAKqT,UAAY,OAEjBrT,KAAKmT,QAAUF,EACfjT,KAAKqT,UAAYH,EAqMvB,OA/NE1T,sBAAW8T,eAAX,WACE,OAAO,IAAIA,EAAK,qCA6BlBA,qBAAA,WACE,OAAItT,KAAKqT,WAAarT,KAAKmT,QAAQrR,OAAe,KAE3C9B,KAAKmT,QAAQnT,KAAKqT,YAM3BC,sBAAA,WACE,OAAOtT,KAAKmT,QAAQrR,OAAS9B,KAAKqT,WAMpCC,qBAAA,WACE,IAAIJ,EAAWlT,KAAKqT,UAIpB,OAHIH,EAAWlT,KAAKmT,QAAQrR,QAC1BoR,IAEK,IAAII,EAAKtT,KAAKmT,QAASD,IAMhCI,oBAAA,WACE,OAAItT,KAAKqT,UAAYrT,KAAKmT,QAAQrR,OACzB9B,KAAKmT,QAAQnT,KAAKmT,QAAQrR,OAAS,GAErC,MAGTwR,qBAAA,WAEE,IADA,IAAIC,EAAa,GACR5Q,EAAI3C,KAAKqT,UAAW1Q,EAAI3C,KAAKmT,QAAQrR,OAAQa,IAC5B,KAApB3C,KAAKmT,QAAQxQ,KAAW4Q,GAAc,IAAMvT,KAAKmT,QAAQxQ,IAG/D,OAAO4Q,GAAc,KAGvBD,+BAAA,WAEE,IADA,IAAIC,EAAa,GACR5Q,EAAI3C,KAAKqT,UAAW1Q,EAAI3C,KAAKmT,QAAQrR,OAAQa,IAC5B,KAApB3C,KAAKmT,QAAQxQ,KACf4Q,GAAc,IAAMC,mBAAmBzO,OAAO/E,KAAKmT,QAAQxQ,MAG/D,OAAO4Q,GAAc,KASvBD,kBAAA,SAAMG,GACJ,oBADIA,KACGzT,KAAKmT,QAAQ1K,MAAMzI,KAAKqT,UAAYI,IAM7CH,mBAAA,WACE,GAAItT,KAAKqT,WAAarT,KAAKmT,QAAQrR,OAAQ,OAAO,KAGlD,IADA,IAAM4R,EAAS,GACN/Q,EAAI3C,KAAKqT,UAAW1Q,EAAI3C,KAAKmT,QAAQrR,OAAS,EAAGa,IACxD+Q,EAAO3R,KAAK/B,KAAKmT,QAAQxQ,IAE3B,OAAO,IAAI2Q,EAAKI,EAAQ,IAO1BJ,kBAAA,SAAMK,GAEJ,IADA,IAAMD,EAAS,GACN/Q,EAAI3C,KAAKqT,UAAW1Q,EAAI3C,KAAKmT,QAAQrR,OAAQa,IACpD+Q,EAAO3R,KAAK/B,KAAKmT,QAAQxQ,IAE3B,GAAIgR,aAAwBL,EAC1B,IACM3Q,EAAIgR,EAAaN,UACrB1Q,EAAIgR,EAAaR,QAAQrR,OACzBa,IAEA+Q,EAAO3R,KAAK4R,EAAaR,QAAQxQ,QAGnC,CAAA,IAAMiR,EAAcD,EAAavK,MAAM,KACvC,IAASzG,EAAI,EAAGA,EAAIiR,EAAY9R,OAAQa,IACV,EAAxBiR,EAAYjR,GAAGb,QAAY4R,EAAO3R,KAAK6R,EAAYjR,IAI3D,OAAO,IAAI2Q,EAAKI,EAAQ,IAM1BJ,oBAAA,WACE,OAAOtT,KAAKqT,WAAarT,KAAKmT,QAAQrR,QAQjCwR,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,IAAI5R,MACR,8BACEuR,EACA,8BAEAD,EACA,MAUDP,eAAP,SAAoBc,EAAYC,GAG9B,IAFA,IAAMC,EAAWF,EAAK3L,QAChB8L,EAAYF,EAAM5L,QACf9F,EAAI,EAAGA,EAAI2R,EAASxS,QAAUa,EAAI4R,EAAUzS,OAAQa,IAAK,CAChE,IAAM6R,EAAMhE,GAAY8D,EAAS3R,GAAI4R,EAAU5R,IAC/C,GAAY,IAAR6R,EAAW,OAAOA,EAExB,OAAIF,EAASxS,SAAWyS,EAAUzS,OAAe,EAC1CwS,EAASxS,OAASyS,EAAUzS,QAAU,EAAI,GAQnDwR,mBAAA,SAAOmB,GACL,GAAIzU,KAAK0U,cAAgBD,EAAMC,YAC7B,OAAO,EAGT,IACE,IAAI/R,EAAI3C,KAAKqT,UAAW3H,EAAI+I,EAAMpB,UAClC1Q,GAAK3C,KAAKmT,QAAQrR,OAClBa,IAAK+I,IAEL,GAAI1L,KAAKmT,QAAQxQ,KAAO8R,EAAMtB,QAAQzH,GACpC,OAAO,EAIX,OAAO,GAQT4H,qBAAA,SAASmB,GACP,IAAI9R,EAAI3C,KAAKqT,UACT3H,EAAI+I,EAAMpB,UACd,GAAIrT,KAAK0U,YAAcD,EAAMC,YAC3B,OAAO,EAET,KAAO/R,EAAI3C,KAAKmT,QAAQrR,QAAQ,CAC9B,GAAI9B,KAAKmT,QAAQxQ,KAAO8R,EAAMtB,QAAQzH,GACpC,OAAO,IAEP/I,IACA+I,EAEJ,OAAO,sBAwBT,WAAYiJ,EAAoBC,GAAA5U,kBAAA4U,EAE9B5U,KAAK6U,OAASF,EAAKlM,QAEnBzI,KAAK8U,YAAclD,KAAKmD,IAAI,EAAG/U,KAAK6U,OAAO/S,QAE3C,IAAK,IAAIa,EAAI,EAAGA,EAAI3C,KAAK6U,OAAO/S,OAAQa,IACtC3C,KAAK8U,aAAerI,EAAazM,KAAK6U,OAAOlS,IAE/C3C,KAAKgV,cAkET,OA9DExV,sBAAWyV,wBAAX,WACE,OAAO,oCAITzV,sBAAWyV,+BAAX,WACE,OAAO,qCAITA,iBAAA,SAAKC,GAEsB,EAArBlV,KAAK6U,OAAO/S,SACd9B,KAAK8U,aAAe,GAEtB9U,KAAK6U,OAAO9S,KAAKmT,GACjBlV,KAAK8U,aAAerI,EAAayI,GACjClV,KAAKgV,eAGPC,gBAAA,WACE,IAAME,EAAOnV,KAAK6U,OAAOhT,MACzB7B,KAAK8U,aAAerI,EAAa0I,GAER,EAArBnV,KAAK6U,OAAO/S,SACd9B,KAAK8U,aAAe,IAIhBG,wBAAR,WACE,GAAIjV,KAAK8U,YAAcG,EAAeG,sBACpC,MAAM,IAAI7S,MACRvC,KAAK4U,aACH,8BACAK,EAAeG,sBACf,WACApV,KAAK8U,YACL,MAGN,GAAI9U,KAAK6U,OAAO/S,OAASmT,EAAeI,eACtC,MAAM,IAAI9S,MACRvC,KAAK4U,aACH,iEACAK,EAAeI,eACf,gCACArV,KAAKsV,kBAUbL,0BAAA,WACE,OAA0B,GAAtBjV,KAAK6U,OAAO/S,OACP,GAEF,gBAAkB9B,KAAK6U,OAAOrQ,KAAK,KAAO,UCrUxC+Q,GAAe,iBAIfC,GAAY,YAEZC,GAAe,6BCM1B,WACEC,EACOC,EACAC,EACAC,EACAC,gBAAAA,MAHA9V,YAAA2V,EACA3V,eAAA4V,EACA5V,mBAAA6V,EACA7V,oBAAA8V,EAEP9V,KAAK0V,KAAOA,EAAKlD,cACjBxS,KAAK+V,OAAS/V,KAAK0V,KAAKnD,OAAOvS,KAAK0V,KAAKM,QAAQ,KAAO,GACxDhW,KAAKiW,aAAepH,EAAkBlH,IAAI,QAAU+N,IAAS1V,KAAK0V,KA4EtE,OAzEEQ,4BAAA,WACE,OAAOlW,KAAK0V,OAAS1V,KAAKiW,cAAgBjW,KAAKmW,gBAGjDD,4BAAA,WACE,MAA0C,OAAnClW,KAAKiW,aAAa1D,OAAO,EAAG,IAGrC2D,uBAAA,WACE,MAAuB,wBAAhBlW,KAAK+V,QAGdG,yBAAA,WACE,MACkB,mBAAhBlW,KAAK+V,QAA+C,wBAAhB/V,KAAK+V,QAI7CG,uBAAA,SAAWE,GACLA,IAAYpW,KAAKiW,eACnBjW,KAAKiW,aAAeG,EAChBpW,KAAKqW,mBACPxH,EAAkBgB,IAAI,QAAU7P,KAAK0V,KAAM1V,KAAKiW,gBAWtDC,0BAAA,SAAcI,EAAcC,GAI1B,IAAIC,EACJ,GAJArU,EAAuB,iBAATmU,EAAmB,8BACjCnU,EAAyB,iBAAXoU,EAAqB,gCAG/BD,IAASd,GACXgB,GACGxW,KAAK2V,OAAS,SAAW,SAAW3V,KAAKiW,aAAe,YACtD,CAAA,GAAIK,IAASb,GAIlB,MAAM,IAAIlT,MAAM,4BAA8B+T,GAH9CE,GACGxW,KAAK2V,OAAS,WAAa,WAAa3V,KAAKiW,aAAe,QAI7DjW,KAAKyW,oBACPF,EAAW,GAAIvW,KAAK4V,WAGtB,IAAMc,EAAkB,GAMxB,OAJAlN,EAAQ+M,EAAQ,SAAChO,EAAa3G,GAC5B8U,EAAM3U,KAAKwG,EAAM,IAAM3G,KAGlB4U,EAAUE,EAAMlS,KAAK,MAI9B0R,qBAAA,WACE,IAAIzT,EAAMzC,KAAK2W,cAIf,OAHI3W,KAAK8V,iBACPrT,GAAO,IAAMzC,KAAK8V,eAAiB,KAE9BrT,GAITyT,wBAAA,WACE,OAAQlW,KAAK2V,OAAS,WAAa,WAAa3V,KAAK0V,WCtDlD,ICjCCkB,GAKFC,GAMEC,GCvBJC,GCDAC,GH8CSC,GAAgB,SAC3BC,GAEA,IAAMC,EAAYC,GAASF,GACzBtB,EAAYuB,EAAUE,UAEC,aAArBF,EAAUpB,QACZ9F,GACEkH,EAAUzB,KACR,8EAOFE,GAA0B,aAAbA,GACM,cAArBuB,EAAUpB,QAEV9F,GACE,gFAICkH,EAAUxB,QP2FK,oBAAX7O,QACPA,OAAOwQ,UACPxQ,OAAOwQ,SAASC,WACgC,IAAhDzQ,OAAOwQ,SAASC,SAASvB,QAAQ,WAEjCtI,GACE,6FO7FJ,IAAMmI,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,EAAQpV,QAErB,IAAI+V,EAAkBX,EAAQlB,QAAQ,MACb,IAArB6B,IACFA,EAAkBX,EAAQpV,QAE5B4T,EAAOwB,EAAQ7F,UAAU,EAAGO,KAAKG,IAAI6F,EAAUC,IAC3CD,EAAWC,IAEbtE,EApIN,SAAoBA,GAGlB,IAFA,IAAIuE,EAAoB,GAClBpE,EAASH,EAAWnK,MAAM,KACvBzG,EAAI,EAAGA,EAAI+Q,EAAO5R,OAAQa,IACjC,GAAuB,EAAnB+Q,EAAO/Q,GAAGb,OAAY,CACxB,IAAIiW,EAAQrE,EAAO/Q,GACnB,IACEoV,EAAQC,mBAAmBD,EAAM3P,QAAQ,MAAO,MAChD,MAAOpG,IACT8V,GAAqB,IAAMC,EAG/B,OAAOD,EAwHUG,CAAWf,EAAQ7F,UAAUuG,EAAUC,KAEtD,IAAIK,EAnHR,SAAqBC,GACnB,IAAIC,EAAU,GACgB,MAA1BD,EAAY5S,OAAO,KACrB4S,EAAcA,EAAY9G,UAAU,IAEtC,IAAsB,QAAAgH,EAAAF,EAAY/O,MAAM,KAAlB4D,WAAAA,IAAwB,CAAzC,IAAMsL,OACT,GAAuB,IAAnBA,EAAQxW,OAAZ,CAGA,IAAMyW,EAAKD,EAAQlP,MAAM,KACP,IAAdmP,EAAGzW,OACLsW,EAAQJ,mBAAmBO,EAAG,KAAOP,mBAAmBO,EAAG,IAE3D7K,GAAK,0BAA0B4K,iBAAsBH,QAGzD,OAAOC,EAmGaI,CAChBtB,EAAQ7F,UAAUO,KAAKG,IAAImF,EAAQpV,OAAQ+V,KAK7B,IADhBF,EAAWjC,EAAKM,QAAQ,OAEtBL,EAAoB,UAAX6B,GAAiC,QAAXA,EAC/BE,EAAOpF,SAASoD,EAAKrE,UAAUsG,EAAW,GAAI,KAE9CA,EAAWT,EAAQpV,OAGrB,IAAMqH,EAAQuM,EAAKtM,MAAM,KACJ,IAAjBD,EAAMrH,QAERiU,EAAS5M,EAAM,GACfkO,EAAYlO,EAAM,GAAGqJ,eACK,IAAjBrJ,EAAMrH,OACfiU,EAAS5M,EAAM,GACwC,cAA9CA,EAAM,GAAGV,MAAM,EAAGkP,GAAUnF,gBACrCuD,EAAS,aAGO,KAAdsB,GAAoB,OAAQa,IAC9Bb,EAAYa,EAAgB,IAIhC,MAAO,CACLxC,OACAgC,OACA3B,SACAsB,YACA1B,SACA6B,SACAjE,eItKSkF,GAAqB,iCAQrBC,GAAsB,+BAOtBC,GAAiB,SAMjBC,GAAa,SAASrQ,GACjC,MACiB,iBAARA,GAAmC,IAAfA,EAAIzG,SAAiB2W,GAAmB1R,KAAKwB,IAQ/DsQ,GAAoB,SAAStF,GACxC,MACwB,iBAAfA,GACe,IAAtBA,EAAWzR,SACV4W,GAAoB3R,KAAKwM,IAqBjBuF,GAAkB,SAASC,GACtC,OACe,OAAbA,GACoB,iBAAbA,GACc,iBAAbA,IAA0B7I,GAAoB6I,IACrDA,GAAgC,iBAAbA,GAAyB1P,EAAS0P,EAAU,QAavDC,GAA0B,SACrCpN,EACAM,EACAjE,EACA0M,EACAxI,GAEIA,QAAqBhG,IAAT8B,GAEhBgR,GACEC,EAAetN,EAAQM,EAAgBC,GACvClE,EACA0M,IAWSsE,GAAuB,SAClChN,EACAhE,EACAkR,GAEA,IAAMxE,EACJwE,aAAiB7F,GAAO,IAAI2B,GAAekE,EAAOlN,GAAekN,EAEnE,QAAahT,IAAT8B,EACF,MAAM,IAAI1F,MAAM0J,EAAc,sBAAwB0I,EAAKW,iBAE7D,GAAoB,mBAATrN,EACT,MAAM,IAAI1F,MACR0J,EACE,uBACA0I,EAAKW,gBACL,oBACArN,EAAKO,YAGX,GAAI0H,GAAoBjI,GACtB,MAAM,IAAI1F,MACR0J,EAAc,YAAchE,EAAKO,WAAa,IAAMmM,EAAKW,iBAK7D,GACkB,iBAATrN,GACPA,EAAKnG,OAAS6W,GAAiB,GAC/BlM,EAAaxE,GAAQ0Q,GAErB,MAAM,IAAIpW,MACR0J,EACE,kCACA0M,GACA,eACAhE,EAAKW,gBACL,MACArN,EAAKoJ,UAAU,EAAG,IAClB,SAMN,GAAIpJ,GAAwB,iBAATA,EAAmB,CACpC,IAAImR,GAAc,EAChBC,GAAiB,EAwBnB,GAvBA7P,EAAQvB,EAAM,SAASM,EAAa3G,GAClC,GAAY,WAAR2G,EACF6Q,GAAc,OACT,GAAY,cAAR7Q,GAA+B,QAARA,IAChC8Q,GAAiB,GACZT,GAAWrQ,IACd,MAAM,IAAIhG,MACR0J,EACE,6BACA1D,EACA,KACAoM,EAAKW,gBACL,wFAMRX,EAAK5S,KAAKwG,GACV0Q,GAAqBhN,EAAarK,EAAO+S,GACzCA,EAAK9S,QAGHuX,GAAeC,EACjB,MAAM,IAAI9W,MACR0J,EACE,4BACA0I,EAAKW,gBACL,sCAmEGgE,GAA+B,SAC1C1N,EACAM,EACAjE,EACA0M,EACAxI,GAEA,IAAIA,QAAqBhG,IAAT8B,EAAhB,CAEA,IAAMgE,EAAciN,EAAetN,EAAQM,EAAgBC,GAE3D,IAAMlE,GAAwB,iBAATA,GAAsBtI,MAAMgE,QAAQsE,GACvD,MAAM,IAAI1F,MACR0J,EAAc,0DAIlB,IAAMsN,EAAqB,GAC3B/P,EAAQvB,EAAM,SAASM,EAAa3G,GAClC,IAAM4X,EAAU,IAAIlG,GAAK/K,GAEzB,GADA0Q,GAAqBhN,EAAarK,EAAO+S,EAAKO,MAAMsE,IAC1B,cAAtBA,EAAQC,YACLX,GAAgBlX,GACnB,MAAM,IAAIW,MACR0J,EACE,kCACAuN,EAAQhR,WACR,gGAKR+Q,EAAWxX,KAAKyX,KAvFsB,SACxCvN,EACAsN,GAEA,IAAI5W,EAAG6W,EACP,IAAK7W,EAAI,EAAGA,EAAI4W,EAAWzX,OAAQa,IAGjC,IADA,IAAMoO,GADNyI,EAAUD,EAAW5W,IACA8F,QACZiD,EAAI,EAAGA,EAAIqF,EAAKjP,OAAQ4J,IAC/B,GAAgB,cAAZqF,EAAKrF,IAAsBA,IAAMqF,EAAKjP,OAAS,QAE5C,IAAK8W,GAAW7H,EAAKrF,IAC1B,MAAM,IAAInJ,MACR0J,EACE,4BACA8E,EAAKrF,GACL,aACA8N,EAAQhR,WACR,uFAUV+Q,EAAWvI,KAAKsC,GAAKoG,cACrB,IAAIC,EAAwB,KAC5B,IAAKhX,EAAI,EAAGA,EAAI4W,EAAWzX,OAAQa,IAAK,CAEtC,GADA6W,EAAUD,EAAW5W,GACJ,OAAbgX,GAAqBA,EAAStQ,SAASmQ,GACzC,MAAM,IAAIjX,MACR0J,EACE,mBACA0N,EAASnR,WACT,qCACAgR,EAAQhR,YAGdmR,EAAWH,GAgDbI,CAA2B3N,EAAasN,KAG7BM,GAAmB,SAC9BjO,EACAM,EACA6M,EACA5M,GAEA,IAAIA,QAAyBhG,IAAb4S,EAAhB,CACA,GAAI7I,GAAoB6I,GACtB,MAAM,IAAIxW,MACR2W,EAAetN,EAAQM,EAAgBC,GACrC,MACA4M,EAASvQ,WACT,6FAIN,IAAKsQ,GAAgBC,GACnB,MAAM,IAAIxW,MACR2W,EAAetN,EAAQM,EAAgBC,GACrC,yFAKK2N,GAAoB,SAC/BlO,EACAM,EACA6N,EACA5N,GAEA,IAAIA,QAA0BhG,IAAd4T,EAEhB,OAAQA,GACN,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACH,MACF,QACE,MAAM,IAAIxX,MACR2W,EAAetN,EAAQM,EAAgBC,GACrC,8GAMG6N,GAAc,SACzBpO,EACAM,EACA3D,EACA4D,GAEA,KAAIA,QAAoBhG,IAARoC,GACXqQ,GAAWrQ,IACd,MAAM,IAAIhG,MACR2W,EAAetN,EAAQM,EAAgBC,GACrC,yBACA5D,EACA,qGAKK0R,GAAqB,SAChCrO,EACAM,EACAqH,EACApH,GAEA,KAAIA,QAA2BhG,IAAfoN,GAEXsF,GAAkBtF,IACrB,MAAM,IAAIhR,MACR2W,EAAetN,EAAQM,EAAgBC,GACrC,0BACAoH,EACA,qFAmBK2G,GAAuB,SAAStO,EAAgB+I,GAC3D,GAAwB,UAApBA,EAAKX,WACP,MAAM,IAAIzR,MAAMqJ,EAAS,8CAIhBuO,GAAc,SACzBvO,EACAM,EACAiL,GAGA,IAxV4C5D,EAwVtCA,EAAa4D,EAAUxC,KAAKnM,WAClC,GACuC,iBAA5B2O,EAAUM,SAAS/B,MACO,IAAnCyB,EAAUM,SAAS/B,KAAK5T,SACtB8W,GAAWzB,EAAUM,SAAS7B,YACY,cAA1CuB,EAAUM,SAAS/B,KAAKtM,MAAM,KAAK,IACd,IAAtBmK,EAAWzR,UA9V8ByR,EA8VSA,KA3VnDA,EAAaA,EAAWnL,QAAQ,mBAAoB,OAG/CyQ,GAAkBtF,IA0VvB,MAAM,IAAIhR,MACR2W,EAAetN,EAAQM,GAAgB,GACrC,uGCrYN,WAAoBkO,EAAqBjB,GAArBnZ,WAAAoa,EAAqBpa,WAAAmZ,EA4H3C,OAtHEkB,mBAAA,SAAOC,GACL3O,EAAiB,sBAAuB,EAAG,EAAGpE,UAAUzF,QACxDuK,EAAiB,sBAAuB,EAAGiO,GAAY,GACvD,IAAMC,EAAW,IAAI7T,EAKrB,OAJA1G,KAAKoa,MAAMI,mBACTxa,KAAKmZ,MACLoB,EAASE,aAAaH,IAEjBC,EAASlU,SAOlBgU,mBAAA,SAAOC,GACL3O,EAAiB,sBAAuB,EAAG,EAAGpE,UAAUzF,QACxDoY,GAAqB,sBAAuBla,KAAKmZ,OACjD9M,EAAiB,sBAAuB,EAAGiO,GAAY,GACvD,IAAMC,EAAW,IAAI7T,EAMrB,OALA1G,KAAKoa,MAAMM,gBACT1a,KAAKmZ,MACL,KACAoB,EAASE,aAAaH,IAEjBC,EAASlU,SAQlBgU,gBAAA,SAAIzY,EAAY0Y,GACd3O,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QACrDoY,GAAqB,mBAAoBla,KAAKmZ,OAC9CH,GAAwB,mBAAoB,EAAGpX,EAAO5B,KAAKmZ,OAAO,GAClE9M,EAAiB,mBAAoB,EAAGiO,GAAY,GACpD,IAAMC,EAAW,IAAI7T,EAMrB,OALA1G,KAAKoa,MAAMM,gBACT1a,KAAKmZ,MACLvX,EACA2Y,EAASE,aAAaH,IAEjBC,EAASlU,SASlBgU,4BAAA,SACEzY,EACAmX,EACAuB,GAEA3O,EAAiB,+BAAgC,EAAG,EAAGpE,UAAUzF,QACjEoY,GAAqB,+BAAgCla,KAAKmZ,OAC1DH,GACE,+BACA,EACApX,EACA5B,KAAKmZ,OACL,GAEFU,GAAiB,+BAAgC,EAAGd,GAAU,GAC9D1M,EAAiB,+BAAgC,EAAGiO,GAAY,GAEhE,IAAMC,EAAW,IAAI7T,EAOrB,OANA1G,KAAKoa,MAAMO,4BACT3a,KAAKmZ,MACLvX,EACAmX,EACAwB,EAASE,aAAaH,IAEjBC,EAASlU,SAQlBgU,mBAAA,SACEO,EACAN,GAIA,GAFA3O,EAAiB,sBAAuB,EAAG,EAAGpE,UAAUzF,QACxDoY,GAAqB,sBAAuBla,KAAKmZ,OAC7CxZ,MAAMgE,QAAQiX,GAAgB,CAEhC,IADA,IAAMC,EAAyC,GACtClY,EAAI,EAAGA,EAAIiY,EAAc9Y,SAAUa,EAC1CkY,EAAiB,GAAKlY,GAAKiY,EAAcjY,GAE3CiY,EAAgBC,EAChBnN,GACE,gOAIJ4L,GACE,sBACA,EACAsB,EACA5a,KAAKmZ,OACL,GAEF9M,EAAiB,sBAAuB,EAAGiO,GAAY,GACvD,IAAMC,EAAW,IAAI7T,EAMrB,OALA1G,KAAKoa,MAAMU,mBACT9a,KAAKmZ,MACLyB,EACAL,EAASE,aAAaH,IAEjBC,EAASlU,4BCnIlB,WAAmB0U,EAA2BC,GAA3Bhb,eAAA+a,EAA2B/a,cAAAgb,EAQhD,OAJEC,mBAAA,WAEE,OADAtP,EAAiB,2BAA4B,EAAG,EAAGpE,UAAUzF,QACtD,CAAEiZ,UAAW/a,KAAK+a,UAAWC,SAAUhb,KAAKgb,SAASE,gBLDnDC,IAELvE,GACJ,mEAIEC,GAAe,EAMbC,GAA0B,GAEzB,SAAS3J,GACd,IAGIxK,EAHEyY,EAAgBjO,IAAQ0J,GAC9BA,GAAe1J,EAGf,IAAMkO,EAAiB,IAAI1b,MAAM,GACjC,IAAKgD,EAAI,EAAQ,GAALA,EAAQA,IAClB0Y,EAAe1Y,GAAKiU,GAAWrR,OAAO4H,EAAM,IAG5CA,EAAMyE,KAAKI,MAAM7E,EAAM,IAEzBhL,EAAe,IAARgL,EAAW,4BAElB,IAAIT,EAAK2O,EAAe7W,KAAK,IAE7B,GAAK4W,EAIE,CAGL,IAAKzY,EAAI,GAAS,GAALA,GAA+B,KAArBmU,GAAcnU,GAAWA,IAC9CmU,GAAcnU,GAAK,EAErBmU,GAAcnU,UATd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClBmU,GAAcnU,GAAKiP,KAAKI,MAAsB,GAAhBJ,KAAK0J,UAUvC,IAAK3Y,EAAI,EAAGA,EAAI,GAAIA,IAClB+J,GAAMkK,GAAWrR,OAAOuR,GAAcnU,IAIxC,OAFAR,EAAqB,KAAduK,EAAG5K,OAAe,oCAElB4K,kBMgFT,WAAmBjF,EAAqB8T,GAArBvb,UAAAyH,EAAqBzH,UAAAub,EAW1C,OAHSC,OAAP,SAAY/T,EAAc8T,GACxB,OAAO,IAAIC,EAAU/T,EAAM8T,uBCjJ/B,cA6DA,OA3CEE,uBAAA,WACE,OAAOzb,KAAK0b,QAAQ9L,KAAK5P,OAW3Byb,gCAAA,SAAoBE,EAAeC,GACjC,IAAMC,EAAa,IAAIL,GAAUlL,GAAUqL,GACrCG,EAAa,IAAIN,GAAUlL,GAAUsL,GAC3C,OAAgD,IAAzC5b,KAAK0b,QAAQG,EAAYC,IAOlCL,oBAAA,WACE,OAAQD,GAAkBO,yBNzC9B,4DAoEA,OApE8BC,OAC5Bxc,sBAAWyc,sBAAX,WACE,OAAOlF,QAGT,SAAwBjJ,GACtBiJ,GAAejJ,mCAMjBmO,oBAAA,SAAQhR,EAAc1L,GACpB,OAAOiR,GAAYvF,EAAExD,KAAMlI,EAAEkI,OAM/BwU,wBAAA,SAAYV,GAGV,MAAMjZ,EAAe,oDAMvB2Z,gCAAA,SAAoBN,EAAeC,GACjC,OAAO,GAMTK,oBAAA,WACE,OAAQT,GAAkBO,KAM5BE,oBAAA,WAGE,OAAO,IAAIT,GAAUjL,GAAUwG,KAQjCkF,qBAAA,SAASC,EAAoBzU,GAM3B,OALAtF,EACwB,iBAAf+Z,EACP,gDAGK,IAAIV,GAAUU,EAAYnF,KAMnCkF,qBAAA,WACE,MAAO,WAlEmBR,IAsEjBU,GAAY,IAAIF,GC/DtB,IMPHG,GCHAC,GACArF,GPSSsF,GAAmB,SAASvD,GACvC,MAAwB,iBAAbA,EACF,UAAYxH,GAAsBwH,GAC/B,UAAYA,GAQbwD,GAAuB,SAASC,GAC3C,GAAIA,EAAaC,aAAc,CAC7B,IAAM3O,EAAM0O,EAAa1O,MACzB3L,EACiB,iBAAR2L,GACU,iBAARA,GACS,iBAARA,GAAoBzE,EAASyE,EAAK,OAC5C,6CAGF3L,EACEqa,IAAiBxF,IAAYwF,EAAa5S,UAC1C,gCAIJzH,EACEqa,IAAiBxF,IAAYwF,EAAaE,cAAc9S,UACxD,qEMJF,WACmB+S,EACTC,gBAAAA,EAAsBC,EAAST,0BAA0BU,YADhD9c,YAAA2c,EACT3c,mBAAA4c,EAVF5c,eAA2B,KAYjCmC,OACkBgE,IAAhBnG,KAAK2c,QAAwC,OAAhB3c,KAAK2c,OAClC,4DAGFJ,GAAqBvc,KAAK4c,eAiO9B,OAlQEpd,sBAAWqd,mCAIX,WACE,OAAOT,QALT,SAAqCtO,GACnCsO,GAA4BtO,mCAoC9B+O,uBAAA,WACE,OAAO,GAITA,wBAAA,WACE,OAAO7c,KAAK4c,eAIdC,2BAAA,SAAeE,GACb,OAAO,IAAIF,EAAS7c,KAAK2c,OAAQI,IAInCF,8BAAA,SAAkBG,GAEhB,MAAkB,cAAdA,EACKhd,KAAK4c,cAELC,EAAST,0BAA0BU,YAK9CD,qBAAA,SAASlI,GACP,OAAIA,EAAK/K,UACA5J,KACsB,cAApB2U,EAAKX,WACPhU,KAAK4c,cAELC,EAAST,0BAA0BU,YAO9CD,qBAAA,WACE,OAAO,GAITA,oCAAA,SAAwBG,EAAmBC,GACzC,OAAO,MAITJ,iCAAA,SAAqBG,EAAmBE,GACtC,MAAkB,cAAdF,EACKhd,KAAKmd,eAAeD,GAClBA,EAAatT,WAA2B,cAAdoT,EAC5Bhd,KAEA6c,EAAST,0BAA0BU,WAAWM,qBACnDJ,EACAE,GACAC,eAAend,KAAK4c,gBAK1BC,wBAAA,SAAYlI,EAAYuI,GACtB,IAAMG,EAAQ1I,EAAKX,WACnB,OAAc,OAAVqJ,EACKH,EACEA,EAAatT,WAAuB,cAAVyT,EAC5Brd,MAEPmC,EACY,cAAVkb,GAA8C,IAArB1I,EAAKD,YAC9B,8CAGK1U,KAAKod,qBACVC,EACAR,EAAST,0BAA0BU,WAAWQ,YAC5C3I,EAAKR,WACL+I,MAORL,oBAAA,WACE,OAAO,GAITA,wBAAA,WACE,OAAO,GAITA,yBAAA,SAAaU,EAAcC,GACzB,OAAO,GAMTX,gBAAA,SAAIY,GACF,OAAIA,IAAiBzd,KAAK0c,cAAc9S,UAC/B,CACL8T,SAAU1d,KAAK2d,WACfC,YAAa5d,KAAK0c,cAAc5O,OAExB9N,KAAK2d,YAInBd,iBAAA,WACE,GAAuB,OAAnB7c,KAAK6d,UAAoB,CAC3B,IAAIC,EAAS,GACR9d,KAAK4c,cAAchT,YACtBkU,GACE,YACAxB,GAAiBtc,KAAK4c,cAAc9O,OACpC,KAEJ,IAAMwI,SAActW,KAAK2c,OACzBmB,GAAUxH,EAAO,IAEfwH,GADW,WAATxH,EACQ/E,GAAsBvR,KAAK2c,QAE3B3c,KAAK2c,OAEjB3c,KAAK6d,UAAY5O,EAAK6O,GAExB,OAAO9d,KAAK6d,WAOdhB,qBAAA,WACE,OAAO7c,KAAK2c,QAMdE,sBAAA,SAAUpI,GACR,OAAIA,IAAUoI,EAAST,0BAA0BU,WACxC,EACErI,aAAiBoI,EAAST,2BAC3B,GAERja,EAAOsS,EAAMgI,aAAc,qBACpBzc,KAAK+d,mBAAmBtJ,KAU3BoI,+BAAR,SAA2BmB,GACzB,IAAMC,SAAuBD,EAAUrB,OACjCuB,SAAsBle,KAAK2c,OAC3BwB,EAAatB,EAASuB,iBAAiBpI,QAAQiI,GAC/CI,EAAYxB,EAASuB,iBAAiBpI,QAAQkI,GAGpD,OAFA/b,EAAqB,GAAdgc,EAAiB,sBAAwBF,GAChD9b,EAAoB,GAAbkc,EAAgB,sBAAwBH,GAC3CC,IAAeE,EAEI,WAAjBH,EAEK,EAGHle,KAAK2c,OAASqB,EAAUrB,QAClB,EACC3c,KAAK2c,SAAWqB,EAAUrB,OAC5B,EAEA,EAIJ0B,EAAYF,GAOvBtB,sBAAA,WACE,OAAO7c,MAMT6c,sBAAA,WACE,OAAO,GAMTA,mBAAA,SAAOpI,GAIL,GAAIA,IAAUzU,KACZ,OAAO,EACF,GAAIyU,EAAMgI,aAAc,CAC7B,IAAMuB,EAAYvJ,EAClB,OACEzU,KAAK2c,SAAWqB,EAAUrB,QAC1B3c,KAAK4c,cAAc0B,OAAON,EAAUpB,eAGtC,OAAO,GAjPJC,mBAAmB,CAAC,SAAU,UAAW,SAAU,eCT5D,ICZI0B,GCkBAzB,GFuDS0B,GAAiB,gBA7D9B,4DA2DA,OA3DmCxC,OAIjCyC,oBAAA,SAAQxT,EAAc1L,GACpB,IAAMmf,EAAYzT,EAAEsQ,KAAKmB,cACnBiC,EAAYpf,EAAEgc,KAAKmB,cACnBkC,EAAWF,EAAUG,UAAUF,GACrC,OAAiB,IAAbC,EACKpO,GAAYvF,EAAExD,KAAMlI,EAAEkI,MAEtBmX,GAOXH,wBAAA,SAAYlD,GACV,OAAQA,EAAKmB,cAAc9S,WAM7B6U,gCAAA,SAAoB9C,EAAeC,GACjC,OAAQD,EAAQe,cAAc4B,OAAO1C,EAAQc,gBAM/C+B,oBAAA,WACE,OAAQjD,GAAkBO,KAM5B0C,oBAAA,WACE,OAAO,IAAIjD,GAAUjL,GAAU,IAAIsM,GAAS,kBAAmB7F,MAQjEyH,qBAAA,SAASvC,EAAiBzU,GACxB,IAAM+U,EAAeH,GAAaH,GAClC,OAAO,IAAIV,GAAU/T,EAAM,IAAIoV,GAAS,kBAAmBL,KAM7DiC,qBAAA,WACE,MAAO,gBAzDwBhD,mBGkBjC,WACEF,EACAuD,EACAC,EACQC,EACAC,gBAAAA,QADAjf,gBAAAgf,EACAhf,sBAAAif,EAfFjf,gBAAuD,GAkB7D,IADA,IAAIwU,EAAM,GACF+G,EAAK3R,WAMX,GALA2R,EAAOA,EACP/G,EAAMsK,EAAWC,EAAWxD,EAAKhT,IAAKuW,GAAY,EAE9CE,IAAYxK,IAAQ,GAEpBA,EAAM,EAGN+G,EADEvb,KAAKgf,WACAzD,EAAKnH,KAELmH,EAAKlH,UAET,CAAA,GAAY,IAARG,EAAW,CAEpBxU,KAAKkf,WAAWnd,KAAKwZ,GACrB,MAGAvb,KAAKkf,WAAWnd,KAAKwZ,GAEnBA,EADEvb,KAAKgf,WACAzD,EAAKlH,MAELkH,EAAKnH,MA8CtB,OAxCE+K,oBAAA,WACE,GAA+B,IAA3Bnf,KAAKkf,WAAWpd,OAAc,OAAO,KAEzC,IACIsd,EADA7D,EAAOvb,KAAKkf,WAAWrd,MAM3B,GAHEud,EADEpf,KAAKif,iBACEjf,KAAKif,iBAAiB1D,EAAKhT,IAAKgT,EAAK3Z,OAClC,CAAE2G,IAAKgT,EAAKhT,IAAK3G,MAAO2Z,EAAK3Z,OAEvC5B,KAAKgf,WAEP,IADAzD,EAAOA,EAAKnH,MACJmH,EAAK3R,WACX5J,KAAKkf,WAAWnd,KAAKwZ,GACrBA,EAAOA,EAAKlH,WAId,IADAkH,EAAOA,EAAKlH,OACJkH,EAAK3R,WACX5J,KAAKkf,WAAWnd,KAAKwZ,GACrBA,EAAOA,EAAKnH,KAIhB,OAAOgL,GAGTD,oBAAA,WACE,OAAgC,EAAzBnf,KAAKkf,WAAWpd,QAGzBqd,iBAAA,WACE,GAA+B,IAA3Bnf,KAAKkf,WAAWpd,OAAc,OAAO,KAEzC,IAAMyZ,EAAOvb,KAAKkf,WAAWlf,KAAKkf,WAAWpd,OAAS,GACtD,OAAI9B,KAAKif,iBACAjf,KAAKif,iBAAiB1D,EAAKhT,IAAKgT,EAAK3Z,OAErC,CAAE2G,IAAKgT,EAAKhT,IAAK3G,MAAO2Z,EAAK3Z,2BAqBxC,WACS2G,EACA3G,EACPyd,EACAjL,EACAC,GAJOrU,SAAAuI,EACAvI,WAAA4B,EAKP5B,KAAKqf,MAAiB,MAATA,EAAgBA,EAAQC,EAASC,IAC9Cvf,KAAKoU,KACK,MAARA,EAAeA,EAAQoL,GAAU1C,WACnC9c,KAAKqU,MACM,MAATA,EAAgBA,EAASmL,GAAU1C,WAiTzC,OAjSEwC,iBAAA,SACE/W,EACA3G,EACAyd,EACAjL,EACAC,GAEA,OAAO,IAAIiL,EACF,MAAP/W,EAAcA,EAAMvI,KAAKuI,IAChB,MAAT3G,EAAgBA,EAAQ5B,KAAK4B,MACpB,MAATyd,EAAgBA,EAAQrf,KAAKqf,MACrB,MAARjL,EAAeA,EAAOpU,KAAKoU,KAClB,MAATC,EAAgBA,EAAQrU,KAAKqU,QAOjCiL,kBAAA,WACE,OAAOtf,KAAKoU,KAAKqL,QAAU,EAAIzf,KAAKqU,MAAMoL,SAM5CH,oBAAA,WACE,OAAO,GAYTA,6BAAA,SAAiB9B,GACf,OACExd,KAAKoU,KAAKsL,iBAAiBlC,IAC3BA,EAAOxd,KAAKuI,IAAKvI,KAAK4B,QACtB5B,KAAKqU,MAAMqL,iBAAiBlC,IAYhC8B,6BAAA,SAAiB9B,GACf,OACExd,KAAKqU,MAAMsL,iBAAiBnC,IAC5BA,EAAOxd,KAAKuI,IAAKvI,KAAK4B,QACtB5B,KAAKoU,KAAKuL,iBAAiBnC,IAQvB8B,iBAAR,WACE,OAAItf,KAAKoU,KAAKxK,UACL5J,KAECA,KAAKoU,KAAwBwL,QAOzCN,mBAAA,WACE,OAAOtf,KAAK4f,OAAOrX,KAMrB+W,mBAAA,WACE,OAAItf,KAAKqU,MAAMzK,UACN5J,KAAKuI,IAELvI,KAAKqU,MAAMwL,UAWtBP,mBAAA,SAAO/W,EAAQ3G,EAAUmd,GACvB,IAAIvK,EAAKlT,EAgBT,OAZEA,GAFFkT,EAAMuK,EAAWxW,GADjBjH,EAAItB,MACoBuI,MACd,EACJjH,EAAEwe,KAAK,KAAM,KAAM,KAAMxe,EAAE8S,KAAK2L,OAAOxX,EAAK3G,EAAOmd,GAAa,MACnD,IAARvK,EACLlT,EAAEwe,KAAK,KAAMle,EAAO,KAAM,KAAM,MAEhCN,EAAEwe,KACJ,KACA,KACA,KACA,KACAxe,EAAE+S,MAAM0L,OAAOxX,EAAK3G,EAAOmd,KAGtBiB,UAOHV,uBAAR,WACE,GAAItf,KAAKoU,KAAKxK,UACZ,OAAO4V,GAAU1C,WAEnB,IAAIxb,EAAoBtB,KAGxB,OAFKsB,EAAE8S,KAAK6L,UAAa3e,EAAE8S,KAAKA,KAAK6L,WAAU3e,EAAIA,EAAE4e,iBACrD5e,EAAIA,EAAEwe,KAAK,KAAM,KAAM,KAAOxe,EAAE8S,KAAwB+L,aAAc,OAC7DH,UAQXV,mBAAA,SACE/W,EACAwW,GAEA,IAAIzd,EAAG8e,EAEP,GAAIrB,EAAWxW,GADfjH,EAAItB,MACkBuI,KAAO,EACtBjH,EAAE8S,KAAKxK,WAActI,EAAE8S,KAAK6L,UAAa3e,EAAE8S,KAAKA,KAAK6L,WACxD3e,EAAIA,EAAE4e,gBAER5e,EAAIA,EAAEwe,KAAK,KAAM,KAAM,KAAMxe,EAAE8S,KAAKtE,OAAOvH,EAAKwW,GAAa,UACxD,CAKL,GAJIzd,EAAE8S,KAAK6L,WAAU3e,EAAIA,EAAE+e,gBACtB/e,EAAE+S,MAAMzK,WAActI,EAAE+S,MAAM4L,UAAa3e,EAAE+S,MAAMD,KAAK6L,WAC3D3e,EAAIA,EAAEgf,iBAEuB,IAA3BvB,EAAWxW,EAAKjH,EAAEiH,KAAY,CAChC,GAAIjH,EAAE+S,MAAMzK,UACV,OAAO4V,GAAU1C,WAEjBsD,EAAY9e,EAAE+S,MAAyBuL,OACvCte,EAAIA,EAAEwe,KACJM,EAAS7X,IACT6X,EAASxe,MACT,KACA,KACCN,EAAE+S,MAAyB8L,cAIlC7e,EAAIA,EAAEwe,KAAK,KAAM,KAAM,KAAM,KAAMxe,EAAE+S,MAAMvE,OAAOvH,EAAKwW,IAEzD,OAAOzd,EAAE0e,UAOXV,mBAAA,WACE,OAAOtf,KAAKqf,OAONC,mBAAR,WACE,IAAIhe,EAAItB,KAIR,OAHIsB,EAAE+S,MAAM4L,WAAa3e,EAAE8S,KAAK6L,WAAU3e,EAAIA,EAAEif,eAC5Cjf,EAAE8S,KAAK6L,UAAY3e,EAAE8S,KAAKA,KAAK6L,WAAU3e,EAAIA,EAAE+e,gBAC/C/e,EAAE8S,KAAK6L,UAAY3e,EAAE+S,MAAM4L,WAAU3e,EAAIA,EAAEkf,cACxClf,GAODge,yBAAR,WACE,IAAIhe,EAAItB,KAAKwgB,aAYb,OAXIlf,EAAE+S,MAAMD,KAAK6L,WASf3e,GADAA,GAPAA,EAAIA,EAAEwe,KACJ,KACA,KACA,KACA,KACCxe,EAAE+S,MAAyBgM,iBAExBE,eACAC,cAEDlf,GAODge,0BAAR,WACE,IAAIhe,EAAItB,KAAKwgB,aAKb,OAJIlf,EAAE8S,KAAKA,KAAK6L,WAEd3e,GADAA,EAAIA,EAAE+e,gBACAG,cAEDlf,GAODge,wBAAR,WACE,IAAMmB,EAAKzgB,KAAK8f,KAAK,KAAM,KAAMR,EAASC,IAAK,KAAMvf,KAAKqU,MAAMD,MAChE,OAAOpU,KAAKqU,MAAMyL,KAAK,KAAM,KAAM9f,KAAKqf,MAAOoB,EAAI,OAO7CnB,yBAAR,WACE,IAAMoB,EAAK1gB,KAAK8f,KAAK,KAAM,KAAMR,EAASC,IAAKvf,KAAKoU,KAAKC,MAAO,MAChE,OAAOrU,KAAKoU,KAAK0L,KAAK,KAAM,KAAM9f,KAAKqf,MAAO,KAAMqB,IAO9CpB,uBAAR,WACE,IAAMlL,EAAOpU,KAAKoU,KAAK0L,KAAK,KAAM,MAAO9f,KAAKoU,KAAKiL,MAAO,KAAM,MAC1DhL,EAAQrU,KAAKqU,MAAMyL,KAAK,KAAM,MAAO9f,KAAKqU,MAAMgL,MAAO,KAAM,MACnE,OAAOrf,KAAK8f,KAAK,KAAM,MAAO9f,KAAKqf,MAAOjL,EAAMC,IAS1CiL,2BAAR,WACE,IAAMqB,EAAa3gB,KAAK4gB,SACxB,OAAOhP,KAAKE,IAAI,EAAK6O,IAAe3gB,KAAKyf,QAAU,GAOrDH,mBAAA,WACE,IAAIqB,EACJ,GAAI3gB,KAAKigB,UAAYjgB,KAAKoU,KAAK6L,SAC7B,MAAM,IAAI1d,MACR,0BAA4BvC,KAAKuI,IAAM,IAAMvI,KAAK4B,MAAQ,KAG9D,GAAI5B,KAAKqU,MAAM4L,SACb,MAAM,IAAI1d,MACR,mBAAqBvC,KAAKuI,IAAM,IAAMvI,KAAK4B,MAAQ,YAIvD,IADA+e,EAAa3gB,KAAKoU,KAAKwM,YACJ5gB,KAAKqU,MAAMuM,SAC5B,MAAM,IAAIre,MAAM,uBAEhB,OAAOoe,GAAc3gB,KAAKigB,SAAW,EAAI,IA3StCX,OAAM,EACNA,SAAQ,qBAkTjB,cAgHA,OApGEuB,iBAAA,SACEtY,EACA3G,EACAyd,EACAjL,EACAC,GAEA,OAAOrU,MAWT6gB,mBAAA,SAAOtY,EAAQ3G,EAAUmd,GACvB,OAAO,IAAIO,GAAS/W,EAAK3G,EAAO,OAUlCif,mBAAA,SAAOtY,EAAQwW,GACb,OAAO/e,MAMT6gB,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,YAH5B9c,iBAAA8gB,EACA9gB,WAAA+gB,EA0MZ,OA7LEvB,mBAAA,SAAOjX,EAAQ3G,GACb,OAAO,IAAI4d,EACTxf,KAAK8gB,YACL9gB,KAAK+gB,MACFhB,OAAOxX,EAAK3G,EAAO5B,KAAK8gB,aACxBhB,KAAK,KAAM,KAAMR,GAAS0B,MAAO,KAAM,QAU9CxB,mBAAA,SAAOjX,GACL,OAAO,IAAIiX,EACTxf,KAAK8gB,YACL9gB,KAAK+gB,MACFjR,OAAOvH,EAAKvI,KAAK8gB,aACjBhB,KAAK,KAAM,KAAMR,GAAS0B,MAAO,KAAM,QAW9CxB,gBAAA,SAAIjX,GAGF,IAFA,IAAIiM,EACA+G,EAAOvb,KAAK+gB,OACRxF,EAAK3R,WAAW,CAEtB,GAAY,KADZ4K,EAAMxU,KAAK8gB,YAAYvY,EAAKgT,EAAKhT,MAE/B,OAAOgT,EAAK3Z,MACH4S,EAAM,EACf+G,EAAOA,EAAKnH,KACG,EAANI,IACT+G,EAAOA,EAAKlH,OAGhB,OAAO,MAQTmL,8BAAA,SAAkBjX,GAIhB,IAHA,IAAIiM,EACF+G,EAAOvb,KAAK+gB,MACZE,EAAc,MACR1F,EAAK3R,WAAW,CAEtB,GAAY,KADZ4K,EAAMxU,KAAK8gB,YAAYvY,EAAKgT,EAAKhT,MAClB,CACb,GAAKgT,EAAKnH,KAAKxK,UAIR,OAAIqX,EACFA,EAAY1Y,IAEZ,KALP,IADAgT,EAAOA,EAAKnH,MACJmH,EAAKlH,MAAMzK,WAAW2R,EAAOA,EAAKlH,MAC1C,OAAOkH,EAAKhT,IAMLiM,EAAM,EACf+G,EAAOA,EAAKnH,KACG,EAANI,IAET+G,GADA0F,EAAc1F,GACFlH,OAIhB,MAAM,IAAI9R,MACR,0EAOJid,oBAAA,WACE,OAAOxf,KAAK+gB,MAAMnX,WAMpB4V,kBAAA,WACE,OAAOxf,KAAK+gB,MAAMtB,SAMpBD,mBAAA,WACE,OAAOxf,KAAK+gB,MAAMG,UAMpB1B,mBAAA,WACE,OAAOxf,KAAK+gB,MAAMlB,UAYpBL,6BAAA,SAAiBhC,GACf,OAAOxd,KAAK+gB,MAAMrB,iBAAiBlC,IAWrCgC,6BAAA,SAAiBhC,GACf,OAAOxd,KAAK+gB,MAAMpB,iBAAiBnC,IASrCgC,wBAAA,SACE2B,GAEA,OAAO,IAAIhC,GACTnf,KAAK+gB,MACL,KACA/gB,KAAK8gB,aACL,EACAK,IAIJ3B,4BAAA,SACEjX,EACA4Y,GAEA,OAAO,IAAIhC,GACTnf,KAAK+gB,MACLxY,EACAvI,KAAK8gB,aACL,EACAK,IAIJ3B,mCAAA,SACEjX,EACA4Y,GAEA,OAAO,IAAIhC,GACTnf,KAAK+gB,MACLxY,EACAvI,KAAK8gB,aACL,EACAK,IAIJ3B,+BAAA,SACE2B,GAEA,OAAO,IAAIhC,GACTnf,KAAK+gB,MACL,KACA/gB,KAAK8gB,aACL,EACAK,IAhNG3B,aAAa,IAAIqB,QC9jBpBO,GAAQxP,KAAKrE,IAAI,iBAarB,WAAYzL,GACV,IAAkBuf,EAGlBrhB,KAAKyf,OAHa4B,EAGIvf,EAAS,EAF7BwQ,SAAUV,KAAKrE,IAAI8T,GAAOD,GAAe,KAG3CphB,KAAKshB,SAAWthB,KAAKyf,MAAQ,EAC7B,IAHiB/N,EAGX6P,GAHW7P,EAGI1R,KAAKyf,MAHQnN,SAAS3S,MAAM+R,EAAO,GAAGlN,KAAK,KAAM,IAItExE,KAAKwhB,MAAS1f,EAAS,EAAKyf,EAYhC,OANEE,yBAAA,WAEE,IAAMrC,IAAWpf,KAAKwhB,MAAS,GAAOxhB,KAAKshB,UAE3C,OADAthB,KAAKshB,WACElC,QAmBEsC,GAAgB,SAC3BC,EACAnN,EACAoN,EACAC,GAEAF,EAAU3Q,KAAKwD,GAEf,IAAMsN,EAAoB,SACxBC,EACA5S,GAEA,IACI6S,EACAzZ,EAFEzG,EAASqN,EAAO4S,EAGtB,GAAc,GAAVjgB,EACF,OAAO,KACF,GAAc,GAAVA,EAGT,OAFAkgB,EAAYL,EAAUI,GACtBxZ,EAAMqZ,EAAQA,EAAMI,GAAeA,EAC5B,IAAI1C,GACT/W,EACCyZ,EAAUzG,KACX+D,GAAS0B,MACT,KACA,MAGF,IAAMiB,EAAS3P,SAAUxQ,EAAS,EAAW,IAAMigB,EAC7C3N,EAAO0N,EAAkBC,EAAKE,GAC9B5N,EAAQyN,EAAkBG,EAAS,EAAG9S,GAG5C,OAFA6S,EAAYL,EAAUM,GACtB1Z,EAAMqZ,EAAQA,EAAMI,GAAeA,EAC5B,IAAI1C,GACT/W,EACCyZ,EAAUzG,KACX+D,GAAS0B,MACT5M,EACAC,IAgDA6N,EA3CmB,SAASC,GA2BhC,IA1BA,IAAI5G,EAAuB,KACvB2G,EAAO,KACP3E,EAAQoE,EAAU7f,OAEhBsgB,EAAe,SAASC,EAAmBhD,GAC/C,IAAM0C,EAAMxE,EAAQ8E,EACdlT,EAAOoO,EACbA,GAAS8E,EACT,IAAMC,EAAYR,EAAkBC,EAAM,EAAG5S,GACvC6S,EAAYL,EAAUI,GACtBxZ,EAASqZ,EAAQA,EAAMI,GAAeA,EAC5CO,EACE,IAAIjD,GAAS/W,EAAMyZ,EAAUzG,KAAmB8D,EAAO,KAAMiD,KAI3DC,EAAgB,SAASC,GAG3BjH,EAFEA,EACFA,EAAKnH,KAAOoO,EAGZN,EAAOM,GAKF7f,EAAI,EAAGA,EAAIwf,EAAO1C,QAAS9c,EAAG,CACrC,IAAM8f,EAAQN,EAAOO,eAEfL,EAAYzQ,KAAKE,IAAI,EAAGqQ,EAAO1C,OAAS9c,EAAI,IAC9C8f,EACFL,EAAaC,EAAW/C,GAAS0B,QAGjCoB,EAAaC,EAAW/C,GAAS0B,OACjCoB,EAAaC,EAAW/C,GAASC,MAGrC,OAAO2C,EAIIS,CADE,IAAIlB,GAAUE,EAAU7f,SAGvC,OAAO,IAAI0d,GAAgBqC,GAAcrN,EAAa0N,IHlIlDU,GAAiB,iBA4BrB,WACUC,EAGAC,GAHA9iB,cAAA6iB,EAGA7iB,eAAA8iB,EAiJZ,OAnKEtjB,sBAAWujB,iBAAX,WAWE,OAVA5gB,EACoBqc,GAClB,uCAEFD,GACEA,IACA,IAAIwE,EACF,CAAEnF,YAAagF,IACf,CAAEhF,YAAaY,sCAiBrBuE,gBAAA,SAAIC,GACF,IAAMC,EAAY1Z,EAAQvJ,KAAK6iB,SAAUG,GACzC,IAAKC,EAAW,MAAM,IAAI1gB,MAAM,wBAA0BygB,GAE1D,OAAIC,IAAcL,GAGT,KAEAK,GAQXF,qBAAA,SAASG,GACP,OAAO7Z,EAASrJ,KAAK8iB,UAAWI,EAAgB1a,aAQlDua,qBAAA,SACEG,EACAC,GAEAhhB,EACE+gB,IAAoB/G,GACpB,uEAMF,IAJA,IAUIiH,EAVEzB,EAAY,GACd0B,GAAkB,EAChBC,EAAOH,EAAiBI,YAAY/H,GAAUgI,MAChDxiB,EAAOsiB,EAAKG,UACTziB,GACLqiB,EACEA,GAAmBH,EAAgBQ,YAAY1iB,EAAKua,MACtDoG,EAAU5f,KAAKf,GACfA,EAAOsiB,EAAKG,UAIZL,EADEC,EACS3B,GAAcC,EAAWuB,EAAgBS,cAEzCf,GAEb,IAAMgB,EAAYV,EAAgB1a,WAC5Bqb,EAAcna,EAAM1J,KAAK8iB,WAC/Be,EAAYD,GAAaV,EACzB,IAAMY,EAAapa,EAAM1J,KAAK6iB,UAE9B,OADAiB,EAAWF,GAAaR,EACjB,IAAIL,EAASe,EAAYD,IASlCd,yBAAA,SACEf,EACAmB,GAFF,WAwCE,OAAO,IAAIJ,EApCQhZ,EACjB/J,KAAK6iB,SACL,SAACkB,EAA6CH,GAC5C,IAAMrG,EAAQhU,EAAQ9C,EAAKqc,UAAWc,GAEtC,GADAzhB,EAAOob,EAAO,oCAAsCqG,GAChDG,IAAoBnB,GAAgB,CAEtC,GAAIrF,EAAMmG,YAAY1B,EAAUzG,MAAO,CAKrC,IAHA,IAAMoG,EAAY,GACZ2B,EAAOH,EAAiBI,YAAY/H,GAAUgI,MAChDxiB,EAAOsiB,EAAKG,UACTziB,GACDA,EAAKyG,MAAQua,EAAUva,MACzBka,EAAU5f,KAAKf,GAEjBA,EAAOsiB,EAAKG,UAGd,OADA9B,EAAU5f,KAAKigB,GACRN,GAAcC,EAAWpE,EAAMoG,cAGtC,OAAOf,GAGT,IAAMoB,EAAeb,EAAiBxb,IAAIqa,EAAUva,MAChDwc,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAYnU,OACxB,IAAI0L,GAAUwG,EAAUva,KAAMuc,KAG3BC,EAAYlE,OAAOiC,EAAWA,EAAUzG,QAIrBvb,KAAK8iB,YASvCC,8BAAA,SACEf,EACAmB,GAoBA,OAAO,IAAIJ,EAlBQhZ,EAAI/J,KAAK6iB,SAAU,SACpCkB,GAEA,GAAIA,IAAoBnB,GAEtB,OAAOmB,EAEP,IAAMC,EAAeb,EAAiBxb,IAAIqa,EAAUva,MACpD,OAAIuc,EACKD,EAAgBjU,OACrB,IAAI0L,GAAUwG,EAAUva,KAAMuc,IAIzBD,IAImB/jB,KAAK8iB,iBI1LzC,SAGgBoB,GAAqB9P,EAAiBC,GACpD,OAAO7D,GAAY4D,EAAK3M,KAAM4M,EAAM5M,MAGtC,SAAgB0c,GAAgB/P,EAAcC,GAC5C,OAAO7D,GAAY4D,EAAMC,GH6B3B,kBAqBE,WACmB+P,EACAxH,EACTyH,GAFSrkB,eAAAokB,EACApkB,mBAAA4c,EACT5c,eAAAqkB,EAvBFrkB,eAA2B,KA8B7BA,KAAK4c,eACPL,GAAqBvc,KAAK4c,eAGxB5c,KAAKokB,UAAUxa,WACjBzH,GACGnC,KAAK4c,eAAiB5c,KAAK4c,cAAchT,UAC1C,wCAyaR,OA5cEpK,sBAAW8kB,oBAAX,WACE,OACExH,KACCA,GAAa,IAAIwH,EAChB,IAAI9E,GAAwB2E,IAC5B,KACApB,GAASwB,2CAmCfD,uBAAA,WACE,OAAO,GAITA,wBAAA,WACE,OAAOtkB,KAAK4c,eAAiBE,IAI/BwH,2BAAA,SAAevH,GACb,OAAI/c,KAAKokB,UAAUxa,UAEV5J,KAEA,IAAIskB,EAAatkB,KAAKokB,UAAWrH,EAAiB/c,KAAKqkB,YAKlEC,8BAAA,SAAkBtH,GAEhB,GAAkB,cAAdA,EACF,OAAOhd,KAAK0c,cAEZ,IAAMxH,EAAQlV,KAAKokB,UAAUzc,IAAIqV,GACjC,OAAiB,OAAV9H,EAAiB4H,GAAa5H,GAKzCoP,qBAAA,SAAS3P,GACP,IAAM0I,EAAQ1I,EAAKX,WACnB,OAAc,OAAVqJ,EAAuBrd,KAEpBA,KAAKwkB,kBAAkBnH,GAAOoH,SAAS9P,EAAKR,aAIrDmQ,qBAAA,SAAStH,GACP,OAAyC,OAAlChd,KAAKokB,UAAUzc,IAAIqV,IAI5BsH,iCAAA,SAAqBtH,EAAmBE,GAEtC,GADA/a,EAAO+a,EAAc,8CACH,cAAdF,EACF,OAAOhd,KAAKmd,eAAeD,GAE3B,IAAM8E,EAAY,IAAIxG,GAAUwB,EAAWE,GACvC+G,SAAaS,SAajB,OAVEA,EAFExH,EAAatT,WACfqa,EAAcjkB,KAAKokB,UAAUtU,OAAOkN,GACtBhd,KAAKqkB,UAAUM,kBAC3B3C,EACAhiB,KAAKokB,aAGPH,EAAcjkB,KAAKokB,UAAUrE,OAAO/C,EAAWE,GACjCld,KAAKqkB,UAAUO,aAAa5C,EAAWhiB,KAAKokB,YAIrD,IAAIE,EAAaL,EADVA,EAAYra,UAAYkT,GAAa9c,KAAK4c,cACN8H,IAKtDJ,wBAAA,SAAY3P,EAAYuI,GACtB,IAAMG,EAAQ1I,EAAKX,WACnB,GAAc,OAAVqJ,EACF,OAAOH,EAEP/a,EACsB,cAApBwS,EAAKX,YAAmD,IAArBW,EAAKD,YACxC,8CAEF,IAAMmQ,EAAoB7kB,KAAKwkB,kBAAkBnH,GAAOC,YACtD3I,EAAKR,WACL+I,GAEF,OAAOld,KAAKod,qBAAqBC,EAAOwH,IAK5CP,oBAAA,WACE,OAAOtkB,KAAKokB,UAAUxa,WAIxB0a,wBAAA,WACE,OAAOtkB,KAAKokB,UAAU3E,SAUxB6E,gBAAA,SAAI7G,GACF,GAAIzd,KAAK4J,UAAW,OAAO,KAE3B,IAAMN,EAA+B,GACjCwb,EAAU,EACZjF,EAAS,EACTkF,GAAiB,EAYnB,GAXA/kB,KAAKglB,aAAaxG,GAAgB,SAASjW,EAAa0U,GACtD3T,EAAIf,GAAO0U,EAAUnP,IAAI2P,GAEzBqH,IACIC,GAAkBT,EAAa7R,gBAAgB1L,KAAKwB,GACtDsX,EAASjO,KAAKmD,IAAI8K,EAAQ1P,OAAO5H,IAEjCwc,GAAiB,KAIhBtH,GAAgBsH,GAAkBlF,EAAS,EAAIiF,EAAS,CAE3D,IAAMG,EAAkB,GACxB,IAAK,IAAI1c,KAAOe,EAAK2b,EAAO1c,GAAyBe,EAAIf,GAEzD,OAAO0c,EAKP,OAHIxH,IAAiBzd,KAAK0c,cAAc9S,YACtCN,EAAI,aAAetJ,KAAK0c,cAAc5O,OAEjCxE,GAKXgb,iBAAA,WACE,GAAuB,OAAnBtkB,KAAK6d,UAAoB,CAC3B,IAAIqH,EAAS,GACRllB,KAAK0c,cAAc9S,YACtBsb,GACE,YACA5I,GAAiBtc,KAAK0c,cAAc5O,OACpC,KAEJ9N,KAAKglB,aAAaxG,GAAgB,SAASjW,EAAK0U,GAC9C,IAAMkI,EAAYlI,EAAUmI,OACV,KAAdD,IAAkBD,GAAU,IAAM3c,EAAM,IAAM4c,KAGpDnlB,KAAK6d,UAAuB,KAAXqH,EAAgB,GAAKjW,EAAKiW,GAE7C,OAAOllB,KAAK6d,WAIdyG,oCAAA,SACEtH,EACAC,EACAM,GAEA,IAAM8H,EAAMrlB,KAAKslB,cAAc/H,GAC/B,GAAI8H,EAAK,CACP,IAAME,EAAcF,EAAIG,kBACtB,IAAIhK,GAAUwB,EAAWC,IAE3B,OAAOsI,EAAcA,EAAY9d,KAAO,KAExC,OAAOzH,KAAKokB,UAAUoB,kBAAkBxI,IAQ5CsH,8BAAA,SAAkBpB,GAChB,IAAMmC,EAAMrlB,KAAKslB,cAAcpC,GAC/B,GAAImC,EAAK,CACP,IAAMnE,EAASmE,EAAInE,SACnB,OAAOA,GAAUA,EAAOzZ,KAExB,OAAOzH,KAAKokB,UAAUlD,UAQ1BoD,0BAAA,SAAcpB,GACZ,IAAMhC,EAASlhB,KAAKylB,kBAAkBvC,GACtC,OAAIhC,EACK,IAAI1F,GAAU0F,EAAQlhB,KAAKokB,UAAUzc,IAAIuZ,IAEzC,MASXoD,6BAAA,SAAiBpB,GACf,IAAMmC,EAAMrlB,KAAKslB,cAAcpC,GAC/B,GAAImC,EAAK,CACP,IAAMxF,EAASwF,EAAIxF,SACnB,OAAOA,GAAUA,EAAOpY,KAExB,OAAOzH,KAAKokB,UAAUvE,UAQ1ByE,yBAAA,SAAapB,GACX,IAAMrD,EAAS7f,KAAK0lB,iBAAiBxC,GACrC,OAAIrD,EACK,IAAIrE,GAAUqE,EAAQ7f,KAAKokB,UAAUzc,IAAIkY,IAEzC,MAOXyE,yBAAA,SACE/G,EACAC,GAEA,IAAM6H,EAAMrlB,KAAKslB,cAAc/H,GAC/B,OAAI8H,EACKA,EAAI3F,iBAAiB,SAASiG,GACnC,OAAOnI,EAAOmI,EAAYle,KAAMke,EAAYpK,QAGvCvb,KAAKokB,UAAU1E,iBAAiBlC,IAQ3C8G,wBAAA,SACEpB,GAEA,OAAOljB,KAAK4lB,gBAAgB1C,EAAgB2C,UAAW3C,IASzDoB,4BAAA,SACEwB,EACA5C,GAEA,IAAMmC,EAAMrlB,KAAKslB,cAAcpC,GAC/B,GAAImC,EACF,OAAOA,EAAIO,gBAAgBE,EAAW,SAAAvd,GAAO,OAAAA,IAO7C,IALA,IAAMlH,EAAWrB,KAAKokB,UAAUwB,gBAC9BE,EAAUre,KACV+T,GAAUgI,MAERxiB,EAAOK,EAAS0kB,OACL,MAAR/kB,GAAgBkiB,EAAgBxH,QAAQ1a,EAAM8kB,GAAa,GAChEzkB,EAASoiB,UACTziB,EAAOK,EAAS0kB,OAElB,OAAO1kB,GAQXijB,+BAAA,SACEpB,GAEA,OAAOljB,KAAKgmB,uBACV9C,EAAgB+C,UAChB/C,IASJoB,mCAAA,SACE4B,EACAhD,GAEA,IAAMmC,EAAMrlB,KAAKslB,cAAcpC,GAC/B,GAAImC,EACF,OAAOA,EAAIW,uBAAuBE,EAAS,SAAS3d,GAClD,OAAOA,IAQT,IALA,IAAMlH,EAAWrB,KAAKokB,UAAU4B,uBAC9BE,EAAQze,KACR+T,GAAUgI,MAERxiB,EAAOK,EAAS0kB,OACL,MAAR/kB,GAAyD,EAAzCkiB,EAAgBxH,QAAQ1a,EAAMklB,IACnD7kB,EAASoiB,UACTziB,EAAOK,EAAS0kB,OAElB,OAAO1kB,GAOXijB,sBAAA,SAAU7P,GACR,OAAIzU,KAAK4J,UACH6K,EAAM7K,UACD,GAEC,EAED6K,EAAMgI,cAAgBhI,EAAM7K,UAC9B,EACE6K,IAAUuC,IACX,EAGD,GAOXsN,sBAAA,SAAUpB,GACR,GACEA,IAAoB/G,IACpBnc,KAAKqkB,UAAU8B,SAASjD,GAExB,OAAOljB,KAEP,IAAM0kB,EAAc1kB,KAAKqkB,UAAU+B,SACjClD,EACAljB,KAAKokB,WAEP,OAAO,IAAIE,EAAatkB,KAAKokB,UAAWpkB,KAAK4c,cAAe8H,IAOhEJ,sBAAA,SAAU/G,GACR,OAAOA,IAAUpB,IAAanc,KAAKqkB,UAAU8B,SAAS5I,IAMxD+G,mBAAA,SAAO7P,GACL,GAAIA,IAAUzU,KACZ,OAAO,EACF,GAAIyU,EAAMgI,aACf,OAAO,EAEP,IAAM4J,EAAoB5R,EAC1B,GAAKzU,KAAK0c,cAAc4B,OAAO+H,EAAkB3J,eAE1C,CAAA,GACL1c,KAAKokB,UAAU3E,UAAY4G,EAAkBjC,UAAU3E,QAkBvD,OAAO,EAZP,IAJA,IAAM6G,EAAWtmB,KAAKujB,YAAY/E,IAC5B+H,EAAYF,EAAkB9C,YAAY/E,IAC5CgI,EAAcF,EAAS7C,UACvBgD,EAAeF,EAAU9C,UACtB+C,GAAeC,GAAc,CAClC,GACED,EAAY/e,OAASgf,EAAahf,OACjC+e,EAAYjL,KAAK+C,OAAOmI,EAAalL,MAEtC,OAAO,EAETiL,EAAcF,EAAS7C,UACvBgD,EAAeF,EAAU9C,UAE3B,OAAuB,OAAhB+C,GAAyC,OAAjBC,EAlB/B,OAAO,GAiCLnC,0BAAR,SACEpB,GAEA,OAAIA,IAAoB/G,GACf,KAEAnc,KAAKqkB,UAAU1c,IAAIub,EAAgB1a,aA7T/B8b,kBAAkB,sBA+WtBtN,GAAW,gBAvCtB,oBACE0P,YACE,IAAIlH,GAAwB2E,IAC5BG,GAAaxH,WACbiG,GAASwB,eA4Bf,OAjC6BvI,OAS3B2K,sBAAA,SAAUlS,GACR,OAAIA,IAAUzU,KACL,EAEA,GAIX2mB,mBAAA,SAAOlS,GAEL,OAAOA,IAAUzU,MAGnB2mB,wBAAA,WACE,OAAO3mB,MAGT2mB,8BAAA,SAAkB3J,GAChB,OAAOsH,GAAaxH,YAGtB6J,oBAAA,WACE,OAAO,MA/BkBrC,KAoD7B9kB,OAAOonB,iBAAiBpL,GAAW,CACjCO,IAAK,CACHna,MAAO,IAAI4Z,GAAUlL,GAAUgU,GAAaxH,aAE9C+J,IAAK,CACHjlB,MAAO,IAAI4Z,GAAUjL,GAAUyG,OAOnCiF,GAASlF,aAAeuN,GAAaxH,WACrCD,GAAST,0BAA4BkI,GTpjBnCtN,GSqjBSA,GFhjBTA,GEijBiBA,GInjBnB,IAAM8P,IAAY,EASlB,SAAgBzK,GACd0K,EACAhO,GAEA,gBAFAA,QAEa,OAATgO,EACF,OAAOzC,GAAaxH,WAoBtB,GAjBoB,iBAATiK,GAAqB,cAAeA,IAC7ChO,EAAWgO,EAAK,cAGlB5kB,EACe,OAAb4W,GACsB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,iBAATgO,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,iBAATA,GAAqB,QAASA,EAEvC,OAAO,IAAIlK,GADMkK,EACa1K,GAAatD,IAG7C,GAAMgO,aAAgBpnB,QAAUmnB,GA8CzB,CACL,IAAIE,EAAa1C,GAAaxH,WACxBmK,EAAUF,EAYhB,OAXAvd,EAAQyd,EAAS,SAAC1e,EAAa2e,GAC7B,GAAI7d,EAAS4d,EAAS1e,IACQ,MAAxBA,EAAI8I,UAAU,EAAG,GAAY,CAE/B,IAAM4L,EAAYZ,GAAa6K,IAC3BjK,EAAUR,cAAiBQ,EAAUrT,YACvCod,EAAOA,EAAK5J,qBAAqB7U,EAAK0U,OAKvC+J,EAAK7J,eAAed,GAAatD,IA3DxC,IAAMoO,EAAwB,GAC1BC,GAAuB,EACrBC,EAAqCN,EAa3C,GAZAvd,EAAQ6d,EAAc,SAAC9e,EAAa2M,GAClC,GAAmB,iBAAR3M,GAA4C,MAAxBA,EAAI8I,UAAU,EAAG,GAAY,CAE1D,IAAM4L,EAAYZ,GAAagL,EAAa9e,IACvC0U,EAAUrT,YACbwd,EACEA,IAAyBnK,EAAUP,cAAc9S,UACnDud,EAASplB,KAAK,IAAIyZ,GAAUjT,EAAK0U,QAKhB,GAAnBkK,EAASrlB,OACX,OAAOwiB,GAAaxH,WAGtB,IAAMwK,EAAW5F,GACfyF,EACAjD,GACA,SAAAlC,GAAa,OAAAA,EAAUva,MACvB0c,IAEF,GAAIiD,EAAsB,CACxB,IAAMG,EAAiB7F,GACrByF,EACA3I,GAAemF,cAEjB,OAAO,IAAIW,GACTgD,EACAjL,GAAatD,GACb,IAAIgK,GACF,CAAEnF,YAAa2J,GACf,CAAE3J,YAAaY,MAInB,OAAO,IAAI8F,GACTgD,EACAjL,GAAatD,GACbgK,GAASwB,SNpFflI,GMyGcA,GCxGhB,ICqBImL,GCxBQC,GAAAA,GF8DCC,GAAc,gBA3D3B,4DAyDA,OAzDgC1L,OAI9B2L,oBAAA,SAAQ1c,EAAc1L,GACpB,IAAMqf,EAAW3T,EAAEsQ,KAAKsD,UAAUtf,EAAEgc,MACpC,OAAiB,IAAbqD,EACKpO,GAAYvF,EAAExD,KAAMlI,EAAEkI,MAEtBmX,GAOX+I,wBAAA,SAAYpM,GACV,OAAO,GAMToM,gCAAA,SAAoBhM,EAAeC,GACjC,OAAQD,EAAQ2C,OAAO1C,IAMzB+L,oBAAA,WACE,OAAQnM,GAAkBO,KAM5B4L,oBAAA,WACE,OAAQnM,GAAkBqL,KAQ5Bc,qBAAA,SAASzL,EAAoBzU,GAC3B,IAAMmgB,EAAYvL,GAAaH,GAC/B,OAAO,IAAIV,GAAU/T,EAAMmgB,IAM7BD,qBAAA,WACE,MAAO,aAvDqBlM,oBGI9B,WAAoBoM,GAApB,MACEnB,0BADkBjgB,aAAAohB,EAGlB1lB,GACG0lB,EAAWje,WAAuC,cAA1Bie,EAAW7T,WACpC,6DA4DN,OAlE+BgI,OAenB8L,yBAAV,SAAuBC,GACrB,OAAOA,EAAKtD,SAASzkB,KAAK6nB,aAM5BC,wBAAA,SAAYvM,GACV,OAAQA,EAAKkJ,SAASzkB,KAAK6nB,YAAYje,WAMzCke,oBAAA,SAAQ7c,EAAc1L,GACpB,IAAMyoB,EAAShoB,KAAKioB,aAAahd,EAAEsQ,MAC7B2M,EAASloB,KAAKioB,aAAa1oB,EAAEgc,MAC7BqD,EAAWoJ,EAAOnJ,UAAUqJ,GAClC,OAAiB,IAAbtJ,EACKpO,GAAYvF,EAAExD,KAAMlI,EAAEkI,MAEtBmX,GAOXkJ,qBAAA,SAAS5L,EAAoBzU,GAC3B,IAAMmgB,EAAYvL,GAAaH,GACzBX,EAAO+I,GAAaxH,WAAWQ,YACnCtd,KAAK6nB,WACLD,GAEF,OAAO,IAAIpM,GAAU/T,EAAM8T,IAM7BuM,oBAAA,WACE,IAAMvM,EAAO+I,GAAaxH,WAAWQ,YAAYtd,KAAK6nB,WAAY7Q,IAClE,OAAO,IAAIwE,GAAUjL,GAAUgL,IAMjCuM,qBAAA,WACE,OAAO9nB,KAAK6nB,WAAWpf,QAAQjE,KAAK,SAhETiX,kBCM7B,WACmB0M,EACAC,EACAC,GAFAroB,WAAAmoB,EACAnoB,UAAAooB,EACApoB,YAAAqoB,EAqJrB,OA5IEC,gBAAA,WAEE,OADA3c,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QAC9C9B,KAAKmoB,MAAMra,OAQpBwa,sBAAA,WAEE,OADA3c,EAAiB,yBAA0B,EAAG,EAAGpE,UAAUzF,QACpD9B,KAAKmoB,MAAMra,KAAI,IAKxBwa,mBAAA,WAGE,OADA3c,EAAiB,sBAAuB,EAAG,EAAGpE,UAAUzF,QACjD9B,KAAKuoB,aAQdD,mBAAA,WAEE,OADA3c,EAAiB,sBAAuB,EAAG,EAAGpE,UAAUzF,SAChD9B,KAAKmoB,MAAMve,WASrB0e,kBAAA,SAAME,GACJ7c,EAAiB,qBAAsB,EAAG,EAAGpE,UAAUzF,QAEvD0mB,EAAkBzjB,OAAOyjB,GACzBvO,GAAmB,qBAAsB,EAAGuO,GAAiB,GAE7D,IAAMC,EAAY,IAAInV,GAAKkV,GACrBE,EAAW1oB,KAAKooB,KAAKlT,MAAMuT,GACjC,OAAO,IAAIH,EACTtoB,KAAKmoB,MAAM1D,SAASgE,GACpBC,EACAlK,KAUJ8J,qBAAA,SAASE,GACP7c,EAAiB,wBAAyB,EAAG,EAAGpE,UAAUzF,QAC1DmY,GAAmB,wBAAyB,EAAGuO,GAAiB,GAEhE,IAAMC,EAAY,IAAInV,GAAKkV,GAC3B,OAAQxoB,KAAKmoB,MAAM1D,SAASgE,GAAW7e,WAQzC0e,wBAAA,WAIE,OAHA3c,EAAiB,2BAA4B,EAAG,EAAGpE,UAAUzF,QAGtD9B,KAAKmoB,MAAMzL,cAAc5O,OAWlCwa,oBAAA,SAAQ9K,GAAR,WAIE,OAHA7R,EAAiB,uBAAwB,EAAG,EAAGpE,UAAUzF,QACzDuK,EAAiB,uBAAwB,EAAGmR,GAAQ,IAEhDxd,KAAKmoB,MAAM1L,gBAEMzc,KAAKmoB,MAEJnD,aAAahlB,KAAKqoB,OAAQ,SAAC9f,EAAKgT,GACpD,OAAOiC,EACL,IAAI8K,EAAa/M,EAAM9U,EAAK2hB,KAAKlT,MAAM3M,GAAMiW,QASnD8J,wBAAA,WAGE,OAFA3c,EAAiB,2BAA4B,EAAG,EAAGpE,UAAUzF,SAEzD9B,KAAKmoB,MAAM1L,eACFzc,KAAKmoB,MAAMve,WAG1BpK,sBAAI8oB,uBAAJ,WACE,OAAOtoB,KAAKooB,KAAKO,0CAOnBL,wBAAA,WAGE,OAFA3c,EAAiB,2BAA4B,EAAG,EAAGpE,UAAUzF,QAEtD9B,KAAKmoB,MAAMS,eAMpBN,mBAAA,WAGE,OAFA3c,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QAE9C9B,KAAKooB,MAGd5oB,sBAAI8oB,uBAAJ,WACE,OAAOtoB,KAAK6oB,6DC/Hd,WACS9O,EAMA+O,EACA9N,EACA+N,GARA/oB,eAAA+Z,EAMA/Z,uBAAA8oB,EACA9oB,cAAAgb,EACAhb,cAAA+oB,EAyCX,OAnCEC,oBAAA,WACE,IAAMC,EAAMjpB,KAAKgb,SAAS6N,SAC1B,MAAuB,UAAnB7oB,KAAK+Z,UACAkP,EAAItU,KAEJsU,EAAIC,YAAYvU,MAO3BqU,yBAAA,WACE,OAAOhpB,KAAK+Z,WAMdiP,2BAAA,WACE,OAAOhpB,KAAK8oB,kBAAkBK,eAAenpB,OAM/CgpB,qBAAA,WACE,OACEhpB,KAAKopB,UAAU5gB,WACf,IACAxI,KAAK+Z,UACL,IACAlR,EAAU7I,KAAKgb,SAASuN,iCAW5B,WACSO,EACAnjB,EACAgP,GAFA3U,uBAAA8oB,EACA9oB,WAAA2F,EACA3F,UAAA2U,EA8BX,OAxBE0U,oBAAA,WACE,OAAOrpB,KAAK2U,MAMd0U,yBAAA,WACE,MAAO,UAMTA,2BAAA,WACE,OAAOrpB,KAAK8oB,kBAAkBK,eAAenpB,OAM/CqpB,qBAAA,WACE,OAAOrpB,KAAK2U,KAAKnM,WAAa,8BC3DhC,WACU8gB,EACAC,EACAC,GAFAxpB,eAAAspB,EACAtpB,qBAAAupB,EACAvpB,cAAAwpB,EA8EZ,OAxEEC,uBAAA,SAAW1P,GACT,MAAqB,UAAdA,GAMT0P,wBAAA,SAAYC,EAAgBC,GAC1B,IAAMpM,EAAQoM,EAAMC,iBAAiBC,WACrC,OAAO,IAAIb,GACT,QACAhpB,KACA,IAAIsoB,GAAaoB,EAAOI,aAAcH,EAAMd,SAAUtL,KAO1DkM,2BAAA,SAAeM,GACb,IAAMC,EAAMhqB,KAAKwpB,SACjB,GAAiC,WAA7BO,EAAUE,eAA6B,CACzC9nB,EACEnC,KAAKupB,gBACL,gEAEF,IAAMW,EAAWlqB,KAAKupB,gBACtB,OAAO,WAELW,EAASxoB,KAAKsoB,EAAMD,EAA0BpkB,QAGhD,IAAMwkB,EAAKnqB,KAAKspB,UAChB,OAAO,WACLa,EAAGzoB,KAAKsoB,EAAMD,EAAwB/O,YAQ5CyO,8BAAA,SAAkB9jB,EAAcgP,GAC9B,OAAI3U,KAAKupB,gBACA,IAAIF,GAAYrpB,KAAM2F,EAAOgP,GAE7B,MAOX8U,oBAAA,SAAQhV,GACN,OAAMA,aAAiBgV,KAEXhV,EAAM6U,YAActpB,KAAKspB,WAKjC7U,EAAM6U,YAActpB,KAAKspB,WAAa7U,EAAM+U,WAAaxpB,KAAKwpB,WAQpEC,2BAAA,WACE,OAA0B,OAAnBzpB,KAAKspB,8BAmBd,WACUc,EAGAb,EACAC,GAJAxpB,gBAAAoqB,EAGApqB,qBAAAupB,EACAvpB,cAAAwpB,EA+GZ,OAzGEa,uBAAA,SAAWtQ,GACT,IAAIuQ,EACY,mBAAdvQ,EAAiC,cAAgBA,EAGnD,OAFAuQ,EACmB,qBAAjBA,EAAsC,gBAAkBA,EACnDjhB,EAASrJ,KAAKoqB,WAAYE,IAMnCD,8BAAA,SAAkB1kB,EAAcgP,GAC9B,OAAI3U,KAAKupB,gBACA,IAAIF,GAAYrpB,KAAM2F,EAAOgP,GAE7B,MAOX0V,wBAAA,SAAYX,EAAgBC,GAC1BxnB,EAA2B,MAApBunB,EAAO1M,UAAmB,yCACjC,IAAMiM,EAAMU,EAAMd,SAAS3T,MAA8BwU,EAAgB,WACnEnM,EAAQoM,EAAMC,iBAAiBC,WACrC,OAAO,IAAIb,GACTU,EAAOpT,KACPtW,KACA,IAAIsoB,GAAaoB,EAAOI,aAAcb,EAAK1L,GAC3CmM,EAAOX,WAOXsB,2BAAA,SAAeN,GACb,IAAMC,EAAMhqB,KAAKwpB,SACjB,GAAiC,WAA7BO,EAAUE,eAA6B,CACzC9nB,EACEnC,KAAKupB,gBACL,gEAEF,IAAMgB,EAAWvqB,KAAKupB,gBACtB,OAAO,WAELgB,EAAS7oB,KAAKsoB,EAAMD,EAA0BpkB,QAGhD,IAAM6kB,EAAKxqB,KAAKoqB,WAAYL,EAAwBhQ,WACpD,OAAO,WACLyQ,EAAG9oB,KACDsoB,EACCD,EAAwB/O,SACxB+O,EAAwBhB,YASjCsB,oBAAA,SAAQ5V,GACN,GAAIA,aAAiB4V,EAAwB,CAC3C,IAAKrqB,KAAKoqB,aAAe3V,EAAM2V,WAC7B,OAAO,EACF,GAAIpqB,KAAKwpB,WAAa/U,EAAM+U,SAAU,CAC3C,IAAMiB,EAAa5gB,EAAS4K,EAAM2V,YAElC,GAAIK,IADc5gB,EAAS7J,KAAKoqB,YACF,CAK5B,GAAmB,IAAfK,EAWF,OnCrJS,SACnBnhB,EACAG,GAEA,IAAK,IAAIlB,KAAOe,EACd,GAAI9J,OAAOU,UAAUL,eAAe6B,KAAK4H,EAAKf,KACvCkB,EAAGlB,EAAKe,EAAIf,IACf,OAAO,EAIb,OAAO,EmC0IUmiB,CACL1qB,KAAKoqB,WACL,SAACrQ,EAAW4Q,GAAO,OAAAlW,EAAM2V,WAAWrQ,KAAe4Q,IAZrD,IAAMC,EAAkCxgB,EAAUqK,EAAM2V,YAClDS,EAAiCzgB,EAAUpK,KAAKoqB,YACtD,QACES,IAAYD,GACVnW,EAAM2V,WAAWQ,IAChB5qB,KAAKoqB,WAAWS,IACjBpW,EAAM2V,WAAWQ,KAAc5qB,KAAKoqB,WAAWS,MAa3D,OAAO,GAMTR,2BAAA,WACE,OAA2B,OAApBrqB,KAAKoqB,+BLvOd,WACSU,EACAnW,EACCoW,EACAC,GAHDhrB,UAAA8qB,EACA9qB,UAAA2U,EACC3U,kBAAA+qB,EACA/qB,oBAAAgrB,EAglBZ,OA7lBExrB,sBAAWyrB,gCAIX,WAEE,OADA9oB,EAAOqlB,GAAwB,oCACxBA,QANT,SAAkC1Z,GAChC0Z,GAAyB1Z,mCAoBZmd,0BAAf,SAAuC1U,GACrC,IAAI2U,EAAY,KACZC,EAAU,KAQd,GAPI5U,EAAO6U,aACTF,EAAY3U,EAAO8U,sBAEjB9U,EAAO+U,WACTH,EAAU5U,EAAOgV,oBAGfhV,EAAOsT,aAAe1N,GAAW,CACnC,IAAMqP,EACJ,mGAEIC,EACJ,wGAEF,GAAIlV,EAAO6U,WAAY,CAErB,GADkB7U,EAAOmV,qBACRpb,GACf,MAAM,IAAI/N,MAAMipB,GACX,GAAyB,iBAAdN,EAChB,MAAM,IAAI3oB,MAAMkpB,GAGpB,GAAIlV,EAAO+U,SAAU,CAEnB,GADgB/U,EAAOoV,mBACRpb,GACb,MAAM,IAAIhO,MAAMipB,GACX,GAAuB,iBAAZL,EAChB,MAAM,IAAI5oB,MAAMkpB,SAGf,GAAIlV,EAAOsT,aAAerL,IAC/B,GACgB,MAAb0M,IAAsBpS,GAAgBoS,IAC3B,MAAXC,IAAoBrS,GAAgBqS,GAErC,MAAM,IAAI5oB,MACR,sKAUJ,GALAJ,EACEoU,EAAOsT,qBAAsB/B,IAC3BvR,EAAOsT,aAAenC,GACxB,uBAGc,MAAbwD,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAE3B,MAAM,IAAI5oB,MACR,0FAYO0oB,iBAAf,SAA8B1U,GAC5B,GACEA,EAAO6U,YACP7U,EAAO+U,UACP/U,EAAOqV,aACNrV,EAAOsV,mBAER,MAAM,IAAItpB,MACR,uGAUE0oB,2CAAR,SAAuCrf,GACrC,IAA4B,IAAxB5L,KAAKgrB,eACP,MAAM,IAAIzoB,MAAMqJ,EAAS,gDAO7Bqf,2BAAA,WACE,OAAOjrB,KAAK+qB,cAMdE,mBAAA,WAKE,OAJAtf,EAAiB,YAAa,EAAG,EAAGpE,UAAUzF,QAIvC,IAAImpB,EAAMzD,uBAAuBxnB,KAAK8qB,KAAM9qB,KAAK2U,OAU1DsW,eAAA,SACElR,EACApT,EACAmlB,EACAvf,GAEAZ,EAAiB,WAAY,EAAG,EAAGpE,UAAUzF,QAC7CgY,GAAkB,WAAY,EAAGC,GAAW,GAC5C1N,EAAiB,WAAY,EAAG1F,GAAU,GAE1C,IAAMolB,EAAMd,EAAMe,yBAChB,WACAF,EACAvf,GAGF,GAAkB,UAAdwN,EACF/Z,KAAKisB,aAAatlB,EAAUolB,EAAIG,OAAQH,EAAIxf,aACvC,CACL,IAAM4f,EAA8C,GACpDA,EAAUpS,GAAapT,EACvB3G,KAAKosB,aAAaD,EAAWJ,EAAIG,OAAQH,EAAIxf,SAE/C,OAAO5F,GASCskB,yBAAV,SACEtkB,EACA0lB,EACA9f,GAEA,IAAM+f,EAAY,IAAI7C,GACpB9iB,EACA0lB,GAAkB,KAClB9f,GAAW,MAEbvM,KAAK8qB,KAAKyB,yBAAyBvsB,KAAMssB,IAS3CrB,yBAAA,SACEkB,EACAE,EACA9f,GAEA,IAAM+f,EAAY,IAAIjC,GACpB8B,EACAE,EACA9f,GAEFvM,KAAK8qB,KAAKyB,yBAAyBvsB,KAAMssB,IAQ3CrB,gBAAA,SAAIlR,EAAoBpT,EAA6B4F,GACnDZ,EAAiB,YAAa,EAAG,EAAGpE,UAAUzF,QAC9CgY,GAAkB,YAAa,EAAGC,GAAW,GAC7C1N,EAAiB,YAAa,EAAG1F,GAAU,GAC3C2F,EAAsB,YAAa,EAAGC,GAAS,GAE/C,IAAI+f,EAAsC,KACtCH,EAAqD,KACvC,UAAdpS,EAEFuS,EAAY,IAAI7C,GADM9iB,GAAY,KAGhC,KACA4F,GAAW,MAEJwN,IACLpT,KACFwlB,EAAY,IACFpS,GAAapT,GAEzB2lB,EAAY,IAAIjC,GAAuB8B,EAAW,KAAM5f,GAAW,OAErEvM,KAAK8qB,KAAK0B,4BAA4BxsB,KAAMssB,IAW9CrB,iBAAA,SACElR,EACA0S,EACAC,EACAngB,GAJF,WAMEZ,EAAiB,aAAc,EAAG,EAAGpE,UAAUzF,QAC/CgY,GAAkB,aAAc,EAAGC,GAAW,GAC9C1N,EAAiB,aAAc,EAAGogB,GAAc,GAEhD,IAAMV,EAAMd,EAAMe,yBAChB,aACAU,EACAngB,GAOEogB,GAAY,EACVpS,EAAW,IAAI7T,EAGrB6T,EAASlU,QAAQO,MAAM,cAEvB,IAAMgmB,EAAe,SAAC5R,GAGhB2R,IACFA,GAAY,EACZlmB,EAAKomB,IAAI9S,EAAW6S,GAEhBH,GACFA,EAAa7c,KAAKmc,EAAIxf,QAAtBkgB,CAA+BzR,GAEjCT,EAAShU,QAAQyU,KAcrB,OAVAhb,KAAK8sB,GACH/S,EACA6S,EACY,SAAAplB,GACVf,EAAKomB,IAAI9S,EAAW6S,GAEhBb,EAAIG,QAAQH,EAAIG,OAAOtc,KAAKmc,EAAIxf,QAApBwf,CAA6BvkB,GAC7C+S,EAAS/T,OAAOgB,KAGb+S,EAASlU,SAQlB4kB,yBAAA,SAAa8B,GAEX,GADAphB,EAAiB,qBAAsB,EAAG,EAAGpE,UAAUzF,QAEpC,iBAAVirB,GACPnb,KAAKI,MAAM+a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAIxqB,MACR,kEAGJ,GAAIvC,KAAK+qB,aAAaa,WACpB,MAAM,IAAIrpB,MACR,uGAKJ,OAAO,IAAI0oB,EACTjrB,KAAK8qB,KACL9qB,KAAK2U,KACL3U,KAAK+qB,aAAaiC,aAAaD,GAC/B/sB,KAAKgrB,iBASTC,wBAAA,SAAY8B,GAEV,GADAphB,EAAiB,oBAAqB,EAAG,EAAGpE,UAAUzF,QAEnC,iBAAVirB,GACPnb,KAAKI,MAAM+a,KAAWA,GACtBA,GAAS,EAET,MAAM,IAAIxqB,MACR,iEAGJ,GAAIvC,KAAK+qB,aAAaa,WACpB,MAAM,IAAIrpB,MACR,sGAKJ,OAAO,IAAI0oB,EACTjrB,KAAK8qB,KACL9qB,KAAK2U,KACL3U,KAAK+qB,aAAakC,YAAYF,GAC9B/sB,KAAKgrB,iBASTC,yBAAA,SAAatW,GAEX,GADAhJ,EAAiB,qBAAsB,EAAG,EAAGpE,UAAUzF,QAC1C,SAAT6S,EACF,MAAM,IAAIpS,MACR,2EAEG,GAAa,cAAToS,EACT,MAAM,IAAIpS,MACR,qFAEG,GAAa,WAAToS,EACT,MAAM,IAAIpS,MACR,+EAGJ0X,GAAmB,qBAAsB,EAAGtF,GAAM,GAClD3U,KAAKktB,+BAA+B,sBACpC,IAAMC,EAAa,IAAI7Z,GAAKqB,GAC5B,GAAIwY,EAAWvjB,UACb,MAAM,IAAIrH,MACR,qFAGJ,IAAMgb,EAAQ,IAAIuK,GAAUqF,GACtBC,EAAYptB,KAAK+qB,aAAasC,QAAQ9P,GAG5C,OAFA0N,EAAMqC,wBAAwBF,GAEvB,IAAInC,EAAMjrB,KAAK8qB,KAAM9qB,KAAK2U,KAAMyY,GAA8B,IAOvEnC,uBAAA,WACEtf,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QACrD9B,KAAKktB,+BAA+B,oBACpC,IAAME,EAAYptB,KAAK+qB,aAAasC,QAAQlR,IAE5C,OADA8O,EAAMqC,wBAAwBF,GACvB,IAAInC,EAAMjrB,KAAK8qB,KAAM9qB,KAAK2U,KAAMyY,GAA8B,IAOvEnC,4BAAA,WACEtf,EAAiB,wBAAyB,EAAG,EAAGpE,UAAUzF,QAC1D9B,KAAKktB,+BAA+B,yBACpC,IAAME,EAAYptB,KAAK+qB,aAAasC,QAAQ7O,IAE5C,OADAyM,EAAMqC,wBAAwBF,GACvB,IAAInC,EAAMjrB,KAAK8qB,KAAM9qB,KAAK2U,KAAMyY,GAA8B,IAOvEnC,yBAAA,WACEtf,EAAiB,qBAAsB,EAAG,EAAGpE,UAAUzF,QACvD9B,KAAKktB,+BAA+B,sBACpC,IAAME,EAAYptB,KAAK+qB,aAAasC,QAAQ3F,IAE5C,OADAuD,EAAMqC,wBAAwBF,GACvB,IAAInC,EAAMjrB,KAAK8qB,KAAM9qB,KAAK2U,KAAMyY,GAA8B,IAQvEnC,oBAAA,SACErpB,EACA6F,gBADA7F,QAGA+J,EAAiB,gBAAiB,EAAG,EAAGpE,UAAUzF,QAClDkX,GAAwB,gBAAiB,EAAGpX,EAAO5B,KAAK2U,MAAM,GAC9DqF,GAAY,gBAAiB,EAAGvS,GAAM,GAEtC,IAAM2lB,EAAYptB,KAAK+qB,aAAawC,QAAQ3rB,EAAO6F,GAGnD,GAFAwjB,EAAMuC,eAAeJ,GACrBnC,EAAMqC,wBAAwBF,GAC1BptB,KAAK+qB,aAAaK,WACpB,MAAM,IAAI7oB,MACR,0FAUJ,YAJc4D,IAAVvE,IAEF6F,EADA7F,EAAQ,MAGH,IAAIqpB,EAAMjrB,KAAK8qB,KAAM9qB,KAAK2U,KAAMyY,EAAWptB,KAAKgrB,iBAQzDC,kBAAA,SACErpB,EACA6F,gBADA7F,QAGA+J,EAAiB,cAAe,EAAG,EAAGpE,UAAUzF,QAChDkX,GAAwB,cAAe,EAAGpX,EAAO5B,KAAK2U,MAAM,GAC5DqF,GAAY,cAAe,EAAGvS,GAAM,GAEpC,IAAM2lB,EAAYptB,KAAK+qB,aAAa0C,MAAM7rB,EAAO6F,GAGjD,GAFAwjB,EAAMuC,eAAeJ,GACrBnC,EAAMqC,wBAAwBF,GAC1BptB,KAAK+qB,aAAaO,SACpB,MAAM,IAAI/oB,MACR,oFAKJ,OAAO,IAAI0oB,EAAMjrB,KAAK8qB,KAAM9qB,KAAK2U,KAAMyY,EAAWptB,KAAKgrB,iBAUzDC,oBAAA,SAAQrpB,EAAyC6F,GAI/C,GAHAkE,EAAiB,gBAAiB,EAAG,EAAGpE,UAAUzF,QAClDkX,GAAwB,gBAAiB,EAAGpX,EAAO5B,KAAK2U,MAAM,GAC9DqF,GAAY,gBAAiB,EAAGvS,GAAM,GAClCzH,KAAK+qB,aAAaK,WACpB,MAAM,IAAI7oB,MACR,0FAIJ,GAAIvC,KAAK+qB,aAAaO,SACpB,MAAM,IAAI/oB,MACR,sFAIJ,OAAOvC,KAAKutB,QAAQ3rB,EAAO6F,GAAMgmB,MAAM7rB,EAAO6F,IAMhDwjB,qBAAA,WAGE,OAFAtf,EAAiB,iBAAkB,EAAG,EAAGpE,UAAUzF,QAE5C9B,KAAK8qB,KAAKtiB,WAAaxI,KAAK2U,KAAK+Y,sBAK1CzC,mBAAA,WAGE,OADAtf,EAAiB,eAAgB,EAAG,EAAGpE,UAAUzF,QAC1C9B,KAAKwI,YAOdyiB,wBAAA,WACE,OAAOjrB,KAAK+qB,aAAa4C,kBAM3B1C,4BAAA,WACE,IAAM3hB,EAAMtJ,KAAK4tB,cACXlhB,EAAKoE,GAAkBxH,GAC7B,MAAc,OAAPoD,EAAc,UAAYA,GAQnCue,oBAAA,SAAQxW,GAEN,GADA9I,EAAiB,gBAAiB,EAAG,EAAGpE,UAAUzF,UAC5C2S,aAAiBwW,GAAQ,CAG7B,MAAM,IAAI1oB,MADR,wFAIJ,IAAMsrB,EAAW7tB,KAAK8qB,OAASrW,EAAMqW,KAC/BgD,EAAW9tB,KAAK2U,KAAK2J,OAAO7J,EAAME,MAClCoZ,EACJ/tB,KAAKguB,oBAAsBvZ,EAAMuZ,kBAEnC,OAAOH,GAAYC,GAAYC,GAWlB9C,2BAAf,SACErf,EACA8gB,EACAngB,GAEA,IAAMwf,EAGF,CAAEG,OAAQ,KAAM3f,QAAS,MAC7B,GAAImgB,GAAmBngB,EACrBwf,EAAIG,OAASQ,EACbrgB,EAAiBT,EAAQ,EAAGmgB,EAAIG,QAAQ,GAExCH,EAAIxf,QAAUA,EACdD,EAAsBV,EAAQ,EAAGmgB,EAAIxf,SAAS,QACzC,GAAImgB,EAET,GAA+B,iBAApBA,GAAoD,OAApBA,EAEzCX,EAAIxf,QAAUmgB,MACT,CAAA,GAA+B,mBAApBA,EAGhB,MAAM,IAAInqB,MACR0J,EAAYL,EAAQ,GAAG,GACrB,0DAJJmgB,EAAIG,OAASQ,EAQjB,OAAOX,GAGTvsB,sBAAIyrB,uBAAJ,WACE,OAAOjrB,KAAK6oB,6DMhoBhB,aACE7oB,SAA0B,GA0E5B,OApEEiuB,gBAAA,SAAIC,EAASpgB,GACX9N,KAAK6P,IAAIqe,GAAuB,OAARpgB,GAAeA,GAOzCmgB,qBAAA,SAAS1lB,GACP,OAAOc,EAASrJ,KAAK6P,IAAKtH,IAO5B0lB,gBAAA,SAAIC,GACF,OAAOluB,KAAKqJ,SAAS6kB,GAAQluB,KAAK6P,IAAIqe,QAAe/nB,GAMvD8nB,mBAAA,SAAOC,UACEluB,KAAK6P,IAAIqe,IAMlBD,kBAAA,WACEjuB,KAAK6P,IAAM,IAOboe,oBAAA,WACE,OAAOrkB,EAAQ5J,KAAK6P,MAMtBoe,kBAAA,WACE,OAAOpkB,EAAS7J,KAAK6P,MAOvBoe,iBAAA,SAAKxkB,GACHD,EAAQxJ,KAAK6P,IAAK,SAAC7E,EAAMzJ,GAAS,OAAAkI,EAAGuB,EAAGzJ,MAO1C0sB,iBAAA,WACE,IAAMld,EAAY,GAIlB,OAHAvH,EAAQxJ,KAAK6P,IAAK,SAAC7E,GACjB+F,EAAKhP,KAAKiJ,KAEL+F,sBCtEX,aAKU/Q,YAAsB,KAMtBA,eAA2D,KAuIrE,OA/HEmuB,iBAAA,SAAKxZ,GACH,GAAmB,MAAf3U,KAAK2c,OACP,OAAO3c,KAAK2c,OAAO8H,SAAS9P,GACvB,GAAKA,EAAK/K,WAA+B,MAAlB5J,KAAKokB,UAUjC,OAAO,KATP,IAAMgK,EAAWzZ,EAAKX,WAEtB,OADAW,EAAOA,EAAKR,WACRnU,KAAKokB,UAAU/a,SAAS+kB,GACRpuB,KAAKokB,UAAUzc,IAAIymB,GACpBC,KAAK1Z,GAEf,MAcbwZ,qBAAA,SAASxZ,EAAY1M,GACnB,GAAI0M,EAAK/K,UACP5J,KAAK2c,OAAS1U,EACdjI,KAAKokB,UAAY,UACZ,GAAoB,OAAhBpkB,KAAK2c,OACd3c,KAAK2c,OAAS3c,KAAK2c,OAAOW,YAAY3I,EAAM1M,OACvC,CACiB,MAAlBjI,KAAKokB,YACPpkB,KAAKokB,UAAY,IAAI6J,IAGvB,IAAMG,EAAWzZ,EAAKX,WACjBhU,KAAKokB,UAAU/a,SAAS+kB,IAC3BpuB,KAAKokB,UAAUkK,IAAIF,EAAU,IAAID,GAGnC,IAAMjZ,EAAQlV,KAAKokB,UAAUzc,IAAIymB,GACjCzZ,EAAOA,EAAKR,WACZe,EAAMqZ,SAAS5Z,EAAM1M,KAUzBkmB,mBAAA,SAAOxZ,GACL,GAAIA,EAAK/K,UAGP,OAFA5J,KAAK2c,OAAS,OACd3c,KAAKokB,UAAY,MAGjB,GAAoB,OAAhBpkB,KAAK2c,OAAiB,CACxB,GAAI3c,KAAK2c,OAAOF,aAEd,OAAO,EAEP,IAAM7a,EAAQ5B,KAAK2c,OACnB3c,KAAK2c,OAAS,KAEd,IAAM6R,EAAOxuB,KAKb,OAJA4B,EAAMojB,aAAaxG,GAAgB,SAASjW,EAAKkmB,GAC/CD,EAAKD,SAAS,IAAIjb,GAAK/K,GAAMkmB,KAGxBzuB,KAAK0uB,OAAO/Z,GAEhB,GAAuB,OAAnB3U,KAAKokB,UAmBd,OAAO,EAlBP,IAAMgK,EAAWzZ,EAAKX,WAWtB,OAVAW,EAAOA,EAAKR,WACRnU,KAAKokB,UAAU/a,SAAS+kB,IACJpuB,KAAKokB,UAAUzc,IACnCymB,GACuBM,OAAO/Z,IAE9B3U,KAAKokB,UAAUtU,OAAOse,KAItBpuB,KAAKokB,UAAUxa,aACjB5J,KAAKokB,UAAY,OAkBzB+J,wBAAA,SAAYQ,EAAkBC,GACR,OAAhB5uB,KAAK2c,OACPiS,EAAKD,EAAY3uB,KAAK2c,QAEtB3c,KAAKglB,aAAa,SAACzc,EAAKkmB,GACtB,IAAM9Z,EAAO,IAAIrB,GAAKqb,EAAWnmB,WAAa,IAAMD,GACpDkmB,EAAKI,YAAYla,EAAMia,MAU7BT,yBAAA,SAAaS,GACY,OAAnB5uB,KAAKokB,WACPpkB,KAAKokB,UAAU9S,KAAK,SAAC/I,EAAKkmB,GACxBG,EAAKrmB,EAAKkmB,WCzHLK,GAAuB,SAClCltB,EACAmtB,GAEA,OAAKntB,GAA0B,iBAAVA,GAGnBO,EAAO,QAASP,EAAO,6CAChBmtB,EAAantB,EAAM,SAHnBA,GAoCEotB,GAA+B,SAC1CzT,EACAwT,GAEA,IAOInT,EAPEqT,EAAS1T,EAAKmB,cAAc5O,MAM5BiL,EAAW+V,GAAqBG,EAAQF,GAG9C,GAAIxT,EAAKkB,aAAc,CACrB,IAAMyS,EAAW3T,EACX3Z,EAAQktB,GAAqBI,EAASvR,WAAYoR,GACxD,OACEntB,IAAUstB,EAASvR,YACnB5E,IAAamW,EAASxS,cAAc5O,MAE7B,IAAI+O,GAASjb,EAAOya,GAAatD,IAEjCwC,EAGT,IAAM4T,EAAe5T,EAcrB,OAZIxC,KADJ6C,EAAUuT,GACoBzS,cAAc5O,QAC1C8N,EAAUA,EAAQuB,eAAe,IAAIN,GAAS9D,KAEhDoW,EAAanK,aAAaxG,GAAgB,SAASxB,EAAWC,GAC5D,IAAMC,EAAe8R,GACnB/R,EACA8R,GAEE7R,IAAiBD,IACnBrB,EAAUA,EAAQwB,qBAAqBJ,EAAWE,MAG/CtB,IPxGC6L,GAAAA,KAAAA,oCAEVA,uBACAA,yCACAA,2CAoCF,IQ1CI2H,GCUA5H,iBTiCF,WACS6H,EACAC,EACAC,EACAC,GAHAxvB,cAAAqvB,EACArvB,gBAAAsvB,EACAtvB,aAAAuvB,EACAvvB,YAAAwvB,EAEPrtB,GAAQqtB,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,uBUrEhB,WAC2B5a,EACA+a,EACAC,GAFA3vB,UAAA2U,EACA3U,kBAAA0vB,EACA1vB,YAAA2vB,EAd3B3vB,UAAOynB,GAAcmI,eAGrB5vB,YAASyvB,GAAgBI,KAwC3B,OAvBEC,8BAAA,SAAkB9S,GAChB,GAAKhd,KAAK2U,KAAK/K,UAUR,CAAA,GAA+B,MAA3B5J,KAAK0vB,aAAa9tB,MAM3B,OALAO,EACEnC,KAAK0vB,aAAaK,SAASnmB,UAC3B,4DAGK5J,KAEP,IAAMsiB,EAAYtiB,KAAK0vB,aAAaM,QAAQ,IAAI1c,GAAK0J,IACrD,OAAO,IAAI8S,EAAaxc,GAAK2c,MAAO3N,EAAWtiB,KAAK2vB,QAdpD,OAJAxtB,EACEnC,KAAK2U,KAAKX,aAAegJ,EACzB,iDAEK,IAAI8S,EACT9vB,KAAK2U,KAAKR,WACVnU,KAAK0vB,aACL1vB,KAAK2vB,4BFUX,WACkB/tB,EACAmuB,gBAlCbX,KACHA,GAAyB,IAAI5P,GAC3B5O,KAgCcmf,EA7BXX,IA4BWpvB,WAAA4B,EACA5B,cAAA+vB,EA4UpB,OA3VSG,aAAP,SAAqB5mB,GACnB,IAAImlB,EAAyByB,EAAcD,MAI3C,OAHAzmB,EAAQF,EAAK,SAACmf,EAAmB0H,GAC/B1B,EAAOA,EAAK5e,IAAI,IAAIyD,GAAKmV,GAAY0H,KAEhC1B,GAoBTyB,oBAAA,WACE,OAAsB,OAAflwB,KAAK4B,OAAkB5B,KAAK+vB,SAASnmB,WAe9CsmB,6CAAA,SACEhc,EACAkc,GAEA,GAAkB,MAAdpwB,KAAK4B,OAAiBwuB,EAAUpwB,KAAK4B,OACvC,MAAO,CAAE+S,KAAMrB,GAAK2c,MAAOruB,MAAO5B,KAAK4B,OAEvC,GAAIsS,EAAatK,UACf,OAAO,KAEP,IAAMyT,EAAQnJ,EAAaF,WACrBkB,EAAQlV,KAAK+vB,SAASpoB,IAAI0V,GAChC,GAAc,OAAVnI,EAcF,OAAO,KAbP,IAAMmb,EAA4Bnb,EAAMob,iCACtCpc,EAAaC,WACbic,GAEF,OAAiC,MAA7BC,EAMK,KAFA,CAAE1b,KAHQ,IAAIrB,GAAK+J,GAAOnI,MAC/Bmb,EAA0B1b,MAEH/S,MAAOyuB,EAA0BzuB,QAiBpEsuB,qCAAA,SACEhc,GAEA,OAAOlU,KAAKswB,iCAAiCpc,EAAc,WAAM,OAAA,KAOnEgc,oBAAA,SAAQhc,GACN,GAAIA,EAAatK,UACf,OAAO5J,KAEP,IAAMqd,EAAQnJ,EAAaF,WACrBsO,EAAYtiB,KAAK+vB,SAASpoB,IAAI0V,GACpC,OAAkB,OAAdiF,EACKA,EAAU0N,QAAQ9b,EAAaC,YAE/B+b,EAAcD,OAY3BC,gBAAA,SAAIhc,EAAoBqc,GACtB,GAAIrc,EAAatK,UACf,OAAO,IAAIsmB,EAAcK,EAAOvwB,KAAK+vB,UAErC,IAAM1S,EAAQnJ,EAAaF,WAErBwc,GADQxwB,KAAK+vB,SAASpoB,IAAI0V,IAAU6S,EAAcD,OACjCpgB,IAAIqE,EAAaC,WAAYoc,GAC9CtM,EAAcjkB,KAAK+vB,SAAShQ,OAAO1C,EAAOmT,GAChD,OAAO,IAAIN,EAAclwB,KAAK4B,MAAOqiB,IAUzCiM,mBAAA,SAAOhc,GACL,GAAIA,EAAatK,UACf,OAAI5J,KAAK+vB,SAASnmB,UACTsmB,EAAcD,MAEd,IAAIC,EAAc,KAAMlwB,KAAK+vB,UAGtC,IAAM1S,EAAQnJ,EAAaF,WACrBkB,EAAQlV,KAAK+vB,SAASpoB,IAAI0V,GAChC,GAAInI,EAAO,CACT,IAAMsb,EAAWtb,EAAMpF,OAAOoE,EAAaC,YACvC8P,SAMJ,OAJEA,EADEuM,EAAS5mB,UACG5J,KAAK+vB,SAASjgB,OAAOuN,GAErBrd,KAAK+vB,SAAShQ,OAAO1C,EAAOmT,GAEzB,OAAfxwB,KAAK4B,OAAkBqiB,EAAYra,UAC9BsmB,EAAcD,MAEd,IAAIC,EAAclwB,KAAK4B,MAAOqiB,GAGvC,OAAOjkB,MAWbkwB,gBAAA,SAAIhc,GACF,GAAIA,EAAatK,UACf,OAAO5J,KAAK4B,MAEZ,IAAMyb,EAAQnJ,EAAaF,WACrBkB,EAAQlV,KAAK+vB,SAASpoB,IAAI0V,GAChC,OAAInI,EACKA,EAAMvN,IAAIuM,EAAaC,YAEvB,MAYb+b,oBAAA,SAAQhc,EAAoBuc,GAC1B,GAAIvc,EAAatK,UACf,OAAO6mB,EAEP,IAAMpT,EAAQnJ,EAAaF,WAErBwc,GADQxwB,KAAK+vB,SAASpoB,IAAI0V,IAAU6S,EAAcD,OACjCS,QAAQxc,EAAaC,WAAYsc,GACpDxM,SAMJ,OAJEA,EADEuM,EAAS5mB,UACG5J,KAAK+vB,SAASjgB,OAAOuN,GAErBrd,KAAK+vB,SAAShQ,OAAO1C,EAAOmT,GAErC,IAAIN,EAAclwB,KAAK4B,MAAOqiB,IAYzCiM,iBAAA,SAAQzmB,GACN,OAAOzJ,KAAK2wB,MAAMrd,GAAK2c,MAAOxmB,IAWxBymB,kBAAR,SACEU,EACAnnB,GAEA,IAAMonB,EAA4B,GAOlC,OANA7wB,KAAK+vB,SAASrQ,iBAAiB,SAC7B0O,EACA9L,GAEAuO,EAAMzC,GAAY9L,EAAUqO,MAAMC,EAAU1b,MAAMkZ,GAAW3kB,KAExDA,EAAGmnB,EAAW5wB,KAAK4B,MAAOivB,IAUnCX,uBAAA,SAAcvb,EAAYpU,GACxB,OAAOP,KAAK8wB,YAAYnc,EAAMrB,GAAK2c,MAAO1vB,IAGpC2vB,wBAAR,SACEa,EACAH,EACArwB,GAEA,IAAM6e,IAASpf,KAAK4B,OAAQrB,EAAEqwB,EAAW5wB,KAAK4B,OAC9C,GAAIwd,EACF,OAAOA,EAEP,GAAI2R,EAAannB,UACf,OAAO,KAEP,IAAMyT,EAAQ0T,EAAa/c,WACrBgd,EAAYhxB,KAAK+vB,SAASpoB,IAAI0V,GACpC,OAAI2T,EACKA,EAAUF,YACfC,EAAa5c,WACbyc,EAAU1b,MAAMmI,GAChB9c,GAGK,MAYf2vB,0BAAA,SACEvb,EACApU,GAEA,OAAOP,KAAKixB,eAAetc,EAAMrB,GAAK2c,MAAO1vB,IAGvC2vB,2BAAR,SACEa,EACAG,EACA3wB,GAEA,GAAIwwB,EAAannB,UACf,OAAO5J,KAEHA,KAAK4B,OACPrB,EAAE2wB,EAAqBlxB,KAAK4B,OAE9B,IAAMyb,EAAQ0T,EAAa/c,WACrBgd,EAAYhxB,KAAK+vB,SAASpoB,IAAI0V,GACpC,OAAI2T,EACKA,EAAUC,eACfF,EAAa5c,WACb+c,EAAoBhc,MAAMmI,GAC1B9c,GAGK2vB,EAAcD,OAY3BC,oBAAA,SAAQ3vB,GACNP,KAAKmxB,SAAS7d,GAAK2c,MAAO1vB,IAGpB2vB,qBAAR,SACEgB,EACA3wB,GAEAP,KAAK+vB,SAASrQ,iBAAiB,SAAS1C,EAAWsF,GACjDA,EAAU6O,SAASD,EAAoBhc,MAAM8H,GAAYzc,KAEvDP,KAAK4B,OACPrB,EAAE2wB,EAAqBlxB,KAAK4B,QAQhCsuB,yBAAA,SAAa3vB,GACXP,KAAK+vB,SAASrQ,iBACZ,SAAC1C,EAAmBsF,GACdA,EAAU1gB,OACZrB,EAAEyc,EAAWsF,EAAU1gB,UA7VxBsuB,QAAQ,IAAIA,EAAmB,yBGbtC,WAAmBnqB,EAAgC4O,GAAhC3U,YAAA+F,EAAgC/F,UAAA2U,EAFnD3U,UAAOynB,GAAc2J,gBAWvB,OAPEC,8BAAA,SAAkBrU,GAChB,OAAIhd,KAAK2U,KAAK/K,UACL,IAAIynB,EAAerxB,KAAK+F,OAAQuN,GAAK2c,OAErC,IAAIoB,EAAerxB,KAAK+F,OAAQ/F,KAAK2U,KAAKR,gCCJrD,WACSpO,EACA4O,EACAoT,GAFA/nB,YAAA+F,EACA/F,UAAA2U,EACA3U,UAAA+nB,EALT/nB,UAAOynB,GAAc6J,UAmBvB,OAXEC,8BAAA,SAAkBvU,GAChB,OAAIhd,KAAK2U,KAAK/K,UACL,IAAI2nB,EACTvxB,KAAK+F,OACLuN,GAAK2c,MACLjwB,KAAK+nB,KAAKvD,kBAAkBxH,IAGvB,IAAIuU,EAAUvxB,KAAK+F,OAAQ/F,KAAK2U,KAAKR,WAAYnU,KAAK+nB,0BCXjE,WAC2BhiB,EACA4O,EACAob,GAFA/vB,YAAA+F,EACA/F,UAAA2U,EACA3U,cAAA+vB,EAL3B/vB,UAAOynB,GAAc+J,MA+CvB,OApCEC,8BAAA,SAAkBzU,GAChB,GAAIhd,KAAK2U,KAAK/K,UAAW,CACvB,IAAM0Y,EAAYtiB,KAAK+vB,SAASC,QAAQ,IAAI1c,GAAK0J,IACjD,OAAIsF,EAAU1Y,UAEL,KACE0Y,EAAU1gB,MAEZ,IAAI2vB,GAAUvxB,KAAK+F,OAAQuN,GAAK2c,MAAO3N,EAAU1gB,OAGjD,IAAI6vB,EAAMzxB,KAAK+F,OAAQuN,GAAK2c,MAAO3N,GAO5C,OAJAngB,EACEnC,KAAK2U,KAAKX,aAAegJ,EACzB,kEAEK,IAAIyU,EAAMzxB,KAAK+F,OAAQ/F,KAAK2U,KAAKR,WAAYnU,KAAK+vB,WAO7D0B,qBAAA,WACE,MACE,aACAzxB,KAAK2U,KACL,KACA3U,KAAK+F,OAAOyC,WACZ,WACAxI,KAAK+vB,SAASvnB,WACd,wBC7CJ,WACU2f,EACAuJ,EACAC,GAFA3xB,WAAAmoB,EACAnoB,uBAAA0xB,EACA1xB,eAAA2xB,EAgDZ,OAzCEC,+BAAA,WACE,OAAO5xB,KAAK0xB,mBAOdE,uBAAA,WACE,OAAO5xB,KAAK2xB,WAOdC,8BAAA,SAAkBjd,GAChB,GAAIA,EAAK/K,UACP,OAAO5J,KAAK6xB,uBAAyB7xB,KAAK2xB,UAG5C,IAAMvD,EAAWzZ,EAAKX,WACtB,OAAOhU,KAAK8xB,mBAAmB1D,IAOjCwD,+BAAA,SAAmBrpB,GACjB,OACGvI,KAAK6xB,uBAAyB7xB,KAAK2xB,WAAc3xB,KAAKmoB,MAAM4J,SAASxpB,IAO1EqpB,oBAAA,WACE,OAAO5xB,KAAKmoB,0BC/Cd,WACmB6J,EACAC,GADAjyB,iBAAAgyB,EACAhyB,kBAAAiyB,EAqFrB,OA3DEC,4BAAA,SACEC,EACAC,EACAC,GAEA,OAAO,IAAIH,EACT,IAAIN,GAAUO,EAAWC,EAAUC,GACnCryB,KAAKiyB,eAUTC,6BAAA,SACEI,EACAF,EACAC,GAEA,OAAO,IAAIH,EACTlyB,KAAKgyB,YACL,IAAIJ,GAAUU,EAAYF,EAAUC,KAOxCH,0BAAA,WACE,OAAOlyB,KAAKgyB,aAMdE,iCAAA,WACE,OAAOlyB,KAAKgyB,YAAYH,qBACpB7xB,KAAKgyB,YAAYO,UACjB,MAMNL,2BAAA,WACE,OAAOlyB,KAAKiyB,cAMdC,kCAAA,WACE,OAAOlyB,KAAKiyB,aAAaJ,qBACrB7xB,KAAKiyB,aAAaM,UAClB,MA5ECL,QAAQ,IAAIA,EACjB,IAAIN,GACFtN,GAAaxH,YACS,GACR,GAEhB,IAAI8U,GACFtN,GAAaxH,YACS,GACR,uBCvBlB,WACSxG,EACAwT,EACA9M,EACAwV,EACAzJ,GAJA/oB,UAAAsW,EACAtW,kBAAA8pB,EACA9pB,eAAAgd,EACAhd,aAAAwyB,EACAxyB,cAAA+oB,EAmEX,OA5DS0J,cAAP,SAAmBzX,GACjB,OAAO,IAAIyX,EAAOA,EAAOC,MAAO1X,IAQ3ByX,mBAAP,SAAwBrE,EAAkBpT,GACxC,OAAO,IAAIyX,EAAOA,EAAOE,YAAa3X,EAAUoT,IAQ3CqE,qBAAP,SAA0BrE,EAAkBpT,GAC1C,OAAO,IAAIyX,EAAOA,EAAOG,cAAe5X,EAAUoT,IAS7CqE,qBAAP,SACErE,EACAyE,EACAC,GAEA,OAAO,IAAIL,EAAOA,EAAOM,cAAeF,EAAazE,EAAU0E,IAQ1DL,mBAAP,SAAwBrE,EAAkBpT,GACxC,OAAO,IAAIyX,EAAOA,EAAOO,YAAahY,EAAUoT,IAK3CqE,cAAc,cAGdA,gBAAgB,gBAGhBA,gBAAgB,gBAGhBA,cAAc,cAGdA,QAAQ,2BChEf,WAA6BpK,GAAAroB,YAAAqoB,EAkI/B,OAhIE4K,wBAAA,SACElL,EACAxf,EACAioB,EACA0C,EACAntB,EACAotB,GAEAhxB,EACE4lB,EAAKqL,UAAUpzB,KAAKqoB,QACpB,qDAEF,IAAMgL,EAAWtL,EAAKvD,kBAAkBjc,GAExC,OACE8qB,EAAS5O,SAASyO,GAAc5U,OAAOkS,EAAS/L,SAASyO,KAKrDG,EAASzpB,WAAa4mB,EAAS5mB,UAK1Bme,GAIiB,MAAxBoL,IACE3C,EAAS5mB,UACPme,EAAKgK,SAASxpB,GAChB4qB,EAAqBG,iBACnBb,GAAOc,mBAAmBhrB,EAAK8qB,IAGjClxB,EACE4lB,EAAKtL,aACL,uEAGK4W,EAASzpB,UAClBupB,EAAqBG,iBACnBb,GAAOe,iBAAiBjrB,EAAKioB,IAG/B2C,EAAqBG,iBACnBb,GAAOgB,mBAAmBlrB,EAAKioB,EAAU6C,KAI3CtL,EAAKtL,cAAgB+T,EAAS5mB,UACzBme,EAGAA,EAAK3K,qBAAqB7U,EAAKioB,GAAUkD,UAAU1zB,KAAKqoB,UAOnE4K,2BAAA,SACET,EACAmB,EACAR,GA6BA,OA3B4B,MAAxBA,IACGX,EAAQ/V,cACX+V,EAAQxN,aAAaxG,GAAgB,SAASjW,EAAK0U,GAC5C0W,EAAQ5B,SAASxpB,IACpB4qB,EAAqBG,iBACnBb,GAAOc,mBAAmBhrB,EAAK0U,MAKlC0W,EAAQlX,cACXkX,EAAQ3O,aAAaxG,GAAgB,SAASjW,EAAK0U,GACjD,GAAIuV,EAAQT,SAASxpB,GAAM,CACzB,IAAM8qB,EAAWb,EAAQhO,kBAAkBjc,GACtC8qB,EAAS/U,OAAOrB,IACnBkW,EAAqBG,iBACnBb,GAAOgB,mBAAmBlrB,EAAK0U,EAAWoW,SAI9CF,EAAqBG,iBACnBb,GAAOe,iBAAiBjrB,EAAK0U,OAMhC0W,EAAQD,UAAU1zB,KAAKqoB,SAMhC4K,2BAAA,SAAeT,EAAeoB,GAC5B,OAAIpB,EAAQ5oB,UACH0a,GAAaxH,WAEb0V,EAAQrV,eAAeyW,IAOlCX,yBAAA,WACE,OAAO,GAMTA,6BAAA,WACE,OAAOjzB,MAMTizB,qBAAA,WACE,OAAOjzB,KAAKqoB,2BC5IhB,aACUroB,gBAAsC,GA4EhD,OAvEE6zB,6BAAA,SAAiBnK,GACf,IAAMpT,EAAOoT,EAAOpT,KACd8X,EAAkC1E,EAAO1M,UAC/C7a,EACEmU,GAAQmc,GAAOE,aACbrc,GAAQmc,GAAOM,eACfzc,GAAQmc,GAAOG,cACjB,6CAEFzwB,EACe,cAAbisB,EACA,mDAEF,IAAM0F,EAAYvqB,EAAQvJ,KAAK+zB,WAAY3F,GAC3C,GAAI0F,EAAW,CACb,IAAME,EAAUF,EAAUxd,KAC1B,GAAIA,GAAQmc,GAAOE,aAAeqB,GAAWvB,GAAOG,cAClD5yB,KAAK+zB,WAAW3F,GAAYqE,GAAOgB,mBACjCrF,EACA1E,EAAOI,aACPgK,EAAUhK,mBAEP,GACLxT,GAAQmc,GAAOG,eACfoB,GAAWvB,GAAOE,mBAEX3yB,KAAK+zB,WAAW3F,QAClB,GACL9X,GAAQmc,GAAOG,eACfoB,GAAWvB,GAAOM,cAElB/yB,KAAK+zB,WAAW3F,GAAYqE,GAAOc,mBACjCnF,EACA0F,EAAUtB,cAEP,GACLlc,GAAQmc,GAAOM,eACfiB,GAAWvB,GAAOE,YAElB3yB,KAAK+zB,WAAW3F,GAAYqE,GAAOe,iBACjCpF,EACA1E,EAAOI,kBAEJ,CAAA,GACLxT,GAAQmc,GAAOM,eACfiB,GAAWvB,GAAOM,cAQlB,MAAMzwB,EACJ,mCACEonB,EACA,mBACAoK,GAVJ9zB,KAAK+zB,WAAW3F,GAAYqE,GAAOgB,mBACjCrF,EACA1E,EAAOI,aACPgK,EAAUtB,eAWdxyB,KAAK+zB,WAAW3F,GAAY1E,GAOhCmK,uBAAA,WACE,OjDoBqB,SAASvqB,GAChC,IAAIW,EAAM,GACNtH,EAAI,EACR,IAAK,IAAI4F,KAAOe,EACdW,EAAItH,KAAO2G,EAAIf,GAEjB,OAAO0B,EiD1BEgqB,CAAUj0B,KAAK+zB,kBChBbG,GAA2B,eAzBxC,cAkBA,OAdEC,6BAAA,SAAiB/F,GACf,OAAO,MAMT+F,+BAAA,SACE5W,EACArI,EACA/C,GAEA,OAAO,0BAwBT,WACUiiB,EACAC,EACAC,gBAAAA,QAFAt0B,aAAAo0B,EACAp0B,gBAAAq0B,EACAr0B,6BAAAs0B,EA4CZ,OAtCEC,6BAAA,SAAiBnG,GACf,IAAM7S,EAAOvb,KAAKq0B,WAAWG,gBAC7B,GAAIjZ,EAAKuW,mBAAmB1D,GAC1B,OAAO7S,EAAKgX,UAAU/N,kBAAkB4J,GAExC,IAAMqG,EAC4B,MAAhCz0B,KAAKs0B,wBACD,IAAI1C,GAAU5xB,KAAKs0B,yBAAyB,GAAM,GAClDt0B,KAAKq0B,WAAWK,iBACtB,OAAO10B,KAAKo0B,QAAQO,kBAAkBvG,EAAUqG,IAOpDF,+BAAA,SACEhX,EACArI,EACA/C,GAEA,IAAMyiB,EAC4B,MAAhC50B,KAAKs0B,wBACDt0B,KAAKs0B,wBACLt0B,KAAKq0B,WAAWQ,wBAChBC,EAAQ90B,KAAKo0B,QAAQW,iBACzBH,EACA1f,EACA,EACA/C,EACAoL,GAEF,OAAqB,IAAjBuX,EAAMhzB,OACD,KAEAgzB,EAAM,YC/FjB,SACkBE,EACAC,GADAj1B,eAAAg1B,EACAh1B,aAAAi1B,iBAWlB,WAA6BC,GAAAl1B,aAAAk1B,EA+2B/B,OA12BEC,0BAAA,SAAcH,GACZ7yB,EACE6yB,EACGR,gBACAjC,UACAa,UAAUpzB,KAAKk1B,QAAQrL,YAC1B,0BAEF1nB,EACE6yB,EACGN,iBACAnC,UACAa,UAAUpzB,KAAKk1B,QAAQrL,YAC1B,4BAWJsL,2BAAA,SACEC,EACAC,EACAC,EACAC,GAEA,IACIC,EAAcC,EADZC,EAAc,IAAI7B,GAExB,GAAIwB,EAAU/e,OAASmR,GAAc6J,UAAW,CAC9C,IAAMqE,EAAYN,EAEhBG,EADEG,EAAU5vB,OAAOspB,SACJrvB,KAAK41B,oBAClBR,EACAO,EAAUhhB,KACVghB,EAAU5N,KACVuN,EACAC,EACAG,IAGFvzB,EAAOwzB,EAAU5vB,OAAOupB,WAAY,mBAIpCmG,EACEE,EAAU5vB,OAAOypB,QAChB4F,EAAaV,iBAAiBmB,eAC5BF,EAAUhhB,KAAK/K,UACL5J,KAAK81B,sBAClBV,EACAO,EAAUhhB,KACVghB,EAAU5N,KACVuN,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAU/e,OAASmR,GAAc+J,MAAO,CACjD,IAAMuE,EAAQV,EAEZG,EADEO,EAAMhwB,OAAOspB,SACArvB,KAAKg2B,gBAClBZ,EACAW,EAAMphB,KACNohB,EAAMhG,SACNuF,EACAC,EACAG,IAGFvzB,EAAO4zB,EAAMhwB,OAAOupB,WAAY,mBAEhCmG,EACEM,EAAMhwB,OAAOypB,QAAU4F,EAAaV,iBAAiBmB,aACxC71B,KAAKi2B,kBAClBb,EACAW,EAAMphB,KACNohB,EAAMhG,SACNuF,EACAC,EACAE,EACAC,SAGC,GAAIL,EAAU/e,OAASmR,GAAcmI,eAAgB,CAC1D,IAAMsG,EAAeb,EAWnBG,EAVGU,EAAavG,OAUD3vB,KAAKm2B,iBAClBf,EACAc,EAAavhB,KACb2gB,EACAC,EACAG,GAda11B,KAAKo2B,cAClBhB,EACAc,EAAavhB,KACbuhB,EAAaxG,aACb4F,EACAC,EACAG,OAWC,CAAA,GAAIL,EAAU/e,OAASmR,GAAc2J,gBAQ1C,MAAM9uB,EAAe,2BAA6B+yB,EAAU/e,MAP5Dkf,EAAex1B,KAAKq2B,gBAClBjB,EACAC,EAAU1gB,KACV2gB,EACAI,GAKJ,IAAMT,EAAUS,EAAYY,aAE5B,OADAnB,EAAcoB,oBAAoBnB,EAAcI,EAAcP,GACvD,IAAIuB,GAAgBhB,EAAcP,IAS5BE,sBAAf,SACEC,EACAI,EACAE,GAEA,IAAMvD,EAAYqD,EAAahB,gBAC/B,GAAIrC,EAAUN,qBAAsB,CAClC,IAAM4E,EACJtE,EAAUI,UAAU9V,cAAgB0V,EAAUI,UAAU3oB,UACpD8sB,EAAkBtB,EAAauB,wBAEd,EAArBjB,EAAY5zB,SACXszB,EAAaZ,gBAAgB3C,sBAC7B4E,IACEtE,EACEI,UACAjU,YACJ6T,EACEI,UACA7V,cACA4B,OAAOoY,EAAgBha,iBAE1BgZ,EAAY3zB,KACV0wB,GAAOmE,YACgBpB,EAAamB,2BAgBpCxB,gDAAR,SACEH,EACA6B,EACAvB,EACAvvB,EACA2vB,GAEA,IAAMoB,EAAe9B,EAAUR,gBAC/B,GAA8C,MAA1Cc,EAAYyB,eAAeF,GAE7B,OAAO7B,EAEP,IAAIgC,SAAevC,SACnB,GAAIoC,EAAWjtB,UAMb,GAJAzH,EACE6yB,EAAUN,iBAAiB7C,qBAC3B,8DAEEmD,EAAUN,iBAAiBmB,aAAc,CAI3C,IAAMoB,EAAcjC,EAAUH,wBACxBqC,EACJD,aAAuB3S,GACnB2S,EACA3S,GAAaxH,WACbqa,EAAwB7B,EAAY8B,0BACxCF,GAEFF,EAAgBh3B,KAAKk1B,QAAQmC,eAC3BrC,EAAUR,gBAAgBjC,UAC1B4E,EACAzB,OAEG,CACL,IAAM4B,EAAehC,EAAYiC,uBAC/BvC,EAAUH,yBAEZmC,EAAgBh3B,KAAKk1B,QAAQmC,eAC3BrC,EAAUR,gBAAgBjC,UAC1B+E,EACA5B,OAGC,CACL,IAAMtH,EAAWyI,EAAW7iB,WAC5B,GAAgB,aAAZoa,EAAyB,CAC3BjsB,EAC4B,GAA1B00B,EAAWniB,YACX,yDAEF,IAAM8iB,EAAeV,EAAavE,UAClCkC,EAAaO,EAAUN,iBAAiBnC,UAExC,IAAMkF,EAAkBnC,EAAYoC,mCAClCb,EACAW,EACA/C,GAGAuC,EADqB,MAAnBS,EACcz3B,KAAKk1B,QAAQ/X,eAC3Bqa,EACAC,GAIcX,EAAavE,cAE1B,CACL,IAAMoF,EAAkBd,EAAW1iB,WAE/ByjB,SACJ,GAAId,EAAahF,mBAAmB1D,GAAW,CAC7CqG,EAAaO,EAAUN,iBAAiBnC,UACxC,IAAMsF,EAAmBvC,EAAYoC,mCACnCb,EACAC,EAAavE,UACbkC,GAGAmD,EADsB,MAApBC,EACcf,EACbvE,UACA/N,kBAAkB4J,GAClB9Q,YAAYqa,EAAiBE,GAGhBf,EACbvE,UACA/N,kBAAkB4J,QAGvBwJ,EAAgBtC,EAAYX,kBAC1BvG,EACA4G,EAAUN,kBAIZsC,EADmB,MAAjBY,EACc53B,KAAKk1B,QAAQ5X,YAC3BwZ,EAAavE,UACbnE,EACAwJ,EACAD,EACA5xB,EACA2vB,GAIcoB,EAAavE,WAInC,OAAOyC,EAAU8C,gBACfd,EACAF,EAAajF,sBAAwBgF,EAAWjtB,UAChD5J,KAAKk1B,QAAQ6C,iBAgBnB5C,kCAAA,SACEC,EACAyB,EACAmB,EACA1C,EACAC,EACAE,EACAC,GAEA,IACIuC,EADEC,EAAgB9C,EAAaV,iBAE7ByD,EAAe1C,EACjBz1B,KAAKk1B,QACLl1B,KAAKk1B,QAAQkD,mBACjB,GAAIvB,EAAWjtB,UACbquB,EAAiBE,EAAad,eAC5Ba,EAAc3F,UACdyF,EACA,WAEG,GAAIG,EAAaJ,iBAAmBG,EAAcrC,aAAc,CAErE,IAAMwC,EAAgBH,EACnB3F,UACAjV,YAAYuZ,EAAYmB,GAC3BC,EAAiBE,EAAad,eAC5Ba,EAAc3F,UACd8F,EACA,UAEG,CACL,IAAMjK,EAAWyI,EAAW7iB,WAC5B,IACGkkB,EAAcI,kBAAkBzB,IACR,EAAzBA,EAAWniB,YAGX,OAAO0gB,EAET,IAAMuC,EAAkBd,EAAW1iB,WAE7B+I,EADYgb,EAAc3F,UAAU/N,kBAAkB4J,GAC7B9Q,YAAYqa,EAAiBK,GAE1DC,EADc,aAAZ7J,EACe+J,EAAahb,eAC5B+a,EAAc3F,UACdrV,GAGeib,EAAa7a,YAC5B4a,EAAc3F,UACdnE,EACAlR,EACAya,EACAzD,GACA,MAIN,IAAMsB,EAAeJ,EAAamD,iBAChCN,EACAC,EAAcrG,sBAAwBgF,EAAWjtB,UACjDuuB,EAAaJ,gBAEThyB,EAAS,IAAIwuB,GACjBe,EACAE,EACAD,GAEF,OAAOv1B,KAAKw4B,oCACVhD,EACAqB,EACAvB,EACAvvB,EACA2vB,IAcJP,gCAAA,SACEC,EACAyB,EACAmB,EACA1C,EACAC,EACAG,GAEA,IACIF,EAAcwB,EADZF,EAAe1B,EAAaZ,gBAE5BzuB,EAAS,IAAIwuB,GACjBe,EACAF,EACAG,GAEF,GAAIsB,EAAWjtB,UACbotB,EAAgBh3B,KAAKk1B,QAAQmC,eAC3BjC,EAAaZ,gBAAgBjC,UAC7ByF,EACAtC,GAEFF,EAAeJ,EAAa0C,gBAC1Bd,GACA,EACAh3B,KAAKk1B,QAAQ6C,oBAEV,CACL,IAAM3J,EAAWyI,EAAW7iB,WAC5B,GAAiB,cAAboa,EACF4I,EAAgBh3B,KAAKk1B,QAAQ/X,eAC3BiY,EAAaZ,gBAAgBjC,UAC7ByF,GAEFxC,EAAeJ,EAAa0C,gBAC1Bd,EACAF,EAAajF,qBACbiF,EAAajB,kBAEV,CACL,IAAM8B,EAAkBd,EAAW1iB,WAC7Bkf,EAAWyD,EAAavE,UAAU/N,kBAAkB4J,GACtDoC,SACJ,GAAImH,EAAgB/tB,UAElB4mB,EAAWwH,MACN,CACL,IAAM/a,EAAYlX,EAAO0yB,iBAAiBrK,GAQtCoC,EAPa,MAAbvT,EAE8B,cAA9B0a,EAAgBle,WAChBwD,EAAUwH,SAASkT,EAAgBe,UAAU9uB,UAIlCqT,EAEAA,EAAUK,YAAYqa,EAAiBK,GAIzC1T,GAAaxH,WAG5B,GAAKuW,EAAS/U,OAAOkS,GAenBgF,EAAeJ,MAfe,CAC9B,IAAMuD,EAAe34B,KAAKk1B,QAAQ5X,YAChCwZ,EAAavE,UACbnE,EACAoC,EACAmH,EACA5xB,EACA2vB,GAEFF,EAAeJ,EAAa0C,gBAC1Ba,EACA7B,EAAajF,qBACb7xB,KAAKk1B,QAAQ6C,kBAOrB,OAAOvC,GASML,iBAAf,SACEH,EACA5G,GAEA,OAAO4G,EAAUR,gBAAgB1C,mBAAmB1D,IAa9C+G,4BAAR,SACEH,EACArgB,EACAikB,EACAtD,EACA2B,EACAvB,GANF,WAcMmD,EAAe7D,EA6BnB,OA5BA4D,EAAgBE,QAAQ,SAAC5kB,EAAc+I,GACrC,IAAM8b,EAAYpkB,EAAKO,MAAMhB,GACzBihB,EAAc6D,eAAehE,EAAW+D,EAAU/kB,cACpD6kB,EAAepyB,EAAKmvB,oBAClBiD,EACAE,EACA9b,EACAqY,EACA2B,EACAvB,MAKNkD,EAAgBE,QAAQ,SAAC5kB,EAAc+I,GACrC,IAAM8b,EAAYpkB,EAAKO,MAAMhB,GACxBihB,EAAc6D,eAAehE,EAAW+D,EAAU/kB,cACrD6kB,EAAepyB,EAAKmvB,oBAClBiD,EACAE,EACA9b,EACAqY,EACA2B,EACAvB,MAKCmD,GASD1D,wBAAR,SAAoB5Z,EAAYwa,GAI9B,OAHAA,EAAM+C,QAAQ,SAAS5kB,EAAc+I,GACnC1B,EAAOA,EAAK+B,YAAYpJ,EAAc+I,KAEjC1B,GAcD4Z,8BAAR,SACEH,EACArgB,EACAikB,EACAtD,EACA2B,EACAxB,EACAC,GAPF,WAWE,GACEV,EACGN,iBACAnC,UACA3oB,YACForB,EAAUN,iBAAiB7C,qBAE5B,OAAOmD,EAST,IACIiE,EADAJ,EAAe7D,EAGjBiE,EADEtkB,EAAK/K,UACSgvB,EAEA1I,GAAcD,MAAMS,QAAQ/b,EAAMikB,GAEpD,IAAMnE,EAAaO,EAAUN,iBAAiBnC,UAyC9C,OAxCA0G,EAAclJ,SAASrQ,iBAAiB,SAAC0O,EAAU9L,GACjD,GAAImS,EAAW1C,SAAS3D,GAAW,CACjC,IAAM8K,EAAclE,EACjBN,iBACAnC,UACA/N,kBAAkB4J,GACfoC,EAAW/pB,EAAK0yB,YAAYD,EAAa5W,GAC/CuW,EAAepyB,EAAKqvB,sBAClB+C,EACA,IAAIvlB,GAAK8a,GACToC,EACA8E,EACA2B,EACAxB,EACAC,MAINuD,EAAclJ,SAASrQ,iBAAiB,SAAC0O,EAAUgL,GACjD,IAAMC,GACHrE,EAAUN,iBAAiB5C,mBAAmB1D,IACvB,MAAxBgL,EAAex3B,MACjB,IAAK6yB,EAAW1C,SAAS3D,KAAciL,EAAoB,CACzD,IAAMH,EAAclE,EACjBN,iBACAnC,UACA/N,kBAAkB4J,GACfoC,EAAW/pB,EAAK0yB,YAAYD,EAAaE,GAC/CP,EAAepyB,EAAKqvB,sBAClB+C,EACA,IAAIvlB,GAAK8a,GACToC,EACA8E,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,EAAa9tB,MAAe,CAE9B,GACG03B,EAAQ1vB,WAAaqtB,EAAYpF,sBAClCoF,EAAYqB,kBAAkBgB,GAE9B,OAAOt5B,KAAK81B,sBACVd,EACAsE,EACArC,EAAY1E,UAAU9N,SAAS6U,GAC/BhE,EACAC,EACAE,EACAC,GAEG,GAAI4D,EAAQ1vB,UAAW,CAG5B,IAAI2vB,EAAkBrJ,GAAcD,MAIpC,OAHAgH,EAAY1E,UAAUvN,aAAa7I,GAAW,SAAS1U,EAAM8T,GAC3Dge,EAAkBA,EAAgB1pB,IAAI,IAAIyD,GAAK7L,GAAO8T,KAEjDvb,KAAKi2B,kBACVjB,EACAsE,EACAC,EACAjE,EACAC,EACAE,EACAC,GAGF,OAAOV,EAIT,IAAIwE,EAAkBtJ,GAAcD,MAUpC,OATAP,EAAaoJ,QAAQ,SAASW,EAAW73B,GACvC,IAAM83B,EAAkBJ,EAAQpkB,MAAMukB,GAClCxC,EAAYqB,kBAAkBoB,KAChCF,EAAkBA,EAAgB3pB,IAChC4pB,EACAxC,EAAY1E,UAAU9N,SAASiV,OAI9B15B,KAAKi2B,kBACVjB,EACAsE,EACAE,EACAlE,EACAC,EACAE,EACAC,IAaEP,4BAAR,SACEH,EACArgB,EACA2gB,EACAI,GAEA,IAAMiE,EAAgB3E,EAAUN,iBAC1Bc,EAAeR,EAAUuD,iBAC7BoB,EAAcpH,UACdoH,EAAc9H,sBAAwBld,EAAK/K,UAC3C+vB,EAAc9D,cAEhB,OAAO71B,KAAKw4B,oCACVhD,EACA7gB,EACA2gB,EACApB,GACAwB,IAaIP,6BAAR,SACEH,EACArgB,EACA2gB,EACAsE,EACAlE,GAEA,IAAItD,EACJ,GAAwC,MAApCkD,EAAYyB,eAAepiB,GAC7B,OAAOqgB,EAEP,IAAMjvB,EAAS,IAAIwuB,GACjBe,EACAN,EACA4E,GAEIC,EAAgB7E,EAAUR,gBAAgBjC,UAC5CyE,SACJ,GAAIriB,EAAK/K,WAAiC,cAApB+K,EAAKX,WAA4B,CACrD,IAAI4H,SACJ,GAAIoZ,EAAUN,iBAAiB7C,qBAC7BjW,EAAU0Z,EAAYiC,uBACpBvC,EAAUH,6BAEP,CACL,IAAMiF,EAAiB9E,EAAUN,iBAAiBnC,UAClDpwB,EACE23B,aAA0BxV,GAC1B,iDAEF1I,EAAU0Z,EAAY8B,0BACpB0C,GAGJle,EAAUA,EACVob,EAAgBh3B,KAAKk1B,QAAQmC,eAC3BwC,EACAje,EACA8Z,OAEG,CACL,IAAMtH,EAAWzZ,EAAKX,WAClBwc,EAAW8E,EAAYX,kBACzBvG,EACA4G,EAAUN,kBAGE,MAAZlE,GACAwE,EAAUN,iBAAiB5C,mBAAmB1D,KAE9CoC,EAAWqJ,EAAcrV,kBAAkB4J,KAG3C4I,EADc,MAAZxG,EACcxwB,KAAKk1B,QAAQ5X,YAC3Buc,EACAzL,EACAoC,EACA7b,EAAKR,WACLpO,EACA2vB,GAGFV,EACGR,gBACAjC,UACAR,SAAS3D,GAGIpuB,KAAKk1B,QAAQ5X,YAC3Buc,EACAzL,EACA9J,GAAaxH,WACbnI,EAAKR,WACLpO,EACA2vB,GAGcmE,GAGFjwB,WACdorB,EAAUN,iBAAiB7C,uBAG3BO,EAAWkD,EAAYiC,uBACrBvC,EAAUH,0BAECpY,eACXua,EAAgBh3B,KAAKk1B,QAAQmC,eAC3BL,EACA5E,EACAsD,IAQR,OAHAtD,EACE4C,EAAUN,iBAAiB7C,sBACe,MAA1CyD,EAAYyB,eAAezjB,GAAK2c,OAC3B+E,EAAU8C,gBACfd,EACA5E,EACApyB,KAAKk1B,QAAQ6C,oCCh4BnB,WAAoBgC,GAAA/5B,YAAA+5B,EAKlB/5B,KAAKqoB,OAASroB,KAAK+5B,OAAOnQ,iBAAiBC,WAsJ/C,OArIEmQ,qCAAA,SACE/E,EACAgF,EACAC,GAHF,WAKQC,EAAkB,GAClBC,EAAkB,GAuDxB,OArDAnF,EAAQzrB,QAAQ,SAAAkgB,GAEZA,EAAOpT,OAASmc,GAAOM,eACvBtsB,EAAK4hB,OAAOgS,oBACV3Q,EAAO8I,QACP9I,EAAOI,eAGTsQ,EAAMr4B,KACJ0wB,GAAO6H,iBACL5Q,EAAO1M,UACP0M,EAAOI,iBAMf9pB,KAAKu6B,uBACHJ,EACA1H,GAAOG,cACPqC,EACAiF,EACAD,GAEFj6B,KAAKu6B,uBACHJ,EACA1H,GAAOE,YACPsC,EACAiF,EACAD,GAEFj6B,KAAKu6B,uBACHJ,EACA1H,GAAOO,YACPoH,EACAF,EACAD,GAEFj6B,KAAKu6B,uBACHJ,EACA1H,GAAOM,cACPkC,EACAiF,EACAD,GAEFj6B,KAAKu6B,uBACHJ,EACA1H,GAAOC,MACPuC,EACAiF,EACAD,GAGKE,GAaDH,mCAAR,SACEG,EACApgB,EACAkb,EACAuF,EACAP,GALF,WAOQQ,EAAkBxF,EAAQyF,OAAO,SAAAhR,GAAU,OAAAA,EAAOpT,OAASyD,IAEjE0gB,EAAgBzpB,KAAKhR,KAAK26B,gBAAgB/qB,KAAK5P,OAC/Cy6B,EAAgBjxB,QAAQ,SAAAkgB,GACtB,IAAMkR,EAAqBn0B,EAAKo0B,yBAC9BnR,EACAuQ,GAEFO,EAAchxB,QAAQ,SAAAsxB,GAChBA,EAAaC,WAAWrR,EAAOpT,OACjC6jB,EAAOp4B,KACL+4B,EAAaE,YAAYJ,EAAoBn0B,EAAKszB,cAapDC,qCAAR,SAAiCtQ,EAAgBuQ,GAC/C,MAAoB,UAAhBvQ,EAAOpT,MAAoC,kBAAhBoT,EAAOpT,OAGpCoT,EAAOX,SAAWkR,EAAWgB,wBAE3BvR,EAAO1M,UACP0M,EAAOI,aACP9pB,KAAKqoB,SANAqB,GAkBHsQ,4BAAR,SAAwB/uB,EAAW1L,GACjC,GAAmB,MAAf0L,EAAE+R,WAAoC,MAAfzd,EAAEyd,UAC3B,MAAM1a,EAAe,sCAEvB,IAAM44B,EAAW,IAAI1f,GAAUvQ,EAAE+R,UAAW/R,EAAE6e,cACxCqR,EAAW,IAAI3f,GAAUjc,EAAEyd,UAAWzd,EAAEuqB,cAC9C,OAAO9pB,KAAKqoB,OAAO3M,QAAQwf,EAAUC,uBCzIvC,WAAoBpB,EAAeqB,GAAfp7B,YAAA+5B,EARZ/5B,yBAA2C,GASjD,IAAMuW,EAASvW,KAAK+5B,OAAOnQ,iBAErByR,EAAc,IAAIpI,GAAc1c,EAAOsT,YACvC6Q,EAASnkB,EAAO+kB,gBAMtBt7B,KAAKu7B,WAAa,IAAIpG,GAAcuF,GAEpC,IAAMc,EAAqBJ,EAAiB1G,iBACtC+G,EAAoBL,EAAiB5G,gBAGrClC,EAAa+I,EAAYhE,eAC7B/S,GAAaxH,WACb0e,EAAmBjJ,UACnB,MAEIJ,EAAYuI,EAAOrD,eACvB/S,GAAaxH,WACb2e,EAAkBlJ,UAClB,MAEI0F,EAAiB,IAAIrG,GACzBU,EACAkJ,EAAmB3J,qBACnBwJ,EAAYtD,gBAERf,EAAgB,IAAIpF,GACxBO,EACAsJ,EAAkB5J,qBAClB6I,EAAO3C,gBAOT/3B,KAAKq0B,WAAa,IAAInC,GAAU8E,EAAeiB,GAM/Cj4B,KAAK07B,gBAAkB,IAAI1B,GAAeh6B,KAAK+5B,QA6LnD,OAvLE4B,qBAAA,WACE,OAAO37B,KAAK+5B,QAMd4B,2BAAA,WACE,OAAO37B,KAAKq0B,WAAWK,iBAAiBnC,WAO1CoJ,mCAAA,SAAuBhnB,GACrB,IAAMinB,EAAQ57B,KAAKq0B,WAAWQ,wBAC9B,OAAI+G,IAIA57B,KAAK+5B,OAAOnQ,iBAAiBiS,iBAC3BlnB,EAAK/K,YAAcgyB,EAAMpX,kBAAkB7P,EAAKX,YAAYpK,WAEvDgyB,EAAMnX,SAAS9P,GAGnB,MAMTgnB,oBAAA,WACE,OAA2C,IAApC37B,KAAK87B,oBAAoBh6B,QAMlC65B,iCAAA,SAAqB7S,GACnB9oB,KAAK87B,oBAAoB/5B,KAAK+mB,IAQhC6S,oCAAA,SACE7S,EACAiT,GAEA,IAAMC,EAA8B,GACpC,GAAID,EAAa,CACf55B,EACuB,MAArB2mB,EACA,mDAEF,IAAMmT,EAAOj8B,KAAK+5B,OAAOplB,KACzB3U,KAAK87B,oBAAoBtyB,QAAQ,SAASsxB,GACxCiB,EAAoCA,EACpC,IAAMG,EAAapB,EAAaqB,kBAAkBJ,EAAaE,GAC3DC,GACFF,EAAaj6B,KAAKm6B,KAKxB,GAAIpT,EAAmB,CAErB,IADA,IAAIsT,EAAY,GACPz5B,EAAI,EAAGA,EAAI3C,KAAK87B,oBAAoBh6B,SAAUa,EAAG,CACxD,IAAM05B,EAAWr8B,KAAK87B,oBAAoBn5B,GAC1C,GAAK05B,EAASC,QAAQxT,IAEf,GAAIA,EAAkByT,iBAAkB,CAE7CH,EAAYA,EAAUI,OAAOx8B,KAAK87B,oBAAoBrzB,MAAM9F,EAAI,IAChE,YAJAy5B,EAAUr6B,KAAKs6B,GAOnBr8B,KAAK87B,oBAAsBM,OAE3Bp8B,KAAK87B,oBAAsB,GAE7B,OAAOE,GAWTL,2BAAA,SACEtG,EACAC,EACAsE,GAGEvE,EAAU/e,OAASmR,GAAc+J,OACJ,OAA7B6D,EAAUtvB,OAAOwpB,UAEjBptB,EACEnC,KAAKq0B,WAAWQ,wBAChB,6DAEF1yB,EACEnC,KAAKq0B,WAAWsC,uBAChB,4DAIJ,IAAMvB,EAAep1B,KAAKq0B,WACpBjV,EAASpf,KAAKu7B,WAAWkB,eAC7BrH,EACAC,EACAC,EACAsE,GAYF,OAVA55B,KAAKu7B,WAAWmB,cAActd,EAAO4V,WAErC7yB,EACEid,EAAO4V,UAAUN,iBAAiB7C,uBAC/BuD,EAAaV,iBAAiB7C,qBACjC,2DAGF7xB,KAAKq0B,WAAajV,EAAO4V,UAElBh1B,KAAK28B,0BACVvd,EAAO6V,QACP7V,EAAO4V,UAAUR,gBAAgBjC,UACjC,OAQJoJ,6BAAA,SAAiBb,GACf,IAAM3I,EAAYnyB,KAAKq0B,WAAWG,gBAC5BoI,EAA2B,GAC5BzK,EAAUI,UAAU9V,cACL0V,EAAUI,UAClBvN,aAAaxG,GAAgB,SAASjW,EAAK0U,GACnD2f,EAAe76B,KAAK0wB,GAAOe,iBAAiBjrB,EAAK0U,MAMrD,OAHIkV,EAAUN,sBACZ+K,EAAe76B,KAAK0wB,GAAOmE,YAAYzE,EAAUI,YAE5CvyB,KAAK28B,0BACVC,EACAzK,EAAUI,UACVuI,IAWJa,sCAAA,SACE1G,EACAgF,EACAnR,GAEA,IAAM0R,EAAgB1R,EAClB,CAACA,GACD9oB,KAAK87B,oBACT,OAAO97B,KAAK07B,gBAAgBmB,yBAC1B5H,EACAgF,EACAO,uBbpPN,aAuBUx6B,YAAgC,GA+O1C,OArQER,sBAAWs9B,gCAQX,WAEE,OADA36B,EAAOqlB,GAAwB,oCACxBA,QAVT,SAAkC1Z,GAChC3L,GACGqlB,GACD,mDAEFA,GAAyB1Z,mCAsB3BgvB,oBAAA,WACE,OAAOlzB,EAAQ5J,KAAK+8B,SAUtBD,2BAAA,SACEzH,EACAC,EACA0H,GAEA,IAAMzN,EAAU8F,EAAUtvB,OAAOwpB,QACjC,GAAgB,OAAZA,EAAkB,CACpB,IAAM0N,EAAO1zB,EAAQvJ,KAAK+8B,OAAQxN,GAElC,OADAptB,EAAe,MAAR86B,EAAc,gDACdA,EAAKR,eACVpH,EACAC,EACA0H,GAGF,IAAIE,EAAkB,GAQtB,OANA1zB,EAAQxJ,KAAK+8B,OAAQ,SAASx0B,EAAa00B,GACzCC,EAASA,EAAOV,OACdS,EAAKR,eAAepH,EAAWC,EAAa0H,MAIzCE,GAcXJ,iCAAA,SACEnT,EACAb,EACAwM,EACA2B,EACAkG,GAEA,IAAM5N,EAAU5F,EAAMqE,kBAClBiP,EAAO1zB,EAAQvJ,KAAK+8B,OAAQxN,GAChC,IAAK0N,EAAM,CAET,IAAIhD,EAAa3E,EAAYiC,uBAC3B4F,EAAsBlG,EAAc,MAElCmG,GAAqB,EAEvBA,IADEnD,IAGFA,EADShD,aAAuB3S,GACnBgR,EAAY8B,0BAA0BH,GAGtC3S,GAAaxH,YAFL,GAKvB,IAAMkY,EAAY,IAAI9C,GACpB,IAAIN,KAEFwL,GACA,GAEF,IAAIxL,KAEFuL,GACA,IAGJF,EAAO,IAAItB,GAAKhS,EAAOqL,GACvBh1B,KAAK+8B,OAAOxN,GAAW0N,EAKzB,OADAA,EAAKI,qBAAqBvU,GACnBmU,EAAKK,iBAAiBxU,IAc/BgU,oCAAA,SACEnT,EACAb,EACAiT,GAEA,IAAMxM,EAAU5F,EAAMqE,kBAChBuP,EAAmB,GACrBvB,EAAwB,GACtBwB,EAAkBx9B,KAAKy9B,kBAC7B,GAAgB,YAAZlO,EAAuB,CAEzB,IAAMf,EAAOxuB,KACbwJ,EAAQxJ,KAAK+8B,OAAQ,SAASW,EAAqBT,GACjDjB,EAAeA,EAAaQ,OAC1BS,EAAKU,wBAAwB7U,EAAmBiT,IAE9CkB,EAAKrzB,mBACA4kB,EAAKuO,OAAOW,GAIhBT,EACEW,WACAhU,iBACAiS,gBAEH0B,EAAQx7B,KAAKk7B,EAAKW,mBAInB,CAEL,IAAMX,EAAO1zB,EAAQvJ,KAAK+8B,OAAQxN,GAC9B0N,IACFjB,EAAeA,EAAaQ,OAC1BS,EAAKU,wBAAwB7U,EAAmBiT,IAE9CkB,EAAKrzB,mBACA5J,KAAK+8B,OAAOxN,GAIhB0N,EACEW,WACAhU,iBACAiS,gBAEH0B,EAAQx7B,KAAKk7B,EAAKW,cAa1B,OAPIJ,IAAoBx9B,KAAKy9B,mBAE3BF,EAAQx7B,KACN,IAAI+6B,EAAUtV,uBAAuBmC,EAAMmB,KAAMnB,EAAMhV,OAIpD,CAAE4oB,QAASA,EAASpD,OAAQ6B,IAMrCc,0BAAA,WAAA,WAEE,OADet9B,OAAOuR,KAAK/Q,KAAK+8B,QAAQhzB,IAAI,SAAAxB,GAAO,OAAA9B,EAAKs2B,OAAOx0B,KACjDmyB,OAAO,SAASuC,GAC5B,OAAQA,EACLW,WACAhU,iBACAiS,kBASPiB,mCAAA,SAAuBnoB,GACrB,IAAIsiB,EAA2B,KAI/B,OAHAztB,EAAQxJ,KAAK+8B,OAAQ,SAACx0B,EAAa00B,GACjChG,EAAcA,GAAegG,EAAKY,uBAAuBlpB,KAEpDsiB,GAOT6F,yBAAA,SAAanT,GAEX,GADeA,EAAMC,iBACViS,eACT,OAAO77B,KAAK89B,kBAEZ,IAAMvO,EAAU5F,EAAMqE,kBACtB,OAAOzkB,EAAQvJ,KAAK+8B,OAAQxN,IAQhCuN,+BAAA,SAAmBnT,GACjB,OAAmC,MAA5B3pB,KAAK+9B,aAAapU,IAM3BmT,4BAAA,WACE,OAAiC,MAA1B98B,KAAK89B,mBAMdhB,4BAAA,WACE,IxC9L8BxzB,EAASa,EACrC5B,EwCmMF,OxCpM8Be,EwC8LCtJ,KAAK+8B,QxC7LlCx0B,EAAM2B,EAAQZ,EwC6L4B,SAAC2zB,GAC3C,OAAAA,EACGW,WACAhU,iBACAiS,gBxCjMoB1xB,KACbb,EAAIf,KwCkMO,yBc7QzB,WAAoBy1B,GAAAh+B,gBAAAg+B,EAgMtB,OArLEC,qBAAA,SAAStpB,EAAY4G,GACnB,GAAI5G,EAAK/K,UACP,OAAO,IAAIq0B,EAAc,IAAI/N,GAAc3U,IAE3C,IAAM2iB,EAAWl+B,KAAKg+B,WAAWG,yBAAyBxpB,GAC1D,GAAgB,MAAZupB,EAAkB,CACpB,IAAME,EAAeF,EAASvpB,KAC1B/S,EAAQs8B,EAASt8B,MACfsS,EAAeZ,GAAKY,aAAakqB,EAAczpB,GAErD,OADA/S,EAAQA,EAAM0b,YAAYpJ,EAAcqH,GACjC,IAAI0iB,EAAcj+B,KAAKg+B,WAAWnuB,IAAIuuB,EAAcx8B,IAE3D,IAAMouB,EAAU,IAAIE,GAAc3U,GAElC,OAAO,IAAI0iB,EADUj+B,KAAKg+B,WAAWtN,QAAQ/b,EAAMqb,KAWzDiO,sBAAA,SAAUtpB,EAAY0pB,GACpB,IAAIC,EAAWt+B,KAIf,OAHAwJ,EAAQ60B,EAAS,SAASjQ,EAAkB7S,GAC1C+iB,EAAWA,EAASC,SAAS5pB,EAAKO,MAAMkZ,GAAW7S,KAE9C+iB,GAUTL,wBAAA,SAAYtpB,GACV,OAAIA,EAAK/K,UACAq0B,EAAchO,MAGd,IAAIgO,EADUj+B,KAAKg+B,WAAWtN,QAAQ/b,EAAMub,GAAcD,SAYrEgO,6BAAA,SAAiBtpB,GACf,OAAqC,MAA9B3U,KAAKw+B,gBAAgB7pB,IAU9BspB,4BAAA,SAAgBtpB,GACd,IAAMupB,EAAWl+B,KAAKg+B,WAAWG,yBAAyBxpB,GAC1D,OAAgB,MAAZupB,EACKl+B,KAAKg+B,WACTr2B,IAAIu2B,EAASvpB,MACb8P,SAASnR,GAAKY,aAAagqB,EAASvpB,KAAMA,IAEtC,MASXspB,gCAAA,WACE,IAAMlO,EAAwB,GAC1BxU,EAAOvb,KAAKg+B,WAAWp8B,MAkB3B,OAjBY,MAAR2Z,EAEGA,EAAKkB,cACPlB,EAAsByJ,aAAaxG,GAAgB,SAClDxB,EACAC,GAEA8S,EAAShuB,KAAK,IAAIyZ,GAAUwB,EAAWC,MAI3Cjd,KAAKg+B,WAAWjO,SAASrQ,iBAAiB,SAAS1C,EAAWsF,GACrC,MAAnBA,EAAU1gB,OACZmuB,EAAShuB,KAAK,IAAIyZ,GAAUwB,EAAWsF,EAAU1gB,UAIhDmuB,GAOTkO,+BAAA,SAAmBtpB,GACjB,GAAIA,EAAK/K,UACP,OAAO5J,KAEP,IAAMy+B,EAAgBz+B,KAAKw+B,gBAAgB7pB,GAC3C,OACS,IAAIspB,EADQ,MAAjBQ,EACuB,IAAIvO,GAAcuO,GAElBz+B,KAAKg+B,WAAWhO,QAAQrb,KASvDspB,oBAAA,WACE,OAAOj+B,KAAKg+B,WAAWp0B,WASzBq0B,kBAAA,SAAM1iB,GACJ,OAAO0iB,EAAcS,mBAAmBprB,GAAK2c,MAAOjwB,KAAKg+B,WAAYziB,IAhJhE0iB,QAAQ,IAAIA,EAAc,IAAI/N,GAAc,OA0JpC+N,qBAAqB,SAClC/pB,EACAyqB,EACApjB,GAEA,GAAuB,MAAnBojB,EAAU/8B,MAEZ,OAAO2Z,EAAK+B,YAAYpJ,EAAcyqB,EAAU/8B,OAEhD,IAAIg9B,EAAgB,KAsBpB,OArBAD,EAAU5O,SAASrQ,iBAAiB,SAAS0O,EAAU9L,GACpC,cAAb8L,GAGFjsB,EACsB,OAApBmgB,EAAU1gB,MACV,6CAEFg9B,EAAgBtc,EAAU1gB,OAE1B2Z,EAAO0iB,EAAcS,mBACnBxqB,EAAagB,MAAMkZ,GACnB9L,EACA/G,KAKDA,EAAKkJ,SAASvQ,GAActK,WAA+B,OAAlBg1B,IAC5CrjB,EAAOA,EAAK+B,YAAYpJ,EAAagB,MAAM,aAAc0pB,IAEpDrjB,sBClLb,aAQUvb,oBAAgCi+B,GAAchO,MAU9CjwB,gBAA4B,GAE5BA,mBAAgB,EA6iB1B,OAriBE6+B,wBAAA,SAAYlqB,GACV,OAAO,IAAImqB,GAAanqB,EAAM3U,OAWhC6+B,yBAAA,SAAalqB,EAAYoT,EAAYgX,EAAiBC,GACpD78B,EACE48B,EAAU/+B,KAAKi/B,aACf,qDAEc94B,IAAZ64B,IACFA,GAAU,GAEZh/B,KAAKk/B,WAAWn9B,KAAK,CACnB4S,KAAMA,EACNoT,KAAMA,EACNgX,QAASA,EACTC,QAASA,IAGPA,IACFh/B,KAAKm/B,eAAiBn/B,KAAKm/B,eAAeZ,SAAS5pB,EAAMoT,IAE3D/nB,KAAKi/B,aAAeF,GAUtBF,qBAAA,SACElqB,EACAikB,EACAmG,GAEA58B,EACE48B,EAAU/+B,KAAKi/B,aACf,gDAEFj/B,KAAKk/B,WAAWn9B,KAAK,CACnB4S,KAAMA,EACNob,SAAU6I,EACVmG,QAASA,EACTC,SAAS,IAGXh/B,KAAKm/B,eAAiBn/B,KAAKm/B,eAAeC,UAAUzqB,EAAMikB,GAC1D54B,KAAKi/B,aAAeF,GAOtBF,qBAAA,SAASE,GACP,IAAK,IAAIp8B,EAAI,EAAGA,EAAI3C,KAAKk/B,WAAWp9B,OAAQa,IAAK,CAC/C,IAAM08B,EAASr/B,KAAKk/B,WAAWv8B,GAC/B,GAAI08B,EAAON,UAAYA,EACrB,OAAOM,EAGX,OAAO,MAWTR,wBAAA,SAAYE,GAAZ,WAMQ1Z,EAAMrlB,KAAKk/B,WAAWI,UAAU,SAAS9tB,GAC7C,OAAOA,EAAEutB,UAAYA,IAEvB58B,EAAc,GAAPkjB,EAAU,gDACjB,IAAMka,EAAgBv/B,KAAKk/B,WAAW7Z,GACtCrlB,KAAKk/B,WAAWM,OAAOna,EAAK,GAO5B,IALA,IAAIoa,EAAyBF,EAAcP,QACvCU,GAAsC,EAEtC/8B,EAAI3C,KAAKk/B,WAAWp9B,OAAS,EAE1B29B,GAA+B,GAAL98B,GAAQ,CACvC,IAAMg9B,EAAe3/B,KAAKk/B,WAAWv8B,GACjCg9B,EAAaX,UAER3Z,GAAL1iB,GACA3C,KAAK4/B,oBAAoBD,EAAcJ,EAAc5qB,MAGrD8qB,GAAyB,EAChBF,EAAc5qB,KAAKtL,SAASs2B,EAAahrB,QAElD+qB,GAAsC,IAG1C/8B,IAGF,GAAK88B,EAEE,CAAA,GAAIC,EAGT,OADA1/B,KAAK6/B,cACE,EAGP,GAAIN,EAAcxX,KAChB/nB,KAAKm/B,eAAiBn/B,KAAKm/B,eAAeW,YACxCP,EAAc5qB,UAEX,CACL,IAAMob,EAAWwP,EAAcxP,SAC/BvmB,EAAQumB,EAAU,SAAC/S,GACjBvW,EAAK04B,eAAiB14B,EAAK04B,eAAeW,YACxCP,EAAc5qB,KAAKO,MAAM8H,MAI/B,OAAO,EAnBP,OAAO,GA8BX6hB,iCAAA,SAAqBlqB,GACnB,OAAO3U,KAAKm/B,eAAeX,gBAAgB7pB,IAa7CkqB,mCAAA,SACEkB,EACAnG,EACAoG,EACAC,GAEA,GAAKD,GAAsBC,EAmBpB,CACL,IAAMlK,EAAQ/1B,KAAKm/B,eAAee,mBAAmBH,GACrD,IAAKE,GAAuBlK,EAAMnsB,UAChC,OAAOgwB,EAGP,GACGqG,GACsB,MAAvBrG,GACC7D,EAAMoK,iBAAiB7sB,GAAK2c,OAGxB,CACL,IAQMmQ,EAAcvB,EAAUwB,WAC5BrgC,KAAKk/B,WATQ,SAASoB,GACtB,OACGA,EAAMtB,SAAWiB,MAChBD,KACEA,EAAkBhqB,QAAQsqB,EAAMvB,YACnCuB,EAAM3rB,KAAKtL,SAAS02B,IAAaA,EAAS12B,SAASi3B,EAAM3rB,QAM5DorB,GAEIQ,EAAe3G,GAAuBtV,GAAaxH,WACzD,OAAOsjB,EAAY94B,MAAMi5B,GAhBzB,OAAO,KA7BX,IAAM9B,EAAgBz+B,KAAKm/B,eAAeX,gBAAgBuB,GAC1D,GAAqB,MAAjBtB,EACF,OAAOA,EAEP,IAAM+B,EAAWxgC,KAAKm/B,eAAee,mBAAmBH,GACxD,GAAIS,EAAS52B,UACX,OAAOgwB,EACF,GACkB,MAAvBA,GACC4G,EAASL,iBAAiB7sB,GAAK2c,OAI3B,CACL,IAAMsQ,EAAe3G,GAAuBtV,GAAaxH,WACzD,OAAO0jB,EAASl5B,MAAMi5B,GAHtB,OAAO,MA+Cf1B,sCAAA,SACEkB,EACAU,GAEA,IAAIvJ,EAAmB5S,GAAaxH,WAC9B4jB,EAAc1gC,KAAKm/B,eAAeX,gBAAgBuB,GACxD,GAAIW,EAaF,OAZKA,EAAYjkB,cAEfikB,EAAY1b,aAAaxG,GAAgB,SACvCxB,EACAmT,GAEA+G,EAAmBA,EAAiB9Z,qBAClCJ,EACAmT,KAIC+G,EACF,GAAIuJ,EAAwB,CAGjC,IAAME,EAAQ3gC,KAAKm/B,eAAee,mBAAmBH,GAoBrD,OAnBAU,EAAuBzb,aAAaxG,GAAgB,SAClDxB,EACAC,GAEA,IAAM1B,EAAOolB,EACVT,mBAAmB,IAAI5sB,GAAK0J,IAC5B1V,MAAM2V,GACTia,EAAmBA,EAAiB9Z,qBAClCJ,EACAzB,KAIJolB,EAAMC,sBAAsBp3B,QAAQ,SAASwY,GAC3CkV,EAAmBA,EAAiB9Z,qBAClC4E,EAAUva,KACVua,EAAUzG,QAGP2b,EAWP,OAPcl3B,KAAKm/B,eAAee,mBAAmBH,GAC/Ca,sBAAsBp3B,QAAQ,SAASwY,GAC3CkV,EAAmBA,EAAiB9Z,qBAClC4E,EAAUva,KACVua,EAAUzG,QAGP2b,GAwBX2H,+CAAA,SACEkB,EACAtX,EACAoY,EACAC,GAEA3+B,EACE0+B,GAAqBC,EACrB,6DAEF,IAAMnsB,EAAOorB,EAAS7qB,MAAMuT,GAC5B,GAAIzoB,KAAKm/B,eAAegB,iBAAiBxrB,GAGvC,OAAO,KAGP,IAAMosB,EAAa/gC,KAAKm/B,eAAee,mBAAmBvrB,GAC1D,OAAIosB,EAAWn3B,UAENk3B,EAAmBrc,SAASgE,GAQ5BsY,EAAWz5B,MAAMw5B,EAAmBrc,SAASgE,KAc1DoW,8BAAA,SACEkB,EACA3R,EACA0S,GAEA,IAAMnsB,EAAOorB,EAAS7qB,MAAMkZ,GACtBqQ,EAAgBz+B,KAAKm/B,eAAeX,gBAAgB7pB,GAC1D,OAAqB,MAAjB8pB,EACKA,EAEHqC,EAAmBhP,mBAAmB1D,GACrBpuB,KAAKm/B,eAAee,mBAAmBvrB,GACxCrN,MAChBw5B,EAAmBvO,UAAU/N,kBAAkB4J,IAG1C,MAabyQ,2BAAA,SAAelqB,GACb,OAAO3U,KAAKm/B,eAAeX,gBAAgB7pB,IAe7CkqB,6BAAA,SACEkB,EACAnL,EACA9O,EACArG,EACAtN,EACAoL,GAEA,IAAIyjB,EACEjL,EAAQ/1B,KAAKm/B,eAAee,mBAAmBH,GAC/CtB,EAAgB1I,EAAMyI,gBAAgBlrB,GAAK2c,OACjD,GAAqB,MAAjBwO,EACFuC,EAAYvC,MACP,CAAA,GAA0B,MAAtB7J,EAIT,MAAO,GAHPoM,EAAYjL,EAAMzuB,MAAMstB,GAM1B,IADAoM,EAAYA,EAAUtN,UAAUnW,IACjB3T,WAAco3B,EAAUvkB,aAerC,MAAO,GARP,IANA,IAAMqY,EAAQ,GACRtgB,EAAM+I,EAAMoG,aACZL,EAAOnR,EACR6uB,EAA2Bhb,uBAAuBF,EAAWvI,GAC7DyjB,EAA2Bpb,gBAAgBE,EAAWvI,GACvDvc,EAAOsiB,EAAKG,UACTziB,GAAQ8zB,EAAMhzB,OAAS2d,GACC,IAAzBjL,EAAIxT,EAAM8kB,IACZgP,EAAM/yB,KAAKf,GAEbA,EAAOsiB,EAAKG,UAEd,OAAOqR,GAYH+J,gCAAR,SAA4BoC,EAA0BtsB,GACpD,OAAIssB,EAAYlZ,KACPkZ,EAAYtsB,KAAKtL,SAASsL,KAGxBzK,EAAQ+2B,EAAYlR,SAAU,SACrCI,EACAnT,GAEA,OAAOikB,EAAYtsB,KAAKO,MAAM8H,GAAW3T,SAASsL,MAShDkqB,uBAAR,WACE7+B,KAAKm/B,eAAiBN,EAAUwB,WAC9BrgC,KAAKk/B,WACLL,EAAUqC,eACV5tB,GAAK2c,OAEsB,EAAzBjwB,KAAKk/B,WAAWp9B,OAClB9B,KAAKi/B,aAAej/B,KAAKk/B,WAAWl/B,KAAKk/B,WAAWp9B,OAAS,GAAGi9B,QAEhE/+B,KAAKi/B,cAAgB,GAWVJ,iBAAf,SAA8ByB,GAC5B,OAAOA,EAAMtB,SAaAH,aAAf,SACEsC,EACAzG,EACA0G,GAGA,IADA,IAAIC,EAAgBpD,GAAchO,MACzBttB,EAAI,EAAGA,EAAIw+B,EAAOr/B,SAAUa,EAAG,CACtC,IAAM29B,EAAQa,EAAOx+B,GAIrB,GAAI+3B,EAAO4F,GAAQ,CACjB,IAAMvH,EAAYuH,EAAM3rB,KACpBT,SACJ,GAAIosB,EAAMvY,KACJqZ,EAAS/3B,SAAS0vB,IACpB7kB,EAAeZ,GAAKY,aAAaktB,EAAUrI,GAC3CsI,EAAgBA,EAAc9C,SAASrqB,EAAcosB,EAAMvY,OAClDgR,EAAU1vB,SAAS+3B,KAC5BltB,EAAeZ,GAAKY,aAAa6kB,EAAWqI,GAC5CC,EAAgBA,EAAc9C,SAC5BjrB,GAAK2c,MACLqQ,EAAMvY,KAAKtD,SAASvQ,SAKnB,CAAA,IAAIosB,EAAMvQ,SA0Bf,MAAMztB,EAAe,8CAzBrB,GAAI8+B,EAAS/3B,SAAS0vB,GACpB7kB,EAAeZ,GAAKY,aAAaktB,EAAUrI,GAC3CsI,EAAgBA,EAAcjC,UAC5BlrB,EACAosB,EAAMvQ,eAEH,GAAIgJ,EAAU1vB,SAAS+3B,GAE5B,IADAltB,EAAeZ,GAAKY,aAAa6kB,EAAWqI,IAC3Bx3B,UACfy3B,EAAgBA,EAAcjC,UAC5B9rB,GAAK2c,MACLqQ,EAAMvQ,cAEH,CACL,IAAM7a,EAAQ3L,EAAQ+2B,EAAMvQ,SAAU7b,EAAaF,YACnD,GAAIkB,EAAO,CAET,IAAMosB,EAAWpsB,EAAMuP,SAASvQ,EAAaC,YAC7CktB,EAAgBA,EAAc9C,SAASjrB,GAAK2c,MAAOqR,OAW/D,OAAOD,sBAsCT,WAAY1sB,EAAYgqB,GACtB3+B,KAAKuhC,UAAY5sB,EACjB3U,KAAKg+B,WAAaW,EA8ItB,OAjIEG,mCAAA,SACElF,EACAoG,EACAC,GAEA,OAAOjgC,KAAKg+B,WAAWzG,uBACrBv3B,KAAKuhC,UACL3H,EACAoG,EACAC,IAWJnB,sCAAA,SACE2B,GAEA,OAAOzgC,KAAKg+B,WAAW5G,0BACrBp3B,KAAKuhC,UACLd,IAuBJ3B,+CAAA,SACEnqB,EACAksB,EACAC,GAEA,OAAO9gC,KAAKg+B,WAAWtG,mCACrB13B,KAAKuhC,UACL5sB,EACAksB,EACAC,IAYJhC,2BAAA,SAAenqB,GACb,OAAO3U,KAAKg+B,WAAWjH,eAAe/2B,KAAKuhC,UAAUrsB,MAAMP,KAc7DmqB,6BAAA,SACElK,EACA9O,EACArG,EACAtN,EACAoL,GAEA,OAAOvd,KAAKg+B,WAAWjJ,iBACrB/0B,KAAKuhC,UACL3M,EACA9O,EACArG,EACAtN,EACAoL,IAYJuhB,8BAAA,SACE1Q,EACAoT,GAEA,OAAOxhC,KAAKg+B,WAAWrJ,kBACrB30B,KAAKuhC,UACLnT,EACAoT,IAUJ1C,kBAAA,SAAM9hB,GACJ,OAAO,IAAI8hB,EAAa9+B,KAAKuhC,UAAUrsB,MAAM8H,GAAYhd,KAAKg+B,gCC1rBhE,WAAoByD,GAAAzhC,qBAAAyhC,EAhBZzhC,oBAA2CkwB,GAAcD,MAOzDjwB,uBAAoB,IAAI6+B,GAExB7+B,oBAA0C,GAC1CA,oBAA0C,GAs0BpD,OArzBE0hC,+BAAA,SACE/sB,EACAgtB,EACA5C,EACAC,GAKA,OAFAh/B,KAAK4hC,kBAAkBC,aAAaltB,EAAMgtB,EAAS5C,EAASC,GAEvDA,EAGIh/B,KAAK8hC,4BACV,IAAIvQ,GAAU9B,GAAgBI,KAAMlb,EAAMgtB,IAHrC,IAgBXD,2BAAA,SACE/sB,EACAikB,EACAmG,GAGA/+B,KAAK4hC,kBAAkBG,SAASptB,EAAMikB,EAAiBmG,GAEvD,IAAMiD,EAAa9R,GAAc+R,WAAWrJ,GAE5C,OAAO54B,KAAK8hC,4BACV,IAAIrQ,GAAMhC,GAAgBI,KAAMlb,EAAMqtB,KAW1CN,yBAAA,SAAa3C,EAAiBpP,gBAAAA,MAC5B,IAAM2Q,EAAQtgC,KAAK4hC,kBAAkBM,SAASnD,GAE9C,GADyB/+B,KAAK4hC,kBAAkB9B,YAAYf,GAGrD,CACL,IAAIoD,EAAejS,GAAcD,MASjC,OARkB,MAAdqQ,EAAMvY,KAERoa,EAAeA,EAAatyB,IAAIyD,GAAK2c,OAAO,GAE5CzmB,EAAQ82B,EAAMvQ,SAAU,SAASxc,EAAoBgI,GACnD4mB,EAAeA,EAAatyB,IAAI,IAAIyD,GAAKC,GAAagI,KAGnDvb,KAAK8hC,4BACV,IAAIhS,GAAawQ,EAAM3rB,KAAMwtB,EAAcxS,IAZ7C,MAAO,IAwBX+R,iCAAA,SAAqB/sB,EAAYgtB,GAC/B,OAAO3hC,KAAK8hC,4BACV,IAAIvQ,GAAU9B,GAAgB2S,OAAQztB,EAAMgtB,KAWhDD,6BAAA,SACE/sB,EACAikB,GAEA,IAAMoJ,EAAa9R,GAAc+R,WAAWrJ,GAE5C,OAAO54B,KAAK8hC,4BACV,IAAIrQ,GAAMhC,GAAgB2S,OAAQztB,EAAMqtB,KAU5CN,gCAAA,SAAoB/sB,GAClB,OAAO3U,KAAK8hC,4BACV,IAAIzQ,GAAe5B,GAAgB2S,OAAQztB,KAY/C+sB,sCAAA,SAA0B/sB,EAAYoT,EAAYsa,GAChD,IAAMC,EAAWtiC,KAAKuiC,gBAAgBF,GACtC,GAAgB,MAAZC,EAaF,MAAO,GAZP,IAAME,EAAId,EAASe,eAAeH,GAC5BI,EAAYF,EAAE7tB,KAClB4a,EAAUiT,EAAEjT,QACRrb,EAAeZ,GAAKY,aAAawuB,EAAW/tB,GAC5CnT,EAAK,IAAI+vB,GACb9B,GAAgBkT,qBAAqBpT,GACrCrb,EACA6T,GAEF,OAAO/nB,KAAK4iC,sBAAsBF,EAAWlhC,IAejDkgC,kCAAA,SACE/sB,EACAikB,EACAyJ,GAEA,IAAMC,EAAWtiC,KAAKuiC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAME,EAAId,EAASe,eAAeH,GAC5BI,EAAYF,EAAE7tB,KAClB4a,EAAUiT,EAAEjT,QACRrb,EAAeZ,GAAKY,aAAawuB,EAAW/tB,GAC5CqtB,EAAa9R,GAAc+R,WAAWrJ,GACtCp3B,EAAK,IAAIiwB,GACbhC,GAAgBkT,qBAAqBpT,GACrCrb,EACA8tB,GAEF,OAAOhiC,KAAK4iC,sBAAsBF,EAAWlhC,GAG7C,MAAO,IAWXkgC,sCAAA,SAA0B/sB,EAAY0tB,GACpC,IAAMC,EAAWtiC,KAAKuiC,gBAAgBF,GACtC,GAAIC,EAAU,CACZ,IAAME,EAAId,EAASe,eAAeH,GAC5BI,EAAYF,EAAE7tB,KAClB4a,EAAUiT,EAAEjT,QACRrb,EAAeZ,GAAKY,aAAawuB,EAAW/tB,GAC5CnT,EAAK,IAAI6vB,GACb5B,GAAgBkT,qBAAqBpT,GACrCrb,GAEF,OAAOlU,KAAK4iC,sBAAsBF,EAAWlhC,GAG7C,MAAO,IAWXkgC,iCAAA,SACE/X,EACAb,GAEA,IAAMnU,EAAOgV,EAAMhV,KAEfsiB,EAA2B,KAC3B4L,GAA2B,EAG/B7iC,KAAK8iC,eAAeC,cAAcpuB,EAAM,SAASquB,EAAiBC,GAChE,IAAM/uB,EAAeZ,GAAKY,aAAa8uB,EAAiBruB,GACxDsiB,EAAcA,GAAegM,EAAGpF,uBAAuB3pB,GACvD2uB,EACEA,GAA4BI,EAAGxF,oBAEnC,IAUIN,EAVA+F,EAAYljC,KAAK8iC,eAAen7B,IAAIgN,IACnCuuB,GAIHL,EACEA,GAA4BK,EAAUzF,kBACxCxG,EAAcA,GAAeiM,EAAUrF,uBAAuBvqB,GAAK2c,SALnEiT,EAAY,IAAIpG,GAChB98B,KAAK8iC,eAAiB9iC,KAAK8iC,eAAejzB,IAAI8E,EAAMuuB,IAQnC,MAAfjM,GACFkG,GAAsB,GAEtBA,GAAsB,EACtBlG,EAAc3S,GAAaxH,WACX9c,KAAK8iC,eAAe9S,QAAQrb,GACpCwuB,aAAa,SAASnmB,EAAWomB,GACvC,IAAM7N,EAAgB6N,EAAevF,uBAAuBvqB,GAAK2c,OAC7DsF,IACF0B,EAAcA,EAAY7Z,qBACxBJ,EACAuY,OAMR,IAAM8N,EAAoBH,EAAUI,mBAAmB3Z,GACvD,IAAK0Z,IAAsB1Z,EAAMC,iBAAiBiS,eAAgB,CAEhE,IAAMyG,EAAWZ,EAAS6B,cAAc5Z,GACxCxnB,IACImgC,KAAYtiC,KAAKwjC,gBACnB,0CAEF,IAAMnB,EAAMX,EAAS+B,mBACrBzjC,KAAKwjC,eAAelB,GAAYD,EAEhCriC,KAAK0jC,eAAe,IAAMrB,GAAOC,EAEnC,IAAMhN,EAAct1B,KAAK4hC,kBAAkB+B,YAAYhvB,GACnDwlB,EAAS+I,EAAU7F,qBACrB1T,EACAb,EACAwM,EACA2B,EACAkG,GAEF,IAAKkG,IAAsBR,EAA0B,CACnD,IAAM5F,EAA0BiG,EAAUnF,aAAapU,GACvDwQ,EAASA,EAAOqC,OAAOx8B,KAAK4jC,eAAeja,EAAOsT,IAEpD,OAAO9C,GAcTuH,oCAAA,SACE/X,EACAb,EACAiT,GAHF,WAMQpnB,EAAOgV,EAAMhV,KACbkvB,EAAiB7jC,KAAK8iC,eAAen7B,IAAIgN,GAC3CqnB,EAAwB,GAI5B,GACE6H,IAC6B,YAA5Bla,EAAMqE,mBACL6V,EAAeP,mBAAmB3Z,IACpC,CAIA,IAAMma,EAAmBD,EAAelG,wBACtChU,EACAb,EACAiT,GAEE8H,EAAej6B,YACjB5J,KAAK8iC,eAAiB9iC,KAAK8iC,eAAehzB,OAAO6E,IAEnD,IAAM4oB,EAAUuG,EAAiBvG,QACjCvB,EAAe8H,EAAiB3J,OAOhC,IAAM4J,GACH,IACDxG,EAAQ+B,UAAU,SAAS3V,GACzB,OAAOA,EAAMC,iBAAiBiS,iBAE5BmI,EAAUhkC,KAAK8iC,eAAemB,WAAWtvB,EAAM,SACnDT,EACAgwB,GAEA,OAAOA,EAAgBzG,oBAGzB,GAAIsG,IAAoBC,EAAS,CAC/B,IAAMhU,EAAUhwB,KAAK8iC,eAAe9S,QAAQrb,GAG5C,IAAKqb,EAAQpmB,UAKX,IAHA,IAAMu6B,EAAWnkC,KAAKokC,gCAAgCpU,GAG7CrtB,EAAI,EAAGA,EAAIwhC,EAASriC,SAAUa,EAAG,CACxC,IAAMs6B,EAAOkH,EAASxhC,GACpB0hC,EAAWpH,EAAKW,WACZ0G,EAAWtkC,KAAKukC,uBAAuBtH,GAC7Cj9B,KAAKyhC,gBAAgB+C,eACnB9C,EAAS+C,mBAAmBJ,GAC5BrkC,KAAK0kC,aAAaL,GAClBC,EAASK,OACTL,EAAShqB,aAUjB,IAAK0pB,GAA4B,EAAjBzG,EAAQz7B,SAAei6B,EAGrC,GAAIgI,EAAiB,CAGnB/jC,KAAKyhC,gBAAgBmD,cACnBlD,EAAS+C,mBAAmB9a,GAFI,WAMlC4T,EAAQ/zB,QAAQ,SAACq7B,GACf,IAAMC,EAAcr+B,EAAK+8B,eACvB9B,EAAS6B,cAAcsB,IAEzBp+B,EAAKg7B,gBAAgBmD,cACnBlD,EAAS+C,mBAAmBI,GAC5BC,KAMR9kC,KAAK+kC,YAAYxH,GAInB,OAAOvB,GAYT0F,mCAAA,SACE/sB,EACAqrB,GAEA,IACMrB,EAAY3+B,KAAK4hC,kBACjB3K,EAAcj3B,KAAK8iC,eAAemB,WAAWtvB,EAAM,SACvDic,EACAsS,GAEA,IAAMhvB,EAAeZ,GAAKY,aAAa0c,EAAWjc,GAC5CsiB,EAAciM,EAAUrF,uBAAuB3pB,GACrD,GAAI+iB,EACF,OAAOA,IAGX,OAAO0H,EAAUpH,uBACf5iB,EACAsiB,EACA+I,GAfwB,IA4BpB0B,4CAAR,SACE1R,GAEA,OAAOA,EAAQgV,KACb,SAAC9wB,EAAc+wB,EAAqBC,GAClC,GAAID,GAAuBA,EAAoBxH,kBAE7C,MAAO,CADcwH,EAAoBnH,mBAIzC,IAAIqH,EAAgB,GAOpB,OANIF,IACFE,EAAQF,EAAoBG,iBAE9B57B,EAAQ07B,EAAU,SAAS38B,EAAa88B,GACtCF,EAAQA,EAAM3I,OAAO6I,KAEhBF,KAUPzD,wBAAR,SAAoB4D,GAClB,IAAK,IAAI55B,EAAI,EAAGA,EAAI45B,EAAQxjC,SAAU4J,EAAG,CACvC,IAAM65B,EAAeD,EAAQ55B,GAC7B,IAAK65B,EAAa3b,iBAAiBiS,eAAgB,CAEjD,IAAM2J,EAAkB9D,EAAS6B,cAAcgC,GACzCE,EAAkBzlC,KAAKwjC,eAAegC,UACrCxlC,KAAKwjC,eAAegC,UACpBxlC,KAAK0jC,eAAe,IAAM+B,MAWxB/D,qBAAf,SAAkC/X,GAChC,OACEA,EAAMC,iBAAiBiS,iBACtBlS,EAAMC,iBAAiB8b,YAKK/b,EAAMd,SAE5Bc,GAYH+X,2BAAR,SAAuB/X,EAAcsT,GACnC,IAAMtoB,EAAOgV,EAAMhV,KACb0tB,EAAMriC,KAAK0kC,aAAa/a,GACxB2a,EAAWtkC,KAAKukC,uBAAuBtH,GAEvC9C,EAASn6B,KAAKyhC,gBAAgB+C,eAClC9C,EAAS+C,mBAAmB9a,GAC5B0Y,EACAiC,EAASK,OACTL,EAAShqB,YAGL0V,EAAUhwB,KAAK8iC,eAAe9S,QAAQrb,GAG5C,GAAI0tB,EACFlgC,GACG6tB,EAAQpuB,MAAM67B,kBACf,0DA6BF,IAzBA,IAAMkI,EAAgB3V,EAAQgV,KAAc,SAC1C9wB,EACA+wB,EACAC,GAEA,IACGhxB,EAAatK,WACdq7B,GACAA,EAAoBxH,kBAEpB,MAAO,CAACwH,EAAoBnH,kBAAkBF,YAG9C,IAAIgI,EAAmB,GASvB,OARIX,IACFW,EAAUA,EAAQpJ,OAChByI,EAAoBG,gBAAgBr7B,IAAI,SAAAkzB,GAAQ,OAAAA,EAAKW,eAGzDp0B,EAAQ07B,EAAU,SAAS38B,EAAas9B,GACtCD,EAAUA,EAAQpJ,OAAOqJ,KAEpBD,IAGFjjC,EAAI,EAAGA,EAAIgjC,EAAc7jC,SAAUa,EAAG,CAC7C,IAAMmjC,EAAcH,EAAchjC,GAClC3C,KAAKyhC,gBAAgBmD,cACnBlD,EAAS+C,mBAAmBqB,GAC5B9lC,KAAK0kC,aAAaoB,IAIxB,OAAO3L,GASDuH,mCAAR,SACEzE,GADF,WAGQtT,EAAQsT,EAAKW,WACbyE,EAAMriC,KAAK0kC,aAAa/a,GAE9B,MAAO,CACLgb,OAAQ,WAEN,OADc1H,EAAKvI,kBAAoBpQ,GAAaxH,YACvCsI,QAEf9K,WAAY,SAACyrB,GACX,GAAe,OAAXA,EACF,OAAI1D,EACK57B,EAAKu/B,0BAA0Brc,EAAMhV,KAAM0tB,GAE3C57B,EAAKw/B,oBAAoBtc,EAAMhV,MAKxC,IAAMhP,EnD9KkB,SAASyB,EAAcuiB,GACvD,IAAIuc,EAAS,gBACA,YAAT9+B,EACF8+B,EACE,0FAEe,qBAAR9+B,EACT8+B,EAAS,6DACQ,eAAR9+B,IACT8+B,EAAS,8BAGX,IAAMvgC,EAAQ,IAAIpD,MAChB6E,EAAO,OAASuiB,EAAMhV,KAAKnM,WAAa,KAAO09B,GAGjD,OADCvgC,EAAcyB,KAAOA,EAAK++B,cACpBxgC,EmD8JeygC,CAAmBL,EAAQpc,GACzC,OAAOljB,EAAKk3B,wBACVhU,EACsB,KACtBhkB,MAaK+7B,gBAAf,SAA6B/X,GAC3B,OAAOA,EAAMhV,KAAKnM,WAAa,IAAMmhB,EAAMqE,mBAS9B0T,iBAAf,SACEY,GAEA,IAAM+D,EAAa/D,EAAStsB,QAAQ,KAKpC,OAJA7T,GACkB,IAAhBkkC,GAAqBA,EAAa/D,EAASxgC,OAAS,EACpD,iBAEK,CACLytB,QAAS+S,EAAS/vB,OAAO8zB,EAAa,GACtC1xB,KAAM,IAAIrB,GAAKgvB,EAAS/vB,OAAO,EAAG8zB,MAU9B3E,4BAAR,SAAwBW,GACtB,OAAOriC,KAAK0jC,eAAe,IAAMrB,IAS3BX,yBAAR,SAAqB/X,GACnB,IAAM2Y,EAAWZ,EAAS6B,cAAc5Z,GACxC,OAAOpgB,EAAQvJ,KAAKwjC,eAAgBlB,IAevBZ,mBAAf,WACE,OAAOA,EAAS4E,iBAWV5E,kCAAR,SACEgB,EACArN,GAEA,IAAM6N,EAAYljC,KAAK8iC,eAAen7B,IAAI+6B,GAC1CvgC,EAAO+gC,EAAW,wDAClB,IAAM5N,EAAct1B,KAAK4hC,kBAAkB+B,YAAYjB,GACvD,OAAOQ,EAAUzG,eACfpH,EACAC,EACiB,OAqBboM,wCAAR,SAAoCrM,GAClC,OAAOr1B,KAAKumC,sBACVlR,EACAr1B,KAAK8iC,eACY,KACjB9iC,KAAK4hC,kBAAkB+B,YAAYrwB,GAAK2c,SAcpCyR,kCAAR,SACErM,EACAmR,EACAvP,EACA3B,GAEA,GAAID,EAAU1gB,KAAK/K,UACjB,OAAO5J,KAAKymC,iCACVpR,EACAmR,EACAvP,EACA3B,GAGF,IAAM4N,EAAYsD,EAAc7+B,IAAI2L,GAAK2c,OAGtB,MAAfgH,GAAoC,MAAbiM,IACzBjM,EAAciM,EAAUrF,uBAAuBvqB,GAAK2c,QAGtD,IAAIkK,EAAkB,GAChBnd,EAAYqY,EAAU1gB,KAAKX,WAC3B0yB,EAAiBrR,EAAUsR,kBAAkB3pB,GAC7CsF,EAAYkkB,EAAczW,SAASpoB,IAAIqV,GAC7C,GAAIsF,GAAaokB,EAAgB,CAC/B,IAAME,EAAmB3P,EACrBA,EAAYzS,kBAAkBxH,GAC9B,KACE6pB,EAAmBvR,EAAYpgB,MAAM8H,GAC3Cmd,EAASA,EAAOqC,OACdx8B,KAAKumC,sBACHG,EACApkB,EACAskB,EACAC,IAWN,OANI3D,IACF/I,EAASA,EAAOqC,OACd0G,EAAUzG,eAAepH,EAAWC,EAAa2B,KAI9CkD,GAcHuH,6CAAR,SACErM,EACAmR,EACAvP,EACA3B,GAJF,WAMQ4N,EAAYsD,EAAc7+B,IAAI2L,GAAK2c,OAGtB,MAAfgH,GAAoC,MAAbiM,IACzBjM,EAAciM,EAAUrF,uBAAuBvqB,GAAK2c,QAGtD,IAAIkK,EAAkB,GAyBtB,OAxBAqM,EAAczW,SAASrQ,iBAAiB,SAAC1C,EAAWsF,GAClD,IAAMskB,EAAmB3P,EACrBA,EAAYzS,kBAAkBxH,GAC9B,KACE6pB,EAAmBvR,EAAYpgB,MAAM8H,GACrC0pB,EAAiBrR,EAAUsR,kBAAkB3pB,GAC/C0pB,IACFvM,EAASA,EAAOqC,OACd/1B,EAAKggC,iCACHC,EACApkB,EACAskB,EACAC,OAMJ3D,IACF/I,EAASA,EAAOqC,OACd0G,EAAUzG,eAAepH,EAAWC,EAAa2B,KAI9CkD,GAvKMuH,gBAAgB,qBCpuBjC,aACU1hC,eAAkBskB,GAAaxH,WASzC,OAPEgqB,oBAAA,SAAQnyB,GACN,OAAO3U,KAAK+mC,UAAUtiB,SAAS9P,IAGjCmyB,2BAAA,SAAenyB,EAAYqyB,GACzBhnC,KAAK+mC,UAAY/mC,KAAK+mC,UAAUzpB,YAAY3I,EAAMqyB,uBCNpD,WAAoBC,GAAAjnC,UAAAinC,EAyDtB,OAnDEC,qBAAA,SAASC,GACP,OAAOnnC,KAAKinC,KAAe,SAAY,SAAEE,GAAcC,KACrD,KAEA,SAASzhC,GAGP,OAAIA,GAAwB,+BAAfA,EAAMyB,MACjBmG,GAAI,kEACG,MAEAjH,QAAQE,OAAOb,MAM9BuhC,mCAAA,SAAuB5C,GAGrBtkC,KAAKinC,KAAe,SAAwB,qBAAE3C,IAGhD4C,sCAAA,SAA0B5C,GACxBtkC,KAAKinC,KAAe,SAA2B,wBAAE3C,IAGnD4C,kCAAA,WACE,IAAIG,EACF,0DACArnC,KAAKinC,KAAKx/B,KACV,iFAEE,eAAgBzH,KAAKinC,KAAKK,QAC5BD,GACE,uJAGO,mBAAoBrnC,KAAKinC,KAAKK,QACvCD,GACE,2JAIFA,GACE,kKAIJ35B,GAAK25B,uBC1DT,aACUrnC,eAAqC,GAW/C,OATEunC,6BAAA,SAAiB9/B,EAAc+/B,gBAAAA,KACxBn+B,EAASrJ,KAAKynC,UAAWhgC,KAAOzH,KAAKynC,UAAUhgC,GAAQ,GAE5DzH,KAAKynC,UAAUhgC,IAAS+/B,GAG1BD,gBAAA,WACE,OAAO3hC,EAAS5F,KAAKynC,+BCfzB,cA0BA,OAtBSC,gBAAP,SAAqBjwB,GACnB,IAAMkwB,EAAalwB,EAASjP,WAM5B,OAJKxI,KAAK4nC,aAAaD,KACrB3nC,KAAK4nC,aAAaD,GAAc,IAAIJ,IAG/BvnC,KAAK4nC,aAAaD,IAGpBD,sBAAP,SACEjwB,EACAowB,GAEA,IAAMF,EAAalwB,EAASjP,WAM5B,OAJKxI,KAAK8nC,WAAWH,KACnB3nC,KAAK8nC,WAAWH,GAAcE,KAGzB7nC,KAAK8nC,WAAWH,IAvBVD,eAAiD,GACjDA,aAAmC,sBCOlD,WAAoBK,GAAA/nC,iBAAA+nC,EAFZ/nC,WAAwC,KAiBlD,OAbEgoC,gBAAA,WACE,IAAMC,EAAWjoC,KAAK+nC,YAAYpgC,MAE5BugC,EAAyBx+B,EAAMu+B,GAQrC,OAPIjoC,KAAKmoC,OACP3+B,EAAQxJ,KAAKmoC,MAAO,SAACC,EAAcxmC,GACjCsmC,EAAME,GAAQF,EAAME,GAAQxmC,IAGhC5B,KAAKmoC,MAAQF,EAENC,sBCCT,WAAYG,EAAqCC,GAAAtoC,aAAAsoC,EANzCtoC,oBAA2C,GAOjDA,KAAKuoC,eAAiB,IAAIP,GAAcK,GAExC,IAAMr1B,EApBmB,IAsBvB,IAAgDpB,KAAK0J,SACvDxI,GAAsB9S,KAAKwoC,aAAa54B,KAAK5P,MAAO4R,KAAKI,MAAMgB,IA6BnE,OA1BEy1B,wBAAA,SAAYL,GACVpoC,KAAK0oC,eAAeN,IAAQ,GAGtBK,yBAAR,WAAA,WACQE,EAAQ3oC,KAAKuoC,eAAe5gC,MAC5BihC,EAA8B,GAChCC,GAAoB,EAExBr/B,EAAQm/B,EAAO,SAACP,EAAcxmC,GAChB,EAARA,GAAayH,EAAS5C,EAAKiiC,eAAgBN,KAC7CQ,EAAcR,GAAQxmC,EACtBinC,GAAoB,KAIpBA,GACF7oC,KAAKsoC,QAAQQ,YAAYF,GAI3B91B,GACE9S,KAAKwoC,aAAa54B,KAAK5P,MACvB4R,KAAKI,MAAsB,EAAhBJ,KAAK0J,SA7CQ,0BCK9B,aAKUtb,iBAA2B,GAO3BA,qBAAkB,EAyF5B,OApFE+oC,wBAAA,SAAYC,GAGV,IADA,IAAIC,EAAW,KACNtmC,EAAI,EAAGA,EAAIqmC,EAAclnC,OAAQa,IAAK,CAC7C,IAAMonB,EAAYif,EAAcrmC,GAC1BumC,EAAYnf,EAAUX,UACX,OAAb6f,GAAsBC,EAAU5qB,OAAO2qB,EAAS7f,aAClDppB,KAAKmpC,YAAYpnC,KAAKknC,GACtBA,EAAW,MAGI,OAAbA,IACFA,EAAW,IAAIG,GAAUF,IAG3BD,EAAS3a,IAAIvE,GAEXkf,GACFjpC,KAAKmpC,YAAYpnC,KAAKknC,IAa1BF,8BAAA,SAAkBp0B,EAAYq0B,GAC5BhpC,KAAKqpC,YAAYL,GACjBhpC,KAAKspC,oCAAoC,SAACJ,GACxC,OAAAA,EAAU5qB,OAAO3J,MAarBo0B,sCAAA,SAA0BQ,EAAmBP,GAC3ChpC,KAAKqpC,YAAYL,GAEjBhpC,KAAKspC,oCAAoC,SAACJ,GACxC,OAAOA,EAAU7/B,SAASkgC,IAAgBA,EAAYlgC,SAAS6/B,MAQ3DH,gDAAR,SACE3Y,GAEApwB,KAAKwpC,kBAGL,IADA,IAAIC,GAAU,EACL9mC,EAAI,EAAGA,EAAI3C,KAAKmpC,YAAYrnC,OAAQa,IAAK,CAChD,IAAM+mC,EAAY1pC,KAAKmpC,YAAYxmC,GACnC,GAAI+mC,EAEEtZ,EADcsZ,EAAUtgB,YAE1BppB,KAAKmpC,YAAYxmC,GAAGgnC,QACpB3pC,KAAKmpC,YAAYxmC,GAAK,MAEtB8mC,GAAU,EAKZA,IACFzpC,KAAKmpC,YAAc,IAGrBnpC,KAAKwpC,sCAeP,WAA6BrwB,GAAAnZ,WAAAmZ,EAFrBnZ,aAAmB,GAkC7B,OA3BEopC,gBAAA,SAAIrf,GACF/pB,KAAK4pC,QAAQ7nC,KAAKgoB,IAMpBqf,kBAAA,WACE,IAAK,IAAIzmC,EAAI,EAAGA,EAAI3C,KAAK4pC,QAAQ9nC,OAAQa,IAAK,CAC5C,IAAMonB,EAAY/pB,KAAK4pC,QAAQjnC,GAC/B,GAAkB,OAAdonB,EAAoB,CACtB/pB,KAAK4pC,QAAQjnC,GAAK,KAClB,IAAMknC,EAAU9f,EAAUZ,iBACtB5Z,GACFhC,GAAI,UAAYwc,EAAUvhB,YAE5BoK,GAAei3B,MAQrBT,oBAAA,WACE,OAAOppC,KAAKmZ,0BCjJd,WAAoB2wB,GAAA9pC,oBAAA8pC,EAVZ9pC,gBAKJ,GAMFmC,EACExC,MAAMgE,QAAQmmC,IAA2C,EAAxBA,EAAehoC,OAChD,8BA8DN,OA5CYioC,oBAAV,SAAkBhwB,OAAmB,aAAA/M,mBAAAA,IAAAsC,oBACnC,GAAI3P,MAAMgE,QAAQ3D,KAAKgqC,WAAWjwB,IAIhC,IAFA,IAAMkwB,EAAgBjqC,KAAKgqC,WAAWjwB,WAE7BpX,EAAI,EAAGA,EAAIsnC,EAAUnoC,OAAQa,IACpCsnC,EAAUtnC,GAAGgE,SAASW,MAAM2iC,EAAUtnC,GAAG4J,QAAS+C,IAKxDy6B,eAAA,SAAGhwB,EAAmBpT,EAA4B4F,GAChDvM,KAAKkqC,mBAAmBnwB,GACxB/Z,KAAKgqC,WAAWjwB,GAAa/Z,KAAKgqC,WAAWjwB,IAAc,GAC3D/Z,KAAKgqC,WAAWjwB,GAAWhY,KAAK,CAAE4E,WAAU4F,YAE5C,IAAMwd,EAAY/pB,KAAKmqC,gBAAgBpwB,GACnCgQ,GACFpjB,EAASW,MAAMiF,EAASwd,IAI5BggB,gBAAA,SAAIhwB,EAAmBpT,EAA4B4F,GACjDvM,KAAKkqC,mBAAmBnwB,GAExB,IADA,IAAMkwB,EAAYjqC,KAAKgqC,WAAWjwB,IAAc,GACvCpX,EAAI,EAAGA,EAAIsnC,EAAUnoC,OAAQa,IACpC,GACEsnC,EAAUtnC,GAAGgE,WAAaA,KACxB4F,GAAWA,IAAY09B,EAAUtnC,GAAG4J,SAGtC,YADA09B,EAAUzK,OAAO78B,EAAG,IAMlBonC,+BAAR,SAA2BhwB,GACzB5X,EACEnC,KAAK8pC,eAAezb,KAAK,SAAS+b,GAChC,OAAOA,IAAOrwB,IAEhB,kBAAoBA,wBChExB,aAAA,IAEMswB,EACAC,IAFJ5jB,YAAM,CAAC,wBAIe,oBAAb6jB,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,iBAQb5jC,EAAKgkC,UAAW,EAEZH,GACFC,SAASC,iBACPF,EACA,WACE,IAAMtL,GAAWuL,SAASF,GACtBrL,IAAYv4B,EAAKgkC,WACnBhkC,EAAKgkC,SAAWzL,EAChBv4B,EAAKikC,QAAQ,UAAW1L,MAG5B,KAaR,OA5DuChjB,OAG9B2uB,cAAP,WACE,OAAO,IAAIA,GAoDbA,4BAAA,SAAgB5wB,GAEd,OADA5X,EAAqB,YAAd4X,EAAyB,uBAAyBA,GAClD,CAAC/Z,KAAKyqC,cA1DsBV,mBCYrC,aAAA,MACErjB,YAAM,CAAC,wBAPDjgB,WAAU,EAcI,oBAAXK,aAC4B,IAA5BA,OAAO0jC,kBACb3jC,MAEDC,OAAO0jC,iBACL,SACA,WACO/jC,EAAKmkC,UACRnkC,EAAKmkC,SAAU,EACfnkC,EAAKikC,QAAQ,UAAU,MAG3B,GAGF5jC,OAAO0jC,iBACL,UACA,WACM/jC,EAAKmkC,UACPnkC,EAAKmkC,SAAU,EACfnkC,EAAKikC,QAAQ,UAAU,MAG3B,MAoBR,OA1DmC1uB,OAG1B6uB,cAAP,WACE,OAAO,IAAIA,GA2CbA,4BAAA,SAAgB9wB,GAEd,OADA5X,EAAqB,WAAd4X,EAAwB,uBAAyBA,GACjD,CAAC/Z,KAAK4qC,UAMfC,4BAAA,WACE,OAAO7qC,KAAK4qC,YAxDmBb,kBCGjC,WAAoBe,GAAA9qC,gBAAA8qC,EARpB9qC,sBAA0B,GAC1BA,wBAAqB,EACrBA,yBAAsB,EACtBA,aAA+B,KA6CjC,OAtCE+qC,uBAAA,SAAWC,EAAqBrkC,GAC9B3G,KAAKirC,mBAAqBD,EAC1BhrC,KAAKkrC,QAAUvkC,EACX3G,KAAKirC,mBAAqBjrC,KAAKmrC,qBACjCnrC,KAAKkrC,UACLlrC,KAAKkrC,QAAU,OAWnBH,2BAAA,SAAeK,EAAoBnjC,GAAnC,WACEjI,KAAKqrC,iBAAiBD,GAAcnjC,EACpC,qBACE,IAAMqjC,EAAYC,EAAKF,iBAAiBE,EAAKJ,2BACtCI,EAAKF,iBAAiBE,EAAKJ,oBAClC,mBAASxoC,GACH2oC,EAAU3oC,IACZiQ,GAAe,WACbnM,EAAKqkC,WAAWQ,EAAU3oC,OAHvBA,EAAI,EAAGA,EAAI2oC,EAAUxpC,SAAUa,IAA/BA,GAOT,GAAI4oC,EAAKJ,qBAAuBI,EAAKN,0BAC/BM,EAAKL,UACPK,EAAKL,UACLK,EAAKL,QAAU,cAInBK,EAAKJ,6BAjBAnrC,KAAKqrC,iBAAiBrrC,KAAKmrC,kEC6DpC,WACSK,EACA/zB,EACAg0B,EACAC,GAHA1rC,YAAAwrC,EACAxrC,cAAAyX,EACAzX,wBAAAyrC,EACAzrC,mBAAA0rC,EA5BT1rC,eAAY,EACZA,mBAAgB,EAURA,qBAAiB,EAmBvBA,KAAK2rC,KAAO57B,GAAWy7B,GACvBxrC,KAAK4rC,OAASlE,GAAamE,cAAcp0B,GACzCzX,KAAK8rC,MAAQ,SAACv1B,GACZ,OAAAkB,EAASs0B,cAAct2B,GAAcc,IAqQ3C,OA7PEy1B,iBAAA,SAAKC,EAAkCC,GAAvC,WACElsC,KAAKmsC,cAAgB,EACrBnsC,KAAKosC,cAAgBF,EACrBlsC,KAAKqsC,gBAAkB,IAAItB,GAAekB,GAC1CjsC,KAAKssC,WAAY,EAEjBtsC,KAAKusC,qBAAuB15B,WAAW,WACrCpM,EAAKklC,KAAK,gCAEVllC,EAAK+lC,YACL/lC,EAAK8lC,qBAAuB,MAC3B36B,KAAKI,MA7De,M/D8IQ,SAASvI,GAC1C,GAA2C,aAAvC8gC,SAAwBkC,WAC1BhjC,QACK,CAIL,IAAIijC,GAAS,EACTC,EAAY,WACTpC,SAASjqC,KAKTosC,IACHA,GAAS,EACTjjC,KANAoJ,WAAW85B,EAAW/6B,KAAKI,MAAM,MAUjCu4B,SAASC,kBACXD,SAASC,iBAAiB,mBAAoBmC,GAAW,GAEzD7lC,OAAO0jC,iBAAiB,OAAQmC,GAAW,IACjCpC,SAAiBqC,cAE1BrC,SAAiBqC,YAAY,qBAAsB,WACtB,aAAxBrC,SAASkC,YAA2BE,MAGzC7lC,OAAe8lC,YAAY,SAAUD,K+D5GxCE,CAAoB,WAClB,IAAIpmC,EAAK6lC,UAAT,CAGA7lC,EAAKqmC,gBAAkB,IAAIC,GACzB,eAAC,aAAA//B,mBAAAA,IAAAC,kBACQ,IAAA+/B,OAASC,OAAMC,OAEtB,GADAzmC,EAAK0mC,wBAAwBlgC,GACxBxG,EAAKqmC,gBAOV,GALIrmC,EAAK8lC,uBACPa,aAAa3mC,EAAK8lC,sBAClB9lC,EAAK8lC,qBAAuB,MAE9B9lC,EAAK4mC,gBAAiB,EAjHa,SAkH/BL,EACFvmC,EAAKiG,GAAKugC,EACVxmC,EAAK6mC,SAAWJ,MACX,CAAA,GApH8B,UAoH1BF,EAgBT,MAAM,IAAIzqC,MAAM,kCAAoCyqC,GAdhDC,GAGFxmC,EAAKqmC,gBAAgBS,cAAe,EAIpC9mC,EAAK4lC,gBAAgBmB,WAAWP,EAAM,WACpCxmC,EAAK+lC,eAGP/lC,EAAK+lC,cAMX,eAAC,aAAAx/B,mBAAAA,IAAAC,kBACQ,IAAAwgC,OAAIxlC,OACXxB,EAAK0mC,wBAAwBlgC,GAC7BxG,EAAK4lC,gBAAgBqB,eAAeD,EAAIxlC,IAE1C,WACExB,EAAK+lC,aAEP/lC,EAAKqlC,OAKP,IAAM6B,EAA8C,CACpDC,MAA2C,KAC3CD,EAAwC,IAAI/7B,KAAKI,MAC/B,IAAhBJ,KAAK0J,UAEH7U,EAAKqmC,gBAAgBe,2BACvBF,EACqC,GACjClnC,EAAKqmC,gBAAgBe,0BAC3BF,EAAuB,E1D3LG,I0D4LtBlnC,EAAKglC,qBACPkC,EAAiC,EAAIlnC,EAAKglC,oBAExChlC,EAAKilC,gBACPiC,EAA4B,GAAIlnC,EAAKilC,eAIjB,oBAAbp0B,UACPA,SAASw2B,OACgC,IAAzCx2B,SAASw2B,KAAK93B,QAAQT,MAEtBo4B,EAAuB,E1DhMN,K0DkMnB,IAAMI,EAAatnC,EAAKqlC,MAAM6B,GAC9BlnC,EAAKklC,KAAK,+BAAiCoC,GAC3CtnC,EAAKqmC,gBAAgBkB,OAAOD,EAAY,kBAS5C/B,kBAAA,WACEhsC,KAAK8sC,gBAAgBmB,cAAcjuC,KAAK0M,GAAI1M,KAAKstC,UACjDttC,KAAKkuC,uBAAuBluC,KAAK0M,GAAI1M,KAAKstC,WAQrCtB,aAAP,WACEA,EAAsBmC,aAAc,GAQ/BnC,gBAAP,WACEA,EAAsBoC,gBAAiB,GAIlCpC,cAAP,WAGE,OACEA,EAAsBmC,cACpBnC,EAAsBoC,gBACF,oBAAb7D,UACmB,MAA1BA,SAAS8D,iB/DkPK,iBAAXvnC,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAOwQ,SAASw2B,UAUR,iBAAZQ,SAA8C,iBAAfA,QAAQC,M+D5P9CtnC,KAOP+kC,kCAAA,aAMQA,sBAAR,WACEhsC,KAAKssC,WAAY,EAEbtsC,KAAK8sC,kBACP9sC,KAAK8sC,gBAAgB0B,QACrBxuC,KAAK8sC,gBAAkB,MAIrB9sC,KAAKyuC,iBACPlE,SAASjqC,KAAKouC,YAAY1uC,KAAKyuC,gBAC/BzuC,KAAKyuC,eAAiB,MAGpBzuC,KAAKusC,uBACPa,aAAaptC,KAAKusC,sBAClBvsC,KAAKusC,qBAAuB,OAQxBP,sBAAR,WACOhsC,KAAKssC,YACRtsC,KAAK2rC,KAAK,8BACV3rC,KAAK2uC,YAED3uC,KAAKosC,gBACPpsC,KAAKosC,cAAcpsC,KAAKqtC,gBACxBrtC,KAAKosC,cAAgB,QAS3BJ,kBAAA,WACOhsC,KAAKssC,YACRtsC,KAAK2rC,KAAK,6BACV3rC,KAAK2uC,cAST3C,iBAAA,SAAK/jC,GACH,IAAM2mC,EAAU/lC,EAAUZ,GAC1BjI,KAAK6uC,WAAaD,EAAQ9sC,OAC1B9B,KAAK4rC,OAAOkD,iBAAiB,aAAcF,EAAQ9sC,QAWnD,IARA,I3EFIoN,E2EEE6/B,G3EFF7/B,EAAY1M,E2EEgBosC,G3ED3B9rC,EAAOU,gBAAgB0L,GAAW,I2EKjCkC,EAAWH,GAAkB89B,EAlRdC,MAsRZrsC,EAAI,EAAGA,EAAIyO,EAAStP,OAAQa,IACnC3C,KAAK8sC,gBAAgBmC,eACnBjvC,KAAKmsC,cACL/6B,EAAStP,OACTsP,EAASzO,IAEX3C,KAAKmsC,iBAWTH,mCAAA,SAAuBt/B,EAAYwiC,GAEjClvC,KAAKyuC,eAAiBlE,SAAS8D,cAAc,UAC7C,IAAMV,EAAqC,CAC3CwB,OAA2D,KAC3DxB,EAAoC,GAAIjhC,EACxCihC,EAAoC,GAAIuB,EACxClvC,KAAKyuC,eAAeW,IAAMpvC,KAAK8rC,MAAM6B,GACrC3tC,KAAKyuC,eAAeY,MAAMC,QAAU,OAEpC/E,SAASjqC,KAAKivC,YAAYvvC,KAAKyuC,iBAQzBzC,oCAAR,SAAgC/+B,GAE9B,IAAMuiC,EAAgB3mC,EAAUoE,GAAMnL,OACtC9B,KAAKwvC,eAAiBA,EACtBxvC,KAAK4rC,OAAOkD,iBAAiB,iBAAkBU,uBAgDjD,WACEC,EACAC,EACOxD,EACAJ,GADA9rC,kBAAAksC,EACAlsC,WAAA8rC,EAlCT9rC,yBAAsB,IAAIiuB,GAG1BjuB,iBAAqD,GAOrDA,mBAAgB4R,KAAKI,MAAsB,IAAhBJ,KAAK0J,UAIhCtb,mBAAe,EA2BXA,KAAK6tC,yBAA2B7+B,IAC/BlI,OA1Y0C,aA2YL9G,KAAK6tC,0BACvC4B,EACH3oC,OA5YuC,UA6YL9G,KAAK6tC,0BACpC6B,EAGJ1vC,KAAK2vC,SAAW5C,EAA2B6C,gBAG3C,IAAIC,EAAS,GAIX7vC,KAAK2vC,SAASP,KACwC,gBAAtDpvC,KAAK2vC,SAASP,IAAI78B,OAAO,EAAG,cAAczQ,UAG1C+tC,EAAS,4BADatF,SAASx0B,OACwB,gBAEzD,IAAM+5B,EAAiB,eAAiBD,EAAS,iBACjD,IACE7vC,KAAK2vC,SAASI,IAAIC,OAClBhwC,KAAK2vC,SAASI,IAAIzP,MAAMwP,GACxB9vC,KAAK2vC,SAASI,IAAIvB,QAClB,MAAOxsC,GACPuL,GAAI,2BACAvL,EAAE4F,OACJ2F,GAAIvL,EAAE4F,OAER2F,GAAIvL,IAuQZ,OAzPiB+qC,gBAAf,WACE,IAAMkD,EAAS1F,SAAS8D,cAAc,UAItC,GAHA4B,EAAOZ,MAAMC,QAAU,QAGnB/E,SAASjqC,KAqBX,KAAM,oGApBNiqC,SAASjqC,KAAKivC,YAAYU,GAC1B,IAIYA,EAAOC,cAAc3F,UAG7Bh9B,GAAI,iCAEN,MAAOvL,GACP,IAAM+T,EAASw0B,SAASx0B,OACxBk6B,EAAOb,IACL,gEACAr5B,EACA,2BAiBN,OARIk6B,EAAOE,gBACRF,EAAeF,IAAME,EAAOE,gBACpBF,EAAOC,cACfD,EAAeF,IAAME,EAAOC,cAAc3F,SACjC0F,EAAe1F,WACxB0F,EAAeF,IAAOE,EAAe1F,UAGjC0F,GAMTlD,kBAAA,WAAA,WAEE/sC,KAAKowC,OAAQ,EAETpwC,KAAK2vC,WAIP3vC,KAAK2vC,SAASI,IAAIzvC,KAAK+vC,UAAY,GACnCx9B,WAAW,WACa,OAAlBpM,EAAKkpC,WACPpF,SAASjqC,KAAKouC,YAAYjoC,EAAKkpC,UAC/BlpC,EAAKkpC,SAAW,OAEjB/9B,KAAKI,MAAM,KAahB,IAAMk6B,EAAelsC,KAAKksC,aACtBA,IACFlsC,KAAKksC,aAAe,KACpBA,MASJa,0BAAA,SAAcrgC,EAAYwiC,GAMxB,IALAlvC,KAAKswC,KAAO5jC,EACZ1M,KAAKuwC,KAAOrB,EACZlvC,KAAKowC,OAAQ,EAGNpwC,KAAKwwC,kBAUNzD,wBAAR,WAIE,GACE/sC,KAAKowC,OACLpwC,KAAKutC,cACLvtC,KAAKywC,oBAAoBhxB,SAAqC,EAA1Bzf,KAAK0wC,YAAY5uC,OAAa,EAAI,GACtE,CAEA9B,KAAK2wC,gBACL,IAAMhD,EAA8C,GACpDA,EAAoC,GAAI3tC,KAAKswC,KAC7C3C,EAAoC,GAAI3tC,KAAKuwC,KAC7C5C,EAAwC,IAAI3tC,KAAK2wC,cAMjD,IALA,IAAIC,EAAS5wC,KAAK8rC,MAAM6B,GAEpBkD,EAAgB,GAChBluC,EAAI,EAEyB,EAA1B3C,KAAK0wC,YAAY5uC,QAAY,CAGlC,KADgB9B,KAAK0wC,YAAY,GAEvBpxC,EAAEwC,OAliBI,GAkiBuB+uC,EAAc/uC,QAniBnC,MA2jBhB,MApBA,IAAMgvC,EAAS9wC,KAAK0wC,YAAYK,QAChCF,EACEA,EACA,OAEAluC,EACA,IACAmuC,EAAOE,IACP,MAEAruC,EACA,IACAmuC,EAAOG,GACP,KAEAtuC,EACA,IACAmuC,EAAOxxC,EACTqD,IASJ,OAHAiuC,GAAkBC,EAClB7wC,KAAKkxC,gBAAgBN,EAAQ5wC,KAAK2wC,gBAE3B,EAEP,OAAO,GAUX5D,2BAAA,SAAeoE,EAAgBC,EAAmBnpC,GAEhDjI,KAAK0wC,YAAY3uC,KAAK,CAAEivC,IAAKG,EAAQF,GAAIG,EAAW9xC,EAAG2I,IAInDjI,KAAKowC,OACPpwC,KAAKwwC,eAUDzD,4BAAR,SAAwBsE,EAAaC,GAArC,WAEEtxC,KAAKywC,oBAAoBniB,IAAIgjB,EAAQ,GAErC,IAAMC,EAAe,WACnB9qC,EAAKgqC,oBAAoB3gC,OAAOwhC,GAChC7qC,EAAK+pC,eAKDgB,EAAmB3+B,WACvB0+B,EACA3/B,KAAKI,MAjmBwB,OA4mB/BhS,KAAKguC,OAAOqD,EARS,WAEnBjE,aAAaoE,GAGbD,OAWJxE,mBAAA,SAAOsE,EAAaI,GAApB,WAII5+B,WAAW,WACT,IAEE,IAAKpM,EAAK8mC,aAAc,OACxB,IAAMmE,EAAYjrC,EAAKkpC,SAASI,IAAI1B,cAAc,UAClDqD,EAAUp7B,KAAO,kBACjBo7B,EAAUC,OAAQ,EAClBD,EAAUtC,IAAMiC,EAChBK,EAAUE,OAAUF,EAAkBG,mBAAqB,WACzD,IAAMC,EAAUJ,EAAkBjF,WAC7BqF,GAAqB,WAAXA,GAAkC,aAAXA,IACpCJ,EAAUE,OAAUF,EAAkBG,mBAAqB,KACvDH,EAAUK,YACZL,EAAUK,WAAWrD,YAAYgD,GAEnCD,MAGJC,EAAUM,QAAU,WAClBzkC,GAAI,oCAAsC8jC,GAC1C5qC,EAAK8mC,cAAe,EACpB9mC,EAAK+nC,SAEP/nC,EAAKkpC,SAASI,IAAIzvC,KAAKivC,YAAYmC,GACnC,MAAO1vC,MAGR4P,KAAKI,MAAM,UChrBhBigC,GAAgB,KACQ,oBAAjBC,aACTD,GAAgBC,aACc,oBAAdC,YAChBF,GAAgBE,WAYlB,kBAsBE,WACS3G,EACP/zB,EACAg0B,EACAC,GAHO1rC,YAAAwrC,EAtBTxrC,oBAAgC,KAChCA,YAA0B,KAC1BA,iBAAc,EACdA,eAAY,EACZA,mBAAgB,EAuBdA,KAAK2rC,KAAO57B,GAAW/P,KAAKwrC,QAC5BxrC,KAAK4rC,OAASlE,GAAamE,cAAcp0B,GACzCzX,KAAKwW,QAAU47B,EAAoBC,eACjC56B,EACAg0B,EACAC,GAmVN,OAvUiB0G,iBAAf,SACE36B,EACAg0B,EACAC,GAEA,IAAMiC,EAAqC,CAC3CpsC,E3D/F4B,K2D+G5B,MAZsB,oBAAb+V,UACPA,SAASw2B,OACgC,IAAzCx2B,SAASw2B,KAAK93B,QAAQT,MAEtBo4B,EAAuB,E3D/FJ,K2DiGjBlC,IACFkC,EAAiC,EAAIlC,GAEnCC,IACFiC,EAA4B,GAAIjC,GAE3Bj0B,EAASs0B,cAAcv2B,GAAWm4B,IAQ3CyE,iBAAA,SAAKnG,EAAkCC,GAAvC,WACElsC,KAAKksC,aAAeA,EACpBlsC,KAAKisC,UAAYA,EAEjBjsC,KAAK2rC,KAAK,2BAA6B3rC,KAAKwW,SAE5CxW,KAAKqtC,gBAAiB,EAEtBx+B,EAAkBgB,IAAI,8BAA8B,GAEpD,IAyBI7P,KAAKsyC,OAAS,IAAIL,GAAcjyC,KAAKwW,SAEvC,MAAOxU,GACPhC,KAAK2rC,KAAK,kCACV,IAAMhmC,EAAQ3D,EAAEK,SAAWL,EAAEiG,KAK7B,OAJItC,GACF3F,KAAK2rC,KAAKhmC,QAEZ3F,KAAKwsC,YAIPxsC,KAAKsyC,OAAOC,OAAS,WACnB9rC,EAAKklC,KAAK,wBACVllC,EAAK4mC,gBAAiB,GAGxBrtC,KAAKsyC,OAAOE,QAAU,WACpB/rC,EAAKklC,KAAK,0CACVllC,EAAK6rC,OAAS,KACd7rC,EAAK+lC,aAGPxsC,KAAKsyC,OAAOG,UAAY,SAACC,GACvBjsC,EAAKksC,oBAAoBD,IAG3B1yC,KAAKsyC,OAAON,QAAU,SAAChwC,GACrByE,EAAKklC,KAAK,yCACV,IAAMhmC,EAAQ3D,EAAEK,SAAWL,EAAEiG,KACzBtC,GACFc,EAAKklC,KAAKhmC,GAEZc,EAAK+lC,cAOT4F,kBAAA,aAIOA,gBAAP,WACEA,EAAoBhE,gBAAiB,GAGhCgE,cAAP,WACE,IAAIQ,GAAe,EACnB,GAAyB,oBAAd5rC,WAA6BA,UAAU6rC,UAAW,CAC3D,IACMC,EAAkB9rC,UAAU6rC,UAAUvqC,MADpB,kCAEpBwqC,GAA4C,EAAzBA,EAAgBhxC,QACjCixC,WAAWD,EAAgB,IAAM,MACnCF,GAAe,GAKrB,OACGA,GACiB,OAAlBX,KACCG,EAAoBhE,gBAoBlBgE,mBAAP,WAGE,OACEvjC,EAAkBmkC,oBACsC,IAAxDnkC,EAAkBlH,IAAI,+BAI1ByqC,kCAAA,WACEvjC,EAAkBiB,OAAO,+BAGnBsiC,yBAAR,SAAqBnqC,GAEnB,GADAjI,KAAKizC,OAAOlxC,KAAKkG,GACbjI,KAAKizC,OAAOnxC,QAAU9B,KAAKkzC,YAAa,CAC1C,IAAMC,EAAWnzC,KAAKizC,OAAOzuC,KAAK,IAClCxE,KAAKizC,OAAS,KACd,IAAMG,EAAW1qC,EAASyqC,GAG1BnzC,KAAKisC,UAAUmH,KAQXhB,iCAAR,SAA6BiB,GAC3BrzC,KAAKkzC,YAAcG,EACnBrzC,KAAKizC,OAAS,IASRb,+BAAR,SAA2BnqC,GAIzB,GAHA9F,EAAuB,OAAhBnC,KAAKizC,OAAiB,kCAGzBhrC,EAAKnG,QAAU,EAAG,CACpB,IAAMuxC,EAAaljC,OAAOlI,GAC1B,IAAKqrC,MAAMD,GAET,OADArzC,KAAKuzC,qBAAqBF,GACnB,KAIX,OADArzC,KAAKuzC,qBAAqB,GACnBtrC,GAOTmqC,gCAAA,SAAoBoB,GAClB,GAAoB,OAAhBxzC,KAAKsyC,OAAT,CACA,IAAMrqC,EAAOurC,EAAW,KAMxB,GALAxzC,KAAKwvC,eAAiBvnC,EAAKnG,OAC3B9B,KAAK4rC,OAAOkD,iBAAiB,iBAAkB7mC,EAAKnG,QAEpD9B,KAAKyzC,iBAEe,OAAhBzzC,KAAKizC,OAEPjzC,KAAK0zC,aAAazrC,OACb,CAEL,IAAM0rC,EAAgB3zC,KAAK4zC,mBAAmB3rC,GACxB,OAAlB0rC,GACF3zC,KAAK0zC,aAAaC,MASxBvB,iBAAA,SAAKnqC,GACHjI,KAAKyzC,iBAEL,IAAM7E,EAAU/lC,EAAUZ,GAC1BjI,KAAK6uC,WAAaD,EAAQ9sC,OAC1B9B,KAAK4rC,OAAOkD,iBAAiB,aAAcF,EAAQ9sC,QAKnD,IAAMsP,EAAWH,GAAkB29B,EAjTN,OAoTP,EAAlBx9B,EAAStP,QACX9B,KAAK6zC,YAAY9uC,OAAOqM,EAAStP,SAInC,IAAK,IAAIa,EAAI,EAAGA,EAAIyO,EAAStP,OAAQa,IACnC3C,KAAK6zC,YAAYziC,EAASzO,KAItByvC,sBAAR,WACEpyC,KAAKssC,WAAY,EACbtsC,KAAK8zC,iBACPC,cAAc/zC,KAAK8zC,gBACnB9zC,KAAK8zC,eAAiB,MAGpB9zC,KAAKsyC,SACPtyC,KAAKsyC,OAAO9D,QACZxuC,KAAKsyC,OAAS,OAIVF,sBAAR,WACOpyC,KAAKssC,YACRtsC,KAAK2rC,KAAK,+BACV3rC,KAAK2uC,YAGD3uC,KAAKksC,eACPlsC,KAAKksC,aAAalsC,KAAKqtC,gBACvBrtC,KAAKksC,aAAe,QAS1BkG,kBAAA,WACOpyC,KAAKssC,YACRtsC,KAAK2rC,KAAK,6BACV3rC,KAAK2uC,cAQTyD,2BAAA,WAAA,WACE2B,cAAc/zC,KAAK8zC,gBACnB9zC,KAAK8zC,eAAiBE,YAAY,WAE5BvtC,EAAK6rC,QACP7rC,EAAKotC,YAAY,KAEnBptC,EAAKgtC,kBACJ7hC,KAAKI,MA9WyB,QAuX3BogC,wBAAR,SAAoB3vC,GAIlB,IACEzC,KAAKsyC,OAAO2B,KAAKxxC,GACjB,MAAOT,GACPhC,KAAK2rC,KACH,0CACA3pC,EAAEK,SAAWL,EAAEiG,KACf,uBAEF4K,WAAW7S,KAAKwsC,UAAU58B,KAAK5P,MAAO,KA5LnCoyC,+BAA+B,EAM/BA,iBAAiB,uBC3MxB,WAAY36B,GACVzX,KAAKk0C,gBAAgBz8B,GA4DzB,OApEEjY,sBAAW20C,wBAAX,WACE,MAAO,CAACnI,GAAuBoG,qCAczB+B,4BAAR,SAAwB18B,GACtB,IAAM28B,EACJhC,IAAuBA,GAAiC,cACtDiC,EACFD,IAA0BhC,GAAoBkC,mBAWhD,GATI78B,EAAS5B,gBACNu+B,GACH1mC,GACE,mFAGJ2mC,GAAuB,GAGrBA,EACFr0C,KAAKu0C,YAAc,CAACnC,QACf,CACL,IAAMoC,EAAcx0C,KAAKu0C,YAAc,GACvCjjC,GACE6iC,EAAiBM,eACjB,SAAC9xC,EAAW+xC,GACNA,GAAaA,EAAuB,eACtCF,EAAWzyC,KAAK2yC,OAW1BP,6BAAA,WACE,GAA8B,EAA1Bn0C,KAAKu0C,YAAYzyC,OACnB,OAAO9B,KAAKu0C,YAAY,GAExB,MAAM,IAAIhyC,MAAM,4BAQpB4xC,6BAAA,WACE,OAA8B,EAA1Bn0C,KAAKu0C,YAAYzyC,OACZ9B,KAAKu0C,YAAY,GAEjB,yBCVX,WACS7nC,EACCioC,EACA7J,EACA8J,EACAxI,EACAyI,EACDnJ,GANA1rC,QAAA0M,EACC1M,eAAA20C,EACA30C,gBAAA8qC,EACA9qC,cAAA40C,EACA50C,mBAAAosC,EACApsC,aAAA60C,EACD70C,mBAAA0rC,EAhCT1rC,qBAAkB,EAClBA,yBAA6B,GAWrBA,cAsBNA,KAAK2rC,KAAO57B,GAAW,KAAO/P,KAAK0M,GAAK,KACxC1M,KAAK80C,kBAAoB,IAAIX,GAAiBQ,GAC9C30C,KAAK2rC,KAAK,sBACV3rC,KAAK+0C,SA8cT,OAvcUC,mBAAR,WAAA,WACQC,EAAOj1C,KAAK80C,kBAAkBI,mBACpCl1C,KAAKm1C,MAAQ,IAAIF,EACfj1C,KAAKo1C,mBACLp1C,KAAK20C,eACLxuC,EACAnG,KAAK0rC,eAKP1rC,KAAKq1C,0BAA4BJ,EAAmC,8BAAK,EAEzE,IAAMK,EAAoBt1C,KAAKu1C,cAAcv1C,KAAKm1C,OAC5CK,EAAmBx1C,KAAKy1C,iBAAiBz1C,KAAKm1C,OACpDn1C,KAAK01C,IAAM11C,KAAKm1C,MAChBn1C,KAAK21C,IAAM31C,KAAKm1C,MAChBn1C,KAAK41C,eAAiB,KACtB51C,KAAK61C,YAAa,EAQlBhjC,WAAW,WAETpM,EAAK0uC,OAAS1uC,EAAK0uC,MAAMnF,KAAKsF,EAAmBE,IAChD5jC,KAAKI,MAAM,IAEd,IAAM8jC,EAAoBb,EAAqB,gBAAK,EAC5B,EAApBa,IACF91C,KAAK+1C,gBAAkBjjC,GAAsB,WAC3CrM,EAAKsvC,gBAAkB,KAClBtvC,EAAKovC,aAENpvC,EAAK0uC,OA5GuB,OA6G5B1uC,EAAK0uC,MAAM3F,eAEX/oC,EAAKklC,KACH,wDACEllC,EAAK0uC,MAAM3F,cACX,wCAEJ/oC,EAAKovC,YAAa,EAClBpvC,EAAK0uC,MAAMa,yBAEXvvC,EAAK0uC,OAxHmB,MAyHxB1uC,EAAK0uC,MAAMtG,UAEXpoC,EAAKklC,KACH,oDACEllC,EAAK0uC,MAAMtG,UACX,uCAKJpoC,EAAKklC,KAAK,+CACVllC,EAAK+nC,WAGR58B,KAAKI,MAAM8jC,MAQVd,6BAAR,WACE,MAAO,KAAOh1C,KAAK0M,GAAK,IAAM1M,KAAKi2C,mBAG7BjB,6BAAR,SAAyBC,GAAzB,WACE,OAAO,SAAAiB,GACDjB,IAASxuC,EAAK0uC,MAChB1uC,EAAK0vC,kBAAkBD,GACdjB,IAASxuC,EAAKmvC,gBACvBnvC,EAAKklC,KAAK,8BACVllC,EAAK2vC,8BAEL3vC,EAAKklC,KAAK,+BAKRqJ,0BAAR,SAAsBC,GAAtB,WACE,OAAO,SAAC5yC,MACFoE,EAAK4vC,SACHpB,IAASxuC,EAAKkvC,IAChBlvC,EAAK6vC,0BAA0Bj0C,GACtB4yC,IAASxuC,EAAKmvC,eACvBnvC,EAAK8vC,4BAA4Bl0C,GAEjCoE,EAAKklC,KAAK,gCAUlBqJ,wBAAA,SAAYwB,GAEV,IAAMC,EAAM,CAAEh2C,EAAG,IAAKnB,EAAGk3C,GACzBx2C,KAAK02C,UAAUD,IAGjBzB,iCAAA,WACMh1C,KAAK01C,MAAQ11C,KAAK41C,gBAAkB51C,KAAK21C,MAAQ31C,KAAK41C,iBACxD51C,KAAK2rC,KACH,2CAA6C3rC,KAAK41C,eAAepK,QAEnExrC,KAAKm1C,MAAQn1C,KAAK41C,eAClB51C,KAAK41C,eAAiB,OAKlBZ,gCAAR,SAA4B2B,GAC1B,GA3LiB,MA2LGA,EAAa,CAC/B,IAAMC,EAAMD,EAAwB,EAtLvB,MAuLTC,EACF52C,KAAK62C,6BA3LS,MA4LLD,GAET52C,KAAK2rC,KAAK,wCACV3rC,KAAK41C,eAAepH,QAGlBxuC,KAAK01C,MAAQ11C,KAAK41C,gBAClB51C,KAAK21C,MAAQ31C,KAAK41C,gBAElB51C,KAAKwuC,SAnMM,MAqMJoI,IACT52C,KAAK2rC,KAAK,0BACV3rC,KAAK82C,8BACL92C,KAAK62C,gCAKH7B,wCAAR,SAAoC+B,GAClC,IAAMC,EAAgBnmC,GAAW,IAAKkmC,GAChC9uC,EAAY4I,GAAW,IAAKkmC,GAClC,GAAa,KAATC,EACFh3C,KAAKi3C,oBAAoBhvC,OACpB,CAAA,GAAa,KAAT+uC,EAIT,MAAM,IAAIz0C,MAAM,2BAA6By0C,GAF7Ch3C,KAAKk3C,oBAAoBn1C,KAAKkG,KAM1B+sC,uCAAR,WACMh1C,KAAK82C,6BAA+B,GACtC92C,KAAK2rC,KAAK,oCACV3rC,KAAK61C,YAAa,EAClB71C,KAAK41C,eAAeI,wBACpBh2C,KAAKm3C,wBAGLn3C,KAAK2rC,KAAK,8BACV3rC,KAAK41C,eAAe3B,KAAK,CAAExzC,EAAG,IAAKnB,EAAG,CAAEmB,EAhOjC,IAgO0CnB,EAAG,QAIhD01C,gCAAR,WAEEh1C,KAAK41C,eAAehI,QAEpB5tC,KAAK2rC,KAAK,mCACV3rC,KAAK41C,eAAe3B,KAAK,CAAExzC,EAAG,IAAKnB,EAAG,CAAEmB,EA3OzB,IA2OwCnB,EAAG,MAI1DU,KAAK2rC,KAAK,kCACV3rC,KAAKm1C,MAAMlB,KAAK,CAAExzC,EAAG,IAAKnB,EAAG,CAAEmB,EA/OV,IA+O+BnB,EAAG,MACvDU,KAAK01C,IAAM11C,KAAK41C,eAEhB51C,KAAKo3C,wBAGCpC,sCAAR,SAAkC+B,GAEhC,IAAMC,EAAgBnmC,GAAW,IAAKkmC,GAChC9uC,EAAY4I,GAAW,IAAKkmC,GACrB,KAATC,EACFh3C,KAAKq3C,WAAWpvC,GACE,KAAT+uC,GACTh3C,KAAKs3C,eAAervC,IAIhB+sC,2BAAR,SAAuB3yC,GACrBrC,KAAKu3C,qBAGLv3C,KAAK8qC,WAAWzoC,IAGV2yC,+BAAR,WACOh1C,KAAK61C,aACR71C,KAAKq1C,4BACDr1C,KAAKq1C,2BAA6B,IACpCr1C,KAAK2rC,KAAK,kCACV3rC,KAAK61C,YAAa,EAClB71C,KAAKm1C,MAAMa,2BAKThB,uBAAR,SAAmB2B,GACjB,IAAMC,EAAc/lC,GA1RH,IA0R4B8lC,GAC7C,GA1RiB,MA0RGA,EAAa,CAC/B,IAAMa,EAAUb,EAAwB,EACxC,GAnRe,MAmRXC,EACF52C,KAAKy3C,aAAaD,QACb,GAxRY,MAwRRZ,EAA0B,CACnC52C,KAAK2rC,KAAK,qCACV3rC,KAAK21C,IAAM31C,KAAK41C,eAChB,IAAK,IAAIjzC,EAAI,EAAGA,EAAI3C,KAAKk3C,oBAAoBp1C,SAAUa,EACrD3C,KAAKs3C,eAAet3C,KAAKk3C,oBAAoBv0C,IAE/C3C,KAAKk3C,oBAAsB,GAC3Bl3C,KAAKo3C,2BApSY,MAqSRR,EAGT52C,KAAK03C,sBAAsBF,GAvSb,MAwSLZ,EAET52C,KAAK23C,SAASH,GAzSA,MA0SLZ,EACTjxC,GAAM,iBAAmB6xC,GA1SZ,MA2SJZ,GACT52C,KAAK2rC,KAAK,wBACV3rC,KAAKu3C,qBACLv3C,KAAK43C,iCAELjyC,GAAM,mCAAqCixC,KAUzC5B,yBAAR,SAAqB6C,GAMnB,IAAMC,EAAYD,EAAU5G,GACtB8G,EAAUF,EAAUt2C,EACpBmU,EAAOmiC,EAAUG,EACvBh4C,KAAKi4C,UAAYJ,EAAUrmC,EAC3BxR,KAAK20C,UAAUuD,WAAWxiC,MAEtB1V,KAAKq2C,SACPr2C,KAAKm1C,MAAMvH,QACX5tC,KAAKm4C,yBAAyBn4C,KAAKm1C,MAAO2C,G7D7WhB,M6D8WDC,GACvBrqC,GAAK,sCAGP1N,KAAKo4C,qBAIDpD,6BAAR,WACE,IAAMC,EAAOj1C,KAAK80C,kBAAkBuD,mBAChCpD,GACFj1C,KAAKs4C,cAAcrD,IAIfD,0BAAR,SAAsBC,GAAtB,WACEj1C,KAAK41C,eAAiB,IAAIX,EACxBj1C,KAAKo1C,mBACLp1C,KAAK20C,UACL30C,KAAKi4C,WAIPj4C,KAAK82C,4BACH7B,EAAmC,8BAAK,EAE1C,IAAMhJ,EAAYjsC,KAAKu1C,cAAcv1C,KAAK41C,gBACpC1J,EAAelsC,KAAKy1C,iBAAiBz1C,KAAK41C,gBAChD51C,KAAK41C,eAAe5F,KAAK/D,EAAWC,GAGpCp5B,GAAsB,WAChBrM,EAAKmvC,iBACPnvC,EAAKklC,KAAK,gCACVllC,EAAKmvC,eAAepH,UAErB58B,KAAKI,MApYY,OAuYdgjC,qBAAR,SAAiBt/B,GACf1V,KAAK2rC,KAAK,qCAAuCj2B,GACjD1V,KAAK20C,UAAUuD,WAAWxiC,OAGtB1V,KAAKq2C,OACPr2C,KAAKwuC,SAGLxuC,KAAKu4C,oBACLv4C,KAAK+0C,WAIDC,qCAAR,SAAiCC,EAAiB6C,GAAlD,WACE93C,KAAK2rC,KAAK,oCACV3rC,KAAKm1C,MAAQF,EACbj1C,KAAKq2C,SAEDr2C,KAAK40C,WACP50C,KAAK40C,SAASkD,EAAW93C,KAAKi4C,WAC9Bj4C,KAAK40C,SAAW,MAKqB,IAAnC50C,KAAKq1C,2BACPr1C,KAAK2rC,KAAK,kCACV3rC,KAAK61C,YAAa,GAElB/iC,GAAsB,WACpBrM,EAAKmxC,iCACJhmC,KAAKI,MAna8B,OAualCgjC,0CAAR,WAEOh1C,KAAK61C,gBAAc71C,KAAKq2C,SAC3Br2C,KAAK2rC,KAAK,4BACV3rC,KAAK02C,UAAU,CAAEj2C,EAAG,IAAKnB,EAAG,CAAEmB,EArZvB,IAqZgCnB,EAAG,QAItC01C,uCAAR,WACE,IAAMC,EAAOj1C,KAAK41C,eAClB51C,KAAK41C,eAAiB,KAClB51C,KAAK01C,MAAQT,GAAQj1C,KAAK21C,MAAQV,GAEpCj1C,KAAKwuC,SAUDwG,8BAAR,SAA0BkB,GACxBl2C,KAAKm1C,MAAQ,KAIRe,OAAiBl2C,KAAKq2C,WAQhBr2C,KAAKq2C,QACdr2C,KAAK2rC,KAAK,8BARV3rC,KAAK2rC,KAAK,+BAEN3rC,KAAK20C,UAAUt+B,oBACjBxH,EAAkBiB,OAAO,QAAU9P,KAAK20C,UAAUj/B,MAElD1V,KAAK20C,UAAU1+B,aAAejW,KAAK20C,UAAUj/B,OAMjD1V,KAAKwuC,SAQCwG,kCAAR,SAA8B9O,GAC5BlmC,KAAK2rC,KAAK,0DAEN3rC,KAAK60C,UACP70C,KAAK60C,QAAQ3O,GACblmC,KAAK60C,QAAU,MAKjB70C,KAAKosC,cAAgB,KAErBpsC,KAAKwuC,SAGCwG,sBAAR,SAAkB/sC,GAChB,OAAIjI,KAAKq2C,OACP,KAAM,8BAENr2C,KAAK01C,IAAIzB,KAAKhsC,IAOlB+sC,kBAAA,eACMh1C,KAAKq2C,SACPr2C,KAAK2rC,KAAK,gCACV3rC,KAAKq2C,SAELr2C,KAAKu4C,oBAEDv4C,KAAKosC,gBACPpsC,KAAKosC,gBACLpsC,KAAKosC,cAAgB,QASnB4I,8BAAR,WACEh1C,KAAK2rC,KAAK,iCACN3rC,KAAKm1C,QACPn1C,KAAKm1C,MAAM3G,QACXxuC,KAAKm1C,MAAQ,MAGXn1C,KAAK41C,iBACP51C,KAAK41C,eAAepH,QACpBxuC,KAAK41C,eAAiB,MAGpB51C,KAAK+1C,kBACP3I,aAAaptC,KAAK+1C,iBAClB/1C,KAAK+1C,gBAAkB,0BC3hB7B,cAyFA,OA7DEyC,gBAAA,SACEjlC,EACAtL,EACAqS,EACA8K,KASFozB,kBAAA,SACEjlC,EACAtL,EACAqS,EACA8K,KAOFozB,6BAAA,SAAiBzvC,KAOjByvC,4BAAA,SACEjlC,EACAtL,EACAqS,KAQFk+B,8BAAA,SACEjlC,EACAtL,EACAqS,KAOFk+B,+BAAA,SACEjlC,EACA+G,KAMFk+B,wBAAA,SAAY7P,yBC0BZ,WACUgM,EACA8D,EAMAC,EACAC,EACAC,EACAC,GAXV,MAaEnyB,mBAEA,GAdQjgB,YAAAkuC,EACAluC,gBAAAgyC,EAMAhyC,mBAAAiyC,EACAjyC,sBAAAkyC,EACAlyC,qBAAAmyC,EACAnyC,gBAAAoyC,EA3EVpyC,KAAKqyC,EAAqBC,8BAClBtyC,OAAOsJ,GAAW,KAAOtJ,EAAKiG,GAAK,KAGnCjG,oBAAmD,GACnDA,WAAkE,GAClEA,mBAAqC,GACrCA,uBAAuB,EACvBA,4BAAmD,GACnDA,cAAa,EACbA,kBAnDkB,IAoDlBA,qBAnD0B,IAoD1BA,yBAAuD,KAC/DA,gBAA+B,KAGvBA,4BAA2C,KAG3CA,YAAoB,EAGpBA,iBAAoD,GACpDA,iBAAiB,EAMjBA,YAGG,KAGHA,aAA4B,KAC5BA,sBAAqB,EACrBA,yBAAyB,EAEzBA,oBAAmB,EACnBA,6BAA4C,KAC5CA,iCAAgD,KAsClDoyC,IAAkB5xC,IACpB,MAAM,IAAI1E,MACR,yFAGJkE,EAAKuyC,iBAAiB,GAEtBrO,GAAkBsO,cAAcnsB,GAAG,UAAWrmB,EAAKyyC,WAAYzyC,IAEpB,IAAvCkuC,EAAUj/B,KAAKM,QAAQ,YACzB60B,GAAcoO,cAAcnsB,GAAG,SAAUrmB,EAAK0yC,UAAW1yC,KAy0B/D,OAp6B0CuV,OAqG9B88B,wBAAV,SACEt7B,EACAld,EACA84C,GAEA,IAAMC,IAAcr5C,KAAKs5C,eAEnB7C,EAAM,CAAEjU,EAAG6W,EAAWpuC,EAAGuS,EAAQje,EAAGe,GAC1CN,KAAK2rC,KAAK9iC,EAAU4tC,IACpBt0C,EACEnC,KAAKu5C,WACL,0DAEFv5C,KAAKw5C,UAAUC,YAAYhD,GACvB2C,IACFp5C,KAAK05C,eAAeL,GAAaD,IAOrCN,mBAAA,SACEnvB,EACAgwB,EACAtX,EACA/nB,GAEA,IAAMiV,EAAU5F,EAAMqE,kBAChBza,EAAaoW,EAAMhV,KAAKnM,WAC9BxI,KAAK2rC,KAAK,qBAAuBp4B,EAAa,IAAMgc,GACpDvvB,KAAK45C,SAASrmC,GAAcvT,KAAK45C,SAASrmC,IAAe,GACzDpR,EACEwnB,EAAMC,iBAAiB8b,cACpB/b,EAAMC,iBAAiBiS,eAC1B,sDAEF15B,GACGnC,KAAK45C,SAASrmC,GAAYgc,GAC3B,gDAEF,IAAMsqB,EAAyB,CAC7Bv/B,WAAYA,EACZqqB,OAAQgV,EACRhwB,MAAOA,EACP0Y,IAAKA,GAEPriC,KAAK45C,SAASrmC,GAAYgc,GAAWsqB,EAEjC75C,KAAKu5C,YACPv5C,KAAK85C,YAAYD,IAWbf,wBAAR,SAAoBe,GAApB,WACQlwB,EAAQkwB,EAAWlwB,MACnBpW,EAAaoW,EAAMhV,KAAKnM,WACxB+mB,EAAU5F,EAAMqE,kBACtBhuB,KAAK2rC,KAAK,aAAep4B,EAAa,QAAUgc,GAChD,IAAMwqB,EAA4B,CAAWn6C,EAAG2T,GAK5CsmC,EAAWxX,MACb0X,EAAO,EAAIpwB,EAAMiE,cACjBmsB,EAAO,EAAIF,EAAWxX,KAGxB0X,EAAgB,EAAIF,EAAWlV,SAE/B3kC,KAAKy5C,YAVU,IAUUM,EAAK,SAAC13C,GAC7B,IAAMm1C,EAAen1C,EAAoB,EACnC0jC,EAAiB1jC,EAAsB,EAG7Cy2C,EAAqBkB,sBAAsBxC,EAAS7tB,IAGlDljB,EAAKmzC,SAASrmC,IAAe9M,EAAKmzC,SAASrmC,GAAYgc,MAE/BsqB,IACxBpzC,EAAKklC,KAAK,kBAAmBtpC,GAEd,OAAX0jC,GACFt/B,EAAKwzC,cAAc1mC,EAAYgc,GAG7BsqB,EAAWv/B,YACbu/B,EAAWv/B,WAAWyrB,EAAQyR,OAWvBsB,wBAAf,SAAqCtB,EAAc7tB,GACjD,GAAI6tB,GAA8B,iBAAZA,GAAwBnuC,EAASmuC,EAAS,KAAM,CACpE,IAAM0C,EAAW3wC,EAAQiuC,EAAS,KAClC,GAAI73C,MAAMgE,QAAQu2C,KAAcA,EAASlkC,QAAQ,YAAa,CAC5D,IAAMmkC,EACJ,gBACAxwB,EACGC,iBACAC,WACArhB,WACH,IACI4xC,EAAYzwB,EAAMhV,KAAKnM,WAC7BkF,GACE,wGAC6CysC,SACxCC,wDASbtB,6BAAA,SAAiB/vC,GACf/I,KAAKq6C,WAAatxC,EAClB/I,KAAK2rC,KAAK,wBACN3rC,KAAKq6C,WACPr6C,KAAKs6C,UAIDt6C,KAAKu5C,YACPv5C,KAAKy5C,YAAY,SAAU,GAAI,cAInCz5C,KAAKu6C,uCAAuCxxC,IAOtC+vC,mDAAR,SAA+C0B,GAG7C,I1EhMEvxC,G0EgMuBuxC,GAAoC,KAAtBA,EAAW14C,Q1E/L3B,iBADrBmH,EAASH,E0EiMqB0xC,G1EjMPvxC,UAC8B,IAApBA,EAAc,S0EiM/CjJ,KAAK2rC,KACH,iEAEF3rC,KAAKy6C,mBAzS4B,MAiTrC3B,oBAAA,WAAA,I1E7NE7vC,S0E8NA,GAAIjJ,KAAKu5C,YAAcv5C,KAAKq6C,WAAY,CACtC,IAAMK,EAAQ16C,KAAKq6C,WACbM,G1EhOR1xC,EADYH,E0EiOuB4xC,G1EhOlBzxC,SAEkB,iBAAXA,GAAuBA,EAAOpJ,eAAe,O0E8NzB,OAAS,QAC7C+6C,EAAoC,CAAEC,KAAMH,GACvB,OAAvB16C,KAAK64C,cACP+B,EAAoB,QAAI,EACe,iBAAvB56C,KAAK64C,gBACrB+B,EAAqB,QAAI56C,KAAK64C,eAEhC74C,KAAKy5C,YAAYkB,EAAYC,EAAa,SAAC3wC,GACzC,IAAM87B,EAAiB97B,EAAkB,EACnChC,EAAegC,EAAgB,GAAK,QAEtCxD,EAAK4zC,aAAeK,IACP,OAAX3U,EACFt/B,EAAKq0C,uBAAyB,EAG9Br0C,EAAKs0C,eAAehV,EAAQ99B,QAUtC6wC,qBAAA,SAASnvB,EAAc0Y,GACrB,IAAM9uB,EAAaoW,EAAMhV,KAAKnM,WACxB+mB,EAAU5F,EAAMqE,kBAEtBhuB,KAAK2rC,KAAK,uBAAyBp4B,EAAa,IAAMgc,GAEtDptB,EACEwnB,EAAMC,iBAAiB8b,cACpB/b,EAAMC,iBAAiBiS,eAC1B,wDAEa77B,KAAKi6C,cAAc1mC,EAAYgc,IAChCvvB,KAAKu5C,YACjBv5C,KAAKg7C,cAAcznC,EAAYgc,EAAS5F,EAAMiE,cAAeyU,IAIzDyW,0BAAR,SACEvlC,EACAgc,EACA0rB,EACA5Y,GAEAriC,KAAK2rC,KAAK,eAAiBp4B,EAAa,QAAUgc,GAElD,IAAMwqB,EAA4B,CAAWn6C,EAAG2T,GAG5C8uB,IACF0X,EAAO,EAAIkB,EACXlB,EAAO,EAAI1X,GAGbriC,KAAKy5C,YAPU,IAOUM,IAM3BjB,4BAAA,SACEvlC,EACAtL,EACAqS,GAEIta,KAAKu5C,WACPv5C,KAAKk7C,kBAAkB,IAAK3nC,EAAYtL,EAAMqS,GAE9Cta,KAAKm7C,0BAA0Bp5C,KAAK,CAClCwR,aACAiK,OAAQ,IACRvV,OACAqS,gBAQNw+B,8BAAA,SACEvlC,EACAtL,EACAqS,GAEIta,KAAKu5C,WACPv5C,KAAKk7C,kBAAkB,KAAM3nC,EAAYtL,EAAMqS,GAE/Cta,KAAKm7C,0BAA0Bp5C,KAAK,CAClCwR,aACAiK,OAAQ,KACRvV,OACAqS,gBAQNw+B,+BAAA,SACEvlC,EACA+G,GAEIta,KAAKu5C,WACPv5C,KAAKk7C,kBAAkB,KAAM3nC,EAAY,KAAM+G,GAE/Cta,KAAKm7C,0BAA0Bp5C,KAAK,CAClCwR,aACAiK,OAAQ,KACRvV,KAAM,KACNqS,gBAKEw+B,8BAAR,SACEt7B,EACAjK,EACAtL,EACAqS,GAEA,IAAM8gC,EAAU,CAAWx7C,EAAG2T,EAAqBjU,EAAG2I,GACtDjI,KAAK2rC,KAAK,gBAAkBnuB,EAAQ49B,GACpCp7C,KAAKy5C,YAAYj8B,EAAQ49B,EAAS,SAACC,GAC7B/gC,GACFzH,WAAW,WACTyH,EAAW+gC,EAAuB,EAAGA,EAAuB,IAC3DzpC,KAAKI,MAAM,OAQpB8mC,gBAAA,SACEvlC,EACAtL,EACAqS,EACA8K,GAEAplB,KAAKs7C,YAAY,IAAK/nC,EAAYtL,EAAMqS,EAAY8K,IAMtD0zB,kBAAA,SACEvlC,EACAtL,EACAqS,EACA8K,GAEAplB,KAAKs7C,YAAY,IAAK/nC,EAAYtL,EAAMqS,EAAY8K,IAGtD0zB,wBAAA,SACEt7B,EACAjK,EACAtL,EACAqS,EACA8K,GAEA,IAAMg2B,EAAgC,CAC3Bx7C,EAAG2T,EACHjU,EAAG2I,QAGD9B,IAATif,IAAoBg2B,EAAoB,EAAIh2B,GAGhDplB,KAAKu7C,iBAAiBx5C,KAAK,CACzByb,SACA49B,UACA9gC,eAGFta,KAAKw7C,uBACL,IAAMj+B,EAAQvd,KAAKu7C,iBAAiBz5C,OAAS,EAEzC9B,KAAKu5C,WACPv5C,KAAKy7C,SAASl+B,GAEdvd,KAAK2rC,KAAK,kBAAoBp4B,IAI1BulC,qBAAR,SAAiBv7B,GAAjB,WACQC,EAASxd,KAAKu7C,iBAAiBh+B,GAAOC,OACtC49B,EAAUp7C,KAAKu7C,iBAAiBh+B,GAAO69B,QACvC9gC,EAAata,KAAKu7C,iBAAiBh+B,GAAOjD,WAChDta,KAAKu7C,iBAAiBh+B,GAAOm+B,OAAS17C,KAAKu5C,WAE3Cv5C,KAAKy5C,YAAYj8B,EAAQ49B,EAAS,SAAC/4C,GACjCoE,EAAKklC,KAAKnuB,EAAS,YAAanb,UAEzBoE,EAAK80C,iBAAiBh+B,GAC7B9W,EAAK+0C,uBAG6B,IAA9B/0C,EAAK+0C,uBACP/0C,EAAK80C,iBAAmB,IAGtBjhC,GACFA,EAAWjY,EAAsB,EAAGA,EAAsB,MAOhEy2C,wBAAA,SAAYnQ,GAAZ,WAEE,GAAI3oC,KAAKu5C,WAAY,CACnB,IAAM6B,EAAU,CAAex4C,EAAG+lC,GAClC3oC,KAAK2rC,KAAK,cAAeyP,GAEzBp7C,KAAKy5C,YAAsB,IAAK2B,EAAS,SAAAh8B,GAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,IAAMu8B,EAAcv8B,EAAqB,EACzC3Y,EAAKklC,KAAK,cAAe,wBAA0BgQ,QAUnD7C,2BAAR,SAAuBz2C,GACrB,GAAI,MAAOA,EAAS,CAElBrC,KAAK2rC,KAAK,gBAAkB9iC,EAAUxG,IACtC,IAAMu5C,EAASv5C,EAAW,EACpB+2C,EAAap5C,KAAK05C,eAAekC,GACnCxC,WACKp5C,KAAK05C,eAAekC,GAC3BxC,EAAW/2C,EAAoB,QAE5B,CAAA,GAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhBrC,KAAK67C,YAAYx5C,EAAW,EAAGA,EAAW,KAItCy2C,wBAAR,SAAoBt7B,EAAgBld,GAClCN,KAAK2rC,KAAK,sBAAuBnuB,EAAQld,GAC1B,MAAXkd,EACFxd,KAAKy4C,cACHn4C,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEQ,MAAXkd,EACPxd,KAAKy4C,cACHn4C,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEQ,MAAXkd,EACPxd,KAAK87C,iBAAiBx7C,EAAiB,EAAGA,EAAkB,GAC1C,OAAXkd,EACPxd,KAAK+6C,eACHz6C,EAAwB,EACxBA,EAA0B,GAEV,OAAXkd,EAAiBxd,KAAK+7C,uBAAuBz7C,GAEpDqF,GACE,6CACEkD,EAAU2U,GACV,uCAIAs7B,qBAAR,SAAiBhB,EAAmBG,GAClCj4C,KAAK2rC,KAAK,oBACV3rC,KAAKu5C,YAAa,EAClBv5C,KAAKg8C,gCAAiC,IAAIh2C,MAAOE,UACjDlG,KAAKi8C,iBAAiBnE,GACtB93C,KAAK0rC,cAAgBuM,EACjBj4C,KAAKk8C,kBACPl8C,KAAKm8C,oBAEPn8C,KAAKo8C,gBACLp8C,KAAKk8C,kBAAmB,EACxBl8C,KAAK04C,kBAAiB,IAGhBI,6BAAR,SAAyB9lC,GAAzB,WACE7Q,GACGnC,KAAKw5C,UACN,0DAGEx5C,KAAKq8C,2BACPjP,aAAaptC,KAAKq8C,2BAMpBr8C,KAAKq8C,0BAA4BxpC,WAAW,WAC1CpM,EAAK41C,0BAA4B,KACjC51C,EAAK61C,wBACJ1qC,KAAKI,MAAMgB,KAOR8lC,uBAAR,SAAmB9Z,GAGfA,IACCh/B,KAAKyqC,UACNzqC,KAAKu8C,kBAAoBv8C,KAAKy6C,qBAE9Bz6C,KAAK2rC,KAAK,2CACV3rC,KAAKu8C,gBAnoBiB,IAqoBjBv8C,KAAKw5C,WACRx5C,KAAKg5C,iBAAiB,IAG1Bh5C,KAAKyqC,SAAWzL,GAGV8Z,sBAAR,SAAkB0D,GACZA,GACFx8C,KAAK2rC,KAAK,wBACV3rC,KAAKu8C,gBA/oBiB,IAgpBjBv8C,KAAKw5C,WACRx5C,KAAKg5C,iBAAiB,KAGxBh5C,KAAK2rC,KAAK,8CACN3rC,KAAKw5C,WACPx5C,KAAKw5C,UAAUhL,UAKbsK,kCAAR,WAWE,GAVA94C,KAAK2rC,KAAK,4BACV3rC,KAAKu5C,YAAa,EAClBv5C,KAAKw5C,UAAY,KAGjBx5C,KAAKy8C,0BAGLz8C,KAAK05C,eAAiB,GAElB15C,KAAK08C,mBAAoB,CAC3B,GAAK18C,KAAKyqC,UAIH,GAAIzqC,KAAKg8C,+BAAgC,CAvqBhB,KA0qB5B,IAAIh2C,MAAOE,UAAYlG,KAAKg8C,iCAE5Bh8C,KAAKu8C,gBAhrBa,KAirBpBv8C,KAAKg8C,+BAAiC,WATtCh8C,KAAK2rC,KAAK,8CACV3rC,KAAKu8C,gBAAkBv8C,KAAKy6C,mBAC5Bz6C,KAAK28C,4BAA6B,IAAI32C,MAAOE,UAU/C,IAAM02C,GACJ,IAAI52C,MAAOE,UAAYlG,KAAK28C,2BAC1BE,EAAiBjrC,KAAKmD,IACxB,EACA/U,KAAKu8C,gBAAkBK,GAEzBC,EAAiBjrC,KAAK0J,SAAWuhC,EAEjC78C,KAAK2rC,KAAK,0BAA4BkR,EAAiB,MACvD78C,KAAKg5C,iBAAiB6D,GAGtB78C,KAAKu8C,gBAAkB3qC,KAAKG,IAC1B/R,KAAKy6C,mBA9rBsB,IA+rB3Bz6C,KAAKu8C,iBAGTv8C,KAAK04C,kBAAiB,IAGhBI,iCAAR,WACE,GAAI94C,KAAK08C,mBAAoB,CAC3B18C,KAAK2rC,KAAK,+BACV3rC,KAAK28C,4BAA6B,IAAI32C,MAAOE,UAC7ClG,KAAKg8C,+BAAiC,KACtC,IAAMc,EAAgB98C,KAAKs3C,eAAe1nC,KAAK5P,MACzC+8C,EAAU/8C,KAAK40C,SAAShlC,KAAK5P,MAC7Bg9C,EAAeh9C,KAAKi9C,sBAAsBrtC,KAAK5P,MAC/Ck9C,EAASl9C,KAAK0M,GAAK,IAAMosC,EAAqBqE,oBAC9C3uB,EAAOxuB,KACPo9C,EAAgBp9C,KAAK0rC,cACvB2R,GAAW,EACXC,EAAgC,KAC9BC,EAAU,WACVD,EACFA,EAAW9O,SAEX6O,GAAW,EACXL,MAWJh9C,KAAKw5C,UAAY,CACfhL,MAAO+O,EACP9D,YAVoB,SAAShD,GAC7Bt0C,EACEm7C,EACA,0DAEFA,EAAW7D,YAAYhD,KAQzB,IAAMtP,EAAennC,KAAKw9C,mBAC1Bx9C,KAAKw9C,oBAAqB,EAG1Bx9C,KAAK44C,mBACF6E,SAAStW,GACTC,KAAK,SAAShoB,GACRi+B,EAgBH9vC,GAAI,0CAfJA,GAAI,8CACJihB,EAAK6rB,WAAaj7B,GAAUA,EAAOs+B,YACnCJ,EAAa,IAAItI,GACfkI,EACA1uB,EAAKmmB,UACLmI,EACAC,EACAC,EACc,SAAS9W,GACrBx4B,GAAKw4B,EAAS,KAAO1X,EAAKmmB,UAAUnsC,WAAa,KACjDgmB,EAAKmvB,UAvvBgB,gBAyvBvBP,MAMLhW,KAAK,KAAM,SAASzhC,GACnB6oB,EAAKmd,KAAK,wBAA0BhmC,GAC/B03C,GAOHE,QASVzE,sBAAA,SAAU5S,GACR34B,GAAI,uCAAyC24B,GAC7ClmC,KAAK49C,kBAAkB1X,IAAU,EAC7BlmC,KAAKw5C,UACPx5C,KAAKw5C,UAAUhL,SAEXxuC,KAAKq8C,4BACPjP,aAAaptC,KAAKq8C,2BAClBr8C,KAAKq8C,0BAA4B,MAE/Br8C,KAAKu5C,YACPv5C,KAAKi9C,0BAQXnE,mBAAA,SAAO5S,GACL34B,GAAI,mCAAqC24B,UAClClmC,KAAK49C,kBAAkB1X,GAC1Bt8B,EAAQ5J,KAAK49C,qBACf59C,KAAKu8C,gBA7yBiB,IA8yBjBv8C,KAAKw5C,WACRx5C,KAAKg5C,iBAAiB,KAKpBF,6BAAR,SAAyBhB,GACvB,IAAM5P,EAAQ4P,GAAY,IAAI9xC,MAAOE,UACrClG,KAAK24C,oBAAoB,CAAEkF,iBAAkB3V,KAGvC4Q,oCAAR,WACE,IAAK,IAAIn2C,EAAI,EAAGA,EAAI3C,KAAKu7C,iBAAiBz5C,OAAQa,IAAK,CACrD,IAAMm7C,EAAM99C,KAAKu7C,iBAAiB54C,GAC9Bm7C,GAAgB,MAAOA,EAAI1C,SAAW0C,EAAIpC,SACxCoC,EAAIxjC,YAAYwjC,EAAIxjC,WAAW,qBAE5Bta,KAAKu7C,iBAAiB54C,GAC7B3C,KAAKw7C,wBAKyB,IAA9Bx7C,KAAKw7C,uBAA4Bx7C,KAAKu7C,iBAAmB,KAQvDzC,6BAAR,SAAyBvlC,EAAoBoW,GAE3C,IAAI4F,EAIFA,EAHG5F,EAGOA,EAAM5f,IAAI,SAAAg0C,GAAK,OAAAjtC,GAAkBitC,KAAIv5C,KAAK,KAF1C,UAIZ,IAAMw5C,EAASh+C,KAAKi6C,cAAc1mC,EAAYgc,GAC1CyuB,GAAUA,EAAO1jC,YAAY0jC,EAAO1jC,WAAW,sBAS7Cw+B,0BAAR,SAAsBvlC,EAAoBgc,GACxC,IACIyuB,EADEC,EAAuB,IAAI3qC,GAAKC,GAAY/K,WAYlD,YAV4CrC,IAAxCnG,KAAK45C,SAASqE,IAChBD,EAASh+C,KAAK45C,SAASqE,GAAsB1uB,UACtCvvB,KAAK45C,SAASqE,GAAsB1uB,GACW,IAAlD1lB,EAAS7J,KAAK45C,SAASqE,YAClBj+C,KAAK45C,SAASqE,IAIvBD,OAAS73C,EAEJ63C,GAGDlF,2BAAR,SAAuBoF,EAAoBC,GACzC5wC,GAAI,uBAAyB2wC,EAAa,IAAMC,GAChDn+C,KAAKq6C,WAAa,KAClBr6C,KAAKw9C,oBAAqB,EAC1Bx9C,KAAKw5C,UAAUhL,QACI,kBAAf0P,GAAiD,sBAAfA,IAIpCl+C,KAAK86C,yBAh3B0B,GAi3B3B96C,KAAK86C,yBAEP96C,KAAKu8C,gBAz3B0B,IA63B/Bv8C,KAAK44C,mBAAmBwF,2BAKtBtF,mCAAR,SAA+Bx4C,GACzBN,KAAKq+C,uBACPr+C,KAAKq+C,uBAAuB/9C,GAExB,QAASA,GACXoF,QAAQ6H,IAAI,aAAejN,EAAU,IAAE8H,QAAQ,KAAM,kBAKnD0wC,0BAAR,WAAA,WAEE94C,KAAKs6C,UAIL9wC,EAAQxJ,KAAK45C,SAAU,SAACrmC,EAAoB+xB,GAC1C97B,EAAQ87B,EAAS,SAAC/8B,EAAasxC,GAC7BpzC,EAAKqzC,YAAYD,OAIrB,IAAK,IAAIl3C,EAAI,EAAGA,EAAI3C,KAAKu7C,iBAAiBz5C,OAAQa,IAC5C3C,KAAKu7C,iBAAiB54C,IAAI3C,KAAKy7C,SAAS94C,GAG9C,KAAO3C,KAAKm7C,0BAA0Br5C,QAAQ,CAC5C,IAAMs5C,EAAUp7C,KAAKm7C,0BAA0BpK,QAC/C/wC,KAAKk7C,kBACHE,EAAQ59B,OACR49B,EAAQ7nC,WACR6nC,EAAQnzC,KACRmzC,EAAQ9gC,cASNw+B,8BAAR,WACE,IAAMnQ,EAAiC,GASvCA,EACE,UAA4B2V,GAASC,YAAYn2C,QAAQ,MAAO,MAC9D,EAEAvB,IACF8hC,EAAM,qBAAuB,E7Er6BV,iBAAd3hC,WAAmD,gBAAzBA,UAAmB,U6Eu6BlD2hC,EAAM,yBAA2B,GAEnC3oC,KAAK8oC,YAAYH,IAOXmQ,6BAAR,WACE,IAAM0D,EAAS3R,GAAcoO,cAAcuF,kBAC3C,OAAO50C,EAAQ5J,KAAK49C,oBAAsBpB,GAl3B7B1D,8BAA8B,EAO9BA,oBAAoB,KAvDKN,mBCDxC,WACU7D,EACA8D,EAMAG,GARV,MAUElyB,0BATQjgB,YAAAkuC,EACAluC,gBAAAgyC,EAMAhyC,qBAAAmyC,EA1CFnyC,OAAiCsJ,GAAW,WAQ5CtJ,WAAoC,KAkL9C,OAhMwCuV,OACtCyiC,wBAAA,SAAY9V,GACV,MAAM,IAAIpmC,MAAM,4BAoBXk8C,eAAP,SAAoB90B,EAAc0Y,GAChC,YAAYl8B,IAARk8B,EACK,OAASA,GAEhBlgC,EACEwnB,EAAMC,iBAAiB8b,YACvB,kDAEK/b,EAAMhV,KAAKnM,aAwBtBi2C,mBAAA,SACE90B,EACAgwB,EACAtX,EACA/nB,GAJF,WAMQ/G,EAAaoW,EAAMhV,KAAKnM,WAC9BxI,KAAK2rC,KACH,qBAAuBp4B,EAAa,IAAMoW,EAAMqE,mBAIlD,IAAM0wB,EAAWD,EAAmBE,aAAah1B,EAAO0Y,GAClDuc,EAAa,GACnB5+C,KAAK45C,SAAS8E,GAAYE,EAE1B,IAAMC,EAAwBl1B,EAC3BC,iBACAk1B,8BAEH9+C,KAAK++C,aACHxrC,EAAa,QACbsrC,EACA,SAACl5C,EAAOyZ,GACN,IAAInX,EAAOmX,GAEG,MAAVzZ,IAEFA,EADAsC,EAAO,MAIK,OAAVtC,GACFc,EAAKgyC,cAAcllC,EAAYtL,GAAmB,EAAOo6B,GAGvD94B,EAAQ9C,EAAKmzC,SAAU8E,KAAcE,IAUvCtkC,EARK3U,EAEe,KAATA,EACA,oBAEA,cAAgBA,EAJhB,KAOQ,SAO3B84C,qBAAA,SAAS90B,EAAc0Y,GACrB,IAAMqc,EAAWD,EAAmBE,aAAah1B,EAAO0Y,UACjDriC,KAAK45C,SAAS8E,IAIvBD,6BAAA,SAAiB11C,KAaT01C,yBAAR,SACElrC,EACAsrC,EACAl4C,GAHF,wBAEEk4C,MAGAA,EAA8B,OAAI,SAElC7+C,KAAK44C,mBACF6E,UAA2B,GAC3BrW,KAAK,SAAA4X,GACJ,IAAMC,EAAYD,GAAiBA,EAActB,YAC7CuB,IACFJ,EAA4B,KAAII,GAGlC,IChJF1oC,EDgJQ86B,GACH5qC,EAAKkuC,UAAUh/B,OAAS,WAAa,WACtClP,EAAKkuC,UAAUj/B,KACfnC,EACA,OAEA9M,EAAKkuC,UAAU/+B,WCtJnBW,EAAS,GACb/M,EDsJoBq1C,ECtJO,SAASt2C,EAAK3G,GACnCjC,MAAMgE,QAAQ/B,GAChBA,EAAM4H,QAAQ,SAAS01C,GACrB3oC,EAAOxU,KACLyR,mBAAmBjL,GAAO,IAAMiL,mBAAmB0rC,MAIvD3oC,EAAOxU,KAAKyR,mBAAmBjL,GAAO,IAAMiL,mBAAmB5R,MAG5D2U,EAAOzU,OAAS,IAAMyU,EAAO/R,KAAK,KAAO,ID6I1CiC,EAAKklC,KAAK,4BAA8B0F,GACxC,IAAM8N,EAAM,IAAIC,eAChBD,EAAItN,mBAAqB,WACvB,GAAIlrC,GAA+B,IAAnBw4C,EAAI1S,WAAkB,CACpChmC,EAAKklC,KACH,qBAAuB0F,EAAM,qBAC7B8N,EAAIpZ,OACJ,YACAoZ,EAAIE,cAEN,IAAIp1C,EAAM,KACV,GAAkB,KAAdk1C,EAAIpZ,QAAiBoZ,EAAIpZ,OAAS,IAAK,CACzC,IACE97B,EAAMvB,EAASy2C,EAAIE,cACnB,MAAOr9C,GACP0L,GACE,qCACE2jC,EACA,KACA8N,EAAIE,cAGV14C,EAAS,KAAMsD,QAGI,MAAfk1C,EAAIpZ,QAAiC,MAAfoZ,EAAIpZ,QAC5Br4B,GACE,sCACE2jC,EACA,YACA8N,EAAIpZ,QAGVp/B,EAASw4C,EAAIpZ,QAEfp/B,EAAW,OAIfw4C,EAAInP,KAAK,MAAOqB,GAAuB,GACvC8N,EAAIlL,aA7L4BuE,IEelC8G,GAAmB,+BAuCvB,WACS3K,EACP4K,EACOC,GAHT,WACSx/C,eAAA20C,EAEA30C,SAAAw/C,EApCTx/C,qBAAkB,EAKVA,oBAAuC,KACvCA,iBAAc,IAAI+oC,GAClB/oC,kBAAe,EAOfA,kCAEG,KAIHA,mBAAgB,IAAImuB,GAM5BnuB,2BAAqD,KAanD,IAAMy/C,EAAoB,IAAIvY,GAAkBsY,GAIhD,GAFAx/C,KAAK4rC,OAASlE,GAAamE,cAAc8I,GAErC4K,GvE4hBC,IAZc,iBAAXz4C,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOU44C,OACR,4FuE1hBA1/C,KAAKsoC,QAAU,IAAImW,GACjBz+C,KAAK20C,UACL30C,KAAKy4C,cAAc7oC,KAAK5P,MACxBy/C,GAIF5sC,WAAW7S,KAAK04C,iBAAiB9oC,KAAK5P,MAAM,GAAO,OAC9C,CACL,IAAM2/C,EAAeH,EAAIlY,QAAsC,6BAE/D,GAAI,MAAOqY,EAAuD,CAChE,GAA4B,iBAAjBA,EACT,MAAM,IAAIp9C,MACR,sEAGJ,IACEsG,EAAU82C,GACV,MAAO39C,GACP,MAAM,IAAIO,MAAM,kCAAoCP,IAIxDhC,KAAK4/C,sBAAwB,IAAI9G,GAC/B94C,KAAK20C,UACL30C,KAAKy4C,cAAc7oC,KAAK5P,MACxBA,KAAK04C,iBAAiB9oC,KAAK5P,MAC3BA,KAAK24C,oBAAoB/oC,KAAK5P,MAC9By/C,EACAE,GAGF3/C,KAAKsoC,QAAUtoC,KAAK4/C,sBAGtBH,EAAkBI,uBAAuB,SAAA92C,GACvCtC,EAAK6hC,QAAQwX,iBAAiB/2C,KAKhC/I,KAAK+/C,eAAiBrY,GAAasY,oBACjCrL,EACA,WAAM,OAAA,IAAIlM,GAAchiC,EAAKmlC,OAAQnlC,EAAK6hC,WAG5CtoC,KAAKigD,qBAGLjgD,KAAKkgD,UAAY,IAAIpZ,GACrB9mC,KAAKmgD,cAAgB,IAAIze,GAAS,CAChC8C,eAAgB,SAAC7a,EAAO0Y,EAAKsX,EAAer/B,GAC1C,IAAI8lC,EAAsB,GACpB7kC,EAAO9U,EAAKy5C,UAAU3tB,QAAQ5I,EAAMhV,MAY1C,OATK4G,EAAK3R,YACRw2C,EAAa35C,EAAK05C,cAAcE,qBAC9B12B,EAAMhV,KACN4G,GAEF1I,WAAW,WACTyH,EAAW,OACV,IAEE8lC,GAETxb,cAAe,eAEjB5kC,KAAKsgD,YAAY,aAAa,GAE9BtgD,KAAKugD,gBAAkB,IAAI7e,GAAS,CAClC8C,eAAgB,SAAC7a,EAAO0Y,EAAKsX,EAAer/B,GAM1C,OALA7T,EAAK6hC,QAAQ0V,OAAOr0B,EAAOgwB,EAAetX,EAAK,SAAC0D,EAAQ99B,GACtD,IAAMkyB,EAAS7f,EAAWyrB,EAAQ99B,GAClCxB,EAAK+5C,YAAYC,0BAA0B92B,EAAMhV,KAAMwlB,KAGlD,IAETyK,cAAe,SAACjb,EAAO0Y,GACrB57B,EAAK6hC,QAAQoY,SAAS/2B,EAAO0Y,MAghBrC,OAxgBEse,qBAAA,WACE,OACG3gD,KAAK20C,UAAUh/B,OAAS,WAAa,WAAa3V,KAAK20C,UAAUj/B,MAOtEirC,iBAAA,WACE,OAAO3gD,KAAK20C,UAAU/+B,WAMxB+qC,uBAAA,WACE,IAGMC,EAHa5gD,KAAKkgD,UAAU3tB,QAChC,IAAIjf,GAAK,2BAEgBxF,OAAoB,EAC/C,OAAO,IAAI9H,MAAOE,UAAY06C,GAOhCD,iCAAA,WACE,OtCpLFE,GAJAA,EsCwL4B,CACxB/I,UAAW93C,KAAK8gD,gBtCrLD,IACD,UAAID,EAAkB,YAAK,IAAI76C,MAAOE,UACjD26C,EAPyB,IAChCA,GsCsMQF,0BAAR,SACEptC,EACAtL,EACA84C,EACA1e,GAGAriC,KAAKghD,kBACL,IAAMrsC,EAAO,IAAIrB,GAAKC,GACtBtL,EAAOjI,KAAKihD,6BACRjhD,KAAKihD,6BAA6B1tC,EAAYtL,GAC9CA,EACJ,IAAIkyB,EAAS,GACb,GAAIkI,EACF,GAAI0e,EAAS,CACX,IAAMG,EAAiBn3C,EAAI9B,EAA8B,SAACk5C,GACxD,OAAA9kC,GAAa8kC,KAEfhnB,EAASn6B,KAAKugD,gBAAgBa,sBAC5BzsC,EACAusC,EACA7e,OAEG,CACL,IAAMgf,EAAahlC,GAAapU,GAChCkyB,EAASn6B,KAAKugD,gBAAgBe,0BAC5B3sC,EACA0sC,EACAhf,QAGC,GAAI0e,EAAS,CAClB,IAAMnoB,EAAkB7uB,EAAI9B,EAA8B,SAACk5C,GACzD,OAAA9kC,GAAa8kC,KAEfhnB,EAASn6B,KAAKugD,gBAAgBgB,iBAAiB5sC,EAAMikB,OAChD,CACL,IAAM7Q,EAAO1L,GAAapU,GAC1BkyB,EAASn6B,KAAKugD,gBAAgBF,qBAAqB1rC,EAAMoT,GAE3D,IAAImL,EAAeve,EACC,EAAhBwlB,EAAOr4B,SAGToxB,EAAelzB,KAAKwhD,mBAAmB7sC,IAEzC3U,KAAKwgD,YAAYC,0BAA0BvtB,EAAciH,IAQ3DwmB,iCAAA,SAAqBh6C,GACnB3G,KAAKihD,6BAA+Bt6C,GAO9Bg6C,6BAAR,SAAyBc,GACvBzhD,KAAKsgD,YAAY,YAAamB,IACR,IAAlBA,GACFzhD,KAAK0hD,0BAQDf,gCAAR,SAA4BtiB,GAA5B,WACE/sB,GAAK+sB,EAAS,SAACz8B,EAAY2G,GACzB9B,EAAK65C,YAAY/3C,EAAK3G,MAUlB++C,wBAAR,SAAoBptC,EAAoB3R,GACtC,IAAM+S,EAAO,IAAIrB,GAAK,UAAYC,GAC5BqI,EAAUS,GAAaza,GAC7B5B,KAAKkgD,UAAUyB,eAAehtC,EAAMiH,GACpC,IAAMue,EAASn6B,KAAKmgD,cAAcE,qBAAqB1rC,EAAMiH,GAC7D5b,KAAKwgD,YAAYC,0BAA0B9rC,EAAMwlB,IAO3CwmB,4BAAR,WACE,OAAO3gD,KAAK4hD,gBASdjB,4BAAA,SACEhsC,EACAktC,EACAjuB,EACAtZ,GAJF,WAMEta,KAAK2rC,KAAK,MAAO,CACfh3B,KAAMA,EAAKnM,WACX5G,MAAOigD,EACP9oC,SAAU6a,IAKZ,IAAM7E,EAAe/uB,KAAK8hD,uBACpBC,EAAoB1lC,GAAawlC,EAAQjuB,GACzChY,EAAUoT,GACd+yB,EACAhzB,GAGIgQ,EAAU/+B,KAAKgiD,kBACf7nB,EAASn6B,KAAKugD,gBAAgB0B,mBAClCttC,EACAiH,EACAmjB,GACA,GAEF/+B,KAAKwgD,YAAYnX,YAAYlP,GAC7Bn6B,KAAKsoC,QAAQwV,IACXnpC,EAAKnM,WACLu5C,EAAkBj0C,KAAgB,GAClC,SAACi4B,EAAQ4V,GACP,IAAMuG,EAAqB,OAAXnc,EACXmc,GACHx0C,GAAK,UAAYiH,EAAO,YAAcoxB,GAGxC,IAAMoc,EAAc17C,EAAK85C,gBAAgBrqB,aACvC6I,GACCmjB,GAEHz7C,EAAK+5C,YAAYC,0BAA0B9rC,EAAMwtC,GACjD17C,EAAK27C,uBAAuB9nC,EAAYyrB,EAAQ4V,KAGpD,IAAMzoB,EAAelzB,KAAKqiD,mBAAmB1tC,GAC7C3U,KAAKwhD,mBAAmBtuB,GAExBlzB,KAAKwgD,YAAYC,0BAA0BvtB,EAAc,KAQ3DytB,mBAAA,SACEhsC,EACA2tC,EACAhoC,GAHF,WAKEta,KAAK2rC,KAAK,SAAU,CAAEh3B,KAAMA,EAAKnM,WAAY5G,MAAO0gD,IAGpD,IAAIC,GAAQ,EACNxzB,EAAe/uB,KAAK8hD,uBACpBlpB,EAAyC,GAU/C,GATApvB,EAAQ84C,EAAiB,SAACE,EAAoBC,GAC5CF,GAAQ,EACR,IAAMR,EAAoB1lC,GAAaomC,GACvC7pB,EAAgB4pB,GAAcxzB,GAC5B+yB,EACAhzB,KAICwzB,EAoCHh1C,GAAI,wDACJvN,KAAKoiD,uBAAuB9nC,EAAY,UArC9B,CACV,IAAMooC,EAAU1iD,KAAKgiD,kBACf7nB,EAASn6B,KAAKugD,gBAAgBoC,eAClChuC,EACAikB,EACA8pB,GAEF1iD,KAAKwgD,YAAYnX,YAAYlP,GAC7Bn6B,KAAKsoC,QAAQvS,MACXphB,EAAKnM,WACL85C,EACA,SAACvc,EAAQ4V,GACP,IAAMuG,EAAqB,OAAXnc,EACXmc,GACHx0C,GAAK,aAAeiH,EAAO,YAAcoxB,GAG3C,IAAMoc,EAAc17C,EAAK85C,gBAAgBrqB,aACvCwsB,GACCR,GAEGhvB,EACiB,EAArBivB,EAAYrgD,OAAa2E,EAAK+6C,mBAAmB7sC,GAAQA,EAC3DlO,EAAK+5C,YAAYC,0BAA0BvtB,EAAcivB,GACzD17C,EAAK27C,uBAAuB9nC,EAAYyrB,EAAQ4V,KAIpDnyC,EAAQ84C,EAAiB,SAAC/Y,GACxB,IAAMrW,EAAezsB,EAAK47C,mBAAmB1tC,EAAKO,MAAMq0B,IACxD9iC,EAAK+6C,mBAAmBtuB,KAI1BlzB,KAAKwgD,YAAYC,0BAA0B9rC,EAAM,MAW7CgsC,mCAAR,WAAA,WACE3gD,KAAK2rC,KAAK,sBAEV,ItC1YFld,EACAM,EAEM6zB,EsCuYE7zB,EAAe/uB,KAAK8hD,uBACpBe,GtC3YRp0B,EsC4YIzuB,KAAKosC,ctC3YTrd,EsC4YIA,EtC1YE6zB,EAAe,IAAIz0B,GACzBM,EAAKI,YAAY,IAAIvb,GAAK,IAAK,SAASqB,EAAM4G,GAC5CqnC,EAAar0B,SACX5Z,EACAqa,GAA6BzT,EAAMwT,MAGhC6zB,GsCqYDzoB,EAAkB,GAEtB0oB,EAAyBh0B,YAAYvb,GAAK2c,MAAO,SAACtb,EAAMoT,GACtDoS,EAASA,EAAOqC,OACd/1B,EAAK85C,gBAAgBF,qBAAqB1rC,EAAMoT,IAElD,IAAMmL,EAAezsB,EAAK47C,mBAAmB1tC,GAC7ClO,EAAK+6C,mBAAmBtuB,KAG1BlzB,KAAKosC,cAAgB,IAAIje,GACzBnuB,KAAKwgD,YAAYC,0BAA0BntC,GAAK2c,MAAOkK,IAOzDwmB,+BAAA,SACEhsC,EACA2F,GAFF,WAIEta,KAAKsoC,QAAQ9tB,mBAAmB7F,EAAKnM,WAAY,SAACu9B,EAAQ4V,GACzC,OAAX5V,GACFt/B,EAAK2lC,cAAc1d,OAAO/Z,GAE5BlO,EAAK27C,uBAAuB9nC,EAAYyrB,EAAQ4V,MASpDgF,4BAAA,SACEhsC,EACA/S,EACA0Y,GAHF,WAKQsB,EAAUS,GAAaza,GAC7B5B,KAAKsoC,QAAQwa,gBACXnuC,EAAKnM,WACLoT,EAAQ9N,KAAgB,GACxB,SAACi4B,EAAQ4V,GACQ,OAAX5V,GACFt/B,EAAK2lC,cAAc7d,SAAS5Z,EAAMiH,GAEpCnV,EAAK27C,uBAAuB9nC,EAAYyrB,EAAQ4V,MAWtDgF,wCAAA,SACEhsC,EACA/S,EACAmX,EACAuB,GAJF,WAMQsB,EAAUS,GAAaza,EAAOmX,GACpC/Y,KAAKsoC,QAAQwa,gBACXnuC,EAAKnM,WACLoT,EAAQ9N,KAAgB,GACxB,SAACi4B,EAAQ4V,GACQ,OAAX5V,GACFt/B,EAAK2lC,cAAc7d,SAAS5Z,EAAMiH,GAEpCnV,EAAK27C,uBAAuB9nC,EAAYyrB,EAAQ4V,MAUtDgF,+BAAA,SACEhsC,EACA2tC,EACAhoC,GAHF,WAKE,GAAI1Q,EAAQ04C,GAKV,OAJA/0C,GACE,4EAEFvN,KAAKoiD,uBAAuB9nC,EAAY,MAI1Cta,KAAKsoC,QAAQya,kBACXpuC,EAAKnM,WACL85C,EACA,SAACvc,EAAQ4V,GACQ,OAAX5V,GACFv8B,EAAQ84C,EAAiB,SAACtlC,EAAmBC,GAC3C,IAAMC,EAAeb,GAAaY,GAClCxW,EAAK2lC,cAAc7d,SAAS5Z,EAAKO,MAAM8H,GAAYE,KAGvDzW,EAAK27C,uBAAuB9nC,EAAYyrB,EAAQ4V,MAStDgF,qCAAA,SAAyBh3B,EAAcb,GACrC,IAAIqR,EAEFA,EAD4B,UAA1BxQ,EAAMhV,KAAKX,WACJhU,KAAKmgD,cAAc9iB,qBAC1B1T,EACAb,GAGO9oB,KAAKugD,gBAAgBljB,qBAC5B1T,EACAb,GAGJ9oB,KAAKwgD,YAAYwC,kBAAkBr5B,EAAMhV,KAAMwlB,IAOjDwmB,wCAAA,SACEh3B,EACAb,GAIA,IAAIqR,EAEFA,EAD4B,UAA1BxQ,EAAMhV,KAAKX,WACJhU,KAAKmgD,cAAcxiB,wBAC1BhU,EACAb,GAGO9oB,KAAKugD,gBAAgB5iB,wBAC5BhU,EACAb,GAGJ9oB,KAAKwgD,YAAYwC,kBAAkBr5B,EAAMhV,KAAMwlB,IAGjDwmB,sBAAA,WACM3gD,KAAK4/C,uBACP5/C,KAAK4/C,sBAAsBjC,UAAU2B,KAIzCqB,mBAAA,WACM3gD,KAAK4/C,uBACP5/C,KAAK4/C,sBAAsBqD,OAAO3D,KAItCqB,kBAAA,SAAMuC,GACJ,gBADIA,MACmB,oBAAZx9C,QAAX,CAEA,IAAIijC,EAIFA,EAHEua,GACGljD,KAAKuoC,iBACRvoC,KAAKuoC,eAAiB,IAAIP,GAAchoC,KAAK4rC,SACvC5rC,KAAKuoC,eAAe5gC,OAEpB3H,KAAK4rC,OAAOjkC,MAGtB,IAAMw7C,EAAc3jD,OAAOuR,KAAK43B,GAAOya,OACrC,SAACC,EAAeC,GACd,OAAA1xC,KAAKmD,IAAIuuC,EAAaxhD,OAAQuhD,IAChC,GAGF75C,EAAQm/B,EAAO,SAACP,EAAcxmC,GAE5B,IAAK,IAAIe,EAAIylC,EAAKtmC,OAAQa,EAAIwgD,EAAc,EAAGxgD,IAAKylC,GAAQ,IAC5D1iC,QAAQ6H,IAAI66B,EAAOxmC,OAIvB++C,kCAAA,SAAsB4C,GACpBvjD,KAAK4rC,OAAOkD,iBAAiByU,GAC7BvjD,KAAK+/C,eAAeyD,YAAYD,IAO1B5C,iBAAR,eAAa,aAAA3zC,mBAAAA,IAAAsC,kBACX,IAAIU,EAAS,GACThQ,KAAK4/C,wBACP5vC,EAAShQ,KAAK4/C,sBAAsBlzC,GAAK,KAE3Ca,iBAAIyC,UAAWV,KAQjBqxC,mCAAA,SACEh6C,EACAo/B,EACA4V,GAEIh1C,GACFiM,GAAe,WACb,GAAc,MAAVmzB,EACFp/B,EAAS,UACJ,CACL,IAAMS,GAAQ2+B,GAAU,SAASI,cAC7B9jC,EAAU+E,EACVu0C,IAAat5C,GAAW,KAAOs5C,GAEnC,IAAMh2C,EAAQ,IAAIpD,MAAMF,GACvBsD,EAAcyB,KAAOA,EACtBT,EAAShB,OAMjBnG,sBAAImhD,4BAAJ,WACE,OAAO3gD,KAAKyjD,aAAezjD,KAAKyjD,WAAa,IAAIC,GAAS1jD,2DC/nB5D,WAAYuW,GACVvW,KAAK2jD,eAAiB,IAAI1wB,GAAc1c,EAAOsT,YAC/C7pB,KAAKqoB,OAAS9R,EAAOsT,WACrB7pB,KAAK4jD,WAAaC,EAAaC,cAAcvtC,GAC7CvW,KAAK+jD,SAAWF,EAAaG,YAAYztC,GAwI7C,OAlIEstC,yBAAA,WACE,OAAO7jD,KAAK4jD,YAMdC,uBAAA,WACE,OAAO7jD,KAAK+jD,UAOdF,oBAAA,SAAQtoC,GACN,OACEvb,KAAKqoB,OAAO3M,QAAQ1b,KAAKikD,eAAgB1oC,IAAS,GAClDvb,KAAKqoB,OAAO3M,QAAQH,EAAMvb,KAAKkkD,eAAiB,GAOpDL,wBAAA,SACE97B,EACAxf,EACAioB,EACA0C,EACAntB,EACAotB,GAKA,OAHKnzB,KAAKs8B,QAAQ,IAAI9gB,GAAUjT,EAAKioB,MACnCA,EAAWlM,GAAaxH,YAEnB9c,KAAK2jD,eAAermC,YACzByK,EACAxf,EACAioB,EACA0C,EACAntB,EACAotB,IAOJ0wB,2BAAA,SACErxB,EACAmB,EACAR,GAEIQ,EAAQlX,eAEVkX,EAAUrP,GAAaxH,YAEzB,IAAIuV,EAAWsB,EAAQD,UAAU1zB,KAAKqoB,QAEtCgK,EAAWA,EAASlV,eAAemH,GAAaxH,YAChD,IAAMqnC,EAAOnkD,KAMb,OALA2zB,EAAQ3O,aAAaxG,GAAgB,SAASjW,EAAK0U,GAC5CknC,EAAK7nB,QAAQ,IAAI9gB,GAAUjT,EAAK0U,MACnCoV,EAAWA,EAASjV,qBAAqB7U,EAAK+b,GAAaxH,eAGxD9c,KAAK2jD,eAAetsB,eACzB7E,EACAH,EACAc,IAOJ0wB,2BAAA,SAAerxB,EAAeoB,GAE5B,OAAOpB,GAMTqxB,yBAAA,WACE,OAAO,GAMTA,6BAAA,WACE,OAAO7jD,KAAK2jD,gBAMdE,qBAAA,WACE,OAAO7jD,KAAKqoB,QAQCw7B,gBAAf,SAA6BttC,GAC3B,GAAIA,EAAO6U,WAAY,CACrB,IAAMg5B,EAAY7tC,EAAOmV,oBACzB,OAAOnV,EAAOsT,WAAWw6B,SAAS9tC,EAAO8U,qBAAsB+4B,GAE/D,OAAO7tC,EAAOsT,WAAWhE,WASdg+B,cAAf,SAA2BttC,GACzB,GAAIA,EAAO+U,SAAU,CACnB,IAAMg5B,EAAU/tC,EAAOoV,kBACvB,OAAOpV,EAAOsT,WAAWw6B,SAAS9tC,EAAOgV,mBAAoB+4B,GAE7D,OAAO/tC,EAAOsT,WAAW5D,8BCvI7B,WAAY1P,GACVvW,KAAKukD,cAAgB,IAAIV,GAAattC,GACtCvW,KAAKqoB,OAAS9R,EAAOsT,WACrB7pB,KAAKwkD,OAASjuC,EAAOkuC,WACrBzkD,KAAK0kD,UAAYnuC,EAAOouC,iBA2R5B,OArREC,wBAAA,SACE78B,EACAxf,EACAioB,EACA0C,EACAntB,EACAotB,GAKA,OAHKnzB,KAAKukD,cAAcjoB,QAAQ,IAAI9gB,GAAUjT,EAAKioB,MACjDA,EAAWlM,GAAaxH,YAEtBiL,EAAKvD,kBAAkBjc,GAAK+V,OAAOkS,GAE9BzI,EACEA,EAAKa,cAAgB5oB,KAAKwkD,OAC5BxkD,KAAKukD,cACTnsB,mBACA9a,YACCyK,EACAxf,EACAioB,EACA0C,EACAntB,EACAotB,GAGGnzB,KAAK6kD,sBACV98B,EACAxf,EACAioB,EACAzqB,EACAotB,IAQNyxB,2BAAA,SACEpyB,EACAmB,EACAR,GAEA,IAAId,EACJ,GAAIsB,EAAQlX,cAAgBkX,EAAQ/pB,UAElCyoB,EAAW/N,GAAaxH,WAAW4W,UAAU1zB,KAAKqoB,aAElD,GACgB,EAAdroB,KAAKwkD,OAAa7wB,EAAQ/K,eAC1B+K,EAAQP,UAAUpzB,KAAKqoB,QACvB,CAEAgK,EAAW/N,GAAaxH,WAAW4W,UAAU1zB,KAAKqoB,QAElD,IAAIhnB,SAEFA,EADErB,KAAK0kD,SACK/wB,EAAyB3N,uBACnChmB,KAAKukD,cAAcL,aACnBlkD,KAAKqoB,QAGKsL,EAAyB/N,gBACnC5lB,KAAKukD,cAAcN,eACnBjkD,KAAKqoB,QAIT,IADA,IAAI5I,EAAQ,EACLpe,EAASyjD,WAAarlC,EAAQzf,KAAKwkD,QAAQ,CAChD,IAAMxjD,EAAOK,EAASoiB,UAStB,KAPIzjB,KAAK0kD,SAEL1kD,KAAKqoB,OAAO3M,QAAQ1b,KAAKukD,cAAcN,eAAgBjjD,IAAS,EAGhEhB,KAAKqoB,OAAO3M,QAAQ1a,EAAMhB,KAAKukD,cAAcL,eAAiB,GAOhE,MAJA7xB,EAAWA,EAASjV,qBAAqBpc,EAAKyG,KAAMzG,EAAKua,MACzDkE,SAMC,CAIL4S,GAFAA,EAAWsB,EAAQD,UAAU1zB,KAAKqoB,SAEdlL,eAClBmH,GAAaxH,YAEf,IAAIgJ,SACAI,SACA1R,SACAnT,SACJ,GAAIrB,KAAK0kD,SAAU,CACjBrjD,EAAWgxB,EAAS0yB,mBAAmB/kD,KAAKqoB,QAC5CvC,EAAY9lB,KAAKukD,cAAcL,aAC/Bh+B,EAAUlmB,KAAKukD,cAAcN,eAC7B,IAAMe,EAAehlD,KAAKqoB,OAAO1E,aACjCnP,EAAM,SAACvJ,EAAc1L,GAAiB,OAAAylD,EAAazlD,EAAG0L,SAEtD5J,EAAWgxB,EAAS9O,YAAYvjB,KAAKqoB,QACrCvC,EAAY9lB,KAAKukD,cAAcN,eAC/B/9B,EAAUlmB,KAAKukD,cAAcL,aAC7B1vC,EAAMxU,KAAKqoB,OAAO1E,aAGhBlE,EAAQ,EAEZ,IAFA,IACIwlC,GAAiB,EACd5jD,EAASyjD,WAAW,CACrB9jD,EAAOK,EAASoiB,WACfwhC,GAAkBzwC,EAAIsR,EAAW9kB,IAAS,IAE7CikD,GAAiB,GAGjBA,GAAkBxlC,EAAQzf,KAAKwkD,QAAUhwC,EAAIxT,EAAMklB,IAAY,EAE/DzG,IAEA4S,EAAWA,EAASjV,qBAClBpc,EAAKyG,KACL6c,GAAaxH,aAMvB,OAAO9c,KAAKukD,cACTnsB,mBACAf,eAAe7E,EAASH,EAAUc,IAMvCyxB,2BAAA,SAAepyB,EAAeoB,GAE5B,OAAOpB,GAMToyB,yBAAA,WACE,OAAO,GAMTA,6BAAA,WACE,OAAO5kD,KAAKukD,cAAcnsB,oBAM5BwsB,qBAAA,WACE,OAAO5kD,KAAKqoB,QAYNu8B,kCAAR,SACE78B,EACAqG,EACA+B,EACApqB,EACAm/C,GAGA,IAAI1wC,EACJ,GAAIxU,KAAK0kD,SAAU,CACjB,IAAMS,EAAWnlD,KAAKqoB,OAAO1E,aAC7BnP,EAAM,SAACvJ,EAAc1L,GAAiB,OAAA4lD,EAAS5lD,EAAG0L,SAElDuJ,EAAMxU,KAAKqoB,OAAO1E,aAEpB,IAAMkW,EAAgB9R,EACtB5lB,EAAO03B,EAAcjR,eAAiB5oB,KAAKwkD,OAAQ,IACnD,IAAMY,EAAoB,IAAI5pC,GAAU4S,EAAU+B,GAC5Ck1B,EAAiBrlD,KAAK0kD,SACxB7qB,EAAcyrB,cAActlD,KAAKqoB,QAChCwR,EAAc0rB,aAAavlD,KAAKqoB,QAC/Bm9B,EAAUxlD,KAAKukD,cAAcjoB,QAAQ8oB,GAC3C,GAAIvrB,EAAc9H,SAAS3D,GAAW,CAOpC,IANA,IAAMq3B,EAAe5rB,EAAcrV,kBAAkB4J,GACjD4C,EAAYjrB,EAAO2/C,mBACrB1lD,KAAKqoB,OACLg9B,EACArlD,KAAK0kD,UAGQ,MAAb1zB,IACCA,EAAUvpB,MAAQ2mB,GAAYyL,EAAc9H,SAASf,EAAUvpB,QAKhEupB,EAAYjrB,EAAO2/C,mBACjB1lD,KAAKqoB,OACL2I,EACAhxB,KAAK0kD,UAGT,IAAMiB,EACS,MAAb30B,EAAoB,EAAIxc,EAAIwc,EAAWo0B,GAGzC,GADEI,IAAYr1B,EAAUvmB,WAA4B,GAAf+7C,EAOnC,OALyB,MAArBT,GACFA,EAAkB5xB,iBAChBb,GAAOgB,mBAAmBrF,EAAU+B,EAAWs1B,IAG5C5rB,EAAczc,qBAAqBgR,EAAU+B,GAE3B,MAArB+0B,GACFA,EAAkB5xB,iBAChBb,GAAOc,mBAAmBnF,EAAUq3B,IAGxC,IAAMzuB,EAAgB6C,EAAczc,qBAClCgR,EACA9J,GAAaxH,YAIf,OADe,MAAbkU,GAAqBhxB,KAAKukD,cAAcjoB,QAAQtL,IAEvB,MAArBk0B,GACFA,EAAkB5xB,iBAChBb,GAAOe,iBAAiBxC,EAAUvpB,KAAMupB,EAAUzV,OAG/Cyb,EAAc5Z,qBACnB4T,EAAUvpB,KACVupB,EAAUzV,OAGLyb,EAGN,OAAI7G,EAAUvmB,UAEZme,EACEy9B,GACqC,GAA1ChxC,EAAI6wC,EAAgBD,IACG,MAArBF,IACFA,EAAkB5xB,iBAChBb,GAAOc,mBAAmB8xB,EAAe59C,KAAM49C,EAAe9pC,OAEhE2pC,EAAkB5xB,iBAChBb,GAAOe,iBAAiBpF,EAAU+B,KAG/B0J,EACJzc,qBAAqBgR,EAAU+B,GAC/B/S,qBAAqBioC,EAAe59C,KAAM6c,GAAaxH,aAKrDiL,sBC5Tb,aACU/nB,gBAAY,EACZA,gBAAY,EACZA,oBAAgB,EAChBA,cAAU,EACVA,kBAAc,EAEdA,YAAS,EACTA,eAAY,GACZA,sBAA+B,KAC/BA,qBAAkB,GAClBA,oBAA6B,KAC7BA,mBAAgB,GAEhBA,YAASwe,GAwXnB,OAzUEonC,qBAAA,WACE,OAAO5lD,KAAK6lD,WAMdD,2BAAA,WACE,MAAuB,KAAnB5lD,KAAK8lD,UAKA9lD,KAAK6lD,UAGV7lD,KAAK8lD,YAAcF,EAAYG,yBAAyBC,gBAS9DJ,+BAAA,WAEE,OADAzjD,EAAOnC,KAAK6lD,UAAW,oCAChB7lD,KAAKimD,kBAQdL,8BAAA,WAEE,OADAzjD,EAAOnC,KAAK6lD,UAAW,oCACnB7lD,KAAKkmD,cACAlmD,KAAKmmD,gBAEL71C,IAOXs1C,mBAAA,WACE,OAAO5lD,KAAKomD,SAOdR,6BAAA,WAEE,OADAzjD,EAAOnC,KAAKomD,QAAS,kCACdpmD,KAAKqmD,gBAQdT,4BAAA,WAEE,OADAzjD,EAAOnC,KAAKomD,QAAS,kCACjBpmD,KAAKsmD,YACAtmD,KAAKumD,cAELh2C,IAOXq1C,qBAAA,WACE,OAAO5lD,KAAKwmD,WAMdZ,6BAAA,WACE,OAAO5lD,KAAKwmD,WAAgC,KAAnBxmD,KAAK8lD,WAOhCF,qBAAA,WAEE,OADAzjD,EAAOnC,KAAKwmD,UAAW,oCAChBxmD,KAAKwkD,QAMdoB,qBAAA,WACE,OAAO5lD,KAAKqoB,QAONu9B,kBAAR,WACE,IAAM9lC,EAAO,IAAI8lC,EAajB,OAZA9lC,EAAK0mC,UAAYxmD,KAAKwmD,UACtB1mC,EAAK0kC,OAASxkD,KAAKwkD,OACnB1kC,EAAK+lC,UAAY7lD,KAAK6lD,UACtB/lC,EAAKmmC,iBAAmBjmD,KAAKimD,iBAC7BnmC,EAAKomC,cAAgBlmD,KAAKkmD,cAC1BpmC,EAAKqmC,gBAAkBnmD,KAAKmmD,gBAC5BrmC,EAAKsmC,QAAUpmD,KAAKomD,QACpBtmC,EAAKumC,eAAiBrmD,KAAKqmD,eAC3BvmC,EAAKwmC,YAActmD,KAAKsmD,YACxBxmC,EAAKymC,cAAgBvmD,KAAKumD,cAC1BzmC,EAAKuI,OAASroB,KAAKqoB,OACnBvI,EAAKgmC,UAAY9lD,KAAK8lD,UACfhmC,GAOT8lC,kBAAA,SAAMa,GACJ,IAAMr5B,EAAYptB,KAAK0mD,QAIvB,OAHAt5B,EAAUo5B,WAAY,EACtBp5B,EAAUo3B,OAASiC,EACnBr5B,EAAU04B,UAAY,GACf14B,GAOTw4B,yBAAA,SAAaa,GACX,IAAMr5B,EAAYptB,KAAK0mD,QAIvB,OAHAt5B,EAAUo5B,WAAY,EACtBp5B,EAAUo3B,OAASiC,EACnBr5B,EAAU04B,UAAYF,EAAYG,yBAAyBC,eACpD54B,GAOTw4B,wBAAA,SAAYa,GACV,IAAMr5B,EAAYptB,KAAK0mD,QAIvB,OAHAt5B,EAAUo5B,WAAY,EACtBp5B,EAAUo3B,OAASiC,EACnBr5B,EAAU04B,UAAYF,EAAYG,yBAAyBY,gBACpDv5B,GAQTw4B,oBAAA,SAAQ1pC,EAAiB3T,GACvB,IAAM6kB,EAAYptB,KAAK0mD,QAavB,OAZAt5B,EAAUy4B,WAAY,OACH1/C,IAAf+V,IACFA,EAAa,MAEfkR,EAAU64B,iBAAmB/pC,EAG3BkR,EAAU+4B,gBAFD,MAAP59C,GACF6kB,EAAU84B,eAAgB,EACE39C,IAE5B6kB,EAAU84B,eAAgB,EACE,IAEvB94B,GAQTw4B,kBAAA,SAAM1pC,EAAiB3T,GACrB,IAAM6kB,EAAYptB,KAAK0mD,QAavB,OAZAt5B,EAAUg5B,SAAU,OACDjgD,IAAf+V,IACFA,EAAa,MAEfkR,EAAUi5B,eAAiBnqC,EAGzBkR,EAAUm5B,mBAFApgD,IAARoC,GACF6kB,EAAUk5B,aAAc,EACE/9C,IAE1B6kB,EAAUk5B,aAAc,EACE,IAErBl5B,GAOTw4B,oBAAA,SAAQroC,GACN,IAAM6P,EAAYptB,KAAK0mD,QAEvB,OADAt5B,EAAU/E,OAAS9K,EACZ6P,GAMTw4B,2BAAA,WACE,IAAMgB,EAA0BhB,EAAYG,yBACtCz8C,EAA4B,GAalC,GAZItJ,KAAK6lD,YACPv8C,EAAIs9C,EAAwBC,mBAAqB7mD,KAAKimD,iBAClDjmD,KAAKkmD,gBACP58C,EAAIs9C,EAAwBE,kBAAoB9mD,KAAKmmD,kBAGrDnmD,KAAKomD,UACP98C,EAAIs9C,EAAwBG,iBAAmB/mD,KAAKqmD,eAChDrmD,KAAKsmD,cACPh9C,EAAIs9C,EAAwBI,gBAAkBhnD,KAAKumD,gBAGnDvmD,KAAKwmD,UAAW,CAClBl9C,EAAIs9C,EAAwBK,OAASjnD,KAAKwkD,OAC1C,IAAI0C,EAAWlnD,KAAK8lD,UACH,KAAboB,IAEAA,EADElnD,KAAK2kD,iBACIiC,EAAwBZ,eAExBY,EAAwBD,iBAGvCr9C,EAAIs9C,EAAwBO,WAAaD,EAM3C,OAHIlnD,KAAKqoB,SAAW7J,KAClBlV,EAAIs9C,EAAwBQ,OAASpnD,KAAKqoB,OAAO7f,YAE5Cc,GAMTs8C,yBAAA,WACE,QAAS5lD,KAAK6lD,WAAa7lD,KAAKomD,SAAWpmD,KAAKwmD,YAMlDZ,sBAAA,WACE,OAAO5lD,KAAK67B,gBAAkB77B,KAAKqoB,QAAU7J,IAM/ConC,0BAAA,WACE,OAAI5lD,KAAK67B,eACA,IAAI5I,GAAcjzB,KAAK6pB,YACrB7pB,KAAK4rB,WACP,IAAIg5B,GAAc5kD,MAElB,IAAI6jD,GAAa7jD,OAS5B4lD,wCAAA,WACE,IAOIv4B,EAPEg6B,EAAiBzB,EAAY0B,sBAC7BC,EAAuC,GAE7C,OAAIvnD,KAAK0lC,cAMPrY,EADErtB,KAAKqoB,SAAW7J,GACR6oC,EAAe7oC,eAChBxe,KAAKqoB,SAAWX,GACf2/B,EAAe3/B,YAChB1nB,KAAKqoB,SAAWlM,GACfkrC,EAAelrC,WAEzBha,EAAOnC,KAAKqoB,kBAAkBP,GAAW,4BAC/B9nB,KAAKqoB,OAAO7f,YAExB++C,EAAGF,EAAeG,UAAY3+C,EAAUwkB,GAEpCrtB,KAAK6lD,YACP0B,EAAGF,EAAeI,UAAY5+C,EAAU7I,KAAKimD,kBACzCjmD,KAAKkmD,gBACPqB,EAAGF,EAAeI,WAAa,IAAM5+C,EAAU7I,KAAKmmD,mBAIpDnmD,KAAKomD,UACPmB,EAAGF,EAAeK,QAAU7+C,EAAU7I,KAAKqmD,gBACvCrmD,KAAKsmD,cACPiB,EAAGF,EAAeK,SAAW,IAAM7+C,EAAU7I,KAAKumD,iBAIlDvmD,KAAKwmD,YACHxmD,KAAK2kD,iBACP4C,EAAGF,EAAeM,gBAAkB3nD,KAAKwkD,OAEzC+C,EAAGF,EAAeO,eAAiB5nD,KAAKwkD,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,UACVhpC,eAAgB,YAChBkJ,YAAa,SACbvL,UAAW,OACXsrC,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAQDhC,UAAU,IAAIA,sBCjC9B,WAAY96B,EAAYnW,GACtB,KAAMmW,aAAgB61B,IACpB,MAAM,IAAIp+C,MACR,oEAKJmkB,YAAMoE,EAAMnW,EAAMixC,GAAYiC,SAAS,SAkT3C,OAzU+B7rC,OA2B7B8rC,mBAAA,WAGE,OAFAn8C,EAAiB,gBAAiB,EAAG,EAAGpE,UAAUzF,QAE9C9B,KAAK2U,KAAK/K,UAAkB,KACpB5J,KAAK2U,KAAK8E,WAOxBquC,kBAAA,SAAMv0C,GhEoT8B,IACpC3H,EACAM,EACAqH,EACApH,EgE9SE,OATAR,EAAiB,kBAAmB,EAAG,EAAGpE,UAAUzF,QAC1B,iBAAfyR,EACTA,EAAaxO,OAAOwO,GACTA,aAAsBD,KACJ,OAAzBtT,KAAK2U,KAAKX,YhEgTlBpI,EgE/S6B,kBhEkT7BO,IAFAD,EgEhTgD,IhEiThDqH,EgEjTmDA,KhEsTjDA,EAAaA,EAAWnL,QAAQ,mBAAoB,MAGtD6R,GAAmBrO,EAAQM,EAAgBqH,EAAYpH,IgExT9C8N,GAAmB,kBAAmB,EAAG1G,GAAY,IAGrD,IAAIu0C,EAAU9nD,KAAK8qB,KAAM9qB,KAAK2U,KAAKO,MAAM3B,KAIlDu0C,sBAAA,WACEn8C,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QAErD,IAAMimD,EAAa/nD,KAAK2U,KAAK+jB,SAC7B,OAAsB,OAAfqvB,EAAsB,KAAO,IAAID,EAAU9nD,KAAK8qB,KAAMi9B,IAI/DD,oBAAA,WACEn8C,EAAiB,iBAAkB,EAAG,EAAGpE,UAAUzF,QAGnD,IADA,IAAImnB,EAAMjpB,KACiB,OAApBipB,EAAIC,aACTD,EAAMA,EAAIC,YAEZ,OAAOD,GAIT6+B,yBAAA,WACE,OAAO9nD,KAAK8qB,KAAKk9B,UAQnBF,gBAAA,SAAIjG,EAAavnC,GACf3O,EAAiB,gBAAiB,EAAG,EAAGpE,UAAUzF,QAClDoY,GAAqB,gBAAiBla,KAAK2U,MAC3CqE,GAAwB,gBAAiB,EAAG6oC,EAAQ7hD,KAAK2U,MAAM,GAC/DtI,EAAiB,gBAAiB,EAAGiO,GAAY,GAEjD,IAAMC,EAAW,IAAI7T,EAOrB,OANA1G,KAAK8qB,KAAKm9B,gBACRjoD,KAAK2U,KACLktC,EACc,KACdtnC,EAASE,aAAaH,IAEjBC,EAASlU,SAQlByhD,mBAAA,SACEltC,EACAN,GAKA,GAHA3O,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QACrDoY,GAAqB,mBAAoBla,KAAK2U,MAE1ChV,MAAMgE,QAAQiX,GAAgB,CAEhC,IADA,IAAMC,EAAyC,GACtClY,EAAI,EAAGA,EAAIiY,EAAc9Y,SAAUa,EAC1CkY,EAAiB,GAAKlY,GAAKiY,EAAcjY,GAE3CiY,EAAgBC,EAChBnN,GACE,wMAMJ4L,GACE,mBACA,EACAsB,EACA5a,KAAK2U,MACL,GAEFtI,EAAiB,mBAAoB,EAAGiO,GAAY,GACpD,IAAMC,EAAW,IAAI7T,EAMrB,OALA1G,KAAK8qB,KAAKrf,OACRzL,KAAK2U,KACLiG,EACAL,EAASE,aAAaH,IAEjBC,EAASlU,SASlByhD,4BAAA,SACEjG,EACAjuB,EACAtZ,GAcA,GAZA3O,EAAiB,4BAA6B,EAAG,EAAGpE,UAAUzF,QAC9DoY,GAAqB,4BAA6Bla,KAAK2U,MACvDqE,GACE,4BACA,EACA6oC,EACA7hD,KAAK2U,MACL,GAEFkF,GAAiB,4BAA6B,EAAG+Z,GAAa,GAC9DvnB,EAAiB,4BAA6B,EAAGiO,GAAY,GAEvC,YAAlBta,KAAK2oB,UAA4C,UAAlB3oB,KAAK2oB,SACtC,KAAM,qCACJ3oB,KAAK2oB,SACL,0BAEJ,IAAMpO,EAAW,IAAI7T,EAOrB,OANA1G,KAAK8qB,KAAKm9B,gBACRjoD,KAAK2U,KACLktC,EACAjuB,EACArZ,EAASE,aAAaH,IAEjBC,EAASlU,SAOlByhD,mBAAA,SAAOxtC,GAKL,OAJA3O,EAAiB,mBAAoB,EAAG,EAAGpE,UAAUzF,QACrDoY,GAAqB,mBAAoBla,KAAK2U,MAC9CtI,EAAiB,mBAAoB,EAAGiO,GAAY,GAE7Cta,KAAK6P,IAAI,KAAMyK,IASxBwtC,wBAAA,SACEI,EACA5tC,EACA6tC,GAUA,GARAx8C,EAAiB,wBAAyB,EAAG,EAAGpE,UAAUzF,QAC1DoY,GAAqB,wBAAyBla,KAAK2U,MACnDtI,EAAiB,wBAAyB,EAAG67C,GAAmB,GAChE77C,EAAiB,wBAAyB,EAAGiO,GAAY,GhEwM9B,SAC7B1O,EACAM,EACAk8C,EACAj8C,GAEA,KAAIA,QAAqBhG,IAATiiD,IACI,kBAATA,EACT,MAAM,IAAI7lD,MACR2W,EAAetN,EAAQM,EAAgBC,GAAY,sBgE9MrDk8C,CAAgB,wBAAyB,EAAGF,GAAc,GAEpC,YAAlBnoD,KAAK2oB,UAA4C,UAAlB3oB,KAAK2oB,SACtC,KAAM,iCACJ3oB,KAAK2oB,SACL,+BAEiBxiB,IAAjBgiD,IAA4BA,GAAe,GAE/C,IAAM5tC,EAAW,IAAI7T,EACK,mBAAf4T,GACTC,EAASlU,QAAQO,MAAM,cAwBzB,OAPA5G,KAAK8qB,KAAKw9B,iBACRtoD,KAAK2U,KACLuzC,EAhBsB,SACtBviD,EACAoV,EACAC,GAEIrV,EACF4U,EAAS/T,OAAOb,GAEhB4U,EAAShU,QAAQ,IAAI0U,GAAkBF,EAAWC,IAE1B,mBAAfV,GACTA,EAAW3U,EAAOoV,EAAWC,IAO/BmtC,GAGK5tC,EAASlU,SAQlByhD,wBAAA,SACE/uC,EACAuB,GAEA3O,EAAiB,wBAAyB,EAAG,EAAGpE,UAAUzF,QAC1DoY,GAAqB,wBAAyBla,KAAK2U,MACnDkF,GAAiB,wBAAyB,EAAGd,GAAU,GACvD1M,EAAiB,wBAAyB,EAAGiO,GAAY,GAEzD,IAAMC,EAAW,IAAI7T,EAOrB,OANA1G,KAAK8qB,KAAKm9B,gBACRjoD,KAAK2U,KAAKO,MAAM,aAChB6D,EACA,KACAwB,EAASE,aAAaH,IAEjBC,EAASlU,SAQlByhD,iBAAA,SAAKlmD,EAAa0Y,GAChB3O,EAAiB,iBAAkB,EAAG,EAAGpE,UAAUzF,QACnDoY,GAAqB,iBAAkBla,KAAK2U,MAC5CqE,GAAwB,iBAAkB,EAAGpX,EAAO5B,KAAK2U,MAAM,GAC/DtI,EAAiB,iBAAkB,EAAGiO,GAAY,GAElD,IAWIjU,EAXE8G,EAAMnN,KAAK8qB,KAAKg2B,aAChBr5C,EAAO0T,GAAWhO,GAOlBo7C,EAAmBvoD,KAAKkV,MAAMzN,GAC9B+gD,EAAUxoD,KAAKkV,MAAMzN,GAgB3B,OAZEpB,EADW,MAATzE,EACQ2mD,EAAiB14C,IAAIjO,EAAO0Y,GAAY8sB,KAAK,WAAM,OAAAohB,IAEnDliD,QAAQC,QAAQiiD,GAG5BD,EAAiBnhB,KAAO/gC,EAAQ+gC,KAAKx3B,KAAKvJ,GAC1CkiD,EAAiB3hD,MAAQP,EAAQ+gC,KAAKx3B,KAAKvJ,OAASF,GAE1B,mBAAfmU,GACTjU,EAAQO,MAAM,cAGT2hD,GAMTT,yBAAA,WAEE,OADA5tC,GAAqB,yBAA0Bla,KAAK2U,MAC7C,IAAI0F,GAAara,KAAK8qB,KAAM9qB,KAAK2U,OAG1CnV,sBAAIsoD,4BAAJ,WACE,OAAO9nD,KAAKyoD,gDAGdjpD,sBAAIsoD,uBAAJ,WACE,OAAO9nD,KAAK2oB,0CAGdnpB,sBAAIsoD,0BAAJ,WACE,OAAO9nD,KAAKkpB,6CAGd1pB,sBAAIsoD,wBAAJ,WACE,OAAO9nD,KAAK0oD,8CAvUez9B,IAiV/BA,GAAMzD,uBAAyBsgC,GAC/BhrB,GAAUtV,uBAAyBsgC,GCtWnC,ICiBYa,GAAAA,MDjBZ,WAGE3oD,cAA4C,GAC5CA,gBAAa,EACbA,WAAkB,oBAelB,WACU4oD,EACAC,EACA1gC,gBAFAygC,mBACAC,qBACA1gC,MAAyB2gC,IAFzB9oD,WAAA4oD,EACA5oD,aAAA6oD,EACA7oD,WAAAmoB,EA+LZ,OAtLE4gC,oBAAA,SAAQC,GAKN,IAHA,IAEEhoD,EAFE2T,EAAOq0C,aAAmB11C,GAAO01C,EAAU,IAAI11C,GAAK01C,GACpD9zC,EAAQlV,KAEwB,QAA5BgB,EAAO2T,EAAKX,aAAsB,CAExCkB,EAAQ,IAAI6zC,EAAK/nD,EAAMkU,EADL3L,EAAQ2L,EAAMiT,MAAM4H,SAAU/uB,IAAS,IAAI8nD,IAE7Dn0C,EAAOA,EAAKR,WAGd,OAAOe,GAQT6zC,qBAAA,WACE,OAAO/oD,KAAKmoB,MAAMvmB,OAQpBmnD,qBAAA,SAASnnD,GACPO,OAAwB,IAAVP,EAAuB,iCACrC5B,KAAKmoB,MAAMvmB,MAAQA,EACnB5B,KAAKipD,kBAMPF,kBAAA,WACE/oD,KAAKmoB,MAAMvmB,MAAQ,KACnB5B,KAAKmoB,MAAM4H,SAAW,GACtB/vB,KAAKmoB,MAAM+gC,WAAa,EACxBlpD,KAAKipD,kBAMPF,wBAAA,WACE,OAA+B,EAAxB/oD,KAAKmoB,MAAM+gC,YAMpBH,oBAAA,WACE,OAA2B,OAApB/oD,KAAK2d,aAAwB3d,KAAKmpD,eAQ3CJ,yBAAA,SAAavrC,GAAb,WACEhU,EAAQxJ,KAAKmoB,MAAM4H,SAAU,SAAC7a,EAAeoN,GAC3C9E,EAAO,IAAIurC,EAAQ7zC,EAAOzO,EAAM6b,OAapCymC,8BAAA,SACEvrC,EACA4rC,EACAC,GAEID,IAAgBC,GAAe7rC,EAAOxd,MAE1CA,KAAKglB,aAAa,SAAS9P,GACzBA,EAAMo0C,kBAAkB9rC,GAAyB,EAAM6rC,KAGrDD,GAAeC,GAAe7rC,EAAOxd,OAW3C+oD,4BAAA,SACEvrC,EACA4rC,GAGA,IADA,IAAI7tC,EAAO6tC,EAAcppD,KAAOA,KAAK04B,SACrB,OAATnd,GAAe,CACpB,GAAIiC,EAAOjC,GACT,OAAO,EAETA,EAAOA,EAAKmd,SAEd,OAAO,GAUTqwB,gDAAA,SAAoCvrC,GAClCxd,KAAKglB,aAAa,SAAS9P,GACA,OAArBA,EAAMyI,WAAqBH,EAAOtI,GACjCA,EAAMq0C,oCAAoC/rC,MAOnDurC,iBAAA,WACE,OAAO,IAAIz1C,GACQ,OAAjBtT,KAAK6oD,QACD7oD,KAAK4oD,MACL5oD,KAAK6oD,QAAQl0C,OAAS,IAAM3U,KAAK4oD,QAOzCG,iBAAA,WACE,OAAO/oD,KAAK4oD,OAMdG,mBAAA,WACE,OAAO/oD,KAAK6oD,SAQNE,2BAAR,WACuB,OAAjB/oD,KAAK6oD,SAAkB7oD,KAAK6oD,QAAQW,aAAaxpD,KAAK4oD,MAAO5oD,OAU3D+oD,yBAAR,SAAqB/rC,EAAmB9H,GACtC,IAAMu0C,EAAav0C,EAAMtL,UACnB8/C,EAAcrgD,EAASrJ,KAAKmoB,MAAM4H,SAAU/S,GAC9CysC,GAAcC,UACT1pD,KAAKmoB,MAAM4H,SAAS/S,GAC3Bhd,KAAKmoB,MAAM+gC,aACXlpD,KAAKipD,kBACKQ,GAAeC,IACzB1pD,KAAKmoB,MAAM4H,SAAS/S,GAAa9H,EAAMiT,MACvCnoB,KAAKmoB,MAAM+gC,aACXlpD,KAAKipD,yBClMCN,GAAAA,KAAAA,wBAQVA,qBAIAA,+BAIAA,6CAGAA,mCAUDhI,GAAagJ,yBAA2B,GAuCxChJ,GAAKzgD,UAAkB+/C,mBAAqB,WAO3CjgD,KAAK4pD,sBAAwB,IAAIb,IAsBnCpI,GAAKzgD,UAAUooD,iBAAmB,SAChC3zC,EACAuzC,EACA5tC,EACA6tC,GAEAnoD,KAAK2rC,KAAK,kBAAoBh3B,GAG9B,IAAMk1C,EAAgB,aAChBC,EAAW,IAAIhC,GAAU9nD,KAAM2U,GACrCm1C,EAASh9B,GAAG,QAAS+8B,GACrB,IAKME,EAA2B,CAC/Bp1C,OACAlJ,OAAQy8C,EACR5tC,aAGAyrB,OAAQ,KAGRikB,MAAOh7C,IAGPm5C,aAAcA,EAGd8B,WAAY,EAGZC,UAvBgB,WAChBJ,EAASj9B,IAAI,QAASg9B,IAyBtBM,YAAa,KAEbC,eAAgB,KAEhBC,qBAAsB,KAEtBC,yBAA0B,KAE1BC,8BAA+B,MAI3BC,EAAexqD,KAAKyqD,gBAAgB91C,GAC1Co1C,EAAYM,qBAAuBG,EACnC,IAAM3I,EAASkI,EAAYt+C,OAAO++C,EAAa18C,OAC/C,QAAe3H,IAAX07C,GAKF,GAHAkI,EAAYG,YACZH,EAAYO,yBAA2B,KACvCP,EAAYQ,8BAAgC,KACxCR,EAAYzvC,WAAY,CAE1B,IAAMU,EAAW,IAAIsN,GACnByhC,EAAYM,qBACZ,IAAIvC,GAAU9nD,KAAM+pD,EAAYp1C,MAChC6J,IAEFurC,EAAYzvC,WAAW,MAAM,EAAOU,QAEjC,CACL/B,GACE,qCACA4oC,EACAkI,EAAYp1C,MAIdo1C,EAAYhkB,OAAS4iB,GAAkB+B,IACvC,IAAMC,EAAY3qD,KAAK4pD,sBAAsBgB,QAAQj2C,GAC/Ck2C,EAAYF,EAAUhtC,YAAc,GAC1CktC,EAAU9oD,KAAKgoD,GAEfY,EAAUG,SAASD,GAKnB,IAAIE,SACJ,GACoB,iBAAXlJ,GACI,OAAXA,GACAx4C,EAASw4C,EAAQ,aAEjBkJ,EAAkBxhD,EAAQs4C,EAAQ,aAClC1/C,EACE2W,GAAgBiyC,GAChB,yHAOFA,GAFE/qD,KAAKugD,gBAAgBhpB,uBAAuB5iB,IAC5C2P,GAAaxH,YACeJ,cAAc5O,MAE9Ci9C,EAAoDA,EAEpD,IAAMh8B,EAAe/uB,KAAK8hD,uBACpBC,EAAoB1lC,GAAawlC,EAAQkJ,GACzCnvC,EAAUoT,GACd+yB,EACAhzB,GAEFg7B,EAAYO,yBAA2BvI,EACvCgI,EAAYQ,8BAAgC3uC,EAC5CmuC,EAAYK,eAAiBpqD,KAAKgiD,kBAElC,IAAM7nB,EAASn6B,KAAKugD,gBAAgB0B,mBAClCttC,EACAiH,EACAmuC,EAAYK,eACZL,EAAY5B,cAEdnoD,KAAKwgD,YAAYC,0BAA0B9rC,EAAMwlB,GAEjDn6B,KAAKgrD,2BAURrK,GAAKzgD,UAAkBuqD,gBAAkB,SACxC91C,EACAs2C,GAEA,OACEjrD,KAAKugD,gBAAgBhpB,uBAAuB5iB,EAAMs2C,IAClD3mC,GAAaxH,YAchB6jC,GAAKzgD,UAAkB8qD,uBAAyB,SAC/CzvC,GAD+C,WAQ/C,gBAPAA,EAA4Bvb,KAAK4pD,uBAG5BruC,GACHvb,KAAKkrD,qCAAqC3vC,GAGpB,OAApBA,EAAKoC,WAAqB,CAC5B,IAAMwtC,EAAQnrD,KAAKorD,uBAAuB7vC,GAC1CpZ,EAAsB,EAAfgpD,EAAMrpD,OAAY,yCAEVqpD,EAAMzgC,MACnB,SAACq/B,GAA6B,OAAAA,EAAYhkB,SAAW4iB,GAAkB+B,OAKvE1qD,KAAKqrD,sBAAsB9vC,EAAK5G,OAAQw2C,QAEjC5vC,EAAK4tC,eACd5tC,EAAKyJ,aAAa,SAAA/H,GAChBxW,EAAKukD,uBAAuB/tC,MAYjC0jC,GAAKzgD,UAAkBmrD,sBAAwB,SAC9C12C,EACAw2C,GASA,IAX8C,WAKxCG,EAAeH,EAAMphD,IAAI,SAASwhD,GACtC,OAAOA,EAAInB,iBAEPoB,EAAcxrD,KAAKyqD,gBAAgB91C,EAAM22C,GAC3CG,EAAaD,EACXE,EAAaF,EAAYpmC,OACtBziB,EAAI,EAAGA,EAAIwoD,EAAMrpD,OAAQa,IAAK,CACrC,IAAM4oD,EAAMJ,EAAMxoD,GAClBR,EACEopD,EAAIxlB,SAAW4iB,GAAkB+B,IACjC,iEAEFa,EAAIxlB,OAAS4iB,GAAkBgD,KAC/BJ,EAAItB,aACJ,IAAM/1C,EAAeZ,GAAKY,aAAaS,EAAM42C,EAAI52C,MAEjD82C,EAAaA,EAAWnuC,YACtBpJ,EACAq3C,EAAIjB,0BAIR,IAAMsB,EAAaH,EAAW39C,KAAI,GAC5B+9C,EAAal3C,EAGnB3U,KAAKsoC,QAAQwV,IACX+N,EAAWrjD,WACXojD,EACA,SAAC7lB,GACCt/B,EAAKklC,KAAK,2BAA4B,CACpCh3B,KAAMk3C,EAAWrjD,WACjBu9B,WAGF,IAAI5L,EAAkB,GACtB,GAAe,OAAX4L,EAAiB,CAInB,IADA,IAAM5Z,EAAY,GACTxpB,EAAI,EAAGA,EAAIwoD,EAAMrpD,OAAQa,IAAK,CAKrC,GAJAwoD,EAAMxoD,GAAGojC,OAAS4iB,GAAkBmD,UACpC3xB,EAASA,EAAOqC,OACd/1B,EAAK85C,gBAAgBrqB,aAAai1B,EAAMxoD,GAAGynD,iBAEzCe,EAAMxoD,GAAG2X,WAAY,CAEvB,IAAMiB,EAAO4vC,EAAMxoD,GAAG4nD,8BAChBthC,EAAM,IAAI6+B,GAAUrhD,EAAM0kD,EAAMxoD,GAAGgS,MACnCqG,EAAW,IAAIsN,GAAa/M,EAAM0N,EAAKzK,IAC7C2N,EAAUpqB,KACRopD,EAAMxoD,GAAG2X,WAAW1K,KAAK,KAAM,MAAM,EAAMoL,IAG/CmwC,EAAMxoD,GAAGunD,YAIXzjD,EAAKykD,qCACHzkD,EAAKmjD,sBAAsBgB,QAAQj2C,IAGrClO,EAAKukD,yBAELvkD,EAAK+5C,YAAYC,0BAA0B9rC,EAAMwlB,GAGjD,IAASx3B,EAAI,EAAGA,EAAIwpB,EAAUrqB,OAAQa,IACpCiQ,GAAeuZ,EAAUxpB,QAEtB,CAEL,GAAe,cAAXojC,EACF,IAASpjC,EAAI,EAAGA,EAAIwoD,EAAMrpD,OAAQa,IAC5BwoD,EAAMxoD,GAAGojC,SAAW4iB,GAAkBoD,iBACxCZ,EAAMxoD,GAAGojC,OAAS4iB,GAAkBqD,YACjCb,EAAMxoD,GAAGojC,OAAS4iB,GAAkB+B,QAEtC,CACLh9C,GACE,kBAAoBm+C,EAAWrjD,WAAa,YAAcu9B,GAE5D,IAASpjC,EAAI,EAAGA,EAAIwoD,EAAMrpD,OAAQa,IAChCwoD,EAAMxoD,GAAGojC,OAAS4iB,GAAkBqD,YACpCb,EAAMxoD,GAAGwnD,YAAcpkB,EAI3Bt/B,EAAK+6C,mBAAmB7sC,KAG5B+2C,IAgBH/K,GAAKzgD,UAAkBshD,mBAAqB,SAASjY,GACpD,IAAM0iB,EAA0BjsD,KAAKksD,4BAA4B3iB,GAC3D50B,EAAOs3C,EAAwBt3C,OAE/Bw2C,EAAQnrD,KAAKorD,uBAAuBa,GAG1C,OAFAjsD,KAAKmsD,uBAAuBhB,EAAOx2C,GAE5BA,GAURgsC,GAAKzgD,UAAkBisD,uBAAyB,SAC/ChB,EACAx2C,GAEA,GAAqB,IAAjBw2C,EAAMrpD,OAAV,CAeA,IATA,IAgGcooD,EAhGR/9B,EAAY,GACdgO,EAAkB,GAKhBmxB,EAHcH,EAAMzwB,OAAO,SAASqjB,GACxC,OAAOA,EAAEhY,SAAW4iB,GAAkB+B,MAEP3gD,IAAI,SAASg0C,GAC5C,OAAOA,EAAEqM,iBAEFznD,EAAI,EAAGA,EAAIwoD,EAAMrpD,OAAQa,IAAK,CACrC,IAAMonD,EAAcoB,EAAMxoD,GACpBuR,EAAeZ,GAAKY,aAAaS,EAAMo1C,EAAYp1C,MACrDy3C,GAAmB,EACrBjC,SAMF,GALAhoD,EACmB,OAAjB+R,EACA,iEAGE61C,EAAYhkB,SAAW4iB,GAAkBqD,YAC3CI,GAAmB,EACnBjC,EAAcJ,EAAYI,YAC1BhwB,EAASA,EAAOqC,OACdx8B,KAAKugD,gBAAgBrqB,aAAa6zB,EAAYK,gBAAgB,SAE3D,GAAIL,EAAYhkB,SAAW4iB,GAAkB+B,IAClD,GAAIX,EAAYE,YAAetJ,GAAagJ,yBAC1CyC,GAAmB,EACnBjC,EAAc,WACdhwB,EAASA,EAAOqC,OACdx8B,KAAKugD,gBAAgBrqB,aAAa6zB,EAAYK,gBAAgB,QAE3D,CAEL,IAAMiC,EAAcrsD,KAAKyqD,gBACvBV,EAAYp1C,KACZ22C,GAEFvB,EAAYM,qBAAuBgC,EACnC,IAAM1qB,EAAUwpB,EAAMxoD,GAAG8I,OAAO4gD,EAAYv+C,OAC5C,QAAgB3H,IAAZw7B,EAAuB,CACzB1oB,GACE,qCACA0oB,EACAooB,EAAYp1C,MAEd,IAAI23C,EAAcjwC,GAAaslB,GAEV,iBAAZA,GACI,MAAXA,GACAt4B,EAASs4B,EAAS,eAGlB2qB,EAAcA,EAAYnvC,eAAekvC,EAAY3vC,gBAGvD,IAAM6vC,EAAaxC,EAAYK,eACzBr7B,EAAe/uB,KAAK8hD,uBACpB0K,EAAkBx9B,GACtBs9B,EACAv9B,GAGFg7B,EAAYO,yBAA2BgC,EACvCvC,EAAYQ,8BAAgCiC,EAC5CzC,EAAYK,eAAiBpqD,KAAKgiD,kBAElCsJ,EAAa9rB,OAAO8rB,EAAat1C,QAAQu2C,GAAa,GAStDpyB,GARAA,EAASA,EAAOqC,OACdx8B,KAAKugD,gBAAgB0B,mBACnB8H,EAAYp1C,KACZ63C,EACAzC,EAAYK,eACZL,EAAY5B,gBAGA3rB,OACdx8B,KAAKugD,gBAAgBrqB,aAAaq2B,GAAY,SAGhDH,GAAmB,EACnBjC,EAAc,SACdhwB,EAASA,EAAOqC,OACdx8B,KAAKugD,gBAAgBrqB,aAAa6zB,EAAYK,gBAAgB,IAOtE,GAFApqD,KAAKwgD,YAAYC,0BAA0B9rC,EAAMwlB,GACjDA,EAAS,GACLiyB,IAEFjB,EAAMxoD,GAAGojC,OAAS4iB,GAAkBmD,UAI1B5B,EAEPiB,EAAMxoD,GAAGunD,UADVr3C,WAAWq3C,EAAWt4C,KAAKI,MAAM,IAG/Bm5C,EAAMxoD,GAAG2X,YACX,GAAoB,WAAhB6vC,EAA0B,CAC5B,IAAMlhC,EAAM,IAAI6+B,GAAU9nD,KAAMmrD,EAAMxoD,GAAGgS,MAEnC83C,EAAiCtB,EAAMxoD,GAAG0nD,qBAC1CrvC,EAAW,IAAIsN,GAAamkC,EAAWxjC,EAAKzK,IAClD2N,EAAUpqB,KAAKopD,EAAMxoD,GAAG2X,WAAW1K,KAAK,KAAM,MAAM,EAAOoL,SAE3DmR,EAAUpqB,KACRopD,EAAMxoD,GAAG2X,WAAW1K,KAAK,KAAM,IAAIrN,MAAM4nD,IAAc,EAAO,OAQxEnqD,KAAKkrD,qCAAqClrD,KAAK4pD,uBAG/C,IAASjnD,EAAI,EAAGA,EAAIwpB,EAAUrqB,OAAQa,IACpCiQ,GAAeuZ,EAAUxpB,IAI3B3C,KAAKgrD,2BAWNrK,GAAKzgD,UAAkBgsD,4BAA8B,SACpDv3C,GAMA,IAJA,IAAI0I,EAGAqvC,EAAkB1sD,KAAK4pD,sBAEK,QAA7BvsC,EAAQ1I,EAAKX,aACiB,OAA/B04C,EAAgB/uC,YAEhB+uC,EAAkBA,EAAgB9B,QAAQvtC,GAC1C1I,EAAOA,EAAKR,WAGd,OAAOu4C,GAUR/L,GAAKzgD,UAAkBkrD,uBAAyB,SAC/CsB,GAGA,IAAMC,EAAkC,GAQxC,OAPA3sD,KAAK4sD,mCAAmCF,EAAiBC,GAGzDA,EAAiB37C,KAAK,SAAS/F,EAAG1L,GAChC,OAAO0L,EAAE++C,MAAQzqD,EAAEyqD,QAGd2C,GAQRhM,GAAKzgD,UAAkB0sD,mCAAqC,SAC3DrxC,EACA4vC,GAF2D,WAIrDN,EAAYtvC,EAAKoC,WACvB,GAAkB,OAAdktC,EACF,IAAK,IAAIloD,EAAI,EAAGA,EAAIkoD,EAAU/oD,OAAQa,IACpCwoD,EAAMppD,KAAK8oD,EAAUloD,IAIzB4Y,EAAKyJ,aAAa,SAAA9P,GAChBzO,EAAKmmD,mCAAmC13C,EAAOi2C,MAUlDxK,GAAKzgD,UAAkBgrD,qCAAuC,SAC7D3vC,GAD6D,WAGvD4vC,EAAQ5vC,EAAKoC,WACnB,GAAIwtC,EAAO,CAET,IADA,IAAI0B,EAAK,EACAC,EAAO,EAAGA,EAAO3B,EAAMrpD,OAAQgrD,IAClC3B,EAAM2B,GAAM/mB,SAAW4iB,GAAkBmD,YAC3CX,EAAM0B,GAAM1B,EAAM2B,GAClBD,KAGJ1B,EAAMrpD,OAAS+qD,EACftxC,EAAKuvC,SAAwB,EAAfK,EAAMrpD,OAAaqpD,EAAQ,MAG3C5vC,EAAKyJ,aAAa,SAAA/H,GAChBxW,EAAKykD,qCAAqCjuC,MAY7C0jC,GAAKzgD,UAAkBmiD,mBAAqB,SAAS1tC,GAAT,WACrCue,EAAelzB,KAAKksD,4BAA4Bv3C,GAAMA,OAEtD+3C,EAAkB1sD,KAAK4pD,sBAAsBgB,QAAQj2C,GAY3D,OAVA+3C,EAAgBK,gBAAgB,SAACxxC,GAC/B9U,EAAKumD,yBAAyBzxC,KAGhCvb,KAAKgtD,yBAAyBN,GAE9BA,EAAgBpD,kBAAkB,SAAC/tC,GACjC9U,EAAKumD,yBAAyBzxC,KAGzB2X,GASRytB,GAAKzgD,UAAkB8sD,yBAA2B,SACjDzxC,GAEA,IAAM4vC,EAAQ5vC,EAAKoC,WACnB,GAAc,OAAVwtC,EAAgB,CASlB,IANA,IAAMh/B,EAAY,GAIdgO,EAAkB,GAClB8yB,GAAY,EACPtqD,EAAI,EAAGA,EAAIwoD,EAAMrpD,OAAQa,IAChC,GAAIwoD,EAAMxoD,GAAGojC,SAAW4iB,GAAkBoD,uBAEnC,GAAIZ,EAAMxoD,GAAGojC,SAAW4iB,GAAkBgD,KAC/CxpD,EACE8qD,IAAatqD,EAAI,EACjB,mDAIFwoD,EAFA8B,EAAWtqD,GAEFojC,OAAS4iB,GAAkBoD,iBACpCZ,EAAMxoD,GAAGwnD,YAAc,WAWvB,GATAhoD,EACEgpD,EAAMxoD,GAAGojC,SAAW4iB,GAAkB+B,IACtC,0CAGFS,EAAMxoD,GAAGunD,YACT/vB,EAASA,EAAOqC,OACdx8B,KAAKugD,gBAAgBrqB,aAAai1B,EAAMxoD,GAAGynD,gBAAgB,IAEzDe,EAAMxoD,GAAG2X,WAAY,CAEvB6R,EAAUpqB,KACRopD,EAAMxoD,GAAG2X,WAAW1K,KAAK,KAAM,IAAIrN,MAAM,QAAQ,EAFb,QAO1B,IAAd0qD,EAEF1xC,EAAKuvC,SAAS,MAGdK,EAAMrpD,OAASmrD,EAAW,EAI5BjtD,KAAKwgD,YAAYC,0BAA0BllC,EAAK5G,OAAQwlB,GACxD,IAASx3B,EAAI,EAAGA,EAAIwpB,EAAUrqB,OAAQa,IACpCiQ,GAAeuZ,EAAUxpB,MC1uB/B,IAEIuqD,GAFEC,GAAsB,4BAO5B,aAIUntD,YAIJ,GAMIA,qBAA0B,EA8GpC,OA5GSotD,cAAP,WAIE,OAHKF,KACHA,GAAkB,IAAIE,GAEjBF,IAITE,sBAAA,WACE,IAAK,IAAMC,KAAWrtD,KAAKstD,OACzB,IAAK,IAAMC,KAASvtD,KAAKstD,OAAOD,GAC9BrtD,KAAKstD,OAAOD,GAASE,GAAO5P,aAKlCyP,mBAAA,WACE,IAAK,IAAMC,KAAWrtD,KAAKstD,OACzB,IAAK,IAAMC,KAASvtD,KAAKstD,OAAOD,GAC9BrtD,KAAKstD,OAAOD,GAASE,GAAOtK,UAWlCmK,4BAAA,SAAgB5N,EAAkBnO,GAChC,IAAMkc,EAAgBlc,GAAOmO,EAAIlY,QAAQ6lB,SAC3BhnD,IAAVonD,GACFt9C,GACE,8DACEk9C,GACA,kDAIN,IAAMh2C,EAAYF,GAAcs2C,GAC1B91C,EAAWN,EAAUM,SAY3B,OAVA0C,GAAY,gCAAiC,EAAGhD,GAC3CA,EAAUxC,KAAK/K,WAClBqG,GACE,4FAKSjQ,KAAKwtD,WAAW/1C,EAAU+nC,GAE3BwI,UAQdoF,uBAAA,SAAWtiC,GACT,IAAM2iC,EAAWlkD,EAAQvJ,KAAKstD,OAAQxiC,EAAK00B,IAAI/3C,MAE1CgmD,GAAYlkD,EAAQkkD,EAAU3iC,EAAK6pB,UAAUh+B,iBAAmBmU,GACnE7a,GACE,YAAY6a,EAAK00B,IAAI/3C,SAAQqjB,EAAK6pB,yCAGtC7pB,EAAK6yB,mBACE8P,EAAS3iC,EAAK6pB,UAAUh+B,gBAWjCy2C,uBAAA,SAAW31C,EAAoB+nC,GAC7B,IAAIiO,EAAWlkD,EAAQvJ,KAAKstD,OAAQ9N,EAAI/3C,MAEnCgmD,IACHA,EAAW,GACXztD,KAAKstD,OAAO9N,EAAI/3C,MAAQgmD,GAG1B,IAAI3iC,EAAOvhB,EAAQkkD,EAAUh2C,EAASd,eAStC,OARImU,GACF7a,GACE,2HAGJ6a,EAAO,IAAI61B,GAAKlpC,EAAUzX,KAAK0tD,eAAgBlO,GAC/CiO,EAASh2C,EAASd,eAAiBmU,GASrCsiC,4BAAA,SAAgB7N,GACdv/C,KAAK0tD,eAAiBnO,sBC9GxB,WAAoBnlC,IAAApa,WAAAoa,aACKumC,IACrB1wC,GACE,wEAKJjQ,KAAK+gB,MAAQ,IAAI+mC,GAAU1tC,EAAO9G,GAAK2c,OAEvCjwB,KAAK2tD,SAAW,IAAIC,GAAkB5tD,MAkF1C,OA/EER,sBAAIkkD,uBAAJ,WACE,OAAO1jD,KAAKoa,MAAMolC,qCAepBkE,gBAAA,SAAI/uC,GAIF,OAHA3U,KAAK6tD,cAAc,OACnBliD,EAAiB,eAAgB,EAAG,EAAGpE,UAAUzF,QAE7C6S,aAAgBmzC,GACX9nD,KAAK8tD,WAAWn5C,EAAKnM,iBAGdrC,IAATwO,EAAqB3U,KAAK+gB,MAAM7L,MAAMP,GAAQ3U,KAAK+gB,OAU5D2iC,uBAAA,SAAWrS,GAET,IAAM0c,EAAU,sBAChB/tD,KAAK6tD,cAAcE,GACnBpiD,EAAiBoiD,EAAS,EAAG,EAAGxmD,UAAUzF,QAC1C,IAAMksD,EAAY/2C,GAAco6B,GAChCl3B,GAAY4zC,EAAS,EAAGC,GAExB,IAAMv2C,EAAWu2C,EAAUv2C,SAa3B,OAZIA,EAAS/B,OAAW1V,KAAKoa,MAAcu6B,UAAuBj/B,MAChEzF,GACE89C,EACE,2DAEAt2C,EAAS/B,KACT,iBACE1V,KAAKoa,MAAcu6B,UAAuBj/B,KAC5C,KAIC1V,KAAKipB,IAAI+kC,EAAUr5C,KAAKnM,aAMzBk7C,0BAAR,SAAsBqK,GACD,OAAf/tD,KAAKoa,OACPnK,GAAM,eAAiB89C,EAAU,4BAKrCrK,sBAAA,WACE/3C,EAAiB,qBAAsB,EAAG,EAAGpE,UAAUzF,QACvD9B,KAAK6tD,cAAc,aACnB7tD,KAAKoa,MAAMujC,aAGb+F,qBAAA,WACE/3C,EAAiB,oBAAqB,EAAG,EAAGpE,UAAUzF,QACtD9B,KAAK6tD,cAAc,YACnB7tD,KAAKoa,MAAM6oC,UApGGS,cAAc,CAC5BuK,UAAW,CACTC,MAAO,iCAwGX,WAAmBlG,GAAAhoD,cAAAgoD,EAYrB,OATQ4F,mBAAN,kB9FjFwBvtD,OAAwB8tD,8C8FkF7CnuD,KAAKgoD,SAAiB6F,cAAc,UACrCT,GAAYnU,cAAcmV,WAAYpuD,KAAKgoD,SAAiB5tC,OAE3Dpa,KAAKgoD,SAAiB5tC,MAAQ,KAC9Bpa,KAAKgoD,SAAiBjnC,MAAQ,KAC/B/gB,KAAKgoD,SAAS2F,SAAW,KACzB3tD,KAAKgoD,SAAW,Y9FvFT,KADoCqG,EAAZC,YACbD,EAAI/nD,UAAU,SAAUC,EAASC,GAC/C,SAAS+nD,EAAU3sD,GAAS,IAAMK,EAAKksD,EAAUntD,KAAKY,IAAW,MAAOI,GAAKwE,EAAOxE,IACpF,SAASwsD,EAAS5sD,GAAS,IAAMK,EAAKksD,EAAiB,MAAEvsD,IAAW,MAAOI,GAAKwE,EAAOxE,IACvF,SAASC,EAAKmd,GAAUA,EAAOzd,KAAO4E,EAAQ6Y,EAAOxd,OAAS,IAAIysD,EAAE,SAAU9nD,GAAWA,EAAQ6Y,EAAOxd,SAAWwlC,KAAKmnB,EAAWC,GACnIvsD,GAAMksD,EAAYA,EAAU7mD,MAAMjH,EAASiuD,GAAc,KAAKttD,UAL/D,IAAmBX,EAASiuD,EAAYD,EAAGF,2C+FpClB,WAC9B/b,GAAoBqc,gBACpBziB,GAAsB0iB,8BAGO,WAC7B1iB,GAAsByiB,uCAIa,WACnC,OAAOrc,GAAiC,wCAGF,SACtCnpB,EACAtiB,GAECsiB,EAAI6B,KAAK80B,sBAA8BvB,uBAAyB13C,SAG9C,SAASsiB,EAAgBi6B,GAC5Cj6B,EAAI6B,KAAK6d,MAAMua,0BAGoB,SAASj6B,EAAgBs6B,GAC5Dt6B,EAAI6B,KAAK6jC,sBAAsBpL,oBAGF,SAASt6B,GACtC,OAAOA,EAAI6B,KAAKk2B,qCAGiB,SACjC/3B,EACAtiB,GAEA,OAAOsiB,EAAI6B,KAAK8jC,qBAAqBjoD,MC3C1BkoD,GAAiB/V,GAM7BA,GAAqB54C,UAAkB4uD,aAAe,SACrDv7C,EACA+G,GAEAta,KAAKy5C,YAAY,IAAK,CAAE75C,EAAG2T,GAAc+G,IAO1Cw+B,GAAqB54C,UAAkB6uD,KAAO,SAC7C9mD,EACA+mD,GAEAhvD,KAAKy5C,YAAY,OAAQ,CAAEn6C,EAAG2I,GAAQ+mD,IAIjC,IAAMC,GAAqBja,GA2BrBka,GAAmBh5C,wEArBN,SAASi5C,GACjC,IAAMC,EAAStW,GAAqB54C,UAAU49C,IAY9C,OAXAhF,GAAqB54C,UAAU49C,IAAM,SACnCvqC,EACAtL,EACAonD,EACAC,QAEiBnpD,IAAbmpD,IACFA,EAAWH,KAEbC,EAAO1tD,KAAK1B,KAAMuT,EAAYtL,EAAMonD,EAAgBC,IAE/C,WACLxW,GAAqB54C,UAAU49C,IAAMsR,wCAaV,SAASzlC,GACtC,OAAOA,EAAMqE,2BAOQ,SAASuhC,GAC9B,OAAQA,EAAYzkC,KAAK80B,sBAA8BhG,0BAQ1B,SAAS2F,GACtC6N,GAAYnU,cAAcsG,gBAAgBA,MCpEtCiQ,GAAc9L,GAAS8L,YA2BZlR,GAvBoCqP,SAAS8B,gBAC1D,WACA,SAACjQ,EAAKkQ,EAAQre,GAAQ,OAAA+b,GAAYnU,cAAc0W,gBAAgBnQ,EAAKnO,IAErE,CACEyW,aACA78B,SACAy4B,YACAp7B,gBACA7Y,gBACAk+C,YACA6B,eACAI,gBAEF,MACA"}