firebase/firebase-database.js.map

{"version":3,"file":"firebase-database.js","sources":["../../node_modules/tslib/tslib.es6.js","../util/dist/index.esm.js","../logger/dist/index.esm.js","../database/dist/index.esm.js"],"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 = 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\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 = 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\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 = y[op[0] & 2 ? \"return\" : op[0] ? \"throw\" : \"next\"]) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [0, 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) { if (o[n]) i[n] = function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; }; }\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];\r\n    return m ? m.call(o) : typeof __values === \"function\" ? __values(o) : o[Symbol.iterator]();\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","import { __extends } from 'tslib';\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @fileoverview Firebase constants.  Some of these (@defines) can be overridden at compile-time.\r\n */\r\nvar CONSTANTS = {\r\n    /**\r\n     * @define {boolean} Whether this is the client Node.js SDK.\r\n     */\r\n    NODE_CLIENT: false,\r\n    /**\r\n     * @define {boolean} Whether this is the Admin Node.js SDK.\r\n     */\r\n    NODE_ADMIN: false,\r\n    /**\r\n     * Firebase SDK Version\r\n     */\r\n    SDK_VERSION: '${JSCORE_VERSION}'\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Throws an error if the provided assertion is falsy\r\n * @param {*} assertion The assertion to be tested for falsiness\r\n * @param {!string} message The message to display if the check fails\r\n */\r\nvar assert = function (assertion, message) {\r\n    if (!assertion) {\r\n        throw assertionError(message);\r\n    }\r\n};\r\n/**\r\n * Returns an Error object suitable for throwing.\r\n * @param {string} message\r\n * @return {!Error}\r\n */\r\nvar assertionError = function (message) {\r\n    return new Error('Firebase Database (' +\r\n        CONSTANTS.SDK_VERSION +\r\n        ') INTERNAL ASSERT FAILED: ' +\r\n        message);\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar stringToByteArray = function (str) {\r\n    // TODO(user): Use native implementations if/when available\r\n    var out = [], p = 0;\r\n    for (var i = 0; i < str.length; i++) {\r\n        var c = str.charCodeAt(i);\r\n        if (c < 128) {\r\n            out[p++] = c;\r\n        }\r\n        else if (c < 2048) {\r\n            out[p++] = (c >> 6) | 192;\r\n            out[p++] = (c & 63) | 128;\r\n        }\r\n        else if ((c & 0xfc00) == 0xd800 &&\r\n            i + 1 < str.length &&\r\n            (str.charCodeAt(i + 1) & 0xfc00) == 0xdc00) {\r\n            // Surrogate Pair\r\n            c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\r\n            out[p++] = (c >> 18) | 240;\r\n            out[p++] = ((c >> 12) & 63) | 128;\r\n            out[p++] = ((c >> 6) & 63) | 128;\r\n            out[p++] = (c & 63) | 128;\r\n        }\r\n        else {\r\n            out[p++] = (c >> 12) | 224;\r\n            out[p++] = ((c >> 6) & 63) | 128;\r\n            out[p++] = (c & 63) | 128;\r\n        }\r\n    }\r\n    return out;\r\n};\r\n/**\r\n * Turns an array of numbers into the string given by the concatenation of the\r\n * characters to which the numbers correspond.\r\n * @param {Array<number>} bytes Array of numbers representing characters.\r\n * @return {string} Stringification of the array.\r\n */\r\nvar byteArrayToString = function (bytes) {\r\n    // TODO(user): Use native implementations if/when available\r\n    var out = [], pos = 0, c = 0;\r\n    while (pos < bytes.length) {\r\n        var c1 = bytes[pos++];\r\n        if (c1 < 128) {\r\n            out[c++] = String.fromCharCode(c1);\r\n        }\r\n        else if (c1 > 191 && c1 < 224) {\r\n            var c2 = bytes[pos++];\r\n            out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\r\n        }\r\n        else if (c1 > 239 && c1 < 365) {\r\n            // Surrogate Pair\r\n            var c2 = bytes[pos++];\r\n            var c3 = bytes[pos++];\r\n            var c4 = bytes[pos++];\r\n            var u = (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -\r\n                0x10000;\r\n            out[c++] = String.fromCharCode(0xd800 + (u >> 10));\r\n            out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\r\n        }\r\n        else {\r\n            var c2 = bytes[pos++];\r\n            var c3 = bytes[pos++];\r\n            out[c++] = String.fromCharCode(((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));\r\n        }\r\n    }\r\n    return out.join('');\r\n};\r\n// Static lookup maps, lazily populated by init_()\r\nvar base64 = {\r\n    /**\r\n     * Maps bytes to characters.\r\n     * @type {Object}\r\n     * @private\r\n     */\r\n    byteToCharMap_: null,\r\n    /**\r\n     * Maps characters to bytes.\r\n     * @type {Object}\r\n     * @private\r\n     */\r\n    charToByteMap_: null,\r\n    /**\r\n     * Maps bytes to websafe characters.\r\n     * @type {Object}\r\n     * @private\r\n     */\r\n    byteToCharMapWebSafe_: null,\r\n    /**\r\n     * Maps websafe characters to bytes.\r\n     * @type {Object}\r\n     * @private\r\n     */\r\n    charToByteMapWebSafe_: null,\r\n    /**\r\n     * Our default alphabet, shared between\r\n     * ENCODED_VALS and ENCODED_VALS_WEBSAFE\r\n     * @type {string}\r\n     */\r\n    ENCODED_VALS_BASE: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\r\n    /**\r\n     * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\r\n     * @type {string}\r\n     */\r\n    get ENCODED_VALS() {\r\n        return this.ENCODED_VALS_BASE + '+/=';\r\n    },\r\n    /**\r\n     * Our websafe alphabet.\r\n     * @type {string}\r\n     */\r\n    get ENCODED_VALS_WEBSAFE() {\r\n        return this.ENCODED_VALS_BASE + '-_.';\r\n    },\r\n    /**\r\n     * Whether this browser supports the atob and btoa functions. This extension\r\n     * started at Mozilla but is now implemented by many browsers. We use the\r\n     * ASSUME_* variables to avoid pulling in the full useragent detection library\r\n     * but still allowing the standard per-browser compilations.\r\n     *\r\n     * @type {boolean}\r\n     */\r\n    HAS_NATIVE_SUPPORT: typeof atob === 'function',\r\n    /**\r\n     * Base64-encode an array of bytes.\r\n     *\r\n     * @param {Array<number>|Uint8Array} input An array of bytes (numbers with\r\n     *     value in [0, 255]) to encode.\r\n     * @param {boolean=} opt_webSafe Boolean indicating we should use the\r\n     *     alternative alphabet.\r\n     * @return {string} The base64 encoded string.\r\n     */\r\n    encodeByteArray: function (input, opt_webSafe) {\r\n        if (!Array.isArray(input)) {\r\n            throw Error('encodeByteArray takes an array as a parameter');\r\n        }\r\n        this.init_();\r\n        var byteToCharMap = opt_webSafe\r\n            ? this.byteToCharMapWebSafe_\r\n            : this.byteToCharMap_;\r\n        var output = [];\r\n        for (var i = 0; i < input.length; i += 3) {\r\n            var byte1 = input[i];\r\n            var haveByte2 = i + 1 < input.length;\r\n            var byte2 = haveByte2 ? input[i + 1] : 0;\r\n            var haveByte3 = i + 2 < input.length;\r\n            var byte3 = haveByte3 ? input[i + 2] : 0;\r\n            var outByte1 = byte1 >> 2;\r\n            var outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\r\n            var outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\r\n            var outByte4 = byte3 & 0x3f;\r\n            if (!haveByte3) {\r\n                outByte4 = 64;\r\n                if (!haveByte2) {\r\n                    outByte3 = 64;\r\n                }\r\n            }\r\n            output.push(byteToCharMap[outByte1], byteToCharMap[outByte2], byteToCharMap[outByte3], byteToCharMap[outByte4]);\r\n        }\r\n        return output.join('');\r\n    },\r\n    /**\r\n     * Base64-encode a string.\r\n     *\r\n     * @param {string} input A string to encode.\r\n     * @param {boolean=} opt_webSafe If true, we should use the\r\n     *     alternative alphabet.\r\n     * @return {string} The base64 encoded string.\r\n     */\r\n    encodeString: function (input, opt_webSafe) {\r\n        // Shortcut for Mozilla browsers that implement\r\n        // a native base64 encoder in the form of \"btoa/atob\"\r\n        if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\r\n            return btoa(input);\r\n        }\r\n        return this.encodeByteArray(stringToByteArray(input), opt_webSafe);\r\n    },\r\n    /**\r\n     * Base64-decode a string.\r\n     *\r\n     * @param {string} input to decode.\r\n     * @param {boolean=} opt_webSafe True if we should use the\r\n     *     alternative alphabet.\r\n     * @return {string} string representing the decoded value.\r\n     */\r\n    decodeString: function (input, opt_webSafe) {\r\n        // Shortcut for Mozilla browsers that implement\r\n        // a native base64 encoder in the form of \"btoa/atob\"\r\n        if (this.HAS_NATIVE_SUPPORT && !opt_webSafe) {\r\n            return atob(input);\r\n        }\r\n        return byteArrayToString(this.decodeStringToByteArray(input, opt_webSafe));\r\n    },\r\n    /**\r\n     * Base64-decode a string.\r\n     *\r\n     * In base-64 decoding, groups of four characters are converted into three\r\n     * bytes.  If the encoder did not apply padding, the input length may not\r\n     * be a multiple of 4.\r\n     *\r\n     * In this case, the last group will have fewer than 4 characters, and\r\n     * padding will be inferred.  If the group has one or two characters, it decodes\r\n     * to one byte.  If the group has three characters, it decodes to two bytes.\r\n     *\r\n     * @param {string} input Input to decode.\r\n     * @param {boolean=} opt_webSafe True if we should use the web-safe alphabet.\r\n     * @return {!Array<number>} bytes representing the decoded value.\r\n     */\r\n    decodeStringToByteArray: function (input, opt_webSafe) {\r\n        this.init_();\r\n        var charToByteMap = opt_webSafe\r\n            ? this.charToByteMapWebSafe_\r\n            : this.charToByteMap_;\r\n        var output = [];\r\n        for (var i = 0; i < input.length;) {\r\n            var byte1 = charToByteMap[input.charAt(i++)];\r\n            var haveByte2 = i < input.length;\r\n            var byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\r\n            ++i;\r\n            var haveByte3 = i < input.length;\r\n            var byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\r\n            ++i;\r\n            var haveByte4 = i < input.length;\r\n            var byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\r\n            ++i;\r\n            if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\r\n                throw Error();\r\n            }\r\n            var outByte1 = (byte1 << 2) | (byte2 >> 4);\r\n            output.push(outByte1);\r\n            if (byte3 != 64) {\r\n                var outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\r\n                output.push(outByte2);\r\n                if (byte4 != 64) {\r\n                    var outByte3 = ((byte3 << 6) & 0xc0) | byte4;\r\n                    output.push(outByte3);\r\n                }\r\n            }\r\n        }\r\n        return output;\r\n    },\r\n    /**\r\n     * Lazy static initialization function. Called before\r\n     * accessing any of the static map variables.\r\n     * @private\r\n     */\r\n    init_: function () {\r\n        if (!this.byteToCharMap_) {\r\n            this.byteToCharMap_ = {};\r\n            this.charToByteMap_ = {};\r\n            this.byteToCharMapWebSafe_ = {};\r\n            this.charToByteMapWebSafe_ = {};\r\n            // We want quick mappings back and forth, so we precompute two maps.\r\n            for (var i = 0; i < this.ENCODED_VALS.length; i++) {\r\n                this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\r\n                this.charToByteMap_[this.byteToCharMap_[i]] = i;\r\n                this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\r\n                this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\r\n                // Be forgiving when decoding and correctly decode both encodings.\r\n                if (i >= this.ENCODED_VALS_BASE.length) {\r\n                    this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\r\n                    this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\r\n                }\r\n            }\r\n        }\r\n    }\r\n};\r\n/**\r\n * URL-safe base64 encoding\r\n * @param {!string} str\r\n * @return {!string}\r\n */\r\nvar base64Encode = function (str) {\r\n    var utf8Bytes = stringToByteArray(str);\r\n    return base64.encodeByteArray(utf8Bytes, true);\r\n};\r\n/**\r\n * URL-safe base64 decoding\r\n *\r\n * NOTE: DO NOT use the global atob() function - it does NOT support the\r\n * base64Url variant encoding.\r\n *\r\n * @param {string} str To be decoded\r\n * @return {?string} Decoded result, if possible\r\n */\r\nvar base64Decode = function (str) {\r\n    try {\r\n        return base64.decodeString(str, true);\r\n    }\r\n    catch (e) {\r\n        console.error('base64Decode failed: ', e);\r\n    }\r\n    return null;\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Do a deep-copy of basic JavaScript Objects or Arrays.\r\n */\r\nfunction deepCopy(value) {\r\n    return deepExtend(undefined, value);\r\n}\r\n/**\r\n * Copy properties from source to target (recursively allows extension\r\n * of Objects and Arrays).  Scalar values in the target are over-written.\r\n * If target is undefined, an object of the appropriate type will be created\r\n * (and returned).\r\n *\r\n * We recursively copy all child properties of plain Objects in the source- so\r\n * that namespace- like dictionaries are merged.\r\n *\r\n * Note that the target can be a function, in which case the properties in\r\n * the source Object are copied onto it as static properties of the Function.\r\n */\r\nfunction deepExtend(target, source) {\r\n    if (!(source instanceof Object)) {\r\n        return source;\r\n    }\r\n    switch (source.constructor) {\r\n        case Date:\r\n            // Treat Dates like scalars; if the target date object had any child\r\n            // properties - they will be lost!\r\n            var dateValue = source;\r\n            return new Date(dateValue.getTime());\r\n        case Object:\r\n            if (target === undefined) {\r\n                target = {};\r\n            }\r\n            break;\r\n        case Array:\r\n            // Always copy the array source and overwrite the target.\r\n            target = [];\r\n            break;\r\n        default:\r\n            // Not a plain Object - treat it as a scalar.\r\n            return source;\r\n    }\r\n    for (var prop in source) {\r\n        if (!source.hasOwnProperty(prop)) {\r\n            continue;\r\n        }\r\n        target[prop] = deepExtend(target[prop], source[prop]);\r\n    }\r\n    return target;\r\n}\r\n// TODO: Really needed (for JSCompiler type checking)?\r\nfunction patchProperty(obj, prop, value) {\r\n    obj[prop] = value;\r\n}\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar Deferred = /** @class */ (function () {\r\n    function Deferred() {\r\n        var _this = this;\r\n        this.promise = new Promise(function (resolve, reject) {\r\n            _this.resolve = resolve;\r\n            _this.reject = reject;\r\n        });\r\n    }\r\n    /**\r\n     * Our API internals are not promiseified and cannot because our callback APIs have subtle expectations around\r\n     * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\r\n     * and returns a node-style callback which will resolve or reject the Deferred's promise.\r\n     * @param {((?function(?(Error)): (?|undefined))| (?function(?(Error),?=): (?|undefined)))=} callback\r\n     * @return {!function(?(Error), ?=)}\r\n     */\r\n    Deferred.prototype.wrapCallback = function (callback) {\r\n        var _this = this;\r\n        return function (error, value) {\r\n            if (error) {\r\n                _this.reject(error);\r\n            }\r\n            else {\r\n                _this.resolve(value);\r\n            }\r\n            if (typeof callback === 'function') {\r\n                // Attaching noop handler just in case developer wasn't expecting\r\n                // promises\r\n                _this.promise.catch(function () { });\r\n                // Some of our callbacks don't expect a value and our own tests\r\n                // assert that the parameter length is 1\r\n                if (callback.length === 1) {\r\n                    callback(error);\r\n                }\r\n                else {\r\n                    callback(error, value);\r\n                }\r\n            }\r\n        };\r\n    };\r\n    return Deferred;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Returns navigator.userAgent string or '' if it's not defined.\r\n * @return {string} user agent string\r\n */\r\nvar getUA = function () {\r\n    if (typeof navigator !== 'undefined' &&\r\n        typeof navigator['userAgent'] === 'string') {\r\n        return navigator['userAgent'];\r\n    }\r\n    else {\r\n        return '';\r\n    }\r\n};\r\n/**\r\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\r\n *\r\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap in the Ripple emulator) nor\r\n * Cordova `onDeviceReady`, which would normally wait for a callback.\r\n *\r\n * @return {boolean} isMobileCordova\r\n */\r\nvar isMobileCordova = function () {\r\n    return (typeof window !== 'undefined' &&\r\n        !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\r\n        /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA()));\r\n};\r\n/**\r\n * Detect React Native.\r\n *\r\n * @return {boolean} True if ReactNative environment is detected.\r\n */\r\nvar isReactNative = function () {\r\n    return (typeof navigator === 'object' && navigator['product'] === 'ReactNative');\r\n};\r\n/**\r\n * Detect Node.js.\r\n *\r\n * @return {boolean} True if Node.js environment is detected.\r\n */\r\nvar isNodeSdk = function () {\r\n    return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\r\n};\n\nvar ERROR_NAME = 'FirebaseError';\r\nvar captureStackTrace = Error\r\n    .captureStackTrace;\r\n// Export for faking in tests\r\nfunction patchCapture(captureFake) {\r\n    var result = captureStackTrace;\r\n    captureStackTrace = captureFake;\r\n    return result;\r\n}\r\nvar FirebaseError = /** @class */ (function () {\r\n    function FirebaseError(code, message) {\r\n        this.code = code;\r\n        this.message = message;\r\n        // We want the stack value, if implemented by Error\r\n        if (captureStackTrace) {\r\n            // Patches this.stack, omitted calls above ErrorFactory#create\r\n            captureStackTrace(this, ErrorFactory.prototype.create);\r\n        }\r\n        else {\r\n            try {\r\n                // In case of IE11, stack will be set only after error is raised.\r\n                // https://docs.microsoft.com/en-us/scripting/javascript/reference/stack-property-error-javascript\r\n                throw Error.apply(this, arguments);\r\n            }\r\n            catch (err) {\r\n                this.name = ERROR_NAME;\r\n                // Make non-enumerable getter for the property.\r\n                Object.defineProperty(this, 'stack', {\r\n                    get: function () {\r\n                        return err.stack;\r\n                    }\r\n                });\r\n            }\r\n        }\r\n    }\r\n    return FirebaseError;\r\n}());\r\n// Back-door inheritance\r\nFirebaseError.prototype = Object.create(Error.prototype);\r\nFirebaseError.prototype.constructor = FirebaseError;\r\nFirebaseError.prototype.name = ERROR_NAME;\r\nvar ErrorFactory = /** @class */ (function () {\r\n    function ErrorFactory(service, serviceName, errors) {\r\n        this.service = service;\r\n        this.serviceName = serviceName;\r\n        this.errors = errors;\r\n        // Matches {$name}, by default.\r\n        this.pattern = /\\{\\$([^}]+)}/g;\r\n        // empty\r\n    }\r\n    ErrorFactory.prototype.create = function (code, data) {\r\n        if (data === undefined) {\r\n            data = {};\r\n        }\r\n        var template = this.errors[code];\r\n        var fullCode = this.service + '/' + code;\r\n        var message;\r\n        if (template === undefined) {\r\n            message = 'Error';\r\n        }\r\n        else {\r\n            message = template.replace(this.pattern, function (match, key) {\r\n                var value = data[key];\r\n                return value !== undefined ? value.toString() : '<' + key + '?>';\r\n            });\r\n        }\r\n        // Service: Error message (service/code).\r\n        message = this.serviceName + ': ' + message + ' (' + fullCode + ').';\r\n        var err = new FirebaseError(fullCode, message);\r\n        // Populate the Error object with message parts for programmatic\r\n        // accesses (e.g., e.file).\r\n        for (var prop in data) {\r\n            if (!data.hasOwnProperty(prop) || prop.slice(-1) === '_') {\r\n                continue;\r\n            }\r\n            err[prop] = data[prop];\r\n        }\r\n        return err;\r\n    };\r\n    return ErrorFactory;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Evaluates a JSON string into a javascript object.\r\n *\r\n * @param {string} str A string containing JSON.\r\n * @return {*} The javascript object representing the specified JSON.\r\n */\r\nfunction jsonEval(str) {\r\n    return JSON.parse(str);\r\n}\r\n/**\r\n * Returns JSON representing a javascript object.\r\n * @param {*} data Javascript object to be stringified.\r\n * @return {string} The JSON contents of the object.\r\n */\r\nfunction stringify(data) {\r\n    return JSON.stringify(data);\r\n}\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Decodes a Firebase auth. token into constituent parts.\r\n *\r\n * Notes:\r\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\r\n * - Doesn't check if the token is actually valid.\r\n *\r\n * @param {?string} token\r\n * @return {{header: *, claims: *, data: *, signature: string}}\r\n */\r\nvar decode = function (token) {\r\n    var header = {}, claims = {}, data = {}, signature = '';\r\n    try {\r\n        var parts = token.split('.');\r\n        header = jsonEval(base64Decode(parts[0]) || '');\r\n        claims = jsonEval(base64Decode(parts[1]) || '');\r\n        signature = parts[2];\r\n        data = claims['d'] || {};\r\n        delete claims['d'];\r\n    }\r\n    catch (e) { }\r\n    return {\r\n        header: header,\r\n        claims: claims,\r\n        data: data,\r\n        signature: signature\r\n    };\r\n};\r\n/**\r\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\r\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\r\n *\r\n * Notes:\r\n * - May return a false negative if there's no native base64 decoding support.\r\n * - Doesn't check if the token is actually valid.\r\n *\r\n * @param {?string} token\r\n * @return {boolean}\r\n */\r\nvar isValidTimestamp = function (token) {\r\n    var claims = decode(token).claims, now = Math.floor(new Date().getTime() / 1000), validSince, validUntil;\r\n    if (typeof claims === 'object') {\r\n        if (claims.hasOwnProperty('nbf')) {\r\n            validSince = claims['nbf'];\r\n        }\r\n        else if (claims.hasOwnProperty('iat')) {\r\n            validSince = claims['iat'];\r\n        }\r\n        if (claims.hasOwnProperty('exp')) {\r\n            validUntil = claims['exp'];\r\n        }\r\n        else {\r\n            // token will expire after 24h by default\r\n            validUntil = validSince + 86400;\r\n        }\r\n    }\r\n    return (now && validSince && validUntil && now >= validSince && now <= validUntil);\r\n};\r\n/**\r\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\r\n *\r\n * Notes:\r\n * - May return null if there's no native base64 decoding support.\r\n * - Doesn't check if the token is actually valid.\r\n *\r\n * @param {?string} token\r\n * @return {?number}\r\n */\r\nvar issuedAtTime = function (token) {\r\n    var claims = decode(token).claims;\r\n    if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\r\n        return claims['iat'];\r\n    }\r\n    return null;\r\n};\r\n/**\r\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time.\r\n *\r\n * Notes:\r\n * - May return a false negative if there's no native base64 decoding support.\r\n * - Doesn't check if the token is actually valid.\r\n *\r\n * @param {?string} token\r\n * @return {boolean}\r\n */\r\nvar isValidFormat = function (token) {\r\n    var decoded = decode(token), claims = decoded.claims;\r\n    return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\r\n};\r\n/**\r\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\r\n *\r\n * Notes:\r\n * - May return a false negative if there's no native base64 decoding support.\r\n * - Doesn't check if the token is actually valid.\r\n *\r\n * @param {?string} token\r\n * @return {boolean}\r\n */\r\nvar isAdmin = function (token) {\r\n    var claims = decode(token).claims;\r\n    return typeof claims === 'object' && claims['admin'] === true;\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// See http://www.devthought.com/2012/01/18/an-object-is-not-a-hash/\r\nvar contains = function (obj, key) {\r\n    return Object.prototype.hasOwnProperty.call(obj, key);\r\n};\r\nvar safeGet = function (obj, key) {\r\n    if (Object.prototype.hasOwnProperty.call(obj, key))\r\n        return obj[key];\r\n    // else return undefined.\r\n};\r\n/**\r\n * Enumerates the keys/values in an object, excluding keys defined on the prototype.\r\n *\r\n * @param {?Object.<K,V>} obj Object to enumerate.\r\n * @param {!function(K, V)} fn Function to call for each key and value.\r\n * @template K,V\r\n */\r\nvar forEach = function (obj, fn) {\r\n    for (var key in obj) {\r\n        if (Object.prototype.hasOwnProperty.call(obj, key)) {\r\n            fn(key, obj[key]);\r\n        }\r\n    }\r\n};\r\n/**\r\n * Copies all the (own) properties from one object to another.\r\n * @param {!Object} objTo\r\n * @param {!Object} objFrom\r\n * @return {!Object} objTo\r\n */\r\nvar extend = function (objTo, objFrom) {\r\n    forEach(objFrom, function (key, value) {\r\n        objTo[key] = value;\r\n    });\r\n    return objTo;\r\n};\r\n/**\r\n * Returns a clone of the specified object.\r\n * @param {!Object} obj\r\n * @return {!Object} cloned obj.\r\n */\r\nvar clone = function (obj) {\r\n    return extend({}, obj);\r\n};\r\n/**\r\n * Returns true if obj has typeof \"object\" and is not null.  Unlike goog.isObject(), does not return true\r\n * for functions.\r\n *\r\n * @param obj {*} A potential object.\r\n * @returns {boolean} True if it's an object.\r\n */\r\nvar isNonNullObject = function (obj) {\r\n    return typeof obj === 'object' && obj !== null;\r\n};\r\nvar isEmpty = function (obj) {\r\n    for (var key in obj) {\r\n        return false;\r\n    }\r\n    return true;\r\n};\r\nvar getCount = function (obj) {\r\n    var rv = 0;\r\n    for (var key in obj) {\r\n        rv++;\r\n    }\r\n    return rv;\r\n};\r\nvar map = function (obj, f, opt_obj) {\r\n    var res = {};\r\n    for (var key in obj) {\r\n        res[key] = f.call(opt_obj, obj[key], key, obj);\r\n    }\r\n    return res;\r\n};\r\nvar findKey = function (obj, fn, opt_this) {\r\n    for (var key in obj) {\r\n        if (fn.call(opt_this, obj[key], key, obj)) {\r\n            return key;\r\n        }\r\n    }\r\n    return undefined;\r\n};\r\nvar findValue = function (obj, fn, opt_this) {\r\n    var key = findKey(obj, fn, opt_this);\r\n    return key && obj[key];\r\n};\r\nvar getAnyKey = function (obj) {\r\n    for (var key in obj) {\r\n        return key;\r\n    }\r\n};\r\nvar getValues = function (obj) {\r\n    var res = [];\r\n    var i = 0;\r\n    for (var key in obj) {\r\n        res[i++] = obj[key];\r\n    }\r\n    return res;\r\n};\r\n/**\r\n * Tests whether every key/value pair in an object pass the test implemented\r\n * by the provided function\r\n *\r\n * @param {?Object.<K,V>} obj Object to test.\r\n * @param {!function(K, V)} fn Function to call for each key and value.\r\n * @template K,V\r\n */\r\nvar every = function (obj, fn) {\r\n    for (var key in obj) {\r\n        if (Object.prototype.hasOwnProperty.call(obj, key)) {\r\n            if (!fn(key, obj[key])) {\r\n                return false;\r\n            }\r\n        }\r\n    }\r\n    return true;\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a params\r\n * object (e.g. {arg: 'val', arg2: 'val2'})\r\n * Note: You must prepend it with ? when adding it to a URL.\r\n *\r\n * @param {!Object} querystringParams\r\n * @return {string}\r\n */\r\nvar querystring = function (querystringParams) {\r\n    var params = [];\r\n    forEach(querystringParams, function (key, value) {\r\n        if (Array.isArray(value)) {\r\n            value.forEach(function (arrayVal) {\r\n                params.push(encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal));\r\n            });\r\n        }\r\n        else {\r\n            params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\r\n        }\r\n    });\r\n    return params.length ? '&' + params.join('&') : '';\r\n};\r\n/**\r\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object (e.g. {arg: 'val', arg2: 'val2'})\r\n *\r\n * @param {string} querystring\r\n * @return {!Object}\r\n */\r\nvar querystringDecode = function (querystring) {\r\n    var obj = {};\r\n    var tokens = querystring.replace(/^\\?/, '').split('&');\r\n    tokens.forEach(function (token) {\r\n        if (token) {\r\n            var key = token.split('=');\r\n            obj[key[0]] = key[1];\r\n        }\r\n    });\r\n    return obj;\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// Copyright 2011 The Closure Library Authors. All Rights Reserved.\r\n//\r\n// Licensed under the Apache License, Version 2.0 (the \"License\");\r\n// you may not use this file except in compliance with the License.\r\n// You may obtain a copy of the License at\r\n//\r\n//      http://www.apache.org/licenses/LICENSE-2.0\r\n//\r\n// Unless required by applicable law or agreed to in writing, software\r\n// distributed under the License is distributed on an \"AS-IS\" BASIS,\r\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n// See the License for the specific language governing permissions and\r\n// limitations under the License.\r\n/**\r\n * @fileoverview Abstract cryptographic hash interface.\r\n *\r\n * See Sha1 and Md5 for sample implementations.\r\n *\r\n */\r\n/**\r\n * Create a cryptographic hash instance.\r\n *\r\n * @constructor\r\n * @struct\r\n */\r\nvar Hash = /** @class */ (function () {\r\n    function Hash() {\r\n        /**\r\n         * The block size for the hasher.\r\n         * @type {number}\r\n         */\r\n        this.blockSize = -1;\r\n    }\r\n    return Hash;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @fileoverview SHA-1 cryptographic hash.\r\n * Variable names follow the notation in FIPS PUB 180-3:\r\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\r\n *\r\n * Usage:\r\n *   var sha1 = new sha1();\r\n *   sha1.update(bytes);\r\n *   var hash = sha1.digest();\r\n *\r\n * Performance:\r\n *   Chrome 23:   ~400 Mbit/s\r\n *   Firefox 16:  ~250 Mbit/s\r\n *\r\n */\r\n/**\r\n * SHA-1 cryptographic hash constructor.\r\n *\r\n * The properties declared here are discussed in the above algorithm document.\r\n * @constructor\r\n * @extends {Hash}\r\n * @final\r\n * @struct\r\n */\r\nvar Sha1 = /** @class */ (function (_super) {\r\n    __extends(Sha1, _super);\r\n    function Sha1() {\r\n        var _this = _super.call(this) || this;\r\n        /**\r\n         * Holds the previous values of accumulated variables a-e in the compress_\r\n         * function.\r\n         * @type {!Array<number>}\r\n         * @private\r\n         */\r\n        _this.chain_ = [];\r\n        /**\r\n         * A buffer holding the partially computed hash result.\r\n         * @type {!Array<number>}\r\n         * @private\r\n         */\r\n        _this.buf_ = [];\r\n        /**\r\n         * An array of 80 bytes, each a part of the message to be hashed.  Referred to\r\n         * as the message schedule in the docs.\r\n         * @type {!Array<number>}\r\n         * @private\r\n         */\r\n        _this.W_ = [];\r\n        /**\r\n         * Contains data needed to pad messages less than 64 bytes.\r\n         * @type {!Array<number>}\r\n         * @private\r\n         */\r\n        _this.pad_ = [];\r\n        /**\r\n         * @private {number}\r\n         */\r\n        _this.inbuf_ = 0;\r\n        /**\r\n         * @private {number}\r\n         */\r\n        _this.total_ = 0;\r\n        _this.blockSize = 512 / 8;\r\n        _this.pad_[0] = 128;\r\n        for (var i = 1; i < _this.blockSize; ++i) {\r\n            _this.pad_[i] = 0;\r\n        }\r\n        _this.reset();\r\n        return _this;\r\n    }\r\n    Sha1.prototype.reset = function () {\r\n        this.chain_[0] = 0x67452301;\r\n        this.chain_[1] = 0xefcdab89;\r\n        this.chain_[2] = 0x98badcfe;\r\n        this.chain_[3] = 0x10325476;\r\n        this.chain_[4] = 0xc3d2e1f0;\r\n        this.inbuf_ = 0;\r\n        this.total_ = 0;\r\n    };\r\n    /**\r\n     * Internal compress helper function.\r\n     * @param {!Array<number>|!Uint8Array|string} buf Block to compress.\r\n     * @param {number=} opt_offset Offset of the block in the buffer.\r\n     * @private\r\n     */\r\n    Sha1.prototype.compress_ = function (buf, opt_offset) {\r\n        if (!opt_offset) {\r\n            opt_offset = 0;\r\n        }\r\n        var W = this.W_;\r\n        // get 16 big endian words\r\n        if (typeof buf === 'string') {\r\n            for (var i = 0; i < 16; i++) {\r\n                // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\r\n                // have a bug that turns the post-increment ++ operator into pre-increment\r\n                // during JIT compilation.  We have code that depends heavily on SHA-1 for\r\n                // correctness and which is affected by this bug, so I've removed all uses\r\n                // of post-increment ++ in which the result value is used.  We can revert\r\n                // this change once the Safari bug\r\n                // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\r\n                // most clients have been updated.\r\n                W[i] =\r\n                    (buf.charCodeAt(opt_offset) << 24) |\r\n                        (buf.charCodeAt(opt_offset + 1) << 16) |\r\n                        (buf.charCodeAt(opt_offset + 2) << 8) |\r\n                        buf.charCodeAt(opt_offset + 3);\r\n                opt_offset += 4;\r\n            }\r\n        }\r\n        else {\r\n            for (var i = 0; i < 16; i++) {\r\n                W[i] =\r\n                    (buf[opt_offset] << 24) |\r\n                        (buf[opt_offset + 1] << 16) |\r\n                        (buf[opt_offset + 2] << 8) |\r\n                        buf[opt_offset + 3];\r\n                opt_offset += 4;\r\n            }\r\n        }\r\n        // expand to 80 words\r\n        for (var i = 16; i < 80; i++) {\r\n            var t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\r\n            W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\r\n        }\r\n        var a = this.chain_[0];\r\n        var b = this.chain_[1];\r\n        var c = this.chain_[2];\r\n        var d = this.chain_[3];\r\n        var e = this.chain_[4];\r\n        var f, k;\r\n        // TODO(user): Try to unroll this loop to speed up the computation.\r\n        for (var i = 0; i < 80; i++) {\r\n            if (i < 40) {\r\n                if (i < 20) {\r\n                    f = d ^ (b & (c ^ d));\r\n                    k = 0x5a827999;\r\n                }\r\n                else {\r\n                    f = b ^ c ^ d;\r\n                    k = 0x6ed9eba1;\r\n                }\r\n            }\r\n            else {\r\n                if (i < 60) {\r\n                    f = (b & c) | (d & (b | c));\r\n                    k = 0x8f1bbcdc;\r\n                }\r\n                else {\r\n                    f = b ^ c ^ d;\r\n                    k = 0xca62c1d6;\r\n                }\r\n            }\r\n            var t = (((a << 5) | (a >>> 27)) + f + e + k + W[i]) & 0xffffffff;\r\n            e = d;\r\n            d = c;\r\n            c = ((b << 30) | (b >>> 2)) & 0xffffffff;\r\n            b = a;\r\n            a = t;\r\n        }\r\n        this.chain_[0] = (this.chain_[0] + a) & 0xffffffff;\r\n        this.chain_[1] = (this.chain_[1] + b) & 0xffffffff;\r\n        this.chain_[2] = (this.chain_[2] + c) & 0xffffffff;\r\n        this.chain_[3] = (this.chain_[3] + d) & 0xffffffff;\r\n        this.chain_[4] = (this.chain_[4] + e) & 0xffffffff;\r\n    };\r\n    Sha1.prototype.update = function (bytes, opt_length) {\r\n        // TODO(johnlenz): tighten the function signature and remove this check\r\n        if (bytes == null) {\r\n            return;\r\n        }\r\n        if (opt_length === undefined) {\r\n            opt_length = bytes.length;\r\n        }\r\n        var lengthMinusBlock = opt_length - this.blockSize;\r\n        var n = 0;\r\n        // Using local instead of member variables gives ~5% speedup on Firefox 16.\r\n        var buf = this.buf_;\r\n        var inbuf = this.inbuf_;\r\n        // The outer while loop should execute at most twice.\r\n        while (n < opt_length) {\r\n            // When we have no data in the block to top up, we can directly process the\r\n            // input buffer (assuming it contains sufficient data). This gives ~25%\r\n            // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\r\n            // the data is provided in large chunks (or in multiples of 64 bytes).\r\n            if (inbuf == 0) {\r\n                while (n <= lengthMinusBlock) {\r\n                    this.compress_(bytes, n);\r\n                    n += this.blockSize;\r\n                }\r\n            }\r\n            if (typeof bytes === 'string') {\r\n                while (n < opt_length) {\r\n                    buf[inbuf] = bytes.charCodeAt(n);\r\n                    ++inbuf;\r\n                    ++n;\r\n                    if (inbuf == this.blockSize) {\r\n                        this.compress_(buf);\r\n                        inbuf = 0;\r\n                        // Jump to the outer loop so we use the full-block optimization.\r\n                        break;\r\n                    }\r\n                }\r\n            }\r\n            else {\r\n                while (n < opt_length) {\r\n                    buf[inbuf] = bytes[n];\r\n                    ++inbuf;\r\n                    ++n;\r\n                    if (inbuf == this.blockSize) {\r\n                        this.compress_(buf);\r\n                        inbuf = 0;\r\n                        // Jump to the outer loop so we use the full-block optimization.\r\n                        break;\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        this.inbuf_ = inbuf;\r\n        this.total_ += opt_length;\r\n    };\r\n    /** @override */\r\n    Sha1.prototype.digest = function () {\r\n        var digest = [];\r\n        var totalBits = this.total_ * 8;\r\n        // Add pad 0x80 0x00*.\r\n        if (this.inbuf_ < 56) {\r\n            this.update(this.pad_, 56 - this.inbuf_);\r\n        }\r\n        else {\r\n            this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\r\n        }\r\n        // Add # bits.\r\n        for (var i = this.blockSize - 1; i >= 56; i--) {\r\n            this.buf_[i] = totalBits & 255;\r\n            totalBits /= 256; // Don't use bit-shifting here!\r\n        }\r\n        this.compress_(this.buf_);\r\n        var n = 0;\r\n        for (var i = 0; i < 5; i++) {\r\n            for (var j = 24; j >= 0; j -= 8) {\r\n                digest[n] = (this.chain_[i] >> j) & 255;\r\n                ++n;\r\n            }\r\n        }\r\n        return digest;\r\n    };\r\n    return Sha1;\r\n}(Hash));\n\n/**\r\n * Helper to make a Subscribe function (just like Promise helps make a\r\n * Thenable).\r\n *\r\n * @param executor Function which can make calls to a single Observer\r\n *     as a proxy.\r\n * @param onNoObservers Callback when count of Observers goes to zero.\r\n */\r\nfunction createSubscribe(executor, onNoObservers) {\r\n    var proxy = new ObserverProxy(executor, onNoObservers);\r\n    return proxy.subscribe.bind(proxy);\r\n}\r\n/**\r\n * Implement fan-out for any number of Observers attached via a subscribe\r\n * function.\r\n */\r\nvar ObserverProxy = /** @class */ (function () {\r\n    /**\r\n     * @param executor Function which can make calls to a single Observer\r\n     *     as a proxy.\r\n     * @param onNoObservers Callback when count of Observers goes to zero.\r\n     */\r\n    function ObserverProxy(executor, onNoObservers) {\r\n        var _this = this;\r\n        this.observers = [];\r\n        this.unsubscribes = [];\r\n        this.observerCount = 0;\r\n        // Micro-task scheduling by calling task.then().\r\n        this.task = Promise.resolve();\r\n        this.finalized = false;\r\n        this.onNoObservers = onNoObservers;\r\n        // Call the executor asynchronously so subscribers that are called\r\n        // synchronously after the creation of the subscribe function\r\n        // can still receive the very first value generated in the executor.\r\n        this.task\r\n            .then(function () {\r\n            executor(_this);\r\n        })\r\n            .catch(function (e) {\r\n            _this.error(e);\r\n        });\r\n    }\r\n    ObserverProxy.prototype.next = function (value) {\r\n        this.forEachObserver(function (observer) {\r\n            observer.next(value);\r\n        });\r\n    };\r\n    ObserverProxy.prototype.error = function (error) {\r\n        this.forEachObserver(function (observer) {\r\n            observer.error(error);\r\n        });\r\n        this.close(error);\r\n    };\r\n    ObserverProxy.prototype.complete = function () {\r\n        this.forEachObserver(function (observer) {\r\n            observer.complete();\r\n        });\r\n        this.close();\r\n    };\r\n    /**\r\n     * Subscribe function that can be used to add an Observer to the fan-out list.\r\n     *\r\n     * - We require that no event is sent to a subscriber sychronously to their\r\n     *   call to subscribe().\r\n     */\r\n    ObserverProxy.prototype.subscribe = function (nextOrObserver, error, complete) {\r\n        var _this = this;\r\n        var observer;\r\n        if (nextOrObserver === undefined &&\r\n            error === undefined &&\r\n            complete === undefined) {\r\n            throw new Error('Missing Observer.');\r\n        }\r\n        // Assemble an Observer object when passed as callback functions.\r\n        if (implementsAnyMethods(nextOrObserver, ['next', 'error', 'complete'])) {\r\n            observer = nextOrObserver;\r\n        }\r\n        else {\r\n            observer = {\r\n                next: nextOrObserver,\r\n                error: error,\r\n                complete: complete\r\n            };\r\n        }\r\n        if (observer.next === undefined) {\r\n            observer.next = noop;\r\n        }\r\n        if (observer.error === undefined) {\r\n            observer.error = noop;\r\n        }\r\n        if (observer.complete === undefined) {\r\n            observer.complete = noop;\r\n        }\r\n        var unsub = this.unsubscribeOne.bind(this, this.observers.length);\r\n        // Attempt to subscribe to a terminated Observable - we\r\n        // just respond to the Observer with the final error or complete\r\n        // event.\r\n        if (this.finalized) {\r\n            this.task.then(function () {\r\n                try {\r\n                    if (_this.finalError) {\r\n                        observer.error(_this.finalError);\r\n                    }\r\n                    else {\r\n                        observer.complete();\r\n                    }\r\n                }\r\n                catch (e) {\r\n                    // nothing\r\n                }\r\n                return;\r\n            });\r\n        }\r\n        this.observers.push(observer);\r\n        return unsub;\r\n    };\r\n    // Unsubscribe is synchronous - we guarantee that no events are sent to\r\n    // any unsubscribed Observer.\r\n    ObserverProxy.prototype.unsubscribeOne = function (i) {\r\n        if (this.observers === undefined || this.observers[i] === undefined) {\r\n            return;\r\n        }\r\n        delete this.observers[i];\r\n        this.observerCount -= 1;\r\n        if (this.observerCount === 0 && this.onNoObservers !== undefined) {\r\n            this.onNoObservers(this);\r\n        }\r\n    };\r\n    ObserverProxy.prototype.forEachObserver = function (fn) {\r\n        if (this.finalized) {\r\n            // Already closed by previous event....just eat the additional values.\r\n            return;\r\n        }\r\n        // Since sendOne calls asynchronously - there is no chance that\r\n        // this.observers will become undefined.\r\n        for (var i = 0; i < this.observers.length; i++) {\r\n            this.sendOne(i, fn);\r\n        }\r\n    };\r\n    // Call the Observer via one of it's callback function. We are careful to\r\n    // confirm that the observe has not been unsubscribed since this asynchronous\r\n    // function had been queued.\r\n    ObserverProxy.prototype.sendOne = function (i, fn) {\r\n        var _this = this;\r\n        // Execute the callback asynchronously\r\n        this.task.then(function () {\r\n            if (_this.observers !== undefined && _this.observers[i] !== undefined) {\r\n                try {\r\n                    fn(_this.observers[i]);\r\n                }\r\n                catch (e) {\r\n                    // Ignore exceptions raised in Observers or missing methods of an\r\n                    // Observer.\r\n                    // Log error to console. b/31404806\r\n                    if (typeof console !== 'undefined' && console.error) {\r\n                        console.error(e);\r\n                    }\r\n                }\r\n            }\r\n        });\r\n    };\r\n    ObserverProxy.prototype.close = function (err) {\r\n        var _this = this;\r\n        if (this.finalized) {\r\n            return;\r\n        }\r\n        this.finalized = true;\r\n        if (err !== undefined) {\r\n            this.finalError = err;\r\n        }\r\n        // Proxy is no longer needed - garbage collect references\r\n        this.task.then(function () {\r\n            _this.observers = undefined;\r\n            _this.onNoObservers = undefined;\r\n        });\r\n    };\r\n    return ObserverProxy;\r\n}());\r\n/** Turn synchronous function into one called asynchronously. */\r\nfunction async(fn, onError) {\r\n    return function () {\r\n        var args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            args[_i] = arguments[_i];\r\n        }\r\n        Promise.resolve(true)\r\n            .then(function () {\r\n            fn.apply(void 0, args);\r\n        })\r\n            .catch(function (error) {\r\n            if (onError) {\r\n                onError(error);\r\n            }\r\n        });\r\n    };\r\n}\r\n/**\r\n * Return true if the object passed in implements any of the named methods.\r\n */\r\nfunction implementsAnyMethods(obj, methods) {\r\n    if (typeof obj !== 'object' || obj === null) {\r\n        return false;\r\n    }\r\n    for (var _i = 0, methods_1 = methods; _i < methods_1.length; _i++) {\r\n        var method = methods_1[_i];\r\n        if (method in obj && typeof obj[method] === 'function') {\r\n            return true;\r\n        }\r\n    }\r\n    return false;\r\n}\r\nfunction noop() {\r\n    // do nothing\r\n}\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Check to make sure the appropriate number of arguments are provided for a public function.\r\n * Throws an error if it fails.\r\n *\r\n * @param {!string} fnName The function name\r\n * @param {!number} minCount The minimum number of arguments to allow for the function call\r\n * @param {!number} maxCount The maximum number of argument to allow for the function call\r\n * @param {!number} argCount The actual number of arguments provided.\r\n */\r\nvar validateArgCount = function (fnName, minCount, maxCount, argCount) {\r\n    var argError;\r\n    if (argCount < minCount) {\r\n        argError = 'at least ' + minCount;\r\n    }\r\n    else if (argCount > maxCount) {\r\n        argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\r\n    }\r\n    if (argError) {\r\n        var error = fnName +\r\n            ' failed: Was called with ' +\r\n            argCount +\r\n            (argCount === 1 ? ' argument.' : ' arguments.') +\r\n            ' Expects ' +\r\n            argError +\r\n            '.';\r\n        throw new Error(error);\r\n    }\r\n};\r\n/**\r\n * Generates a string to prefix an error message about failed argument validation\r\n *\r\n * @param {!string} fnName The function name\r\n * @param {!number} argumentNumber The index of the argument\r\n * @param {boolean} optional Whether or not the argument is optional\r\n * @return {!string} The prefix to add to the error thrown for validation.\r\n */\r\nfunction errorPrefix(fnName, argumentNumber, optional) {\r\n    var argName = '';\r\n    switch (argumentNumber) {\r\n        case 1:\r\n            argName = optional ? 'first' : 'First';\r\n            break;\r\n        case 2:\r\n            argName = optional ? 'second' : 'Second';\r\n            break;\r\n        case 3:\r\n            argName = optional ? 'third' : 'Third';\r\n            break;\r\n        case 4:\r\n            argName = optional ? 'fourth' : 'Fourth';\r\n            break;\r\n        default:\r\n            throw new Error('errorPrefix called with argumentNumber > 4.  Need to update it?');\r\n    }\r\n    var error = fnName + ' failed: ';\r\n    error += argName + ' argument ';\r\n    return error;\r\n}\r\n/**\r\n * @param {!string} fnName\r\n * @param {!number} argumentNumber\r\n * @param {!string} namespace\r\n * @param {boolean} optional\r\n */\r\nfunction validateNamespace(fnName, argumentNumber, namespace, optional) {\r\n    if (optional && !namespace)\r\n        return;\r\n    if (typeof namespace !== 'string') {\r\n        //TODO: I should do more validation here. We only allow certain chars in namespaces.\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'must be a valid firebase namespace.');\r\n    }\r\n}\r\nfunction validateCallback(fnName, argumentNumber, callback, optional) {\r\n    if (optional && !callback)\r\n        return;\r\n    if (typeof callback !== 'function')\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'must be a valid function.');\r\n}\r\nfunction validateContextObject(fnName, argumentNumber, context, optional) {\r\n    if (optional && !context)\r\n        return;\r\n    if (typeof context !== 'object' || context === null)\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'must be a valid context object.');\r\n}\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\r\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\r\n// so it's been modified.\r\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\r\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\r\n// use 2 characters in Javascript.  All 4-byte UTF-8 characters begin with a first\r\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\r\n// pair).\r\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\r\n/**\r\n * @param {string} str\r\n * @return {Array}\r\n */\r\nvar stringToByteArray$1 = function (str) {\r\n    var out = [], p = 0;\r\n    for (var i = 0; i < str.length; i++) {\r\n        var c = str.charCodeAt(i);\r\n        // Is this the lead surrogate in a surrogate pair?\r\n        if (c >= 0xd800 && c <= 0xdbff) {\r\n            var high = c - 0xd800; // the high 10 bits.\r\n            i++;\r\n            assert(i < str.length, 'Surrogate pair missing trail surrogate.');\r\n            var low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\r\n            c = 0x10000 + (high << 10) + low;\r\n        }\r\n        if (c < 128) {\r\n            out[p++] = c;\r\n        }\r\n        else if (c < 2048) {\r\n            out[p++] = (c >> 6) | 192;\r\n            out[p++] = (c & 63) | 128;\r\n        }\r\n        else if (c < 65536) {\r\n            out[p++] = (c >> 12) | 224;\r\n            out[p++] = ((c >> 6) & 63) | 128;\r\n            out[p++] = (c & 63) | 128;\r\n        }\r\n        else {\r\n            out[p++] = (c >> 18) | 240;\r\n            out[p++] = ((c >> 12) & 63) | 128;\r\n            out[p++] = ((c >> 6) & 63) | 128;\r\n            out[p++] = (c & 63) | 128;\r\n        }\r\n    }\r\n    return out;\r\n};\r\n/**\r\n * Calculate length without actually converting; useful for doing cheaper validation.\r\n * @param {string} str\r\n * @return {number}\r\n */\r\nvar stringLength = function (str) {\r\n    var p = 0;\r\n    for (var i = 0; i < str.length; i++) {\r\n        var c = str.charCodeAt(i);\r\n        if (c < 128) {\r\n            p++;\r\n        }\r\n        else if (c < 2048) {\r\n            p += 2;\r\n        }\r\n        else if (c >= 0xd800 && c <= 0xdbff) {\r\n            // Lead surrogate of a surrogate pair.  The pair together will take 4 bytes to represent.\r\n            p += 4;\r\n            i++; // skip trail surrogate.\r\n        }\r\n        else {\r\n            p += 3;\r\n        }\r\n    }\r\n    return p;\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\n\nexport { assert, assertionError, base64, base64Decode, base64Encode, CONSTANTS, deepCopy, deepExtend, patchProperty, Deferred, getUA, isMobileCordova, isNodeSdk, isReactNative, ErrorFactory, FirebaseError, patchCapture, jsonEval, stringify, decode, isAdmin, issuedAtTime, isValidFormat, isValidTimestamp, clone, contains, every, extend, findKey, findValue, forEach, getAnyKey, getCount, getValues, isEmpty, isNonNullObject, map, safeGet, querystring, querystringDecode, Sha1, async, createSubscribe, errorPrefix, validateArgCount, validateCallback, validateContextObject, validateNamespace, stringLength, stringToByteArray$1 as stringToByteArray };\n","/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * A container for all of the Logger instances\r\n */\r\nvar instances = [];\r\n/**\r\n * The JS SDK supports 5 log levels and also allows a user the ability to\r\n * silence the logs altogether.\r\n *\r\n * The order is a follows:\r\n * DEBUG < VERBOSE < INFO < WARN < ERROR\r\n *\r\n * All of the log types above the current log level will be captured (i.e. if\r\n * you set the log level to `INFO`, errors will still be logged, but `DEBUG` and\r\n * `VERBOSE` logs will not)\r\n */\r\nvar LogLevel;\r\n(function (LogLevel) {\r\n    LogLevel[LogLevel[\"DEBUG\"] = 0] = \"DEBUG\";\r\n    LogLevel[LogLevel[\"VERBOSE\"] = 1] = \"VERBOSE\";\r\n    LogLevel[LogLevel[\"INFO\"] = 2] = \"INFO\";\r\n    LogLevel[LogLevel[\"WARN\"] = 3] = \"WARN\";\r\n    LogLevel[LogLevel[\"ERROR\"] = 4] = \"ERROR\";\r\n    LogLevel[LogLevel[\"SILENT\"] = 5] = \"SILENT\";\r\n})(LogLevel || (LogLevel = {}));\r\n/**\r\n * The default log level\r\n */\r\nvar defaultLogLevel = LogLevel.INFO;\r\n/**\r\n * The default log handler will forward DEBUG, VERBOSE, INFO, WARN, and ERROR\r\n * messages on to their corresponding console counterparts (if the log method\r\n * is supported by the current log level)\r\n */\r\nvar defaultLogHandler = function (instance, logType) {\r\n    var args = [];\r\n    for (var _i = 2; _i < arguments.length; _i++) {\r\n        args[_i - 2] = arguments[_i];\r\n    }\r\n    if (logType < instance.logLevel)\r\n        return;\r\n    var now = new Date().toISOString();\r\n    switch (logType) {\r\n        /**\r\n         * By default, `console.debug` is not displayed in the developer console (in\r\n         * chrome). To avoid forcing users to have to opt-in to these logs twice\r\n         * (i.e. once for firebase, and once in the console), we are sending `DEBUG`\r\n         * logs to the `console.log` function.\r\n         */\r\n        case LogLevel.DEBUG:\r\n            console.log.apply(console, [\"[\" + now + \"]  \" + instance.name + \":\"].concat(args));\r\n            break;\r\n        case LogLevel.VERBOSE:\r\n            console.log.apply(console, [\"[\" + now + \"]  \" + instance.name + \":\"].concat(args));\r\n            break;\r\n        case LogLevel.INFO:\r\n            console.info.apply(console, [\"[\" + now + \"]  \" + instance.name + \":\"].concat(args));\r\n            break;\r\n        case LogLevel.WARN:\r\n            console.warn.apply(console, [\"[\" + now + \"]  \" + instance.name + \":\"].concat(args));\r\n            break;\r\n        case LogLevel.ERROR:\r\n            console.error.apply(console, [\"[\" + now + \"]  \" + instance.name + \":\"].concat(args));\r\n            break;\r\n        default:\r\n            throw new Error(\"Attempted to log a message with an invalid logType (value: \" + logType + \")\");\r\n    }\r\n};\r\nvar Logger = /** @class */ (function () {\r\n    /**\r\n     * Gives you an instance of a Logger to capture messages according to\r\n     * Firebase's logging scheme.\r\n     *\r\n     * @param name The name that the logs will be associated with\r\n     */\r\n    function Logger(name) {\r\n        this.name = name;\r\n        /**\r\n         * The log level of the given Logger instance.\r\n         */\r\n        this._logLevel = defaultLogLevel;\r\n        /**\r\n         * The log handler for the Logger instance.\r\n         */\r\n        this._logHandler = defaultLogHandler;\r\n        /**\r\n         * Capture the current instance for later use\r\n         */\r\n        instances.push(this);\r\n    }\r\n    Object.defineProperty(Logger.prototype, \"logLevel\", {\r\n        get: function () {\r\n            return this._logLevel;\r\n        },\r\n        set: function (val) {\r\n            if (!(val in LogLevel)) {\r\n                throw new TypeError('Invalid value assigned to `logLevel`');\r\n            }\r\n            this._logLevel = val;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Object.defineProperty(Logger.prototype, \"logHandler\", {\r\n        get: function () {\r\n            return this._logHandler;\r\n        },\r\n        set: function (val) {\r\n            if (typeof val !== 'function') {\r\n                throw new TypeError('Value assigned to `logHandler` must be a function');\r\n            }\r\n            this._logHandler = val;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     * The functions below are all based on the `console` interface\r\n     */\r\n    Logger.prototype.debug = function () {\r\n        var args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            args[_i] = arguments[_i];\r\n        }\r\n        this._logHandler.apply(this, [this, LogLevel.DEBUG].concat(args));\r\n    };\r\n    Logger.prototype.log = function () {\r\n        var args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            args[_i] = arguments[_i];\r\n        }\r\n        this._logHandler.apply(this, [this, LogLevel.VERBOSE].concat(args));\r\n    };\r\n    Logger.prototype.info = function () {\r\n        var args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            args[_i] = arguments[_i];\r\n        }\r\n        this._logHandler.apply(this, [this, LogLevel.INFO].concat(args));\r\n    };\r\n    Logger.prototype.warn = function () {\r\n        var args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            args[_i] = arguments[_i];\r\n        }\r\n        this._logHandler.apply(this, [this, LogLevel.WARN].concat(args));\r\n    };\r\n    Logger.prototype.error = function () {\r\n        var args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            args[_i] = arguments[_i];\r\n        }\r\n        this._logHandler.apply(this, [this, LogLevel.ERROR].concat(args));\r\n    };\r\n    return Logger;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nfunction setLogLevel(level) {\r\n    instances.forEach(function (inst) {\r\n        inst.logLevel = level;\r\n    });\r\n}\n\nexport { setLogLevel, Logger, LogLevel };\n","import { jsonEval, stringify, contains, assert, forEach, base64, Sha1, stringToByteArray, isNodeSdk, stringLength, safeGet, errorPrefix, validateArgCount, validateCallback, Deferred, assertionError, clone, map, getCount, getAnyKey, every, validateContextObject, isEmpty, getValues, findValue, findKey, deepCopy, isMobileCordova, base64Encode, CONSTANTS, isAdmin, isValidFormat, isReactNative, querystring } from '@firebase/util';\nimport { Logger, LogLevel } from '@firebase/logger';\nimport { __awaiter, __generator, __extends } from 'tslib';\nimport firebase from '@firebase/app';\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Wraps a DOM Storage object and:\r\n * - automatically encode objects as JSON strings before storing them to allow us to store arbitrary types.\r\n * - prefixes names with \"firebase:\" to avoid collisions with app data.\r\n *\r\n * We automatically (see storage.js) create two such wrappers, one for sessionStorage,\r\n * and one for localStorage.\r\n *\r\n * @constructor\r\n */\r\nvar DOMStorageWrapper = /** @class */ (function () {\r\n    /**\r\n     * @param {Storage} domStorage_ The underlying storage object (e.g. localStorage or sessionStorage)\r\n     */\r\n    function DOMStorageWrapper(domStorage_) {\r\n        this.domStorage_ = domStorage_;\r\n        // Use a prefix to avoid collisions with other stuff saved by the app.\r\n        this.prefix_ = 'firebase:';\r\n    }\r\n    /**\r\n     * @param {string} key The key to save the value under\r\n     * @param {?Object} value The value being stored, or null to remove the key.\r\n     */\r\n    DOMStorageWrapper.prototype.set = function (key, value) {\r\n        if (value == null) {\r\n            this.domStorage_.removeItem(this.prefixedName_(key));\r\n        }\r\n        else {\r\n            this.domStorage_.setItem(this.prefixedName_(key), stringify(value));\r\n        }\r\n    };\r\n    /**\r\n     * @param {string} key\r\n     * @return {*} The value that was stored under this key, or null\r\n     */\r\n    DOMStorageWrapper.prototype.get = function (key) {\r\n        var storedVal = this.domStorage_.getItem(this.prefixedName_(key));\r\n        if (storedVal == null) {\r\n            return null;\r\n        }\r\n        else {\r\n            return jsonEval(storedVal);\r\n        }\r\n    };\r\n    /**\r\n     * @param {string} key\r\n     */\r\n    DOMStorageWrapper.prototype.remove = function (key) {\r\n        this.domStorage_.removeItem(this.prefixedName_(key));\r\n    };\r\n    /**\r\n     * @param {string} name\r\n     * @return {string}\r\n     */\r\n    DOMStorageWrapper.prototype.prefixedName_ = function (name) {\r\n        return this.prefix_ + name;\r\n    };\r\n    DOMStorageWrapper.prototype.toString = function () {\r\n        return this.domStorage_.toString();\r\n    };\r\n    return DOMStorageWrapper;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * An in-memory storage implementation that matches the API of DOMStorageWrapper\r\n * (TODO: create interface for both to implement).\r\n *\r\n * @constructor\r\n */\r\nvar MemoryStorage = /** @class */ (function () {\r\n    function MemoryStorage() {\r\n        this.cache_ = {};\r\n        this.isInMemoryStorage = true;\r\n    }\r\n    MemoryStorage.prototype.set = function (key, value) {\r\n        if (value == null) {\r\n            delete this.cache_[key];\r\n        }\r\n        else {\r\n            this.cache_[key] = value;\r\n        }\r\n    };\r\n    MemoryStorage.prototype.get = function (key) {\r\n        if (contains(this.cache_, key)) {\r\n            return this.cache_[key];\r\n        }\r\n        return null;\r\n    };\r\n    MemoryStorage.prototype.remove = function (key) {\r\n        delete this.cache_[key];\r\n    };\r\n    return MemoryStorage;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Helper to create a DOMStorageWrapper or else fall back to MemoryStorage.\r\n * TODO: Once MemoryStorage and DOMStorageWrapper have a shared interface this method annotation should change\r\n * to reflect this type\r\n *\r\n * @param {string} domStorageName Name of the underlying storage object\r\n *   (e.g. 'localStorage' or 'sessionStorage').\r\n * @return {?} Turning off type information until a common interface is defined.\r\n */\r\nvar createStoragefor = function (domStorageName) {\r\n    try {\r\n        // NOTE: just accessing \"localStorage\" or \"window['localStorage']\" may throw a security exception,\r\n        // so it must be inside the try/catch.\r\n        if (typeof window !== 'undefined' &&\r\n            typeof window[domStorageName] !== 'undefined') {\r\n            // Need to test cache. Just because it's here doesn't mean it works\r\n            var domStorage = window[domStorageName];\r\n            domStorage.setItem('firebase:sentinel', 'cache');\r\n            domStorage.removeItem('firebase:sentinel');\r\n            return new DOMStorageWrapper(domStorage);\r\n        }\r\n    }\r\n    catch (e) { }\r\n    // Failed to create wrapper.  Just return in-memory storage.\r\n    // TODO: log?\r\n    return new MemoryStorage();\r\n};\r\n/** A storage object that lasts across sessions */\r\nvar PersistentStorage = createStoragefor('localStorage');\r\n/** A storage object that only lasts one session */\r\nvar SessionStorage = createStoragefor('sessionStorage');\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar logClient = new Logger('@firebase/database');\r\n/**\r\n * Returns a locally-unique ID (generated by just incrementing up from 0 each time its called).\r\n * @type {function(): number} Generated ID.\r\n */\r\nvar LUIDGenerator = (function () {\r\n    var id = 1;\r\n    return function () {\r\n        return id++;\r\n    };\r\n})();\r\n/**\r\n * Sha1 hash of the input string\r\n * @param {!string} str The string to hash\r\n * @return {!string} The resulting hash\r\n */\r\nvar sha1 = function (str) {\r\n    var utf8Bytes = stringToByteArray(str);\r\n    var sha1 = new Sha1();\r\n    sha1.update(utf8Bytes);\r\n    var sha1Bytes = sha1.digest();\r\n    return base64.encodeByteArray(sha1Bytes);\r\n};\r\n/**\r\n * @param {...*} var_args\r\n * @return {string}\r\n * @private\r\n */\r\nvar buildLogMessage_ = function () {\r\n    var var_args = [];\r\n    for (var _i = 0; _i < arguments.length; _i++) {\r\n        var_args[_i] = arguments[_i];\r\n    }\r\n    var message = '';\r\n    for (var i = 0; i < var_args.length; i++) {\r\n        if (Array.isArray(var_args[i]) ||\r\n            (var_args[i] &&\r\n                typeof var_args[i] === 'object' &&\r\n                typeof var_args[i].length === 'number')) {\r\n            message += buildLogMessage_.apply(null, var_args[i]);\r\n        }\r\n        else if (typeof var_args[i] === 'object') {\r\n            message += stringify(var_args[i]);\r\n        }\r\n        else {\r\n            message += var_args[i];\r\n        }\r\n        message += ' ';\r\n    }\r\n    return message;\r\n};\r\n/**\r\n * Use this for all debug messages in Firebase.\r\n * @type {?function(string)}\r\n */\r\nvar logger = null;\r\n/**\r\n * Flag to check for log availability on first log message\r\n * @type {boolean}\r\n * @private\r\n */\r\nvar firstLog_ = true;\r\n/**\r\n * The implementation of Firebase.enableLogging (defined here to break dependencies)\r\n * @param {boolean|?function(string)} logger_ A flag to turn on logging, or a custom logger\r\n * @param {boolean=} persistent Whether or not to persist logging settings across refreshes\r\n */\r\nvar enableLogging = function (logger_, persistent) {\r\n    assert(!persistent || (logger_ === true || logger_ === false), \"Can't turn on custom loggers persistently.\");\r\n    if (logger_ === true) {\r\n        logClient.logLevel = LogLevel.VERBOSE;\r\n        logger = logClient.log.bind(logClient);\r\n        if (persistent)\r\n            SessionStorage.set('logging_enabled', true);\r\n    }\r\n    else if (typeof logger_ === 'function') {\r\n        logger = logger_;\r\n    }\r\n    else {\r\n        logger = null;\r\n        SessionStorage.remove('logging_enabled');\r\n    }\r\n};\r\n/**\r\n *\r\n * @param {...(string|Arguments)} var_args\r\n */\r\nvar log = function () {\r\n    var var_args = [];\r\n    for (var _i = 0; _i < arguments.length; _i++) {\r\n        var_args[_i] = arguments[_i];\r\n    }\r\n    if (firstLog_ === true) {\r\n        firstLog_ = false;\r\n        if (logger === null && SessionStorage.get('logging_enabled') === true)\r\n            enableLogging(true);\r\n    }\r\n    if (logger) {\r\n        var message = buildLogMessage_.apply(null, var_args);\r\n        logger(message);\r\n    }\r\n};\r\n/**\r\n * @param {!string} prefix\r\n * @return {function(...[*])}\r\n */\r\nvar logWrapper = function (prefix) {\r\n    return function () {\r\n        var var_args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            var_args[_i] = arguments[_i];\r\n        }\r\n        log.apply(void 0, [prefix].concat(var_args));\r\n    };\r\n};\r\n/**\r\n * @param {...string} var_args\r\n */\r\nvar error = function () {\r\n    var var_args = [];\r\n    for (var _i = 0; _i < arguments.length; _i++) {\r\n        var_args[_i] = arguments[_i];\r\n    }\r\n    var message = 'FIREBASE INTERNAL ERROR: ' + buildLogMessage_.apply(void 0, var_args);\r\n    logClient.error(message);\r\n};\r\n/**\r\n * @param {...string} var_args\r\n */\r\nvar fatal = function () {\r\n    var var_args = [];\r\n    for (var _i = 0; _i < arguments.length; _i++) {\r\n        var_args[_i] = arguments[_i];\r\n    }\r\n    var message = \"FIREBASE FATAL ERROR: \" + buildLogMessage_.apply(void 0, var_args);\r\n    logClient.error(message);\r\n    throw new Error(message);\r\n};\r\n/**\r\n * @param {...*} var_args\r\n */\r\nvar warn = function () {\r\n    var var_args = [];\r\n    for (var _i = 0; _i < arguments.length; _i++) {\r\n        var_args[_i] = arguments[_i];\r\n    }\r\n    var message = 'FIREBASE WARNING: ' + buildLogMessage_.apply(void 0, var_args);\r\n    logClient.warn(message);\r\n};\r\n/**\r\n * Logs a warning if the containing page uses https. Called when a call to new Firebase\r\n * does not use https.\r\n */\r\nvar warnIfPageIsSecure = function () {\r\n    // Be very careful accessing browser globals. Who knows what may or may not exist.\r\n    if (typeof window !== 'undefined' &&\r\n        window.location &&\r\n        window.location.protocol &&\r\n        window.location.protocol.indexOf('https:') !== -1) {\r\n        warn('Insecure Firebase access from a secure page. ' +\r\n            'Please use https in calls to new Firebase().');\r\n    }\r\n};\r\n/**\r\n * Returns true if data is NaN, or +/- Infinity.\r\n * @param {*} data\r\n * @return {boolean}\r\n */\r\nvar isInvalidJSONNumber = function (data) {\r\n    return (typeof data === 'number' &&\r\n        (data != data || // NaN\r\n            data == Number.POSITIVE_INFINITY ||\r\n            data == Number.NEGATIVE_INFINITY));\r\n};\r\n/**\r\n * @param {function()} fn\r\n */\r\nvar executeWhenDOMReady = function (fn) {\r\n    if (isNodeSdk() || document.readyState === 'complete') {\r\n        fn();\r\n    }\r\n    else {\r\n        // Modeled after jQuery. Try DOMContentLoaded and onreadystatechange (which\r\n        // fire before onload), but fall back to onload.\r\n        var called_1 = false;\r\n        var wrappedFn_1 = function () {\r\n            if (!document.body) {\r\n                setTimeout(wrappedFn_1, Math.floor(10));\r\n                return;\r\n            }\r\n            if (!called_1) {\r\n                called_1 = true;\r\n                fn();\r\n            }\r\n        };\r\n        if (document.addEventListener) {\r\n            document.addEventListener('DOMContentLoaded', wrappedFn_1, false);\r\n            // fallback to onload.\r\n            window.addEventListener('load', wrappedFn_1, false);\r\n        }\r\n        else if (document.attachEvent) {\r\n            // IE.\r\n            document.attachEvent('onreadystatechange', function () {\r\n                if (document.readyState === 'complete')\r\n                    wrappedFn_1();\r\n            });\r\n            // fallback to onload.\r\n            window.attachEvent('onload', wrappedFn_1);\r\n            // jQuery has an extra hack for IE that we could employ (based on\r\n            // http://javascript.nwbox.com/IEContentLoaded/) But it looks really old.\r\n            // I'm hoping we don't need it.\r\n        }\r\n    }\r\n};\r\n/**\r\n * Minimum key name. Invalid for actual data, used as a marker to sort before any valid names\r\n * @type {!string}\r\n */\r\nvar MIN_NAME = '[MIN_NAME]';\r\n/**\r\n * Maximum key name. Invalid for actual data, used as a marker to sort above any valid names\r\n * @type {!string}\r\n */\r\nvar MAX_NAME = '[MAX_NAME]';\r\n/**\r\n * Compares valid Firebase key names, plus min and max name\r\n * @param {!string} a\r\n * @param {!string} b\r\n * @return {!number}\r\n */\r\nvar nameCompare = function (a, b) {\r\n    if (a === b) {\r\n        return 0;\r\n    }\r\n    else if (a === MIN_NAME || b === MAX_NAME) {\r\n        return -1;\r\n    }\r\n    else if (b === MIN_NAME || a === MAX_NAME) {\r\n        return 1;\r\n    }\r\n    else {\r\n        var aAsInt = tryParseInt(a), bAsInt = tryParseInt(b);\r\n        if (aAsInt !== null) {\r\n            if (bAsInt !== null) {\r\n                return aAsInt - bAsInt == 0 ? a.length - b.length : aAsInt - bAsInt;\r\n            }\r\n            else {\r\n                return -1;\r\n            }\r\n        }\r\n        else if (bAsInt !== null) {\r\n            return 1;\r\n        }\r\n        else {\r\n            return a < b ? -1 : 1;\r\n        }\r\n    }\r\n};\r\n/**\r\n * @param {!string} a\r\n * @param {!string} b\r\n * @return {!number} comparison result.\r\n */\r\nvar stringCompare = function (a, b) {\r\n    if (a === b) {\r\n        return 0;\r\n    }\r\n    else if (a < b) {\r\n        return -1;\r\n    }\r\n    else {\r\n        return 1;\r\n    }\r\n};\r\n/**\r\n * @param {string} key\r\n * @param {Object} obj\r\n * @return {*}\r\n */\r\nvar requireKey = function (key, obj) {\r\n    if (obj && key in obj) {\r\n        return obj[key];\r\n    }\r\n    else {\r\n        throw new Error('Missing required key (' + key + ') in object: ' + stringify(obj));\r\n    }\r\n};\r\n/**\r\n * @param {*} obj\r\n * @return {string}\r\n */\r\nvar ObjectToUniqueKey = function (obj) {\r\n    if (typeof obj !== 'object' || obj === null)\r\n        return stringify(obj);\r\n    var keys = [];\r\n    for (var k in obj) {\r\n        keys.push(k);\r\n    }\r\n    // Export as json, but with the keys sorted.\r\n    keys.sort();\r\n    var key = '{';\r\n    for (var i = 0; i < keys.length; i++) {\r\n        if (i !== 0)\r\n            key += ',';\r\n        key += stringify(keys[i]);\r\n        key += ':';\r\n        key += ObjectToUniqueKey(obj[keys[i]]);\r\n    }\r\n    key += '}';\r\n    return key;\r\n};\r\n/**\r\n * Splits a string into a number of smaller segments of maximum size\r\n * @param {!string} str The string\r\n * @param {!number} segsize The maximum number of chars in the string.\r\n * @return {Array.<string>} The string, split into appropriately-sized chunks\r\n */\r\nvar splitStringBySize = function (str, segsize) {\r\n    var len = str.length;\r\n    if (len <= segsize) {\r\n        return [str];\r\n    }\r\n    var dataSegs = [];\r\n    for (var c = 0; c < len; c += segsize) {\r\n        if (c + segsize > len) {\r\n            dataSegs.push(str.substring(c, len));\r\n        }\r\n        else {\r\n            dataSegs.push(str.substring(c, c + segsize));\r\n        }\r\n    }\r\n    return dataSegs;\r\n};\r\n/**\r\n * Apply a function to each (key, value) pair in an object or\r\n * apply a function to each (index, value) pair in an array\r\n * @param {!(Object|Array)} obj The object or array to iterate over\r\n * @param {function(?, ?)} fn The function to apply\r\n */\r\nvar each = function (obj, fn) {\r\n    if (Array.isArray(obj)) {\r\n        for (var i = 0; i < obj.length; ++i) {\r\n            fn(i, obj[i]);\r\n        }\r\n    }\r\n    else {\r\n        /**\r\n         * in the conversion of code we removed the goog.object.forEach\r\n         * function which did a value,key callback. We standardized on\r\n         * a single impl that does a key, value callback. So we invert\r\n         * to not have to touch the `each` code points\r\n         */\r\n        forEach(obj, function (key, val) { return fn(val, key); });\r\n    }\r\n};\r\n/**\r\n * Borrowed from http://hg.secondlife.com/llsd/src/tip/js/typedarray.js (MIT License)\r\n * I made one modification at the end and removed the NaN / Infinity\r\n * handling (since it seemed broken [caused an overflow] and we don't need it).  See MJL comments.\r\n * @param {!number} v A double\r\n * @return {string}\r\n */\r\nvar doubleToIEEE754String = function (v) {\r\n    assert(!isInvalidJSONNumber(v), 'Invalid JSON number'); // MJL\r\n    var ebits = 11, fbits = 52;\r\n    var bias = (1 << (ebits - 1)) - 1, s, e, f, ln, i, bits, str;\r\n    // Compute sign, exponent, fraction\r\n    // Skip NaN / Infinity handling --MJL.\r\n    if (v === 0) {\r\n        e = 0;\r\n        f = 0;\r\n        s = 1 / v === -Infinity ? 1 : 0;\r\n    }\r\n    else {\r\n        s = v < 0;\r\n        v = Math.abs(v);\r\n        if (v >= Math.pow(2, 1 - bias)) {\r\n            // Normalized\r\n            ln = Math.min(Math.floor(Math.log(v) / Math.LN2), bias);\r\n            e = ln + bias;\r\n            f = Math.round(v * Math.pow(2, fbits - ln) - Math.pow(2, fbits));\r\n        }\r\n        else {\r\n            // Denormalized\r\n            e = 0;\r\n            f = Math.round(v / Math.pow(2, 1 - bias - fbits));\r\n        }\r\n    }\r\n    // Pack sign, exponent, fraction\r\n    bits = [];\r\n    for (i = fbits; i; i -= 1) {\r\n        bits.push(f % 2 ? 1 : 0);\r\n        f = Math.floor(f / 2);\r\n    }\r\n    for (i = ebits; i; i -= 1) {\r\n        bits.push(e % 2 ? 1 : 0);\r\n        e = Math.floor(e / 2);\r\n    }\r\n    bits.push(s ? 1 : 0);\r\n    bits.reverse();\r\n    str = bits.join('');\r\n    // Return the data as a hex string. --MJL\r\n    var hexByteString = '';\r\n    for (i = 0; i < 64; i += 8) {\r\n        var hexByte = parseInt(str.substr(i, 8), 2).toString(16);\r\n        if (hexByte.length === 1)\r\n            hexByte = '0' + hexByte;\r\n        hexByteString = hexByteString + hexByte;\r\n    }\r\n    return hexByteString.toLowerCase();\r\n};\r\n/**\r\n * Used to detect if we're in a Chrome content script (which executes in an\r\n * isolated environment where long-polling doesn't work).\r\n * @return {boolean}\r\n */\r\nvar isChromeExtensionContentScript = function () {\r\n    return !!(typeof window === 'object' &&\r\n        window['chrome'] &&\r\n        window['chrome']['extension'] &&\r\n        !/^chrome/.test(window.location.href));\r\n};\r\n/**\r\n * Used to detect if we're in a Windows 8 Store app.\r\n * @return {boolean}\r\n */\r\nvar isWindowsStoreApp = function () {\r\n    // Check for the presence of a couple WinRT globals\r\n    return typeof Windows === 'object' && typeof Windows.UI === 'object';\r\n};\r\n/**\r\n * Converts a server error code to a Javascript Error\r\n * @param {!string} code\r\n * @param {!Query} query\r\n * @return {Error}\r\n */\r\nvar errorForServerCode = function (code, query) {\r\n    var reason = 'Unknown Error';\r\n    if (code === 'too_big') {\r\n        reason =\r\n            'The data requested exceeds the maximum size ' +\r\n                'that can be accessed with a single request.';\r\n    }\r\n    else if (code == 'permission_denied') {\r\n        reason = \"Client doesn't have permission to access the desired data.\";\r\n    }\r\n    else if (code == 'unavailable') {\r\n        reason = 'The service is unavailable';\r\n    }\r\n    var error = new Error(code + ' at ' + query.path.toString() + ': ' + reason);\r\n    error.code = code.toUpperCase();\r\n    return error;\r\n};\r\n/**\r\n * Used to test for integer-looking strings\r\n * @type {RegExp}\r\n * @private\r\n */\r\nvar INTEGER_REGEXP_ = new RegExp('^-?\\\\d{1,10}$');\r\n/**\r\n * If the string contains a 32-bit integer, return it.  Else return null.\r\n * @param {!string} str\r\n * @return {?number}\r\n */\r\nvar tryParseInt = function (str) {\r\n    if (INTEGER_REGEXP_.test(str)) {\r\n        var intVal = Number(str);\r\n        if (intVal >= -2147483648 && intVal <= 2147483647) {\r\n            return intVal;\r\n        }\r\n    }\r\n    return null;\r\n};\r\n/**\r\n * Helper to run some code but catch any exceptions and re-throw them later.\r\n * Useful for preventing user callbacks from breaking internal code.\r\n *\r\n * Re-throwing the exception from a setTimeout is a little evil, but it's very\r\n * convenient (we don't have to try to figure out when is a safe point to\r\n * re-throw it), and the behavior seems reasonable:\r\n *\r\n * * If you aren't pausing on exceptions, you get an error in the console with\r\n *   the correct stack trace.\r\n * * If you're pausing on all exceptions, the debugger will pause on your\r\n *   exception and then again when we rethrow it.\r\n * * If you're only pausing on uncaught exceptions, the debugger will only pause\r\n *   on us re-throwing it.\r\n *\r\n * @param {!function()} fn The code to guard.\r\n */\r\nvar exceptionGuard = function (fn) {\r\n    try {\r\n        fn();\r\n    }\r\n    catch (e) {\r\n        // Re-throw exception when it's safe.\r\n        setTimeout(function () {\r\n            // It used to be that \"throw e\" would result in a good console error with\r\n            // relevant context, but as of Chrome 39, you just get the firebase.js\r\n            // file/line number where we re-throw it, which is useless. So we log\r\n            // e.stack explicitly.\r\n            var stack = e.stack || '';\r\n            warn('Exception was thrown by user callback.', stack);\r\n            throw e;\r\n        }, Math.floor(0));\r\n    }\r\n};\r\n/**\r\n * @return {boolean} true if we think we're currently being crawled.\r\n */\r\nvar beingCrawled = function () {\r\n    var userAgent = (typeof window === 'object' &&\r\n        window['navigator'] &&\r\n        window['navigator']['userAgent']) ||\r\n        '';\r\n    // For now we whitelist the most popular crawlers.  We should refine this to be the set of crawlers we\r\n    // believe to support JavaScript/AJAX rendering.\r\n    // NOTE: Google Webmaster Tools doesn't really belong, but their \"This is how a visitor to your website\r\n    // would have seen the page\" is flaky if we don't treat it as a crawler.\r\n    return (userAgent.search(/googlebot|google webmaster tools|bingbot|yahoo! slurp|baiduspider|yandexbot|duckduckbot/i) >= 0);\r\n};\r\n/**\r\n * Same as setTimeout() except on Node.JS it will /not/ prevent the process from exiting.\r\n *\r\n * It is removed with clearTimeout() as normal.\r\n *\r\n * @param {Function} fn Function to run.\r\n * @param {number} time Milliseconds to wait before running.\r\n * @return {number|Object} The setTimeout() return value.\r\n */\r\nvar setTimeoutNonBlocking = function (fn, time) {\r\n    var timeout = setTimeout(fn, time);\r\n    if (typeof timeout === 'object' && timeout['unref']) {\r\n        timeout['unref']();\r\n    }\r\n    return timeout;\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * An immutable object representing a parsed path.  It's immutable so that you\r\n * can pass them around to other functions without worrying about them changing\r\n * it.\r\n */\r\nvar Path = /** @class */ (function () {\r\n    /**\r\n     * @param {string|Array.<string>} pathOrString Path string to parse,\r\n     *      or another path, or the raw tokens array\r\n     * @param {number=} pieceNum\r\n     */\r\n    function Path(pathOrString, pieceNum) {\r\n        if (pieceNum === void 0) {\r\n            this.pieces_ = pathOrString.split('/');\r\n            // Remove empty pieces.\r\n            var copyTo = 0;\r\n            for (var i = 0; i < this.pieces_.length; i++) {\r\n                if (this.pieces_[i].length > 0) {\r\n                    this.pieces_[copyTo] = this.pieces_[i];\r\n                    copyTo++;\r\n                }\r\n            }\r\n            this.pieces_.length = copyTo;\r\n            this.pieceNum_ = 0;\r\n        }\r\n        else {\r\n            this.pieces_ = pathOrString;\r\n            this.pieceNum_ = pieceNum;\r\n        }\r\n    }\r\n    Object.defineProperty(Path, \"Empty\", {\r\n        /**\r\n         * Singleton to represent an empty path\r\n         *\r\n         * @const\r\n         */\r\n        get: function () {\r\n            return new Path('');\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Path.prototype.getFront = function () {\r\n        if (this.pieceNum_ >= this.pieces_.length)\r\n            return null;\r\n        return this.pieces_[this.pieceNum_];\r\n    };\r\n    /**\r\n     * @return {number} The number of segments in this path\r\n     */\r\n    Path.prototype.getLength = function () {\r\n        return this.pieces_.length - this.pieceNum_;\r\n    };\r\n    /**\r\n     * @return {!Path}\r\n     */\r\n    Path.prototype.popFront = function () {\r\n        var pieceNum = this.pieceNum_;\r\n        if (pieceNum < this.pieces_.length) {\r\n            pieceNum++;\r\n        }\r\n        return new Path(this.pieces_, pieceNum);\r\n    };\r\n    /**\r\n     * @return {?string}\r\n     */\r\n    Path.prototype.getBack = function () {\r\n        if (this.pieceNum_ < this.pieces_.length)\r\n            return this.pieces_[this.pieces_.length - 1];\r\n        return null;\r\n    };\r\n    Path.prototype.toString = function () {\r\n        var pathString = '';\r\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\r\n            if (this.pieces_[i] !== '')\r\n                pathString += '/' + this.pieces_[i];\r\n        }\r\n        return pathString || '/';\r\n    };\r\n    Path.prototype.toUrlEncodedString = function () {\r\n        var pathString = '';\r\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++) {\r\n            if (this.pieces_[i] !== '')\r\n                pathString += '/' + encodeURIComponent(String(this.pieces_[i]));\r\n        }\r\n        return pathString || '/';\r\n    };\r\n    /**\r\n     * Shallow copy of the parts of the path.\r\n     *\r\n     * @param {number=} begin\r\n     * @return {!Array<string>}\r\n     */\r\n    Path.prototype.slice = function (begin) {\r\n        if (begin === void 0) { begin = 0; }\r\n        return this.pieces_.slice(this.pieceNum_ + begin);\r\n    };\r\n    /**\r\n     * @return {?Path}\r\n     */\r\n    Path.prototype.parent = function () {\r\n        if (this.pieceNum_ >= this.pieces_.length)\r\n            return null;\r\n        var pieces = [];\r\n        for (var i = this.pieceNum_; i < this.pieces_.length - 1; i++)\r\n            pieces.push(this.pieces_[i]);\r\n        return new Path(pieces, 0);\r\n    };\r\n    /**\r\n     * @param {string|!Path} childPathObj\r\n     * @return {!Path}\r\n     */\r\n    Path.prototype.child = function (childPathObj) {\r\n        var pieces = [];\r\n        for (var i = this.pieceNum_; i < this.pieces_.length; i++)\r\n            pieces.push(this.pieces_[i]);\r\n        if (childPathObj instanceof Path) {\r\n            for (var i = childPathObj.pieceNum_; i < childPathObj.pieces_.length; i++) {\r\n                pieces.push(childPathObj.pieces_[i]);\r\n            }\r\n        }\r\n        else {\r\n            var childPieces = childPathObj.split('/');\r\n            for (var i = 0; i < childPieces.length; i++) {\r\n                if (childPieces[i].length > 0)\r\n                    pieces.push(childPieces[i]);\r\n            }\r\n        }\r\n        return new Path(pieces, 0);\r\n    };\r\n    /**\r\n     * @return {boolean} True if there are no segments in this path\r\n     */\r\n    Path.prototype.isEmpty = function () {\r\n        return this.pieceNum_ >= this.pieces_.length;\r\n    };\r\n    /**\r\n     * @param {!Path} outerPath\r\n     * @param {!Path} innerPath\r\n     * @return {!Path} The path from outerPath to innerPath\r\n     */\r\n    Path.relativePath = function (outerPath, innerPath) {\r\n        var outer = outerPath.getFront(), inner = innerPath.getFront();\r\n        if (outer === null) {\r\n            return innerPath;\r\n        }\r\n        else if (outer === inner) {\r\n            return Path.relativePath(outerPath.popFront(), innerPath.popFront());\r\n        }\r\n        else {\r\n            throw new Error('INTERNAL ERROR: innerPath (' +\r\n                innerPath +\r\n                ') is not within ' +\r\n                'outerPath (' +\r\n                outerPath +\r\n                ')');\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Path} left\r\n     * @param {!Path} right\r\n     * @return {number} -1, 0, 1 if left is less, equal, or greater than the right.\r\n     */\r\n    Path.comparePaths = function (left, right) {\r\n        var leftKeys = left.slice();\r\n        var rightKeys = right.slice();\r\n        for (var i = 0; i < leftKeys.length && i < rightKeys.length; i++) {\r\n            var cmp = nameCompare(leftKeys[i], rightKeys[i]);\r\n            if (cmp !== 0)\r\n                return cmp;\r\n        }\r\n        if (leftKeys.length === rightKeys.length)\r\n            return 0;\r\n        return leftKeys.length < rightKeys.length ? -1 : 1;\r\n    };\r\n    /**\r\n     *\r\n     * @param {Path} other\r\n     * @return {boolean} true if paths are the same.\r\n     */\r\n    Path.prototype.equals = function (other) {\r\n        if (this.getLength() !== other.getLength()) {\r\n            return false;\r\n        }\r\n        for (var i = this.pieceNum_, j = other.pieceNum_; i <= this.pieces_.length; i++, j++) {\r\n            if (this.pieces_[i] !== other.pieces_[j]) {\r\n                return false;\r\n            }\r\n        }\r\n        return true;\r\n    };\r\n    /**\r\n     *\r\n     * @param {!Path} other\r\n     * @return {boolean} True if this path is a parent (or the same as) other\r\n     */\r\n    Path.prototype.contains = function (other) {\r\n        var i = this.pieceNum_;\r\n        var j = other.pieceNum_;\r\n        if (this.getLength() > other.getLength()) {\r\n            return false;\r\n        }\r\n        while (i < this.pieces_.length) {\r\n            if (this.pieces_[i] !== other.pieces_[j]) {\r\n                return false;\r\n            }\r\n            ++i;\r\n            ++j;\r\n        }\r\n        return true;\r\n    };\r\n    return Path;\r\n}()); // end Path\r\n/**\r\n * Dynamic (mutable) path used to count path lengths.\r\n *\r\n * This class is used to efficiently check paths for valid\r\n * length (in UTF8 bytes) and depth (used in path validation).\r\n *\r\n * Throws Error exception if path is ever invalid.\r\n *\r\n * The definition of a path always begins with '/'.\r\n */\r\nvar ValidationPath = /** @class */ (function () {\r\n    /**\r\n     * @param {!Path} path Initial Path.\r\n     * @param {string} errorPrefix_ Prefix for any error messages.\r\n     */\r\n    function ValidationPath(path, errorPrefix_) {\r\n        this.errorPrefix_ = errorPrefix_;\r\n        /** @type {!Array<string>} */\r\n        this.parts_ = path.slice();\r\n        /** @type {number} Initialize to number of '/' chars needed in path. */\r\n        this.byteLength_ = Math.max(1, this.parts_.length);\r\n        for (var i = 0; i < this.parts_.length; i++) {\r\n            this.byteLength_ += stringLength(this.parts_[i]);\r\n        }\r\n        this.checkValid_();\r\n    }\r\n    Object.defineProperty(ValidationPath, \"MAX_PATH_DEPTH\", {\r\n        /** @const {number} Maximum key depth. */\r\n        get: function () {\r\n            return 32;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Object.defineProperty(ValidationPath, \"MAX_PATH_LENGTH_BYTES\", {\r\n        /** @const {number} Maximum number of (UTF8) bytes in a Firebase path. */\r\n        get: function () {\r\n            return 768;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /** @param {string} child */\r\n    ValidationPath.prototype.push = function (child) {\r\n        // Count the needed '/'\r\n        if (this.parts_.length > 0) {\r\n            this.byteLength_ += 1;\r\n        }\r\n        this.parts_.push(child);\r\n        this.byteLength_ += stringLength(child);\r\n        this.checkValid_();\r\n    };\r\n    ValidationPath.prototype.pop = function () {\r\n        var last = this.parts_.pop();\r\n        this.byteLength_ -= stringLength(last);\r\n        // Un-count the previous '/'\r\n        if (this.parts_.length > 0) {\r\n            this.byteLength_ -= 1;\r\n        }\r\n    };\r\n    ValidationPath.prototype.checkValid_ = function () {\r\n        if (this.byteLength_ > ValidationPath.MAX_PATH_LENGTH_BYTES) {\r\n            throw new Error(this.errorPrefix_ +\r\n                'has a key path longer than ' +\r\n                ValidationPath.MAX_PATH_LENGTH_BYTES +\r\n                ' bytes (' +\r\n                this.byteLength_ +\r\n                ').');\r\n        }\r\n        if (this.parts_.length > ValidationPath.MAX_PATH_DEPTH) {\r\n            throw new Error(this.errorPrefix_ +\r\n                'path specified exceeds the maximum depth that can be written (' +\r\n                ValidationPath.MAX_PATH_DEPTH +\r\n                ') or object contains a cycle ' +\r\n                this.toErrorString());\r\n        }\r\n    };\r\n    /**\r\n     * String for use in error messages - uses '.' notation for path.\r\n     *\r\n     * @return {string}\r\n     */\r\n    ValidationPath.prototype.toErrorString = function () {\r\n        if (this.parts_.length == 0) {\r\n            return '';\r\n        }\r\n        return \"in property '\" + this.parts_.join('.') + \"'\";\r\n    };\r\n    return ValidationPath;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar PROTOCOL_VERSION = '5';\r\nvar VERSION_PARAM = 'v';\r\nvar TRANSPORT_SESSION_PARAM = 's';\r\nvar REFERER_PARAM = 'r';\r\nvar FORGE_REF = 'f';\r\nvar FORGE_DOMAIN = 'firebaseio.com';\r\nvar LAST_SESSION_PARAM = 'ls';\r\nvar WEBSOCKET = 'websocket';\r\nvar LONG_POLLING = 'long_polling';\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * A class that holds metadata about a Repo object\r\n *\r\n * @constructor\r\n */\r\nvar RepoInfo = /** @class */ (function () {\r\n    /**\r\n     * @param {string} host Hostname portion of the url for the repo\r\n     * @param {boolean} secure Whether or not this repo is accessed over ssl\r\n     * @param {string} namespace The namespace represented by the repo\r\n     * @param {boolean} webSocketOnly Whether to prefer websockets over all other transports (used by Nest).\r\n     * @param {string=} persistenceKey Override the default session persistence storage key\r\n     */\r\n    function RepoInfo(host, secure, namespace, webSocketOnly, persistenceKey) {\r\n        if (persistenceKey === void 0) { persistenceKey = ''; }\r\n        this.secure = secure;\r\n        this.namespace = namespace;\r\n        this.webSocketOnly = webSocketOnly;\r\n        this.persistenceKey = persistenceKey;\r\n        this.host = host.toLowerCase();\r\n        this.domain = this.host.substr(this.host.indexOf('.') + 1);\r\n        this.internalHost = PersistentStorage.get('host:' + host) || this.host;\r\n    }\r\n    RepoInfo.prototype.needsQueryParam = function () {\r\n        return this.host !== this.internalHost || this.isCustomHost();\r\n    };\r\n    RepoInfo.prototype.isCacheableHost = function () {\r\n        return this.internalHost.substr(0, 2) === 's-';\r\n    };\r\n    RepoInfo.prototype.isDemoHost = function () {\r\n        return this.domain === 'firebaseio-demo.com';\r\n    };\r\n    RepoInfo.prototype.isCustomHost = function () {\r\n        return (this.domain !== 'firebaseio.com' && this.domain !== 'firebaseio-demo.com');\r\n    };\r\n    RepoInfo.prototype.updateHost = function (newHost) {\r\n        if (newHost !== this.internalHost) {\r\n            this.internalHost = newHost;\r\n            if (this.isCacheableHost()) {\r\n                PersistentStorage.set('host:' + this.host, this.internalHost);\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Returns the websocket URL for this repo\r\n     * @param {string} type of connection\r\n     * @param {Object} params list\r\n     * @return {string} The URL for this repo\r\n     */\r\n    RepoInfo.prototype.connectionURL = function (type, params) {\r\n        assert(typeof type === 'string', 'typeof type must == string');\r\n        assert(typeof params === 'object', 'typeof params must == object');\r\n        var connURL;\r\n        if (type === WEBSOCKET) {\r\n            connURL =\r\n                (this.secure ? 'wss://' : 'ws://') + this.internalHost + '/.ws?';\r\n        }\r\n        else if (type === LONG_POLLING) {\r\n            connURL =\r\n                (this.secure ? 'https://' : 'http://') + this.internalHost + '/.lp?';\r\n        }\r\n        else {\r\n            throw new Error('Unknown connection type: ' + type);\r\n        }\r\n        if (this.needsQueryParam()) {\r\n            params['ns'] = this.namespace;\r\n        }\r\n        var pairs = [];\r\n        forEach(params, function (key, value) {\r\n            pairs.push(key + '=' + value);\r\n        });\r\n        return connURL + pairs.join('&');\r\n    };\r\n    /** @return {string} */\r\n    RepoInfo.prototype.toString = function () {\r\n        var str = this.toURLString();\r\n        if (this.persistenceKey) {\r\n            str += '<' + this.persistenceKey + '>';\r\n        }\r\n        return str;\r\n    };\r\n    /** @return {string} */\r\n    RepoInfo.prototype.toURLString = function () {\r\n        return (this.secure ? 'https://' : 'http://') + this.host;\r\n    };\r\n    return RepoInfo;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @param {!string} pathString\r\n * @return {string}\r\n */\r\nfunction decodePath(pathString) {\r\n    var pathStringDecoded = '';\r\n    var pieces = pathString.split('/');\r\n    for (var i = 0; i < pieces.length; i++) {\r\n        if (pieces[i].length > 0) {\r\n            var piece = pieces[i];\r\n            try {\r\n                piece = decodeURIComponent(piece.replace(/\\+/g, ' '));\r\n            }\r\n            catch (e) { }\r\n            pathStringDecoded += '/' + piece;\r\n        }\r\n    }\r\n    return pathStringDecoded;\r\n}\r\n/**\r\n * @param {!string} queryString\r\n * @return {!{[key:string]:string}} key value hash\r\n */\r\nfunction decodeQuery(queryString) {\r\n    var results = {};\r\n    if (queryString.charAt(0) === '?') {\r\n        queryString = queryString.substring(1);\r\n    }\r\n    for (var _i = 0, _a = queryString.split('&'); _i < _a.length; _i++) {\r\n        var segment = _a[_i];\r\n        if (segment.length === 0) {\r\n            continue;\r\n        }\r\n        var kv = segment.split('=');\r\n        if (kv.length === 2) {\r\n            results[decodeURIComponent(kv[0])] = decodeURIComponent(kv[1]);\r\n        }\r\n        else {\r\n            warn(\"Invalid query segment '\" + segment + \"' in query '\" + queryString + \"'\");\r\n        }\r\n    }\r\n    return results;\r\n}\r\n/**\r\n *\r\n * @param {!string} dataURL\r\n * @return {{repoInfo: !RepoInfo, path: !Path}}\r\n */\r\nvar parseRepoInfo = function (dataURL) {\r\n    var parsedUrl = parseURL(dataURL), namespace = parsedUrl.subdomain;\r\n    if (parsedUrl.domain === 'firebase') {\r\n        fatal(parsedUrl.host +\r\n            ' is no longer supported. ' +\r\n            'Please use <YOUR FIREBASE>.firebaseio.com instead');\r\n    }\r\n    // Catch common error of uninitialized namespace value.\r\n    if ((!namespace || namespace == 'undefined') &&\r\n        parsedUrl.domain !== 'localhost') {\r\n        fatal('Cannot parse Firebase url. Please use https://<YOUR FIREBASE>.firebaseio.com');\r\n    }\r\n    if (!parsedUrl.secure) {\r\n        warnIfPageIsSecure();\r\n    }\r\n    var webSocketOnly = parsedUrl.scheme === 'ws' || parsedUrl.scheme === 'wss';\r\n    return {\r\n        repoInfo: new RepoInfo(parsedUrl.host, parsedUrl.secure, namespace, webSocketOnly),\r\n        path: new Path(parsedUrl.pathString)\r\n    };\r\n};\r\n/**\r\n *\r\n * @param {!string} dataURL\r\n * @return {{host: string, port: number, domain: string, subdomain: string, secure: boolean, scheme: string, pathString: string}}\r\n */\r\nvar parseURL = function (dataURL) {\r\n    // Default to empty strings in the event of a malformed string.\r\n    var host = '', domain = '', subdomain = '', pathString = '';\r\n    // Always default to SSL, unless otherwise specified.\r\n    var secure = true, scheme = 'https', port = 443;\r\n    // Don't do any validation here. The caller is responsible for validating the result of parsing.\r\n    if (typeof dataURL === 'string') {\r\n        // Parse scheme.\r\n        var colonInd = dataURL.indexOf('//');\r\n        if (colonInd >= 0) {\r\n            scheme = dataURL.substring(0, colonInd - 1);\r\n            dataURL = dataURL.substring(colonInd + 2);\r\n        }\r\n        // Parse host, path, and query string.\r\n        var slashInd = dataURL.indexOf('/');\r\n        if (slashInd === -1) {\r\n            slashInd = dataURL.length;\r\n        }\r\n        var questionMarkInd = dataURL.indexOf('?');\r\n        if (questionMarkInd === -1) {\r\n            questionMarkInd = dataURL.length;\r\n        }\r\n        host = dataURL.substring(0, Math.min(slashInd, questionMarkInd));\r\n        if (slashInd < questionMarkInd) {\r\n            // For pathString, questionMarkInd will always come after slashInd\r\n            pathString = decodePath(dataURL.substring(slashInd, questionMarkInd));\r\n        }\r\n        var queryParams = decodeQuery(dataURL.substring(Math.min(dataURL.length, questionMarkInd)));\r\n        // If we have a port, use scheme for determining if it's secure.\r\n        colonInd = host.indexOf(':');\r\n        if (colonInd >= 0) {\r\n            secure = scheme === 'https' || scheme === 'wss';\r\n            port = parseInt(host.substring(colonInd + 1), 10);\r\n        }\r\n        else {\r\n            colonInd = dataURL.length;\r\n        }\r\n        var parts = host.split('.');\r\n        if (parts.length === 3) {\r\n            // Normalize namespaces to lowercase to share storage / connection.\r\n            domain = parts[1];\r\n            subdomain = parts[0].toLowerCase();\r\n        }\r\n        else if (parts.length === 2) {\r\n            domain = parts[0];\r\n        }\r\n        else if (parts[0].slice(0, colonInd).toLowerCase() === 'localhost') {\r\n            domain = 'localhost';\r\n        }\r\n        // Support `ns` query param if subdomain not already set\r\n        if (subdomain === '' && 'ns' in queryParams) {\r\n            subdomain = queryParams['ns'];\r\n        }\r\n    }\r\n    return {\r\n        host: host,\r\n        port: port,\r\n        domain: domain,\r\n        subdomain: subdomain,\r\n        secure: secure,\r\n        scheme: scheme,\r\n        pathString: pathString\r\n    };\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * True for invalid Firebase keys\r\n * @type {RegExp}\r\n * @private\r\n */\r\nvar INVALID_KEY_REGEX_ = /[\\[\\].#$\\/\\u0000-\\u001F\\u007F]/;\r\n/**\r\n * True for invalid Firebase paths.\r\n * Allows '/' in paths.\r\n * @type {RegExp}\r\n * @private\r\n */\r\nvar INVALID_PATH_REGEX_ = /[\\[\\].#$\\u0000-\\u001F\\u007F]/;\r\n/**\r\n * Maximum number of characters to allow in leaf value\r\n * @type {number}\r\n * @private\r\n */\r\nvar MAX_LEAF_SIZE_ = 10 * 1024 * 1024;\r\n/**\r\n * @param {*} key\r\n * @return {boolean}\r\n */\r\nvar isValidKey = function (key) {\r\n    return (typeof key === 'string' && key.length !== 0 && !INVALID_KEY_REGEX_.test(key));\r\n};\r\n/**\r\n * @param {string} pathString\r\n * @return {boolean}\r\n */\r\nvar isValidPathString = function (pathString) {\r\n    return (typeof pathString === 'string' &&\r\n        pathString.length !== 0 &&\r\n        !INVALID_PATH_REGEX_.test(pathString));\r\n};\r\n/**\r\n * @param {string} pathString\r\n * @return {boolean}\r\n */\r\nvar isValidRootPathString = function (pathString) {\r\n    if (pathString) {\r\n        // Allow '/.info/' at the beginning.\r\n        pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\r\n    }\r\n    return isValidPathString(pathString);\r\n};\r\n/**\r\n * @param {*} priority\r\n * @return {boolean}\r\n */\r\nvar isValidPriority = function (priority) {\r\n    return (priority === null ||\r\n        typeof priority === 'string' ||\r\n        (typeof priority === 'number' && !isInvalidJSONNumber(priority)) ||\r\n        (priority && typeof priority === 'object' && contains(priority, '.sv')));\r\n};\r\n/**\r\n * Pre-validate a datum passed as an argument to Firebase function.\r\n *\r\n * @param {string} fnName\r\n * @param {number} argumentNumber\r\n * @param {*} data\r\n * @param {!Path} path\r\n * @param {boolean} optional\r\n */\r\nvar validateFirebaseDataArg = function (fnName, argumentNumber, data, path, optional) {\r\n    if (optional && data === undefined)\r\n        return;\r\n    validateFirebaseData(errorPrefix(fnName, argumentNumber, optional), data, path);\r\n};\r\n/**\r\n * Validate a data object client-side before sending to server.\r\n *\r\n * @param {string} errorPrefix\r\n * @param {*} data\r\n * @param {!Path|!ValidationPath} path_\r\n */\r\nvar validateFirebaseData = function (errorPrefix$$1, data, path_) {\r\n    var path = path_ instanceof Path ? new ValidationPath(path_, errorPrefix$$1) : path_;\r\n    if (data === undefined) {\r\n        throw new Error(errorPrefix$$1 + 'contains undefined ' + path.toErrorString());\r\n    }\r\n    if (typeof data === 'function') {\r\n        throw new Error(errorPrefix$$1 +\r\n            'contains a function ' +\r\n            path.toErrorString() +\r\n            ' with contents = ' +\r\n            data.toString());\r\n    }\r\n    if (isInvalidJSONNumber(data)) {\r\n        throw new Error(errorPrefix$$1 + 'contains ' + data.toString() + ' ' + path.toErrorString());\r\n    }\r\n    // Check max leaf size, but try to avoid the utf8 conversion if we can.\r\n    if (typeof data === 'string' &&\r\n        data.length > MAX_LEAF_SIZE_ / 3 &&\r\n        stringLength(data) > MAX_LEAF_SIZE_) {\r\n        throw new Error(errorPrefix$$1 +\r\n            'contains a string greater than ' +\r\n            MAX_LEAF_SIZE_ +\r\n            ' utf8 bytes ' +\r\n            path.toErrorString() +\r\n            \" ('\" +\r\n            data.substring(0, 50) +\r\n            \"...')\");\r\n    }\r\n    // TODO = Perf = Consider combining the recursive validation of keys into NodeFromJSON\r\n    // to save extra walking of large objects.\r\n    if (data && typeof data === 'object') {\r\n        var hasDotValue_1 = false, hasActualChild_1 = false;\r\n        forEach(data, function (key, value) {\r\n            if (key === '.value') {\r\n                hasDotValue_1 = true;\r\n            }\r\n            else if (key !== '.priority' && key !== '.sv') {\r\n                hasActualChild_1 = true;\r\n                if (!isValidKey(key)) {\r\n                    throw new Error(errorPrefix$$1 +\r\n                        ' contains an invalid key (' +\r\n                        key +\r\n                        ') ' +\r\n                        path.toErrorString() +\r\n                        '.  Keys must be non-empty strings ' +\r\n                        'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\r\n                }\r\n            }\r\n            path.push(key);\r\n            validateFirebaseData(errorPrefix$$1, value, path);\r\n            path.pop();\r\n        });\r\n        if (hasDotValue_1 && hasActualChild_1) {\r\n            throw new Error(errorPrefix$$1 +\r\n                ' contains \".value\" child ' +\r\n                path.toErrorString() +\r\n                ' in addition to actual children.');\r\n        }\r\n    }\r\n};\r\n/**\r\n * Pre-validate paths passed in the firebase function.\r\n *\r\n * @param {string} errorPrefix\r\n * @param {Array<!Path>} mergePaths\r\n */\r\nvar validateFirebaseMergePaths = function (errorPrefix$$1, mergePaths) {\r\n    var i, curPath;\r\n    for (i = 0; i < mergePaths.length; i++) {\r\n        curPath = mergePaths[i];\r\n        var keys = curPath.slice();\r\n        for (var j = 0; j < keys.length; j++) {\r\n            if (keys[j] === '.priority' && j === keys.length - 1) {\r\n                // .priority is OK\r\n            }\r\n            else if (!isValidKey(keys[j])) {\r\n                throw new Error(errorPrefix$$1 +\r\n                    'contains an invalid key (' +\r\n                    keys[j] +\r\n                    ') in path ' +\r\n                    curPath.toString() +\r\n                    '. Keys must be non-empty strings ' +\r\n                    'and can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\"');\r\n            }\r\n        }\r\n    }\r\n    // Check that update keys are not descendants of each other.\r\n    // We rely on the property that sorting guarantees that ancestors come\r\n    // right before descendants.\r\n    mergePaths.sort(Path.comparePaths);\r\n    var prevPath = null;\r\n    for (i = 0; i < mergePaths.length; i++) {\r\n        curPath = mergePaths[i];\r\n        if (prevPath !== null && prevPath.contains(curPath)) {\r\n            throw new Error(errorPrefix$$1 +\r\n                'contains a path ' +\r\n                prevPath.toString() +\r\n                ' that is ancestor of another path ' +\r\n                curPath.toString());\r\n        }\r\n        prevPath = curPath;\r\n    }\r\n};\r\n/**\r\n * pre-validate an object passed as an argument to firebase function (\r\n * must be an object - e.g. for firebase.update()).\r\n *\r\n * @param {string} fnName\r\n * @param {number} argumentNumber\r\n * @param {*} data\r\n * @param {!Path} path\r\n * @param {boolean} optional\r\n */\r\nvar validateFirebaseMergeDataArg = function (fnName, argumentNumber, data, path, optional) {\r\n    if (optional && data === undefined)\r\n        return;\r\n    var errorPrefix$$1 = errorPrefix(fnName, argumentNumber, optional);\r\n    if (!(data && typeof data === 'object') || Array.isArray(data)) {\r\n        throw new Error(errorPrefix$$1 + ' must be an object containing the children to replace.');\r\n    }\r\n    var mergePaths = [];\r\n    forEach(data, function (key, value) {\r\n        var curPath = new Path(key);\r\n        validateFirebaseData(errorPrefix$$1, value, path.child(curPath));\r\n        if (curPath.getBack() === '.priority') {\r\n            if (!isValidPriority(value)) {\r\n                throw new Error(errorPrefix$$1 +\r\n                    \"contains an invalid value for '\" +\r\n                    curPath.toString() +\r\n                    \"', which must be a valid \" +\r\n                    'Firebase priority (a string, finite number, server value, or null).');\r\n            }\r\n        }\r\n        mergePaths.push(curPath);\r\n    });\r\n    validateFirebaseMergePaths(errorPrefix$$1, mergePaths);\r\n};\r\nvar validatePriority = function (fnName, argumentNumber, priority, optional) {\r\n    if (optional && priority === undefined)\r\n        return;\r\n    if (isInvalidJSONNumber(priority))\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'is ' +\r\n            priority.toString() +\r\n            ', but must be a valid Firebase priority (a string, finite number, ' +\r\n            'server value, or null).');\r\n    // Special case to allow importing data with a .sv.\r\n    if (!isValidPriority(priority))\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'must be a valid Firebase priority ' +\r\n            '(a string, finite number, server value, or null).');\r\n};\r\nvar validateEventType = function (fnName, argumentNumber, eventType, optional) {\r\n    if (optional && eventType === undefined)\r\n        return;\r\n    switch (eventType) {\r\n        case 'value':\r\n        case 'child_added':\r\n        case 'child_removed':\r\n        case 'child_changed':\r\n        case 'child_moved':\r\n            break;\r\n        default:\r\n            throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n                'must be a valid event type = \"value\", \"child_added\", \"child_removed\", ' +\r\n                '\"child_changed\", or \"child_moved\".');\r\n    }\r\n};\r\nvar validateKey = function (fnName, argumentNumber, key, optional) {\r\n    if (optional && key === undefined)\r\n        return;\r\n    if (!isValidKey(key))\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'was an invalid key = \"' +\r\n            key +\r\n            '\".  Firebase keys must be non-empty strings and ' +\r\n            'can\\'t contain \".\", \"#\", \"$\", \"/\", \"[\", or \"]\").');\r\n};\r\nvar validatePathString = function (fnName, argumentNumber, pathString, optional) {\r\n    if (optional && pathString === undefined)\r\n        return;\r\n    if (!isValidPathString(pathString))\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) +\r\n            'was an invalid path = \"' +\r\n            pathString +\r\n            '\". Paths must be non-empty strings and ' +\r\n            'can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\"');\r\n};\r\nvar validateRootPathString = function (fnName, argumentNumber, pathString, optional) {\r\n    if (pathString) {\r\n        // Allow '/.info/' at the beginning.\r\n        pathString = pathString.replace(/^\\/*\\.info(\\/|$)/, '/');\r\n    }\r\n    validatePathString(fnName, argumentNumber, pathString, optional);\r\n};\r\nvar validateWritablePath = function (fnName, path) {\r\n    if (path.getFront() === '.info') {\r\n        throw new Error(fnName + \" failed = Can't modify data under /.info/\");\r\n    }\r\n};\r\nvar validateUrl = function (fnName, argumentNumber, parsedUrl) {\r\n    // TODO = Validate server better.\r\n    var pathString = parsedUrl.path.toString();\r\n    if (!(typeof parsedUrl.repoInfo.host === 'string') ||\r\n        parsedUrl.repoInfo.host.length === 0 ||\r\n        (!isValidKey(parsedUrl.repoInfo.namespace) &&\r\n            parsedUrl.repoInfo.host.split(':')[0] !== 'localhost') ||\r\n        (pathString.length !== 0 && !isValidRootPathString(pathString))) {\r\n        throw new Error(errorPrefix(fnName, argumentNumber, false) +\r\n            'must be a valid firebase URL and ' +\r\n            'the path can\\'t contain \".\", \"#\", \"$\", \"[\", or \"]\".');\r\n    }\r\n};\r\nvar validateBoolean = function (fnName, argumentNumber, bool, optional) {\r\n    if (optional && bool === undefined)\r\n        return;\r\n    if (typeof bool !== 'boolean')\r\n        throw new Error(errorPrefix(fnName, argumentNumber, optional) + 'must be a boolean.');\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @constructor\r\n */\r\nvar OnDisconnect = /** @class */ (function () {\r\n    /**\r\n     * @param {!Repo} repo_\r\n     * @param {!Path} path_\r\n     */\r\n    function OnDisconnect(repo_, path_) {\r\n        this.repo_ = repo_;\r\n        this.path_ = path_;\r\n    }\r\n    /**\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!firebase.Promise}\r\n     */\r\n    OnDisconnect.prototype.cancel = function (onComplete) {\r\n        validateArgCount('OnDisconnect.cancel', 0, 1, arguments.length);\r\n        validateCallback('OnDisconnect.cancel', 1, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo_.onDisconnectCancel(this.path_, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!firebase.Promise}\r\n     */\r\n    OnDisconnect.prototype.remove = function (onComplete) {\r\n        validateArgCount('OnDisconnect.remove', 0, 1, arguments.length);\r\n        validateWritablePath('OnDisconnect.remove', this.path_);\r\n        validateCallback('OnDisconnect.remove', 1, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo_.onDisconnectSet(this.path_, null, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {*} value\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!firebase.Promise}\r\n     */\r\n    OnDisconnect.prototype.set = function (value, onComplete) {\r\n        validateArgCount('OnDisconnect.set', 1, 2, arguments.length);\r\n        validateWritablePath('OnDisconnect.set', this.path_);\r\n        validateFirebaseDataArg('OnDisconnect.set', 1, value, this.path_, false);\r\n        validateCallback('OnDisconnect.set', 2, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo_.onDisconnectSet(this.path_, value, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {*} value\r\n     * @param {number|string|null} priority\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!firebase.Promise}\r\n     */\r\n    OnDisconnect.prototype.setWithPriority = function (value, priority, onComplete) {\r\n        validateArgCount('OnDisconnect.setWithPriority', 2, 3, arguments.length);\r\n        validateWritablePath('OnDisconnect.setWithPriority', this.path_);\r\n        validateFirebaseDataArg('OnDisconnect.setWithPriority', 1, value, this.path_, false);\r\n        validatePriority('OnDisconnect.setWithPriority', 2, priority, false);\r\n        validateCallback('OnDisconnect.setWithPriority', 3, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo_.onDisconnectSetWithPriority(this.path_, value, priority, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {!Object} objectToMerge\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!firebase.Promise}\r\n     */\r\n    OnDisconnect.prototype.update = function (objectToMerge, onComplete) {\r\n        validateArgCount('OnDisconnect.update', 1, 2, arguments.length);\r\n        validateWritablePath('OnDisconnect.update', this.path_);\r\n        if (Array.isArray(objectToMerge)) {\r\n            var newObjectToMerge = {};\r\n            for (var i = 0; i < objectToMerge.length; ++i) {\r\n                newObjectToMerge['' + i] = objectToMerge[i];\r\n            }\r\n            objectToMerge = newObjectToMerge;\r\n            warn('Passing an Array to firebase.database.onDisconnect().update() is deprecated. Use set() if you want to overwrite the ' +\r\n                'existing data, or an Object with integer keys if you really do want to only update some of the children.');\r\n        }\r\n        validateFirebaseMergeDataArg('OnDisconnect.update', 1, objectToMerge, this.path_, false);\r\n        validateCallback('OnDisconnect.update', 2, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo_.onDisconnectUpdate(this.path_, objectToMerge, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    return OnDisconnect;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar TransactionResult = /** @class */ (function () {\r\n    /**\r\n     * A type for the resolve value of Firebase.transaction.\r\n     * @constructor\r\n     * @dict\r\n     * @param {boolean} committed\r\n     * @param {DataSnapshot} snapshot\r\n     */\r\n    function TransactionResult(committed, snapshot) {\r\n        this.committed = committed;\r\n        this.snapshot = snapshot;\r\n    }\r\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\r\n    // for end-users\r\n    TransactionResult.prototype.toJSON = function () {\r\n        validateArgCount('TransactionResult.toJSON', 0, 1, arguments.length);\r\n        return { committed: this.committed, snapshot: this.snapshot.toJSON() };\r\n    };\r\n    return TransactionResult;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Fancy ID generator that creates 20-character string identifiers with the\r\n * following properties:\r\n *\r\n * 1. They're based on timestamp so that they sort *after* any existing ids.\r\n * 2. They contain 72-bits of random data after the timestamp so that IDs won't\r\n *    collide with other clients' IDs.\r\n * 3. They sort *lexicographically* (so the timestamp is converted to characters\r\n *    that will sort properly).\r\n * 4. They're monotonically increasing. Even if you generate more than one in\r\n *    the same timestamp, the latter ones will sort after the former ones. We do\r\n *    this by using the previous random bits but \"incrementing\" them by 1 (only\r\n *    in the case of a timestamp collision).\r\n */\r\nvar nextPushId = (function () {\r\n    // Modeled after base64 web-safe chars, but ordered by ASCII.\r\n    var PUSH_CHARS = '-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz';\r\n    // Timestamp of last push, used to prevent local collisions if you push twice\r\n    // in one ms.\r\n    var lastPushTime = 0;\r\n    // We generate 72-bits of randomness which get turned into 12 characters and\r\n    // appended to the timestamp to prevent collisions with other clients. We\r\n    // store the last characters we generated because in the event of a collision,\r\n    // we'll use those same characters except \"incremented\" by one.\r\n    var lastRandChars = [];\r\n    return function (now) {\r\n        var duplicateTime = now === lastPushTime;\r\n        lastPushTime = now;\r\n        var i;\r\n        var timeStampChars = new Array(8);\r\n        for (i = 7; i >= 0; i--) {\r\n            timeStampChars[i] = PUSH_CHARS.charAt(now % 64);\r\n            // NOTE: Can't use << here because javascript will convert to int and lose\r\n            // the upper bits.\r\n            now = Math.floor(now / 64);\r\n        }\r\n        assert(now === 0, 'Cannot push at time == 0');\r\n        var id = timeStampChars.join('');\r\n        if (!duplicateTime) {\r\n            for (i = 0; i < 12; i++) {\r\n                lastRandChars[i] = Math.floor(Math.random() * 64);\r\n            }\r\n        }\r\n        else {\r\n            // If the timestamp hasn't changed since last push, use the same random\r\n            // number, except incremented by 1.\r\n            for (i = 11; i >= 0 && lastRandChars[i] === 63; i--) {\r\n                lastRandChars[i] = 0;\r\n            }\r\n            lastRandChars[i]++;\r\n        }\r\n        for (i = 0; i < 12; i++) {\r\n            id += PUSH_CHARS.charAt(lastRandChars[i]);\r\n        }\r\n        assert(id.length === 20, 'nextPushId: Length should be 20.');\r\n        return id;\r\n    };\r\n})();\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n *\r\n * @param {!string} name\r\n * @param {!Node} node\r\n * @constructor\r\n * @struct\r\n */\r\nvar NamedNode = /** @class */ (function () {\r\n    function NamedNode(name, node) {\r\n        this.name = name;\r\n        this.node = node;\r\n    }\r\n    /**\r\n     *\r\n     * @param {!string} name\r\n     * @param {!Node} node\r\n     * @return {NamedNode}\r\n     */\r\n    NamedNode.Wrap = function (name, node) {\r\n        return new NamedNode(name, node);\r\n    };\r\n    return NamedNode;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n *\r\n * @constructor\r\n */\r\nvar Index = /** @class */ (function () {\r\n    function Index() {\r\n    }\r\n    /**\r\n     * @return {function(!NamedNode, !NamedNode):number} A standalone comparison function for\r\n     * this index\r\n     */\r\n    Index.prototype.getCompare = function () {\r\n        return this.compare.bind(this);\r\n    };\r\n    /**\r\n     * Given a before and after value for a node, determine if the indexed value has changed. Even if they are different,\r\n     * it's possible that the changes are isolated to parts of the snapshot that are not indexed.\r\n     *\r\n     * @param {!Node} oldNode\r\n     * @param {!Node} newNode\r\n     * @return {boolean} True if the portion of the snapshot being indexed changed between oldNode and newNode\r\n     */\r\n    Index.prototype.indexedValueChanged = function (oldNode, newNode) {\r\n        var oldWrapped = new NamedNode(MIN_NAME, oldNode);\r\n        var newWrapped = new NamedNode(MIN_NAME, newNode);\r\n        return this.compare(oldWrapped, newWrapped) !== 0;\r\n    };\r\n    /**\r\n     * @return {!NamedNode} a node wrapper that will sort equal to or less than\r\n     * any other node wrapper, using this index\r\n     */\r\n    Index.prototype.minPost = function () {\r\n        return NamedNode.MIN;\r\n    };\r\n    return Index;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar __EMPTY_NODE;\r\nvar KeyIndex = /** @class */ (function (_super) {\r\n    __extends(KeyIndex, _super);\r\n    function KeyIndex() {\r\n        return _super !== null && _super.apply(this, arguments) || this;\r\n    }\r\n    Object.defineProperty(KeyIndex, \"__EMPTY_NODE\", {\r\n        get: function () {\r\n            return __EMPTY_NODE;\r\n        },\r\n        set: function (val) {\r\n            __EMPTY_NODE = val;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    KeyIndex.prototype.compare = function (a, b) {\r\n        return nameCompare(a.name, b.name);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    KeyIndex.prototype.isDefinedOn = function (node) {\r\n        // We could probably return true here (since every node has a key), but it's never called\r\n        // so just leaving unimplemented for now.\r\n        throw assertionError('KeyIndex.isDefinedOn not expected to be called.');\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    KeyIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\r\n        return false; // The key for a node never changes.\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    KeyIndex.prototype.minPost = function () {\r\n        return NamedNode.MIN;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    KeyIndex.prototype.maxPost = function () {\r\n        // TODO: This should really be created once and cached in a static property, but\r\n        // NamedNode isn't defined yet, so I can't use it in a static.  Bleh.\r\n        return new NamedNode(MAX_NAME, __EMPTY_NODE);\r\n    };\r\n    /**\r\n     * @param {*} indexValue\r\n     * @param {string} name\r\n     * @return {!NamedNode}\r\n     */\r\n    KeyIndex.prototype.makePost = function (indexValue, name) {\r\n        assert(typeof indexValue === 'string', 'KeyIndex indexValue must always be a string.');\r\n        // We just use empty node, but it'll never be compared, since our comparator only looks at name.\r\n        return new NamedNode(indexValue, __EMPTY_NODE);\r\n    };\r\n    /**\r\n     * @return {!string} String representation for inclusion in a query spec\r\n     */\r\n    KeyIndex.prototype.toString = function () {\r\n        return '.key';\r\n    };\r\n    return KeyIndex;\r\n}(Index));\r\nvar KEY_INDEX = new KeyIndex();\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar MAX_NODE;\r\nfunction setMaxNode(val) {\r\n    MAX_NODE = val;\r\n}\r\n/**\r\n * @param {(!string|!number)} priority\r\n * @return {!string}\r\n */\r\nvar priorityHashText = function (priority) {\r\n    if (typeof priority === 'number')\r\n        return 'number:' + doubleToIEEE754String(priority);\r\n    else\r\n        return 'string:' + priority;\r\n};\r\n/**\r\n * Validates that a priority snapshot Node is valid.\r\n *\r\n * @param {!Node} priorityNode\r\n */\r\nvar validatePriorityNode = function (priorityNode) {\r\n    if (priorityNode.isLeafNode()) {\r\n        var val = priorityNode.val();\r\n        assert(typeof val === 'string' ||\r\n            typeof val === 'number' ||\r\n            (typeof val === 'object' && contains(val, '.sv')), 'Priority must be a string or number.');\r\n    }\r\n    else {\r\n        assert(priorityNode === MAX_NODE || priorityNode.isEmpty(), 'priority of unexpected type.');\r\n    }\r\n    // Don't call getPriority() on MAX_NODE to avoid hitting assertion.\r\n    assert(priorityNode === MAX_NODE || priorityNode.getPriority().isEmpty(), \"Priority nodes can't have a priority of their own.\");\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar __childrenNodeConstructor;\r\n/**\r\n * LeafNode is a class for storing leaf nodes in a DataSnapshot.  It\r\n * implements Node and stores the value of the node (a string,\r\n * number, or boolean) accessible via getValue().\r\n */\r\nvar LeafNode = /** @class */ (function () {\r\n    /**\r\n     * @implements {Node}\r\n     * @param {!(string|number|boolean|Object)} value_ The value to store in this leaf node.\r\n     *                                         The object type is possible in the event of a deferred value\r\n     * @param {!Node=} priorityNode_ The priority of this node.\r\n     */\r\n    function LeafNode(value_, priorityNode_) {\r\n        if (priorityNode_ === void 0) { priorityNode_ = LeafNode.__childrenNodeConstructor.EMPTY_NODE; }\r\n        this.value_ = value_;\r\n        this.priorityNode_ = priorityNode_;\r\n        this.lazyHash_ = null;\r\n        assert(this.value_ !== undefined && this.value_ !== null, \"LeafNode shouldn't be created with null/undefined value.\");\r\n        validatePriorityNode(this.priorityNode_);\r\n    }\r\n    Object.defineProperty(LeafNode, \"__childrenNodeConstructor\", {\r\n        get: function () {\r\n            return __childrenNodeConstructor;\r\n        },\r\n        set: function (val) {\r\n            __childrenNodeConstructor = val;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.isLeafNode = function () {\r\n        return true;\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.getPriority = function () {\r\n        return this.priorityNode_;\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.updatePriority = function (newPriorityNode) {\r\n        return new LeafNode(this.value_, newPriorityNode);\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.getImmediateChild = function (childName) {\r\n        // Hack to treat priority as a regular child\r\n        if (childName === '.priority') {\r\n            return this.priorityNode_;\r\n        }\r\n        else {\r\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.getChild = function (path) {\r\n        if (path.isEmpty()) {\r\n            return this;\r\n        }\r\n        else if (path.getFront() === '.priority') {\r\n            return this.priorityNode_;\r\n        }\r\n        else {\r\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LeafNode.prototype.hasChild = function () {\r\n        return false;\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.getPredecessorChildName = function (childName, childNode) {\r\n        return null;\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.updateImmediateChild = function (childName, newChildNode) {\r\n        if (childName === '.priority') {\r\n            return this.updatePriority(newChildNode);\r\n        }\r\n        else if (newChildNode.isEmpty() && childName !== '.priority') {\r\n            return this;\r\n        }\r\n        else {\r\n            return LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateImmediateChild(childName, newChildNode).updatePriority(this.priorityNode_);\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.updateChild = function (path, newChildNode) {\r\n        var front = path.getFront();\r\n        if (front === null) {\r\n            return newChildNode;\r\n        }\r\n        else if (newChildNode.isEmpty() && front !== '.priority') {\r\n            return this;\r\n        }\r\n        else {\r\n            assert(front !== '.priority' || path.getLength() === 1, '.priority must be the last token in a path');\r\n            return this.updateImmediateChild(front, LeafNode.__childrenNodeConstructor.EMPTY_NODE.updateChild(path.popFront(), newChildNode));\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.isEmpty = function () {\r\n        return false;\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.numChildren = function () {\r\n        return 0;\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.forEachChild = function (index, action) {\r\n        return false;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LeafNode.prototype.val = function (exportFormat) {\r\n        if (exportFormat && !this.getPriority().isEmpty())\r\n            return {\r\n                '.value': this.getValue(),\r\n                '.priority': this.getPriority().val()\r\n            };\r\n        else\r\n            return this.getValue();\r\n    };\r\n    /** @inheritDoc */\r\n    LeafNode.prototype.hash = function () {\r\n        if (this.lazyHash_ === null) {\r\n            var toHash = '';\r\n            if (!this.priorityNode_.isEmpty())\r\n                toHash +=\r\n                    'priority:' +\r\n                        priorityHashText(this.priorityNode_.val()) +\r\n                        ':';\r\n            var type = typeof this.value_;\r\n            toHash += type + ':';\r\n            if (type === 'number') {\r\n                toHash += doubleToIEEE754String(this.value_);\r\n            }\r\n            else {\r\n                toHash += this.value_;\r\n            }\r\n            this.lazyHash_ = sha1(toHash);\r\n        }\r\n        return this.lazyHash_;\r\n    };\r\n    /**\r\n     * Returns the value of the leaf node.\r\n     * @return {Object|string|number|boolean} The value of the node.\r\n     */\r\n    LeafNode.prototype.getValue = function () {\r\n        return this.value_;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LeafNode.prototype.compareTo = function (other) {\r\n        if (other === LeafNode.__childrenNodeConstructor.EMPTY_NODE) {\r\n            return 1;\r\n        }\r\n        else if (other instanceof LeafNode.__childrenNodeConstructor) {\r\n            return -1;\r\n        }\r\n        else {\r\n            assert(other.isLeafNode(), 'Unknown node type');\r\n            return this.compareToLeafNode_(other);\r\n        }\r\n    };\r\n    /**\r\n     * Comparison specifically for two leaf nodes\r\n     * @param {!LeafNode} otherLeaf\r\n     * @return {!number}\r\n     * @private\r\n     */\r\n    LeafNode.prototype.compareToLeafNode_ = function (otherLeaf) {\r\n        var otherLeafType = typeof otherLeaf.value_;\r\n        var thisLeafType = typeof this.value_;\r\n        var otherIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(otherLeafType);\r\n        var thisIndex = LeafNode.VALUE_TYPE_ORDER.indexOf(thisLeafType);\r\n        assert(otherIndex >= 0, 'Unknown leaf type: ' + otherLeafType);\r\n        assert(thisIndex >= 0, 'Unknown leaf type: ' + thisLeafType);\r\n        if (otherIndex === thisIndex) {\r\n            // Same type, compare values\r\n            if (thisLeafType === 'object') {\r\n                // Deferred value nodes are all equal, but we should also never get to this point...\r\n                return 0;\r\n            }\r\n            else {\r\n                // Note that this works because true > false, all others are number or string comparisons\r\n                if (this.value_ < otherLeaf.value_) {\r\n                    return -1;\r\n                }\r\n                else if (this.value_ === otherLeaf.value_) {\r\n                    return 0;\r\n                }\r\n                else {\r\n                    return 1;\r\n                }\r\n            }\r\n        }\r\n        else {\r\n            return thisIndex - otherIndex;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LeafNode.prototype.withIndex = function () {\r\n        return this;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LeafNode.prototype.isIndexed = function () {\r\n        return true;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LeafNode.prototype.equals = function (other) {\r\n        /**\r\n         * @inheritDoc\r\n         */\r\n        if (other === this) {\r\n            return true;\r\n        }\r\n        else if (other.isLeafNode()) {\r\n            var otherLeaf = other;\r\n            return (this.value_ === otherLeaf.value_ &&\r\n                this.priorityNode_.equals(otherLeaf.priorityNode_));\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    };\r\n    /**\r\n     * The sort order for comparing leaf nodes of different types. If two leaf nodes have\r\n     * the same type, the comparison falls back to their value\r\n     * @type {Array.<!string>}\r\n     * @const\r\n     */\r\n    LeafNode.VALUE_TYPE_ORDER = ['object', 'boolean', 'number', 'string'];\r\n    return LeafNode;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar nodeFromJSON;\r\nvar MAX_NODE$1;\r\nfunction setNodeFromJSON(val) {\r\n    nodeFromJSON = val;\r\n}\r\nfunction setMaxNode$1(val) {\r\n    MAX_NODE$1 = val;\r\n}\r\n/**\r\n * @constructor\r\n * @extends {Index}\r\n * @private\r\n */\r\nvar PriorityIndex = /** @class */ (function (_super) {\r\n    __extends(PriorityIndex, _super);\r\n    function PriorityIndex() {\r\n        return _super !== null && _super.apply(this, arguments) || this;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PriorityIndex.prototype.compare = function (a, b) {\r\n        var aPriority = a.node.getPriority();\r\n        var bPriority = b.node.getPriority();\r\n        var indexCmp = aPriority.compareTo(bPriority);\r\n        if (indexCmp === 0) {\r\n            return nameCompare(a.name, b.name);\r\n        }\r\n        else {\r\n            return indexCmp;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PriorityIndex.prototype.isDefinedOn = function (node) {\r\n        return !node.getPriority().isEmpty();\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PriorityIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\r\n        return !oldNode.getPriority().equals(newNode.getPriority());\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PriorityIndex.prototype.minPost = function () {\r\n        return NamedNode.MIN;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PriorityIndex.prototype.maxPost = function () {\r\n        return new NamedNode(MAX_NAME, new LeafNode('[PRIORITY-POST]', MAX_NODE$1));\r\n    };\r\n    /**\r\n     * @param {*} indexValue\r\n     * @param {string} name\r\n     * @return {!NamedNode}\r\n     */\r\n    PriorityIndex.prototype.makePost = function (indexValue, name) {\r\n        var priorityNode = nodeFromJSON(indexValue);\r\n        return new NamedNode(name, new LeafNode('[PRIORITY-POST]', priorityNode));\r\n    };\r\n    /**\r\n     * @return {!string} String representation for inclusion in a query spec\r\n     */\r\n    PriorityIndex.prototype.toString = function () {\r\n        return '.priority';\r\n    };\r\n    return PriorityIndex;\r\n}(Index));\r\nvar PRIORITY_INDEX = new PriorityIndex();\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * An iterator over an LLRBNode.\r\n */\r\nvar SortedMapIterator = /** @class */ (function () {\r\n    /**\r\n     * @template K, V, T\r\n     * @param {LLRBNode|LLRBEmptyNode} node Node to iterate.\r\n     * @param {?K} startKey\r\n     * @param {function(K, K): number} comparator\r\n     * @param {boolean} isReverse_ Whether or not to iterate in reverse\r\n     * @param {(function(K, V):T)=} resultGenerator_\r\n     */\r\n    function SortedMapIterator(node, startKey, comparator, isReverse_, resultGenerator_) {\r\n        if (resultGenerator_ === void 0) { resultGenerator_ = null; }\r\n        this.isReverse_ = isReverse_;\r\n        this.resultGenerator_ = resultGenerator_;\r\n        /** @private\r\n         * @type {Array.<!LLRBNode>}\r\n         */\r\n        this.nodeStack_ = [];\r\n        var cmp = 1;\r\n        while (!node.isEmpty()) {\r\n            node = node;\r\n            cmp = startKey ? comparator(node.key, startKey) : 1;\r\n            // flip the comparison if we're going in reverse\r\n            if (isReverse_)\r\n                cmp *= -1;\r\n            if (cmp < 0) {\r\n                // This node is less than our start key. ignore it\r\n                if (this.isReverse_) {\r\n                    node = node.left;\r\n                }\r\n                else {\r\n                    node = node.right;\r\n                }\r\n            }\r\n            else if (cmp === 0) {\r\n                // This node is exactly equal to our start key. Push it on the stack, but stop iterating;\r\n                this.nodeStack_.push(node);\r\n                break;\r\n            }\r\n            else {\r\n                // This node is greater than our start key, add it to the stack and move to the next one\r\n                this.nodeStack_.push(node);\r\n                if (this.isReverse_) {\r\n                    node = node.right;\r\n                }\r\n                else {\r\n                    node = node.left;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    SortedMapIterator.prototype.getNext = function () {\r\n        if (this.nodeStack_.length === 0)\r\n            return null;\r\n        var node = this.nodeStack_.pop();\r\n        var result;\r\n        if (this.resultGenerator_)\r\n            result = this.resultGenerator_(node.key, node.value);\r\n        else\r\n            result = { key: node.key, value: node.value };\r\n        if (this.isReverse_) {\r\n            node = node.left;\r\n            while (!node.isEmpty()) {\r\n                this.nodeStack_.push(node);\r\n                node = node.right;\r\n            }\r\n        }\r\n        else {\r\n            node = node.right;\r\n            while (!node.isEmpty()) {\r\n                this.nodeStack_.push(node);\r\n                node = node.left;\r\n            }\r\n        }\r\n        return result;\r\n    };\r\n    SortedMapIterator.prototype.hasNext = function () {\r\n        return this.nodeStack_.length > 0;\r\n    };\r\n    SortedMapIterator.prototype.peek = function () {\r\n        if (this.nodeStack_.length === 0)\r\n            return null;\r\n        var node = this.nodeStack_[this.nodeStack_.length - 1];\r\n        if (this.resultGenerator_) {\r\n            return this.resultGenerator_(node.key, node.value);\r\n        }\r\n        else {\r\n            return { key: node.key, value: node.value };\r\n        }\r\n    };\r\n    return SortedMapIterator;\r\n}());\r\n/**\r\n * Represents a node in a Left-leaning Red-Black tree.\r\n */\r\nvar LLRBNode = /** @class */ (function () {\r\n    /**\r\n     * @template K, V\r\n     * @param {!K} key Key associated with this node.\r\n     * @param {!V} value Value associated with this node.\r\n     * @param {?boolean} color Whether this node is red.\r\n     * @param {?(LLRBNode|LLRBEmptyNode)=} left Left child.\r\n     * @param {?(LLRBNode|LLRBEmptyNode)=} right Right child.\r\n     */\r\n    function LLRBNode(key, value, color, left, right) {\r\n        this.key = key;\r\n        this.value = value;\r\n        this.color = color != null ? color : LLRBNode.RED;\r\n        this.left =\r\n            left != null ? left : SortedMap.EMPTY_NODE;\r\n        this.right =\r\n            right != null ? right : SortedMap.EMPTY_NODE;\r\n    }\r\n    /**\r\n     * Returns a copy of the current node, optionally replacing pieces of it.\r\n     *\r\n     * @param {?K} key New key for the node, or null.\r\n     * @param {?V} value New value for the node, or null.\r\n     * @param {?boolean} color New color for the node, or null.\r\n     * @param {?LLRBNode|LLRBEmptyNode} left New left child for the node, or null.\r\n     * @param {?LLRBNode|LLRBEmptyNode} right New right child for the node, or null.\r\n     * @return {!LLRBNode} The node copy.\r\n     */\r\n    LLRBNode.prototype.copy = function (key, value, color, left, right) {\r\n        return new LLRBNode(key != null ? key : this.key, value != null ? value : this.value, color != null ? color : this.color, left != null ? left : this.left, right != null ? right : this.right);\r\n    };\r\n    /**\r\n     * @return {number} The total number of nodes in the tree.\r\n     */\r\n    LLRBNode.prototype.count = function () {\r\n        return this.left.count() + 1 + this.right.count();\r\n    };\r\n    /**\r\n     * @return {boolean} True if the tree is empty.\r\n     */\r\n    LLRBNode.prototype.isEmpty = function () {\r\n        return false;\r\n    };\r\n    /**\r\n     * Traverses the tree in key order and calls the specified action function\r\n     * for each node.\r\n     *\r\n     * @param {function(!K, !V):*} action Callback function to be called for each\r\n     *   node.  If it returns true, traversal is aborted.\r\n     * @return {*} The first truthy value returned by action, or the last falsey\r\n     *   value returned by action\r\n     */\r\n    LLRBNode.prototype.inorderTraversal = function (action) {\r\n        return (this.left.inorderTraversal(action) ||\r\n            action(this.key, this.value) ||\r\n            this.right.inorderTraversal(action));\r\n    };\r\n    /**\r\n     * Traverses the tree in reverse key order and calls the specified action function\r\n     * for each node.\r\n     *\r\n     * @param {function(!Object, !Object)} action Callback function to be called for each\r\n     * node.  If it returns true, traversal is aborted.\r\n     * @return {*} True if traversal was aborted.\r\n     */\r\n    LLRBNode.prototype.reverseTraversal = function (action) {\r\n        return (this.right.reverseTraversal(action) ||\r\n            action(this.key, this.value) ||\r\n            this.left.reverseTraversal(action));\r\n    };\r\n    /**\r\n     * @return {!Object} The minimum node in the tree.\r\n     * @private\r\n     */\r\n    LLRBNode.prototype.min_ = function () {\r\n        if (this.left.isEmpty()) {\r\n            return this;\r\n        }\r\n        else {\r\n            return this.left.min_();\r\n        }\r\n    };\r\n    /**\r\n     * @return {!K} The maximum key in the tree.\r\n     */\r\n    LLRBNode.prototype.minKey = function () {\r\n        return this.min_().key;\r\n    };\r\n    /**\r\n     * @return {!K} The maximum key in the tree.\r\n     */\r\n    LLRBNode.prototype.maxKey = function () {\r\n        if (this.right.isEmpty()) {\r\n            return this.key;\r\n        }\r\n        else {\r\n            return this.right.maxKey();\r\n        }\r\n    };\r\n    /**\r\n     *\r\n     * @param {!Object} key Key to insert.\r\n     * @param {!Object} value Value to insert.\r\n     * @param {Comparator} comparator Comparator.\r\n     * @return {!LLRBNode} New tree, with the key/value added.\r\n     */\r\n    LLRBNode.prototype.insert = function (key, value, comparator) {\r\n        var cmp, n;\r\n        n = this;\r\n        cmp = comparator(key, n.key);\r\n        if (cmp < 0) {\r\n            n = n.copy(null, null, null, n.left.insert(key, value, comparator), null);\r\n        }\r\n        else if (cmp === 0) {\r\n            n = n.copy(null, value, null, null, null);\r\n        }\r\n        else {\r\n            n = n.copy(null, null, null, null, n.right.insert(key, value, comparator));\r\n        }\r\n        return n.fixUp_();\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode|LLRBEmptyNode} New tree, with the minimum key removed.\r\n     */\r\n    LLRBNode.prototype.removeMin_ = function () {\r\n        if (this.left.isEmpty()) {\r\n            return SortedMap.EMPTY_NODE;\r\n        }\r\n        var n = this;\r\n        if (!n.left.isRed_() && !n.left.left.isRed_())\r\n            n = n.moveRedLeft_();\r\n        n = n.copy(null, null, null, n.left.removeMin_(), null);\r\n        return n.fixUp_();\r\n    };\r\n    /**\r\n     * @param {!Object} key The key of the item to remove.\r\n     * @param {Comparator} comparator Comparator.\r\n     * @return {!LLRBNode|LLRBEmptyNode} New tree, with the specified item removed.\r\n     */\r\n    LLRBNode.prototype.remove = function (key, comparator) {\r\n        var n, smallest;\r\n        n = this;\r\n        if (comparator(key, n.key) < 0) {\r\n            if (!n.left.isEmpty() && !n.left.isRed_() && !n.left.left.isRed_()) {\r\n                n = n.moveRedLeft_();\r\n            }\r\n            n = n.copy(null, null, null, n.left.remove(key, comparator), null);\r\n        }\r\n        else {\r\n            if (n.left.isRed_())\r\n                n = n.rotateRight_();\r\n            if (!n.right.isEmpty() && !n.right.isRed_() && !n.right.left.isRed_()) {\r\n                n = n.moveRedRight_();\r\n            }\r\n            if (comparator(key, n.key) === 0) {\r\n                if (n.right.isEmpty()) {\r\n                    return SortedMap.EMPTY_NODE;\r\n                }\r\n                else {\r\n                    smallest = n.right.min_();\r\n                    n = n.copy(smallest.key, smallest.value, null, null, n.right.removeMin_());\r\n                }\r\n            }\r\n            n = n.copy(null, null, null, null, n.right.remove(key, comparator));\r\n        }\r\n        return n.fixUp_();\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {boolean} Whether this is a RED node.\r\n     */\r\n    LLRBNode.prototype.isRed_ = function () {\r\n        return this.color;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode} New tree after performing any needed rotations.\r\n     */\r\n    LLRBNode.prototype.fixUp_ = function () {\r\n        var n = this;\r\n        if (n.right.isRed_() && !n.left.isRed_())\r\n            n = n.rotateLeft_();\r\n        if (n.left.isRed_() && n.left.left.isRed_())\r\n            n = n.rotateRight_();\r\n        if (n.left.isRed_() && n.right.isRed_())\r\n            n = n.colorFlip_();\r\n        return n;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode} New tree, after moveRedLeft.\r\n     */\r\n    LLRBNode.prototype.moveRedLeft_ = function () {\r\n        var n = this.colorFlip_();\r\n        if (n.right.left.isRed_()) {\r\n            n = n.copy(null, null, null, null, n.right.rotateRight_());\r\n            n = n.rotateLeft_();\r\n            n = n.colorFlip_();\r\n        }\r\n        return n;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode} New tree, after moveRedRight.\r\n     */\r\n    LLRBNode.prototype.moveRedRight_ = function () {\r\n        var n = this.colorFlip_();\r\n        if (n.left.left.isRed_()) {\r\n            n = n.rotateRight_();\r\n            n = n.colorFlip_();\r\n        }\r\n        return n;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode} New tree, after rotateLeft.\r\n     */\r\n    LLRBNode.prototype.rotateLeft_ = function () {\r\n        var nl = this.copy(null, null, LLRBNode.RED, null, this.right.left);\r\n        return this.right.copy(null, null, this.color, nl, null);\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode} New tree, after rotateRight.\r\n     */\r\n    LLRBNode.prototype.rotateRight_ = function () {\r\n        var nr = this.copy(null, null, LLRBNode.RED, this.left.right, null);\r\n        return this.left.copy(null, null, this.color, null, nr);\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {!LLRBNode} New tree, after colorFlip.\r\n     */\r\n    LLRBNode.prototype.colorFlip_ = function () {\r\n        var left = this.left.copy(null, null, !this.left.color, null, null);\r\n        var right = this.right.copy(null, null, !this.right.color, null, null);\r\n        return this.copy(null, null, !this.color, left, right);\r\n    };\r\n    /**\r\n     * For testing.\r\n     *\r\n     * @private\r\n     * @return {boolean} True if all is well.\r\n     */\r\n    LLRBNode.prototype.checkMaxDepth_ = function () {\r\n        var blackDepth = this.check_();\r\n        return Math.pow(2.0, blackDepth) <= this.count() + 1;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {number} Not sure what this returns exactly. :-).\r\n     */\r\n    LLRBNode.prototype.check_ = function () {\r\n        var blackDepth;\r\n        if (this.isRed_() && this.left.isRed_()) {\r\n            throw new Error('Red node has red child(' + this.key + ',' + this.value + ')');\r\n        }\r\n        if (this.right.isRed_()) {\r\n            throw new Error('Right child of (' + this.key + ',' + this.value + ') is red');\r\n        }\r\n        blackDepth = this.left.check_();\r\n        if (blackDepth !== this.right.check_()) {\r\n            throw new Error('Black depths differ');\r\n        }\r\n        else {\r\n            return blackDepth + (this.isRed_() ? 0 : 1);\r\n        }\r\n    };\r\n    LLRBNode.RED = true;\r\n    LLRBNode.BLACK = false;\r\n    return LLRBNode;\r\n}());\r\n/**\r\n * Represents an empty node (a leaf node in the Red-Black Tree).\r\n */\r\nvar LLRBEmptyNode = /** @class */ (function () {\r\n    function LLRBEmptyNode() {\r\n    }\r\n    /**\r\n     * Returns a copy of the current node.\r\n     *\r\n     * @return {!LLRBEmptyNode} The node copy.\r\n     */\r\n    LLRBEmptyNode.prototype.copy = function (key, value, color, left, right) {\r\n        return this;\r\n    };\r\n    /**\r\n     * Returns a copy of the tree, with the specified key/value added.\r\n     *\r\n     * @param {!K} key Key to be added.\r\n     * @param {!V} value Value to be added.\r\n     * @param {Comparator} comparator Comparator.\r\n     * @return {!LLRBNode} New tree, with item added.\r\n     */\r\n    LLRBEmptyNode.prototype.insert = function (key, value, comparator) {\r\n        return new LLRBNode(key, value, null);\r\n    };\r\n    /**\r\n     * Returns a copy of the tree, with the specified key removed.\r\n     *\r\n     * @param {!K} key The key to remove.\r\n     * @param {Comparator} comparator Comparator.\r\n     * @return {!LLRBEmptyNode} New tree, with item removed.\r\n     */\r\n    LLRBEmptyNode.prototype.remove = function (key, comparator) {\r\n        return this;\r\n    };\r\n    /**\r\n     * @return {number} The total number of nodes in the tree.\r\n     */\r\n    LLRBEmptyNode.prototype.count = function () {\r\n        return 0;\r\n    };\r\n    /**\r\n     * @return {boolean} True if the tree is empty.\r\n     */\r\n    LLRBEmptyNode.prototype.isEmpty = function () {\r\n        return true;\r\n    };\r\n    /**\r\n     * Traverses the tree in key order and calls the specified action function\r\n     * for each node.\r\n     *\r\n     * @param {function(!K, !V):*} action Callback function to be called for each\r\n     * node.  If it returns true, traversal is aborted.\r\n     * @return {boolean} True if traversal was aborted.\r\n     */\r\n    LLRBEmptyNode.prototype.inorderTraversal = function (action) {\r\n        return false;\r\n    };\r\n    /**\r\n     * Traverses the tree in reverse key order and calls the specified action function\r\n     * for each node.\r\n     *\r\n     * @param {function(!K, !V)} action Callback function to be called for each\r\n     * node.  If it returns true, traversal is aborted.\r\n     * @return {boolean} True if traversal was aborted.\r\n     */\r\n    LLRBEmptyNode.prototype.reverseTraversal = function (action) {\r\n        return false;\r\n    };\r\n    /**\r\n     * @return {null}\r\n     */\r\n    LLRBEmptyNode.prototype.minKey = function () {\r\n        return null;\r\n    };\r\n    /**\r\n     * @return {null}\r\n     */\r\n    LLRBEmptyNode.prototype.maxKey = function () {\r\n        return null;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {number} Not sure what this returns exactly. :-).\r\n     */\r\n    LLRBEmptyNode.prototype.check_ = function () {\r\n        return 0;\r\n    };\r\n    /**\r\n     * @private\r\n     * @return {boolean} Whether this node is red.\r\n     */\r\n    LLRBEmptyNode.prototype.isRed_ = function () {\r\n        return false;\r\n    };\r\n    return LLRBEmptyNode;\r\n}());\r\n/**\r\n * An immutable sorted map implementation, based on a Left-leaning Red-Black\r\n * tree.\r\n */\r\nvar SortedMap = /** @class */ (function () {\r\n    /**\r\n     * @template K, V\r\n     * @param {function(K, K):number} comparator_ Key comparator.\r\n     * @param {LLRBNode=} root_ (Optional) Root node for the map.\r\n     */\r\n    function SortedMap(comparator_, root_) {\r\n        if (root_ === void 0) { root_ = SortedMap.EMPTY_NODE; }\r\n        this.comparator_ = comparator_;\r\n        this.root_ = root_;\r\n    }\r\n    /**\r\n     * Returns a copy of the map, with the specified key/value added or replaced.\r\n     * (TODO: We should perhaps rename this method to 'put')\r\n     *\r\n     * @param {!K} key Key to be added.\r\n     * @param {!V} value Value to be added.\r\n     * @return {!SortedMap.<K, V>} New map, with item added.\r\n     */\r\n    SortedMap.prototype.insert = function (key, value) {\r\n        return new SortedMap(this.comparator_, this.root_\r\n            .insert(key, value, this.comparator_)\r\n            .copy(null, null, LLRBNode.BLACK, null, null));\r\n    };\r\n    /**\r\n     * Returns a copy of the map, with the specified key removed.\r\n     *\r\n     * @param {!K} key The key to remove.\r\n     * @return {!SortedMap.<K, V>} New map, with item removed.\r\n     */\r\n    SortedMap.prototype.remove = function (key) {\r\n        return new SortedMap(this.comparator_, this.root_\r\n            .remove(key, this.comparator_)\r\n            .copy(null, null, LLRBNode.BLACK, null, null));\r\n    };\r\n    /**\r\n     * Returns the value of the node with the given key, or null.\r\n     *\r\n     * @param {!K} key The key to look up.\r\n     * @return {?V} The value of the node with the given key, or null if the\r\n     * key doesn't exist.\r\n     */\r\n    SortedMap.prototype.get = function (key) {\r\n        var cmp;\r\n        var node = this.root_;\r\n        while (!node.isEmpty()) {\r\n            cmp = this.comparator_(key, node.key);\r\n            if (cmp === 0) {\r\n                return node.value;\r\n            }\r\n            else if (cmp < 0) {\r\n                node = node.left;\r\n            }\r\n            else if (cmp > 0) {\r\n                node = node.right;\r\n            }\r\n        }\r\n        return null;\r\n    };\r\n    /**\r\n     * Returns the key of the item *before* the specified key, or null if key is the first item.\r\n     * @param {K} key The key to find the predecessor of\r\n     * @return {?K} The predecessor key.\r\n     */\r\n    SortedMap.prototype.getPredecessorKey = function (key) {\r\n        var cmp, node = this.root_, rightParent = null;\r\n        while (!node.isEmpty()) {\r\n            cmp = this.comparator_(key, node.key);\r\n            if (cmp === 0) {\r\n                if (!node.left.isEmpty()) {\r\n                    node = node.left;\r\n                    while (!node.right.isEmpty())\r\n                        node = node.right;\r\n                    return node.key;\r\n                }\r\n                else if (rightParent) {\r\n                    return rightParent.key;\r\n                }\r\n                else {\r\n                    return null; // first item.\r\n                }\r\n            }\r\n            else if (cmp < 0) {\r\n                node = node.left;\r\n            }\r\n            else if (cmp > 0) {\r\n                rightParent = node;\r\n                node = node.right;\r\n            }\r\n        }\r\n        throw new Error('Attempted to find predecessor key for a nonexistent key.  What gives?');\r\n    };\r\n    /**\r\n     * @return {boolean} True if the map is empty.\r\n     */\r\n    SortedMap.prototype.isEmpty = function () {\r\n        return this.root_.isEmpty();\r\n    };\r\n    /**\r\n     * @return {number} The total number of nodes in the map.\r\n     */\r\n    SortedMap.prototype.count = function () {\r\n        return this.root_.count();\r\n    };\r\n    /**\r\n     * @return {?K} The minimum key in the map.\r\n     */\r\n    SortedMap.prototype.minKey = function () {\r\n        return this.root_.minKey();\r\n    };\r\n    /**\r\n     * @return {?K} The maximum key in the map.\r\n     */\r\n    SortedMap.prototype.maxKey = function () {\r\n        return this.root_.maxKey();\r\n    };\r\n    /**\r\n     * Traverses the map in key order and calls the specified action function\r\n     * for each key/value pair.\r\n     *\r\n     * @param {function(!K, !V):*} action Callback function to be called\r\n     * for each key/value pair.  If action returns true, traversal is aborted.\r\n     * @return {*} The first truthy value returned by action, or the last falsey\r\n     *   value returned by action\r\n     */\r\n    SortedMap.prototype.inorderTraversal = function (action) {\r\n        return this.root_.inorderTraversal(action);\r\n    };\r\n    /**\r\n     * Traverses the map in reverse key order and calls the specified action function\r\n     * for each key/value pair.\r\n     *\r\n     * @param {function(!Object, !Object)} action Callback function to be called\r\n     * for each key/value pair.  If action returns true, traversal is aborted.\r\n     * @return {*} True if the traversal was aborted.\r\n     */\r\n    SortedMap.prototype.reverseTraversal = function (action) {\r\n        return this.root_.reverseTraversal(action);\r\n    };\r\n    /**\r\n     * Returns an iterator over the SortedMap.\r\n     * @template T\r\n     * @param {(function(K, V):T)=} resultGenerator\r\n     * @return {SortedMapIterator.<K, V, T>} The iterator.\r\n     */\r\n    SortedMap.prototype.getIterator = function (resultGenerator) {\r\n        return new SortedMapIterator(this.root_, null, this.comparator_, false, resultGenerator);\r\n    };\r\n    SortedMap.prototype.getIteratorFrom = function (key, resultGenerator) {\r\n        return new SortedMapIterator(this.root_, key, this.comparator_, false, resultGenerator);\r\n    };\r\n    SortedMap.prototype.getReverseIteratorFrom = function (key, resultGenerator) {\r\n        return new SortedMapIterator(this.root_, key, this.comparator_, true, resultGenerator);\r\n    };\r\n    SortedMap.prototype.getReverseIterator = function (resultGenerator) {\r\n        return new SortedMapIterator(this.root_, null, this.comparator_, true, resultGenerator);\r\n    };\r\n    /**\r\n     * Always use the same empty node, to reduce memory.\r\n     * @const\r\n     */\r\n    SortedMap.EMPTY_NODE = new LLRBEmptyNode();\r\n    return SortedMap;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar LOG_2 = Math.log(2);\r\n/**\r\n * @constructor\r\n */\r\nvar Base12Num = /** @class */ (function () {\r\n    /**\r\n     * @param {number} length\r\n     */\r\n    function Base12Num(length) {\r\n        var logBase2 = function (num) {\r\n            return parseInt((Math.log(num) / LOG_2), 10);\r\n        };\r\n        var bitMask = function (bits) { return parseInt(Array(bits + 1).join('1'), 2); };\r\n        this.count = logBase2(length + 1);\r\n        this.current_ = this.count - 1;\r\n        var mask = bitMask(this.count);\r\n        this.bits_ = (length + 1) & mask;\r\n    }\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    Base12Num.prototype.nextBitIsOne = function () {\r\n        //noinspection JSBitwiseOperatorUsage\r\n        var result = !(this.bits_ & (0x1 << this.current_));\r\n        this.current_--;\r\n        return result;\r\n    };\r\n    return Base12Num;\r\n}());\r\n/**\r\n * Takes a list of child nodes and constructs a SortedSet using the given comparison\r\n * function\r\n *\r\n * Uses the algorithm described in the paper linked here:\r\n * http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.1458\r\n *\r\n * @template K, V\r\n * @param {Array.<!NamedNode>} childList Unsorted list of children\r\n * @param {function(!NamedNode, !NamedNode):number} cmp The comparison method to be used\r\n * @param {(function(NamedNode):K)=} keyFn An optional function to extract K from a node wrapper, if K's\r\n *                                                        type is not NamedNode\r\n * @param {(function(K, K):number)=} mapSortFn An optional override for comparator used by the generated sorted map\r\n * @return {SortedMap.<K, V>}\r\n */\r\nvar buildChildSet = function (childList, cmp, keyFn, mapSortFn) {\r\n    childList.sort(cmp);\r\n    var buildBalancedTree = function (low, high) {\r\n        var length = high - low;\r\n        var namedNode;\r\n        var key;\r\n        if (length == 0) {\r\n            return null;\r\n        }\r\n        else if (length == 1) {\r\n            namedNode = childList[low];\r\n            key = keyFn ? keyFn(namedNode) : namedNode;\r\n            return new LLRBNode(key, namedNode.node, LLRBNode.BLACK, null, null);\r\n        }\r\n        else {\r\n            var middle = parseInt((length / 2), 10) + low;\r\n            var left = buildBalancedTree(low, middle);\r\n            var right = buildBalancedTree(middle + 1, high);\r\n            namedNode = childList[middle];\r\n            key = keyFn ? keyFn(namedNode) : namedNode;\r\n            return new LLRBNode(key, namedNode.node, LLRBNode.BLACK, left, right);\r\n        }\r\n    };\r\n    var buildFrom12Array = function (base12) {\r\n        var node = null;\r\n        var root = null;\r\n        var index = childList.length;\r\n        var buildPennant = function (chunkSize, color) {\r\n            var low = index - chunkSize;\r\n            var high = index;\r\n            index -= chunkSize;\r\n            var childTree = buildBalancedTree(low + 1, high);\r\n            var namedNode = childList[low];\r\n            var key = keyFn ? keyFn(namedNode) : namedNode;\r\n            attachPennant(new LLRBNode(key, namedNode.node, color, null, childTree));\r\n        };\r\n        var attachPennant = function (pennant) {\r\n            if (node) {\r\n                node.left = pennant;\r\n                node = pennant;\r\n            }\r\n            else {\r\n                root = pennant;\r\n                node = pennant;\r\n            }\r\n        };\r\n        for (var i = 0; i < base12.count; ++i) {\r\n            var isOne = base12.nextBitIsOne();\r\n            // The number of nodes taken in each slice is 2^(arr.length - (i + 1))\r\n            var chunkSize = Math.pow(2, base12.count - (i + 1));\r\n            if (isOne) {\r\n                buildPennant(chunkSize, LLRBNode.BLACK);\r\n            }\r\n            else {\r\n                // current == 2\r\n                buildPennant(chunkSize, LLRBNode.BLACK);\r\n                buildPennant(chunkSize, LLRBNode.RED);\r\n            }\r\n        }\r\n        return root;\r\n    };\r\n    var base12 = new Base12Num(childList.length);\r\n    var root = buildFrom12Array(base12);\r\n    return new SortedMap(mapSortFn || cmp, root);\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar _defaultIndexMap;\r\nvar fallbackObject = {};\r\n/**\r\n *\r\n * @param {Object.<string, FallbackType|SortedMap.<NamedNode, Node>>} indexes\r\n * @param {Object.<string, Index>} indexSet\r\n * @constructor\r\n */\r\nvar IndexMap = /** @class */ (function () {\r\n    function IndexMap(indexes_, indexSet_) {\r\n        this.indexes_ = indexes_;\r\n        this.indexSet_ = indexSet_;\r\n    }\r\n    Object.defineProperty(IndexMap, \"Default\", {\r\n        /**\r\n         * The default IndexMap for nodes without a priority\r\n         * @type {!IndexMap}\r\n         * @const\r\n         */\r\n        get: function () {\r\n            assert(fallbackObject && PRIORITY_INDEX, 'ChildrenNode.ts has not been loaded');\r\n            _defaultIndexMap =\r\n                _defaultIndexMap ||\r\n                    new IndexMap({ '.priority': fallbackObject }, { '.priority': PRIORITY_INDEX });\r\n            return _defaultIndexMap;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     *\r\n     * @param {!string} indexKey\r\n     * @return {?SortedMap.<NamedNode, Node>}\r\n     */\r\n    IndexMap.prototype.get = function (indexKey) {\r\n        var sortedMap = safeGet(this.indexes_, indexKey);\r\n        if (!sortedMap)\r\n            throw new Error('No index defined for ' + indexKey);\r\n        if (sortedMap === fallbackObject) {\r\n            // The index exists, but it falls back to just name comparison. Return null so that the calling code uses the\r\n            // regular child map\r\n            return null;\r\n        }\r\n        else {\r\n            return sortedMap;\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @return {boolean}\r\n     */\r\n    IndexMap.prototype.hasIndex = function (indexDefinition) {\r\n        return contains(this.indexSet_, indexDefinition.toString());\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @param {!SortedMap.<string, !Node>} existingChildren\r\n     * @return {!IndexMap}\r\n     */\r\n    IndexMap.prototype.addIndex = function (indexDefinition, existingChildren) {\r\n        assert(indexDefinition !== KEY_INDEX, \"KeyIndex always exists and isn't meant to be added to the IndexMap.\");\r\n        var childList = [];\r\n        var sawIndexedValue = false;\r\n        var iter = existingChildren.getIterator(NamedNode.Wrap);\r\n        var next = iter.getNext();\r\n        while (next) {\r\n            sawIndexedValue =\r\n                sawIndexedValue || indexDefinition.isDefinedOn(next.node);\r\n            childList.push(next);\r\n            next = iter.getNext();\r\n        }\r\n        var newIndex;\r\n        if (sawIndexedValue) {\r\n            newIndex = buildChildSet(childList, indexDefinition.getCompare());\r\n        }\r\n        else {\r\n            newIndex = fallbackObject;\r\n        }\r\n        var indexName = indexDefinition.toString();\r\n        var newIndexSet = clone(this.indexSet_);\r\n        newIndexSet[indexName] = indexDefinition;\r\n        var newIndexes = clone(this.indexes_);\r\n        newIndexes[indexName] = newIndex;\r\n        return new IndexMap(newIndexes, newIndexSet);\r\n    };\r\n    /**\r\n     * Ensure that this node is properly tracked in any indexes that we're maintaining\r\n     * @param {!NamedNode} namedNode\r\n     * @param {!SortedMap.<string, !Node>} existingChildren\r\n     * @return {!IndexMap}\r\n     */\r\n    IndexMap.prototype.addToIndexes = function (namedNode, existingChildren) {\r\n        var _this = this;\r\n        var newIndexes = map(this.indexes_, function (indexedChildren, indexName) {\r\n            var index = safeGet(_this.indexSet_, indexName);\r\n            assert(index, 'Missing index implementation for ' + indexName);\r\n            if (indexedChildren === fallbackObject) {\r\n                // Check to see if we need to index everything\r\n                if (index.isDefinedOn(namedNode.node)) {\r\n                    // We need to build this index\r\n                    var childList = [];\r\n                    var iter = existingChildren.getIterator(NamedNode.Wrap);\r\n                    var next = iter.getNext();\r\n                    while (next) {\r\n                        if (next.name != namedNode.name) {\r\n                            childList.push(next);\r\n                        }\r\n                        next = iter.getNext();\r\n                    }\r\n                    childList.push(namedNode);\r\n                    return buildChildSet(childList, index.getCompare());\r\n                }\r\n                else {\r\n                    // No change, this remains a fallback\r\n                    return fallbackObject;\r\n                }\r\n            }\r\n            else {\r\n                var existingSnap = existingChildren.get(namedNode.name);\r\n                var newChildren = indexedChildren;\r\n                if (existingSnap) {\r\n                    newChildren = newChildren.remove(new NamedNode(namedNode.name, existingSnap));\r\n                }\r\n                return newChildren.insert(namedNode, namedNode.node);\r\n            }\r\n        });\r\n        return new IndexMap(newIndexes, this.indexSet_);\r\n    };\r\n    /**\r\n     * Create a new IndexMap instance with the given value removed\r\n     * @param {!NamedNode} namedNode\r\n     * @param {!SortedMap.<string, !Node>} existingChildren\r\n     * @return {!IndexMap}\r\n     */\r\n    IndexMap.prototype.removeFromIndexes = function (namedNode, existingChildren) {\r\n        var newIndexes = map(this.indexes_, function (indexedChildren) {\r\n            if (indexedChildren === fallbackObject) {\r\n                // This is the fallback. Just return it, nothing to do in this case\r\n                return indexedChildren;\r\n            }\r\n            else {\r\n                var existingSnap = existingChildren.get(namedNode.name);\r\n                if (existingSnap) {\r\n                    return indexedChildren.remove(new NamedNode(namedNode.name, existingSnap));\r\n                }\r\n                else {\r\n                    // No record of this child\r\n                    return indexedChildren;\r\n                }\r\n            }\r\n        });\r\n        return new IndexMap(newIndexes, this.indexSet_);\r\n    };\r\n    return IndexMap;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nfunction NAME_ONLY_COMPARATOR(left, right) {\r\n    return nameCompare(left.name, right.name);\r\n}\r\nfunction NAME_COMPARATOR(left, right) {\r\n    return nameCompare(left, right);\r\n}\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// TODO: For memory savings, don't store priorityNode_ if it's empty.\r\nvar EMPTY_NODE;\r\n/**\r\n * ChildrenNode is a class for storing internal nodes in a DataSnapshot\r\n * (i.e. nodes with children).  It implements Node and stores the\r\n * list of children in the children property, sorted by child name.\r\n *\r\n * @constructor\r\n * @implements {Node}\r\n */\r\nvar ChildrenNode = /** @class */ (function () {\r\n    /**\r\n     *\r\n     * @param {!SortedMap.<string, !Node>} children_ List of children\r\n     * of this node..\r\n     * @param {?Node} priorityNode_ The priority of this node (as a snapshot node).\r\n     * @param {!IndexMap} indexMap_\r\n     */\r\n    function ChildrenNode(children_, priorityNode_, indexMap_) {\r\n        this.children_ = children_;\r\n        this.priorityNode_ = priorityNode_;\r\n        this.indexMap_ = indexMap_;\r\n        this.lazyHash_ = null;\r\n        /**\r\n         * Note: The only reason we allow null priority is for EMPTY_NODE, since we can't use\r\n         * EMPTY_NODE as the priority of EMPTY_NODE.  We might want to consider making EMPTY_NODE its own\r\n         * class instead of an empty ChildrenNode.\r\n         */\r\n        if (this.priorityNode_) {\r\n            validatePriorityNode(this.priorityNode_);\r\n        }\r\n        if (this.children_.isEmpty()) {\r\n            assert(!this.priorityNode_ || this.priorityNode_.isEmpty(), 'An empty node cannot have a priority');\r\n        }\r\n    }\r\n    Object.defineProperty(ChildrenNode, \"EMPTY_NODE\", {\r\n        get: function () {\r\n            return (EMPTY_NODE ||\r\n                (EMPTY_NODE = new ChildrenNode(new SortedMap(NAME_COMPARATOR), null, IndexMap.Default)));\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.isLeafNode = function () {\r\n        return false;\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.getPriority = function () {\r\n        return this.priorityNode_ || EMPTY_NODE;\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.updatePriority = function (newPriorityNode) {\r\n        if (this.children_.isEmpty()) {\r\n            // Don't allow priorities on empty nodes\r\n            return this;\r\n        }\r\n        else {\r\n            return new ChildrenNode(this.children_, newPriorityNode, this.indexMap_);\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.getImmediateChild = function (childName) {\r\n        // Hack to treat priority as a regular child\r\n        if (childName === '.priority') {\r\n            return this.getPriority();\r\n        }\r\n        else {\r\n            var child = this.children_.get(childName);\r\n            return child === null ? EMPTY_NODE : child;\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.getChild = function (path) {\r\n        var front = path.getFront();\r\n        if (front === null)\r\n            return this;\r\n        return this.getImmediateChild(front).getChild(path.popFront());\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.hasChild = function (childName) {\r\n        return this.children_.get(childName) !== null;\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.updateImmediateChild = function (childName, newChildNode) {\r\n        assert(newChildNode, 'We should always be passing snapshot nodes');\r\n        if (childName === '.priority') {\r\n            return this.updatePriority(newChildNode);\r\n        }\r\n        else {\r\n            var namedNode = new NamedNode(childName, newChildNode);\r\n            var newChildren = void 0, newIndexMap = void 0, newPriority = void 0;\r\n            if (newChildNode.isEmpty()) {\r\n                newChildren = this.children_.remove(childName);\r\n                newIndexMap = this.indexMap_.removeFromIndexes(namedNode, this.children_);\r\n            }\r\n            else {\r\n                newChildren = this.children_.insert(childName, newChildNode);\r\n                newIndexMap = this.indexMap_.addToIndexes(namedNode, this.children_);\r\n            }\r\n            newPriority = newChildren.isEmpty() ? EMPTY_NODE : this.priorityNode_;\r\n            return new ChildrenNode(newChildren, newPriority, newIndexMap);\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.updateChild = function (path, newChildNode) {\r\n        var front = path.getFront();\r\n        if (front === null) {\r\n            return newChildNode;\r\n        }\r\n        else {\r\n            assert(path.getFront() !== '.priority' || path.getLength() === 1, '.priority must be the last token in a path');\r\n            var newImmediateChild = this.getImmediateChild(front).updateChild(path.popFront(), newChildNode);\r\n            return this.updateImmediateChild(front, newImmediateChild);\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.isEmpty = function () {\r\n        return this.children_.isEmpty();\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.numChildren = function () {\r\n        return this.children_.count();\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.val = function (exportFormat) {\r\n        if (this.isEmpty())\r\n            return null;\r\n        var obj = {};\r\n        var numKeys = 0, maxKey = 0, allIntegerKeys = true;\r\n        this.forEachChild(PRIORITY_INDEX, function (key, childNode) {\r\n            obj[key] = childNode.val(exportFormat);\r\n            numKeys++;\r\n            if (allIntegerKeys && ChildrenNode.INTEGER_REGEXP_.test(key)) {\r\n                maxKey = Math.max(maxKey, Number(key));\r\n            }\r\n            else {\r\n                allIntegerKeys = false;\r\n            }\r\n        });\r\n        if (!exportFormat && allIntegerKeys && maxKey < 2 * numKeys) {\r\n            // convert to array.\r\n            var array = [];\r\n            for (var key in obj)\r\n                array[key] = obj[key];\r\n            return array;\r\n        }\r\n        else {\r\n            if (exportFormat && !this.getPriority().isEmpty()) {\r\n                obj['.priority'] = this.getPriority().val();\r\n            }\r\n            return obj;\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.hash = function () {\r\n        if (this.lazyHash_ === null) {\r\n            var toHash_1 = '';\r\n            if (!this.getPriority().isEmpty())\r\n                toHash_1 +=\r\n                    'priority:' +\r\n                        priorityHashText(this.getPriority().val()) +\r\n                        ':';\r\n            this.forEachChild(PRIORITY_INDEX, function (key, childNode) {\r\n                var childHash = childNode.hash();\r\n                if (childHash !== '')\r\n                    toHash_1 += ':' + key + ':' + childHash;\r\n            });\r\n            this.lazyHash_ = toHash_1 === '' ? '' : sha1(toHash_1);\r\n        }\r\n        return this.lazyHash_;\r\n    };\r\n    /** @inheritDoc */\r\n    ChildrenNode.prototype.getPredecessorChildName = function (childName, childNode, index) {\r\n        var idx = this.resolveIndex_(index);\r\n        if (idx) {\r\n            var predecessor = idx.getPredecessorKey(new NamedNode(childName, childNode));\r\n            return predecessor ? predecessor.name : null;\r\n        }\r\n        else {\r\n            return this.children_.getPredecessorKey(childName);\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @return {?string}\r\n     */\r\n    ChildrenNode.prototype.getFirstChildName = function (indexDefinition) {\r\n        var idx = this.resolveIndex_(indexDefinition);\r\n        if (idx) {\r\n            var minKey = idx.minKey();\r\n            return minKey && minKey.name;\r\n        }\r\n        else {\r\n            return this.children_.minKey();\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @return {?NamedNode}\r\n     */\r\n    ChildrenNode.prototype.getFirstChild = function (indexDefinition) {\r\n        var minKey = this.getFirstChildName(indexDefinition);\r\n        if (minKey) {\r\n            return new NamedNode(minKey, this.children_.get(minKey));\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    /**\r\n     * Given an index, return the key name of the largest value we have, according to that index\r\n     * @param {!Index} indexDefinition\r\n     * @return {?string}\r\n     */\r\n    ChildrenNode.prototype.getLastChildName = function (indexDefinition) {\r\n        var idx = this.resolveIndex_(indexDefinition);\r\n        if (idx) {\r\n            var maxKey = idx.maxKey();\r\n            return maxKey && maxKey.name;\r\n        }\r\n        else {\r\n            return this.children_.maxKey();\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @return {?NamedNode}\r\n     */\r\n    ChildrenNode.prototype.getLastChild = function (indexDefinition) {\r\n        var maxKey = this.getLastChildName(indexDefinition);\r\n        if (maxKey) {\r\n            return new NamedNode(maxKey, this.children_.get(maxKey));\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildrenNode.prototype.forEachChild = function (index, action) {\r\n        var idx = this.resolveIndex_(index);\r\n        if (idx) {\r\n            return idx.inorderTraversal(function (wrappedNode) {\r\n                return action(wrappedNode.name, wrappedNode.node);\r\n            });\r\n        }\r\n        else {\r\n            return this.children_.inorderTraversal(action);\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @return {SortedMapIterator}\r\n     */\r\n    ChildrenNode.prototype.getIterator = function (indexDefinition) {\r\n        return this.getIteratorFrom(indexDefinition.minPost(), indexDefinition);\r\n    };\r\n    /**\r\n     *\r\n     * @param {!NamedNode} startPost\r\n     * @param {!Index} indexDefinition\r\n     * @return {!SortedMapIterator}\r\n     */\r\n    ChildrenNode.prototype.getIteratorFrom = function (startPost, indexDefinition) {\r\n        var idx = this.resolveIndex_(indexDefinition);\r\n        if (idx) {\r\n            return idx.getIteratorFrom(startPost, function (key) { return key; });\r\n        }\r\n        else {\r\n            var iterator = this.children_.getIteratorFrom(startPost.name, NamedNode.Wrap);\r\n            var next = iterator.peek();\r\n            while (next != null && indexDefinition.compare(next, startPost) < 0) {\r\n                iterator.getNext();\r\n                next = iterator.peek();\r\n            }\r\n            return iterator;\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Index} indexDefinition\r\n     * @return {!SortedMapIterator}\r\n     */\r\n    ChildrenNode.prototype.getReverseIterator = function (indexDefinition) {\r\n        return this.getReverseIteratorFrom(indexDefinition.maxPost(), indexDefinition);\r\n    };\r\n    /**\r\n     * @param {!NamedNode} endPost\r\n     * @param {!Index} indexDefinition\r\n     * @return {!SortedMapIterator}\r\n     */\r\n    ChildrenNode.prototype.getReverseIteratorFrom = function (endPost, indexDefinition) {\r\n        var idx = this.resolveIndex_(indexDefinition);\r\n        if (idx) {\r\n            return idx.getReverseIteratorFrom(endPost, function (key) {\r\n                return key;\r\n            });\r\n        }\r\n        else {\r\n            var iterator = this.children_.getReverseIteratorFrom(endPost.name, NamedNode.Wrap);\r\n            var next = iterator.peek();\r\n            while (next != null && indexDefinition.compare(next, endPost) > 0) {\r\n                iterator.getNext();\r\n                next = iterator.peek();\r\n            }\r\n            return iterator;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildrenNode.prototype.compareTo = function (other) {\r\n        if (this.isEmpty()) {\r\n            if (other.isEmpty()) {\r\n                return 0;\r\n            }\r\n            else {\r\n                return -1;\r\n            }\r\n        }\r\n        else if (other.isLeafNode() || other.isEmpty()) {\r\n            return 1;\r\n        }\r\n        else if (other === MAX_NODE$2) {\r\n            return -1;\r\n        }\r\n        else {\r\n            // Must be another node with children.\r\n            return 0;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildrenNode.prototype.withIndex = function (indexDefinition) {\r\n        if (indexDefinition === KEY_INDEX ||\r\n            this.indexMap_.hasIndex(indexDefinition)) {\r\n            return this;\r\n        }\r\n        else {\r\n            var newIndexMap = this.indexMap_.addIndex(indexDefinition, this.children_);\r\n            return new ChildrenNode(this.children_, this.priorityNode_, newIndexMap);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildrenNode.prototype.isIndexed = function (index) {\r\n        return index === KEY_INDEX || this.indexMap_.hasIndex(index);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildrenNode.prototype.equals = function (other) {\r\n        if (other === this) {\r\n            return true;\r\n        }\r\n        else if (other.isLeafNode()) {\r\n            return false;\r\n        }\r\n        else {\r\n            var otherChildrenNode = other;\r\n            if (!this.getPriority().equals(otherChildrenNode.getPriority())) {\r\n                return false;\r\n            }\r\n            else if (this.children_.count() === otherChildrenNode.children_.count()) {\r\n                var thisIter = this.getIterator(PRIORITY_INDEX);\r\n                var otherIter = otherChildrenNode.getIterator(PRIORITY_INDEX);\r\n                var thisCurrent = thisIter.getNext();\r\n                var otherCurrent = otherIter.getNext();\r\n                while (thisCurrent && otherCurrent) {\r\n                    if (thisCurrent.name !== otherCurrent.name ||\r\n                        !thisCurrent.node.equals(otherCurrent.node)) {\r\n                        return false;\r\n                    }\r\n                    thisCurrent = thisIter.getNext();\r\n                    otherCurrent = otherIter.getNext();\r\n                }\r\n                return thisCurrent === null && otherCurrent === null;\r\n            }\r\n            else {\r\n                return false;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Returns a SortedMap ordered by index, or null if the default (by-key) ordering can be used\r\n     * instead.\r\n     *\r\n     * @private\r\n     * @param {!Index} indexDefinition\r\n     * @return {?SortedMap.<NamedNode, Node>}\r\n     */\r\n    ChildrenNode.prototype.resolveIndex_ = function (indexDefinition) {\r\n        if (indexDefinition === KEY_INDEX) {\r\n            return null;\r\n        }\r\n        else {\r\n            return this.indexMap_.get(indexDefinition.toString());\r\n        }\r\n    };\r\n    /**\r\n     * @private\r\n     * @type {RegExp}\r\n     */\r\n    ChildrenNode.INTEGER_REGEXP_ = /^(0|[1-9]\\d*)$/;\r\n    return ChildrenNode;\r\n}());\r\n/**\r\n * @constructor\r\n * @extends {ChildrenNode}\r\n * @private\r\n */\r\nvar MaxNode = /** @class */ (function (_super) {\r\n    __extends(MaxNode, _super);\r\n    function MaxNode() {\r\n        return _super.call(this, new SortedMap(NAME_COMPARATOR), ChildrenNode.EMPTY_NODE, IndexMap.Default) || this;\r\n    }\r\n    MaxNode.prototype.compareTo = function (other) {\r\n        if (other === this) {\r\n            return 0;\r\n        }\r\n        else {\r\n            return 1;\r\n        }\r\n    };\r\n    MaxNode.prototype.equals = function (other) {\r\n        // Not that we every compare it, but MAX_NODE is only ever equal to itself\r\n        return other === this;\r\n    };\r\n    MaxNode.prototype.getPriority = function () {\r\n        return this;\r\n    };\r\n    MaxNode.prototype.getImmediateChild = function (childName) {\r\n        return ChildrenNode.EMPTY_NODE;\r\n    };\r\n    MaxNode.prototype.isEmpty = function () {\r\n        return false;\r\n    };\r\n    return MaxNode;\r\n}(ChildrenNode));\r\n/**\r\n * Marker that will sort higher than any other snapshot.\r\n * @type {!MAX_NODE}\r\n * @const\r\n */\r\nvar MAX_NODE$2 = new MaxNode();\r\nObject.defineProperties(NamedNode, {\r\n    MIN: {\r\n        value: new NamedNode(MIN_NAME, ChildrenNode.EMPTY_NODE)\r\n    },\r\n    MAX: {\r\n        value: new NamedNode(MAX_NAME, MAX_NODE$2)\r\n    }\r\n});\r\n/**\r\n * Reference Extensions\r\n */\r\nKeyIndex.__EMPTY_NODE = ChildrenNode.EMPTY_NODE;\r\nLeafNode.__childrenNodeConstructor = ChildrenNode;\r\nsetMaxNode(MAX_NODE$2);\r\nsetMaxNode$1(MAX_NODE$2);\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar USE_HINZE = true;\r\n/**\r\n * Constructs a snapshot node representing the passed JSON and returns it.\r\n * @param {*} json JSON to create a node for.\r\n * @param {?string|?number=} priority Optional priority to use.  This will be ignored if the\r\n * passed JSON contains a .priority property.\r\n * @return {!Node}\r\n */\r\nfunction nodeFromJSON$1(json, priority) {\r\n    if (priority === void 0) { priority = null; }\r\n    if (json === null) {\r\n        return ChildrenNode.EMPTY_NODE;\r\n    }\r\n    if (typeof json === 'object' && '.priority' in json) {\r\n        priority = json['.priority'];\r\n    }\r\n    assert(priority === null ||\r\n        typeof priority === 'string' ||\r\n        typeof priority === 'number' ||\r\n        (typeof priority === 'object' && '.sv' in priority), 'Invalid priority type found: ' + typeof priority);\r\n    if (typeof json === 'object' && '.value' in json && json['.value'] !== null) {\r\n        json = json['.value'];\r\n    }\r\n    // Valid leaf nodes include non-objects or server-value wrapper objects\r\n    if (typeof json !== 'object' || '.sv' in json) {\r\n        var jsonLeaf = json;\r\n        return new LeafNode(jsonLeaf, nodeFromJSON$1(priority));\r\n    }\r\n    if (!(json instanceof Array) && USE_HINZE) {\r\n        var children_1 = [];\r\n        var childrenHavePriority_1 = false;\r\n        var hinzeJsonObj_1 = json;\r\n        forEach(hinzeJsonObj_1, function (key, child) {\r\n            if (typeof key !== 'string' || key.substring(0, 1) !== '.') {\r\n                // Ignore metadata nodes\r\n                var childNode = nodeFromJSON$1(hinzeJsonObj_1[key]);\r\n                if (!childNode.isEmpty()) {\r\n                    childrenHavePriority_1 =\r\n                        childrenHavePriority_1 || !childNode.getPriority().isEmpty();\r\n                    children_1.push(new NamedNode(key, childNode));\r\n                }\r\n            }\r\n        });\r\n        if (children_1.length == 0) {\r\n            return ChildrenNode.EMPTY_NODE;\r\n        }\r\n        var childSet = buildChildSet(children_1, NAME_ONLY_COMPARATOR, function (namedNode) { return namedNode.name; }, NAME_COMPARATOR);\r\n        if (childrenHavePriority_1) {\r\n            var sortedChildSet = buildChildSet(children_1, PRIORITY_INDEX.getCompare());\r\n            return new ChildrenNode(childSet, nodeFromJSON$1(priority), new IndexMap({ '.priority': sortedChildSet }, { '.priority': PRIORITY_INDEX }));\r\n        }\r\n        else {\r\n            return new ChildrenNode(childSet, nodeFromJSON$1(priority), IndexMap.Default);\r\n        }\r\n    }\r\n    else {\r\n        var node_1 = ChildrenNode.EMPTY_NODE;\r\n        var jsonObj_1 = json;\r\n        forEach(jsonObj_1, function (key, childData) {\r\n            if (contains(jsonObj_1, key)) {\r\n                if (key.substring(0, 1) !== '.') {\r\n                    // ignore metadata nodes.\r\n                    var childNode = nodeFromJSON$1(childData);\r\n                    if (childNode.isLeafNode() || !childNode.isEmpty())\r\n                        node_1 = node_1.updateImmediateChild(key, childNode);\r\n                }\r\n            }\r\n        });\r\n        return node_1.updatePriority(nodeFromJSON$1(priority));\r\n    }\r\n}\r\nsetNodeFromJSON(nodeFromJSON$1);\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @constructor\r\n * @extends {Index}\r\n * @private\r\n */\r\nvar ValueIndex = /** @class */ (function (_super) {\r\n    __extends(ValueIndex, _super);\r\n    function ValueIndex() {\r\n        return _super !== null && _super.apply(this, arguments) || this;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueIndex.prototype.compare = function (a, b) {\r\n        var indexCmp = a.node.compareTo(b.node);\r\n        if (indexCmp === 0) {\r\n            return nameCompare(a.name, b.name);\r\n        }\r\n        else {\r\n            return indexCmp;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueIndex.prototype.isDefinedOn = function (node) {\r\n        return true;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueIndex.prototype.indexedValueChanged = function (oldNode, newNode) {\r\n        return !oldNode.equals(newNode);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueIndex.prototype.minPost = function () {\r\n        return NamedNode.MIN;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueIndex.prototype.maxPost = function () {\r\n        return NamedNode.MAX;\r\n    };\r\n    /**\r\n     * @param {*} indexValue\r\n     * @param {string} name\r\n     * @return {!NamedNode}\r\n     */\r\n    ValueIndex.prototype.makePost = function (indexValue, name) {\r\n        var valueNode = nodeFromJSON$1(indexValue);\r\n        return new NamedNode(name, valueNode);\r\n    };\r\n    /**\r\n     * @return {!string} String representation for inclusion in a query spec\r\n     */\r\n    ValueIndex.prototype.toString = function () {\r\n        return '.value';\r\n    };\r\n    return ValueIndex;\r\n}(Index));\r\nvar VALUE_INDEX = new ValueIndex();\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @param {!Path} indexPath\r\n * @constructor\r\n * @extends {Index}\r\n */\r\nvar PathIndex = /** @class */ (function (_super) {\r\n    __extends(PathIndex, _super);\r\n    function PathIndex(indexPath_) {\r\n        var _this = _super.call(this) || this;\r\n        _this.indexPath_ = indexPath_;\r\n        assert(!indexPath_.isEmpty() && indexPath_.getFront() !== '.priority', \"Can't create PathIndex with empty path or .priority key\");\r\n        return _this;\r\n    }\r\n    /**\r\n     * @param {!Node} snap\r\n     * @return {!Node}\r\n     * @protected\r\n     */\r\n    PathIndex.prototype.extractChild = function (snap) {\r\n        return snap.getChild(this.indexPath_);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PathIndex.prototype.isDefinedOn = function (node) {\r\n        return !node.getChild(this.indexPath_).isEmpty();\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PathIndex.prototype.compare = function (a, b) {\r\n        var aChild = this.extractChild(a.node);\r\n        var bChild = this.extractChild(b.node);\r\n        var indexCmp = aChild.compareTo(bChild);\r\n        if (indexCmp === 0) {\r\n            return nameCompare(a.name, b.name);\r\n        }\r\n        else {\r\n            return indexCmp;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PathIndex.prototype.makePost = function (indexValue, name) {\r\n        var valueNode = nodeFromJSON$1(indexValue);\r\n        var node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, valueNode);\r\n        return new NamedNode(name, node);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PathIndex.prototype.maxPost = function () {\r\n        var node = ChildrenNode.EMPTY_NODE.updateChild(this.indexPath_, MAX_NODE$2);\r\n        return new NamedNode(MAX_NAME, node);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PathIndex.prototype.toString = function () {\r\n        return this.indexPath_.slice().join('/');\r\n    };\r\n    return PathIndex;\r\n}(Index));\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Class representing a firebase data snapshot.  It wraps a SnapshotNode and\r\n * surfaces the public methods (val, forEach, etc.) we want to expose.\r\n */\r\nvar DataSnapshot = /** @class */ (function () {\r\n    /**\r\n     * @param {!Node} node_ A SnapshotNode to wrap.\r\n     * @param {!Reference} ref_ The ref of the location this snapshot came from.\r\n     * @param {!Index} index_ The iteration order for this snapshot\r\n     */\r\n    function DataSnapshot(node_, ref_, index_) {\r\n        this.node_ = node_;\r\n        this.ref_ = ref_;\r\n        this.index_ = index_;\r\n    }\r\n    /**\r\n     * Retrieves the snapshot contents as JSON.  Returns null if the snapshot is\r\n     * empty.\r\n     *\r\n     * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\r\n     */\r\n    DataSnapshot.prototype.val = function () {\r\n        validateArgCount('DataSnapshot.val', 0, 0, arguments.length);\r\n        return this.node_.val();\r\n    };\r\n    /**\r\n     * Returns the snapshot contents as JSON, including priorities of node.  Suitable for exporting\r\n     * the entire node contents.\r\n     * @return {*} JSON representation of the DataSnapshot contents, or null if empty.\r\n     */\r\n    DataSnapshot.prototype.exportVal = function () {\r\n        validateArgCount('DataSnapshot.exportVal', 0, 0, arguments.length);\r\n        return this.node_.val(true);\r\n    };\r\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\r\n    // for end-users\r\n    DataSnapshot.prototype.toJSON = function () {\r\n        // Optional spacer argument is unnecessary because we're depending on recursion rather than stringifying the content\r\n        validateArgCount('DataSnapshot.toJSON', 0, 1, arguments.length);\r\n        return this.exportVal();\r\n    };\r\n    /**\r\n     * Returns whether the snapshot contains a non-null value.\r\n     *\r\n     * @return {boolean} Whether the snapshot contains a non-null value, or is empty.\r\n     */\r\n    DataSnapshot.prototype.exists = function () {\r\n        validateArgCount('DataSnapshot.exists', 0, 0, arguments.length);\r\n        return !this.node_.isEmpty();\r\n    };\r\n    /**\r\n     * Returns a DataSnapshot of the specified child node's contents.\r\n     *\r\n     * @param {!string} childPathString Path to a child.\r\n     * @return {!DataSnapshot} DataSnapshot for child node.\r\n     */\r\n    DataSnapshot.prototype.child = function (childPathString) {\r\n        validateArgCount('DataSnapshot.child', 0, 1, arguments.length);\r\n        // Ensure the childPath is a string (can be a number)\r\n        childPathString = String(childPathString);\r\n        validatePathString('DataSnapshot.child', 1, childPathString, false);\r\n        var childPath = new Path(childPathString);\r\n        var childRef = this.ref_.child(childPath);\r\n        return new DataSnapshot(this.node_.getChild(childPath), childRef, PRIORITY_INDEX);\r\n    };\r\n    /**\r\n     * Returns whether the snapshot contains a child at the specified path.\r\n     *\r\n     * @param {!string} childPathString Path to a child.\r\n     * @return {boolean} Whether the child exists.\r\n     */\r\n    DataSnapshot.prototype.hasChild = function (childPathString) {\r\n        validateArgCount('DataSnapshot.hasChild', 1, 1, arguments.length);\r\n        validatePathString('DataSnapshot.hasChild', 1, childPathString, false);\r\n        var childPath = new Path(childPathString);\r\n        return !this.node_.getChild(childPath).isEmpty();\r\n    };\r\n    /**\r\n     * Returns the priority of the object, or null if no priority was set.\r\n     *\r\n     * @return {string|number|null} The priority.\r\n     */\r\n    DataSnapshot.prototype.getPriority = function () {\r\n        validateArgCount('DataSnapshot.getPriority', 0, 0, arguments.length);\r\n        // typecast here because we never return deferred values or internal priorities (MAX_PRIORITY)\r\n        return this.node_.getPriority().val();\r\n    };\r\n    /**\r\n     * Iterates through child nodes and calls the specified action for each one.\r\n     *\r\n     * @param {function(!DataSnapshot)} action Callback function to be called\r\n     * for each child.\r\n     * @return {boolean} True if forEach was canceled by action returning true for\r\n     * one of the child nodes.\r\n     */\r\n    DataSnapshot.prototype.forEach = function (action) {\r\n        var _this = this;\r\n        validateArgCount('DataSnapshot.forEach', 1, 1, arguments.length);\r\n        validateCallback('DataSnapshot.forEach', 1, action, false);\r\n        if (this.node_.isLeafNode())\r\n            return false;\r\n        var childrenNode = this.node_;\r\n        // Sanitize the return value to a boolean. ChildrenNode.forEachChild has a weird return type...\r\n        return !!childrenNode.forEachChild(this.index_, function (key, node) {\r\n            return action(new DataSnapshot(node, _this.ref_.child(key), PRIORITY_INDEX));\r\n        });\r\n    };\r\n    /**\r\n     * Returns whether this DataSnapshot has children.\r\n     * @return {boolean} True if the DataSnapshot contains 1 or more child nodes.\r\n     */\r\n    DataSnapshot.prototype.hasChildren = function () {\r\n        validateArgCount('DataSnapshot.hasChildren', 0, 0, arguments.length);\r\n        if (this.node_.isLeafNode())\r\n            return false;\r\n        else\r\n            return !this.node_.isEmpty();\r\n    };\r\n    Object.defineProperty(DataSnapshot.prototype, \"key\", {\r\n        get: function () {\r\n            return this.ref_.getKey();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     * Returns the number of children for this DataSnapshot.\r\n     * @return {number} The number of children that this DataSnapshot contains.\r\n     */\r\n    DataSnapshot.prototype.numChildren = function () {\r\n        validateArgCount('DataSnapshot.numChildren', 0, 0, arguments.length);\r\n        return this.node_.numChildren();\r\n    };\r\n    /**\r\n     * @return {Reference} The Firebase reference for the location this snapshot's data came from.\r\n     */\r\n    DataSnapshot.prototype.getRef = function () {\r\n        validateArgCount('DataSnapshot.ref', 0, 0, arguments.length);\r\n        return this.ref_;\r\n    };\r\n    Object.defineProperty(DataSnapshot.prototype, \"ref\", {\r\n        get: function () {\r\n            return this.getRef();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    return DataSnapshot;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Encapsulates the data needed to raise an event\r\n * @implements {Event}\r\n */\r\nvar DataEvent = /** @class */ (function () {\r\n    /**\r\n     * @param {!string} eventType One of: value, child_added, child_changed, child_moved, child_removed\r\n     * @param {!EventRegistration} eventRegistration The function to call to with the event data. User provided\r\n     * @param {!DataSnapshot} snapshot The data backing the event\r\n     * @param {?string=} prevName Optional, the name of the previous child for child_* events.\r\n     */\r\n    function DataEvent(eventType, eventRegistration, snapshot, prevName) {\r\n        this.eventType = eventType;\r\n        this.eventRegistration = eventRegistration;\r\n        this.snapshot = snapshot;\r\n        this.prevName = prevName;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    DataEvent.prototype.getPath = function () {\r\n        var ref = this.snapshot.getRef();\r\n        if (this.eventType === 'value') {\r\n            return ref.path;\r\n        }\r\n        else {\r\n            return ref.getParent().path;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    DataEvent.prototype.getEventType = function () {\r\n        return this.eventType;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    DataEvent.prototype.getEventRunner = function () {\r\n        return this.eventRegistration.getEventRunner(this);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    DataEvent.prototype.toString = function () {\r\n        return (this.getPath().toString() +\r\n            ':' +\r\n            this.eventType +\r\n            ':' +\r\n            stringify(this.snapshot.exportVal()));\r\n    };\r\n    return DataEvent;\r\n}());\r\nvar CancelEvent = /** @class */ (function () {\r\n    /**\r\n     * @param {EventRegistration} eventRegistration\r\n     * @param {Error} error\r\n     * @param {!Path} path\r\n     */\r\n    function CancelEvent(eventRegistration, error, path) {\r\n        this.eventRegistration = eventRegistration;\r\n        this.error = error;\r\n        this.path = path;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    CancelEvent.prototype.getPath = function () {\r\n        return this.path;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    CancelEvent.prototype.getEventType = function () {\r\n        return 'cancel';\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    CancelEvent.prototype.getEventRunner = function () {\r\n        return this.eventRegistration.getEventRunner(this);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    CancelEvent.prototype.toString = function () {\r\n        return this.path.toString() + ':cancel';\r\n    };\r\n    return CancelEvent;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Represents registration for 'value' events.\r\n */\r\nvar ValueEventRegistration = /** @class */ (function () {\r\n    /**\r\n     * @param {?function(!DataSnapshot)} callback_\r\n     * @param {?function(Error)} cancelCallback_\r\n     * @param {?Object} context_\r\n     */\r\n    function ValueEventRegistration(callback_, cancelCallback_, context_) {\r\n        this.callback_ = callback_;\r\n        this.cancelCallback_ = cancelCallback_;\r\n        this.context_ = context_;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueEventRegistration.prototype.respondsTo = function (eventType) {\r\n        return eventType === 'value';\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueEventRegistration.prototype.createEvent = function (change, query) {\r\n        var index = query.getQueryParams().getIndex();\r\n        return new DataEvent('value', this, new DataSnapshot(change.snapshotNode, query.getRef(), index));\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueEventRegistration.prototype.getEventRunner = function (eventData) {\r\n        var ctx = this.context_;\r\n        if (eventData.getEventType() === 'cancel') {\r\n            assert(this.cancelCallback_, 'Raising a cancel event on a listener with no cancel callback');\r\n            var cancelCB_1 = this.cancelCallback_;\r\n            return function () {\r\n                // We know that error exists, we checked above that this is a cancel event\r\n                cancelCB_1.call(ctx, eventData.error);\r\n            };\r\n        }\r\n        else {\r\n            var cb_1 = this.callback_;\r\n            return function () {\r\n                cb_1.call(ctx, eventData.snapshot);\r\n            };\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueEventRegistration.prototype.createCancelEvent = function (error, path) {\r\n        if (this.cancelCallback_) {\r\n            return new CancelEvent(this, error, path);\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueEventRegistration.prototype.matches = function (other) {\r\n        if (!(other instanceof ValueEventRegistration)) {\r\n            return false;\r\n        }\r\n        else if (!other.callback_ || !this.callback_) {\r\n            // If no callback specified, we consider it to match any callback.\r\n            return true;\r\n        }\r\n        else {\r\n            return (other.callback_ === this.callback_ && other.context_ === this.context_);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ValueEventRegistration.prototype.hasAnyCallback = function () {\r\n        return this.callback_ !== null;\r\n    };\r\n    return ValueEventRegistration;\r\n}());\r\n/**\r\n * Represents the registration of 1 or more child_xxx events.\r\n *\r\n * Currently, it is always exactly 1 child_xxx event, but the idea is we might let you\r\n * register a group of callbacks together in the future.\r\n *\r\n * @constructor\r\n * @implements {EventRegistration}\r\n */\r\nvar ChildEventRegistration = /** @class */ (function () {\r\n    /**\r\n     * @param {?Object.<string, function(!DataSnapshot, ?string=)>} callbacks_\r\n     * @param {?function(Error)} cancelCallback_\r\n     * @param {Object=} context_\r\n     */\r\n    function ChildEventRegistration(callbacks_, cancelCallback_, context_) {\r\n        this.callbacks_ = callbacks_;\r\n        this.cancelCallback_ = cancelCallback_;\r\n        this.context_ = context_;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildEventRegistration.prototype.respondsTo = function (eventType) {\r\n        var eventToCheck = eventType === 'children_added' ? 'child_added' : eventType;\r\n        eventToCheck =\r\n            eventToCheck === 'children_removed' ? 'child_removed' : eventToCheck;\r\n        return contains(this.callbacks_, eventToCheck);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildEventRegistration.prototype.createCancelEvent = function (error, path) {\r\n        if (this.cancelCallback_) {\r\n            return new CancelEvent(this, error, path);\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildEventRegistration.prototype.createEvent = function (change, query) {\r\n        assert(change.childName != null, 'Child events should have a childName.');\r\n        var ref = query.getRef().child(/** @type {!string} */ (change.childName));\r\n        var index = query.getQueryParams().getIndex();\r\n        return new DataEvent(change.type, this, new DataSnapshot(change.snapshotNode, ref, index), change.prevName);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildEventRegistration.prototype.getEventRunner = function (eventData) {\r\n        var ctx = this.context_;\r\n        if (eventData.getEventType() === 'cancel') {\r\n            assert(this.cancelCallback_, 'Raising a cancel event on a listener with no cancel callback');\r\n            var cancelCB_2 = this.cancelCallback_;\r\n            return function () {\r\n                // We know that error exists, we checked above that this is a cancel event\r\n                cancelCB_2.call(ctx, eventData.error);\r\n            };\r\n        }\r\n        else {\r\n            var cb_2 = this.callbacks_[eventData.eventType];\r\n            return function () {\r\n                cb_2.call(ctx, eventData.snapshot, eventData.prevName);\r\n            };\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildEventRegistration.prototype.matches = function (other) {\r\n        if (other instanceof ChildEventRegistration) {\r\n            if (!this.callbacks_ || !other.callbacks_) {\r\n                return true;\r\n            }\r\n            else if (this.context_ === other.context_) {\r\n                var otherCount = getCount(other.callbacks_);\r\n                var thisCount = getCount(this.callbacks_);\r\n                if (otherCount === thisCount) {\r\n                    // If count is 1, do an exact match on eventType, if either is defined but null, it's a match.\r\n                    //  If event types don't match, not a match\r\n                    // If count is not 1, exact match across all\r\n                    if (otherCount === 1) {\r\n                        var otherKey /** @type {!string} */ = getAnyKey(other.callbacks_);\r\n                        var thisKey /** @type {!string} */ = getAnyKey(this.callbacks_);\r\n                        return (thisKey === otherKey &&\r\n                            (!other.callbacks_[otherKey] ||\r\n                                !this.callbacks_[thisKey] ||\r\n                                other.callbacks_[otherKey] === this.callbacks_[thisKey]));\r\n                    }\r\n                    else {\r\n                        // Exact match on each key.\r\n                        return every(this.callbacks_, function (eventType, cb) { return other.callbacks_[eventType] === cb; });\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        return false;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    ChildEventRegistration.prototype.hasAnyCallback = function () {\r\n        return this.callbacks_ !== null;\r\n    };\r\n    return ChildEventRegistration;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar __referenceConstructor;\r\n/**\r\n * A Query represents a filter to be applied to a firebase location.  This object purely represents the\r\n * query expression (and exposes our public API to build the query).  The actual query logic is in ViewBase.js.\r\n *\r\n * Since every Firebase reference is a query, Firebase inherits from this object.\r\n */\r\nvar Query = /** @class */ (function () {\r\n    function Query(repo, path, queryParams_, orderByCalled_) {\r\n        this.repo = repo;\r\n        this.path = path;\r\n        this.queryParams_ = queryParams_;\r\n        this.orderByCalled_ = orderByCalled_;\r\n    }\r\n    Object.defineProperty(Query, \"__referenceConstructor\", {\r\n        get: function () {\r\n            assert(__referenceConstructor, 'Reference.ts has not been loaded');\r\n            return __referenceConstructor;\r\n        },\r\n        set: function (val) {\r\n            __referenceConstructor = val;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     * Validates start/end values for queries.\r\n     * @param {!QueryParams} params\r\n     * @private\r\n     */\r\n    Query.validateQueryEndpoints_ = function (params) {\r\n        var startNode = null;\r\n        var endNode = null;\r\n        if (params.hasStart()) {\r\n            startNode = params.getIndexStartValue();\r\n        }\r\n        if (params.hasEnd()) {\r\n            endNode = params.getIndexEndValue();\r\n        }\r\n        if (params.getIndex() === KEY_INDEX) {\r\n            var tooManyArgsError = 'Query: When ordering by key, you may only pass one argument to ' +\r\n                'startAt(), endAt(), or equalTo().';\r\n            var wrongArgTypeError = 'Query: When ordering by key, the argument passed to startAt(), endAt(),' +\r\n                'or equalTo() must be a string.';\r\n            if (params.hasStart()) {\r\n                var startName = params.getIndexStartName();\r\n                if (startName != MIN_NAME) {\r\n                    throw new Error(tooManyArgsError);\r\n                }\r\n                else if (typeof startNode !== 'string') {\r\n                    throw new Error(wrongArgTypeError);\r\n                }\r\n            }\r\n            if (params.hasEnd()) {\r\n                var endName = params.getIndexEndName();\r\n                if (endName != MAX_NAME) {\r\n                    throw new Error(tooManyArgsError);\r\n                }\r\n                else if (typeof endNode !== 'string') {\r\n                    throw new Error(wrongArgTypeError);\r\n                }\r\n            }\r\n        }\r\n        else if (params.getIndex() === PRIORITY_INDEX) {\r\n            if ((startNode != null && !isValidPriority(startNode)) ||\r\n                (endNode != null && !isValidPriority(endNode))) {\r\n                throw new Error('Query: When ordering by priority, the first argument passed to startAt(), ' +\r\n                    'endAt(), or equalTo() must be a valid priority value (null, a number, or a string).');\r\n            }\r\n        }\r\n        else {\r\n            assert(params.getIndex() instanceof PathIndex ||\r\n                params.getIndex() === VALUE_INDEX, 'unknown index type.');\r\n            if ((startNode != null && typeof startNode === 'object') ||\r\n                (endNode != null && typeof endNode === 'object')) {\r\n                throw new Error('Query: First argument passed to startAt(), endAt(), or equalTo() cannot be ' +\r\n                    'an object.');\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Validates that limit* has been called with the correct combination of parameters\r\n     * @param {!QueryParams} params\r\n     * @private\r\n     */\r\n    Query.validateLimit_ = function (params) {\r\n        if (params.hasStart() &&\r\n            params.hasEnd() &&\r\n            params.hasLimit() &&\r\n            !params.hasAnchoredLimit()) {\r\n            throw new Error(\"Query: Can't combine startAt(), endAt(), and limit(). Use limitToFirst() or limitToLast() instead.\");\r\n        }\r\n    };\r\n    /**\r\n     * Validates that no other order by call has been made\r\n     * @param {!string} fnName\r\n     * @private\r\n     */\r\n    Query.prototype.validateNoPreviousOrderByCall_ = function (fnName) {\r\n        if (this.orderByCalled_ === true) {\r\n            throw new Error(fnName + \": You can't combine multiple orderBy calls.\");\r\n        }\r\n    };\r\n    /**\r\n     * @return {!QueryParams}\r\n     */\r\n    Query.prototype.getQueryParams = function () {\r\n        return this.queryParams_;\r\n    };\r\n    /**\r\n     * @return {!Reference}\r\n     */\r\n    Query.prototype.getRef = function () {\r\n        validateArgCount('Query.ref', 0, 0, arguments.length);\r\n        // This is a slight hack. We cannot goog.require('fb.api.Firebase'), since Firebase requires fb.api.Query.\r\n        // However, we will always export 'Firebase' to the global namespace, so it's guaranteed to exist by the time this\r\n        // method gets called.\r\n        return new Query.__referenceConstructor(this.repo, this.path);\r\n    };\r\n    /**\r\n     * @param {!string} eventType\r\n     * @param {!function(DataSnapshot, string=)} callback\r\n     * @param {(function(Error)|Object)=} cancelCallbackOrContext\r\n     * @param {Object=} context\r\n     * @return {!function(DataSnapshot, string=)}\r\n     */\r\n    Query.prototype.on = function (eventType, callback, cancelCallbackOrContext, context) {\r\n        validateArgCount('Query.on', 2, 4, arguments.length);\r\n        validateEventType('Query.on', 1, eventType, false);\r\n        validateCallback('Query.on', 2, callback, false);\r\n        var ret = Query.getCancelAndContextArgs_('Query.on', cancelCallbackOrContext, context);\r\n        if (eventType === 'value') {\r\n            this.onValueEvent(callback, ret.cancel, ret.context);\r\n        }\r\n        else {\r\n            var callbacks = {};\r\n            callbacks[eventType] = callback;\r\n            this.onChildEvent(callbacks, ret.cancel, ret.context);\r\n        }\r\n        return callback;\r\n    };\r\n    /**\r\n     * @param {!function(!DataSnapshot)} callback\r\n     * @param {?function(Error)} cancelCallback\r\n     * @param {?Object} context\r\n     * @protected\r\n     */\r\n    Query.prototype.onValueEvent = function (callback, cancelCallback, context) {\r\n        var container = new ValueEventRegistration(callback, cancelCallback || null, context || null);\r\n        this.repo.addEventCallbackForQuery(this, container);\r\n    };\r\n    /**\r\n     * @param {!Object.<string, !function(!DataSnapshot, ?string)>} callbacks\r\n     * @param {?function(Error)} cancelCallback\r\n     * @param {?Object} context\r\n     * @protected\r\n     */\r\n    Query.prototype.onChildEvent = function (callbacks, cancelCallback, context) {\r\n        var container = new ChildEventRegistration(callbacks, cancelCallback, context);\r\n        this.repo.addEventCallbackForQuery(this, container);\r\n    };\r\n    /**\r\n     * @param {string=} eventType\r\n     * @param {(function(!DataSnapshot, ?string=))=} callback\r\n     * @param {Object=} context\r\n     */\r\n    Query.prototype.off = function (eventType, callback, context) {\r\n        validateArgCount('Query.off', 0, 3, arguments.length);\r\n        validateEventType('Query.off', 1, eventType, true);\r\n        validateCallback('Query.off', 2, callback, true);\r\n        validateContextObject('Query.off', 3, context, true);\r\n        var container = null;\r\n        var callbacks = null;\r\n        if (eventType === 'value') {\r\n            var valueCallback = callback || null;\r\n            container = new ValueEventRegistration(valueCallback, null, context || null);\r\n        }\r\n        else if (eventType) {\r\n            if (callback) {\r\n                callbacks = {};\r\n                callbacks[eventType] = callback;\r\n            }\r\n            container = new ChildEventRegistration(callbacks, null, context || null);\r\n        }\r\n        this.repo.removeEventCallbackForQuery(this, container);\r\n    };\r\n    /**\r\n     * Attaches a listener, waits for the first event, and then removes the listener\r\n     * @param {!string} eventType\r\n     * @param {!function(!DataSnapshot, string=)} userCallback\r\n     * @param cancelOrContext\r\n     * @param context\r\n     * @return {!firebase.Promise}\r\n     */\r\n    Query.prototype.once = function (eventType, userCallback, cancelOrContext, context) {\r\n        var _this = this;\r\n        validateArgCount('Query.once', 1, 4, arguments.length);\r\n        validateEventType('Query.once', 1, eventType, false);\r\n        validateCallback('Query.once', 2, userCallback, true);\r\n        var ret = Query.getCancelAndContextArgs_('Query.once', cancelOrContext, context);\r\n        // TODO: Implement this more efficiently (in particular, use 'get' wire protocol for 'value' event)\r\n        // TODO: consider actually wiring the callbacks into the promise. We cannot do this without a breaking change\r\n        // because the API currently expects callbacks will be called synchronously if the data is cached, but this is\r\n        // against the Promise specification.\r\n        var firstCall = true;\r\n        var deferred = new Deferred();\r\n        // A dummy error handler in case a user wasn't expecting promises\r\n        deferred.promise.catch(function () { });\r\n        var onceCallback = function (snapshot) {\r\n            // NOTE: Even though we unsubscribe, we may get called multiple times if a single action (e.g. set() with JSON)\r\n            // triggers multiple events (e.g. child_added or child_changed).\r\n            if (firstCall) {\r\n                firstCall = false;\r\n                _this.off(eventType, onceCallback);\r\n                if (userCallback) {\r\n                    userCallback.bind(ret.context)(snapshot);\r\n                }\r\n                deferred.resolve(snapshot);\r\n            }\r\n        };\r\n        this.on(eventType, onceCallback, \r\n        /*cancel=*/ function (err) {\r\n            _this.off(eventType, onceCallback);\r\n            if (ret.cancel)\r\n                ret.cancel.bind(ret.context)(err);\r\n            deferred.reject(err);\r\n        });\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * Set a limit and anchor it to the start of the window.\r\n     * @param {!number} limit\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.limitToFirst = function (limit) {\r\n        validateArgCount('Query.limitToFirst', 1, 1, arguments.length);\r\n        if (typeof limit !== 'number' ||\r\n            Math.floor(limit) !== limit ||\r\n            limit <= 0) {\r\n            throw new Error('Query.limitToFirst: First argument must be a positive integer.');\r\n        }\r\n        if (this.queryParams_.hasLimit()) {\r\n            throw new Error('Query.limitToFirst: Limit was already set (by another call to limit, ' +\r\n                'limitToFirst, or limitToLast).');\r\n        }\r\n        return new Query(this.repo, this.path, this.queryParams_.limitToFirst(limit), this.orderByCalled_);\r\n    };\r\n    /**\r\n     * Set a limit and anchor it to the end of the window.\r\n     * @param {!number} limit\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.limitToLast = function (limit) {\r\n        validateArgCount('Query.limitToLast', 1, 1, arguments.length);\r\n        if (typeof limit !== 'number' ||\r\n            Math.floor(limit) !== limit ||\r\n            limit <= 0) {\r\n            throw new Error('Query.limitToLast: First argument must be a positive integer.');\r\n        }\r\n        if (this.queryParams_.hasLimit()) {\r\n            throw new Error('Query.limitToLast: Limit was already set (by another call to limit, ' +\r\n                'limitToFirst, or limitToLast).');\r\n        }\r\n        return new Query(this.repo, this.path, this.queryParams_.limitToLast(limit), this.orderByCalled_);\r\n    };\r\n    /**\r\n     * Given a child path, return a new query ordered by the specified grandchild path.\r\n     * @param {!string} path\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.orderByChild = function (path) {\r\n        validateArgCount('Query.orderByChild', 1, 1, arguments.length);\r\n        if (path === '$key') {\r\n            throw new Error('Query.orderByChild: \"$key\" is invalid.  Use Query.orderByKey() instead.');\r\n        }\r\n        else if (path === '$priority') {\r\n            throw new Error('Query.orderByChild: \"$priority\" is invalid.  Use Query.orderByPriority() instead.');\r\n        }\r\n        else if (path === '$value') {\r\n            throw new Error('Query.orderByChild: \"$value\" is invalid.  Use Query.orderByValue() instead.');\r\n        }\r\n        validatePathString('Query.orderByChild', 1, path, false);\r\n        this.validateNoPreviousOrderByCall_('Query.orderByChild');\r\n        var parsedPath = new Path(path);\r\n        if (parsedPath.isEmpty()) {\r\n            throw new Error('Query.orderByChild: cannot pass in empty path.  Use Query.orderByValue() instead.');\r\n        }\r\n        var index = new PathIndex(parsedPath);\r\n        var newParams = this.queryParams_.orderBy(index);\r\n        Query.validateQueryEndpoints_(newParams);\r\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\r\n    };\r\n    /**\r\n     * Return a new query ordered by the KeyIndex\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.orderByKey = function () {\r\n        validateArgCount('Query.orderByKey', 0, 0, arguments.length);\r\n        this.validateNoPreviousOrderByCall_('Query.orderByKey');\r\n        var newParams = this.queryParams_.orderBy(KEY_INDEX);\r\n        Query.validateQueryEndpoints_(newParams);\r\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\r\n    };\r\n    /**\r\n     * Return a new query ordered by the PriorityIndex\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.orderByPriority = function () {\r\n        validateArgCount('Query.orderByPriority', 0, 0, arguments.length);\r\n        this.validateNoPreviousOrderByCall_('Query.orderByPriority');\r\n        var newParams = this.queryParams_.orderBy(PRIORITY_INDEX);\r\n        Query.validateQueryEndpoints_(newParams);\r\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\r\n    };\r\n    /**\r\n     * Return a new query ordered by the ValueIndex\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.orderByValue = function () {\r\n        validateArgCount('Query.orderByValue', 0, 0, arguments.length);\r\n        this.validateNoPreviousOrderByCall_('Query.orderByValue');\r\n        var newParams = this.queryParams_.orderBy(VALUE_INDEX);\r\n        Query.validateQueryEndpoints_(newParams);\r\n        return new Query(this.repo, this.path, newParams, /*orderByCalled=*/ true);\r\n    };\r\n    /**\r\n     * @param {number|string|boolean|null} value\r\n     * @param {?string=} name\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.startAt = function (value, name) {\r\n        if (value === void 0) { value = null; }\r\n        validateArgCount('Query.startAt', 0, 2, arguments.length);\r\n        validateFirebaseDataArg('Query.startAt', 1, value, this.path, true);\r\n        validateKey('Query.startAt', 2, name, true);\r\n        var newParams = this.queryParams_.startAt(value, name);\r\n        Query.validateLimit_(newParams);\r\n        Query.validateQueryEndpoints_(newParams);\r\n        if (this.queryParams_.hasStart()) {\r\n            throw new Error('Query.startAt: Starting point was already set (by another call to startAt ' +\r\n                'or equalTo).');\r\n        }\r\n        // Calling with no params tells us to start at the beginning.\r\n        if (value === undefined) {\r\n            value = null;\r\n            name = null;\r\n        }\r\n        return new Query(this.repo, this.path, newParams, this.orderByCalled_);\r\n    };\r\n    /**\r\n     * @param {number|string|boolean|null} value\r\n     * @param {?string=} name\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.endAt = function (value, name) {\r\n        if (value === void 0) { value = null; }\r\n        validateArgCount('Query.endAt', 0, 2, arguments.length);\r\n        validateFirebaseDataArg('Query.endAt', 1, value, this.path, true);\r\n        validateKey('Query.endAt', 2, name, true);\r\n        var newParams = this.queryParams_.endAt(value, name);\r\n        Query.validateLimit_(newParams);\r\n        Query.validateQueryEndpoints_(newParams);\r\n        if (this.queryParams_.hasEnd()) {\r\n            throw new Error('Query.endAt: Ending point was already set (by another call to endAt or ' +\r\n                'equalTo).');\r\n        }\r\n        return new Query(this.repo, this.path, newParams, this.orderByCalled_);\r\n    };\r\n    /**\r\n     * Load the selection of children with exactly the specified value, and, optionally,\r\n     * the specified name.\r\n     * @param {number|string|boolean|null} value\r\n     * @param {string=} name\r\n     * @return {!Query}\r\n     */\r\n    Query.prototype.equalTo = function (value, name) {\r\n        validateArgCount('Query.equalTo', 1, 2, arguments.length);\r\n        validateFirebaseDataArg('Query.equalTo', 1, value, this.path, false);\r\n        validateKey('Query.equalTo', 2, name, true);\r\n        if (this.queryParams_.hasStart()) {\r\n            throw new Error('Query.equalTo: Starting point was already set (by another call to startAt or ' +\r\n                'equalTo).');\r\n        }\r\n        if (this.queryParams_.hasEnd()) {\r\n            throw new Error('Query.equalTo: Ending point was already set (by another call to endAt or ' +\r\n                'equalTo).');\r\n        }\r\n        return this.startAt(value, name).endAt(value, name);\r\n    };\r\n    /**\r\n     * @return {!string} URL for this location.\r\n     */\r\n    Query.prototype.toString = function () {\r\n        validateArgCount('Query.toString', 0, 0, arguments.length);\r\n        return this.repo.toString() + this.path.toUrlEncodedString();\r\n    };\r\n    // Do not create public documentation. This is intended to make JSON serialization work but is otherwise unnecessary\r\n    // for end-users.\r\n    Query.prototype.toJSON = function () {\r\n        // An optional spacer argument is unnecessary for a string.\r\n        validateArgCount('Query.toJSON', 0, 1, arguments.length);\r\n        return this.toString();\r\n    };\r\n    /**\r\n     * An object representation of the query parameters used by this Query.\r\n     * @return {!Object}\r\n     */\r\n    Query.prototype.queryObject = function () {\r\n        return this.queryParams_.getQueryObject();\r\n    };\r\n    /**\r\n     * @return {!string}\r\n     */\r\n    Query.prototype.queryIdentifier = function () {\r\n        var obj = this.queryObject();\r\n        var id = ObjectToUniqueKey(obj);\r\n        return id === '{}' ? 'default' : id;\r\n    };\r\n    /**\r\n     * Return true if this query and the provided query are equivalent; otherwise, return false.\r\n     * @param {Query} other\r\n     * @return {boolean}\r\n     */\r\n    Query.prototype.isEqual = function (other) {\r\n        validateArgCount('Query.isEqual', 1, 1, arguments.length);\r\n        if (!(other instanceof Query)) {\r\n            var error$$1 = 'Query.isEqual failed: First argument must be an instance of firebase.database.Query.';\r\n            throw new Error(error$$1);\r\n        }\r\n        var sameRepo = this.repo === other.repo;\r\n        var samePath = this.path.equals(other.path);\r\n        var sameQueryIdentifier = this.queryIdentifier() === other.queryIdentifier();\r\n        return sameRepo && samePath && sameQueryIdentifier;\r\n    };\r\n    /**\r\n     * Helper used by .on and .once to extract the context and or cancel arguments.\r\n     * @param {!string} fnName The function name (on or once)\r\n     * @param {(function(Error)|Object)=} cancelOrContext\r\n     * @param {Object=} context\r\n     * @return {{cancel: ?function(Error), context: ?Object}}\r\n     * @private\r\n     */\r\n    Query.getCancelAndContextArgs_ = function (fnName, cancelOrContext, context) {\r\n        var ret = { cancel: null, context: null };\r\n        if (cancelOrContext && context) {\r\n            ret.cancel = cancelOrContext;\r\n            validateCallback(fnName, 3, ret.cancel, true);\r\n            ret.context = context;\r\n            validateContextObject(fnName, 4, ret.context, true);\r\n        }\r\n        else if (cancelOrContext) {\r\n            // we have either a cancel callback or a context.\r\n            if (typeof cancelOrContext === 'object' && cancelOrContext !== null) {\r\n                // it's a context!\r\n                ret.context = cancelOrContext;\r\n            }\r\n            else if (typeof cancelOrContext === 'function') {\r\n                ret.cancel = cancelOrContext;\r\n            }\r\n            else {\r\n                throw new Error(errorPrefix(fnName, 3, true) +\r\n                    ' must either be a cancel callback or a context object.');\r\n            }\r\n        }\r\n        return ret;\r\n    };\r\n    Object.defineProperty(Query.prototype, \"ref\", {\r\n        get: function () {\r\n            return this.getRef();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    return Query;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Implements a set with a count of elements.\r\n *\r\n * @template K, V\r\n */\r\nvar CountedSet = /** @class */ (function () {\r\n    function CountedSet() {\r\n        this.set = {};\r\n    }\r\n    /**\r\n     * @param {!K} item\r\n     * @param {V} val\r\n     */\r\n    CountedSet.prototype.add = function (item, val) {\r\n        this.set[item] = val !== null ? val : true;\r\n    };\r\n    /**\r\n     * @param {!K} key\r\n     * @return {boolean}\r\n     */\r\n    CountedSet.prototype.contains = function (key) {\r\n        return contains(this.set, key);\r\n    };\r\n    /**\r\n     * @param {!K} item\r\n     * @return {V}\r\n     */\r\n    CountedSet.prototype.get = function (item) {\r\n        return this.contains(item) ? this.set[item] : undefined;\r\n    };\r\n    /**\r\n     * @param {!K} item\r\n     */\r\n    CountedSet.prototype.remove = function (item) {\r\n        delete this.set[item];\r\n    };\r\n    /**\r\n     * Deletes everything in the set\r\n     */\r\n    CountedSet.prototype.clear = function () {\r\n        this.set = {};\r\n    };\r\n    /**\r\n     * True if there's nothing in the set\r\n     * @return {boolean}\r\n     */\r\n    CountedSet.prototype.isEmpty = function () {\r\n        return isEmpty(this.set);\r\n    };\r\n    /**\r\n     * @return {number} The number of items in the set\r\n     */\r\n    CountedSet.prototype.count = function () {\r\n        return getCount(this.set);\r\n    };\r\n    /**\r\n     * Run a function on each k,v pair in the set\r\n     * @param {function(K, V)} fn\r\n     */\r\n    CountedSet.prototype.each = function (fn) {\r\n        forEach(this.set, function (k, v) { return fn(k, v); });\r\n    };\r\n    /**\r\n     * Mostly for debugging\r\n     * @return {Array.<K>} The keys present in this CountedSet\r\n     */\r\n    CountedSet.prototype.keys = function () {\r\n        var keys = [];\r\n        forEach(this.set, function (k) {\r\n            keys.push(k);\r\n        });\r\n        return keys;\r\n    };\r\n    return CountedSet;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Helper class to store a sparse set of snapshots.\r\n *\r\n * @constructor\r\n */\r\nvar SparseSnapshotTree = /** @class */ (function () {\r\n    function SparseSnapshotTree() {\r\n        /**\r\n         * @private\r\n         * @type {Node}\r\n         */\r\n        this.value_ = null;\r\n        /**\r\n         * @private\r\n         * @type {CountedSet}\r\n         */\r\n        this.children_ = null;\r\n    }\r\n    /**\r\n     * Gets the node stored at the given path if one exists.\r\n     *\r\n     * @param {!Path} path Path to look up snapshot for.\r\n     * @return {?Node} The retrieved node, or null.\r\n     */\r\n    SparseSnapshotTree.prototype.find = function (path) {\r\n        if (this.value_ != null) {\r\n            return this.value_.getChild(path);\r\n        }\r\n        else if (!path.isEmpty() && this.children_ != null) {\r\n            var childKey = path.getFront();\r\n            path = path.popFront();\r\n            if (this.children_.contains(childKey)) {\r\n                var childTree = this.children_.get(childKey);\r\n                return childTree.find(path);\r\n            }\r\n            else {\r\n                return null;\r\n            }\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    /**\r\n     * Stores the given node at the specified path. If there is already a node\r\n     * at a shallower path, it merges the new data into that snapshot node.\r\n     *\r\n     * @param {!Path} path Path to look up snapshot for.\r\n     * @param {!Node} data The new data, or null.\r\n     */\r\n    SparseSnapshotTree.prototype.remember = function (path, data) {\r\n        if (path.isEmpty()) {\r\n            this.value_ = data;\r\n            this.children_ = null;\r\n        }\r\n        else if (this.value_ !== null) {\r\n            this.value_ = this.value_.updateChild(path, data);\r\n        }\r\n        else {\r\n            if (this.children_ == null) {\r\n                this.children_ = new CountedSet();\r\n            }\r\n            var childKey = path.getFront();\r\n            if (!this.children_.contains(childKey)) {\r\n                this.children_.add(childKey, new SparseSnapshotTree());\r\n            }\r\n            var child = this.children_.get(childKey);\r\n            path = path.popFront();\r\n            child.remember(path, data);\r\n        }\r\n    };\r\n    /**\r\n     * Purge the data at path from the cache.\r\n     *\r\n     * @param {!Path} path Path to look up snapshot for.\r\n     * @return {boolean} True if this node should now be removed.\r\n     */\r\n    SparseSnapshotTree.prototype.forget = function (path) {\r\n        if (path.isEmpty()) {\r\n            this.value_ = null;\r\n            this.children_ = null;\r\n            return true;\r\n        }\r\n        else {\r\n            if (this.value_ !== null) {\r\n                if (this.value_.isLeafNode()) {\r\n                    // We're trying to forget a node that doesn't exist\r\n                    return false;\r\n                }\r\n                else {\r\n                    var value = this.value_;\r\n                    this.value_ = null;\r\n                    var self_1 = this;\r\n                    value.forEachChild(PRIORITY_INDEX, function (key, tree) {\r\n                        self_1.remember(new Path(key), tree);\r\n                    });\r\n                    return this.forget(path);\r\n                }\r\n            }\r\n            else if (this.children_ !== null) {\r\n                var childKey = path.getFront();\r\n                path = path.popFront();\r\n                if (this.children_.contains(childKey)) {\r\n                    var safeToRemove = this.children_.get(childKey).forget(path);\r\n                    if (safeToRemove) {\r\n                        this.children_.remove(childKey);\r\n                    }\r\n                }\r\n                if (this.children_.isEmpty()) {\r\n                    this.children_ = null;\r\n                    return true;\r\n                }\r\n                else {\r\n                    return false;\r\n                }\r\n            }\r\n            else {\r\n                return true;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Recursively iterates through all of the stored tree and calls the\r\n     * callback on each one.\r\n     *\r\n     * @param {!Path} prefixPath Path to look up node for.\r\n     * @param {!Function} func The function to invoke for each tree.\r\n     */\r\n    SparseSnapshotTree.prototype.forEachTree = function (prefixPath, func) {\r\n        if (this.value_ !== null) {\r\n            func(prefixPath, this.value_);\r\n        }\r\n        else {\r\n            this.forEachChild(function (key, tree) {\r\n                var path = new Path(prefixPath.toString() + '/' + key);\r\n                tree.forEachTree(path, func);\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * Iterates through each immediate child and triggers the callback.\r\n     *\r\n     * @param {!Function} func The function to invoke for each child.\r\n     */\r\n    SparseSnapshotTree.prototype.forEachChild = function (func) {\r\n        if (this.children_ !== null) {\r\n            this.children_.each(function (key, tree) {\r\n                func(key, tree);\r\n            });\r\n        }\r\n    };\r\n    return SparseSnapshotTree;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Generate placeholders for deferred values.\r\n * @param {?Object} values\r\n * @return {!Object}\r\n */\r\nvar generateWithValues = function (values) {\r\n    values = values || {};\r\n    values['timestamp'] = values['timestamp'] || new Date().getTime();\r\n    return values;\r\n};\r\n/**\r\n * Value to use when firing local events. When writing server values, fire\r\n * local events with an approximate value, otherwise return value as-is.\r\n * @param {(Object|string|number|boolean)} value\r\n * @param {!Object} serverValues\r\n * @return {!(string|number|boolean)}\r\n */\r\nvar resolveDeferredValue = function (value, serverValues) {\r\n    if (!value || typeof value !== 'object') {\r\n        return value;\r\n    }\r\n    else {\r\n        assert('.sv' in value, 'Unexpected leaf node or priority contents');\r\n        return serverValues[value['.sv']];\r\n    }\r\n};\r\n/**\r\n * Recursively replace all deferred values and priorities in the tree with the\r\n * specified generated replacement values.\r\n * @param {!SparseSnapshotTree} tree\r\n * @param {!Object} serverValues\r\n * @return {!SparseSnapshotTree}\r\n */\r\nvar resolveDeferredValueTree = function (tree, serverValues) {\r\n    var resolvedTree = new SparseSnapshotTree();\r\n    tree.forEachTree(new Path(''), function (path, node) {\r\n        resolvedTree.remember(path, resolveDeferredValueSnapshot(node, serverValues));\r\n    });\r\n    return resolvedTree;\r\n};\r\n/**\r\n * Recursively replace all deferred values and priorities in the node with the\r\n * specified generated replacement values.  If there are no server values in the node,\r\n * it'll be returned as-is.\r\n * @param {!Node} node\r\n * @param {!Object} serverValues\r\n * @return {!Node}\r\n */\r\nvar resolveDeferredValueSnapshot = function (node, serverValues) {\r\n    var rawPri = node.getPriority().val();\r\n    var priority = resolveDeferredValue(rawPri, serverValues);\r\n    var newNode;\r\n    if (node.isLeafNode()) {\r\n        var leafNode = node;\r\n        var value = resolveDeferredValue(leafNode.getValue(), serverValues);\r\n        if (value !== leafNode.getValue() ||\r\n            priority !== leafNode.getPriority().val()) {\r\n            return new LeafNode(value, nodeFromJSON$1(priority));\r\n        }\r\n        else {\r\n            return node;\r\n        }\r\n    }\r\n    else {\r\n        var childrenNode = node;\r\n        newNode = childrenNode;\r\n        if (priority !== childrenNode.getPriority().val()) {\r\n            newNode = newNode.updatePriority(new LeafNode(priority));\r\n        }\r\n        childrenNode.forEachChild(PRIORITY_INDEX, function (childName, childNode) {\r\n            var newChildNode = resolveDeferredValueSnapshot(childNode, serverValues);\r\n            if (newChildNode !== childNode) {\r\n                newNode = newNode.updateImmediateChild(childName, newChildNode);\r\n            }\r\n        });\r\n        return newNode;\r\n    }\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n *\r\n * @enum\r\n */\r\nvar OperationType;\r\n(function (OperationType) {\r\n    OperationType[OperationType[\"OVERWRITE\"] = 0] = \"OVERWRITE\";\r\n    OperationType[OperationType[\"MERGE\"] = 1] = \"MERGE\";\r\n    OperationType[OperationType[\"ACK_USER_WRITE\"] = 2] = \"ACK_USER_WRITE\";\r\n    OperationType[OperationType[\"LISTEN_COMPLETE\"] = 3] = \"LISTEN_COMPLETE\";\r\n})(OperationType || (OperationType = {}));\r\n/**\r\n * @param {boolean} fromUser\r\n * @param {boolean} fromServer\r\n * @param {?string} queryId\r\n * @param {boolean} tagged\r\n * @constructor\r\n */\r\nvar OperationSource = /** @class */ (function () {\r\n    function OperationSource(fromUser, fromServer, queryId, tagged) {\r\n        this.fromUser = fromUser;\r\n        this.fromServer = fromServer;\r\n        this.queryId = queryId;\r\n        this.tagged = tagged;\r\n        assert(!tagged || fromServer, 'Tagged queries must be from server.');\r\n    }\r\n    /**\r\n     * @const\r\n     * @type {!OperationSource}\r\n     */\r\n    OperationSource.User = new OperationSource(\r\n    /*fromUser=*/ true, false, null, \r\n    /*tagged=*/ false);\r\n    /**\r\n     * @const\r\n     * @type {!OperationSource}\r\n     */\r\n    OperationSource.Server = new OperationSource(false, \r\n    /*fromServer=*/ true, null, \r\n    /*tagged=*/ false);\r\n    /**\r\n     * @param {string} queryId\r\n     * @return {!OperationSource}\r\n     */\r\n    OperationSource.forServerTaggedQuery = function (queryId) {\r\n        return new OperationSource(false, \r\n        /*fromServer=*/ true, queryId, \r\n        /*tagged=*/ true);\r\n    };\r\n    return OperationSource;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar AckUserWrite = /** @class */ (function () {\r\n    /**\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!ImmutableTree<!boolean>} affectedTree A tree containing true for each affected path. Affected paths can't overlap.\r\n     * @param {!boolean} revert\r\n     */\r\n    function AckUserWrite(\r\n    /**@inheritDoc */ path, \r\n    /**@inheritDoc */ affectedTree, \r\n    /**@inheritDoc */ revert) {\r\n        this.path = path;\r\n        this.affectedTree = affectedTree;\r\n        this.revert = revert;\r\n        /** @inheritDoc */\r\n        this.type = OperationType.ACK_USER_WRITE;\r\n        /** @inheritDoc */\r\n        this.source = OperationSource.User;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    AckUserWrite.prototype.operationForChild = function (childName) {\r\n        if (!this.path.isEmpty()) {\r\n            assert(this.path.getFront() === childName, 'operationForChild called for unrelated child.');\r\n            return new AckUserWrite(this.path.popFront(), this.affectedTree, this.revert);\r\n        }\r\n        else if (this.affectedTree.value != null) {\r\n            assert(this.affectedTree.children.isEmpty(), 'affectedTree should not have overlapping affected paths.');\r\n            // All child locations are affected as well; just return same operation.\r\n            return this;\r\n        }\r\n        else {\r\n            var childTree = this.affectedTree.subtree(new Path(childName));\r\n            return new AckUserWrite(Path.Empty, childTree, this.revert);\r\n        }\r\n    };\r\n    return AckUserWrite;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar emptyChildrenSingleton;\r\n/**\r\n * Singleton empty children collection.\r\n *\r\n * @const\r\n * @type {!SortedMap.<string, !ImmutableTree.<?>>}\r\n */\r\nvar EmptyChildren = function () {\r\n    if (!emptyChildrenSingleton) {\r\n        emptyChildrenSingleton = new SortedMap(stringCompare);\r\n    }\r\n    return emptyChildrenSingleton;\r\n};\r\n/**\r\n * A tree with immutable elements.\r\n */\r\nvar ImmutableTree = /** @class */ (function () {\r\n    /**\r\n     * @template T\r\n     * @param {?T} value\r\n     * @param {SortedMap.<string, !ImmutableTree.<T>>=} children\r\n     */\r\n    function ImmutableTree(value, children) {\r\n        if (children === void 0) { children = EmptyChildren(); }\r\n        this.value = value;\r\n        this.children = children;\r\n    }\r\n    /**\r\n     * @template T\r\n     * @param {!Object.<string, !T>} obj\r\n     * @return {!ImmutableTree.<!T>}\r\n     */\r\n    ImmutableTree.fromObject = function (obj) {\r\n        var tree = ImmutableTree.Empty;\r\n        forEach(obj, function (childPath, childSnap) {\r\n            tree = tree.set(new Path(childPath), childSnap);\r\n        });\r\n        return tree;\r\n    };\r\n    /**\r\n     * True if the value is empty and there are no children\r\n     * @return {boolean}\r\n     */\r\n    ImmutableTree.prototype.isEmpty = function () {\r\n        return this.value === null && this.children.isEmpty();\r\n    };\r\n    /**\r\n     * Given a path and predicate, return the first node and the path to that node\r\n     * where the predicate returns true.\r\n     *\r\n     * TODO Do a perf test -- If we're creating a bunch of {path: value:} objects\r\n     * on the way back out, it may be better to pass down a pathSoFar obj.\r\n     *\r\n     * @param {!Path} relativePath The remainder of the path\r\n     * @param {function(T):boolean} predicate The predicate to satisfy to return a\r\n     *   node\r\n     * @return {?{path:!Path, value:!T}}\r\n     */\r\n    ImmutableTree.prototype.findRootMostMatchingPathAndValue = function (relativePath, predicate) {\r\n        if (this.value != null && predicate(this.value)) {\r\n            return { path: Path.Empty, value: this.value };\r\n        }\r\n        else {\r\n            if (relativePath.isEmpty()) {\r\n                return null;\r\n            }\r\n            else {\r\n                var front = relativePath.getFront();\r\n                var child = this.children.get(front);\r\n                if (child !== null) {\r\n                    var childExistingPathAndValue = child.findRootMostMatchingPathAndValue(relativePath.popFront(), predicate);\r\n                    if (childExistingPathAndValue != null) {\r\n                        var fullPath = new Path(front).child(childExistingPathAndValue.path);\r\n                        return { path: fullPath, value: childExistingPathAndValue.value };\r\n                    }\r\n                    else {\r\n                        return null;\r\n                    }\r\n                }\r\n                else {\r\n                    return null;\r\n                }\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Find, if it exists, the shortest subpath of the given path that points a defined\r\n     * value in the tree\r\n     * @param {!Path} relativePath\r\n     * @return {?{path: !Path, value: !T}}\r\n     */\r\n    ImmutableTree.prototype.findRootMostValueAndPath = function (relativePath) {\r\n        return this.findRootMostMatchingPathAndValue(relativePath, function () { return true; });\r\n    };\r\n    /**\r\n     * @param {!Path} relativePath\r\n     * @return {!ImmutableTree.<T>} The subtree at the given path\r\n     */\r\n    ImmutableTree.prototype.subtree = function (relativePath) {\r\n        if (relativePath.isEmpty()) {\r\n            return this;\r\n        }\r\n        else {\r\n            var front = relativePath.getFront();\r\n            var childTree = this.children.get(front);\r\n            if (childTree !== null) {\r\n                return childTree.subtree(relativePath.popFront());\r\n            }\r\n            else {\r\n                return ImmutableTree.Empty;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Sets a value at the specified path.\r\n     *\r\n     * @param {!Path} relativePath Path to set value at.\r\n     * @param {?T} toSet Value to set.\r\n     * @return {!ImmutableTree.<T>} Resulting tree.\r\n     */\r\n    ImmutableTree.prototype.set = function (relativePath, toSet) {\r\n        if (relativePath.isEmpty()) {\r\n            return new ImmutableTree(toSet, this.children);\r\n        }\r\n        else {\r\n            var front = relativePath.getFront();\r\n            var child = this.children.get(front) || ImmutableTree.Empty;\r\n            var newChild = child.set(relativePath.popFront(), toSet);\r\n            var newChildren = this.children.insert(front, newChild);\r\n            return new ImmutableTree(this.value, newChildren);\r\n        }\r\n    };\r\n    /**\r\n     * Removes the value at the specified path.\r\n     *\r\n     * @param {!Path} relativePath Path to value to remove.\r\n     * @return {!ImmutableTree.<T>} Resulting tree.\r\n     */\r\n    ImmutableTree.prototype.remove = function (relativePath) {\r\n        if (relativePath.isEmpty()) {\r\n            if (this.children.isEmpty()) {\r\n                return ImmutableTree.Empty;\r\n            }\r\n            else {\r\n                return new ImmutableTree(null, this.children);\r\n            }\r\n        }\r\n        else {\r\n            var front = relativePath.getFront();\r\n            var child = this.children.get(front);\r\n            if (child) {\r\n                var newChild = child.remove(relativePath.popFront());\r\n                var newChildren = void 0;\r\n                if (newChild.isEmpty()) {\r\n                    newChildren = this.children.remove(front);\r\n                }\r\n                else {\r\n                    newChildren = this.children.insert(front, newChild);\r\n                }\r\n                if (this.value === null && newChildren.isEmpty()) {\r\n                    return ImmutableTree.Empty;\r\n                }\r\n                else {\r\n                    return new ImmutableTree(this.value, newChildren);\r\n                }\r\n            }\r\n            else {\r\n                return this;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Gets a value from the tree.\r\n     *\r\n     * @param {!Path} relativePath Path to get value for.\r\n     * @return {?T} Value at path, or null.\r\n     */\r\n    ImmutableTree.prototype.get = function (relativePath) {\r\n        if (relativePath.isEmpty()) {\r\n            return this.value;\r\n        }\r\n        else {\r\n            var front = relativePath.getFront();\r\n            var child = this.children.get(front);\r\n            if (child) {\r\n                return child.get(relativePath.popFront());\r\n            }\r\n            else {\r\n                return null;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Replace the subtree at the specified path with the given new tree.\r\n     *\r\n     * @param {!Path} relativePath Path to replace subtree for.\r\n     * @param {!ImmutableTree} newTree New tree.\r\n     * @return {!ImmutableTree} Resulting tree.\r\n     */\r\n    ImmutableTree.prototype.setTree = function (relativePath, newTree) {\r\n        if (relativePath.isEmpty()) {\r\n            return newTree;\r\n        }\r\n        else {\r\n            var front = relativePath.getFront();\r\n            var child = this.children.get(front) || ImmutableTree.Empty;\r\n            var newChild = child.setTree(relativePath.popFront(), newTree);\r\n            var newChildren = void 0;\r\n            if (newChild.isEmpty()) {\r\n                newChildren = this.children.remove(front);\r\n            }\r\n            else {\r\n                newChildren = this.children.insert(front, newChild);\r\n            }\r\n            return new ImmutableTree(this.value, newChildren);\r\n        }\r\n    };\r\n    /**\r\n     * Performs a depth first fold on this tree. Transforms a tree into a single\r\n     * value, given a function that operates on the path to a node, an optional\r\n     * current value, and a map of child names to folded subtrees\r\n     * @template V\r\n     * @param {function(Path, ?T, Object.<string, V>):V} fn\r\n     * @return {V}\r\n     */\r\n    ImmutableTree.prototype.fold = function (fn) {\r\n        return this.fold_(Path.Empty, fn);\r\n    };\r\n    /**\r\n     * Recursive helper for public-facing fold() method\r\n     * @template V\r\n     * @param {!Path} pathSoFar\r\n     * @param {function(Path, ?T, Object.<string, V>):V} fn\r\n     * @return {V}\r\n     * @private\r\n     */\r\n    ImmutableTree.prototype.fold_ = function (pathSoFar, fn) {\r\n        var accum = {};\r\n        this.children.inorderTraversal(function (childKey, childTree) {\r\n            accum[childKey] = childTree.fold_(pathSoFar.child(childKey), fn);\r\n        });\r\n        return fn(pathSoFar, this.value, accum);\r\n    };\r\n    /**\r\n     * Find the first matching value on the given path. Return the result of applying f to it.\r\n     * @template V\r\n     * @param {!Path} path\r\n     * @param {!function(!Path, !T):?V} f\r\n     * @return {?V}\r\n     */\r\n    ImmutableTree.prototype.findOnPath = function (path, f) {\r\n        return this.findOnPath_(path, Path.Empty, f);\r\n    };\r\n    ImmutableTree.prototype.findOnPath_ = function (pathToFollow, pathSoFar, f) {\r\n        var result = this.value ? f(pathSoFar, this.value) : false;\r\n        if (result) {\r\n            return result;\r\n        }\r\n        else {\r\n            if (pathToFollow.isEmpty()) {\r\n                return null;\r\n            }\r\n            else {\r\n                var front = pathToFollow.getFront();\r\n                var nextChild = this.children.get(front);\r\n                if (nextChild) {\r\n                    return nextChild.findOnPath_(pathToFollow.popFront(), pathSoFar.child(front), f);\r\n                }\r\n                else {\r\n                    return null;\r\n                }\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!function(!Path, !T)} f\r\n     * @returns {!ImmutableTree.<T>}\r\n     */\r\n    ImmutableTree.prototype.foreachOnPath = function (path, f) {\r\n        return this.foreachOnPath_(path, Path.Empty, f);\r\n    };\r\n    ImmutableTree.prototype.foreachOnPath_ = function (pathToFollow, currentRelativePath, f) {\r\n        if (pathToFollow.isEmpty()) {\r\n            return this;\r\n        }\r\n        else {\r\n            if (this.value) {\r\n                f(currentRelativePath, this.value);\r\n            }\r\n            var front = pathToFollow.getFront();\r\n            var nextChild = this.children.get(front);\r\n            if (nextChild) {\r\n                return nextChild.foreachOnPath_(pathToFollow.popFront(), currentRelativePath.child(front), f);\r\n            }\r\n            else {\r\n                return ImmutableTree.Empty;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Calls the given function for each node in the tree that has a value.\r\n     *\r\n     * @param {function(!Path, !T)} f A function to be called with\r\n     *   the path from the root of the tree to a node, and the value at that node.\r\n     *   Called in depth-first order.\r\n     */\r\n    ImmutableTree.prototype.foreach = function (f) {\r\n        this.foreach_(Path.Empty, f);\r\n    };\r\n    ImmutableTree.prototype.foreach_ = function (currentRelativePath, f) {\r\n        this.children.inorderTraversal(function (childName, childTree) {\r\n            childTree.foreach_(currentRelativePath.child(childName), f);\r\n        });\r\n        if (this.value) {\r\n            f(currentRelativePath, this.value);\r\n        }\r\n    };\r\n    /**\r\n     *\r\n     * @param {function(string, !T)} f\r\n     */\r\n    ImmutableTree.prototype.foreachChild = function (f) {\r\n        this.children.inorderTraversal(function (childName, childTree) {\r\n            if (childTree.value) {\r\n                f(childName, childTree.value);\r\n            }\r\n        });\r\n    };\r\n    ImmutableTree.Empty = new ImmutableTree(null);\r\n    return ImmutableTree;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @param {!OperationSource} source\r\n * @param {!Path} path\r\n * @constructor\r\n * @implements {Operation}\r\n */\r\nvar ListenComplete = /** @class */ (function () {\r\n    function ListenComplete(source, path) {\r\n        this.source = source;\r\n        this.path = path;\r\n        /** @inheritDoc */\r\n        this.type = OperationType.LISTEN_COMPLETE;\r\n    }\r\n    ListenComplete.prototype.operationForChild = function (childName) {\r\n        if (this.path.isEmpty()) {\r\n            return new ListenComplete(this.source, Path.Empty);\r\n        }\r\n        else {\r\n            return new ListenComplete(this.source, this.path.popFront());\r\n        }\r\n    };\r\n    return ListenComplete;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @param {!OperationSource} source\r\n * @param {!Path} path\r\n * @param {!Node} snap\r\n * @constructor\r\n * @implements {Operation}\r\n */\r\nvar Overwrite = /** @class */ (function () {\r\n    function Overwrite(source, path, snap) {\r\n        this.source = source;\r\n        this.path = path;\r\n        this.snap = snap;\r\n        /** @inheritDoc */\r\n        this.type = OperationType.OVERWRITE;\r\n    }\r\n    Overwrite.prototype.operationForChild = function (childName) {\r\n        if (this.path.isEmpty()) {\r\n            return new Overwrite(this.source, Path.Empty, this.snap.getImmediateChild(childName));\r\n        }\r\n        else {\r\n            return new Overwrite(this.source, this.path.popFront(), this.snap);\r\n        }\r\n    };\r\n    return Overwrite;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @param {!OperationSource} source\r\n * @param {!Path} path\r\n * @param {!ImmutableTree.<!Node>} children\r\n * @constructor\r\n * @implements {Operation}\r\n */\r\nvar Merge = /** @class */ (function () {\r\n    function Merge(\r\n    /**@inheritDoc */ source, \r\n    /**@inheritDoc */ path, \r\n    /**@inheritDoc */ children) {\r\n        this.source = source;\r\n        this.path = path;\r\n        this.children = children;\r\n        /** @inheritDoc */\r\n        this.type = OperationType.MERGE;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    Merge.prototype.operationForChild = function (childName) {\r\n        if (this.path.isEmpty()) {\r\n            var childTree = this.children.subtree(new Path(childName));\r\n            if (childTree.isEmpty()) {\r\n                // This child is unaffected\r\n                return null;\r\n            }\r\n            else if (childTree.value) {\r\n                // We have a snapshot for the child in question.  This becomes an overwrite of the child.\r\n                return new Overwrite(this.source, Path.Empty, childTree.value);\r\n            }\r\n            else {\r\n                // This is a merge at a deeper level\r\n                return new Merge(this.source, Path.Empty, childTree);\r\n            }\r\n        }\r\n        else {\r\n            assert(this.path.getFront() === childName, \"Can't get a merge for a child not on the path of the operation\");\r\n            return new Merge(this.source, this.path.popFront(), this.children);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    Merge.prototype.toString = function () {\r\n        return ('Operation(' +\r\n            this.path +\r\n            ': ' +\r\n            this.source.toString() +\r\n            ' merge: ' +\r\n            this.children.toString() +\r\n            ')');\r\n    };\r\n    return Merge;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * A cache node only stores complete children. Additionally it holds a flag whether the node can be considered fully\r\n * initialized in the sense that we know at one point in time this represented a valid state of the world, e.g.\r\n * initialized with data from the server, or a complete overwrite by the client. The filtered flag also tracks\r\n * whether a node potentially had children removed due to a filter.\r\n */\r\nvar CacheNode = /** @class */ (function () {\r\n    /**\r\n     * @param {!Node} node_\r\n     * @param {boolean} fullyInitialized_\r\n     * @param {boolean} filtered_\r\n     */\r\n    function CacheNode(node_, fullyInitialized_, filtered_) {\r\n        this.node_ = node_;\r\n        this.fullyInitialized_ = fullyInitialized_;\r\n        this.filtered_ = filtered_;\r\n    }\r\n    /**\r\n     * Returns whether this node was fully initialized with either server data or a complete overwrite by the client\r\n     * @return {boolean}\r\n     */\r\n    CacheNode.prototype.isFullyInitialized = function () {\r\n        return this.fullyInitialized_;\r\n    };\r\n    /**\r\n     * Returns whether this node is potentially missing children due to a filter applied to the node\r\n     * @return {boolean}\r\n     */\r\n    CacheNode.prototype.isFiltered = function () {\r\n        return this.filtered_;\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @return {boolean}\r\n     */\r\n    CacheNode.prototype.isCompleteForPath = function (path) {\r\n        if (path.isEmpty()) {\r\n            return this.isFullyInitialized() && !this.filtered_;\r\n        }\r\n        var childKey = path.getFront();\r\n        return this.isCompleteForChild(childKey);\r\n    };\r\n    /**\r\n     * @param {!string} key\r\n     * @return {boolean}\r\n     */\r\n    CacheNode.prototype.isCompleteForChild = function (key) {\r\n        return ((this.isFullyInitialized() && !this.filtered_) || this.node_.hasChild(key));\r\n    };\r\n    /**\r\n     * @return {!Node}\r\n     */\r\n    CacheNode.prototype.getNode = function () {\r\n        return this.node_;\r\n    };\r\n    return CacheNode;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Stores the data we have cached for a view.\r\n *\r\n * serverSnap is the cached server data, eventSnap is the cached event data (server data plus any local writes).\r\n *\r\n * @constructor\r\n */\r\nvar ViewCache = /** @class */ (function () {\r\n    /**\r\n     *\r\n     * @param {!CacheNode} eventCache_\r\n     * @param {!CacheNode} serverCache_\r\n     */\r\n    function ViewCache(eventCache_, serverCache_) {\r\n        this.eventCache_ = eventCache_;\r\n        this.serverCache_ = serverCache_;\r\n    }\r\n    /**\r\n     * @param {!Node} eventSnap\r\n     * @param {boolean} complete\r\n     * @param {boolean} filtered\r\n     * @return {!ViewCache}\r\n     */\r\n    ViewCache.prototype.updateEventSnap = function (eventSnap, complete, filtered) {\r\n        return new ViewCache(new CacheNode(eventSnap, complete, filtered), this.serverCache_);\r\n    };\r\n    /**\r\n     * @param {!Node} serverSnap\r\n     * @param {boolean} complete\r\n     * @param {boolean} filtered\r\n     * @return {!ViewCache}\r\n     */\r\n    ViewCache.prototype.updateServerSnap = function (serverSnap, complete, filtered) {\r\n        return new ViewCache(this.eventCache_, new CacheNode(serverSnap, complete, filtered));\r\n    };\r\n    /**\r\n     * @return {!CacheNode}\r\n     */\r\n    ViewCache.prototype.getEventCache = function () {\r\n        return this.eventCache_;\r\n    };\r\n    /**\r\n     * @return {?Node}\r\n     */\r\n    ViewCache.prototype.getCompleteEventSnap = function () {\r\n        return this.eventCache_.isFullyInitialized()\r\n            ? this.eventCache_.getNode()\r\n            : null;\r\n    };\r\n    /**\r\n     * @return {!CacheNode}\r\n     */\r\n    ViewCache.prototype.getServerCache = function () {\r\n        return this.serverCache_;\r\n    };\r\n    /**\r\n     * @return {?Node}\r\n     */\r\n    ViewCache.prototype.getCompleteServerSnap = function () {\r\n        return this.serverCache_.isFullyInitialized()\r\n            ? this.serverCache_.getNode()\r\n            : null;\r\n    };\r\n    /**\r\n     * @const\r\n     * @type {ViewCache}\r\n     */\r\n    ViewCache.Empty = new ViewCache(new CacheNode(ChildrenNode.EMPTY_NODE, \r\n    /*fullyInitialized=*/ false, \r\n    /*filtered=*/ false), new CacheNode(ChildrenNode.EMPTY_NODE, \r\n    /*fullyInitialized=*/ false, \r\n    /*filtered=*/ false));\r\n    return ViewCache;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @constructor\r\n * @struct\r\n * @param {!string} type The event type\r\n * @param {!Node} snapshotNode The data\r\n * @param {string=} childName The name for this child, if it's a child event\r\n * @param {Node=} oldSnap Used for intermediate processing of child changed events\r\n * @param {string=} prevName The name for the previous child, if applicable\r\n */\r\nvar Change = /** @class */ (function () {\r\n    function Change(type, snapshotNode, childName, oldSnap, prevName) {\r\n        this.type = type;\r\n        this.snapshotNode = snapshotNode;\r\n        this.childName = childName;\r\n        this.oldSnap = oldSnap;\r\n        this.prevName = prevName;\r\n    }\r\n    /**\r\n     * @param {!Node} snapshot\r\n     * @return {!Change}\r\n     */\r\n    Change.valueChange = function (snapshot) {\r\n        return new Change(Change.VALUE, snapshot);\r\n    };\r\n    /**\r\n     * @param {string} childKey\r\n     * @param {!Node} snapshot\r\n     * @return {!Change}\r\n     */\r\n    Change.childAddedChange = function (childKey, snapshot) {\r\n        return new Change(Change.CHILD_ADDED, snapshot, childKey);\r\n    };\r\n    /**\r\n     * @param {string} childKey\r\n     * @param {!Node} snapshot\r\n     * @return {!Change}\r\n     */\r\n    Change.childRemovedChange = function (childKey, snapshot) {\r\n        return new Change(Change.CHILD_REMOVED, snapshot, childKey);\r\n    };\r\n    /**\r\n     * @param {string} childKey\r\n     * @param {!Node} newSnapshot\r\n     * @param {!Node} oldSnapshot\r\n     * @return {!Change}\r\n     */\r\n    Change.childChangedChange = function (childKey, newSnapshot, oldSnapshot) {\r\n        return new Change(Change.CHILD_CHANGED, newSnapshot, childKey, oldSnapshot);\r\n    };\r\n    /**\r\n     * @param {string} childKey\r\n     * @param {!Node} snapshot\r\n     * @return {!Change}\r\n     */\r\n    Change.childMovedChange = function (childKey, snapshot) {\r\n        return new Change(Change.CHILD_MOVED, snapshot, childKey);\r\n    };\r\n    //event types\r\n    /** Event type for a child added */\r\n    Change.CHILD_ADDED = 'child_added';\r\n    /** Event type for a child removed */\r\n    Change.CHILD_REMOVED = 'child_removed';\r\n    /** Event type for a child changed */\r\n    Change.CHILD_CHANGED = 'child_changed';\r\n    /** Event type for a child moved */\r\n    Change.CHILD_MOVED = 'child_moved';\r\n    /** Event type for a value change */\r\n    Change.VALUE = 'value';\r\n    return Change;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Doesn't really filter nodes but applies an index to the node and keeps track of any changes\r\n *\r\n * @constructor\r\n * @implements {NodeFilter}\r\n * @param {!Index} index\r\n */\r\nvar IndexedFilter = /** @class */ (function () {\r\n    function IndexedFilter(index_) {\r\n        this.index_ = index_;\r\n    }\r\n    IndexedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\r\n        assert(snap.isIndexed(this.index_), 'A node must be indexed if only a child is updated');\r\n        var oldChild = snap.getImmediateChild(key);\r\n        // Check if anything actually changed.\r\n        if (oldChild.getChild(affectedPath).equals(newChild.getChild(affectedPath))) {\r\n            // There's an edge case where a child can enter or leave the view because affectedPath was set to null.\r\n            // In this case, affectedPath will appear null in both the old and new snapshots.  So we need\r\n            // to avoid treating these cases as \"nothing changed.\"\r\n            if (oldChild.isEmpty() == newChild.isEmpty()) {\r\n                // Nothing changed.\r\n                // This assert should be valid, but it's expensive (can dominate perf testing) so don't actually do it.\r\n                //assert(oldChild.equals(newChild), 'Old and new snapshots should be equal.');\r\n                return snap;\r\n            }\r\n        }\r\n        if (optChangeAccumulator != null) {\r\n            if (newChild.isEmpty()) {\r\n                if (snap.hasChild(key)) {\r\n                    optChangeAccumulator.trackChildChange(Change.childRemovedChange(key, oldChild));\r\n                }\r\n                else {\r\n                    assert(snap.isLeafNode(), 'A child remove without an old child only makes sense on a leaf node');\r\n                }\r\n            }\r\n            else if (oldChild.isEmpty()) {\r\n                optChangeAccumulator.trackChildChange(Change.childAddedChange(key, newChild));\r\n            }\r\n            else {\r\n                optChangeAccumulator.trackChildChange(Change.childChangedChange(key, newChild, oldChild));\r\n            }\r\n        }\r\n        if (snap.isLeafNode() && newChild.isEmpty()) {\r\n            return snap;\r\n        }\r\n        else {\r\n            // Make sure the node is indexed\r\n            return snap.updateImmediateChild(key, newChild).withIndex(this.index_);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    IndexedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\r\n        if (optChangeAccumulator != null) {\r\n            if (!oldSnap.isLeafNode()) {\r\n                oldSnap.forEachChild(PRIORITY_INDEX, function (key, childNode) {\r\n                    if (!newSnap.hasChild(key)) {\r\n                        optChangeAccumulator.trackChildChange(Change.childRemovedChange(key, childNode));\r\n                    }\r\n                });\r\n            }\r\n            if (!newSnap.isLeafNode()) {\r\n                newSnap.forEachChild(PRIORITY_INDEX, function (key, childNode) {\r\n                    if (oldSnap.hasChild(key)) {\r\n                        var oldChild = oldSnap.getImmediateChild(key);\r\n                        if (!oldChild.equals(childNode)) {\r\n                            optChangeAccumulator.trackChildChange(Change.childChangedChange(key, childNode, oldChild));\r\n                        }\r\n                    }\r\n                    else {\r\n                        optChangeAccumulator.trackChildChange(Change.childAddedChange(key, childNode));\r\n                    }\r\n                });\r\n            }\r\n        }\r\n        return newSnap.withIndex(this.index_);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    IndexedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\r\n        if (oldSnap.isEmpty()) {\r\n            return ChildrenNode.EMPTY_NODE;\r\n        }\r\n        else {\r\n            return oldSnap.updatePriority(newPriority);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    IndexedFilter.prototype.filtersNodes = function () {\r\n        return false;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    IndexedFilter.prototype.getIndexedFilter = function () {\r\n        return this;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    IndexedFilter.prototype.getIndex = function () {\r\n        return this.index_;\r\n    };\r\n    return IndexedFilter;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @constructor\r\n */\r\nvar ChildChangeAccumulator = /** @class */ (function () {\r\n    function ChildChangeAccumulator() {\r\n        this.changeMap_ = {};\r\n    }\r\n    /**\r\n     * @param {!Change} change\r\n     */\r\n    ChildChangeAccumulator.prototype.trackChildChange = function (change) {\r\n        var type = change.type;\r\n        var childKey /** @type {!string} */ = change.childName;\r\n        assert(type == Change.CHILD_ADDED ||\r\n            type == Change.CHILD_CHANGED ||\r\n            type == Change.CHILD_REMOVED, 'Only child changes supported for tracking');\r\n        assert(childKey !== '.priority', 'Only non-priority child changes can be tracked.');\r\n        var oldChange = safeGet(this.changeMap_, childKey);\r\n        if (oldChange) {\r\n            var oldType = oldChange.type;\r\n            if (type == Change.CHILD_ADDED && oldType == Change.CHILD_REMOVED) {\r\n                this.changeMap_[childKey] = Change.childChangedChange(childKey, change.snapshotNode, oldChange.snapshotNode);\r\n            }\r\n            else if (type == Change.CHILD_REMOVED &&\r\n                oldType == Change.CHILD_ADDED) {\r\n                delete this.changeMap_[childKey];\r\n            }\r\n            else if (type == Change.CHILD_REMOVED &&\r\n                oldType == Change.CHILD_CHANGED) {\r\n                this.changeMap_[childKey] = Change.childRemovedChange(childKey, oldChange.oldSnap);\r\n            }\r\n            else if (type == Change.CHILD_CHANGED &&\r\n                oldType == Change.CHILD_ADDED) {\r\n                this.changeMap_[childKey] = Change.childAddedChange(childKey, change.snapshotNode);\r\n            }\r\n            else if (type == Change.CHILD_CHANGED &&\r\n                oldType == Change.CHILD_CHANGED) {\r\n                this.changeMap_[childKey] = Change.childChangedChange(childKey, change.snapshotNode, oldChange.oldSnap);\r\n            }\r\n            else {\r\n                throw assertionError('Illegal combination of changes: ' +\r\n                    change +\r\n                    ' occurred after ' +\r\n                    oldChange);\r\n            }\r\n        }\r\n        else {\r\n            this.changeMap_[childKey] = change;\r\n        }\r\n    };\r\n    /**\r\n     * @return {!Array.<!Change>}\r\n     */\r\n    ChildChangeAccumulator.prototype.getChanges = function () {\r\n        return getValues(this.changeMap_);\r\n    };\r\n    return ChildChangeAccumulator;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * An implementation of CompleteChildSource that never returns any additional children\r\n *\r\n * @private\r\n * @constructor\r\n * @implements CompleteChildSource\r\n */\r\nvar NoCompleteChildSource_ = /** @class */ (function () {\r\n    function NoCompleteChildSource_() {\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    NoCompleteChildSource_.prototype.getCompleteChild = function (childKey) {\r\n        return null;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    NoCompleteChildSource_.prototype.getChildAfterChild = function (index, child, reverse) {\r\n        return null;\r\n    };\r\n    return NoCompleteChildSource_;\r\n}());\r\n/**\r\n * Singleton instance.\r\n * @const\r\n * @type {!CompleteChildSource}\r\n */\r\nvar NO_COMPLETE_CHILD_SOURCE = new NoCompleteChildSource_();\r\n/**\r\n * An implementation of CompleteChildSource that uses a WriteTree in addition to any other server data or\r\n * old event caches available to calculate complete children.\r\n *\r\n *\r\n * @implements CompleteChildSource\r\n */\r\nvar WriteTreeCompleteChildSource = /** @class */ (function () {\r\n    /**\r\n     * @param {!WriteTreeRef} writes_\r\n     * @param {!ViewCache} viewCache_\r\n     * @param {?Node} optCompleteServerCache_\r\n     */\r\n    function WriteTreeCompleteChildSource(writes_, viewCache_, optCompleteServerCache_) {\r\n        if (optCompleteServerCache_ === void 0) { optCompleteServerCache_ = null; }\r\n        this.writes_ = writes_;\r\n        this.viewCache_ = viewCache_;\r\n        this.optCompleteServerCache_ = optCompleteServerCache_;\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    WriteTreeCompleteChildSource.prototype.getCompleteChild = function (childKey) {\r\n        var node = this.viewCache_.getEventCache();\r\n        if (node.isCompleteForChild(childKey)) {\r\n            return node.getNode().getImmediateChild(childKey);\r\n        }\r\n        else {\r\n            var serverNode = this.optCompleteServerCache_ != null\r\n                ? new CacheNode(this.optCompleteServerCache_, true, false)\r\n                : this.viewCache_.getServerCache();\r\n            return this.writes_.calcCompleteChild(childKey, serverNode);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    WriteTreeCompleteChildSource.prototype.getChildAfterChild = function (index, child, reverse) {\r\n        var completeServerData = this.optCompleteServerCache_ != null\r\n            ? this.optCompleteServerCache_\r\n            : this.viewCache_.getCompleteServerSnap();\r\n        var nodes = this.writes_.calcIndexedSlice(completeServerData, child, 1, reverse, index);\r\n        if (nodes.length === 0) {\r\n            return null;\r\n        }\r\n        else {\r\n            return nodes[0];\r\n        }\r\n    };\r\n    return WriteTreeCompleteChildSource;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @constructor\r\n * @struct\r\n */\r\nvar ProcessorResult = /** @class */ (function () {\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Array.<!Change>} changes\r\n     */\r\n    function ProcessorResult(viewCache, changes) {\r\n        this.viewCache = viewCache;\r\n        this.changes = changes;\r\n    }\r\n    return ProcessorResult;\r\n}());\r\n/**\r\n * @constructor\r\n */\r\nvar ViewProcessor = /** @class */ (function () {\r\n    /**\r\n     * @param {!NodeFilter} filter_\r\n     */\r\n    function ViewProcessor(filter_) {\r\n        this.filter_ = filter_;\r\n    }\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     */\r\n    ViewProcessor.prototype.assertIndexed = function (viewCache) {\r\n        assert(viewCache\r\n            .getEventCache()\r\n            .getNode()\r\n            .isIndexed(this.filter_.getIndex()), 'Event snap not indexed');\r\n        assert(viewCache\r\n            .getServerCache()\r\n            .getNode()\r\n            .isIndexed(this.filter_.getIndex()), 'Server snap not indexed');\r\n    };\r\n    /**\r\n     * @param {!ViewCache} oldViewCache\r\n     * @param {!Operation} operation\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} completeCache\r\n     * @return {!ProcessorResult}\r\n     */\r\n    ViewProcessor.prototype.applyOperation = function (oldViewCache, operation, writesCache, completeCache) {\r\n        var accumulator = new ChildChangeAccumulator();\r\n        var newViewCache, filterServerNode;\r\n        if (operation.type === OperationType.OVERWRITE) {\r\n            var overwrite = operation;\r\n            if (overwrite.source.fromUser) {\r\n                newViewCache = this.applyUserOverwrite_(oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, accumulator);\r\n            }\r\n            else {\r\n                assert(overwrite.source.fromServer, 'Unknown source.');\r\n                // We filter the node if it's a tagged update or the node has been previously filtered  and the\r\n                // update is not at the root in which case it is ok (and necessary) to mark the node unfiltered\r\n                // again\r\n                filterServerNode =\r\n                    overwrite.source.tagged ||\r\n                        (oldViewCache.getServerCache().isFiltered() &&\r\n                            !overwrite.path.isEmpty());\r\n                newViewCache = this.applyServerOverwrite_(oldViewCache, overwrite.path, overwrite.snap, writesCache, completeCache, filterServerNode, accumulator);\r\n            }\r\n        }\r\n        else if (operation.type === OperationType.MERGE) {\r\n            var merge = operation;\r\n            if (merge.source.fromUser) {\r\n                newViewCache = this.applyUserMerge_(oldViewCache, merge.path, merge.children, writesCache, completeCache, accumulator);\r\n            }\r\n            else {\r\n                assert(merge.source.fromServer, 'Unknown source.');\r\n                // We filter the node if it's a tagged update or the node has been previously filtered\r\n                filterServerNode =\r\n                    merge.source.tagged || oldViewCache.getServerCache().isFiltered();\r\n                newViewCache = this.applyServerMerge_(oldViewCache, merge.path, merge.children, writesCache, completeCache, filterServerNode, accumulator);\r\n            }\r\n        }\r\n        else if (operation.type === OperationType.ACK_USER_WRITE) {\r\n            var ackUserWrite = operation;\r\n            if (!ackUserWrite.revert) {\r\n                newViewCache = this.ackUserWrite_(oldViewCache, ackUserWrite.path, ackUserWrite.affectedTree, writesCache, completeCache, accumulator);\r\n            }\r\n            else {\r\n                newViewCache = this.revertUserWrite_(oldViewCache, ackUserWrite.path, writesCache, completeCache, accumulator);\r\n            }\r\n        }\r\n        else if (operation.type === OperationType.LISTEN_COMPLETE) {\r\n            newViewCache = this.listenComplete_(oldViewCache, operation.path, writesCache, accumulator);\r\n        }\r\n        else {\r\n            throw assertionError('Unknown operation type: ' + operation.type);\r\n        }\r\n        var changes = accumulator.getChanges();\r\n        ViewProcessor.maybeAddValueEvent_(oldViewCache, newViewCache, changes);\r\n        return new ProcessorResult(newViewCache, changes);\r\n    };\r\n    /**\r\n     * @param {!ViewCache} oldViewCache\r\n     * @param {!ViewCache} newViewCache\r\n     * @param {!Array.<!Change>} accumulator\r\n     * @private\r\n     */\r\n    ViewProcessor.maybeAddValueEvent_ = function (oldViewCache, newViewCache, accumulator) {\r\n        var eventSnap = newViewCache.getEventCache();\r\n        if (eventSnap.isFullyInitialized()) {\r\n            var isLeafOrEmpty = eventSnap.getNode().isLeafNode() || eventSnap.getNode().isEmpty();\r\n            var oldCompleteSnap = oldViewCache.getCompleteEventSnap();\r\n            if (accumulator.length > 0 ||\r\n                !oldViewCache.getEventCache().isFullyInitialized() ||\r\n                (isLeafOrEmpty &&\r\n                    !eventSnap\r\n                        .getNode()\r\n                        .equals(/** @type {!Node} */ (oldCompleteSnap))) ||\r\n                !eventSnap\r\n                    .getNode()\r\n                    .getPriority()\r\n                    .equals(oldCompleteSnap.getPriority())) {\r\n                accumulator.push(Change.valueChange(\r\n                /** @type {!Node} */ newViewCache.getCompleteEventSnap()));\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Path} changePath\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {!CompleteChildSource} source\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.generateEventCacheAfterServerEvent_ = function (viewCache, changePath, writesCache, source, accumulator) {\r\n        var oldEventSnap = viewCache.getEventCache();\r\n        if (writesCache.shadowingWrite(changePath) != null) {\r\n            // we have a shadowing write, ignore changes\r\n            return viewCache;\r\n        }\r\n        else {\r\n            var newEventCache = void 0, serverNode = void 0;\r\n            if (changePath.isEmpty()) {\r\n                // TODO: figure out how this plays with \"sliding ack windows\"\r\n                assert(viewCache.getServerCache().isFullyInitialized(), 'If change path is empty, we must have complete server data');\r\n                if (viewCache.getServerCache().isFiltered()) {\r\n                    // We need to special case this, because we need to only apply writes to complete children, or\r\n                    // we might end up raising events for incomplete children. If the server data is filtered deep\r\n                    // writes cannot be guaranteed to be complete\r\n                    var serverCache = viewCache.getCompleteServerSnap();\r\n                    var completeChildren = serverCache instanceof ChildrenNode\r\n                        ? serverCache\r\n                        : ChildrenNode.EMPTY_NODE;\r\n                    var completeEventChildren = writesCache.calcCompleteEventChildren(completeChildren);\r\n                    newEventCache = this.filter_.updateFullNode(viewCache.getEventCache().getNode(), completeEventChildren, accumulator);\r\n                }\r\n                else {\r\n                    var completeNode = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\r\n                    newEventCache = this.filter_.updateFullNode(viewCache.getEventCache().getNode(), completeNode, accumulator);\r\n                }\r\n            }\r\n            else {\r\n                var childKey = changePath.getFront();\r\n                if (childKey == '.priority') {\r\n                    assert(changePath.getLength() == 1, \"Can't have a priority with additional path components\");\r\n                    var oldEventNode = oldEventSnap.getNode();\r\n                    serverNode = viewCache.getServerCache().getNode();\r\n                    // we might have overwrites for this priority\r\n                    var updatedPriority = writesCache.calcEventCacheAfterServerOverwrite(changePath, oldEventNode, serverNode);\r\n                    if (updatedPriority != null) {\r\n                        newEventCache = this.filter_.updatePriority(oldEventNode, updatedPriority);\r\n                    }\r\n                    else {\r\n                        // priority didn't change, keep old node\r\n                        newEventCache = oldEventSnap.getNode();\r\n                    }\r\n                }\r\n                else {\r\n                    var childChangePath = changePath.popFront();\r\n                    // update child\r\n                    var newEventChild = void 0;\r\n                    if (oldEventSnap.isCompleteForChild(childKey)) {\r\n                        serverNode = viewCache.getServerCache().getNode();\r\n                        var eventChildUpdate = writesCache.calcEventCacheAfterServerOverwrite(changePath, oldEventSnap.getNode(), serverNode);\r\n                        if (eventChildUpdate != null) {\r\n                            newEventChild = oldEventSnap\r\n                                .getNode()\r\n                                .getImmediateChild(childKey)\r\n                                .updateChild(childChangePath, eventChildUpdate);\r\n                        }\r\n                        else {\r\n                            // Nothing changed, just keep the old child\r\n                            newEventChild = oldEventSnap\r\n                                .getNode()\r\n                                .getImmediateChild(childKey);\r\n                        }\r\n                    }\r\n                    else {\r\n                        newEventChild = writesCache.calcCompleteChild(childKey, viewCache.getServerCache());\r\n                    }\r\n                    if (newEventChild != null) {\r\n                        newEventCache = this.filter_.updateChild(oldEventSnap.getNode(), childKey, newEventChild, childChangePath, source, accumulator);\r\n                    }\r\n                    else {\r\n                        // no complete child available or no change\r\n                        newEventCache = oldEventSnap.getNode();\r\n                    }\r\n                }\r\n            }\r\n            return viewCache.updateEventSnap(newEventCache, oldEventSnap.isFullyInitialized() || changePath.isEmpty(), this.filter_.filtersNodes());\r\n        }\r\n    };\r\n    /**\r\n     * @param {!ViewCache} oldViewCache\r\n     * @param {!Path} changePath\r\n     * @param {!Node} changedSnap\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} completeCache\r\n     * @param {boolean} filterServerNode\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.applyServerOverwrite_ = function (oldViewCache, changePath, changedSnap, writesCache, completeCache, filterServerNode, accumulator) {\r\n        var oldServerSnap = oldViewCache.getServerCache();\r\n        var newServerCache;\r\n        var serverFilter = filterServerNode\r\n            ? this.filter_\r\n            : this.filter_.getIndexedFilter();\r\n        if (changePath.isEmpty()) {\r\n            newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), changedSnap, null);\r\n        }\r\n        else if (serverFilter.filtersNodes() && !oldServerSnap.isFiltered()) {\r\n            // we want to filter the server node, but we didn't filter the server node yet, so simulate a full update\r\n            var newServerNode = oldServerSnap\r\n                .getNode()\r\n                .updateChild(changePath, changedSnap);\r\n            newServerCache = serverFilter.updateFullNode(oldServerSnap.getNode(), newServerNode, null);\r\n        }\r\n        else {\r\n            var childKey = changePath.getFront();\r\n            if (!oldServerSnap.isCompleteForPath(changePath) &&\r\n                changePath.getLength() > 1) {\r\n                // We don't update incomplete nodes with updates intended for other listeners\r\n                return oldViewCache;\r\n            }\r\n            var childChangePath = changePath.popFront();\r\n            var childNode = oldServerSnap.getNode().getImmediateChild(childKey);\r\n            var newChildNode = childNode.updateChild(childChangePath, changedSnap);\r\n            if (childKey == '.priority') {\r\n                newServerCache = serverFilter.updatePriority(oldServerSnap.getNode(), newChildNode);\r\n            }\r\n            else {\r\n                newServerCache = serverFilter.updateChild(oldServerSnap.getNode(), childKey, newChildNode, childChangePath, NO_COMPLETE_CHILD_SOURCE, null);\r\n            }\r\n        }\r\n        var newViewCache = oldViewCache.updateServerSnap(newServerCache, oldServerSnap.isFullyInitialized() || changePath.isEmpty(), serverFilter.filtersNodes());\r\n        var source = new WriteTreeCompleteChildSource(writesCache, newViewCache, completeCache);\r\n        return this.generateEventCacheAfterServerEvent_(newViewCache, changePath, writesCache, source, accumulator);\r\n    };\r\n    /**\r\n     * @param {!ViewCache} oldViewCache\r\n     * @param {!Path} changePath\r\n     * @param {!Node} changedSnap\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} completeCache\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.applyUserOverwrite_ = function (oldViewCache, changePath, changedSnap, writesCache, completeCache, accumulator) {\r\n        var oldEventSnap = oldViewCache.getEventCache();\r\n        var newViewCache, newEventCache;\r\n        var source = new WriteTreeCompleteChildSource(writesCache, oldViewCache, completeCache);\r\n        if (changePath.isEmpty()) {\r\n            newEventCache = this.filter_.updateFullNode(oldViewCache.getEventCache().getNode(), changedSnap, accumulator);\r\n            newViewCache = oldViewCache.updateEventSnap(newEventCache, true, this.filter_.filtersNodes());\r\n        }\r\n        else {\r\n            var childKey = changePath.getFront();\r\n            if (childKey === '.priority') {\r\n                newEventCache = this.filter_.updatePriority(oldViewCache.getEventCache().getNode(), changedSnap);\r\n                newViewCache = oldViewCache.updateEventSnap(newEventCache, oldEventSnap.isFullyInitialized(), oldEventSnap.isFiltered());\r\n            }\r\n            else {\r\n                var childChangePath = changePath.popFront();\r\n                var oldChild = oldEventSnap.getNode().getImmediateChild(childKey);\r\n                var newChild = void 0;\r\n                if (childChangePath.isEmpty()) {\r\n                    // Child overwrite, we can replace the child\r\n                    newChild = changedSnap;\r\n                }\r\n                else {\r\n                    var childNode = source.getCompleteChild(childKey);\r\n                    if (childNode != null) {\r\n                        if (childChangePath.getBack() === '.priority' &&\r\n                            childNode.getChild(childChangePath.parent()).isEmpty()) {\r\n                            // This is a priority update on an empty node. If this node exists on the server, the\r\n                            // server will send down the priority in the update, so ignore for now\r\n                            newChild = childNode;\r\n                        }\r\n                        else {\r\n                            newChild = childNode.updateChild(childChangePath, changedSnap);\r\n                        }\r\n                    }\r\n                    else {\r\n                        // There is no complete child node available\r\n                        newChild = ChildrenNode.EMPTY_NODE;\r\n                    }\r\n                }\r\n                if (!oldChild.equals(newChild)) {\r\n                    var newEventSnap = this.filter_.updateChild(oldEventSnap.getNode(), childKey, newChild, childChangePath, source, accumulator);\r\n                    newViewCache = oldViewCache.updateEventSnap(newEventSnap, oldEventSnap.isFullyInitialized(), this.filter_.filtersNodes());\r\n                }\r\n                else {\r\n                    newViewCache = oldViewCache;\r\n                }\r\n            }\r\n        }\r\n        return newViewCache;\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {string} childKey\r\n     * @return {boolean}\r\n     * @private\r\n     */\r\n    ViewProcessor.cacheHasChild_ = function (viewCache, childKey) {\r\n        return viewCache.getEventCache().isCompleteForChild(childKey);\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Path} path\r\n     * @param {ImmutableTree.<!Node>} changedChildren\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} serverCache\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.applyUserMerge_ = function (viewCache, path, changedChildren, writesCache, serverCache, accumulator) {\r\n        var _this = this;\r\n        // HACK: In the case of a limit query, there may be some changes that bump things out of the\r\n        // window leaving room for new items.  It's important we process these changes first, so we\r\n        // iterate the changes twice, first processing any that affect items currently in view.\r\n        // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\r\n        // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\r\n        // not the other.\r\n        var curViewCache = viewCache;\r\n        changedChildren.foreach(function (relativePath, childNode) {\r\n            var writePath = path.child(relativePath);\r\n            if (ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\r\n                curViewCache = _this.applyUserOverwrite_(curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\r\n            }\r\n        });\r\n        changedChildren.foreach(function (relativePath, childNode) {\r\n            var writePath = path.child(relativePath);\r\n            if (!ViewProcessor.cacheHasChild_(viewCache, writePath.getFront())) {\r\n                curViewCache = _this.applyUserOverwrite_(curViewCache, writePath, childNode, writesCache, serverCache, accumulator);\r\n            }\r\n        });\r\n        return curViewCache;\r\n    };\r\n    /**\r\n     * @param {!Node} node\r\n     * @param {ImmutableTree.<!Node>} merge\r\n     * @return {!Node}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.applyMerge_ = function (node, merge) {\r\n        merge.foreach(function (relativePath, childNode) {\r\n            node = node.updateChild(relativePath, childNode);\r\n        });\r\n        return node;\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Path} path\r\n     * @param {!ImmutableTree.<!Node>} changedChildren\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} serverCache\r\n     * @param {boolean} filterServerNode\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.applyServerMerge_ = function (viewCache, path, changedChildren, writesCache, serverCache, filterServerNode, accumulator) {\r\n        var _this = this;\r\n        // If we don't have a cache yet, this merge was intended for a previously listen in the same location. Ignore it and\r\n        // wait for the complete data update coming soon.\r\n        if (viewCache\r\n            .getServerCache()\r\n            .getNode()\r\n            .isEmpty() &&\r\n            !viewCache.getServerCache().isFullyInitialized()) {\r\n            return viewCache;\r\n        }\r\n        // HACK: In the case of a limit query, there may be some changes that bump things out of the\r\n        // window leaving room for new items.  It's important we process these changes first, so we\r\n        // iterate the changes twice, first processing any that affect items currently in view.\r\n        // TODO: I consider an item \"in view\" if cacheHasChild is true, which checks both the server\r\n        // and event snap.  I'm not sure if this will result in edge cases when a child is in one but\r\n        // not the other.\r\n        var curViewCache = viewCache;\r\n        var viewMergeTree;\r\n        if (path.isEmpty()) {\r\n            viewMergeTree = changedChildren;\r\n        }\r\n        else {\r\n            viewMergeTree = ImmutableTree.Empty.setTree(path, changedChildren);\r\n        }\r\n        var serverNode = viewCache.getServerCache().getNode();\r\n        viewMergeTree.children.inorderTraversal(function (childKey, childTree) {\r\n            if (serverNode.hasChild(childKey)) {\r\n                var serverChild = viewCache\r\n                    .getServerCache()\r\n                    .getNode()\r\n                    .getImmediateChild(childKey);\r\n                var newChild = _this.applyMerge_(serverChild, childTree);\r\n                curViewCache = _this.applyServerOverwrite_(curViewCache, new Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\r\n            }\r\n        });\r\n        viewMergeTree.children.inorderTraversal(function (childKey, childMergeTree) {\r\n            var isUnknownDeepMerge = !viewCache.getServerCache().isCompleteForChild(childKey) &&\r\n                childMergeTree.value == null;\r\n            if (!serverNode.hasChild(childKey) && !isUnknownDeepMerge) {\r\n                var serverChild = viewCache\r\n                    .getServerCache()\r\n                    .getNode()\r\n                    .getImmediateChild(childKey);\r\n                var newChild = _this.applyMerge_(serverChild, childMergeTree);\r\n                curViewCache = _this.applyServerOverwrite_(curViewCache, new Path(childKey), newChild, writesCache, serverCache, filterServerNode, accumulator);\r\n            }\r\n        });\r\n        return curViewCache;\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Path} ackPath\r\n     * @param {!ImmutableTree<!boolean>} affectedTree\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} completeCache\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.ackUserWrite_ = function (viewCache, ackPath, affectedTree, writesCache, completeCache, accumulator) {\r\n        if (writesCache.shadowingWrite(ackPath) != null) {\r\n            return viewCache;\r\n        }\r\n        // Only filter server node if it is currently filtered\r\n        var filterServerNode = viewCache.getServerCache().isFiltered();\r\n        // Essentially we'll just get our existing server cache for the affected paths and re-apply it as a server update\r\n        // now that it won't be shadowed.\r\n        var serverCache = viewCache.getServerCache();\r\n        if (affectedTree.value != null) {\r\n            // This is an overwrite.\r\n            if ((ackPath.isEmpty() && serverCache.isFullyInitialized()) ||\r\n                serverCache.isCompleteForPath(ackPath)) {\r\n                return this.applyServerOverwrite_(viewCache, ackPath, serverCache.getNode().getChild(ackPath), writesCache, completeCache, filterServerNode, accumulator);\r\n            }\r\n            else if (ackPath.isEmpty()) {\r\n                // This is a goofy edge case where we are acking data at this location but don't have full data.  We\r\n                // should just re-apply whatever we have in our cache as a merge.\r\n                var changedChildren_1 = ImmutableTree.Empty;\r\n                serverCache.getNode().forEachChild(KEY_INDEX, function (name, node) {\r\n                    changedChildren_1 = changedChildren_1.set(new Path(name), node);\r\n                });\r\n                return this.applyServerMerge_(viewCache, ackPath, changedChildren_1, writesCache, completeCache, filterServerNode, accumulator);\r\n            }\r\n            else {\r\n                return viewCache;\r\n            }\r\n        }\r\n        else {\r\n            // This is a merge.\r\n            var changedChildren_2 = ImmutableTree.Empty;\r\n            affectedTree.foreach(function (mergePath, value) {\r\n                var serverCachePath = ackPath.child(mergePath);\r\n                if (serverCache.isCompleteForPath(serverCachePath)) {\r\n                    changedChildren_2 = changedChildren_2.set(mergePath, serverCache.getNode().getChild(serverCachePath));\r\n                }\r\n            });\r\n            return this.applyServerMerge_(viewCache, ackPath, changedChildren_2, writesCache, completeCache, filterServerNode, accumulator);\r\n        }\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Path} path\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.listenComplete_ = function (viewCache, path, writesCache, accumulator) {\r\n        var oldServerNode = viewCache.getServerCache();\r\n        var newViewCache = viewCache.updateServerSnap(oldServerNode.getNode(), oldServerNode.isFullyInitialized() || path.isEmpty(), oldServerNode.isFiltered());\r\n        return this.generateEventCacheAfterServerEvent_(newViewCache, path, writesCache, NO_COMPLETE_CHILD_SOURCE, accumulator);\r\n    };\r\n    /**\r\n     * @param {!ViewCache} viewCache\r\n     * @param {!Path} path\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} completeServerCache\r\n     * @param {!ChildChangeAccumulator} accumulator\r\n     * @return {!ViewCache}\r\n     * @private\r\n     */\r\n    ViewProcessor.prototype.revertUserWrite_ = function (viewCache, path, writesCache, completeServerCache, accumulator) {\r\n        var complete;\r\n        if (writesCache.shadowingWrite(path) != null) {\r\n            return viewCache;\r\n        }\r\n        else {\r\n            var source = new WriteTreeCompleteChildSource(writesCache, viewCache, completeServerCache);\r\n            var oldEventCache = viewCache.getEventCache().getNode();\r\n            var newEventCache = void 0;\r\n            if (path.isEmpty() || path.getFront() === '.priority') {\r\n                var newNode = void 0;\r\n                if (viewCache.getServerCache().isFullyInitialized()) {\r\n                    newNode = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\r\n                }\r\n                else {\r\n                    var serverChildren = viewCache.getServerCache().getNode();\r\n                    assert(serverChildren instanceof ChildrenNode, 'serverChildren would be complete if leaf node');\r\n                    newNode = writesCache.calcCompleteEventChildren(serverChildren);\r\n                }\r\n                newNode = newNode;\r\n                newEventCache = this.filter_.updateFullNode(oldEventCache, newNode, accumulator);\r\n            }\r\n            else {\r\n                var childKey = path.getFront();\r\n                var newChild = writesCache.calcCompleteChild(childKey, viewCache.getServerCache());\r\n                if (newChild == null &&\r\n                    viewCache.getServerCache().isCompleteForChild(childKey)) {\r\n                    newChild = oldEventCache.getImmediateChild(childKey);\r\n                }\r\n                if (newChild != null) {\r\n                    newEventCache = this.filter_.updateChild(oldEventCache, childKey, newChild, path.popFront(), source, accumulator);\r\n                }\r\n                else if (viewCache\r\n                    .getEventCache()\r\n                    .getNode()\r\n                    .hasChild(childKey)) {\r\n                    // No complete child available, delete the existing one, if any\r\n                    newEventCache = this.filter_.updateChild(oldEventCache, childKey, ChildrenNode.EMPTY_NODE, path.popFront(), source, accumulator);\r\n                }\r\n                else {\r\n                    newEventCache = oldEventCache;\r\n                }\r\n                if (newEventCache.isEmpty() &&\r\n                    viewCache.getServerCache().isFullyInitialized()) {\r\n                    // We might have reverted all child writes. Maybe the old event was a leaf node\r\n                    complete = writesCache.calcCompleteEventCache(viewCache.getCompleteServerSnap());\r\n                    if (complete.isLeafNode()) {\r\n                        newEventCache = this.filter_.updateFullNode(newEventCache, complete, accumulator);\r\n                    }\r\n                }\r\n            }\r\n            complete =\r\n                viewCache.getServerCache().isFullyInitialized() ||\r\n                    writesCache.shadowingWrite(Path.Empty) != null;\r\n            return viewCache.updateEventSnap(newEventCache, complete, this.filter_.filtersNodes());\r\n        }\r\n    };\r\n    return ViewProcessor;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * An EventGenerator is used to convert \"raw\" changes (Change) as computed by the\r\n * CacheDiffer into actual events (Event) that can be raised.  See generateEventsForChanges()\r\n * for details.\r\n *\r\n * @constructor\r\n */\r\nvar EventGenerator = /** @class */ (function () {\r\n    /**\r\n     *\r\n     * @param {!Query} query_\r\n     */\r\n    function EventGenerator(query_) {\r\n        this.query_ = query_;\r\n        /**\r\n         * @private\r\n         * @type {!Index}\r\n         */\r\n        this.index_ = this.query_.getQueryParams().getIndex();\r\n    }\r\n    /**\r\n     * Given a set of raw changes (no moved events and prevName not specified yet), and a set of\r\n     * EventRegistrations that should be notified of these changes, generate the actual events to be raised.\r\n     *\r\n     * Notes:\r\n     *  - child_moved events will be synthesized at this time for any child_changed events that affect\r\n     *    our index.\r\n     *  - prevName will be calculated based on the index ordering.\r\n     *\r\n     * @param {!Array.<!Change>} changes\r\n     * @param {!Node} eventCache\r\n     * @param {!Array.<!EventRegistration>} eventRegistrations\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    EventGenerator.prototype.generateEventsForChanges = function (changes, eventCache, eventRegistrations) {\r\n        var _this = this;\r\n        var events = [];\r\n        var moves = [];\r\n        changes.forEach(function (change) {\r\n            if (change.type === Change.CHILD_CHANGED &&\r\n                _this.index_.indexedValueChanged(change.oldSnap, change.snapshotNode)) {\r\n                moves.push(Change.childMovedChange(change.childName, change.snapshotNode));\r\n            }\r\n        });\r\n        this.generateEventsForType_(events, Change.CHILD_REMOVED, changes, eventRegistrations, eventCache);\r\n        this.generateEventsForType_(events, Change.CHILD_ADDED, changes, eventRegistrations, eventCache);\r\n        this.generateEventsForType_(events, Change.CHILD_MOVED, moves, eventRegistrations, eventCache);\r\n        this.generateEventsForType_(events, Change.CHILD_CHANGED, changes, eventRegistrations, eventCache);\r\n        this.generateEventsForType_(events, Change.VALUE, changes, eventRegistrations, eventCache);\r\n        return events;\r\n    };\r\n    /**\r\n     * Given changes of a single change type, generate the corresponding events.\r\n     *\r\n     * @param {!Array.<!Event>} events\r\n     * @param {!string} eventType\r\n     * @param {!Array.<!Change>} changes\r\n     * @param {!Array.<!EventRegistration>} registrations\r\n     * @param {!Node} eventCache\r\n     * @private\r\n     */\r\n    EventGenerator.prototype.generateEventsForType_ = function (events, eventType, changes, registrations, eventCache) {\r\n        var _this = this;\r\n        var filteredChanges = changes.filter(function (change) { return change.type === eventType; });\r\n        filteredChanges.sort(this.compareChanges_.bind(this));\r\n        filteredChanges.forEach(function (change) {\r\n            var materializedChange = _this.materializeSingleChange_(change, eventCache);\r\n            registrations.forEach(function (registration) {\r\n                if (registration.respondsTo(change.type)) {\r\n                    events.push(registration.createEvent(materializedChange, _this.query_));\r\n                }\r\n            });\r\n        });\r\n    };\r\n    /**\r\n     * @param {!Change} change\r\n     * @param {!Node} eventCache\r\n     * @return {!Change}\r\n     * @private\r\n     */\r\n    EventGenerator.prototype.materializeSingleChange_ = function (change, eventCache) {\r\n        if (change.type === 'value' || change.type === 'child_removed') {\r\n            return change;\r\n        }\r\n        else {\r\n            change.prevName = eventCache.getPredecessorChildName(\r\n            /** @type {!string} */\r\n            change.childName, change.snapshotNode, this.index_);\r\n            return change;\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Change} a\r\n     * @param {!Change} b\r\n     * @return {number}\r\n     * @private\r\n     */\r\n    EventGenerator.prototype.compareChanges_ = function (a, b) {\r\n        if (a.childName == null || b.childName == null) {\r\n            throw assertionError('Should only compare child_ events.');\r\n        }\r\n        var aWrapped = new NamedNode(a.childName, a.snapshotNode);\r\n        var bWrapped = new NamedNode(b.childName, b.snapshotNode);\r\n        return this.index_.compare(aWrapped, bWrapped);\r\n    };\r\n    return EventGenerator;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * A view represents a specific location and query that has 1 or more event registrations.\r\n *\r\n * It does several things:\r\n *  - Maintains the list of event registrations for this location/query.\r\n *  - Maintains a cache of the data visible for this location/query.\r\n *  - Applies new operations (via applyOperation), updates the cache, and based on the event\r\n *    registrations returns the set of events to be raised.\r\n * @constructor\r\n */\r\nvar View = /** @class */ (function () {\r\n    /**\r\n     *\r\n     * @param {!Query} query_\r\n     * @param {!ViewCache} initialViewCache\r\n     */\r\n    function View(query_, initialViewCache) {\r\n        this.query_ = query_;\r\n        this.eventRegistrations_ = [];\r\n        var params = this.query_.getQueryParams();\r\n        var indexFilter = new IndexedFilter(params.getIndex());\r\n        var filter = params.getNodeFilter();\r\n        /**\r\n         * @type {ViewProcessor}\r\n         * @private\r\n         */\r\n        this.processor_ = new ViewProcessor(filter);\r\n        var initialServerCache = initialViewCache.getServerCache();\r\n        var initialEventCache = initialViewCache.getEventCache();\r\n        // Don't filter server node with other filter than index, wait for tagged listen\r\n        var serverSnap = indexFilter.updateFullNode(ChildrenNode.EMPTY_NODE, initialServerCache.getNode(), null);\r\n        var eventSnap = filter.updateFullNode(ChildrenNode.EMPTY_NODE, initialEventCache.getNode(), null);\r\n        var newServerCache = new CacheNode(serverSnap, initialServerCache.isFullyInitialized(), indexFilter.filtersNodes());\r\n        var newEventCache = new CacheNode(eventSnap, initialEventCache.isFullyInitialized(), filter.filtersNodes());\r\n        /**\r\n         * @type {!ViewCache}\r\n         * @private\r\n         */\r\n        this.viewCache_ = new ViewCache(newEventCache, newServerCache);\r\n        /**\r\n         * @type {!EventGenerator}\r\n         * @private\r\n         */\r\n        this.eventGenerator_ = new EventGenerator(this.query_);\r\n    }\r\n    /**\r\n     * @return {!Query}\r\n     */\r\n    View.prototype.getQuery = function () {\r\n        return this.query_;\r\n    };\r\n    /**\r\n     * @return {?Node}\r\n     */\r\n    View.prototype.getServerCache = function () {\r\n        return this.viewCache_.getServerCache().getNode();\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @return {?Node}\r\n     */\r\n    View.prototype.getCompleteServerCache = function (path) {\r\n        var cache = this.viewCache_.getCompleteServerSnap();\r\n        if (cache) {\r\n            // If this isn't a \"loadsAllData\" view, then cache isn't actually a complete cache and\r\n            // we need to see if it contains the child we're interested in.\r\n            if (this.query_.getQueryParams().loadsAllData() ||\r\n                (!path.isEmpty() && !cache.getImmediateChild(path.getFront()).isEmpty())) {\r\n                return cache.getChild(path);\r\n            }\r\n        }\r\n        return null;\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    View.prototype.isEmpty = function () {\r\n        return this.eventRegistrations_.length === 0;\r\n    };\r\n    /**\r\n     * @param {!EventRegistration} eventRegistration\r\n     */\r\n    View.prototype.addEventRegistration = function (eventRegistration) {\r\n        this.eventRegistrations_.push(eventRegistration);\r\n    };\r\n    /**\r\n     * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\r\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\r\n     * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\r\n     */\r\n    View.prototype.removeEventRegistration = function (eventRegistration, cancelError) {\r\n        var cancelEvents = [];\r\n        if (cancelError) {\r\n            assert(eventRegistration == null, 'A cancel should cancel all event registrations.');\r\n            var path_1 = this.query_.path;\r\n            this.eventRegistrations_.forEach(function (registration) {\r\n                cancelError /** @type {!Error} */ = cancelError;\r\n                var maybeEvent = registration.createCancelEvent(cancelError, path_1);\r\n                if (maybeEvent) {\r\n                    cancelEvents.push(maybeEvent);\r\n                }\r\n            });\r\n        }\r\n        if (eventRegistration) {\r\n            var remaining = [];\r\n            for (var i = 0; i < this.eventRegistrations_.length; ++i) {\r\n                var existing = this.eventRegistrations_[i];\r\n                if (!existing.matches(eventRegistration)) {\r\n                    remaining.push(existing);\r\n                }\r\n                else if (eventRegistration.hasAnyCallback()) {\r\n                    // We're removing just this one\r\n                    remaining = remaining.concat(this.eventRegistrations_.slice(i + 1));\r\n                    break;\r\n                }\r\n            }\r\n            this.eventRegistrations_ = remaining;\r\n        }\r\n        else {\r\n            this.eventRegistrations_ = [];\r\n        }\r\n        return cancelEvents;\r\n    };\r\n    /**\r\n     * Applies the given Operation, updates our cache, and returns the appropriate events.\r\n     *\r\n     * @param {!Operation} operation\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} completeServerCache\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    View.prototype.applyOperation = function (operation, writesCache, completeServerCache) {\r\n        if (operation.type === OperationType.MERGE &&\r\n            operation.source.queryId !== null) {\r\n            assert(this.viewCache_.getCompleteServerSnap(), 'We should always have a full cache before handling merges');\r\n            assert(this.viewCache_.getCompleteEventSnap(), 'Missing event cache, even though we have a server cache');\r\n        }\r\n        var oldViewCache = this.viewCache_;\r\n        var result = this.processor_.applyOperation(oldViewCache, operation, writesCache, completeServerCache);\r\n        this.processor_.assertIndexed(result.viewCache);\r\n        assert(result.viewCache.getServerCache().isFullyInitialized() ||\r\n            !oldViewCache.getServerCache().isFullyInitialized(), 'Once a server snap is complete, it should never go back');\r\n        this.viewCache_ = result.viewCache;\r\n        return this.generateEventsForChanges_(result.changes, result.viewCache.getEventCache().getNode(), null);\r\n    };\r\n    /**\r\n     * @param {!EventRegistration} registration\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    View.prototype.getInitialEvents = function (registration) {\r\n        var eventSnap = this.viewCache_.getEventCache();\r\n        var initialChanges = [];\r\n        if (!eventSnap.getNode().isLeafNode()) {\r\n            var eventNode = eventSnap.getNode();\r\n            eventNode.forEachChild(PRIORITY_INDEX, function (key, childNode) {\r\n                initialChanges.push(Change.childAddedChange(key, childNode));\r\n            });\r\n        }\r\n        if (eventSnap.isFullyInitialized()) {\r\n            initialChanges.push(Change.valueChange(eventSnap.getNode()));\r\n        }\r\n        return this.generateEventsForChanges_(initialChanges, eventSnap.getNode(), registration);\r\n    };\r\n    /**\r\n     * @private\r\n     * @param {!Array.<!Change>} changes\r\n     * @param {!Node} eventCache\r\n     * @param {EventRegistration=} eventRegistration\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    View.prototype.generateEventsForChanges_ = function (changes, eventCache, eventRegistration) {\r\n        var registrations = eventRegistration\r\n            ? [eventRegistration]\r\n            : this.eventRegistrations_;\r\n        return this.eventGenerator_.generateEventsForChanges(changes, eventCache, registrations);\r\n    };\r\n    return View;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar __referenceConstructor$1;\r\n/**\r\n * SyncPoint represents a single location in a SyncTree with 1 or more event registrations, meaning we need to\r\n * maintain 1 or more Views at this location to cache server data and raise appropriate events for server changes\r\n * and user writes (set, transaction, update).\r\n *\r\n * It's responsible for:\r\n *  - Maintaining the set of 1 or more views necessary at this location (a SyncPoint with 0 views should be removed).\r\n *  - Proxying user / server operations to the views as appropriate (i.e. applyServerOverwrite,\r\n *    applyUserOverwrite, etc.)\r\n */\r\nvar SyncPoint = /** @class */ (function () {\r\n    function SyncPoint() {\r\n        /**\r\n         * The Views being tracked at this location in the tree, stored as a map where the key is a\r\n         * queryId and the value is the View for that query.\r\n         *\r\n         * NOTE: This list will be quite small (usually 1, but perhaps 2 or 3; any more is an odd use case).\r\n         *\r\n         * @type {!Object.<!string, !View>}\r\n         * @private\r\n         */\r\n        this.views_ = {};\r\n    }\r\n    Object.defineProperty(SyncPoint, \"__referenceConstructor\", {\r\n        get: function () {\r\n            assert(__referenceConstructor$1, 'Reference.ts has not been loaded');\r\n            return __referenceConstructor$1;\r\n        },\r\n        set: function (val) {\r\n            assert(!__referenceConstructor$1, '__referenceConstructor has already been defined');\r\n            __referenceConstructor$1 = val;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    SyncPoint.prototype.isEmpty = function () {\r\n        return isEmpty(this.views_);\r\n    };\r\n    /**\r\n     *\r\n     * @param {!Operation} operation\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} optCompleteServerCache\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    SyncPoint.prototype.applyOperation = function (operation, writesCache, optCompleteServerCache) {\r\n        var queryId = operation.source.queryId;\r\n        if (queryId !== null) {\r\n            var view = safeGet(this.views_, queryId);\r\n            assert(view != null, 'SyncTree gave us an op for an invalid query.');\r\n            return view.applyOperation(operation, writesCache, optCompleteServerCache);\r\n        }\r\n        else {\r\n            var events_1 = [];\r\n            forEach(this.views_, function (key, view) {\r\n                events_1 = events_1.concat(view.applyOperation(operation, writesCache, optCompleteServerCache));\r\n            });\r\n            return events_1;\r\n        }\r\n    };\r\n    /**\r\n     * Add an event callback for the specified query.\r\n     *\r\n     * @param {!Query} query\r\n     * @param {!EventRegistration} eventRegistration\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @param {?Node} serverCache Complete server cache, if we have it.\r\n     * @param {boolean} serverCacheComplete\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncPoint.prototype.addEventRegistration = function (query, eventRegistration, writesCache, serverCache, serverCacheComplete) {\r\n        var queryId = query.queryIdentifier();\r\n        var view = safeGet(this.views_, queryId);\r\n        if (!view) {\r\n            // TODO: make writesCache take flag for complete server node\r\n            var eventCache = writesCache.calcCompleteEventCache(serverCacheComplete ? serverCache : null);\r\n            var eventCacheComplete = false;\r\n            if (eventCache) {\r\n                eventCacheComplete = true;\r\n            }\r\n            else if (serverCache instanceof ChildrenNode) {\r\n                eventCache = writesCache.calcCompleteEventChildren(serverCache);\r\n                eventCacheComplete = false;\r\n            }\r\n            else {\r\n                eventCache = ChildrenNode.EMPTY_NODE;\r\n                eventCacheComplete = false;\r\n            }\r\n            var viewCache = new ViewCache(new CacheNode(\r\n            /** @type {!Node} */ (eventCache), eventCacheComplete, false), new CacheNode(\r\n            /** @type {!Node} */ (serverCache), serverCacheComplete, false));\r\n            view = new View(query, viewCache);\r\n            this.views_[queryId] = view;\r\n        }\r\n        // This is guaranteed to exist now, we just created anything that was missing\r\n        view.addEventRegistration(eventRegistration);\r\n        return view.getInitialEvents(eventRegistration);\r\n    };\r\n    /**\r\n     * Remove event callback(s).  Return cancelEvents if a cancelError is specified.\r\n     *\r\n     * If query is the default query, we'll check all views for the specified eventRegistration.\r\n     * If eventRegistration is null, we'll remove all callbacks for the specified view(s).\r\n     *\r\n     * @param {!Query} query\r\n     * @param {?EventRegistration} eventRegistration If null, remove all callbacks.\r\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\r\n     * @return {{removed:!Array.<!Query>, events:!Array.<!Event>}} removed queries and any cancel events\r\n     */\r\n    SyncPoint.prototype.removeEventRegistration = function (query, eventRegistration, cancelError) {\r\n        var queryId = query.queryIdentifier();\r\n        var removed = [];\r\n        var cancelEvents = [];\r\n        var hadCompleteView = this.hasCompleteView();\r\n        if (queryId === 'default') {\r\n            // When you do ref.off(...), we search all views for the registration to remove.\r\n            var self_1 = this;\r\n            forEach(this.views_, function (viewQueryId, view) {\r\n                cancelEvents = cancelEvents.concat(view.removeEventRegistration(eventRegistration, cancelError));\r\n                if (view.isEmpty()) {\r\n                    delete self_1.views_[viewQueryId];\r\n                    // We'll deal with complete views later.\r\n                    if (!view\r\n                        .getQuery()\r\n                        .getQueryParams()\r\n                        .loadsAllData()) {\r\n                        removed.push(view.getQuery());\r\n                    }\r\n                }\r\n            });\r\n        }\r\n        else {\r\n            // remove the callback from the specific view.\r\n            var view = safeGet(this.views_, queryId);\r\n            if (view) {\r\n                cancelEvents = cancelEvents.concat(view.removeEventRegistration(eventRegistration, cancelError));\r\n                if (view.isEmpty()) {\r\n                    delete this.views_[queryId];\r\n                    // We'll deal with complete views later.\r\n                    if (!view\r\n                        .getQuery()\r\n                        .getQueryParams()\r\n                        .loadsAllData()) {\r\n                        removed.push(view.getQuery());\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        if (hadCompleteView && !this.hasCompleteView()) {\r\n            // We removed our last complete view.\r\n            removed.push(new SyncPoint.__referenceConstructor(query.repo, query.path));\r\n        }\r\n        return { removed: removed, events: cancelEvents };\r\n    };\r\n    /**\r\n     * @return {!Array.<!View>}\r\n     */\r\n    SyncPoint.prototype.getQueryViews = function () {\r\n        var _this = this;\r\n        var values = Object.keys(this.views_).map(function (key) { return _this.views_[key]; });\r\n        return values.filter(function (view) {\r\n            return !view\r\n                .getQuery()\r\n                .getQueryParams()\r\n                .loadsAllData();\r\n        });\r\n    };\r\n    /**\r\n     *\r\n     * @param {!Path} path The path to the desired complete snapshot\r\n     * @return {?Node} A complete cache, if it exists\r\n     */\r\n    SyncPoint.prototype.getCompleteServerCache = function (path) {\r\n        var serverCache = null;\r\n        forEach(this.views_, function (key, view) {\r\n            serverCache = serverCache || view.getCompleteServerCache(path);\r\n        });\r\n        return serverCache;\r\n    };\r\n    /**\r\n     * @param {!Query} query\r\n     * @return {?View}\r\n     */\r\n    SyncPoint.prototype.viewForQuery = function (query) {\r\n        var params = query.getQueryParams();\r\n        if (params.loadsAllData()) {\r\n            return this.getCompleteView();\r\n        }\r\n        else {\r\n            var queryId = query.queryIdentifier();\r\n            return safeGet(this.views_, queryId);\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Query} query\r\n     * @return {boolean}\r\n     */\r\n    SyncPoint.prototype.viewExistsForQuery = function (query) {\r\n        return this.viewForQuery(query) != null;\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    SyncPoint.prototype.hasCompleteView = function () {\r\n        return this.getCompleteView() != null;\r\n    };\r\n    /**\r\n     * @return {?View}\r\n     */\r\n    SyncPoint.prototype.getCompleteView = function () {\r\n        var completeView = findValue(this.views_, function (view) {\r\n            return view\r\n                .getQuery()\r\n                .getQueryParams()\r\n                .loadsAllData();\r\n        });\r\n        return completeView || null;\r\n    };\r\n    return SyncPoint;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * This class holds a collection of writes that can be applied to nodes in unison. It abstracts away the logic with\r\n * dealing with priority writes and multiple nested writes. At any given path there is only allowed to be one write\r\n * modifying that path. Any write to an existing path or shadowing an existing path will modify that existing write\r\n * to reflect the write added.\r\n *\r\n * @constructor\r\n * @param {!ImmutableTree.<!Node>} writeTree\r\n */\r\nvar CompoundWrite = /** @class */ (function () {\r\n    function CompoundWrite(writeTree_) {\r\n        this.writeTree_ = writeTree_;\r\n    }\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {!Node} node\r\n     * @return {!CompoundWrite}\r\n     */\r\n    CompoundWrite.prototype.addWrite = function (path, node) {\r\n        if (path.isEmpty()) {\r\n            return new CompoundWrite(new ImmutableTree(node));\r\n        }\r\n        else {\r\n            var rootmost = this.writeTree_.findRootMostValueAndPath(path);\r\n            if (rootmost != null) {\r\n                var rootMostPath = rootmost.path;\r\n                var value = rootmost.value;\r\n                var relativePath = Path.relativePath(rootMostPath, path);\r\n                value = value.updateChild(relativePath, node);\r\n                return new CompoundWrite(this.writeTree_.set(rootMostPath, value));\r\n            }\r\n            else {\r\n                var subtree = new ImmutableTree(node);\r\n                var newWriteTree = this.writeTree_.setTree(path, subtree);\r\n                return new CompoundWrite(newWriteTree);\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {!Object.<string, !Node>} updates\r\n     * @return {!CompoundWrite}\r\n     */\r\n    CompoundWrite.prototype.addWrites = function (path, updates) {\r\n        var newWrite = this;\r\n        forEach(updates, function (childKey, node) {\r\n            newWrite = newWrite.addWrite(path.child(childKey), node);\r\n        });\r\n        return newWrite;\r\n    };\r\n    /**\r\n     * Will remove a write at the given path and deeper paths. This will <em>not</em> modify a write at a higher\r\n     * location, which must be removed by calling this method with that path.\r\n     *\r\n     * @param {!Path} path The path at which a write and all deeper writes should be removed\r\n     * @return {!CompoundWrite} The new CompoundWrite with the removed path\r\n     */\r\n    CompoundWrite.prototype.removeWrite = function (path) {\r\n        if (path.isEmpty()) {\r\n            return CompoundWrite.Empty;\r\n        }\r\n        else {\r\n            var newWriteTree = this.writeTree_.setTree(path, ImmutableTree.Empty);\r\n            return new CompoundWrite(newWriteTree);\r\n        }\r\n    };\r\n    /**\r\n     * Returns whether this CompoundWrite will fully overwrite a node at a given location and can therefore be\r\n     * considered \"complete\".\r\n     *\r\n     * @param {!Path} path The path to check for\r\n     * @return {boolean} Whether there is a complete write at that path\r\n     */\r\n    CompoundWrite.prototype.hasCompleteWrite = function (path) {\r\n        return this.getCompleteNode(path) != null;\r\n    };\r\n    /**\r\n     * Returns a node for a path if and only if the node is a \"complete\" overwrite at that path. This will not aggregate\r\n     * writes from deeper paths, but will return child nodes from a more shallow path.\r\n     *\r\n     * @param {!Path} path The path to get a complete write\r\n     * @return {?Node} The node if complete at that path, or null otherwise.\r\n     */\r\n    CompoundWrite.prototype.getCompleteNode = function (path) {\r\n        var rootmost = this.writeTree_.findRootMostValueAndPath(path);\r\n        if (rootmost != null) {\r\n            return this.writeTree_\r\n                .get(rootmost.path)\r\n                .getChild(Path.relativePath(rootmost.path, path));\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    /**\r\n     * Returns all children that are guaranteed to be a complete overwrite.\r\n     *\r\n     * @return {!Array.<NamedNode>} A list of all complete children.\r\n     */\r\n    CompoundWrite.prototype.getCompleteChildren = function () {\r\n        var children = [];\r\n        var node = this.writeTree_.value;\r\n        if (node != null) {\r\n            // If it's a leaf node, it has no children; so nothing to do.\r\n            if (!node.isLeafNode()) {\r\n                node.forEachChild(PRIORITY_INDEX, function (childName, childNode) {\r\n                    children.push(new NamedNode(childName, childNode));\r\n                });\r\n            }\r\n        }\r\n        else {\r\n            this.writeTree_.children.inorderTraversal(function (childName, childTree) {\r\n                if (childTree.value != null) {\r\n                    children.push(new NamedNode(childName, childTree.value));\r\n                }\r\n            });\r\n        }\r\n        return children;\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @return {!CompoundWrite}\r\n     */\r\n    CompoundWrite.prototype.childCompoundWrite = function (path) {\r\n        if (path.isEmpty()) {\r\n            return this;\r\n        }\r\n        else {\r\n            var shadowingNode = this.getCompleteNode(path);\r\n            if (shadowingNode != null) {\r\n                return new CompoundWrite(new ImmutableTree(shadowingNode));\r\n            }\r\n            else {\r\n                return new CompoundWrite(this.writeTree_.subtree(path));\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Returns true if this CompoundWrite is empty and therefore does not modify any nodes.\r\n     * @return {boolean} Whether this CompoundWrite is empty\r\n     */\r\n    CompoundWrite.prototype.isEmpty = function () {\r\n        return this.writeTree_.isEmpty();\r\n    };\r\n    /**\r\n     * Applies this CompoundWrite to a node. The node is returned with all writes from this CompoundWrite applied to the\r\n     * node\r\n     * @param {!Node} node The node to apply this CompoundWrite to\r\n     * @return {!Node} The node with all writes applied\r\n     */\r\n    CompoundWrite.prototype.apply = function (node) {\r\n        return CompoundWrite.applySubtreeWrite_(Path.Empty, this.writeTree_, node);\r\n    };\r\n    /**\r\n     * @type {!CompoundWrite}\r\n     */\r\n    CompoundWrite.Empty = new CompoundWrite(new ImmutableTree(null));\r\n    /**\r\n     * @param {!Path} relativePath\r\n     * @param {!ImmutableTree.<!Node>} writeTree\r\n     * @param {!Node} node\r\n     * @return {!Node}\r\n     * @private\r\n     */\r\n    CompoundWrite.applySubtreeWrite_ = function (relativePath, writeTree, node) {\r\n        if (writeTree.value != null) {\r\n            // Since there a write is always a leaf, we're done here\r\n            return node.updateChild(relativePath, writeTree.value);\r\n        }\r\n        else {\r\n            var priorityWrite_1 = null;\r\n            writeTree.children.inorderTraversal(function (childKey, childTree) {\r\n                if (childKey === '.priority') {\r\n                    // Apply priorities at the end so we don't update priorities for either empty nodes or forget\r\n                    // to apply priorities to empty nodes that are later filled\r\n                    assert(childTree.value !== null, 'Priority writes must always be leaf nodes');\r\n                    priorityWrite_1 = childTree.value;\r\n                }\r\n                else {\r\n                    node = CompoundWrite.applySubtreeWrite_(relativePath.child(childKey), childTree, node);\r\n                }\r\n            });\r\n            // If there was a priority write, we only apply it if the node is not empty\r\n            if (!node.getChild(relativePath).isEmpty() && priorityWrite_1 !== null) {\r\n                node = node.updateChild(relativePath.child('.priority'), priorityWrite_1);\r\n            }\r\n            return node;\r\n        }\r\n    };\r\n    return CompoundWrite;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * WriteTree tracks all pending user-initiated writes and has methods to calculate the result of merging them\r\n * with underlying server data (to create \"event cache\" data).  Pending writes are added with addOverwrite()\r\n * and addMerge(), and removed with removeWrite().\r\n *\r\n * @constructor\r\n */\r\nvar WriteTree = /** @class */ (function () {\r\n    function WriteTree() {\r\n        /**\r\n         * A tree tracking the result of applying all visible writes.  This does not include transactions with\r\n         * applyLocally=false or writes that are completely shadowed by other writes.\r\n         *\r\n         * @type {!CompoundWrite}\r\n         * @private\r\n         */\r\n        this.visibleWrites_ = CompoundWrite.Empty;\r\n        /**\r\n         * A list of all pending writes, regardless of visibility and shadowed-ness.  Used to calculate arbitrary\r\n         * sets of the changed data, such as hidden writes (from transactions) or changes with certain writes excluded (also\r\n         * used by transactions).\r\n         *\r\n         * @type {!Array.<!WriteRecord>}\r\n         * @private\r\n         */\r\n        this.allWrites_ = [];\r\n        this.lastWriteId_ = -1;\r\n    }\r\n    /**\r\n     * Create a new WriteTreeRef for the given path. For use with a new sync point at the given path.\r\n     *\r\n     * @param {!Path} path\r\n     * @return {!WriteTreeRef}\r\n     */\r\n    WriteTree.prototype.childWrites = function (path) {\r\n        return new WriteTreeRef(path, this);\r\n    };\r\n    /**\r\n     * Record a new overwrite from user code.\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Node} snap\r\n     * @param {!number} writeId\r\n     * @param {boolean=} visible This is set to false by some transactions. It should be excluded from event caches\r\n     */\r\n    WriteTree.prototype.addOverwrite = function (path, snap, writeId, visible) {\r\n        assert(writeId > this.lastWriteId_, 'Stacking an older write on top of newer ones');\r\n        if (visible === undefined) {\r\n            visible = true;\r\n        }\r\n        this.allWrites_.push({\r\n            path: path,\r\n            snap: snap,\r\n            writeId: writeId,\r\n            visible: visible\r\n        });\r\n        if (visible) {\r\n            this.visibleWrites_ = this.visibleWrites_.addWrite(path, snap);\r\n        }\r\n        this.lastWriteId_ = writeId;\r\n    };\r\n    /**\r\n     * Record a new merge from user code.\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Object.<string, !Node>} changedChildren\r\n     * @param {!number} writeId\r\n     */\r\n    WriteTree.prototype.addMerge = function (path, changedChildren, writeId) {\r\n        assert(writeId > this.lastWriteId_, 'Stacking an older merge on top of newer ones');\r\n        this.allWrites_.push({\r\n            path: path,\r\n            children: changedChildren,\r\n            writeId: writeId,\r\n            visible: true\r\n        });\r\n        this.visibleWrites_ = this.visibleWrites_.addWrites(path, changedChildren);\r\n        this.lastWriteId_ = writeId;\r\n    };\r\n    /**\r\n     * @param {!number} writeId\r\n     * @return {?WriteRecord}\r\n     */\r\n    WriteTree.prototype.getWrite = function (writeId) {\r\n        for (var i = 0; i < this.allWrites_.length; i++) {\r\n            var record = this.allWrites_[i];\r\n            if (record.writeId === writeId) {\r\n                return record;\r\n            }\r\n        }\r\n        return null;\r\n    };\r\n    /**\r\n     * Remove a write (either an overwrite or merge) that has been successfully acknowledge by the server. Recalculates\r\n     * the tree if necessary.  We return true if it may have been visible, meaning views need to reevaluate.\r\n     *\r\n     * @param {!number} writeId\r\n     * @return {boolean} true if the write may have been visible (meaning we'll need to reevaluate / raise\r\n     * events as a result).\r\n     */\r\n    WriteTree.prototype.removeWrite = function (writeId) {\r\n        // Note: disabling this check. It could be a transaction that preempted another transaction, and thus was applied\r\n        // out of order.\r\n        //const validClear = revert || this.allWrites_.length === 0 || writeId <= this.allWrites_[0].writeId;\r\n        //assert(validClear, \"Either we don't have this write, or it's the first one in the queue\");\r\n        var _this = this;\r\n        var idx = this.allWrites_.findIndex(function (s) {\r\n            return s.writeId === writeId;\r\n        });\r\n        assert(idx >= 0, 'removeWrite called with nonexistent writeId.');\r\n        var writeToRemove = this.allWrites_[idx];\r\n        this.allWrites_.splice(idx, 1);\r\n        var removedWriteWasVisible = writeToRemove.visible;\r\n        var removedWriteOverlapsWithOtherWrites = false;\r\n        var i = this.allWrites_.length - 1;\r\n        while (removedWriteWasVisible && i >= 0) {\r\n            var currentWrite = this.allWrites_[i];\r\n            if (currentWrite.visible) {\r\n                if (i >= idx &&\r\n                    this.recordContainsPath_(currentWrite, writeToRemove.path)) {\r\n                    // The removed write was completely shadowed by a subsequent write.\r\n                    removedWriteWasVisible = false;\r\n                }\r\n                else if (writeToRemove.path.contains(currentWrite.path)) {\r\n                    // Either we're covering some writes or they're covering part of us (depending on which came first).\r\n                    removedWriteOverlapsWithOtherWrites = true;\r\n                }\r\n            }\r\n            i--;\r\n        }\r\n        if (!removedWriteWasVisible) {\r\n            return false;\r\n        }\r\n        else if (removedWriteOverlapsWithOtherWrites) {\r\n            // There's some shadowing going on. Just rebuild the visible writes from scratch.\r\n            this.resetTree_();\r\n            return true;\r\n        }\r\n        else {\r\n            // There's no shadowing.  We can safely just remove the write(s) from visibleWrites.\r\n            if (writeToRemove.snap) {\r\n                this.visibleWrites_ = this.visibleWrites_.removeWrite(writeToRemove.path);\r\n            }\r\n            else {\r\n                var children = writeToRemove.children;\r\n                forEach(children, function (childName) {\r\n                    _this.visibleWrites_ = _this.visibleWrites_.removeWrite(writeToRemove.path.child(childName));\r\n                });\r\n            }\r\n            return true;\r\n        }\r\n    };\r\n    /**\r\n     * Return a complete snapshot for the given path if there's visible write data at that path, else null.\r\n     * No server data is considered.\r\n     *\r\n     * @param {!Path} path\r\n     * @return {?Node}\r\n     */\r\n    WriteTree.prototype.getCompleteWriteData = function (path) {\r\n        return this.visibleWrites_.getCompleteNode(path);\r\n    };\r\n    /**\r\n     * Given optional, underlying server data, and an optional set of constraints (exclude some sets, include hidden\r\n     * writes), attempt to calculate a complete snapshot for the given path\r\n     *\r\n     * @param {!Path} treePath\r\n     * @param {?Node} completeServerCache\r\n     * @param {Array.<number>=} writeIdsToExclude An optional set to be excluded\r\n     * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\r\n     * @return {?Node}\r\n     */\r\n    WriteTree.prototype.calcCompleteEventCache = function (treePath, completeServerCache, writeIdsToExclude, includeHiddenWrites) {\r\n        if (!writeIdsToExclude && !includeHiddenWrites) {\r\n            var shadowingNode = this.visibleWrites_.getCompleteNode(treePath);\r\n            if (shadowingNode != null) {\r\n                return shadowingNode;\r\n            }\r\n            else {\r\n                var subMerge = this.visibleWrites_.childCompoundWrite(treePath);\r\n                if (subMerge.isEmpty()) {\r\n                    return completeServerCache;\r\n                }\r\n                else if (completeServerCache == null &&\r\n                    !subMerge.hasCompleteWrite(Path.Empty)) {\r\n                    // We wouldn't have a complete snapshot, since there's no underlying data and no complete shadow\r\n                    return null;\r\n                }\r\n                else {\r\n                    var layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\r\n                    return subMerge.apply(layeredCache);\r\n                }\r\n            }\r\n        }\r\n        else {\r\n            var merge = this.visibleWrites_.childCompoundWrite(treePath);\r\n            if (!includeHiddenWrites && merge.isEmpty()) {\r\n                return completeServerCache;\r\n            }\r\n            else {\r\n                // If the server cache is null, and we don't have a complete cache, we need to return null\r\n                if (!includeHiddenWrites &&\r\n                    completeServerCache == null &&\r\n                    !merge.hasCompleteWrite(Path.Empty)) {\r\n                    return null;\r\n                }\r\n                else {\r\n                    var filter = function (write) {\r\n                        return ((write.visible || includeHiddenWrites) &&\r\n                            (!writeIdsToExclude ||\r\n                                !~writeIdsToExclude.indexOf(write.writeId)) &&\r\n                            (write.path.contains(treePath) || treePath.contains(write.path)));\r\n                    };\r\n                    var mergeAtPath = WriteTree.layerTree_(this.allWrites_, filter, treePath);\r\n                    var layeredCache = completeServerCache || ChildrenNode.EMPTY_NODE;\r\n                    return mergeAtPath.apply(layeredCache);\r\n                }\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * With optional, underlying server data, attempt to return a children node of children that we have complete data for.\r\n     * Used when creating new views, to pre-fill their complete event children snapshot.\r\n     *\r\n     * @param {!Path} treePath\r\n     * @param {?ChildrenNode} completeServerChildren\r\n     * @return {!ChildrenNode}\r\n     */\r\n    WriteTree.prototype.calcCompleteEventChildren = function (treePath, completeServerChildren) {\r\n        var completeChildren = ChildrenNode.EMPTY_NODE;\r\n        var topLevelSet = this.visibleWrites_.getCompleteNode(treePath);\r\n        if (topLevelSet) {\r\n            if (!topLevelSet.isLeafNode()) {\r\n                // we're shadowing everything. Return the children.\r\n                topLevelSet.forEachChild(PRIORITY_INDEX, function (childName, childSnap) {\r\n                    completeChildren = completeChildren.updateImmediateChild(childName, childSnap);\r\n                });\r\n            }\r\n            return completeChildren;\r\n        }\r\n        else if (completeServerChildren) {\r\n            // Layer any children we have on top of this\r\n            // We know we don't have a top-level set, so just enumerate existing children\r\n            var merge_1 = this.visibleWrites_.childCompoundWrite(treePath);\r\n            completeServerChildren.forEachChild(PRIORITY_INDEX, function (childName, childNode) {\r\n                var node = merge_1\r\n                    .childCompoundWrite(new Path(childName))\r\n                    .apply(childNode);\r\n                completeChildren = completeChildren.updateImmediateChild(childName, node);\r\n            });\r\n            // Add any complete children we have from the set\r\n            merge_1.getCompleteChildren().forEach(function (namedNode) {\r\n                completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\r\n            });\r\n            return completeChildren;\r\n        }\r\n        else {\r\n            // We don't have anything to layer on top of. Layer on any children we have\r\n            // Note that we can return an empty snap if we have a defined delete\r\n            var merge = this.visibleWrites_.childCompoundWrite(treePath);\r\n            merge.getCompleteChildren().forEach(function (namedNode) {\r\n                completeChildren = completeChildren.updateImmediateChild(namedNode.name, namedNode.node);\r\n            });\r\n            return completeChildren;\r\n        }\r\n    };\r\n    /**\r\n     * Given that the underlying server data has updated, determine what, if anything, needs to be\r\n     * applied to the event cache.\r\n     *\r\n     * Possibilities:\r\n     *\r\n     * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\r\n     *\r\n     * 2. Some write is completely shadowing. No events to be raised\r\n     *\r\n     * 3. Is partially shadowed. Events\r\n     *\r\n     * Either existingEventSnap or existingServerSnap must exist\r\n     *\r\n     * @param {!Path} treePath\r\n     * @param {!Path} childPath\r\n     * @param {?Node} existingEventSnap\r\n     * @param {?Node} existingServerSnap\r\n     * @return {?Node}\r\n     */\r\n    WriteTree.prototype.calcEventCacheAfterServerOverwrite = function (treePath, childPath, existingEventSnap, existingServerSnap) {\r\n        assert(existingEventSnap || existingServerSnap, 'Either existingEventSnap or existingServerSnap must exist');\r\n        var path = treePath.child(childPath);\r\n        if (this.visibleWrites_.hasCompleteWrite(path)) {\r\n            // At this point we can probably guarantee that we're in case 2, meaning no events\r\n            // May need to check visibility while doing the findRootMostValueAndPath call\r\n            return null;\r\n        }\r\n        else {\r\n            // No complete shadowing. We're either partially shadowing or not shadowing at all.\r\n            var childMerge = this.visibleWrites_.childCompoundWrite(path);\r\n            if (childMerge.isEmpty()) {\r\n                // We're not shadowing at all. Case 1\r\n                return existingServerSnap.getChild(childPath);\r\n            }\r\n            else {\r\n                // This could be more efficient if the serverNode + updates doesn't change the eventSnap\r\n                // However this is tricky to find out, since user updates don't necessary change the server\r\n                // snap, e.g. priority updates on empty nodes, or deep deletes. Another special case is if the server\r\n                // adds nodes, but doesn't change any existing writes. It is therefore not enough to\r\n                // only check if the updates change the serverNode.\r\n                // Maybe check if the merge tree contains these special cases and only do a full overwrite in that case?\r\n                return childMerge.apply(existingServerSnap.getChild(childPath));\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Returns a complete child for a given server snap after applying all user writes or null if there is no\r\n     * complete child for this ChildKey.\r\n     *\r\n     * @param {!Path} treePath\r\n     * @param {!string} childKey\r\n     * @param {!CacheNode} existingServerSnap\r\n     * @return {?Node}\r\n     */\r\n    WriteTree.prototype.calcCompleteChild = function (treePath, childKey, existingServerSnap) {\r\n        var path = treePath.child(childKey);\r\n        var shadowingNode = this.visibleWrites_.getCompleteNode(path);\r\n        if (shadowingNode != null) {\r\n            return shadowingNode;\r\n        }\r\n        else {\r\n            if (existingServerSnap.isCompleteForChild(childKey)) {\r\n                var childMerge = this.visibleWrites_.childCompoundWrite(path);\r\n                return childMerge.apply(existingServerSnap.getNode().getImmediateChild(childKey));\r\n            }\r\n            else {\r\n                return null;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\r\n     * a higher path, this will return the child of that write relative to the write and this path.\r\n     * Returns null if there is no write at this path.\r\n     *\r\n     * @param {!Path} path\r\n     * @return {?Node}\r\n     */\r\n    WriteTree.prototype.shadowingWrite = function (path) {\r\n        return this.visibleWrites_.getCompleteNode(path);\r\n    };\r\n    /**\r\n     * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\r\n     * the window, but may now be in the window.\r\n     *\r\n     * @param {!Path} treePath\r\n     * @param {?Node} completeServerData\r\n     * @param {!NamedNode} startPost\r\n     * @param {!number} count\r\n     * @param {boolean} reverse\r\n     * @param {!Index} index\r\n     * @return {!Array.<!NamedNode>}\r\n     */\r\n    WriteTree.prototype.calcIndexedSlice = function (treePath, completeServerData, startPost, count, reverse, index) {\r\n        var toIterate;\r\n        var merge = this.visibleWrites_.childCompoundWrite(treePath);\r\n        var shadowingNode = merge.getCompleteNode(Path.Empty);\r\n        if (shadowingNode != null) {\r\n            toIterate = shadowingNode;\r\n        }\r\n        else if (completeServerData != null) {\r\n            toIterate = merge.apply(completeServerData);\r\n        }\r\n        else {\r\n            // no children to iterate on\r\n            return [];\r\n        }\r\n        toIterate = toIterate.withIndex(index);\r\n        if (!toIterate.isEmpty() && !toIterate.isLeafNode()) {\r\n            var nodes = [];\r\n            var cmp = index.getCompare();\r\n            var iter = reverse\r\n                ? toIterate.getReverseIteratorFrom(startPost, index)\r\n                : toIterate.getIteratorFrom(startPost, index);\r\n            var next = iter.getNext();\r\n            while (next && nodes.length < count) {\r\n                if (cmp(next, startPost) !== 0) {\r\n                    nodes.push(next);\r\n                }\r\n                next = iter.getNext();\r\n            }\r\n            return nodes;\r\n        }\r\n        else {\r\n            return [];\r\n        }\r\n    };\r\n    /**\r\n     * @param {!WriteRecord} writeRecord\r\n     * @param {!Path} path\r\n     * @return {boolean}\r\n     * @private\r\n     */\r\n    WriteTree.prototype.recordContainsPath_ = function (writeRecord, path) {\r\n        if (writeRecord.snap) {\r\n            return writeRecord.path.contains(path);\r\n        }\r\n        else {\r\n            // findKey can return undefined, so use !! to coerce to boolean\r\n            return !!findKey(writeRecord.children, function (childSnap, childName) {\r\n                return writeRecord.path.child(childName).contains(path);\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * Re-layer the writes and merges into a tree so we can efficiently calculate event snapshots\r\n     * @private\r\n     */\r\n    WriteTree.prototype.resetTree_ = function () {\r\n        this.visibleWrites_ = WriteTree.layerTree_(this.allWrites_, WriteTree.DefaultFilter_, Path.Empty);\r\n        if (this.allWrites_.length > 0) {\r\n            this.lastWriteId_ = this.allWrites_[this.allWrites_.length - 1].writeId;\r\n        }\r\n        else {\r\n            this.lastWriteId_ = -1;\r\n        }\r\n    };\r\n    /**\r\n     * The default filter used when constructing the tree. Keep everything that's visible.\r\n     *\r\n     * @param {!WriteRecord} write\r\n     * @return {boolean}\r\n     * @private\r\n     */\r\n    WriteTree.DefaultFilter_ = function (write) {\r\n        return write.visible;\r\n    };\r\n    /**\r\n     * Static method. Given an array of WriteRecords, a filter for which ones to include, and a path, construct the tree of\r\n     * event data at that path.\r\n     *\r\n     * @param {!Array.<!WriteRecord>} writes\r\n     * @param {!function(!WriteRecord):boolean} filter\r\n     * @param {!Path} treeRoot\r\n     * @return {!CompoundWrite}\r\n     * @private\r\n     */\r\n    WriteTree.layerTree_ = function (writes, filter, treeRoot) {\r\n        var compoundWrite = CompoundWrite.Empty;\r\n        for (var i = 0; i < writes.length; ++i) {\r\n            var write = writes[i];\r\n            // Theory, a later set will either:\r\n            // a) abort a relevant transaction, so no need to worry about excluding it from calculating that transaction\r\n            // b) not be relevant to a transaction (separate branch), so again will not affect the data for that transaction\r\n            if (filter(write)) {\r\n                var writePath = write.path;\r\n                var relativePath = void 0;\r\n                if (write.snap) {\r\n                    if (treeRoot.contains(writePath)) {\r\n                        relativePath = Path.relativePath(treeRoot, writePath);\r\n                        compoundWrite = compoundWrite.addWrite(relativePath, write.snap);\r\n                    }\r\n                    else if (writePath.contains(treeRoot)) {\r\n                        relativePath = Path.relativePath(writePath, treeRoot);\r\n                        compoundWrite = compoundWrite.addWrite(Path.Empty, write.snap.getChild(relativePath));\r\n                    }\r\n                    else {\r\n                        // There is no overlap between root path and write path, ignore write\r\n                    }\r\n                }\r\n                else if (write.children) {\r\n                    if (treeRoot.contains(writePath)) {\r\n                        relativePath = Path.relativePath(treeRoot, writePath);\r\n                        compoundWrite = compoundWrite.addWrites(relativePath, write.children);\r\n                    }\r\n                    else if (writePath.contains(treeRoot)) {\r\n                        relativePath = Path.relativePath(writePath, treeRoot);\r\n                        if (relativePath.isEmpty()) {\r\n                            compoundWrite = compoundWrite.addWrites(Path.Empty, write.children);\r\n                        }\r\n                        else {\r\n                            var child = safeGet(write.children, relativePath.getFront());\r\n                            if (child) {\r\n                                // There exists a child in this node that matches the root path\r\n                                var deepNode = child.getChild(relativePath.popFront());\r\n                                compoundWrite = compoundWrite.addWrite(Path.Empty, deepNode);\r\n                            }\r\n                        }\r\n                    }\r\n                    else {\r\n                        // There is no overlap between root path and write path, ignore write\r\n                    }\r\n                }\r\n                else {\r\n                    throw assertionError('WriteRecord should have .snap or .children');\r\n                }\r\n            }\r\n        }\r\n        return compoundWrite;\r\n    };\r\n    return WriteTree;\r\n}());\r\n/**\r\n * A WriteTreeRef wraps a WriteTree and a path, for convenient access to a particular subtree.  All of the methods\r\n * just proxy to the underlying WriteTree.\r\n *\r\n * @constructor\r\n */\r\nvar WriteTreeRef = /** @class */ (function () {\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {!WriteTree} writeTree\r\n     */\r\n    function WriteTreeRef(path, writeTree) {\r\n        this.treePath_ = path;\r\n        this.writeTree_ = writeTree;\r\n    }\r\n    /**\r\n     * If possible, returns a complete event cache, using the underlying server data if possible. In addition, can be used\r\n     * to get a cache that includes hidden writes, and excludes arbitrary writes. Note that customizing the returned node\r\n     * can lead to a more expensive calculation.\r\n     *\r\n     * @param {?Node} completeServerCache\r\n     * @param {Array.<number>=} writeIdsToExclude Optional writes to exclude.\r\n     * @param {boolean=} includeHiddenWrites Defaults to false, whether or not to layer on writes with visible set to false\r\n     * @return {?Node}\r\n     */\r\n    WriteTreeRef.prototype.calcCompleteEventCache = function (completeServerCache, writeIdsToExclude, includeHiddenWrites) {\r\n        return this.writeTree_.calcCompleteEventCache(this.treePath_, completeServerCache, writeIdsToExclude, includeHiddenWrites);\r\n    };\r\n    /**\r\n     * If possible, returns a children node containing all of the complete children we have data for. The returned data is a\r\n     * mix of the given server data and write data.\r\n     *\r\n     * @param {?ChildrenNode} completeServerChildren\r\n     * @return {!ChildrenNode}\r\n     */\r\n    WriteTreeRef.prototype.calcCompleteEventChildren = function (completeServerChildren) {\r\n        return this.writeTree_.calcCompleteEventChildren(this.treePath_, completeServerChildren);\r\n    };\r\n    /**\r\n     * Given that either the underlying server data has updated or the outstanding writes have updated, determine what,\r\n     * if anything, needs to be applied to the event cache.\r\n     *\r\n     * Possibilities:\r\n     *\r\n     * 1. No writes are shadowing. Events should be raised, the snap to be applied comes from the server data\r\n     *\r\n     * 2. Some write is completely shadowing. No events to be raised\r\n     *\r\n     * 3. Is partially shadowed. Events should be raised\r\n     *\r\n     * Either existingEventSnap or existingServerSnap must exist, this is validated via an assert\r\n     *\r\n     * @param {!Path} path\r\n     * @param {?Node} existingEventSnap\r\n     * @param {?Node} existingServerSnap\r\n     * @return {?Node}\r\n     */\r\n    WriteTreeRef.prototype.calcEventCacheAfterServerOverwrite = function (path, existingEventSnap, existingServerSnap) {\r\n        return this.writeTree_.calcEventCacheAfterServerOverwrite(this.treePath_, path, existingEventSnap, existingServerSnap);\r\n    };\r\n    /**\r\n     * Returns a node if there is a complete overwrite for this path. More specifically, if there is a write at\r\n     * a higher path, this will return the child of that write relative to the write and this path.\r\n     * Returns null if there is no write at this path.\r\n     *\r\n     * @param {!Path} path\r\n     * @return {?Node}\r\n     */\r\n    WriteTreeRef.prototype.shadowingWrite = function (path) {\r\n        return this.writeTree_.shadowingWrite(this.treePath_.child(path));\r\n    };\r\n    /**\r\n     * This method is used when processing child remove events on a query. If we can, we pull in children that were outside\r\n     * the window, but may now be in the window\r\n     *\r\n     * @param {?Node} completeServerData\r\n     * @param {!NamedNode} startPost\r\n     * @param {!number} count\r\n     * @param {boolean} reverse\r\n     * @param {!Index} index\r\n     * @return {!Array.<!NamedNode>}\r\n     */\r\n    WriteTreeRef.prototype.calcIndexedSlice = function (completeServerData, startPost, count, reverse, index) {\r\n        return this.writeTree_.calcIndexedSlice(this.treePath_, completeServerData, startPost, count, reverse, index);\r\n    };\r\n    /**\r\n     * Returns a complete child for a given server snap after applying all user writes or null if there is no\r\n     * complete child for this ChildKey.\r\n     *\r\n     * @param {!string} childKey\r\n     * @param {!CacheNode} existingServerCache\r\n     * @return {?Node}\r\n     */\r\n    WriteTreeRef.prototype.calcCompleteChild = function (childKey, existingServerCache) {\r\n        return this.writeTree_.calcCompleteChild(this.treePath_, childKey, existingServerCache);\r\n    };\r\n    /**\r\n     * Return a WriteTreeRef for a child.\r\n     *\r\n     * @param {string} childName\r\n     * @return {!WriteTreeRef}\r\n     */\r\n    WriteTreeRef.prototype.child = function (childName) {\r\n        return new WriteTreeRef(this.treePath_.child(childName), this.writeTree_);\r\n    };\r\n    return WriteTreeRef;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * SyncTree is the central class for managing event callback registration, data caching, views\r\n * (query processing), and event generation.  There are typically two SyncTree instances for\r\n * each Repo, one for the normal Firebase data, and one for the .info data.\r\n *\r\n * It has a number of responsibilities, including:\r\n *  - Tracking all user event callbacks (registered via addEventRegistration() and removeEventRegistration()).\r\n *  - Applying and caching data changes for user set(), transaction(), and update() calls\r\n *    (applyUserOverwrite(), applyUserMerge()).\r\n *  - Applying and caching data changes for server data changes (applyServerOverwrite(),\r\n *    applyServerMerge()).\r\n *  - Generating user-facing events for server and user changes (all of the apply* methods\r\n *    return the set of events that need to be raised as a result).\r\n *  - Maintaining the appropriate set of server listens to ensure we are always subscribed\r\n *    to the correct set of paths and queries to satisfy the current set of user event\r\n *    callbacks (listens are started/stopped using the provided listenProvider).\r\n *\r\n * NOTE: Although SyncTree tracks event callbacks and calculates events to raise, the actual\r\n * events are returned to the caller rather than raised synchronously.\r\n *\r\n * @constructor\r\n */\r\nvar SyncTree = /** @class */ (function () {\r\n    /**\r\n     * @param {!ListenProvider} listenProvider_ Used by SyncTree to start / stop listening\r\n     *   to server data.\r\n     */\r\n    function SyncTree(listenProvider_) {\r\n        this.listenProvider_ = listenProvider_;\r\n        /**\r\n         * Tree of SyncPoints.  There's a SyncPoint at any location that has 1 or more views.\r\n         * @type {!ImmutableTree.<!SyncPoint>}\r\n         * @private\r\n         */\r\n        this.syncPointTree_ = ImmutableTree.Empty;\r\n        /**\r\n         * A tree of all pending user writes (user-initiated set()'s, transaction()'s, update()'s, etc.).\r\n         * @type {!WriteTree}\r\n         * @private\r\n         */\r\n        this.pendingWriteTree_ = new WriteTree();\r\n        this.tagToQueryMap_ = {};\r\n        this.queryToTagMap_ = {};\r\n    }\r\n    /**\r\n     * Apply the data changes for a user-generated set() or transaction() call.\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Node} newData\r\n     * @param {number} writeId\r\n     * @param {boolean=} visible\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyUserOverwrite = function (path, newData, writeId, visible) {\r\n        // Record pending write.\r\n        this.pendingWriteTree_.addOverwrite(path, newData, writeId, visible);\r\n        if (!visible) {\r\n            return [];\r\n        }\r\n        else {\r\n            return this.applyOperationToSyncPoints_(new Overwrite(OperationSource.User, path, newData));\r\n        }\r\n    };\r\n    /**\r\n     * Apply the data from a user-generated update() call\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Object.<string, !Node>} changedChildren\r\n     * @param {!number} writeId\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyUserMerge = function (path, changedChildren, writeId) {\r\n        // Record pending merge.\r\n        this.pendingWriteTree_.addMerge(path, changedChildren, writeId);\r\n        var changeTree = ImmutableTree.fromObject(changedChildren);\r\n        return this.applyOperationToSyncPoints_(new Merge(OperationSource.User, path, changeTree));\r\n    };\r\n    /**\r\n     * Acknowledge a pending user write that was previously registered with applyUserOverwrite() or applyUserMerge().\r\n     *\r\n     * @param {!number} writeId\r\n     * @param {boolean=} revert True if the given write failed and needs to be reverted\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.ackUserWrite = function (writeId, revert) {\r\n        if (revert === void 0) { revert = false; }\r\n        var write = this.pendingWriteTree_.getWrite(writeId);\r\n        var needToReevaluate = this.pendingWriteTree_.removeWrite(writeId);\r\n        if (!needToReevaluate) {\r\n            return [];\r\n        }\r\n        else {\r\n            var affectedTree_1 = ImmutableTree.Empty;\r\n            if (write.snap != null) {\r\n                // overwrite\r\n                affectedTree_1 = affectedTree_1.set(Path.Empty, true);\r\n            }\r\n            else {\r\n                forEach(write.children, function (pathString, node) {\r\n                    affectedTree_1 = affectedTree_1.set(new Path(pathString), node);\r\n                });\r\n            }\r\n            return this.applyOperationToSyncPoints_(new AckUserWrite(write.path, affectedTree_1, revert));\r\n        }\r\n    };\r\n    /**\r\n     * Apply new server data for the specified path..\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Node} newData\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyServerOverwrite = function (path, newData) {\r\n        return this.applyOperationToSyncPoints_(new Overwrite(OperationSource.Server, path, newData));\r\n    };\r\n    /**\r\n     * Apply new server data to be merged in at the specified path.\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Object.<string, !Node>} changedChildren\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyServerMerge = function (path, changedChildren) {\r\n        var changeTree = ImmutableTree.fromObject(changedChildren);\r\n        return this.applyOperationToSyncPoints_(new Merge(OperationSource.Server, path, changeTree));\r\n    };\r\n    /**\r\n     * Apply a listen complete for a query\r\n     *\r\n     * @param {!Path} path\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyListenComplete = function (path) {\r\n        return this.applyOperationToSyncPoints_(new ListenComplete(OperationSource.Server, path));\r\n    };\r\n    /**\r\n     * Apply new server data for the specified tagged query.\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Node} snap\r\n     * @param {!number} tag\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyTaggedQueryOverwrite = function (path, snap, tag) {\r\n        var queryKey = this.queryKeyForTag_(tag);\r\n        if (queryKey != null) {\r\n            var r = SyncTree.parseQueryKey_(queryKey);\r\n            var queryPath = r.path, queryId = r.queryId;\r\n            var relativePath = Path.relativePath(queryPath, path);\r\n            var op = new Overwrite(OperationSource.forServerTaggedQuery(queryId), relativePath, snap);\r\n            return this.applyTaggedOperation_(queryPath, op);\r\n        }\r\n        else {\r\n            // Query must have been removed already\r\n            return [];\r\n        }\r\n    };\r\n    /**\r\n     * Apply server data to be merged in for the specified tagged query.\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!Object.<string, !Node>} changedChildren\r\n     * @param {!number} tag\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyTaggedQueryMerge = function (path, changedChildren, tag) {\r\n        var queryKey = this.queryKeyForTag_(tag);\r\n        if (queryKey) {\r\n            var r = SyncTree.parseQueryKey_(queryKey);\r\n            var queryPath = r.path, queryId = r.queryId;\r\n            var relativePath = Path.relativePath(queryPath, path);\r\n            var changeTree = ImmutableTree.fromObject(changedChildren);\r\n            var op = new Merge(OperationSource.forServerTaggedQuery(queryId), relativePath, changeTree);\r\n            return this.applyTaggedOperation_(queryPath, op);\r\n        }\r\n        else {\r\n            // We've already removed the query. No big deal, ignore the update\r\n            return [];\r\n        }\r\n    };\r\n    /**\r\n     * Apply a listen complete for a tagged query\r\n     *\r\n     * @param {!Path} path\r\n     * @param {!number} tag\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.applyTaggedListenComplete = function (path, tag) {\r\n        var queryKey = this.queryKeyForTag_(tag);\r\n        if (queryKey) {\r\n            var r = SyncTree.parseQueryKey_(queryKey);\r\n            var queryPath = r.path, queryId = r.queryId;\r\n            var relativePath = Path.relativePath(queryPath, path);\r\n            var op = new ListenComplete(OperationSource.forServerTaggedQuery(queryId), relativePath);\r\n            return this.applyTaggedOperation_(queryPath, op);\r\n        }\r\n        else {\r\n            // We've already removed the query. No big deal, ignore the update\r\n            return [];\r\n        }\r\n    };\r\n    /**\r\n     * Add an event callback for the specified query.\r\n     *\r\n     * @param {!Query} query\r\n     * @param {!EventRegistration} eventRegistration\r\n     * @return {!Array.<!Event>} Events to raise.\r\n     */\r\n    SyncTree.prototype.addEventRegistration = function (query, eventRegistration) {\r\n        var path = query.path;\r\n        var serverCache = null;\r\n        var foundAncestorDefaultView = false;\r\n        // Any covering writes will necessarily be at the root, so really all we need to find is the server cache.\r\n        // Consider optimizing this once there's a better understanding of what actual behavior will be.\r\n        this.syncPointTree_.foreachOnPath(path, function (pathToSyncPoint, sp) {\r\n            var relativePath = Path.relativePath(pathToSyncPoint, path);\r\n            serverCache = serverCache || sp.getCompleteServerCache(relativePath);\r\n            foundAncestorDefaultView =\r\n                foundAncestorDefaultView || sp.hasCompleteView();\r\n        });\r\n        var syncPoint = this.syncPointTree_.get(path);\r\n        if (!syncPoint) {\r\n            syncPoint = new SyncPoint();\r\n            this.syncPointTree_ = this.syncPointTree_.set(path, syncPoint);\r\n        }\r\n        else {\r\n            foundAncestorDefaultView =\r\n                foundAncestorDefaultView || syncPoint.hasCompleteView();\r\n            serverCache = serverCache || syncPoint.getCompleteServerCache(Path.Empty);\r\n        }\r\n        var serverCacheComplete;\r\n        if (serverCache != null) {\r\n            serverCacheComplete = true;\r\n        }\r\n        else {\r\n            serverCacheComplete = false;\r\n            serverCache = ChildrenNode.EMPTY_NODE;\r\n            var subtree = this.syncPointTree_.subtree(path);\r\n            subtree.foreachChild(function (childName, childSyncPoint) {\r\n                var completeCache = childSyncPoint.getCompleteServerCache(Path.Empty);\r\n                if (completeCache) {\r\n                    serverCache = serverCache.updateImmediateChild(childName, completeCache);\r\n                }\r\n            });\r\n        }\r\n        var viewAlreadyExists = syncPoint.viewExistsForQuery(query);\r\n        if (!viewAlreadyExists && !query.getQueryParams().loadsAllData()) {\r\n            // We need to track a tag for this query\r\n            var queryKey = SyncTree.makeQueryKey_(query);\r\n            assert(!(queryKey in this.queryToTagMap_), 'View does not exist, but we have a tag');\r\n            var tag = SyncTree.getNextQueryTag_();\r\n            this.queryToTagMap_[queryKey] = tag;\r\n            // Coerce to string to avoid sparse arrays.\r\n            this.tagToQueryMap_['_' + tag] = queryKey;\r\n        }\r\n        var writesCache = this.pendingWriteTree_.childWrites(path);\r\n        var events = syncPoint.addEventRegistration(query, eventRegistration, writesCache, serverCache, serverCacheComplete);\r\n        if (!viewAlreadyExists && !foundAncestorDefaultView) {\r\n            var view /** @type !View */ = syncPoint.viewForQuery(query);\r\n            events = events.concat(this.setupListener_(query, view));\r\n        }\r\n        return events;\r\n    };\r\n    /**\r\n     * Remove event callback(s).\r\n     *\r\n     * If query is the default query, we'll check all queries for the specified eventRegistration.\r\n     * If eventRegistration is null, we'll remove all callbacks for the specified query/queries.\r\n     *\r\n     * @param {!Query} query\r\n     * @param {?EventRegistration} eventRegistration If null, all callbacks are removed.\r\n     * @param {Error=} cancelError If a cancelError is provided, appropriate cancel events will be returned.\r\n     * @return {!Array.<!Event>} Cancel events, if cancelError was provided.\r\n     */\r\n    SyncTree.prototype.removeEventRegistration = function (query, eventRegistration, cancelError) {\r\n        var _this = this;\r\n        // Find the syncPoint first. Then deal with whether or not it has matching listeners\r\n        var path = query.path;\r\n        var maybeSyncPoint = this.syncPointTree_.get(path);\r\n        var cancelEvents = [];\r\n        // A removal on a default query affects all queries at that location. A removal on an indexed query, even one without\r\n        // other query constraints, does *not* affect all queries at that location. So this check must be for 'default', and\r\n        // not loadsAllData().\r\n        if (maybeSyncPoint &&\r\n            (query.queryIdentifier() === 'default' ||\r\n                maybeSyncPoint.viewExistsForQuery(query))) {\r\n            /**\r\n             * @type {{removed: !Array.<!Query>, events: !Array.<!Event>}}\r\n             */\r\n            var removedAndEvents = maybeSyncPoint.removeEventRegistration(query, eventRegistration, cancelError);\r\n            if (maybeSyncPoint.isEmpty()) {\r\n                this.syncPointTree_ = this.syncPointTree_.remove(path);\r\n            }\r\n            var removed = removedAndEvents.removed;\r\n            cancelEvents = removedAndEvents.events;\r\n            // We may have just removed one of many listeners and can short-circuit this whole process\r\n            // We may also not have removed a default listener, in which case all of the descendant listeners should already be\r\n            // properly set up.\r\n            //\r\n            // Since indexed queries can shadow if they don't have other query constraints, check for loadsAllData(), instead of\r\n            // queryId === 'default'\r\n            var removingDefault = -1 !==\r\n                removed.findIndex(function (query) {\r\n                    return query.getQueryParams().loadsAllData();\r\n                });\r\n            var covered = this.syncPointTree_.findOnPath(path, function (relativePath, parentSyncPoint) {\r\n                return parentSyncPoint.hasCompleteView();\r\n            });\r\n            if (removingDefault && !covered) {\r\n                var subtree = this.syncPointTree_.subtree(path);\r\n                // There are potentially child listeners. Determine what if any listens we need to send before executing the\r\n                // removal\r\n                if (!subtree.isEmpty()) {\r\n                    // We need to fold over our subtree and collect the listeners to send\r\n                    var newViews = this.collectDistinctViewsForSubTree_(subtree);\r\n                    // Ok, we've collected all the listens we need. Set them up.\r\n                    for (var i = 0; i < newViews.length; ++i) {\r\n                        var view = newViews[i], newQuery = view.getQuery();\r\n                        var listener = this.createListenerForView_(view);\r\n                        this.listenProvider_.startListening(SyncTree.queryForListening_(newQuery), this.tagForQuery_(newQuery), listener.hashFn, listener.onComplete);\r\n                    }\r\n                }\r\n                else {\r\n                    // There's nothing below us, so nothing we need to start listening on\r\n                }\r\n            }\r\n            // If we removed anything and we're not covered by a higher up listen, we need to stop listening on this query\r\n            // The above block has us covered in terms of making sure we're set up on listens lower in the tree.\r\n            // Also, note that if we have a cancelError, it's already been removed at the provider level.\r\n            if (!covered && removed.length > 0 && !cancelError) {\r\n                // If we removed a default, then we weren't listening on any of the other queries here. Just cancel the one\r\n                // default. Otherwise, we need to iterate through and cancel each individual query\r\n                if (removingDefault) {\r\n                    // We don't tag default listeners\r\n                    var defaultTag = null;\r\n                    this.listenProvider_.stopListening(SyncTree.queryForListening_(query), defaultTag);\r\n                }\r\n                else {\r\n                    removed.forEach(function (queryToRemove) {\r\n                        var tagToRemove = _this.queryToTagMap_[SyncTree.makeQueryKey_(queryToRemove)];\r\n                        _this.listenProvider_.stopListening(SyncTree.queryForListening_(queryToRemove), tagToRemove);\r\n                    });\r\n                }\r\n            }\r\n            // Now, clear all of the tags we're tracking for the removed listens\r\n            this.removeTags_(removed);\r\n        }\r\n        else {\r\n            // No-op, this listener must've been already removed\r\n        }\r\n        return cancelEvents;\r\n    };\r\n    /**\r\n     * Returns a complete cache, if we have one, of the data at a particular path. The location must have a listener above\r\n     * it, but as this is only used by transaction code, that should always be the case anyways.\r\n     *\r\n     * Note: this method will *include* hidden writes from transaction with applyLocally set to false.\r\n     * @param {!Path} path The path to the data we want\r\n     * @param {Array.<number>=} writeIdsToExclude A specific set to be excluded\r\n     * @return {?Node}\r\n     */\r\n    SyncTree.prototype.calcCompleteEventCache = function (path, writeIdsToExclude) {\r\n        var includeHiddenSets = true;\r\n        var writeTree = this.pendingWriteTree_;\r\n        var serverCache = this.syncPointTree_.findOnPath(path, function (pathSoFar, syncPoint) {\r\n            var relativePath = Path.relativePath(pathSoFar, path);\r\n            var serverCache = syncPoint.getCompleteServerCache(relativePath);\r\n            if (serverCache) {\r\n                return serverCache;\r\n            }\r\n        });\r\n        return writeTree.calcCompleteEventCache(path, serverCache, writeIdsToExclude, includeHiddenSets);\r\n    };\r\n    /**\r\n     * This collapses multiple unfiltered views into a single view, since we only need a single\r\n     * listener for them.\r\n     *\r\n     * @param {!ImmutableTree.<!SyncPoint>} subtree\r\n     * @return {!Array.<!View>}\r\n     * @private\r\n     */\r\n    SyncTree.prototype.collectDistinctViewsForSubTree_ = function (subtree) {\r\n        return subtree.fold(function (relativePath, maybeChildSyncPoint, childMap) {\r\n            if (maybeChildSyncPoint && maybeChildSyncPoint.hasCompleteView()) {\r\n                var completeView = maybeChildSyncPoint.getCompleteView();\r\n                return [completeView];\r\n            }\r\n            else {\r\n                // No complete view here, flatten any deeper listens into an array\r\n                var views_1 = [];\r\n                if (maybeChildSyncPoint) {\r\n                    views_1 = maybeChildSyncPoint.getQueryViews();\r\n                }\r\n                forEach(childMap, function (key, childViews) {\r\n                    views_1 = views_1.concat(childViews);\r\n                });\r\n                return views_1;\r\n            }\r\n        });\r\n    };\r\n    /**\r\n     * @param {!Array.<!Query>} queries\r\n     * @private\r\n     */\r\n    SyncTree.prototype.removeTags_ = function (queries) {\r\n        for (var j = 0; j < queries.length; ++j) {\r\n            var removedQuery = queries[j];\r\n            if (!removedQuery.getQueryParams().loadsAllData()) {\r\n                // We should have a tag for this\r\n                var removedQueryKey = SyncTree.makeQueryKey_(removedQuery);\r\n                var removedQueryTag = this.queryToTagMap_[removedQueryKey];\r\n                delete this.queryToTagMap_[removedQueryKey];\r\n                delete this.tagToQueryMap_['_' + removedQueryTag];\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Normalizes a query to a query we send the server for listening\r\n     * @param {!Query} query\r\n     * @return {!Query} The normalized query\r\n     * @private\r\n     */\r\n    SyncTree.queryForListening_ = function (query) {\r\n        if (query.getQueryParams().loadsAllData() &&\r\n            !query.getQueryParams().isDefault()) {\r\n            // We treat queries that load all data as default queries\r\n            // Cast is necessary because ref() technically returns Firebase which is actually fb.api.Firebase which inherits\r\n            // from Query\r\n            return /** @type {!Query} */ query.getRef();\r\n        }\r\n        else {\r\n            return query;\r\n        }\r\n    };\r\n    /**\r\n     * For a given new listen, manage the de-duplication of outstanding subscriptions.\r\n     *\r\n     * @param {!Query} query\r\n     * @param {!View} view\r\n     * @return {!Array.<!Event>} This method can return events to support synchronous data sources\r\n     * @private\r\n     */\r\n    SyncTree.prototype.setupListener_ = function (query, view) {\r\n        var path = query.path;\r\n        var tag = this.tagForQuery_(query);\r\n        var listener = this.createListenerForView_(view);\r\n        var events = this.listenProvider_.startListening(SyncTree.queryForListening_(query), tag, listener.hashFn, listener.onComplete);\r\n        var subtree = this.syncPointTree_.subtree(path);\r\n        // The root of this subtree has our query. We're here because we definitely need to send a listen for that, but we\r\n        // may need to shadow other listens as well.\r\n        if (tag) {\r\n            assert(!subtree.value.hasCompleteView(), \"If we're adding a query, it shouldn't be shadowed\");\r\n        }\r\n        else {\r\n            // Shadow everything at or below this location, this is a default listener.\r\n            var queriesToStop = subtree.fold(function (relativePath, maybeChildSyncPoint, childMap) {\r\n                if (!relativePath.isEmpty() &&\r\n                    maybeChildSyncPoint &&\r\n                    maybeChildSyncPoint.hasCompleteView()) {\r\n                    return [maybeChildSyncPoint.getCompleteView().getQuery()];\r\n                }\r\n                else {\r\n                    // No default listener here, flatten any deeper queries into an array\r\n                    var queries_1 = [];\r\n                    if (maybeChildSyncPoint) {\r\n                        queries_1 = queries_1.concat(maybeChildSyncPoint.getQueryViews().map(function (view) { return view.getQuery(); }));\r\n                    }\r\n                    forEach(childMap, function (key, childQueries) {\r\n                        queries_1 = queries_1.concat(childQueries);\r\n                    });\r\n                    return queries_1;\r\n                }\r\n            });\r\n            for (var i = 0; i < queriesToStop.length; ++i) {\r\n                var queryToStop = queriesToStop[i];\r\n                this.listenProvider_.stopListening(SyncTree.queryForListening_(queryToStop), this.tagForQuery_(queryToStop));\r\n            }\r\n        }\r\n        return events;\r\n    };\r\n    /**\r\n     *\r\n     * @param {!View} view\r\n     * @return {{hashFn: function(), onComplete: function(!string, *)}}\r\n     * @private\r\n     */\r\n    SyncTree.prototype.createListenerForView_ = function (view) {\r\n        var _this = this;\r\n        var query = view.getQuery();\r\n        var tag = this.tagForQuery_(query);\r\n        return {\r\n            hashFn: function () {\r\n                var cache = view.getServerCache() || ChildrenNode.EMPTY_NODE;\r\n                return cache.hash();\r\n            },\r\n            onComplete: function (status) {\r\n                if (status === 'ok') {\r\n                    if (tag) {\r\n                        return _this.applyTaggedListenComplete(query.path, tag);\r\n                    }\r\n                    else {\r\n                        return _this.applyListenComplete(query.path);\r\n                    }\r\n                }\r\n                else {\r\n                    // If a listen failed, kill all of the listeners here, not just the one that triggered the error.\r\n                    // Note that this may need to be scoped to just this listener if we change permissions on filtered children\r\n                    var error$$1 = errorForServerCode(status, query);\r\n                    return _this.removeEventRegistration(query, \r\n                    /*eventRegistration*/ null, error$$1);\r\n                }\r\n            }\r\n        };\r\n    };\r\n    /**\r\n     * Given a query, computes a \"queryKey\" suitable for use in our queryToTagMap_.\r\n     * @private\r\n     * @param {!Query} query\r\n     * @return {string}\r\n     */\r\n    SyncTree.makeQueryKey_ = function (query) {\r\n        return query.path.toString() + '$' + query.queryIdentifier();\r\n    };\r\n    /**\r\n     * Given a queryKey (created by makeQueryKey), parse it back into a path and queryId.\r\n     * @private\r\n     * @param {!string} queryKey\r\n     * @return {{queryId: !string, path: !Path}}\r\n     */\r\n    SyncTree.parseQueryKey_ = function (queryKey) {\r\n        var splitIndex = queryKey.indexOf('$');\r\n        assert(splitIndex !== -1 && splitIndex < queryKey.length - 1, 'Bad queryKey.');\r\n        return {\r\n            queryId: queryKey.substr(splitIndex + 1),\r\n            path: new Path(queryKey.substr(0, splitIndex))\r\n        };\r\n    };\r\n    /**\r\n     * Return the query associated with the given tag, if we have one\r\n     * @param {!number} tag\r\n     * @return {?string}\r\n     * @private\r\n     */\r\n    SyncTree.prototype.queryKeyForTag_ = function (tag) {\r\n        return this.tagToQueryMap_['_' + tag];\r\n    };\r\n    /**\r\n     * Return the tag associated with the given query.\r\n     * @param {!Query} query\r\n     * @return {?number}\r\n     * @private\r\n     */\r\n    SyncTree.prototype.tagForQuery_ = function (query) {\r\n        var queryKey = SyncTree.makeQueryKey_(query);\r\n        return safeGet(this.queryToTagMap_, queryKey);\r\n    };\r\n    /**\r\n     * Static accessor for query tags.\r\n     * @return {number}\r\n     * @private\r\n     */\r\n    SyncTree.getNextQueryTag_ = function () {\r\n        return SyncTree.nextQueryTag_++;\r\n    };\r\n    /**\r\n     * A helper method to apply tagged operations\r\n     *\r\n     * @param {!Path} queryPath\r\n     * @param {!Operation} operation\r\n     * @return {!Array.<!Event>}\r\n     * @private\r\n     */\r\n    SyncTree.prototype.applyTaggedOperation_ = function (queryPath, operation) {\r\n        var syncPoint = this.syncPointTree_.get(queryPath);\r\n        assert(syncPoint, \"Missing sync point for query tag that we're tracking\");\r\n        var writesCache = this.pendingWriteTree_.childWrites(queryPath);\r\n        return syncPoint.applyOperation(operation, writesCache, \r\n        /*serverCache=*/ null);\r\n    };\r\n    /**\r\n     * A helper method that visits all descendant and ancestor SyncPoints, applying the operation.\r\n     *\r\n     * NOTES:\r\n     * - Descendant SyncPoints will be visited first (since we raise events depth-first).\r\n  \n     * - We call applyOperation() on each SyncPoint passing three things:\r\n     *   1. A version of the Operation that has been made relative to the SyncPoint location.\r\n     *   2. A WriteTreeRef of any writes we have cached at the SyncPoint location.\r\n     *   3. A snapshot Node with cached server data, if we have it.\r\n  \n     * - We concatenate all of the events returned by each SyncPoint and return the result.\r\n     *\r\n     * @param {!Operation} operation\r\n     * @return {!Array.<!Event>}\r\n     * @private\r\n     */\r\n    SyncTree.prototype.applyOperationToSyncPoints_ = function (operation) {\r\n        return this.applyOperationHelper_(operation, this.syncPointTree_, \r\n        /*serverCache=*/ null, this.pendingWriteTree_.childWrites(Path.Empty));\r\n    };\r\n    /**\r\n     * Recursive helper for applyOperationToSyncPoints_\r\n     *\r\n     * @private\r\n     * @param {!Operation} operation\r\n     * @param {ImmutableTree.<!SyncPoint>} syncPointTree\r\n     * @param {?Node} serverCache\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    SyncTree.prototype.applyOperationHelper_ = function (operation, syncPointTree, serverCache, writesCache) {\r\n        if (operation.path.isEmpty()) {\r\n            return this.applyOperationDescendantsHelper_(operation, syncPointTree, serverCache, writesCache);\r\n        }\r\n        else {\r\n            var syncPoint = syncPointTree.get(Path.Empty);\r\n            // If we don't have cached server data, see if we can get it from this SyncPoint.\r\n            if (serverCache == null && syncPoint != null) {\r\n                serverCache = syncPoint.getCompleteServerCache(Path.Empty);\r\n            }\r\n            var events = [];\r\n            var childName = operation.path.getFront();\r\n            var childOperation = operation.operationForChild(childName);\r\n            var childTree = syncPointTree.children.get(childName);\r\n            if (childTree && childOperation) {\r\n                var childServerCache = serverCache\r\n                    ? serverCache.getImmediateChild(childName)\r\n                    : null;\r\n                var childWritesCache = writesCache.child(childName);\r\n                events = events.concat(this.applyOperationHelper_(childOperation, childTree, childServerCache, childWritesCache));\r\n            }\r\n            if (syncPoint) {\r\n                events = events.concat(syncPoint.applyOperation(operation, writesCache, serverCache));\r\n            }\r\n            return events;\r\n        }\r\n    };\r\n    /**\r\n     * Recursive helper for applyOperationToSyncPoints_\r\n     *\r\n     * @private\r\n     * @param {!Operation} operation\r\n     * @param {ImmutableTree.<!SyncPoint>} syncPointTree\r\n     * @param {?Node} serverCache\r\n     * @param {!WriteTreeRef} writesCache\r\n     * @return {!Array.<!Event>}\r\n     */\r\n    SyncTree.prototype.applyOperationDescendantsHelper_ = function (operation, syncPointTree, serverCache, writesCache) {\r\n        var _this = this;\r\n        var syncPoint = syncPointTree.get(Path.Empty);\r\n        // If we don't have cached server data, see if we can get it from this SyncPoint.\r\n        if (serverCache == null && syncPoint != null) {\r\n            serverCache = syncPoint.getCompleteServerCache(Path.Empty);\r\n        }\r\n        var events = [];\r\n        syncPointTree.children.inorderTraversal(function (childName, childTree) {\r\n            var childServerCache = serverCache\r\n                ? serverCache.getImmediateChild(childName)\r\n                : null;\r\n            var childWritesCache = writesCache.child(childName);\r\n            var childOperation = operation.operationForChild(childName);\r\n            if (childOperation) {\r\n                events = events.concat(_this.applyOperationDescendantsHelper_(childOperation, childTree, childServerCache, childWritesCache));\r\n            }\r\n        });\r\n        if (syncPoint) {\r\n            events = events.concat(syncPoint.applyOperation(operation, writesCache, serverCache));\r\n        }\r\n        return events;\r\n    };\r\n    /**\r\n     * Static tracker for next query tag.\r\n     * @type {number}\r\n     * @private\r\n     */\r\n    SyncTree.nextQueryTag_ = 1;\r\n    return SyncTree;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Mutable object which basically just stores a reference to the \"latest\" immutable snapshot.\r\n *\r\n * @constructor\r\n */\r\nvar SnapshotHolder = /** @class */ (function () {\r\n    function SnapshotHolder() {\r\n        this.rootNode_ = ChildrenNode.EMPTY_NODE;\r\n    }\r\n    SnapshotHolder.prototype.getNode = function (path) {\r\n        return this.rootNode_.getChild(path);\r\n    };\r\n    SnapshotHolder.prototype.updateSnapshot = function (path, newSnapshotNode) {\r\n        this.rootNode_ = this.rootNode_.updateChild(path, newSnapshotNode);\r\n    };\r\n    return SnapshotHolder;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Abstraction around FirebaseApp's token fetching capabilities.\r\n */\r\nvar AuthTokenProvider = /** @class */ (function () {\r\n    /**\r\n     * @param {!FirebaseApp} app_\r\n     */\r\n    function AuthTokenProvider(app_) {\r\n        this.app_ = app_;\r\n    }\r\n    /**\r\n     * @param {boolean} forceRefresh\r\n     * @return {!Promise<FirebaseAuthTokenData>}\r\n     */\r\n    AuthTokenProvider.prototype.getToken = function (forceRefresh) {\r\n        return this.app_['INTERNAL']['getToken'](forceRefresh).then(null, \r\n        // .catch\r\n        function (error$$1) {\r\n            // TODO: Need to figure out all the cases this is raised and whether\r\n            // this makes sense.\r\n            if (error$$1 && error$$1.code === 'auth/token-not-initialized') {\r\n                log('Got auth/token-not-initialized error.  Treating as null token.');\r\n                return null;\r\n            }\r\n            else {\r\n                return Promise.reject(error$$1);\r\n            }\r\n        });\r\n    };\r\n    AuthTokenProvider.prototype.addTokenChangeListener = function (listener) {\r\n        // TODO: We might want to wrap the listener and call it with no args to\r\n        // avoid a leaky abstraction, but that makes removing the listener harder.\r\n        this.app_['INTERNAL']['addAuthTokenListener'](listener);\r\n    };\r\n    AuthTokenProvider.prototype.removeTokenChangeListener = function (listener) {\r\n        this.app_['INTERNAL']['removeAuthTokenListener'](listener);\r\n    };\r\n    AuthTokenProvider.prototype.notifyForInvalidToken = function () {\r\n        var errorMessage = 'Provided authentication credentials for the app named \"' +\r\n            this.app_.name +\r\n            '\" are invalid. This usually indicates your app was not ' +\r\n            'initialized correctly. ';\r\n        if ('credential' in this.app_.options) {\r\n            errorMessage +=\r\n                'Make sure the \"credential\" property provided to initializeApp() ' +\r\n                    'is authorized to access the specified \"databaseURL\" and is from the correct ' +\r\n                    'project.';\r\n        }\r\n        else if ('serviceAccount' in this.app_.options) {\r\n            errorMessage +=\r\n                'Make sure the \"serviceAccount\" property provided to initializeApp() ' +\r\n                    'is authorized to access the specified \"databaseURL\" and is from the correct ' +\r\n                    'project.';\r\n        }\r\n        else {\r\n            errorMessage +=\r\n                'Make sure the \"apiKey\" and \"databaseURL\" properties provided to ' +\r\n                    'initializeApp() match the values provided for your app at ' +\r\n                    'https://console.firebase.google.com/.';\r\n        }\r\n        warn(errorMessage);\r\n    };\r\n    return AuthTokenProvider;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Tracks a collection of stats.\r\n *\r\n * @constructor\r\n */\r\nvar StatsCollection = /** @class */ (function () {\r\n    function StatsCollection() {\r\n        this.counters_ = {};\r\n    }\r\n    StatsCollection.prototype.incrementCounter = function (name, amount) {\r\n        if (amount === void 0) { amount = 1; }\r\n        if (!contains(this.counters_, name))\r\n            this.counters_[name] = 0;\r\n        this.counters_[name] += amount;\r\n    };\r\n    StatsCollection.prototype.get = function () {\r\n        return deepCopy(this.counters_);\r\n    };\r\n    return StatsCollection;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar StatsManager = /** @class */ (function () {\r\n    function StatsManager() {\r\n    }\r\n    StatsManager.getCollection = function (repoInfo) {\r\n        var hashString = repoInfo.toString();\r\n        if (!this.collections_[hashString]) {\r\n            this.collections_[hashString] = new StatsCollection();\r\n        }\r\n        return this.collections_[hashString];\r\n    };\r\n    StatsManager.getOrCreateReporter = function (repoInfo, creatorFunction) {\r\n        var hashString = repoInfo.toString();\r\n        if (!this.reporters_[hashString]) {\r\n            this.reporters_[hashString] = creatorFunction();\r\n        }\r\n        return this.reporters_[hashString];\r\n    };\r\n    StatsManager.collections_ = {};\r\n    StatsManager.reporters_ = {};\r\n    return StatsManager;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Returns the delta from the previous call to get stats.\r\n *\r\n * @param collection_ The collection to \"listen\" to.\r\n * @constructor\r\n */\r\nvar StatsListener = /** @class */ (function () {\r\n    function StatsListener(collection_) {\r\n        this.collection_ = collection_;\r\n        this.last_ = null;\r\n    }\r\n    StatsListener.prototype.get = function () {\r\n        var newStats = this.collection_.get();\r\n        var delta = clone(newStats);\r\n        if (this.last_) {\r\n            forEach(this.last_, function (stat, value) {\r\n                delta[stat] = delta[stat] - value;\r\n            });\r\n        }\r\n        this.last_ = newStats;\r\n        return delta;\r\n    };\r\n    return StatsListener;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// Assuming some apps may have a short amount of time on page, and a bulk of firebase operations probably\r\n// happen on page load, we try to report our first set of stats pretty quickly, but we wait at least 10\r\n// seconds to try to ensure the Firebase connection is established / settled.\r\nvar FIRST_STATS_MIN_TIME = 10 * 1000;\r\nvar FIRST_STATS_MAX_TIME = 30 * 1000;\r\n// We'll continue to report stats on average every 5 minutes.\r\nvar REPORT_STATS_INTERVAL = 5 * 60 * 1000;\r\n/**\r\n * @constructor\r\n */\r\nvar StatsReporter = /** @class */ (function () {\r\n    /**\r\n     * @param collection\r\n     * @param server_\r\n     */\r\n    function StatsReporter(collection, server_) {\r\n        this.server_ = server_;\r\n        this.statsToReport_ = {};\r\n        this.statsListener_ = new StatsListener(collection);\r\n        var timeout = FIRST_STATS_MIN_TIME +\r\n            (FIRST_STATS_MAX_TIME - FIRST_STATS_MIN_TIME) * Math.random();\r\n        setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(timeout));\r\n    }\r\n    StatsReporter.prototype.includeStat = function (stat) {\r\n        this.statsToReport_[stat] = true;\r\n    };\r\n    StatsReporter.prototype.reportStats_ = function () {\r\n        var _this = this;\r\n        var stats = this.statsListener_.get();\r\n        var reportedStats = {};\r\n        var haveStatsToReport = false;\r\n        forEach(stats, function (stat, value) {\r\n            if (value > 0 && contains(_this.statsToReport_, stat)) {\r\n                reportedStats[stat] = value;\r\n                haveStatsToReport = true;\r\n            }\r\n        });\r\n        if (haveStatsToReport) {\r\n            this.server_.reportStats(reportedStats);\r\n        }\r\n        // queue our next run.\r\n        setTimeoutNonBlocking(this.reportStats_.bind(this), Math.floor(Math.random() * 2 * REPORT_STATS_INTERVAL));\r\n    };\r\n    return StatsReporter;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * The event queue serves a few purposes:\r\n * 1. It ensures we maintain event order in the face of event callbacks doing operations that result in more\r\n *    events being queued.\r\n * 2. raiseQueuedEvents() handles being called reentrantly nicely.  That is, if in the course of raising events,\r\n *    raiseQueuedEvents() is called again, the \"inner\" call will pick up raising events where the \"outer\" call\r\n *    left off, ensuring that the events are still raised synchronously and in order.\r\n * 3. You can use raiseEventsAtPath and raiseEventsForChangedPath to ensure only relevant previously-queued\r\n *    events are raised synchronously.\r\n *\r\n * NOTE: This can all go away if/when we move to async events.\r\n *\r\n * @constructor\r\n */\r\nvar EventQueue = /** @class */ (function () {\r\n    function EventQueue() {\r\n        /**\r\n         * @private\r\n         * @type {!Array.<EventList>}\r\n         */\r\n        this.eventLists_ = [];\r\n        /**\r\n         * Tracks recursion depth of raiseQueuedEvents_, for debugging purposes.\r\n         * @private\r\n         * @type {!number}\r\n         */\r\n        this.recursionDepth_ = 0;\r\n    }\r\n    /**\r\n     * @param {!Array.<Event>} eventDataList The new events to queue.\r\n     */\r\n    EventQueue.prototype.queueEvents = function (eventDataList) {\r\n        // We group events by path, storing them in a single EventList, to make it easier to skip over them quickly.\r\n        var currList = null;\r\n        for (var i = 0; i < eventDataList.length; i++) {\r\n            var eventData = eventDataList[i];\r\n            var eventPath = eventData.getPath();\r\n            if (currList !== null && !eventPath.equals(currList.getPath())) {\r\n                this.eventLists_.push(currList);\r\n                currList = null;\r\n            }\r\n            if (currList === null) {\r\n                currList = new EventList(eventPath);\r\n            }\r\n            currList.add(eventData);\r\n        }\r\n        if (currList) {\r\n            this.eventLists_.push(currList);\r\n        }\r\n    };\r\n    /**\r\n     * Queues the specified events and synchronously raises all events (including previously queued ones)\r\n     * for the specified path.\r\n     *\r\n     * It is assumed that the new events are all for the specified path.\r\n     *\r\n     * @param {!Path} path The path to raise events for.\r\n     * @param {!Array.<Event>} eventDataList The new events to raise.\r\n     */\r\n    EventQueue.prototype.raiseEventsAtPath = function (path, eventDataList) {\r\n        this.queueEvents(eventDataList);\r\n        this.raiseQueuedEventsMatchingPredicate_(function (eventPath) {\r\n            return eventPath.equals(path);\r\n        });\r\n    };\r\n    /**\r\n     * Queues the specified events and synchronously raises all events (including previously queued ones) for\r\n     * locations related to the specified change path (i.e. all ancestors and descendants).\r\n     *\r\n     * It is assumed that the new events are all related (ancestor or descendant) to the specified path.\r\n     *\r\n     * @param {!Path} changedPath The path to raise events for.\r\n     * @param {!Array.<!Event>} eventDataList The events to raise\r\n     */\r\n    EventQueue.prototype.raiseEventsForChangedPath = function (changedPath, eventDataList) {\r\n        this.queueEvents(eventDataList);\r\n        this.raiseQueuedEventsMatchingPredicate_(function (eventPath) {\r\n            return eventPath.contains(changedPath) || changedPath.contains(eventPath);\r\n        });\r\n    };\r\n    /**\r\n     * @param {!function(!Path):boolean} predicate\r\n     * @private\r\n     */\r\n    EventQueue.prototype.raiseQueuedEventsMatchingPredicate_ = function (predicate) {\r\n        this.recursionDepth_++;\r\n        var sentAll = true;\r\n        for (var i = 0; i < this.eventLists_.length; i++) {\r\n            var eventList = this.eventLists_[i];\r\n            if (eventList) {\r\n                var eventPath = eventList.getPath();\r\n                if (predicate(eventPath)) {\r\n                    this.eventLists_[i].raise();\r\n                    this.eventLists_[i] = null;\r\n                }\r\n                else {\r\n                    sentAll = false;\r\n                }\r\n            }\r\n        }\r\n        if (sentAll) {\r\n            this.eventLists_ = [];\r\n        }\r\n        this.recursionDepth_--;\r\n    };\r\n    return EventQueue;\r\n}());\r\n/**\r\n * @param {!Path} path\r\n * @constructor\r\n */\r\nvar EventList = /** @class */ (function () {\r\n    function EventList(path_) {\r\n        this.path_ = path_;\r\n        /**\r\n         * @type {!Array.<Event>}\r\n         * @private\r\n         */\r\n        this.events_ = [];\r\n    }\r\n    /**\r\n     * @param {!Event} eventData\r\n     */\r\n    EventList.prototype.add = function (eventData) {\r\n        this.events_.push(eventData);\r\n    };\r\n    /**\r\n     * Iterates through the list and raises each event\r\n     */\r\n    EventList.prototype.raise = function () {\r\n        for (var i = 0; i < this.events_.length; i++) {\r\n            var eventData = this.events_[i];\r\n            if (eventData !== null) {\r\n                this.events_[i] = null;\r\n                var eventFn = eventData.getEventRunner();\r\n                if (logger) {\r\n                    log('event: ' + eventData.toString());\r\n                }\r\n                exceptionGuard(eventFn);\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * @return {!Path}\r\n     */\r\n    EventList.prototype.getPath = function () {\r\n        return this.path_;\r\n    };\r\n    return EventList;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Base class to be used if you want to emit events. Call the constructor with\r\n * the set of allowed event names.\r\n */\r\nvar EventEmitter = /** @class */ (function () {\r\n    /**\r\n     * @param {!Array.<string>} allowedEvents_\r\n     */\r\n    function EventEmitter(allowedEvents_) {\r\n        this.allowedEvents_ = allowedEvents_;\r\n        this.listeners_ = {};\r\n        assert(Array.isArray(allowedEvents_) && allowedEvents_.length > 0, 'Requires a non-empty array');\r\n    }\r\n    /**\r\n     * To be called by derived classes to trigger events.\r\n     * @param {!string} eventType\r\n     * @param {...*} var_args\r\n     */\r\n    EventEmitter.prototype.trigger = function (eventType) {\r\n        var var_args = [];\r\n        for (var _i = 1; _i < arguments.length; _i++) {\r\n            var_args[_i - 1] = arguments[_i];\r\n        }\r\n        if (Array.isArray(this.listeners_[eventType])) {\r\n            // Clone the list, since callbacks could add/remove listeners.\r\n            var listeners = this.listeners_[eventType].slice();\r\n            for (var i = 0; i < listeners.length; i++) {\r\n                listeners[i].callback.apply(listeners[i].context, var_args);\r\n            }\r\n        }\r\n    };\r\n    EventEmitter.prototype.on = function (eventType, callback, context) {\r\n        this.validateEventType_(eventType);\r\n        this.listeners_[eventType] = this.listeners_[eventType] || [];\r\n        this.listeners_[eventType].push({ callback: callback, context: context });\r\n        var eventData = this.getInitialEvent(eventType);\r\n        if (eventData) {\r\n            callback.apply(context, eventData);\r\n        }\r\n    };\r\n    EventEmitter.prototype.off = function (eventType, callback, context) {\r\n        this.validateEventType_(eventType);\r\n        var listeners = this.listeners_[eventType] || [];\r\n        for (var i = 0; i < listeners.length; i++) {\r\n            if (listeners[i].callback === callback &&\r\n                (!context || context === listeners[i].context)) {\r\n                listeners.splice(i, 1);\r\n                return;\r\n            }\r\n        }\r\n    };\r\n    EventEmitter.prototype.validateEventType_ = function (eventType) {\r\n        assert(this.allowedEvents_.find(function (et) {\r\n            return et === eventType;\r\n        }), 'Unknown event: ' + eventType);\r\n    };\r\n    return EventEmitter;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * @extends {EventEmitter}\r\n */\r\nvar VisibilityMonitor = /** @class */ (function (_super) {\r\n    __extends(VisibilityMonitor, _super);\r\n    function VisibilityMonitor() {\r\n        var _this = _super.call(this, ['visible']) || this;\r\n        var hidden;\r\n        var visibilityChange;\r\n        if (typeof document !== 'undefined' &&\r\n            typeof document.addEventListener !== 'undefined') {\r\n            if (typeof document['hidden'] !== 'undefined') {\r\n                // Opera 12.10 and Firefox 18 and later support\r\n                visibilityChange = 'visibilitychange';\r\n                hidden = 'hidden';\r\n            }\r\n            else if (typeof document['mozHidden'] !== 'undefined') {\r\n                visibilityChange = 'mozvisibilitychange';\r\n                hidden = 'mozHidden';\r\n            }\r\n            else if (typeof document['msHidden'] !== 'undefined') {\r\n                visibilityChange = 'msvisibilitychange';\r\n                hidden = 'msHidden';\r\n            }\r\n            else if (typeof document['webkitHidden'] !== 'undefined') {\r\n                visibilityChange = 'webkitvisibilitychange';\r\n                hidden = 'webkitHidden';\r\n            }\r\n        }\r\n        // Initially, we always assume we are visible. This ensures that in browsers\r\n        // without page visibility support or in cases where we are never visible\r\n        // (e.g. chrome extension), we act as if we are visible, i.e. don't delay\r\n        // reconnects\r\n        _this.visible_ = true;\r\n        if (visibilityChange) {\r\n            document.addEventListener(visibilityChange, function () {\r\n                var visible = !document[hidden];\r\n                if (visible !== _this.visible_) {\r\n                    _this.visible_ = visible;\r\n                    _this.trigger('visible', visible);\r\n                }\r\n            }, false);\r\n        }\r\n        return _this;\r\n    }\r\n    VisibilityMonitor.getInstance = function () {\r\n        return new VisibilityMonitor();\r\n    };\r\n    /**\r\n     * @param {!string} eventType\r\n     * @return {Array.<boolean>}\r\n     */\r\n    VisibilityMonitor.prototype.getInitialEvent = function (eventType) {\r\n        assert(eventType === 'visible', 'Unknown event type: ' + eventType);\r\n        return [this.visible_];\r\n    };\r\n    return VisibilityMonitor;\r\n}(EventEmitter));\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Monitors online state (as reported by window.online/offline events).\r\n *\r\n * The expectation is that this could have many false positives (thinks we are online\r\n * when we're not), but no false negatives.  So we can safely use it to determine when\r\n * we definitely cannot reach the internet.\r\n *\r\n * @extends {EventEmitter}\r\n */\r\nvar OnlineMonitor = /** @class */ (function (_super) {\r\n    __extends(OnlineMonitor, _super);\r\n    function OnlineMonitor() {\r\n        var _this = _super.call(this, ['online']) || this;\r\n        _this.online_ = true;\r\n        // We've had repeated complaints that Cordova apps can get stuck \"offline\", e.g.\r\n        // https://forum.ionicframework.com/t/firebase-connection-is-lost-and-never-come-back/43810\r\n        // It would seem that the 'online' event does not always fire consistently. So we disable it\r\n        // for Cordova.\r\n        if (typeof window !== 'undefined' &&\r\n            typeof window.addEventListener !== 'undefined' &&\r\n            !isMobileCordova()) {\r\n            window.addEventListener('online', function () {\r\n                if (!_this.online_) {\r\n                    _this.online_ = true;\r\n                    _this.trigger('online', true);\r\n                }\r\n            }, false);\r\n            window.addEventListener('offline', function () {\r\n                if (_this.online_) {\r\n                    _this.online_ = false;\r\n                    _this.trigger('online', false);\r\n                }\r\n            }, false);\r\n        }\r\n        return _this;\r\n    }\r\n    OnlineMonitor.getInstance = function () {\r\n        return new OnlineMonitor();\r\n    };\r\n    /**\r\n     * @param {!string} eventType\r\n     * @return {Array.<boolean>}\r\n     */\r\n    OnlineMonitor.prototype.getInitialEvent = function (eventType) {\r\n        assert(eventType === 'online', 'Unknown event type: ' + eventType);\r\n        return [this.online_];\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    OnlineMonitor.prototype.currentlyOnline = function () {\r\n        return this.online_;\r\n    };\r\n    return OnlineMonitor;\r\n}(EventEmitter));\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * This class ensures the packets from the server arrive in order\r\n * This class takes data from the server and ensures it gets passed into the callbacks in order.\r\n * @constructor\r\n */\r\nvar PacketReceiver = /** @class */ (function () {\r\n    /**\r\n     * @param onMessage_\r\n     */\r\n    function PacketReceiver(onMessage_) {\r\n        this.onMessage_ = onMessage_;\r\n        this.pendingResponses = [];\r\n        this.currentResponseNum = 0;\r\n        this.closeAfterResponse = -1;\r\n        this.onClose = null;\r\n    }\r\n    PacketReceiver.prototype.closeAfter = function (responseNum, callback) {\r\n        this.closeAfterResponse = responseNum;\r\n        this.onClose = callback;\r\n        if (this.closeAfterResponse < this.currentResponseNum) {\r\n            this.onClose();\r\n            this.onClose = null;\r\n        }\r\n    };\r\n    /**\r\n     * Each message from the server comes with a response number, and an array of data. The responseNumber\r\n     * allows us to ensure that we process them in the right order, since we can't be guaranteed that all\r\n     * browsers will respond in the same order as the requests we sent\r\n     * @param {number} requestNum\r\n     * @param {Array} data\r\n     */\r\n    PacketReceiver.prototype.handleResponse = function (requestNum, data) {\r\n        var _this = this;\r\n        this.pendingResponses[requestNum] = data;\r\n        var _loop_1 = function () {\r\n            var toProcess = this_1.pendingResponses[this_1.currentResponseNum];\r\n            delete this_1.pendingResponses[this_1.currentResponseNum];\r\n            var _loop_2 = function (i) {\r\n                if (toProcess[i]) {\r\n                    exceptionGuard(function () {\r\n                        _this.onMessage_(toProcess[i]);\r\n                    });\r\n                }\r\n            };\r\n            for (var i = 0; i < toProcess.length; ++i) {\r\n                _loop_2(i);\r\n            }\r\n            if (this_1.currentResponseNum === this_1.closeAfterResponse) {\r\n                if (this_1.onClose) {\r\n                    this_1.onClose();\r\n                    this_1.onClose = null;\r\n                }\r\n                return \"break\";\r\n            }\r\n            this_1.currentResponseNum++;\r\n        };\r\n        var this_1 = this;\r\n        while (this.pendingResponses[this.currentResponseNum]) {\r\n            var state_1 = _loop_1();\r\n            if (state_1 === \"break\")\r\n                break;\r\n        }\r\n    };\r\n    return PacketReceiver;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// URL query parameters associated with longpolling\r\nvar FIREBASE_LONGPOLL_START_PARAM = 'start';\r\nvar FIREBASE_LONGPOLL_CLOSE_COMMAND = 'close';\r\nvar FIREBASE_LONGPOLL_COMMAND_CB_NAME = 'pLPCommand';\r\nvar FIREBASE_LONGPOLL_DATA_CB_NAME = 'pRTLPCB';\r\nvar FIREBASE_LONGPOLL_ID_PARAM = 'id';\r\nvar FIREBASE_LONGPOLL_PW_PARAM = 'pw';\r\nvar FIREBASE_LONGPOLL_SERIAL_PARAM = 'ser';\r\nvar FIREBASE_LONGPOLL_CALLBACK_ID_PARAM = 'cb';\r\nvar FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM = 'seg';\r\nvar FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET = 'ts';\r\nvar FIREBASE_LONGPOLL_DATA_PARAM = 'd';\r\nvar FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM = 'disconn';\r\nvar FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM = 'dframe';\r\n//Data size constants.\r\n//TODO: Perf: the maximum length actually differs from browser to browser.\r\n// We should check what browser we're on and set accordingly.\r\nvar MAX_URL_DATA_SIZE = 1870;\r\nvar SEG_HEADER_SIZE = 30; //ie: &seg=8299234&ts=982389123&d=\r\nvar MAX_PAYLOAD_SIZE = MAX_URL_DATA_SIZE - SEG_HEADER_SIZE;\r\n/**\r\n * Keepalive period\r\n * send a fresh request at minimum every 25 seconds. Opera has a maximum request\r\n * length of 30 seconds that we can't exceed.\r\n * @const\r\n * @type {number}\r\n */\r\nvar KEEPALIVE_REQUEST_INTERVAL = 25000;\r\n/**\r\n * How long to wait before aborting a long-polling connection attempt.\r\n * @const\r\n * @type {number}\r\n */\r\nvar LP_CONNECT_TIMEOUT = 30000;\r\n/**\r\n * This class manages a single long-polling connection.\r\n *\r\n * @constructor\r\n * @implements {Transport}\r\n */\r\nvar BrowserPollConnection = /** @class */ (function () {\r\n    /**\r\n     * @param {string} connId An identifier for this connection, used for logging\r\n     * @param {RepoInfo} repoInfo The info for the endpoint to send data to.\r\n     * @param {string=} transportSessionId Optional transportSessionid if we are reconnecting for an existing\r\n     *                                         transport session\r\n     * @param {string=}  lastSessionId Optional lastSessionId if the PersistentConnection has already created a\r\n     *                                     connection previously\r\n     */\r\n    function BrowserPollConnection(connId, repoInfo, transportSessionId, lastSessionId) {\r\n        this.connId = connId;\r\n        this.repoInfo = repoInfo;\r\n        this.transportSessionId = transportSessionId;\r\n        this.lastSessionId = lastSessionId;\r\n        this.bytesSent = 0;\r\n        this.bytesReceived = 0;\r\n        this.everConnected_ = false;\r\n        this.log_ = logWrapper(connId);\r\n        this.stats_ = StatsManager.getCollection(repoInfo);\r\n        this.urlFn = function (params) {\r\n            return repoInfo.connectionURL(LONG_POLLING, params);\r\n        };\r\n    }\r\n    /**\r\n     *\r\n     * @param {function(Object)} onMessage Callback when messages arrive\r\n     * @param {function()} onDisconnect Callback with connection lost.\r\n     */\r\n    BrowserPollConnection.prototype.open = function (onMessage, onDisconnect) {\r\n        var _this = this;\r\n        this.curSegmentNum = 0;\r\n        this.onDisconnect_ = onDisconnect;\r\n        this.myPacketOrderer = new PacketReceiver(onMessage);\r\n        this.isClosed_ = false;\r\n        this.connectTimeoutTimer_ = setTimeout(function () {\r\n            _this.log_('Timed out trying to connect.');\r\n            // Make sure we clear the host cache\r\n            _this.onClosed_();\r\n            _this.connectTimeoutTimer_ = null;\r\n        }, Math.floor(LP_CONNECT_TIMEOUT));\r\n        // Ensure we delay the creation of the iframe until the DOM is loaded.\r\n        executeWhenDOMReady(function () {\r\n            if (_this.isClosed_)\r\n                return;\r\n            //Set up a callback that gets triggered once a connection is set up.\r\n            _this.scriptTagHolder = new FirebaseIFrameScriptHolder(function () {\r\n                var args = [];\r\n                for (var _i = 0; _i < arguments.length; _i++) {\r\n                    args[_i] = arguments[_i];\r\n                }\r\n                var command = args[0], arg1 = args[1], arg2 = args[2];\r\n                _this.incrementIncomingBytes_(args);\r\n                if (!_this.scriptTagHolder)\r\n                    return; // we closed the connection.\r\n                if (_this.connectTimeoutTimer_) {\r\n                    clearTimeout(_this.connectTimeoutTimer_);\r\n                    _this.connectTimeoutTimer_ = null;\r\n                }\r\n                _this.everConnected_ = true;\r\n                if (command == FIREBASE_LONGPOLL_START_PARAM) {\r\n                    _this.id = arg1;\r\n                    _this.password = arg2;\r\n                }\r\n                else if (command === FIREBASE_LONGPOLL_CLOSE_COMMAND) {\r\n                    // Don't clear the host cache. We got a response from the server, so we know it's reachable\r\n                    if (arg1) {\r\n                        // We aren't expecting any more data (other than what the server's already in the process of sending us\r\n                        // through our already open polls), so don't send any more.\r\n                        _this.scriptTagHolder.sendNewPolls = false;\r\n                        // arg1 in this case is the last response number sent by the server. We should try to receive\r\n                        // all of the responses up to this one before closing\r\n                        _this.myPacketOrderer.closeAfter(arg1, function () {\r\n                            _this.onClosed_();\r\n                        });\r\n                    }\r\n                    else {\r\n                        _this.onClosed_();\r\n                    }\r\n                }\r\n                else {\r\n                    throw new Error('Unrecognized command received: ' + command);\r\n                }\r\n            }, function () {\r\n                var args = [];\r\n                for (var _i = 0; _i < arguments.length; _i++) {\r\n                    args[_i] = arguments[_i];\r\n                }\r\n                var pN = args[0], data = args[1];\r\n                _this.incrementIncomingBytes_(args);\r\n                _this.myPacketOrderer.handleResponse(pN, data);\r\n            }, function () {\r\n                _this.onClosed_();\r\n            }, _this.urlFn);\r\n            //Send the initial request to connect. The serial number is simply to keep the browser from pulling previous results\r\n            //from cache.\r\n            var urlParams = {};\r\n            urlParams[FIREBASE_LONGPOLL_START_PARAM] = 't';\r\n            urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = Math.floor(Math.random() * 100000000);\r\n            if (_this.scriptTagHolder.uniqueCallbackIdentifier)\r\n                urlParams[FIREBASE_LONGPOLL_CALLBACK_ID_PARAM] = _this.scriptTagHolder.uniqueCallbackIdentifier;\r\n            urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\r\n            if (_this.transportSessionId) {\r\n                urlParams[TRANSPORT_SESSION_PARAM] = _this.transportSessionId;\r\n            }\r\n            if (_this.lastSessionId) {\r\n                urlParams[LAST_SESSION_PARAM] = _this.lastSessionId;\r\n            }\r\n            if (!isNodeSdk() &&\r\n                typeof location !== 'undefined' &&\r\n                location.href &&\r\n                location.href.indexOf(FORGE_DOMAIN) !== -1) {\r\n                urlParams[REFERER_PARAM] = FORGE_REF;\r\n            }\r\n            var connectURL = _this.urlFn(urlParams);\r\n            _this.log_('Connecting via long-poll to ' + connectURL);\r\n            _this.scriptTagHolder.addTag(connectURL, function () {\r\n                /* do nothing */\r\n            });\r\n        });\r\n    };\r\n    /**\r\n     * Call this when a handshake has completed successfully and we want to consider the connection established\r\n     */\r\n    BrowserPollConnection.prototype.start = function () {\r\n        this.scriptTagHolder.startLongPoll(this.id, this.password);\r\n        this.addDisconnectPingFrame(this.id, this.password);\r\n    };\r\n    /**\r\n     * Forces long polling to be considered as a potential transport\r\n     */\r\n    BrowserPollConnection.forceAllow = function () {\r\n        BrowserPollConnection.forceAllow_ = true;\r\n    };\r\n    /**\r\n     * Forces longpolling to not be considered as a potential transport\r\n     */\r\n    BrowserPollConnection.forceDisallow = function () {\r\n        BrowserPollConnection.forceDisallow_ = true;\r\n    };\r\n    // Static method, use string literal so it can be accessed in a generic way\r\n    BrowserPollConnection.isAvailable = function () {\r\n        // NOTE: In React-Native there's normally no 'document', but if you debug a React-Native app in\r\n        // the Chrome debugger, 'document' is defined, but document.createElement is null (2015/06/08).\r\n        return (BrowserPollConnection.forceAllow_ ||\r\n            (!BrowserPollConnection.forceDisallow_ &&\r\n                typeof document !== 'undefined' &&\r\n                document.createElement != null &&\r\n                !isChromeExtensionContentScript() &&\r\n                !isWindowsStoreApp() &&\r\n                !isNodeSdk()));\r\n    };\r\n    /**\r\n     * No-op for polling\r\n     */\r\n    BrowserPollConnection.prototype.markConnectionHealthy = function () { };\r\n    /**\r\n     * Stops polling and cleans up the iframe\r\n     * @private\r\n     */\r\n    BrowserPollConnection.prototype.shutdown_ = function () {\r\n        this.isClosed_ = true;\r\n        if (this.scriptTagHolder) {\r\n            this.scriptTagHolder.close();\r\n            this.scriptTagHolder = null;\r\n        }\r\n        //remove the disconnect frame, which will trigger an XHR call to the server to tell it we're leaving.\r\n        if (this.myDisconnFrame) {\r\n            document.body.removeChild(this.myDisconnFrame);\r\n            this.myDisconnFrame = null;\r\n        }\r\n        if (this.connectTimeoutTimer_) {\r\n            clearTimeout(this.connectTimeoutTimer_);\r\n            this.connectTimeoutTimer_ = null;\r\n        }\r\n    };\r\n    /**\r\n     * Triggered when this transport is closed\r\n     * @private\r\n     */\r\n    BrowserPollConnection.prototype.onClosed_ = function () {\r\n        if (!this.isClosed_) {\r\n            this.log_('Longpoll is closing itself');\r\n            this.shutdown_();\r\n            if (this.onDisconnect_) {\r\n                this.onDisconnect_(this.everConnected_);\r\n                this.onDisconnect_ = null;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * External-facing close handler. RealTime has requested we shut down. Kill our connection and tell the server\r\n     * that we've left.\r\n     */\r\n    BrowserPollConnection.prototype.close = function () {\r\n        if (!this.isClosed_) {\r\n            this.log_('Longpoll is being closed.');\r\n            this.shutdown_();\r\n        }\r\n    };\r\n    /**\r\n     * Send the JSON object down to the server. It will need to be stringified, base64 encoded, and then\r\n     * broken into chunks (since URLs have a small maximum length).\r\n     * @param {!Object} data The JSON data to transmit.\r\n     */\r\n    BrowserPollConnection.prototype.send = function (data) {\r\n        var dataStr = stringify(data);\r\n        this.bytesSent += dataStr.length;\r\n        this.stats_.incrementCounter('bytes_sent', dataStr.length);\r\n        //first, lets get the base64-encoded data\r\n        var base64data = base64Encode(dataStr);\r\n        //We can only fit a certain amount in each URL, so we need to split this request\r\n        //up into multiple pieces if it doesn't fit in one request.\r\n        var dataSegs = splitStringBySize(base64data, MAX_PAYLOAD_SIZE);\r\n        //Enqueue each segment for transmission. We assign each chunk a sequential ID and a total number\r\n        //of segments so that we can reassemble the packet on the server.\r\n        for (var i = 0; i < dataSegs.length; i++) {\r\n            this.scriptTagHolder.enqueueSegment(this.curSegmentNum, dataSegs.length, dataSegs[i]);\r\n            this.curSegmentNum++;\r\n        }\r\n    };\r\n    /**\r\n     * This is how we notify the server that we're leaving.\r\n     * We aren't able to send requests with DHTML on a window close event, but we can\r\n     * trigger XHR requests in some browsers (everything but Opera basically).\r\n     * @param {!string} id\r\n     * @param {!string} pw\r\n     */\r\n    BrowserPollConnection.prototype.addDisconnectPingFrame = function (id, pw) {\r\n        if (isNodeSdk())\r\n            return;\r\n        this.myDisconnFrame = document.createElement('iframe');\r\n        var urlParams = {};\r\n        urlParams[FIREBASE_LONGPOLL_DISCONN_FRAME_REQUEST_PARAM] = 't';\r\n        urlParams[FIREBASE_LONGPOLL_ID_PARAM] = id;\r\n        urlParams[FIREBASE_LONGPOLL_PW_PARAM] = pw;\r\n        this.myDisconnFrame.src = this.urlFn(urlParams);\r\n        this.myDisconnFrame.style.display = 'none';\r\n        document.body.appendChild(this.myDisconnFrame);\r\n    };\r\n    /**\r\n     * Used to track the bytes received by this client\r\n     * @param {*} args\r\n     * @private\r\n     */\r\n    BrowserPollConnection.prototype.incrementIncomingBytes_ = function (args) {\r\n        // TODO: This is an annoying perf hit just to track the number of incoming bytes.  Maybe it should be opt-in.\r\n        var bytesReceived = stringify(args).length;\r\n        this.bytesReceived += bytesReceived;\r\n        this.stats_.incrementCounter('bytes_received', bytesReceived);\r\n    };\r\n    return BrowserPollConnection;\r\n}());\r\n/*********************************************************************************************\r\n * A wrapper around an iframe that is used as a long-polling script holder.\r\n * @constructor\r\n *********************************************************************************************/\r\nvar FirebaseIFrameScriptHolder = /** @class */ (function () {\r\n    /**\r\n     * @param commandCB - The callback to be called when control commands are recevied from the server.\r\n     * @param onMessageCB - The callback to be triggered when responses arrive from the server.\r\n     * @param onDisconnect - The callback to be triggered when this tag holder is closed\r\n     * @param urlFn - A function that provides the URL of the endpoint to send data to.\r\n     */\r\n    function FirebaseIFrameScriptHolder(commandCB, onMessageCB, onDisconnect, urlFn) {\r\n        this.onDisconnect = onDisconnect;\r\n        this.urlFn = urlFn;\r\n        //We maintain a count of all of the outstanding requests, because if we have too many active at once it can cause\r\n        //problems in some browsers.\r\n        /**\r\n         * @type {CountedSet.<number, number>}\r\n         */\r\n        this.outstandingRequests = new CountedSet();\r\n        //A queue of the pending segments waiting for transmission to the server.\r\n        this.pendingSegs = [];\r\n        //A serial number. We use this for two things:\r\n        // 1) A way to ensure the browser doesn't cache responses to polls\r\n        // 2) A way to make the server aware when long-polls arrive in a different order than we started them. The\r\n        //    server needs to release both polls in this case or it will cause problems in Opera since Opera can only execute\r\n        //    JSONP code in the order it was added to the iframe.\r\n        this.currentSerial = Math.floor(Math.random() * 100000000);\r\n        // This gets set to false when we're \"closing down\" the connection (e.g. we're switching transports but there's still\r\n        // incoming data from the server that we're waiting for).\r\n        this.sendNewPolls = true;\r\n        if (!isNodeSdk()) {\r\n            //Each script holder registers a couple of uniquely named callbacks with the window. These are called from the\r\n            //iframes where we put the long-polling script tags. We have two callbacks:\r\n            //   1) Command Callback - Triggered for control issues, like starting a connection.\r\n            //   2) Message Callback - Triggered when new data arrives.\r\n            this.uniqueCallbackIdentifier = LUIDGenerator();\r\n            window[FIREBASE_LONGPOLL_COMMAND_CB_NAME + this.uniqueCallbackIdentifier] = commandCB;\r\n            window[FIREBASE_LONGPOLL_DATA_CB_NAME + this.uniqueCallbackIdentifier] = onMessageCB;\r\n            //Create an iframe for us to add script tags to.\r\n            this.myIFrame = FirebaseIFrameScriptHolder.createIFrame_();\r\n            // Set the iframe's contents.\r\n            var script = '';\r\n            // if we set a javascript url, it's IE and we need to set the document domain. The javascript url is sufficient\r\n            // for ie9, but ie8 needs to do it again in the document itself.\r\n            if (this.myIFrame.src &&\r\n                this.myIFrame.src.substr(0, 'javascript:'.length) === 'javascript:') {\r\n                var currentDomain = document.domain;\r\n                script = '<script>document.domain=\"' + currentDomain + '\";</script>';\r\n            }\r\n            var iframeContents = '<html><body>' + script + '</body></html>';\r\n            try {\r\n                this.myIFrame.doc.open();\r\n                this.myIFrame.doc.write(iframeContents);\r\n                this.myIFrame.doc.close();\r\n            }\r\n            catch (e) {\r\n                log('frame writing exception');\r\n                if (e.stack) {\r\n                    log(e.stack);\r\n                }\r\n                log(e);\r\n            }\r\n        }\r\n        else {\r\n            this.commandCB = commandCB;\r\n            this.onMessageCB = onMessageCB;\r\n        }\r\n    }\r\n    /**\r\n     * Each browser has its own funny way to handle iframes. Here we mush them all together into one object that I can\r\n     * actually use.\r\n     * @private\r\n     * @return {Element}\r\n     */\r\n    FirebaseIFrameScriptHolder.createIFrame_ = function () {\r\n        var iframe = document.createElement('iframe');\r\n        iframe.style.display = 'none';\r\n        // This is necessary in order to initialize the document inside the iframe\r\n        if (document.body) {\r\n            document.body.appendChild(iframe);\r\n            try {\r\n                // If document.domain has been modified in IE, this will throw an error, and we need to set the\r\n                // domain of the iframe's document manually. We can do this via a javascript: url as the src attribute\r\n                // Also note that we must do this *after* the iframe has been appended to the page. Otherwise it doesn't work.\r\n                var a = iframe.contentWindow.document;\r\n                if (!a) {\r\n                    // Apologies for the log-spam, I need to do something to keep closure from optimizing out the assignment above.\r\n                    log('No IE domain setting required');\r\n                }\r\n            }\r\n            catch (e) {\r\n                var domain = document.domain;\r\n                iframe.src =\r\n                    \"javascript:void((function(){document.open();document.domain='\" +\r\n                        domain +\r\n                        \"';document.close();})())\";\r\n            }\r\n        }\r\n        else {\r\n            // LongPollConnection attempts to delay initialization until the document is ready, so hopefully this\r\n            // never gets hit.\r\n            throw 'Document body has not initialized. Wait to initialize Firebase until after the document is ready.';\r\n        }\r\n        // Get the document of the iframe in a browser-specific way.\r\n        if (iframe.contentDocument) {\r\n            iframe.doc = iframe.contentDocument; // Firefox, Opera, Safari\r\n        }\r\n        else if (iframe.contentWindow) {\r\n            iframe.doc = iframe.contentWindow.document; // Internet Explorer\r\n        }\r\n        else if (iframe.document) {\r\n            iframe.doc = iframe.document; //others?\r\n        }\r\n        return iframe;\r\n    };\r\n    /**\r\n     * Cancel all outstanding queries and remove the frame.\r\n     */\r\n    FirebaseIFrameScriptHolder.prototype.close = function () {\r\n        var _this = this;\r\n        //Mark this iframe as dead, so no new requests are sent.\r\n        this.alive = false;\r\n        if (this.myIFrame) {\r\n            //We have to actually remove all of the html inside this iframe before removing it from the\r\n            //window, or IE will continue loading and executing the script tags we've already added, which\r\n            //can lead to some errors being thrown. Setting innerHTML seems to be the easiest way to do this.\r\n            this.myIFrame.doc.body.innerHTML = '';\r\n            setTimeout(function () {\r\n                if (_this.myIFrame !== null) {\r\n                    document.body.removeChild(_this.myIFrame);\r\n                    _this.myIFrame = null;\r\n                }\r\n            }, Math.floor(0));\r\n        }\r\n        if (isNodeSdk() && this.myID) {\r\n            var urlParams = {};\r\n            urlParams[FIREBASE_LONGPOLL_DISCONN_FRAME_PARAM] = 't';\r\n            urlParams[FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\r\n            urlParams[FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\r\n            var theURL = this.urlFn(urlParams);\r\n            FirebaseIFrameScriptHolder.nodeRestRequest(theURL);\r\n        }\r\n        // Protect from being called recursively.\r\n        var onDisconnect = this.onDisconnect;\r\n        if (onDisconnect) {\r\n            this.onDisconnect = null;\r\n            onDisconnect();\r\n        }\r\n    };\r\n    /**\r\n     * Actually start the long-polling session by adding the first script tag(s) to the iframe.\r\n     * @param {!string} id - The ID of this connection\r\n     * @param {!string} pw - The password for this connection\r\n     */\r\n    FirebaseIFrameScriptHolder.prototype.startLongPoll = function (id, pw) {\r\n        this.myID = id;\r\n        this.myPW = pw;\r\n        this.alive = true;\r\n        //send the initial request. If there are requests queued, make sure that we transmit as many as we are currently able to.\r\n        while (this.newRequest_()) { }\r\n    };\r\n    /**\r\n     * This is called any time someone might want a script tag to be added. It adds a script tag when there aren't\r\n     * too many outstanding requests and we are still alive.\r\n     *\r\n     * If there are outstanding packet segments to send, it sends one. If there aren't, it sends a long-poll anyways if\r\n     * needed.\r\n     */\r\n    FirebaseIFrameScriptHolder.prototype.newRequest_ = function () {\r\n        // We keep one outstanding request open all the time to receive data, but if we need to send data\r\n        // (pendingSegs.length > 0) then we create a new request to send the data.  The server will automatically\r\n        // close the old request.\r\n        if (this.alive &&\r\n            this.sendNewPolls &&\r\n            this.outstandingRequests.count() < (this.pendingSegs.length > 0 ? 2 : 1)) {\r\n            //construct our url\r\n            this.currentSerial++;\r\n            var urlParams = {};\r\n            urlParams[FIREBASE_LONGPOLL_ID_PARAM] = this.myID;\r\n            urlParams[FIREBASE_LONGPOLL_PW_PARAM] = this.myPW;\r\n            urlParams[FIREBASE_LONGPOLL_SERIAL_PARAM] = this.currentSerial;\r\n            var theURL = this.urlFn(urlParams);\r\n            //Now add as much data as we can.\r\n            var curDataString = '';\r\n            var i = 0;\r\n            while (this.pendingSegs.length > 0) {\r\n                //first, lets see if the next segment will fit.\r\n                var nextSeg = this.pendingSegs[0];\r\n                if (nextSeg.d.length + SEG_HEADER_SIZE + curDataString.length <=\r\n                    MAX_URL_DATA_SIZE) {\r\n                    //great, the segment will fit. Lets append it.\r\n                    var theSeg = this.pendingSegs.shift();\r\n                    curDataString =\r\n                        curDataString +\r\n                            '&' +\r\n                            FIREBASE_LONGPOLL_SEGMENT_NUM_PARAM +\r\n                            i +\r\n                            '=' +\r\n                            theSeg.seg +\r\n                            '&' +\r\n                            FIREBASE_LONGPOLL_SEGMENTS_IN_PACKET +\r\n                            i +\r\n                            '=' +\r\n                            theSeg.ts +\r\n                            '&' +\r\n                            FIREBASE_LONGPOLL_DATA_PARAM +\r\n                            i +\r\n                            '=' +\r\n                            theSeg.d;\r\n                    i++;\r\n                }\r\n                else {\r\n                    break;\r\n                }\r\n            }\r\n            theURL = theURL + curDataString;\r\n            this.addLongPollTag_(theURL, this.currentSerial);\r\n            return true;\r\n        }\r\n        else {\r\n            return false;\r\n        }\r\n    };\r\n    /**\r\n     * Queue a packet for transmission to the server.\r\n     * @param segnum - A sequential id for this packet segment used for reassembly\r\n     * @param totalsegs - The total number of segments in this packet\r\n     * @param data - The data for this segment.\r\n     */\r\n    FirebaseIFrameScriptHolder.prototype.enqueueSegment = function (segnum, totalsegs, data) {\r\n        //add this to the queue of segments to send.\r\n        this.pendingSegs.push({ seg: segnum, ts: totalsegs, d: data });\r\n        //send the data immediately if there isn't already data being transmitted, unless\r\n        //startLongPoll hasn't been called yet.\r\n        if (this.alive) {\r\n            this.newRequest_();\r\n        }\r\n    };\r\n    /**\r\n     * Add a script tag for a regular long-poll request.\r\n     * @param {!string} url - The URL of the script tag.\r\n     * @param {!number} serial - The serial number of the request.\r\n     * @private\r\n     */\r\n    FirebaseIFrameScriptHolder.prototype.addLongPollTag_ = function (url, serial) {\r\n        var _this = this;\r\n        //remember that we sent this request.\r\n        this.outstandingRequests.add(serial, 1);\r\n        var doNewRequest = function () {\r\n            _this.outstandingRequests.remove(serial);\r\n            _this.newRequest_();\r\n        };\r\n        // If this request doesn't return on its own accord (by the server sending us some data), we'll\r\n        // create a new one after the KEEPALIVE interval to make sure we always keep a fresh request open.\r\n        var keepaliveTimeout = setTimeout(doNewRequest, Math.floor(KEEPALIVE_REQUEST_INTERVAL));\r\n        var readyStateCB = function () {\r\n            // Request completed.  Cancel the keepalive.\r\n            clearTimeout(keepaliveTimeout);\r\n            // Trigger a new request so we can continue receiving data.\r\n            doNewRequest();\r\n        };\r\n        this.addTag(url, readyStateCB);\r\n    };\r\n    /**\r\n     * Add an arbitrary script tag to the iframe.\r\n     * @param {!string} url - The URL for the script tag source.\r\n     * @param {!function()} loadCB - A callback to be triggered once the script has loaded.\r\n     */\r\n    FirebaseIFrameScriptHolder.prototype.addTag = function (url, loadCB) {\r\n        var _this = this;\r\n        if (isNodeSdk()) {\r\n            this.doNodeLongPoll(url, loadCB);\r\n        }\r\n        else {\r\n            setTimeout(function () {\r\n                try {\r\n                    // if we're already closed, don't add this poll\r\n                    if (!_this.sendNewPolls)\r\n                        return;\r\n                    var newScript_1 = _this.myIFrame.doc.createElement('script');\r\n                    newScript_1.type = 'text/javascript';\r\n                    newScript_1.async = true;\r\n                    newScript_1.src = url;\r\n                    newScript_1.onload = newScript_1.onreadystatechange = function () {\r\n                        var rstate = newScript_1.readyState;\r\n                        if (!rstate || rstate === 'loaded' || rstate === 'complete') {\r\n                            newScript_1.onload = newScript_1.onreadystatechange = null;\r\n                            if (newScript_1.parentNode) {\r\n                                newScript_1.parentNode.removeChild(newScript_1);\r\n                            }\r\n                            loadCB();\r\n                        }\r\n                    };\r\n                    newScript_1.onerror = function () {\r\n                        log('Long-poll script failed to load: ' + url);\r\n                        _this.sendNewPolls = false;\r\n                        _this.close();\r\n                    };\r\n                    _this.myIFrame.doc.body.appendChild(newScript_1);\r\n                }\r\n                catch (e) {\r\n                    // TODO: we should make this error visible somehow\r\n                }\r\n            }, Math.floor(1));\r\n        }\r\n    };\r\n    return FirebaseIFrameScriptHolder;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar WEBSOCKET_MAX_FRAME_SIZE = 16384;\r\nvar WEBSOCKET_KEEPALIVE_INTERVAL = 45000;\r\nvar WebSocketImpl = null;\r\nif (typeof MozWebSocket !== 'undefined') {\r\n    WebSocketImpl = MozWebSocket;\r\n}\r\nelse if (typeof WebSocket !== 'undefined') {\r\n    WebSocketImpl = WebSocket;\r\n}\r\n/**\r\n * Create a new websocket connection with the given callbacks.\r\n * @constructor\r\n * @implements {Transport}\r\n */\r\nvar WebSocketConnection = /** @class */ (function () {\r\n    /**\r\n     * @param {string} connId identifier for this transport\r\n     * @param {RepoInfo} repoInfo The info for the websocket endpoint.\r\n     * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\r\n     *                                         session\r\n     * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\r\n     */\r\n    function WebSocketConnection(connId, repoInfo, transportSessionId, lastSessionId) {\r\n        this.connId = connId;\r\n        this.keepaliveTimer = null;\r\n        this.frames = null;\r\n        this.totalFrames = 0;\r\n        this.bytesSent = 0;\r\n        this.bytesReceived = 0;\r\n        this.log_ = logWrapper(this.connId);\r\n        this.stats_ = StatsManager.getCollection(repoInfo);\r\n        this.connURL = WebSocketConnection.connectionURL_(repoInfo, transportSessionId, lastSessionId);\r\n    }\r\n    /**\r\n     * @param {RepoInfo} repoInfo The info for the websocket endpoint.\r\n     * @param {string=} transportSessionId Optional transportSessionId if this is connecting to an existing transport\r\n     *                                         session\r\n     * @param {string=} lastSessionId Optional lastSessionId if there was a previous connection\r\n     * @return {string} connection url\r\n     * @private\r\n     */\r\n    WebSocketConnection.connectionURL_ = function (repoInfo, transportSessionId, lastSessionId) {\r\n        var urlParams = {};\r\n        urlParams[VERSION_PARAM] = PROTOCOL_VERSION;\r\n        if (!isNodeSdk() &&\r\n            typeof location !== 'undefined' &&\r\n            location.href &&\r\n            location.href.indexOf(FORGE_DOMAIN) !== -1) {\r\n            urlParams[REFERER_PARAM] = FORGE_REF;\r\n        }\r\n        if (transportSessionId) {\r\n            urlParams[TRANSPORT_SESSION_PARAM] = transportSessionId;\r\n        }\r\n        if (lastSessionId) {\r\n            urlParams[LAST_SESSION_PARAM] = lastSessionId;\r\n        }\r\n        return repoInfo.connectionURL(WEBSOCKET, urlParams);\r\n    };\r\n    /**\r\n     *\r\n     * @param onMessage Callback when messages arrive\r\n     * @param onDisconnect Callback with connection lost.\r\n     */\r\n    WebSocketConnection.prototype.open = function (onMessage, onDisconnect) {\r\n        var _this = this;\r\n        this.onDisconnect = onDisconnect;\r\n        this.onMessage = onMessage;\r\n        this.log_('Websocket connecting to ' + this.connURL);\r\n        this.everConnected_ = false;\r\n        // Assume failure until proven otherwise.\r\n        PersistentStorage.set('previous_websocket_failure', true);\r\n        try {\r\n            if (isNodeSdk()) {\r\n                var device = CONSTANTS.NODE_ADMIN ? 'AdminNode' : 'Node';\r\n                // UA Format: Firebase/<wire_protocol>/<sdk_version>/<platform>/<device>\r\n                var options = {\r\n                    headers: {\r\n                        'User-Agent': \"Firebase/\" + PROTOCOL_VERSION + \"/\" + firebase.SDK_VERSION + \"/\" + process.platform + \"/\" + device\r\n                    }\r\n                };\r\n                // Plumb appropriate http_proxy environment variable into faye-websocket if it exists.\r\n                var env = process['env'];\r\n                var proxy = this.connURL.indexOf('wss://') == 0\r\n                    ? env['HTTPS_PROXY'] || env['https_proxy']\r\n                    : env['HTTP_PROXY'] || env['http_proxy'];\r\n                if (proxy) {\r\n                    options['proxy'] = { origin: proxy };\r\n                }\r\n                this.mySock = new WebSocketImpl(this.connURL, [], options);\r\n            }\r\n            else {\r\n                this.mySock = new WebSocketImpl(this.connURL);\r\n            }\r\n        }\r\n        catch (e) {\r\n            this.log_('Error instantiating WebSocket.');\r\n            var error$$1 = e.message || e.data;\r\n            if (error$$1) {\r\n                this.log_(error$$1);\r\n            }\r\n            this.onClosed_();\r\n            return;\r\n        }\r\n        this.mySock.onopen = function () {\r\n            _this.log_('Websocket connected.');\r\n            _this.everConnected_ = true;\r\n        };\r\n        this.mySock.onclose = function () {\r\n            _this.log_('Websocket connection was disconnected.');\r\n            _this.mySock = null;\r\n            _this.onClosed_();\r\n        };\r\n        this.mySock.onmessage = function (m) {\r\n            _this.handleIncomingFrame(m);\r\n        };\r\n        this.mySock.onerror = function (e) {\r\n            _this.log_('WebSocket error.  Closing connection.');\r\n            var error$$1 = e.message || e.data;\r\n            if (error$$1) {\r\n                _this.log_(error$$1);\r\n            }\r\n            _this.onClosed_();\r\n        };\r\n    };\r\n    /**\r\n     * No-op for websockets, we don't need to do anything once the connection is confirmed as open\r\n     */\r\n    WebSocketConnection.prototype.start = function () { };\r\n    WebSocketConnection.forceDisallow = function () {\r\n        WebSocketConnection.forceDisallow_ = true;\r\n    };\r\n    WebSocketConnection.isAvailable = function () {\r\n        var isOldAndroid = false;\r\n        if (typeof navigator !== 'undefined' && navigator.userAgent) {\r\n            var oldAndroidRegex = /Android ([0-9]{0,}\\.[0-9]{0,})/;\r\n            var oldAndroidMatch = navigator.userAgent.match(oldAndroidRegex);\r\n            if (oldAndroidMatch && oldAndroidMatch.length > 1) {\r\n                if (parseFloat(oldAndroidMatch[1]) < 4.4) {\r\n                    isOldAndroid = true;\r\n                }\r\n            }\r\n        }\r\n        return (!isOldAndroid &&\r\n            WebSocketImpl !== null &&\r\n            !WebSocketConnection.forceDisallow_);\r\n    };\r\n    /**\r\n     * Returns true if we previously failed to connect with this transport.\r\n     * @return {boolean}\r\n     */\r\n    WebSocketConnection.previouslyFailed = function () {\r\n        // If our persistent storage is actually only in-memory storage,\r\n        // we default to assuming that it previously failed to be safe.\r\n        return (PersistentStorage.isInMemoryStorage ||\r\n            PersistentStorage.get('previous_websocket_failure') === true);\r\n    };\r\n    WebSocketConnection.prototype.markConnectionHealthy = function () {\r\n        PersistentStorage.remove('previous_websocket_failure');\r\n    };\r\n    WebSocketConnection.prototype.appendFrame_ = function (data) {\r\n        this.frames.push(data);\r\n        if (this.frames.length == this.totalFrames) {\r\n            var fullMess = this.frames.join('');\r\n            this.frames = null;\r\n            var jsonMess = jsonEval(fullMess);\r\n            //handle the message\r\n            this.onMessage(jsonMess);\r\n        }\r\n    };\r\n    /**\r\n     * @param {number} frameCount The number of frames we are expecting from the server\r\n     * @private\r\n     */\r\n    WebSocketConnection.prototype.handleNewFrameCount_ = function (frameCount) {\r\n        this.totalFrames = frameCount;\r\n        this.frames = [];\r\n    };\r\n    /**\r\n     * Attempts to parse a frame count out of some text. If it can't, assumes a value of 1\r\n     * @param {!String} data\r\n     * @return {?String} Any remaining data to be process, or null if there is none\r\n     * @private\r\n     */\r\n    WebSocketConnection.prototype.extractFrameCount_ = function (data) {\r\n        assert(this.frames === null, 'We already have a frame buffer');\r\n        // TODO: The server is only supposed to send up to 9999 frames (i.e. length <= 4), but that isn't being enforced\r\n        // currently.  So allowing larger frame counts (length <= 6).  See https://app.asana.com/0/search/8688598998380/8237608042508\r\n        if (data.length <= 6) {\r\n            var frameCount = Number(data);\r\n            if (!isNaN(frameCount)) {\r\n                this.handleNewFrameCount_(frameCount);\r\n                return null;\r\n            }\r\n        }\r\n        this.handleNewFrameCount_(1);\r\n        return data;\r\n    };\r\n    /**\r\n     * Process a websocket frame that has arrived from the server.\r\n     * @param mess The frame data\r\n     */\r\n    WebSocketConnection.prototype.handleIncomingFrame = function (mess) {\r\n        if (this.mySock === null)\r\n            return; // Chrome apparently delivers incoming packets even after we .close() the connection sometimes.\r\n        var data = mess['data'];\r\n        this.bytesReceived += data.length;\r\n        this.stats_.incrementCounter('bytes_received', data.length);\r\n        this.resetKeepAlive();\r\n        if (this.frames !== null) {\r\n            // we're buffering\r\n            this.appendFrame_(data);\r\n        }\r\n        else {\r\n            // try to parse out a frame count, otherwise, assume 1 and process it\r\n            var remainingData = this.extractFrameCount_(data);\r\n            if (remainingData !== null) {\r\n                this.appendFrame_(remainingData);\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * Send a message to the server\r\n     * @param {Object} data The JSON object to transmit\r\n     */\r\n    WebSocketConnection.prototype.send = function (data) {\r\n        this.resetKeepAlive();\r\n        var dataStr = stringify(data);\r\n        this.bytesSent += dataStr.length;\r\n        this.stats_.incrementCounter('bytes_sent', dataStr.length);\r\n        //We can only fit a certain amount in each websocket frame, so we need to split this request\r\n        //up into multiple pieces if it doesn't fit in one request.\r\n        var dataSegs = splitStringBySize(dataStr, WEBSOCKET_MAX_FRAME_SIZE);\r\n        //Send the length header\r\n        if (dataSegs.length > 1) {\r\n            this.sendString_(String(dataSegs.length));\r\n        }\r\n        //Send the actual data in segments.\r\n        for (var i = 0; i < dataSegs.length; i++) {\r\n            this.sendString_(dataSegs[i]);\r\n        }\r\n    };\r\n    WebSocketConnection.prototype.shutdown_ = function () {\r\n        this.isClosed_ = true;\r\n        if (this.keepaliveTimer) {\r\n            clearInterval(this.keepaliveTimer);\r\n            this.keepaliveTimer = null;\r\n        }\r\n        if (this.mySock) {\r\n            this.mySock.close();\r\n            this.mySock = null;\r\n        }\r\n    };\r\n    WebSocketConnection.prototype.onClosed_ = function () {\r\n        if (!this.isClosed_) {\r\n            this.log_('WebSocket is closing itself');\r\n            this.shutdown_();\r\n            // since this is an internal close, trigger the close listener\r\n            if (this.onDisconnect) {\r\n                this.onDisconnect(this.everConnected_);\r\n                this.onDisconnect = null;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * External-facing close handler.\r\n     * Close the websocket and kill the connection.\r\n     */\r\n    WebSocketConnection.prototype.close = function () {\r\n        if (!this.isClosed_) {\r\n            this.log_('WebSocket is being closed');\r\n            this.shutdown_();\r\n        }\r\n    };\r\n    /**\r\n     * Kill the current keepalive timer and start a new one, to ensure that it always fires N seconds after\r\n     * the last activity.\r\n     */\r\n    WebSocketConnection.prototype.resetKeepAlive = function () {\r\n        var _this = this;\r\n        clearInterval(this.keepaliveTimer);\r\n        this.keepaliveTimer = setInterval(function () {\r\n            //If there has been no websocket activity for a while, send a no-op\r\n            if (_this.mySock) {\r\n                _this.sendString_('0');\r\n            }\r\n            _this.resetKeepAlive();\r\n        }, Math.floor(WEBSOCKET_KEEPALIVE_INTERVAL));\r\n    };\r\n    /**\r\n     * Send a string over the websocket.\r\n     *\r\n     * @param {string} str String to send.\r\n     * @private\r\n     */\r\n    WebSocketConnection.prototype.sendString_ = function (str) {\r\n        // Firefox seems to sometimes throw exceptions (NS_ERROR_UNEXPECTED) from websocket .send()\r\n        // calls for some unknown reason.  We treat these as an error and disconnect.\r\n        // See https://app.asana.com/0/58926111402292/68021340250410\r\n        try {\r\n            this.mySock.send(str);\r\n        }\r\n        catch (e) {\r\n            this.log_('Exception thrown from WebSocket.send():', e.message || e.data, 'Closing connection.');\r\n            setTimeout(this.onClosed_.bind(this), 0);\r\n        }\r\n    };\r\n    /**\r\n     * Number of response before we consider the connection \"healthy.\"\r\n     * @type {number}\r\n     */\r\n    WebSocketConnection.responsesRequiredToBeHealthy = 2;\r\n    /**\r\n     * Time to wait for the connection te become healthy before giving up.\r\n     * @type {number}\r\n     */\r\n    WebSocketConnection.healthyTimeout = 30000;\r\n    return WebSocketConnection;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Currently simplistic, this class manages what transport a Connection should use at various stages of its\r\n * lifecycle.\r\n *\r\n * It starts with longpolling in a browser, and httppolling on node. It then upgrades to websockets if\r\n * they are available.\r\n * @constructor\r\n */\r\nvar TransportManager = /** @class */ (function () {\r\n    /**\r\n     * @param {!RepoInfo} repoInfo Metadata around the namespace we're connecting to\r\n     */\r\n    function TransportManager(repoInfo) {\r\n        this.initTransports_(repoInfo);\r\n    }\r\n    Object.defineProperty(TransportManager, \"ALL_TRANSPORTS\", {\r\n        /**\r\n         * @const\r\n         * @type {!Array.<function(new:Transport, string, RepoInfo, string=)>}\r\n         */\r\n        get: function () {\r\n            return [BrowserPollConnection, WebSocketConnection];\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    /**\r\n     * @param {!RepoInfo} repoInfo\r\n     * @private\r\n     */\r\n    TransportManager.prototype.initTransports_ = function (repoInfo) {\r\n        var isWebSocketsAvailable = WebSocketConnection && WebSocketConnection['isAvailable']();\r\n        var isSkipPollConnection = isWebSocketsAvailable && !WebSocketConnection.previouslyFailed();\r\n        if (repoInfo.webSocketOnly) {\r\n            if (!isWebSocketsAvailable)\r\n                warn(\"wss:// URL used, but browser isn't known to support websockets.  Trying anyway.\");\r\n            isSkipPollConnection = true;\r\n        }\r\n        if (isSkipPollConnection) {\r\n            this.transports_ = [WebSocketConnection];\r\n        }\r\n        else {\r\n            var transports_1 = (this.transports_ = []);\r\n            each(TransportManager.ALL_TRANSPORTS, function (i, transport) {\r\n                if (transport && transport['isAvailable']()) {\r\n                    transports_1.push(transport);\r\n                }\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * @return {function(new:Transport, !string, !RepoInfo, string=, string=)} The constructor for the\r\n     * initial transport to use\r\n     */\r\n    TransportManager.prototype.initialTransport = function () {\r\n        if (this.transports_.length > 0) {\r\n            return this.transports_[0];\r\n        }\r\n        else {\r\n            throw new Error('No transports available');\r\n        }\r\n    };\r\n    /**\r\n     * @return {?function(new:Transport, function(),function(), string=)} The constructor for the next\r\n     * transport, or null\r\n     */\r\n    TransportManager.prototype.upgradeTransport = function () {\r\n        if (this.transports_.length > 1) {\r\n            return this.transports_[1];\r\n        }\r\n        else {\r\n            return null;\r\n        }\r\n    };\r\n    return TransportManager;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// Abort upgrade attempt if it takes longer than 60s.\r\nvar UPGRADE_TIMEOUT = 60000;\r\n// For some transports (WebSockets), we need to \"validate\" the transport by exchanging a few requests and responses.\r\n// If we haven't sent enough requests within 5s, we'll start sending noop ping requests.\r\nvar DELAY_BEFORE_SENDING_EXTRA_REQUESTS = 5000;\r\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)\r\n// then we may not be able to exchange our ping/pong requests within the healthy timeout.  So if we reach the timeout\r\n// but we've sent/received enough bytes, we don't cancel the connection.\r\nvar BYTES_SENT_HEALTHY_OVERRIDE = 10 * 1024;\r\nvar BYTES_RECEIVED_HEALTHY_OVERRIDE = 100 * 1024;\r\nvar MESSAGE_TYPE = 't';\r\nvar MESSAGE_DATA = 'd';\r\nvar CONTROL_SHUTDOWN = 's';\r\nvar CONTROL_RESET = 'r';\r\nvar CONTROL_ERROR = 'e';\r\nvar CONTROL_PONG = 'o';\r\nvar SWITCH_ACK = 'a';\r\nvar END_TRANSMISSION = 'n';\r\nvar PING = 'p';\r\nvar SERVER_HELLO = 'h';\r\n/**\r\n * Creates a new real-time connection to the server using whichever method works\r\n * best in the current browser.\r\n *\r\n * @constructor\r\n */\r\nvar Connection = /** @class */ (function () {\r\n    /**\r\n     * @param {!string} id - an id for this connection\r\n     * @param {!RepoInfo} repoInfo_ - the info for the endpoint to connect to\r\n     * @param {function(Object)} onMessage_ - the callback to be triggered when a server-push message arrives\r\n     * @param {function(number, string)} onReady_ - the callback to be triggered when this connection is ready to send messages.\r\n     * @param {function()} onDisconnect_ - the callback to be triggered when a connection was lost\r\n     * @param {function(string)} onKill_ - the callback to be triggered when this connection has permanently shut down.\r\n     * @param {string=} lastSessionId - last session id in persistent connection. is used to clean up old session in real-time server\r\n     */\r\n    function Connection(id, repoInfo_, onMessage_, onReady_, onDisconnect_, onKill_, lastSessionId) {\r\n        this.id = id;\r\n        this.repoInfo_ = repoInfo_;\r\n        this.onMessage_ = onMessage_;\r\n        this.onReady_ = onReady_;\r\n        this.onDisconnect_ = onDisconnect_;\r\n        this.onKill_ = onKill_;\r\n        this.lastSessionId = lastSessionId;\r\n        this.connectionCount = 0;\r\n        this.pendingDataMessages = [];\r\n        this.state_ = 0 /* CONNECTING */;\r\n        this.log_ = logWrapper('c:' + this.id + ':');\r\n        this.transportManager_ = new TransportManager(repoInfo_);\r\n        this.log_('Connection created');\r\n        this.start_();\r\n    }\r\n    /**\r\n     * Starts a connection attempt\r\n     * @private\r\n     */\r\n    Connection.prototype.start_ = function () {\r\n        var _this = this;\r\n        var conn = this.transportManager_.initialTransport();\r\n        this.conn_ = new conn(this.nextTransportId_(), this.repoInfo_, undefined, this.lastSessionId);\r\n        // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\r\n        // can consider the transport healthy.\r\n        this.primaryResponsesRequired_ = conn['responsesRequiredToBeHealthy'] || 0;\r\n        var onMessageReceived = this.connReceiver_(this.conn_);\r\n        var onConnectionLost = this.disconnReceiver_(this.conn_);\r\n        this.tx_ = this.conn_;\r\n        this.rx_ = this.conn_;\r\n        this.secondaryConn_ = null;\r\n        this.isHealthy_ = false;\r\n        /*\r\n         * Firefox doesn't like when code from one iframe tries to create another iframe by way of the parent frame.\r\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.\r\n         * Somehow, setTimeout seems to make this ok. That doesn't make sense from a security perspective, since you should\r\n         * still have the context of your originating frame.\r\n         */\r\n        setTimeout(function () {\r\n            // this.conn_ gets set to null in some of the tests. Check to make sure it still exists before using it\r\n            _this.conn_ && _this.conn_.open(onMessageReceived, onConnectionLost);\r\n        }, Math.floor(0));\r\n        var healthyTimeout_ms = conn['healthyTimeout'] || 0;\r\n        if (healthyTimeout_ms > 0) {\r\n            this.healthyTimeout_ = setTimeoutNonBlocking(function () {\r\n                _this.healthyTimeout_ = null;\r\n                if (!_this.isHealthy_) {\r\n                    if (_this.conn_ &&\r\n                        _this.conn_.bytesReceived > BYTES_RECEIVED_HEALTHY_OVERRIDE) {\r\n                        _this.log_('Connection exceeded healthy timeout but has received ' +\r\n                            _this.conn_.bytesReceived +\r\n                            ' bytes.  Marking connection healthy.');\r\n                        _this.isHealthy_ = true;\r\n                        _this.conn_.markConnectionHealthy();\r\n                    }\r\n                    else if (_this.conn_ &&\r\n                        _this.conn_.bytesSent > BYTES_SENT_HEALTHY_OVERRIDE) {\r\n                        _this.log_('Connection exceeded healthy timeout but has sent ' +\r\n                            _this.conn_.bytesSent +\r\n                            ' bytes.  Leaving connection alive.');\r\n                        // NOTE: We don't want to mark it healthy, since we have no guarantee that the bytes have made it to\r\n                        // the server.\r\n                    }\r\n                    else {\r\n                        _this.log_('Closing unhealthy connection after timeout.');\r\n                        _this.close();\r\n                    }\r\n                }\r\n            }, Math.floor(healthyTimeout_ms));\r\n        }\r\n    };\r\n    /**\r\n     * @return {!string}\r\n     * @private\r\n     */\r\n    Connection.prototype.nextTransportId_ = function () {\r\n        return 'c:' + this.id + ':' + this.connectionCount++;\r\n    };\r\n    Connection.prototype.disconnReceiver_ = function (conn) {\r\n        var _this = this;\r\n        return function (everConnected) {\r\n            if (conn === _this.conn_) {\r\n                _this.onConnectionLost_(everConnected);\r\n            }\r\n            else if (conn === _this.secondaryConn_) {\r\n                _this.log_('Secondary connection lost.');\r\n                _this.onSecondaryConnectionLost_();\r\n            }\r\n            else {\r\n                _this.log_('closing an old connection');\r\n            }\r\n        };\r\n    };\r\n    Connection.prototype.connReceiver_ = function (conn) {\r\n        var _this = this;\r\n        return function (message) {\r\n            if (_this.state_ != 2 /* DISCONNECTED */) {\r\n                if (conn === _this.rx_) {\r\n                    _this.onPrimaryMessageReceived_(message);\r\n                }\r\n                else if (conn === _this.secondaryConn_) {\r\n                    _this.onSecondaryMessageReceived_(message);\r\n                }\r\n                else {\r\n                    _this.log_('message on old connection');\r\n                }\r\n            }\r\n        };\r\n    };\r\n    /**\r\n     *\r\n     * @param {Object} dataMsg An arbitrary data message to be sent to the server\r\n     */\r\n    Connection.prototype.sendRequest = function (dataMsg) {\r\n        // wrap in a data message envelope and send it on\r\n        var msg = { t: 'd', d: dataMsg };\r\n        this.sendData_(msg);\r\n    };\r\n    Connection.prototype.tryCleanupConnection = function () {\r\n        if (this.tx_ === this.secondaryConn_ && this.rx_ === this.secondaryConn_) {\r\n            this.log_('cleaning up and promoting a connection: ' + this.secondaryConn_.connId);\r\n            this.conn_ = this.secondaryConn_;\r\n            this.secondaryConn_ = null;\r\n            // the server will shutdown the old connection\r\n        }\r\n    };\r\n    Connection.prototype.onSecondaryControl_ = function (controlData) {\r\n        if (MESSAGE_TYPE in controlData) {\r\n            var cmd = controlData[MESSAGE_TYPE];\r\n            if (cmd === SWITCH_ACK) {\r\n                this.upgradeIfSecondaryHealthy_();\r\n            }\r\n            else if (cmd === CONTROL_RESET) {\r\n                // Most likely the session wasn't valid. Abandon the switch attempt\r\n                this.log_('Got a reset on secondary, closing it');\r\n                this.secondaryConn_.close();\r\n                // If we were already using this connection for something, than we need to fully close\r\n                if (this.tx_ === this.secondaryConn_ ||\r\n                    this.rx_ === this.secondaryConn_) {\r\n                    this.close();\r\n                }\r\n            }\r\n            else if (cmd === CONTROL_PONG) {\r\n                this.log_('got pong on secondary.');\r\n                this.secondaryResponsesRequired_--;\r\n                this.upgradeIfSecondaryHealthy_();\r\n            }\r\n        }\r\n    };\r\n    Connection.prototype.onSecondaryMessageReceived_ = function (parsedData) {\r\n        var layer = requireKey('t', parsedData);\r\n        var data = requireKey('d', parsedData);\r\n        if (layer == 'c') {\r\n            this.onSecondaryControl_(data);\r\n        }\r\n        else if (layer == 'd') {\r\n            // got a data message, but we're still second connection. Need to buffer it up\r\n            this.pendingDataMessages.push(data);\r\n        }\r\n        else {\r\n            throw new Error('Unknown protocol layer: ' + layer);\r\n        }\r\n    };\r\n    Connection.prototype.upgradeIfSecondaryHealthy_ = function () {\r\n        if (this.secondaryResponsesRequired_ <= 0) {\r\n            this.log_('Secondary connection is healthy.');\r\n            this.isHealthy_ = true;\r\n            this.secondaryConn_.markConnectionHealthy();\r\n            this.proceedWithUpgrade_();\r\n        }\r\n        else {\r\n            // Send a ping to make sure the connection is healthy.\r\n            this.log_('sending ping on secondary.');\r\n            this.secondaryConn_.send({ t: 'c', d: { t: PING, d: {} } });\r\n        }\r\n    };\r\n    Connection.prototype.proceedWithUpgrade_ = function () {\r\n        // tell this connection to consider itself open\r\n        this.secondaryConn_.start();\r\n        // send ack\r\n        this.log_('sending client ack on secondary');\r\n        this.secondaryConn_.send({ t: 'c', d: { t: SWITCH_ACK, d: {} } });\r\n        // send end packet on primary transport, switch to sending on this one\r\n        // can receive on this one, buffer responses until end received on primary transport\r\n        this.log_('Ending transmission on primary');\r\n        this.conn_.send({ t: 'c', d: { t: END_TRANSMISSION, d: {} } });\r\n        this.tx_ = this.secondaryConn_;\r\n        this.tryCleanupConnection();\r\n    };\r\n    Connection.prototype.onPrimaryMessageReceived_ = function (parsedData) {\r\n        // Must refer to parsedData properties in quotes, so closure doesn't touch them.\r\n        var layer = requireKey('t', parsedData);\r\n        var data = requireKey('d', parsedData);\r\n        if (layer == 'c') {\r\n            this.onControl_(data);\r\n        }\r\n        else if (layer == 'd') {\r\n            this.onDataMessage_(data);\r\n        }\r\n    };\r\n    Connection.prototype.onDataMessage_ = function (message) {\r\n        this.onPrimaryResponse_();\r\n        // We don't do anything with data messages, just kick them up a level\r\n        this.onMessage_(message);\r\n    };\r\n    Connection.prototype.onPrimaryResponse_ = function () {\r\n        if (!this.isHealthy_) {\r\n            this.primaryResponsesRequired_--;\r\n            if (this.primaryResponsesRequired_ <= 0) {\r\n                this.log_('Primary connection is healthy.');\r\n                this.isHealthy_ = true;\r\n                this.conn_.markConnectionHealthy();\r\n            }\r\n        }\r\n    };\r\n    Connection.prototype.onControl_ = function (controlData) {\r\n        var cmd = requireKey(MESSAGE_TYPE, controlData);\r\n        if (MESSAGE_DATA in controlData) {\r\n            var payload = controlData[MESSAGE_DATA];\r\n            if (cmd === SERVER_HELLO) {\r\n                this.onHandshake_(payload);\r\n            }\r\n            else if (cmd === END_TRANSMISSION) {\r\n                this.log_('recvd end transmission on primary');\r\n                this.rx_ = this.secondaryConn_;\r\n                for (var i = 0; i < this.pendingDataMessages.length; ++i) {\r\n                    this.onDataMessage_(this.pendingDataMessages[i]);\r\n                }\r\n                this.pendingDataMessages = [];\r\n                this.tryCleanupConnection();\r\n            }\r\n            else if (cmd === CONTROL_SHUTDOWN) {\r\n                // This was previously the 'onKill' callback passed to the lower-level connection\r\n                // payload in this case is the reason for the shutdown. Generally a human-readable error\r\n                this.onConnectionShutdown_(payload);\r\n            }\r\n            else if (cmd === CONTROL_RESET) {\r\n                // payload in this case is the host we should contact\r\n                this.onReset_(payload);\r\n            }\r\n            else if (cmd === CONTROL_ERROR) {\r\n                error('Server Error: ' + payload);\r\n            }\r\n            else if (cmd === CONTROL_PONG) {\r\n                this.log_('got pong on primary.');\r\n                this.onPrimaryResponse_();\r\n                this.sendPingOnPrimaryIfNecessary_();\r\n            }\r\n            else {\r\n                error('Unknown control packet command: ' + cmd);\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     *\r\n     * @param {Object} handshake The handshake data returned from the server\r\n     * @private\r\n     */\r\n    Connection.prototype.onHandshake_ = function (handshake) {\r\n        var timestamp = handshake.ts;\r\n        var version = handshake.v;\r\n        var host = handshake.h;\r\n        this.sessionId = handshake.s;\r\n        this.repoInfo_.updateHost(host);\r\n        // if we've already closed the connection, then don't bother trying to progress further\r\n        if (this.state_ == 0 /* CONNECTING */) {\r\n            this.conn_.start();\r\n            this.onConnectionEstablished_(this.conn_, timestamp);\r\n            if (PROTOCOL_VERSION !== version) {\r\n                warn('Protocol version mismatch detected');\r\n            }\r\n            // TODO: do we want to upgrade? when? maybe a delay?\r\n            this.tryStartUpgrade_();\r\n        }\r\n    };\r\n    Connection.prototype.tryStartUpgrade_ = function () {\r\n        var conn = this.transportManager_.upgradeTransport();\r\n        if (conn) {\r\n            this.startUpgrade_(conn);\r\n        }\r\n    };\r\n    Connection.prototype.startUpgrade_ = function (conn) {\r\n        var _this = this;\r\n        this.secondaryConn_ = new conn(this.nextTransportId_(), this.repoInfo_, this.sessionId);\r\n        // For certain transports (WebSockets), we need to send and receive several messages back and forth before we\r\n        // can consider the transport healthy.\r\n        this.secondaryResponsesRequired_ =\r\n            conn['responsesRequiredToBeHealthy'] || 0;\r\n        var onMessage = this.connReceiver_(this.secondaryConn_);\r\n        var onDisconnect = this.disconnReceiver_(this.secondaryConn_);\r\n        this.secondaryConn_.open(onMessage, onDisconnect);\r\n        // If we haven't successfully upgraded after UPGRADE_TIMEOUT, give up and kill the secondary.\r\n        setTimeoutNonBlocking(function () {\r\n            if (_this.secondaryConn_) {\r\n                _this.log_('Timed out trying to upgrade.');\r\n                _this.secondaryConn_.close();\r\n            }\r\n        }, Math.floor(UPGRADE_TIMEOUT));\r\n    };\r\n    Connection.prototype.onReset_ = function (host) {\r\n        this.log_('Reset packet received.  New host: ' + host);\r\n        this.repoInfo_.updateHost(host);\r\n        // TODO: if we're already \"connected\", we need to trigger a disconnect at the next layer up.\r\n        // We don't currently support resets after the connection has already been established\r\n        if (this.state_ === 1 /* CONNECTED */) {\r\n            this.close();\r\n        }\r\n        else {\r\n            // Close whatever connections we have open and start again.\r\n            this.closeConnections_();\r\n            this.start_();\r\n        }\r\n    };\r\n    Connection.prototype.onConnectionEstablished_ = function (conn, timestamp) {\r\n        var _this = this;\r\n        this.log_('Realtime connection established.');\r\n        this.conn_ = conn;\r\n        this.state_ = 1 /* CONNECTED */;\r\n        if (this.onReady_) {\r\n            this.onReady_(timestamp, this.sessionId);\r\n            this.onReady_ = null;\r\n        }\r\n        // If after 5 seconds we haven't sent enough requests to the server to get the connection healthy,\r\n        // send some pings.\r\n        if (this.primaryResponsesRequired_ === 0) {\r\n            this.log_('Primary connection is healthy.');\r\n            this.isHealthy_ = true;\r\n        }\r\n        else {\r\n            setTimeoutNonBlocking(function () {\r\n                _this.sendPingOnPrimaryIfNecessary_();\r\n            }, Math.floor(DELAY_BEFORE_SENDING_EXTRA_REQUESTS));\r\n        }\r\n    };\r\n    Connection.prototype.sendPingOnPrimaryIfNecessary_ = function () {\r\n        // If the connection isn't considered healthy yet, we'll send a noop ping packet request.\r\n        if (!this.isHealthy_ && this.state_ === 1 /* CONNECTED */) {\r\n            this.log_('sending ping on primary.');\r\n            this.sendData_({ t: 'c', d: { t: PING, d: {} } });\r\n        }\r\n    };\r\n    Connection.prototype.onSecondaryConnectionLost_ = function () {\r\n        var conn = this.secondaryConn_;\r\n        this.secondaryConn_ = null;\r\n        if (this.tx_ === conn || this.rx_ === conn) {\r\n            // we are relying on this connection already in some capacity. Therefore, a failure is real\r\n            this.close();\r\n        }\r\n    };\r\n    /**\r\n     *\r\n     * @param {boolean} everConnected Whether or not the connection ever reached a server. Used to determine if\r\n     * we should flush the host cache\r\n     * @private\r\n     */\r\n    Connection.prototype.onConnectionLost_ = function (everConnected) {\r\n        this.conn_ = null;\r\n        // NOTE: IF you're seeing a Firefox error for this line, I think it might be because it's getting\r\n        // called on window close and RealtimeState.CONNECTING is no longer defined.  Just a guess.\r\n        if (!everConnected && this.state_ === 0 /* CONNECTING */) {\r\n            this.log_('Realtime connection failed.');\r\n            // Since we failed to connect at all, clear any cached entry for this namespace in case the machine went away\r\n            if (this.repoInfo_.isCacheableHost()) {\r\n                PersistentStorage.remove('host:' + this.repoInfo_.host);\r\n                // reset the internal host to what we would show the user, i.e. <ns>.firebaseio.com\r\n                this.repoInfo_.internalHost = this.repoInfo_.host;\r\n            }\r\n        }\r\n        else if (this.state_ === 1 /* CONNECTED */) {\r\n            this.log_('Realtime connection lost.');\r\n        }\r\n        this.close();\r\n    };\r\n    /**\r\n     *\r\n     * @param {string} reason\r\n     * @private\r\n     */\r\n    Connection.prototype.onConnectionShutdown_ = function (reason) {\r\n        this.log_('Connection shutdown command received. Shutting down...');\r\n        if (this.onKill_) {\r\n            this.onKill_(reason);\r\n            this.onKill_ = null;\r\n        }\r\n        // We intentionally don't want to fire onDisconnect (kill is a different case),\r\n        // so clear the callback.\r\n        this.onDisconnect_ = null;\r\n        this.close();\r\n    };\r\n    Connection.prototype.sendData_ = function (data) {\r\n        if (this.state_ !== 1 /* CONNECTED */) {\r\n            throw 'Connection is not connected';\r\n        }\r\n        else {\r\n            this.tx_.send(data);\r\n        }\r\n    };\r\n    /**\r\n     * Cleans up this connection, calling the appropriate callbacks\r\n     */\r\n    Connection.prototype.close = function () {\r\n        if (this.state_ !== 2 /* DISCONNECTED */) {\r\n            this.log_('Closing realtime connection.');\r\n            this.state_ = 2 /* DISCONNECTED */;\r\n            this.closeConnections_();\r\n            if (this.onDisconnect_) {\r\n                this.onDisconnect_();\r\n                this.onDisconnect_ = null;\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     *\r\n     * @private\r\n     */\r\n    Connection.prototype.closeConnections_ = function () {\r\n        this.log_('Shutting down all connections');\r\n        if (this.conn_) {\r\n            this.conn_.close();\r\n            this.conn_ = null;\r\n        }\r\n        if (this.secondaryConn_) {\r\n            this.secondaryConn_.close();\r\n            this.secondaryConn_ = null;\r\n        }\r\n        if (this.healthyTimeout_) {\r\n            clearTimeout(this.healthyTimeout_);\r\n            this.healthyTimeout_ = null;\r\n        }\r\n    };\r\n    return Connection;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Interface defining the set of actions that can be performed against the Firebase server\r\n * (basically corresponds to our wire protocol).\r\n *\r\n * @interface\r\n */\r\nvar ServerActions = /** @class */ (function () {\r\n    function ServerActions() {\r\n    }\r\n    /**\r\n     * @param {string} pathString\r\n     * @param {*} data\r\n     * @param {function(string, string)=} onComplete\r\n     * @param {string=} hash\r\n     */\r\n    ServerActions.prototype.put = function (pathString, data, onComplete, hash) { };\r\n    /**\r\n     * @param {string} pathString\r\n     * @param {*} data\r\n     * @param {function(string, ?string)} onComplete\r\n     * @param {string=} hash\r\n     */\r\n    ServerActions.prototype.merge = function (pathString, data, onComplete, hash) { };\r\n    /**\r\n     * Refreshes the auth token for the current connection.\r\n     * @param {string} token The authentication token\r\n     */\r\n    ServerActions.prototype.refreshAuthToken = function (token) { };\r\n    /**\r\n     * @param {string} pathString\r\n     * @param {*} data\r\n     * @param {function(string, string)=} onComplete\r\n     */\r\n    ServerActions.prototype.onDisconnectPut = function (pathString, data, onComplete) { };\r\n    /**\r\n     * @param {string} pathString\r\n     * @param {*} data\r\n     * @param {function(string, string)=} onComplete\r\n     */\r\n    ServerActions.prototype.onDisconnectMerge = function (pathString, data, onComplete) { };\r\n    /**\r\n     * @param {string} pathString\r\n     * @param {function(string, string)=} onComplete\r\n     */\r\n    ServerActions.prototype.onDisconnectCancel = function (pathString, onComplete) { };\r\n    /**\r\n     * @param {Object.<string, *>} stats\r\n     */\r\n    ServerActions.prototype.reportStats = function (stats) { };\r\n    return ServerActions;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar RECONNECT_MIN_DELAY = 1000;\r\nvar RECONNECT_MAX_DELAY_DEFAULT = 60 * 5 * 1000; // 5 minutes in milliseconds (Case: 1858)\r\nvar RECONNECT_MAX_DELAY_FOR_ADMINS = 30 * 1000; // 30 seconds for admin clients (likely to be a backend server)\r\nvar RECONNECT_DELAY_MULTIPLIER = 1.3;\r\nvar RECONNECT_DELAY_RESET_TIMEOUT = 30000; // Reset delay back to MIN_DELAY after being connected for 30sec.\r\nvar SERVER_KILL_INTERRUPT_REASON = 'server_kill';\r\n// If auth fails repeatedly, we'll assume something is wrong and log a warning / back off.\r\nvar INVALID_AUTH_TOKEN_THRESHOLD = 3;\r\n/**\r\n * Firebase connection.  Abstracts wire protocol and handles reconnecting.\r\n *\r\n * NOTE: All JSON objects sent to the realtime connection must have property names enclosed\r\n * in quotes to make sure the closure compiler does not minify them.\r\n */\r\nvar PersistentConnection = /** @class */ (function (_super) {\r\n    __extends(PersistentConnection, _super);\r\n    /**\r\n     * @implements {ServerActions}\r\n     * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\r\n     * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\r\n     * @param onConnectStatus_\r\n     * @param onServerInfoUpdate_\r\n     * @param authTokenProvider_\r\n     * @param authOverride_\r\n     */\r\n    function PersistentConnection(repoInfo_, onDataUpdate_, onConnectStatus_, onServerInfoUpdate_, authTokenProvider_, authOverride_) {\r\n        var _this = _super.call(this) || this;\r\n        _this.repoInfo_ = repoInfo_;\r\n        _this.onDataUpdate_ = onDataUpdate_;\r\n        _this.onConnectStatus_ = onConnectStatus_;\r\n        _this.onServerInfoUpdate_ = onServerInfoUpdate_;\r\n        _this.authTokenProvider_ = authTokenProvider_;\r\n        _this.authOverride_ = authOverride_;\r\n        // Used for diagnostic logging.\r\n        _this.id = PersistentConnection.nextPersistentConnectionId_++;\r\n        _this.log_ = logWrapper('p:' + _this.id + ':');\r\n        /** @private {Object} */\r\n        _this.interruptReasons_ = {};\r\n        _this.listens_ = {};\r\n        _this.outstandingPuts_ = [];\r\n        _this.outstandingPutCount_ = 0;\r\n        _this.onDisconnectRequestQueue_ = [];\r\n        _this.connected_ = false;\r\n        _this.reconnectDelay_ = RECONNECT_MIN_DELAY;\r\n        _this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_DEFAULT;\r\n        _this.securityDebugCallback_ = null;\r\n        _this.lastSessionId = null;\r\n        /** @private {number|null} */\r\n        _this.establishConnectionTimer_ = null;\r\n        /** @private {boolean} */\r\n        _this.visible_ = false;\r\n        // Before we get connected, we keep a queue of pending messages to send.\r\n        _this.requestCBHash_ = {};\r\n        _this.requestNumber_ = 0;\r\n        /** @private {?{\r\n         *   sendRequest(Object),\r\n         *   close()\r\n         * }} */\r\n        _this.realtime_ = null;\r\n        /** @private {string|null} */\r\n        _this.authToken_ = null;\r\n        _this.forceTokenRefresh_ = false;\r\n        _this.invalidAuthTokenCount_ = 0;\r\n        _this.firstConnection_ = true;\r\n        _this.lastConnectionAttemptTime_ = null;\r\n        _this.lastConnectionEstablishedTime_ = null;\r\n        if (authOverride_ && !isNodeSdk()) {\r\n            throw new Error('Auth override specified in options, but not supported on non Node.js platforms');\r\n        }\r\n        _this.scheduleConnect_(0);\r\n        VisibilityMonitor.getInstance().on('visible', _this.onVisible_, _this);\r\n        if (repoInfo_.host.indexOf('fblocal') === -1) {\r\n            OnlineMonitor.getInstance().on('online', _this.onOnline_, _this);\r\n        }\r\n        return _this;\r\n    }\r\n    /**\r\n     * @param {!string} action\r\n     * @param {*} body\r\n     * @param {function(*)=} onResponse\r\n     * @protected\r\n     */\r\n    PersistentConnection.prototype.sendRequest = function (action, body, onResponse) {\r\n        var curReqNum = ++this.requestNumber_;\r\n        var msg = { r: curReqNum, a: action, b: body };\r\n        this.log_(stringify(msg));\r\n        assert(this.connected_, \"sendRequest call when we're not connected not allowed.\");\r\n        this.realtime_.sendRequest(msg);\r\n        if (onResponse) {\r\n            this.requestCBHash_[curReqNum] = onResponse;\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.listen = function (query, currentHashFn, tag, onComplete) {\r\n        var queryId = query.queryIdentifier();\r\n        var pathString = query.path.toString();\r\n        this.log_('Listen called for ' + pathString + ' ' + queryId);\r\n        this.listens_[pathString] = this.listens_[pathString] || {};\r\n        assert(query.getQueryParams().isDefault() ||\r\n            !query.getQueryParams().loadsAllData(), 'listen() called for non-default but complete query');\r\n        assert(!this.listens_[pathString][queryId], 'listen() called twice for same path/queryId.');\r\n        var listenSpec = {\r\n            onComplete: onComplete,\r\n            hashFn: currentHashFn,\r\n            query: query,\r\n            tag: tag\r\n        };\r\n        this.listens_[pathString][queryId] = listenSpec;\r\n        if (this.connected_) {\r\n            this.sendListen_(listenSpec);\r\n        }\r\n    };\r\n    /**\r\n     * @param {!{onComplete(),\r\n     *           hashFn():!string,\r\n     *           query: !Query,\r\n     *           tag: ?number}} listenSpec\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.sendListen_ = function (listenSpec) {\r\n        var _this = this;\r\n        var query = listenSpec.query;\r\n        var pathString = query.path.toString();\r\n        var queryId = query.queryIdentifier();\r\n        this.log_('Listen on ' + pathString + ' for ' + queryId);\r\n        var req = { /*path*/ p: pathString };\r\n        var action = 'q';\r\n        // Only bother to send query if it's non-default.\r\n        if (listenSpec.tag) {\r\n            req['q'] = query.queryObject();\r\n            req['t'] = listenSpec.tag;\r\n        }\r\n        req[ /*hash*/'h'] = listenSpec.hashFn();\r\n        this.sendRequest(action, req, function (message) {\r\n            var payload = message[ /*data*/'d'];\r\n            var status = message[ /*status*/'s'];\r\n            // print warnings in any case...\r\n            PersistentConnection.warnOnListenWarnings_(payload, query);\r\n            var currentListenSpec = _this.listens_[pathString] && _this.listens_[pathString][queryId];\r\n            // only trigger actions if the listen hasn't been removed and readded\r\n            if (currentListenSpec === listenSpec) {\r\n                _this.log_('listen response', message);\r\n                if (status !== 'ok') {\r\n                    _this.removeListen_(pathString, queryId);\r\n                }\r\n                if (listenSpec.onComplete) {\r\n                    listenSpec.onComplete(status, payload);\r\n                }\r\n            }\r\n        });\r\n    };\r\n    /**\r\n     * @param {*} payload\r\n     * @param {!Query} query\r\n     * @private\r\n     */\r\n    PersistentConnection.warnOnListenWarnings_ = function (payload, query) {\r\n        if (payload && typeof payload === 'object' && contains(payload, 'w')) {\r\n            var warnings = safeGet(payload, 'w');\r\n            if (Array.isArray(warnings) && ~warnings.indexOf('no_index')) {\r\n                var indexSpec = '\".indexOn\": \"' +\r\n                    query\r\n                        .getQueryParams()\r\n                        .getIndex()\r\n                        .toString() +\r\n                    '\"';\r\n                var indexPath = query.path.toString();\r\n                warn(\"Using an unspecified index. Your data will be downloaded and \" +\r\n                    (\"filtered on the client. Consider adding \" + indexSpec + \" at \") +\r\n                    (indexPath + \" to your security rules for better performance.\"));\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.refreshAuthToken = function (token) {\r\n        this.authToken_ = token;\r\n        this.log_('Auth token refreshed');\r\n        if (this.authToken_) {\r\n            this.tryAuth();\r\n        }\r\n        else {\r\n            //If we're connected we want to let the server know to unauthenticate us. If we're not connected, simply delete\r\n            //the credential so we dont become authenticated next time we connect.\r\n            if (this.connected_) {\r\n                this.sendRequest('unauth', {}, function () { });\r\n            }\r\n        }\r\n        this.reduceReconnectDelayIfAdminCredential_(token);\r\n    };\r\n    /**\r\n     * @param {!string} credential\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.reduceReconnectDelayIfAdminCredential_ = function (credential) {\r\n        // NOTE: This isn't intended to be bulletproof (a malicious developer can always just modify the client).\r\n        // Additionally, we don't bother resetting the max delay back to the default if auth fails / expires.\r\n        var isFirebaseSecret = credential && credential.length === 40;\r\n        if (isFirebaseSecret || isAdmin(credential)) {\r\n            this.log_('Admin auth credential detected.  Reducing max reconnect time.');\r\n            this.maxReconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\r\n        }\r\n    };\r\n    /**\r\n     * Attempts to authenticate with the given credentials. If the authentication attempt fails, it's triggered like\r\n     * a auth revoked (the connection is closed).\r\n     */\r\n    PersistentConnection.prototype.tryAuth = function () {\r\n        var _this = this;\r\n        if (this.connected_ && this.authToken_) {\r\n            var token_1 = this.authToken_;\r\n            var authMethod = isValidFormat(token_1) ? 'auth' : 'gauth';\r\n            var requestData = { cred: token_1 };\r\n            if (this.authOverride_ === null) {\r\n                requestData['noauth'] = true;\r\n            }\r\n            else if (typeof this.authOverride_ === 'object') {\r\n                requestData['authvar'] = this.authOverride_;\r\n            }\r\n            this.sendRequest(authMethod, requestData, function (res) {\r\n                var status = res[ /*status*/'s'];\r\n                var data = res[ /*data*/'d'] || 'error';\r\n                if (_this.authToken_ === token_1) {\r\n                    if (status === 'ok') {\r\n                        _this.invalidAuthTokenCount_ = 0;\r\n                    }\r\n                    else {\r\n                        // Triggers reconnect and force refresh for auth token\r\n                        _this.onAuthRevoked_(status, data);\r\n                    }\r\n                }\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.unlisten = function (query, tag) {\r\n        var pathString = query.path.toString();\r\n        var queryId = query.queryIdentifier();\r\n        this.log_('Unlisten called for ' + pathString + ' ' + queryId);\r\n        assert(query.getQueryParams().isDefault() ||\r\n            !query.getQueryParams().loadsAllData(), 'unlisten() called for non-default but complete query');\r\n        var listen = this.removeListen_(pathString, queryId);\r\n        if (listen && this.connected_) {\r\n            this.sendUnlisten_(pathString, queryId, query.queryObject(), tag);\r\n        }\r\n    };\r\n    PersistentConnection.prototype.sendUnlisten_ = function (pathString, queryId, queryObj, tag) {\r\n        this.log_('Unlisten on ' + pathString + ' for ' + queryId);\r\n        var req = { /*path*/ p: pathString };\r\n        var action = 'n';\r\n        // Only bother sending queryId if it's non-default.\r\n        if (tag) {\r\n            req['q'] = queryObj;\r\n            req['t'] = tag;\r\n        }\r\n        this.sendRequest(action, req);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.onDisconnectPut = function (pathString, data, onComplete) {\r\n        if (this.connected_) {\r\n            this.sendOnDisconnect_('o', pathString, data, onComplete);\r\n        }\r\n        else {\r\n            this.onDisconnectRequestQueue_.push({\r\n                pathString: pathString,\r\n                action: 'o',\r\n                data: data,\r\n                onComplete: onComplete\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.onDisconnectMerge = function (pathString, data, onComplete) {\r\n        if (this.connected_) {\r\n            this.sendOnDisconnect_('om', pathString, data, onComplete);\r\n        }\r\n        else {\r\n            this.onDisconnectRequestQueue_.push({\r\n                pathString: pathString,\r\n                action: 'om',\r\n                data: data,\r\n                onComplete: onComplete\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.onDisconnectCancel = function (pathString, onComplete) {\r\n        if (this.connected_) {\r\n            this.sendOnDisconnect_('oc', pathString, null, onComplete);\r\n        }\r\n        else {\r\n            this.onDisconnectRequestQueue_.push({\r\n                pathString: pathString,\r\n                action: 'oc',\r\n                data: null,\r\n                onComplete: onComplete\r\n            });\r\n        }\r\n    };\r\n    PersistentConnection.prototype.sendOnDisconnect_ = function (action, pathString, data, onComplete) {\r\n        var request = { /*path*/ p: pathString, /*data*/ d: data };\r\n        this.log_('onDisconnect ' + action, request);\r\n        this.sendRequest(action, request, function (response) {\r\n            if (onComplete) {\r\n                setTimeout(function () {\r\n                    onComplete(response[ /*status*/'s'], response[ /* data */'d']);\r\n                }, Math.floor(0));\r\n            }\r\n        });\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.put = function (pathString, data, onComplete, hash) {\r\n        this.putInternal('p', pathString, data, onComplete, hash);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.merge = function (pathString, data, onComplete, hash) {\r\n        this.putInternal('m', pathString, data, onComplete, hash);\r\n    };\r\n    PersistentConnection.prototype.putInternal = function (action, pathString, data, onComplete, hash) {\r\n        var request = {\r\n            /*path*/ p: pathString,\r\n            /*data*/ d: data\r\n        };\r\n        if (hash !== undefined)\r\n            request[ /*hash*/'h'] = hash;\r\n        // TODO: Only keep track of the most recent put for a given path?\r\n        this.outstandingPuts_.push({\r\n            action: action,\r\n            request: request,\r\n            onComplete: onComplete\r\n        });\r\n        this.outstandingPutCount_++;\r\n        var index = this.outstandingPuts_.length - 1;\r\n        if (this.connected_) {\r\n            this.sendPut_(index);\r\n        }\r\n        else {\r\n            this.log_('Buffering put: ' + pathString);\r\n        }\r\n    };\r\n    PersistentConnection.prototype.sendPut_ = function (index) {\r\n        var _this = this;\r\n        var action = this.outstandingPuts_[index].action;\r\n        var request = this.outstandingPuts_[index].request;\r\n        var onComplete = this.outstandingPuts_[index].onComplete;\r\n        this.outstandingPuts_[index].queued = this.connected_;\r\n        this.sendRequest(action, request, function (message) {\r\n            _this.log_(action + ' response', message);\r\n            delete _this.outstandingPuts_[index];\r\n            _this.outstandingPutCount_--;\r\n            // Clean up array occasionally.\r\n            if (_this.outstandingPutCount_ === 0) {\r\n                _this.outstandingPuts_ = [];\r\n            }\r\n            if (onComplete)\r\n                onComplete(message[ /*status*/'s'], message[ /* data */'d']);\r\n        });\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    PersistentConnection.prototype.reportStats = function (stats) {\r\n        var _this = this;\r\n        // If we're not connected, we just drop the stats.\r\n        if (this.connected_) {\r\n            var request = { /*counters*/ c: stats };\r\n            this.log_('reportStats', request);\r\n            this.sendRequest(/*stats*/ 's', request, function (result) {\r\n                var status = result[ /*status*/'s'];\r\n                if (status !== 'ok') {\r\n                    var errorReason = result[ /* data */'d'];\r\n                    _this.log_('reportStats', 'Error sending stats: ' + errorReason);\r\n                }\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * @param {*} message\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.onDataMessage_ = function (message) {\r\n        if ('r' in message) {\r\n            // this is a response\r\n            this.log_('from server: ' + stringify(message));\r\n            var reqNum = message['r'];\r\n            var onResponse = this.requestCBHash_[reqNum];\r\n            if (onResponse) {\r\n                delete this.requestCBHash_[reqNum];\r\n                onResponse(message[ /*body*/'b']);\r\n            }\r\n        }\r\n        else if ('error' in message) {\r\n            throw 'A server-side error has occurred: ' + message['error'];\r\n        }\r\n        else if ('a' in message) {\r\n            // a and b are action and body, respectively\r\n            this.onDataPush_(message['a'], message['b']);\r\n        }\r\n    };\r\n    PersistentConnection.prototype.onDataPush_ = function (action, body) {\r\n        this.log_('handleServerMessage', action, body);\r\n        if (action === 'd')\r\n            this.onDataUpdate_(body[ /*path*/'p'], body[ /*data*/'d'], \r\n            /*isMerge*/ false, body['t']);\r\n        else if (action === 'm')\r\n            this.onDataUpdate_(body[ /*path*/'p'], body[ /*data*/'d'], \r\n            /*isMerge=*/ true, body['t']);\r\n        else if (action === 'c')\r\n            this.onListenRevoked_(body[ /*path*/'p'], body[ /*query*/'q']);\r\n        else if (action === 'ac')\r\n            this.onAuthRevoked_(body[ /*status code*/'s'], body[ /* explanation */'d']);\r\n        else if (action === 'sd')\r\n            this.onSecurityDebugPacket_(body);\r\n        else\r\n            error('Unrecognized action received from server: ' +\r\n                stringify(action) +\r\n                '\\nAre you using the latest client?');\r\n    };\r\n    PersistentConnection.prototype.onReady_ = function (timestamp, sessionId) {\r\n        this.log_('connection ready');\r\n        this.connected_ = true;\r\n        this.lastConnectionEstablishedTime_ = new Date().getTime();\r\n        this.handleTimestamp_(timestamp);\r\n        this.lastSessionId = sessionId;\r\n        if (this.firstConnection_) {\r\n            this.sendConnectStats_();\r\n        }\r\n        this.restoreState_();\r\n        this.firstConnection_ = false;\r\n        this.onConnectStatus_(true);\r\n    };\r\n    PersistentConnection.prototype.scheduleConnect_ = function (timeout) {\r\n        var _this = this;\r\n        assert(!this.realtime_, \"Scheduling a connect when we're already connected/ing?\");\r\n        if (this.establishConnectionTimer_) {\r\n            clearTimeout(this.establishConnectionTimer_);\r\n        }\r\n        // NOTE: Even when timeout is 0, it's important to do a setTimeout to work around an infuriating \"Security Error\" in\r\n        // Firefox when trying to write to our long-polling iframe in some scenarios (e.g. Forge or our unit tests).\r\n        this.establishConnectionTimer_ = setTimeout(function () {\r\n            _this.establishConnectionTimer_ = null;\r\n            _this.establishConnection_();\r\n        }, Math.floor(timeout));\r\n    };\r\n    /**\r\n     * @param {boolean} visible\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.onVisible_ = function (visible) {\r\n        // NOTE: Tabbing away and back to a window will defeat our reconnect backoff, but I think that's fine.\r\n        if (visible &&\r\n            !this.visible_ &&\r\n            this.reconnectDelay_ === this.maxReconnectDelay_) {\r\n            this.log_('Window became visible.  Reducing delay.');\r\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\r\n            if (!this.realtime_) {\r\n                this.scheduleConnect_(0);\r\n            }\r\n        }\r\n        this.visible_ = visible;\r\n    };\r\n    PersistentConnection.prototype.onOnline_ = function (online) {\r\n        if (online) {\r\n            this.log_('Browser went online.');\r\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\r\n            if (!this.realtime_) {\r\n                this.scheduleConnect_(0);\r\n            }\r\n        }\r\n        else {\r\n            this.log_('Browser went offline.  Killing connection.');\r\n            if (this.realtime_) {\r\n                this.realtime_.close();\r\n            }\r\n        }\r\n    };\r\n    PersistentConnection.prototype.onRealtimeDisconnect_ = function () {\r\n        this.log_('data client disconnected');\r\n        this.connected_ = false;\r\n        this.realtime_ = null;\r\n        // Since we don't know if our sent transactions succeeded or not, we need to cancel them.\r\n        this.cancelSentTransactions_();\r\n        // Clear out the pending requests.\r\n        this.requestCBHash_ = {};\r\n        if (this.shouldReconnect_()) {\r\n            if (!this.visible_) {\r\n                this.log_(\"Window isn't visible.  Delaying reconnect.\");\r\n                this.reconnectDelay_ = this.maxReconnectDelay_;\r\n                this.lastConnectionAttemptTime_ = new Date().getTime();\r\n            }\r\n            else if (this.lastConnectionEstablishedTime_) {\r\n                // If we've been connected long enough, reset reconnect delay to minimum.\r\n                var timeSinceLastConnectSucceeded = new Date().getTime() - this.lastConnectionEstablishedTime_;\r\n                if (timeSinceLastConnectSucceeded > RECONNECT_DELAY_RESET_TIMEOUT)\r\n                    this.reconnectDelay_ = RECONNECT_MIN_DELAY;\r\n                this.lastConnectionEstablishedTime_ = null;\r\n            }\r\n            var timeSinceLastConnectAttempt = new Date().getTime() - this.lastConnectionAttemptTime_;\r\n            var reconnectDelay = Math.max(0, this.reconnectDelay_ - timeSinceLastConnectAttempt);\r\n            reconnectDelay = Math.random() * reconnectDelay;\r\n            this.log_('Trying to reconnect in ' + reconnectDelay + 'ms');\r\n            this.scheduleConnect_(reconnectDelay);\r\n            // Adjust reconnect delay for next time.\r\n            this.reconnectDelay_ = Math.min(this.maxReconnectDelay_, this.reconnectDelay_ * RECONNECT_DELAY_MULTIPLIER);\r\n        }\r\n        this.onConnectStatus_(false);\r\n    };\r\n    PersistentConnection.prototype.establishConnection_ = function () {\r\n        if (this.shouldReconnect_()) {\r\n            this.log_('Making a connection attempt');\r\n            this.lastConnectionAttemptTime_ = new Date().getTime();\r\n            this.lastConnectionEstablishedTime_ = null;\r\n            var onDataMessage_1 = this.onDataMessage_.bind(this);\r\n            var onReady_1 = this.onReady_.bind(this);\r\n            var onDisconnect_1 = this.onRealtimeDisconnect_.bind(this);\r\n            var connId_1 = this.id + ':' + PersistentConnection.nextConnectionId_++;\r\n            var self_1 = this;\r\n            var lastSessionId_1 = this.lastSessionId;\r\n            var canceled_1 = false;\r\n            var connection_1 = null;\r\n            var closeFn_1 = function () {\r\n                if (connection_1) {\r\n                    connection_1.close();\r\n                }\r\n                else {\r\n                    canceled_1 = true;\r\n                    onDisconnect_1();\r\n                }\r\n            };\r\n            var sendRequestFn = function (msg) {\r\n                assert(connection_1, \"sendRequest call when we're not connected not allowed.\");\r\n                connection_1.sendRequest(msg);\r\n            };\r\n            this.realtime_ = {\r\n                close: closeFn_1,\r\n                sendRequest: sendRequestFn\r\n            };\r\n            var forceRefresh = this.forceTokenRefresh_;\r\n            this.forceTokenRefresh_ = false;\r\n            // First fetch auth token, and establish connection after fetching the token was successful\r\n            this.authTokenProvider_\r\n                .getToken(forceRefresh)\r\n                .then(function (result) {\r\n                if (!canceled_1) {\r\n                    log('getToken() completed. Creating connection.');\r\n                    self_1.authToken_ = result && result.accessToken;\r\n                    connection_1 = new Connection(connId_1, self_1.repoInfo_, onDataMessage_1, onReady_1, onDisconnect_1, \r\n                    /* onKill= */ function (reason) {\r\n                        warn(reason + ' (' + self_1.repoInfo_.toString() + ')');\r\n                        self_1.interrupt(SERVER_KILL_INTERRUPT_REASON);\r\n                    }, lastSessionId_1);\r\n                }\r\n                else {\r\n                    log('getToken() completed but was canceled');\r\n                }\r\n            })\r\n                .then(null, function (error$$1) {\r\n                self_1.log_('Failed to get token: ' + error$$1);\r\n                if (!canceled_1) {\r\n                    if (CONSTANTS.NODE_ADMIN) {\r\n                        // This may be a critical error for the Admin Node.js SDK, so log a warning.\r\n                        // But getToken() may also just have temporarily failed, so we still want to\r\n                        // continue retrying.\r\n                        warn(error$$1);\r\n                    }\r\n                    closeFn_1();\r\n                }\r\n            });\r\n        }\r\n    };\r\n    /**\r\n     * @param {string} reason\r\n     */\r\n    PersistentConnection.prototype.interrupt = function (reason) {\r\n        log('Interrupting connection for reason: ' + reason);\r\n        this.interruptReasons_[reason] = true;\r\n        if (this.realtime_) {\r\n            this.realtime_.close();\r\n        }\r\n        else {\r\n            if (this.establishConnectionTimer_) {\r\n                clearTimeout(this.establishConnectionTimer_);\r\n                this.establishConnectionTimer_ = null;\r\n            }\r\n            if (this.connected_) {\r\n                this.onRealtimeDisconnect_();\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * @param {string} reason\r\n     */\r\n    PersistentConnection.prototype.resume = function (reason) {\r\n        log('Resuming connection for reason: ' + reason);\r\n        delete this.interruptReasons_[reason];\r\n        if (isEmpty(this.interruptReasons_)) {\r\n            this.reconnectDelay_ = RECONNECT_MIN_DELAY;\r\n            if (!this.realtime_) {\r\n                this.scheduleConnect_(0);\r\n            }\r\n        }\r\n    };\r\n    PersistentConnection.prototype.handleTimestamp_ = function (timestamp) {\r\n        var delta = timestamp - new Date().getTime();\r\n        this.onServerInfoUpdate_({ serverTimeOffset: delta });\r\n    };\r\n    PersistentConnection.prototype.cancelSentTransactions_ = function () {\r\n        for (var i = 0; i < this.outstandingPuts_.length; i++) {\r\n            var put = this.outstandingPuts_[i];\r\n            if (put && /*hash*/ 'h' in put.request && put.queued) {\r\n                if (put.onComplete)\r\n                    put.onComplete('disconnect');\r\n                delete this.outstandingPuts_[i];\r\n                this.outstandingPutCount_--;\r\n            }\r\n        }\r\n        // Clean up array occasionally.\r\n        if (this.outstandingPutCount_ === 0)\r\n            this.outstandingPuts_ = [];\r\n    };\r\n    /**\r\n     * @param {!string} pathString\r\n     * @param {Array.<*>=} query\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.onListenRevoked_ = function (pathString, query) {\r\n        // Remove the listen and manufacture a \"permission_denied\" error for the failed listen.\r\n        var queryId;\r\n        if (!query) {\r\n            queryId = 'default';\r\n        }\r\n        else {\r\n            queryId = query.map(function (q) { return ObjectToUniqueKey(q); }).join('$');\r\n        }\r\n        var listen = this.removeListen_(pathString, queryId);\r\n        if (listen && listen.onComplete)\r\n            listen.onComplete('permission_denied');\r\n    };\r\n    /**\r\n     * @param {!string} pathString\r\n     * @param {!string} queryId\r\n     * @return {{queries:Array.<Query>, onComplete:function(string)}}\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.removeListen_ = function (pathString, queryId) {\r\n        var normalizedPathString = new Path(pathString).toString(); // normalize path.\r\n        var listen;\r\n        if (this.listens_[normalizedPathString] !== undefined) {\r\n            listen = this.listens_[normalizedPathString][queryId];\r\n            delete this.listens_[normalizedPathString][queryId];\r\n            if (getCount(this.listens_[normalizedPathString]) === 0) {\r\n                delete this.listens_[normalizedPathString];\r\n            }\r\n        }\r\n        else {\r\n            // all listens for this path has already been removed\r\n            listen = undefined;\r\n        }\r\n        return listen;\r\n    };\r\n    PersistentConnection.prototype.onAuthRevoked_ = function (statusCode, explanation) {\r\n        log('Auth token revoked: ' + statusCode + '/' + explanation);\r\n        this.authToken_ = null;\r\n        this.forceTokenRefresh_ = true;\r\n        this.realtime_.close();\r\n        if (statusCode === 'invalid_token' || statusCode === 'permission_denied') {\r\n            // We'll wait a couple times before logging the warning / increasing the\r\n            // retry period since oauth tokens will report as \"invalid\" if they're\r\n            // just expired. Plus there may be transient issues that resolve themselves.\r\n            this.invalidAuthTokenCount_++;\r\n            if (this.invalidAuthTokenCount_ >= INVALID_AUTH_TOKEN_THRESHOLD) {\r\n                // Set a long reconnect delay because recovery is unlikely\r\n                this.reconnectDelay_ = RECONNECT_MAX_DELAY_FOR_ADMINS;\r\n                // Notify the auth token provider that the token is invalid, which will log\r\n                // a warning\r\n                this.authTokenProvider_.notifyForInvalidToken();\r\n            }\r\n        }\r\n    };\r\n    PersistentConnection.prototype.onSecurityDebugPacket_ = function (body) {\r\n        if (this.securityDebugCallback_) {\r\n            this.securityDebugCallback_(body);\r\n        }\r\n        else {\r\n            if ('msg' in body) {\r\n                console.log('FIREBASE: ' + body['msg'].replace('\\n', '\\nFIREBASE: '));\r\n            }\r\n        }\r\n    };\r\n    PersistentConnection.prototype.restoreState_ = function () {\r\n        var _this = this;\r\n        //Re-authenticate ourselves if we have a credential stored.\r\n        this.tryAuth();\r\n        // Puts depend on having received the corresponding data update from the server before they complete, so we must\r\n        // make sure to send listens before puts.\r\n        forEach(this.listens_, function (pathString, queries) {\r\n            forEach(queries, function (key, listenSpec) {\r\n                _this.sendListen_(listenSpec);\r\n            });\r\n        });\r\n        for (var i = 0; i < this.outstandingPuts_.length; i++) {\r\n            if (this.outstandingPuts_[i])\r\n                this.sendPut_(i);\r\n        }\r\n        while (this.onDisconnectRequestQueue_.length) {\r\n            var request = this.onDisconnectRequestQueue_.shift();\r\n            this.sendOnDisconnect_(request.action, request.pathString, request.data, request.onComplete);\r\n        }\r\n    };\r\n    /**\r\n     * Sends client stats for first connection\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.sendConnectStats_ = function () {\r\n        var stats = {};\r\n        var clientName = 'js';\r\n        if (CONSTANTS.NODE_ADMIN) {\r\n            clientName = 'admin_node';\r\n        }\r\n        else if (CONSTANTS.NODE_CLIENT) {\r\n            clientName = 'node';\r\n        }\r\n        stats['sdk.' + clientName + '.' + firebase.SDK_VERSION.replace(/\\./g, '-')] = 1;\r\n        if (isMobileCordova()) {\r\n            stats['framework.cordova'] = 1;\r\n        }\r\n        else if (isReactNative()) {\r\n            stats['framework.reactnative'] = 1;\r\n        }\r\n        this.reportStats(stats);\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     * @private\r\n     */\r\n    PersistentConnection.prototype.shouldReconnect_ = function () {\r\n        var online = OnlineMonitor.getInstance().currentlyOnline();\r\n        return isEmpty(this.interruptReasons_) && online;\r\n    };\r\n    /**\r\n     * @private\r\n     */\r\n    PersistentConnection.nextPersistentConnectionId_ = 0;\r\n    /**\r\n     * Counter for number of connections created. Mainly used for tagging in the logs\r\n     * @type {number}\r\n     * @private\r\n     */\r\n    PersistentConnection.nextConnectionId_ = 0;\r\n    return PersistentConnection;\r\n}(ServerActions));\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * An implementation of ServerActions that communicates with the server via REST requests.\r\n * This is mostly useful for compatibility with crawlers, where we don't want to spin up a full\r\n * persistent connection (using WebSockets or long-polling)\r\n */\r\nvar ReadonlyRestClient = /** @class */ (function (_super) {\r\n    __extends(ReadonlyRestClient, _super);\r\n    /**\r\n     * @param {!RepoInfo} repoInfo_ Data about the namespace we are connecting to\r\n     * @param {function(string, *, boolean, ?number)} onDataUpdate_ A callback for new data from the server\r\n     * @param {AuthTokenProvider} authTokenProvider_\r\n     * @implements {ServerActions}\r\n     */\r\n    function ReadonlyRestClient(repoInfo_, onDataUpdate_, authTokenProvider_) {\r\n        var _this = _super.call(this) || this;\r\n        _this.repoInfo_ = repoInfo_;\r\n        _this.onDataUpdate_ = onDataUpdate_;\r\n        _this.authTokenProvider_ = authTokenProvider_;\r\n        /** @private {function(...[*])} */\r\n        _this.log_ = logWrapper('p:rest:');\r\n        /**\r\n         * We don't actually need to track listens, except to prevent us calling an onComplete for a listen\r\n         * that's been removed. :-/\r\n         *\r\n         * @private {!Object.<string, !Object>}\r\n         */\r\n        _this.listens_ = {};\r\n        return _this;\r\n    }\r\n    ReadonlyRestClient.prototype.reportStats = function (stats) {\r\n        throw new Error('Method not implemented.');\r\n    };\r\n    /**\r\n     * @param {!Query} query\r\n     * @param {?number=} tag\r\n     * @return {string}\r\n     * @private\r\n     */\r\n    ReadonlyRestClient.getListenId_ = function (query, tag) {\r\n        if (tag !== undefined) {\r\n            return 'tag$' + tag;\r\n        }\r\n        else {\r\n            assert(query.getQueryParams().isDefault(), \"should have a tag if it's not a default query.\");\r\n            return query.path.toString();\r\n        }\r\n    };\r\n    /** @inheritDoc */\r\n    ReadonlyRestClient.prototype.listen = function (query, currentHashFn, tag, onComplete) {\r\n        var _this = this;\r\n        var pathString = query.path.toString();\r\n        this.log_('Listen called for ' + pathString + ' ' + query.queryIdentifier());\r\n        // Mark this listener so we can tell if it's removed.\r\n        var listenId = ReadonlyRestClient.getListenId_(query, tag);\r\n        var thisListen = {};\r\n        this.listens_[listenId] = thisListen;\r\n        var queryStringParameters = query\r\n            .getQueryParams()\r\n            .toRestQueryStringParameters();\r\n        this.restRequest_(pathString + '.json', queryStringParameters, function (error$$1, result) {\r\n            var data = result;\r\n            if (error$$1 === 404) {\r\n                data = null;\r\n                error$$1 = null;\r\n            }\r\n            if (error$$1 === null) {\r\n                _this.onDataUpdate_(pathString, data, /*isMerge=*/ false, tag);\r\n            }\r\n            if (safeGet(_this.listens_, listenId) === thisListen) {\r\n                var status_1;\r\n                if (!error$$1) {\r\n                    status_1 = 'ok';\r\n                }\r\n                else if (error$$1 == 401) {\r\n                    status_1 = 'permission_denied';\r\n                }\r\n                else {\r\n                    status_1 = 'rest_error:' + error$$1;\r\n                }\r\n                onComplete(status_1, null);\r\n            }\r\n        });\r\n    };\r\n    /** @inheritDoc */\r\n    ReadonlyRestClient.prototype.unlisten = function (query, tag) {\r\n        var listenId = ReadonlyRestClient.getListenId_(query, tag);\r\n        delete this.listens_[listenId];\r\n    };\r\n    /** @inheritDoc */\r\n    ReadonlyRestClient.prototype.refreshAuthToken = function (token) {\r\n        // no-op since we just always call getToken.\r\n    };\r\n    /**\r\n     * Performs a REST request to the given path, with the provided query string parameters,\r\n     * and any auth credentials we have.\r\n     *\r\n     * @param {!string} pathString\r\n     * @param {!Object.<string, *>} queryStringParameters\r\n     * @param {?function(?number, *=)} callback\r\n     * @private\r\n     */\r\n    ReadonlyRestClient.prototype.restRequest_ = function (pathString, queryStringParameters, callback) {\r\n        var _this = this;\r\n        if (queryStringParameters === void 0) { queryStringParameters = {}; }\r\n        queryStringParameters['format'] = 'export';\r\n        this.authTokenProvider_\r\n            .getToken(/*forceRefresh=*/ false)\r\n            .then(function (authTokenData) {\r\n            var authToken = authTokenData && authTokenData.accessToken;\r\n            if (authToken) {\r\n                queryStringParameters['auth'] = authToken;\r\n            }\r\n            var url = (_this.repoInfo_.secure ? 'https://' : 'http://') +\r\n                _this.repoInfo_.host +\r\n                pathString +\r\n                '?' +\r\n                'ns=' +\r\n                _this.repoInfo_.namespace +\r\n                querystring(queryStringParameters);\r\n            _this.log_('Sending REST request for ' + url);\r\n            var xhr = new XMLHttpRequest();\r\n            xhr.onreadystatechange = function () {\r\n                if (callback && xhr.readyState === 4) {\r\n                    _this.log_('REST Response for ' + url + ' received. status:', xhr.status, 'response:', xhr.responseText);\r\n                    var res = null;\r\n                    if (xhr.status >= 200 && xhr.status < 300) {\r\n                        try {\r\n                            res = jsonEval(xhr.responseText);\r\n                        }\r\n                        catch (e) {\r\n                            warn('Failed to parse JSON response for ' +\r\n                                url +\r\n                                ': ' +\r\n                                xhr.responseText);\r\n                        }\r\n                        callback(null, res);\r\n                    }\r\n                    else {\r\n                        // 401 and 404 are expected.\r\n                        if (xhr.status !== 401 && xhr.status !== 404) {\r\n                            warn('Got unsuccessful REST response for ' +\r\n                                url +\r\n                                ' Status: ' +\r\n                                xhr.status);\r\n                        }\r\n                        callback(xhr.status);\r\n                    }\r\n                    callback = null;\r\n                }\r\n            };\r\n            xhr.open('GET', url, /*asynchronous=*/ true);\r\n            xhr.send();\r\n        });\r\n    };\r\n    return ReadonlyRestClient;\r\n}(ServerActions));\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar INTERRUPT_REASON = 'repo_interrupt';\r\n/**\r\n * A connection to a single data repository.\r\n */\r\nvar Repo = /** @class */ (function () {\r\n    /**\r\n     * @param {!RepoInfo} repoInfo_\r\n     * @param {boolean} forceRestClient\r\n     * @param {!FirebaseApp} app\r\n     */\r\n    function Repo(repoInfo_, forceRestClient, app) {\r\n        var _this = this;\r\n        this.repoInfo_ = repoInfo_;\r\n        this.app = app;\r\n        this.dataUpdateCount = 0;\r\n        this.statsListener_ = null;\r\n        this.eventQueue_ = new EventQueue();\r\n        this.nextWriteId_ = 1;\r\n        this.interceptServerDataCallback_ = null;\r\n        // A list of data pieces and paths to be set when this client disconnects.\r\n        this.onDisconnect_ = new SparseSnapshotTree();\r\n        /**\r\n         * TODO: This should be @private but it's used by test_access.js and internal.js\r\n         * @type {?PersistentConnection}\r\n         */\r\n        this.persistentConnection_ = null;\r\n        /** @type {!AuthTokenProvider} */\r\n        var authTokenProvider = new AuthTokenProvider(app);\r\n        this.stats_ = StatsManager.getCollection(repoInfo_);\r\n        if (forceRestClient || beingCrawled()) {\r\n            this.server_ = new ReadonlyRestClient(this.repoInfo_, this.onDataUpdate_.bind(this), authTokenProvider);\r\n            // Minor hack: Fire onConnect immediately, since there's no actual connection.\r\n            setTimeout(this.onConnectStatus_.bind(this, true), 0);\r\n        }\r\n        else {\r\n            var authOverride = app.options['databaseAuthVariableOverride'];\r\n            // Validate authOverride\r\n            if (typeof authOverride !== 'undefined' && authOverride !== null) {\r\n                if (typeof authOverride !== 'object') {\r\n                    throw new Error('Only objects are supported for option databaseAuthVariableOverride');\r\n                }\r\n                try {\r\n                    stringify(authOverride);\r\n                }\r\n                catch (e) {\r\n                    throw new Error('Invalid authOverride provided: ' + e);\r\n                }\r\n            }\r\n            this.persistentConnection_ = new PersistentConnection(this.repoInfo_, this.onDataUpdate_.bind(this), this.onConnectStatus_.bind(this), this.onServerInfoUpdate_.bind(this), authTokenProvider, authOverride);\r\n            this.server_ = this.persistentConnection_;\r\n        }\r\n        authTokenProvider.addTokenChangeListener(function (token) {\r\n            _this.server_.refreshAuthToken(token);\r\n        });\r\n        // In the case of multiple Repos for the same repoInfo (i.e. there are multiple Firebase.Contexts being used),\r\n        // we only want to create one StatsReporter.  As such, we'll report stats over the first Repo created.\r\n        this.statsReporter_ = StatsManager.getOrCreateReporter(repoInfo_, function () { return new StatsReporter(_this.stats_, _this.server_); });\r\n        this.transactions_init_();\r\n        // Used for .info.\r\n        this.infoData_ = new SnapshotHolder();\r\n        this.infoSyncTree_ = new SyncTree({\r\n            startListening: function (query, tag, currentHashFn, onComplete) {\r\n                var infoEvents = [];\r\n                var node = _this.infoData_.getNode(query.path);\r\n                // This is possibly a hack, but we have different semantics for .info endpoints. We don't raise null events\r\n                // on initial data...\r\n                if (!node.isEmpty()) {\r\n                    infoEvents = _this.infoSyncTree_.applyServerOverwrite(query.path, node);\r\n                    setTimeout(function () {\r\n                        onComplete('ok');\r\n                    }, 0);\r\n                }\r\n                return infoEvents;\r\n            },\r\n            stopListening: function () { }\r\n        });\r\n        this.updateInfo_('connected', false);\r\n        this.serverSyncTree_ = new SyncTree({\r\n            startListening: function (query, tag, currentHashFn, onComplete) {\r\n                _this.server_.listen(query, currentHashFn, tag, function (status, data) {\r\n                    var events = onComplete(status, data);\r\n                    _this.eventQueue_.raiseEventsForChangedPath(query.path, events);\r\n                });\r\n                // No synchronous events for network-backed sync trees\r\n                return [];\r\n            },\r\n            stopListening: function (query, tag) {\r\n                _this.server_.unlisten(query, tag);\r\n            }\r\n        });\r\n    }\r\n    /**\r\n     * @return {string}  The URL corresponding to the root of this Firebase.\r\n     */\r\n    Repo.prototype.toString = function () {\r\n        return ((this.repoInfo_.secure ? 'https://' : 'http://') + this.repoInfo_.host);\r\n    };\r\n    /**\r\n     * @return {!string} The namespace represented by the repo.\r\n     */\r\n    Repo.prototype.name = function () {\r\n        return this.repoInfo_.namespace;\r\n    };\r\n    /**\r\n     * @return {!number} The time in milliseconds, taking the server offset into account if we have one.\r\n     */\r\n    Repo.prototype.serverTime = function () {\r\n        var offsetNode = this.infoData_.getNode(new Path('.info/serverTimeOffset'));\r\n        var offset = offsetNode.val() || 0;\r\n        return new Date().getTime() + offset;\r\n    };\r\n    /**\r\n     * Generate ServerValues using some variables from the repo object.\r\n     * @return {!Object}\r\n     */\r\n    Repo.prototype.generateServerValues = function () {\r\n        return generateWithValues({\r\n            timestamp: this.serverTime()\r\n        });\r\n    };\r\n    /**\r\n     * Called by realtime when we get new messages from the server.\r\n     *\r\n     * @private\r\n     * @param {string} pathString\r\n     * @param {*} data\r\n     * @param {boolean} isMerge\r\n     * @param {?number} tag\r\n     */\r\n    Repo.prototype.onDataUpdate_ = function (pathString, data, isMerge, tag) {\r\n        // For testing.\r\n        this.dataUpdateCount++;\r\n        var path = new Path(pathString);\r\n        data = this.interceptServerDataCallback_\r\n            ? this.interceptServerDataCallback_(pathString, data)\r\n            : data;\r\n        var events = [];\r\n        if (tag) {\r\n            if (isMerge) {\r\n                var taggedChildren = map(data, function (raw) {\r\n                    return nodeFromJSON$1(raw);\r\n                });\r\n                events = this.serverSyncTree_.applyTaggedQueryMerge(path, taggedChildren, tag);\r\n            }\r\n            else {\r\n                var taggedSnap = nodeFromJSON$1(data);\r\n                events = this.serverSyncTree_.applyTaggedQueryOverwrite(path, taggedSnap, tag);\r\n            }\r\n        }\r\n        else if (isMerge) {\r\n            var changedChildren = map(data, function (raw) {\r\n                return nodeFromJSON$1(raw);\r\n            });\r\n            events = this.serverSyncTree_.applyServerMerge(path, changedChildren);\r\n        }\r\n        else {\r\n            var snap = nodeFromJSON$1(data);\r\n            events = this.serverSyncTree_.applyServerOverwrite(path, snap);\r\n        }\r\n        var affectedPath = path;\r\n        if (events.length > 0) {\r\n            // Since we have a listener outstanding for each transaction, receiving any events\r\n            // is a proxy for some change having occurred.\r\n            affectedPath = this.rerunTransactions_(path);\r\n        }\r\n        this.eventQueue_.raiseEventsForChangedPath(affectedPath, events);\r\n    };\r\n    /**\r\n     * TODO: This should be @private but it's used by test_access.js and internal.js\r\n     * @param {?function(!string, *):*} callback\r\n     * @private\r\n     */\r\n    Repo.prototype.interceptServerData_ = function (callback) {\r\n        this.interceptServerDataCallback_ = callback;\r\n    };\r\n    /**\r\n     * @param {!boolean} connectStatus\r\n     * @private\r\n     */\r\n    Repo.prototype.onConnectStatus_ = function (connectStatus) {\r\n        this.updateInfo_('connected', connectStatus);\r\n        if (connectStatus === false) {\r\n            this.runOnDisconnectEvents_();\r\n        }\r\n    };\r\n    /**\r\n     * @param {!Object} updates\r\n     * @private\r\n     */\r\n    Repo.prototype.onServerInfoUpdate_ = function (updates) {\r\n        var _this = this;\r\n        each(updates, function (value, key) {\r\n            _this.updateInfo_(key, value);\r\n        });\r\n    };\r\n    /**\r\n     *\r\n     * @param {!string} pathString\r\n     * @param {*} value\r\n     * @private\r\n     */\r\n    Repo.prototype.updateInfo_ = function (pathString, value) {\r\n        var path = new Path('/.info/' + pathString);\r\n        var newNode = nodeFromJSON$1(value);\r\n        this.infoData_.updateSnapshot(path, newNode);\r\n        var events = this.infoSyncTree_.applyServerOverwrite(path, newNode);\r\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\r\n    };\r\n    /**\r\n     * @return {!number}\r\n     * @private\r\n     */\r\n    Repo.prototype.getNextWriteId_ = function () {\r\n        return this.nextWriteId_++;\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {*} newVal\r\n     * @param {number|string|null} newPriority\r\n     * @param {?function(?Error, *=)} onComplete\r\n     */\r\n    Repo.prototype.setWithPriority = function (path, newVal, newPriority, onComplete) {\r\n        var _this = this;\r\n        this.log_('set', {\r\n            path: path.toString(),\r\n            value: newVal,\r\n            priority: newPriority\r\n        });\r\n        // TODO: Optimize this behavior to either (a) store flag to skip resolving where possible and / or\r\n        // (b) store unresolved paths on JSON parse\r\n        var serverValues = this.generateServerValues();\r\n        var newNodeUnresolved = nodeFromJSON$1(newVal, newPriority);\r\n        var newNode = resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\r\n        var writeId = this.getNextWriteId_();\r\n        var events = this.serverSyncTree_.applyUserOverwrite(path, newNode, writeId, true);\r\n        this.eventQueue_.queueEvents(events);\r\n        this.server_.put(path.toString(), newNodeUnresolved.val(/*export=*/ true), function (status, errorReason) {\r\n            var success = status === 'ok';\r\n            if (!success) {\r\n                warn('set at ' + path + ' failed: ' + status);\r\n            }\r\n            var clearEvents = _this.serverSyncTree_.ackUserWrite(writeId, !success);\r\n            _this.eventQueue_.raiseEventsForChangedPath(path, clearEvents);\r\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\r\n        });\r\n        var affectedPath = this.abortTransactions_(path);\r\n        this.rerunTransactions_(affectedPath);\r\n        // We queued the events above, so just flush the queue here\r\n        this.eventQueue_.raiseEventsForChangedPath(affectedPath, []);\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {!Object} childrenToMerge\r\n     * @param {?function(?Error, *=)} onComplete\r\n     */\r\n    Repo.prototype.update = function (path, childrenToMerge, onComplete) {\r\n        var _this = this;\r\n        this.log_('update', { path: path.toString(), value: childrenToMerge });\r\n        // Start with our existing data and merge each child into it.\r\n        var empty = true;\r\n        var serverValues = this.generateServerValues();\r\n        var changedChildren = {};\r\n        forEach(childrenToMerge, function (changedKey, changedValue) {\r\n            empty = false;\r\n            var newNodeUnresolved = nodeFromJSON$1(changedValue);\r\n            changedChildren[changedKey] = resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\r\n        });\r\n        if (!empty) {\r\n            var writeId_1 = this.getNextWriteId_();\r\n            var events = this.serverSyncTree_.applyUserMerge(path, changedChildren, writeId_1);\r\n            this.eventQueue_.queueEvents(events);\r\n            this.server_.merge(path.toString(), childrenToMerge, function (status, errorReason) {\r\n                var success = status === 'ok';\r\n                if (!success) {\r\n                    warn('update at ' + path + ' failed: ' + status);\r\n                }\r\n                var clearEvents = _this.serverSyncTree_.ackUserWrite(writeId_1, !success);\r\n                var affectedPath = clearEvents.length > 0 ? _this.rerunTransactions_(path) : path;\r\n                _this.eventQueue_.raiseEventsForChangedPath(affectedPath, clearEvents);\r\n                _this.callOnCompleteCallback(onComplete, status, errorReason);\r\n            });\r\n            forEach(childrenToMerge, function (changedPath) {\r\n                var affectedPath = _this.abortTransactions_(path.child(changedPath));\r\n                _this.rerunTransactions_(affectedPath);\r\n            });\r\n            // We queued the events above, so just flush the queue here\r\n            this.eventQueue_.raiseEventsForChangedPath(path, []);\r\n        }\r\n        else {\r\n            log(\"update() called with empty data.  Don't do anything.\");\r\n            this.callOnCompleteCallback(onComplete, 'ok');\r\n        }\r\n    };\r\n    /**\r\n     * Applies all of the changes stored up in the onDisconnect_ tree.\r\n     * @private\r\n     */\r\n    Repo.prototype.runOnDisconnectEvents_ = function () {\r\n        var _this = this;\r\n        this.log_('onDisconnectEvents');\r\n        var serverValues = this.generateServerValues();\r\n        var resolvedOnDisconnectTree = resolveDeferredValueTree(this.onDisconnect_, serverValues);\r\n        var events = [];\r\n        resolvedOnDisconnectTree.forEachTree(Path.Empty, function (path, snap) {\r\n            events = events.concat(_this.serverSyncTree_.applyServerOverwrite(path, snap));\r\n            var affectedPath = _this.abortTransactions_(path);\r\n            _this.rerunTransactions_(affectedPath);\r\n        });\r\n        this.onDisconnect_ = new SparseSnapshotTree();\r\n        this.eventQueue_.raiseEventsForChangedPath(Path.Empty, events);\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {?function(?Error, *=)} onComplete\r\n     */\r\n    Repo.prototype.onDisconnectCancel = function (path, onComplete) {\r\n        var _this = this;\r\n        this.server_.onDisconnectCancel(path.toString(), function (status, errorReason) {\r\n            if (status === 'ok') {\r\n                _this.onDisconnect_.forget(path);\r\n            }\r\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\r\n        });\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {*} value\r\n     * @param {?function(?Error, *=)} onComplete\r\n     */\r\n    Repo.prototype.onDisconnectSet = function (path, value, onComplete) {\r\n        var _this = this;\r\n        var newNode = nodeFromJSON$1(value);\r\n        this.server_.onDisconnectPut(path.toString(), newNode.val(/*export=*/ true), function (status, errorReason) {\r\n            if (status === 'ok') {\r\n                _this.onDisconnect_.remember(path, newNode);\r\n            }\r\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\r\n        });\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {*} value\r\n     * @param {*} priority\r\n     * @param {?function(?Error, *=)} onComplete\r\n     */\r\n    Repo.prototype.onDisconnectSetWithPriority = function (path, value, priority, onComplete) {\r\n        var _this = this;\r\n        var newNode = nodeFromJSON$1(value, priority);\r\n        this.server_.onDisconnectPut(path.toString(), newNode.val(/*export=*/ true), function (status, errorReason) {\r\n            if (status === 'ok') {\r\n                _this.onDisconnect_.remember(path, newNode);\r\n            }\r\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\r\n        });\r\n    };\r\n    /**\r\n     * @param {!Path} path\r\n     * @param {*} childrenToMerge\r\n     * @param {?function(?Error, *=)} onComplete\r\n     */\r\n    Repo.prototype.onDisconnectUpdate = function (path, childrenToMerge, onComplete) {\r\n        var _this = this;\r\n        if (isEmpty(childrenToMerge)) {\r\n            log(\"onDisconnect().update() called with empty data.  Don't do anything.\");\r\n            this.callOnCompleteCallback(onComplete, 'ok');\r\n            return;\r\n        }\r\n        this.server_.onDisconnectMerge(path.toString(), childrenToMerge, function (status, errorReason) {\r\n            if (status === 'ok') {\r\n                forEach(childrenToMerge, function (childName, childNode) {\r\n                    var newChildNode = nodeFromJSON$1(childNode);\r\n                    _this.onDisconnect_.remember(path.child(childName), newChildNode);\r\n                });\r\n            }\r\n            _this.callOnCompleteCallback(onComplete, status, errorReason);\r\n        });\r\n    };\r\n    /**\r\n     * @param {!Query} query\r\n     * @param {!EventRegistration} eventRegistration\r\n     */\r\n    Repo.prototype.addEventCallbackForQuery = function (query, eventRegistration) {\r\n        var events;\r\n        if (query.path.getFront() === '.info') {\r\n            events = this.infoSyncTree_.addEventRegistration(query, eventRegistration);\r\n        }\r\n        else {\r\n            events = this.serverSyncTree_.addEventRegistration(query, eventRegistration);\r\n        }\r\n        this.eventQueue_.raiseEventsAtPath(query.path, events);\r\n    };\r\n    /**\r\n     * @param {!Query} query\r\n     * @param {?EventRegistration} eventRegistration\r\n     */\r\n    Repo.prototype.removeEventCallbackForQuery = function (query, eventRegistration) {\r\n        // These are guaranteed not to raise events, since we're not passing in a cancelError. However, we can future-proof\r\n        // a little bit by handling the return values anyways.\r\n        var events;\r\n        if (query.path.getFront() === '.info') {\r\n            events = this.infoSyncTree_.removeEventRegistration(query, eventRegistration);\r\n        }\r\n        else {\r\n            events = this.serverSyncTree_.removeEventRegistration(query, eventRegistration);\r\n        }\r\n        this.eventQueue_.raiseEventsAtPath(query.path, events);\r\n    };\r\n    Repo.prototype.interrupt = function () {\r\n        if (this.persistentConnection_) {\r\n            this.persistentConnection_.interrupt(INTERRUPT_REASON);\r\n        }\r\n    };\r\n    Repo.prototype.resume = function () {\r\n        if (this.persistentConnection_) {\r\n            this.persistentConnection_.resume(INTERRUPT_REASON);\r\n        }\r\n    };\r\n    Repo.prototype.stats = function (showDelta) {\r\n        if (showDelta === void 0) { showDelta = false; }\r\n        if (typeof console === 'undefined')\r\n            return;\r\n        var stats;\r\n        if (showDelta) {\r\n            if (!this.statsListener_)\r\n                this.statsListener_ = new StatsListener(this.stats_);\r\n            stats = this.statsListener_.get();\r\n        }\r\n        else {\r\n            stats = this.stats_.get();\r\n        }\r\n        var longestName = Object.keys(stats).reduce(function (previousValue, currentValue) {\r\n            return Math.max(currentValue.length, previousValue);\r\n        }, 0);\r\n        forEach(stats, function (stat, value) {\r\n            // pad stat names to be the same length (plus 2 extra spaces).\r\n            for (var i = stat.length; i < longestName + 2; i++)\r\n                stat += ' ';\r\n            console.log(stat + value);\r\n        });\r\n    };\r\n    Repo.prototype.statsIncrementCounter = function (metric) {\r\n        this.stats_.incrementCounter(metric);\r\n        this.statsReporter_.includeStat(metric);\r\n    };\r\n    /**\r\n     * @param {...*} var_args\r\n     * @private\r\n     */\r\n    Repo.prototype.log_ = function () {\r\n        var var_args = [];\r\n        for (var _i = 0; _i < arguments.length; _i++) {\r\n            var_args[_i] = arguments[_i];\r\n        }\r\n        var prefix = '';\r\n        if (this.persistentConnection_) {\r\n            prefix = this.persistentConnection_.id + ':';\r\n        }\r\n        log.apply(void 0, [prefix].concat(var_args));\r\n    };\r\n    /**\r\n     * @param {?function(?Error, *=)} callback\r\n     * @param {!string} status\r\n     * @param {?string=} errorReason\r\n     */\r\n    Repo.prototype.callOnCompleteCallback = function (callback, status, errorReason) {\r\n        if (callback) {\r\n            exceptionGuard(function () {\r\n                if (status == 'ok') {\r\n                    callback(null);\r\n                }\r\n                else {\r\n                    var code = (status || 'error').toUpperCase();\r\n                    var message = code;\r\n                    if (errorReason)\r\n                        message += ': ' + errorReason;\r\n                    var error$$1 = new Error(message);\r\n                    error$$1.code = code;\r\n                    callback(error$$1);\r\n                }\r\n            });\r\n        }\r\n    };\r\n    Object.defineProperty(Repo.prototype, \"database\", {\r\n        get: function () {\r\n            return this.__database || (this.__database = new Database(this));\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    return Repo;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Filters nodes by range and uses an IndexFilter to track any changes after filtering the node\r\n *\r\n * @constructor\r\n * @implements {NodeFilter}\r\n */\r\nvar RangedFilter = /** @class */ (function () {\r\n    /**\r\n     * @param {!QueryParams} params\r\n     */\r\n    function RangedFilter(params) {\r\n        this.indexedFilter_ = new IndexedFilter(params.getIndex());\r\n        this.index_ = params.getIndex();\r\n        this.startPost_ = RangedFilter.getStartPost_(params);\r\n        this.endPost_ = RangedFilter.getEndPost_(params);\r\n    }\r\n    /**\r\n     * @return {!NamedNode}\r\n     */\r\n    RangedFilter.prototype.getStartPost = function () {\r\n        return this.startPost_;\r\n    };\r\n    /**\r\n     * @return {!NamedNode}\r\n     */\r\n    RangedFilter.prototype.getEndPost = function () {\r\n        return this.endPost_;\r\n    };\r\n    /**\r\n     * @param {!NamedNode} node\r\n     * @return {boolean}\r\n     */\r\n    RangedFilter.prototype.matches = function (node) {\r\n        return (this.index_.compare(this.getStartPost(), node) <= 0 &&\r\n            this.index_.compare(node, this.getEndPost()) <= 0);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    RangedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\r\n        if (!this.matches(new NamedNode(key, newChild))) {\r\n            newChild = ChildrenNode.EMPTY_NODE;\r\n        }\r\n        return this.indexedFilter_.updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    RangedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\r\n        if (newSnap.isLeafNode()) {\r\n            // Make sure we have a children node with the correct index, not a leaf node;\r\n            newSnap = ChildrenNode.EMPTY_NODE;\r\n        }\r\n        var filtered = newSnap.withIndex(this.index_);\r\n        // Don't support priorities on queries\r\n        filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);\r\n        var self = this;\r\n        newSnap.forEachChild(PRIORITY_INDEX, function (key, childNode) {\r\n            if (!self.matches(new NamedNode(key, childNode))) {\r\n                filtered = filtered.updateImmediateChild(key, ChildrenNode.EMPTY_NODE);\r\n            }\r\n        });\r\n        return this.indexedFilter_.updateFullNode(oldSnap, filtered, optChangeAccumulator);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    RangedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\r\n        // Don't support priorities on queries\r\n        return oldSnap;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    RangedFilter.prototype.filtersNodes = function () {\r\n        return true;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    RangedFilter.prototype.getIndexedFilter = function () {\r\n        return this.indexedFilter_;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    RangedFilter.prototype.getIndex = function () {\r\n        return this.index_;\r\n    };\r\n    /**\r\n     * @param {!QueryParams} params\r\n     * @return {!NamedNode}\r\n     * @private\r\n     */\r\n    RangedFilter.getStartPost_ = function (params) {\r\n        if (params.hasStart()) {\r\n            var startName = params.getIndexStartName();\r\n            return params.getIndex().makePost(params.getIndexStartValue(), startName);\r\n        }\r\n        else {\r\n            return params.getIndex().minPost();\r\n        }\r\n    };\r\n    /**\r\n     * @param {!QueryParams} params\r\n     * @return {!NamedNode}\r\n     * @private\r\n     */\r\n    RangedFilter.getEndPost_ = function (params) {\r\n        if (params.hasEnd()) {\r\n            var endName = params.getIndexEndName();\r\n            return params.getIndex().makePost(params.getIndexEndValue(), endName);\r\n        }\r\n        else {\r\n            return params.getIndex().maxPost();\r\n        }\r\n    };\r\n    return RangedFilter;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Applies a limit and a range to a node and uses RangedFilter to do the heavy lifting where possible\r\n *\r\n * @constructor\r\n * @implements {NodeFilter}\r\n */\r\nvar LimitedFilter = /** @class */ (function () {\r\n    /**\r\n     * @param {!QueryParams} params\r\n     */\r\n    function LimitedFilter(params) {\r\n        this.rangedFilter_ = new RangedFilter(params);\r\n        this.index_ = params.getIndex();\r\n        this.limit_ = params.getLimit();\r\n        this.reverse_ = !params.isViewFromLeft();\r\n    }\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LimitedFilter.prototype.updateChild = function (snap, key, newChild, affectedPath, source, optChangeAccumulator) {\r\n        if (!this.rangedFilter_.matches(new NamedNode(key, newChild))) {\r\n            newChild = ChildrenNode.EMPTY_NODE;\r\n        }\r\n        if (snap.getImmediateChild(key).equals(newChild)) {\r\n            // No change\r\n            return snap;\r\n        }\r\n        else if (snap.numChildren() < this.limit_) {\r\n            return this.rangedFilter_\r\n                .getIndexedFilter()\r\n                .updateChild(snap, key, newChild, affectedPath, source, optChangeAccumulator);\r\n        }\r\n        else {\r\n            return this.fullLimitUpdateChild_(snap, key, newChild, source, optChangeAccumulator);\r\n        }\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LimitedFilter.prototype.updateFullNode = function (oldSnap, newSnap, optChangeAccumulator) {\r\n        var filtered;\r\n        if (newSnap.isLeafNode() || newSnap.isEmpty()) {\r\n            // Make sure we have a children node with the correct index, not a leaf node;\r\n            filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\r\n        }\r\n        else {\r\n            if (this.limit_ * 2 < newSnap.numChildren() &&\r\n                newSnap.isIndexed(this.index_)) {\r\n                // Easier to build up a snapshot, since what we're given has more than twice the elements we want\r\n                filtered = ChildrenNode.EMPTY_NODE.withIndex(this.index_);\r\n                // anchor to the startPost, endPost, or last element as appropriate\r\n                var iterator = void 0;\r\n                if (this.reverse_) {\r\n                    iterator = newSnap.getReverseIteratorFrom(this.rangedFilter_.getEndPost(), this.index_);\r\n                }\r\n                else {\r\n                    iterator = newSnap.getIteratorFrom(this.rangedFilter_.getStartPost(), this.index_);\r\n                }\r\n                var count = 0;\r\n                while (iterator.hasNext() && count < this.limit_) {\r\n                    var next = iterator.getNext();\r\n                    var inRange = void 0;\r\n                    if (this.reverse_) {\r\n                        inRange =\r\n                            this.index_.compare(this.rangedFilter_.getStartPost(), next) <= 0;\r\n                    }\r\n                    else {\r\n                        inRange =\r\n                            this.index_.compare(next, this.rangedFilter_.getEndPost()) <= 0;\r\n                    }\r\n                    if (inRange) {\r\n                        filtered = filtered.updateImmediateChild(next.name, next.node);\r\n                        count++;\r\n                    }\r\n                    else {\r\n                        // if we have reached the end post, we cannot keep adding elemments\r\n                        break;\r\n                    }\r\n                }\r\n            }\r\n            else {\r\n                // The snap contains less than twice the limit. Faster to delete from the snap than build up a new one\r\n                filtered = newSnap.withIndex(this.index_);\r\n                // Don't support priorities on queries\r\n                filtered = filtered.updatePriority(ChildrenNode.EMPTY_NODE);\r\n                var startPost = void 0;\r\n                var endPost = void 0;\r\n                var cmp = void 0;\r\n                var iterator = void 0;\r\n                if (this.reverse_) {\r\n                    iterator = filtered.getReverseIterator(this.index_);\r\n                    startPost = this.rangedFilter_.getEndPost();\r\n                    endPost = this.rangedFilter_.getStartPost();\r\n                    var indexCompare_1 = this.index_.getCompare();\r\n                    cmp = function (a, b) { return indexCompare_1(b, a); };\r\n                }\r\n                else {\r\n                    iterator = filtered.getIterator(this.index_);\r\n                    startPost = this.rangedFilter_.getStartPost();\r\n                    endPost = this.rangedFilter_.getEndPost();\r\n                    cmp = this.index_.getCompare();\r\n                }\r\n                var count = 0;\r\n                var foundStartPost = false;\r\n                while (iterator.hasNext()) {\r\n                    var next = iterator.getNext();\r\n                    if (!foundStartPost && cmp(startPost, next) <= 0) {\r\n                        // start adding\r\n                        foundStartPost = true;\r\n                    }\r\n                    var inRange = foundStartPost && count < this.limit_ && cmp(next, endPost) <= 0;\r\n                    if (inRange) {\r\n                        count++;\r\n                    }\r\n                    else {\r\n                        filtered = filtered.updateImmediateChild(next.name, ChildrenNode.EMPTY_NODE);\r\n                    }\r\n                }\r\n            }\r\n        }\r\n        return this.rangedFilter_\r\n            .getIndexedFilter()\r\n            .updateFullNode(oldSnap, filtered, optChangeAccumulator);\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LimitedFilter.prototype.updatePriority = function (oldSnap, newPriority) {\r\n        // Don't support priorities on queries\r\n        return oldSnap;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LimitedFilter.prototype.filtersNodes = function () {\r\n        return true;\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LimitedFilter.prototype.getIndexedFilter = function () {\r\n        return this.rangedFilter_.getIndexedFilter();\r\n    };\r\n    /**\r\n     * @inheritDoc\r\n     */\r\n    LimitedFilter.prototype.getIndex = function () {\r\n        return this.index_;\r\n    };\r\n    /**\r\n     * @param {!Node} snap\r\n     * @param {string} childKey\r\n     * @param {!Node} childSnap\r\n     * @param {!CompleteChildSource} source\r\n     * @param {?ChildChangeAccumulator} changeAccumulator\r\n     * @return {!Node}\r\n     * @private\r\n     */\r\n    LimitedFilter.prototype.fullLimitUpdateChild_ = function (snap, childKey, childSnap, source, changeAccumulator) {\r\n        // TODO: rename all cache stuff etc to general snap terminology\r\n        var cmp;\r\n        if (this.reverse_) {\r\n            var indexCmp_1 = this.index_.getCompare();\r\n            cmp = function (a, b) { return indexCmp_1(b, a); };\r\n        }\r\n        else {\r\n            cmp = this.index_.getCompare();\r\n        }\r\n        var oldEventCache = snap;\r\n        assert(oldEventCache.numChildren() == this.limit_, '');\r\n        var newChildNamedNode = new NamedNode(childKey, childSnap);\r\n        var windowBoundary = this.reverse_\r\n            ? oldEventCache.getFirstChild(this.index_)\r\n            : oldEventCache.getLastChild(this.index_);\r\n        var inRange = this.rangedFilter_.matches(newChildNamedNode);\r\n        if (oldEventCache.hasChild(childKey)) {\r\n            var oldChildSnap = oldEventCache.getImmediateChild(childKey);\r\n            var nextChild = source.getChildAfterChild(this.index_, windowBoundary, this.reverse_);\r\n            while (nextChild != null &&\r\n                (nextChild.name == childKey || oldEventCache.hasChild(nextChild.name))) {\r\n                // There is a weird edge case where a node is updated as part of a merge in the write tree, but hasn't\r\n                // been applied to the limited filter yet. Ignore this next child which will be updated later in\r\n                // the limited filter...\r\n                nextChild = source.getChildAfterChild(this.index_, nextChild, this.reverse_);\r\n            }\r\n            var compareNext = nextChild == null ? 1 : cmp(nextChild, newChildNamedNode);\r\n            var remainsInWindow = inRange && !childSnap.isEmpty() && compareNext >= 0;\r\n            if (remainsInWindow) {\r\n                if (changeAccumulator != null) {\r\n                    changeAccumulator.trackChildChange(Change.childChangedChange(childKey, childSnap, oldChildSnap));\r\n                }\r\n                return oldEventCache.updateImmediateChild(childKey, childSnap);\r\n            }\r\n            else {\r\n                if (changeAccumulator != null) {\r\n                    changeAccumulator.trackChildChange(Change.childRemovedChange(childKey, oldChildSnap));\r\n                }\r\n                var newEventCache = oldEventCache.updateImmediateChild(childKey, ChildrenNode.EMPTY_NODE);\r\n                var nextChildInRange = nextChild != null && this.rangedFilter_.matches(nextChild);\r\n                if (nextChildInRange) {\r\n                    if (changeAccumulator != null) {\r\n                        changeAccumulator.trackChildChange(Change.childAddedChange(nextChild.name, nextChild.node));\r\n                    }\r\n                    return newEventCache.updateImmediateChild(nextChild.name, nextChild.node);\r\n                }\r\n                else {\r\n                    return newEventCache;\r\n                }\r\n            }\r\n        }\r\n        else if (childSnap.isEmpty()) {\r\n            // we're deleting a node, but it was not in the window, so ignore it\r\n            return snap;\r\n        }\r\n        else if (inRange) {\r\n            if (cmp(windowBoundary, newChildNamedNode) >= 0) {\r\n                if (changeAccumulator != null) {\r\n                    changeAccumulator.trackChildChange(Change.childRemovedChange(windowBoundary.name, windowBoundary.node));\r\n                    changeAccumulator.trackChildChange(Change.childAddedChange(childKey, childSnap));\r\n                }\r\n                return oldEventCache\r\n                    .updateImmediateChild(childKey, childSnap)\r\n                    .updateImmediateChild(windowBoundary.name, ChildrenNode.EMPTY_NODE);\r\n            }\r\n            else {\r\n                return snap;\r\n            }\r\n        }\r\n        else {\r\n            return snap;\r\n        }\r\n    };\r\n    return LimitedFilter;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * This class is an immutable-from-the-public-api struct containing a set of query parameters defining a\r\n * range to be returned for a particular location. It is assumed that validation of parameters is done at the\r\n * user-facing API level, so it is not done here.\r\n * @constructor\r\n */\r\nvar QueryParams = /** @class */ (function () {\r\n    function QueryParams() {\r\n        this.limitSet_ = false;\r\n        this.startSet_ = false;\r\n        this.startNameSet_ = false;\r\n        this.endSet_ = false;\r\n        this.endNameSet_ = false;\r\n        this.limit_ = 0;\r\n        this.viewFrom_ = '';\r\n        this.indexStartValue_ = null;\r\n        this.indexStartName_ = '';\r\n        this.indexEndValue_ = null;\r\n        this.indexEndName_ = '';\r\n        this.index_ = PRIORITY_INDEX;\r\n    }\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    QueryParams.prototype.hasStart = function () {\r\n        return this.startSet_;\r\n    };\r\n    /**\r\n     * @return {boolean} True if it would return from left.\r\n     */\r\n    QueryParams.prototype.isViewFromLeft = function () {\r\n        if (this.viewFrom_ === '') {\r\n            // limit(), rather than limitToFirst or limitToLast was called.\r\n            // This means that only one of startSet_ and endSet_ is true. Use them\r\n            // to calculate which side of the view to anchor to. If neither is set,\r\n            // anchor to the end.\r\n            return this.startSet_;\r\n        }\r\n        else {\r\n            return (this.viewFrom_ === QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT);\r\n        }\r\n    };\r\n    /**\r\n     * Only valid to call if hasStart() returns true\r\n     * @return {*}\r\n     */\r\n    QueryParams.prototype.getIndexStartValue = function () {\r\n        assert(this.startSet_, 'Only valid if start has been set');\r\n        return this.indexStartValue_;\r\n    };\r\n    /**\r\n     * Only valid to call if hasStart() returns true.\r\n     * Returns the starting key name for the range defined by these query parameters\r\n     * @return {!string}\r\n     */\r\n    QueryParams.prototype.getIndexStartName = function () {\r\n        assert(this.startSet_, 'Only valid if start has been set');\r\n        if (this.startNameSet_) {\r\n            return this.indexStartName_;\r\n        }\r\n        else {\r\n            return MIN_NAME;\r\n        }\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    QueryParams.prototype.hasEnd = function () {\r\n        return this.endSet_;\r\n    };\r\n    /**\r\n     * Only valid to call if hasEnd() returns true.\r\n     * @return {*}\r\n     */\r\n    QueryParams.prototype.getIndexEndValue = function () {\r\n        assert(this.endSet_, 'Only valid if end has been set');\r\n        return this.indexEndValue_;\r\n    };\r\n    /**\r\n     * Only valid to call if hasEnd() returns true.\r\n     * Returns the end key name for the range defined by these query parameters\r\n     * @return {!string}\r\n     */\r\n    QueryParams.prototype.getIndexEndName = function () {\r\n        assert(this.endSet_, 'Only valid if end has been set');\r\n        if (this.endNameSet_) {\r\n            return this.indexEndName_;\r\n        }\r\n        else {\r\n            return MAX_NAME;\r\n        }\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    QueryParams.prototype.hasLimit = function () {\r\n        return this.limitSet_;\r\n    };\r\n    /**\r\n     * @return {boolean} True if a limit has been set and it has been explicitly anchored\r\n     */\r\n    QueryParams.prototype.hasAnchoredLimit = function () {\r\n        return this.limitSet_ && this.viewFrom_ !== '';\r\n    };\r\n    /**\r\n     * Only valid to call if hasLimit() returns true\r\n     * @return {!number}\r\n     */\r\n    QueryParams.prototype.getLimit = function () {\r\n        assert(this.limitSet_, 'Only valid if limit has been set');\r\n        return this.limit_;\r\n    };\r\n    /**\r\n     * @return {!Index}\r\n     */\r\n    QueryParams.prototype.getIndex = function () {\r\n        return this.index_;\r\n    };\r\n    /**\r\n     * @return {!QueryParams}\r\n     * @private\r\n     */\r\n    QueryParams.prototype.copy_ = function () {\r\n        var copy = new QueryParams();\r\n        copy.limitSet_ = this.limitSet_;\r\n        copy.limit_ = this.limit_;\r\n        copy.startSet_ = this.startSet_;\r\n        copy.indexStartValue_ = this.indexStartValue_;\r\n        copy.startNameSet_ = this.startNameSet_;\r\n        copy.indexStartName_ = this.indexStartName_;\r\n        copy.endSet_ = this.endSet_;\r\n        copy.indexEndValue_ = this.indexEndValue_;\r\n        copy.endNameSet_ = this.endNameSet_;\r\n        copy.indexEndName_ = this.indexEndName_;\r\n        copy.index_ = this.index_;\r\n        copy.viewFrom_ = this.viewFrom_;\r\n        return copy;\r\n    };\r\n    /**\r\n     * @param {!number} newLimit\r\n     * @return {!QueryParams}\r\n     */\r\n    QueryParams.prototype.limit = function (newLimit) {\r\n        var newParams = this.copy_();\r\n        newParams.limitSet_ = true;\r\n        newParams.limit_ = newLimit;\r\n        newParams.viewFrom_ = '';\r\n        return newParams;\r\n    };\r\n    /**\r\n     * @param {!number} newLimit\r\n     * @return {!QueryParams}\r\n     */\r\n    QueryParams.prototype.limitToFirst = function (newLimit) {\r\n        var newParams = this.copy_();\r\n        newParams.limitSet_ = true;\r\n        newParams.limit_ = newLimit;\r\n        newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_LEFT;\r\n        return newParams;\r\n    };\r\n    /**\r\n     * @param {!number} newLimit\r\n     * @return {!QueryParams}\r\n     */\r\n    QueryParams.prototype.limitToLast = function (newLimit) {\r\n        var newParams = this.copy_();\r\n        newParams.limitSet_ = true;\r\n        newParams.limit_ = newLimit;\r\n        newParams.viewFrom_ = QueryParams.WIRE_PROTOCOL_CONSTANTS_.VIEW_FROM_RIGHT;\r\n        return newParams;\r\n    };\r\n    /**\r\n     * @param {*} indexValue\r\n     * @param {?string=} key\r\n     * @return {!QueryParams}\r\n     */\r\n    QueryParams.prototype.startAt = function (indexValue, key) {\r\n        var newParams = this.copy_();\r\n        newParams.startSet_ = true;\r\n        if (!(indexValue !== undefined)) {\r\n            indexValue = null;\r\n        }\r\n        newParams.indexStartValue_ = indexValue;\r\n        if (key != null) {\r\n            newParams.startNameSet_ = true;\r\n            newParams.indexStartName_ = key;\r\n        }\r\n        else {\r\n            newParams.startNameSet_ = false;\r\n            newParams.indexStartName_ = '';\r\n        }\r\n        return newParams;\r\n    };\r\n    /**\r\n     * @param {*} indexValue\r\n     * @param {?string=} key\r\n     * @return {!QueryParams}\r\n     */\r\n    QueryParams.prototype.endAt = function (indexValue, key) {\r\n        var newParams = this.copy_();\r\n        newParams.endSet_ = true;\r\n        if (!(indexValue !== undefined)) {\r\n            indexValue = null;\r\n        }\r\n        newParams.indexEndValue_ = indexValue;\r\n        if (key !== undefined) {\r\n            newParams.endNameSet_ = true;\r\n            newParams.indexEndName_ = key;\r\n        }\r\n        else {\r\n            newParams.endNameSet_ = false;\r\n            newParams.indexEndName_ = '';\r\n        }\r\n        return newParams;\r\n    };\r\n    /**\r\n     * @param {!Index} index\r\n     * @return {!QueryParams}\r\n     */\r\n    QueryParams.prototype.orderBy = function (index) {\r\n        var newParams = this.copy_();\r\n        newParams.index_ = index;\r\n        return newParams;\r\n    };\r\n    /**\r\n     * @return {!Object}\r\n     */\r\n    QueryParams.prototype.getQueryObject = function () {\r\n        var WIRE_PROTOCOL_CONSTANTS = QueryParams.WIRE_PROTOCOL_CONSTANTS_;\r\n        var obj = {};\r\n        if (this.startSet_) {\r\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_VALUE] = this.indexStartValue_;\r\n            if (this.startNameSet_) {\r\n                obj[WIRE_PROTOCOL_CONSTANTS.INDEX_START_NAME] = this.indexStartName_;\r\n            }\r\n        }\r\n        if (this.endSet_) {\r\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_VALUE] = this.indexEndValue_;\r\n            if (this.endNameSet_) {\r\n                obj[WIRE_PROTOCOL_CONSTANTS.INDEX_END_NAME] = this.indexEndName_;\r\n            }\r\n        }\r\n        if (this.limitSet_) {\r\n            obj[WIRE_PROTOCOL_CONSTANTS.LIMIT] = this.limit_;\r\n            var viewFrom = this.viewFrom_;\r\n            if (viewFrom === '') {\r\n                if (this.isViewFromLeft()) {\r\n                    viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_LEFT;\r\n                }\r\n                else {\r\n                    viewFrom = WIRE_PROTOCOL_CONSTANTS.VIEW_FROM_RIGHT;\r\n                }\r\n            }\r\n            obj[WIRE_PROTOCOL_CONSTANTS.VIEW_FROM] = viewFrom;\r\n        }\r\n        // For now, priority index is the default, so we only specify if it's some other index\r\n        if (this.index_ !== PRIORITY_INDEX) {\r\n            obj[WIRE_PROTOCOL_CONSTANTS.INDEX] = this.index_.toString();\r\n        }\r\n        return obj;\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    QueryParams.prototype.loadsAllData = function () {\r\n        return !(this.startSet_ || this.endSet_ || this.limitSet_);\r\n    };\r\n    /**\r\n     * @return {boolean}\r\n     */\r\n    QueryParams.prototype.isDefault = function () {\r\n        return this.loadsAllData() && this.index_ == PRIORITY_INDEX;\r\n    };\r\n    /**\r\n     * @return {!NodeFilter}\r\n     */\r\n    QueryParams.prototype.getNodeFilter = function () {\r\n        if (this.loadsAllData()) {\r\n            return new IndexedFilter(this.getIndex());\r\n        }\r\n        else if (this.hasLimit()) {\r\n            return new LimitedFilter(this);\r\n        }\r\n        else {\r\n            return new RangedFilter(this);\r\n        }\r\n    };\r\n    /**\r\n     * Returns a set of REST query string parameters representing this query.\r\n     *\r\n     * @return {!Object.<string,*>} query string parameters\r\n     */\r\n    QueryParams.prototype.toRestQueryStringParameters = function () {\r\n        var REST_CONSTANTS = QueryParams.REST_QUERY_CONSTANTS_;\r\n        var qs = {};\r\n        if (this.isDefault()) {\r\n            return qs;\r\n        }\r\n        var orderBy;\r\n        if (this.index_ === PRIORITY_INDEX) {\r\n            orderBy = REST_CONSTANTS.PRIORITY_INDEX;\r\n        }\r\n        else if (this.index_ === VALUE_INDEX) {\r\n            orderBy = REST_CONSTANTS.VALUE_INDEX;\r\n        }\r\n        else if (this.index_ === KEY_INDEX) {\r\n            orderBy = REST_CONSTANTS.KEY_INDEX;\r\n        }\r\n        else {\r\n            assert(this.index_ instanceof PathIndex, 'Unrecognized index type!');\r\n            orderBy = this.index_.toString();\r\n        }\r\n        qs[REST_CONSTANTS.ORDER_BY] = stringify(orderBy);\r\n        if (this.startSet_) {\r\n            qs[REST_CONSTANTS.START_AT] = stringify(this.indexStartValue_);\r\n            if (this.startNameSet_) {\r\n                qs[REST_CONSTANTS.START_AT] += ',' + stringify(this.indexStartName_);\r\n            }\r\n        }\r\n        if (this.endSet_) {\r\n            qs[REST_CONSTANTS.END_AT] = stringify(this.indexEndValue_);\r\n            if (this.endNameSet_) {\r\n                qs[REST_CONSTANTS.END_AT] += ',' + stringify(this.indexEndName_);\r\n            }\r\n        }\r\n        if (this.limitSet_) {\r\n            if (this.isViewFromLeft()) {\r\n                qs[REST_CONSTANTS.LIMIT_TO_FIRST] = this.limit_;\r\n            }\r\n            else {\r\n                qs[REST_CONSTANTS.LIMIT_TO_LAST] = this.limit_;\r\n            }\r\n        }\r\n        return qs;\r\n    };\r\n    /**\r\n     * Wire Protocol Constants\r\n     * @const\r\n     * @enum {string}\r\n     * @private\r\n     */\r\n    QueryParams.WIRE_PROTOCOL_CONSTANTS_ = {\r\n        INDEX_START_VALUE: 'sp',\r\n        INDEX_START_NAME: 'sn',\r\n        INDEX_END_VALUE: 'ep',\r\n        INDEX_END_NAME: 'en',\r\n        LIMIT: 'l',\r\n        VIEW_FROM: 'vf',\r\n        VIEW_FROM_LEFT: 'l',\r\n        VIEW_FROM_RIGHT: 'r',\r\n        INDEX: 'i'\r\n    };\r\n    /**\r\n     * REST Query Constants\r\n     * @const\r\n     * @enum {string}\r\n     * @private\r\n     */\r\n    QueryParams.REST_QUERY_CONSTANTS_ = {\r\n        ORDER_BY: 'orderBy',\r\n        PRIORITY_INDEX: '$priority',\r\n        VALUE_INDEX: '$value',\r\n        KEY_INDEX: '$key',\r\n        START_AT: 'startAt',\r\n        END_AT: 'endAt',\r\n        LIMIT_TO_FIRST: 'limitToFirst',\r\n        LIMIT_TO_LAST: 'limitToLast'\r\n    };\r\n    /**\r\n     * Default, empty query parameters\r\n     * @type {!QueryParams}\r\n     * @const\r\n     */\r\n    QueryParams.DEFAULT = new QueryParams();\r\n    return QueryParams;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar Reference = /** @class */ (function (_super) {\r\n    __extends(Reference, _super);\r\n    /**\r\n     * Call options:\r\n     *   new Reference(Repo, Path) or\r\n     *   new Reference(url: string, string|RepoManager)\r\n     *\r\n     * Externally - this is the firebase.database.Reference type.\r\n     *\r\n     * @param {!Repo} repo\r\n     * @param {(!Path)} path\r\n     * @extends {Query}\r\n     */\r\n    function Reference(repo, path) {\r\n        var _this = this;\r\n        if (!(repo instanceof Repo)) {\r\n            throw new Error('new Reference() no longer supported - use app.database().');\r\n        }\r\n        // call Query's constructor, passing in the repo and path.\r\n        _this = _super.call(this, repo, path, QueryParams.DEFAULT, false) || this;\r\n        return _this;\r\n    }\r\n    /** @return {?string} */\r\n    Reference.prototype.getKey = function () {\r\n        validateArgCount('Reference.key', 0, 0, arguments.length);\r\n        if (this.path.isEmpty())\r\n            return null;\r\n        else\r\n            return this.path.getBack();\r\n    };\r\n    /**\r\n     * @param {!(string|Path)} pathString\r\n     * @return {!Reference}\r\n     */\r\n    Reference.prototype.child = function (pathString) {\r\n        validateArgCount('Reference.child', 1, 1, arguments.length);\r\n        if (typeof pathString === 'number') {\r\n            pathString = String(pathString);\r\n        }\r\n        else if (!(pathString instanceof Path)) {\r\n            if (this.path.getFront() === null)\r\n                validateRootPathString('Reference.child', 1, pathString, false);\r\n            else\r\n                validatePathString('Reference.child', 1, pathString, false);\r\n        }\r\n        return new Reference(this.repo, this.path.child(pathString));\r\n    };\r\n    /** @return {?Reference} */\r\n    Reference.prototype.getParent = function () {\r\n        validateArgCount('Reference.parent', 0, 0, arguments.length);\r\n        var parentPath = this.path.parent();\r\n        return parentPath === null ? null : new Reference(this.repo, parentPath);\r\n    };\r\n    /** @return {!Reference} */\r\n    Reference.prototype.getRoot = function () {\r\n        validateArgCount('Reference.root', 0, 0, arguments.length);\r\n        var ref = this;\r\n        while (ref.getParent() !== null) {\r\n            ref = ref.getParent();\r\n        }\r\n        return ref;\r\n    };\r\n    /** @return {!Database} */\r\n    Reference.prototype.databaseProp = function () {\r\n        return this.repo.database;\r\n    };\r\n    /**\r\n     * @param {*} newVal\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!Promise}\r\n     */\r\n    Reference.prototype.set = function (newVal, onComplete) {\r\n        validateArgCount('Reference.set', 1, 2, arguments.length);\r\n        validateWritablePath('Reference.set', this.path);\r\n        validateFirebaseDataArg('Reference.set', 1, newVal, this.path, false);\r\n        validateCallback('Reference.set', 2, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo.setWithPriority(this.path, newVal, \r\n        /*priority=*/ null, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {!Object} objectToMerge\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!Promise}\r\n     */\r\n    Reference.prototype.update = function (objectToMerge, onComplete) {\r\n        validateArgCount('Reference.update', 1, 2, arguments.length);\r\n        validateWritablePath('Reference.update', this.path);\r\n        if (Array.isArray(objectToMerge)) {\r\n            var newObjectToMerge = {};\r\n            for (var i = 0; i < objectToMerge.length; ++i) {\r\n                newObjectToMerge['' + i] = objectToMerge[i];\r\n            }\r\n            objectToMerge = newObjectToMerge;\r\n            warn('Passing an Array to Firebase.update() is deprecated. ' +\r\n                'Use set() if you want to overwrite the existing data, or ' +\r\n                'an Object with integer keys if you really do want to ' +\r\n                'only update some of the children.');\r\n        }\r\n        validateFirebaseMergeDataArg('Reference.update', 1, objectToMerge, this.path, false);\r\n        validateCallback('Reference.update', 2, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo.update(this.path, objectToMerge, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {*} newVal\r\n     * @param {string|number|null} newPriority\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!Promise}\r\n     */\r\n    Reference.prototype.setWithPriority = function (newVal, newPriority, onComplete) {\r\n        validateArgCount('Reference.setWithPriority', 2, 3, arguments.length);\r\n        validateWritablePath('Reference.setWithPriority', this.path);\r\n        validateFirebaseDataArg('Reference.setWithPriority', 1, newVal, this.path, false);\r\n        validatePriority('Reference.setWithPriority', 2, newPriority, false);\r\n        validateCallback('Reference.setWithPriority', 3, onComplete, true);\r\n        if (this.getKey() === '.length' || this.getKey() === '.keys')\r\n            throw 'Reference.setWithPriority failed: ' +\r\n                this.getKey() +\r\n                ' is a read-only object.';\r\n        var deferred = new Deferred();\r\n        this.repo.setWithPriority(this.path, newVal, newPriority, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!Promise}\r\n     */\r\n    Reference.prototype.remove = function (onComplete) {\r\n        validateArgCount('Reference.remove', 0, 1, arguments.length);\r\n        validateWritablePath('Reference.remove', this.path);\r\n        validateCallback('Reference.remove', 1, onComplete, true);\r\n        return this.set(null, onComplete);\r\n    };\r\n    /**\r\n     * @param {function(*):*} transactionUpdate\r\n     * @param {(function(?Error, boolean, ?DataSnapshot))=} onComplete\r\n     * @param {boolean=} applyLocally\r\n     * @return {!Promise}\r\n     */\r\n    Reference.prototype.transaction = function (transactionUpdate, onComplete, applyLocally) {\r\n        validateArgCount('Reference.transaction', 1, 3, arguments.length);\r\n        validateWritablePath('Reference.transaction', this.path);\r\n        validateCallback('Reference.transaction', 1, transactionUpdate, false);\r\n        validateCallback('Reference.transaction', 2, onComplete, true);\r\n        // NOTE: applyLocally is an internal-only option for now.  We need to decide if we want to keep it and how\r\n        // to expose it.\r\n        validateBoolean('Reference.transaction', 3, applyLocally, true);\r\n        if (this.getKey() === '.length' || this.getKey() === '.keys')\r\n            throw 'Reference.transaction failed: ' +\r\n                this.getKey() +\r\n                ' is a read-only object.';\r\n        if (applyLocally === undefined)\r\n            applyLocally = true;\r\n        var deferred = new Deferred();\r\n        if (typeof onComplete === 'function') {\r\n            deferred.promise.catch(function () { });\r\n        }\r\n        var promiseComplete = function (error$$1, committed, snapshot) {\r\n            if (error$$1) {\r\n                deferred.reject(error$$1);\r\n            }\r\n            else {\r\n                deferred.resolve(new TransactionResult(committed, snapshot));\r\n            }\r\n            if (typeof onComplete === 'function') {\r\n                onComplete(error$$1, committed, snapshot);\r\n            }\r\n        };\r\n        this.repo.startTransaction(this.path, transactionUpdate, promiseComplete, applyLocally);\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {string|number|null} priority\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!Promise}\r\n     */\r\n    Reference.prototype.setPriority = function (priority, onComplete) {\r\n        validateArgCount('Reference.setPriority', 1, 2, arguments.length);\r\n        validateWritablePath('Reference.setPriority', this.path);\r\n        validatePriority('Reference.setPriority', 1, priority, false);\r\n        validateCallback('Reference.setPriority', 2, onComplete, true);\r\n        var deferred = new Deferred();\r\n        this.repo.setWithPriority(this.path.child('.priority'), priority, null, deferred.wrapCallback(onComplete));\r\n        return deferred.promise;\r\n    };\r\n    /**\r\n     * @param {*=} value\r\n     * @param {function(?Error)=} onComplete\r\n     * @return {!Reference}\r\n     */\r\n    Reference.prototype.push = function (value, onComplete) {\r\n        validateArgCount('Reference.push', 0, 2, arguments.length);\r\n        validateWritablePath('Reference.push', this.path);\r\n        validateFirebaseDataArg('Reference.push', 1, value, this.path, true);\r\n        validateCallback('Reference.push', 2, onComplete, true);\r\n        var now = this.repo.serverTime();\r\n        var name = nextPushId(now);\r\n        // push() returns a ThennableReference whose promise is fulfilled with a regular Reference.\r\n        // We use child() to create handles to two different references. The first is turned into a\r\n        // ThennableReference below by adding then() and catch() methods and is used as the\r\n        // return value of push(). The second remains a regular Reference and is used as the fulfilled\r\n        // value of the first ThennableReference.\r\n        var thennablePushRef = this.child(name);\r\n        var pushRef = this.child(name);\r\n        var promise;\r\n        if (value != null) {\r\n            promise = thennablePushRef.set(value, onComplete).then(function () { return pushRef; });\r\n        }\r\n        else {\r\n            promise = Promise.resolve(pushRef);\r\n        }\r\n        thennablePushRef.then = promise.then.bind(promise);\r\n        thennablePushRef.catch = promise.then.bind(promise, undefined);\r\n        if (typeof onComplete === 'function') {\r\n            promise.catch(function () { });\r\n        }\r\n        return thennablePushRef;\r\n    };\r\n    /**\r\n     * @return {!OnDisconnect}\r\n     */\r\n    Reference.prototype.onDisconnect = function () {\r\n        validateWritablePath('Reference.onDisconnect', this.path);\r\n        return new OnDisconnect(this.repo, this.path);\r\n    };\r\n    Object.defineProperty(Reference.prototype, \"database\", {\r\n        get: function () {\r\n            return this.databaseProp();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Object.defineProperty(Reference.prototype, \"key\", {\r\n        get: function () {\r\n            return this.getKey();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Object.defineProperty(Reference.prototype, \"parent\", {\r\n        get: function () {\r\n            return this.getParent();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Object.defineProperty(Reference.prototype, \"root\", {\r\n        get: function () {\r\n            return this.getRoot();\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    return Reference;\r\n}(Query));\r\n/**\r\n * Define reference constructor in various modules\r\n *\r\n * We are doing this here to avoid several circular\r\n * dependency issues\r\n */\r\nQuery.__referenceConstructor = Reference;\r\nSyncPoint.__referenceConstructor = Reference;\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Node in a Tree.\r\n */\r\nvar TreeNode = /** @class */ (function () {\r\n    function TreeNode() {\r\n        // TODO: Consider making accessors that create children and value lazily or\r\n        // separate Internal / Leaf 'types'.\r\n        this.children = {};\r\n        this.childCount = 0;\r\n        this.value = null;\r\n    }\r\n    return TreeNode;\r\n}());\r\n/**\r\n * A light-weight tree, traversable by path.  Nodes can have both values and children.\r\n * Nodes are not enumerated (by forEachChild) unless they have a value or non-empty\r\n * children.\r\n */\r\nvar Tree = /** @class */ (function () {\r\n    /**\r\n     * @template T\r\n     * @param {string=} name_ Optional name of the node.\r\n     * @param {Tree=} parent_ Optional parent node.\r\n     * @param {TreeNode=} node_ Optional node to wrap.\r\n     */\r\n    function Tree(name_, parent_, node_) {\r\n        if (name_ === void 0) { name_ = ''; }\r\n        if (parent_ === void 0) { parent_ = null; }\r\n        if (node_ === void 0) { node_ = new TreeNode(); }\r\n        this.name_ = name_;\r\n        this.parent_ = parent_;\r\n        this.node_ = node_;\r\n    }\r\n    /**\r\n     * Returns a sub-Tree for the given path.\r\n     *\r\n     * @param {!(string|Path)} pathObj Path to look up.\r\n     * @return {!Tree.<T>} Tree for path.\r\n     */\r\n    Tree.prototype.subTree = function (pathObj) {\r\n        // TODO: Require pathObj to be Path?\r\n        var path = pathObj instanceof Path ? pathObj : new Path(pathObj);\r\n        var child = this, next;\r\n        while ((next = path.getFront()) !== null) {\r\n            var childNode = safeGet(child.node_.children, next) || new TreeNode();\r\n            child = new Tree(next, child, childNode);\r\n            path = path.popFront();\r\n        }\r\n        return child;\r\n    };\r\n    /**\r\n     * Returns the data associated with this tree node.\r\n     *\r\n     * @return {?T} The data or null if no data exists.\r\n     */\r\n    Tree.prototype.getValue = function () {\r\n        return this.node_.value;\r\n    };\r\n    /**\r\n     * Sets data to this tree node.\r\n     *\r\n     * @param {!T} value Value to set.\r\n     */\r\n    Tree.prototype.setValue = function (value) {\r\n        assert(typeof value !== 'undefined', 'Cannot set value to undefined');\r\n        this.node_.value = value;\r\n        this.updateParents_();\r\n    };\r\n    /**\r\n     * Clears the contents of the tree node (its value and all children).\r\n     */\r\n    Tree.prototype.clear = function () {\r\n        this.node_.value = null;\r\n        this.node_.children = {};\r\n        this.node_.childCount = 0;\r\n        this.updateParents_();\r\n    };\r\n    /**\r\n     * @return {boolean} Whether the tree has any children.\r\n     */\r\n    Tree.prototype.hasChildren = function () {\r\n        return this.node_.childCount > 0;\r\n    };\r\n    /**\r\n     * @return {boolean} Whether the tree is empty (no value or children).\r\n     */\r\n    Tree.prototype.isEmpty = function () {\r\n        return this.getValue() === null && !this.hasChildren();\r\n    };\r\n    /**\r\n     * Calls action for each child of this tree node.\r\n     *\r\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\r\n     */\r\n    Tree.prototype.forEachChild = function (action) {\r\n        var _this = this;\r\n        forEach(this.node_.children, function (child, childTree) {\r\n            action(new Tree(child, _this, childTree));\r\n        });\r\n    };\r\n    /**\r\n     * Does a depth-first traversal of this node's descendants, calling action for each one.\r\n     *\r\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\r\n     * @param {boolean=} includeSelf Whether to call action on this node as well. Defaults to\r\n     *   false.\r\n     * @param {boolean=} childrenFirst Whether to call action on children before calling it on\r\n     *   parent.\r\n     */\r\n    Tree.prototype.forEachDescendant = function (action, includeSelf, childrenFirst) {\r\n        if (includeSelf && !childrenFirst)\r\n            action(this);\r\n        this.forEachChild(function (child) {\r\n            child.forEachDescendant(action, /*includeSelf=*/ true, childrenFirst);\r\n        });\r\n        if (includeSelf && childrenFirst)\r\n            action(this);\r\n    };\r\n    /**\r\n     * Calls action on each ancestor node.\r\n     *\r\n     * @param {function(!Tree.<T>)} action Action to be called on each parent; return\r\n     *   true to abort.\r\n     * @param {boolean=} includeSelf Whether to call action on this node as well.\r\n     * @return {boolean} true if the action callback returned true.\r\n     */\r\n    Tree.prototype.forEachAncestor = function (action, includeSelf) {\r\n        var node = includeSelf ? this : this.parent();\r\n        while (node !== null) {\r\n            if (action(node)) {\r\n                return true;\r\n            }\r\n            node = node.parent();\r\n        }\r\n        return false;\r\n    };\r\n    /**\r\n     * Does a depth-first traversal of this node's descendants.  When a descendant with a value\r\n     * is found, action is called on it and traversal does not continue inside the node.\r\n     * Action is *not* called on this node.\r\n     *\r\n     * @param {function(!Tree.<T>)} action Action to be called for each child.\r\n     */\r\n    Tree.prototype.forEachImmediateDescendantWithValue = function (action) {\r\n        this.forEachChild(function (child) {\r\n            if (child.getValue() !== null)\r\n                action(child);\r\n            else\r\n                child.forEachImmediateDescendantWithValue(action);\r\n        });\r\n    };\r\n    /**\r\n     * @return {!Path} The path of this tree node, as a Path.\r\n     */\r\n    Tree.prototype.path = function () {\r\n        return new Path(this.parent_ === null\r\n            ? this.name_\r\n            : this.parent_.path() + '/' + this.name_);\r\n    };\r\n    /**\r\n     * @return {string} The name of the tree node.\r\n     */\r\n    Tree.prototype.name = function () {\r\n        return this.name_;\r\n    };\r\n    /**\r\n     * @return {?Tree} The parent tree node, or null if this is the root of the tree.\r\n     */\r\n    Tree.prototype.parent = function () {\r\n        return this.parent_;\r\n    };\r\n    /**\r\n     * Adds or removes this child from its parent based on whether it's empty or not.\r\n     *\r\n     * @private\r\n     */\r\n    Tree.prototype.updateParents_ = function () {\r\n        if (this.parent_ !== null)\r\n            this.parent_.updateChild_(this.name_, this);\r\n    };\r\n    /**\r\n     * Adds or removes the passed child to this tree node, depending on whether it's empty.\r\n     *\r\n     * @param {string} childName The name of the child to update.\r\n     * @param {!Tree.<T>} child The child to update.\r\n     * @private\r\n     */\r\n    Tree.prototype.updateChild_ = function (childName, child) {\r\n        var childEmpty = child.isEmpty();\r\n        var childExists = contains(this.node_.children, childName);\r\n        if (childEmpty && childExists) {\r\n            delete this.node_.children[childName];\r\n            this.node_.childCount--;\r\n            this.updateParents_();\r\n        }\r\n        else if (!childEmpty && !childExists) {\r\n            this.node_.children[childName] = child.node_;\r\n            this.node_.childCount++;\r\n            this.updateParents_();\r\n        }\r\n    };\r\n    return Tree;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n// TODO: This is pretty messy.  Ideally, a lot of this would move into FirebaseData, or a transaction-specific\r\n// component used by FirebaseData, but it has ties to user callbacks (transaction update and onComplete) as well\r\n// as the realtime connection (to send transactions to the server).  So that all needs to be decoupled first.\r\n// For now it's part of Repo, but in its own file.\r\n/**\r\n * @enum {number}\r\n */\r\nvar TransactionStatus;\r\n(function (TransactionStatus) {\r\n    // We've run the transaction and updated transactionResultData_ with the result, but it isn't currently sent to the\r\n    // server. A transaction will go from RUN -> SENT -> RUN if it comes back from the server as rejected due to\r\n    // mismatched hash.\r\n    TransactionStatus[TransactionStatus[\"RUN\"] = 0] = \"RUN\";\r\n    // We've run the transaction and sent it to the server and it's currently outstanding (hasn't come back as accepted\r\n    // or rejected yet).\r\n    TransactionStatus[TransactionStatus[\"SENT\"] = 1] = \"SENT\";\r\n    // Temporary state used to mark completed transactions (whether successful or aborted).  The transaction will be\r\n    // removed when we get a chance to prune completed ones.\r\n    TransactionStatus[TransactionStatus[\"COMPLETED\"] = 2] = \"COMPLETED\";\r\n    // Used when an already-sent transaction needs to be aborted (e.g. due to a conflicting set() call that was made).\r\n    // If it comes back as unsuccessful, we'll abort it.\r\n    TransactionStatus[TransactionStatus[\"SENT_NEEDS_ABORT\"] = 3] = \"SENT_NEEDS_ABORT\";\r\n    // Temporary state used to mark transactions that need to be aborted.\r\n    TransactionStatus[TransactionStatus[\"NEEDS_ABORT\"] = 4] = \"NEEDS_ABORT\";\r\n})(TransactionStatus || (TransactionStatus = {}));\r\n/**\r\n * If a transaction does not succeed after 25 retries, we abort it.  Among other things this ensure that if there's\r\n * ever a bug causing a mismatch between client / server hashes for some data, we won't retry indefinitely.\r\n * @type {number}\r\n * @const\r\n * @private\r\n */\r\nRepo.MAX_TRANSACTION_RETRIES_ = 25;\r\n/**\r\n * Setup the transaction data structures\r\n * @private\r\n */\r\nRepo.prototype.transactions_init_ = function () {\r\n    /**\r\n     * Stores queues of outstanding transactions for Firebase locations.\r\n     *\r\n     * @type {!Tree.<Array.<!Transaction>>}\r\n     * @private\r\n     */\r\n    this.transactionQueueTree_ = new Tree();\r\n};\r\n/**\r\n * Creates a new transaction, adds it to the transactions we're tracking, and sends it to the server if possible.\r\n *\r\n * @param {!Path} path Path at which to do transaction.\r\n * @param {function(*):*} transactionUpdate Update callback.\r\n * @param {?function(?Error, boolean, ?DataSnapshot)} onComplete Completion callback.\r\n * @param {boolean} applyLocally Whether or not to make intermediate results visible\r\n */\r\nRepo.prototype.startTransaction = function (path, transactionUpdate, onComplete, applyLocally) {\r\n    this.log_('transaction on ' + path);\r\n    // Add a watch to make sure we get server updates.\r\n    var valueCallback = function () { };\r\n    var watchRef = new Reference(this, path);\r\n    watchRef.on('value', valueCallback);\r\n    var unwatcher = function () {\r\n        watchRef.off('value', valueCallback);\r\n    };\r\n    // Initialize transaction.\r\n    var transaction = {\r\n        path: path,\r\n        update: transactionUpdate,\r\n        onComplete: onComplete,\r\n        // One of TransactionStatus enums.\r\n        status: null,\r\n        // Used when combining transactions at different locations to figure out which one goes first.\r\n        order: LUIDGenerator(),\r\n        // Whether to raise local events for this transaction.\r\n        applyLocally: applyLocally,\r\n        // Count of how many times we've retried the transaction.\r\n        retryCount: 0,\r\n        // Function to call to clean up our .on() listener.\r\n        unwatcher: unwatcher,\r\n        // Stores why a transaction was aborted.\r\n        abortReason: null,\r\n        currentWriteId: null,\r\n        currentInputSnapshot: null,\r\n        currentOutputSnapshotRaw: null,\r\n        currentOutputSnapshotResolved: null\r\n    };\r\n    // Run transaction initially.\r\n    var currentState = this.getLatestState_(path);\r\n    transaction.currentInputSnapshot = currentState;\r\n    var newVal = transaction.update(currentState.val());\r\n    if (newVal === undefined) {\r\n        // Abort transaction.\r\n        transaction.unwatcher();\r\n        transaction.currentOutputSnapshotRaw = null;\r\n        transaction.currentOutputSnapshotResolved = null;\r\n        if (transaction.onComplete) {\r\n            // We just set the input snapshot, so this cast should be safe\r\n            var snapshot = new DataSnapshot(transaction.currentInputSnapshot, new Reference(this, transaction.path), PRIORITY_INDEX);\r\n            transaction.onComplete(null, false, snapshot);\r\n        }\r\n    }\r\n    else {\r\n        validateFirebaseData('transaction failed: Data returned ', newVal, transaction.path);\r\n        // Mark as run and add to our queue.\r\n        transaction.status = TransactionStatus.RUN;\r\n        var queueNode = this.transactionQueueTree_.subTree(path);\r\n        var nodeQueue = queueNode.getValue() || [];\r\n        nodeQueue.push(transaction);\r\n        queueNode.setValue(nodeQueue);\r\n        // Update visibleData and raise events\r\n        // Note: We intentionally raise events after updating all of our transaction state, since the user could\r\n        // start new transactions from the event callbacks.\r\n        var priorityForNode = void 0;\r\n        if (typeof newVal === 'object' &&\r\n            newVal !== null &&\r\n            contains(newVal, '.priority')) {\r\n            priorityForNode = safeGet(newVal, '.priority');\r\n            assert(isValidPriority(priorityForNode), 'Invalid priority returned by transaction. ' +\r\n                'Priority must be a valid string, finite number, server value, or null.');\r\n        }\r\n        else {\r\n            var currentNode = this.serverSyncTree_.calcCompleteEventCache(path) ||\r\n                ChildrenNode.EMPTY_NODE;\r\n            priorityForNode = currentNode.getPriority().val();\r\n        }\r\n        priorityForNode /** @type {null|number|string} */ = priorityForNode;\r\n        var serverValues = this.generateServerValues();\r\n        var newNodeUnresolved = nodeFromJSON$1(newVal, priorityForNode);\r\n        var newNode = resolveDeferredValueSnapshot(newNodeUnresolved, serverValues);\r\n        transaction.currentOutputSnapshotRaw = newNodeUnresolved;\r\n        transaction.currentOutputSnapshotResolved = newNode;\r\n        transaction.currentWriteId = this.getNextWriteId_();\r\n        var events = this.serverSyncTree_.applyUserOverwrite(path, newNode, transaction.currentWriteId, transaction.applyLocally);\r\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\r\n        this.sendReadyTransactions_();\r\n    }\r\n};\r\n/**\r\n * @param {!Path} path\r\n * @param {Array.<number>=} excludeSets A specific set to exclude\r\n * @return {Node}\r\n * @private\r\n */\r\nRepo.prototype.getLatestState_ = function (path, excludeSets) {\r\n    return (this.serverSyncTree_.calcCompleteEventCache(path, excludeSets) ||\r\n        ChildrenNode.EMPTY_NODE);\r\n};\r\n/**\r\n * Sends any already-run transactions that aren't waiting for outstanding transactions to\r\n * complete.\r\n *\r\n * Externally it's called with no arguments, but it calls itself recursively with a particular\r\n * transactionQueueTree node to recurse through the tree.\r\n *\r\n * @param {Tree.<Array.<Transaction>>=} node  transactionQueueTree node to start at.\r\n * @private\r\n */\r\nRepo.prototype.sendReadyTransactions_ = function (node) {\r\n    var _this = this;\r\n    if (node === void 0) { node = this.transactionQueueTree_; }\r\n    // Before recursing, make sure any completed transactions are removed.\r\n    if (!node) {\r\n        this.pruneCompletedTransactionsBelowNode_(node);\r\n    }\r\n    if (node.getValue() !== null) {\r\n        var queue = this.buildTransactionQueue_(node);\r\n        assert(queue.length > 0, 'Sending zero length transaction queue');\r\n        var allRun = queue.every(function (transaction) { return transaction.status === TransactionStatus.RUN; });\r\n        // If they're all run (and not sent), we can send them.  Else, we must wait.\r\n        if (allRun) {\r\n            this.sendTransactionQueue_(node.path(), queue);\r\n        }\r\n    }\r\n    else if (node.hasChildren()) {\r\n        node.forEachChild(function (childNode) {\r\n            _this.sendReadyTransactions_(childNode);\r\n        });\r\n    }\r\n};\r\n/**\r\n * Given a list of run transactions, send them to the server and then handle the result (success or failure).\r\n *\r\n * @param {!Path} path The location of the queue.\r\n * @param {!Array.<Transaction>} queue Queue of transactions under the specified location.\r\n * @private\r\n */\r\nRepo.prototype.sendTransactionQueue_ = function (path, queue) {\r\n    var _this = this;\r\n    // Mark transactions as sent and increment retry count!\r\n    var setsToIgnore = queue.map(function (txn) {\r\n        return txn.currentWriteId;\r\n    });\r\n    var latestState = this.getLatestState_(path, setsToIgnore);\r\n    var snapToSend = latestState;\r\n    var latestHash = latestState.hash();\r\n    for (var i = 0; i < queue.length; i++) {\r\n        var txn = queue[i];\r\n        assert(txn.status === TransactionStatus.RUN, 'tryToSendTransactionQueue_: items in queue should all be run.');\r\n        txn.status = TransactionStatus.SENT;\r\n        txn.retryCount++;\r\n        var relativePath = Path.relativePath(path, txn.path);\r\n        // If we've gotten to this point, the output snapshot must be defined.\r\n        snapToSend = snapToSend.updateChild(relativePath /**@type {!Node} */, txn.currentOutputSnapshotRaw);\r\n    }\r\n    var dataToSend = snapToSend.val(true);\r\n    var pathToSend = path;\r\n    // Send the put.\r\n    this.server_.put(pathToSend.toString(), dataToSend, function (status) {\r\n        _this.log_('transaction put response', {\r\n            path: pathToSend.toString(),\r\n            status: status\r\n        });\r\n        var events = [];\r\n        if (status === 'ok') {\r\n            // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\r\n            // the callback could trigger more transactions or sets.\r\n            var callbacks = [];\r\n            for (var i = 0; i < queue.length; i++) {\r\n                queue[i].status = TransactionStatus.COMPLETED;\r\n                events = events.concat(_this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId));\r\n                if (queue[i].onComplete) {\r\n                    // We never unset the output snapshot, and given that this transaction is complete, it should be set\r\n                    var node = queue[i].currentOutputSnapshotResolved;\r\n                    var ref = new Reference(_this, queue[i].path);\r\n                    var snapshot = new DataSnapshot(node, ref, PRIORITY_INDEX);\r\n                    callbacks.push(queue[i].onComplete.bind(null, null, true, snapshot));\r\n                }\r\n                queue[i].unwatcher();\r\n            }\r\n            // Now remove the completed transactions.\r\n            _this.pruneCompletedTransactionsBelowNode_(_this.transactionQueueTree_.subTree(path));\r\n            // There may be pending transactions that we can now send.\r\n            _this.sendReadyTransactions_();\r\n            _this.eventQueue_.raiseEventsForChangedPath(path, events);\r\n            // Finally, trigger onComplete callbacks.\r\n            for (var i = 0; i < callbacks.length; i++) {\r\n                exceptionGuard(callbacks[i]);\r\n            }\r\n        }\r\n        else {\r\n            // transactions are no longer sent.  Update their status appropriately.\r\n            if (status === 'datastale') {\r\n                for (var i = 0; i < queue.length; i++) {\r\n                    if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT)\r\n                        queue[i].status = TransactionStatus.NEEDS_ABORT;\r\n                    else\r\n                        queue[i].status = TransactionStatus.RUN;\r\n                }\r\n            }\r\n            else {\r\n                warn('transaction at ' + pathToSend.toString() + ' failed: ' + status);\r\n                for (var i = 0; i < queue.length; i++) {\r\n                    queue[i].status = TransactionStatus.NEEDS_ABORT;\r\n                    queue[i].abortReason = status;\r\n                }\r\n            }\r\n            _this.rerunTransactions_(path);\r\n        }\r\n    }, latestHash);\r\n};\r\n/**\r\n * Finds all transactions dependent on the data at changedPath and reruns them.\r\n *\r\n * Should be called any time cached data changes.\r\n *\r\n * Return the highest path that was affected by rerunning transactions.  This is the path at which events need to\r\n * be raised for.\r\n *\r\n * @param {!Path} changedPath The path in mergedData that changed.\r\n * @return {!Path} The rootmost path that was affected by rerunning transactions.\r\n * @private\r\n */\r\nRepo.prototype.rerunTransactions_ = function (changedPath) {\r\n    var rootMostTransactionNode = this.getAncestorTransactionNode_(changedPath);\r\n    var path = rootMostTransactionNode.path();\r\n    var queue = this.buildTransactionQueue_(rootMostTransactionNode);\r\n    this.rerunTransactionQueue_(queue, path);\r\n    return path;\r\n};\r\n/**\r\n * Does all the work of rerunning transactions (as well as cleans up aborted transactions and whatnot).\r\n *\r\n * @param {Array.<Transaction>} queue The queue of transactions to run.\r\n * @param {!Path} path The path the queue is for.\r\n * @private\r\n */\r\nRepo.prototype.rerunTransactionQueue_ = function (queue, path) {\r\n    if (queue.length === 0) {\r\n        return; // Nothing to do!\r\n    }\r\n    // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\r\n    // the callback could trigger more transactions or sets.\r\n    var callbacks = [];\r\n    var events = [];\r\n    // Ignore all of the sets we're going to re-run.\r\n    var txnsToRerun = queue.filter(function (q) {\r\n        return q.status === TransactionStatus.RUN;\r\n    });\r\n    var setsToIgnore = txnsToRerun.map(function (q) {\r\n        return q.currentWriteId;\r\n    });\r\n    for (var i = 0; i < queue.length; i++) {\r\n        var transaction = queue[i];\r\n        var relativePath = Path.relativePath(path, transaction.path);\r\n        var abortTransaction = false, abortReason = void 0;\r\n        assert(relativePath !== null, 'rerunTransactionsUnderNode_: relativePath should not be null.');\r\n        if (transaction.status === TransactionStatus.NEEDS_ABORT) {\r\n            abortTransaction = true;\r\n            abortReason = transaction.abortReason;\r\n            events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\r\n        }\r\n        else if (transaction.status === TransactionStatus.RUN) {\r\n            if (transaction.retryCount >= Repo.MAX_TRANSACTION_RETRIES_) {\r\n                abortTransaction = true;\r\n                abortReason = 'maxretry';\r\n                events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\r\n            }\r\n            else {\r\n                // This code reruns a transaction\r\n                var currentNode = this.getLatestState_(transaction.path, setsToIgnore);\r\n                transaction.currentInputSnapshot = currentNode;\r\n                var newData = queue[i].update(currentNode.val());\r\n                if (newData !== undefined) {\r\n                    validateFirebaseData('transaction failed: Data returned ', newData, transaction.path);\r\n                    var newDataNode = nodeFromJSON$1(newData);\r\n                    var hasExplicitPriority = typeof newData === 'object' &&\r\n                        newData != null &&\r\n                        contains(newData, '.priority');\r\n                    if (!hasExplicitPriority) {\r\n                        // Keep the old priority if there wasn't a priority explicitly specified.\r\n                        newDataNode = newDataNode.updatePriority(currentNode.getPriority());\r\n                    }\r\n                    var oldWriteId = transaction.currentWriteId;\r\n                    var serverValues = this.generateServerValues();\r\n                    var newNodeResolved = resolveDeferredValueSnapshot(newDataNode, serverValues);\r\n                    transaction.currentOutputSnapshotRaw = newDataNode;\r\n                    transaction.currentOutputSnapshotResolved = newNodeResolved;\r\n                    transaction.currentWriteId = this.getNextWriteId_();\r\n                    // Mutates setsToIgnore in place\r\n                    setsToIgnore.splice(setsToIgnore.indexOf(oldWriteId), 1);\r\n                    events = events.concat(this.serverSyncTree_.applyUserOverwrite(transaction.path, newNodeResolved, transaction.currentWriteId, transaction.applyLocally));\r\n                    events = events.concat(this.serverSyncTree_.ackUserWrite(oldWriteId, true));\r\n                }\r\n                else {\r\n                    abortTransaction = true;\r\n                    abortReason = 'nodata';\r\n                    events = events.concat(this.serverSyncTree_.ackUserWrite(transaction.currentWriteId, true));\r\n                }\r\n            }\r\n        }\r\n        this.eventQueue_.raiseEventsForChangedPath(path, events);\r\n        events = [];\r\n        if (abortTransaction) {\r\n            // Abort.\r\n            queue[i].status = TransactionStatus.COMPLETED;\r\n            // Removing a listener can trigger pruning which can muck with mergedData/visibleData (as it prunes data).\r\n            // So defer the unwatcher until we're done.\r\n            (function (unwatcher) {\r\n                setTimeout(unwatcher, Math.floor(0));\r\n            })(queue[i].unwatcher);\r\n            if (queue[i].onComplete) {\r\n                if (abortReason === 'nodata') {\r\n                    var ref = new Reference(this, queue[i].path);\r\n                    // We set this field immediately, so it's safe to cast to an actual snapshot\r\n                    var lastInput /** @type {!Node} */ = queue[i].currentInputSnapshot;\r\n                    var snapshot = new DataSnapshot(lastInput, ref, PRIORITY_INDEX);\r\n                    callbacks.push(queue[i].onComplete.bind(null, null, false, snapshot));\r\n                }\r\n                else {\r\n                    callbacks.push(queue[i].onComplete.bind(null, new Error(abortReason), false, null));\r\n                }\r\n            }\r\n        }\r\n    }\r\n    // Clean up completed transactions.\r\n    this.pruneCompletedTransactionsBelowNode_(this.transactionQueueTree_);\r\n    // Now fire callbacks, now that we're in a good, known state.\r\n    for (var i = 0; i < callbacks.length; i++) {\r\n        exceptionGuard(callbacks[i]);\r\n    }\r\n    // Try to send the transaction result to the server.\r\n    this.sendReadyTransactions_();\r\n};\r\n/**\r\n * Returns the rootmost ancestor node of the specified path that has a pending transaction on it, or just returns\r\n * the node for the given path if there are no pending transactions on any ancestor.\r\n *\r\n * @param {!Path} path The location to start at.\r\n * @return {!Tree.<Array.<!Transaction>>} The rootmost node with a transaction.\r\n * @private\r\n */\r\nRepo.prototype.getAncestorTransactionNode_ = function (path) {\r\n    var front;\r\n    // Start at the root and walk deeper into the tree towards path until we find a node with pending transactions.\r\n    var transactionNode = this.transactionQueueTree_;\r\n    while ((front = path.getFront()) !== null &&\r\n        transactionNode.getValue() === null) {\r\n        transactionNode = transactionNode.subTree(front);\r\n        path = path.popFront();\r\n    }\r\n    return transactionNode;\r\n};\r\n/**\r\n * Builds the queue of all transactions at or below the specified transactionNode.\r\n *\r\n * @param {!Tree.<Array.<Transaction>>} transactionNode\r\n * @return {Array.<Transaction>} The generated queue.\r\n * @private\r\n */\r\nRepo.prototype.buildTransactionQueue_ = function (transactionNode) {\r\n    // Walk any child transaction queues and aggregate them into a single queue.\r\n    var transactionQueue = [];\r\n    this.aggregateTransactionQueuesForNode_(transactionNode, transactionQueue);\r\n    // Sort them by the order the transactions were created.\r\n    transactionQueue.sort(function (a, b) {\r\n        return a.order - b.order;\r\n    });\r\n    return transactionQueue;\r\n};\r\n/**\r\n * @param {!Tree.<Array.<Transaction>>} node\r\n * @param {Array.<Transaction>} queue\r\n * @private\r\n */\r\nRepo.prototype.aggregateTransactionQueuesForNode_ = function (node, queue) {\r\n    var _this = this;\r\n    var nodeQueue = node.getValue();\r\n    if (nodeQueue !== null) {\r\n        for (var i = 0; i < nodeQueue.length; i++) {\r\n            queue.push(nodeQueue[i]);\r\n        }\r\n    }\r\n    node.forEachChild(function (child) {\r\n        _this.aggregateTransactionQueuesForNode_(child, queue);\r\n    });\r\n};\r\n/**\r\n * Remove COMPLETED transactions at or below this node in the transactionQueueTree_.\r\n *\r\n * @param {!Tree.<Array.<!Transaction>>} node\r\n * @private\r\n */\r\nRepo.prototype.pruneCompletedTransactionsBelowNode_ = function (node) {\r\n    var _this = this;\r\n    var queue = node.getValue();\r\n    if (queue) {\r\n        var to = 0;\r\n        for (var from = 0; from < queue.length; from++) {\r\n            if (queue[from].status !== TransactionStatus.COMPLETED) {\r\n                queue[to] = queue[from];\r\n                to++;\r\n            }\r\n        }\r\n        queue.length = to;\r\n        node.setValue(queue.length > 0 ? queue : null);\r\n    }\r\n    node.forEachChild(function (childNode) {\r\n        _this.pruneCompletedTransactionsBelowNode_(childNode);\r\n    });\r\n};\r\n/**\r\n * Aborts all transactions on ancestors or descendants of the specified path.  Called when doing a set() or update()\r\n * since we consider them incompatible with transactions.\r\n *\r\n * @param {!Path} path Path for which we want to abort related transactions.\r\n * @return {!Path}\r\n * @private\r\n */\r\nRepo.prototype.abortTransactions_ = function (path) {\r\n    var _this = this;\r\n    var affectedPath = this.getAncestorTransactionNode_(path).path();\r\n    var transactionNode = this.transactionQueueTree_.subTree(path);\r\n    transactionNode.forEachAncestor(function (node) {\r\n        _this.abortTransactionsOnNode_(node);\r\n    });\r\n    this.abortTransactionsOnNode_(transactionNode);\r\n    transactionNode.forEachDescendant(function (node) {\r\n        _this.abortTransactionsOnNode_(node);\r\n    });\r\n    return affectedPath;\r\n};\r\n/**\r\n * Abort transactions stored in this transaction queue node.\r\n *\r\n * @param {!Tree.<Array.<Transaction>>} node Node to abort transactions for.\r\n * @private\r\n */\r\nRepo.prototype.abortTransactionsOnNode_ = function (node) {\r\n    var queue = node.getValue();\r\n    if (queue !== null) {\r\n        // Queue up the callbacks and fire them after cleaning up all of our transaction state, since\r\n        // the callback could trigger more transactions or sets.\r\n        var callbacks = [];\r\n        // Go through queue.  Any already-sent transactions must be marked for abort, while the unsent ones\r\n        // can be immediately aborted and removed.\r\n        var events = [];\r\n        var lastSent = -1;\r\n        for (var i = 0; i < queue.length; i++) {\r\n            if (queue[i].status === TransactionStatus.SENT_NEEDS_ABORT) {\r\n                // Already marked.  No action needed.\r\n            }\r\n            else if (queue[i].status === TransactionStatus.SENT) {\r\n                assert(lastSent === i - 1, 'All SENT items should be at beginning of queue.');\r\n                lastSent = i;\r\n                // Mark transaction for abort when it comes back.\r\n                queue[i].status = TransactionStatus.SENT_NEEDS_ABORT;\r\n                queue[i].abortReason = 'set';\r\n            }\r\n            else {\r\n                assert(queue[i].status === TransactionStatus.RUN, 'Unexpected transaction status in abort');\r\n                // We can abort it immediately.\r\n                queue[i].unwatcher();\r\n                events = events.concat(this.serverSyncTree_.ackUserWrite(queue[i].currentWriteId, true));\r\n                if (queue[i].onComplete) {\r\n                    var snapshot = null;\r\n                    callbacks.push(queue[i].onComplete.bind(null, new Error('set'), false, snapshot));\r\n                }\r\n            }\r\n        }\r\n        if (lastSent === -1) {\r\n            // We're not waiting for any sent transactions.  We can clear the queue.\r\n            node.setValue(null);\r\n        }\r\n        else {\r\n            // Remove the transactions we aborted.\r\n            queue.length = lastSent + 1;\r\n        }\r\n        // Now fire the callbacks.\r\n        this.eventQueue_.raiseEventsForChangedPath(node.path(), events);\r\n        for (var i = 0; i < callbacks.length; i++) {\r\n            exceptionGuard(callbacks[i]);\r\n        }\r\n    }\r\n};\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/** @const {string} */\r\nvar DATABASE_URL_OPTION = 'databaseURL';\r\nvar _staticInstance;\r\n/**\r\n * Creates and caches Repo instances.\r\n */\r\nvar RepoManager = /** @class */ (function () {\r\n    function RepoManager() {\r\n        /**\r\n         * @private {!Object.<string, Object<string, !fb.core.Repo>>}\r\n         */\r\n        this.repos_ = {};\r\n        /**\r\n         * If true, new Repos will be created to use ReadonlyRestClient (for testing purposes).\r\n         * @private {boolean}\r\n         */\r\n        this.useRestClient_ = false;\r\n    }\r\n    RepoManager.getInstance = function () {\r\n        if (!_staticInstance) {\r\n            _staticInstance = new RepoManager();\r\n        }\r\n        return _staticInstance;\r\n    };\r\n    // TODO(koss): Remove these functions unless used in tests?\r\n    RepoManager.prototype.interrupt = function () {\r\n        for (var appName in this.repos_) {\r\n            for (var dbUrl in this.repos_[appName]) {\r\n                this.repos_[appName][dbUrl].interrupt();\r\n            }\r\n        }\r\n    };\r\n    RepoManager.prototype.resume = function () {\r\n        for (var appName in this.repos_) {\r\n            for (var dbUrl in this.repos_[appName]) {\r\n                this.repos_[appName][dbUrl].resume();\r\n            }\r\n        }\r\n    };\r\n    /**\r\n     * This function should only ever be called to CREATE a new database instance.\r\n     *\r\n     * @param {!FirebaseApp} app\r\n     * @return {!Database}\r\n     */\r\n    RepoManager.prototype.databaseFromApp = function (app, url) {\r\n        var dbUrl = url || app.options[DATABASE_URL_OPTION];\r\n        if (dbUrl === undefined) {\r\n            fatal(\"Can't determine Firebase Database URL.  Be sure to include \" +\r\n                DATABASE_URL_OPTION +\r\n                ' option when calling firebase.initializeApp().');\r\n        }\r\n        var parsedUrl = parseRepoInfo(dbUrl);\r\n        var repoInfo = parsedUrl.repoInfo;\r\n        validateUrl('Invalid Firebase Database URL', 1, parsedUrl);\r\n        if (!parsedUrl.path.isEmpty()) {\r\n            fatal('Database URL must point to the root of a Firebase Database ' +\r\n                '(not including a child path).');\r\n        }\r\n        var repo = this.createRepo(repoInfo, app);\r\n        return repo.database;\r\n    };\r\n    /**\r\n     * Remove the repo and make sure it is disconnected.\r\n     *\r\n     * @param {!Repo} repo\r\n     */\r\n    RepoManager.prototype.deleteRepo = function (repo) {\r\n        var appRepos = safeGet(this.repos_, repo.app.name);\r\n        // This should never happen...\r\n        if (!appRepos || safeGet(appRepos, repo.repoInfo_.toURLString()) !== repo) {\r\n            fatal(\"Database \" + repo.app.name + \"(\" + repo.repoInfo_ + \") has already been deleted.\");\r\n        }\r\n        repo.interrupt();\r\n        delete appRepos[repo.repoInfo_.toURLString()];\r\n    };\r\n    /**\r\n     * Ensures a repo doesn't already exist and then creates one using the\r\n     * provided app.\r\n     *\r\n     * @param {!RepoInfo} repoInfo The metadata about the Repo\r\n     * @param {!FirebaseApp} app\r\n     * @return {!Repo} The Repo object for the specified server / repoName.\r\n     */\r\n    RepoManager.prototype.createRepo = function (repoInfo, app) {\r\n        var appRepos = safeGet(this.repos_, app.name);\r\n        if (!appRepos) {\r\n            appRepos = {};\r\n            this.repos_[app.name] = appRepos;\r\n        }\r\n        var repo = safeGet(appRepos, repoInfo.toURLString());\r\n        if (repo) {\r\n            fatal('Database initialized multiple times. Please make sure the format of the database URL matches with each database() call.');\r\n        }\r\n        repo = new Repo(repoInfo, this.useRestClient_, app);\r\n        appRepos[repoInfo.toURLString()] = repo;\r\n        return repo;\r\n    };\r\n    /**\r\n     * Forces us to use ReadonlyRestClient instead of PersistentConnection for new Repos.\r\n     * @param {boolean} forceRestClient\r\n     */\r\n    RepoManager.prototype.forceRestClient = function (forceRestClient) {\r\n        this.useRestClient_ = forceRestClient;\r\n    };\r\n    return RepoManager;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * Class representing a firebase database.\r\n * @implements {FirebaseService}\r\n */\r\nvar Database = /** @class */ (function () {\r\n    /**\r\n     * The constructor should not be called by users of our public API.\r\n     * @param {!Repo} repo_\r\n     */\r\n    function Database(repo_) {\r\n        this.repo_ = repo_;\r\n        if (!(repo_ instanceof Repo)) {\r\n            fatal(\"Don't call new Database() directly - please use firebase.database().\");\r\n        }\r\n        /** @type {Reference} */\r\n        this.root_ = new Reference(repo_, Path.Empty);\r\n        this.INTERNAL = new DatabaseInternals(this);\r\n    }\r\n    Object.defineProperty(Database.prototype, \"app\", {\r\n        get: function () {\r\n            return this.repo_.app;\r\n        },\r\n        enumerable: true,\r\n        configurable: true\r\n    });\r\n    Database.prototype.ref = function (path) {\r\n        this.checkDeleted_('ref');\r\n        validateArgCount('database.ref', 0, 1, arguments.length);\r\n        if (path instanceof Reference) {\r\n            return this.refFromURL(path.toString());\r\n        }\r\n        return path !== undefined ? this.root_.child(path) : this.root_;\r\n    };\r\n    /**\r\n     * Returns a reference to the root or the path specified in url.\r\n     * We throw a exception if the url is not in the same domain as the\r\n     * current repo.\r\n     * @param {string} url\r\n     * @return {!Reference} Firebase reference.\r\n     */\r\n    Database.prototype.refFromURL = function (url) {\r\n        /** @const {string} */\r\n        var apiName = 'database.refFromURL';\r\n        this.checkDeleted_(apiName);\r\n        validateArgCount(apiName, 1, 1, arguments.length);\r\n        var parsedURL = parseRepoInfo(url);\r\n        validateUrl(apiName, 1, parsedURL);\r\n        var repoInfo = parsedURL.repoInfo;\r\n        if (repoInfo.host !== this.repo_.repoInfo_.host) {\r\n            fatal(apiName +\r\n                ': Host name does not match the current database: ' +\r\n                '(found ' +\r\n                repoInfo.host +\r\n                ' but expected ' +\r\n                this.repo_.repoInfo_.host +\r\n                ')');\r\n        }\r\n        return this.ref(parsedURL.path.toString());\r\n    };\r\n    /**\r\n     * @param {string} apiName\r\n     */\r\n    Database.prototype.checkDeleted_ = function (apiName) {\r\n        if (this.repo_ === null) {\r\n            fatal('Cannot call ' + apiName + ' on a deleted database.');\r\n        }\r\n    };\r\n    // Make individual repo go offline.\r\n    Database.prototype.goOffline = function () {\r\n        validateArgCount('database.goOffline', 0, 0, arguments.length);\r\n        this.checkDeleted_('goOffline');\r\n        this.repo_.interrupt();\r\n    };\r\n    Database.prototype.goOnline = function () {\r\n        validateArgCount('database.goOnline', 0, 0, arguments.length);\r\n        this.checkDeleted_('goOnline');\r\n        this.repo_.resume();\r\n    };\r\n    Database.ServerValue = {\r\n        TIMESTAMP: {\r\n            '.sv': 'timestamp'\r\n        }\r\n    };\r\n    return Database;\r\n}());\r\nvar DatabaseInternals = /** @class */ (function () {\r\n    /** @param {!Database} database */\r\n    function DatabaseInternals(database) {\r\n        this.database = database;\r\n    }\r\n    /** @return {Promise<void>} */\r\n    DatabaseInternals.prototype.delete = function () {\r\n        return __awaiter(this, void 0, void 0, function () {\r\n            return __generator(this, function (_a) {\r\n                this.database.checkDeleted_('delete');\r\n                RepoManager.getInstance().deleteRepo(this.database.repo_);\r\n                this.database.repo_ = null;\r\n                this.database.root_ = null;\r\n                this.database.INTERNAL = null;\r\n                this.database = null;\r\n                return [2 /*return*/];\r\n            });\r\n        });\r\n    };\r\n    return DatabaseInternals;\r\n}());\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n/**\r\n * INTERNAL methods for internal-use only (tests, etc.).\r\n *\r\n * Customers shouldn't use these or else should be aware that they could break at any time.\r\n *\r\n * @const\r\n */\r\nvar forceLongPolling = function () {\r\n    WebSocketConnection.forceDisallow();\r\n    BrowserPollConnection.forceAllow();\r\n};\r\nvar forceWebSockets = function () {\r\n    BrowserPollConnection.forceDisallow();\r\n};\r\n/* Used by App Manager */\r\nvar isWebSocketsAvailable = function () {\r\n    return WebSocketConnection['isAvailable']();\r\n};\r\nvar setSecurityDebugCallback = function (ref, callback) {\r\n    ref.repo.persistentConnection_.securityDebugCallback_ = callback;\r\n};\r\nvar stats = function (ref, showDelta) {\r\n    ref.repo.stats(showDelta);\r\n};\r\nvar statsIncrementCounter = function (ref, metric) {\r\n    ref.repo.statsIncrementCounter(metric);\r\n};\r\nvar dataUpdateCount = function (ref) {\r\n    return ref.repo.dataUpdateCount;\r\n};\r\nvar interceptServerData = function (ref, callback) {\r\n    return ref.repo.interceptServerData_(callback);\r\n};\n\nvar INTERNAL = /*#__PURE__*/Object.freeze({\n  forceLongPolling: forceLongPolling,\n  forceWebSockets: forceWebSockets,\n  isWebSocketsAvailable: isWebSocketsAvailable,\n  setSecurityDebugCallback: setSecurityDebugCallback,\n  stats: stats,\n  statsIncrementCounter: statsIncrementCounter,\n  dataUpdateCount: dataUpdateCount,\n  interceptServerData: interceptServerData\n});\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar DataConnection = PersistentConnection;\r\n/**\r\n * @param {!string} pathString\r\n * @param {function(*)} onComplete\r\n */\r\nPersistentConnection.prototype.simpleListen = function (pathString, onComplete) {\r\n    this.sendRequest('q', { p: pathString }, onComplete);\r\n};\r\n/**\r\n * @param {*} data\r\n * @param {function(*)} onEcho\r\n */\r\nPersistentConnection.prototype.echo = function (data, onEcho) {\r\n    this.sendRequest('echo', { d: data }, onEcho);\r\n};\r\n// RealTimeConnection properties that we use in tests.\r\nvar RealTimeConnection = Connection;\r\n/**\r\n * @param {function(): string} newHash\r\n * @return {function()}\r\n */\r\nvar hijackHash = function (newHash) {\r\n    var oldPut = PersistentConnection.prototype.put;\r\n    PersistentConnection.prototype.put = function (pathString, data, opt_onComplete, opt_hash) {\r\n        if (opt_hash !== undefined) {\r\n            opt_hash = newHash();\r\n        }\r\n        oldPut.call(this, pathString, data, opt_onComplete, opt_hash);\r\n    };\r\n    return function () {\r\n        PersistentConnection.prototype.put = oldPut;\r\n    };\r\n};\r\n/**\r\n * @type {function(new:RepoInfo, !string, boolean, !string, boolean): undefined}\r\n */\r\nvar ConnectionTarget = RepoInfo;\r\n/**\r\n * @param {!Query} query\r\n * @return {!string}\r\n */\r\nvar queryIdentifier = function (query) {\r\n    return query.queryIdentifier();\r\n};\r\n/**\r\n * @param {!Query} firebaseRef\r\n * @return {!Object}\r\n */\r\nvar listens = function (firebaseRef) {\r\n    return firebaseRef.repo.persistentConnection_.listens_;\r\n};\r\n/**\r\n * Forces the RepoManager to create Repos that use ReadonlyRestClient instead of PersistentConnection.\r\n *\r\n * @param {boolean} forceRestClient\r\n */\r\nvar forceRestClient = function (forceRestClient) {\r\n    RepoManager.getInstance().forceRestClient(forceRestClient);\r\n};\n\nvar TEST_ACCESS = /*#__PURE__*/Object.freeze({\n  DataConnection: DataConnection,\n  RealTimeConnection: RealTimeConnection,\n  hijackHash: hijackHash,\n  ConnectionTarget: ConnectionTarget,\n  queryIdentifier: queryIdentifier,\n  listens: listens,\n  forceRestClient: forceRestClient\n});\n\n/**\r\n * Copyright 2017 Google Inc.\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n *   http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\nvar ServerValue = Database.ServerValue;\r\nfunction registerDatabase(instance) {\r\n    // Register the Database Service with the 'firebase' namespace.\r\n    var namespace = instance.INTERNAL.registerService('database', function (app, unused, url) { return RepoManager.getInstance().databaseFromApp(app, url); }, \r\n    // firebase.database namespace properties\r\n    {\r\n        Reference: Reference,\r\n        Query: Query,\r\n        Database: Database,\r\n        enableLogging: enableLogging,\r\n        INTERNAL: INTERNAL,\r\n        ServerValue: ServerValue,\r\n        TEST_ACCESS: TEST_ACCESS\r\n    }, null, true);\r\n    if (isNodeSdk()) {\r\n        module.exports = namespace;\r\n    }\r\n}\r\nregisterDatabase(firebase);\n\nexport { registerDatabase, Database, Query, Reference, enableLogging, ServerValue, DataSnapshot, OnDisconnect };\n"],"names":["extendStatics","Object","setPrototypeOf","__proto__","Array","d","b","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","Deferred","_this","promise","Promise","resolve","reject","wrapCallback","callback","catch","isMobileCordova","window","test","navigator","isNodeSdk","ERROR_NAME","captureStackTrace","FirebaseError","code","ErrorFactory","apply","arguments","err","name","defineProperty","get","stack","service","serviceName","errors","pattern","data","template","fullCode","replace","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","Sha1","_super","chain_","buf_","W_","pad_","inbuf_","total_","blockSize","reset","compress_","buf","opt_offset","W","k","a","update","opt_length","lengthMinusBlock","inbuf","digest","totalBits","j","validateArgCount","fnName","minCount","maxCount","argCount","argError","errorPrefix","argumentNumber","optional","argName","validateCallback","validateContextObject","context","LogLevel","stringLength","id","defaultLogLevel","INFO","defaultLogHandler","instance","logType","args","_i","logLevel","now","toISOString","DEBUG","VERBOSE","log","concat","info","WARN","warn","ERROR","Logger","_logLevel","_logHandler","set","val","enumerable","configurable","debug","DOMStorageWrapper","domStorage_","prefix_","removeItem","prefixedName_","setItem","storedVal","getItem","remove","MemoryStorage","cache_","isInMemoryStorage","createStoragefor","domStorageName","domStorage","PersistentStorage","SessionStorage","logClient","LUIDGenerator","sha1","utf8Bytes","high","sha1Bytes","buildLogMessage_","var_args","logger","firstLog_","enableLogging","logger_","persistent","bind","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","beingCrawled","search","setTimeoutNonBlocking","time","timeout","Path","pathOrString","pieceNum","pieces_","copyTo","pieceNum_","getFront","getLength","popFront","getBack","pathString","toUrlEncodedString","encodeURIComponent","begin","parent","pieces","child","childPathObj","childPieces","relativePath","outerPath","innerPath","outer","inner","comparePaths","left","right","leftKeys","rightKeys","cmp","equals","other","ValidationPath","path","errorPrefix_","parts_","byteLength_","max","checkValid_","last","MAX_PATH_LENGTH_BYTES","MAX_PATH_DEPTH","toErrorString","LONG_POLLING","RepoInfo","host","secure","namespace","webSocketOnly","persistenceKey","domain","indexOf","internalHost","needsQueryParam","isCustomHost","isCacheableHost","isDemoHost","updateHost","newHost","connectionURL","type","params","connURL","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_","isValidKey","isValidPathString","isValidPriority","priority","validateFirebaseDataArg","validateFirebaseData","errorPrefix$$1","path_","hasDotValue_1","hasActualChild_1","validateFirebaseMergeDataArg","mergePaths","curPath","prevPath","validateFirebaseMergePaths","validatePriority","validateEventType","eventType","validateKey","validatePathString","validateWritablePath","validateUrl","isValidRootPathString","OnDisconnect","repo_","cancel","onComplete","deferred","onDisconnectCancel","onDisconnectSet","setWithPriority","onDisconnectSetWithPriority","objectToMerge","newObjectToMerge","onDisconnectUpdate","TransactionResult","committed","snapshot","toJSON","nextPushId","duplicateTime","timeStampChars","random","NamedNode","node","Wrap","Index","getCompare","compare","indexedValueChanged","oldNode","newNode","oldWrapped","newWrapped","minPost","MIN","KeyIndex","isDefinedOn","maxPost","makePost","indexValue","KEY_INDEX","__childrenNodeConstructor","nodeFromJSON","MAX_NODE$1","priorityHashText","validatePriorityNode","priorityNode","isLeafNode","getPriority","LeafNode","value_","priorityNode_","EMPTY_NODE","lazyHash_","updatePriority","newPriorityNode","getImmediateChild","childName","getChild","hasChild","getPredecessorChildName","childNode","updateImmediateChild","newChildNode","updateChild","front","numChildren","forEachChild","index","action","exportFormat",".value","getValue",".priority","hash","toHash","compareTo","compareToLeafNode_","otherLeaf","otherLeafType","thisLeafType","otherIndex","VALUE_TYPE_ORDER","thisIndex","withIndex","isIndexed","_defaultIndexMap","PRIORITY_INDEX","PriorityIndex","aPriority","bPriority","indexCmp","SortedMapIterator","startKey","comparator","isReverse_","resultGenerator_","nodeStack_","getNext","result","hasNext","peek","LLRBNode","color","RED","SortedMap","copy","count","inorderTraversal","reverseTraversal","min_","minKey","maxKey","insert","fixUp_","removeMin_","isRed_","moveRedLeft_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","nr","checkMaxDepth_","blackDepth","check_","BLACK","LLRBEmptyNode","comparator_","root_","getPredecessorKey","rightParent","getIterator","resultGenerator","getIteratorFrom","getReverseIteratorFrom","getReverseIterator","LOG_2","Base12Num","num","current_","mask","bits_","nextBitIsOne","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","low","namedNode","middle","root","base12","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","buildFrom12Array","fallbackObject","IndexMap","indexes_","indexSet_","indexKey","sortedMap","hasIndex","indexDefinition","addIndex","existingChildren","newIndex","sawIndexedValue","iter","indexName","newIndexSet","newIndexes","addToIndexes","indexedChildren","existingSnap","newChildren","removeFromIndexes","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","ChildrenNode","children_","indexMap_","Default","newIndexMap","newImmediateChild","numKeys","allIntegerKeys","array","toHash_1","childHash","idx","resolveIndex_","predecessor","getFirstChildName","getFirstChild","getLastChildName","getLastChild","wrappedNode","startPost","endPost","MAX_NODE$2","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","MaxNode","defineProperties","MAX","setMaxNode$1","USE_HINZE","nodeFromJSON$1","json","node_1","jsonObj_1","childData","children_1","childrenHavePriority_1","hinzeJsonObj_1","childSet","sortedChildSet","setNodeFromJSON","__referenceConstructor","OperationType","VALUE_INDEX","ValueIndex","valueNode","PathIndex","indexPath_","extractChild","snap","aChild","bChild","DataSnapshot","node_","ref_","index_","exportVal","exists","childPathString","childPath","childRef","hasChildren","getKey","getRef","DataEvent","eventRegistration","prevName","getPath","ref","getParent","getEventType","getEventRunner","CancelEvent","ValueEventRegistration","callback_","cancelCallback_","context_","respondsTo","createEvent","change","query","getQueryParams","getIndex","snapshotNode","eventData","ctx","cancelCB_1","cb_1","createCancelEvent","matches","hasAnyCallback","ChildEventRegistration","callbacks_","eventToCheck","cancelCB_2","cb_2","otherCount","otherKey","thisKey","every","cb","Query","repo","queryParams_","orderByCalled_","validateQueryEndpoints_","startNode","endNode","hasStart","getIndexStartValue","hasEnd","getIndexEndValue","tooManyArgsError","wrongArgTypeError","getIndexStartName","getIndexEndName","validateLimit_","hasLimit","hasAnchoredLimit","validateNoPreviousOrderByCall_","on","cancelCallbackOrContext","ret","getCancelAndContextArgs_","onValueEvent","callbacks","onChildEvent","cancelCallback","container","addEventCallbackForQuery","off","removeEventCallbackForQuery","once","userCallback","cancelOrContext","firstCall","onceCallback","limitToFirst","limit","limitToLast","orderByChild","parsedPath","newParams","orderBy","orderByKey","orderByPriority","orderByValue","startAt","endAt","equalTo","queryObject","getQueryObject","queryIdentifier","isEqual","sameRepo","samePath","sameQueryIdentifier","CountedSet","add","item","clear","SparseSnapshotTree","find","childKey","remember","forget","self_1","tree","forEachTree","prefixPath","func","resolveDeferredValue","serverValues","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","emptyChildrenSingleton","__referenceConstructor$1","OperationSource","fromUser","fromServer","queryId","tagged","User","Server","forServerTaggedQuery","AckUserWrite","affectedTree","revert","ACK_USER_WRITE","operationForChild","children","subtree","Empty","EmptyChildren","ImmutableTree","fromObject","childSnap","findRootMostMatchingPathAndValue","predicate","childExistingPathAndValue","findRootMostValueAndPath","toSet","newChild","setTree","newTree","fold","fold_","pathSoFar","accum","findOnPath","findOnPath_","pathToFollow","nextChild","foreachOnPath","foreachOnPath_","currentRelativePath","foreach","foreach_","foreachChild","ListenComplete","LISTEN_COMPLETE","Overwrite","OVERWRITE","Merge","MERGE","CacheNode","fullyInitialized_","filtered_","isFullyInitialized","isFiltered","isCompleteForPath","isCompleteForChild","getNode","ViewCache","eventCache_","serverCache_","updateEventSnap","eventSnap","complete","filtered","updateServerSnap","serverSnap","getEventCache","getCompleteEventSnap","getServerCache","getCompleteServerSnap","Change","oldSnap","valueChange","VALUE","childAddedChange","CHILD_ADDED","childRemovedChange","CHILD_REMOVED","childChangedChange","newSnapshot","oldSnapshot","CHILD_CHANGED","childMovedChange","CHILD_MOVED","IndexedFilter","affectedPath","optChangeAccumulator","oldChild","trackChildChange","updateFullNode","newSnap","newPriority","filtersNodes","getIndexedFilter","ChildChangeAccumulator","changeMap_","oldChange","oldType","getChanges","getValues","NO_COMPLETE_CHILD_SOURCE","NoCompleteChildSource_","getCompleteChild","getChildAfterChild","WriteTreeCompleteChildSource","writes_","viewCache_","optCompleteServerCache_","serverNode","calcCompleteChild","completeServerData","nodes","calcIndexedSlice","ProcessorResult","viewCache","changes","ViewProcessor","filter_","assertIndexed","applyOperation","oldViewCache","operation","writesCache","completeCache","newViewCache","filterServerNode","accumulator","overwrite","applyUserOverwrite_","applyServerOverwrite_","merge","applyUserMerge_","applyServerMerge_","ackUserWrite","revertUserWrite_","ackUserWrite_","listenComplete_","maybeAddValueEvent_","isLeafOrEmpty","oldCompleteSnap","generateEventCacheAfterServerEvent_","changePath","oldEventSnap","shadowingWrite","newEventCache","serverCache","completeChildren","completeEventChildren","calcCompleteEventChildren","completeNode","calcCompleteEventCache","oldEventNode","updatedPriority","calcEventCacheAfterServerOverwrite","childChangePath","newEventChild","eventChildUpdate","changedSnap","newServerCache","oldServerSnap","serverFilter","newServerNode","newEventSnap","cacheHasChild_","changedChildren","curViewCache","writePath","applyMerge_","viewMergeTree","serverChild","childMergeTree","isUnknownDeepMerge","ackPath","changedChildren_1","changedChildren_2","mergePath","serverCachePath","oldServerNode","completeServerCache","oldEventCache","serverChildren","EventGenerator","query_","generateEventsForChanges","eventCache","eventRegistrations","events","moves","generateEventsForType_","registrations","filteredChanges","filter","compareChanges_","materializedChange","materializeSingleChange_","registration","aWrapped","bWrapped","View","initialViewCache","eventRegistrations_","indexFilter","getNodeFilter","processor_","initialServerCache","initialEventCache","eventGenerator_","getQuery","getCompleteServerCache","cache","loadsAllData","addEventRegistration","removeEventRegistration","cancelError","cancelEvents","path_1","maybeEvent","remaining","existing","generateEventsForChanges_","getInitialEvents","initialChanges","SyncPoint","views_","optCompleteServerCache","view","events_1","serverCacheComplete","eventCacheComplete","removed","hadCompleteView","hasCompleteView","viewQueryId","getQueryViews","viewForQuery","getCompleteView","viewExistsForQuery","CompoundWrite","writeTree_","addWrite","rootmost","rootMostPath","addWrites","updates","newWrite","removeWrite","hasCompleteWrite","getCompleteNode","getCompleteChildren","childCompoundWrite","shadowingNode","applySubtreeWrite_","writeTree","priorityWrite_1","WriteTree","visibleWrites_","allWrites_","lastWriteId_","childWrites","WriteTreeRef","addOverwrite","writeId","visible","addMerge","getWrite","record","findIndex","writeToRemove","splice","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","recordContainsPath_","resetTree_","getCompleteWriteData","treePath","writeIdsToExclude","includeHiddenWrites","mergeAtPath","layerTree_","write","layeredCache","subMerge","completeServerChildren","topLevelSet","merge_1","existingEventSnap","existingServerSnap","childMerge","toIterate","writeRecord","DefaultFilter_","writes","treeRoot","compoundWrite","deepNode","treePath_","existingServerCache","SyncTree","listenProvider_","syncPointTree_","pendingWriteTree_","tagToQueryMap_","queryToTagMap_","applyUserOverwrite","newData","applyOperationToSyncPoints_","applyUserMerge","changeTree","affectedTree_1","applyServerOverwrite","applyServerMerge","applyListenComplete","applyTaggedQueryOverwrite","tag","queryKey","queryKeyForTag_","r","parseQueryKey_","queryPath","applyTaggedOperation_","applyTaggedQueryMerge","applyTaggedListenComplete","foundAncestorDefaultView","pathToSyncPoint","sp","syncPoint","childSyncPoint","viewAlreadyExists","makeQueryKey_","getNextQueryTag_","setupListener_","maybeSyncPoint","removedAndEvents","removingDefault","covered","parentSyncPoint","newViews","collectDistinctViewsForSubTree_","newQuery","listener","createListenerForView_","startListening","queryForListening_","tagForQuery_","hashFn","stopListening","queryToRemove","tagToRemove","removeTags_","maybeChildSyncPoint","childMap","views_1","childViews","queries","removedQuery","removedQueryKey","removedQueryTag","isDefault","queriesToStop","queries_1","childQueries","queryToStop","status","error$$1","reason","toUpperCase","errorForServerCode","splitIndex","nextQueryTag_","applyOperationHelper_","syncPointTree","applyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","SnapshotHolder","rootNode_","updateSnapshot","newSnapshotNode","AuthTokenProvider","app_","getToken","forceRefresh","then","addTokenChangeListener","removeTokenChangeListener","notifyForInvalidToken","errorMessage","options","StatsCollection","counters_","incrementCounter","amount","StatsManager","getCollection","hashString","collections_","getOrCreateReporter","creatorFunction","reporters_","StatsListener","collection_","last_","newStats","delta","stat","FIRST_STATS_MIN_TIME","FIRST_STATS_MAX_TIME","StatsReporter","collection","server_","statsToReport_","statsListener_","reportStats_","includeStat","stats","reportedStats","haveStatsToReport","reportStats","EventQueue","eventLists_","recursionDepth_","queueEvents","eventDataList","currList","eventPath","EventList","raiseEventsAtPath","raiseQueuedEventsMatchingPredicate_","raiseEventsForChangedPath","changedPath","sentAll","eventList","raise","events_","eventFn","EventEmitter","allowedEvents_","listeners_","trigger","listeners","validateEventType_","getInitialEvent","et","VisibilityMonitor","hidden","visibilityChange","document","addEventListener","visible_","getInstance","OnlineMonitor","online_","currentlyOnline","PacketReceiver","onMessage_","pendingResponses","currentResponseNum","closeAfterResponse","onClose","closeAfter","responseNum","handleResponse","requestNum","_loop_1","toProcess","this_1","_loop_2","FIREBASE_LONGPOLL_COMMAND_CB_NAME","FIREBASE_LONGPOLL_DATA_CB_NAME","BrowserPollConnection","connId","transportSessionId","lastSessionId","bytesSent","bytesReceived","everConnected_","log_","stats_","urlFn","open","onMessage","onDisconnect","curSegmentNum","onDisconnect_","myPacketOrderer","isClosed_","connectTimeoutTimer_","onClosed_","readyState","called_1","wrappedFn_1","attachEvent","executeWhenDOMReady","scriptTagHolder","FirebaseIFrameScriptHolder","command","arg1","arg2","incrementIncomingBytes_","clearTimeout","password","sendNewPolls","pN","urlParams","start","uniqueCallbackIdentifier","href","connectURL","addTag","startLongPoll","addDisconnectPingFrame","forceAllow","forceAllow_","forceDisallow","forceDisallow_","isAvailable","createElement","Windows","UI","markConnectionHealthy","shutdown_","close","myDisconnFrame","removeChild","send","dataStr","base64data","MAX_URL_DATA_SIZE","enqueueSegment","pw","dframe","src","style","display","appendChild","commandCB","onMessageCB","outstandingRequests","pendingSegs","currentSerial","myIFrame","createIFrame_","script","iframeContents","doc","iframe","contentWindow","contentDocument","alive","innerHTML","myID","disconn","myPW","theURL","nodeRestRequest","newRequest_","curDataString","theSeg","shift","seg","ts","addLongPollTag_","segnum","totalsegs","url","serial","doNewRequest","keepaliveTimeout","loadCB","doNodeLongPoll","newScript_1","async","onload","onreadystatechange","rstate","parentNode","onerror","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","keepaliveTimer","frames","totalFrames","connectionURL_","device","headers","User-Agent","firebase","SDK_VERSION","process","platform","env","proxy","origin","mySock","onopen","onclose","onmessage","m","handleIncomingFrame","isOldAndroid","userAgent","oldAndroidMatch","parseFloat","previouslyFailed","appendFrame_","fullMess","jsonMess","handleNewFrameCount_","frameCount","extractFrameCount_","isNaN","mess","resetKeepAlive","remainingData","sendString_","clearInterval","setInterval","responsesRequiredToBeHealthy","healthyTimeout","TransportManager","initTransports_","isWebSocketsAvailable","isSkipPollConnection","transports_","transports_1","ALL_TRANSPORTS","transport","initialTransport","upgradeTransport","Connection","repoInfo_","onReady_","onKill_","connectionCount","pendingDataMessages","state_","transportManager_","start_","conn","conn_","nextTransportId_","primaryResponsesRequired_","onMessageReceived","connReceiver_","onConnectionLost","disconnReceiver_","tx_","rx_","secondaryConn_","isHealthy_","healthyTimeout_ms","healthyTimeout_","everConnected","onConnectionLost_","onSecondaryConnectionLost_","onPrimaryMessageReceived_","onSecondaryMessageReceived_","sendRequest","dataMsg","msg","sendData_","tryCleanupConnection","onSecondaryControl_","controlData","cmd","upgradeIfSecondaryHealthy_","secondaryResponsesRequired_","parsedData","layer","proceedWithUpgrade_","onControl_","onDataMessage_","onPrimaryResponse_","payload","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","timestamp","version","h","sessionId","onConnectionEstablished_","tryStartUpgrade_","startUpgrade_","closeConnections_","ServerActions","put","refreshAuthToken","onDisconnectPut","onDisconnectMerge","RECONNECT_MIN_DELAY","RECONNECT_MAX_DELAY_DEFAULT","PersistentConnection","onDataUpdate_","onConnectStatus_","onServerInfoUpdate_","authTokenProvider_","authOverride_","nextPersistentConnectionId_","interruptReasons_","listens_","outstandingPuts_","outstandingPutCount_","onDisconnectRequestQueue_","connected_","reconnectDelay_","maxReconnectDelay_","securityDebugCallback_","establishConnectionTimer_","requestCBHash_","requestNumber_","realtime_","authToken_","forceTokenRefresh_","invalidAuthTokenCount_","firstConnection_","lastConnectionAttemptTime_","lastConnectionEstablishedTime_","scheduleConnect_","onVisible_","onOnline_","onResponse","curReqNum","listen","currentHashFn","listenSpec","sendListen_","req","warnOnListenWarnings_","removeListen_","warnings","indexSpec","indexPath","tryAuth","reduceReconnectDelayIfAdminCredential_","credential","token_1","authMethod","requestData","cred","onAuthRevoked_","unlisten","sendUnlisten_","queryObj","sendOnDisconnect_","request","response","putInternal","sendPut_","queued","errorReason","reqNum","onDataPush_","onListenRevoked_","onSecurityDebugPacket_","handleTimestamp_","sendConnectStats_","restoreState_","establishConnection_","online","onRealtimeDisconnect_","cancelSentTransactions_","shouldReconnect_","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage_1","onReady_1","onDisconnect_1","connId_1","nextConnectionId_","lastSessionId_1","canceled_1","connection_1","closeFn_1","accessToken","interrupt","resume","serverTimeOffset","q","normalizedPathString","statusCode","explanation","clientName","ReadonlyRestClient","getListenId_","listenId","thisListen","queryStringParameters","toRestQueryStringParameters","restRequest_","authTokenData","authToken","arrayVal","xhr","XMLHttpRequest","responseText","Repo","forceRestClient","app","dataUpdateCount","eventQueue_","nextWriteId_","interceptServerDataCallback_","persistentConnection_","authTokenProvider","authOverride","statsReporter_","transactions_init_","infoData_","infoSyncTree_","infoEvents","updateInfo_","serverSyncTree_","serverTime","offset","generateServerValues","values","isMerge","taggedChildren","raw","taggedSnap","rerunTransactions_","interceptServerData_","connectStatus","runOnDisconnectEvents_","getNextWriteId_","newVal","newNodeUnresolved","success","clearEvents","callOnCompleteCallback","abortTransactions_","childrenToMerge","empty","changedKey","changedValue","writeId_1","resolvedTree","resolveDeferredValueTree","showDelta","longestName","reduce","previousValue","currentValue","statsIncrementCounter","metric","__database","Database","RangedFilter","indexedFilter_","startPost_","getStartPost_","endPost_","getEndPost_","getStartPost","getEndPost","self","startName","endName","LimitedFilter","rangedFilter_","limit_","getLimit","reverse_","isViewFromLeft","fullLimitUpdateChild_","indexCompare_1","foundStartPost","changeAccumulator","indexCmp_1","newChildNamedNode","windowBoundary","inRange","oldChildSnap","compareNext","QueryParams","limitSet_","startSet_","startNameSet_","endSet_","endNameSet_","viewFrom_","indexStartValue_","indexStartName_","indexEndValue_","indexEndName_","WIRE_PROTOCOL_CONSTANTS_","VIEW_FROM_LEFT","copy_","newLimit","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","validateRootPathString","parentPath","getRoot","databaseProp","database","transaction","transactionUpdate","applyLocally","bool","validateBoolean","startTransaction","setPriority","thennablePushRef","pushRef","TransactionStatus","TreeNode","childCount","Tree","name_","parent_","subTree","pathObj","setValue","updateParents_","forEachDescendant","includeSelf","childrenFirst","forEachAncestor","forEachImmediateDescendantWithValue","updateChild_","childEmpty","childExists","MAX_TRANSACTION_RETRIES_","transactionQueueTree_","valueCallback","watchRef","order","retryCount","unwatcher","abortReason","currentWriteId","currentInputSnapshot","currentOutputSnapshotRaw","currentOutputSnapshotResolved","currentState","getLatestState_","RUN","queueNode","nodeQueue","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","abortTransactionsOnNode_","lastSent","_staticInstance","RepoManager","repos_","useRestClient_","appName","dbUrl","databaseFromApp","createRepo","deleteRepo","appRepos","INTERNAL","DatabaseInternals","checkDeleted_","refFromURL","apiName","parsedURL","goOffline","goOnline","ServerValue","TIMESTAMP",".sv","delete","_arguments","generator","P","fulfilled","rejected","freeze","forceLongPolling","forceWebSockets","setSecurityDebugCallback","interceptServerData","DataConnection","simpleListen","echo","onEcho","RealTimeConnection","ConnectionTarget","TEST_ACCESS","hijackHash","newHash","oldPut","opt_onComplete","opt_hash","listens","firebaseRef","registerService","unused","module","exports"],"mappings":"4QAgBA,IAAIA,EAAgBC,OAAOC,iBACpBC,wBAA2BC,OAAS,SAAUC,EAAGC,GAAKD,EAAEF,UAAYG,IACvE,SAAUD,EAAGC,GAAK,IAAK,IAAIC,KAAKD,EAAOA,EAAEE,eAAeD,KAAIF,EAAEE,GAAKD,EAAEC,KAElE,SAASE,EAAUJ,EAAGC,GAEzB,SAASI,IAAOC,KAAKC,YAAcP,EADnCL,EAAcK,EAAGC,GAEjBD,EAAEQ,UAAkB,OAANP,EAAaL,OAAOa,OAAOR,IAAMI,EAAGG,UAAYP,EAAEO,UAAW,IAAIH,GA6C5E,SAASK,EAAYC,EAASC,GACjC,IAAsGC,EAAGC,EAAGC,EAAGC,EAA3GC,GAAMC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPJ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,IAAOK,QAAUC,QAC3F,OAAOL,GAAMM,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,EAAID,EAAU,EAARgB,EAAG,GAAS,SAAWA,EAAG,GAAK,QAAU,YAAcf,EAAIA,EAAEiB,KAAKlB,EAAGgB,EAAG,KAAKG,KAAM,OAAOlB,EAEjH,OADID,EAAI,EAAGC,IAAGe,GAAM,EAAGf,EAAEmB,QACjBJ,EAAG,IACP,KAAK,EAAG,KAAK,EAAGf,EAAIe,EAAI,MACxB,KAAK,EAAc,OAAXb,EAAEC,SAAkBgB,MAAOJ,EAAG,GAAIG,MAAM,GAChD,KAAK,EAAGhB,EAAEC,QAASJ,EAAIgB,EAAG,GAAIA,GAAM,GAAI,SACxC,KAAK,EAAGA,EAAKb,EAAEI,IAAIc,MAAOlB,EAAEG,KAAKe,MAAO,SACxC,QACI,KAAkBpB,GAAZA,EAAIE,EAAEG,MAAYgB,OAAS,GAAKrB,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,GAAM,EAAGQ,GAAIxB,EAAI,UAAeD,EAAIE,EAAI,EACtD,GAAY,EAARe,EAAG,GAAQ,MAAMA,EAAG,GAAI,OAASI,MAAOJ,EAAG,GAAKA,EAAG,QAAK,EAAQG,MAAM,GArB9BM,EAAMX,EAAGC,MCnD7D,IAAIW,GAIa,EAJbA,GAQY,EARZA,EAYa,oBAuBbC,EAAS,SAAUC,EAAWC,GAC9B,IAAKD,EACD,MAAME,EAAeD,IAQzBC,EAAiB,SAAUD,GAC3B,OAAO,IAAIE,MAAM,sBACbL,EACA,6BACAG,IAkBJG,EAAoB,SAAUC,GAG9B,IADA,IAAIC,KAAU9C,EAAI,EACT+C,EAAI,EAAGA,EAAIF,EAAIX,OAAQa,IAAK,CACjC,IAAIC,EAAIH,EAAII,WAAWF,GACnBC,EAAI,IACJF,EAAI9C,KAAOgD,EAENA,EAAI,MACTF,EAAI9C,KAAQgD,GAAK,EAAK,IACtBF,EAAI9C,KAAY,GAAJgD,EAAU,KAED,QAAX,MAAJA,IACND,EAAI,EAAIF,EAAIX,QACwB,QAAX,MAAxBW,EAAII,WAAWF,EAAI,KAEpBC,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBH,EAAII,aAAaF,IACvDD,EAAI9C,KAAQgD,GAAK,GAAM,IACvBF,EAAI9C,KAASgD,GAAK,GAAM,GAAM,IAC9BF,EAAI9C,KAASgD,GAAK,EAAK,GAAM,IAC7BF,EAAI9C,KAAY,GAAJgD,EAAU,MAGtBF,EAAI9C,KAAQgD,GAAK,GAAM,IACvBF,EAAI9C,KAASgD,GAAK,EAAK,GAAM,IAC7BF,EAAI9C,KAAY,GAAJgD,EAAU,KAG9B,OAAOF,GAuCPI,GAMAC,eAAgB,KAMhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBAAmB,iEAKnBC,mBACI,OAAOpD,KAAKmD,kBAAoB,OAMpCE,2BACI,OAAOrD,KAAKmD,kBAAoB,OAUpCG,mBAAoC,mBAATC,KAU3BC,gBAAiB,SAAUC,EAAOC,GAC9B,IAAKjE,MAAMkE,QAAQF,GACf,MAAMlB,MAAM,iDAEhBvC,KAAK4D,QAKL,IAJA,IAAIC,EAAgBH,EACd1D,KAAKiD,sBACLjD,KAAK+C,eACPe,KACKnB,EAAI,EAAGA,EAAIc,EAAM3B,OAAQa,GAAK,EAAG,CACtC,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,EACnCyB,EAAWL,GAAS,EACpBM,GAAqB,EAARN,IAAiB,EAAME,GAAS,EAC7CK,GAAqB,GAARL,IAAiB,EAAME,GAAS,EAC7CI,EAAmB,GAARJ,EACVD,IACDK,EAAW,GACNP,IACDM,EAAW,KAGnBR,EAAO/B,KAAK8B,EAAcO,GAAWP,EAAcQ,GAAWR,EAAcS,GAAWT,EAAcU,IAEzG,OAAOT,EAAOU,KAAK,KAUvBC,aAAc,SAAUhB,EAAOC,GAG3B,OAAI1D,KAAKsD,qBAAuBI,EACrBgB,KAAKjB,GAETzD,KAAKwD,gBAAgBhB,EAAkBiB,GAAQC,IAU1DiB,aAAc,SAAUlB,EAAOC,GAG3B,OAAI1D,KAAKsD,qBAAuBI,EACrBH,KAAKE,GAvJA,SAAUmB,GAG9B,IADA,IAAIlC,KAAUmC,EAAM,EAAGjC,EAAI,EACpBiC,EAAMD,EAAM9C,QAAQ,CACvB,IAAIgD,EAAKF,EAAMC,KACf,GAAIC,EAAK,IACLpC,EAAIE,KAAOmC,OAAOC,aAAaF,QAE9B,GAAIA,EAAK,KAAOA,EAAK,IAAK,CAC3B,IAAIG,EAAKL,EAAMC,KACfnC,EAAIE,KAAOmC,OAAOC,cAAoB,GAALF,IAAY,EAAW,GAALG,QAElD,GAAIH,EAAK,KAAOA,EAAK,IAAK,CAE3B,IAGII,IAAY,EAALJ,IAAW,IAAa,IAH/BG,EAAKL,EAAMC,QAG2B,IAAa,IAFnDM,EAAKP,EAAMC,QAE+C,EAAW,GADhED,EAAMC,MAEX,MACJnC,EAAIE,KAAOmC,OAAOC,aAAa,OAAUE,GAAK,KAC9CxC,EAAIE,KAAOmC,OAAOC,aAAa,OAAc,KAAJE,QAExC,CACGD,EAAKL,EAAMC,KAAf,IACIM,EAAKP,EAAMC,KACfnC,EAAIE,KAAOmC,OAAOC,cAAoB,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,IAG/E,OAAOzC,EAAI8B,KAAK,IA6HLY,CAAkBpF,KAAKqF,wBAAwB5B,EAAOC,KAiBjE2B,wBAAyB,SAAU5B,EAAOC,GACtC1D,KAAK4D,QAKL,IAJA,IAAI0B,EAAgB5B,EACd1D,KAAKkD,sBACLlD,KAAKgD,eACPc,KACKnB,EAAI,EAAGA,EAAIc,EAAM3B,QAAS,CAC/B,IAAIiC,EAAQuB,EAAc7B,EAAM8B,OAAO5C,MAEnCsB,EADYtB,EAAIc,EAAM3B,OACFwD,EAAc7B,EAAM8B,OAAO5C,IAAM,EAGrDwB,IAFFxB,EACkBc,EAAM3B,OACFwD,EAAc7B,EAAM8B,OAAO5C,IAAM,GAGrD6C,IAFF7C,EACkBc,EAAM3B,OACFwD,EAAc7B,EAAM8B,OAAO5C,IAAM,GAEzD,KADEA,EACW,MAAToB,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATqB,EACnD,MAAMjD,QAEV,IAAI6B,EAAYL,GAAS,EAAME,GAAS,EAExC,GADAH,EAAO/B,KAAKqC,GACC,IAATD,EAAa,CACb,IAAIE,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAEjD,GADAL,EAAO/B,KAAKsC,GACC,IAATmB,EAAa,CACb,IAAIlB,EAAaH,GAAS,EAAK,IAAQqB,EACvC1B,EAAO/B,KAAKuC,KAIxB,OAAOR,GAOXF,MAAO,WACH,IAAK5D,KAAK+C,eAAgB,CACtB/C,KAAK+C,kBACL/C,KAAKgD,kBACLhD,KAAKiD,yBACLjD,KAAKkD,yBAEL,IAAK,IAAIP,EAAI,EAAGA,EAAI3C,KAAKoD,aAAatB,OAAQa,IAC1C3C,KAAK+C,eAAeJ,GAAK3C,KAAKoD,aAAamC,OAAO5C,GAClD3C,KAAKgD,eAAehD,KAAK+C,eAAeJ,IAAMA,EAC9C3C,KAAKiD,sBAAsBN,GAAK3C,KAAKqD,qBAAqBkC,OAAO5C,GACjE3C,KAAKkD,sBAAsBlD,KAAKiD,sBAAsBN,IAAMA,EAExDA,GAAK3C,KAAKmD,kBAAkBrB,SAC5B9B,KAAKgD,eAAehD,KAAKqD,qBAAqBkC,OAAO5C,IAAMA,EAC3D3C,KAAKkD,sBAAsBlD,KAAKoD,aAAamC,OAAO5C,IAAMA,MAwB1E8C,EAAe,SAAUhD,GACzB,IACI,OAAOK,EAAO6B,aAAalC,GAAK,GAEpC,MAAOT,GACH0D,QAAQC,MAAM,wBAAyB3D,GAE3C,OAAO,MAqBX,SAAS4D,EAAShE,GACd,OAcJ,SAASiE,EAAWC,EAAQC,GACxB,KAAMA,aAAkBzG,QACpB,OAAOyG,EAEX,OAAQA,EAAO9F,aACX,KAAK+F,KAGD,IAAIC,EAAYF,EAChB,OAAO,IAAIC,KAAKC,EAAUC,WAC9B,KAAK5G,YACc6G,IAAXL,IACAA,MAEJ,MACJ,KAAKrG,MAEDqG,KACA,MACJ,QAEI,OAAOC,EAEf,IAAK,IAAIK,KAAQL,EACRA,EAAOlG,eAAeuG,KAG3BN,EAAOM,GAAQP,EAAWC,EAAOM,GAAOL,EAAOK,KAEnD,OAAON,EA3CAD,MAAWM,EAAWvE,GAiEjC,IAAIyE,EAA0B,WAC1B,SAASA,IACL,IAAIC,EAAQtG,KACZA,KAAKuG,QAAU,IAAIC,QAAQ,SAAUC,EAASC,GAC1CJ,EAAMG,QAAUA,EAChBH,EAAMI,OAASA,IAkCvB,OAxBAL,EAASnG,UAAUyG,aAAe,SAAUC,GACxC,IAAIN,EAAQtG,KACZ,OAAO,SAAU2F,EAAO/D,GAChB+D,EACAW,EAAMI,OAAOf,GAGbW,EAAMG,QAAQ7E,GAEM,mBAAbgF,IAGPN,EAAMC,QAAQM,MAAM,cAGI,IAApBD,EAAS9E,OACT8E,EAASjB,GAGTiB,EAASjB,EAAO/D,MAKzByE,KAuCPS,EAAkB,WAClB,MAA0B,oBAAXC,WACRA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDC,KAnB/B,oBAAdC,WAC2B,iBAA3BA,UAAqB,UACrBA,UAAqB,UAGrB,KA6BXC,EAAY,WACZ,OAAiC,IAA1BhF,IAA2D,IAAzBA,GAGzCiF,EAAa,gBACbC,EAAoB7E,MACnB6E,kBAODC,EAA+B,WA0B/B,OAzBA,SAAuBC,EAAMjF,GAIzB,GAHArC,KAAKsH,KAAOA,EACZtH,KAAKqC,QAAUA,EAEX+E,EAEAA,EAAkBpH,KAAMuH,EAAarH,UAAUC,aAG/C,IAGI,MAAMoC,MAAMiF,MAAMxH,KAAMyH,WAE5B,MAAOC,GACH1H,KAAK2H,KAAOR,EAEZ7H,OAAOsI,eAAe5H,KAAM,SACxB6H,IAAK,WACD,OAAOH,EAAII,cASnCT,EAAcnH,UAAYZ,OAAOa,OAAOoC,MAAMrC,WAC9CmH,EAAcnH,UAAUD,YAAcoH,EACtCA,EAAcnH,UAAUyH,KAAOR,EAC/B,IAAII,EAA8B,WAC9B,SAASA,EAAaQ,EAASC,EAAaC,GACxCjI,KAAK+H,QAAUA,EACf/H,KAAKgI,YAAcA,EACnBhI,KAAKiI,OAASA,EAEdjI,KAAKkI,QAAU,gBAgCnB,OA7BAX,EAAarH,UAAUC,OAAS,SAAUmH,EAAMa,QAC/BhC,IAATgC,IACAA,MAEJ,IAEI9F,EAFA+F,EAAWpI,KAAKiI,OAAOX,GACvBe,EAAWrI,KAAK+H,QAAU,IAAMT,EAGhCjF,OADa8D,IAAbiC,EACU,QAGAA,EAASE,QAAQtI,KAAKkI,QAAS,SAAUK,EAAOC,GACtD,IAAI5G,EAAQuG,EAAKK,GACjB,YAAiBrC,IAAVvE,EAAsBA,EAAM6G,WAAa,IAAMD,EAAM,OAIpEnG,EAAUrC,KAAKgI,YAAc,KAAO3F,EAAU,KAAOgG,EAAW,KAChE,IAAIX,EAAM,IAAIL,EAAcgB,EAAUhG,GAGtC,IAAK,IAAI+D,KAAQ+B,EACRA,EAAKtI,eAAeuG,IAA4B,MAAnBA,EAAKsC,OAAO,KAG9ChB,EAAItB,GAAQ+B,EAAK/B,IAErB,OAAOsB,GAEJH,KAwBX,SAASoB,EAASlG,GACd,OAAOmG,KAAKC,MAAMpG,GAOtB,SAASqG,EAAUX,GACf,OAAOS,KAAKE,UAAUX,GA4B1B,IAAIY,EAAS,SAAUC,GACnB,IAAIC,KAAaC,KAAaf,KAAWgB,EAAY,GACrD,IACI,IAAIC,EAAQJ,EAAMK,MAAM,KACxBJ,EAASN,EAASlD,EAAa2D,EAAM,KAAO,IAC5CF,EAASP,EAASlD,EAAa2D,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBjB,EAAOe,EAAU,aACVA,EAAU,EAErB,MAAOlH,IACP,OACIiH,OAAQA,EACRC,OAAQA,EACRf,KAAMA,EACNgB,UAAWA,IA+FfG,EAAW,SAAUC,EAAKf,GAC1B,OAAOlJ,OAAOY,UAAUL,eAAe6B,KAAK6H,EAAKf,IAEjDgB,EAAU,SAAUD,EAAKf,GACzB,GAAIlJ,OAAOY,UAAUL,eAAe6B,KAAK6H,EAAKf,GAC1C,OAAOe,EAAIf,IAUfiB,EAAU,SAAUF,EAAKG,GACzB,IAAK,IAAIlB,KAAOe,EACRjK,OAAOY,UAAUL,eAAe6B,KAAK6H,EAAKf,IAC1CkB,EAAGlB,EAAKe,EAAIf,KAqBpBmB,EAAQ,SAAUJ,GAClB,OAZmBK,KACnBH,EAWkBF,EAXD,SAAUf,EAAK5G,GAC5BgI,EAAMpB,GAAO5G,IAEVgI,EAJE,IAAUA,GAwBnBC,EAAU,SAAUN,GACpB,IAAK,IAAIf,KAAOe,EACZ,OAAO,EAEX,OAAO,GAEPO,EAAW,SAAUP,GACrB,IAAIQ,EAAK,EACT,IAAK,IAAIvB,KAAOe,EACZQ,IAEJ,OAAOA,GAEPC,EAAM,SAAUT,EAAKhJ,EAAG0J,GACxB,IAAIC,KACJ,IAAK,IAAI1B,KAAOe,EACZW,EAAI1B,GAAOjI,EAAEmB,KAAKuI,EAASV,EAAIf,GAAMA,EAAKe,GAE9C,OAAOW,GAEPC,EAAU,SAAUZ,EAAKG,EAAIU,GAC7B,IAAK,IAAI5B,KAAOe,EACZ,GAAIG,EAAGhI,KAAK0I,EAAUb,EAAIf,GAAMA,EAAKe,GACjC,OAAOf,GASf6B,EAAY,SAAUd,GACtB,IAAK,IAAIf,KAAOe,EACZ,OAAOf,GA+KX8B,EAAsB,SAAUC,GAEhC,SAASD,IACL,IAAIhE,EAAQiE,EAAO7I,KAAK1B,OAASA,KAOjCsG,EAAMkE,UAMNlE,EAAMmE,QAONnE,EAAMoE,MAMNpE,EAAMqE,QAINrE,EAAMsE,OAAS,EAIftE,EAAMuE,OAAS,EACfvE,EAAMwE,UAAY,GAClBxE,EAAMqE,KAAK,GAAK,IAChB,IAAK,IAAIhI,EAAI,EAAGA,EAAI2D,EAAMwE,YAAanI,EACnC2D,EAAMqE,KAAKhI,GAAK,EAGpB,OADA2D,EAAMyE,QACCzE,EAkLX,OA7NAxG,EAAUwK,EAAMC,GA6ChBD,EAAKpK,UAAU6K,MAAQ,WACnB/K,KAAKwK,OAAO,GAAK,WACjBxK,KAAKwK,OAAO,GAAK,WACjBxK,KAAKwK,OAAO,GAAK,WACjBxK,KAAKwK,OAAO,GAAK,UACjBxK,KAAKwK,OAAO,GAAK,WACjBxK,KAAK4K,OAAS,EACd5K,KAAK6K,OAAS,GAQlBP,EAAKpK,UAAU8K,UAAY,SAAUC,EAAKC,GACjCA,IACDA,EAAa,GAEjB,IAAIC,EAAInL,KAAK0K,GAEb,GAAmB,iBAARO,EACP,IAAK,IAAItI,EAAI,EAAGA,EAAI,GAAIA,IASpBwI,EAAExI,GACGsI,EAAIpI,WAAWqI,IAAe,GAC1BD,EAAIpI,WAAWqI,EAAa,IAAM,GAClCD,EAAIpI,WAAWqI,EAAa,IAAM,EACnCD,EAAIpI,WAAWqI,EAAa,GACpCA,GAAc,OAIlB,IAASvI,EAAI,EAAGA,EAAI,GAAIA,IACpBwI,EAAExI,GACGsI,EAAIC,IAAe,GACfD,EAAIC,EAAa,IAAM,GACvBD,EAAIC,EAAa,IAAM,EACxBD,EAAIC,EAAa,GACzBA,GAAc,EAItB,IAASvI,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,IAAIlC,EAAI0K,EAAExI,EAAI,GAAKwI,EAAExI,EAAI,GAAKwI,EAAExI,EAAI,IAAMwI,EAAExI,EAAI,IAChDwI,EAAExI,GAA+B,YAAxBlC,GAAK,EAAMA,IAAM,IAE9B,IAKIF,EAAG6K,EALHC,EAAIrL,KAAKwK,OAAO,GAChB7K,EAAIK,KAAKwK,OAAO,GAChB5H,EAAI5C,KAAKwK,OAAO,GAChB9K,EAAIM,KAAKwK,OAAO,GAChBxI,EAAIhC,KAAKwK,OAAO,GAGpB,IAAS7H,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACrBA,EAAI,GACAA,EAAI,IACJpC,EAAIb,EAAKC,GAAKiD,EAAIlD,GAClB0L,EAAI,aAGJ7K,EAAIZ,EAAIiD,EAAIlD,EACZ0L,EAAI,YAIJzI,EAAI,IACJpC,EAAKZ,EAAIiD,EAAMlD,GAAKC,EAAIiD,GACxBwI,EAAI,aAGJ7K,EAAIZ,EAAIiD,EAAIlD,EACZ0L,EAAI,YAGR3K,GAAO4K,GAAK,EAAMA,IAAM,IAAO9K,EAAIyB,EAAIoJ,EAAID,EAAExI,GAAM,WACvDX,EAAItC,EACJA,EAAIkD,EACJA,EAA8B,YAAxBjD,GAAK,GAAOA,IAAM,GACxBA,EAAI0L,EACJA,EAAI5K,EAERT,KAAKwK,OAAO,GAAMxK,KAAKwK,OAAO,GAAKa,EAAK,WACxCrL,KAAKwK,OAAO,GAAMxK,KAAKwK,OAAO,GAAK7K,EAAK,WACxCK,KAAKwK,OAAO,GAAMxK,KAAKwK,OAAO,GAAK5H,EAAK,WACxC5C,KAAKwK,OAAO,GAAMxK,KAAKwK,OAAO,GAAK9K,EAAK,WACxCM,KAAKwK,OAAO,GAAMxK,KAAKwK,OAAO,GAAKxI,EAAK,YAE5CsI,EAAKpK,UAAUoL,OAAS,SAAU1G,EAAO2G,GAErC,GAAa,MAAT3G,EAAJ,MAGmBuB,IAAfoF,IACAA,EAAa3G,EAAM9C,QAQvB,IANA,IAAI0J,EAAmBD,EAAavL,KAAK8K,UACrCxJ,EAAI,EAEJ2J,EAAMjL,KAAKyK,KACXgB,EAAQzL,KAAK4K,OAEVtJ,EAAIiK,GAAY,CAKnB,GAAa,GAATE,EACA,KAAOnK,GAAKkK,GACRxL,KAAKgL,UAAUpG,EAAOtD,GACtBA,GAAKtB,KAAK8K,UAGlB,GAAqB,iBAAVlG,GACP,KAAOtD,EAAIiK,GAIP,GAHAN,EAAIQ,GAAS7G,EAAM/B,WAAWvB,KAE5BA,IADAmK,GAEWzL,KAAK8K,UAAW,CACzB9K,KAAKgL,UAAUC,GACfQ,EAAQ,EAER,YAKR,KAAOnK,EAAIiK,GAIP,GAHAN,EAAIQ,GAAS7G,EAAMtD,KAEjBA,IADAmK,GAEWzL,KAAK8K,UAAW,CACzB9K,KAAKgL,UAAUC,GACfQ,EAAQ,EAER,OAKhBzL,KAAK4K,OAASa,EACdzL,KAAK6K,QAAUU,IAGnBjB,EAAKpK,UAAUwL,OAAS,WACpB,IAAIA,KACAC,EAA0B,EAAd3L,KAAK6K,OAEjB7K,KAAK4K,OAAS,GACd5K,KAAKsL,OAAOtL,KAAK2K,KAAM,GAAK3K,KAAK4K,QAGjC5K,KAAKsL,OAAOtL,KAAK2K,KAAM3K,KAAK8K,WAAa9K,KAAK4K,OAAS,KAG3D,IAAK,IAAIjI,EAAI3C,KAAK8K,UAAY,EAAGnI,GAAK,GAAIA,IACtC3C,KAAKyK,KAAK9H,GAAiB,IAAZgJ,EACfA,GAAa,IAEjB3L,KAAKgL,UAAUhL,KAAKyK,MACpB,IAAInJ,EAAI,EACR,IAASqB,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIiJ,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC1BF,EAAOpK,GAAMtB,KAAKwK,OAAO7H,IAAMiJ,EAAK,MAClCtK,EAGV,OAAOoK,GAEJpB,GAhRe,WAQtB,OAPA,WAKItK,KAAK8K,WAAa,OA4ftBe,EAAmB,SAAUC,EAAQC,EAAUC,EAAUC,GACzD,IAAIC,EAOJ,GANID,EAAWF,EACXG,EAAW,YAAcH,EAEpBE,EAAWD,IAChBE,EAAwB,IAAbF,EAAiB,OAAS,gBAAkBA,GAEvDE,EAQA,MAAM,IAAI3J,MAPEuJ,EACR,4BACAG,GACc,IAAbA,EAAiB,aAAe,eACjC,YACAC,EACA,MAYZ,SAASC,EAAYL,EAAQM,EAAgBC,GACzC,IAAIC,EAAU,GACd,OAAQF,GACJ,KAAK,EACDE,EAAUD,EAAW,QAAU,QAC/B,MACJ,KAAK,EACDC,EAAUD,EAAW,SAAW,SAChC,MACJ,KAAK,EACDC,EAAUD,EAAW,QAAU,QAC/B,MACJ,KAAK,EACDC,EAAUD,EAAW,SAAW,SAChC,MACJ,QACI,MAAM,IAAI9J,MAAM,mEAExB,IAAIoD,EAAQmG,EAAS,YAErB,OADAnG,GAAS2G,EAAU,aAkBvB,SAASC,EAAiBT,EAAQM,EAAgBxF,EAAUyF,GACxD,KAAIA,GAAazF,IAEO,mBAAbA,EACP,MAAM,IAAIrE,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,6BAEZ,SAASG,EAAsBV,EAAQM,EAAgBK,EAASJ,GAC5D,KAAIA,GAAaI,KAEM,iBAAZA,GAAoC,OAAZA,GAC/B,MAAM,IAAIlK,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,mCA+BZ,IChlDIK,EDsnDAC,EAAe,SAAUlK,GAEzB,IADA,IAAI7C,EAAI,EACC+C,EAAI,EAAGA,EAAIF,EAAIX,OAAQa,IAAK,CACjC,IAAIC,EAAIH,EAAII,WAAWF,GACnBC,EAAI,IACJhD,IAEKgD,EAAI,KACThD,GAAK,EAEAgD,GAAK,OAAUA,GAAK,OAEzBhD,GAAK,EACL+C,KAGA/C,GAAK,EAGb,OAAOA,ICxoDX,SAAW8M,GACPA,EAASA,EAAgB,MAAI,GAAK,QAClCA,EAASA,EAAkB,QAAI,GAAK,UACpCA,EAASA,EAAe,KAAI,GAAK,OACjCA,EAASA,EAAe,KAAI,GAAK,OACjCA,EAASA,EAAgB,MAAI,GAAK,QAClCA,EAASA,EAAiB,OAAI,GAAK,SANvC,CAOGA,IAAaA,OAIhB,IC2JQE,ED3JJC,EAAkBH,EAASI,KAM3BC,EAAoB,SAAUC,EAAUC,GAExC,IADA,IAAIC,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,EAAK,GAAK1F,UAAU0F,GAE7B,KAAIF,EAAUD,EAASI,UAAvB,CAEA,IAAIC,GAAM,IAAIrH,MAAOsH,cACrB,OAAQL,GAOJ,KAAKP,EAASa,MAGd,KAAKb,EAASc,QACV9H,QAAQ+H,IAAIjG,MAAM9B,SAAU,IAAM2H,EAAM,MAAQL,EAASrF,KAAO,KAAK+F,OAAOR,IAC5E,MACJ,KAAKR,EAASI,KACVpH,QAAQiI,KAAKnG,MAAM9B,SAAU,IAAM2H,EAAM,MAAQL,EAASrF,KAAO,KAAK+F,OAAOR,IAC7E,MACJ,KAAKR,EAASkB,KACVlI,QAAQmI,KAAKrG,MAAM9B,SAAU,IAAM2H,EAAM,MAAQL,EAASrF,KAAO,KAAK+F,OAAOR,IAC7E,MACJ,KAAKR,EAASoB,MACVpI,QAAQC,MAAM6B,MAAM9B,SAAU,IAAM2H,EAAM,MAAQL,EAASrF,KAAO,KAAK+F,OAAOR,IAC9E,MACJ,QACI,MAAM,IAAI3K,MAAM,8DAAgE0K,EAAU,QAGlGc,EAAwB,WAOxB,SAASA,EAAOpG,GACZ3H,KAAK2H,KAAOA,EAIZ3H,KAAKgO,UAAYnB,EAIjB7M,KAAKiO,YAAclB,EAsEvB,OAhEAzN,OAAOsI,eAAemG,EAAO7N,UAAW,YACpC2H,IAAK,WACD,OAAO7H,KAAKgO,WAEhBE,IAAK,SAAUC,GACX,KAAMA,KAAOzB,GACT,MAAM,IAAIjL,UAAU,wCAExBzB,KAAKgO,UAAYG,GAErBC,YAAY,EACZC,cAAc,IAElB/O,OAAOsI,eAAemG,EAAO7N,UAAW,cACpC2H,IAAK,WACD,OAAO7H,KAAKiO,aAEhBC,IAAK,SAAUC,GACX,GAAmB,mBAARA,EACP,MAAM,IAAI1M,UAAU,qDAExBzB,KAAKiO,YAAcE,GAEvBC,YAAY,EACZC,cAAc,IAKlBN,EAAO7N,UAAUoO,MAAQ,WAErB,IADA,IAAIpB,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzBnN,KAAKiO,YAAYzG,MAAMxH,MAAOA,KAAM0M,EAASa,OAAOG,OAAOR,KAE/Da,EAAO7N,UAAUuN,IAAM,WAEnB,IADA,IAAIP,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzBnN,KAAKiO,YAAYzG,MAAMxH,MAAOA,KAAM0M,EAASc,SAASE,OAAOR,KAEjEa,EAAO7N,UAAUyN,KAAO,WAEpB,IADA,IAAIT,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzBnN,KAAKiO,YAAYzG,MAAMxH,MAAOA,KAAM0M,EAASI,MAAMY,OAAOR,KAE9Da,EAAO7N,UAAU2N,KAAO,WAEpB,IADA,IAAIX,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzBnN,KAAKiO,YAAYzG,MAAMxH,MAAOA,KAAM0M,EAASkB,MAAMF,OAAOR,KAE9Da,EAAO7N,UAAUyF,MAAQ,WAErB,IADA,IAAIuH,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzBnN,KAAKiO,YAAYzG,MAAMxH,MAAOA,KAAM0M,EAASoB,OAAOJ,OAAOR,KAExDa,KC1IPQ,EAAmC,WAInC,SAASA,EAAkBC,GACvBxO,KAAKwO,YAAcA,EAEnBxO,KAAKyO,QAAU,YA2CnB,OArCAF,EAAkBrO,UAAUgO,IAAM,SAAU1F,EAAK5G,GAChC,MAATA,EACA5B,KAAKwO,YAAYE,WAAW1O,KAAK2O,cAAcnG,IAG/CxI,KAAKwO,YAAYI,QAAQ5O,KAAK2O,cAAcnG,GAAMM,EAAUlH,KAOpE2M,EAAkBrO,UAAU2H,IAAM,SAAUW,GACxC,IAAIqG,EAAY7O,KAAKwO,YAAYM,QAAQ9O,KAAK2O,cAAcnG,IAC5D,OAAiB,MAAbqG,EACO,KAGAlG,EAASkG,IAMxBN,EAAkBrO,UAAU6O,OAAS,SAAUvG,GAC3CxI,KAAKwO,YAAYE,WAAW1O,KAAK2O,cAAcnG,KAMnD+F,EAAkBrO,UAAUyO,cAAgB,SAAUhH,GAClD,OAAO3H,KAAKyO,QAAU9G,GAE1B4G,EAAkBrO,UAAUuI,SAAW,WACnC,OAAOzI,KAAKwO,YAAY/F,YAErB8F,KAwBPS,EAA+B,WAC/B,SAASA,IACLhP,KAAKiP,UACLjP,KAAKkP,mBAAoB,EAmB7B,OAjBAF,EAAc9O,UAAUgO,IAAM,SAAU1F,EAAK5G,GAC5B,MAATA,SACO5B,KAAKiP,OAAOzG,GAGnBxI,KAAKiP,OAAOzG,GAAO5G,GAG3BoN,EAAc9O,UAAU2H,IAAM,SAAUW,GACpC,OAAIc,EAAStJ,KAAKiP,OAAQzG,GACfxI,KAAKiP,OAAOzG,GAEhB,MAEXwG,EAAc9O,UAAU6O,OAAS,SAAUvG,UAChCxI,KAAKiP,OAAOzG,IAEhBwG,KA2BPG,EAAmB,SAAUC,GAC7B,IAGI,GAAsB,oBAAXrI,aAC2B,IAA3BA,OAAOqI,GAAiC,CAE/C,IAAIC,EAAatI,OAAOqI,GAGxB,OAFAC,EAAWT,QAAQ,oBAAqB,SACxCS,EAAWX,WAAW,qBACf,IAAIH,EAAkBc,IAGrC,MAAOrN,IAGP,OAAO,IAAIgN,GAGXM,EAAoBH,EAAiB,gBAErCI,EAAiBJ,EAAiB,kBAiBlCK,EAAY,IAAIzB,EAAO,sBAKvB0B,GACI7C,EAAK,EACF,WACH,OAAOA,MAQX8C,EAAO,SAAUjN,GACjB,IAAIkN,EF85CkB,SAAUlN,GAEhC,IADA,IAAIC,KAAU9C,EAAI,EACT+C,EAAI,EAAGA,EAAIF,EAAIX,OAAQa,IAAK,CACjC,IAAIC,EAAIH,EAAII,WAAWF,GAEvB,GAAIC,GAAK,OAAUA,GAAK,MAAQ,CAC5B,IAAIgN,EAAOhN,EAAI,MAEfT,IADAQ,EACWF,EAAIX,OAAQ,2CAEvBc,EAAI,OAAWgN,GAAQ,KADbnN,EAAII,WAAWF,GAAK,OAG9BC,EAAI,IACJF,EAAI9C,KAAOgD,EAENA,EAAI,MACTF,EAAI9C,KAAQgD,GAAK,EAAK,IACtBF,EAAI9C,KAAY,GAAJgD,EAAU,KAEjBA,EAAI,OACTF,EAAI9C,KAAQgD,GAAK,GAAM,IACvBF,EAAI9C,KAASgD,GAAK,EAAK,GAAM,IAC7BF,EAAI9C,KAAY,GAAJgD,EAAU,MAGtBF,EAAI9C,KAAQgD,GAAK,GAAM,IACvBF,EAAI9C,KAASgD,GAAK,GAAM,GAAM,IAC9BF,EAAI9C,KAASgD,GAAK,EAAK,GAAM,IAC7BF,EAAI9C,KAAY,GAAJgD,EAAU,KAG9B,OAAOF,EE77CSF,CAAkBC,GAC9BiN,EAAO,IAAIpF,EACfoF,EAAKpE,OAAOqE,GACZ,IAAIE,EAAYH,EAAKhE,SACrB,OAAO5I,EAAOU,gBAAgBqM,IAO9BC,EAAmB,WAEnB,IADA,IAAIC,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAG7B,IADA,IAAI9K,EAAU,GACLM,EAAI,EAAGA,EAAIoN,EAASjO,OAAQa,IAC7BlD,MAAMkE,QAAQoM,EAASpN,KACtBoN,EAASpN,IACiB,iBAAhBoN,EAASpN,IACc,iBAAvBoN,EAASpN,GAAGb,OACvBO,GAAWyN,EAAiBtI,MAAM,KAAMuI,EAASpN,IAErB,iBAAhBoN,EAASpN,GACrBN,GAAWyG,EAAUiH,EAASpN,IAG9BN,GAAW0N,EAASpN,GAExBN,GAAW,IAEf,OAAOA,GAMP2N,EAAS,KAMTC,GAAY,EAMZC,GAAgB,SAAUC,EAASC,GACnCjO,GAAQiO,IAA2B,IAAZD,IAAgC,IAAZA,EAAoB,+CAC/C,IAAZA,GACAX,EAAUpC,SAAWV,EAASc,QAC9BwC,EAASR,EAAU/B,IAAI4C,KAAKb,GACxBY,GACAb,EAAerB,IAAI,mBAAmB,IAElB,mBAAZiC,EACZH,EAASG,GAGTH,EAAS,KACTT,EAAeR,OAAO,qBAO1BtB,GAAM,WAEN,IADA,IAAIsC,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAO7B,IALkB,IAAd8C,IACAA,GAAY,EACG,OAAXD,IAA6D,IAA1CT,EAAe1H,IAAI,oBACtCqI,IAAc,IAElBF,EAAQ,CACR,IAAI3N,EAAUyN,EAAiBtI,MAAM,KAAMuI,GAC3CC,EAAO3N,KAOXiO,GAAa,SAAUC,GACvB,OAAO,WAEH,IADA,IAAIR,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAE7BM,GAAIjG,WAAM,GAAS+I,GAAQ7C,OAAOqC,MAMtCpK,GAAQ,WAER,IADA,IAAIoK,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAE7B,IAAI9K,EAAU,4BAA8ByN,EAAiBtI,WAAM,EAAQuI,GAC3EP,EAAU7J,MAAMtD,IAKhBmO,GAAQ,WAER,IADA,IAAIT,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAE7B,IAAI9K,EAAU,yBAA2ByN,EAAiBtI,WAAM,EAAQuI,GAExE,MADAP,EAAU7J,MAAMtD,GACV,IAAIE,MAAMF,IAKhBwL,GAAO,WAEP,IADA,IAAIkC,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAE7B,IAAI9K,EAAU,qBAAuByN,EAAiBtI,WAAM,EAAQuI,GACpEP,EAAU3B,KAAKxL,IAqBfoO,GAAsB,SAAUtI,GAChC,MAAwB,iBAATA,IACVA,GAAQA,GACLA,GAAQuI,OAAOC,mBACfxI,GAAQuI,OAAOE,oBA8CvBC,GAAW,aAKXC,GAAW,aAOXC,GAAc,SAAU1F,EAAG1L,GAC3B,GAAI0L,IAAM1L,EACN,OAAO,EAEN,GAAI0L,IAAMwF,IAAYlR,IAAMmR,GAC7B,OAAQ,EAEP,GAAInR,IAAMkR,IAAYxF,IAAMyF,GAC7B,OAAO,EAGP,IAAIE,EAASC,GAAY5F,GAAI6F,EAASD,GAAYtR,GAClD,OAAe,OAAXqR,EACe,OAAXE,EACOF,EAASE,GAAU,EAAI7F,EAAEvJ,OAASnC,EAAEmC,OAASkP,EAASE,GAGrD,EAGI,OAAXA,EACE,EAGA7F,EAAI1L,GAAK,EAAI,GAS5BwR,GAAgB,SAAU9F,EAAG1L,GAC7B,OAAI0L,IAAM1L,EACC,EAEF0L,EAAI1L,GACD,EAGD,GAQXyR,GAAa,SAAU5I,EAAKe,GAC5B,GAAIA,GAAOf,KAAOe,EACd,OAAOA,EAAIf,GAGX,MAAM,IAAIjG,MAAM,yBAA2BiG,EAAM,gBAAkBM,EAAUS,KAOjF8H,GAAoB,SAAU9H,GAC9B,GAAmB,iBAARA,GAA4B,OAARA,EAC3B,OAAOT,EAAUS,GACrB,IAAI+H,KACJ,IAAK,IAAIlG,KAAK7B,EACV+H,EAAKvP,KAAKqJ,GAGdkG,EAAKC,OAEL,IADA,IAAI/I,EAAM,IACD7F,EAAI,EAAGA,EAAI2O,EAAKxP,OAAQa,IACnB,IAANA,IACA6F,GAAO,KACXA,GAAOM,EAAUwI,EAAK3O,IACtB6F,GAAO,IACPA,GAAO6I,GAAkB9H,EAAI+H,EAAK3O,KAGtC,OADA6F,GAAO,KASPgJ,GAAoB,SAAU/O,EAAKgP,GACnC,IAAIC,EAAMjP,EAAIX,OACd,GAAI4P,GAAOD,EACP,OAAQhP,GAGZ,IADA,IAAIkP,KACK/O,EAAI,EAAGA,EAAI8O,EAAK9O,GAAK6O,EACtB7O,EAAI6O,EAAUC,EACdC,EAAS5P,KAAKU,EAAImP,UAAUhP,EAAG8O,IAG/BC,EAAS5P,KAAKU,EAAImP,UAAUhP,EAAGA,EAAI6O,IAG3C,OAAOE,GAQPE,GAAO,SAAUtI,EAAKG,GACtB,GAAIjK,MAAMkE,QAAQ4F,GACd,IAAK,IAAI5G,EAAI,EAAGA,EAAI4G,EAAIzH,SAAUa,EAC9B+G,EAAG/G,EAAG4G,EAAI5G,SAUd8G,EAAQF,EAAK,SAAUf,EAAK2F,GAAO,OAAOzE,EAAGyE,EAAK3F,MAUtDsJ,GAAwB,SAAUvQ,GAClCY,GAAQsO,GAAoBlP,GAAI,uBAChC,IACmCwQ,EAAG/P,EAAGzB,EAAGyR,EAAIrP,EAAGsP,EAAMxP,EAyBzD,IAtBU,IAANlB,GACAS,EAAI,EACJzB,EAAI,EACJwR,EAAI,EAAIxQ,IAAO2Q,EAAAA,EAAW,EAAI,IAG9BH,EAAIxQ,EAAI,GACRA,EAAI4Q,KAAKC,IAAI7Q,KACJ4Q,KAAKE,IAAI,GAAG,OAGjBrQ,GADAgQ,EAAKG,KAAKG,IAAIH,KAAKI,MAAMJ,KAAK1E,IAAIlM,GAAK4Q,KAAKK,KAbzC,OAAA,KAeHjS,EAAI4R,KAAKM,MAAMlR,EAAI4Q,KAAKE,IAAI,EAhBZ,GAgBuBL,GAAMG,KAAKE,IAAI,EAhBtC,OAoBhBrQ,EAAI,EACJzB,EAAI4R,KAAKM,MAAMlR,EAAI4Q,KAAKE,IAAI,GAAG,SAIvCJ,KACKtP,EA1BmB,GA0BRA,EAAGA,GAAK,EACpBsP,EAAKlQ,KAAKxB,EAAI,EAAI,EAAI,GACtBA,EAAI4R,KAAKI,MAAMhS,EAAI,GAEvB,IAAKoC,EA9BO,GA8BIA,EAAGA,GAAK,EACpBsP,EAAKlQ,KAAKC,EAAI,EAAI,EAAI,GACtBA,EAAImQ,KAAKI,MAAMvQ,EAAI,GAEvBiQ,EAAKlQ,KAAKgQ,EAAI,EAAI,GAClBE,EAAKS,UACLjQ,EAAMwP,EAAKzN,KAAK,IAEhB,IAAImO,EAAgB,GACpB,IAAKhQ,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CACxB,IAAIiQ,EAAUC,SAASpQ,EAAIqQ,OAAOnQ,EAAG,GAAI,GAAG8F,SAAS,IAC9B,IAAnBmK,EAAQ9Q,SACR8Q,EAAU,IAAMA,GACpBD,GAAgCC,EAEpC,OAAOD,EAAcI,eAiDrBC,GAAkB,IAAIC,OAAO,iBAM7BhC,GAAc,SAAUxO,GACxB,GAAIuQ,GAAgBhM,KAAKvE,GAAM,CAC3B,IAAIyQ,EAASxC,OAAOjO,GACpB,GAAIyQ,IAAW,YAAcA,GAAU,WACnC,OAAOA,EAGf,OAAO,MAmBPC,GAAiB,SAAUzJ,GAC3B,IACIA,IAEJ,MAAO1H,GAEHoR,WAAW,WAKP,IAAItL,EAAQ9F,EAAE8F,OAAS,GAEvB,MADA+F,GAAK,yCAA0C/F,GACzC9F,GACPmQ,KAAKI,MAAM,MAMlBc,GAAe,WASf,OARmC,iBAAXtM,QACpBA,OAAkB,WAClBA,OAAkB,UAAa,WAC/B,IAKcuM,OAAO,6FAA+F,GAWxHC,GAAwB,SAAU7J,EAAI8J,GACtC,IAAIC,EAAUL,WAAW1J,EAAI8J,GAI7B,MAHuB,iBAAZC,GAAwBA,EAAe,OAC9CA,EAAe,QAEZA,GAuBPC,GAAsB,WAMtB,SAASA,EAAKC,EAAcC,GACxB,QAAiB,IAAbA,EAAqB,CACrB5T,KAAK6T,QAAUF,EAAatK,MAAM,KAGlC,IADA,IAAIyK,EAAS,EACJnR,EAAI,EAAGA,EAAI3C,KAAK6T,QAAQ/R,OAAQa,IACjC3C,KAAK6T,QAAQlR,GAAGb,OAAS,IACzB9B,KAAK6T,QAAQC,GAAU9T,KAAK6T,QAAQlR,GACpCmR,KAGR9T,KAAK6T,QAAQ/R,OAASgS,EACtB9T,KAAK+T,UAAY,OAGjB/T,KAAK6T,QAAUF,EACf3T,KAAK+T,UAAYH,EAwLzB,OArLAtU,OAAOsI,eAAe8L,EAAM,SAMxB7L,IAAK,WACD,OAAO,IAAI6L,EAAK,KAEpBtF,YAAY,EACZC,cAAc,IAElBqF,EAAKxT,UAAU8T,SAAW,WACtB,OAAIhU,KAAK+T,WAAa/T,KAAK6T,QAAQ/R,OACxB,KACJ9B,KAAK6T,QAAQ7T,KAAK+T,YAK7BL,EAAKxT,UAAU+T,UAAY,WACvB,OAAOjU,KAAK6T,QAAQ/R,OAAS9B,KAAK+T,WAKtCL,EAAKxT,UAAUgU,SAAW,WACtB,IAAIN,EAAW5T,KAAK+T,UAIpB,OAHIH,EAAW5T,KAAK6T,QAAQ/R,QACxB8R,IAEG,IAAIF,EAAK1T,KAAK6T,QAASD,IAKlCF,EAAKxT,UAAUiU,QAAU,WACrB,OAAInU,KAAK+T,UAAY/T,KAAK6T,QAAQ/R,OACvB9B,KAAK6T,QAAQ7T,KAAK6T,QAAQ/R,OAAS,GACvC,MAEX4R,EAAKxT,UAAUuI,SAAW,WAEtB,IADA,IAAI2L,EAAa,GACRzR,EAAI3C,KAAK+T,UAAWpR,EAAI3C,KAAK6T,QAAQ/R,OAAQa,IAC1B,KAApB3C,KAAK6T,QAAQlR,KACbyR,GAAc,IAAMpU,KAAK6T,QAAQlR,IAEzC,OAAOyR,GAAc,KAEzBV,EAAKxT,UAAUmU,mBAAqB,WAEhC,IADA,IAAID,EAAa,GACRzR,EAAI3C,KAAK+T,UAAWpR,EAAI3C,KAAK6T,QAAQ/R,OAAQa,IAC1B,KAApB3C,KAAK6T,QAAQlR,KACbyR,GAAc,IAAME,mBAAmBvP,OAAO/E,KAAK6T,QAAQlR,MAEnE,OAAOyR,GAAc,KAQzBV,EAAKxT,UAAUwI,MAAQ,SAAU6L,GAE7B,YADc,IAAVA,IAAoBA,EAAQ,GACzBvU,KAAK6T,QAAQnL,MAAM1I,KAAK+T,UAAYQ,IAK/Cb,EAAKxT,UAAUsU,OAAS,WACpB,GAAIxU,KAAK+T,WAAa/T,KAAK6T,QAAQ/R,OAC/B,OAAO,KAEX,IADA,IAAI2S,KACK9R,EAAI3C,KAAK+T,UAAWpR,EAAI3C,KAAK6T,QAAQ/R,OAAS,EAAGa,IACtD8R,EAAO1S,KAAK/B,KAAK6T,QAAQlR,IAC7B,OAAO,IAAI+Q,EAAKe,EAAQ,IAM5Bf,EAAKxT,UAAUwU,MAAQ,SAAUC,GAE7B,IADA,IAAIF,KACK9R,EAAI3C,KAAK+T,UAAWpR,EAAI3C,KAAK6T,QAAQ/R,OAAQa,IAClD8R,EAAO1S,KAAK/B,KAAK6T,QAAQlR,IAC7B,GAAIgS,aAAwBjB,EACxB,IAAS/Q,EAAIgS,EAAaZ,UAAWpR,EAAIgS,EAAad,QAAQ/R,OAAQa,IAClE8R,EAAO1S,KAAK4S,EAAad,QAAQlR,QAIrC,CAAA,IAAIiS,EAAcD,EAAatL,MAAM,KACrC,IAAS1G,EAAI,EAAGA,EAAIiS,EAAY9S,OAAQa,IAChCiS,EAAYjS,GAAGb,OAAS,GACxB2S,EAAO1S,KAAK6S,EAAYjS,IAGpC,OAAO,IAAI+Q,EAAKe,EAAQ,IAK5Bf,EAAKxT,UAAU2J,QAAU,WACrB,OAAO7J,KAAK+T,WAAa/T,KAAK6T,QAAQ/R,QAO1C4R,EAAKmB,aAAe,SAAUC,EAAWC,GACrC,IAAIC,EAAQF,EAAUd,WAAYiB,EAAQF,EAAUf,WACpD,GAAc,OAAVgB,EACA,OAAOD,EAEN,GAAIC,IAAUC,EACf,OAAOvB,EAAKmB,aAAaC,EAAUZ,WAAYa,EAAUb,YAGzD,MAAM,IAAI3R,MAAM,8BACZwS,EACA,8BAEAD,EACA,MAQZpB,EAAKwB,aAAe,SAAUC,EAAMC,GAGhC,IAFA,IAAIC,EAAWF,EAAKzM,QAChB4M,EAAYF,EAAM1M,QACb/F,EAAI,EAAGA,EAAI0S,EAASvT,QAAUa,EAAI2S,EAAUxT,OAAQa,IAAK,CAC9D,IAAI4S,EAAMxE,GAAYsE,EAAS1S,GAAI2S,EAAU3S,IAC7C,GAAY,IAAR4S,EACA,OAAOA,EAEf,OAAIF,EAASvT,SAAWwT,EAAUxT,OACvB,EACJuT,EAASvT,OAASwT,EAAUxT,QAAU,EAAI,GAOrD4R,EAAKxT,UAAUsV,OAAS,SAAUC,GAC9B,GAAIzV,KAAKiU,cAAgBwB,EAAMxB,YAC3B,OAAO,EAEX,IAAK,IAAItR,EAAI3C,KAAK+T,UAAWnI,EAAI6J,EAAM1B,UAAWpR,GAAK3C,KAAK6T,QAAQ/R,OAAQa,IAAKiJ,IAC7E,GAAI5L,KAAK6T,QAAQlR,KAAO8S,EAAM5B,QAAQjI,GAClC,OAAO,EAGf,OAAO,GAOX8H,EAAKxT,UAAUoJ,SAAW,SAAUmM,GAChC,IAAI9S,EAAI3C,KAAK+T,UACTnI,EAAI6J,EAAM1B,UACd,GAAI/T,KAAKiU,YAAcwB,EAAMxB,YACzB,OAAO,EAEX,KAAOtR,EAAI3C,KAAK6T,QAAQ/R,QAAQ,CAC5B,GAAI9B,KAAK6T,QAAQlR,KAAO8S,EAAM5B,QAAQjI,GAClC,OAAO,IAETjJ,IACAiJ,EAEN,OAAO,GAEJ8H,KAYPgC,GAAgC,WAKhC,SAASA,EAAeC,EAAMC,GAC1B5V,KAAK4V,aAAeA,EAEpB5V,KAAK6V,OAASF,EAAKjN,QAEnB1I,KAAK8V,YAAc3D,KAAK4D,IAAI,EAAG/V,KAAK6V,OAAO/T,QAC3C,IAAK,IAAIa,EAAI,EAAGA,EAAI3C,KAAK6V,OAAO/T,OAAQa,IACpC3C,KAAK8V,aAAenJ,EAAa3M,KAAK6V,OAAOlT,IAEjD3C,KAAKgW,cAgET,OA9DA1W,OAAOsI,eAAe8N,EAAgB,kBAElC7N,IAAK,WACD,OAAO,IAEXuG,YAAY,EACZC,cAAc,IAElB/O,OAAOsI,eAAe8N,EAAgB,yBAElC7N,IAAK,WACD,OAAO,KAEXuG,YAAY,EACZC,cAAc,IAGlBqH,EAAexV,UAAU6B,KAAO,SAAU2S,GAElC1U,KAAK6V,OAAO/T,OAAS,IACrB9B,KAAK8V,aAAe,GAExB9V,KAAK6V,OAAO9T,KAAK2S,GACjB1U,KAAK8V,aAAenJ,EAAa+H,GACjC1U,KAAKgW,eAETN,EAAexV,UAAU2B,IAAM,WAC3B,IAAIoU,EAAOjW,KAAK6V,OAAOhU,MACvB7B,KAAK8V,aAAenJ,EAAasJ,GAE7BjW,KAAK6V,OAAO/T,OAAS,IACrB9B,KAAK8V,aAAe,IAG5BJ,EAAexV,UAAU8V,YAAc,WACnC,GAAIhW,KAAK8V,YAAcJ,EAAeQ,sBAClC,MAAM,IAAI3T,MAAMvC,KAAK4V,aACjB,8BACAF,EAAeQ,sBACf,WACAlW,KAAK8V,YACL,MAER,GAAI9V,KAAK6V,OAAO/T,OAAS4T,EAAeS,eACpC,MAAM,IAAI5T,MAAMvC,KAAK4V,aACjB,iEACAF,EAAeS,eACf,gCACAnW,KAAKoW,kBAQjBV,EAAexV,UAAUkW,cAAgB,WACrC,OAA0B,GAAtBpW,KAAK6V,OAAO/T,OACL,GAEJ,gBAAkB9B,KAAK6V,OAAOrR,KAAK,KAAO,KAE9CkR,KA0BPW,GAAe,eAsBfC,GAA0B,WAQ1B,SAASA,EAASC,EAAMC,EAAQC,EAAWC,EAAeC,QAC/B,IAAnBA,IAA6BA,EAAiB,IAClD3W,KAAKwW,OAASA,EACdxW,KAAKyW,UAAYA,EACjBzW,KAAK0W,cAAgBA,EACrB1W,KAAK2W,eAAiBA,EACtB3W,KAAKuW,KAAOA,EAAKxD,cACjB/S,KAAK4W,OAAS5W,KAAKuW,KAAKzD,OAAO9S,KAAKuW,KAAKM,QAAQ,KAAO,GACxD7W,KAAK8W,aAAexH,EAAkBzH,IAAI,QAAU0O,IAASvW,KAAKuW,KAgEtE,OA9DAD,EAASpW,UAAU6W,gBAAkB,WACjC,OAAO/W,KAAKuW,OAASvW,KAAK8W,cAAgB9W,KAAKgX,gBAEnDV,EAASpW,UAAU+W,gBAAkB,WACjC,MAA0C,OAAnCjX,KAAK8W,aAAahE,OAAO,EAAG,IAEvCwD,EAASpW,UAAUgX,WAAa,WAC5B,MAAuB,wBAAhBlX,KAAK4W,QAEhBN,EAASpW,UAAU8W,aAAe,WAC9B,MAAwB,mBAAhBhX,KAAK4W,QAA+C,wBAAhB5W,KAAK4W,QAErDN,EAASpW,UAAUiX,WAAa,SAAUC,GAClCA,IAAYpX,KAAK8W,eACjB9W,KAAK8W,aAAeM,EAChBpX,KAAKiX,mBACL3H,EAAkBpB,IAAI,QAAUlO,KAAKuW,KAAMvW,KAAK8W,gBAU5DR,EAASpW,UAAUmX,cAAgB,SAAUC,EAAMC,GAG/C,IAAIC,EACJ,GAHArV,EAAuB,iBAATmV,EAAmB,8BACjCnV,EAAyB,iBAAXoV,EAAqB,gCArE3B,cAuEJD,EACAE,GACKxX,KAAKwW,OAAS,SAAW,SAAWxW,KAAK8W,aAAe,YAE5D,CAAA,GAAIQ,IAASjB,GAKd,MAAM,IAAI9T,MAAM,4BAA8B+U,GAJ9CE,GACKxX,KAAKwW,OAAS,WAAa,WAAaxW,KAAK8W,aAAe,QAKjE9W,KAAK+W,oBACLQ,EAAW,GAAIvX,KAAKyW,WAExB,IAAIgB,KAIJ,OAHAhO,EAAQ8N,EAAQ,SAAU/O,EAAK5G,GAC3B6V,EAAM1V,KAAKyG,EAAM,IAAM5G,KAEpB4V,EAAUC,EAAMjT,KAAK,MAGhC8R,EAASpW,UAAUuI,SAAW,WAC1B,IAAIhG,EAAMzC,KAAK0X,cAIf,OAHI1X,KAAK2W,iBACLlU,GAAO,IAAMzC,KAAK2W,eAAiB,KAEhClU,GAGX6T,EAASpW,UAAUwX,YAAc,WAC7B,OAAQ1X,KAAKwW,OAAS,WAAa,WAAaxW,KAAKuW,MAElDD,KAkEX,IAgkBQqB,GAGAC,GAKAC,GA6IJC,GAqFAC,GA1yBAC,GAAgB,SAAUC,GAC1B,IAAIC,EAAYC,GAASF,GAAUxB,EAAYyB,EAAUE,UAChC,aAArBF,EAAUtB,QACVpG,GAAM0H,EAAU3B,KACZ,8EAIFE,GAA0B,aAAbA,GACM,cAArByB,EAAUtB,QACVpG,GAAM,gFAEL0H,EAAU1B,QAz4BO,oBAAXzP,QACPA,OAAOsR,UACPtR,OAAOsR,SAASC,WACgC,IAAhDvR,OAAOsR,SAASC,SAASzB,QAAQ,WACjChJ,GAAK,6FAw4BT,IAAI6I,EAAqC,OAArBwB,EAAUK,QAAwC,QAArBL,EAAUK,OAC3D,OACIC,SAAU,IAAIlC,GAAS4B,EAAU3B,KAAM2B,EAAU1B,OAAQC,EAAWC,GACpEf,KAAM,IAAIjC,GAAKwE,EAAU9D,cAQ7B+D,GAAW,SAAUF,GAErB,IAAI1B,EAAO,GAAIK,EAAS,GAAIwB,EAAY,GAAIhE,EAAa,GAErDoC,GAAS,EAAM+B,EAAS,QAASE,EAAO,IAE5C,GAAuB,iBAAZR,EAAsB,CAE7B,IAAIS,EAAWT,EAAQpB,QAAQ,MAC3B6B,GAAY,IACZH,EAASN,EAAQrG,UAAU,EAAG8G,EAAW,GACzCT,EAAUA,EAAQrG,UAAU8G,EAAW,IAG3C,IAAIC,EAAWV,EAAQpB,QAAQ,MACb,IAAd8B,IACAA,EAAWV,EAAQnW,QAEvB,IAAI8W,EAAkBX,EAAQpB,QAAQ,MACb,IAArB+B,IACAA,EAAkBX,EAAQnW,QAE9ByU,EAAO0B,EAAQrG,UAAU,EAAGO,KAAKG,IAAIqG,EAAUC,IAC3CD,EAAWC,IAEXxE,EA/FZ,SAAoBA,GAGhB,IAFA,IAAIyE,EAAoB,GACpBpE,EAASL,EAAW/K,MAAM,KACrB1G,EAAI,EAAGA,EAAI8R,EAAO3S,OAAQa,IAC/B,GAAI8R,EAAO9R,GAAGb,OAAS,EAAG,CACtB,IAAIgX,EAAQrE,EAAO9R,GACnB,IACImW,EAAQC,mBAAmBD,EAAMxQ,QAAQ,MAAO,MAEpD,MAAOtG,IACP6W,GAAqB,IAAMC,EAGnC,OAAOD,EAkFcG,CAAWf,EAAQrG,UAAU+G,EAAUC,KAExD,IAAIK,EA9EZ,SAAqBC,GACjB,IAAIC,KAC0B,MAA1BD,EAAY3T,OAAO,KACnB2T,EAAcA,EAAYtH,UAAU,IAExC,IAAK,IAAIzE,EAAK,EAAGiM,EAAKF,EAAY7P,MAAM,KAAM8D,EAAKiM,EAAGtX,OAAQqL,IAAM,CAChE,IAAIkM,EAAUD,EAAGjM,GACjB,GAAuB,IAAnBkM,EAAQvX,OAAZ,CAGA,IAAIwX,EAAKD,EAAQhQ,MAAM,KACL,IAAdiQ,EAAGxX,OACHqX,EAAQJ,mBAAmBO,EAAG,KAAOP,mBAAmBO,EAAG,IAG3DzL,GAAK,0BAA4BwL,EAAU,eAAiBH,EAAc,MAGlF,OAAOC,EA4DeI,CAAYtB,EAAQrG,UAAUO,KAAKG,IAAI2F,EAAQnW,OAAQ8W,MAEzEF,EAAWnC,EAAKM,QAAQ,OACR,GACZL,EAAoB,UAAX+B,GAAiC,QAAXA,EAC/BE,EAAO5F,SAAS0D,EAAK3E,UAAU8G,EAAW,GAAI,KAG9CA,EAAWT,EAAQnW,OAEvB,IAAIsH,EAAQmN,EAAKlN,MAAM,KACF,IAAjBD,EAAMtH,QAEN8U,EAASxN,EAAM,GACfgP,EAAYhP,EAAM,GAAG2J,eAEC,IAAjB3J,EAAMtH,OACX8U,EAASxN,EAAM,GAEoC,cAA9CA,EAAM,GAAGV,MAAM,EAAGgQ,GAAU3F,gBACjC6D,EAAS,aAGK,KAAdwB,GAAoB,OAAQa,IAC5Bb,EAAYa,EAAgB,IAGpC,OACI1C,KAAMA,EACNkC,KAAMA,EACN7B,OAAQA,EACRwB,UAAWA,EACX5B,OAAQA,EACR+B,OAAQA,EACRnE,WAAYA,IAwBhBoF,GAAqB,iCAOrBC,GAAsB,+BAWtBC,GAAa,SAAUlR,GACvB,MAAuB,iBAARA,GAAmC,IAAfA,EAAI1G,SAAiB0X,GAAmBxS,KAAKwB,IAMhFmR,GAAoB,SAAUvF,GAC9B,MAA8B,iBAAfA,GACW,IAAtBA,EAAWtS,SACV2X,GAAoBzS,KAAKoN,IAiB9BwF,GAAkB,SAAUC,GAC5B,OAAqB,OAAbA,GACgB,iBAAbA,GACc,iBAAbA,IAA0BpJ,GAAoBoJ,IACrDA,GAAgC,iBAAbA,GAAyBvQ,EAASuQ,EAAU,QAWpEC,GAA0B,SAAUhO,EAAQM,EAAgBjE,EAAMwN,EAAMtJ,GACpEA,QAAqBlG,IAATgC,GAEhB4R,GAAqB5N,EAAYL,EAAQM,EAAgBC,GAAWlE,EAAMwN,IAS1EoE,GAAuB,SAAUC,EAAgB7R,EAAM8R,GACvD,IAAItE,EAAOsE,aAAiBvG,GAAO,IAAIgC,GAAeuE,EAAOD,GAAkBC,EAC/E,QAAa9T,IAATgC,EACA,MAAM,IAAI5F,MAAMyX,EAAiB,sBAAwBrE,EAAKS,iBAElE,GAAoB,mBAATjO,EACP,MAAM,IAAI5F,MAAMyX,EACZ,uBACArE,EAAKS,gBACL,oBACAjO,EAAKM,YAEb,GAAIgI,GAAoBtI,GACpB,MAAM,IAAI5F,MAAMyX,EAAiB,YAAc7R,EAAKM,WAAa,IAAMkN,EAAKS,iBAGhF,GAAoB,iBAATjO,GACPA,EAAKrG,OA5EQ,SA4EkB,GAC/B6K,EAAaxE,GA7EA,SA8Eb,MAAM,IAAI5F,MAAMyX,EACZ,sDAGArE,EAAKS,gBACL,MACAjO,EAAKyJ,UAAU,EAAG,IAClB,SAIR,GAAIzJ,GAAwB,iBAATA,EAAmB,CAClC,IAAI+R,GAAgB,EAAOC,GAAmB,EAqB9C,GApBA1Q,EAAQtB,EAAM,SAAUK,EAAK5G,GACzB,GAAY,WAAR4G,EACA0R,GAAgB,OAEf,GAAY,cAAR1R,GAA+B,QAARA,IAC5B2R,GAAmB,GACdT,GAAWlR,IACZ,MAAM,IAAIjG,MAAMyX,EACZ,6BACAxR,EACA,KACAmN,EAAKS,gBACL,wFAIZT,EAAK5T,KAAKyG,GACVuR,GAAqBC,EAAgBpY,EAAO+T,GAC5CA,EAAK9T,QAELqY,GAAiBC,EACjB,MAAM,IAAI5X,MAAMyX,EACZ,4BACArE,EAAKS,gBACL,sCAyDZgE,GAA+B,SAAUtO,EAAQM,EAAgBjE,EAAMwN,EAAMtJ,GAC7E,IAAIA,QAAqBlG,IAATgC,EAAhB,CAEA,IAAI6R,EAAiB7N,EAAYL,EAAQM,EAAgBC,GACzD,IAAMlE,GAAwB,iBAATA,GAAsB1I,MAAMkE,QAAQwE,GACrD,MAAM,IAAI5F,MAAMyX,EAAiB,0DAErC,IAAIK,KACJ5Q,EAAQtB,EAAM,SAAUK,EAAK5G,GACzB,IAAI0Y,EAAU,IAAI5G,GAAKlL,GAEvB,GADAuR,GAAqBC,EAAgBpY,EAAO+T,EAAKjB,MAAM4F,IAC7B,cAAtBA,EAAQnG,YACHyF,GAAgBhY,GACjB,MAAM,IAAIW,MAAMyX,EACZ,kCACAM,EAAQ7R,WACR,gGAIZ4R,EAAWtY,KAAKuY,KAnES,SAAUN,EAAgBK,GACvD,IAAI1X,EAAG2X,EACP,IAAK3X,EAAI,EAAGA,EAAI0X,EAAWvY,OAAQa,IAG/B,IADA,IAAI2O,GADJgJ,EAAUD,EAAW1X,IACF+F,QACVkD,EAAI,EAAGA,EAAI0F,EAAKxP,OAAQ8J,IAC7B,GAAgB,cAAZ0F,EAAK1F,IAAsBA,IAAM0F,EAAKxP,OAAS,QAG9C,IAAK4X,GAAWpI,EAAK1F,IACtB,MAAM,IAAIrJ,MAAMyX,EACZ,4BACA1I,EAAK1F,GACL,aACA0O,EAAQ7R,WACR,uFAQhB4R,EAAW9I,KAAKmC,GAAKwB,cACrB,IAAIqF,EAAW,KACf,IAAK5X,EAAI,EAAGA,EAAI0X,EAAWvY,OAAQa,IAAK,CAEpC,GADA2X,EAAUD,EAAW1X,GACJ,OAAb4X,GAAqBA,EAASjR,SAASgR,GACvC,MAAM,IAAI/X,MAAMyX,EACZ,mBACAO,EAAS9R,WACT,qCACA6R,EAAQ7R,YAEhB8R,EAAWD,GAmCfE,CAA2BR,EAAgBK,KAE3CI,GAAmB,SAAU3O,EAAQM,EAAgByN,EAAUxN,GAC/D,IAAIA,QAAyBlG,IAAb0T,EAAhB,CAEA,GAAIpJ,GAAoBoJ,GACpB,MAAM,IAAItX,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,MACAwN,EAASpR,WACT,6FAGR,IAAKmR,GAAgBC,GACjB,MAAM,IAAItX,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,yFAGRqO,GAAoB,SAAU5O,EAAQM,EAAgBuO,EAAWtO,GACjE,IAAIA,QAA0BlG,IAAdwU,EAEhB,OAAQA,GACJ,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACD,MACJ,QACI,MAAM,IAAIpY,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,8GAIZuO,GAAc,SAAU9O,EAAQM,EAAgB5D,EAAK6D,GACrD,KAAIA,QAAoBlG,IAARqC,GAEXkR,GAAWlR,IACZ,MAAM,IAAIjG,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,yBACA7D,EACA,qGAGRqS,GAAqB,SAAU/O,EAAQM,EAAgBgI,EAAY/H,GACnE,KAAIA,QAA2BlG,IAAfiO,GAEXuF,GAAkBvF,IACnB,MAAM,IAAI7R,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,0BACA+H,EACA,qFAUR0G,GAAuB,SAAUhP,EAAQ6J,GACzC,GAAwB,UAApBA,EAAK3B,WACL,MAAM,IAAIzR,MAAMuJ,EAAS,8CAG7BiP,GAAc,SAAUjP,EAAQM,EAAgB8L,GAEhD,IAAI9D,EAAa8D,EAAUvC,KAAKlN,WAChC,GAAyC,iBAA5ByP,EAAUM,SAASjC,MACO,IAAnC2B,EAAUM,SAASjC,KAAKzU,SACtB4X,GAAWxB,EAAUM,SAAS/B,YACc,cAA1CyB,EAAUM,SAASjC,KAAKlN,MAAM,KAAK,IAChB,IAAtB+K,EAAWtS,SArPQ,SAAUsS,GAKlC,OAJIA,IAEAA,EAAaA,EAAW9L,QAAQ,mBAAoB,MAEjDqR,GAAkBvF,GAgPQ4G,CAAsB5G,GACnD,MAAM,IAAI7R,MAAM4J,EAAYL,EAAQM,GAAgB,GAChD,yFA6BR6O,GAA8B,WAK9B,SAASA,EAAaC,EAAOjB,GACzBja,KAAKkb,MAAQA,EACblb,KAAKia,MAAQA,EA8EjB,OAxEAgB,EAAa/a,UAAUib,OAAS,SAAUC,GACtCvP,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU3F,QACxDyK,EAAiB,sBAAuB,EAAG6O,GAAY,GACvD,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKkb,MAAMI,mBAAmBtb,KAAKia,MAAOoB,EAAS1U,aAAayU,IACzDC,EAAS9U,SAMpB0U,EAAa/a,UAAU6O,OAAS,SAAUqM,GACtCvP,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU3F,QACxDgZ,GAAqB,sBAAuB9a,KAAKia,OACjD1N,EAAiB,sBAAuB,EAAG6O,GAAY,GACvD,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKkb,MAAMK,gBAAgBvb,KAAKia,MAAO,KAAMoB,EAAS1U,aAAayU,IAC5DC,EAAS9U,SAOpB0U,EAAa/a,UAAUgO,IAAM,SAAUtM,EAAOwZ,GAC1CvP,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QACrDgZ,GAAqB,mBAAoB9a,KAAKia,OAC9CH,GAAwB,mBAAoB,EAAGlY,EAAO5B,KAAKia,OAAO,GAClE1N,EAAiB,mBAAoB,EAAG6O,GAAY,GACpD,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKkb,MAAMK,gBAAgBvb,KAAKia,MAAOrY,EAAOyZ,EAAS1U,aAAayU,IAC7DC,EAAS9U,SAQpB0U,EAAa/a,UAAUsb,gBAAkB,SAAU5Z,EAAOiY,EAAUuB,GAChEvP,EAAiB,+BAAgC,EAAG,EAAGpE,UAAU3F,QACjEgZ,GAAqB,+BAAgC9a,KAAKia,OAC1DH,GAAwB,+BAAgC,EAAGlY,EAAO5B,KAAKia,OAAO,GAC9EQ,GAAiB,+BAAgC,EAAGZ,GAAU,GAC9DtN,EAAiB,+BAAgC,EAAG6O,GAAY,GAChE,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKkb,MAAMO,4BAA4Bzb,KAAKia,MAAOrY,EAAOiY,EAAUwB,EAAS1U,aAAayU,IACnFC,EAAS9U,SAOpB0U,EAAa/a,UAAUoL,OAAS,SAAUoQ,EAAeN,GAGrD,GAFAvP,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU3F,QACxDgZ,GAAqB,sBAAuB9a,KAAKia,OAC7Cxa,MAAMkE,QAAQ+X,GAAgB,CAE9B,IADA,IAAIC,KACKhZ,EAAI,EAAGA,EAAI+Y,EAAc5Z,SAAUa,EACxCgZ,EAAiB,GAAKhZ,GAAK+Y,EAAc/Y,GAE7C+Y,EAAgBC,EAChB9N,GAAK,gOAGTuM,GAA6B,sBAAuB,EAAGsB,EAAe1b,KAAKia,OAAO,GAClF1N,EAAiB,sBAAuB,EAAG6O,GAAY,GACvD,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKkb,MAAMU,mBAAmB5b,KAAKia,MAAOyB,EAAeL,EAAS1U,aAAayU,IACxEC,EAAS9U,SAEb0U,KAkBPY,GAAmC,WAQnC,SAASA,EAAkBC,EAAWC,GAClC/b,KAAK8b,UAAYA,EACjB9b,KAAK+b,SAAWA,EAQpB,OAJAF,EAAkB3b,UAAU8b,OAAS,WAEjC,OADAnQ,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU3F,SACpDga,UAAW9b,KAAK8b,UAAWC,SAAU/b,KAAK+b,SAASC,WAEzDH,KAgCPI,IAEItE,GAAa,mEAGbC,GAAe,EAKfC,MACG,SAAUxK,GACb,IAEI1K,EAFAuZ,EAAgB7O,IAAQuK,GAC5BA,GAAevK,EAEf,IAAI8O,EAAiB,IAAI1c,MAAM,GAC/B,IAAKkD,EAAI,EAAGA,GAAK,EAAGA,IAChBwZ,EAAexZ,GAAKgV,GAAWpS,OAAO8H,EAAM,IAG5CA,EAAM8E,KAAKI,MAAMlF,EAAM,IAE3BlL,EAAe,IAARkL,EAAW,4BAClB,IAAIT,EAAKuP,EAAe3X,KAAK,IAC7B,GAAK0X,EAKA,CAGD,IAAKvZ,EAAI,GAAIA,GAAK,GAA0B,KAArBkV,GAAclV,GAAWA,IAC5CkV,GAAclV,GAAK,EAEvBkV,GAAclV,UAVd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAChBkV,GAAclV,GAAKwP,KAAKI,MAAsB,GAAhBJ,KAAKiK,UAW3C,IAAKzZ,EAAI,EAAGA,EAAI,GAAIA,IAChBiK,GAAM+K,GAAWpS,OAAOsS,GAAclV,IAG1C,OADAR,EAAqB,KAAdyK,EAAG9K,OAAe,oCAClB8K,IA0BXyP,GAA2B,WAC3B,SAASA,EAAU1U,EAAM2U,GACrBtc,KAAK2H,KAAOA,EACZ3H,KAAKsc,KAAOA,EAWhB,OAHAD,EAAUE,KAAO,SAAU5U,EAAM2U,GAC7B,OAAO,IAAID,EAAU1U,EAAM2U,IAExBD,KAsBPG,GAAuB,WACvB,SAASA,KA6BT,OAvBAA,EAAMtc,UAAUuc,WAAa,WACzB,OAAOzc,KAAK0c,QAAQrM,KAAKrQ,OAU7Bwc,EAAMtc,UAAUyc,oBAAsB,SAAUC,EAASC,GACrD,IAAIC,EAAa,IAAIT,GAAUxL,GAAU+L,GACrCG,EAAa,IAAIV,GAAUxL,GAAUgM,GACzC,OAAgD,IAAzC7c,KAAK0c,QAAQI,EAAYC,IAMpCP,EAAMtc,UAAU8c,QAAU,WACtB,OAAOX,GAAUY,KAEdT,KAmBPU,GAA0B,SAAU3S,GAEpC,SAAS2S,IACL,OAAkB,OAAX3S,GAAmBA,EAAO/C,MAAMxH,KAAMyH,YAAczH,KA8D/D,OAhEAF,EAAUod,EAAU3S,GAIpBjL,OAAOsI,eAAesV,EAAU,gBAC5BrV,IAAK,WACD,OAAOiQ,IAEX5J,IAAK,SAAUC,GACX2J,GAAe3J,GAEnBC,YAAY,EACZC,cAAc,IAKlB6O,EAAShd,UAAUwc,QAAU,SAAUrR,EAAG1L,GACtC,OAAOoR,GAAY1F,EAAE1D,KAAMhI,EAAEgI,OAKjCuV,EAAShd,UAAUid,YAAc,SAAUb,GAGvC,MAAMha,EAAe,oDAKzB4a,EAAShd,UAAUyc,oBAAsB,SAAUC,EAASC,GACxD,OAAO,GAKXK,EAAShd,UAAU8c,QAAU,WACzB,OAAOX,GAAUY,KAKrBC,EAAShd,UAAUkd,QAAU,WAGzB,OAAO,IAAIf,GAAUvL,GAAUgH,KAOnCoF,EAAShd,UAAUmd,SAAW,SAAUC,EAAY3V,GAGhD,OAFAxF,EAA6B,iBAAfmb,EAAyB,gDAEhC,IAAIjB,GAAUiB,EAAYxF,KAKrCoF,EAAShd,UAAUuI,SAAW,WAC1B,MAAO,QAEJyU,GACTV,IACEe,GAAY,IAAIL,GAyBpB,IAwCIM,GAoQAC,GACAC,GA7SAC,GAAmB,SAAU9D,GAC7B,MAAwB,iBAAbA,EACA,UAAY/H,GAAsB+H,GAElC,UAAYA,GAOvB+D,GAAuB,SAAUC,GACjC,GAAIA,EAAaC,aAAc,CAC3B,IAAI3P,EAAM0P,EAAa1P,MACvBhM,EAAsB,iBAARgM,GACK,iBAARA,GACS,iBAARA,GAAoB7E,EAAS6E,EAAK,OAAS,6CAGvDhM,EAAO0b,IAAiB9F,IAAY8F,EAAahU,UAAW,gCAGhE1H,EAAO0b,IAAiB9F,IAAY8F,EAAaE,cAAclU,UAAW,uDAwB1EmU,GAA0B,WAO1B,SAASA,EAASC,EAAQC,QACA,IAAlBA,IAA4BA,EAAgBF,EAASR,0BAA0BW,YACnFne,KAAKie,OAASA,EACdje,KAAKke,cAAgBA,EACrBle,KAAKoe,UAAY,KACjBjc,OAAuBgE,IAAhBnG,KAAKie,QAAwC,OAAhBje,KAAKie,OAAiB,4DAC1DL,GAAqB5d,KAAKke,eA+N9B,OA7NA5e,OAAOsI,eAAeoW,EAAU,6BAC5BnW,IAAK,WACD,OAAO2V,IAEXtP,IAAK,SAAUC,GACXqP,GAA4BrP,GAEhCC,YAAY,EACZC,cAAc,IAGlB2P,EAAS9d,UAAU4d,WAAa,WAC5B,OAAO,GAGXE,EAAS9d,UAAU6d,YAAc,WAC7B,OAAO/d,KAAKke,eAGhBF,EAAS9d,UAAUme,eAAiB,SAAUC,GAC1C,OAAO,IAAIN,EAAShe,KAAKie,OAAQK,IAGrCN,EAAS9d,UAAUqe,kBAAoB,SAAUC,GAE7C,MAAkB,cAAdA,EACOxe,KAAKke,cAGLF,EAASR,0BAA0BW,YAIlDH,EAAS9d,UAAUue,SAAW,SAAU9I,GACpC,OAAIA,EAAK9L,UACE7J,KAEkB,cAApB2V,EAAK3B,WACHhU,KAAKke,cAGLF,EAASR,0BAA0BW,YAMlDH,EAAS9d,UAAUwe,SAAW,WAC1B,OAAO,GAGXV,EAAS9d,UAAUye,wBAA0B,SAAUH,EAAWI,GAC9D,OAAO,MAGXZ,EAAS9d,UAAU2e,qBAAuB,SAAUL,EAAWM,GAC3D,MAAkB,cAAdN,EACOxe,KAAKqe,eAAeS,GAEtBA,EAAajV,WAA2B,cAAd2U,EACxBxe,KAGAge,EAASR,0BAA0BW,WAAWU,qBAAqBL,EAAWM,GAAcT,eAAere,KAAKke,gBAI/HF,EAAS9d,UAAU6e,YAAc,SAAUpJ,EAAMmJ,GAC7C,IAAIE,EAAQrJ,EAAK3B,WACjB,OAAc,OAAVgL,EACOF,EAEFA,EAAajV,WAAuB,cAAVmV,EACxBhf,MAGPmC,EAAiB,cAAV6c,GAA8C,IAArBrJ,EAAK1B,YAAmB,8CACjDjU,KAAK6e,qBAAqBG,EAAOhB,EAASR,0BAA0BW,WAAWY,YAAYpJ,EAAKzB,WAAY4K,MAI3Hd,EAAS9d,UAAU2J,QAAU,WACzB,OAAO,GAGXmU,EAAS9d,UAAU+e,YAAc,WAC7B,OAAO,GAGXjB,EAAS9d,UAAUgf,aAAe,SAAUC,EAAOC,GAC/C,OAAO,GAKXpB,EAAS9d,UAAUiO,IAAM,SAAUkR,GAC/B,OAAIA,IAAiBrf,KAAK+d,cAAclU,WAEhCyV,SAAUtf,KAAKuf,WACfC,YAAaxf,KAAK+d,cAAc5P,OAG7BnO,KAAKuf,YAGpBvB,EAAS9d,UAAUuf,KAAO,WACtB,GAAuB,OAAnBzf,KAAKoe,UAAoB,CACzB,IAAIsB,EAAS,GACR1f,KAAKke,cAAcrU,YACpB6V,GACI,YACI/B,GAAiB3d,KAAKke,cAAc/P,OACpC,KACZ,IAAImJ,SAActX,KAAKie,OACvByB,GAAUpI,EAAO,IAEboI,GADS,WAATpI,EACUxF,GAAsB9R,KAAKie,QAG3Bje,KAAKie,OAEnBje,KAAKoe,UAAY1O,EAAKgQ,GAE1B,OAAO1f,KAAKoe,WAMhBJ,EAAS9d,UAAUqf,SAAW,WAC1B,OAAOvf,KAAKie,QAKhBD,EAAS9d,UAAUyf,UAAY,SAAUlK,GACrC,OAAIA,IAAUuI,EAASR,0BAA0BW,WACtC,EAEF1I,aAAiBuI,EAASR,2BACvB,GAGRrb,EAAOsT,EAAMqI,aAAc,qBACpB9d,KAAK4f,mBAAmBnK,KASvCuI,EAAS9d,UAAU0f,mBAAqB,SAAUC,GAC9C,IAAIC,SAAuBD,EAAU5B,OACjC8B,SAAsB/f,KAAKie,OAC3B+B,EAAahC,EAASiC,iBAAiBpJ,QAAQiJ,GAC/CI,EAAYlC,EAASiC,iBAAiBpJ,QAAQkJ,GAGlD,OAFA5d,EAAO6d,GAAc,EAAG,sBAAwBF,GAChD3d,EAAO+d,GAAa,EAAG,sBAAwBH,GAC3CC,IAAeE,EAEM,WAAjBH,EAEO,EAIH/f,KAAKie,OAAS4B,EAAU5B,QAChB,EAEHje,KAAKie,SAAW4B,EAAU5B,OACxB,EAGA,EAKRiC,EAAYF,GAM3BhC,EAAS9d,UAAUigB,UAAY,WAC3B,OAAOngB,MAKXge,EAAS9d,UAAUkgB,UAAY,WAC3B,OAAO,GAKXpC,EAAS9d,UAAUsV,OAAS,SAAUC,GAIlC,GAAIA,IAAUzV,KACV,OAAO,EAEN,GAAIyV,EAAMqI,aAAc,CACzB,IAAI+B,EAAYpK,EAChB,OAAQzV,KAAKie,SAAW4B,EAAU5B,QAC9Bje,KAAKke,cAAc1I,OAAOqK,EAAU3B,eAGxC,OAAO,GASfF,EAASiC,kBAAoB,SAAU,UAAW,SAAU,UACrDjC,KA+BX,IAq1BIqC,GAkMAlC,GA39BAmC,GAAiB,IA5Dc,SAAU/V,GAEzC,SAASgW,IACL,OAAkB,OAAXhW,GAAmBA,EAAO/C,MAAMxH,KAAMyH,YAAczH,KAuD/D,OAzDAF,EAAUygB,EAAehW,GAOzBgW,EAAcrgB,UAAUwc,QAAU,SAAUrR,EAAG1L,GAC3C,IAAI6gB,EAAYnV,EAAEiR,KAAKyB,cACnB0C,EAAY9gB,EAAE2c,KAAKyB,cACnB2C,EAAWF,EAAUb,UAAUc,GACnC,OAAiB,IAAbC,EACO3P,GAAY1F,EAAE1D,KAAMhI,EAAEgI,MAGtB+Y,GAMfH,EAAcrgB,UAAUid,YAAc,SAAUb,GAC5C,OAAQA,EAAKyB,cAAclU,WAK/B0W,EAAcrgB,UAAUyc,oBAAsB,SAAUC,EAASC,GAC7D,OAAQD,EAAQmB,cAAcvI,OAAOqH,EAAQkB,gBAKjDwC,EAAcrgB,UAAU8c,QAAU,WAC9B,OAAOX,GAAUY,KAKrBsD,EAAcrgB,UAAUkd,QAAU,WAC9B,OAAO,IAAIf,GAAUvL,GAAU,IAAIkN,GAAS,kBAAmBN,MAOnE6C,EAAcrgB,UAAUmd,SAAW,SAAUC,EAAY3V,GACrD,IAAIkW,EAAeJ,GAAaH,GAChC,OAAO,IAAIjB,GAAU1U,EAAM,IAAIqW,GAAS,kBAAmBH,KAK/D0C,EAAcrgB,UAAUuI,SAAW,WAC/B,MAAO,aAEJ8X,GACT/D,KAqBEmE,GAAmC,WASnC,SAASA,EAAkBrE,EAAMsE,EAAUC,EAAYC,EAAYC,QACtC,IAArBA,IAA+BA,EAAmB,MACtD/gB,KAAK8gB,WAAaA,EAClB9gB,KAAK+gB,iBAAmBA,EAIxB/gB,KAAKghB,cAEL,IADA,IAAIzL,EAAM,GACF+G,EAAKzS,WAMT,GALAyS,EAAOA,EACP/G,EAAMqL,EAAWC,EAAWvE,EAAK9T,IAAKoY,GAAY,EAE9CE,IACAvL,IAAQ,GACRA,EAAM,EAGF+G,EADAtc,KAAK8gB,WACExE,EAAKnH,KAGLmH,EAAKlH,UAGf,CAAA,GAAY,IAARG,EAAW,CAEhBvV,KAAKghB,WAAWjf,KAAKua,GACrB,MAIAtc,KAAKghB,WAAWjf,KAAKua,GAEjBA,EADAtc,KAAK8gB,WACExE,EAAKlH,MAGLkH,EAAKnH,MA4C5B,OAvCAwL,EAAkBzgB,UAAU+gB,QAAU,WAClC,GAA+B,IAA3BjhB,KAAKghB,WAAWlf,OAChB,OAAO,KACX,IACIof,EADA5E,EAAOtc,KAAKghB,WAAWnf,MAM3B,GAHIqf,EADAlhB,KAAK+gB,iBACI/gB,KAAK+gB,iBAAiBzE,EAAK9T,IAAK8T,EAAK1a,QAEnC4G,IAAK8T,EAAK9T,IAAK5G,MAAO0a,EAAK1a,OACtC5B,KAAK8gB,WAEL,IADAxE,EAAOA,EAAKnH,MACJmH,EAAKzS,WACT7J,KAAKghB,WAAWjf,KAAKua,GACrBA,EAAOA,EAAKlH,WAKhB,IADAkH,EAAOA,EAAKlH,OACJkH,EAAKzS,WACT7J,KAAKghB,WAAWjf,KAAKua,GACrBA,EAAOA,EAAKnH,KAGpB,OAAO+L,GAEXP,EAAkBzgB,UAAUihB,QAAU,WAClC,OAAOnhB,KAAKghB,WAAWlf,OAAS,GAEpC6e,EAAkBzgB,UAAUkhB,KAAO,WAC/B,GAA+B,IAA3BphB,KAAKghB,WAAWlf,OAChB,OAAO,KACX,IAAIwa,EAAOtc,KAAKghB,WAAWhhB,KAAKghB,WAAWlf,OAAS,GACpD,OAAI9B,KAAK+gB,iBACE/gB,KAAK+gB,iBAAiBzE,EAAK9T,IAAK8T,EAAK1a,QAGnC4G,IAAK8T,EAAK9T,IAAK5G,MAAO0a,EAAK1a,QAGrC+e,KAKPU,GAA0B,WAS1B,SAASA,EAAS7Y,EAAK5G,EAAO0f,EAAOnM,EAAMC,GACvCpV,KAAKwI,IAAMA,EACXxI,KAAK4B,MAAQA,EACb5B,KAAKshB,MAAiB,MAATA,EAAgBA,EAAQD,EAASE,IAC9CvhB,KAAKmV,KACO,MAARA,EAAeA,EAAOqM,GAAUrD,WACpCne,KAAKoV,MACQ,MAATA,EAAgBA,EAAQoM,GAAUrD,WA+P1C,OAnPAkD,EAASnhB,UAAUuhB,KAAO,SAAUjZ,EAAK5G,EAAO0f,EAAOnM,EAAMC,GACzD,OAAO,IAAIiM,EAAgB,MAAP7Y,EAAcA,EAAMxI,KAAKwI,IAAc,MAAT5G,EAAgBA,EAAQ5B,KAAK4B,MAAgB,MAAT0f,EAAgBA,EAAQthB,KAAKshB,MAAe,MAARnM,EAAeA,EAAOnV,KAAKmV,KAAe,MAATC,EAAgBA,EAAQpV,KAAKoV,QAK5LiM,EAASnhB,UAAUwhB,MAAQ,WACvB,OAAO1hB,KAAKmV,KAAKuM,QAAU,EAAI1hB,KAAKoV,MAAMsM,SAK9CL,EAASnhB,UAAU2J,QAAU,WACzB,OAAO,GAWXwX,EAASnhB,UAAUyhB,iBAAmB,SAAUvC,GAC5C,OAAQpf,KAAKmV,KAAKwM,iBAAiBvC,IAC/BA,EAAOpf,KAAKwI,IAAKxI,KAAK4B,QACtB5B,KAAKoV,MAAMuM,iBAAiBvC,IAUpCiC,EAASnhB,UAAU0hB,iBAAmB,SAAUxC,GAC5C,OAAQpf,KAAKoV,MAAMwM,iBAAiBxC,IAChCA,EAAOpf,KAAKwI,IAAKxI,KAAK4B,QACtB5B,KAAKmV,KAAKyM,iBAAiBxC,IAMnCiC,EAASnhB,UAAU2hB,KAAO,WACtB,OAAI7hB,KAAKmV,KAAKtL,UACH7J,KAGAA,KAAKmV,KAAK0M,QAMzBR,EAASnhB,UAAU4hB,OAAS,WACxB,OAAO9hB,KAAK6hB,OAAOrZ,KAKvB6Y,EAASnhB,UAAU6hB,OAAS,WACxB,OAAI/hB,KAAKoV,MAAMvL,UACJ7J,KAAKwI,IAGLxI,KAAKoV,MAAM2M,UAU1BV,EAASnhB,UAAU8hB,OAAS,SAAUxZ,EAAK5G,EAAOif,GAC9C,IAAItL,EAAKjU,EAYT,OARIA,GAFJiU,EAAMsL,EAAWrY,GADjBlH,EAAItB,MACoBwI,MACd,EACFlH,EAAEmgB,KAAK,KAAM,KAAM,KAAMngB,EAAE6T,KAAK6M,OAAOxZ,EAAK5G,EAAOif,GAAa,MAEvD,IAARtL,EACDjU,EAAEmgB,KAAK,KAAM7f,EAAO,KAAM,KAAM,MAGhCN,EAAEmgB,KAAK,KAAM,KAAM,KAAM,KAAMngB,EAAE8T,MAAM4M,OAAOxZ,EAAK5G,EAAOif,KAEzDoB,UAMbZ,EAASnhB,UAAUgiB,WAAa,WAC5B,GAAIliB,KAAKmV,KAAKtL,UACV,OAAO2X,GAAUrD,WAErB,IAAI7c,EAAItB,KAIR,OAHKsB,EAAE6T,KAAKgN,UAAa7gB,EAAE6T,KAAKA,KAAKgN,WACjC7gB,EAAIA,EAAE8gB,iBACV9gB,EAAIA,EAAEmgB,KAAK,KAAM,KAAM,KAAMngB,EAAE6T,KAAK+M,aAAc,OACzCD,UAObZ,EAASnhB,UAAU6O,OAAS,SAAUvG,EAAKqY,GACvC,IAAIvf,EAAG+gB,EAEP,GAAIxB,EAAWrY,GADflH,EAAItB,MACkBwI,KAAO,EACpBlH,EAAE6T,KAAKtL,WAAcvI,EAAE6T,KAAKgN,UAAa7gB,EAAE6T,KAAKA,KAAKgN,WACtD7gB,EAAIA,EAAE8gB,gBAEV9gB,EAAIA,EAAEmgB,KAAK,KAAM,KAAM,KAAMngB,EAAE6T,KAAKpG,OAAOvG,EAAKqY,GAAa,UAE5D,CAMD,GALIvf,EAAE6T,KAAKgN,WACP7gB,EAAIA,EAAEghB,gBACLhhB,EAAE8T,MAAMvL,WAAcvI,EAAE8T,MAAM+M,UAAa7gB,EAAE8T,MAAMD,KAAKgN,WACzD7gB,EAAIA,EAAEihB,iBAEqB,IAA3B1B,EAAWrY,EAAKlH,EAAEkH,KAAY,CAC9B,GAAIlH,EAAE8T,MAAMvL,UACR,OAAO2X,GAAUrD,WAGjBkE,EAAW/gB,EAAE8T,MAAMyM,OACnBvgB,EAAIA,EAAEmgB,KAAKY,EAAS7Z,IAAK6Z,EAASzgB,MAAO,KAAM,KAAMN,EAAE8T,MAAM8M,cAGrE5gB,EAAIA,EAAEmgB,KAAK,KAAM,KAAM,KAAM,KAAMngB,EAAE8T,MAAMrG,OAAOvG,EAAKqY,IAE3D,OAAOvf,EAAE2gB,UAMbZ,EAASnhB,UAAUiiB,OAAS,WACxB,OAAOniB,KAAKshB,OAMhBD,EAASnhB,UAAU+hB,OAAS,WACxB,IAAI3gB,EAAItB,KAOR,OANIsB,EAAE8T,MAAM+M,WAAa7gB,EAAE6T,KAAKgN,WAC5B7gB,EAAIA,EAAEkhB,eACNlhB,EAAE6T,KAAKgN,UAAY7gB,EAAE6T,KAAKA,KAAKgN,WAC/B7gB,EAAIA,EAAEghB,gBACNhhB,EAAE6T,KAAKgN,UAAY7gB,EAAE8T,MAAM+M,WAC3B7gB,EAAIA,EAAEmhB,cACHnhB,GAMX+f,EAASnhB,UAAUkiB,aAAe,WAC9B,IAAI9gB,EAAItB,KAAKyiB,aAMb,OALInhB,EAAE8T,MAAMD,KAAKgN,WAGb7gB,GADAA,GADAA,EAAIA,EAAEmgB,KAAK,KAAM,KAAM,KAAM,KAAMngB,EAAE8T,MAAMkN,iBACrCE,eACAC,cAEHnhB,GAMX+f,EAASnhB,UAAUqiB,cAAgB,WAC/B,IAAIjhB,EAAItB,KAAKyiB,aAKb,OAJInhB,EAAE6T,KAAKA,KAAKgN,WAEZ7gB,GADAA,EAAIA,EAAEghB,gBACAG,cAEHnhB,GAMX+f,EAASnhB,UAAUsiB,YAAc,WAC7B,IAAIE,EAAK1iB,KAAKyhB,KAAK,KAAM,KAAMJ,EAASE,IAAK,KAAMvhB,KAAKoV,MAAMD,MAC9D,OAAOnV,KAAKoV,MAAMqM,KAAK,KAAM,KAAMzhB,KAAKshB,MAAOoB,EAAI,OAMvDrB,EAASnhB,UAAUoiB,aAAe,WAC9B,IAAIK,EAAK3iB,KAAKyhB,KAAK,KAAM,KAAMJ,EAASE,IAAKvhB,KAAKmV,KAAKC,MAAO,MAC9D,OAAOpV,KAAKmV,KAAKsM,KAAK,KAAM,KAAMzhB,KAAKshB,MAAO,KAAMqB,IAMxDtB,EAASnhB,UAAUuiB,WAAa,WAC5B,IAAItN,EAAOnV,KAAKmV,KAAKsM,KAAK,KAAM,MAAOzhB,KAAKmV,KAAKmM,MAAO,KAAM,MAC1DlM,EAAQpV,KAAKoV,MAAMqM,KAAK,KAAM,MAAOzhB,KAAKoV,MAAMkM,MAAO,KAAM,MACjE,OAAOthB,KAAKyhB,KAAK,KAAM,MAAOzhB,KAAKshB,MAAOnM,EAAMC,IAQpDiM,EAASnhB,UAAU0iB,eAAiB,WAChC,IAAIC,EAAa7iB,KAAK8iB,SACtB,OAAO3Q,KAAKE,IAAI,EAAKwQ,IAAe7iB,KAAK0hB,QAAU,GAMvDL,EAASnhB,UAAU4iB,OAAS,WACxB,IAAID,EACJ,GAAI7iB,KAAKmiB,UAAYniB,KAAKmV,KAAKgN,SAC3B,MAAM,IAAI5f,MAAM,0BAA4BvC,KAAKwI,IAAM,IAAMxI,KAAK4B,MAAQ,KAE9E,GAAI5B,KAAKoV,MAAM+M,SACX,MAAM,IAAI5f,MAAM,mBAAqBvC,KAAKwI,IAAM,IAAMxI,KAAK4B,MAAQ,YAGvE,IADAihB,EAAa7iB,KAAKmV,KAAK2N,YACJ9iB,KAAKoV,MAAM0N,SAC1B,MAAM,IAAIvgB,MAAM,uBAGhB,OAAOsgB,GAAc7iB,KAAKmiB,SAAW,EAAI,IAGjDd,EAASE,KAAM,EACfF,EAAS0B,OAAQ,EACV1B,KAKP2B,GAA+B,WAC/B,SAASA,KA2FT,OApFAA,EAAc9iB,UAAUuhB,KAAO,SAAUjZ,EAAK5G,EAAO0f,EAAOnM,EAAMC,GAC9D,OAAOpV,MAUXgjB,EAAc9iB,UAAU8hB,OAAS,SAAUxZ,EAAK5G,EAAOif,GACnD,OAAO,IAAIQ,GAAS7Y,EAAK5G,EAAO,OASpCohB,EAAc9iB,UAAU6O,OAAS,SAAUvG,EAAKqY,GAC5C,OAAO7gB,MAKXgjB,EAAc9iB,UAAUwhB,MAAQ,WAC5B,OAAO,GAKXsB,EAAc9iB,UAAU2J,QAAU,WAC9B,OAAO,GAUXmZ,EAAc9iB,UAAUyhB,iBAAmB,SAAUvC,GACjD,OAAO,GAUX4D,EAAc9iB,UAAU0hB,iBAAmB,SAAUxC,GACjD,OAAO,GAKX4D,EAAc9iB,UAAU4hB,OAAS,WAC7B,OAAO,MAKXkB,EAAc9iB,UAAU6hB,OAAS,WAC7B,OAAO,MAMXiB,EAAc9iB,UAAU4iB,OAAS,WAC7B,OAAO,GAMXE,EAAc9iB,UAAUiiB,OAAS,WAC7B,OAAO,GAEJa,KAMPxB,GAA2B,WAM3B,SAASA,EAAUyB,EAAaC,QACd,IAAVA,IAAoBA,EAAQ1B,EAAUrD,YAC1Cne,KAAKijB,YAAcA,EACnBjjB,KAAKkjB,MAAQA,EAyJjB,OA/IA1B,EAAUthB,UAAU8hB,OAAS,SAAUxZ,EAAK5G,GACxC,OAAO,IAAI4f,EAAUxhB,KAAKijB,YAAajjB,KAAKkjB,MACvClB,OAAOxZ,EAAK5G,EAAO5B,KAAKijB,aACxBxB,KAAK,KAAM,KAAMJ,GAAS0B,MAAO,KAAM,QAQhDvB,EAAUthB,UAAU6O,OAAS,SAAUvG,GACnC,OAAO,IAAIgZ,EAAUxhB,KAAKijB,YAAajjB,KAAKkjB,MACvCnU,OAAOvG,EAAKxI,KAAKijB,aACjBxB,KAAK,KAAM,KAAMJ,GAAS0B,MAAO,KAAM,QAShDvB,EAAUthB,UAAU2H,IAAM,SAAUW,GAGhC,IAFA,IAAI+M,EACA+G,EAAOtc,KAAKkjB,OACR5G,EAAKzS,WAAW,CAEpB,GAAY,KADZ0L,EAAMvV,KAAKijB,YAAYza,EAAK8T,EAAK9T,MAE7B,OAAO8T,EAAK1a,MAEP2T,EAAM,EACX+G,EAAOA,EAAKnH,KAEPI,EAAM,IACX+G,EAAOA,EAAKlH,OAGpB,OAAO,MAOXoM,EAAUthB,UAAUijB,kBAAoB,SAAU3a,GAE9C,IADA,IAAI+M,EAAK+G,EAAOtc,KAAKkjB,MAAOE,EAAc,MAClC9G,EAAKzS,WAAW,CAEpB,GAAY,KADZ0L,EAAMvV,KAAKijB,YAAYza,EAAK8T,EAAK9T,MAClB,CACX,GAAK8T,EAAKnH,KAAKtL,UAMV,OAAIuZ,EACEA,EAAY5a,IAGZ,KARP,IADA8T,EAAOA,EAAKnH,MACJmH,EAAKlH,MAAMvL,WACfyS,EAAOA,EAAKlH,MAChB,OAAOkH,EAAK9T,IASX+M,EAAM,EACX+G,EAAOA,EAAKnH,KAEPI,EAAM,IACX6N,EAAc9G,EACdA,EAAOA,EAAKlH,OAGpB,MAAM,IAAI7S,MAAM,0EAKpBif,EAAUthB,UAAU2J,QAAU,WAC1B,OAAO7J,KAAKkjB,MAAMrZ,WAKtB2X,EAAUthB,UAAUwhB,MAAQ,WACxB,OAAO1hB,KAAKkjB,MAAMxB,SAKtBF,EAAUthB,UAAU4hB,OAAS,WACzB,OAAO9hB,KAAKkjB,MAAMpB,UAKtBN,EAAUthB,UAAU6hB,OAAS,WACzB,OAAO/hB,KAAKkjB,MAAMnB,UAWtBP,EAAUthB,UAAUyhB,iBAAmB,SAAUvC,GAC7C,OAAOpf,KAAKkjB,MAAMvB,iBAAiBvC,IAUvCoC,EAAUthB,UAAU0hB,iBAAmB,SAAUxC,GAC7C,OAAOpf,KAAKkjB,MAAMtB,iBAAiBxC,IAQvCoC,EAAUthB,UAAUmjB,YAAc,SAAUC,GACxC,OAAO,IAAI3C,GAAkB3gB,KAAKkjB,MAAO,KAAMljB,KAAKijB,aAAa,EAAOK,IAE5E9B,EAAUthB,UAAUqjB,gBAAkB,SAAU/a,EAAK8a,GACjD,OAAO,IAAI3C,GAAkB3gB,KAAKkjB,MAAO1a,EAAKxI,KAAKijB,aAAa,EAAOK,IAE3E9B,EAAUthB,UAAUsjB,uBAAyB,SAAUhb,EAAK8a,GACxD,OAAO,IAAI3C,GAAkB3gB,KAAKkjB,MAAO1a,EAAKxI,KAAKijB,aAAa,EAAMK,IAE1E9B,EAAUthB,UAAUujB,mBAAqB,SAAUH,GAC/C,OAAO,IAAI3C,GAAkB3gB,KAAKkjB,MAAO,KAAMljB,KAAKijB,aAAa,EAAMK,IAM3E9B,EAAUrD,WAAa,IAAI6E,GACpBxB,KAkBPkC,GAAQvR,KAAK1E,IAAI,GAIjBkW,GAA2B,WAI3B,SAASA,EAAU7hB,GACf,IAAyB8hB,EAIzB5jB,KAAK0hB,OAJoBkC,EAIH9hB,EAAS,EAHpB+Q,SAAUV,KAAK1E,IAAImW,GAAOF,GAAQ,KAI7C1jB,KAAK6jB,SAAW7jB,KAAK0hB,MAAQ,EAC7B,IAHwBzP,EAGpB6R,GAHoB7R,EAGLjS,KAAK0hB,MAHe7O,SAASpT,MAAMwS,EAAO,GAAGzN,KAAK,KAAM,IAI3ExE,KAAK+jB,MAASjiB,EAAS,EAAKgiB,EAWhC,OANAH,EAAUzjB,UAAU8jB,aAAe,WAE/B,IAAI9C,IAAWlhB,KAAK+jB,MAAS,GAAO/jB,KAAK6jB,UAEzC,OADA7jB,KAAK6jB,WACE3C,GAEJyC,KAiBPM,GAAgB,SAAUC,EAAW3O,EAAK4O,EAAOC,GACjDF,EAAU3S,KAAKgE,GACf,IAAI8O,EAAoB,SAAUC,EAAK1U,GACnC,IACI2U,EACA/b,EAFA1G,EAAS8N,EAAO0U,EAGpB,GAAc,GAAVxiB,EACA,OAAO,KAEN,GAAc,GAAVA,EAGL,OAFAyiB,EAAYL,EAAUI,GACtB9b,EAAM2b,EAAQA,EAAMI,GAAaA,EAC1B,IAAIlD,GAAS7Y,EAAK+b,EAAUjI,KAAM+E,GAAS0B,MAAO,KAAM,MAG/D,IAAIyB,EAAS3R,SAAU/Q,EAAS,EAAI,IAAMwiB,EACtCnP,EAAOkP,EAAkBC,EAAKE,GAC9BpP,EAAQiP,EAAkBG,EAAS,EAAG5U,GAG1C,OAFA2U,EAAYL,EAAUM,GACtBhc,EAAM2b,EAAQA,EAAMI,GAAaA,EAC1B,IAAIlD,GAAS7Y,EAAK+b,EAAUjI,KAAM+E,GAAS0B,MAAO5N,EAAMC,IA0CnEqP,EAvCmB,SAAUC,GAuB7B,IAtBA,IAAIpI,EAAO,KACPmI,EAAO,KACPtF,EAAQ+E,EAAUpiB,OAClB6iB,EAAe,SAAUC,EAAWtD,GACpC,IAAIgD,EAAMnF,EAAQyF,EACdhV,EAAOuP,EACXA,GAASyF,EACT,IAAIC,EAAYR,EAAkBC,EAAM,EAAG1U,GACvC2U,EAAYL,EAAUI,GACtB9b,EAAM2b,EAAQA,EAAMI,GAAaA,EACrCO,EAAc,IAAIzD,GAAS7Y,EAAK+b,EAAUjI,KAAMgF,EAAO,KAAMuD,KAE7DC,EAAgB,SAAUC,GACtBzI,GACAA,EAAKnH,KAAO4P,EACZzI,EAAOyI,IAGPN,EAAOM,EACPzI,EAAOyI,IAGNpiB,EAAI,EAAGA,EAAI+hB,EAAOhD,QAAS/e,EAAG,CACnC,IAAIqiB,EAAQN,EAAOV,eAEfY,EAAYzS,KAAKE,IAAI,EAAGqS,EAAOhD,OAAS/e,EAAI,IAC5CqiB,EACAL,EAAaC,EAAWvD,GAAS0B,QAIjC4B,EAAaC,EAAWvD,GAAS0B,OACjC4B,EAAaC,EAAWvD,GAASE,MAGzC,OAAOkD,EAGAQ,CADE,IAAItB,GAAUO,EAAUpiB,SAErC,OAAO,IAAI0f,GAAU4C,GAAa7O,EAAKkP,IAmBvCS,MAOAC,GAA0B,WAC1B,SAASA,EAASC,EAAUC,GACxBrlB,KAAKolB,SAAWA,EAChBplB,KAAKqlB,UAAYA,EA8IrB,OA5IA/lB,OAAOsI,eAAeud,EAAU,WAM5Btd,IAAK,WAKD,OAJA1F,EAAO+iB,IAAkB5E,GAAgB,uCACzCD,GACIA,IACI,IAAI8E,GAAW3F,YAAa0F,KAAoB1F,YAAac,MAGzElS,YAAY,EACZC,cAAc,IAOlB8W,EAASjlB,UAAU2H,IAAM,SAAUyd,GAC/B,IAAIC,EAAY/b,EAAQxJ,KAAKolB,SAAUE,GACvC,IAAKC,EACD,MAAM,IAAIhjB,MAAM,wBAA0B+iB,GAC9C,OAAIC,IAAcL,GAGP,KAGAK,GAOfJ,EAASjlB,UAAUslB,SAAW,SAAUC,GACpC,OAAOnc,EAAStJ,KAAKqlB,UAAWI,EAAgBhd,aAOpD0c,EAASjlB,UAAUwlB,SAAW,SAAUD,EAAiBE,GACrDxjB,EAAOsjB,IAAoBlI,GAAW,uEAKtC,IAJA,IAUIqI,EAVA1B,KACA2B,GAAkB,EAClBC,EAAOH,EAAiBtC,YAAYhH,GAAUE,MAC9Cvb,EAAO8kB,EAAK7E,UACTjgB,GACH6kB,EACIA,GAAmBJ,EAAgBtI,YAAYnc,EAAKsb,MACxD4H,EAAUniB,KAAKf,GACfA,EAAO8kB,EAAK7E,UAIZ2E,EADAC,EACW5B,GAAcC,EAAWuB,EAAgBhJ,cAGzCyI,GAEf,IAAIa,EAAYN,EAAgBhd,WAC5Bud,EAAcrc,EAAM3J,KAAKqlB,WAC7BW,EAAYD,GAAaN,EACzB,IAAIQ,EAAatc,EAAM3J,KAAKolB,UAE5B,OADAa,EAAWF,GAAaH,EACjB,IAAIT,EAASc,EAAYD,IAQpCb,EAASjlB,UAAUgmB,aAAe,SAAU3B,EAAWoB,GACnD,IAAIrf,EAAQtG,KAkCZ,OAAO,IAAImlB,EAjCMnb,EAAIhK,KAAKolB,SAAU,SAAUe,EAAiBJ,GAC3D,IAAI5G,EAAQ3V,EAAQlD,EAAM+e,UAAWU,GAErC,GADA5jB,EAAOgd,EAAO,oCAAsC4G,GAChDI,IAAoBjB,GAAgB,CAEpC,GAAI/F,EAAMhC,YAAYoH,EAAUjI,MAAO,CAKnC,IAHA,IAAI4H,KACA4B,EAAOH,EAAiBtC,YAAYhH,GAAUE,MAC9Cvb,EAAO8kB,EAAK7E,UACTjgB,GACCA,EAAK2G,MAAQ4c,EAAU5c,MACvBuc,EAAUniB,KAAKf,GAEnBA,EAAO8kB,EAAK7E,UAGhB,OADAiD,EAAUniB,KAAKwiB,GACRN,GAAcC,EAAW/E,EAAM1C,cAItC,OAAOyI,GAIX,IAAIkB,EAAeT,EAAiB9d,IAAI0c,EAAU5c,MAC9C0e,EAAcF,EAIlB,OAHIC,IACAC,EAAcA,EAAYtX,OAAO,IAAIsN,GAAUkI,EAAU5c,KAAMye,KAE5DC,EAAYrE,OAAOuC,EAAWA,EAAUjI,QAGvBtc,KAAKqlB,YAQzCF,EAASjlB,UAAUomB,kBAAoB,SAAU/B,EAAWoB,GAiBxD,OAAO,IAAIR,EAhBMnb,EAAIhK,KAAKolB,SAAU,SAAUe,GAC1C,GAAIA,IAAoBjB,GAEpB,OAAOiB,EAGP,IAAIC,EAAeT,EAAiB9d,IAAI0c,EAAU5c,MAClD,OAAIye,EACOD,EAAgBpX,OAAO,IAAIsN,GAAUkI,EAAU5c,KAAMye,IAIrDD,IAIanmB,KAAKqlB,YAElCF,KAkBX,SAASoB,GAAqBpR,EAAMC,GAChC,OAAOrE,GAAYoE,EAAKxN,KAAMyN,EAAMzN,MAExC,SAAS6e,GAAgBrR,EAAMC,GAC3B,OAAOrE,GAAYoE,EAAMC,GA4B7B,IAAIqR,GAA8B,WAQ9B,SAASA,EAAaC,EAAWxI,EAAeyI,GAC5C3mB,KAAK0mB,UAAYA,EACjB1mB,KAAKke,cAAgBA,EACrBle,KAAK2mB,UAAYA,EACjB3mB,KAAKoe,UAAY,KAMbpe,KAAKke,eACLN,GAAqB5d,KAAKke,eAE1Ble,KAAK0mB,UAAU7c,WACf1H,GAAQnC,KAAKke,eAAiBle,KAAKke,cAAcrU,UAAW,wCAuXpE,OApXAvK,OAAOsI,eAAe6e,EAAc,cAChC5e,IAAK,WACD,OAAQsW,KACHA,GAAa,IAAIsI,EAAa,IAAIjF,GAAUgF,IAAkB,KAAMrB,GAASyB,WAEtFxY,YAAY,EACZC,cAAc,IAGlBoY,EAAavmB,UAAU4d,WAAa,WAChC,OAAO,GAGX2I,EAAavmB,UAAU6d,YAAc,WACjC,OAAO/d,KAAKke,eAAiBC,IAGjCsI,EAAavmB,UAAUme,eAAiB,SAAUC,GAC9C,OAAIte,KAAK0mB,UAAU7c,UAER7J,KAGA,IAAIymB,EAAazmB,KAAK0mB,UAAWpI,EAAiBte,KAAK2mB,YAItEF,EAAavmB,UAAUqe,kBAAoB,SAAUC,GAEjD,GAAkB,cAAdA,EACA,OAAOxe,KAAK+d,cAGZ,IAAIrJ,EAAQ1U,KAAK0mB,UAAU7e,IAAI2W,GAC/B,OAAiB,OAAV9J,EAAiByJ,GAAazJ,GAI7C+R,EAAavmB,UAAUue,SAAW,SAAU9I,GACxC,IAAIqJ,EAAQrJ,EAAK3B,WACjB,OAAc,OAAVgL,EACOhf,KACJA,KAAKue,kBAAkBS,GAAOP,SAAS9I,EAAKzB,aAGvDuS,EAAavmB,UAAUwe,SAAW,SAAUF,GACxC,OAAyC,OAAlCxe,KAAK0mB,UAAU7e,IAAI2W,IAG9BiI,EAAavmB,UAAU2e,qBAAuB,SAAUL,EAAWM,GAE/D,GADA3c,EAAO2c,EAAc,8CACH,cAAdN,EACA,OAAOxe,KAAKqe,eAAeS,GAG3B,IAAIyF,EAAY,IAAIlI,GAAUmC,EAAWM,GACrCuH,OAAc,EAAQQ,OAAc,EAUxC,OATI/H,EAAajV,WACbwc,EAAcrmB,KAAK0mB,UAAU3X,OAAOyP,GACpCqI,EAAc7mB,KAAK2mB,UAAUL,kBAAkB/B,EAAWvkB,KAAK0mB,aAG/DL,EAAcrmB,KAAK0mB,UAAU1E,OAAOxD,EAAWM,GAC/C+H,EAAc7mB,KAAK2mB,UAAUT,aAAa3B,EAAWvkB,KAAK0mB,YAGvD,IAAID,EAAaJ,EADVA,EAAYxc,UAAYsU,GAAane,KAAKke,cACN2I,IAI1DJ,EAAavmB,UAAU6e,YAAc,SAAUpJ,EAAMmJ,GACjD,IAAIE,EAAQrJ,EAAK3B,WACjB,GAAc,OAAVgL,EACA,OAAOF,EAGP3c,EAA2B,cAApBwT,EAAK3B,YAAmD,IAArB2B,EAAK1B,YAAmB,8CAClE,IAAI6S,EAAoB9mB,KAAKue,kBAAkBS,GAAOD,YAAYpJ,EAAKzB,WAAY4K,GACnF,OAAO9e,KAAK6e,qBAAqBG,EAAO8H,IAIhDL,EAAavmB,UAAU2J,QAAU,WAC7B,OAAO7J,KAAK0mB,UAAU7c,WAG1B4c,EAAavmB,UAAU+e,YAAc,WACjC,OAAOjf,KAAK0mB,UAAUhF,SAG1B+E,EAAavmB,UAAUiO,IAAM,SAAUkR,GACnC,GAAIrf,KAAK6J,UACL,OAAO,KACX,IAAIN,KACAwd,EAAU,EAAGhF,EAAS,EAAGiF,GAAiB,EAW9C,GAVAhnB,KAAKkf,aAAaoB,GAAgB,SAAU9X,EAAKoW,GAC7CrV,EAAIf,GAAOoW,EAAUzQ,IAAIkR,GACzB0H,IACIC,GAAkBP,EAAazT,gBAAgBhM,KAAKwB,GACpDuZ,EAAS5P,KAAK4D,IAAIgM,EAAQrR,OAAOlI,IAGjCwe,GAAiB,KAGpB3H,GAAgB2H,GAAkBjF,EAAS,EAAIgF,EAAS,CAEzD,IAAIE,KACJ,IAAK,IAAIze,KAAOe,EACZ0d,EAAMze,GAAOe,EAAIf,GACrB,OAAOye,EAMP,OAHI5H,IAAiBrf,KAAK+d,cAAclU,YACpCN,EAAI,aAAevJ,KAAK+d,cAAc5P,OAEnC5E,GAIfkd,EAAavmB,UAAUuf,KAAO,WAC1B,GAAuB,OAAnBzf,KAAKoe,UAAoB,CACzB,IAAI8I,EAAW,GACVlnB,KAAK+d,cAAclU,YACpBqd,GACI,YACIvJ,GAAiB3d,KAAK+d,cAAc5P,OACpC,KACZnO,KAAKkf,aAAaoB,GAAgB,SAAU9X,EAAKoW,GAC7C,IAAIuI,EAAYvI,EAAUa,OACR,KAAd0H,IACAD,GAAY,IAAM1e,EAAM,IAAM2e,KAEtCnnB,KAAKoe,UAAyB,KAAb8I,EAAkB,GAAKxX,EAAKwX,GAEjD,OAAOlnB,KAAKoe,WAGhBqI,EAAavmB,UAAUye,wBAA0B,SAAUH,EAAWI,EAAWO,GAC7E,IAAIiI,EAAMpnB,KAAKqnB,cAAclI,GAC7B,GAAIiI,EAAK,CACL,IAAIE,EAAcF,EAAIjE,kBAAkB,IAAI9G,GAAUmC,EAAWI,IACjE,OAAO0I,EAAcA,EAAY3f,KAAO,KAGxC,OAAO3H,KAAK0mB,UAAUvD,kBAAkB3E,IAOhDiI,EAAavmB,UAAUqnB,kBAAoB,SAAU9B,GACjD,IAAI2B,EAAMpnB,KAAKqnB,cAAc5B,GAC7B,GAAI2B,EAAK,CACL,IAAItF,EAASsF,EAAItF,SACjB,OAAOA,GAAUA,EAAOna,KAGxB,OAAO3H,KAAK0mB,UAAU5E,UAO9B2E,EAAavmB,UAAUsnB,cAAgB,SAAU/B,GAC7C,IAAI3D,EAAS9hB,KAAKunB,kBAAkB9B,GACpC,OAAI3D,EACO,IAAIzF,GAAUyF,EAAQ9hB,KAAK0mB,UAAU7e,IAAIia,IAGzC,MAQf2E,EAAavmB,UAAUunB,iBAAmB,SAAUhC,GAChD,IAAI2B,EAAMpnB,KAAKqnB,cAAc5B,GAC7B,GAAI2B,EAAK,CACL,IAAIrF,EAASqF,EAAIrF,SACjB,OAAOA,GAAUA,EAAOpa,KAGxB,OAAO3H,KAAK0mB,UAAU3E,UAO9B0E,EAAavmB,UAAUwnB,aAAe,SAAUjC,GAC5C,IAAI1D,EAAS/hB,KAAKynB,iBAAiBhC,GACnC,OAAI1D,EACO,IAAI1F,GAAU0F,EAAQ/hB,KAAK0mB,UAAU7e,IAAIka,IAGzC,MAMf0E,EAAavmB,UAAUgf,aAAe,SAAUC,EAAOC,GACnD,IAAIgI,EAAMpnB,KAAKqnB,cAAclI,GAC7B,OAAIiI,EACOA,EAAIzF,iBAAiB,SAAUgG,GAClC,OAAOvI,EAAOuI,EAAYhgB,KAAMggB,EAAYrL,QAIzCtc,KAAK0mB,UAAU/E,iBAAiBvC,IAO/CqH,EAAavmB,UAAUmjB,YAAc,SAAUoC,GAC3C,OAAOzlB,KAAKujB,gBAAgBkC,EAAgBzI,UAAWyI,IAQ3DgB,EAAavmB,UAAUqjB,gBAAkB,SAAUqE,EAAWnC,GAC1D,IAAI2B,EAAMpnB,KAAKqnB,cAAc5B,GAC7B,GAAI2B,EACA,OAAOA,EAAI7D,gBAAgBqE,EAAW,SAAUpf,GAAO,OAAOA,IAK9D,IAFA,IAAInH,EAAWrB,KAAK0mB,UAAUnD,gBAAgBqE,EAAUjgB,KAAM0U,GAAUE,MACpEvb,EAAOK,EAAS+f,OACL,MAARpgB,GAAgBykB,EAAgB/I,QAAQ1b,EAAM4mB,GAAa,GAC9DvmB,EAAS4f,UACTjgB,EAAOK,EAAS+f,OAEpB,OAAO/f,GAOfolB,EAAavmB,UAAUujB,mBAAqB,SAAUgC,GAClD,OAAOzlB,KAAKwjB,uBAAuBiC,EAAgBrI,UAAWqI,IAOlEgB,EAAavmB,UAAUsjB,uBAAyB,SAAUqE,EAASpC,GAC/D,IAAI2B,EAAMpnB,KAAKqnB,cAAc5B,GAC7B,GAAI2B,EACA,OAAOA,EAAI5D,uBAAuBqE,EAAS,SAAUrf,GACjD,OAAOA,IAMX,IAFA,IAAInH,EAAWrB,KAAK0mB,UAAUlD,uBAAuBqE,EAAQlgB,KAAM0U,GAAUE,MACzEvb,EAAOK,EAAS+f,OACL,MAARpgB,GAAgBykB,EAAgB/I,QAAQ1b,EAAM6mB,GAAW,GAC5DxmB,EAAS4f,UACTjgB,EAAOK,EAAS+f,OAEpB,OAAO/f,GAMfolB,EAAavmB,UAAUyf,UAAY,SAAUlK,GACzC,OAAIzV,KAAK6J,UACD4L,EAAM5L,UACC,GAGC,EAGP4L,EAAMqI,cAAgBrI,EAAM5L,UAC1B,EAEF4L,IAAUqS,IACP,EAID,GAMfrB,EAAavmB,UAAUigB,UAAY,SAAUsF,GACzC,GAAIA,IAAoBlI,IACpBvd,KAAK2mB,UAAUnB,SAASC,GACxB,OAAOzlB,KAGP,IAAI6mB,EAAc7mB,KAAK2mB,UAAUjB,SAASD,EAAiBzlB,KAAK0mB,WAChE,OAAO,IAAID,EAAazmB,KAAK0mB,UAAW1mB,KAAKke,cAAe2I,IAMpEJ,EAAavmB,UAAUkgB,UAAY,SAAUjB,GACzC,OAAOA,IAAU5B,IAAavd,KAAK2mB,UAAUnB,SAASrG,IAK1DsH,EAAavmB,UAAUsV,OAAS,SAAUC,GACtC,GAAIA,IAAUzV,KACV,OAAO,EAEN,GAAIyV,EAAMqI,aACX,OAAO,EAGP,IAAIiK,EAAoBtS,EACxB,GAAKzV,KAAK+d,cAAcvI,OAAOuS,EAAkBhK,eAG5C,CAAA,GAAI/d,KAAK0mB,UAAUhF,UAAYqG,EAAkBrB,UAAUhF,QAAS,CAKrE,IAJA,IAAIsG,EAAWhoB,KAAKqjB,YAAY/C,IAC5B2H,EAAYF,EAAkB1E,YAAY/C,IAC1C4H,EAAcF,EAAS/G,UACvBkH,EAAeF,EAAUhH,UACtBiH,GAAeC,GAAc,CAChC,GAAID,EAAYvgB,OAASwgB,EAAaxgB,OACjCugB,EAAY5L,KAAK9G,OAAO2S,EAAa7L,MACtC,OAAO,EAEX4L,EAAcF,EAAS/G,UACvBkH,EAAeF,EAAUhH,UAE7B,OAAuB,OAAhBiH,GAAyC,OAAjBC,EAG/B,OAAO,EAlBP,OAAO,GA8BnB1B,EAAavmB,UAAUmnB,cAAgB,SAAU5B,GAC7C,OAAIA,IAAoBlI,GACb,KAGAvd,KAAK2mB,UAAU9e,IAAI4d,EAAgBhd,aAOlDge,EAAazT,gBAAkB,iBACxByT,KAwCPqB,GAAa,IAjCY,SAAUvd,GAEnC,SAAS6d,IACL,OAAO7d,EAAO7I,KAAK1B,KAAM,IAAIwhB,GAAUgF,IAAkBC,GAAatI,WAAYgH,GAASyB,UAAY5mB,KAuB3G,OAzBAF,EAAUsoB,EAAS7d,GAInB6d,EAAQloB,UAAUyf,UAAY,SAAUlK,GACpC,OAAIA,IAAUzV,KACH,EAGA,GAGfooB,EAAQloB,UAAUsV,OAAS,SAAUC,GAEjC,OAAOA,IAAUzV,MAErBooB,EAAQloB,UAAU6d,YAAc,WAC5B,OAAO/d,MAEXooB,EAAQloB,UAAUqe,kBAAoB,SAAUC,GAC5C,OAAOiI,GAAatI,YAExBiK,EAAQloB,UAAU2J,QAAU,WACxB,OAAO,GAEJue,GACT3B,KAOFnnB,OAAO+oB,iBAAiBhM,IACpBY,KACIrb,MAAO,IAAIya,GAAUxL,GAAU4V,GAAatI,aAEhDmK,KACI1mB,MAAO,IAAIya,GAAUvL,GAAUgX,OAMvC5K,GAASpF,aAAe2O,GAAatI,WACrCH,GAASR,0BAA4BiJ,GAjyDjC1O,GAkyDO+P,GA3+CX,SAAsB3Z,GAClBuP,GAAavP,EA2+CjBoa,CAAaT,IAiBb,IAAIU,IAAY,EAQhB,SAASC,GAAeC,EAAM7O,GAE1B,QADiB,IAAbA,IAAuBA,EAAW,MACzB,OAAT6O,EACA,OAAOjC,GAAatI,WAaxB,GAXoB,iBAATuK,GAAqB,cAAeA,IAC3C7O,EAAW6O,EAAK,cAEpBvmB,EAAoB,OAAb0X,GACiB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAASA,EAAW,uCAAyCA,GAC9E,iBAAT6O,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACrDA,EAAOA,EAAK,WAGI,iBAATA,GAAqB,QAASA,EAErC,OAAO,IAAI1K,GADI0K,EACeD,GAAe5O,IAEjD,GAAM6O,aAAgBjpB,QAAU+oB,GA2B3B,CACD,IAAIG,EAASlC,GAAatI,WACtByK,EAAYF,EAWhB,OAVAjf,EAAQmf,EAAW,SAAUpgB,EAAKqgB,GAC9B,GAAIvf,EAASsf,EAAWpgB,IACQ,MAAxBA,EAAIoJ,UAAU,EAAG,GAAY,CAE7B,IAAIgN,EAAY6J,GAAeI,IAC3BjK,EAAUd,cAAiBc,EAAU/U,YACrC8e,EAASA,EAAO9J,qBAAqBrW,EAAKoW,OAInD+J,EAAOtK,eAAeoK,GAAe5O,IAvC5C,IAAIiP,KACAC,GAAyB,EACzBC,EAAiBN,EAYrB,GAXAjf,EAAQuf,EAAgB,SAAUxgB,EAAKkM,GACnC,GAAmB,iBAARlM,GAA4C,MAAxBA,EAAIoJ,UAAU,EAAG,GAAY,CAExD,IAAIgN,EAAY6J,GAAeO,EAAexgB,IACzCoW,EAAU/U,YACXkf,EACIA,IAA2BnK,EAAUb,cAAclU,UACvDif,EAAW/mB,KAAK,IAAIsa,GAAU7T,EAAKoW,QAItB,GAArBkK,EAAWhnB,OACX,OAAO2kB,GAAatI,WAExB,IAAI8K,EAAWhF,GAAc6E,EAAYvC,GAAsB,SAAUhC,GAAa,OAAOA,EAAU5c,MAAS6e,IAChH,GAAIuC,EAAwB,CACxB,IAAIG,EAAiBjF,GAAc6E,EAAYxI,GAAe7D,cAC9D,OAAO,IAAIgK,GAAawC,EAAUR,GAAe5O,GAAW,IAAIsL,IAAW3F,YAAa0J,IAAoB1J,YAAac,MAGzH,OAAO,IAAImG,GAAawC,EAAUR,GAAe5O,GAAWsL,GAASyB,UApjDjF,SAAyBzY,GACrBsP,GAAetP,EAskDnBgb,CAAgBV,IAsBhB,IAwnBIW,GAi1BAC,GA/4CAC,GAAc,IA1Dc,SAAU/e,GAEtC,SAASgf,IACL,OAAkB,OAAXhf,GAAmBA,EAAO/C,MAAMxH,KAAMyH,YAAczH,KAqD/D,OAvDAF,EAAUypB,EAAYhf,GAOtBgf,EAAWrpB,UAAUwc,QAAU,SAAUrR,EAAG1L,GACxC,IAAI+gB,EAAWrV,EAAEiR,KAAKqD,UAAUhgB,EAAE2c,MAClC,OAAiB,IAAboE,EACO3P,GAAY1F,EAAE1D,KAAMhI,EAAEgI,MAGtB+Y,GAMf6I,EAAWrpB,UAAUid,YAAc,SAAUb,GACzC,OAAO,GAKXiN,EAAWrpB,UAAUyc,oBAAsB,SAAUC,EAASC,GAC1D,OAAQD,EAAQpH,OAAOqH,IAK3B0M,EAAWrpB,UAAU8c,QAAU,WAC3B,OAAOX,GAAUY,KAKrBsM,EAAWrpB,UAAUkd,QAAU,WAC3B,OAAOf,GAAUiM,KAOrBiB,EAAWrpB,UAAUmd,SAAW,SAAUC,EAAY3V,GAClD,IAAI6hB,EAAYf,GAAenL,GAC/B,OAAO,IAAIjB,GAAU1U,EAAM6hB,IAK/BD,EAAWrpB,UAAUuI,SAAW,WAC5B,MAAO,UAEJ8gB,GACT/M,KAuBEiN,GAA2B,SAAUlf,GAErC,SAASkf,EAAUC,GACf,IAAIpjB,EAAQiE,EAAO7I,KAAK1B,OAASA,KAGjC,OAFAsG,EAAMojB,WAAaA,EACnBvnB,GAAQunB,EAAW7f,WAAuC,cAA1B6f,EAAW1V,WAA4B,2DAChE1N,EAmDX,OAxDAxG,EAAU2pB,EAAWlf,GAYrBkf,EAAUvpB,UAAUypB,aAAe,SAAUC,GACzC,OAAOA,EAAKnL,SAASze,KAAK0pB,aAK9BD,EAAUvpB,UAAUid,YAAc,SAAUb,GACxC,OAAQA,EAAKmC,SAASze,KAAK0pB,YAAY7f,WAK3C4f,EAAUvpB,UAAUwc,QAAU,SAAUrR,EAAG1L,GACvC,IAAIkqB,EAAS7pB,KAAK2pB,aAAate,EAAEiR,MAC7BwN,EAAS9pB,KAAK2pB,aAAahqB,EAAE2c,MAC7BoE,EAAWmJ,EAAOlK,UAAUmK,GAChC,OAAiB,IAAbpJ,EACO3P,GAAY1F,EAAE1D,KAAMhI,EAAEgI,MAGtB+Y,GAMf+I,EAAUvpB,UAAUmd,SAAW,SAAUC,EAAY3V,GACjD,IAAI6hB,EAAYf,GAAenL,GAC3BhB,EAAOmK,GAAatI,WAAWY,YAAY/e,KAAK0pB,WAAYF,GAChE,OAAO,IAAInN,GAAU1U,EAAM2U,IAK/BmN,EAAUvpB,UAAUkd,QAAU,WAC1B,IAAId,EAAOmK,GAAatI,WAAWY,YAAY/e,KAAK0pB,WAAY5B,IAChE,OAAO,IAAIzL,GAAUvL,GAAUwL,IAKnCmN,EAAUvpB,UAAUuI,SAAW,WAC3B,OAAOzI,KAAK0pB,WAAWhhB,QAAQlE,KAAK,MAEjCilB,GACTjN,IAqBEuN,GAA8B,WAM9B,SAASA,EAAaC,EAAOC,EAAMC,GAC/BlqB,KAAKgqB,MAAQA,EACbhqB,KAAKiqB,KAAOA,EACZjqB,KAAKkqB,OAASA,EAsIlB,OA9HAH,EAAa7pB,UAAUiO,IAAM,WAEzB,OADAtC,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QAC9C9B,KAAKgqB,MAAM7b,OAOtB4b,EAAa7pB,UAAUiqB,UAAY,WAE/B,OADAte,EAAiB,yBAA0B,EAAG,EAAGpE,UAAU3F,QACpD9B,KAAKgqB,MAAM7b,KAAI,IAI1B4b,EAAa7pB,UAAU8b,OAAS,WAG5B,OADAnQ,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU3F,QACjD9B,KAAKmqB,aAOhBJ,EAAa7pB,UAAUkqB,OAAS,WAE5B,OADAve,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU3F,SAChD9B,KAAKgqB,MAAMngB,WAQvBkgB,EAAa7pB,UAAUwU,MAAQ,SAAU2V,GACrCxe,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU3F,QAEvDuoB,EAAkBtlB,OAAOslB,GACzBxP,GAAmB,qBAAsB,EAAGwP,GAAiB,GAC7D,IAAIC,EAAY,IAAI5W,GAAK2W,GACrBE,EAAWvqB,KAAKiqB,KAAKvV,MAAM4V,GAC/B,OAAO,IAAIP,EAAa/pB,KAAKgqB,MAAMvL,SAAS6L,GAAYC,EAAUjK,KAQtEyJ,EAAa7pB,UAAUwe,SAAW,SAAU2L,GACxCxe,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU3F,QAC1D+Y,GAAmB,wBAAyB,EAAGwP,GAAiB,GAChE,IAAIC,EAAY,IAAI5W,GAAK2W,GACzB,OAAQrqB,KAAKgqB,MAAMvL,SAAS6L,GAAWzgB,WAO3CkgB,EAAa7pB,UAAU6d,YAAc,WAGjC,OAFAlS,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU3F,QAEtD9B,KAAKgqB,MAAMjM,cAAc5P,OAUpC4b,EAAa7pB,UAAUuJ,QAAU,SAAU2V,GACvC,IAAI9Y,EAAQtG,KAGZ,OAFA6L,EAAiB,uBAAwB,EAAG,EAAGpE,UAAU3F,QACzDyK,EAAiB,uBAAwB,EAAG6S,GAAQ,IAChDpf,KAAKgqB,MAAMlM,gBAEI9d,KAAKgqB,MAEF9K,aAAalf,KAAKkqB,OAAQ,SAAU1hB,EAAK8T,GAC3D,OAAO8C,EAAO,IAAI2K,EAAazN,EAAMhW,EAAM2jB,KAAKvV,MAAMlM,GAAM8X,QAOpEyJ,EAAa7pB,UAAUsqB,YAAc,WAEjC,OADA3e,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU3F,SACzD9B,KAAKgqB,MAAMlM,eAGH9d,KAAKgqB,MAAMngB,WAE3BvK,OAAOsI,eAAemiB,EAAa7pB,UAAW,OAC1C2H,IAAK,WACD,OAAO7H,KAAKiqB,KAAKQ,UAErBrc,YAAY,EACZC,cAAc,IAMlB0b,EAAa7pB,UAAU+e,YAAc,WAEjC,OADApT,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU3F,QACtD9B,KAAKgqB,MAAM/K,eAKtB8K,EAAa7pB,UAAUwqB,OAAS,WAE5B,OADA7e,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QAC9C9B,KAAKiqB,MAEhB3qB,OAAOsI,eAAemiB,EAAa7pB,UAAW,OAC1C2H,IAAK,WACD,OAAO7H,KAAK0qB,UAEhBtc,YAAY,EACZC,cAAc,IAEX0b,KAsBPY,GAA2B,WAO3B,SAASA,EAAUhQ,EAAWiQ,EAAmB7O,EAAU8O,GACvD7qB,KAAK2a,UAAYA,EACjB3a,KAAK4qB,kBAAoBA,EACzB5qB,KAAK+b,SAAWA,EAChB/b,KAAK6qB,SAAWA,EAoCpB,OA/BAF,EAAUzqB,UAAU4qB,QAAU,WAC1B,IAAIC,EAAM/qB,KAAK+b,SAAS2O,SACxB,MAAuB,UAAnB1qB,KAAK2a,UACEoQ,EAAIpV,KAGJoV,EAAIC,YAAYrV,MAM/BgV,EAAUzqB,UAAU+qB,aAAe,WAC/B,OAAOjrB,KAAK2a,WAKhBgQ,EAAUzqB,UAAUgrB,eAAiB,WACjC,OAAOlrB,KAAK4qB,kBAAkBM,eAAelrB,OAKjD2qB,EAAUzqB,UAAUuI,SAAW,WAC3B,OAAQzI,KAAK8qB,UAAUriB,WACnB,IACAzI,KAAK2a,UACL,IACA7R,EAAU9I,KAAK+b,SAASoO,cAEzBQ,KAEPQ,GAA6B,WAM7B,SAASA,EAAYP,EAAmBjlB,EAAOgQ,GAC3C3V,KAAK4qB,kBAAoBA,EACzB5qB,KAAK2F,MAAQA,EACb3F,KAAK2V,KAAOA,EA0BhB,OArBAwV,EAAYjrB,UAAU4qB,QAAU,WAC5B,OAAO9qB,KAAK2V,MAKhBwV,EAAYjrB,UAAU+qB,aAAe,WACjC,MAAO,UAKXE,EAAYjrB,UAAUgrB,eAAiB,WACnC,OAAOlrB,KAAK4qB,kBAAkBM,eAAelrB,OAKjDmrB,EAAYjrB,UAAUuI,SAAW,WAC7B,OAAOzI,KAAK2V,KAAKlN,WAAa,WAE3B0iB,KAqBPC,GAAwC,WAMxC,SAASA,EAAuBC,EAAWC,EAAiBC,GACxDvrB,KAAKqrB,UAAYA,EACjBrrB,KAAKsrB,gBAAkBA,EACvBtrB,KAAKurB,SAAWA,EAmEpB,OA9DAH,EAAuBlrB,UAAUsrB,WAAa,SAAU7Q,GACpD,MAAqB,UAAdA,GAKXyQ,EAAuBlrB,UAAUurB,YAAc,SAAUC,EAAQC,GAC7D,IAAIxM,EAAQwM,EAAMC,iBAAiBC,WACnC,OAAO,IAAIlB,GAAU,QAAS3qB,KAAM,IAAI+pB,GAAa2B,EAAOI,aAAcH,EAAMjB,SAAUvL,KAK9FiM,EAAuBlrB,UAAUgrB,eAAiB,SAAUa,GACxD,IAAIC,EAAMhsB,KAAKurB,SACf,GAAiC,WAA7BQ,EAAUd,eAA6B,CACvC9oB,EAAOnC,KAAKsrB,gBAAiB,gEAC7B,IAAIW,EAAajsB,KAAKsrB,gBACtB,OAAO,WAEHW,EAAWvqB,KAAKsqB,EAAKD,EAAUpmB,QAInC,IAAIumB,EAAOlsB,KAAKqrB,UAChB,OAAO,WACHa,EAAKxqB,KAAKsqB,EAAKD,EAAUhQ,YAOrCqP,EAAuBlrB,UAAUisB,kBAAoB,SAAUxmB,EAAOgQ,GAClE,OAAI3V,KAAKsrB,gBACE,IAAIH,GAAYnrB,KAAM2F,EAAOgQ,GAG7B,MAMfyV,EAAuBlrB,UAAUksB,QAAU,SAAU3W,GACjD,OAAMA,aAAiB2V,KAGb3V,EAAM4V,YAAcrrB,KAAKqrB,WAKvB5V,EAAM4V,YAAcrrB,KAAKqrB,WAAa5V,EAAM8V,WAAavrB,KAAKurB,WAM9EH,EAAuBlrB,UAAUmsB,eAAiB,WAC9C,OAA0B,OAAnBrsB,KAAKqrB,WAETD,KAWPkB,GAAwC,WAMxC,SAASA,EAAuBC,EAAYjB,EAAiBC,GACzDvrB,KAAKusB,WAAaA,EAClBvsB,KAAKsrB,gBAAkBA,EACvBtrB,KAAKurB,SAAWA,EAyFpB,OApFAe,EAAuBpsB,UAAUsrB,WAAa,SAAU7Q,GACpD,IAAI6R,EAA6B,mBAAd7R,EAAiC,cAAgBA,EAGpE,OAFA6R,EACqB,qBAAjBA,EAAsC,gBAAkBA,EACrDljB,EAAStJ,KAAKusB,WAAYC,IAKrCF,EAAuBpsB,UAAUisB,kBAAoB,SAAUxmB,EAAOgQ,GAClE,OAAI3V,KAAKsrB,gBACE,IAAIH,GAAYnrB,KAAM2F,EAAOgQ,GAG7B,MAMf2W,EAAuBpsB,UAAUurB,YAAc,SAAUC,EAAQC,GAC7DxpB,EAA2B,MAApBupB,EAAOlN,UAAmB,yCACjC,IAAIuM,EAAMY,EAAMjB,SAAShW,MAA8BgX,EAAgB,WACnEvM,EAAQwM,EAAMC,iBAAiBC,WACnC,OAAO,IAAIlB,GAAUe,EAAOpU,KAAMtX,KAAM,IAAI+pB,GAAa2B,EAAOI,aAAcf,EAAK5L,GAAQuM,EAAOb,WAKtGyB,EAAuBpsB,UAAUgrB,eAAiB,SAAUa,GACxD,IAAIC,EAAMhsB,KAAKurB,SACf,GAAiC,WAA7BQ,EAAUd,eAA6B,CACvC9oB,EAAOnC,KAAKsrB,gBAAiB,gEAC7B,IAAImB,EAAazsB,KAAKsrB,gBACtB,OAAO,WAEHmB,EAAW/qB,KAAKsqB,EAAKD,EAAUpmB,QAInC,IAAI+mB,EAAO1sB,KAAKusB,WAAWR,EAAUpR,WACrC,OAAO,WACH+R,EAAKhrB,KAAKsqB,EAAKD,EAAUhQ,SAAUgQ,EAAUlB,YAOzDyB,EAAuBpsB,UAAUksB,QAAU,SAAU3W,GACjD,GAAIA,aAAiB6W,EAAwB,CACzC,IAAKtsB,KAAKusB,aAAe9W,EAAM8W,WAC3B,OAAO,EAEN,GAAIvsB,KAAKurB,WAAa9V,EAAM8V,SAAU,CACvC,IAAIoB,EAAa7iB,EAAS2L,EAAM8W,YAEhC,GAAII,IADY7iB,EAAS9J,KAAKusB,YACA,CAI1B,GAAmB,IAAfI,EAAkB,CAClB,IAAIC,EAAkCviB,EAAUoL,EAAM8W,YAClDM,EAAiCxiB,EAAUrK,KAAKusB,YACpD,QAAQM,IAAYD,GACdnX,EAAM8W,WAAWK,IACd5sB,KAAKusB,WAAWM,IACjBpX,EAAM8W,WAAWK,KAAc5sB,KAAKusB,WAAWM,IAIvD,OFtlHZ,SAAUtjB,EAAKG,GACvB,IAAK,IAAIlB,KAAOe,EACZ,GAAIjK,OAAOY,UAAUL,eAAe6B,KAAK6H,EAAKf,KACrCkB,EAAGlB,EAAKe,EAAIf,IACb,OAAO,EAInB,OAAO,EE8kHoBskB,CAAM9sB,KAAKusB,WAAY,SAAU5R,EAAWoS,GAAM,OAAOtX,EAAM8W,WAAW5R,KAAeoS,MAKhH,OAAO,GAKXT,EAAuBpsB,UAAUmsB,eAAiB,WAC9C,OAA2B,OAApBrsB,KAAKusB,YAETD,KAyBPU,GAAuB,WACvB,SAASA,EAAMC,EAAMtX,EAAMuX,EAAcC,GACrCntB,KAAKitB,KAAOA,EACZjtB,KAAK2V,KAAOA,EACZ3V,KAAKktB,aAAeA,EACpBltB,KAAKmtB,eAAiBA,EA6c1B,OA3cA7tB,OAAOsI,eAAeolB,EAAO,0BACzBnlB,IAAK,WAED,OADA1F,EAAOinB,GAAwB,oCACxBA,IAEXlb,IAAK,SAAUC,GACXib,GAAyBjb,GAE7BC,YAAY,EACZC,cAAc,IAOlB2e,EAAMI,wBAA0B,SAAU7V,GACtC,IAAI8V,EAAY,KACZC,EAAU,KAOd,GANI/V,EAAOgW,aACPF,EAAY9V,EAAOiW,sBAEnBjW,EAAOkW,WACPH,EAAU/V,EAAOmW,oBAEjBnW,EAAOsU,aAAetO,GAAW,CACjC,IAAIoQ,EAAmB,mGAEnBC,EAAoB,wGAExB,GAAIrW,EAAOgW,WAAY,CAEnB,GADgBhW,EAAOsW,qBACNhd,GACb,MAAM,IAAItO,MAAMorB,GAEf,GAAyB,iBAAdN,EACZ,MAAM,IAAI9qB,MAAMqrB,GAGxB,GAAIrW,EAAOkW,SAAU,CAEjB,GADclW,EAAOuW,mBACNhd,GACX,MAAM,IAAIvO,MAAMorB,GAEf,GAAuB,iBAAZL,EACZ,MAAM,IAAI/qB,MAAMqrB,SAIvB,GAAIrW,EAAOsU,aAAevL,IAC3B,GAAkB,MAAb+M,IAAsBzT,GAAgByT,IAC3B,MAAXC,IAAoB1T,GAAgB0T,GACrC,MAAM,IAAI/qB,MAAM,sKAOpB,GAFAJ,EAAOoV,EAAOsU,qBAAsBpC,IAChClS,EAAOsU,aAAevC,GAAa,uBACrB,MAAb+D,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAC3B,MAAM,IAAI/qB,MAAM,0FAU5ByqB,EAAMe,eAAiB,SAAUxW,GAC7B,GAAIA,EAAOgW,YACPhW,EAAOkW,UACPlW,EAAOyW,aACNzW,EAAO0W,mBACR,MAAM,IAAI1rB,MAAM,uGAQxByqB,EAAM9sB,UAAUguB,+BAAiC,SAAUpiB,GACvD,IAA4B,IAAxB9L,KAAKmtB,eACL,MAAM,IAAI5qB,MAAMuJ,EAAS,gDAMjCkhB,EAAM9sB,UAAU0rB,eAAiB,WAC7B,OAAO5rB,KAAKktB,cAKhBF,EAAM9sB,UAAUwqB,OAAS,WAKrB,OAJA7e,EAAiB,YAAa,EAAG,EAAGpE,UAAU3F,QAIvC,IAAIkrB,EAAM5D,uBAAuBppB,KAAKitB,KAAMjtB,KAAK2V,OAS5DqX,EAAM9sB,UAAUiuB,GAAK,SAAUxT,EAAW/T,EAAUwnB,EAAyB3hB,GACzEZ,EAAiB,WAAY,EAAG,EAAGpE,UAAU3F,QAC7C4Y,GAAkB,WAAY,EAAGC,GAAW,GAC5CpO,EAAiB,WAAY,EAAG3F,GAAU,GAC1C,IAAIynB,EAAMrB,EAAMsB,yBAAyB,WAAYF,EAAyB3hB,GAC9E,GAAkB,UAAdkO,EACA3a,KAAKuuB,aAAa3nB,EAAUynB,EAAIlT,OAAQkT,EAAI5hB,aAE3C,CACD,IAAI+hB,KACJA,EAAU7T,GAAa/T,EACvB5G,KAAKyuB,aAAaD,EAAWH,EAAIlT,OAAQkT,EAAI5hB,SAEjD,OAAO7F,GAQXomB,EAAM9sB,UAAUquB,aAAe,SAAU3nB,EAAU8nB,EAAgBjiB,GAC/D,IAAIkiB,EAAY,IAAIvD,GAAuBxkB,EAAU8nB,GAAkB,KAAMjiB,GAAW,MACxFzM,KAAKitB,KAAK2B,yBAAyB5uB,KAAM2uB,IAQ7C3B,EAAM9sB,UAAUuuB,aAAe,SAAUD,EAAWE,EAAgBjiB,GAChE,IAAIkiB,EAAY,IAAIrC,GAAuBkC,EAAWE,EAAgBjiB,GACtEzM,KAAKitB,KAAK2B,yBAAyB5uB,KAAM2uB,IAO7C3B,EAAM9sB,UAAU2uB,IAAM,SAAUlU,EAAW/T,EAAU6F,GACjDZ,EAAiB,YAAa,EAAG,EAAGpE,UAAU3F,QAC9C4Y,GAAkB,YAAa,EAAGC,GAAW,GAC7CpO,EAAiB,YAAa,EAAG3F,GAAU,GAC3C4F,EAAsB,YAAa,EAAGC,GAAS,GAC/C,IAAIkiB,EAAY,KACZH,EAAY,KACE,UAAd7T,EAEAgU,EAAY,IAAIvD,GADIxkB,GAAY,KACsB,KAAM6F,GAAW,MAElEkO,IACD/T,KACA4nB,MACU7T,GAAa/T,GAE3B+nB,EAAY,IAAIrC,GAAuBkC,EAAW,KAAM/hB,GAAW,OAEvEzM,KAAKitB,KAAK6B,4BAA4B9uB,KAAM2uB,IAUhD3B,EAAM9sB,UAAU6uB,KAAO,SAAUpU,EAAWqU,EAAcC,EAAiBxiB,GACvE,IAAInG,EAAQtG,KACZ6L,EAAiB,aAAc,EAAG,EAAGpE,UAAU3F,QAC/C4Y,GAAkB,aAAc,EAAGC,GAAW,GAC9CpO,EAAiB,aAAc,EAAGyiB,GAAc,GAChD,IAAIX,EAAMrB,EAAMsB,yBAAyB,aAAcW,EAAiBxiB,GAKpEyiB,GAAY,EACZ7T,EAAW,IAAIhV,EAEnBgV,EAAS9U,QAAQM,MAAM,cACvB,IAAIsoB,EAAe,SAAUpT,GAGrBmT,IACAA,GAAY,EACZ5oB,EAAMuoB,IAAIlU,EAAWwU,GACjBH,GACAA,EAAa3e,KAAKge,EAAI5hB,QAAtBuiB,CAA+BjT,GAEnCV,EAAS5U,QAAQsV,KAUzB,OAPA/b,KAAKmuB,GAAGxT,EAAWwU,EACP,SAAUznB,GAClBpB,EAAMuoB,IAAIlU,EAAWwU,GACjBd,EAAIlT,QACJkT,EAAIlT,OAAO9K,KAAKge,EAAI5hB,QAApB4hB,CAA6B3mB,GACjC2T,EAAS3U,OAAOgB,KAEb2T,EAAS9U,SAOpBymB,EAAM9sB,UAAUkvB,aAAe,SAAUC,GAErC,GADAxjB,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU3F,QAClC,iBAAVutB,GACPld,KAAKI,MAAM8c,KAAWA,GACtBA,GAAS,EACT,MAAM,IAAI9sB,MAAM,kEAEpB,GAAIvC,KAAKktB,aAAac,WAClB,MAAM,IAAIzrB,MAAM,uGAGpB,OAAO,IAAIyqB,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM3V,KAAKktB,aAAakC,aAAaC,GAAQrvB,KAAKmtB,iBAOvFH,EAAM9sB,UAAUovB,YAAc,SAAUD,GAEpC,GADAxjB,EAAiB,oBAAqB,EAAG,EAAGpE,UAAU3F,QACjC,iBAAVutB,GACPld,KAAKI,MAAM8c,KAAWA,GACtBA,GAAS,EACT,MAAM,IAAI9sB,MAAM,iEAEpB,GAAIvC,KAAKktB,aAAac,WAClB,MAAM,IAAIzrB,MAAM,sGAGpB,OAAO,IAAIyqB,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM3V,KAAKktB,aAAaoC,YAAYD,GAAQrvB,KAAKmtB,iBAOtFH,EAAM9sB,UAAUqvB,aAAe,SAAU5Z,GAErC,GADA9J,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU3F,QAC1C,SAAT6T,EACA,MAAM,IAAIpT,MAAM,2EAEf,GAAa,cAAToT,EACL,MAAM,IAAIpT,MAAM,qFAEf,GAAa,WAAToT,EACL,MAAM,IAAIpT,MAAM,+EAEpBsY,GAAmB,qBAAsB,EAAGlF,GAAM,GAClD3V,KAAKkuB,+BAA+B,sBACpC,IAAIsB,EAAa,IAAI9b,GAAKiC,GAC1B,GAAI6Z,EAAW3lB,UACX,MAAM,IAAItH,MAAM,qFAEpB,IAAI4c,EAAQ,IAAIsK,GAAU+F,GACtBC,EAAYzvB,KAAKktB,aAAawC,QAAQvQ,GAE1C,OADA6N,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM8Z,GAA8B,IAMzEzC,EAAM9sB,UAAUyvB,WAAa,WACzB9jB,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QACrD9B,KAAKkuB,+BAA+B,oBACpC,IAAIuB,EAAYzvB,KAAKktB,aAAawC,QAAQnS,IAE1C,OADAyP,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM8Z,GAA8B,IAMzEzC,EAAM9sB,UAAU0vB,gBAAkB,WAC9B/jB,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU3F,QAC1D9B,KAAKkuB,+BAA+B,yBACpC,IAAIuB,EAAYzvB,KAAKktB,aAAawC,QAAQpP,IAE1C,OADA0M,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM8Z,GAA8B,IAMzEzC,EAAM9sB,UAAU2vB,aAAe,WAC3BhkB,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU3F,QACvD9B,KAAKkuB,+BAA+B,sBACpC,IAAIuB,EAAYzvB,KAAKktB,aAAawC,QAAQpG,IAE1C,OADA0D,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM8Z,GAA8B,IAOzEzC,EAAM9sB,UAAU4vB,QAAU,SAAUluB,EAAO+F,QACzB,IAAV/F,IAAoBA,EAAQ,MAChCiK,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU3F,QAClDgY,GAAwB,gBAAiB,EAAGlY,EAAO5B,KAAK2V,MAAM,GAC9DiF,GAAY,gBAAiB,EAAGjT,GAAM,GACtC,IAAI8nB,EAAYzvB,KAAKktB,aAAa4C,QAAQluB,EAAO+F,GAGjD,GAFAqlB,EAAMe,eAAe0B,GACrBzC,EAAMI,wBAAwBqC,GAC1BzvB,KAAKktB,aAAaK,WAClB,MAAM,IAAIhrB,MAAM,0FAQpB,YAJc4D,IAAVvE,IACAA,EAAQ,KACR+F,EAAO,MAEJ,IAAIqlB,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM8Z,EAAWzvB,KAAKmtB,iBAO3DH,EAAM9sB,UAAU6vB,MAAQ,SAAUnuB,EAAO+F,QACvB,IAAV/F,IAAoBA,EAAQ,MAChCiK,EAAiB,cAAe,EAAG,EAAGpE,UAAU3F,QAChDgY,GAAwB,cAAe,EAAGlY,EAAO5B,KAAK2V,MAAM,GAC5DiF,GAAY,cAAe,EAAGjT,GAAM,GACpC,IAAI8nB,EAAYzvB,KAAKktB,aAAa6C,MAAMnuB,EAAO+F,GAG/C,GAFAqlB,EAAMe,eAAe0B,GACrBzC,EAAMI,wBAAwBqC,GAC1BzvB,KAAKktB,aAAaO,SAClB,MAAM,IAAIlrB,MAAM,oFAGpB,OAAO,IAAIyqB,EAAMhtB,KAAKitB,KAAMjtB,KAAK2V,KAAM8Z,EAAWzvB,KAAKmtB,iBAS3DH,EAAM9sB,UAAU8vB,QAAU,SAAUpuB,EAAO+F,GAIvC,GAHAkE,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU3F,QAClDgY,GAAwB,gBAAiB,EAAGlY,EAAO5B,KAAK2V,MAAM,GAC9DiF,GAAY,gBAAiB,EAAGjT,GAAM,GAClC3H,KAAKktB,aAAaK,WAClB,MAAM,IAAIhrB,MAAM,0FAGpB,GAAIvC,KAAKktB,aAAaO,SAClB,MAAM,IAAIlrB,MAAM,sFAGpB,OAAOvC,KAAK8vB,QAAQluB,EAAO+F,GAAMooB,MAAMnuB,EAAO+F,IAKlDqlB,EAAM9sB,UAAUuI,SAAW,WAEvB,OADAoD,EAAiB,iBAAkB,EAAG,EAAGpE,UAAU3F,QAC5C9B,KAAKitB,KAAKxkB,WAAazI,KAAK2V,KAAKtB,sBAI5C2Y,EAAM9sB,UAAU8b,OAAS,WAGrB,OADAnQ,EAAiB,eAAgB,EAAG,EAAGpE,UAAU3F,QAC1C9B,KAAKyI,YAMhBukB,EAAM9sB,UAAU+vB,YAAc,WAC1B,OAAOjwB,KAAKktB,aAAagD,kBAK7BlD,EAAM9sB,UAAUiwB,gBAAkB,WAC9B,IAAI5mB,EAAMvJ,KAAKiwB,cACXrjB,EAAKyE,GAAkB9H,GAC3B,MAAc,OAAPqD,EAAc,UAAYA,GAOrCogB,EAAM9sB,UAAUkwB,QAAU,SAAU3a,GAEhC,GADA5J,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU3F,UAC5C2T,aAAiBuX,GAAQ,CAE3B,MAAM,IAAIzqB,MADK,wFAGnB,IAAI8tB,EAAWrwB,KAAKitB,OAASxX,EAAMwX,KAC/BqD,EAAWtwB,KAAK2V,KAAKH,OAAOC,EAAME,MAClC4a,EAAsBvwB,KAAKmwB,oBAAsB1a,EAAM0a,kBAC3D,OAAOE,GAAYC,GAAYC,GAUnCvD,EAAMsB,yBAA2B,SAAUxiB,EAAQmjB,EAAiBxiB,GAChE,IAAI4hB,GAAQlT,OAAQ,KAAM1O,QAAS,MACnC,GAAIwiB,GAAmBxiB,EACnB4hB,EAAIlT,OAAS8T,EACb1iB,EAAiBT,EAAQ,EAAGuiB,EAAIlT,QAAQ,GACxCkT,EAAI5hB,QAAUA,EACdD,EAAsBV,EAAQ,EAAGuiB,EAAI5hB,SAAS,QAE7C,GAAIwiB,EAEL,GAA+B,iBAApBA,GAAoD,OAApBA,EAEvCZ,EAAI5hB,QAAUwiB,MAEb,CAAA,GAA+B,mBAApBA,EAIZ,MAAM,IAAI1sB,MAAM4J,EAAYL,EAAQ,GAAG,GACnC,0DAJJuiB,EAAIlT,OAAS8T,EAOrB,OAAOZ,GAEX/uB,OAAOsI,eAAeolB,EAAM9sB,UAAW,OACnC2H,IAAK,WACD,OAAO7H,KAAK0qB,UAEhBtc,YAAY,EACZC,cAAc,IAEX2e,KAuBPwD,GAA4B,WAC5B,SAASA,IACLxwB,KAAKkO,OAkET,OA5DAsiB,EAAWtwB,UAAUuwB,IAAM,SAAUC,EAAMviB,GACvCnO,KAAKkO,IAAIwiB,GAAgB,OAARviB,GAAeA,GAMpCqiB,EAAWtwB,UAAUoJ,SAAW,SAAUd,GACtC,OAAOc,EAAStJ,KAAKkO,IAAK1F,IAM9BgoB,EAAWtwB,UAAU2H,IAAM,SAAU6oB,GACjC,OAAO1wB,KAAKsJ,SAASonB,GAAQ1wB,KAAKkO,IAAIwiB,QAAQvqB,GAKlDqqB,EAAWtwB,UAAU6O,OAAS,SAAU2hB,UAC7B1wB,KAAKkO,IAAIwiB,IAKpBF,EAAWtwB,UAAUywB,MAAQ,WACzB3wB,KAAKkO,QAMTsiB,EAAWtwB,UAAU2J,QAAU,WAC3B,OAAOA,EAAQ7J,KAAKkO,MAKxBsiB,EAAWtwB,UAAUwhB,MAAQ,WACzB,OAAO5X,EAAS9J,KAAKkO,MAMzBsiB,EAAWtwB,UAAU2R,KAAO,SAAUnI,GAClCD,EAAQzJ,KAAKkO,IAAK,SAAU9C,EAAG7J,GAAK,OAAOmI,EAAG0B,EAAG7J,MAMrDivB,EAAWtwB,UAAUoR,KAAO,WACxB,IAAIA,KAIJ,OAHA7H,EAAQzJ,KAAKkO,IAAK,SAAU9C,GACxBkG,EAAKvP,KAAKqJ,KAEPkG,GAEJkf,KAuBPI,GAAoC,WACpC,SAASA,IAKL5wB,KAAKie,OAAS,KAKdje,KAAK0mB,UAAY,KAuIrB,OA/HAkK,EAAmB1wB,UAAU2wB,KAAO,SAAUlb,GAC1C,GAAmB,MAAf3V,KAAKie,OACL,OAAOje,KAAKie,OAAOQ,SAAS9I,GAE3B,GAAKA,EAAK9L,WAA+B,MAAlB7J,KAAK0mB,UAY7B,OAAO,KAXP,IAAIoK,EAAWnb,EAAK3B,WAEpB,OADA2B,EAAOA,EAAKzB,WACRlU,KAAK0mB,UAAUpd,SAASwnB,GACR9wB,KAAK0mB,UAAU7e,IAAIipB,GAClBD,KAAKlb,GAGf,MAcnBib,EAAmB1wB,UAAU6wB,SAAW,SAAUpb,EAAMxN,GACpD,GAAIwN,EAAK9L,UACL7J,KAAKie,OAAS9V,EACdnI,KAAK0mB,UAAY,UAEhB,GAAoB,OAAhB1mB,KAAKie,OACVje,KAAKie,OAASje,KAAKie,OAAOc,YAAYpJ,EAAMxN,OAE3C,CACqB,MAAlBnI,KAAK0mB,YACL1mB,KAAK0mB,UAAY,IAAI8J,IAEzB,IAAIM,EAAWnb,EAAK3B,WACfhU,KAAK0mB,UAAUpd,SAASwnB,IACzB9wB,KAAK0mB,UAAU+J,IAAIK,EAAU,IAAIF,GAErC,IAAIlc,EAAQ1U,KAAK0mB,UAAU7e,IAAIipB,GAC/Bnb,EAAOA,EAAKzB,WACZQ,EAAMqc,SAASpb,EAAMxN,KAS7ByoB,EAAmB1wB,UAAU8wB,OAAS,SAAUrb,GAC5C,GAAIA,EAAK9L,UAGL,OAFA7J,KAAKie,OAAS,KACdje,KAAK0mB,UAAY,MACV,EAGP,GAAoB,OAAhB1mB,KAAKie,OAAiB,CACtB,GAAIje,KAAKie,OAAOH,aAEZ,OAAO,EAGP,IAAIlc,EAAQ5B,KAAKie,OACjBje,KAAKie,OAAS,KACd,IAAIgT,EAASjxB,KAIb,OAHA4B,EAAMsd,aAAaoB,GAAgB,SAAU9X,EAAK0oB,GAC9CD,EAAOF,SAAS,IAAIrd,GAAKlL,GAAM0oB,KAE5BlxB,KAAKgxB,OAAOrb,GAGtB,GAAuB,OAAnB3V,KAAK0mB,UAAoB,CAC9B,IAAIoK,EAAWnb,EAAK3B,WAEpB,GADA2B,EAAOA,EAAKzB,WACRlU,KAAK0mB,UAAUpd,SAASwnB,GACL9wB,KAAK0mB,UAAU7e,IAAIipB,GAAUE,OAAOrb,IAEnD3V,KAAK0mB,UAAU3X,OAAO+hB,GAG9B,QAAI9wB,KAAK0mB,UAAU7c,YACf7J,KAAK0mB,UAAY,MACV,GAOX,OAAO,GAWnBkK,EAAmB1wB,UAAUixB,YAAc,SAAUC,EAAYC,GACzC,OAAhBrxB,KAAKie,OACLoT,EAAKD,EAAYpxB,KAAKie,QAGtBje,KAAKkf,aAAa,SAAU1W,EAAK0oB,GAC7B,IAAIvb,EAAO,IAAIjC,GAAK0d,EAAW3oB,WAAa,IAAMD,GAClD0oB,EAAKC,YAAYxb,EAAM0b,MASnCT,EAAmB1wB,UAAUgf,aAAe,SAAUmS,GAC3B,OAAnBrxB,KAAK0mB,WACL1mB,KAAK0mB,UAAU7U,KAAK,SAAUrJ,EAAK0oB,GAC/BG,EAAK7oB,EAAK0oB,MAIfN,KAmCPU,GAAuB,SAAU1vB,EAAO2vB,GACxC,OAAK3vB,GAA0B,iBAAVA,GAIjBO,EAAO,QAASP,EAAO,6CAChB2vB,EAAa3vB,EAAM,SAJnBA,GA6BX4vB,GAA+B,SAAUlV,EAAMiV,GAC/C,IAEI1U,EAFA4U,EAASnV,EAAKyB,cAAc5P,MAC5B0L,EAAWyX,GAAqBG,EAAQF,GAE5C,GAAIjV,EAAKwB,aAAc,CACnB,IAAI4T,EAAWpV,EACX1a,EAAQ0vB,GAAqBI,EAASnS,WAAYgS,GACtD,OAAI3vB,IAAU8vB,EAASnS,YACnB1F,IAAa6X,EAAS3T,cAAc5P,MAC7B,IAAI6P,GAASpc,EAAO6mB,GAAe5O,IAGnCyC,EAIX,IAAIqV,EAAerV,EAWnB,OAVAO,EAAU8U,EACN9X,IAAa8X,EAAa5T,cAAc5P,QACxC0O,EAAUA,EAAQwB,eAAe,IAAIL,GAASnE,KAElD8X,EAAazS,aAAaoB,GAAgB,SAAU9B,EAAWI,GAC3D,IAAIE,EAAe0S,GAA6B5S,EAAW2S,GACvDzS,IAAiBF,IACjB/B,EAAUA,EAAQgC,qBAAqBL,EAAWM,MAGnDjC,IAwBf,SAAWwM,GACPA,EAAcA,EAAyB,UAAI,GAAK,YAChDA,EAAcA,EAAqB,MAAI,GAAK,QAC5CA,EAAcA,EAA8B,eAAI,GAAK,iBACrDA,EAAcA,EAA+B,gBAAI,GAAK,kBAJ1D,CAKGA,KAAkBA,QAQrB,IAwGIuI,GAw5DAC,GAhgEAC,GAAiC,WACjC,SAASA,EAAgBC,EAAUC,EAAYC,EAASC,GACpDlyB,KAAK+xB,SAAWA,EAChB/xB,KAAKgyB,WAAaA,EAClBhyB,KAAKiyB,QAAUA,EACfjyB,KAAKkyB,OAASA,EACd/vB,GAAQ+vB,GAAUF,EAAY,uCAyBlC,OAnBAF,EAAgBK,KAAO,IAAIL,GACb,GAAM,EAAO,MACf,GAKZA,EAAgBM,OAAS,IAAIN,GAAgB,GAC7B,EAAM,MACV,GAKZA,EAAgBO,qBAAuB,SAAUJ,GAC7C,OAAO,IAAIH,GAAgB,GACX,EAAMG,GACV,IAETH,KAkBPQ,GAA8B,WAO9B,SAASA,EACS3c,EACA4c,EACAC,GACdxyB,KAAK2V,KAAOA,EACZ3V,KAAKuyB,aAAeA,EACpBvyB,KAAKwyB,OAASA,EAEdxyB,KAAKsX,KAAO+R,GAAcoJ,eAE1BzyB,KAAK+F,OAAS+rB,GAAgBK,KAoBlC,OAfAG,EAAapyB,UAAUwyB,kBAAoB,SAAUlU,GACjD,GAAKxe,KAAK2V,KAAK9L,UAIV,CAAA,GAA+B,MAA3B7J,KAAKuyB,aAAa3wB,MAGvB,OAFAO,EAAOnC,KAAKuyB,aAAaI,SAAS9oB,UAAW,4DAEtC7J,KAGP,IAAI6kB,EAAY7kB,KAAKuyB,aAAaK,QAAQ,IAAIlf,GAAK8K,IACnD,OAAO,IAAI8T,EAAa5e,GAAKmf,MAAOhO,EAAW7kB,KAAKwyB,QATpD,OADArwB,EAAOnC,KAAK2V,KAAK3B,aAAewK,EAAW,iDACpC,IAAI8T,EAAatyB,KAAK2V,KAAKzB,WAAYlU,KAAKuyB,aAAcvyB,KAAKwyB,SAYvEF,KAyBPQ,GAAgB,WAIhB,OAHKlB,KACDA,GAAyB,IAAIpQ,GAAUrQ,KAEpCygB,IAKPmB,GAA+B,WAM/B,SAASA,EAAcnxB,EAAO+wB,QACT,IAAbA,IAAuBA,EAAWG,MACtC9yB,KAAK4B,MAAQA,EACb5B,KAAK2yB,SAAWA,EAkTpB,OA3SAI,EAAcC,WAAa,SAAUzpB,GACjC,IAAI2nB,EAAO6B,EAAcF,MAIzB,OAHAppB,EAAQF,EAAK,SAAU+gB,EAAW2I,GAC9B/B,EAAOA,EAAKhjB,IAAI,IAAIwF,GAAK4W,GAAY2I,KAElC/B,GAMX6B,EAAc7yB,UAAU2J,QAAU,WAC9B,OAAsB,OAAf7J,KAAK4B,OAAkB5B,KAAK2yB,SAAS9oB,WAchDkpB,EAAc7yB,UAAUgzB,iCAAmC,SAAUre,EAAcse,GAC/E,GAAkB,MAAdnzB,KAAK4B,OAAiBuxB,EAAUnzB,KAAK4B,OACrC,OAAS+T,KAAMjC,GAAKmf,MAAOjxB,MAAO5B,KAAK4B,OAGvC,GAAIiT,EAAahL,UACb,OAAO,KAGP,IAAImV,EAAQnK,EAAab,WACrBU,EAAQ1U,KAAK2yB,SAAS9qB,IAAImX,GAC9B,GAAc,OAAVtK,EAAgB,CAChB,IAAI0e,EAA4B1e,EAAMwe,iCAAiCre,EAAaX,WAAYif,GAChG,OAAiC,MAA7BC,GAESzd,KADM,IAAIjC,GAAKsL,GAAOtK,MAAM0e,EAA0Bzd,MACtC/T,MAAOwxB,EAA0BxxB,OAGnD,KAIX,OAAO,MAWvBmxB,EAAc7yB,UAAUmzB,yBAA2B,SAAUxe,GACzD,OAAO7U,KAAKkzB,iCAAiCre,EAAc,WAAc,OAAO,KAMpFke,EAAc7yB,UAAU0yB,QAAU,SAAU/d,GACxC,GAAIA,EAAahL,UACb,OAAO7J,KAGP,IAAIgf,EAAQnK,EAAab,WACrB6Q,EAAY7kB,KAAK2yB,SAAS9qB,IAAImX,GAClC,OAAkB,OAAd6F,EACOA,EAAU+N,QAAQ/d,EAAaX,YAG/B6e,EAAcF,OAWjCE,EAAc7yB,UAAUgO,IAAM,SAAU2G,EAAcye,GAClD,GAAIze,EAAahL,UACb,OAAO,IAAIkpB,EAAcO,EAAOtzB,KAAK2yB,UAGrC,IAAI3T,EAAQnK,EAAab,WAErBuf,GADQvzB,KAAK2yB,SAAS9qB,IAAImX,IAAU+T,EAAcF,OACjC3kB,IAAI2G,EAAaX,WAAYof,GAC9CjN,EAAcrmB,KAAK2yB,SAAS3Q,OAAOhD,EAAOuU,GAC9C,OAAO,IAAIR,EAAc/yB,KAAK4B,MAAOykB,IAS7C0M,EAAc7yB,UAAU6O,OAAS,SAAU8F,GACvC,GAAIA,EAAahL,UACb,OAAI7J,KAAK2yB,SAAS9oB,UACPkpB,EAAcF,MAGd,IAAIE,EAAc,KAAM/yB,KAAK2yB,UAIxC,IAAI3T,EAAQnK,EAAab,WACrBU,EAAQ1U,KAAK2yB,SAAS9qB,IAAImX,GAC9B,GAAItK,EAAO,CACP,IAAI6e,EAAW7e,EAAM3F,OAAO8F,EAAaX,YACrCmS,OAAc,EAOlB,OALIA,EADAkN,EAAS1pB,UACK7J,KAAK2yB,SAAS5jB,OAAOiQ,GAGrBhf,KAAK2yB,SAAS3Q,OAAOhD,EAAOuU,GAE3B,OAAfvzB,KAAK4B,OAAkBykB,EAAYxc,UAC5BkpB,EAAcF,MAGd,IAAIE,EAAc/yB,KAAK4B,MAAOykB,GAIzC,OAAOrmB,MAUnB+yB,EAAc7yB,UAAU2H,IAAM,SAAUgN,GACpC,GAAIA,EAAahL,UACb,OAAO7J,KAAK4B,MAGZ,IAAIod,EAAQnK,EAAab,WACrBU,EAAQ1U,KAAK2yB,SAAS9qB,IAAImX,GAC9B,OAAItK,EACOA,EAAM7M,IAAIgN,EAAaX,YAGvB,MAWnB6e,EAAc7yB,UAAUszB,QAAU,SAAU3e,EAAc4e,GACtD,GAAI5e,EAAahL,UACb,OAAO4pB,EAGP,IAAIzU,EAAQnK,EAAab,WAErBuf,GADQvzB,KAAK2yB,SAAS9qB,IAAImX,IAAU+T,EAAcF,OACjCW,QAAQ3e,EAAaX,WAAYuf,GAClDpN,OAAc,EAOlB,OALIA,EADAkN,EAAS1pB,UACK7J,KAAK2yB,SAAS5jB,OAAOiQ,GAGrBhf,KAAK2yB,SAAS3Q,OAAOhD,EAAOuU,GAEvC,IAAIR,EAAc/yB,KAAK4B,MAAOykB,IAW7C0M,EAAc7yB,UAAUwzB,KAAO,SAAUhqB,GACrC,OAAO1J,KAAK2zB,MAAMjgB,GAAKmf,MAAOnpB,IAUlCqpB,EAAc7yB,UAAUyzB,MAAQ,SAAUC,EAAWlqB,GACjD,IAAImqB,KAIJ,OAHA7zB,KAAK2yB,SAAShR,iBAAiB,SAAUmP,EAAUjM,GAC/CgP,EAAM/C,GAAYjM,EAAU8O,MAAMC,EAAUlf,MAAMoc,GAAWpnB,KAE1DA,EAAGkqB,EAAW5zB,KAAK4B,MAAOiyB,IASrCd,EAAc7yB,UAAU4zB,WAAa,SAAUne,EAAMpV,GACjD,OAAOP,KAAK+zB,YAAYpe,EAAMjC,GAAKmf,MAAOtyB,IAE9CwyB,EAAc7yB,UAAU6zB,YAAc,SAAUC,EAAcJ,EAAWrzB,GACrE,IAAI2gB,IAASlhB,KAAK4B,OAAQrB,EAAEqzB,EAAW5zB,KAAK4B,OAC5C,GAAIsf,EACA,OAAOA,EAGP,GAAI8S,EAAanqB,UACb,OAAO,KAGP,IAAImV,EAAQgV,EAAahgB,WACrBigB,EAAYj0B,KAAK2yB,SAAS9qB,IAAImX,GAClC,OAAIiV,EACOA,EAAUF,YAAYC,EAAa9f,WAAY0f,EAAUlf,MAAMsK,GAAQze,GAGvE,MAWvBwyB,EAAc7yB,UAAUg0B,cAAgB,SAAUve,EAAMpV,GACpD,OAAOP,KAAKm0B,eAAexe,EAAMjC,GAAKmf,MAAOtyB,IAEjDwyB,EAAc7yB,UAAUi0B,eAAiB,SAAUH,EAAcI,EAAqB7zB,GAClF,GAAIyzB,EAAanqB,UACb,OAAO7J,KAGHA,KAAK4B,OACLrB,EAAE6zB,EAAqBp0B,KAAK4B,OAEhC,IAAIod,EAAQgV,EAAahgB,WACrBigB,EAAYj0B,KAAK2yB,SAAS9qB,IAAImX,GAClC,OAAIiV,EACOA,EAAUE,eAAeH,EAAa9f,WAAYkgB,EAAoB1f,MAAMsK,GAAQze,GAGpFwyB,EAAcF,OAWjCE,EAAc7yB,UAAUm0B,QAAU,SAAU9zB,GACxCP,KAAKs0B,SAAS5gB,GAAKmf,MAAOtyB,IAE9BwyB,EAAc7yB,UAAUo0B,SAAW,SAAUF,EAAqB7zB,GAC9DP,KAAK2yB,SAAShR,iBAAiB,SAAUnD,EAAWqG,GAChDA,EAAUyP,SAASF,EAAoB1f,MAAM8J,GAAYje,KAEzDP,KAAK4B,OACLrB,EAAE6zB,EAAqBp0B,KAAK4B,QAOpCmxB,EAAc7yB,UAAUq0B,aAAe,SAAUh0B,GAC7CP,KAAK2yB,SAAShR,iBAAiB,SAAUnD,EAAWqG,GAC5CA,EAAUjjB,OACVrB,EAAEie,EAAWqG,EAAUjjB,UAInCmxB,EAAcF,MAAQ,IAAIE,EAAc,MACjCA,KAwBPyB,GAAgC,WAChC,SAASA,EAAezuB,EAAQ4P,GAC5B3V,KAAK+F,OAASA,EACd/F,KAAK2V,KAAOA,EAEZ3V,KAAKsX,KAAO+R,GAAcoL,gBAU9B,OARAD,EAAet0B,UAAUwyB,kBAAoB,SAAUlU,GACnD,OAAIxe,KAAK2V,KAAK9L,UACH,IAAI2qB,EAAex0B,KAAK+F,OAAQ2N,GAAKmf,OAGrC,IAAI2B,EAAex0B,KAAK+F,OAAQ/F,KAAK2V,KAAKzB,aAGlDsgB,KAyBPE,GAA2B,WAC3B,SAASA,EAAU3uB,EAAQ4P,EAAMiU,GAC7B5pB,KAAK+F,OAASA,EACd/F,KAAK2V,KAAOA,EACZ3V,KAAK4pB,KAAOA,EAEZ5pB,KAAKsX,KAAO+R,GAAcsL,UAU9B,OARAD,EAAUx0B,UAAUwyB,kBAAoB,SAAUlU,GAC9C,OAAIxe,KAAK2V,KAAK9L,UACH,IAAI6qB,EAAU10B,KAAK+F,OAAQ2N,GAAKmf,MAAO7yB,KAAK4pB,KAAKrL,kBAAkBC,IAGnE,IAAIkW,EAAU10B,KAAK+F,OAAQ/F,KAAK2V,KAAKzB,WAAYlU,KAAK4pB,OAG9D8K,KAyBPE,GAAuB,WACvB,SAASA,EACS7uB,EACA4P,EACAgd,GACd3yB,KAAK+F,OAASA,EACd/F,KAAK2V,KAAOA,EACZ3V,KAAK2yB,SAAWA,EAEhB3yB,KAAKsX,KAAO+R,GAAcwL,MAsC9B,OAjCAD,EAAM10B,UAAUwyB,kBAAoB,SAAUlU,GAC1C,GAAIxe,KAAK2V,KAAK9L,UAAW,CACrB,IAAIgb,EAAY7kB,KAAK2yB,SAASC,QAAQ,IAAIlf,GAAK8K,IAC/C,OAAIqG,EAAUhb,UAEH,KAEFgb,EAAUjjB,MAER,IAAI8yB,GAAU10B,KAAK+F,OAAQ2N,GAAKmf,MAAOhO,EAAUjjB,OAIjD,IAAIgzB,EAAM50B,KAAK+F,OAAQ2N,GAAKmf,MAAOhO,GAK9C,OADA1iB,EAAOnC,KAAK2V,KAAK3B,aAAewK,EAAW,kEACpC,IAAIoW,EAAM50B,KAAK+F,OAAQ/F,KAAK2V,KAAKzB,WAAYlU,KAAK2yB,WAMjEiC,EAAM10B,UAAUuI,SAAW,WACvB,MAAQ,aACJzI,KAAK2V,KACL,KACA3V,KAAK+F,OAAO0C,WACZ,WACAzI,KAAK2yB,SAASlqB,WACd,KAEDmsB,KAwBPE,GAA2B,WAM3B,SAASA,EAAU9K,EAAO+K,EAAmBC,GACzCh1B,KAAKgqB,MAAQA,EACbhqB,KAAK+0B,kBAAoBA,EACzB/0B,KAAKg1B,UAAYA,EAwCrB,OAlCAF,EAAU50B,UAAU+0B,mBAAqB,WACrC,OAAOj1B,KAAK+0B,mBAMhBD,EAAU50B,UAAUg1B,WAAa,WAC7B,OAAOl1B,KAAKg1B,WAMhBF,EAAU50B,UAAUi1B,kBAAoB,SAAUxf,GAC9C,GAAIA,EAAK9L,UACL,OAAO7J,KAAKi1B,uBAAyBj1B,KAAKg1B,UAE9C,IAAIlE,EAAWnb,EAAK3B,WACpB,OAAOhU,KAAKo1B,mBAAmBtE,IAMnCgE,EAAU50B,UAAUk1B,mBAAqB,SAAU5sB,GAC/C,OAASxI,KAAKi1B,uBAAyBj1B,KAAKg1B,WAAch1B,KAAKgqB,MAAMtL,SAASlW,IAKlFssB,EAAU50B,UAAUm1B,QAAU,WAC1B,OAAOr1B,KAAKgqB,OAET8K,KAyBPQ,GAA2B,WAM3B,SAASA,EAAUC,EAAaC,GAC5Bx1B,KAAKu1B,YAAcA,EACnBv1B,KAAKw1B,aAAeA,EAyDxB,OAjDAF,EAAUp1B,UAAUu1B,gBAAkB,SAAUC,EAAWC,EAAUC,GACjE,OAAO,IAAIN,EAAU,IAAIR,GAAUY,EAAWC,EAAUC,GAAW51B,KAAKw1B,eAQ5EF,EAAUp1B,UAAU21B,iBAAmB,SAAUC,EAAYH,EAAUC,GACnE,OAAO,IAAIN,EAAUt1B,KAAKu1B,YAAa,IAAIT,GAAUgB,EAAYH,EAAUC,KAK/EN,EAAUp1B,UAAU61B,cAAgB,WAChC,OAAO/1B,KAAKu1B,aAKhBD,EAAUp1B,UAAU81B,qBAAuB,WACvC,OAAOh2B,KAAKu1B,YAAYN,qBAClBj1B,KAAKu1B,YAAYF,UACjB,MAKVC,EAAUp1B,UAAU+1B,eAAiB,WACjC,OAAOj2B,KAAKw1B,cAKhBF,EAAUp1B,UAAUg2B,sBAAwB,WACxC,OAAOl2B,KAAKw1B,aAAaP,qBACnBj1B,KAAKw1B,aAAaH,UAClB,MAMVC,EAAUzC,MAAQ,IAAIyC,EAAU,IAAIR,GAAUrO,GAAatI,YACrC,GACR,GAAQ,IAAI2W,GAAUrO,GAAatI,YAC3B,GACR,IACPmX,KA2BPa,GAAwB,WACxB,SAASA,EAAO7e,EAAMwU,EAActN,EAAW4X,EAASvL,GACpD7qB,KAAKsX,KAAOA,EACZtX,KAAK8rB,aAAeA,EACpB9rB,KAAKwe,UAAYA,EACjBxe,KAAKo2B,QAAUA,EACfp2B,KAAK6qB,SAAWA,EAqDpB,OA/CAsL,EAAOE,YAAc,SAAUta,GAC3B,OAAO,IAAIoa,EAAOA,EAAOG,MAAOva,IAOpCoa,EAAOI,iBAAmB,SAAUzF,EAAU/U,GAC1C,OAAO,IAAIoa,EAAOA,EAAOK,YAAaza,EAAU+U,IAOpDqF,EAAOM,mBAAqB,SAAU3F,EAAU/U,GAC5C,OAAO,IAAIoa,EAAOA,EAAOO,cAAe3a,EAAU+U,IAQtDqF,EAAOQ,mBAAqB,SAAU7F,EAAU8F,EAAaC,GACzD,OAAO,IAAIV,EAAOA,EAAOW,cAAeF,EAAa9F,EAAU+F,IAOnEV,EAAOY,iBAAmB,SAAUjG,EAAU/U,GAC1C,OAAO,IAAIoa,EAAOA,EAAOa,YAAajb,EAAU+U,IAIpDqF,EAAOK,YAAc,cAErBL,EAAOO,cAAgB,gBAEvBP,EAAOW,cAAgB,gBAEvBX,EAAOa,YAAc,cAErBb,EAAOG,MAAQ,QACRH,KAyBPc,GAA+B,WAC/B,SAASA,EAAc/M,GACnBlqB,KAAKkqB,OAASA,EAkGlB,OAhGA+M,EAAc/2B,UAAU6e,YAAc,SAAU6K,EAAMphB,EAAK+qB,EAAU2D,EAAcnxB,EAAQoxB,GACvFh1B,EAAOynB,EAAKxJ,UAAUpgB,KAAKkqB,QAAS,qDACpC,IAAIkN,EAAWxN,EAAKrL,kBAAkB/V,GAEtC,OAAI4uB,EAAS3Y,SAASyY,GAAc1hB,OAAO+d,EAAS9U,SAASyY,KAIrDE,EAASvtB,WAAa0pB,EAAS1pB,UAIxB+f,GAGa,MAAxBuN,IACI5D,EAAS1pB,UACL+f,EAAKlL,SAASlW,GACd2uB,EAAqBE,iBAAiBlB,GAAOM,mBAAmBjuB,EAAK4uB,IAGrEj1B,EAAOynB,EAAK9L,aAAc,uEAGzBsZ,EAASvtB,UACdstB,EAAqBE,iBAAiBlB,GAAOI,iBAAiB/tB,EAAK+qB,IAGnE4D,EAAqBE,iBAAiBlB,GAAOQ,mBAAmBnuB,EAAK+qB,EAAU6D,KAGnFxN,EAAK9L,cAAgByV,EAAS1pB,UACvB+f,EAIAA,EAAK/K,qBAAqBrW,EAAK+qB,GAAUpT,UAAUngB,KAAKkqB,UAMvE+M,EAAc/2B,UAAUo3B,eAAiB,SAAUlB,EAASmB,EAASJ,GAuBjE,OAtB4B,MAAxBA,IACKf,EAAQtY,cACTsY,EAAQlX,aAAaoB,GAAgB,SAAU9X,EAAKoW,GAC3C2Y,EAAQ7Y,SAASlW,IAClB2uB,EAAqBE,iBAAiBlB,GAAOM,mBAAmBjuB,EAAKoW,MAI5E2Y,EAAQzZ,cACTyZ,EAAQrY,aAAaoB,GAAgB,SAAU9X,EAAKoW,GAChD,GAAIwX,EAAQ1X,SAASlW,GAAM,CACvB,IAAI4uB,EAAWhB,EAAQ7X,kBAAkB/V,GACpC4uB,EAAS5hB,OAAOoJ,IACjBuY,EAAqBE,iBAAiBlB,GAAOQ,mBAAmBnuB,EAAKoW,EAAWwY,SAIpFD,EAAqBE,iBAAiBlB,GAAOI,iBAAiB/tB,EAAKoW,OAK5E2Y,EAAQpX,UAAUngB,KAAKkqB,SAKlC+M,EAAc/2B,UAAUme,eAAiB,SAAU+X,EAASoB,GACxD,OAAIpB,EAAQvsB,UACD4c,GAAatI,WAGbiY,EAAQ/X,eAAemZ,IAMtCP,EAAc/2B,UAAUu3B,aAAe,WACnC,OAAO,GAKXR,EAAc/2B,UAAUw3B,iBAAmB,WACvC,OAAO13B,MAKXi3B,EAAc/2B,UAAU2rB,SAAW,WAC/B,OAAO7rB,KAAKkqB,QAET+M,KAqBPU,GAAwC,WACxC,SAASA,IACL33B,KAAK43B,cAmDT,OA9CAD,EAAuBz3B,UAAUm3B,iBAAmB,SAAU3L,GAC1D,IAAIpU,EAAOoU,EAAOpU,KACdwZ,EAAkCpF,EAAOlN,UAC7Crc,EAAOmV,GAAQ6e,GAAOK,aAClBlf,GAAQ6e,GAAOW,eACfxf,GAAQ6e,GAAOO,cAAe,6CAClCv0B,EAAoB,cAAb2uB,EAA0B,mDACjC,IAAI+G,EAAYruB,EAAQxJ,KAAK43B,WAAY9G,GACzC,GAAI+G,EAAW,CACX,IAAIC,EAAUD,EAAUvgB,KACxB,GAAIA,GAAQ6e,GAAOK,aAAesB,GAAW3B,GAAOO,cAChD12B,KAAK43B,WAAW9G,GAAYqF,GAAOQ,mBAAmB7F,EAAUpF,EAAOI,aAAc+L,EAAU/L,mBAE9F,GAAIxU,GAAQ6e,GAAOO,eACpBoB,GAAW3B,GAAOK,mBACXx2B,KAAK43B,WAAW9G,QAEtB,GAAIxZ,GAAQ6e,GAAOO,eACpBoB,GAAW3B,GAAOW,cAClB92B,KAAK43B,WAAW9G,GAAYqF,GAAOM,mBAAmB3F,EAAU+G,EAAUzB,cAEzE,GAAI9e,GAAQ6e,GAAOW,eACpBgB,GAAW3B,GAAOK,YAClBx2B,KAAK43B,WAAW9G,GAAYqF,GAAOI,iBAAiBzF,EAAUpF,EAAOI,kBAEpE,CAAA,GAAIxU,GAAQ6e,GAAOW,eACpBgB,GAAW3B,GAAOW,cAIlB,MAAMx0B,EAAe,mCACjBopB,EACA,mBACAmM,GANJ73B,KAAK43B,WAAW9G,GAAYqF,GAAOQ,mBAAmB7F,EAAUpF,EAAOI,aAAc+L,EAAUzB,eAUnGp2B,KAAK43B,WAAW9G,GAAYpF,GAMpCiM,EAAuBz3B,UAAU63B,WAAa,WAC1C,OF7+KQ,SAAUxuB,GACtB,IAAIW,KACAvH,EAAI,EACR,IAAK,IAAI6F,KAAOe,EACZW,EAAIvH,KAAO4G,EAAIf,GAEnB,OAAO0B,EEu+KI8tB,CAAUh4B,KAAK43B,aAEnBD,KA+CPM,GAA2B,IAtBa,WACxC,SAASC,KAcT,OATAA,EAAuBh4B,UAAUi4B,iBAAmB,SAAUrH,GAC1D,OAAO,MAKXoH,EAAuBh4B,UAAUk4B,mBAAqB,SAAUjZ,EAAOzK,EAAOhC,GAC1E,OAAO,MAEJwlB,MAePG,GAA8C,WAM9C,SAASA,EAA6BC,EAASC,EAAYC,QACvB,IAA5BA,IAAsCA,EAA0B,MACpEx4B,KAAKs4B,QAAUA,EACft4B,KAAKu4B,WAAaA,EAClBv4B,KAAKw4B,wBAA0BA,EAgCnC,OA3BAH,EAA6Bn4B,UAAUi4B,iBAAmB,SAAUrH,GAChE,IAAIxU,EAAOtc,KAAKu4B,WAAWxC,gBAC3B,GAAIzZ,EAAK8Y,mBAAmBtE,GACxB,OAAOxU,EAAK+Y,UAAU9W,kBAAkBuS,GAGxC,IAAI2H,EAA6C,MAAhCz4B,KAAKw4B,wBAChB,IAAI1D,GAAU90B,KAAKw4B,yBAAyB,GAAM,GAClDx4B,KAAKu4B,WAAWtC,iBACtB,OAAOj2B,KAAKs4B,QAAQI,kBAAkB5H,EAAU2H,IAMxDJ,EAA6Bn4B,UAAUk4B,mBAAqB,SAAUjZ,EAAOzK,EAAOhC,GAChF,IAAIimB,EAAqD,MAAhC34B,KAAKw4B,wBACxBx4B,KAAKw4B,wBACLx4B,KAAKu4B,WAAWrC,wBAClB0C,EAAQ54B,KAAKs4B,QAAQO,iBAAiBF,EAAoBjkB,EAAO,EAAGhC,EAASyM,GACjF,OAAqB,IAAjByZ,EAAM92B,OACC,KAGA82B,EAAM,IAGdP,KAsBPS,GAAiC,WASjC,OAJA,SAAyBC,EAAWC,GAChCh5B,KAAK+4B,UAAYA,EACjB/4B,KAAKg5B,QAAUA,MAOnBC,GAA+B,WAI/B,SAASA,EAAcC,GACnBl5B,KAAKk5B,QAAUA,EA4hBnB,OAvhBAD,EAAc/4B,UAAUi5B,cAAgB,SAAUJ,GAC9C52B,EAAO42B,EACFhD,gBACAV,UACAjV,UAAUpgB,KAAKk5B,QAAQrN,YAAa,0BACzC1pB,EAAO42B,EACF9C,iBACAZ,UACAjV,UAAUpgB,KAAKk5B,QAAQrN,YAAa,4BAS7CoN,EAAc/4B,UAAUk5B,eAAiB,SAAUC,EAAcC,EAAWC,EAAaC,GACrF,IACIC,EAAcC,EADdC,EAAc,IAAIhC,GAEtB,GAAI2B,EAAUhiB,OAAS+R,GAAcsL,UAAW,CAC5C,IAAIiF,EAAYN,EACZM,EAAU7zB,OAAOgsB,SACjB0H,EAAez5B,KAAK65B,oBAAoBR,EAAcO,EAAUjkB,KAAMikB,EAAUhQ,KAAM2P,EAAaC,EAAeG,IAGlHx3B,EAAOy3B,EAAU7zB,OAAOisB,WAAY,mBAIpC0H,EACIE,EAAU7zB,OAAOmsB,QACZmH,EAAapD,iBAAiBf,eAC1B0E,EAAUjkB,KAAK9L,UAC5B4vB,EAAez5B,KAAK85B,sBAAsBT,EAAcO,EAAUjkB,KAAMikB,EAAUhQ,KAAM2P,EAAaC,EAAeE,EAAkBC,SAGzI,GAAIL,EAAUhiB,OAAS+R,GAAcwL,MAAO,CAC7C,IAAIkF,EAAQT,EACRS,EAAMh0B,OAAOgsB,SACb0H,EAAez5B,KAAKg6B,gBAAgBX,EAAcU,EAAMpkB,KAAMokB,EAAMpH,SAAU4G,EAAaC,EAAeG,IAG1Gx3B,EAAO43B,EAAMh0B,OAAOisB,WAAY,mBAEhC0H,EACIK,EAAMh0B,OAAOmsB,QAAUmH,EAAapD,iBAAiBf,aACzDuE,EAAez5B,KAAKi6B,kBAAkBZ,EAAcU,EAAMpkB,KAAMokB,EAAMpH,SAAU4G,EAAaC,EAAeE,EAAkBC,SAGjI,GAAIL,EAAUhiB,OAAS+R,GAAcoJ,eAAgB,CACtD,IAAIyH,EAAeZ,EAKfG,EAJCS,EAAa1H,OAICxyB,KAAKm6B,iBAAiBd,EAAca,EAAavkB,KAAM4jB,EAAaC,EAAeG,GAHnF35B,KAAKo6B,cAAcf,EAAca,EAAavkB,KAAMukB,EAAa3H,aAAcgH,EAAaC,EAAeG,OAM7H,CAAA,GAAIL,EAAUhiB,OAAS+R,GAAcoL,gBAItC,MAAMnyB,EAAe,2BAA6Bg3B,EAAUhiB,MAH5DmiB,EAAez5B,KAAKq6B,gBAAgBhB,EAAcC,EAAU3jB,KAAM4jB,EAAaI,GAKnF,IAAIX,EAAUW,EAAY5B,aAE1B,OADAkB,EAAcqB,oBAAoBjB,EAAcI,EAAcT,GACvD,IAAIF,GAAgBW,EAAcT,IAQ7CC,EAAcqB,oBAAsB,SAAUjB,EAAcI,EAAcE,GACtE,IAAIjE,EAAY+D,EAAa1D,gBAC7B,GAAIL,EAAUT,qBAAsB,CAChC,IAAIsF,EAAgB7E,EAAUL,UAAUvX,cAAgB4X,EAAUL,UAAUxrB,UACxE2wB,EAAkBnB,EAAarD,wBAC/B2D,EAAY73B,OAAS,IACpBu3B,EAAatD,gBAAgBd,sBAC7BsF,IACI7E,EACIL,UACA7f,YACRkgB,EACIL,UACAtX,cACAvI,OAAOglB,EAAgBzc,iBAC5B4b,EAAY53B,KAAKo0B,GAAOE,YACHoD,EAAazD,2BAa9CiD,EAAc/4B,UAAUu6B,oCAAsC,SAAU1B,EAAW2B,EAAYnB,EAAaxzB,EAAQ4zB,GAChH,IAAIgB,EAAe5B,EAAUhD,gBAC7B,GAA8C,MAA1CwD,EAAYqB,eAAeF,GAE3B,OAAO3B,EAGP,IAAI8B,OAAgB,EAAQpC,OAAa,EACzC,GAAIiC,EAAW7wB,UAGX,GADA1H,EAAO42B,EAAU9C,iBAAiBhB,qBAAsB,8DACpD8D,EAAU9C,iBAAiBf,aAAc,CAIzC,IAAI4F,EAAc/B,EAAU7C,wBACxB6E,EAAmBD,aAAuBrU,GACxCqU,EACArU,GAAatI,WACf6c,EAAwBzB,EAAY0B,0BAA0BF,GAClEF,EAAgB76B,KAAKk5B,QAAQ5B,eAAeyB,EAAUhD,gBAAgBV,UAAW2F,EAAuBrB,OAEvG,CACD,IAAIuB,EAAe3B,EAAY4B,uBAAuBpC,EAAU7C,yBAChE2E,EAAgB76B,KAAKk5B,QAAQ5B,eAAeyB,EAAUhD,gBAAgBV,UAAW6F,EAAcvB,OAGlG,CACD,IAAI7I,EAAW4J,EAAW1mB,WAC1B,GAAgB,aAAZ8c,EAAyB,CACzB3uB,EAAiC,GAA1Bu4B,EAAWzmB,YAAkB,yDACpC,IAAImnB,EAAeT,EAAatF,UAChCoD,EAAaM,EAAU9C,iBAAiBZ,UAExC,IAAIgG,EAAkB9B,EAAY+B,mCAAmCZ,EAAYU,EAAc3C,GAE3FoC,EADmB,MAAnBQ,EACgBr7B,KAAKk5B,QAAQ7a,eAAe+c,EAAcC,GAI1CV,EAAatF,cAGhC,CACD,IAAIkG,EAAkBb,EAAWxmB,WAE7BsnB,OAAgB,EACpB,GAAIb,EAAavF,mBAAmBtE,GAAW,CAC3C2H,EAAaM,EAAU9C,iBAAiBZ,UACxC,IAAIoG,EAAmBlC,EAAY+B,mCAAmCZ,EAAYC,EAAatF,UAAWoD,GAEtG+C,EADoB,MAApBC,EACgBd,EACXtF,UACA9W,kBAAkBuS,GAClB/R,YAAYwc,EAAiBE,GAIlBd,EACXtF,UACA9W,kBAAkBuS,QAI3B0K,EAAgBjC,EAAYb,kBAAkB5H,EAAUiI,EAAU9C,kBAGlE4E,EADiB,MAAjBW,EACgBx7B,KAAKk5B,QAAQna,YAAY4b,EAAatF,UAAWvE,EAAU0K,EAAeD,EAAiBx1B,EAAQ4zB,GAInGgB,EAAatF,WAIzC,OAAO0D,EAAUtD,gBAAgBoF,EAAeF,EAAa1F,sBAAwByF,EAAW7wB,UAAW7J,KAAKk5B,QAAQzB,iBAchIwB,EAAc/4B,UAAU45B,sBAAwB,SAAUT,EAAcqB,EAAYgB,EAAanC,EAAaC,EAAeE,EAAkBC,GAC3I,IACIgC,EADAC,EAAgBvC,EAAapD,iBAE7B4F,EAAenC,EACb15B,KAAKk5B,QACLl5B,KAAKk5B,QAAQxB,mBACnB,GAAIgD,EAAW7wB,UACX8xB,EAAiBE,EAAavE,eAAesE,EAAcvG,UAAWqG,EAAa,WAElF,GAAIG,EAAapE,iBAAmBmE,EAAc1G,aAAc,CAEjE,IAAI4G,EAAgBF,EACfvG,UACAtW,YAAY2b,EAAYgB,GAC7BC,EAAiBE,EAAavE,eAAesE,EAAcvG,UAAWyG,EAAe,UAEpF,CACD,IAAIhL,EAAW4J,EAAW1mB,WAC1B,IAAK4nB,EAAczG,kBAAkBuF,IACjCA,EAAWzmB,YAAc,EAEzB,OAAOolB,EAEX,IAAIkC,EAAkBb,EAAWxmB,WAE7B4K,EADY8c,EAAcvG,UAAU9W,kBAAkBuS,GAC7B/R,YAAYwc,EAAiBG,GAEtDC,EADY,aAAZ7K,EACiB+K,EAAaxd,eAAeud,EAAcvG,UAAWvW,GAGrD+c,EAAa9c,YAAY6c,EAAcvG,UAAWvE,EAAUhS,EAAcyc,EAAiBtD,GAA0B,MAG9I,IAAIwB,EAAeJ,EAAaxD,iBAAiB8F,EAAgBC,EAAc3G,sBAAwByF,EAAW7wB,UAAWgyB,EAAapE,gBACtI1xB,EAAS,IAAIsyB,GAA6BkB,EAAaE,EAAcD,GACzE,OAAOx5B,KAAKy6B,oCAAoChB,EAAciB,EAAYnB,EAAaxzB,EAAQ4zB,IAYnGV,EAAc/4B,UAAU25B,oBAAsB,SAAUR,EAAcqB,EAAYgB,EAAanC,EAAaC,EAAeG,GACvH,IACIF,EAAcoB,EADdF,EAAetB,EAAatD,gBAE5BhwB,EAAS,IAAIsyB,GAA6BkB,EAAaF,EAAcG,GACzE,GAAIkB,EAAW7wB,UACXgxB,EAAgB76B,KAAKk5B,QAAQ5B,eAAe+B,EAAatD,gBAAgBV,UAAWqG,EAAa/B,GACjGF,EAAeJ,EAAa5D,gBAAgBoF,GAAe,EAAM76B,KAAKk5B,QAAQzB,oBAE7E,CACD,IAAI3G,EAAW4J,EAAW1mB,WAC1B,GAAiB,cAAb8c,EACA+J,EAAgB76B,KAAKk5B,QAAQ7a,eAAegb,EAAatD,gBAAgBV,UAAWqG,GACpFjC,EAAeJ,EAAa5D,gBAAgBoF,EAAeF,EAAa1F,qBAAsB0F,EAAazF,kBAE1G,CACD,IAAIqG,EAAkBb,EAAWxmB,WAC7BkjB,EAAWuD,EAAatF,UAAU9W,kBAAkBuS,GACpDyC,OAAW,EACf,GAAIgI,EAAgB1xB,UAEhB0pB,EAAWmI,MAEV,CACD,IAAI9c,EAAY7Y,EAAOoyB,iBAAiBrH,GAMhCyC,EALS,MAAb3U,EACkC,cAA9B2c,EAAgBpnB,WAChByK,EAAUH,SAAS8c,EAAgB/mB,UAAU3K,UAGlC+U,EAGAA,EAAUG,YAAYwc,EAAiBG,GAK3CjV,GAAatI,WAGhC,GAAKiZ,EAAS5hB,OAAO+d,GAKjBkG,EAAeJ,MALa,CAC5B,IAAI0C,EAAe/7B,KAAKk5B,QAAQna,YAAY4b,EAAatF,UAAWvE,EAAUyC,EAAUgI,EAAiBx1B,EAAQ4zB,GACjHF,EAAeJ,EAAa5D,gBAAgBsG,EAAcpB,EAAa1F,qBAAsBj1B,KAAKk5B,QAAQzB,kBAOtH,OAAOgC,GAQXR,EAAc+C,eAAiB,SAAUjD,EAAWjI,GAChD,OAAOiI,EAAUhD,gBAAgBX,mBAAmBtE,IAYxDmI,EAAc/4B,UAAU85B,gBAAkB,SAAUjB,EAAWpjB,EAAMsmB,EAAiB1C,EAAauB,EAAanB,GAC5G,IAAIrzB,EAAQtG,KAORk8B,EAAenD,EAanB,OAZAkD,EAAgB5H,QAAQ,SAAUxf,EAAc+J,GAC5C,IAAIud,EAAYxmB,EAAKjB,MAAMG,GACvBokB,EAAc+C,eAAejD,EAAWoD,EAAUnoB,cAClDkoB,EAAe51B,EAAMuzB,oBAAoBqC,EAAcC,EAAWvd,EAAW2a,EAAauB,EAAanB,MAG/GsC,EAAgB5H,QAAQ,SAAUxf,EAAc+J,GAC5C,IAAIud,EAAYxmB,EAAKjB,MAAMG,GACtBokB,EAAc+C,eAAejD,EAAWoD,EAAUnoB,cACnDkoB,EAAe51B,EAAMuzB,oBAAoBqC,EAAcC,EAAWvd,EAAW2a,EAAauB,EAAanB,MAGxGuC,GAQXjD,EAAc/4B,UAAUk8B,YAAc,SAAU9f,EAAMyd,GAIlD,OAHAA,EAAM1F,QAAQ,SAAUxf,EAAc+J,GAClCtC,EAAOA,EAAKyC,YAAYlK,EAAc+J,KAEnCtC,GAaX2c,EAAc/4B,UAAU+5B,kBAAoB,SAAUlB,EAAWpjB,EAAMsmB,EAAiB1C,EAAauB,EAAapB,EAAkBC,GAChI,IAAIrzB,EAAQtG,KAGZ,GAAI+4B,EACC9C,iBACAZ,UACAxrB,YACAkvB,EAAU9C,iBAAiBhB,qBAC5B,OAAO8D,EAQX,IACIsD,EADAH,EAAenD,EAGfsD,EADA1mB,EAAK9L,UACWoyB,EAGAlJ,GAAcF,MAAMW,QAAQ7d,EAAMsmB,GAEtD,IAAIxD,EAAaM,EAAU9C,iBAAiBZ,UAuB5C,OAtBAgH,EAAc1J,SAAShR,iBAAiB,SAAUmP,EAAUjM,GACxD,GAAI4T,EAAW/Z,SAASoS,GAAW,CAC/B,IAAIwL,EAAcvD,EACb9C,iBACAZ,UACA9W,kBAAkBuS,GACnByC,EAAWjtB,EAAM81B,YAAYE,EAAazX,GAC9CqX,EAAe51B,EAAMwzB,sBAAsBoC,EAAc,IAAIxoB,GAAKod,GAAWyC,EAAUgG,EAAauB,EAAapB,EAAkBC,MAG3I0C,EAAc1J,SAAShR,iBAAiB,SAAUmP,EAAUyL,GACxD,IAAIC,GAAsBzD,EAAU9C,iBAAiBb,mBAAmBtE,IAC5C,MAAxByL,EAAe36B,MACnB,IAAK62B,EAAW/Z,SAASoS,KAAc0L,EAAoB,CACvD,IAAIF,EAAcvD,EACb9C,iBACAZ,UACA9W,kBAAkBuS,GACnByC,EAAWjtB,EAAM81B,YAAYE,EAAaC,GAC9CL,EAAe51B,EAAMwzB,sBAAsBoC,EAAc,IAAIxoB,GAAKod,GAAWyC,EAAUgG,EAAauB,EAAapB,EAAkBC,MAGpIuC,GAYXjD,EAAc/4B,UAAUk6B,cAAgB,SAAUrB,EAAW0D,EAASlK,EAAcgH,EAAaC,EAAeG,GAC5G,GAA2C,MAAvCJ,EAAYqB,eAAe6B,GAC3B,OAAO1D,EAGX,IAAIW,EAAmBX,EAAU9C,iBAAiBf,aAG9C4F,EAAc/B,EAAU9C,iBAC5B,GAA0B,MAAtB1D,EAAa3wB,MAAe,CAE5B,GAAK66B,EAAQ5yB,WAAaixB,EAAY7F,sBAClC6F,EAAY3F,kBAAkBsH,GAC9B,OAAOz8B,KAAK85B,sBAAsBf,EAAW0D,EAAS3B,EAAYzF,UAAU5W,SAASge,GAAUlD,EAAaC,EAAeE,EAAkBC,GAE5I,GAAI8C,EAAQ5yB,UAAW,CAGxB,IAAI6yB,EAAoB3J,GAAcF,MAItC,OAHAiI,EAAYzF,UAAUnW,aAAa3B,GAAW,SAAU5V,EAAM2U,GAC1DogB,EAAoBA,EAAkBxuB,IAAI,IAAIwF,GAAK/L,GAAO2U,KAEvDtc,KAAKi6B,kBAAkBlB,EAAW0D,EAASC,EAAmBnD,EAAaC,EAAeE,EAAkBC,GAGnH,OAAOZ,EAKX,IAAI4D,EAAoB5J,GAAcF,MAOtC,OANAN,EAAa8B,QAAQ,SAAUuI,EAAWh7B,GACtC,IAAIi7B,EAAkBJ,EAAQ/nB,MAAMkoB,GAChC9B,EAAY3F,kBAAkB0H,KAC9BF,EAAoBA,EAAkBzuB,IAAI0uB,EAAW9B,EAAYzF,UAAU5W,SAASoe,OAGrF78B,KAAKi6B,kBAAkBlB,EAAW0D,EAASE,EAAmBpD,EAAaC,EAAeE,EAAkBC,IAW3HV,EAAc/4B,UAAUm6B,gBAAkB,SAAUtB,EAAWpjB,EAAM4jB,EAAaI,GAC9E,IAAImD,EAAgB/D,EAAU9C,iBAC1BwD,EAAeV,EAAUlD,iBAAiBiH,EAAczH,UAAWyH,EAAc7H,sBAAwBtf,EAAK9L,UAAWizB,EAAc5H,cAC3I,OAAOl1B,KAAKy6B,oCAAoChB,EAAc9jB,EAAM4jB,EAAatB,GAA0B0B,IAW/GV,EAAc/4B,UAAUi6B,iBAAmB,SAAUpB,EAAWpjB,EAAM4jB,EAAawD,EAAqBpD,GACpG,IAAIhE,EACJ,GAAwC,MAApC4D,EAAYqB,eAAejlB,GAC3B,OAAOojB,EAGP,IAAIhzB,EAAS,IAAIsyB,GAA6BkB,EAAaR,EAAWgE,GAClEC,EAAgBjE,EAAUhD,gBAAgBV,UAC1CwF,OAAgB,EACpB,GAAIllB,EAAK9L,WAAiC,cAApB8L,EAAK3B,WAA4B,CACnD,IAAI6I,OAAU,EACd,GAAIkc,EAAU9C,iBAAiBhB,qBAC3BpY,EAAU0c,EAAY4B,uBAAuBpC,EAAU7C,6BAEtD,CACD,IAAI+G,EAAiBlE,EAAU9C,iBAAiBZ,UAChDlzB,EAAO86B,aAA0BxW,GAAc,iDAC/C5J,EAAU0c,EAAY0B,0BAA0BgC,GAEpDpgB,EAAUA,EACVge,EAAgB76B,KAAKk5B,QAAQ5B,eAAe0F,EAAengB,EAAS8c,OAEnE,CACD,IAAI7I,EAAWnb,EAAK3B,WAChBuf,EAAWgG,EAAYb,kBAAkB5H,EAAUiI,EAAU9C,kBACjD,MAAZ1C,GACAwF,EAAU9C,iBAAiBb,mBAAmBtE,KAC9CyC,EAAWyJ,EAAcze,kBAAkBuS,KAG3C+J,EADY,MAAZtH,EACgBvzB,KAAKk5B,QAAQna,YAAYie,EAAelM,EAAUyC,EAAU5d,EAAKzB,WAAYnO,EAAQ4zB,GAEhGZ,EACJhD,gBACAV,UACA3W,SAASoS,GAEM9wB,KAAKk5B,QAAQna,YAAYie,EAAelM,EAAUrK,GAAatI,WAAYxI,EAAKzB,WAAYnO,EAAQ4zB,GAGpGqD,GAEFnzB,WACdkvB,EAAU9C,iBAAiBhB,uBAE3BU,EAAW4D,EAAY4B,uBAAuBpC,EAAU7C,0BAC3CpY,eACT+c,EAAgB76B,KAAKk5B,QAAQ5B,eAAeuD,EAAelF,EAAUgE,IAOjF,OAHAhE,EACIoD,EAAU9C,iBAAiBhB,sBACmB,MAA1CsE,EAAYqB,eAAelnB,GAAKmf,OACjCkG,EAAUtD,gBAAgBoF,EAAelF,EAAU31B,KAAKk5B,QAAQzB,iBAGxEwB,KAyBPiE,GAAgC,WAKhC,SAASA,EAAeC,GACpBn9B,KAAKm9B,OAASA,EAKdn9B,KAAKkqB,OAASlqB,KAAKm9B,OAAOvR,iBAAiBC,WAuF/C,OAvEAqR,EAAeh9B,UAAUk9B,yBAA2B,SAAUpE,EAASqE,EAAYC,GAC/E,IAAIh3B,EAAQtG,KACRu9B,KACAC,KAYJ,OAXAxE,EAAQvvB,QAAQ,SAAUiiB,GAClBA,EAAOpU,OAAS6e,GAAOW,eACvBxwB,EAAM4jB,OAAOvN,oBAAoB+O,EAAO0K,QAAS1K,EAAOI,eACxD0R,EAAMz7B,KAAKo0B,GAAOY,iBAAiBrL,EAAOlN,UAAWkN,EAAOI,iBAGpE9rB,KAAKy9B,uBAAuBF,EAAQpH,GAAOO,cAAesC,EAASsE,EAAoBD,GACvFr9B,KAAKy9B,uBAAuBF,EAAQpH,GAAOK,YAAawC,EAASsE,EAAoBD,GACrFr9B,KAAKy9B,uBAAuBF,EAAQpH,GAAOa,YAAawG,EAAOF,EAAoBD,GACnFr9B,KAAKy9B,uBAAuBF,EAAQpH,GAAOW,cAAekC,EAASsE,EAAoBD,GACvFr9B,KAAKy9B,uBAAuBF,EAAQpH,GAAOG,MAAO0C,EAASsE,EAAoBD,GACxEE,GAYXL,EAAeh9B,UAAUu9B,uBAAyB,SAAUF,EAAQ5iB,EAAWqe,EAAS0E,EAAeL,GACnG,IAAI/2B,EAAQtG,KACR29B,EAAkB3E,EAAQ4E,OAAO,SAAUlS,GAAU,OAAOA,EAAOpU,OAASqD,IAChFgjB,EAAgBpsB,KAAKvR,KAAK69B,gBAAgBxtB,KAAKrQ,OAC/C29B,EAAgBl0B,QAAQ,SAAUiiB,GAC9B,IAAIoS,EAAqBx3B,EAAMy3B,yBAAyBrS,EAAQ2R,GAChEK,EAAcj0B,QAAQ,SAAUu0B,GACxBA,EAAaxS,WAAWE,EAAOpU,OAC/BimB,EAAOx7B,KAAKi8B,EAAavS,YAAYqS,EAAoBx3B,EAAM62B,cAW/ED,EAAeh9B,UAAU69B,yBAA2B,SAAUrS,EAAQ2R,GAClE,MAAoB,UAAhB3R,EAAOpU,MAAoC,kBAAhBoU,EAAOpU,KAC3BoU,GAGPA,EAAOb,SAAWwS,EAAW1e,wBAE7B+M,EAAOlN,UAAWkN,EAAOI,aAAc9rB,KAAKkqB,QACrCwB,IASfwR,EAAeh9B,UAAU29B,gBAAkB,SAAUxyB,EAAG1L,GACpD,GAAmB,MAAf0L,EAAEmT,WAAoC,MAAf7e,EAAE6e,UACzB,MAAMlc,EAAe,sCAEzB,IAAI27B,EAAW,IAAI5hB,GAAUhR,EAAEmT,UAAWnT,EAAEygB,cACxCoS,EAAW,IAAI7hB,GAAU1c,EAAE6e,UAAW7e,EAAEmsB,cAC5C,OAAO9rB,KAAKkqB,OAAOxN,QAAQuhB,EAAUC,IAElChB,KA4BPiB,GAAsB,WAMtB,SAASA,EAAKhB,EAAQiB,GAClBp+B,KAAKm9B,OAASA,EACdn9B,KAAKq+B,uBACL,IAAI9mB,EAASvX,KAAKm9B,OAAOvR,iBACrB0S,EAAc,IAAIrH,GAAc1f,EAAOsU,YACvC+R,EAASrmB,EAAOgnB,gBAKpBv+B,KAAKw+B,WAAa,IAAIvF,GAAc2E,GACpC,IAAIa,EAAqBL,EAAiBnI,iBACtCyI,EAAoBN,EAAiBrI,gBAErCD,EAAawI,EAAYhH,eAAe7Q,GAAatI,WAAYsgB,EAAmBpJ,UAAW,MAC/FK,EAAYkI,EAAOtG,eAAe7Q,GAAatI,WAAYugB,EAAkBrJ,UAAW,MACxFsG,EAAiB,IAAI7G,GAAUgB,EAAY2I,EAAmBxJ,qBAAsBqJ,EAAY7G,gBAChGoD,EAAgB,IAAI/F,GAAUY,EAAWgJ,EAAkBzJ,qBAAsB2I,EAAOnG,gBAK5Fz3B,KAAKu4B,WAAa,IAAIjD,GAAUuF,EAAec,GAK/C37B,KAAK2+B,gBAAkB,IAAIzB,GAAel9B,KAAKm9B,QAqInD,OAhIAgB,EAAKj+B,UAAU0+B,SAAW,WACtB,OAAO5+B,KAAKm9B,QAKhBgB,EAAKj+B,UAAU+1B,eAAiB,WAC5B,OAAOj2B,KAAKu4B,WAAWtC,iBAAiBZ,WAM5C8I,EAAKj+B,UAAU2+B,uBAAyB,SAAUlpB,GAC9C,IAAImpB,EAAQ9+B,KAAKu4B,WAAWrC,wBAC5B,OAAI4I,IAGI9+B,KAAKm9B,OAAOvR,iBAAiBmT,iBAC3BppB,EAAK9L,YAAci1B,EAAMvgB,kBAAkB5I,EAAK3B,YAAYnK,WACvDi1B,EAAMrgB,SAAS9I,GAGvB,MAKXwoB,EAAKj+B,UAAU2J,QAAU,WACrB,OAA2C,IAApC7J,KAAKq+B,oBAAoBv8B,QAKpCq8B,EAAKj+B,UAAU8+B,qBAAuB,SAAUpU,GAC5C5qB,KAAKq+B,oBAAoBt8B,KAAK6oB,IAOlCuT,EAAKj+B,UAAU++B,wBAA0B,SAAUrU,EAAmBsU,GAClE,IAAIC,KACJ,GAAID,EAAa,CACb/8B,EAA4B,MAArByoB,EAA2B,mDAClC,IAAIwU,EAASp/B,KAAKm9B,OAAOxnB,KACzB3V,KAAKq+B,oBAAoB50B,QAAQ,SAAUu0B,GACvCkB,EAAoCA,EACpC,IAAIG,EAAarB,EAAa7R,kBAAkB+S,EAAaE,GACzDC,GACAF,EAAap9B,KAAKs9B,KAI9B,GAAIzU,EAAmB,CAEnB,IADA,IAAI0U,KACK38B,EAAI,EAAGA,EAAI3C,KAAKq+B,oBAAoBv8B,SAAUa,EAAG,CACtD,IAAI48B,EAAWv/B,KAAKq+B,oBAAoB17B,GACxC,GAAK48B,EAASnT,QAAQxB,IAGjB,GAAIA,EAAkByB,iBAAkB,CAEzCiT,EAAYA,EAAU5xB,OAAO1N,KAAKq+B,oBAAoB31B,MAAM/F,EAAI,IAChE,YALA28B,EAAUv9B,KAAKw9B,GAQvBv/B,KAAKq+B,oBAAsBiB,OAG3Bt/B,KAAKq+B,uBAET,OAAOc,GAUXhB,EAAKj+B,UAAUk5B,eAAiB,SAAUE,EAAWC,EAAawD,GAC1DzD,EAAUhiB,OAAS+R,GAAcwL,OACJ,OAA7ByE,EAAUvzB,OAAOksB,UACjB9vB,EAAOnC,KAAKu4B,WAAWrC,wBAAyB,6DAChD/zB,EAAOnC,KAAKu4B,WAAWvC,uBAAwB,4DAEnD,IAAIqD,EAAer5B,KAAKu4B,WACpBrX,EAASlhB,KAAKw+B,WAAWpF,eAAeC,EAAcC,EAAWC,EAAawD,GAKlF,OAJA/8B,KAAKw+B,WAAWrF,cAAcjY,EAAO6X,WACrC52B,EAAO+e,EAAO6X,UAAU9C,iBAAiBhB,uBACpCoE,EAAapD,iBAAiBhB,qBAAsB,2DACzDj1B,KAAKu4B,WAAarX,EAAO6X,UAClB/4B,KAAKw/B,0BAA0Bte,EAAO8X,QAAS9X,EAAO6X,UAAUhD,gBAAgBV,UAAW,OAMtG8I,EAAKj+B,UAAUu/B,iBAAmB,SAAUzB,GACxC,IAAItI,EAAY11B,KAAKu4B,WAAWxC,gBAC5B2J,KACChK,EAAUL,UAAUvX,cACL4X,EAAUL,UAChBnW,aAAaoB,GAAgB,SAAU9X,EAAKoW,GAClD8gB,EAAe39B,KAAKo0B,GAAOI,iBAAiB/tB,EAAKoW,MAMzD,OAHI8W,EAAUT,sBACVyK,EAAe39B,KAAKo0B,GAAOE,YAAYX,EAAUL,YAE9Cr1B,KAAKw/B,0BAA0BE,EAAgBhK,EAAUL,UAAW2I,IAS/EG,EAAKj+B,UAAUs/B,0BAA4B,SAAUxG,EAASqE,EAAYzS,GACtE,IAAI8S,EAAgB9S,GACbA,GACD5qB,KAAKq+B,oBACX,OAAOr+B,KAAK2+B,gBAAgBvB,yBAAyBpE,EAASqE,EAAYK,IAEvES,KA6BPwB,GAA2B,WAC3B,SAASA,IAUL3/B,KAAK4/B,UAwMT,OAtMAtgC,OAAOsI,eAAe+3B,EAAW,0BAC7B93B,IAAK,WAED,OADA1F,EAAO0vB,GAA0B,oCAC1BA,IAEX3jB,IAAK,SAAUC,GACXhM,GAAQ0vB,GAA0B,mDAClCA,GAA2B1jB,GAE/BC,YAAY,EACZC,cAAc,IAKlBsxB,EAAUz/B,UAAU2J,QAAU,WAC1B,OAAOA,EAAQ7J,KAAK4/B,SASxBD,EAAUz/B,UAAUk5B,eAAiB,SAAUE,EAAWC,EAAasG,GACnE,IAAI5N,EAAUqH,EAAUvzB,OAAOksB,QAC/B,GAAgB,OAAZA,EAAkB,CAClB,IAAI6N,EAAOt2B,EAAQxJ,KAAK4/B,OAAQ3N,GAEhC,OADA9vB,EAAe,MAAR29B,EAAc,gDACdA,EAAK1G,eAAeE,EAAWC,EAAasG,GAGnD,IAAIE,KAIJ,OAHAt2B,EAAQzJ,KAAK4/B,OAAQ,SAAUp3B,EAAKs3B,GAChCC,EAAWA,EAASryB,OAAOoyB,EAAK1G,eAAeE,EAAWC,EAAasG,MAEpEE,GAafJ,EAAUz/B,UAAU8+B,qBAAuB,SAAUrT,EAAOf,EAAmB2O,EAAauB,EAAakF,GACrG,IAAI/N,EAAUtG,EAAMwE,kBAChB2P,EAAOt2B,EAAQxJ,KAAK4/B,OAAQ3N,GAChC,IAAK6N,EAAM,CAEP,IAAIzC,EAAa9D,EAAY4B,uBAAuB6E,EAAsBlF,EAAc,MACpFmF,GAAqB,EACrB5C,EACA4C,GAAqB,EAEhBnF,aAAuBrU,IAC5B4W,EAAa9D,EAAY0B,0BAA0BH,GACnDmF,GAAqB,IAGrB5C,EAAa5W,GAAatI,WAC1B8hB,GAAqB,GAEzB,IAAIlH,EAAY,IAAIzD,GAAU,IAAIR,KACCmL,GAAoB,GAAQ,IAAInL,KAC/BkL,GAAqB,IACzDF,EAAO,IAAI3B,GAAKxS,EAAOoN,GACvB/4B,KAAK4/B,OAAO3N,GAAW6N,EAI3B,OADAA,EAAKd,qBAAqBpU,GACnBkV,EAAKL,iBAAiB7U,IAajC+U,EAAUz/B,UAAU++B,wBAA0B,SAAUtT,EAAOf,EAAmBsU,GAC9E,IAAIjN,EAAUtG,EAAMwE,kBAChB+P,KACAf,KACAgB,EAAkBngC,KAAKogC,kBAC3B,GAAgB,YAAZnO,EAAuB,CAEvB,IAAIhB,EAASjxB,KACbyJ,EAAQzJ,KAAK4/B,OAAQ,SAAUS,EAAaP,GACxCX,EAAeA,EAAazxB,OAAOoyB,EAAKb,wBAAwBrU,EAAmBsU,IAC/EY,EAAKj2B,mBACEonB,EAAO2O,OAAOS,GAEhBP,EACAlB,WACAhT,iBACAmT,gBACDmB,EAAQn+B,KAAK+9B,EAAKlB,mBAK7B,CAED,IAAIkB,EAAOt2B,EAAQxJ,KAAK4/B,OAAQ3N,GAC5B6N,IACAX,EAAeA,EAAazxB,OAAOoyB,EAAKb,wBAAwBrU,EAAmBsU,IAC/EY,EAAKj2B,mBACE7J,KAAK4/B,OAAO3N,GAEd6N,EACAlB,WACAhT,iBACAmT,gBACDmB,EAAQn+B,KAAK+9B,EAAKlB,cASlC,OAJIuB,IAAoBngC,KAAKogC,mBAEzBF,EAAQn+B,KAAK,IAAI49B,EAAUvW,uBAAuBuC,EAAMsB,KAAMtB,EAAMhW,QAE/DuqB,QAASA,EAAS3C,OAAQ4B,IAKvCQ,EAAUz/B,UAAUogC,cAAgB,WAChC,IAAIh6B,EAAQtG,KAEZ,OADaV,OAAOgS,KAAKtR,KAAK4/B,QAAQ51B,IAAI,SAAUxB,GAAO,OAAOlC,EAAMs5B,OAAOp3B,KACjEo1B,OAAO,SAAUkC,GAC3B,OAAQA,EACHlB,WACAhT,iBACAmT,kBAQbY,EAAUz/B,UAAU2+B,uBAAyB,SAAUlpB,GACnD,IAAImlB,EAAc,KAIlB,OAHArxB,EAAQzJ,KAAK4/B,OAAQ,SAAUp3B,EAAKs3B,GAChChF,EAAcA,GAAegF,EAAKjB,uBAAuBlpB,KAEtDmlB,GAMX6E,EAAUz/B,UAAUqgC,aAAe,SAAU5U,GAEzC,GADaA,EAAMC,iBACRmT,eACP,OAAO/+B,KAAKwgC,kBAGZ,IAAIvO,EAAUtG,EAAMwE,kBACpB,OAAO3mB,EAAQxJ,KAAK4/B,OAAQ3N,IAOpC0N,EAAUz/B,UAAUugC,mBAAqB,SAAU9U,GAC/C,OAAmC,MAA5B3rB,KAAKugC,aAAa5U,IAK7BgU,EAAUz/B,UAAUkgC,gBAAkB,WAClC,OAAiC,MAA1BpgC,KAAKwgC,mBAKhBb,EAAUz/B,UAAUsgC,gBAAkB,WAClC,IFnsNkBj3B,EAASa,EAC3B5B,EEwsNA,OFzsNkBe,EEmsNWvJ,KAAK4/B,QFlsNlCp3B,EAAM2B,EAAQZ,EEksN4B,SAAUu2B,GAChD,OAAOA,EACFlB,WACAhT,iBACAmT,gBFtsNc30B,KACbb,EAAIf,KEusNS,MAEpBm3B,KA2BPe,GAA+B,WAC/B,SAASA,EAAcC,GACnB3gC,KAAK2gC,WAAaA,EAkLtB,OA3KAD,EAAcxgC,UAAU0gC,SAAW,SAAUjrB,EAAM2G,GAC/C,GAAI3G,EAAK9L,UACL,OAAO,IAAI62B,EAAc,IAAI3N,GAAczW,IAG3C,IAAIukB,EAAW7gC,KAAK2gC,WAAWtN,yBAAyB1d,GACxD,GAAgB,MAAZkrB,EAAkB,CAClB,IAAIC,EAAeD,EAASlrB,KACxB/T,EAAQi/B,EAASj/B,MACjBiT,EAAenB,GAAKmB,aAAaisB,EAAcnrB,GAEnD,OADA/T,EAAQA,EAAMmd,YAAYlK,EAAcyH,GACjC,IAAIokB,EAAc1gC,KAAK2gC,WAAWzyB,IAAI4yB,EAAcl/B,IAG3D,IAAIgxB,EAAU,IAAIG,GAAczW,GAEhC,OAAO,IAAIokB,EADQ1gC,KAAK2gC,WAAWnN,QAAQ7d,EAAMid,KAU7D8N,EAAcxgC,UAAU6gC,UAAY,SAAUprB,EAAMqrB,GAChD,IAAIC,EAAWjhC,KAIf,OAHAyJ,EAAQu3B,EAAS,SAAUlQ,EAAUxU,GACjC2kB,EAAWA,EAASL,SAASjrB,EAAKjB,MAAMoc,GAAWxU,KAEhD2kB,GASXP,EAAcxgC,UAAUghC,YAAc,SAAUvrB,GAC5C,OAAIA,EAAK9L,UACE62B,EAAc7N,MAId,IAAI6N,EADQ1gC,KAAK2gC,WAAWnN,QAAQ7d,EAAMod,GAAcF,SAWvE6N,EAAcxgC,UAAUihC,iBAAmB,SAAUxrB,GACjD,OAAqC,MAA9B3V,KAAKohC,gBAAgBzrB,IAShC+qB,EAAcxgC,UAAUkhC,gBAAkB,SAAUzrB,GAChD,IAAIkrB,EAAW7gC,KAAK2gC,WAAWtN,yBAAyB1d,GACxD,OAAgB,MAAZkrB,EACO7gC,KAAK2gC,WACP94B,IAAIg5B,EAASlrB,MACb8I,SAAS/K,GAAKmB,aAAagsB,EAASlrB,KAAMA,IAGxC,MAQf+qB,EAAcxgC,UAAUmhC,oBAAsB,WAC1C,IAAI1O,KACArW,EAAOtc,KAAK2gC,WAAW/+B,MAgB3B,OAfY,MAAR0a,EAEKA,EAAKwB,cACNxB,EAAK4C,aAAaoB,GAAgB,SAAU9B,EAAWI,GACnD+T,EAAS5wB,KAAK,IAAIsa,GAAUmC,EAAWI,MAK/C5e,KAAK2gC,WAAWhO,SAAShR,iBAAiB,SAAUnD,EAAWqG,GACpC,MAAnBA,EAAUjjB,OACV+wB,EAAS5wB,KAAK,IAAIsa,GAAUmC,EAAWqG,EAAUjjB,UAItD+wB,GAMX+N,EAAcxgC,UAAUohC,mBAAqB,SAAU3rB,GACnD,GAAIA,EAAK9L,UACL,OAAO7J,KAGP,IAAIuhC,EAAgBvhC,KAAKohC,gBAAgBzrB,GACzC,OACW,IAAI+qB,EADM,MAAjBa,EACyB,IAAIxO,GAAcwO,GAGlBvhC,KAAK2gC,WAAW/N,QAAQjd,KAQ7D+qB,EAAcxgC,UAAU2J,QAAU,WAC9B,OAAO7J,KAAK2gC,WAAW92B,WAQ3B62B,EAAcxgC,UAAUsH,MAAQ,SAAU8U,GACtC,OAAOokB,EAAcc,mBAAmB9tB,GAAKmf,MAAO7yB,KAAK2gC,WAAYrkB,IAKzEokB,EAAc7N,MAAQ,IAAI6N,EAAc,IAAI3N,GAAc,OAQ1D2N,EAAcc,mBAAqB,SAAU3sB,EAAc4sB,EAAWnlB,GAClE,GAAuB,MAAnBmlB,EAAU7/B,MAEV,OAAO0a,EAAKyC,YAAYlK,EAAc4sB,EAAU7/B,OAGhD,IAAI8/B,EAAkB,KAgBtB,OAfAD,EAAU9O,SAAShR,iBAAiB,SAAUmP,EAAUjM,GACnC,cAAbiM,GAGA3uB,EAA2B,OAApB0iB,EAAUjjB,MAAgB,6CACjC8/B,EAAkB7c,EAAUjjB,OAG5B0a,EAAOokB,EAAcc,mBAAmB3sB,EAAaH,MAAMoc,GAAWjM,EAAWvI,KAIpFA,EAAKmC,SAAS5J,GAAchL,WAAiC,OAApB63B,IAC1CplB,EAAOA,EAAKyC,YAAYlK,EAAaH,MAAM,aAAcgtB,IAEtDplB,GAGRokB,KAyBPiB,GAA2B,WAC3B,SAASA,IAQL3hC,KAAK4hC,eAAiBlB,GAAc7N,MASpC7yB,KAAK6hC,cACL7hC,KAAK8hC,cAAgB,EAudzB,OA/cAH,EAAUzhC,UAAU6hC,YAAc,SAAUpsB,GACxC,OAAO,IAAIqsB,GAAarsB,EAAM3V,OAUlC2hC,EAAUzhC,UAAU+hC,aAAe,SAAUtsB,EAAMiU,EAAMsY,EAASC,GAC9DhgC,EAAO+/B,EAAUliC,KAAK8hC,aAAc,qDACpB37B,IAAZg8B,IACAA,GAAU,GAEdniC,KAAK6hC,WAAW9/B,MACZ4T,KAAMA,EACNiU,KAAMA,EACNsY,QAASA,EACTC,QAASA,IAETA,IACAniC,KAAK4hC,eAAiB5hC,KAAK4hC,eAAehB,SAASjrB,EAAMiU,IAE7D5pB,KAAK8hC,aAAeI,GASxBP,EAAUzhC,UAAUkiC,SAAW,SAAUzsB,EAAMsmB,EAAiBiG,GAC5D//B,EAAO+/B,EAAUliC,KAAK8hC,aAAc,gDACpC9hC,KAAK6hC,WAAW9/B,MACZ4T,KAAMA,EACNgd,SAAUsJ,EACViG,QAASA,EACTC,SAAS,IAEbniC,KAAK4hC,eAAiB5hC,KAAK4hC,eAAeb,UAAUprB,EAAMsmB,GAC1Dj8B,KAAK8hC,aAAeI,GAMxBP,EAAUzhC,UAAUmiC,SAAW,SAAUH,GACrC,IAAK,IAAIv/B,EAAI,EAAGA,EAAI3C,KAAK6hC,WAAW//B,OAAQa,IAAK,CAC7C,IAAI2/B,EAAStiC,KAAK6hC,WAAWl/B,GAC7B,GAAI2/B,EAAOJ,UAAYA,EACnB,OAAOI,EAGf,OAAO,MAUXX,EAAUzhC,UAAUghC,YAAc,SAAUgB,GAKxC,IAAI57B,EAAQtG,KACRonB,EAAMpnB,KAAK6hC,WAAWU,UAAU,SAAUxwB,GAC1C,OAAOA,EAAEmwB,UAAYA,IAEzB//B,EAAOilB,GAAO,EAAG,gDACjB,IAAIob,EAAgBxiC,KAAK6hC,WAAWza,GACpCpnB,KAAK6hC,WAAWY,OAAOrb,EAAK,GAI5B,IAHA,IAAIsb,EAAyBF,EAAcL,QACvCQ,GAAsC,EACtChgC,EAAI3C,KAAK6hC,WAAW//B,OAAS,EAC1B4gC,GAA0B//B,GAAK,GAAG,CACrC,IAAIigC,EAAe5iC,KAAK6hC,WAAWl/B,GAC/BigC,EAAaT,UACTx/B,GAAKykB,GACLpnB,KAAK6iC,oBAAoBD,EAAcJ,EAAc7sB,MAErD+sB,GAAyB,EAEpBF,EAAc7sB,KAAKrM,SAASs5B,EAAajtB,QAE9CgtB,GAAsC,IAG9ChgC,IAEJ,GAAK+/B,EAGA,CAAA,GAAIC,EAGL,OADA3iC,KAAK8iC,cACE,EAIP,GAAIN,EAAc5Y,KACd5pB,KAAK4hC,eAAiB5hC,KAAK4hC,eAAeV,YAAYsB,EAAc7sB,UAEnE,CACD,IAAIgd,EAAW6P,EAAc7P,SAC7BlpB,EAAQkpB,EAAU,SAAUnU,GACxBlY,EAAMs7B,eAAiBt7B,EAAMs7B,eAAeV,YAAYsB,EAAc7sB,KAAKjB,MAAM8J,MAGzF,OAAO,EAlBP,OAAO,GA4BfmjB,EAAUzhC,UAAU6iC,qBAAuB,SAAUptB,GACjD,OAAO3V,KAAK4hC,eAAeR,gBAAgBzrB,IAY/CgsB,EAAUzhC,UAAUi7B,uBAAyB,SAAU6H,EAAUjG,EAAqBkG,EAAmBC,GACrG,GAAKD,GAAsBC,EAqBtB,CACD,IAAInJ,EAAQ/5B,KAAK4hC,eAAeN,mBAAmB0B,GACnD,IAAKE,GAAuBnJ,EAAMlwB,UAC9B,OAAOkzB,EAIP,GAAKmG,GACsB,MAAvBnG,GACChD,EAAMoH,iBAAiBztB,GAAKmf,OAG5B,CACD,IAMIsQ,EAAcxB,EAAUyB,WAAWpjC,KAAK6hC,WAN/B,SAAUwB,GACnB,OAASA,EAAMlB,SAAWe,MACpBD,KACIA,EAAkBpsB,QAAQwsB,EAAMnB,YACrCmB,EAAM1tB,KAAKrM,SAAS05B,IAAaA,EAAS15B,SAAS+5B,EAAM1tB,QAEFqtB,GAC5DM,EAAevG,GAAuBtW,GAAatI,WACvD,OAAOglB,EAAY37B,MAAM87B,GAXzB,OAAO,KA9Bf,IAAI/B,EAAgBvhC,KAAK4hC,eAAeR,gBAAgB4B,GACxD,GAAqB,MAAjBzB,EACA,OAAOA,EAGP,IAAIgC,EAAWvjC,KAAK4hC,eAAeN,mBAAmB0B,GACtD,GAAIO,EAAS15B,UACT,OAAOkzB,EAEN,GAA2B,MAAvBA,GACJwG,EAASpC,iBAAiBztB,GAAKmf,OAI/B,CACD,IAAIyQ,EAAevG,GAAuBtW,GAAatI,WACvD,OAAOolB,EAAS/7B,MAAM87B,GAJtB,OAAO,MA0CvB3B,EAAUzhC,UAAU+6B,0BAA4B,SAAU+H,EAAUQ,GAChE,IAAIzI,EAAmBtU,GAAatI,WAChCslB,EAAczjC,KAAK4hC,eAAeR,gBAAgB4B,GACtD,GAAIS,EAOA,OANKA,EAAY3lB,cAEb2lB,EAAYvkB,aAAaoB,GAAgB,SAAU9B,EAAWyU,GAC1D8H,EAAmBA,EAAiBlc,qBAAqBL,EAAWyU,KAGrE8H,EAEN,GAAIyI,EAAwB,CAG7B,IAAIE,EAAU1jC,KAAK4hC,eAAeN,mBAAmB0B,GAWrD,OAVAQ,EAAuBtkB,aAAaoB,GAAgB,SAAU9B,EAAWI,GACrE,IAAItC,EAAOonB,EACNpC,mBAAmB,IAAI5tB,GAAK8K,IAC5BhX,MAAMoX,GACXmc,EAAmBA,EAAiBlc,qBAAqBL,EAAWlC,KAGxEonB,EAAQrC,sBAAsB53B,QAAQ,SAAU8a,GAC5CwW,EAAmBA,EAAiBlc,qBAAqB0F,EAAU5c,KAAM4c,EAAUjI,QAEhFye,EASP,OAJY/6B,KAAK4hC,eAAeN,mBAAmB0B,GAC7C3B,sBAAsB53B,QAAQ,SAAU8a,GAC1CwW,EAAmBA,EAAiBlc,qBAAqB0F,EAAU5c,KAAM4c,EAAUjI,QAEhFye,GAuBf4G,EAAUzhC,UAAUo7B,mCAAqC,SAAU0H,EAAU1Y,EAAWqZ,EAAmBC,GACvGzhC,EAAOwhC,GAAqBC,EAAoB,6DAChD,IAAIjuB,EAAOqtB,EAAStuB,MAAM4V,GAC1B,GAAItqB,KAAK4hC,eAAeT,iBAAiBxrB,GAGrC,OAAO,KAIP,IAAIkuB,EAAa7jC,KAAK4hC,eAAeN,mBAAmB3rB,GACxD,OAAIkuB,EAAWh6B,UAEJ+5B,EAAmBnlB,SAAS6L,GAS5BuZ,EAAWr8B,MAAMo8B,EAAmBnlB,SAAS6L,KAahEqX,EAAUzhC,UAAUw4B,kBAAoB,SAAUsK,EAAUlS,EAAU8S,GAClE,IAAIjuB,EAAOqtB,EAAStuB,MAAMoc,GACtByQ,EAAgBvhC,KAAK4hC,eAAeR,gBAAgBzrB,GACxD,OAAqB,MAAjB4rB,EACOA,EAGHqC,EAAmBxO,mBAAmBtE,GACrB9wB,KAAK4hC,eAAeN,mBAAmB3rB,GACtCnO,MAAMo8B,EAAmBvO,UAAU9W,kBAAkBuS,IAGhE,MAYnB6Q,EAAUzhC,UAAU06B,eAAiB,SAAUjlB,GAC3C,OAAO3V,KAAK4hC,eAAeR,gBAAgBzrB,IAc/CgsB,EAAUzhC,UAAU24B,iBAAmB,SAAUmK,EAAUrK,EAAoB/Q,EAAWlG,EAAOhP,EAASyM,GACtG,IAAI2kB,EACA/J,EAAQ/5B,KAAK4hC,eAAeN,mBAAmB0B,GAC/CzB,EAAgBxH,EAAMqH,gBAAgB1tB,GAAKmf,OAC/C,GAAqB,MAAjB0O,EACAuC,EAAYvC,MAEX,CAAA,GAA0B,MAAtB5I,EAKL,SAJAmL,EAAY/J,EAAMvyB,MAAMmxB,GAO5B,IADAmL,EAAYA,EAAU3jB,UAAUhB,IACjBtV,WAAci6B,EAAUhmB,aAgBnC,SATA,IANA,IAAI8a,KACArjB,EAAM4J,EAAM1C,aACZqJ,EAAOpT,EACLoxB,EAAUtgB,uBAAuBoE,EAAWzI,GAC5C2kB,EAAUvgB,gBAAgBqE,EAAWzI,GACvCne,EAAO8kB,EAAK7E,UACTjgB,GAAQ43B,EAAM92B,OAAS4f,GACG,IAAzBnM,EAAIvU,EAAM4mB,IACVgR,EAAM72B,KAAKf,GAEfA,EAAO8kB,EAAK7E,UAEhB,OAAO2X,GAYf+I,EAAUzhC,UAAU2iC,oBAAsB,SAAUkB,EAAapuB,GAC7D,OAAIouB,EAAYna,KACLma,EAAYpuB,KAAKrM,SAASqM,KAIxBxL,EAAQ45B,EAAYpR,SAAU,SAAUM,EAAWzU,GACxD,OAAOulB,EAAYpuB,KAAKjB,MAAM8J,GAAWlV,SAASqM,MAQ9DgsB,EAAUzhC,UAAU4iC,WAAa,WAC7B9iC,KAAK4hC,eAAiBD,EAAUyB,WAAWpjC,KAAK6hC,WAAYF,EAAUqC,eAAgBtwB,GAAKmf,OACvF7yB,KAAK6hC,WAAW//B,OAAS,EACzB9B,KAAK8hC,aAAe9hC,KAAK6hC,WAAW7hC,KAAK6hC,WAAW//B,OAAS,GAAGogC,QAGhEliC,KAAK8hC,cAAgB,GAU7BH,EAAUqC,eAAiB,SAAUX,GACjC,OAAOA,EAAMlB,SAYjBR,EAAUyB,WAAa,SAAUa,EAAQrG,EAAQsG,GAE7C,IADA,IAAIC,EAAgBzD,GAAc7N,MACzBlwB,EAAI,EAAGA,EAAIshC,EAAOniC,SAAUa,EAAG,CACpC,IAAI0gC,EAAQY,EAAOthC,GAInB,GAAIi7B,EAAOyF,GAAQ,CACf,IAAIlH,EAAYkH,EAAM1tB,KAClBd,OAAe,EACnB,GAAIwuB,EAAMzZ,KACFsa,EAAS56B,SAAS6yB,IAClBtnB,EAAenB,GAAKmB,aAAaqvB,EAAU/H,GAC3CgI,EAAgBA,EAAcvD,SAAS/rB,EAAcwuB,EAAMzZ,OAEtDuS,EAAU7yB,SAAS46B,KACxBrvB,EAAenB,GAAKmB,aAAasnB,EAAW+H,GAC5CC,EAAgBA,EAAcvD,SAASltB,GAAKmf,MAAOwQ,EAAMzZ,KAAKnL,SAAS5J,SAM1E,CAAA,IAAIwuB,EAAM1Q,SAwBX,MAAMrwB,EAAe,8CAvBrB,GAAI4hC,EAAS56B,SAAS6yB,GAClBtnB,EAAenB,GAAKmB,aAAaqvB,EAAU/H,GAC3CgI,EAAgBA,EAAcpD,UAAUlsB,EAAcwuB,EAAM1Q,eAE3D,GAAIwJ,EAAU7yB,SAAS46B,GAExB,IADArvB,EAAenB,GAAKmB,aAAasnB,EAAW+H,IAC3Br6B,UACbs6B,EAAgBA,EAAcpD,UAAUrtB,GAAKmf,MAAOwQ,EAAM1Q,cAEzD,CACD,IAAIje,EAAQlL,EAAQ65B,EAAM1Q,SAAU9d,EAAab,YACjD,GAAIU,EAAO,CAEP,IAAI0vB,EAAW1vB,EAAM+J,SAAS5J,EAAaX,YAC3CiwB,EAAgBA,EAAcvD,SAASltB,GAAKmf,MAAOuR,OAa3E,OAAOD,GAEJxC,KAQPK,GAA8B,WAK9B,SAASA,EAAarsB,EAAM8rB,GACxBzhC,KAAKqkC,UAAY1uB,EACjB3V,KAAK2gC,WAAac,EA4FtB,OAhFAO,EAAa9hC,UAAUi7B,uBAAyB,SAAU4B,EAAqBkG,EAAmBC,GAC9F,OAAOljC,KAAK2gC,WAAWxF,uBAAuBn7B,KAAKqkC,UAAWtH,EAAqBkG,EAAmBC,IAS1GlB,EAAa9hC,UAAU+6B,0BAA4B,SAAUuI,GACzD,OAAOxjC,KAAK2gC,WAAW1F,0BAA0Bj7B,KAAKqkC,UAAWb,IAqBrExB,EAAa9hC,UAAUo7B,mCAAqC,SAAU3lB,EAAMguB,EAAmBC,GAC3F,OAAO5jC,KAAK2gC,WAAWrF,mCAAmCt7B,KAAKqkC,UAAW1uB,EAAMguB,EAAmBC,IAUvG5B,EAAa9hC,UAAU06B,eAAiB,SAAUjlB,GAC9C,OAAO3V,KAAK2gC,WAAW/F,eAAe56B,KAAKqkC,UAAU3vB,MAAMiB,KAa/DqsB,EAAa9hC,UAAU24B,iBAAmB,SAAUF,EAAoB/Q,EAAWlG,EAAOhP,EAASyM,GAC/F,OAAOnf,KAAK2gC,WAAW9H,iBAAiB74B,KAAKqkC,UAAW1L,EAAoB/Q,EAAWlG,EAAOhP,EAASyM,IAU3G6iB,EAAa9hC,UAAUw4B,kBAAoB,SAAU5H,EAAUwT,GAC3D,OAAOtkC,KAAK2gC,WAAWjI,kBAAkB14B,KAAKqkC,UAAWvT,EAAUwT,IAQvEtC,EAAa9hC,UAAUwU,MAAQ,SAAU8J,GACrC,OAAO,IAAIwjB,EAAahiC,KAAKqkC,UAAU3vB,MAAM8J,GAAYxe,KAAK2gC,aAE3DqB,KAwCPuC,GAA0B,WAK1B,SAASA,EAASC,GACdxkC,KAAKwkC,gBAAkBA,EAMvBxkC,KAAKykC,eAAiB1R,GAAcF,MAMpC7yB,KAAK0kC,kBAAoB,IAAI/C,GAC7B3hC,KAAK2kC,kBACL3kC,KAAK4kC,kBA0nBT,OA/mBAL,EAASrkC,UAAU2kC,mBAAqB,SAAUlvB,EAAMmvB,EAAS5C,EAASC,GAGtE,OADAniC,KAAK0kC,kBAAkBzC,aAAatsB,EAAMmvB,EAAS5C,EAASC,GACvDA,EAIMniC,KAAK+kC,4BAA4B,IAAIrQ,GAAU5C,GAAgBK,KAAMxc,EAAMmvB,QAW1FP,EAASrkC,UAAU8kC,eAAiB,SAAUrvB,EAAMsmB,EAAiBiG,GAEjEliC,KAAK0kC,kBAAkBtC,SAASzsB,EAAMsmB,EAAiBiG,GACvD,IAAI+C,EAAalS,GAAcC,WAAWiJ,GAC1C,OAAOj8B,KAAK+kC,4BAA4B,IAAInQ,GAAM9C,GAAgBK,KAAMxc,EAAMsvB,KASlFV,EAASrkC,UAAUg6B,aAAe,SAAUgI,EAAS1P,QAClC,IAAXA,IAAqBA,GAAS,GAClC,IAAI6Q,EAAQrjC,KAAK0kC,kBAAkBrC,SAASH,GAE5C,GADuBliC,KAAK0kC,kBAAkBxD,YAAYgB,GAIrD,CACD,IAAIgD,EAAiBnS,GAAcF,MAUnC,OATkB,MAAdwQ,EAAMzZ,KAENsb,EAAiBA,EAAeh3B,IAAIwF,GAAKmf,OAAO,GAGhDppB,EAAQ45B,EAAM1Q,SAAU,SAAUve,EAAYkI,GAC1C4oB,EAAiBA,EAAeh3B,IAAI,IAAIwF,GAAKU,GAAakI,KAG3Dtc,KAAK+kC,4BAA4B,IAAIzS,GAAa+Q,EAAM1tB,KAAMuvB,EAAgB1S,IAbrF,UAuBR+R,EAASrkC,UAAUilC,qBAAuB,SAAUxvB,EAAMmvB,GACtD,OAAO9kC,KAAK+kC,4BAA4B,IAAIrQ,GAAU5C,GAAgBM,OAAQzc,EAAMmvB,KASxFP,EAASrkC,UAAUklC,iBAAmB,SAAUzvB,EAAMsmB,GAClD,IAAIgJ,EAAalS,GAAcC,WAAWiJ,GAC1C,OAAOj8B,KAAK+kC,4BAA4B,IAAInQ,GAAM9C,GAAgBM,OAAQzc,EAAMsvB,KAQpFV,EAASrkC,UAAUmlC,oBAAsB,SAAU1vB,GAC/C,OAAO3V,KAAK+kC,4BAA4B,IAAIvQ,GAAe1C,GAAgBM,OAAQzc,KAUvF4uB,EAASrkC,UAAUolC,0BAA4B,SAAU3vB,EAAMiU,EAAM2b,GACjE,IAAIC,EAAWxlC,KAAKylC,gBAAgBF,GACpC,GAAgB,MAAZC,EAAkB,CAClB,IAAIE,EAAInB,EAASoB,eAAeH,GAC5BI,EAAYF,EAAE/vB,KAAMsc,EAAUyT,EAAEzT,QAChCpd,EAAenB,GAAKmB,aAAa+wB,EAAWjwB,GAC5CnU,EAAK,IAAIkzB,GAAU5C,GAAgBO,qBAAqBJ,GAAUpd,EAAc+U,GACpF,OAAO5pB,KAAK6lC,sBAAsBD,EAAWpkC,GAI7C,UAWR+iC,EAASrkC,UAAU4lC,sBAAwB,SAAUnwB,EAAMsmB,EAAiBsJ,GACxE,IAAIC,EAAWxlC,KAAKylC,gBAAgBF,GACpC,GAAIC,EAAU,CACV,IAAIE,EAAInB,EAASoB,eAAeH,GAC5BI,EAAYF,EAAE/vB,KAAMsc,EAAUyT,EAAEzT,QAChCpd,EAAenB,GAAKmB,aAAa+wB,EAAWjwB,GAC5CsvB,EAAalS,GAAcC,WAAWiJ,GACtCz6B,EAAK,IAAIozB,GAAM9C,GAAgBO,qBAAqBJ,GAAUpd,EAAcowB,GAChF,OAAOjlC,KAAK6lC,sBAAsBD,EAAWpkC,GAI7C,UAUR+iC,EAASrkC,UAAU6lC,0BAA4B,SAAUpwB,EAAM4vB,GAC3D,IAAIC,EAAWxlC,KAAKylC,gBAAgBF,GACpC,GAAIC,EAAU,CACV,IAAIE,EAAInB,EAASoB,eAAeH,GAC5BI,EAAYF,EAAE/vB,KAAMsc,EAAUyT,EAAEzT,QAChCpd,EAAenB,GAAKmB,aAAa+wB,EAAWjwB,GAC5CnU,EAAK,IAAIgzB,GAAe1C,GAAgBO,qBAAqBJ,GAAUpd,GAC3E,OAAO7U,KAAK6lC,sBAAsBD,EAAWpkC,GAI7C,UAUR+iC,EAASrkC,UAAU8+B,qBAAuB,SAAUrT,EAAOf,GACvD,IAAIjV,EAAOgW,EAAMhW,KACbmlB,EAAc,KACdkL,GAA2B,EAG/BhmC,KAAKykC,eAAevQ,cAAcve,EAAM,SAAUswB,EAAiBC,GAC/D,IAAIrxB,EAAenB,GAAKmB,aAAaoxB,EAAiBtwB,GACtDmlB,EAAcA,GAAeoL,EAAGrH,uBAAuBhqB,GACvDmxB,EACIA,GAA4BE,EAAG9F,oBAEvC,IAUIJ,EAVAmG,EAAYnmC,KAAKykC,eAAe58B,IAAI8N,IACnCwwB,GAKDH,EACIA,GAA4BG,EAAU/F,kBAC1CtF,EAAcA,GAAeqL,EAAUtH,uBAAuBnrB,GAAKmf,SANnEsT,EAAY,IAAIxG,GAChB3/B,KAAKykC,eAAiBzkC,KAAKykC,eAAev2B,IAAIyH,EAAMwwB,IAQrC,MAAfrL,GACAkF,GAAsB,GAGtBA,GAAsB,EACtBlF,EAAcrU,GAAatI,WACbne,KAAKykC,eAAe7R,QAAQjd,GAClC4e,aAAa,SAAU/V,EAAW4nB,GACtC,IAAI5M,EAAgB4M,EAAevH,uBAAuBnrB,GAAKmf,OAC3D2G,IACAsB,EAAcA,EAAYjc,qBAAqBL,EAAWgb,OAItE,IAAI6M,EAAoBF,EAAU1F,mBAAmB9U,GACrD,IAAK0a,IAAsB1a,EAAMC,iBAAiBmT,eAAgB,CAE9D,IAAIyG,EAAWjB,EAAS+B,cAAc3a,GACtCxpB,IAASqjC,KAAYxlC,KAAK4kC,gBAAiB,0CAC3C,IAAIW,EAAMhB,EAASgC,mBACnBvmC,KAAK4kC,eAAeY,GAAYD,EAEhCvlC,KAAK2kC,eAAe,IAAMY,GAAOC,EAErC,IAAIjM,EAAcv5B,KAAK0kC,kBAAkB3C,YAAYpsB,GACjD4nB,EAAS4I,EAAUnH,qBAAqBrT,EAAOf,EAAmB2O,EAAauB,EAAakF,GAChG,IAAKqG,IAAsBL,EAA0B,CACjD,IAAIlG,EAA0BqG,EAAU5F,aAAa5U,GACrD4R,EAASA,EAAO7vB,OAAO1N,KAAKwmC,eAAe7a,EAAOmU,IAEtD,OAAOvC,GAaXgH,EAASrkC,UAAU++B,wBAA0B,SAAUtT,EAAOf,EAAmBsU,GAC7E,IAAI54B,EAAQtG,KAER2V,EAAOgW,EAAMhW,KACb8wB,EAAiBzmC,KAAKykC,eAAe58B,IAAI8N,GACzCwpB,KAIJ,GAAIsH,IAC6B,YAA5B9a,EAAMwE,mBACHsW,EAAehG,mBAAmB9U,IAAS,CAI/C,IAAI+a,EAAmBD,EAAexH,wBAAwBtT,EAAOf,EAAmBsU,GACpFuH,EAAe58B,YACf7J,KAAKykC,eAAiBzkC,KAAKykC,eAAe11B,OAAO4G,IAErD,IAAIuqB,EAAUwG,EAAiBxG,QAC/Bf,EAAeuH,EAAiBnJ,OAOhC,IAAIoJ,GAAmB,IACnBzG,EAAQqC,UAAU,SAAU5W,GACxB,OAAOA,EAAMC,iBAAiBmT,iBAElC6H,EAAU5mC,KAAKykC,eAAe3Q,WAAWne,EAAM,SAAUd,EAAcgyB,GACvE,OAAOA,EAAgBzG,oBAE3B,GAAIuG,IAAoBC,EAAS,CAC7B,IAAIhU,EAAU5yB,KAAKykC,eAAe7R,QAAQjd,GAG1C,IAAKid,EAAQ/oB,UAIT,IAFA,IAAIi9B,EAAW9mC,KAAK+mC,gCAAgCnU,GAE3CjwB,EAAI,EAAGA,EAAImkC,EAAShlC,SAAUa,EAAG,CACtC,IAAIm9B,EAAOgH,EAASnkC,GAAIqkC,EAAWlH,EAAKlB,WACpCqI,EAAWjnC,KAAKknC,uBAAuBpH,GAC3C9/B,KAAKwkC,gBAAgB2C,eAAe5C,EAAS6C,mBAAmBJ,GAAWhnC,KAAKqnC,aAAaL,GAAWC,EAASK,OAAQL,EAAS7rB,aAU9I,IAAKwrB,GAAW1G,EAAQp+B,OAAS,IAAMo9B,EAGnC,GAAIyH,EAAiB,CAGjB3mC,KAAKwkC,gBAAgB+C,cAAchD,EAAS6C,mBAAmBzb,GAD9C,WAIjBuU,EAAQz2B,QAAQ,SAAU+9B,GACtB,IAAIC,EAAcnhC,EAAMs+B,eAAeL,EAAS+B,cAAckB,IAC9DlhC,EAAMk+B,gBAAgB+C,cAAchD,EAAS6C,mBAAmBI,GAAgBC,KAK5FznC,KAAK0nC,YAAYxH,GAKrB,OAAOf,GAWXoF,EAASrkC,UAAUi7B,uBAAyB,SAAUxlB,EAAMstB,GACxD,IACIxB,EAAYzhC,KAAK0kC,kBACjB5J,EAAc96B,KAAKykC,eAAe3Q,WAAWne,EAAM,SAAUie,EAAWuS,GACxE,IAAItxB,EAAenB,GAAKmB,aAAa+e,EAAWje,GAC5CmlB,EAAcqL,EAAUtH,uBAAuBhqB,GACnD,GAAIimB,EACA,OAAOA,IAGf,OAAO2G,EAAUtG,uBAAuBxlB,EAAMmlB,EAAamI,GATnC,IAmB5BsB,EAASrkC,UAAU6mC,gCAAkC,SAAUnU,GAC3D,OAAOA,EAAQc,KAAK,SAAU7e,EAAc8yB,EAAqBC,GAC7D,GAAID,GAAuBA,EAAoBvH,kBAE3C,OADmBuH,EAAoBnH,mBAKvC,IAAIqH,KAOJ,OANIF,IACAE,EAAUF,EAAoBrH,iBAElC72B,EAAQm+B,EAAU,SAAUp/B,EAAKs/B,GAC7BD,EAAUA,EAAQn6B,OAAOo6B,KAEtBD,KAQnBtD,EAASrkC,UAAUwnC,YAAc,SAAUK,GACvC,IAAK,IAAIn8B,EAAI,EAAGA,EAAIm8B,EAAQjmC,SAAU8J,EAAG,CACrC,IAAIo8B,EAAeD,EAAQn8B,GAC3B,IAAKo8B,EAAapc,iBAAiBmT,eAAgB,CAE/C,IAAIkJ,EAAkB1D,EAAS+B,cAAc0B,GACzCE,EAAkBloC,KAAK4kC,eAAeqD,UACnCjoC,KAAK4kC,eAAeqD,UACpBjoC,KAAK2kC,eAAe,IAAMuD,MAU7C3D,EAAS6C,mBAAqB,SAAUzb,GACpC,OAAIA,EAAMC,iBAAiBmT,iBACtBpT,EAAMC,iBAAiBuc,YAIKxc,EAAMjB,SAG5BiB,GAWf4Y,EAASrkC,UAAUsmC,eAAiB,SAAU7a,EAAOmU,GACjD,IAAInqB,EAAOgW,EAAMhW,KACb4vB,EAAMvlC,KAAKqnC,aAAa1b,GACxBsb,EAAWjnC,KAAKknC,uBAAuBpH,GACvCvC,EAASv9B,KAAKwkC,gBAAgB2C,eAAe5C,EAAS6C,mBAAmBzb,GAAQ4Z,EAAK0B,EAASK,OAAQL,EAAS7rB,YAChHwX,EAAU5yB,KAAKykC,eAAe7R,QAAQjd,GAG1C,GAAI4vB,EACApjC,GAAQywB,EAAQhxB,MAAMw+B,kBAAmB,0DAsBzC,IAlBA,IAAIgI,EAAgBxV,EAAQc,KAAK,SAAU7e,EAAc8yB,EAAqBC,GAC1E,IAAK/yB,EAAahL,WACd89B,GACAA,EAAoBvH,kBACpB,OAAQuH,EAAoBnH,kBAAkB5B,YAI9C,IAAIyJ,KAOJ,OANIV,IACAU,EAAYA,EAAU36B,OAAOi6B,EAAoBrH,gBAAgBt2B,IAAI,SAAU81B,GAAQ,OAAOA,EAAKlB,eAEvGn1B,EAAQm+B,EAAU,SAAUp/B,EAAK8/B,GAC7BD,EAAYA,EAAU36B,OAAO46B,KAE1BD,IAGN1lC,EAAI,EAAGA,EAAIylC,EAActmC,SAAUa,EAAG,CAC3C,IAAI4lC,EAAcH,EAAczlC,GAChC3C,KAAKwkC,gBAAgB+C,cAAchD,EAAS6C,mBAAmBmB,GAAcvoC,KAAKqnC,aAAakB,IAGvG,OAAOhL,GAQXgH,EAASrkC,UAAUgnC,uBAAyB,SAAUpH,GAClD,IAAIx5B,EAAQtG,KACR2rB,EAAQmU,EAAKlB,WACb2G,EAAMvlC,KAAKqnC,aAAa1b,GAC5B,OACI2b,OAAQ,WAEJ,OADYxH,EAAK7J,kBAAoBxP,GAAatI,YACrCsB,QAEjBrE,WAAY,SAAUotB,GAClB,GAAe,OAAXA,EACA,OAAIjD,EACOj/B,EAAMy/B,0BAA0Bpa,EAAMhW,KAAM4vB,GAG5Cj/B,EAAM++B,oBAAoB1Z,EAAMhW,MAM3C,IAAI8yB,EAhyQC,SAAUnhC,EAAMqkB,GACrC,IAAI+c,EAAS,gBACA,YAATphC,EACAohC,EACI,0FAGS,qBAARphC,EACLohC,EAAS,6DAEI,eAARphC,IACLohC,EAAS,8BAEb,IAAI/iC,EAAQ,IAAIpD,MAAM+E,EAAO,OAASqkB,EAAMhW,KAAKlN,WAAa,KAAOigC,GAErE,OADA/iC,EAAM2B,KAAOA,EAAKqhC,cACXhjC,EAixQwBijC,CAAmBJ,EAAQ7c,GAC1C,OAAOrlB,EAAM24B,wBAAwBtT,EACf,KAAM8c,MAW5ClE,EAAS+B,cAAgB,SAAU3a,GAC/B,OAAOA,EAAMhW,KAAKlN,WAAa,IAAMkjB,EAAMwE,mBAQ/CoU,EAASoB,eAAiB,SAAUH,GAChC,IAAIqD,EAAarD,EAAS3uB,QAAQ,KAElC,OADA1U,GAAuB,IAAhB0mC,GAAqBA,EAAarD,EAAS1jC,OAAS,EAAG,kBAE1DmwB,QAASuT,EAAS1yB,OAAO+1B,EAAa,GACtClzB,KAAM,IAAIjC,GAAK8xB,EAAS1yB,OAAO,EAAG+1B,MAS1CtE,EAASrkC,UAAUulC,gBAAkB,SAAUF,GAC3C,OAAOvlC,KAAK2kC,eAAe,IAAMY,IAQrChB,EAASrkC,UAAUmnC,aAAe,SAAU1b,GACxC,IAAI6Z,EAAWjB,EAAS+B,cAAc3a,GACtC,OAAOniB,EAAQxJ,KAAK4kC,eAAgBY,IAOxCjB,EAASgC,iBAAmB,WACxB,OAAOhC,EAASuE,iBAUpBvE,EAASrkC,UAAU2lC,sBAAwB,SAAUD,EAAWtM,GAC5D,IAAI6M,EAAYnmC,KAAKykC,eAAe58B,IAAI+9B,GACxCzjC,EAAOgkC,EAAW,wDAClB,IAAI5M,EAAcv5B,KAAK0kC,kBAAkB3C,YAAY6D,GACrD,OAAOO,EAAU/M,eAAeE,EAAWC,EAC1B,OAmBrBgL,EAASrkC,UAAU6kC,4BAA8B,SAAUzL,GACvD,OAAOt5B,KAAK+oC,sBAAsBzP,EAAWt5B,KAAKykC,eACjC,KAAMzkC,KAAK0kC,kBAAkB3C,YAAYruB,GAAKmf,SAYnE0R,EAASrkC,UAAU6oC,sBAAwB,SAAUzP,EAAW0P,EAAelO,EAAavB,GACxF,GAAID,EAAU3jB,KAAK9L,UACf,OAAO7J,KAAKipC,iCAAiC3P,EAAW0P,EAAelO,EAAavB,GAGpF,IAAI4M,EAAY6C,EAAcnhC,IAAI6L,GAAKmf,OAEpB,MAAfiI,GAAoC,MAAbqL,IACvBrL,EAAcqL,EAAUtH,uBAAuBnrB,GAAKmf,QAExD,IAAI0K,KACA/e,EAAY8a,EAAU3jB,KAAK3B,WAC3Bk1B,EAAiB5P,EAAU5G,kBAAkBlU,GAC7CqG,EAAYmkB,EAAcrW,SAAS9qB,IAAI2W,GAC3C,GAAIqG,GAAaqkB,EAAgB,CAC7B,IAAIC,EAAmBrO,EACjBA,EAAYvc,kBAAkBC,GAC9B,KACF4qB,EAAmB7P,EAAY7kB,MAAM8J,GACzC+e,EAASA,EAAO7vB,OAAO1N,KAAK+oC,sBAAsBG,EAAgBrkB,EAAWskB,EAAkBC,IAKnG,OAHIjD,IACA5I,EAASA,EAAO7vB,OAAOy4B,EAAU/M,eAAeE,EAAWC,EAAauB,KAErEyC,GAafgH,EAASrkC,UAAU+oC,iCAAmC,SAAU3P,EAAW0P,EAAelO,EAAavB,GACnG,IAAIjzB,EAAQtG,KACRmmC,EAAY6C,EAAcnhC,IAAI6L,GAAKmf,OAEpB,MAAfiI,GAAoC,MAAbqL,IACvBrL,EAAcqL,EAAUtH,uBAAuBnrB,GAAKmf,QAExD,IAAI0K,KAcJ,OAbAyL,EAAcrW,SAAShR,iBAAiB,SAAUnD,EAAWqG,GACzD,IAAIskB,EAAmBrO,EACjBA,EAAYvc,kBAAkBC,GAC9B,KACF4qB,EAAmB7P,EAAY7kB,MAAM8J,GACrC0qB,EAAiB5P,EAAU5G,kBAAkBlU,GAC7C0qB,IACA3L,EAASA,EAAO7vB,OAAOpH,EAAM2iC,iCAAiCC,EAAgBrkB,EAAWskB,EAAkBC,OAG/GjD,IACA5I,EAASA,EAAO7vB,OAAOy4B,EAAU/M,eAAeE,EAAWC,EAAauB,KAErEyC,GAOXgH,EAASuE,cAAgB,EAClBvE,KAuBP8E,GAAgC,WAChC,SAASA,IACLrpC,KAAKspC,UAAY7iB,GAAatI,WAQlC,OANAkrB,EAAenpC,UAAUm1B,QAAU,SAAU1f,GACzC,OAAO3V,KAAKspC,UAAU7qB,SAAS9I,IAEnC0zB,EAAenpC,UAAUqpC,eAAiB,SAAU5zB,EAAM6zB,GACtDxpC,KAAKspC,UAAYtpC,KAAKspC,UAAUvqB,YAAYpJ,EAAM6zB,IAE/CH,KAqBPI,GAAmC,WAInC,SAASA,EAAkBC,GACvB1pC,KAAK0pC,KAAOA,EAsDhB,OAhDAD,EAAkBvpC,UAAUypC,SAAW,SAAUC,GAC7C,OAAO5pC,KAAK0pC,KAAe,SAAY,SAAEE,GAAcC,KAAK,KAE5D,SAAUpB,GAGN,OAAIA,GAA8B,+BAAlBA,EAASnhC,MACrBmG,GAAI,kEACG,MAGAjH,QAAQE,OAAO+hC,MAIlCgB,EAAkBvpC,UAAU4pC,uBAAyB,SAAU7C,GAG3DjnC,KAAK0pC,KAAe,SAAwB,qBAAEzC,IAElDwC,EAAkBvpC,UAAU6pC,0BAA4B,SAAU9C,GAC9DjnC,KAAK0pC,KAAe,SAA2B,wBAAEzC,IAErDwC,EAAkBvpC,UAAU8pC,sBAAwB,WAChD,IAAIC,EAAe,0DACfjqC,KAAK0pC,KAAK/hC,KACV,iFAEA,eAAgB3H,KAAK0pC,KAAKQ,QAC1BD,GACI,uJAIC,mBAAoBjqC,KAAK0pC,KAAKQ,QACnCD,GACI,2JAKJA,GACI,kKAIRp8B,GAAKo8B,IAEFR,KAuBPU,GAAiC,WACjC,SAASA,IACLnqC,KAAKoqC,aAWT,OATAD,EAAgBjqC,UAAUmqC,iBAAmB,SAAU1iC,EAAM2iC,QAC1C,IAAXA,IAAqBA,EAAS,GAC7BhhC,EAAStJ,KAAKoqC,UAAWziC,KAC1B3H,KAAKoqC,UAAUziC,GAAQ,GAC3B3H,KAAKoqC,UAAUziC,IAAS2iC,GAE5BH,EAAgBjqC,UAAU2H,IAAM,WAC5B,OAAOjC,EAAS5F,KAAKoqC,YAElBD,KAkBPI,GAA8B,WAC9B,SAASA,KAkBT,OAhBAA,EAAaC,cAAgB,SAAUhyB,GACnC,IAAIiyB,EAAajyB,EAAS/P,WAI1B,OAHKzI,KAAK0qC,aAAaD,KACnBzqC,KAAK0qC,aAAaD,GAAc,IAAIN,IAEjCnqC,KAAK0qC,aAAaD,IAE7BF,EAAaI,oBAAsB,SAAUnyB,EAAUoyB,GACnD,IAAIH,EAAajyB,EAAS/P,WAI1B,OAHKzI,KAAK6qC,WAAWJ,KACjBzqC,KAAK6qC,WAAWJ,GAAcG,KAE3B5qC,KAAK6qC,WAAWJ,IAE3BF,EAAaG,gBACbH,EAAaM,cACNN,KAwBPO,GAA+B,WAC/B,SAASA,EAAcC,GACnB/qC,KAAK+qC,YAAcA,EACnB/qC,KAAKgrC,MAAQ,KAajB,OAXAF,EAAc5qC,UAAU2H,IAAM,WAC1B,IAAIojC,EAAWjrC,KAAK+qC,YAAYljC,MAC5BqjC,EAAQvhC,EAAMshC,GAOlB,OANIjrC,KAAKgrC,OACLvhC,EAAQzJ,KAAKgrC,MAAO,SAAUG,EAAMvpC,GAChCspC,EAAMC,GAAQD,EAAMC,GAAQvpC,IAGpC5B,KAAKgrC,MAAQC,EACNC,GAEJJ,KAqBPM,GAAuB,IACvBC,GAAuB,IAMvBC,GAA+B,WAK/B,SAASA,EAAcC,EAAYC,GAC/BxrC,KAAKwrC,QAAUA,EACfxrC,KAAKyrC,kBACLzrC,KAAK0rC,eAAiB,IAAIZ,GAAcS,GACxC,IAAI93B,EAAU23B,IACTC,GAAuBD,IAAwBj5B,KAAKiK,SACzD7I,GAAsBvT,KAAK2rC,aAAat7B,KAAKrQ,MAAOmS,KAAKI,MAAMkB,IAsBnE,OApBA63B,EAAcprC,UAAU0rC,YAAc,SAAUT,GAC5CnrC,KAAKyrC,eAAeN,IAAQ,GAEhCG,EAAcprC,UAAUyrC,aAAe,WACnC,IAAIrlC,EAAQtG,KACR6rC,EAAQ7rC,KAAK0rC,eAAe7jC,MAC5BikC,KACAC,GAAoB,EACxBtiC,EAAQoiC,EAAO,SAAUV,EAAMvpC,GACvBA,EAAQ,GAAK0H,EAAShD,EAAMmlC,eAAgBN,KAC5CW,EAAcX,GAAQvpC,EACtBmqC,GAAoB,KAGxBA,GACA/rC,KAAKwrC,QAAQQ,YAAYF,GAG7Bv4B,GAAsBvT,KAAK2rC,aAAat7B,KAAKrQ,MAAOmS,KAAKI,MAAsB,EAAhBJ,KAAKiK,SAnChD,OAqCjBkvB,KAgCPW,GAA4B,WAC5B,SAASA,IAKLjsC,KAAKksC,eAMLlsC,KAAKmsC,gBAAkB,EA+E3B,OA1EAF,EAAW/rC,UAAUksC,YAAc,SAAUC,GAGzC,IADA,IAAIC,EAAW,KACN3pC,EAAI,EAAGA,EAAI0pC,EAAcvqC,OAAQa,IAAK,CAC3C,IAAIopB,EAAYsgB,EAAc1pC,GAC1B4pC,EAAYxgB,EAAUjB,UACT,OAAbwhB,GAAsBC,EAAU/2B,OAAO82B,EAASxhB,aAChD9qB,KAAKksC,YAAYnqC,KAAKuqC,GACtBA,EAAW,MAEE,OAAbA,IACAA,EAAW,IAAIE,GAAUD,IAE7BD,EAAS7b,IAAI1E,GAEbugB,GACAtsC,KAAKksC,YAAYnqC,KAAKuqC,IAY9BL,EAAW/rC,UAAUusC,kBAAoB,SAAU92B,EAAM02B,GACrDrsC,KAAKosC,YAAYC,GACjBrsC,KAAK0sC,oCAAoC,SAAUH,GAC/C,OAAOA,EAAU/2B,OAAOG,MAYhCs2B,EAAW/rC,UAAUysC,0BAA4B,SAAUC,EAAaP,GACpErsC,KAAKosC,YAAYC,GACjBrsC,KAAK0sC,oCAAoC,SAAUH,GAC/C,OAAOA,EAAUjjC,SAASsjC,IAAgBA,EAAYtjC,SAASijC,MAOvEN,EAAW/rC,UAAUwsC,oCAAsC,SAAUvZ,GACjEnzB,KAAKmsC,kBAEL,IADA,IAAIU,GAAU,EACLlqC,EAAI,EAAGA,EAAI3C,KAAKksC,YAAYpqC,OAAQa,IAAK,CAC9C,IAAImqC,EAAY9sC,KAAKksC,YAAYvpC,GACjC,GAAImqC,EAEI3Z,EADY2Z,EAAUhiB,YAEtB9qB,KAAKksC,YAAYvpC,GAAGoqC,QACpB/sC,KAAKksC,YAAYvpC,GAAK,MAGtBkqC,GAAU,EAIlBA,IACA7sC,KAAKksC,gBAETlsC,KAAKmsC,mBAEFF,KAMPO,GAA2B,WAC3B,SAASA,EAAUvyB,GACfja,KAAKia,MAAQA,EAKbja,KAAKgtC,WA8BT,OAzBAR,EAAUtsC,UAAUuwB,IAAM,SAAU1E,GAChC/rB,KAAKgtC,QAAQjrC,KAAKgqB,IAKtBygB,EAAUtsC,UAAU6sC,MAAQ,WACxB,IAAK,IAAIpqC,EAAI,EAAGA,EAAI3C,KAAKgtC,QAAQlrC,OAAQa,IAAK,CAC1C,IAAIopB,EAAY/rB,KAAKgtC,QAAQrqC,GAC7B,GAAkB,OAAdopB,EAAoB,CACpB/rB,KAAKgtC,QAAQrqC,GAAK,KAClB,IAAIsqC,EAAUlhB,EAAUb,iBACpBlb,GACAvC,GAAI,UAAYse,EAAUtjB,YAE9B0K,GAAe85B,MAO3BT,EAAUtsC,UAAU4qB,QAAU,WAC1B,OAAO9qB,KAAKia,OAETuyB,KAsBPU,GAA8B,WAI9B,SAASA,EAAaC,GAClBntC,KAAKmtC,eAAiBA,EACtBntC,KAAKotC,cACLjrC,EAAO1C,MAAMkE,QAAQwpC,IAAmBA,EAAerrC,OAAS,EAAG,8BA6CvE,OAtCAorC,EAAahtC,UAAUmtC,QAAU,SAAU1yB,GAEvC,IADA,IAAI5K,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,EAAK,GAAK1F,UAAU0F,GAEjC,GAAI1N,MAAMkE,QAAQ3D,KAAKotC,WAAWzyB,IAG9B,IADA,IAAI2yB,EAAYttC,KAAKotC,WAAWzyB,GAAWjS,QAClC/F,EAAI,EAAGA,EAAI2qC,EAAUxrC,OAAQa,IAClC2qC,EAAU3qC,GAAGiE,SAASY,MAAM8lC,EAAU3qC,GAAG8J,QAASsD,IAI9Dm9B,EAAahtC,UAAUiuB,GAAK,SAAUxT,EAAW/T,EAAU6F,GACvDzM,KAAKutC,mBAAmB5yB,GACxB3a,KAAKotC,WAAWzyB,GAAa3a,KAAKotC,WAAWzyB,OAC7C3a,KAAKotC,WAAWzyB,GAAW5Y,MAAO6E,SAAUA,EAAU6F,QAASA,IAC/D,IAAIsf,EAAY/rB,KAAKwtC,gBAAgB7yB,GACjCoR,GACAnlB,EAASY,MAAMiF,EAASsf,IAGhCmhB,EAAahtC,UAAU2uB,IAAM,SAAUlU,EAAW/T,EAAU6F,GACxDzM,KAAKutC,mBAAmB5yB,GAExB,IADA,IAAI2yB,EAAYttC,KAAKotC,WAAWzyB,OACvBhY,EAAI,EAAGA,EAAI2qC,EAAUxrC,OAAQa,IAClC,GAAI2qC,EAAU3qC,GAAGiE,WAAaA,KACxB6F,GAAWA,IAAY6gC,EAAU3qC,GAAG8J,SAEtC,YADA6gC,EAAU7K,OAAO9/B,EAAG,IAKhCuqC,EAAahtC,UAAUqtC,mBAAqB,SAAU5yB,GAClDxY,EAAOnC,KAAKmtC,eAAetc,KAAK,SAAU4c,GACtC,OAAOA,IAAO9yB,IACd,kBAAoBA,IAErBuyB,KAqBPQ,GAAmC,SAAUnjC,GAE7C,SAASmjC,IACL,IACIC,EACAC,EAFAtnC,EAAQiE,EAAO7I,KAAK1B,MAAO,aAAeA,KAqC9C,MAlCwB,oBAAb6tC,eAC8B,IAA9BA,SAASC,wBACkB,IAAvBD,SAAiB,QAExBD,EAAmB,mBACnBD,EAAS,eAE6B,IAA1BE,SAAoB,WAChCD,EAAmB,sBACnBD,EAAS,kBAE4B,IAAzBE,SAAmB,UAC/BD,EAAmB,qBACnBD,EAAS,iBAEgC,IAA7BE,SAAuB,eACnCD,EAAmB,yBACnBD,EAAS,iBAOjBrnC,EAAMynC,UAAW,EACbH,GACAC,SAASC,iBAAiBF,EAAkB,WACxC,IAAIzL,GAAW0L,SAASF,GACpBxL,IAAY77B,EAAMynC,WAClBznC,EAAMynC,SAAW5L,EACjB77B,EAAM+mC,QAAQ,UAAWlL,MAE9B,GAEA77B,EAaX,OApDAxG,EAAU4tC,EAAmBnjC,GAyC7BmjC,EAAkBM,YAAc,WAC5B,OAAO,IAAIN,GAMfA,EAAkBxtC,UAAUstC,gBAAkB,SAAU7yB,GAEpD,OADAxY,EAAqB,YAAdwY,EAAyB,uBAAyBA,IACjD3a,KAAK+tC,WAEVL,GACTR,IA0BEe,GAA+B,SAAU1jC,GAEzC,SAAS0jC,IACL,IAAI3nC,EAAQiE,EAAO7I,KAAK1B,MAAO,YAAcA,KAsB7C,OArBAsG,EAAM4nC,SAAU,EAKM,oBAAXnnC,aAC4B,IAA5BA,OAAO+mC,kBACbhnC,MACDC,OAAO+mC,iBAAiB,SAAU,WACzBxnC,EAAM4nC,UACP5nC,EAAM4nC,SAAU,EAChB5nC,EAAM+mC,QAAQ,UAAU,MAE7B,GACHtmC,OAAO+mC,iBAAiB,UAAW,WAC3BxnC,EAAM4nC,UACN5nC,EAAM4nC,SAAU,EAChB5nC,EAAM+mC,QAAQ,UAAU,MAE7B,IAEA/mC,EAmBX,OA3CAxG,EAAUmuC,EAAe1jC,GA0BzB0jC,EAAcD,YAAc,WACxB,OAAO,IAAIC,GAMfA,EAAc/tC,UAAUstC,gBAAkB,SAAU7yB,GAEhD,OADAxY,EAAqB,WAAdwY,EAAwB,uBAAyBA,IAChD3a,KAAKkuC,UAKjBD,EAAc/tC,UAAUiuC,gBAAkB,WACtC,OAAOnuC,KAAKkuC,SAETD,GACTf,IAsBEkB,GAAgC,WAIhC,SAASA,EAAeC,GACpBruC,KAAKquC,WAAaA,EAClBruC,KAAKsuC,oBACLtuC,KAAKuuC,mBAAqB,EAC1BvuC,KAAKwuC,oBAAsB,EAC3BxuC,KAAKyuC,QAAU,KAiDnB,OA/CAL,EAAeluC,UAAUwuC,WAAa,SAAUC,EAAa/nC,GACzD5G,KAAKwuC,mBAAqBG,EAC1B3uC,KAAKyuC,QAAU7nC,EACX5G,KAAKwuC,mBAAqBxuC,KAAKuuC,qBAC/BvuC,KAAKyuC,UACLzuC,KAAKyuC,QAAU,OAUvBL,EAAeluC,UAAU0uC,eAAiB,SAAUC,EAAY1mC,GAC5D,IAAI7B,EAAQtG,KACZA,KAAKsuC,iBAAiBO,GAAc1mC,EAwBpC,IAvBA,IAAI2mC,EAAU,WACV,IAAIC,EAAYC,EAAOV,iBAAiBU,EAAOT,2BACxCS,EAAOV,iBAAiBU,EAAOT,oBAQtC,IAPA,IAAIU,EAAU,SAAUtsC,GAChBosC,EAAUpsC,IACVwQ,GAAe,WACX7M,EAAM+nC,WAAWU,EAAUpsC,OAI9BA,EAAI,EAAGA,EAAIosC,EAAUjtC,SAAUa,EACpCssC,EAAQtsC,GAEZ,GAAIqsC,EAAOT,qBAAuBS,EAAOR,mBAKrC,OAJIQ,EAAOP,UACPO,EAAOP,UACPO,EAAOP,QAAU,MAEd,QAEXO,EAAOT,sBAEPS,EAAShvC,KACNA,KAAKsuC,iBAAiBtuC,KAAKuuC,qBAAqB,CAEnD,GAAgB,UADFO,IAEV,QAGLV,KAqBPc,GAAoC,aACpCC,GAAiC,UAoCjCC,GAAuC,WASvC,SAASA,EAAsBC,EAAQ72B,EAAU82B,EAAoBC,GACjEvvC,KAAKqvC,OAASA,EACdrvC,KAAKwY,SAAWA,EAChBxY,KAAKsvC,mBAAqBA,EAC1BtvC,KAAKuvC,cAAgBA,EACrBvvC,KAAKwvC,UAAY,EACjBxvC,KAAKyvC,cAAgB,EACrBzvC,KAAK0vC,gBAAiB,EACtB1vC,KAAK2vC,KAAOr/B,GAAW++B,GACvBrvC,KAAK4vC,OAASrF,GAAaC,cAAchyB,GACzCxY,KAAK6vC,MAAQ,SAAUt4B,GACnB,OAAOiB,EAASnB,cAAchB,GAAckB,IAsOpD,OA9NA63B,EAAsBlvC,UAAU4vC,KAAO,SAAUC,EAAWC,GACxD,IAAI1pC,EAAQtG,KACZA,KAAKiwC,cAAgB,EACrBjwC,KAAKkwC,cAAgBF,EACrBhwC,KAAKmwC,gBAAkB,IAAI/B,GAAe2B,GAC1C/vC,KAAKowC,WAAY,EACjBpwC,KAAKqwC,qBAAuBj9B,WAAW,WACnC9M,EAAMqpC,KAAK,gCAEXrpC,EAAMgqC,YACNhqC,EAAM+pC,qBAAuB,MAC9Bl+B,KAAKI,MA9CS,MAh/SC,SAAU7I,GAChC,GAAIxC,KAAuC,aAAxB2mC,SAAS0C,WACxB7mC,QAEC,CAGD,IAAI8mC,GAAW,EACXC,EAAc,WACT5C,SAASvtC,KAITkwC,IACDA,GAAW,EACX9mC,KALA0J,WAAWq9B,EAAat+B,KAAKI,MAAM,MAQvCs7B,SAASC,kBACTD,SAASC,iBAAiB,mBAAoB2C,GAAa,GAE3D1pC,OAAO+mC,iBAAiB,OAAQ2C,GAAa,IAExC5C,SAAS6C,cAEd7C,SAAS6C,YAAY,qBAAsB,WACX,aAAxB7C,SAAS0C,YACTE,MAGR1pC,OAAO2pC,YAAY,SAAUD,KAkgTjCE,CAAoB,WAChB,IAAIrqC,EAAM8pC,UAAV,CAGA9pC,EAAMsqC,gBAAkB,IAAIC,GAA2B,WAEnD,IADA,IAAI3jC,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzB,IAAI2jC,EAAU5jC,EAAK,GAAI6jC,EAAO7jC,EAAK,GAAI8jC,EAAO9jC,EAAK,GAEnD,GADA5G,EAAM2qC,wBAAwB/jC,GACzB5G,EAAMsqC,gBAOX,GALItqC,EAAM+pC,uBACNa,aAAa5qC,EAAM+pC,sBACnB/pC,EAAM+pC,qBAAuB,MAEjC/pC,EAAMopC,gBAAiB,EAjGH,SAkGhBoB,EACAxqC,EAAMsG,GAAKmkC,EACXzqC,EAAM6qC,SAAWH,MAEhB,CAAA,GArGiB,UAqGbF,EAiBL,MAAM,IAAIvuC,MAAM,kCAAoCuuC,GAfhDC,GAGAzqC,EAAMsqC,gBAAgBQ,cAAe,EAGrC9qC,EAAM6pC,gBAAgBzB,WAAWqC,EAAM,WACnCzqC,EAAMgqC,eAIVhqC,EAAMgqC,cAMf,WAEC,IADA,IAAIpjC,KACKC,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpCD,EAAKC,GAAM1F,UAAU0F,GAEzB,IAAIkkC,EAAKnkC,EAAK,GAAI/E,EAAO+E,EAAK,GAC9B5G,EAAM2qC,wBAAwB/jC,GAC9B5G,EAAM6pC,gBAAgBvB,eAAeyC,EAAIlpC,IAC1C,WACC7B,EAAMgqC,aACPhqC,EAAMupC,OAGT,IAAIyB,GACJC,MAA2C,KAC3CD,EAAwC,IAAIn/B,KAAKI,MAAsB,IAAhBJ,KAAKiK,UACxD9V,EAAMsqC,gBAAgBY,2BACtBF,EAA6C,GAAIhrC,EAAMsqC,gBAAgBY,0BAC3EF,EAAuB,EAp6RZ,IAq6RPhrC,EAAMgpC,qBACNgC,EAAiC,EAAIhrC,EAAMgpC,oBAE3ChpC,EAAMipC,gBACN+B,EAA4B,GAAIhrC,EAAMipC,gBAErCroC,KACmB,oBAAbmR,UACPA,SAASo5B,OACgC,IAAzCp5B,SAASo5B,KAAK56B,QAz6RX,oBA06RHy6B,EAAuB,EA36RvB,KA66RJ,IAAII,EAAaprC,EAAMupC,MAAMyB,GAC7BhrC,EAAMqpC,KAAK,+BAAiC+B,GAC5CprC,EAAMsqC,gBAAgBe,OAAOD,EAAY,kBAQjDtC,EAAsBlvC,UAAUqxC,MAAQ,WACpCvxC,KAAK4wC,gBAAgBgB,cAAc5xC,KAAK4M,GAAI5M,KAAKmxC,UACjDnxC,KAAK6xC,uBAAuB7xC,KAAK4M,GAAI5M,KAAKmxC,WAK9C/B,EAAsB0C,WAAa,WAC/B1C,EAAsB2C,aAAc,GAKxC3C,EAAsB4C,cAAgB,WAClC5C,EAAsB6C,gBAAiB,GAG3C7C,EAAsB8C,YAAc,WAGhC,OAAQ9C,EAAsB2C,cACxB3C,EAAsB6C,gBACA,oBAAbpE,UACmB,MAA1BA,SAASsE,iBAz5SO,iBAAXprC,QACbA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAOsR,SAASo5B,UAQV,iBAAZW,SAA8C,iBAAfA,QAAQC,MAi5SxCnrC,KAKbkoC,EAAsBlvC,UAAUoyC,sBAAwB,aAKxDlD,EAAsBlvC,UAAUqyC,UAAY,WACxCvyC,KAAKowC,WAAY,EACbpwC,KAAK4wC,kBACL5wC,KAAK4wC,gBAAgB4B,QACrBxyC,KAAK4wC,gBAAkB,MAGvB5wC,KAAKyyC,iBACL5E,SAASvtC,KAAKoyC,YAAY1yC,KAAKyyC,gBAC/BzyC,KAAKyyC,eAAiB,MAEtBzyC,KAAKqwC,uBACLa,aAAalxC,KAAKqwC,sBAClBrwC,KAAKqwC,qBAAuB,OAOpCjB,EAAsBlvC,UAAUowC,UAAY,WACnCtwC,KAAKowC,YACNpwC,KAAK2vC,KAAK,8BACV3vC,KAAKuyC,YACDvyC,KAAKkwC,gBACLlwC,KAAKkwC,cAAclwC,KAAK0vC,gBACxB1vC,KAAKkwC,cAAgB,QAQjCd,EAAsBlvC,UAAUsyC,MAAQ,WAC/BxyC,KAAKowC,YACNpwC,KAAK2vC,KAAK,6BACV3vC,KAAKuyC,cAQbnD,EAAsBlvC,UAAUyyC,KAAO,SAAUxqC,GAC7C,IAAIyqC,EAAU9pC,EAAUX,GACxBnI,KAAKwvC,WAAaoD,EAAQ9wC,OAC1B9B,KAAK4vC,OAAOvF,iBAAiB,aAAcuI,EAAQ9wC,QAQnD,IANA,IFltTA6N,EEktTIkjC,GFltTJljC,EAAYnN,EEktTkBowC,GFjtT3B9vC,EAAOU,gBAAgBmM,GAAW,IEotTjCgC,EAAWH,GAAkBqhC,EAzOlBC,MA4ONnwC,EAAI,EAAGA,EAAIgP,EAAS7P,OAAQa,IACjC3C,KAAK4wC,gBAAgBmC,eAAe/yC,KAAKiwC,cAAet+B,EAAS7P,OAAQ6P,EAAShP,IAClF3C,KAAKiwC,iBAUbb,EAAsBlvC,UAAU2xC,uBAAyB,SAAUjlC,EAAIomC,GACnE,IAAI9rC,IAAJ,CAEAlH,KAAKyyC,eAAiB5E,SAASsE,cAAc,UAC7C,IAAIb,GACJ2B,OAA2D,KAC3D3B,EAAoC,GAAI1kC,EACxC0kC,EAAoC,GAAI0B,EACxChzC,KAAKyyC,eAAeS,IAAMlzC,KAAK6vC,MAAMyB,GACrCtxC,KAAKyyC,eAAeU,MAAMC,QAAU,OACpCvF,SAASvtC,KAAK+yC,YAAYrzC,KAAKyyC,kBAOnCrD,EAAsBlvC,UAAU+wC,wBAA0B,SAAU/jC,GAEhE,IAAIuiC,EAAgB3mC,EAAUoE,GAAMpL,OACpC9B,KAAKyvC,eAAiBA,EACtBzvC,KAAK4vC,OAAOvF,iBAAiB,iBAAkBoF,IAE5CL,KAMPyB,GAA4C,WAO5C,SAASA,EAA2ByC,EAAWC,EAAavD,EAAcH,GAoBtE,GAnBA7vC,KAAKgwC,aAAeA,EACpBhwC,KAAK6vC,MAAQA,EAMb7vC,KAAKwzC,oBAAsB,IAAIhjB,GAE/BxwB,KAAKyzC,eAMLzzC,KAAK0zC,cAAgBvhC,KAAKI,MAAsB,IAAhBJ,KAAKiK,UAGrCpc,KAAKoxC,cAAe,EACflqC,IAkCDlH,KAAKszC,UAAYA,EACjBtzC,KAAKuzC,YAAcA,MAnCL,CAKdvzC,KAAKwxC,yBAA2B/hC,IAChC1I,OAAOmoC,GAAoClvC,KAAKwxC,0BAA4B8B,EAC5EvsC,OAAOooC,GAAiCnvC,KAAKwxC,0BAA4B+B,EAEzEvzC,KAAK2zC,SAAW9C,EAA2B+C,gBAE3C,IAAIC,EAAS,GAGb,GAAI7zC,KAAK2zC,SAAST,KACwC,gBAAtDlzC,KAAK2zC,SAAST,IAAIpgC,OAAO,EAAG,cAAchR,QAE1C+xC,EAAS,4BADWhG,SAASj3B,OAC0B,eAE3D,IAAIk9B,EAAiB,eAAiBD,EAAS,iBAC/C,IACI7zC,KAAK2zC,SAASI,IAAIjE,OAClB9vC,KAAK2zC,SAASI,IAAI1Q,MAAMyQ,GACxB9zC,KAAK2zC,SAASI,IAAIvB,QAEtB,MAAOxwC,GACHyL,GAAI,2BACAzL,EAAE8F,OACF2F,GAAIzL,EAAE8F,OAEV2F,GAAIzL,KAsPhB,OAxOA6uC,EAA2B+C,cAAgB,WACvC,IAAII,EAASnG,SAASsE,cAAc,UAGpC,GAFA6B,EAAOb,MAAMC,QAAU,QAEnBvF,SAASvtC,KAuBT,KAAM,oGAtBNutC,SAASvtC,KAAK+yC,YAAYW,GAC1B,IAIYA,EAAOC,cAAcpG,UAGzBpgC,GAAI,iCAGZ,MAAOzL,GACH,IAAI4U,EAASi3B,SAASj3B,OACtBo9B,EAAOd,IACH,gEACIt8B,EACA,2BAkBhB,OATIo9B,EAAOE,gBACPF,EAAOD,IAAMC,EAAOE,gBAEfF,EAAOC,cACZD,EAAOD,IAAMC,EAAOC,cAAcpG,SAE7BmG,EAAOnG,WACZmG,EAAOD,IAAMC,EAAOnG,UAEjBmG,GAKXnD,EAA2B3wC,UAAUsyC,MAAQ,WACzC,IAAIlsC,EAAQtG,KAeZ,GAbAA,KAAKm0C,OAAQ,EACTn0C,KAAK2zC,WAIL3zC,KAAK2zC,SAASI,IAAIzzC,KAAK8zC,UAAY,GACnChhC,WAAW,WACgB,OAAnB9M,EAAMqtC,WACN9F,SAASvtC,KAAKoyC,YAAYpsC,EAAMqtC,UAChCrtC,EAAMqtC,SAAW,OAEtBxhC,KAAKI,MAAM,KAEdrL,KAAelH,KAAKq0C,KAAM,CAC1B,IAAI/C,GACJgD,QAAmD,KACnDhD,EAAoC,GAAItxC,KAAKq0C,KAC7C/C,EAAoC,GAAItxC,KAAKu0C,KAC7C,IAAIC,EAASx0C,KAAK6vC,MAAMyB,GACxBT,EAA2B4D,gBAAgBD,GAG/C,IAAIxE,EAAehwC,KAAKgwC,aACpBA,IACAhwC,KAAKgwC,aAAe,KACpBA,MAQRa,EAA2B3wC,UAAU0xC,cAAgB,SAAUhlC,EAAIomC,GAK/D,IAJAhzC,KAAKq0C,KAAOznC,EACZ5M,KAAKu0C,KAAOvB,EACZhzC,KAAKm0C,OAAQ,EAENn0C,KAAK00C,kBAShB7D,EAA2B3wC,UAAUw0C,YAAc,WAI/C,GAAI10C,KAAKm0C,OACLn0C,KAAKoxC,cACLpxC,KAAKwzC,oBAAoB9xB,SAAW1hB,KAAKyzC,YAAY3xC,OAAS,EAAI,EAAI,GAAI,CAE1E9B,KAAK0zC,gBACL,IAAIpC,KACJA,EAAoC,GAAItxC,KAAKq0C,KAC7C/C,EAAoC,GAAItxC,KAAKu0C,KAC7CjD,EAAwC,IAAItxC,KAAK0zC,cAKjD,IAJA,IAAIc,EAASx0C,KAAK6vC,MAAMyB,GAEpBqD,EAAgB,GAChBhyC,EAAI,EACD3C,KAAKyzC,YAAY3xC,OAAS,GAAG,CAGhC,KADc9B,KAAKyzC,YAAY,GACnB/zC,EAAEoC,OA/cR,GA+cmC6yC,EAAc7yC,QAhd/C,MAweJ,MArBA,IAAI8yC,EAAS50C,KAAKyzC,YAAYoB,QAC9BF,EACIA,EACI,OAEAhyC,EACA,IACAiyC,EAAOE,IACP,MAEAnyC,EACA,IACAiyC,EAAOG,GACP,KAEApyC,EACA,IACAiyC,EAAOl1C,EACfiD,IAQR,OAFA6xC,GAAkBG,EAClB30C,KAAKg1C,gBAAgBR,EAAQx0C,KAAK0zC,gBAC3B,EAGP,OAAO,GASf7C,EAA2B3wC,UAAU6yC,eAAiB,SAAUkC,EAAQC,EAAW/sC,GAE/EnI,KAAKyzC,YAAY1xC,MAAO+yC,IAAKG,EAAQF,GAAIG,EAAWx1C,EAAGyI,IAGnDnI,KAAKm0C,OACLn0C,KAAK00C,eASb7D,EAA2B3wC,UAAU80C,gBAAkB,SAAUG,EAAKC,GAClE,IAAI9uC,EAAQtG,KAEZA,KAAKwzC,oBAAoB/iB,IAAI2kB,EAAQ,GACrC,IAAIC,EAAe,WACf/uC,EAAMktC,oBAAoBzkC,OAAOqmC,GACjC9uC,EAAMouC,eAINY,EAAmBliC,WAAWiiC,EAAcljC,KAAKI,MAxgB5B,OA+gBzBvS,KAAK2xC,OAAOwD,EANO,WAEfjE,aAAaoE,GAEbD,OASRxE,EAA2B3wC,UAAUyxC,OAAS,SAAUwD,EAAKI,GACzD,IAAIjvC,EAAQtG,KACRkH,IACAlH,KAAKw1C,eAAeL,EAAKI,GAGzBniC,WAAW,WACP,IAEI,IAAK9M,EAAM8qC,aACP,OACJ,IAAIqE,EAAcnvC,EAAMqtC,SAASI,IAAI5B,cAAc,UACnDsD,EAAYn+B,KAAO,kBACnBm+B,EAAYC,OAAQ,EACpBD,EAAYvC,IAAMiC,EAClBM,EAAYE,OAASF,EAAYG,mBAAqB,WAClD,IAAIC,EAASJ,EAAYlF,WACpBsF,GAAqB,WAAXA,GAAkC,aAAXA,IAClCJ,EAAYE,OAASF,EAAYG,mBAAqB,KAClDH,EAAYK,YACZL,EAAYK,WAAWpD,YAAY+C,GAEvCF,MAGRE,EAAYM,QAAU,WAClBtoC,GAAI,oCAAsC0nC,GAC1C7uC,EAAM8qC,cAAe,EACrB9qC,EAAMksC,SAEVlsC,EAAMqtC,SAASI,IAAIzzC,KAAK+yC,YAAYoC,GAExC,MAAOzzC,MAGRmQ,KAAKI,MAAM,KAGfs+B,KAoBPmF,GAAgB,KACQ,oBAAjBC,aACPD,GAAgBC,aAEU,oBAAdC,YACZF,GAAgBE,WAOpB,IAAIC,GAAqC,WAQrC,SAASA,EAAoB9G,EAAQ72B,EAAU82B,EAAoBC,GAC/DvvC,KAAKqvC,OAASA,EACdrvC,KAAKo2C,eAAiB,KACtBp2C,KAAKq2C,OAAS,KACdr2C,KAAKs2C,YAAc,EACnBt2C,KAAKwvC,UAAY,EACjBxvC,KAAKyvC,cAAgB,EACrBzvC,KAAK2vC,KAAOr/B,GAAWtQ,KAAKqvC,QAC5BrvC,KAAK4vC,OAASrF,GAAaC,cAAchyB,GACzCxY,KAAKwX,QAAU2+B,EAAoBI,eAAe/9B,EAAU82B,EAAoBC,GA6RpF,OAnRA4G,EAAoBI,eAAiB,SAAU/9B,EAAU82B,EAAoBC,GACzE,IAAI+B,GACJ/vC,EA56Se,KAy7Sf,OAZK2F,KACmB,oBAAbmR,UACPA,SAASo5B,OACgC,IAAzCp5B,SAASo5B,KAAK56B,QA36SP,oBA46SPy6B,EAAuB,EA76SnB,KA+6SJhC,IACAgC,EAAiC,EAAIhC,GAErCC,IACA+B,EAA4B,GAAI/B,GAE7B/2B,EAASnB,cAl7SR,YAk7SiCi6B,IAO7C6E,EAAoBj2C,UAAU4vC,KAAO,SAAUC,EAAWC,GACtD,IAAI1pC,EAAQtG,KACZA,KAAKgwC,aAAeA,EACpBhwC,KAAK+vC,UAAYA,EACjB/vC,KAAK2vC,KAAK,2BAA6B3vC,KAAKwX,SAC5CxX,KAAK0vC,gBAAiB,EAEtBpgC,EAAkBpB,IAAI,8BAA8B,GACpD,IACI,GAAIhH,IAAa,CACb,IAAIsvC,EAASt0C,EAAuB,YAAc,OAE9CgoC,GACAuM,SACIC,aAAc,cAAuCC,EAASC,YAAc,IAAMC,QAAQC,SAAW,IAAMN,IAI/GO,EAAMF,QAAa,IACnBG,EAA0C,GAAlCh3C,KAAKwX,QAAQX,QAAQ,UAC3BkgC,EAAiB,aAAKA,EAAiB,YACvCA,EAAgB,YAAKA,EAAgB,WACvCC,IACA9M,EAAe,OAAM+M,OAAQD,IAEjCh3C,KAAKk3C,OAAS,IAAIlB,GAAch2C,KAAKwX,WAAa0yB,QAGlDlqC,KAAKk3C,OAAS,IAAIlB,GAAch2C,KAAKwX,SAG7C,MAAOxV,GACHhC,KAAK2vC,KAAK,kCACV,IAAIlH,EAAWzmC,EAAEK,SAAWL,EAAEmG,KAK9B,OAJIsgC,GACAzoC,KAAK2vC,KAAKlH,QAEdzoC,KAAKswC,YAGTtwC,KAAKk3C,OAAOC,OAAS,WACjB7wC,EAAMqpC,KAAK,wBACXrpC,EAAMopC,gBAAiB,GAE3B1vC,KAAKk3C,OAAOE,QAAU,WAClB9wC,EAAMqpC,KAAK,0CACXrpC,EAAM4wC,OAAS,KACf5wC,EAAMgqC,aAEVtwC,KAAKk3C,OAAOG,UAAY,SAAUC,GAC9BhxC,EAAMixC,oBAAoBD,IAE9Bt3C,KAAKk3C,OAAOnB,QAAU,SAAU/zC,GAC5BsE,EAAMqpC,KAAK,yCACX,IAAIlH,EAAWzmC,EAAEK,SAAWL,EAAEmG,KAC1BsgC,GACAniC,EAAMqpC,KAAKlH,GAEfniC,EAAMgqC,cAMd6F,EAAoBj2C,UAAUqxC,MAAQ,aACtC4E,EAAoBnE,cAAgB,WAChCmE,EAAoBlE,gBAAiB,GAEzCkE,EAAoBjE,YAAc,WAC9B,IAAIsF,GAAe,EACnB,GAAyB,oBAAdvwC,WAA6BA,UAAUwwC,UAAW,CACzD,IACIC,EAAkBzwC,UAAUwwC,UAAUlvC,MADpB,kCAElBmvC,GAAmBA,EAAgB51C,OAAS,GACxC61C,WAAWD,EAAgB,IAAM,MACjCF,GAAe,GAI3B,OAASA,GACa,OAAlBxB,KACCG,EAAoBlE,gBAM7BkE,EAAoByB,iBAAmB,WAGnC,OAAQtoC,EAAkBJ,oBACkC,IAAxDI,EAAkBzH,IAAI,+BAE9BsuC,EAAoBj2C,UAAUoyC,sBAAwB,WAClDhjC,EAAkBP,OAAO,+BAE7BonC,EAAoBj2C,UAAU23C,aAAe,SAAU1vC,GAEnD,GADAnI,KAAKq2C,OAAOt0C,KAAKoG,GACbnI,KAAKq2C,OAAOv0C,QAAU9B,KAAKs2C,YAAa,CACxC,IAAIwB,EAAW93C,KAAKq2C,OAAO7xC,KAAK,IAChCxE,KAAKq2C,OAAS,KACd,IAAI0B,EAAWpvC,EAASmvC,GAExB93C,KAAK+vC,UAAUgI,KAOvB5B,EAAoBj2C,UAAU83C,qBAAuB,SAAUC,GAC3Dj4C,KAAKs2C,YAAc2B,EACnBj4C,KAAKq2C,WAQTF,EAAoBj2C,UAAUg4C,mBAAqB,SAAU/vC,GAIzD,GAHAhG,EAAuB,OAAhBnC,KAAKq2C,OAAiB,kCAGzBluC,EAAKrG,QAAU,EAAG,CAClB,IAAIm2C,EAAavnC,OAAOvI,GACxB,IAAKgwC,MAAMF,GAEP,OADAj4C,KAAKg4C,qBAAqBC,GACnB,KAIf,OADAj4C,KAAKg4C,qBAAqB,GACnB7vC,GAMXguC,EAAoBj2C,UAAUq3C,oBAAsB,SAAUa,GAC1D,GAAoB,OAAhBp4C,KAAKk3C,OAAT,CAEA,IAAI/uC,EAAOiwC,EAAW,KAItB,GAHAp4C,KAAKyvC,eAAiBtnC,EAAKrG,OAC3B9B,KAAK4vC,OAAOvF,iBAAiB,iBAAkBliC,EAAKrG,QACpD9B,KAAKq4C,iBACe,OAAhBr4C,KAAKq2C,OAELr2C,KAAK63C,aAAa1vC,OAEjB,CAED,IAAImwC,EAAgBt4C,KAAKk4C,mBAAmB/vC,GACtB,OAAlBmwC,GACAt4C,KAAK63C,aAAaS,MAQ9BnC,EAAoBj2C,UAAUyyC,KAAO,SAAUxqC,GAC3CnI,KAAKq4C,iBACL,IAAIzF,EAAU9pC,EAAUX,GACxBnI,KAAKwvC,WAAaoD,EAAQ9wC,OAC1B9B,KAAK4vC,OAAOvF,iBAAiB,aAAcuI,EAAQ9wC,QAGnD,IAAI6P,EAAWH,GAAkBohC,EAvOV,OAyOnBjhC,EAAS7P,OAAS,GAClB9B,KAAKu4C,YAAYxzC,OAAO4M,EAAS7P,SAGrC,IAAK,IAAIa,EAAI,EAAGA,EAAIgP,EAAS7P,OAAQa,IACjC3C,KAAKu4C,YAAY5mC,EAAShP,KAGlCwzC,EAAoBj2C,UAAUqyC,UAAY,WACtCvyC,KAAKowC,WAAY,EACbpwC,KAAKo2C,iBACLoC,cAAcx4C,KAAKo2C,gBACnBp2C,KAAKo2C,eAAiB,MAEtBp2C,KAAKk3C,SACLl3C,KAAKk3C,OAAO1E,QACZxyC,KAAKk3C,OAAS,OAGtBf,EAAoBj2C,UAAUowC,UAAY,WACjCtwC,KAAKowC,YACNpwC,KAAK2vC,KAAK,+BACV3vC,KAAKuyC,YAEDvyC,KAAKgwC,eACLhwC,KAAKgwC,aAAahwC,KAAK0vC,gBACvB1vC,KAAKgwC,aAAe,QAQhCmG,EAAoBj2C,UAAUsyC,MAAQ,WAC7BxyC,KAAKowC,YACNpwC,KAAK2vC,KAAK,6BACV3vC,KAAKuyC,cAOb4D,EAAoBj2C,UAAUm4C,eAAiB,WAC3C,IAAI/xC,EAAQtG,KACZw4C,cAAcx4C,KAAKo2C,gBACnBp2C,KAAKo2C,eAAiBqC,YAAY,WAE1BnyC,EAAM4wC,QACN5wC,EAAMiyC,YAAY,KAEtBjyC,EAAM+xC,kBACPlmC,KAAKI,MA7RmB,QAqS/B4jC,EAAoBj2C,UAAUq4C,YAAc,SAAU91C,GAIlD,IACIzC,KAAKk3C,OAAOvE,KAAKlwC,GAErB,MAAOT,GACHhC,KAAK2vC,KAAK,0CAA2C3tC,EAAEK,SAAWL,EAAEmG,KAAM,uBAC1EiL,WAAWpT,KAAKswC,UAAUjgC,KAAKrQ,MAAO,KAO9Cm2C,EAAoBuC,6BAA+B,EAKnDvC,EAAoBwC,eAAiB,IAC9BxC,KA0BPyC,GAAkC,WAIlC,SAASA,EAAiBpgC,GACtBxY,KAAK64C,gBAAgBrgC,GA6DzB,OA3DAlZ,OAAOsI,eAAegxC,EAAkB,kBAKpC/wC,IAAK,WACD,OAAQunC,GAAuB+G,KAEnC/nC,YAAY,EACZC,cAAc,IAMlBuqC,EAAiB14C,UAAU24C,gBAAkB,SAAUrgC,GACnD,IAAIsgC,EAAwB3C,IAAuBA,GAAiC,cAChF4C,EAAuBD,IAA0B3C,GAAoByB,mBAMzE,GALIp/B,EAAS9B,gBACJoiC,GACDjrC,GAAK,mFACTkrC,GAAuB,GAEvBA,EACA/4C,KAAKg5C,aAAe7C,QAEnB,CACD,IAAI8C,EAAgBj5C,KAAKg5C,eACzBnnC,GAAK+mC,EAAiBM,eAAgB,SAAUv2C,EAAGw2C,GAC3CA,GAAaA,EAAuB,eACpCF,EAAal3C,KAAKo3C,OASlCP,EAAiB14C,UAAUk5C,iBAAmB,WAC1C,GAAIp5C,KAAKg5C,YAAYl3C,OAAS,EAC1B,OAAO9B,KAAKg5C,YAAY,GAGxB,MAAM,IAAIz2C,MAAM,4BAOxBq2C,EAAiB14C,UAAUm5C,iBAAmB,WAC1C,OAAIr5C,KAAKg5C,YAAYl3C,OAAS,EACnB9B,KAAKg5C,YAAY,GAGjB,MAGRJ,KA4CPU,GAA4B,WAU5B,SAASA,EAAW1sC,EAAI2sC,EAAWlL,EAAYmL,EAAUtJ,EAAeuJ,EAASlK,GAC7EvvC,KAAK4M,GAAKA,EACV5M,KAAKu5C,UAAYA,EACjBv5C,KAAKquC,WAAaA,EAClBruC,KAAKw5C,SAAWA,EAChBx5C,KAAKkwC,cAAgBA,EACrBlwC,KAAKy5C,QAAUA,EACfz5C,KAAKuvC,cAAgBA,EACrBvvC,KAAK05C,gBAAkB,EACvB15C,KAAK25C,uBACL35C,KAAK45C,OAAS,EACd55C,KAAK2vC,KAAOr/B,GAAW,KAAOtQ,KAAK4M,GAAK,KACxC5M,KAAK65C,kBAAoB,IAAIjB,GAAiBW,GAC9Cv5C,KAAK2vC,KAAK,sBACV3vC,KAAK85C,SAiaT,OA3ZAR,EAAWp5C,UAAU45C,OAAS,WAC1B,IAAIxzC,EAAQtG,KACR+5C,EAAO/5C,KAAK65C,kBAAkBT,mBAClCp5C,KAAKg6C,MAAQ,IAAID,EAAK/5C,KAAKi6C,mBAAoBj6C,KAAKu5C,eAAWpzC,EAAWnG,KAAKuvC,eAG/EvvC,KAAKk6C,0BAA4BH,EAAmC,8BAAK,EACzE,IAAII,EAAoBn6C,KAAKo6C,cAAcp6C,KAAKg6C,OAC5CK,EAAmBr6C,KAAKs6C,iBAAiBt6C,KAAKg6C,OAClDh6C,KAAKu6C,IAAMv6C,KAAKg6C,MAChBh6C,KAAKw6C,IAAMx6C,KAAKg6C,MAChBh6C,KAAKy6C,eAAiB,KACtBz6C,KAAK06C,YAAa,EAOlBtnC,WAAW,WAEP9M,EAAM0zC,OAAS1zC,EAAM0zC,MAAMlK,KAAKqK,EAAmBE,IACpDloC,KAAKI,MAAM,IACd,IAAIooC,EAAoBZ,EAAqB,gBAAK,EAC9CY,EAAoB,IACpB36C,KAAK46C,gBAAkBrnC,GAAsB,WACzCjN,EAAMs0C,gBAAkB,KACnBt0C,EAAMo0C,aACHp0C,EAAM0zC,OACN1zC,EAAM0zC,MAAMvK,cA5EE,QA6EdnpC,EAAMqpC,KAAK,wDACPrpC,EAAM0zC,MAAMvK,cACZ,wCACJnpC,EAAMo0C,YAAa,EACnBp0C,EAAM0zC,MAAM1H,yBAEPhsC,EAAM0zC,OACX1zC,EAAM0zC,MAAMxK,UArFF,MAsFVlpC,EAAMqpC,KAAK,oDACPrpC,EAAM0zC,MAAMxK,UACZ,uCAKJlpC,EAAMqpC,KAAK,+CACXrpC,EAAMksC,WAGfrgC,KAAKI,MAAMooC,MAOtBrB,EAAWp5C,UAAU+5C,iBAAmB,WACpC,MAAO,KAAOj6C,KAAK4M,GAAK,IAAM5M,KAAK05C,mBAEvCJ,EAAWp5C,UAAUo6C,iBAAmB,SAAUP,GAC9C,IAAIzzC,EAAQtG,KACZ,OAAO,SAAU66C,GACTd,IAASzzC,EAAM0zC,MACf1zC,EAAMw0C,kBAAkBD,GAEnBd,IAASzzC,EAAMm0C,gBACpBn0C,EAAMqpC,KAAK,8BACXrpC,EAAMy0C,8BAGNz0C,EAAMqpC,KAAK,+BAIvB2J,EAAWp5C,UAAUk6C,cAAgB,SAAUL,GAC3C,IAAIzzC,EAAQtG,KACZ,OAAO,SAAUqC,GACO,GAAhBiE,EAAMszC,SACFG,IAASzzC,EAAMk0C,IACfl0C,EAAM00C,0BAA0B34C,GAE3B03C,IAASzzC,EAAMm0C,eACpBn0C,EAAM20C,4BAA4B54C,GAGlCiE,EAAMqpC,KAAK,gCAS3B2J,EAAWp5C,UAAUg7C,YAAc,SAAUC,GAEzC,IAAIC,GAAQ36C,EAAG,IAAKf,EAAGy7C,GACvBn7C,KAAKq7C,UAAUD,IAEnB9B,EAAWp5C,UAAUo7C,qBAAuB,WACpCt7C,KAAKu6C,MAAQv6C,KAAKy6C,gBAAkBz6C,KAAKw6C,MAAQx6C,KAAKy6C,iBACtDz6C,KAAK2vC,KAAK,2CAA6C3vC,KAAKy6C,eAAepL,QAC3ErvC,KAAKg6C,MAAQh6C,KAAKy6C,eAClBz6C,KAAKy6C,eAAiB,OAI9BnB,EAAWp5C,UAAUq7C,oBAAsB,SAAUC,GACjD,GA1JW,MA0JSA,EAAa,CAC7B,IAAIC,EAAMD,EAAwB,EArJ7B,MAsJDC,EACAz7C,KAAK07C,6BA1JD,MA4JCD,GAELz7C,KAAK2vC,KAAK,wCACV3vC,KAAKy6C,eAAejI,QAEhBxyC,KAAKu6C,MAAQv6C,KAAKy6C,gBAClBz6C,KAAKw6C,MAAQx6C,KAAKy6C,gBAClBz6C,KAAKwyC,SAjKN,MAoKEiJ,IACLz7C,KAAK2vC,KAAK,0BACV3vC,KAAK27C,8BACL37C,KAAK07C,gCAIjBpC,EAAWp5C,UAAU+6C,4BAA8B,SAAUW,GACzD,IAAIC,EAAQzqC,GAAW,IAAKwqC,GACxBzzC,EAAOiJ,GAAW,IAAKwqC,GAC3B,GAAa,KAATC,EACA77C,KAAKu7C,oBAAoBpzC,OAExB,CAAA,GAAa,KAAT0zC,EAKL,MAAM,IAAIt5C,MAAM,2BAA6Bs5C,GAH7C77C,KAAK25C,oBAAoB53C,KAAKoG,KAMtCmxC,EAAWp5C,UAAUw7C,2BAA6B,WAC1C17C,KAAK27C,6BAA+B,GACpC37C,KAAK2vC,KAAK,oCACV3vC,KAAK06C,YAAa,EAClB16C,KAAKy6C,eAAenI,wBACpBtyC,KAAK87C,wBAIL97C,KAAK2vC,KAAK,8BACV3vC,KAAKy6C,eAAe9H,MAAOlyC,EAAG,IAAKf,GAAKe,EAhMzC,IAgMkDf,UAGzD45C,EAAWp5C,UAAU47C,oBAAsB,WAEvC97C,KAAKy6C,eAAelJ,QAEpBvxC,KAAK2vC,KAAK,mCACV3vC,KAAKy6C,eAAe9H,MAAOlyC,EAAG,IAAKf,GAAKe,EA1M/B,IA0M8Cf,QAGvDM,KAAK2vC,KAAK,kCACV3vC,KAAKg6C,MAAMrH,MAAOlyC,EAAG,IAAKf,GAAKe,EA7MhB,IA6MqCf,QACpDM,KAAKu6C,IAAMv6C,KAAKy6C,eAChBz6C,KAAKs7C,wBAEThC,EAAWp5C,UAAU86C,0BAA4B,SAAUY,GAEvD,IAAIC,EAAQzqC,GAAW,IAAKwqC,GACxBzzC,EAAOiJ,GAAW,IAAKwqC,GACd,KAATC,EACA77C,KAAK+7C,WAAW5zC,GAEF,KAAT0zC,GACL77C,KAAKg8C,eAAe7zC,IAG5BmxC,EAAWp5C,UAAU87C,eAAiB,SAAU35C,GAC5CrC,KAAKi8C,qBAELj8C,KAAKquC,WAAWhsC,IAEpBi3C,EAAWp5C,UAAU+7C,mBAAqB,WACjCj8C,KAAK06C,aACN16C,KAAKk6C,4BACDl6C,KAAKk6C,2BAA6B,IAClCl6C,KAAK2vC,KAAK,kCACV3vC,KAAK06C,YAAa,EAClB16C,KAAKg6C,MAAM1H,2BAIvBgH,EAAWp5C,UAAU67C,WAAa,SAAUP,GACxC,IAAIC,EAAMrqC,GAnPC,IAmPwBoqC,GACnC,GAnPW,MAmPSA,EAAa,CAC7B,IAAIU,EAAUV,EAAwB,EACtC,GA7OO,MA6OHC,EACAz7C,KAAKm8C,aAAaD,QAEjB,GAlPM,MAkPFT,EAA0B,CAC/Bz7C,KAAK2vC,KAAK,qCACV3vC,KAAKw6C,IAAMx6C,KAAKy6C,eAChB,IAAK,IAAI93C,EAAI,EAAGA,EAAI3C,KAAK25C,oBAAoB73C,SAAUa,EACnD3C,KAAKg8C,eAAeh8C,KAAK25C,oBAAoBh3C,IAEjD3C,KAAK25C,uBACL35C,KAAKs7C,2BA9PE,MAgQFG,EAGLz7C,KAAKo8C,sBAAsBF,GAlQvB,MAoQCT,EAELz7C,KAAKq8C,SAASH,GArQV,MAuQCT,EACL91C,GAAM,iBAAmBu2C,GAvQtB,MAyQET,GACLz7C,KAAK2vC,KAAK,wBACV3vC,KAAKi8C,qBACLj8C,KAAKs8C,iCAGL32C,GAAM,mCAAqC81C,KASvDnC,EAAWp5C,UAAUi8C,aAAe,SAAUI,GAC1C,IAAIC,EAAYD,EAAUxH,GACtB0H,EAAUF,EAAUh7C,EACpBgV,EAAOgmC,EAAUG,EACrB18C,KAAK28C,UAAYJ,EAAUxqC,EAC3B/R,KAAKu5C,UAAUpiC,WAAWZ,GAEP,GAAfvW,KAAK45C,SACL55C,KAAKg6C,MAAMzI,QACXvxC,KAAK48C,yBAAyB58C,KAAKg6C,MAAOwC,GA3lU/B,MA4lUcC,GACrB5uC,GAAK,sCAGT7N,KAAK68C,qBAGbvD,EAAWp5C,UAAU28C,iBAAmB,WACpC,IAAI9C,EAAO/5C,KAAK65C,kBAAkBR,mBAC9BU,GACA/5C,KAAK88C,cAAc/C,IAG3BT,EAAWp5C,UAAU48C,cAAgB,SAAU/C,GAC3C,IAAIzzC,EAAQtG,KACZA,KAAKy6C,eAAiB,IAAIV,EAAK/5C,KAAKi6C,mBAAoBj6C,KAAKu5C,UAAWv5C,KAAK28C,WAG7E38C,KAAK27C,4BACD5B,EAAmC,8BAAK,EAC5C,IAAIhK,EAAY/vC,KAAKo6C,cAAcp6C,KAAKy6C,gBACpCzK,EAAehwC,KAAKs6C,iBAAiBt6C,KAAKy6C,gBAC9Cz6C,KAAKy6C,eAAe3K,KAAKC,EAAWC,GAEpCz8B,GAAsB,WACdjN,EAAMm0C,iBACNn0C,EAAMqpC,KAAK,gCACXrpC,EAAMm0C,eAAejI,UAE1BrgC,KAAKI,MA7UM,OA+UlB+mC,EAAWp5C,UAAUm8C,SAAW,SAAU9lC,GACtCvW,KAAK2vC,KAAK,qCAAuCp5B,GACjDvW,KAAKu5C,UAAUpiC,WAAWZ,GAGN,IAAhBvW,KAAK45C,OACL55C,KAAKwyC,SAILxyC,KAAK+8C,oBACL/8C,KAAK85C,WAGbR,EAAWp5C,UAAU08C,yBAA2B,SAAU7C,EAAMyC,GAC5D,IAAIl2C,EAAQtG,KACZA,KAAK2vC,KAAK,oCACV3vC,KAAKg6C,MAAQD,EACb/5C,KAAK45C,OAAS,EACV55C,KAAKw5C,WACLx5C,KAAKw5C,SAASgD,EAAWx8C,KAAK28C,WAC9B38C,KAAKw5C,SAAW,MAImB,IAAnCx5C,KAAKk6C,2BACLl6C,KAAK2vC,KAAK,kCACV3vC,KAAK06C,YAAa,GAGlBnnC,GAAsB,WAClBjN,EAAMg2C,iCACPnqC,KAAKI,MA5WsB,OA+WtC+mC,EAAWp5C,UAAUo8C,8BAAgC,WAE5Ct8C,KAAK06C,YAA8B,IAAhB16C,KAAK45C,SACzB55C,KAAK2vC,KAAK,4BACV3vC,KAAKq7C,WAAY56C,EAAG,IAAKf,GAAKe,EArW/B,IAqWwCf,UAG/C45C,EAAWp5C,UAAU66C,2BAA6B,WAC9C,IAAIhB,EAAO/5C,KAAKy6C,eAChBz6C,KAAKy6C,eAAiB,KAClBz6C,KAAKu6C,MAAQR,GAAQ/5C,KAAKw6C,MAAQT,GAElC/5C,KAAKwyC,SASb8G,EAAWp5C,UAAU46C,kBAAoB,SAAUD,GAC/C76C,KAAKg6C,MAAQ,KAGRa,GAAiC,IAAhB76C,KAAK45C,OASF,IAAhB55C,KAAK45C,QACV55C,KAAK2vC,KAAK,8BATV3vC,KAAK2vC,KAAK,+BAEN3vC,KAAKu5C,UAAUtiC,oBACf3H,EAAkBP,OAAO,QAAU/O,KAAKu5C,UAAUhjC,MAElDvW,KAAKu5C,UAAUziC,aAAe9W,KAAKu5C,UAAUhjC,OAMrDvW,KAAKwyC,SAOT8G,EAAWp5C,UAAUk8C,sBAAwB,SAAU1T,GACnD1oC,KAAK2vC,KAAK,0DACN3vC,KAAKy5C,UACLz5C,KAAKy5C,QAAQ/Q,GACb1oC,KAAKy5C,QAAU,MAInBz5C,KAAKkwC,cAAgB,KACrBlwC,KAAKwyC,SAET8G,EAAWp5C,UAAUm7C,UAAY,SAAUlzC,GACvC,GAAoB,IAAhBnI,KAAK45C,OACL,KAAM,8BAGN55C,KAAKu6C,IAAI5H,KAAKxqC,IAMtBmxC,EAAWp5C,UAAUsyC,MAAQ,WACL,IAAhBxyC,KAAK45C,SACL55C,KAAK2vC,KAAK,gCACV3vC,KAAK45C,OAAS,EACd55C,KAAK+8C,oBACD/8C,KAAKkwC,gBACLlwC,KAAKkwC,gBACLlwC,KAAKkwC,cAAgB,QAQjCoJ,EAAWp5C,UAAU68C,kBAAoB,WACrC/8C,KAAK2vC,KAAK,iCACN3vC,KAAKg6C,QACLh6C,KAAKg6C,MAAMxH,QACXxyC,KAAKg6C,MAAQ,MAEbh6C,KAAKy6C,iBACLz6C,KAAKy6C,eAAejI,QACpBxyC,KAAKy6C,eAAiB,MAEtBz6C,KAAK46C,kBACL1J,aAAalxC,KAAK46C,iBAClB56C,KAAK46C,gBAAkB,OAGxBtB,KAwBP0D,GAA+B,WAC/B,SAASA,KA0CT,OAlCAA,EAAc98C,UAAU+8C,IAAM,SAAU7oC,EAAYjM,EAAMiT,EAAYqE,KAOtEu9B,EAAc98C,UAAU65B,MAAQ,SAAU3lB,EAAYjM,EAAMiT,EAAYqE,KAKxEu9B,EAAc98C,UAAUg9C,iBAAmB,SAAUl0C,KAMrDg0C,EAAc98C,UAAUi9C,gBAAkB,SAAU/oC,EAAYjM,EAAMiT,KAMtE4hC,EAAc98C,UAAUk9C,kBAAoB,SAAUhpC,EAAYjM,EAAMiT,KAKxE4hC,EAAc98C,UAAUob,mBAAqB,SAAUlH,EAAYgH,KAInE4hC,EAAc98C,UAAU8rC,YAAc,SAAUH,KACzCmR,KAkBPK,GAAsB,IACtBC,GAA8B,IAa9BC,GAAsC,SAAUhzC,GAWhD,SAASgzC,EAAqBhE,EAAWiE,EAAeC,EAAkBC,EAAqBC,EAAoBC,GAC/G,IAAIt3C,EAAQiE,EAAO7I,KAAK1B,OAASA,KAwCjC,GAvCAsG,EAAMizC,UAAYA,EAClBjzC,EAAMk3C,cAAgBA,EACtBl3C,EAAMm3C,iBAAmBA,EACzBn3C,EAAMo3C,oBAAsBA,EAC5Bp3C,EAAMq3C,mBAAqBA,EAC3Br3C,EAAMs3C,cAAgBA,EAEtBt3C,EAAMsG,GAAK2wC,EAAqBM,8BAChCv3C,EAAMqpC,KAAOr/B,GAAW,KAAOhK,EAAMsG,GAAK,KAE1CtG,EAAMw3C,qBACNx3C,EAAMy3C,YACNz3C,EAAM03C,oBACN13C,EAAM23C,qBAAuB,EAC7B33C,EAAM43C,6BACN53C,EAAM63C,YAAa,EACnB73C,EAAM83C,gBAAkBf,GACxB/2C,EAAM+3C,mBAAqBf,GAC3Bh3C,EAAMg4C,uBAAyB,KAC/Bh4C,EAAMipC,cAAgB,KAEtBjpC,EAAMi4C,0BAA4B,KAElCj4C,EAAMynC,UAAW,EAEjBznC,EAAMk4C,kBACNl4C,EAAMm4C,eAAiB,EAKvBn4C,EAAMo4C,UAAY,KAElBp4C,EAAMq4C,WAAa,KACnBr4C,EAAMs4C,oBAAqB,EAC3Bt4C,EAAMu4C,uBAAyB,EAC/Bv4C,EAAMw4C,kBAAmB,EACzBx4C,EAAMy4C,2BAA6B,KACnCz4C,EAAM04C,+BAAiC,KACnCpB,IAAkB12C,IAClB,MAAM,IAAI3E,MAAM,kFAOpB,OALA+D,EAAM24C,iBAAiB,GACvBvR,GAAkBM,cAAc7f,GAAG,UAAW7nB,EAAM44C,WAAY54C,IACrB,IAAvCizC,EAAUhjC,KAAKM,QAAQ,YACvBo3B,GAAcD,cAAc7f,GAAG,SAAU7nB,EAAM64C,UAAW74C,GAEvDA,EAkrBX,OA7uBAxG,EAAUy9C,EAAsBhzC,GAmEhCgzC,EAAqBr9C,UAAUg7C,YAAc,SAAU97B,EAAQ9e,EAAM8+C,GACjE,IAAIC,IAAcr/C,KAAKy+C,eACnBrD,GAAQ1V,EAAG2Z,EAAWh0C,EAAG+T,EAAQzf,EAAGW,GACxCN,KAAK2vC,KAAK7mC,EAAUsyC,IACpBj5C,EAAOnC,KAAKm+C,WAAY,0DACxBn+C,KAAK0+C,UAAUxD,YAAYE,GACvBgE,IACAp/C,KAAKw+C,eAAea,GAAaD,IAMzC7B,EAAqBr9C,UAAUo/C,OAAS,SAAU3zB,EAAO4zB,EAAeha,EAAKnqB,GACzE,IAAI6W,EAAUtG,EAAMwE,kBAChB/b,EAAauX,EAAMhW,KAAKlN,WAC5BzI,KAAK2vC,KAAK,qBAAuBv7B,EAAa,IAAM6d,GACpDjyB,KAAK+9C,SAAS3pC,GAAcpU,KAAK+9C,SAAS3pC,OAC1CjS,EAAOwpB,EAAMC,iBAAiBuc,cACzBxc,EAAMC,iBAAiBmT,eAAgB,sDAC5C58B,GAAQnC,KAAK+9C,SAAS3pC,GAAY6d,GAAU,gDAC5C,IAAIutB,GACApkC,WAAYA,EACZksB,OAAQiY,EACR5zB,MAAOA,EACP4Z,IAAKA,GAETvlC,KAAK+9C,SAAS3pC,GAAY6d,GAAWutB,EACjCx/C,KAAKm+C,YACLn+C,KAAKy/C,YAAYD,IAUzBjC,EAAqBr9C,UAAUu/C,YAAc,SAAUD,GACnD,IAAIl5C,EAAQtG,KACR2rB,EAAQ6zB,EAAW7zB,MACnBvX,EAAauX,EAAMhW,KAAKlN,WACxBwpB,EAAUtG,EAAMwE,kBACpBnwB,KAAK2vC,KAAK,aAAev7B,EAAa,QAAU6d,GAChD,IAAIytB,GAAiB9/C,EAAGwU,GAGpBorC,EAAWja,MACXma,EAAO,EAAI/zB,EAAMsE,cACjByvB,EAAO,EAAIF,EAAWja,KAE1Bma,EAAgB,EAAIF,EAAWlY,SAC/BtnC,KAAKk7C,YAPQ,IAOYwE,EAAK,SAAUr9C,GACpC,IAAI65C,EAAU75C,EAAoB,EAC9BmmC,EAASnmC,EAAsB,EAEnCk7C,EAAqBoC,sBAAsBzD,EAASvwB,IAC5BrlB,EAAMy3C,SAAS3pC,IAAe9N,EAAMy3C,SAAS3pC,GAAY6d,MAEvDutB,IACtBl5C,EAAMqpC,KAAK,kBAAmBttC,GACf,OAAXmmC,GACAliC,EAAMs5C,cAAcxrC,EAAY6d,GAEhCutB,EAAWpkC,YACXokC,EAAWpkC,WAAWotB,EAAQ0T,OAU9CqB,EAAqBoC,sBAAwB,SAAUzD,EAASvwB,GAC5D,GAAIuwB,GAA8B,iBAAZA,GAAwB5yC,EAAS4yC,EAAS,KAAM,CAClE,IAAI2D,EAAWr2C,EAAQ0yC,EAAS,KAChC,GAAIz8C,MAAMkE,QAAQk8C,KAAcA,EAAShpC,QAAQ,YAAa,CAC1D,IAAIipC,EAAY,gBACZn0B,EACKC,iBACAC,WACApjB,WACL,IACAs3C,EAAYp0B,EAAMhW,KAAKlN,WAC3BoF,GAAK,wGAC6CiyC,EAAY,OACzDC,EAAY,sDAO7BxC,EAAqBr9C,UAAUg9C,iBAAmB,SAAUl0C,GACxDhJ,KAAK2+C,WAAa31C,EAClBhJ,KAAK2vC,KAAK,wBACN3vC,KAAK2+C,WACL3+C,KAAKggD,UAKDhgD,KAAKm+C,YACLn+C,KAAKk7C,YAAY,YAAc,cAGvCl7C,KAAKigD,uCAAuCj3C,IAMhDu0C,EAAqBr9C,UAAU+/C,uCAAyC,SAAUC,GAG9E,IFxyVAh3C,GEwyVuBg3C,GAAoC,KAAtBA,EAAWp+C,QFvyV3B,iBADrBoH,EAASH,EEyyVuBm3C,GFzyVTh3C,UAC8B,IAApBA,EAAc,SEyyV3ClJ,KAAK2vC,KAAK,iEACV3vC,KAAKq+C,mBAzMoB,MAgNjCd,EAAqBr9C,UAAU8/C,QAAU,WACrC,IFj0VyB92C,EEi0VrB5C,EAAQtG,KACZ,GAAIA,KAAKm+C,YAAcn+C,KAAK2+C,WAAY,CACpC,IAAIwB,EAAUngD,KAAK2+C,WACfyB,GFp0ViBl3C,EAAfH,EEo0VyBo3C,GFp0VOj3C,SACT,iBAAXA,GAAuBA,EAAOrJ,eAAe,OEm0VrB,OAAS,QAC/CwgD,GAAgBC,KAAMH,GACC,OAAvBngD,KAAK49C,cACLyC,EAAoB,QAAI,EAEW,iBAAvBrgD,KAAK49C,gBACjByC,EAAqB,QAAIrgD,KAAK49C,eAElC59C,KAAKk7C,YAAYkF,EAAYC,EAAa,SAAUn2C,GAChD,IAAIs+B,EAASt+B,EAAkB,EAC3B/B,EAAO+B,EAAgB,GAAK,QAC5B5D,EAAMq4C,aAAewB,IACN,OAAX3X,EACAliC,EAAMu4C,uBAAyB,EAI/Bv4C,EAAMi6C,eAAe/X,EAAQrgC,QASjDo1C,EAAqBr9C,UAAUsgD,SAAW,SAAU70B,EAAO4Z,GACvD,IAAInxB,EAAauX,EAAMhW,KAAKlN,WACxBwpB,EAAUtG,EAAMwE,kBACpBnwB,KAAK2vC,KAAK,uBAAyBv7B,EAAa,IAAM6d,GACtD9vB,EAAOwpB,EAAMC,iBAAiBuc,cACzBxc,EAAMC,iBAAiBmT,eAAgB,wDAC/B/+B,KAAK4/C,cAAcxrC,EAAY6d,IAC9BjyB,KAAKm+C,YACfn+C,KAAKygD,cAAcrsC,EAAY6d,EAAStG,EAAMsE,cAAesV,IAGrEgY,EAAqBr9C,UAAUugD,cAAgB,SAAUrsC,EAAY6d,EAASyuB,EAAUnb,GACpFvlC,KAAK2vC,KAAK,eAAiBv7B,EAAa,QAAU6d,GAClD,IAAIytB,GAAiB9/C,EAAGwU,GAGpBmxB,IACAma,EAAO,EAAIgB,EACXhB,EAAO,EAAIna,GAEfvlC,KAAKk7C,YANQ,IAMYwE,IAK7BnC,EAAqBr9C,UAAUi9C,gBAAkB,SAAU/oC,EAAYjM,EAAMiT,GACrEpb,KAAKm+C,WACLn+C,KAAK2gD,kBAAkB,IAAKvsC,EAAYjM,EAAMiT,GAG9Cpb,KAAKk+C,0BAA0Bn8C,MAC3BqS,WAAYA,EACZgL,OAAQ,IACRjX,KAAMA,EACNiT,WAAYA,KAOxBmiC,EAAqBr9C,UAAUk9C,kBAAoB,SAAUhpC,EAAYjM,EAAMiT,GACvEpb,KAAKm+C,WACLn+C,KAAK2gD,kBAAkB,KAAMvsC,EAAYjM,EAAMiT,GAG/Cpb,KAAKk+C,0BAA0Bn8C,MAC3BqS,WAAYA,EACZgL,OAAQ,KACRjX,KAAMA,EACNiT,WAAYA,KAOxBmiC,EAAqBr9C,UAAUob,mBAAqB,SAAUlH,EAAYgH,GAClEpb,KAAKm+C,WACLn+C,KAAK2gD,kBAAkB,KAAMvsC,EAAY,KAAMgH,GAG/Cpb,KAAKk+C,0BAA0Bn8C,MAC3BqS,WAAYA,EACZgL,OAAQ,KACRjX,KAAM,KACNiT,WAAYA,KAIxBmiC,EAAqBr9C,UAAUygD,kBAAoB,SAAUvhC,EAAQhL,EAAYjM,EAAMiT,GACnF,IAAIwlC,GAAqBhhD,EAAGwU,EAAqB1U,EAAGyI,GACpDnI,KAAK2vC,KAAK,gBAAkBvwB,EAAQwhC,GACpC5gD,KAAKk7C,YAAY97B,EAAQwhC,EAAS,SAAUC,GACpCzlC,GACAhI,WAAW,WACPgI,EAAWylC,EAAuB,EAAGA,EAAuB,IAC7D1uC,KAAKI,MAAM,OAO1BgrC,EAAqBr9C,UAAU+8C,IAAM,SAAU7oC,EAAYjM,EAAMiT,EAAYqE,GACzEzf,KAAK8gD,YAAY,IAAK1sC,EAAYjM,EAAMiT,EAAYqE,IAKxD89B,EAAqBr9C,UAAU65B,MAAQ,SAAU3lB,EAAYjM,EAAMiT,EAAYqE,GAC3Ezf,KAAK8gD,YAAY,IAAK1sC,EAAYjM,EAAMiT,EAAYqE,IAExD89B,EAAqBr9C,UAAU4gD,YAAc,SAAU1hC,EAAQhL,EAAYjM,EAAMiT,EAAYqE,GACzF,IAAImhC,GACShhD,EAAGwU,EACH1U,EAAGyI,QAEHhC,IAATsZ,IACAmhC,EAAoB,EAAInhC,GAE5Bzf,KAAKg+C,iBAAiBj8C,MAClBqd,OAAQA,EACRwhC,QAASA,EACTxlC,WAAYA,IAEhBpb,KAAKi+C,uBACL,IAAI9+B,EAAQnf,KAAKg+C,iBAAiBl8C,OAAS,EACvC9B,KAAKm+C,WACLn+C,KAAK+gD,SAAS5hC,GAGdnf,KAAK2vC,KAAK,kBAAoBv7B,IAGtCmpC,EAAqBr9C,UAAU6gD,SAAW,SAAU5hC,GAChD,IAAI7Y,EAAQtG,KACRof,EAASpf,KAAKg+C,iBAAiB7+B,GAAOC,OACtCwhC,EAAU5gD,KAAKg+C,iBAAiB7+B,GAAOyhC,QACvCxlC,EAAapb,KAAKg+C,iBAAiB7+B,GAAO/D,WAC9Cpb,KAAKg+C,iBAAiB7+B,GAAO6hC,OAAShhD,KAAKm+C,WAC3Cn+C,KAAKk7C,YAAY97B,EAAQwhC,EAAS,SAAUv+C,GACxCiE,EAAMqpC,KAAKvwB,EAAS,YAAa/c,UAC1BiE,EAAM03C,iBAAiB7+B,GAC9B7Y,EAAM23C,uBAE6B,IAA/B33C,EAAM23C,uBACN33C,EAAM03C,qBAEN5iC,GACAA,EAAW/Y,EAAsB,EAAGA,EAAsB,MAMtEk7C,EAAqBr9C,UAAU8rC,YAAc,SAAUH,GACnD,IAAIvlC,EAAQtG,KAEZ,GAAIA,KAAKm+C,WAAY,CACjB,IAAIyC,GAAyBh+C,EAAGipC,GAChC7rC,KAAK2vC,KAAK,cAAeiR,GACzB5gD,KAAKk7C,YAAsB,IAAK0F,EAAS,SAAU1/B,GAE/C,GAAe,OADFA,EAAqB,EACb,CACjB,IAAI+/B,EAAc//B,EAAqB,EACvC5a,EAAMqpC,KAAK,cAAe,wBAA0BsR,QASpE1D,EAAqBr9C,UAAU87C,eAAiB,SAAU35C,GACtD,GAAI,MAAOA,EAAS,CAEhBrC,KAAK2vC,KAAK,gBAAkB7mC,EAAUzG,IACtC,IAAI6+C,EAAS7+C,EAAW,EACpB+8C,EAAap/C,KAAKw+C,eAAe0C,GACjC9B,WACOp/C,KAAKw+C,eAAe0C,GAC3B9B,EAAW/8C,EAAoB,QAGlC,CAAA,GAAI,UAAWA,EAChB,KAAM,qCAAuCA,EAAe,MAEvD,MAAOA,GAEZrC,KAAKmhD,YAAY9+C,EAAW,EAAGA,EAAW,KAGlDk7C,EAAqBr9C,UAAUihD,YAAc,SAAU/hC,EAAQ9e,GAC3DN,KAAK2vC,KAAK,sBAAuBvwB,EAAQ9e,GAC1B,MAAX8e,EACApf,KAAKw9C,cAAcl9C,EAAiB,EAAGA,EAAiB,GAC5C,EAAOA,EAAQ,GACX,MAAX8e,EACLpf,KAAKw9C,cAAcl9C,EAAiB,EAAGA,EAAiB,GAC3C,EAAMA,EAAQ,GACX,MAAX8e,EACLpf,KAAKohD,iBAAiB9gD,EAAiB,EAAGA,EAAkB,GAC5C,OAAX8e,EACLpf,KAAKugD,eAAejgD,EAAwB,EAAGA,EAA0B,GACzD,OAAX8e,EACLpf,KAAKqhD,uBAAuB/gD,GAE5BqF,GAAM,6CACFmD,EAAUsW,GACV,uCAEZm+B,EAAqBr9C,UAAUs5C,SAAW,SAAUgD,EAAWG,GAC3D38C,KAAK2vC,KAAK,oBACV3vC,KAAKm+C,YAAa,EAClBn+C,KAAKg/C,gCAAiC,IAAIh5C,MAAOE,UACjDlG,KAAKshD,iBAAiB9E,GACtBx8C,KAAKuvC,cAAgBoN,EACjB38C,KAAK8+C,kBACL9+C,KAAKuhD,oBAETvhD,KAAKwhD,gBACLxhD,KAAK8+C,kBAAmB,EACxB9+C,KAAKy9C,kBAAiB,IAE1BF,EAAqBr9C,UAAU++C,iBAAmB,SAAUxrC,GACxD,IAAInN,EAAQtG,KACZmC,GAAQnC,KAAK0+C,UAAW,0DACpB1+C,KAAKu+C,2BACLrN,aAAalxC,KAAKu+C,2BAItBv+C,KAAKu+C,0BAA4BnrC,WAAW,WACxC9M,EAAMi4C,0BAA4B,KAClCj4C,EAAMm7C,wBACPtvC,KAAKI,MAAMkB,KAMlB8pC,EAAqBr9C,UAAUg/C,WAAa,SAAU/c,GAE9CA,IACCniC,KAAK+tC,UACN/tC,KAAKo+C,kBAAoBp+C,KAAKq+C,qBAC9Br+C,KAAK2vC,KAAK,2CACV3vC,KAAKo+C,gBAAkBf,GAClBr9C,KAAK0+C,WACN1+C,KAAKi/C,iBAAiB,IAG9Bj/C,KAAK+tC,SAAW5L,GAEpBob,EAAqBr9C,UAAUi/C,UAAY,SAAUuC,GAC7CA,GACA1hD,KAAK2vC,KAAK,wBACV3vC,KAAKo+C,gBAAkBf,GAClBr9C,KAAK0+C,WACN1+C,KAAKi/C,iBAAiB,KAI1Bj/C,KAAK2vC,KAAK,8CACN3vC,KAAK0+C,WACL1+C,KAAK0+C,UAAUlM,UAI3B+K,EAAqBr9C,UAAUyhD,sBAAwB,WAQnD,GAPA3hD,KAAK2vC,KAAK,4BACV3vC,KAAKm+C,YAAa,EAClBn+C,KAAK0+C,UAAY,KAEjB1+C,KAAK4hD,0BAEL5hD,KAAKw+C,kBACDx+C,KAAK6hD,mBAAoB,CACzB,GAAK7hD,KAAK+tC,UAKL,GAAI/tC,KAAKg/C,+BAAgC,EAEN,IAAIh5C,MAAOE,UAAYlG,KAAKg/C,+BAvf5C,MAyfhBh/C,KAAKo+C,gBAAkBf,IAC3Br9C,KAAKg/C,+BAAiC,WATtCh/C,KAAK2vC,KAAK,8CACV3vC,KAAKo+C,gBAAkBp+C,KAAKq+C,mBAC5Br+C,KAAK++C,4BAA6B,IAAI/4C,MAAOE,UASjD,IAAI47C,GAA8B,IAAI97C,MAAOE,UAAYlG,KAAK++C,2BAC1DgD,EAAiB5vC,KAAK4D,IAAI,EAAG/V,KAAKo+C,gBAAkB0D,GACxDC,EAAiB5vC,KAAKiK,SAAW2lC,EACjC/hD,KAAK2vC,KAAK,0BAA4BoS,EAAiB,MACvD/hD,KAAKi/C,iBAAiB8C,GAEtB/hD,KAAKo+C,gBAAkBjsC,KAAKG,IAAItS,KAAKq+C,mBAngBhB,IAmgBoCr+C,KAAKo+C,iBAElEp+C,KAAKy9C,kBAAiB,IAE1BF,EAAqBr9C,UAAUuhD,qBAAuB,WAClD,GAAIzhD,KAAK6hD,mBAAoB,CACzB7hD,KAAK2vC,KAAK,+BACV3vC,KAAK++C,4BAA6B,IAAI/4C,MAAOE,UAC7ClG,KAAKg/C,+BAAiC,KACtC,IAAIgD,EAAkBhiD,KAAKg8C,eAAe3rC,KAAKrQ,MAC3CiiD,EAAYjiD,KAAKw5C,SAASnpC,KAAKrQ,MAC/BkiD,EAAiBliD,KAAK2hD,sBAAsBtxC,KAAKrQ,MACjDmiD,EAAWniD,KAAK4M,GAAK,IAAM2wC,EAAqB6E,oBAChDnxB,EAASjxB,KACTqiD,EAAkBriD,KAAKuvC,cACvB+S,GAAa,EACbC,EAAe,KACfC,EAAY,WACRD,EACAA,EAAa/P,SAGb8P,GAAa,EACbJ,MAORliD,KAAK0+C,WACDlM,MAAOgQ,EACPtH,YANgB,SAAUE,GAC1Bj5C,EAAOogD,EAAc,0DACrBA,EAAarH,YAAYE,KAM7B,IAAIxR,EAAe5pC,KAAK4+C,mBACxB5+C,KAAK4+C,oBAAqB,EAE1B5+C,KAAK29C,mBACAhU,SAASC,GACTC,KAAK,SAAU3oB,GACXohC,EAUD70C,GAAI,0CATJA,GAAI,8CACJwjB,EAAO0tB,WAAaz9B,GAAUA,EAAOuhC,YACrCF,EAAe,IAAIjJ,GAAW6I,EAAUlxB,EAAOsoB,UAAWyI,EAAiBC,EAAWC,EACxE,SAAUxZ,GACpB76B,GAAK66B,EAAS,KAAOzX,EAAOsoB,UAAU9wC,WAAa,KACnDwoB,EAAOyxB,UA/iBI,gBAgjBZL,MAMNxY,KAAK,KAAM,SAAUpB,GACtBxX,EAAO0e,KAAK,wBAA0BlH,GACjC6Z,IACGpgD,GAIA2L,GAAK46B,GAET+Z,SAQhBjF,EAAqBr9C,UAAUwiD,UAAY,SAAUha,GACjDj7B,GAAI,uCAAyCi7B,GAC7C1oC,KAAK89C,kBAAkBpV,IAAU,EAC7B1oC,KAAK0+C,UACL1+C,KAAK0+C,UAAUlM,SAGXxyC,KAAKu+C,4BACLrN,aAAalxC,KAAKu+C,2BAClBv+C,KAAKu+C,0BAA4B,MAEjCv+C,KAAKm+C,YACLn+C,KAAK2hD,0BAOjBpE,EAAqBr9C,UAAUyiD,OAAS,SAAUja,GAC9Cj7B,GAAI,mCAAqCi7B,UAClC1oC,KAAK89C,kBAAkBpV,GAC1B7+B,EAAQ7J,KAAK89C,qBACb99C,KAAKo+C,gBAAkBf,GAClBr9C,KAAK0+C,WACN1+C,KAAKi/C,iBAAiB,KAIlC1B,EAAqBr9C,UAAUohD,iBAAmB,SAAU9E,GACxD,IAAItR,EAAQsR,GAAY,IAAIx2C,MAAOE,UACnClG,KAAK09C,qBAAsBkF,iBAAkB1X,KAEjDqS,EAAqBr9C,UAAU0hD,wBAA0B,WACrD,IAAK,IAAIj/C,EAAI,EAAGA,EAAI3C,KAAKg+C,iBAAiBl8C,OAAQa,IAAK,CACnD,IAAIs6C,EAAMj9C,KAAKg+C,iBAAiBr7C,GAC5Bs6C,GAAgB,MAAOA,EAAI2D,SAAW3D,EAAI+D,SACtC/D,EAAI7hC,YACJ6hC,EAAI7hC,WAAW,qBACZpb,KAAKg+C,iBAAiBr7C,GAC7B3C,KAAKi+C,wBAIqB,IAA9Bj+C,KAAKi+C,uBACLj+C,KAAKg+C,sBAObT,EAAqBr9C,UAAUkhD,iBAAmB,SAAUhtC,EAAYuX,GAEpE,IAAIsG,EAKAA,EAJCtG,EAISA,EAAM3hB,IAAI,SAAU64C,GAAK,OAAOxxC,GAAkBwxC,KAAOr+C,KAAK,KAH9D,UAKd,IAAI86C,EAASt/C,KAAK4/C,cAAcxrC,EAAY6d,GACxCqtB,GAAUA,EAAOlkC,YACjBkkC,EAAOlkC,WAAW,sBAQ1BmiC,EAAqBr9C,UAAU0/C,cAAgB,SAAUxrC,EAAY6d,GACjE,IACIqtB,EADAwD,EAAuB,IAAIpvC,GAAKU,GAAY3L,WAahD,YAX4CtC,IAAxCnG,KAAK+9C,SAAS+E,IACdxD,EAASt/C,KAAK+9C,SAAS+E,GAAsB7wB,UACtCjyB,KAAK+9C,SAAS+E,GAAsB7wB,GACW,IAAlDnoB,EAAS9J,KAAK+9C,SAAS+E,YAChB9iD,KAAK+9C,SAAS+E,IAKzBxD,OAASn5C,EAENm5C,GAEX/B,EAAqBr9C,UAAUqgD,eAAiB,SAAUwC,EAAYC,GAClEv1C,GAAI,uBAAyBs1C,EAAa,IAAMC,GAChDhjD,KAAK2+C,WAAa,KAClB3+C,KAAK4+C,oBAAqB,EAC1B5+C,KAAK0+C,UAAUlM,QACI,kBAAfuQ,GAAiD,sBAAfA,IAIlC/iD,KAAK6+C,yBACD7+C,KAAK6+C,wBAtqBc,IAwqBnB7+C,KAAKo+C,gBA7qBgB,IAgrBrBp+C,KAAK29C,mBAAmB3T,2BAIpCuT,EAAqBr9C,UAAUmhD,uBAAyB,SAAU/gD,GAC1DN,KAAKs+C,uBACLt+C,KAAKs+C,uBAAuBh+C,GAGxB,QAASA,GACToF,QAAQ+H,IAAI,aAAenN,EAAU,IAAEgI,QAAQ,KAAM,kBAIjEi1C,EAAqBr9C,UAAUshD,cAAgB,WAC3C,IAAIl7C,EAAQtG,KAEZA,KAAKggD,UAGLv2C,EAAQzJ,KAAK+9C,SAAU,SAAU3pC,EAAY2zB,GACzCt+B,EAAQs+B,EAAS,SAAUv/B,EAAKg3C,GAC5Bl5C,EAAMm5C,YAAYD,OAG1B,IAAK,IAAI78C,EAAI,EAAGA,EAAI3C,KAAKg+C,iBAAiBl8C,OAAQa,IAC1C3C,KAAKg+C,iBAAiBr7C,IACtB3C,KAAK+gD,SAASp+C,GAEtB,KAAO3C,KAAKk+C,0BAA0Bp8C,QAAQ,CAC1C,IAAI8+C,EAAU5gD,KAAKk+C,0BAA0BrJ,QAC7C70C,KAAK2gD,kBAAkBC,EAAQxhC,OAAQwhC,EAAQxsC,WAAYwsC,EAAQz4C,KAAMy4C,EAAQxlC,cAOzFmiC,EAAqBr9C,UAAUqhD,kBAAoB,WAC/C,IAAI1V,KACAoX,EAAa,KACb/gD,EACA+gD,EAAa,aAER/gD,IACL+gD,EAAa,QAEjBpX,EAAM,OAASoX,EAAa,IAAMtM,EAASC,YAAYtuC,QAAQ,MAAO,MAAQ,EAC1ExB,IACA+kC,EAAM,qBAAuB,EFpjXR,iBAAd5kC,WAAmD,gBAAzBA,UAAmB,UEujXpD4kC,EAAM,yBAA2B,GAErC7rC,KAAKgsC,YAAYH,IAMrB0R,EAAqBr9C,UAAU2hD,iBAAmB,WAC9C,IAAIH,EAASzT,GAAcD,cAAcG,kBACzC,OAAOtkC,EAAQ7J,KAAK89C,oBAAsB4D,GAK9CnE,EAAqBM,4BAA8B,EAMnDN,EAAqB6E,kBAAoB,EAClC7E,GACTP,IAsBEkG,GAAoC,SAAU34C,GAQ9C,SAAS24C,EAAmB3J,EAAWiE,EAAeG,GAClD,IAAIr3C,EAAQiE,EAAO7I,KAAK1B,OAASA,KAajC,OAZAsG,EAAMizC,UAAYA,EAClBjzC,EAAMk3C,cAAgBA,EACtBl3C,EAAMq3C,mBAAqBA,EAE3Br3C,EAAMqpC,KAAOr/B,GAAW,WAOxBhK,EAAMy3C,YACCz3C,EA+HX,OApJAxG,EAAUojD,EAAoB34C,GAuB9B24C,EAAmBhjD,UAAU8rC,YAAc,SAAUH,GACjD,MAAM,IAAItpC,MAAM,4BAQpB2gD,EAAmBC,aAAe,SAAUx3B,EAAO4Z,GAC/C,YAAYp/B,IAARo/B,EACO,OAASA,GAGhBpjC,EAAOwpB,EAAMC,iBAAiBuc,YAAa,kDACpCxc,EAAMhW,KAAKlN,aAI1By6C,EAAmBhjD,UAAUo/C,OAAS,SAAU3zB,EAAO4zB,EAAeha,EAAKnqB,GACvE,IAAI9U,EAAQtG,KACRoU,EAAauX,EAAMhW,KAAKlN,WAC5BzI,KAAK2vC,KAAK,qBAAuBv7B,EAAa,IAAMuX,EAAMwE,mBAE1D,IAAIizB,EAAWF,EAAmBC,aAAax3B,EAAO4Z,GAClD8d,KACJrjD,KAAK+9C,SAASqF,GAAYC,EAC1B,IAAIC,EAAwB33B,EACvBC,iBACA23B,8BACLvjD,KAAKwjD,aAAapvC,EAAa,QAASkvC,EAAuB,SAAU7a,EAAUvnB,GAC/E,IAAI/Y,EAAO+Y,GACM,MAAbunB,IACAtgC,EAAO,KACPsgC,EAAW,MAEE,OAAbA,GACAniC,EAAMk3C,cAAcppC,EAAYjM,GAAmB,EAAOo9B,GAE1D/7B,EAAQlD,EAAMy3C,SAAUqF,KAAcC,IAWtCjoC,EATKqtB,EAGgB,KAAZA,EACM,oBAGA,cAAgBA,EANhB,KAQM,SAKjCya,EAAmBhjD,UAAUsgD,SAAW,SAAU70B,EAAO4Z,GACrD,IAAI6d,EAAWF,EAAmBC,aAAax3B,EAAO4Z,UAC/CvlC,KAAK+9C,SAASqF,IAGzBF,EAAmBhjD,UAAUg9C,iBAAmB,SAAUl0C,KAY1Dk6C,EAAmBhjD,UAAUsjD,aAAe,SAAUpvC,EAAYkvC,EAAuB18C,GACrF,IAAIN,EAAQtG,UACkB,IAA1BsjD,IAAoCA,MACxCA,EAA8B,OAAI,SAClCtjD,KAAK29C,mBACAhU,UAA2B,GAC3BE,KAAK,SAAU4Z,GAChB,IAAIC,EAAYD,GAAiBA,EAAchB,YAC3CiB,IACAJ,EAA4B,KAAII,GAEpC,IF9zWJnsC,EE8zWQ49B,GAAO7uC,EAAMizC,UAAU/iC,OAAS,WAAa,WAC7ClQ,EAAMizC,UAAUhjC,KAChBnC,EACA,OAEA9N,EAAMizC,UAAU9iC,WFn0WxBc,KACJ9N,EEm0WwB65C,EFn0WG,SAAU96C,EAAK5G,GAClCnC,MAAMkE,QAAQ/B,GACdA,EAAM6H,QAAQ,SAAUk6C,GACpBpsC,EAAOxV,KAAKuS,mBAAmB9L,GAAO,IAAM8L,mBAAmBqvC,MAInEpsC,EAAOxV,KAAKuS,mBAAmB9L,GAAO,IAAM8L,mBAAmB1S,MAGhE2V,EAAOzV,OAAS,IAAMyV,EAAO/S,KAAK,KAAO,IE0zWxC8B,EAAMqpC,KAAK,4BAA8BwF,GACzC,IAAIyO,EAAM,IAAIC,eACdD,EAAIhO,mBAAqB,WACrB,GAAIhvC,GAA+B,IAAnBg9C,EAAIrT,WAAkB,CAClCjqC,EAAMqpC,KAAK,qBAAuBwF,EAAM,qBAAsByO,EAAIpb,OAAQ,YAAaob,EAAIE,cAC3F,IAAI55C,EAAM,KACV,GAAI05C,EAAIpb,QAAU,KAAOob,EAAIpb,OAAS,IAAK,CACvC,IACIt+B,EAAMvB,EAASi7C,EAAIE,cAEvB,MAAO9hD,GACH6L,GAAK,qCACDsnC,EACA,KACAyO,EAAIE,cAEZl9C,EAAS,KAAMsD,QAII,MAAf05C,EAAIpb,QAAiC,MAAfob,EAAIpb,QAC1B36B,GAAK,sCACDsnC,EACA,YACAyO,EAAIpb,QAEZ5hC,EAASg9C,EAAIpb,QAEjB5hC,EAAW,OAGnBg9C,EAAI9T,KAAK,MAAOqF,GAAuB,GACvCyO,EAAIjR,UAGLuQ,GACTlG,IAqBE+G,GAAsB,WAMtB,SAASA,EAAKxK,EAAWyK,EAAiBC,GACtC,IAAI39C,EAAQtG,KACZA,KAAKu5C,UAAYA,EACjBv5C,KAAKikD,IAAMA,EACXjkD,KAAKkkD,gBAAkB,EACvBlkD,KAAK0rC,eAAiB,KACtB1rC,KAAKmkD,YAAc,IAAIlY,GACvBjsC,KAAKokD,aAAe,EACpBpkD,KAAKqkD,6BAA+B,KAEpCrkD,KAAKkwC,cAAgB,IAAItf,GAKzB5wB,KAAKskD,sBAAwB,KAE7B,IAAIC,EAAoB,IAAI9a,GAAkBwa,GAE9C,GADAjkD,KAAK4vC,OAASrF,GAAaC,cAAc+O,GACrCyK,GAAmB3wC,KACnBrT,KAAKwrC,QAAU,IAAI0X,GAAmBljD,KAAKu5C,UAAWv5C,KAAKw9C,cAAcntC,KAAKrQ,MAAOukD,GAErFnxC,WAAWpT,KAAKy9C,iBAAiBptC,KAAKrQ,MAAM,GAAO,OAElD,CACD,IAAIwkD,EAAeP,EAAI/Z,QAAsC,6BAE7D,QAA4B,IAAjBsa,GAAiD,OAAjBA,EAAuB,CAC9D,GAA4B,iBAAjBA,EACP,MAAM,IAAIjiD,MAAM,sEAEpB,IACIuG,EAAU07C,GAEd,MAAOxiD,GACH,MAAM,IAAIO,MAAM,kCAAoCP,IAG5DhC,KAAKskD,sBAAwB,IAAI/G,GAAqBv9C,KAAKu5C,UAAWv5C,KAAKw9C,cAAcntC,KAAKrQ,MAAOA,KAAKy9C,iBAAiBptC,KAAKrQ,MAAOA,KAAK09C,oBAAoBrtC,KAAKrQ,MAAOukD,EAAmBC,GAC/LxkD,KAAKwrC,QAAUxrC,KAAKskD,sBAExBC,EAAkBza,uBAAuB,SAAU9gC,GAC/C1C,EAAMklC,QAAQ0R,iBAAiBl0C,KAInChJ,KAAKykD,eAAiBla,GAAaI,oBAAoB4O,EAAW,WAAc,OAAO,IAAIjO,GAAchlC,EAAMspC,OAAQtpC,EAAMklC,WAC7HxrC,KAAK0kD,qBAEL1kD,KAAK2kD,UAAY,IAAItb,GACrBrpC,KAAK4kD,cAAgB,IAAIrgB,IACrB4C,eAAgB,SAAUxb,EAAO4Z,EAAKga,EAAenkC,GACjD,IAAIypC,KACAvoC,EAAOhW,EAAMq+C,UAAUtvB,QAAQ1J,EAAMhW,MASzC,OANK2G,EAAKzS,YACNg7C,EAAav+C,EAAMs+C,cAAczf,qBAAqBxZ,EAAMhW,KAAM2G,GAClElJ,WAAW,WACPgI,EAAW,OACZ,IAEAypC,GAEXtd,cAAe,eAEnBvnC,KAAK8kD,YAAY,aAAa,GAC9B9kD,KAAK+kD,gBAAkB,IAAIxgB,IACvB4C,eAAgB,SAAUxb,EAAO4Z,EAAKga,EAAenkC,GAMjD,OALA9U,EAAMklC,QAAQ8T,OAAO3zB,EAAO4zB,EAAeha,EAAK,SAAUiD,EAAQrgC,GAC9D,IAAIo1B,EAASniB,EAAWotB,EAAQrgC,GAChC7B,EAAM69C,YAAYxX,0BAA0BhhB,EAAMhW,KAAM4nB,SAKhEgK,cAAe,SAAU5b,EAAO4Z,GAC5Bj/B,EAAMklC,QAAQgV,SAAS70B,EAAO4Z,MAkZ1C,OA3YAwe,EAAK7jD,UAAUuI,SAAW,WACtB,OAASzI,KAAKu5C,UAAU/iC,OAAS,WAAa,WAAaxW,KAAKu5C,UAAUhjC,MAK9EwtC,EAAK7jD,UAAUyH,KAAO,WAClB,OAAO3H,KAAKu5C,UAAU9iC,WAK1BstC,EAAK7jD,UAAU8kD,WAAa,WACxB,IACIC,EADajlD,KAAK2kD,UAAUtvB,QAAQ,IAAI3hB,GAAK,2BACzBvF,OAAS,EACjC,OAAO,IAAInI,MAAOE,UAAY++C,GAMlClB,EAAK7jD,UAAUglD,qBAAuB,WAClC,OAvqOJC,GAD+BA,GAyqOvB3I,UAAWx8C,KAAKglD,oBAvqON,UAAIG,EAAkB,YAAK,IAAIn/C,MAAOE,UACjDi/C,EAHc,IAAUA,GAqrO/BpB,EAAK7jD,UAAUs9C,cAAgB,SAAUppC,EAAYjM,EAAMi9C,EAAS7f,GAEhEvlC,KAAKkkD,kBACL,IAAIvuC,EAAO,IAAIjC,GAAKU,GACpBjM,EAAOnI,KAAKqkD,6BACNrkD,KAAKqkD,6BAA6BjwC,EAAYjM,GAC9CA,EACN,IAAIo1B,KACJ,GAAIgI,EACA,GAAI6f,EAAS,CACT,IAAIC,EAAiBr7C,EAAI7B,EAAM,SAAUm9C,GACrC,OAAO78B,GAAe68B,KAE1B/nB,EAASv9B,KAAK+kD,gBAAgBjf,sBAAsBnwB,EAAM0vC,EAAgB9f,OAEzE,CACD,IAAIggB,EAAa98B,GAAetgB,GAChCo1B,EAASv9B,KAAK+kD,gBAAgBzf,0BAA0B3vB,EAAM4vC,EAAYhgB,QAG7E,GAAI6f,EAAS,CACd,IAAInpB,EAAkBjyB,EAAI7B,EAAM,SAAUm9C,GACtC,OAAO78B,GAAe68B,KAE1B/nB,EAASv9B,KAAK+kD,gBAAgB3f,iBAAiBzvB,EAAMsmB,OAEpD,CACD,IAAIrS,EAAOnB,GAAetgB,GAC1Bo1B,EAASv9B,KAAK+kD,gBAAgB5f,qBAAqBxvB,EAAMiU,GAE7D,IAAIsN,EAAevhB,EACf4nB,EAAOz7B,OAAS,IAGhBo1B,EAAel3B,KAAKwlD,mBAAmB7vC,IAE3C3V,KAAKmkD,YAAYxX,0BAA0BzV,EAAcqG,IAO7DwmB,EAAK7jD,UAAUulD,qBAAuB,SAAU7+C,GAC5C5G,KAAKqkD,6BAA+Bz9C,GAMxCm9C,EAAK7jD,UAAUu9C,iBAAmB,SAAUiI,GACxC1lD,KAAK8kD,YAAY,YAAaY,IACR,IAAlBA,GACA1lD,KAAK2lD,0BAOb5B,EAAK7jD,UAAUw9C,oBAAsB,SAAU1c,GAC3C,IAAI16B,EAAQtG,KACZ6R,GAAKmvB,EAAS,SAAUp/B,EAAO4G,GAC3BlC,EAAMw+C,YAAYt8C,EAAK5G,MAS/BmiD,EAAK7jD,UAAU4kD,YAAc,SAAU1wC,EAAYxS,GAC/C,IAAI+T,EAAO,IAAIjC,GAAK,UAAYU,GAC5ByI,EAAU4L,GAAe7mB,GAC7B5B,KAAK2kD,UAAUpb,eAAe5zB,EAAMkH,GACpC,IAAI0gB,EAASv9B,KAAK4kD,cAAczf,qBAAqBxvB,EAAMkH,GAC3D7c,KAAKmkD,YAAYxX,0BAA0Bh3B,EAAM4nB,IAMrDwmB,EAAK7jD,UAAU0lD,gBAAkB,WAC7B,OAAO5lD,KAAKokD,gBAQhBL,EAAK7jD,UAAUsb,gBAAkB,SAAU7F,EAAMkwC,EAAQruB,EAAapc,GAClE,IAAI9U,EAAQtG,KACZA,KAAK2vC,KAAK,OACNh6B,KAAMA,EAAKlN,WACX7G,MAAOikD,EACPhsC,SAAU2d,IAId,IAAIjG,EAAevxB,KAAKklD,uBACpBY,EAAoBr9B,GAAeo9B,EAAQruB,GAC3C3a,EAAU2U,GAA6Bs0B,EAAmBv0B,GAC1D2Q,EAAUliC,KAAK4lD,kBACfroB,EAASv9B,KAAK+kD,gBAAgBlgB,mBAAmBlvB,EAAMkH,EAASqlB,GAAS,GAC7EliC,KAAKmkD,YAAY/X,YAAY7O,GAC7Bv9B,KAAKwrC,QAAQyR,IAAItnC,EAAKlN,WAAYq9C,EAAkB33C,KAAgB,GAAO,SAAUq6B,EAAQyY,GACzF,IAAI8E,EAAqB,OAAXvd,EACTud,GACDl4C,GAAK,UAAY8H,EAAO,YAAc6yB,GAE1C,IAAIwd,EAAc1/C,EAAMy+C,gBAAgB7qB,aAAagI,GAAU6jB,GAC/Dz/C,EAAM69C,YAAYxX,0BAA0Bh3B,EAAMqwC,GAClD1/C,EAAM2/C,uBAAuB7qC,EAAYotB,EAAQyY,KAErD,IAAI/pB,EAAel3B,KAAKkmD,mBAAmBvwC,GAC3C3V,KAAKwlD,mBAAmBtuB,GAExBl3B,KAAKmkD,YAAYxX,0BAA0BzV,OAO/C6sB,EAAK7jD,UAAUoL,OAAS,SAAUqK,EAAMwwC,EAAiB/qC,GACrD,IAAI9U,EAAQtG,KACZA,KAAK2vC,KAAK,UAAYh6B,KAAMA,EAAKlN,WAAY7G,MAAOukD,IAEpD,IAAIC,GAAQ,EACR70B,EAAevxB,KAAKklD,uBACpBjpB,KAMJ,GALAxyB,EAAQ08C,EAAiB,SAAUE,EAAYC,GAC3CF,GAAQ,EACR,IAAIN,EAAoBr9B,GAAe69B,GACvCrqB,EAAgBoqB,GAAc70B,GAA6Bs0B,EAAmBv0B,KAE7E60B,EAsBD34C,GAAI,wDACJzN,KAAKimD,uBAAuB7qC,EAAY,UAvBhC,CACR,IAAImrC,EAAYvmD,KAAK4lD,kBACjBroB,EAASv9B,KAAK+kD,gBAAgB/f,eAAervB,EAAMsmB,EAAiBsqB,GACxEvmD,KAAKmkD,YAAY/X,YAAY7O,GAC7Bv9B,KAAKwrC,QAAQzR,MAAMpkB,EAAKlN,WAAY09C,EAAiB,SAAU3d,EAAQyY,GACnE,IAAI8E,EAAqB,OAAXvd,EACTud,GACDl4C,GAAK,aAAe8H,EAAO,YAAc6yB,GAE7C,IAAIwd,EAAc1/C,EAAMy+C,gBAAgB7qB,aAAaqsB,GAAYR,GAC7D7uB,EAAe8uB,EAAYlkD,OAAS,EAAIwE,EAAMk/C,mBAAmB7vC,GAAQA,EAC7ErP,EAAM69C,YAAYxX,0BAA0BzV,EAAc8uB,GAC1D1/C,EAAM2/C,uBAAuB7qC,EAAYotB,EAAQyY,KAErDx3C,EAAQ08C,EAAiB,SAAUvZ,GAC/B,IAAI1V,EAAe5wB,EAAM4/C,mBAAmBvwC,EAAKjB,MAAMk4B,IACvDtmC,EAAMk/C,mBAAmBtuB,KAG7Bl3B,KAAKmkD,YAAYxX,0BAA0Bh3B,QAWnDouC,EAAK7jD,UAAUylD,uBAAyB,WACpC,IAAIr/C,EAAQtG,KACZA,KAAK2vC,KAAK,sBACV,IAAIpe,EAAevxB,KAAKklD,uBAEpB3nB,MAt0OmB,SAAUrM,EAAMK,GAC3C,IAAIi1B,EAAe,IAAI51B,GAIvB,OAHAM,EAAKC,YAAY,IAAIzd,GAAK,IAAK,SAAUiC,EAAM2G,GAC3CkqC,EAAaz1B,SAASpb,EAAM6b,GAA6BlV,EAAMiV,MAE5Di1B,GAg0O4BC,CAAyBzmD,KAAKkwC,cAAe3e,GAEnDJ,YAAYzd,GAAKmf,MAAO,SAAUld,EAAMiU,GAC7D2T,EAASA,EAAO7vB,OAAOpH,EAAMy+C,gBAAgB5f,qBAAqBxvB,EAAMiU,IACxE,IAAIsN,EAAe5wB,EAAM4/C,mBAAmBvwC,GAC5CrP,EAAMk/C,mBAAmBtuB,KAE7Bl3B,KAAKkwC,cAAgB,IAAItf,GACzB5wB,KAAKmkD,YAAYxX,0BAA0Bj5B,GAAKmf,MAAO0K,IAM3DwmB,EAAK7jD,UAAUob,mBAAqB,SAAU3F,EAAMyF,GAChD,IAAI9U,EAAQtG,KACZA,KAAKwrC,QAAQlwB,mBAAmB3F,EAAKlN,WAAY,SAAU+/B,EAAQyY,GAChD,OAAXzY,GACAliC,EAAM4pC,cAAclf,OAAOrb,GAE/BrP,EAAM2/C,uBAAuB7qC,EAAYotB,EAAQyY,MAQzD8C,EAAK7jD,UAAUqb,gBAAkB,SAAU5F,EAAM/T,EAAOwZ,GACpD,IAAI9U,EAAQtG,KACR6c,EAAU4L,GAAe7mB,GAC7B5B,KAAKwrC,QAAQ2R,gBAAgBxnC,EAAKlN,WAAYoU,EAAQ1O,KAAgB,GAAO,SAAUq6B,EAAQyY,GAC5E,OAAXzY,GACAliC,EAAM4pC,cAAcnf,SAASpb,EAAMkH,GAEvCvW,EAAM2/C,uBAAuB7qC,EAAYotB,EAAQyY,MASzD8C,EAAK7jD,UAAUub,4BAA8B,SAAU9F,EAAM/T,EAAOiY,EAAUuB,GAC1E,IAAI9U,EAAQtG,KACR6c,EAAU4L,GAAe7mB,EAAOiY,GACpC7Z,KAAKwrC,QAAQ2R,gBAAgBxnC,EAAKlN,WAAYoU,EAAQ1O,KAAgB,GAAO,SAAUq6B,EAAQyY,GAC5E,OAAXzY,GACAliC,EAAM4pC,cAAcnf,SAASpb,EAAMkH,GAEvCvW,EAAM2/C,uBAAuB7qC,EAAYotB,EAAQyY,MAQzD8C,EAAK7jD,UAAU0b,mBAAqB,SAAUjG,EAAMwwC,EAAiB/qC,GACjE,IAAI9U,EAAQtG,KACZ,GAAI6J,EAAQs8C,GAGR,OAFA14C,GAAI,4EACJzN,KAAKimD,uBAAuB7qC,EAAY,MAG5Cpb,KAAKwrC,QAAQ4R,kBAAkBznC,EAAKlN,WAAY09C,EAAiB,SAAU3d,EAAQyY,GAChE,OAAXzY,GACA/+B,EAAQ08C,EAAiB,SAAU3nC,EAAWI,GAC1C,IAAIE,EAAe2J,GAAe7J,GAClCtY,EAAM4pC,cAAcnf,SAASpb,EAAKjB,MAAM8J,GAAYM,KAG5DxY,EAAM2/C,uBAAuB7qC,EAAYotB,EAAQyY,MAOzD8C,EAAK7jD,UAAU0uB,yBAA2B,SAAUjD,EAAOf,GACvD,IAAI2S,EAEAA,EAD0B,UAA1B5R,EAAMhW,KAAK3B,WACFhU,KAAK4kD,cAAc5lB,qBAAqBrT,EAAOf,GAG/C5qB,KAAK+kD,gBAAgB/lB,qBAAqBrT,EAAOf,GAE9D5qB,KAAKmkD,YAAY1X,kBAAkB9gB,EAAMhW,KAAM4nB,IAMnDwmB,EAAK7jD,UAAU4uB,4BAA8B,SAAUnD,EAAOf,GAG1D,IAAI2S,EAEAA,EAD0B,UAA1B5R,EAAMhW,KAAK3B,WACFhU,KAAK4kD,cAAc3lB,wBAAwBtT,EAAOf,GAGlD5qB,KAAK+kD,gBAAgB9lB,wBAAwBtT,EAAOf,GAEjE5qB,KAAKmkD,YAAY1X,kBAAkB9gB,EAAMhW,KAAM4nB,IAEnDwmB,EAAK7jD,UAAUwiD,UAAY,WACnB1iD,KAAKskD,uBACLtkD,KAAKskD,sBAAsB5B,UAzZhB,mBA4ZnBqB,EAAK7jD,UAAUyiD,OAAS,WAChB3iD,KAAKskD,uBACLtkD,KAAKskD,sBAAsB3B,OA9ZhB,mBAianBoB,EAAK7jD,UAAU2rC,MAAQ,SAAU6a,GAE7B,QADkB,IAAdA,IAAwBA,GAAY,GACjB,oBAAZhhD,QAAX,CAEA,IAAImmC,EACA6a,GACK1mD,KAAK0rC,iBACN1rC,KAAK0rC,eAAiB,IAAIZ,GAAc9qC,KAAK4vC,SACjD/D,EAAQ7rC,KAAK0rC,eAAe7jC,OAG5BgkC,EAAQ7rC,KAAK4vC,OAAO/nC,MAExB,IAAI8+C,EAAcrnD,OAAOgS,KAAKu6B,GAAO+a,OAAO,SAAUC,EAAeC,GACjE,OAAO30C,KAAK4D,IAAI+wC,EAAahlD,OAAQ+kD,IACtC,GACHp9C,EAAQoiC,EAAO,SAAUV,EAAMvpC,GAE3B,IAAK,IAAIe,EAAIwoC,EAAKrpC,OAAQa,EAAIgkD,EAAc,EAAGhkD,IAC3CwoC,GAAQ,IACZzlC,QAAQ+H,IAAI09B,EAAOvpC,OAG3BmiD,EAAK7jD,UAAU6mD,sBAAwB,SAAUC,GAC7ChnD,KAAK4vC,OAAOvF,iBAAiB2c,GAC7BhnD,KAAKykD,eAAe7Y,YAAYob,IAMpCjD,EAAK7jD,UAAUyvC,KAAO,WAElB,IADA,IAAI5/B,KACK5C,EAAK,EAAGA,EAAK1F,UAAU3F,OAAQqL,IACpC4C,EAAS5C,GAAM1F,UAAU0F,GAE7B,IAAIoD,EAAS,GACTvQ,KAAKskD,wBACL/zC,EAASvQ,KAAKskD,sBAAsB13C,GAAK,KAE7Ca,GAAIjG,WAAM,GAAS+I,GAAQ7C,OAAOqC,KAOtCg0C,EAAK7jD,UAAU+lD,uBAAyB,SAAUr/C,EAAU4hC,EAAQyY,GAC5Dr6C,GACAuM,GAAe,WACX,GAAc,MAAVq1B,EACA5hC,EAAS,UAER,CACD,IAAIU,GAAQkhC,GAAU,SAASG,cAC3BtmC,EAAUiF,EACV25C,IACA5+C,GAAW,KAAO4+C,GACtB,IAAIxY,EAAW,IAAIlmC,MAAMF,GACzBomC,EAASnhC,KAAOA,EAChBV,EAAS6hC,OAKzBnpC,OAAOsI,eAAem8C,EAAK7jD,UAAW,YAClC2H,IAAK,WACD,OAAO7H,KAAKinD,aAAejnD,KAAKinD,WAAa,IAAIC,GAASlnD,QAE9DoO,YAAY,EACZC,cAAc,IAEX01C,KAwBPoD,GAA8B,WAI9B,SAASA,EAAa5vC,GAClBvX,KAAKonD,eAAiB,IAAInwB,GAAc1f,EAAOsU,YAC/C7rB,KAAKkqB,OAAS3S,EAAOsU,WACrB7rB,KAAKqnD,WAAaF,EAAaG,cAAc/vC,GAC7CvX,KAAKunD,SAAWJ,EAAaK,YAAYjwC,GAuG7C,OAlGA4vC,EAAajnD,UAAUunD,aAAe,WAClC,OAAOznD,KAAKqnD,YAKhBF,EAAajnD,UAAUwnD,WAAa,WAChC,OAAO1nD,KAAKunD,UAMhBJ,EAAajnD,UAAUksB,QAAU,SAAU9P,GACvC,OAAQtc,KAAKkqB,OAAOxN,QAAQ1c,KAAKynD,eAAgBnrC,IAAS,GACtDtc,KAAKkqB,OAAOxN,QAAQJ,EAAMtc,KAAK0nD,eAAiB,GAKxDP,EAAajnD,UAAU6e,YAAc,SAAU6K,EAAMphB,EAAK+qB,EAAU2D,EAAcnxB,EAAQoxB,GAItF,OAHKn3B,KAAKosB,QAAQ,IAAI/P,GAAU7T,EAAK+qB,MACjCA,EAAW9M,GAAatI,YAErBne,KAAKonD,eAAeroC,YAAY6K,EAAMphB,EAAK+qB,EAAU2D,EAAcnxB,EAAQoxB,IAKtFgwB,EAAajnD,UAAUo3B,eAAiB,SAAUlB,EAASmB,EAASJ,GAC5DI,EAAQzZ,eAERyZ,EAAU9Q,GAAatI,YAE3B,IAAIyX,EAAW2B,EAAQpX,UAAUngB,KAAKkqB,QAEtC0L,EAAWA,EAASvX,eAAeoI,GAAatI,YAChD,IAAIwpC,EAAO3nD,KAMX,OALAu3B,EAAQrY,aAAaoB,GAAgB,SAAU9X,EAAKoW,GAC3C+oC,EAAKv7B,QAAQ,IAAI/P,GAAU7T,EAAKoW,MACjCgX,EAAWA,EAAS/W,qBAAqBrW,EAAKie,GAAatI,eAG5Dne,KAAKonD,eAAe9vB,eAAelB,EAASR,EAAUuB,IAKjEgwB,EAAajnD,UAAUme,eAAiB,SAAU+X,EAASoB,GAEvD,OAAOpB,GAKX+wB,EAAajnD,UAAUu3B,aAAe,WAClC,OAAO,GAKX0vB,EAAajnD,UAAUw3B,iBAAmB,WACtC,OAAO13B,KAAKonD,gBAKhBD,EAAajnD,UAAU2rB,SAAW,WAC9B,OAAO7rB,KAAKkqB,QAOhBi9B,EAAaG,cAAgB,SAAU/vC,GACnC,GAAIA,EAAOgW,WAAY,CACnB,IAAIq6B,EAAYrwC,EAAOsW,oBACvB,OAAOtW,EAAOsU,WAAWxO,SAAS9F,EAAOiW,qBAAsBo6B,GAG/D,OAAOrwC,EAAOsU,WAAW7O,WAQjCmqC,EAAaK,YAAc,SAAUjwC,GACjC,GAAIA,EAAOkW,SAAU,CACjB,IAAIo6B,EAAUtwC,EAAOuW,kBACrB,OAAOvW,EAAOsU,WAAWxO,SAAS9F,EAAOmW,mBAAoBm6B,GAG7D,OAAOtwC,EAAOsU,WAAWzO,WAG1B+pC,KAwBPW,GAA+B,WAI/B,SAASA,EAAcvwC,GACnBvX,KAAK+nD,cAAgB,IAAIZ,GAAa5vC,GACtCvX,KAAKkqB,OAAS3S,EAAOsU,WACrB7rB,KAAKgoD,OAASzwC,EAAO0wC,WACrBjoD,KAAKkoD,UAAY3wC,EAAO4wC,iBA0N5B,OArNAL,EAAc5nD,UAAU6e,YAAc,SAAU6K,EAAMphB,EAAK+qB,EAAU2D,EAAcnxB,EAAQoxB,GAIvF,OAHKn3B,KAAK+nD,cAAc37B,QAAQ,IAAI/P,GAAU7T,EAAK+qB,MAC/CA,EAAW9M,GAAatI,YAExByL,EAAKrL,kBAAkB/V,GAAKgN,OAAO+d,GAE5B3J,EAEFA,EAAK3K,cAAgBjf,KAAKgoD,OACxBhoD,KAAK+nD,cACPrwB,mBACA3Y,YAAY6K,EAAMphB,EAAK+qB,EAAU2D,EAAcnxB,EAAQoxB,GAGrDn3B,KAAKooD,sBAAsBx+B,EAAMphB,EAAK+qB,EAAUxtB,EAAQoxB,IAMvE2wB,EAAc5nD,UAAUo3B,eAAiB,SAAUlB,EAASmB,EAASJ,GACjE,IAAIvB,EACJ,GAAI2B,EAAQzZ,cAAgByZ,EAAQ1tB,UAEhC+rB,EAAWnP,GAAatI,WAAWgC,UAAUngB,KAAKkqB,aAGlD,GAAkB,EAAdlqB,KAAKgoD,OAAazwB,EAAQtY,eAC1BsY,EAAQnX,UAAUpgB,KAAKkqB,QAAS,CAEhC0L,EAAWnP,GAAatI,WAAWgC,UAAUngB,KAAKkqB,QAElD,IAAI7oB,OAAW,EAEXA,EADArB,KAAKkoD,SACM3wB,EAAQ/T,uBAAuBxjB,KAAK+nD,cAAcL,aAAc1nD,KAAKkqB,QAGrEqN,EAAQhU,gBAAgBvjB,KAAK+nD,cAAcN,eAAgBznD,KAAKkqB,QAG/E,IADA,IAAIxI,EAAQ,EACLrgB,EAAS8f,WAAaO,EAAQ1hB,KAAKgoD,QAAQ,CAC9C,IAAIhnD,EAAOK,EAAS4f,UAUpB,KARIjhB,KAAKkoD,SAEDloD,KAAKkqB,OAAOxN,QAAQ1c,KAAK+nD,cAAcN,eAAgBzmD,IAAS,EAIhEhB,KAAKkqB,OAAOxN,QAAQ1b,EAAMhB,KAAK+nD,cAAcL,eAAiB,GAQlE,MALA9xB,EAAWA,EAAS/W,qBAAqB7d,EAAK2G,KAAM3G,EAAKsb,MACzDoF,SAQP,CAIDkU,GAFAA,EAAW2B,EAAQpX,UAAUngB,KAAKkqB,SAEd7L,eAAeoI,GAAatI,YAChD,IAAIyJ,OAAY,EACZC,OAAU,EACVtS,OAAM,EACNlU,OAAW,EACf,GAAIrB,KAAKkoD,SAAU,CACf7mD,EAAWu0B,EAASnS,mBAAmBzjB,KAAKkqB,QAC5CtC,EAAY5nB,KAAK+nD,cAAcL,aAC/B7/B,EAAU7nB,KAAK+nD,cAAcN,eAC7B,IAAIY,EAAiBroD,KAAKkqB,OAAOzN,aACjClH,EAAM,SAAUlK,EAAG1L,GAAK,OAAO0oD,EAAe1oD,EAAG0L,SAGjDhK,EAAWu0B,EAASvS,YAAYrjB,KAAKkqB,QACrCtC,EAAY5nB,KAAK+nD,cAAcN,eAC/B5/B,EAAU7nB,KAAK+nD,cAAcL,aAC7BnyC,EAAMvV,KAAKkqB,OAAOzN,aAElBiF,EAAQ,EAEZ,IAFA,IACI4mC,GAAiB,EACdjnD,EAAS8f,WAAW,CACnBngB,EAAOK,EAAS4f,WACfqnC,GAAkB/yC,EAAIqS,EAAW5mB,IAAS,IAE3CsnD,GAAiB,GAEPA,GAAkB5mC,EAAQ1hB,KAAKgoD,QAAUzyC,EAAIvU,EAAM6mB,IAAY,EAEzEnG,IAGAkU,EAAWA,EAAS/W,qBAAqB7d,EAAK2G,KAAM8e,GAAatI,aAKjF,OAAOne,KAAK+nD,cACPrwB,mBACAJ,eAAelB,EAASR,EAAUuB,IAK3C2wB,EAAc5nD,UAAUme,eAAiB,SAAU+X,EAASoB,GAExD,OAAOpB,GAKX0xB,EAAc5nD,UAAUu3B,aAAe,WACnC,OAAO,GAKXqwB,EAAc5nD,UAAUw3B,iBAAmB,WACvC,OAAO13B,KAAK+nD,cAAcrwB,oBAK9BowB,EAAc5nD,UAAU2rB,SAAW,WAC/B,OAAO7rB,KAAKkqB,QAWhB49B,EAAc5nD,UAAUkoD,sBAAwB,SAAUx+B,EAAMkH,EAAUmC,EAAWltB,EAAQwiD,GAEzF,IAAIhzC,EACJ,GAAIvV,KAAKkoD,SAAU,CACf,IAAIM,EAAaxoD,KAAKkqB,OAAOzN,aAC7BlH,EAAM,SAAUlK,EAAG1L,GAAK,OAAO6oD,EAAW7oD,EAAG0L,SAG7CkK,EAAMvV,KAAKkqB,OAAOzN,aAEtB,IAAIugB,EAAgBpT,EACpBznB,EAAO66B,EAAc/d,eAAiBjf,KAAKgoD,OAAQ,IACnD,IAAIS,EAAoB,IAAIpsC,GAAUyU,EAAUmC,GAC5Cy1B,EAAiB1oD,KAAKkoD,SACpBlrB,EAAcxV,cAAcxnB,KAAKkqB,QACjC8S,EAActV,aAAa1nB,KAAKkqB,QAClCy+B,EAAU3oD,KAAK+nD,cAAc37B,QAAQq8B,GACzC,GAAIzrB,EAActe,SAASoS,GAAW,CAGlC,IAFA,IAAI83B,EAAe5rB,EAAcze,kBAAkBuS,GAC/CmD,EAAYluB,EAAOqyB,mBAAmBp4B,KAAKkqB,OAAQw+B,EAAgB1oD,KAAKkoD,UACxD,MAAbj0B,IACFA,EAAUtsB,MAAQmpB,GAAYkM,EAActe,SAASuV,EAAUtsB,QAIhEssB,EAAYluB,EAAOqyB,mBAAmBp4B,KAAKkqB,OAAQ+J,EAAWj0B,KAAKkoD,UAEvE,IAAIW,EAA2B,MAAb50B,EAAoB,EAAI1e,EAAI0e,EAAWw0B,GAEzD,GADsBE,IAAY11B,EAAUppB,WAAag/C,GAAe,EAKpE,OAHyB,MAArBN,GACAA,EAAkBlxB,iBAAiBlB,GAAOQ,mBAAmB7F,EAAUmC,EAAW21B,IAE/E5rB,EAAcne,qBAAqBiS,EAAUmC,GAG3B,MAArBs1B,GACAA,EAAkBlxB,iBAAiBlB,GAAOM,mBAAmB3F,EAAU83B,IAE3E,IAAI/tB,EAAgBmC,EAAcne,qBAAqBiS,EAAUrK,GAAatI,YAE9E,OADoC,MAAb8V,GAAqBj0B,KAAK+nD,cAAc37B,QAAQ6H,IAE1C,MAArBs0B,GACAA,EAAkBlxB,iBAAiBlB,GAAOI,iBAAiBtC,EAAUtsB,KAAMssB,EAAU3X,OAElFue,EAAchc,qBAAqBoV,EAAUtsB,KAAMssB,EAAU3X,OAG7Due,EAId,OAAI5H,EAAUppB,UAER+f,EAEF++B,GACDpzC,EAAImzC,EAAgBD,IAAsB,GACjB,MAArBF,IACAA,EAAkBlxB,iBAAiBlB,GAAOM,mBAAmBiyB,EAAe/gD,KAAM+gD,EAAepsC,OACjGisC,EAAkBlxB,iBAAiBlB,GAAOI,iBAAiBzF,EAAUmC,KAElE+J,EACFne,qBAAqBiS,EAAUmC,GAC/BpU,qBAAqB6pC,EAAe/gD,KAAM8e,GAAatI,aAOzDyL,GAGRk+B,KAwBPgB,GAA6B,WAC7B,SAASA,IACL9oD,KAAK+oD,WAAY,EACjB/oD,KAAKgpD,WAAY,EACjBhpD,KAAKipD,eAAgB,EACrBjpD,KAAKkpD,SAAU,EACflpD,KAAKmpD,aAAc,EACnBnpD,KAAKgoD,OAAS,EACdhoD,KAAKopD,UAAY,GACjBppD,KAAKqpD,iBAAmB,KACxBrpD,KAAKspD,gBAAkB,GACvBtpD,KAAKupD,eAAiB,KACtBvpD,KAAKwpD,cAAgB,GACrBxpD,KAAKkqB,OAAS5J,GAmWlB,OA9VAwoC,EAAY5oD,UAAUqtB,SAAW,WAC7B,OAAOvtB,KAAKgpD,WAKhBF,EAAY5oD,UAAUioD,eAAiB,WACnC,MAAuB,KAAnBnoD,KAAKopD,UAKEppD,KAAKgpD,UAGJhpD,KAAKopD,YAAcN,EAAYW,yBAAyBC,gBAOxEZ,EAAY5oD,UAAUstB,mBAAqB,WAEvC,OADArrB,EAAOnC,KAAKgpD,UAAW,oCAChBhpD,KAAKqpD,kBAOhBP,EAAY5oD,UAAU2tB,kBAAoB,WAEtC,OADA1rB,EAAOnC,KAAKgpD,UAAW,oCACnBhpD,KAAKipD,cACEjpD,KAAKspD,gBAGLz4C,IAMfi4C,EAAY5oD,UAAUutB,OAAS,WAC3B,OAAOztB,KAAKkpD,SAMhBJ,EAAY5oD,UAAUwtB,iBAAmB,WAErC,OADAvrB,EAAOnC,KAAKkpD,QAAS,kCACdlpD,KAAKupD,gBAOhBT,EAAY5oD,UAAU4tB,gBAAkB,WAEpC,OADA3rB,EAAOnC,KAAKkpD,QAAS,kCACjBlpD,KAAKmpD,YACEnpD,KAAKwpD,cAGL14C,IAMfg4C,EAAY5oD,UAAU8tB,SAAW,WAC7B,OAAOhuB,KAAK+oD,WAKhBD,EAAY5oD,UAAU+tB,iBAAmB,WACrC,OAAOjuB,KAAK+oD,WAAgC,KAAnB/oD,KAAKopD,WAMlCN,EAAY5oD,UAAU+nD,SAAW,WAE7B,OADA9lD,EAAOnC,KAAK+oD,UAAW,oCAChB/oD,KAAKgoD,QAKhBc,EAAY5oD,UAAU2rB,SAAW,WAC7B,OAAO7rB,KAAKkqB,QAMhB4+B,EAAY5oD,UAAUypD,MAAQ,WAC1B,IAAIloC,EAAO,IAAIqnC,EAaf,OAZArnC,EAAKsnC,UAAY/oD,KAAK+oD,UACtBtnC,EAAKumC,OAAShoD,KAAKgoD,OACnBvmC,EAAKunC,UAAYhpD,KAAKgpD,UACtBvnC,EAAK4nC,iBAAmBrpD,KAAKqpD,iBAC7B5nC,EAAKwnC,cAAgBjpD,KAAKipD,cAC1BxnC,EAAK6nC,gBAAkBtpD,KAAKspD,gBAC5B7nC,EAAKynC,QAAUlpD,KAAKkpD,QACpBznC,EAAK8nC,eAAiBvpD,KAAKupD,eAC3B9nC,EAAK0nC,YAAcnpD,KAAKmpD,YACxB1nC,EAAK+nC,cAAgBxpD,KAAKwpD,cAC1B/nC,EAAKyI,OAASlqB,KAAKkqB,OACnBzI,EAAK2nC,UAAYppD,KAAKopD,UACf3nC,GAMXqnC,EAAY5oD,UAAUmvB,MAAQ,SAAUu6B,GACpC,IAAIn6B,EAAYzvB,KAAK2pD,QAIrB,OAHAl6B,EAAUs5B,WAAY,EACtBt5B,EAAUu4B,OAAS4B,EACnBn6B,EAAU25B,UAAY,GACf35B,GAMXq5B,EAAY5oD,UAAUkvB,aAAe,SAAUw6B,GAC3C,IAAIn6B,EAAYzvB,KAAK2pD,QAIrB,OAHAl6B,EAAUs5B,WAAY,EACtBt5B,EAAUu4B,OAAS4B,EACnBn6B,EAAU25B,UAAYN,EAAYW,yBAAyBC,eACpDj6B,GAMXq5B,EAAY5oD,UAAUovB,YAAc,SAAUs6B,GAC1C,IAAIn6B,EAAYzvB,KAAK2pD,QAIrB,OAHAl6B,EAAUs5B,WAAY,EACtBt5B,EAAUu4B,OAAS4B,EACnBn6B,EAAU25B,UAAYN,EAAYW,yBAAyBI,gBACpDp6B,GAOXq5B,EAAY5oD,UAAU4vB,QAAU,SAAUxS,EAAY9U,GAClD,IAAIinB,EAAYzvB,KAAK2pD,QAcrB,OAbAl6B,EAAUu5B,WAAY,OACD7iD,IAAfmX,IACFA,EAAa,MAEjBmS,EAAU45B,iBAAmB/rC,EAClB,MAAP9U,GACAinB,EAAUw5B,eAAgB,EAC1Bx5B,EAAU65B,gBAAkB9gD,IAG5BinB,EAAUw5B,eAAgB,EAC1Bx5B,EAAU65B,gBAAkB,IAEzB75B,GAOXq5B,EAAY5oD,UAAU6vB,MAAQ,SAAUzS,EAAY9U,GAChD,IAAIinB,EAAYzvB,KAAK2pD,QAcrB,OAbAl6B,EAAUy5B,SAAU,OACC/iD,IAAfmX,IACFA,EAAa,MAEjBmS,EAAU85B,eAAiBjsC,OACfnX,IAARqC,GACAinB,EAAU05B,aAAc,EACxB15B,EAAU+5B,cAAgBhhD,IAG1BinB,EAAU05B,aAAc,EACxB15B,EAAU+5B,cAAgB,IAEvB/5B,GAMXq5B,EAAY5oD,UAAUwvB,QAAU,SAAUvQ,GACtC,IAAIsQ,EAAYzvB,KAAK2pD,QAErB,OADAl6B,EAAUvF,OAAS/K,EACZsQ,GAKXq5B,EAAY5oD,UAAUgwB,eAAiB,WACnC,IAAI45B,EAA0BhB,EAAYW,yBACtClgD,KAaJ,GAZIvJ,KAAKgpD,YACLz/C,EAAIugD,EAAwBC,mBAAqB/pD,KAAKqpD,iBAClDrpD,KAAKipD,gBACL1/C,EAAIugD,EAAwBE,kBAAoBhqD,KAAKspD,kBAGzDtpD,KAAKkpD,UACL3/C,EAAIugD,EAAwBG,iBAAmBjqD,KAAKupD,eAChDvpD,KAAKmpD,cACL5/C,EAAIugD,EAAwBI,gBAAkBlqD,KAAKwpD,gBAGvDxpD,KAAK+oD,UAAW,CAChBx/C,EAAIugD,EAAwBK,OAASnqD,KAAKgoD,OAC1C,IAAIoC,EAAWpqD,KAAKopD,UACH,KAAbgB,IAEIA,EADApqD,KAAKmoD,iBACM2B,EAAwBJ,eAGxBI,EAAwBD,iBAG3CtgD,EAAIugD,EAAwBO,WAAaD,EAM7C,OAHIpqD,KAAKkqB,SAAW5J,KAChB/W,EAAIugD,EAAwBQ,OAAStqD,KAAKkqB,OAAOzhB,YAE9Cc,GAKXu/C,EAAY5oD,UAAU6+B,aAAe,WACjC,QAAS/+B,KAAKgpD,WAAahpD,KAAKkpD,SAAWlpD,KAAK+oD,YAKpDD,EAAY5oD,UAAUioC,UAAY,WAC9B,OAAOnoC,KAAK++B,gBAAkB/+B,KAAKkqB,QAAU5J,IAKjDwoC,EAAY5oD,UAAUq+B,cAAgB,WAClC,OAAIv+B,KAAK++B,eACE,IAAI9H,GAAcj3B,KAAK6rB,YAEzB7rB,KAAKguB,WACH,IAAI85B,GAAc9nD,MAGlB,IAAImnD,GAAannD,OAQhC8oD,EAAY5oD,UAAUqjD,4BAA8B,WAChD,IAKI7zB,EALA66B,EAAiBzB,EAAY0B,sBAC7BC,KACJ,OAAIzqD,KAAKmoC,YACEsiB,GAGPzqD,KAAKkqB,SAAW5J,GAChBoP,EAAU66B,EAAejqC,eAEpBtgB,KAAKkqB,SAAWZ,GACrBoG,EAAU66B,EAAejhC,YAEpBtpB,KAAKkqB,SAAW3M,GACrBmS,EAAU66B,EAAehtC,WAGzBpb,EAAOnC,KAAKkqB,kBAAkBT,GAAW,4BACzCiG,EAAU1vB,KAAKkqB,OAAOzhB,YAE1BgiD,EAAGF,EAAeG,UAAY5hD,EAAU4mB,GACpC1vB,KAAKgpD,YACLyB,EAAGF,EAAeI,UAAY7hD,EAAU9I,KAAKqpD,kBACzCrpD,KAAKipD,gBACLwB,EAAGF,EAAeI,WAAa,IAAM7hD,EAAU9I,KAAKspD,mBAGxDtpD,KAAKkpD,UACLuB,EAAGF,EAAeK,QAAU9hD,EAAU9I,KAAKupD,gBACvCvpD,KAAKmpD,cACLsB,EAAGF,EAAeK,SAAW,IAAM9hD,EAAU9I,KAAKwpD,iBAGtDxpD,KAAK+oD,YACD/oD,KAAKmoD,iBACLsC,EAAGF,EAAeM,gBAAkB7qD,KAAKgoD,OAGzCyC,EAAGF,EAAeO,eAAiB9qD,KAAKgoD,QAGzCyC,IAQX3B,EAAYW,0BACRM,kBAAmB,KACnBC,iBAAkB,KAClBC,gBAAiB,KACjBC,eAAgB,KAChBC,MAAO,IACPE,UAAW,KACXX,eAAgB,IAChBG,gBAAiB,IACjBS,MAAO,KAQXxB,EAAY0B,uBACRE,SAAU,UACVpqC,eAAgB,YAChBgJ,YAAa,SACb/L,UAAW,OACXotC,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAOnBhC,EAAYiC,QAAU,IAAIjC,EACnBA,KAkBPkC,GAA2B,SAAUzgD,GAarC,SAASygD,EAAU/9B,EAAMtX,GAErB,KAAMsX,aAAgB82B,IAClB,MAAM,IAAIxhD,MAAM,6DAIpB,OADQgI,EAAO7I,KAAK1B,KAAMitB,EAAMtX,EAAMmzC,GAAYiC,SAAS,IAAU/qD,KA6OzE,OA/PAF,EAAUkrD,EAAWzgD,GAsBrBygD,EAAU9qD,UAAUuqB,OAAS,WAEzB,OADA5e,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU3F,QAC9C9B,KAAK2V,KAAK9L,UACH,KAEA7J,KAAK2V,KAAKxB,WAMzB62C,EAAU9qD,UAAUwU,MAAQ,SAAUN,GAWlC,OAVAvI,EAAiB,kBAAmB,EAAG,EAAGpE,UAAU3F,QAC1B,iBAAfsS,EACPA,EAAarP,OAAOqP,GAEbA,aAAsBV,KACA,OAAzB1T,KAAK2V,KAAK3B,WAthYG,SAAUlI,EAAQM,EAAgBgI,EAAY/H,GACnE+H,IAEAA,EAAaA,EAAW9L,QAAQ,mBAAoB,MAExDuS,GAAmB/O,EAAQM,EAAgBgI,EAAY/H,GAkhY3C4+C,CAAuB,kBAAmB,EAAG72C,GAAY,GAEzDyG,GAAmB,kBAAmB,EAAGzG,GAAY,IAEtD,IAAI42C,EAAUhrD,KAAKitB,KAAMjtB,KAAK2V,KAAKjB,MAAMN,KAGpD42C,EAAU9qD,UAAU8qB,UAAY,WAC5Bnf,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QACrD,IAAIopD,EAAalrD,KAAK2V,KAAKnB,SAC3B,OAAsB,OAAf02C,EAAsB,KAAO,IAAIF,EAAUhrD,KAAKitB,KAAMi+B,IAGjEF,EAAU9qD,UAAUirD,QAAU,WAC1Bt/C,EAAiB,iBAAkB,EAAG,EAAGpE,UAAU3F,QAEnD,IADA,IAAIipB,EAAM/qB,KACiB,OAApB+qB,EAAIC,aACPD,EAAMA,EAAIC,YAEd,OAAOD,GAGXigC,EAAU9qD,UAAUkrD,aAAe,WAC/B,OAAOprD,KAAKitB,KAAKo+B,UAOrBL,EAAU9qD,UAAUgO,IAAM,SAAU23C,EAAQzqC,GACxCvP,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU3F,QAClDgZ,GAAqB,gBAAiB9a,KAAK2V,MAC3CmE,GAAwB,gBAAiB,EAAG+rC,EAAQ7lD,KAAK2V,MAAM,GAC/DpJ,EAAiB,gBAAiB,EAAG6O,GAAY,GACjD,IAAIC,EAAW,IAAIhV,EAGnB,OAFArG,KAAKitB,KAAKzR,gBAAgBxb,KAAK2V,KAAMkwC,EACvB,KAAMxqC,EAAS1U,aAAayU,IACnCC,EAAS9U,SAOpBykD,EAAU9qD,UAAUoL,OAAS,SAAUoQ,EAAeN,GAGlD,GAFAvP,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QACrDgZ,GAAqB,mBAAoB9a,KAAK2V,MAC1ClW,MAAMkE,QAAQ+X,GAAgB,CAE9B,IADA,IAAIC,KACKhZ,EAAI,EAAGA,EAAI+Y,EAAc5Z,SAAUa,EACxCgZ,EAAiB,GAAKhZ,GAAK+Y,EAAc/Y,GAE7C+Y,EAAgBC,EAChB9N,GAAK,wMAKTuM,GAA6B,mBAAoB,EAAGsB,EAAe1b,KAAK2V,MAAM,GAC9EpJ,EAAiB,mBAAoB,EAAG6O,GAAY,GACpD,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKitB,KAAK3hB,OAAOtL,KAAK2V,KAAM+F,EAAeL,EAAS1U,aAAayU,IAC1DC,EAAS9U,SAQpBykD,EAAU9qD,UAAUsb,gBAAkB,SAAUqqC,EAAQruB,EAAapc,GAMjE,GALAvP,EAAiB,4BAA6B,EAAG,EAAGpE,UAAU3F,QAC9DgZ,GAAqB,4BAA6B9a,KAAK2V,MACvDmE,GAAwB,4BAA6B,EAAG+rC,EAAQ7lD,KAAK2V,MAAM,GAC3E8E,GAAiB,4BAA6B,EAAG+c,GAAa,GAC9DjrB,EAAiB,4BAA6B,EAAG6O,GAAY,GACvC,YAAlBpb,KAAKyqB,UAA4C,UAAlBzqB,KAAKyqB,SACpC,KAAM,qCACFzqB,KAAKyqB,SACL,0BACR,IAAIpP,EAAW,IAAIhV,EAEnB,OADArG,KAAKitB,KAAKzR,gBAAgBxb,KAAK2V,KAAMkwC,EAAQruB,EAAanc,EAAS1U,aAAayU,IACzEC,EAAS9U,SAMpBykD,EAAU9qD,UAAU6O,OAAS,SAAUqM,GAInC,OAHAvP,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU3F,QACrDgZ,GAAqB,mBAAoB9a,KAAK2V,MAC9CpJ,EAAiB,mBAAoB,EAAG6O,GAAY,GAC7Cpb,KAAKkO,IAAI,KAAMkN,IAQ1B4vC,EAAU9qD,UAAUorD,YAAc,SAAUC,EAAmBnwC,EAAYowC,GAQvE,GAPA3/C,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU3F,QAC1DgZ,GAAqB,wBAAyB9a,KAAK2V,MACnDpJ,EAAiB,wBAAyB,EAAGg/C,GAAmB,GAChEh/C,EAAiB,wBAAyB,EAAG6O,GAAY,GAvmY3C,SAAUtP,EAAQM,EAAgBq/C,EAAMp/C,GAC1D,KAAIA,QAAqBlG,IAATslD,IAEI,kBAATA,EACP,MAAM,IAAIlpD,MAAM4J,EAAYL,EAAQM,EAAgBC,GAAY,sBAsmYhEq/C,CAAgB,wBAAyB,EAAGF,GAAc,GACpC,YAAlBxrD,KAAKyqB,UAA4C,UAAlBzqB,KAAKyqB,SACpC,KAAM,iCACFzqB,KAAKyqB,SACL,+BACatkB,IAAjBqlD,IACAA,GAAe,GACnB,IAAInwC,EAAW,IAAIhV,EACO,mBAAf+U,GACPC,EAAS9U,QAAQM,MAAM,cAc3B,OADA7G,KAAKitB,KAAK0+B,iBAAiB3rD,KAAK2V,KAAM41C,EAXhB,SAAU9iB,EAAU3sB,EAAWC,GAC7C0sB,EACAptB,EAAS3U,OAAO+hC,GAGhBptB,EAAS5U,QAAQ,IAAIoV,GAAkBC,EAAWC,IAE5B,mBAAfX,GACPA,EAAWqtB,EAAU3sB,EAAWC,IAGkCyvC,GACnEnwC,EAAS9U,SAOpBykD,EAAU9qD,UAAU0rD,YAAc,SAAU/xC,EAAUuB,GAClDvP,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU3F,QAC1DgZ,GAAqB,wBAAyB9a,KAAK2V,MACnD8E,GAAiB,wBAAyB,EAAGZ,GAAU,GACvDtN,EAAiB,wBAAyB,EAAG6O,GAAY,GACzD,IAAIC,EAAW,IAAIhV,EAEnB,OADArG,KAAKitB,KAAKzR,gBAAgBxb,KAAK2V,KAAKjB,MAAM,aAAcmF,EAAU,KAAMwB,EAAS1U,aAAayU,IACvFC,EAAS9U,SAOpBykD,EAAU9qD,UAAU6B,KAAO,SAAUH,EAAOwZ,GACxCvP,EAAiB,iBAAkB,EAAG,EAAGpE,UAAU3F,QACnDgZ,GAAqB,iBAAkB9a,KAAK2V,MAC5CmE,GAAwB,iBAAkB,EAAGlY,EAAO5B,KAAK2V,MAAM,GAC/DpJ,EAAiB,iBAAkB,EAAG6O,GAAY,GAClD,IASI7U,EATA8G,EAAMrN,KAAKitB,KAAK+3B,aAChBr9C,EAAOsU,GAAW5O,GAMlBw+C,EAAmB7rD,KAAK0U,MAAM/M,GAC9BmkD,EAAU9rD,KAAK0U,MAAM/M,GAazB,OAVIpB,EADS,MAAT3E,EACUiqD,EAAiB39C,IAAItM,EAAOwZ,GAAYyuB,KAAK,WAAc,OAAOiiB,IAGlEtlD,QAAQC,QAAQqlD,GAE9BD,EAAiBhiB,KAAOtjC,EAAQsjC,KAAKx5B,KAAK9J,GAC1CslD,EAAiBhlD,MAAQN,EAAQsjC,KAAKx5B,KAAK9J,OAASJ,GAC1B,mBAAfiV,GACP7U,EAAQM,MAAM,cAEXglD,GAKXb,EAAU9qD,UAAU8vC,aAAe,WAE/B,OADAl1B,GAAqB,yBAA0B9a,KAAK2V,MAC7C,IAAIsF,GAAajb,KAAKitB,KAAMjtB,KAAK2V,OAE5CrW,OAAOsI,eAAeojD,EAAU9qD,UAAW,YACvC2H,IAAK,WACD,OAAO7H,KAAKorD,gBAEhBh9C,YAAY,EACZC,cAAc,IAElB/O,OAAOsI,eAAeojD,EAAU9qD,UAAW,OACvC2H,IAAK,WACD,OAAO7H,KAAKyqB,UAEhBrc,YAAY,EACZC,cAAc,IAElB/O,OAAOsI,eAAeojD,EAAU9qD,UAAW,UACvC2H,IAAK,WACD,OAAO7H,KAAKgrB,aAEhB5c,YAAY,EACZC,cAAc,IAElB/O,OAAOsI,eAAeojD,EAAU9qD,UAAW,QACvC2H,IAAK,WACD,OAAO7H,KAAKmrD,WAEhB/8C,YAAY,EACZC,cAAc,IAEX28C,GACTh+B,IAOFA,GAAM5D,uBAAyB4hC,GAC/BrrB,GAAUvW,uBAAyB4hC,GAoBnC,IA+NIe,GA/NAC,GAA0B,WAQ1B,OAPA,WAGIhsD,KAAK2yB,YACL3yB,KAAKisD,WAAa,EAClBjsD,KAAK4B,MAAQ,SASjBsqD,GAAsB,WAOtB,SAASA,EAAKC,EAAOC,EAASpiC,QACZ,IAAVmiC,IAAoBA,EAAQ,SAChB,IAAZC,IAAsBA,EAAU,WACtB,IAAVpiC,IAAoBA,EAAQ,IAAIgiC,IACpChsD,KAAKmsD,MAAQA,EACbnsD,KAAKosD,QAAUA,EACfpsD,KAAKgqB,MAAQA,EA0KjB,OAlKAkiC,EAAKhsD,UAAUmsD,QAAU,SAAUC,GAI/B,IAFA,IACkBtrD,EADd2U,EAAO22C,aAAmB54C,GAAO44C,EAAU,IAAI54C,GAAK44C,GACpD53C,EAAQ1U,KACwB,QAA5BgB,EAAO2U,EAAK3B,aAAsB,CAEtCU,EAAQ,IAAIw3C,EAAKlrD,EAAM0T,EADPlL,EAAQkL,EAAMsV,MAAM2I,SAAU3xB,IAAS,IAAIgrD,IAE3Dr2C,EAAOA,EAAKzB,WAEhB,OAAOQ,GAOXw3C,EAAKhsD,UAAUqf,SAAW,WACtB,OAAOvf,KAAKgqB,MAAMpoB,OAOtBsqD,EAAKhsD,UAAUqsD,SAAW,SAAU3qD,GAChCO,OAAwB,IAAVP,EAAuB,iCACrC5B,KAAKgqB,MAAMpoB,MAAQA,EACnB5B,KAAKwsD,kBAKTN,EAAKhsD,UAAUywB,MAAQ,WACnB3wB,KAAKgqB,MAAMpoB,MAAQ,KACnB5B,KAAKgqB,MAAM2I,YACX3yB,KAAKgqB,MAAMiiC,WAAa,EACxBjsD,KAAKwsD,kBAKTN,EAAKhsD,UAAUsqB,YAAc,WACzB,OAAOxqB,KAAKgqB,MAAMiiC,WAAa,GAKnCC,EAAKhsD,UAAU2J,QAAU,WACrB,OAA2B,OAApB7J,KAAKuf,aAAwBvf,KAAKwqB,eAO7C0hC,EAAKhsD,UAAUgf,aAAe,SAAUE,GACpC,IAAI9Y,EAAQtG,KACZyJ,EAAQzJ,KAAKgqB,MAAM2I,SAAU,SAAUje,EAAOmQ,GAC1CzF,EAAO,IAAI8sC,EAAKx3C,EAAOpO,EAAOue,OAYtCqnC,EAAKhsD,UAAUusD,kBAAoB,SAAUrtC,EAAQstC,EAAaC,GAC1DD,IAAgBC,GAChBvtC,EAAOpf,MACXA,KAAKkf,aAAa,SAAUxK,GACxBA,EAAM+3C,kBAAkBrtC,GAAyB,EAAMutC,KAEvDD,GAAeC,GACfvtC,EAAOpf,OAUfksD,EAAKhsD,UAAU0sD,gBAAkB,SAAUxtC,EAAQstC,GAE/C,IADA,IAAIpwC,EAAOowC,EAAc1sD,KAAOA,KAAKwU,SACrB,OAAT8H,GAAe,CAClB,GAAI8C,EAAO9C,GACP,OAAO,EAEXA,EAAOA,EAAK9H,SAEhB,OAAO,GASX03C,EAAKhsD,UAAU2sD,oCAAsC,SAAUztC,GAC3Dpf,KAAKkf,aAAa,SAAUxK,GACC,OAArBA,EAAM6K,WACNH,EAAO1K,GAEPA,EAAMm4C,oCAAoCztC,MAMtD8sC,EAAKhsD,UAAUyV,KAAO,WAClB,OAAO,IAAIjC,GAAsB,OAAjB1T,KAAKosD,QACfpsD,KAAKmsD,MACLnsD,KAAKosD,QAAQz2C,OAAS,IAAM3V,KAAKmsD,QAK3CD,EAAKhsD,UAAUyH,KAAO,WAClB,OAAO3H,KAAKmsD,OAKhBD,EAAKhsD,UAAUsU,OAAS,WACpB,OAAOxU,KAAKosD,SAOhBF,EAAKhsD,UAAUssD,eAAiB,WACP,OAAjBxsD,KAAKosD,SACLpsD,KAAKosD,QAAQU,aAAa9sD,KAAKmsD,MAAOnsD,OAS9CksD,EAAKhsD,UAAU4sD,aAAe,SAAUtuC,EAAW9J,GAC/C,IAAIq4C,EAAar4C,EAAM7K,UACnBmjD,EAAc1jD,EAAStJ,KAAKgqB,MAAM2I,SAAUnU,GAC5CuuC,GAAcC,UACPhtD,KAAKgqB,MAAM2I,SAASnU,GAC3Bxe,KAAKgqB,MAAMiiC,aACXjsD,KAAKwsD,kBAECO,GAAeC,IACrBhtD,KAAKgqB,MAAM2I,SAASnU,GAAa9J,EAAMsV,MACvChqB,KAAKgqB,MAAMiiC,aACXjsD,KAAKwsD,mBAGNN,MA0BX,SAAWH,GAIPA,EAAkBA,EAAuB,IAAI,GAAK,MAGlDA,EAAkBA,EAAwB,KAAI,GAAK,OAGnDA,EAAkBA,EAA6B,UAAI,GAAK,YAGxDA,EAAkBA,EAAoC,iBAAI,GAAK,mBAE/DA,EAAkBA,EAA+B,YAAI,GAAK,cAf9D,CAgBGA,KAAsBA,QAQzBhI,GAAKkJ,yBAA2B,GAKhClJ,GAAK7jD,UAAUwkD,mBAAqB,WAOhC1kD,KAAKktD,sBAAwB,IAAIhB,IAUrCnI,GAAK7jD,UAAUyrD,iBAAmB,SAAUh2C,EAAM41C,EAAmBnwC,EAAYowC,GAC7ExrD,KAAK2vC,KAAK,kBAAoBh6B,GAE9B,IAAIw3C,EAAgB,aAChBC,EAAW,IAAIpC,GAAUhrD,KAAM2V,GACnCy3C,EAASj/B,GAAG,QAASg/B,GACrB,IAII7B,GACA31C,KAAMA,EACNrK,OAAQigD,EACRnwC,WAAYA,EAEZotB,OAAQ,KAER6kB,MAAO59C,IAEP+7C,aAAcA,EAEd8B,WAAY,EAEZC,UAjBY,WACZH,EAASv+B,IAAI,QAASs+B,IAkBtBK,YAAa,KACbC,eAAgB,KAChBC,qBAAsB,KACtBC,yBAA0B,KAC1BC,8BAA+B,MAG/BC,EAAe7tD,KAAK8tD,gBAAgBn4C,GACxC21C,EAAYoC,qBAAuBG,EACnC,IAAIhI,EAASyF,EAAYhgD,OAAOuiD,EAAa1/C,OAC7C,QAAehI,IAAX0/C,GAKA,GAHAyF,EAAYiC,YACZjC,EAAYqC,yBAA2B,KACvCrC,EAAYsC,8BAAgC,KACxCtC,EAAYlwC,WAAY,CAExB,IAAIW,EAAW,IAAIgO,GAAauhC,EAAYoC,qBAAsB,IAAI1C,GAAUhrD,KAAMsrD,EAAY31C,MAAO2K,IACzGgrC,EAAYlwC,WAAW,MAAM,EAAOW,QAGvC,CACDhC,GAAqB,qCAAsC8rC,EAAQyF,EAAY31C,MAE/E21C,EAAY9iB,OAASujB,GAAkBgC,IACvC,IAAIC,EAAYhuD,KAAKktD,sBAAsBb,QAAQ12C,GAC/Cs4C,EAAYD,EAAUzuC,eAC1B0uC,EAAUlsD,KAAKupD,GACf0C,EAAUzB,SAAS0B,GAInB,IAAIC,OAAkB,EACtB,GAAsB,iBAAXrI,GACI,OAAXA,GACAv8C,EAASu8C,EAAQ,aACjBqI,EAAkB1kD,EAAQq8C,EAAQ,aAClC1jD,EAAOyX,GAAgBs0C,GAAkB,yHAMzCA,GAFkBluD,KAAK+kD,gBAAgB5pB,uBAAuBxlB,IAC1D8Q,GAAatI,YACaJ,cAAc5P,MAEhD+/C,EAAoDA,EACpD,IAAI38B,EAAevxB,KAAKklD,uBACpBY,EAAoBr9B,GAAeo9B,EAAQqI,GAC3CrxC,EAAU2U,GAA6Bs0B,EAAmBv0B,GAC9D+5B,EAAYqC,yBAA2B7H,EACvCwF,EAAYsC,8BAAgC/wC,EAC5CyuC,EAAYmC,eAAiBztD,KAAK4lD,kBAClC,IAAIroB,EAASv9B,KAAK+kD,gBAAgBlgB,mBAAmBlvB,EAAMkH,EAASyuC,EAAYmC,eAAgBnC,EAAYE,cAC5GxrD,KAAKmkD,YAAYxX,0BAA0Bh3B,EAAM4nB,GACjDv9B,KAAKmuD,2BASbpK,GAAK7jD,UAAU4tD,gBAAkB,SAAUn4C,EAAMy4C,GAC7C,OAAQpuD,KAAK+kD,gBAAgB5pB,uBAAuBxlB,EAAMy4C,IACtD3nC,GAAatI,YAYrB4lC,GAAK7jD,UAAUiuD,uBAAyB,SAAU7xC,GAC9C,IAAIhW,EAAQtG,KAMZ,QALa,IAATsc,IAAmBA,EAAOtc,KAAKktD,uBAE9B5wC,GACDtc,KAAKquD,qCAAqC/xC,GAEtB,OAApBA,EAAKiD,WAAqB,CAC1B,IAAI+uC,EAAQtuD,KAAKuuD,uBAAuBjyC,GACxCna,EAAOmsD,EAAMxsD,OAAS,EAAG,yCACZwsD,EAAMxhC,MAAM,SAAUw+B,GAAe,OAAOA,EAAY9iB,SAAWujB,GAAkBgC,OAG9F/tD,KAAKwuD,sBAAsBlyC,EAAK3G,OAAQ24C,QAGvChyC,EAAKkO,eACVlO,EAAK4C,aAAa,SAAUN,GACxBtY,EAAM6nD,uBAAuBvvC,MAWzCmlC,GAAK7jD,UAAUsuD,sBAAwB,SAAU74C,EAAM24C,GASnD,IARA,IAAIhoD,EAAQtG,KAERyuD,EAAeH,EAAMtkD,IAAI,SAAU0kD,GACnC,OAAOA,EAAIjB,iBAEXkB,EAAc3uD,KAAK8tD,gBAAgBn4C,EAAM84C,GACzCG,EAAaD,EACbE,EAAaF,EAAYlvC,OACpB9c,EAAI,EAAGA,EAAI2rD,EAAMxsD,OAAQa,IAAK,CACnC,IAAI+rD,EAAMJ,EAAM3rD,GAChBR,EAAOusD,EAAIlmB,SAAWujB,GAAkBgC,IAAK,iEAC7CW,EAAIlmB,OAASujB,GAAkB+C,KAC/BJ,EAAIpB,aACJ,IAAIz4C,EAAenB,GAAKmB,aAAac,EAAM+4C,EAAI/4C,MAE/Ci5C,EAAaA,EAAW7vC,YAAYlK,EAAkC65C,EAAIf,0BAE9E,IAAIoB,EAAaH,EAAWzgD,KAAI,GAC5B6gD,EAAar5C,EAEjB3V,KAAKwrC,QAAQyR,IAAI+R,EAAWvmD,WAAYsmD,EAAY,SAAUvmB,GAC1DliC,EAAMqpC,KAAK,4BACPh6B,KAAMq5C,EAAWvmD,WACjB+/B,OAAQA,IAEZ,IAAIjL,KACJ,GAAe,OAAXiL,EAAiB,CAIjB,IADA,IAAIha,KACK7rB,EAAI,EAAGA,EAAI2rD,EAAMxsD,OAAQa,IAAK,CAGnC,GAFA2rD,EAAM3rD,GAAG6lC,OAASujB,GAAkBkD,UACpC1xB,EAASA,EAAO7vB,OAAOpH,EAAMy+C,gBAAgB7qB,aAAao0B,EAAM3rD,GAAG8qD,iBAC/Da,EAAM3rD,GAAGyY,WAAY,CAErB,IAAIkB,EAAOgyC,EAAM3rD,GAAGirD,8BAChB7iC,EAAM,IAAIigC,GAAU1kD,EAAOgoD,EAAM3rD,GAAGgT,MACpCoG,EAAW,IAAIgO,GAAazN,EAAMyO,EAAKzK,IAC3CkO,EAAUzsB,KAAKusD,EAAM3rD,GAAGyY,WAAW/K,KAAK,KAAM,MAAM,EAAM0L,IAE9DuyC,EAAM3rD,GAAG4qD,YAGbjnD,EAAM+nD,qCAAqC/nD,EAAM4mD,sBAAsBb,QAAQ12C,IAE/ErP,EAAM6nD,yBACN7nD,EAAM69C,YAAYxX,0BAA0Bh3B,EAAM4nB,GAElD,IAAS56B,EAAI,EAAGA,EAAI6rB,EAAU1sB,OAAQa,IAClCwQ,GAAeqb,EAAU7rB,QAG5B,CAED,GAAe,cAAX6lC,EACA,IAAS7lC,EAAI,EAAGA,EAAI2rD,EAAMxsD,OAAQa,IAC1B2rD,EAAM3rD,GAAG6lC,SAAWujB,GAAkBmD,iBACtCZ,EAAM3rD,GAAG6lC,OAASujB,GAAkBoD,YAEpCb,EAAM3rD,GAAG6lC,OAASujB,GAAkBgC,QAG3C,CACDlgD,GAAK,kBAAoBmhD,EAAWvmD,WAAa,YAAc+/B,GAC/D,IAAS7lC,EAAI,EAAGA,EAAI2rD,EAAMxsD,OAAQa,IAC9B2rD,EAAM3rD,GAAG6lC,OAASujB,GAAkBoD,YACpCb,EAAM3rD,GAAG6qD,YAAchlB,EAG/BliC,EAAMk/C,mBAAmB7vC,KAE9Bk5C,IAcP9K,GAAK7jD,UAAUslD,mBAAqB,SAAU5Y,GAC1C,IAAIwiB,EAA0BpvD,KAAKqvD,4BAA4BziB,GAC3Dj3B,EAAOy5C,EAAwBz5C,OAC/B24C,EAAQtuD,KAAKuuD,uBAAuBa,GAExC,OADApvD,KAAKsvD,uBAAuBhB,EAAO34C,GAC5BA,GASXouC,GAAK7jD,UAAUovD,uBAAyB,SAAUhB,EAAO34C,GACrD,GAAqB,IAAjB24C,EAAMxsD,OAAV,CAcA,IATA,IAiEmByrD,EAjEf/+B,KACA+O,KAKAkxB,EAHcH,EAAM1wB,OAAO,SAAUilB,GACrC,OAAOA,EAAEra,SAAWujB,GAAkBgC,MAEX/jD,IAAI,SAAU64C,GACzC,OAAOA,EAAE4K,iBAEJ9qD,EAAI,EAAGA,EAAI2rD,EAAMxsD,OAAQa,IAAK,CACnC,IAAI2oD,EAAcgD,EAAM3rD,GACpBkS,EAAenB,GAAKmB,aAAac,EAAM21C,EAAY31C,MACnD45C,GAAmB,EAAO/B,OAAc,EAE5C,GADArrD,EAAwB,OAAjB0S,EAAuB,iEAC1By2C,EAAY9iB,SAAWujB,GAAkBoD,YACzCI,GAAmB,EACnB/B,EAAclC,EAAYkC,YAC1BjwB,EAASA,EAAO7vB,OAAO1N,KAAK+kD,gBAAgB7qB,aAAaoxB,EAAYmC,gBAAgB,SAEpF,GAAInC,EAAY9iB,SAAWujB,GAAkBgC,IAC9C,GAAIzC,EAAYgC,YAAcvJ,GAAKkJ,yBAC/BsC,GAAmB,EACnB/B,EAAc,WACdjwB,EAASA,EAAO7vB,OAAO1N,KAAK+kD,gBAAgB7qB,aAAaoxB,EAAYmC,gBAAgB,QAEpF,CAED,IAAI+B,EAAcxvD,KAAK8tD,gBAAgBxC,EAAY31C,KAAM84C,GACzDnD,EAAYoC,qBAAuB8B,EACnC,IAAI1qB,EAAUwpB,EAAM3rD,GAAG2I,OAAOkkD,EAAYrhD,OAC1C,QAAgBhI,IAAZ2+B,EAAuB,CACvB/qB,GAAqB,qCAAsC+qB,EAASwmB,EAAY31C,MAChF,IAAI85C,EAAchnC,GAAeqc,GACY,iBAAZA,GAClB,MAAXA,GACAx7B,EAASw7B,EAAS,eAGlB2qB,EAAcA,EAAYpxC,eAAemxC,EAAYzxC,gBAEzD,IAAI2xC,EAAapE,EAAYmC,eACzBl8B,EAAevxB,KAAKklD,uBACpByK,EAAkBn+B,GAA6Bi+B,EAAal+B,GAChE+5B,EAAYqC,yBAA2B8B,EACvCnE,EAAYsC,8BAAgC+B,EAC5CrE,EAAYmC,eAAiBztD,KAAK4lD,kBAElC6I,EAAahsB,OAAOgsB,EAAa53C,QAAQ64C,GAAa,GAEtDnyB,GADAA,EAASA,EAAO7vB,OAAO1N,KAAK+kD,gBAAgBlgB,mBAAmBymB,EAAY31C,KAAMg6C,EAAiBrE,EAAYmC,eAAgBnC,EAAYE,gBAC1H99C,OAAO1N,KAAK+kD,gBAAgB7qB,aAAaw1B,GAAY,SAGrEH,GAAmB,EACnB/B,EAAc,SACdjwB,EAASA,EAAO7vB,OAAO1N,KAAK+kD,gBAAgB7qB,aAAaoxB,EAAYmC,gBAAgB,IAMjG,GAFAztD,KAAKmkD,YAAYxX,0BAA0Bh3B,EAAM4nB,GACjDA,KACIgyB,IAEAjB,EAAM3rD,GAAG6lC,OAASujB,GAAkBkD,UAGzB1B,EAERe,EAAM3rD,GAAG4qD,UADRn6C,WAAWm6C,EAAWp7C,KAAKI,MAAM,IAEjC+7C,EAAM3rD,GAAGyY,YACT,GAAoB,WAAhBoyC,EAA0B,CAC1B,IAAIziC,EAAM,IAAIigC,GAAUhrD,KAAMsuD,EAAM3rD,GAAGgT,MAEnCi6C,EAAiCtB,EAAM3rD,GAAG+qD,qBAC1C3xC,EAAW,IAAIgO,GAAa6lC,EAAW7kC,EAAKzK,IAChDkO,EAAUzsB,KAAKusD,EAAM3rD,GAAGyY,WAAW/K,KAAK,KAAM,MAAM,EAAO0L,SAG3DyS,EAAUzsB,KAAKusD,EAAM3rD,GAAGyY,WAAW/K,KAAK,KAAM,IAAI9N,MAAMirD,IAAc,EAAO,OAM7FxtD,KAAKquD,qCAAqCruD,KAAKktD,uBAE/C,IAASvqD,EAAI,EAAGA,EAAI6rB,EAAU1sB,OAAQa,IAClCwQ,GAAeqb,EAAU7rB,IAG7B3C,KAAKmuD,2BAUTpK,GAAK7jD,UAAUmvD,4BAA8B,SAAU15C,GAInD,IAHA,IAAIqJ,EAEA6wC,EAAkB7vD,KAAKktD,sBACU,QAA7BluC,EAAQrJ,EAAK3B,aACc,OAA/B67C,EAAgBtwC,YAChBswC,EAAkBA,EAAgBxD,QAAQrtC,GAC1CrJ,EAAOA,EAAKzB,WAEhB,OAAO27C,GASX9L,GAAK7jD,UAAUquD,uBAAyB,SAAUsB,GAE9C,IAAIC,KAMJ,OALA9vD,KAAK+vD,mCAAmCF,EAAiBC,GAEzDA,EAAiBv+C,KAAK,SAAUlG,EAAG1L,GAC/B,OAAO0L,EAAEgiD,MAAQ1tD,EAAE0tD,QAEhByC,GAOX/L,GAAK7jD,UAAU6vD,mCAAqC,SAAUzzC,EAAMgyC,GAChE,IAAIhoD,EAAQtG,KACRiuD,EAAY3xC,EAAKiD,WACrB,GAAkB,OAAd0uC,EACA,IAAK,IAAItrD,EAAI,EAAGA,EAAIsrD,EAAUnsD,OAAQa,IAClC2rD,EAAMvsD,KAAKksD,EAAUtrD,IAG7B2Z,EAAK4C,aAAa,SAAUxK,GACxBpO,EAAMypD,mCAAmCr7C,EAAO45C,MASxDvK,GAAK7jD,UAAUmuD,qCAAuC,SAAU/xC,GAC5D,IAAIhW,EAAQtG,KACRsuD,EAAQhyC,EAAKiD,WACjB,GAAI+uC,EAAO,CAEP,IADA,IAAI0B,EAAK,EACAC,EAAO,EAAGA,EAAO3B,EAAMxsD,OAAQmuD,IAChC3B,EAAM2B,GAAMznB,SAAWujB,GAAkBkD,YACzCX,EAAM0B,GAAM1B,EAAM2B,GAClBD,KAGR1B,EAAMxsD,OAASkuD,EACf1zC,EAAKiwC,SAAS+B,EAAMxsD,OAAS,EAAIwsD,EAAQ,MAE7ChyC,EAAK4C,aAAa,SAAUN,GACxBtY,EAAM+nD,qCAAqCzvC,MAWnDmlC,GAAK7jD,UAAUgmD,mBAAqB,SAAUvwC,GAC1C,IAAIrP,EAAQtG,KACRk3B,EAAel3B,KAAKqvD,4BAA4B15C,GAAMA,OACtDk6C,EAAkB7vD,KAAKktD,sBAAsBb,QAAQ12C,GAQzD,OAPAk6C,EAAgBjD,gBAAgB,SAAUtwC,GACtChW,EAAM4pD,yBAAyB5zC,KAEnCtc,KAAKkwD,yBAAyBL,GAC9BA,EAAgBpD,kBAAkB,SAAUnwC,GACxChW,EAAM4pD,yBAAyB5zC,KAE5B4a,GAQX6sB,GAAK7jD,UAAUgwD,yBAA2B,SAAU5zC,GAChD,IAAIgyC,EAAQhyC,EAAKiD,WACjB,GAAc,OAAV+uC,EAAgB,CAQhB,IALA,IAAI9/B,KAGA+O,KACA4yB,GAAY,EACPxtD,EAAI,EAAGA,EAAI2rD,EAAMxsD,OAAQa,IAC9B,GAAI2rD,EAAM3rD,GAAG6lC,SAAWujB,GAAkBmD,uBAGrC,GAAIZ,EAAM3rD,GAAG6lC,SAAWujB,GAAkB+C,KAC3C3sD,EAAOguD,IAAaxtD,EAAI,EAAG,mDAC3BwtD,EAAWxtD,EAEX2rD,EAAM3rD,GAAG6lC,OAASujB,GAAkBmD,iBACpCZ,EAAM3rD,GAAG6qD,YAAc,WAOvB,GAJArrD,EAAOmsD,EAAM3rD,GAAG6lC,SAAWujB,GAAkBgC,IAAK,0CAElDO,EAAM3rD,GAAG4qD,YACThwB,EAASA,EAAO7vB,OAAO1N,KAAK+kD,gBAAgB7qB,aAAao0B,EAAM3rD,GAAG8qD,gBAAgB,IAC9Ea,EAAM3rD,GAAGyY,WAAY,CAErBoT,EAAUzsB,KAAKusD,EAAM3rD,GAAGyY,WAAW/K,KAAK,KAAM,IAAI9N,MAAM,QAAQ,EADjD,QAKT,IAAd4tD,EAEA7zC,EAAKiwC,SAAS,MAId+B,EAAMxsD,OAASquD,EAAW,EAG9BnwD,KAAKmkD,YAAYxX,0BAA0BrwB,EAAK3G,OAAQ4nB,GACxD,IAAS56B,EAAI,EAAGA,EAAI6rB,EAAU1sB,OAAQa,IAClCwQ,GAAeqb,EAAU7rB,MAqBrC,IACIytD,GAIAC,GAA6B,WAC7B,SAASA,IAILrwD,KAAKswD,UAKLtwD,KAAKuwD,gBAAiB,EAyF1B,OAvFAF,EAAYriB,YAAc,WAItB,OAHKoiB,KACDA,GAAkB,IAAIC,GAEnBD,IAGXC,EAAYnwD,UAAUwiD,UAAY,WAC9B,IAAK,IAAI8N,KAAWxwD,KAAKswD,OACrB,IAAK,IAAIG,KAASzwD,KAAKswD,OAAOE,GAC1BxwD,KAAKswD,OAAOE,GAASC,GAAO/N,aAIxC2N,EAAYnwD,UAAUyiD,OAAS,WAC3B,IAAK,IAAI6N,KAAWxwD,KAAKswD,OACrB,IAAK,IAAIG,KAASzwD,KAAKswD,OAAOE,GAC1BxwD,KAAKswD,OAAOE,GAASC,GAAO9N,UAUxC0N,EAAYnwD,UAAUwwD,gBAAkB,SAAUzM,EAAK9O,GACnD,IAAIsb,EAAQtb,GAAO8O,EAAI/Z,QAA2B,iBACpC/jC,IAAVsqD,GACAjgD,GAAM,wHAIV,IAAI0H,EAAYF,GAAcy4C,GAC1Bj4C,EAAWN,EAAUM,SAOzB,OANAuC,GAAY,gCAAiC,EAAG7C,GAC3CA,EAAUvC,KAAK9L,WAChB2G,GAAM,4FAGCxQ,KAAK2wD,WAAWn4C,EAAUyrC,GACzBoH,UAOhBgF,EAAYnwD,UAAU0wD,WAAa,SAAU3jC,GACzC,IAAI4jC,EAAWrnD,EAAQxJ,KAAKswD,OAAQrjC,EAAKg3B,IAAIt8C,MAExCkpD,GAAYrnD,EAAQqnD,EAAU5jC,EAAKssB,UAAU7hC,iBAAmBuV,GACjEzc,GAAM,YAAcyc,EAAKg3B,IAAIt8C,KAAO,IAAMslB,EAAKssB,UAAY,+BAE/DtsB,EAAKy1B,mBACEmO,EAAS5jC,EAAKssB,UAAU7hC,gBAUnC24C,EAAYnwD,UAAUywD,WAAa,SAAUn4C,EAAUyrC,GACnD,IAAI4M,EAAWrnD,EAAQxJ,KAAKswD,OAAQrM,EAAIt8C,MACnCkpD,IACDA,KACA7wD,KAAKswD,OAAOrM,EAAIt8C,MAAQkpD,GAE5B,IAAI5jC,EAAOzjB,EAAQqnD,EAAUr4C,EAASd,eAMtC,OALIuV,GACAzc,GAAM,2HAEVyc,EAAO,IAAI82B,GAAKvrC,EAAUxY,KAAKuwD,eAAgBtM,GAC/C4M,EAASr4C,EAASd,eAAiBuV,EAC5BA,GAMXojC,EAAYnwD,UAAU8jD,gBAAkB,SAAUA,GAC9ChkD,KAAKuwD,eAAiBvM,GAEnBqM,KAsBPnJ,GAA0B,WAK1B,SAASA,EAAShsC,GACdlb,KAAKkb,MAAQA,EACPA,aAAiB6oC,IACnBvzC,GAAM,wEAGVxQ,KAAKkjB,MAAQ,IAAI8nC,GAAU9vC,EAAOxH,GAAKmf,OACvC7yB,KAAK8wD,SAAW,IAAIC,GAAkB/wD,MAmE1C,OAjEAV,OAAOsI,eAAes/C,EAAShnD,UAAW,OACtC2H,IAAK,WACD,OAAO7H,KAAKkb,MAAM+oC,KAEtB71C,YAAY,EACZC,cAAc,IAElB64C,EAAShnD,UAAU6qB,IAAM,SAAUpV,GAG/B,OAFA3V,KAAKgxD,cAAc,OACnBnlD,EAAiB,eAAgB,EAAG,EAAGpE,UAAU3F,QAC7C6T,aAAgBq1C,GACThrD,KAAKixD,WAAWt7C,EAAKlN,iBAEhBtC,IAATwP,EAAqB3V,KAAKkjB,MAAMxO,MAAMiB,GAAQ3V,KAAKkjB,OAS9DgkC,EAAShnD,UAAU+wD,WAAa,SAAU9b,GAEtC,IAAI+b,EAAU,sBACdlxD,KAAKgxD,cAAcE,GACnBrlD,EAAiBqlD,EAAS,EAAG,EAAGzpD,UAAU3F,QAC1C,IAAIqvD,EAAYn5C,GAAcm9B,GAC9Bp6B,GAAYm2C,EAAS,EAAGC,GACxB,IAAI34C,EAAW24C,EAAU34C,SAUzB,OATIA,EAASjC,OAASvW,KAAKkb,MAAMq+B,UAAUhjC,MACvC/F,GAAM0gD,EACF,2DAEA14C,EAASjC,KACT,iBACAvW,KAAKkb,MAAMq+B,UAAUhjC,KACrB,KAEDvW,KAAK+qB,IAAIomC,EAAUx7C,KAAKlN,aAKnCy+C,EAAShnD,UAAU8wD,cAAgB,SAAUE,GACtB,OAAflxD,KAAKkb,OACL1K,GAAM,eAAiB0gD,EAAU,4BAIzChK,EAAShnD,UAAUkxD,UAAY,WAC3BvlD,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU3F,QACvD9B,KAAKgxD,cAAc,aACnBhxD,KAAKkb,MAAMwnC,aAEfwE,EAAShnD,UAAUmxD,SAAW,WAC1BxlD,EAAiB,oBAAqB,EAAG,EAAGpE,UAAU3F,QACtD9B,KAAKgxD,cAAc,YACnBhxD,KAAKkb,MAAMynC,UAEfuE,EAASoK,aACLC,WACIC,MAAO,cAGRtK,KAEP6J,GAAmC,WAEnC,SAASA,EAAkB1F,GACvBrrD,KAAKqrD,SAAWA,EAgBpB,OAbA0F,EAAkB7wD,UAAUuxD,OAAS,WACjC,OH9udkBpxD,EG8udDL,KH9udU0xD,OG8udJ,EH9udmBC,EG8udH,WACnC,OAAOvxD,EAAYJ,KAAM,SAAUoZ,GAO/B,OANApZ,KAAKqrD,SAAS2F,cAAc,UAC5BX,GAAYriB,cAAc4iB,WAAW5wD,KAAKqrD,SAASnwC,OACnDlb,KAAKqrD,SAASnwC,MAAQ,KACtBlb,KAAKqrD,SAASnoC,MAAQ,KACtBljB,KAAKqrD,SAASyF,SAAW,KACzB9wD,KAAKqrD,SAAW,MACR,MHrvdb,KADoCuG,OG8udR,KH7udjBA,EAAIprD,UAAU,SAAUC,EAASC,GAC/C,SAASmrD,EAAUjwD,GAAS,IAAMK,EAAK0vD,EAAU3wD,KAAKY,IAAW,MAAOI,GAAK0E,EAAO1E,IACpF,SAAS8vD,EAASlwD,GAAS,IAAMK,EAAK0vD,EAAiB,MAAE/vD,IAAW,MAAOI,GAAK0E,EAAO1E,IACvF,SAASC,EAAKif,GAAUA,EAAOvf,KAAO8E,EAAQya,EAAOtf,OAAS,IAAIgwD,EAAE,SAAUnrD,GAAWA,EAAQya,EAAOtf,SAAWioC,KAAKgoB,EAAWC,GACnI7vD,GAAM0vD,EAAYA,EAAUnqD,MAAMnH,EAASqxD,QAAmB1wD,UAL/D,IAAmBX,EAASqxD,EAAYE,EAAGD,GG0vdvCZ,KAoDPD,GAAwBxxD,OAAOyyD,QACjCC,iBA5BqB,WACnB7b,GAAoBnE,gBACpB5C,GAAsB0C,cA2BxBmgB,gBAzBoB,WAClB7iB,GAAsB4C,iBAyBxB8G,sBAtB0B,WACxB,OAAO3C,GAAiC,eAsB1C+b,yBApB6B,SAAUnnC,EAAKnkB,GAC1CmkB,EAAIkC,KAAKq3B,sBAAsBhG,uBAAyB13C,GAoB1DilC,MAlBU,SAAU9gB,EAAK27B,GACvB37B,EAAIkC,KAAK4e,MAAM6a,IAkBjBK,sBAhB0B,SAAUh8B,EAAKi8B,GACvCj8B,EAAIkC,KAAK85B,sBAAsBC,IAgBjC9C,gBAdoB,SAAUn5B,GAC5B,OAAOA,EAAIkC,KAAKi3B,iBAclBiO,oBAZwB,SAAUpnC,EAAKnkB,GACrC,OAAOmkB,EAAIkC,KAAKw4B,qBAAqB7+C,MA6BrCwrD,GAAiB7U,GAKrBA,GAAqBr9C,UAAUmyD,aAAe,SAAUj+C,EAAYgH,GAChEpb,KAAKk7C,YAAY,KAAOt7C,EAAGwU,GAAcgH,IAM7CmiC,GAAqBr9C,UAAUoyD,KAAO,SAAUnqD,EAAMoqD,GAClDvyD,KAAKk7C,YAAY,QAAUx7C,EAAGyI,GAAQoqD,IAG1C,IAwEQ97C,GAxEJ+7C,GAAqBlZ,GAoBrBmZ,GAAmBn8C,GAwBnBo8C,GAA2BpzD,OAAOyyD,QACpCK,eAAgBA,GAChBI,mBAAoBA,GACpBG,WA1Ce,SAAUC,GACvB,IAAIC,EAAStV,GAAqBr9C,UAAU+8C,IAO5C,OANAM,GAAqBr9C,UAAU+8C,IAAM,SAAU7oC,EAAYjM,EAAM2qD,EAAgBC,QAC5D5sD,IAAb4sD,IACAA,EAAWH,KAEfC,EAAOnxD,KAAK1B,KAAMoU,EAAYjM,EAAM2qD,EAAgBC,IAEjD,WACHxV,GAAqBr9C,UAAU+8C,IAAM4V,IAkC3CJ,iBAAkBA,GAClBtiC,gBAxBoB,SAAUxE,GAC5B,OAAOA,EAAMwE,mBAwBf6iC,QAlBY,SAAUC,GACpB,OAAOA,EAAYhmC,KAAKq3B,sBAAsBvG,UAkBhDiG,gBAXoB,SAAUA,GAC5BqM,GAAYriB,cAAcgW,gBAAgBA,MA4B1CsN,GAAcpK,GAASoK,YAGnB76C,GAeSkgC,EAfYma,SAASoC,gBAAgB,WAAY,SAAUjP,EAAKkP,EAAQhe,GAAO,OAAOkb,GAAYriB,cAAc0iB,gBAAgBzM,EAAK9O,KAG9I6V,UAAWA,GACXh+B,MAAOA,GACPk6B,SAAUA,GACVh3C,cAAeA,GACf4gD,SAAUA,GACVQ,YAAaA,GACboB,YAAaA,IACd,MAAM,GACLxrD,MACAksD,OAAOC,QAAU58C"}