{"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 and non-empty\r\n * signature.\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 (!!decoded.signature &&\r\n        !!claims &&\r\n        typeof claims === 'object' &&\r\n        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.startsWith('?')) {\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 queryStringParamaters = query\r\n            .getQueryParams()\r\n            .toRestQueryStringParameters();\r\n        this.restRequest_(pathString + '.json', queryStringParamaters, 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                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","NODE_CLIENT","NODE_ADMIN","SDK_VERSION","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","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","id","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","__EMPTY_NODE","MAX_NODE","parseRepoInfo","dataURL","parsedUrl","parseURL","subdomain","location","protocol","scheme","repoInfo","port","colonInd","slashInd","questionMarkInd","pathStringDecoded","piece","decodeURIComponent","decodePath","queryParams","queryString","results","startsWith","_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","PUSH_CHARS","lastPushTime","lastRandChars","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","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","decoded","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","queryStringParamaters","toRestQueryStringParameters","restRequest_","queryStringParameters","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":"6EAgBA,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,GAIAC,aAAa,EAIbC,YAAY,EAIZC,YAAa,qBAuBbC,EAAS,SAAUC,EAAWC,GAC9B,IAAKD,EACD,MAAME,EAAeD,IAQzBC,EAAiB,SAAUD,GAC3B,OAAO,IAAIE,MAAM,sBACbR,EAAUG,YACV,6BACAG,IAkBJG,EAAoB,SAAUC,GAG9B,IADA,IAAIC,KAAUjD,EAAI,EACTkD,EAAI,EAAGA,EAAIF,EAAId,OAAQgB,IAAK,CACjC,IAAIC,EAAIH,EAAII,WAAWF,GACnBC,EAAI,IACJF,EAAIjD,KAAOmD,EAENA,EAAI,MACTF,EAAIjD,KAAQmD,GAAK,EAAK,IACtBF,EAAIjD,KAAY,GAAJmD,EAAU,KAED,QAAX,MAAJA,IACND,EAAI,EAAIF,EAAId,QACwB,QAAX,MAAxBc,EAAII,WAAWF,EAAI,KAEpBC,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBH,EAAII,aAAaF,IACvDD,EAAIjD,KAAQmD,GAAK,GAAM,IACvBF,EAAIjD,KAASmD,GAAK,GAAM,GAAM,IAC9BF,EAAIjD,KAASmD,GAAK,EAAK,GAAM,IAC7BF,EAAIjD,KAAY,GAAJmD,EAAU,MAGtBF,EAAIjD,KAAQmD,GAAK,GAAM,IACvBF,EAAIjD,KAASmD,GAAK,EAAK,GAAM,IAC7BF,EAAIjD,KAAY,GAAJmD,EAAU,KAG9B,OAAOF,GAuCPI,GAMAC,eAAgB,KAMhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBAAmB,iEAKnBC,mBACI,OAAOvD,KAAKsD,kBAAoB,OAMpCE,2BACI,OAAOxD,KAAKsD,kBAAoB,OAUpCG,mBAAoC,mBAATC,KAU3BC,gBAAiB,SAAUC,EAAOC,GAC9B,IAAKpE,MAAMqE,QAAQF,GACf,MAAMlB,MAAM,iDAEhB1C,KAAK+D,QAKL,IAJA,IAAIC,EAAgBH,EACd7D,KAAKoD,sBACLpD,KAAKkD,eACPe,KACKnB,EAAI,EAAGA,EAAIc,EAAM9B,OAAQgB,GAAK,EAAG,CACtC,IAAIoB,EAAQN,EAAMd,GACdqB,EAAYrB,EAAI,EAAIc,EAAM9B,OAC1BsC,EAAQD,EAAYP,EAAMd,EAAI,GAAK,EACnCuB,EAAYvB,EAAI,EAAIc,EAAM9B,OAC1BwC,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,EAAOlC,KAAKiC,EAAcO,GAAWP,EAAcQ,GAAWR,EAAcS,GAAWT,EAAcU,IAEzG,OAAOT,EAAOU,KAAK,KAUvBC,aAAc,SAAUhB,EAAOC,GAG3B,OAAI7D,KAAKyD,qBAAuBI,EACrBgB,KAAKjB,GAET5D,KAAK2D,gBAAgBhB,EAAkBiB,GAAQC,IAU1DiB,aAAc,SAAUlB,EAAOC,GAG3B,OAAI7D,KAAKyD,qBAAuBI,EACrBH,KAAKE,GAvJA,SAAUmB,GAG9B,IADA,IAAIlC,KAAUmC,EAAM,EAAGjC,EAAI,EACpBiC,EAAMD,EAAMjD,QAAQ,CACvB,IAAImD,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,CAAkBvF,KAAKwF,wBAAwB5B,EAAOC,KAiBjE2B,wBAAyB,SAAU5B,EAAOC,GACtC7D,KAAK+D,QAKL,IAJA,IAAI0B,EAAgB5B,EACd7D,KAAKqD,sBACLrD,KAAKmD,eACPc,KACKnB,EAAI,EAAGA,EAAIc,EAAM9B,QAAS,CAC/B,IAAIoC,EAAQuB,EAAc7B,EAAM8B,OAAO5C,MAEnCsB,EADYtB,EAAIc,EAAM9B,OACF2D,EAAc7B,EAAM8B,OAAO5C,IAAM,EAGrDwB,IAFFxB,EACkBc,EAAM9B,OACF2D,EAAc7B,EAAM8B,OAAO5C,IAAM,GAGrD6C,IAFF7C,EACkBc,EAAM9B,OACF2D,EAAc7B,EAAM8B,OAAO5C,IAAM,GAEzD,KADEA,EACW,MAAToB,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATqB,EACnD,MAAMjD,QAEV,IAAI6B,EAAYL,GAAS,EAAME,GAAS,EAExC,GADAH,EAAOlC,KAAKwC,GACC,IAATD,EAAa,CACb,IAAIE,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAEjD,GADAL,EAAOlC,KAAKyC,GACC,IAATmB,EAAa,CACb,IAAIlB,EAAaH,GAAS,EAAK,IAAQqB,EACvC1B,EAAOlC,KAAK0C,KAIxB,OAAOR,GAOXF,MAAO,WACH,IAAK/D,KAAKkD,eAAgB,CACtBlD,KAAKkD,kBACLlD,KAAKmD,kBACLnD,KAAKoD,yBACLpD,KAAKqD,yBAEL,IAAK,IAAIP,EAAI,EAAGA,EAAI9C,KAAKuD,aAAazB,OAAQgB,IAC1C9C,KAAKkD,eAAeJ,GAAK9C,KAAKuD,aAAamC,OAAO5C,GAClD9C,KAAKmD,eAAenD,KAAKkD,eAAeJ,IAAMA,EAC9C9C,KAAKoD,sBAAsBN,GAAK9C,KAAKwD,qBAAqBkC,OAAO5C,GACjE9C,KAAKqD,sBAAsBrD,KAAKoD,sBAAsBN,IAAMA,EAExDA,GAAK9C,KAAKsD,kBAAkBxB,SAC5B9B,KAAKmD,eAAenD,KAAKwD,qBAAqBkC,OAAO5C,IAAMA,EAC3D9C,KAAKqD,sBAAsBrD,KAAKuD,aAAamC,OAAO5C,IAAMA,MAwB1E8C,EAAe,SAAUhD,GACzB,IACI,OAAOK,EAAO6B,aAAalC,GAAK,GAEpC,MAAOZ,GACH6D,QAAQC,MAAM,wBAAyB9D,GAE3C,OAAO,MAqBX,SAAS+D,EAASnE,GACd,OAcJ,SAASoE,EAAWC,EAAQC,GACxB,KAAMA,aAAkB5G,QACpB,OAAO4G,EAEX,OAAQA,EAAOjG,aACX,KAAKkG,KAGD,IAAIC,EAAYF,EAChB,OAAO,IAAIC,KAAKC,EAAUC,WAC9B,KAAK/G,YACcgH,IAAXL,IACAA,MAEJ,MACJ,KAAKxG,MAEDwG,KACA,MACJ,QAEI,OAAOC,EAEf,IAAK,IAAIK,KAAQL,EACRA,EAAOrG,eAAe0G,KAG3BN,EAAOM,GAAQP,EAAWC,EAAOM,GAAOL,EAAOK,KAEnD,OAAON,EA3CAD,MAAWM,EAAW1E,GAiEjC,IAAI4E,EAA0B,WAC1B,SAASA,IACL,IAAIC,EAAQzG,KACZA,KAAK0G,QAAU,IAAIC,QAAQ,SAAUC,EAASC,GAC1CJ,EAAMG,QAAUA,EAChBH,EAAMI,OAASA,IAkCvB,OAxBAL,EAAStG,UAAU4G,aAAe,SAAUC,GACxC,IAAIN,EAAQzG,KACZ,OAAO,SAAU8F,EAAOlE,GAChBkE,EACAW,EAAMI,OAAOf,GAGbW,EAAMG,QAAQhF,GAEM,mBAAbmF,IAGPN,EAAMC,QAAQM,MAAM,cAGI,IAApBD,EAASjF,OACTiF,EAASjB,GAGTiB,EAASjB,EAAOlE,MAKzB4E,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,IAA1BnF,EAAUC,cAAiD,IAAzBD,EAAUE,YAGnDkF,EAAa,gBACbC,EAAoB7E,MACnB6E,kBAODC,EAA+B,WA0B/B,OAzBA,SAAuBC,EAAMjF,GAIzB,GAHAxC,KAAKyH,KAAOA,EACZzH,KAAKwC,QAAUA,EAEX+E,EAEAA,EAAkBvH,KAAM0H,EAAaxH,UAAUC,aAG/C,IAGI,MAAMuC,MAAMiF,MAAM3H,KAAM4H,WAE5B,MAAOC,GACH7H,KAAK8H,KAAOR,EAEZhI,OAAOyI,eAAe/H,KAAM,SACxBgI,IAAK,WACD,OAAOH,EAAII,cASnCT,EAActH,UAAYZ,OAAOa,OAAOuC,MAAMxC,WAC9CsH,EAActH,UAAUD,YAAcuH,EACtCA,EAActH,UAAU4H,KAAOR,EAC/B,IAAII,EAA8B,WAC9B,SAASA,EAAaQ,EAASC,EAAaC,GACxCpI,KAAKkI,QAAUA,EACflI,KAAKmI,YAAcA,EACnBnI,KAAKoI,OAASA,EAEdpI,KAAKqI,QAAU,gBAgCnB,OA7BAX,EAAaxH,UAAUC,OAAS,SAAUsH,EAAMa,QAC/BhC,IAATgC,IACAA,MAEJ,IAEI9F,EAFA+F,EAAWvI,KAAKoI,OAAOX,GACvBe,EAAWxI,KAAKkI,QAAU,IAAMT,EAGhCjF,OADa8D,IAAbiC,EACU,QAGAA,EAASE,QAAQzI,KAAKqI,QAAS,SAAUK,EAAOC,GACtD,IAAI/G,EAAQ0G,EAAKK,GACjB,YAAiBrC,IAAV1E,EAAsBA,EAAMgH,WAAa,IAAMD,EAAM,OAIpEnG,EAAUxC,KAAKmI,YAAc,KAAO3F,EAAU,KAAOgG,EAAW,KAChE,IAAIX,EAAM,IAAIL,EAAcgB,EAAUhG,GAGtC,IAAK,IAAI+D,KAAQ+B,EACRA,EAAKzI,eAAe0G,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,MAAOrH,IACP,OACIoH,OAAQA,EACRC,OAAQA,EACRf,KAAMA,EACNgB,UAAWA,IAmGfG,EAAW,SAAUC,EAAKf,GAC1B,OAAOrJ,OAAOY,UAAUL,eAAe6B,KAAKgI,EAAKf,IAEjDgB,EAAU,SAAUD,EAAKf,GACzB,GAAIrJ,OAAOY,UAAUL,eAAe6B,KAAKgI,EAAKf,GAC1C,OAAOe,EAAIf,IAUfiB,EAAU,SAAUF,EAAKG,GACzB,IAAK,IAAIlB,KAAOe,EACRpK,OAAOY,UAAUL,eAAe6B,KAAKgI,EAAKf,IAC1CkB,EAAGlB,EAAKe,EAAIf,KAqBpBmB,EAAQ,SAAUJ,GAClB,OAZmBK,KACnBH,EAWkBF,EAXD,SAAUf,EAAK/G,GAC5BmI,EAAMpB,GAAO/G,IAEVmI,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,EAAKnJ,EAAG6J,GACxB,IAAIC,KACJ,IAAK,IAAI1B,KAAOe,EACZW,EAAI1B,GAAOpI,EAAEmB,KAAK0I,EAASV,EAAIf,GAAMA,EAAKe,GAE9C,OAAOW,GAEPC,EAAU,SAAUZ,EAAKG,EAAIU,GAC7B,IAAK,IAAI5B,KAAOe,EACZ,GAAIG,EAAGnI,KAAK6I,EAAUb,EAAIf,GAAMA,EAAKe,GACjC,OAAOf,GASf6B,EAAY,SAAUd,GACtB,IAAK,IAAIf,KAAOe,EACZ,OAAOf,GA+KX8B,EAAsB,SAAUC,GAEhC,SAASD,IACL,IAAIhE,EAAQiE,EAAOhJ,KAAK1B,OAASA,KAOjCyG,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,OA7NA3G,EAAU2K,EAAMC,GA6ChBD,EAAKvK,UAAUgL,MAAQ,WACnBlL,KAAK2K,OAAO,GAAK,WACjB3K,KAAK2K,OAAO,GAAK,WACjB3K,KAAK2K,OAAO,GAAK,WACjB3K,KAAK2K,OAAO,GAAK,UACjB3K,KAAK2K,OAAO,GAAK,WACjB3K,KAAK+K,OAAS,EACd/K,KAAKgL,OAAS,GAQlBP,EAAKvK,UAAUiL,UAAY,SAAUC,EAAKC,GACjCA,IACDA,EAAa,GAEjB,IAAIC,EAAItL,KAAK6K,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,IAAIrC,EAAI6K,EAAExI,EAAI,GAAKwI,EAAExI,EAAI,GAAKwI,EAAExI,EAAI,IAAMwI,EAAExI,EAAI,IAChDwI,EAAExI,GAA+B,YAAxBrC,GAAK,EAAMA,IAAM,IAE9B,IAKIF,EAAGgL,EALHC,EAAIxL,KAAK2K,OAAO,GAChBhL,EAAIK,KAAK2K,OAAO,GAChB5H,EAAI/C,KAAK2K,OAAO,GAChBjL,EAAIM,KAAK2K,OAAO,GAChB3I,EAAIhC,KAAK2K,OAAO,GAGpB,IAAS7H,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACrBA,EAAI,GACAA,EAAI,IACJvC,EAAIb,EAAKC,GAAKoD,EAAIrD,GAClB6L,EAAI,aAGJhL,EAAIZ,EAAIoD,EAAIrD,EACZ6L,EAAI,YAIJzI,EAAI,IACJvC,EAAKZ,EAAIoD,EAAMrD,GAAKC,EAAIoD,GACxBwI,EAAI,aAGJhL,EAAIZ,EAAIoD,EAAIrD,EACZ6L,EAAI,YAGR9K,GAAO+K,GAAK,EAAMA,IAAM,IAAOjL,EAAIyB,EAAIuJ,EAAID,EAAExI,GAAM,WACvDd,EAAItC,EACJA,EAAIqD,EACJA,EAA8B,YAAxBpD,GAAK,GAAOA,IAAM,GACxBA,EAAI6L,EACJA,EAAI/K,EAERT,KAAK2K,OAAO,GAAM3K,KAAK2K,OAAO,GAAKa,EAAK,WACxCxL,KAAK2K,OAAO,GAAM3K,KAAK2K,OAAO,GAAKhL,EAAK,WACxCK,KAAK2K,OAAO,GAAM3K,KAAK2K,OAAO,GAAK5H,EAAK,WACxC/C,KAAK2K,OAAO,GAAM3K,KAAK2K,OAAO,GAAKjL,EAAK,WACxCM,KAAK2K,OAAO,GAAM3K,KAAK2K,OAAO,GAAK3I,EAAK,YAE5CyI,EAAKvK,UAAUuL,OAAS,SAAU1G,EAAO2G,GAErC,GAAa,MAAT3G,EAAJ,MAGmBuB,IAAfoF,IACAA,EAAa3G,EAAMjD,QAQvB,IANA,IAAI6J,EAAmBD,EAAa1L,KAAKiL,UACrC3J,EAAI,EAEJ8J,EAAMpL,KAAK4K,KACXgB,EAAQ5L,KAAK+K,OAEVzJ,EAAIoK,GAAY,CAKnB,GAAa,GAATE,EACA,KAAOtK,GAAKqK,GACR3L,KAAKmL,UAAUpG,EAAOzD,GACtBA,GAAKtB,KAAKiL,UAGlB,GAAqB,iBAAVlG,GACP,KAAOzD,EAAIoK,GAIP,GAHAN,EAAIQ,GAAS7G,EAAM/B,WAAW1B,KAE5BA,IADAsK,GAEW5L,KAAKiL,UAAW,CACzBjL,KAAKmL,UAAUC,GACfQ,EAAQ,EAER,YAKR,KAAOtK,EAAIoK,GAIP,GAHAN,EAAIQ,GAAS7G,EAAMzD,KAEjBA,IADAsK,GAEW5L,KAAKiL,UAAW,CACzBjL,KAAKmL,UAAUC,GACfQ,EAAQ,EAER,OAKhB5L,KAAK+K,OAASa,EACd5L,KAAKgL,QAAUU,IAGnBjB,EAAKvK,UAAU2L,OAAS,WACpB,IAAIA,KACAC,EAA0B,EAAd9L,KAAKgL,OAEjBhL,KAAK+K,OAAS,GACd/K,KAAKyL,OAAOzL,KAAK8K,KAAM,GAAK9K,KAAK+K,QAGjC/K,KAAKyL,OAAOzL,KAAK8K,KAAM9K,KAAKiL,WAAajL,KAAK+K,OAAS,KAG3D,IAAK,IAAIjI,EAAI9C,KAAKiL,UAAY,EAAGnI,GAAK,GAAIA,IACtC9C,KAAK4K,KAAK9H,GAAiB,IAAZgJ,EACfA,GAAa,IAEjB9L,KAAKmL,UAAUnL,KAAK4K,MACpB,IAAItJ,EAAI,EACR,IAASwB,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIiJ,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC1BF,EAAOvK,GAAMtB,KAAK2K,OAAO7H,IAAMiJ,EAAK,MAClCzK,EAGV,OAAOuK,GAEJpB,GAhRe,WAQtB,OAPA,WAKIzK,KAAKiL,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,ICplDIK,ED0nDAC,EAAe,SAAUlK,GAEzB,IADA,IAAIhD,EAAI,EACCkD,EAAI,EAAGA,EAAIF,EAAId,OAAQgB,IAAK,CACjC,IAAIC,EAAIH,EAAII,WAAWF,GACnBC,EAAI,IACJnD,IAEKmD,EAAI,KACTnD,GAAK,EAEAmD,GAAK,OAAUA,GAAK,OAEzBnD,GAAK,EACLkD,KAGAlD,GAAK,EAGb,OAAOA,IC5oDX,SAAWiN,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,IAAIE,EAAkBF,EAASG,KAM3BC,EAAoB,SAAUC,EAAUC,GAExC,IADA,IAAIC,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,EAAK,GAAKzF,UAAUyF,GAE7B,KAAIF,EAAUD,EAASI,UAAvB,CAEA,IAAIC,GAAM,IAAIpH,MAAOqH,cACrB,OAAQL,GAOJ,KAAKN,EAASY,MAGd,KAAKZ,EAASa,QACV7H,QAAQ8H,IAAIhG,MAAM9B,SAAU,IAAM0H,EAAM,MAAQL,EAASpF,KAAO,KAAK8F,OAAOR,IAC5E,MACJ,KAAKP,EAASG,KACVnH,QAAQgI,KAAKlG,MAAM9B,SAAU,IAAM0H,EAAM,MAAQL,EAASpF,KAAO,KAAK8F,OAAOR,IAC7E,MACJ,KAAKP,EAASiB,KACVjI,QAAQkI,KAAKpG,MAAM9B,SAAU,IAAM0H,EAAM,MAAQL,EAASpF,KAAO,KAAK8F,OAAOR,IAC7E,MACJ,KAAKP,EAASmB,MACVnI,QAAQC,MAAM6B,MAAM9B,SAAU,IAAM0H,EAAM,MAAQL,EAASpF,KAAO,KAAK8F,OAAOR,IAC9E,MACJ,QACI,MAAM,IAAI1K,MAAM,8DAAgEyK,EAAU,QAGlGc,EAAwB,WAOxB,SAASA,EAAOnG,GACZ9H,KAAK8H,KAAOA,EAIZ9H,KAAKkO,UAAYnB,EAIjB/M,KAAKmO,YAAclB,EAsEvB,OAhEA3N,OAAOyI,eAAekG,EAAO/N,UAAW,YACpC8H,IAAK,WACD,OAAOhI,KAAKkO,WAEhBE,IAAK,SAAUC,GACX,KAAMA,KAAOxB,GACT,MAAM,IAAIpL,UAAU,wCAExBzB,KAAKkO,UAAYG,GAErBC,YAAY,EACZC,cAAc,IAElBjP,OAAOyI,eAAekG,EAAO/N,UAAW,cACpC8H,IAAK,WACD,OAAOhI,KAAKmO,aAEhBC,IAAK,SAAUC,GACX,GAAmB,mBAARA,EACP,MAAM,IAAI5M,UAAU,qDAExBzB,KAAKmO,YAAcE,GAEvBC,YAAY,EACZC,cAAc,IAKlBN,EAAO/N,UAAUsO,MAAQ,WAErB,IADA,IAAIpB,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzBrN,KAAKmO,YAAYxG,MAAM3H,MAAOA,KAAM6M,EAASY,OAAOG,OAAOR,KAE/Da,EAAO/N,UAAUyN,IAAM,WAEnB,IADA,IAAIP,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzBrN,KAAKmO,YAAYxG,MAAM3H,MAAOA,KAAM6M,EAASa,SAASE,OAAOR,KAEjEa,EAAO/N,UAAU2N,KAAO,WAEpB,IADA,IAAIT,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzBrN,KAAKmO,YAAYxG,MAAM3H,MAAOA,KAAM6M,EAASG,MAAMY,OAAOR,KAE9Da,EAAO/N,UAAU6N,KAAO,WAEpB,IADA,IAAIX,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzBrN,KAAKmO,YAAYxG,MAAM3H,MAAOA,KAAM6M,EAASiB,MAAMF,OAAOR,KAE9Da,EAAO/N,UAAU4F,MAAQ,WAErB,IADA,IAAIsH,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzBrN,KAAKmO,YAAYxG,MAAM3H,MAAOA,KAAM6M,EAASmB,OAAOJ,OAAOR,KAExDa,KC1IPQ,EAAmC,WAInC,SAASA,EAAkBC,GACvB1O,KAAK0O,YAAcA,EAEnB1O,KAAK2O,QAAU,YA2CnB,OArCAF,EAAkBvO,UAAUkO,IAAM,SAAUzF,EAAK/G,GAChC,MAATA,EACA5B,KAAK0O,YAAYE,WAAW5O,KAAK6O,cAAclG,IAG/C3I,KAAK0O,YAAYI,QAAQ9O,KAAK6O,cAAclG,GAAMM,EAAUrH,KAOpE6M,EAAkBvO,UAAU8H,IAAM,SAAUW,GACxC,IAAIoG,EAAY/O,KAAK0O,YAAYM,QAAQhP,KAAK6O,cAAclG,IAC5D,OAAiB,MAAboG,EACO,KAGAjG,EAASiG,IAMxBN,EAAkBvO,UAAU+O,OAAS,SAAUtG,GAC3C3I,KAAK0O,YAAYE,WAAW5O,KAAK6O,cAAclG,KAMnD8F,EAAkBvO,UAAU2O,cAAgB,SAAU/G,GAClD,OAAO9H,KAAK2O,QAAU7G,GAE1B2G,EAAkBvO,UAAU0I,SAAW,WACnC,OAAO5I,KAAK0O,YAAY9F,YAErB6F,KAwBPS,EAA+B,WAC/B,SAASA,IACLlP,KAAKmP,UACLnP,KAAKoP,mBAAoB,EAmB7B,OAjBAF,EAAchP,UAAUkO,IAAM,SAAUzF,EAAK/G,GAC5B,MAATA,SACO5B,KAAKmP,OAAOxG,GAGnB3I,KAAKmP,OAAOxG,GAAO/G,GAG3BsN,EAAchP,UAAU8H,IAAM,SAAUW,GACpC,OAAIc,EAASzJ,KAAKmP,OAAQxG,GACf3I,KAAKmP,OAAOxG,GAEhB,MAEXuG,EAAchP,UAAU+O,OAAS,SAAUtG,UAChC3I,KAAKmP,OAAOxG,IAEhBuG,KA2BPG,EAAmB,SAAUC,GAC7B,IAGI,GAAsB,oBAAXpI,aAC2B,IAA3BA,OAAOoI,GAAiC,CAE/C,IAAIC,EAAarI,OAAOoI,GAGxB,OAFAC,EAAWT,QAAQ,oBAAqB,SACxCS,EAAWX,WAAW,qBACf,IAAIH,EAAkBc,IAGrC,MAAOvN,IAGP,OAAO,IAAIkN,GAGXM,EAAoBH,EAAiB,gBAErCI,EAAiBJ,EAAiB,kBAiBlCK,EAAY,IAAIzB,EAAO,sBAKvB0B,GACIC,GAAK,EACF,WACH,OAAOA,OAQXC,EAAO,SAAUjN,GACjB,IAAIkN,EFk6CkB,SAAUlN,GAEhC,IADA,IAAIC,KAAUjD,EAAI,EACTkD,EAAI,EAAGA,EAAIF,EAAId,OAAQgB,IAAK,CACjC,IAAIC,EAAIH,EAAII,WAAWF,GAEvB,GAAIC,GAAK,OAAUA,GAAK,MAAQ,CAC5B,IAAIgN,EAAOhN,EAAI,MAEfT,IADAQ,EACWF,EAAId,OAAQ,2CAEvBiB,EAAI,OAAWgN,GAAQ,KADbnN,EAAII,WAAWF,GAAK,OAG9BC,EAAI,IACJF,EAAIjD,KAAOmD,EAENA,EAAI,MACTF,EAAIjD,KAAQmD,GAAK,EAAK,IACtBF,EAAIjD,KAAY,GAAJmD,EAAU,KAEjBA,EAAI,OACTF,EAAIjD,KAAQmD,GAAK,GAAM,IACvBF,EAAIjD,KAASmD,GAAK,EAAK,GAAM,IAC7BF,EAAIjD,KAAY,GAAJmD,EAAU,MAGtBF,EAAIjD,KAAQmD,GAAK,GAAM,IACvBF,EAAIjD,KAASmD,GAAK,GAAM,GAAM,IAC9BF,EAAIjD,KAASmD,GAAK,EAAK,GAAM,IAC7BF,EAAIjD,KAAY,GAAJmD,EAAU,KAG9B,OAAOF,EEj8CSF,CAAkBC,GAC9BiN,EAAO,IAAIpF,EACfoF,EAAKpE,OAAOqE,GACZ,IAAIE,EAAYH,EAAKhE,SACrB,OAAO5I,EAAOU,gBAAgBqM,IAO9BC,EAAmB,WAEnB,IADA,IAAIC,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAG7B,IADA,IAAI7K,EAAU,GACLM,EAAI,EAAGA,EAAIoN,EAASpO,OAAQgB,IAC7BrD,MAAMqE,QAAQoM,EAASpN,KACtBoN,EAASpN,IACiB,iBAAhBoN,EAASpN,IACc,iBAAvBoN,EAASpN,GAAGhB,OACvBU,GAAWyN,EAAiBtI,MAAM,KAAMuI,EAASpN,IAErB,iBAAhBoN,EAASpN,GACrBN,GAAWyG,EAAUiH,EAASpN,IAG9BN,GAAW0N,EAASpN,GAExBN,GAAW,IAEf,OAAOA,GAMP2N,EAAS,KAMTC,GAAY,EAMZC,EAAgB,SAAUC,EAASC,GACnCjO,GAAQiO,IAA2B,IAAZD,IAAgC,IAAZA,EAAoB,+CAC/C,IAAZA,GACAZ,EAAUpC,SAAWT,EAASa,QAC9ByC,EAAST,EAAU/B,IAAI6C,KAAKd,GACxBa,GACAd,EAAerB,IAAI,mBAAmB,IAElB,mBAAZkC,EACZH,EAASG,GAGTH,EAAS,KACTV,EAAeR,OAAO,qBAO1BtB,EAAM,WAEN,IADA,IAAIuC,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAO7B,IALkB,IAAd+C,IACAA,GAAY,EACG,OAAXD,IAA6D,IAA1CV,EAAezH,IAAI,oBACtCqI,GAAc,IAElBF,EAAQ,CACR,IAAI3N,EAAUyN,EAAiBtI,MAAM,KAAMuI,GAC3CC,EAAO3N,KAOXiO,GAAa,SAAUC,GACvB,OAAO,WAEH,IADA,IAAIR,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAE7BM,EAAIhG,WAAM,GAAS+I,GAAQ9C,OAAOsC,MAMtCpK,GAAQ,WAER,IADA,IAAIoK,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAE7B,IAAI7K,EAAU,4BAA8ByN,EAAiBtI,WAAM,EAAQuI,GAC3ER,EAAU5J,MAAMtD,IAKhBmO,GAAQ,WAER,IADA,IAAIT,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAE7B,IAAI7K,EAAU,yBAA2ByN,EAAiBtI,WAAM,EAAQuI,GAExE,MADAR,EAAU5J,MAAMtD,GACV,IAAIE,MAAMF,IAKhBuL,GAAO,WAEP,IADA,IAAImC,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAE7B,IAAI7K,EAAU,qBAAuByN,EAAiBtI,WAAM,EAAQuI,GACpER,EAAU3B,KAAKvL,IAqBfoO,GAAsB,SAAUtI,GAChC,MAAwB,iBAATA,IACVA,GAAQA,GACLA,GAAQuI,OAAOC,mBACfxI,GAAQuI,OAAOE,oBA8CvBC,GAAW,aAKXC,GAAW,aAOXC,GAAc,SAAU1F,EAAG7L,GAC3B,GAAI6L,IAAM7L,EACN,OAAO,EAEN,GAAI6L,IAAMwF,IAAYrR,IAAMsR,GAC7B,OAAQ,EAEP,GAAItR,IAAMqR,IAAYxF,IAAMyF,GAC7B,OAAO,EAGP,IAAIE,EAASC,GAAY5F,GAAI6F,EAASD,GAAYzR,GAClD,OAAe,OAAXwR,EACe,OAAXE,EACOF,EAASE,GAAU,EAAI7F,EAAE1J,OAASnC,EAAEmC,OAASqP,EAASE,GAGrD,EAGI,OAAXA,EACE,EAGA7F,EAAI7L,GAAK,EAAI,GAS5B2R,GAAgB,SAAU9F,EAAG7L,GAC7B,OAAI6L,IAAM7L,EACC,EAEF6L,EAAI7L,GACD,EAGD,GAQX4R,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,EAAK1P,KAAKwJ,GAGdkG,EAAKC,OAEL,IADA,IAAI/I,EAAM,IACD7F,EAAI,EAAGA,EAAI2O,EAAK3P,OAAQgB,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,EAAId,OACd,GAAI+P,GAAOD,EACP,OAAQhP,GAGZ,IADA,IAAIkP,KACK/O,EAAI,EAAGA,EAAI8O,EAAK9O,GAAK6O,EACtB7O,EAAI6O,EAAUC,EACdC,EAAS/P,KAAKa,EAAImP,UAAUhP,EAAG8O,IAG/BC,EAAS/P,KAAKa,EAAImP,UAAUhP,EAAGA,EAAI6O,IAG3C,OAAOE,GAQPE,GAAO,SAAUtI,EAAKG,GACtB,GAAIpK,MAAMqE,QAAQ4F,GACd,IAAK,IAAI5G,EAAI,EAAGA,EAAI4G,EAAI5H,SAAUgB,EAC9B+G,EAAG/G,EAAG4G,EAAI5G,SAUd8G,EAAQF,EAAK,SAAUf,EAAK0F,GAAO,OAAOxE,EAAGwE,EAAK1F,MAUtDsJ,GAAwB,SAAU1Q,GAClCe,GAAQsO,GAAoBrP,GAAI,uBAChC,IACmC2Q,EAAGlQ,EAAGzB,EAAG4R,EAAIrP,EAAGsP,EAAMxP,EAyBzD,IAtBU,IAANrB,GACAS,EAAI,EACJzB,EAAI,EACJ2R,EAAI,EAAI3Q,IAAO8Q,EAAAA,EAAW,EAAI,IAG9BH,EAAI3Q,EAAI,GACRA,EAAI+Q,KAAKC,IAAIhR,KACJ+Q,KAAKE,IAAI,GAAG,OAGjBxQ,GADAmQ,EAAKG,KAAKG,IAAIH,KAAKI,MAAMJ,KAAK3E,IAAIpM,GAAK+Q,KAAKK,KAbzC,OAAA,KAeHpS,EAAI+R,KAAKM,MAAMrR,EAAI+Q,KAAKE,IAAI,EAhBZ,GAgBuBL,GAAMG,KAAKE,IAAI,EAhBtC,OAoBhBxQ,EAAI,EACJzB,EAAI+R,KAAKM,MAAMrR,EAAI+Q,KAAKE,IAAI,GAAG,SAIvCJ,KACKtP,EA1BmB,GA0BRA,EAAGA,GAAK,EACpBsP,EAAKrQ,KAAKxB,EAAI,EAAI,EAAI,GACtBA,EAAI+R,KAAKI,MAAMnS,EAAI,GAEvB,IAAKuC,EA9BO,GA8BIA,EAAGA,GAAK,EACpBsP,EAAKrQ,KAAKC,EAAI,EAAI,EAAI,GACtBA,EAAIsQ,KAAKI,MAAM1Q,EAAI,GAEvBoQ,EAAKrQ,KAAKmQ,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,EAAQjR,SACRiR,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,MAAO7H,GAEHuR,WAAW,WAKP,IAAItL,EAAQjG,EAAEiG,OAAS,GAEvB,MADA8F,GAAK,yCAA0C9F,GACzCjG,GACPsQ,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,CACrB/T,KAAKgU,QAAUF,EAAatK,MAAM,KAGlC,IADA,IAAIyK,EAAS,EACJnR,EAAI,EAAGA,EAAI9C,KAAKgU,QAAQlS,OAAQgB,IACjC9C,KAAKgU,QAAQlR,GAAGhB,OAAS,IACzB9B,KAAKgU,QAAQC,GAAUjU,KAAKgU,QAAQlR,GACpCmR,KAGRjU,KAAKgU,QAAQlS,OAASmS,EACtBjU,KAAKkU,UAAY,OAGjBlU,KAAKgU,QAAUF,EACf9T,KAAKkU,UAAYH,EAwLzB,OArLAzU,OAAOyI,eAAe8L,EAAM,SAMxB7L,IAAK,WACD,OAAO,IAAI6L,EAAK,KAEpBvF,YAAY,EACZC,cAAc,IAElBsF,EAAK3T,UAAUiU,SAAW,WACtB,OAAInU,KAAKkU,WAAalU,KAAKgU,QAAQlS,OACxB,KACJ9B,KAAKgU,QAAQhU,KAAKkU,YAK7BL,EAAK3T,UAAUkU,UAAY,WACvB,OAAOpU,KAAKgU,QAAQlS,OAAS9B,KAAKkU,WAKtCL,EAAK3T,UAAUmU,SAAW,WACtB,IAAIN,EAAW/T,KAAKkU,UAIpB,OAHIH,EAAW/T,KAAKgU,QAAQlS,QACxBiS,IAEG,IAAIF,EAAK7T,KAAKgU,QAASD,IAKlCF,EAAK3T,UAAUoU,QAAU,WACrB,OAAItU,KAAKkU,UAAYlU,KAAKgU,QAAQlS,OACvB9B,KAAKgU,QAAQhU,KAAKgU,QAAQlS,OAAS,GACvC,MAEX+R,EAAK3T,UAAU0I,SAAW,WAEtB,IADA,IAAI2L,EAAa,GACRzR,EAAI9C,KAAKkU,UAAWpR,EAAI9C,KAAKgU,QAAQlS,OAAQgB,IAC1B,KAApB9C,KAAKgU,QAAQlR,KACbyR,GAAc,IAAMvU,KAAKgU,QAAQlR,IAEzC,OAAOyR,GAAc,KAEzBV,EAAK3T,UAAUsU,mBAAqB,WAEhC,IADA,IAAID,EAAa,GACRzR,EAAI9C,KAAKkU,UAAWpR,EAAI9C,KAAKgU,QAAQlS,OAAQgB,IAC1B,KAApB9C,KAAKgU,QAAQlR,KACbyR,GAAc,IAAME,mBAAmBvP,OAAOlF,KAAKgU,QAAQlR,MAEnE,OAAOyR,GAAc,KAQzBV,EAAK3T,UAAU2I,MAAQ,SAAU6L,GAE7B,YADc,IAAVA,IAAoBA,EAAQ,GACzB1U,KAAKgU,QAAQnL,MAAM7I,KAAKkU,UAAYQ,IAK/Cb,EAAK3T,UAAUyU,OAAS,WACpB,GAAI3U,KAAKkU,WAAalU,KAAKgU,QAAQlS,OAC/B,OAAO,KAEX,IADA,IAAI8S,KACK9R,EAAI9C,KAAKkU,UAAWpR,EAAI9C,KAAKgU,QAAQlS,OAAS,EAAGgB,IACtD8R,EAAO7S,KAAK/B,KAAKgU,QAAQlR,IAC7B,OAAO,IAAI+Q,EAAKe,EAAQ,IAM5Bf,EAAK3T,UAAU2U,MAAQ,SAAUC,GAE7B,IADA,IAAIF,KACK9R,EAAI9C,KAAKkU,UAAWpR,EAAI9C,KAAKgU,QAAQlS,OAAQgB,IAClD8R,EAAO7S,KAAK/B,KAAKgU,QAAQlR,IAC7B,GAAIgS,aAAwBjB,EACxB,IAAS/Q,EAAIgS,EAAaZ,UAAWpR,EAAIgS,EAAad,QAAQlS,OAAQgB,IAClE8R,EAAO7S,KAAK+S,EAAad,QAAQlR,QAIrC,CAAA,IAAIiS,EAAcD,EAAatL,MAAM,KACrC,IAAS1G,EAAI,EAAGA,EAAIiS,EAAYjT,OAAQgB,IAChCiS,EAAYjS,GAAGhB,OAAS,GACxB8S,EAAO7S,KAAKgT,EAAYjS,IAGpC,OAAO,IAAI+Q,EAAKe,EAAQ,IAK5Bf,EAAK3T,UAAU8J,QAAU,WACrB,OAAOhK,KAAKkU,WAAalU,KAAKgU,QAAQlS,QAO1C+R,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,EAAS1T,QAAUgB,EAAI2S,EAAU3T,OAAQgB,IAAK,CAC9D,IAAI4S,EAAMxE,GAAYsE,EAAS1S,GAAI2S,EAAU3S,IAC7C,GAAY,IAAR4S,EACA,OAAOA,EAEf,OAAIF,EAAS1T,SAAW2T,EAAU3T,OACvB,EACJ0T,EAAS1T,OAAS2T,EAAU3T,QAAU,EAAI,GAOrD+R,EAAK3T,UAAUyV,OAAS,SAAUC,GAC9B,GAAI5V,KAAKoU,cAAgBwB,EAAMxB,YAC3B,OAAO,EAEX,IAAK,IAAItR,EAAI9C,KAAKkU,UAAWnI,EAAI6J,EAAM1B,UAAWpR,GAAK9C,KAAKgU,QAAQlS,OAAQgB,IAAKiJ,IAC7E,GAAI/L,KAAKgU,QAAQlR,KAAO8S,EAAM5B,QAAQjI,GAClC,OAAO,EAGf,OAAO,GAOX8H,EAAK3T,UAAUuJ,SAAW,SAAUmM,GAChC,IAAI9S,EAAI9C,KAAKkU,UACTnI,EAAI6J,EAAM1B,UACd,GAAIlU,KAAKoU,YAAcwB,EAAMxB,YACzB,OAAO,EAEX,KAAOtR,EAAI9C,KAAKgU,QAAQlS,QAAQ,CAC5B,GAAI9B,KAAKgU,QAAQlR,KAAO8S,EAAM5B,QAAQjI,GAClC,OAAO,IAETjJ,IACAiJ,EAEN,OAAO,GAEJ8H,KAYPgC,GAAgC,WAKhC,SAASA,EAAeC,EAAMC,GAC1B/V,KAAK+V,aAAeA,EAEpB/V,KAAKgW,OAASF,EAAKjN,QAEnB7I,KAAKiW,YAAc3D,KAAK4D,IAAI,EAAGlW,KAAKgW,OAAOlU,QAC3C,IAAK,IAAIgB,EAAI,EAAGA,EAAI9C,KAAKgW,OAAOlU,OAAQgB,IACpC9C,KAAKiW,aAAenJ,EAAa9M,KAAKgW,OAAOlT,IAEjD9C,KAAKmW,cAgET,OA9DA7W,OAAOyI,eAAe8N,EAAgB,kBAElC7N,IAAK,WACD,OAAO,IAEXsG,YAAY,EACZC,cAAc,IAElBjP,OAAOyI,eAAe8N,EAAgB,yBAElC7N,IAAK,WACD,OAAO,KAEXsG,YAAY,EACZC,cAAc,IAGlBsH,EAAe3V,UAAU6B,KAAO,SAAU8S,GAElC7U,KAAKgW,OAAOlU,OAAS,IACrB9B,KAAKiW,aAAe,GAExBjW,KAAKgW,OAAOjU,KAAK8S,GACjB7U,KAAKiW,aAAenJ,EAAa+H,GACjC7U,KAAKmW,eAETN,EAAe3V,UAAU2B,IAAM,WAC3B,IAAIuU,EAAOpW,KAAKgW,OAAOnU,MACvB7B,KAAKiW,aAAenJ,EAAasJ,GAE7BpW,KAAKgW,OAAOlU,OAAS,IACrB9B,KAAKiW,aAAe,IAG5BJ,EAAe3V,UAAUiW,YAAc,WACnC,GAAInW,KAAKiW,YAAcJ,EAAeQ,sBAClC,MAAM,IAAI3T,MAAM1C,KAAK+V,aACjB,8BACAF,EAAeQ,sBACf,WACArW,KAAKiW,YACL,MAER,GAAIjW,KAAKgW,OAAOlU,OAAS+T,EAAeS,eACpC,MAAM,IAAI5T,MAAM1C,KAAK+V,aACjB,iEACAF,EAAeS,eACf,gCACAtW,KAAKuW,kBAQjBV,EAAe3V,UAAUqW,cAAgB,WACrC,OAA0B,GAAtBvW,KAAKgW,OAAOlU,OACL,GAEJ,gBAAkB9B,KAAKgW,OAAOrR,KAAK,KAAO,KAE9CkR,KA0BPW,GAAe,eAsBfC,GAA0B,WAQ1B,SAASA,EAASC,EAAMC,EAAQC,EAAWC,EAAeC,QAC/B,IAAnBA,IAA6BA,EAAiB,IAClD9W,KAAK2W,OAASA,EACd3W,KAAK4W,UAAYA,EACjB5W,KAAK6W,cAAgBA,EACrB7W,KAAK8W,eAAiBA,EACtB9W,KAAK0W,KAAOA,EAAKxD,cACjBlT,KAAK+W,OAAS/W,KAAK0W,KAAKzD,OAAOjT,KAAK0W,KAAKM,QAAQ,KAAO,GACxDhX,KAAKiX,aAAezH,EAAkBxH,IAAI,QAAU0O,IAAS1W,KAAK0W,KAgEtE,OA9DAD,EAASvW,UAAUgX,gBAAkB,WACjC,OAAOlX,KAAK0W,OAAS1W,KAAKiX,cAAgBjX,KAAKmX,gBAEnDV,EAASvW,UAAUkX,gBAAkB,WACjC,MAA0C,OAAnCpX,KAAKiX,aAAahE,OAAO,EAAG,IAEvCwD,EAASvW,UAAUmX,WAAa,WAC5B,MAAuB,wBAAhBrX,KAAK+W,QAEhBN,EAASvW,UAAUiX,aAAe,WAC9B,MAAwB,mBAAhBnX,KAAK+W,QAA+C,wBAAhB/W,KAAK+W,QAErDN,EAASvW,UAAUoX,WAAa,SAAUC,GAClCA,IAAYvX,KAAKiX,eACjBjX,KAAKiX,aAAeM,EAChBvX,KAAKoX,mBACL5H,EAAkBpB,IAAI,QAAUpO,KAAK0W,KAAM1W,KAAKiX,gBAU5DR,EAASvW,UAAUsX,cAAgB,SAAUC,EAAMC,GAG/C,IAAIC,EACJ,GAHArV,EAAuB,iBAATmV,EAAmB,8BACjCnV,EAAyB,iBAAXoV,EAAqB,gCArE3B,cAuEJD,EACAE,GACK3X,KAAK2W,OAAS,SAAW,SAAW3W,KAAKiX,aAAe,YAE5D,CAAA,GAAIQ,IAASjB,GAKd,MAAM,IAAI9T,MAAM,4BAA8B+U,GAJ9CE,GACK3X,KAAK2W,OAAS,WAAa,WAAa3W,KAAKiX,aAAe,QAKjEjX,KAAKkX,oBACLQ,EAAW,GAAI1X,KAAK4W,WAExB,IAAIgB,KAIJ,OAHAhO,EAAQ8N,EAAQ,SAAU/O,EAAK/G,GAC3BgW,EAAM7V,KAAK4G,EAAM,IAAM/G,KAEpB+V,EAAUC,EAAMjT,KAAK,MAGhC8R,EAASvW,UAAU0I,SAAW,WAC1B,IAAIhG,EAAM5C,KAAK6X,cAIf,OAHI7X,KAAK8W,iBACLlU,GAAO,IAAM5C,KAAK8W,eAAiB,KAEhClU,GAGX6T,EAASvW,UAAU2X,YAAc,WAC7B,OAAQ7X,KAAK2W,OAAS,WAAa,WAAa3W,KAAK0W,MAElDD,KAkEX,IAqtBIqB,GAqFAC,GA1yBAC,GAAgB,SAAUC,GAC1B,IAAIC,EAAYC,GAASF,GAAUrB,EAAYsB,EAAUE,UAChC,aAArBF,EAAUnB,QACVpG,GAAMuH,EAAUxB,KACZ,8EAIFE,GAA0B,aAAbA,GACM,cAArBsB,EAAUnB,QACVpG,GAAM,gFAELuH,EAAUvB,QAz4BO,oBAAXzP,QACPA,OAAOmR,UACPnR,OAAOmR,SAASC,WACgC,IAAhDpR,OAAOmR,SAASC,SAAStB,QAAQ,WACjCjJ,GAAK,6FAw4BT,IAAI8I,EAAqC,OAArBqB,EAAUK,QAAwC,QAArBL,EAAUK,OAC3D,OACIC,SAAU,IAAI/B,GAASyB,EAAUxB,KAAMwB,EAAUvB,OAAQC,EAAWC,GACpEf,KAAM,IAAIjC,GAAKqE,EAAU3D,cAQ7B4D,GAAW,SAAUF,GAErB,IAAIvB,EAAO,GAAIK,EAAS,GAAIqB,EAAY,GAAI7D,EAAa,GAErDoC,GAAS,EAAM4B,EAAS,QAASE,EAAO,IAE5C,GAAuB,iBAAZR,EAAsB,CAE7B,IAAIS,EAAWT,EAAQjB,QAAQ,MAC3B0B,GAAY,IACZH,EAASN,EAAQlG,UAAU,EAAG2G,EAAW,GACzCT,EAAUA,EAAQlG,UAAU2G,EAAW,IAG3C,IAAIC,EAAWV,EAAQjB,QAAQ,MACb,IAAd2B,IACAA,EAAWV,EAAQnW,QAEvB,IAAI8W,EAAkBX,EAAQjB,QAAQ,MACb,IAArB4B,IACAA,EAAkBX,EAAQnW,QAE9B4U,EAAOuB,EAAQlG,UAAU,EAAGO,KAAKG,IAAIkG,EAAUC,IAC3CD,EAAWC,IAEXrE,EA/FZ,SAAoBA,GAGhB,IAFA,IAAIsE,EAAoB,GACpBjE,EAASL,EAAW/K,MAAM,KACrB1G,EAAI,EAAGA,EAAI8R,EAAO9S,OAAQgB,IAC/B,GAAI8R,EAAO9R,GAAGhB,OAAS,EAAG,CACtB,IAAIgX,EAAQlE,EAAO9R,GACnB,IACIgW,EAAQC,mBAAmBD,EAAMrQ,QAAQ,MAAO,MAEpD,MAAOzG,IACP6W,GAAqB,IAAMC,EAGnC,OAAOD,EAkFcG,CAAWf,EAAQlG,UAAU4G,EAAUC,KAExD,IAAIK,EA9EZ,SAAqBC,GACjB,IAAIC,KACAD,EAAYE,WAAW,OACvBF,EAAcA,EAAYnH,UAAU,IAExC,IAAK,IAAI1E,EAAK,EAAGgM,EAAKH,EAAY1P,MAAM,KAAM6D,EAAKgM,EAAGvX,OAAQuL,IAAM,CAChE,IAAIiM,EAAUD,EAAGhM,GACjB,GAAuB,IAAnBiM,EAAQxX,OAAZ,CAGA,IAAIyX,EAAKD,EAAQ9P,MAAM,KACL,IAAd+P,EAAGzX,OACHqX,EAAQJ,mBAAmBQ,EAAG,KAAOR,mBAAmBQ,EAAG,IAG3DxL,GAAK,0BAA4BuL,EAAU,eAAiBJ,EAAc,MAGlF,OAAOC,EA4DeK,CAAYvB,EAAQlG,UAAUO,KAAKG,IAAIwF,EAAQnW,OAAQ8W,MAEzEF,EAAWhC,EAAKM,QAAQ,OACR,GACZL,EAAoB,UAAX4B,GAAiC,QAAXA,EAC/BE,EAAOzF,SAAS0D,EAAK3E,UAAU2G,EAAW,GAAI,KAG9CA,EAAWT,EAAQnW,OAEvB,IAAIyH,EAAQmN,EAAKlN,MAAM,KACF,IAAjBD,EAAMzH,QAENiV,EAASxN,EAAM,GACf6O,EAAY7O,EAAM,GAAG2J,eAEC,IAAjB3J,EAAMzH,OACXiV,EAASxN,EAAM,GAEoC,cAA9CA,EAAM,GAAGV,MAAM,EAAG6P,GAAUxF,gBACjC6D,EAAS,aAGK,KAAdqB,GAAoB,OAAQa,IAC5Bb,EAAYa,EAAgB,IAGpC,OACIvC,KAAMA,EACN+B,KAAMA,EACN1B,OAAQA,EACRqB,UAAWA,EACXzB,OAAQA,EACR4B,OAAQA,EACRhE,WAAYA,IAwBhBkF,GAAqB,iCAOrBC,GAAsB,+BAWtBC,GAAa,SAAUhR,GACvB,MAAuB,iBAARA,GAAmC,IAAfA,EAAI7G,SAAiB2X,GAAmBtS,KAAKwB,IAMhFiR,GAAoB,SAAUrF,GAC9B,MAA8B,iBAAfA,GACW,IAAtBA,EAAWzS,SACV4X,GAAoBvS,KAAKoN,IAiB9BsF,GAAkB,SAAUC,GAC5B,OAAqB,OAAbA,GACgB,iBAAbA,GACc,iBAAbA,IAA0BlJ,GAAoBkJ,IACrDA,GAAgC,iBAAbA,GAAyBrQ,EAASqQ,EAAU,QAWpEC,GAA0B,SAAU9N,EAAQM,EAAgBjE,EAAMwN,EAAMtJ,GACpEA,QAAqBlG,IAATgC,GAEhB0R,GAAqB1N,EAAYL,EAAQM,EAAgBC,GAAWlE,EAAMwN,IAS1EkE,GAAuB,SAAUC,EAAgB3R,EAAM4R,GACvD,IAAIpE,EAAOoE,aAAiBrG,GAAO,IAAIgC,GAAeqE,EAAOD,GAAkBC,EAC/E,QAAa5T,IAATgC,EACA,MAAM,IAAI5F,MAAMuX,EAAiB,sBAAwBnE,EAAKS,iBAElE,GAAoB,mBAATjO,EACP,MAAM,IAAI5F,MAAMuX,EACZ,uBACAnE,EAAKS,gBACL,oBACAjO,EAAKM,YAEb,GAAIgI,GAAoBtI,GACpB,MAAM,IAAI5F,MAAMuX,EAAiB,YAAc3R,EAAKM,WAAa,IAAMkN,EAAKS,iBAGhF,GAAoB,iBAATjO,GACPA,EAAKxG,OA5EQ,SA4EkB,GAC/BgL,EAAaxE,GA7EA,SA8Eb,MAAM,IAAI5F,MAAMuX,EACZ,sDAGAnE,EAAKS,gBACL,MACAjO,EAAKyJ,UAAU,EAAG,IAClB,SAIR,GAAIzJ,GAAwB,iBAATA,EAAmB,CAClC,IAAI6R,GAAgB,EAAOC,GAAmB,EAqB9C,GApBAxQ,EAAQtB,EAAM,SAAUK,EAAK/G,GACzB,GAAY,WAAR+G,EACAwR,GAAgB,OAEf,GAAY,cAARxR,GAA+B,QAARA,IAC5ByR,GAAmB,GACdT,GAAWhR,IACZ,MAAM,IAAIjG,MAAMuX,EACZ,6BACAtR,EACA,KACAmN,EAAKS,gBACL,wFAIZT,EAAK/T,KAAK4G,GACVqR,GAAqBC,EAAgBrY,EAAOkU,GAC5CA,EAAKjU,QAELsY,GAAiBC,EACjB,MAAM,IAAI1X,MAAMuX,EACZ,4BACAnE,EAAKS,gBACL,sCAyDZ8D,GAA+B,SAAUpO,EAAQM,EAAgBjE,EAAMwN,EAAMtJ,GAC7E,IAAIA,QAAqBlG,IAATgC,EAAhB,CAEA,IAAI2R,EAAiB3N,EAAYL,EAAQM,EAAgBC,GACzD,IAAMlE,GAAwB,iBAATA,GAAsB7I,MAAMqE,QAAQwE,GACrD,MAAM,IAAI5F,MAAMuX,EAAiB,0DAErC,IAAIK,KACJ1Q,EAAQtB,EAAM,SAAUK,EAAK/G,GACzB,IAAI2Y,EAAU,IAAI1G,GAAKlL,GAEvB,GADAqR,GAAqBC,EAAgBrY,EAAOkU,EAAKjB,MAAM0F,IAC7B,cAAtBA,EAAQjG,YACHuF,GAAgBjY,GACjB,MAAM,IAAIc,MAAMuX,EACZ,kCACAM,EAAQ3R,WACR,gGAIZ0R,EAAWvY,KAAKwY,KAnES,SAAUN,EAAgBK,GACvD,IAAIxX,EAAGyX,EACP,IAAKzX,EAAI,EAAGA,EAAIwX,EAAWxY,OAAQgB,IAG/B,IADA,IAAI2O,GADJ8I,EAAUD,EAAWxX,IACF+F,QACVkD,EAAI,EAAGA,EAAI0F,EAAK3P,OAAQiK,IAC7B,GAAgB,cAAZ0F,EAAK1F,IAAsBA,IAAM0F,EAAK3P,OAAS,QAG9C,IAAK6X,GAAWlI,EAAK1F,IACtB,MAAM,IAAIrJ,MAAMuX,EACZ,4BACAxI,EAAK1F,GACL,aACAwO,EAAQ3R,WACR,uFAQhB0R,EAAW5I,KAAKmC,GAAKwB,cACrB,IAAImF,EAAW,KACf,IAAK1X,EAAI,EAAGA,EAAIwX,EAAWxY,OAAQgB,IAAK,CAEpC,GADAyX,EAAUD,EAAWxX,GACJ,OAAb0X,GAAqBA,EAAS/Q,SAAS8Q,GACvC,MAAM,IAAI7X,MAAMuX,EACZ,mBACAO,EAAS5R,WACT,qCACA2R,EAAQ3R,YAEhB4R,EAAWD,GAmCfE,CAA2BR,EAAgBK,KAE3CI,GAAmB,SAAUzO,EAAQM,EAAgBuN,EAAUtN,GAC/D,IAAIA,QAAyBlG,IAAbwT,EAAhB,CAEA,GAAIlJ,GAAoBkJ,GACpB,MAAM,IAAIpX,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,MACAsN,EAASlR,WACT,6FAGR,IAAKiR,GAAgBC,GACjB,MAAM,IAAIpX,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,yFAGRmO,GAAoB,SAAU1O,EAAQM,EAAgBqO,EAAWpO,GACjE,IAAIA,QAA0BlG,IAAdsU,EAEhB,OAAQA,GACJ,IAAK,QACL,IAAK,cACL,IAAK,gBACL,IAAK,gBACL,IAAK,cACD,MACJ,QACI,MAAM,IAAIlY,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,8GAIZqO,GAAc,SAAU5O,EAAQM,EAAgB5D,EAAK6D,GACrD,KAAIA,QAAoBlG,IAARqC,GAEXgR,GAAWhR,IACZ,MAAM,IAAIjG,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,yBACA7D,EACA,qGAGRmS,GAAqB,SAAU7O,EAAQM,EAAgBgI,EAAY/H,GACnE,KAAIA,QAA2BlG,IAAfiO,GAEXqF,GAAkBrF,IACnB,MAAM,IAAI7R,MAAM4J,EAAYL,EAAQM,EAAgBC,GAChD,0BACA+H,EACA,qFAURwG,GAAuB,SAAU9O,EAAQ6J,GACzC,GAAwB,UAApBA,EAAK3B,WACL,MAAM,IAAIzR,MAAMuJ,EAAS,8CAG7B+O,GAAc,SAAU/O,EAAQM,EAAgB2L,GAEhD,IAAI3D,EAAa2D,EAAUpC,KAAKlN,WAChC,GAAyC,iBAA5BsP,EAAUM,SAAS9B,MACO,IAAnCwB,EAAUM,SAAS9B,KAAK5U,SACtB6X,GAAWzB,EAAUM,SAAS5B,YACc,cAA1CsB,EAAUM,SAAS9B,KAAKlN,MAAM,KAAK,IAChB,IAAtB+K,EAAWzS,SArPQ,SAAUyS,GAKlC,OAJIA,IAEAA,EAAaA,EAAW9L,QAAQ,mBAAoB,MAEjDmR,GAAkBrF,GAgPQ0G,CAAsB1G,GACnD,MAAM,IAAI7R,MAAM4J,EAAYL,EAAQM,GAAgB,GAChD,yFA6BR2O,GAA8B,WAK9B,SAASA,EAAaC,EAAOjB,GACzBla,KAAKmb,MAAQA,EACbnb,KAAKka,MAAQA,EA8EjB,OAxEAgB,EAAahb,UAAUkb,OAAS,SAAUC,GACtCrP,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU9F,QACxD4K,EAAiB,sBAAuB,EAAG2O,GAAY,GACvD,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKmb,MAAMI,mBAAmBvb,KAAKka,MAAOoB,EAASxU,aAAauU,IACzDC,EAAS5U,SAMpBwU,EAAahb,UAAU+O,OAAS,SAAUoM,GACtCrP,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU9F,QACxDiZ,GAAqB,sBAAuB/a,KAAKka,OACjDxN,EAAiB,sBAAuB,EAAG2O,GAAY,GACvD,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKmb,MAAMK,gBAAgBxb,KAAKka,MAAO,KAAMoB,EAASxU,aAAauU,IAC5DC,EAAS5U,SAOpBwU,EAAahb,UAAUkO,IAAM,SAAUxM,EAAOyZ,GAC1CrP,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QACrDiZ,GAAqB,mBAAoB/a,KAAKka,OAC9CH,GAAwB,mBAAoB,EAAGnY,EAAO5B,KAAKka,OAAO,GAClExN,EAAiB,mBAAoB,EAAG2O,GAAY,GACpD,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKmb,MAAMK,gBAAgBxb,KAAKka,MAAOtY,EAAO0Z,EAASxU,aAAauU,IAC7DC,EAAS5U,SAQpBwU,EAAahb,UAAUub,gBAAkB,SAAU7Z,EAAOkY,EAAUuB,GAChErP,EAAiB,+BAAgC,EAAG,EAAGpE,UAAU9F,QACjEiZ,GAAqB,+BAAgC/a,KAAKka,OAC1DH,GAAwB,+BAAgC,EAAGnY,EAAO5B,KAAKka,OAAO,GAC9EQ,GAAiB,+BAAgC,EAAGZ,GAAU,GAC9DpN,EAAiB,+BAAgC,EAAG2O,GAAY,GAChE,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKmb,MAAMO,4BAA4B1b,KAAKka,MAAOtY,EAAOkY,EAAUwB,EAASxU,aAAauU,IACnFC,EAAS5U,SAOpBwU,EAAahb,UAAUuL,OAAS,SAAUkQ,EAAeN,GAGrD,GAFArP,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU9F,QACxDiZ,GAAqB,sBAAuB/a,KAAKka,OAC7Cza,MAAMqE,QAAQ6X,GAAgB,CAE9B,IADA,IAAIC,KACK9Y,EAAI,EAAGA,EAAI6Y,EAAc7Z,SAAUgB,EACxC8Y,EAAiB,GAAK9Y,GAAK6Y,EAAc7Y,GAE7C6Y,EAAgBC,EAChB7N,GAAK,gOAGTsM,GAA6B,sBAAuB,EAAGsB,EAAe3b,KAAKka,OAAO,GAClFxN,EAAiB,sBAAuB,EAAG2O,GAAY,GACvD,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKmb,MAAMU,mBAAmB7b,KAAKka,MAAOyB,EAAeL,EAASxU,aAAauU,IACxEC,EAAS5U,SAEbwU,KAkBPY,GAAmC,WAQnC,SAASA,EAAkBC,EAAWC,GAClChc,KAAK+b,UAAYA,EACjB/b,KAAKgc,SAAWA,EAQpB,OAJAF,EAAkB5b,UAAU+b,OAAS,WAEjC,OADAjQ,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU9F,SACpDia,UAAW/b,KAAK+b,UAAWC,SAAUhc,KAAKgc,SAASC,WAEzDH,KAgCPI,IAEIC,GAAa,mEAGbC,GAAe,EAKfC,MACG,SAAU9O,GACb,IAEIzK,EAFAwZ,EAAgB/O,IAAQ6O,GAC5BA,GAAe7O,EAEf,IAAIgP,EAAiB,IAAI9c,MAAM,GAC/B,IAAKqD,EAAI,EAAGA,GAAK,EAAGA,IAChByZ,EAAezZ,GAAKqZ,GAAWzW,OAAO6H,EAAM,IAG5CA,EAAM+E,KAAKI,MAAMnF,EAAM,IAE3BjL,EAAe,IAARiL,EAAW,4BAClB,IAAIqC,EAAK2M,EAAe5X,KAAK,IAC7B,GAAK2X,EAKA,CAGD,IAAKxZ,EAAI,GAAIA,GAAK,GAA0B,KAArBuZ,GAAcvZ,GAAWA,IAC5CuZ,GAAcvZ,GAAK,EAEvBuZ,GAAcvZ,UAVd,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAChBuZ,GAAcvZ,GAAKwP,KAAKI,MAAsB,GAAhBJ,KAAKkK,UAW3C,IAAK1Z,EAAI,EAAGA,EAAI,GAAIA,IAChB8M,GAAMuM,GAAWzW,OAAO2W,GAAcvZ,IAG1C,OADAR,EAAqB,KAAdsN,EAAG9N,OAAe,oCAClB8N,IA0BX6M,GAA2B,WAC3B,SAASA,EAAU3U,EAAM4U,GACrB1c,KAAK8H,KAAOA,EACZ9H,KAAK0c,KAAOA,EAWhB,OAHAD,EAAUE,KAAO,SAAU7U,EAAM4U,GAC7B,OAAO,IAAID,EAAU3U,EAAM4U,IAExBD,KAsBPG,GAAuB,WACvB,SAASA,KA6BT,OAvBAA,EAAM1c,UAAU2c,WAAa,WACzB,OAAO7c,KAAK8c,QAAQtM,KAAKxQ,OAU7B4c,EAAM1c,UAAU6c,oBAAsB,SAAUC,EAASC,GACrD,IAAIC,EAAa,IAAIT,GAAUzL,GAAUgM,GACrCG,EAAa,IAAIV,GAAUzL,GAAUiM,GACzC,OAAgD,IAAzCjd,KAAK8c,QAAQI,EAAYC,IAMpCP,EAAM1c,UAAUkd,QAAU,WACtB,OAAOX,GAAUY,KAEdT,KAmBPU,GAA0B,SAAU5S,GAEpC,SAAS4S,IACL,OAAkB,OAAX5S,GAAmBA,EAAO/C,MAAM3H,KAAM4H,YAAc5H,KA8D/D,OAhEAF,EAAUwd,EAAU5S,GAIpBpL,OAAOyI,eAAeuV,EAAU,gBAC5BtV,IAAK,WACD,OAAO8P,IAEX1J,IAAK,SAAUC,GACXyJ,GAAezJ,GAEnBC,YAAY,EACZC,cAAc,IAKlB+O,EAASpd,UAAU4c,QAAU,SAAUtR,EAAG7L,GACtC,OAAOuR,GAAY1F,EAAE1D,KAAMnI,EAAEmI,OAKjCwV,EAASpd,UAAUqd,YAAc,SAAUb,GAGvC,MAAMja,EAAe,oDAKzB6a,EAASpd,UAAU6c,oBAAsB,SAAUC,EAASC,GACxD,OAAO,GAKXK,EAASpd,UAAUkd,QAAU,WACzB,OAAOX,GAAUY,KAKrBC,EAASpd,UAAUsd,QAAU,WAGzB,OAAO,IAAIf,GAAUxL,GAAU6G,KAOnCwF,EAASpd,UAAUud,SAAW,SAAUC,EAAY5V,GAGhD,OAFAxF,EAA6B,iBAAfob,EAAyB,gDAEhC,IAAIjB,GAAUiB,EAAY5F,KAKrCwF,EAASpd,UAAU0I,SAAW,WAC1B,MAAO,QAEJ0U,GACTV,IACEe,GAAY,IAAIL,GAyBpB,IAwCIM,GAoQAC,GACAC,GA7SAC,GAAmB,SAAUjE,GAC7B,MAAwB,iBAAbA,EACA,UAAY7H,GAAsB6H,GAElC,UAAYA,GAOvBkE,GAAuB,SAAUC,GACjC,GAAIA,EAAaC,aAAc,CAC3B,IAAI7P,EAAM4P,EAAa5P,MACvB/L,EAAsB,iBAAR+L,GACK,iBAARA,GACS,iBAARA,GAAoB5E,EAAS4E,EAAK,OAAS,6CAGvD/L,EAAO2b,IAAiBlG,IAAYkG,EAAajU,UAAW,gCAGhE1H,EAAO2b,IAAiBlG,IAAYkG,EAAaE,cAAcnU,UAAW,uDAwB1EoU,GAA0B,WAO1B,SAASA,EAASC,EAAQC,QACA,IAAlBA,IAA4BA,EAAgBF,EAASR,0BAA0BW,YACnFve,KAAKqe,OAASA,EACdre,KAAKse,cAAgBA,EACrBte,KAAKwe,UAAY,KACjBlc,OAAuBgE,IAAhBtG,KAAKqe,QAAwC,OAAhBre,KAAKqe,OAAiB,4DAC1DL,GAAqBhe,KAAKse,eA+N9B,OA7NAhf,OAAOyI,eAAeqW,EAAU,6BAC5BpW,IAAK,WACD,OAAO4V,IAEXxP,IAAK,SAAUC,GACXuP,GAA4BvP,GAEhCC,YAAY,EACZC,cAAc,IAGlB6P,EAASle,UAAUge,WAAa,WAC5B,OAAO,GAGXE,EAASle,UAAUie,YAAc,WAC7B,OAAOne,KAAKse,eAGhBF,EAASle,UAAUue,eAAiB,SAAUC,GAC1C,OAAO,IAAIN,EAASpe,KAAKqe,OAAQK,IAGrCN,EAASle,UAAUye,kBAAoB,SAAUC,GAE7C,MAAkB,cAAdA,EACO5e,KAAKse,cAGLF,EAASR,0BAA0BW,YAIlDH,EAASle,UAAU2e,SAAW,SAAU/I,GACpC,OAAIA,EAAK9L,UACEhK,KAEkB,cAApB8V,EAAK3B,WACHnU,KAAKse,cAGLF,EAASR,0BAA0BW,YAMlDH,EAASle,UAAU4e,SAAW,WAC1B,OAAO,GAGXV,EAASle,UAAU6e,wBAA0B,SAAUH,EAAWI,GAC9D,OAAO,MAGXZ,EAASle,UAAU+e,qBAAuB,SAAUL,EAAWM,GAC3D,MAAkB,cAAdN,EACO5e,KAAKye,eAAeS,GAEtBA,EAAalV,WAA2B,cAAd4U,EACxB5e,KAGAoe,EAASR,0BAA0BW,WAAWU,qBAAqBL,EAAWM,GAAcT,eAAeze,KAAKse,gBAI/HF,EAASle,UAAUif,YAAc,SAAUrJ,EAAMoJ,GAC7C,IAAIE,EAAQtJ,EAAK3B,WACjB,OAAc,OAAViL,EACOF,EAEFA,EAAalV,WAAuB,cAAVoV,EACxBpf,MAGPsC,EAAiB,cAAV8c,GAA8C,IAArBtJ,EAAK1B,YAAmB,8CACjDpU,KAAKif,qBAAqBG,EAAOhB,EAASR,0BAA0BW,WAAWY,YAAYrJ,EAAKzB,WAAY6K,MAI3Hd,EAASle,UAAU8J,QAAU,WACzB,OAAO,GAGXoU,EAASle,UAAUmf,YAAc,WAC7B,OAAO,GAGXjB,EAASle,UAAUof,aAAe,SAAUC,EAAOC,GAC/C,OAAO,GAKXpB,EAASle,UAAUmO,IAAM,SAAUoR,GAC/B,OAAIA,IAAiBzf,KAAKme,cAAcnU,WAEhC0V,SAAU1f,KAAK2f,WACfC,YAAa5f,KAAKme,cAAc9P,OAG7BrO,KAAK2f,YAGpBvB,EAASle,UAAU2f,KAAO,WACtB,GAAuB,OAAnB7f,KAAKwe,UAAoB,CACzB,IAAIsB,EAAS,GACR9f,KAAKse,cAActU,YACpB8V,GACI,YACI/B,GAAiB/d,KAAKse,cAAcjQ,OACpC,KACZ,IAAIoJ,SAAczX,KAAKqe,OACvByB,GAAUrI,EAAO,IAEbqI,GADS,WAATrI,EACUxF,GAAsBjS,KAAKqe,QAG3Bre,KAAKqe,OAEnBre,KAAKwe,UAAY3O,EAAKiQ,GAE1B,OAAO9f,KAAKwe,WAMhBJ,EAASle,UAAUyf,SAAW,WAC1B,OAAO3f,KAAKqe,QAKhBD,EAASle,UAAU6f,UAAY,SAAUnK,GACrC,OAAIA,IAAUwI,EAASR,0BAA0BW,WACtC,EAEF3I,aAAiBwI,EAASR,2BACvB,GAGRtb,EAAOsT,EAAMsI,aAAc,qBACpBle,KAAKggB,mBAAmBpK,KASvCwI,EAASle,UAAU8f,mBAAqB,SAAUC,GAC9C,IAAIC,SAAuBD,EAAU5B,OACjC8B,SAAsBngB,KAAKqe,OAC3B+B,EAAahC,EAASiC,iBAAiBrJ,QAAQkJ,GAC/CI,EAAYlC,EAASiC,iBAAiBrJ,QAAQmJ,GAGlD,OAFA7d,EAAO8d,GAAc,EAAG,sBAAwBF,GAChD5d,EAAOge,GAAa,EAAG,sBAAwBH,GAC3CC,IAAeE,EAEM,WAAjBH,EAEO,EAIHngB,KAAKqe,OAAS4B,EAAU5B,QAChB,EAEHre,KAAKqe,SAAW4B,EAAU5B,OACxB,EAGA,EAKRiC,EAAYF,GAM3BhC,EAASle,UAAUqgB,UAAY,WAC3B,OAAOvgB,MAKXoe,EAASle,UAAUsgB,UAAY,WAC3B,OAAO,GAKXpC,EAASle,UAAUyV,OAAS,SAAUC,GAIlC,GAAIA,IAAU5V,KACV,OAAO,EAEN,GAAI4V,EAAMsI,aAAc,CACzB,IAAI+B,EAAYrK,EAChB,OAAQ5V,KAAKqe,SAAW4B,EAAU5B,QAC9Bre,KAAKse,cAAc3I,OAAOsK,EAAU3B,eAGxC,OAAO,GASfF,EAASiC,kBAAoB,SAAU,UAAW,SAAU,UACrDjC,KA+BX,IAq1BIqC,GAkMAlC,GA39BAmC,GAAiB,IA5Dc,SAAUhW,GAEzC,SAASiW,IACL,OAAkB,OAAXjW,GAAmBA,EAAO/C,MAAM3H,KAAM4H,YAAc5H,KAuD/D,OAzDAF,EAAU6gB,EAAejW,GAOzBiW,EAAczgB,UAAU4c,QAAU,SAAUtR,EAAG7L,GAC3C,IAAIihB,EAAYpV,EAAEkR,KAAKyB,cACnB0C,EAAYlhB,EAAE+c,KAAKyB,cACnB2C,EAAWF,EAAUb,UAAUc,GACnC,OAAiB,IAAbC,EACO5P,GAAY1F,EAAE1D,KAAMnI,EAAEmI,MAGtBgZ,GAMfH,EAAczgB,UAAUqd,YAAc,SAAUb,GAC5C,OAAQA,EAAKyB,cAAcnU,WAK/B2W,EAAczgB,UAAU6c,oBAAsB,SAAUC,EAASC,GAC7D,OAAQD,EAAQmB,cAAcxI,OAAOsH,EAAQkB,gBAKjDwC,EAAczgB,UAAUkd,QAAU,WAC9B,OAAOX,GAAUY,KAKrBsD,EAAczgB,UAAUsd,QAAU,WAC9B,OAAO,IAAIf,GAAUxL,GAAU,IAAImN,GAAS,kBAAmBN,MAOnE6C,EAAczgB,UAAUud,SAAW,SAAUC,EAAY5V,GACrD,IAAImW,EAAeJ,GAAaH,GAChC,OAAO,IAAIjB,GAAU3U,EAAM,IAAIsW,GAAS,kBAAmBH,KAK/D0C,EAAczgB,UAAU0I,SAAW,WAC/B,MAAO,aAEJ+X,GACT/D,KAqBEmE,GAAmC,WASnC,SAASA,EAAkBrE,EAAMsE,EAAUC,EAAYC,EAAYC,QACtC,IAArBA,IAA+BA,EAAmB,MACtDnhB,KAAKkhB,WAAaA,EAClBlhB,KAAKmhB,iBAAmBA,EAIxBnhB,KAAKohB,cAEL,IADA,IAAI1L,EAAM,GACFgH,EAAK1S,WAMT,GALA0S,EAAOA,EACPhH,EAAMsL,EAAWC,EAAWvE,EAAK/T,IAAKqY,GAAY,EAE9CE,IACAxL,IAAQ,GACRA,EAAM,EAGFgH,EADA1c,KAAKkhB,WACExE,EAAKpH,KAGLoH,EAAKnH,UAGf,CAAA,GAAY,IAARG,EAAW,CAEhB1V,KAAKohB,WAAWrf,KAAK2a,GACrB,MAIA1c,KAAKohB,WAAWrf,KAAK2a,GAEjBA,EADA1c,KAAKkhB,WACExE,EAAKnH,MAGLmH,EAAKpH,MA4C5B,OAvCAyL,EAAkB7gB,UAAUmhB,QAAU,WAClC,GAA+B,IAA3BrhB,KAAKohB,WAAWtf,OAChB,OAAO,KACX,IACIwf,EADA5E,EAAO1c,KAAKohB,WAAWvf,MAM3B,GAHIyf,EADAthB,KAAKmhB,iBACInhB,KAAKmhB,iBAAiBzE,EAAK/T,IAAK+T,EAAK9a,QAEnC+G,IAAK+T,EAAK/T,IAAK/G,MAAO8a,EAAK9a,OACtC5B,KAAKkhB,WAEL,IADAxE,EAAOA,EAAKpH,MACJoH,EAAK1S,WACThK,KAAKohB,WAAWrf,KAAK2a,GACrBA,EAAOA,EAAKnH,WAKhB,IADAmH,EAAOA,EAAKnH,OACJmH,EAAK1S,WACThK,KAAKohB,WAAWrf,KAAK2a,GACrBA,EAAOA,EAAKpH,KAGpB,OAAOgM,GAEXP,EAAkB7gB,UAAUqhB,QAAU,WAClC,OAAOvhB,KAAKohB,WAAWtf,OAAS,GAEpCif,EAAkB7gB,UAAUshB,KAAO,WAC/B,GAA+B,IAA3BxhB,KAAKohB,WAAWtf,OAChB,OAAO,KACX,IAAI4a,EAAO1c,KAAKohB,WAAWphB,KAAKohB,WAAWtf,OAAS,GACpD,OAAI9B,KAAKmhB,iBACEnhB,KAAKmhB,iBAAiBzE,EAAK/T,IAAK+T,EAAK9a,QAGnC+G,IAAK+T,EAAK/T,IAAK/G,MAAO8a,EAAK9a,QAGrCmf,KAKPU,GAA0B,WAS1B,SAASA,EAAS9Y,EAAK/G,EAAO8f,EAAOpM,EAAMC,GACvCvV,KAAK2I,IAAMA,EACX3I,KAAK4B,MAAQA,EACb5B,KAAK0hB,MAAiB,MAATA,EAAgBA,EAAQD,EAASE,IAC9C3hB,KAAKsV,KACO,MAARA,EAAeA,EAAOsM,GAAUrD,WACpCve,KAAKuV,MACQ,MAATA,EAAgBA,EAAQqM,GAAUrD,WA+P1C,OAnPAkD,EAASvhB,UAAU2hB,KAAO,SAAUlZ,EAAK/G,EAAO8f,EAAOpM,EAAMC,GACzD,OAAO,IAAIkM,EAAgB,MAAP9Y,EAAcA,EAAM3I,KAAK2I,IAAc,MAAT/G,EAAgBA,EAAQ5B,KAAK4B,MAAgB,MAAT8f,EAAgBA,EAAQ1hB,KAAK0hB,MAAe,MAARpM,EAAeA,EAAOtV,KAAKsV,KAAe,MAATC,EAAgBA,EAAQvV,KAAKuV,QAK5LkM,EAASvhB,UAAU4hB,MAAQ,WACvB,OAAO9hB,KAAKsV,KAAKwM,QAAU,EAAI9hB,KAAKuV,MAAMuM,SAK9CL,EAASvhB,UAAU8J,QAAU,WACzB,OAAO,GAWXyX,EAASvhB,UAAU6hB,iBAAmB,SAAUvC,GAC5C,OAAQxf,KAAKsV,KAAKyM,iBAAiBvC,IAC/BA,EAAOxf,KAAK2I,IAAK3I,KAAK4B,QACtB5B,KAAKuV,MAAMwM,iBAAiBvC,IAUpCiC,EAASvhB,UAAU8hB,iBAAmB,SAAUxC,GAC5C,OAAQxf,KAAKuV,MAAMyM,iBAAiBxC,IAChCA,EAAOxf,KAAK2I,IAAK3I,KAAK4B,QACtB5B,KAAKsV,KAAK0M,iBAAiBxC,IAMnCiC,EAASvhB,UAAU+hB,KAAO,WACtB,OAAIjiB,KAAKsV,KAAKtL,UACHhK,KAGAA,KAAKsV,KAAK2M,QAMzBR,EAASvhB,UAAUgiB,OAAS,WACxB,OAAOliB,KAAKiiB,OAAOtZ,KAKvB8Y,EAASvhB,UAAUiiB,OAAS,WACxB,OAAIniB,KAAKuV,MAAMvL,UACJhK,KAAK2I,IAGL3I,KAAKuV,MAAM4M,UAU1BV,EAASvhB,UAAUkiB,OAAS,SAAUzZ,EAAK/G,EAAOqf,GAC9C,IAAIvL,EAAKpU,EAYT,OARIA,GAFJoU,EAAMuL,EAAWtY,GADjBrH,EAAItB,MACoB2I,MACd,EACFrH,EAAEugB,KAAK,KAAM,KAAM,KAAMvgB,EAAEgU,KAAK8M,OAAOzZ,EAAK/G,EAAOqf,GAAa,MAEvD,IAARvL,EACDpU,EAAEugB,KAAK,KAAMjgB,EAAO,KAAM,KAAM,MAGhCN,EAAEugB,KAAK,KAAM,KAAM,KAAM,KAAMvgB,EAAEiU,MAAM6M,OAAOzZ,EAAK/G,EAAOqf,KAEzDoB,UAMbZ,EAASvhB,UAAUoiB,WAAa,WAC5B,GAAItiB,KAAKsV,KAAKtL,UACV,OAAO4X,GAAUrD,WAErB,IAAIjd,EAAItB,KAIR,OAHKsB,EAAEgU,KAAKiN,UAAajhB,EAAEgU,KAAKA,KAAKiN,WACjCjhB,EAAIA,EAAEkhB,iBACVlhB,EAAIA,EAAEugB,KAAK,KAAM,KAAM,KAAMvgB,EAAEgU,KAAKgN,aAAc,OACzCD,UAObZ,EAASvhB,UAAU+O,OAAS,SAAUtG,EAAKsY,GACvC,IAAI3f,EAAGmhB,EAEP,GAAIxB,EAAWtY,GADfrH,EAAItB,MACkB2I,KAAO,EACpBrH,EAAEgU,KAAKtL,WAAc1I,EAAEgU,KAAKiN,UAAajhB,EAAEgU,KAAKA,KAAKiN,WACtDjhB,EAAIA,EAAEkhB,gBAEVlhB,EAAIA,EAAEugB,KAAK,KAAM,KAAM,KAAMvgB,EAAEgU,KAAKrG,OAAOtG,EAAKsY,GAAa,UAE5D,CAMD,GALI3f,EAAEgU,KAAKiN,WACPjhB,EAAIA,EAAEohB,gBACLphB,EAAEiU,MAAMvL,WAAc1I,EAAEiU,MAAMgN,UAAajhB,EAAEiU,MAAMD,KAAKiN,WACzDjhB,EAAIA,EAAEqhB,iBAEqB,IAA3B1B,EAAWtY,EAAKrH,EAAEqH,KAAY,CAC9B,GAAIrH,EAAEiU,MAAMvL,UACR,OAAO4X,GAAUrD,WAGjBkE,EAAWnhB,EAAEiU,MAAM0M,OACnB3gB,EAAIA,EAAEugB,KAAKY,EAAS9Z,IAAK8Z,EAAS7gB,MAAO,KAAM,KAAMN,EAAEiU,MAAM+M,cAGrEhhB,EAAIA,EAAEugB,KAAK,KAAM,KAAM,KAAM,KAAMvgB,EAAEiU,MAAMtG,OAAOtG,EAAKsY,IAE3D,OAAO3f,EAAE+gB,UAMbZ,EAASvhB,UAAUqiB,OAAS,WACxB,OAAOviB,KAAK0hB,OAMhBD,EAASvhB,UAAUmiB,OAAS,WACxB,IAAI/gB,EAAItB,KAOR,OANIsB,EAAEiU,MAAMgN,WAAajhB,EAAEgU,KAAKiN,WAC5BjhB,EAAIA,EAAEshB,eACNthB,EAAEgU,KAAKiN,UAAYjhB,EAAEgU,KAAKA,KAAKiN,WAC/BjhB,EAAIA,EAAEohB,gBACNphB,EAAEgU,KAAKiN,UAAYjhB,EAAEiU,MAAMgN,WAC3BjhB,EAAIA,EAAEuhB,cACHvhB,GAMXmgB,EAASvhB,UAAUsiB,aAAe,WAC9B,IAAIlhB,EAAItB,KAAK6iB,aAMb,OALIvhB,EAAEiU,MAAMD,KAAKiN,WAGbjhB,GADAA,GADAA,EAAIA,EAAEugB,KAAK,KAAM,KAAM,KAAM,KAAMvgB,EAAEiU,MAAMmN,iBACrCE,eACAC,cAEHvhB,GAMXmgB,EAASvhB,UAAUyiB,cAAgB,WAC/B,IAAIrhB,EAAItB,KAAK6iB,aAKb,OAJIvhB,EAAEgU,KAAKA,KAAKiN,WAEZjhB,GADAA,EAAIA,EAAEohB,gBACAG,cAEHvhB,GAMXmgB,EAASvhB,UAAU0iB,YAAc,WAC7B,IAAIE,EAAK9iB,KAAK6hB,KAAK,KAAM,KAAMJ,EAASE,IAAK,KAAM3hB,KAAKuV,MAAMD,MAC9D,OAAOtV,KAAKuV,MAAMsM,KAAK,KAAM,KAAM7hB,KAAK0hB,MAAOoB,EAAI,OAMvDrB,EAASvhB,UAAUwiB,aAAe,WAC9B,IAAIK,EAAK/iB,KAAK6hB,KAAK,KAAM,KAAMJ,EAASE,IAAK3hB,KAAKsV,KAAKC,MAAO,MAC9D,OAAOvV,KAAKsV,KAAKuM,KAAK,KAAM,KAAM7hB,KAAK0hB,MAAO,KAAMqB,IAMxDtB,EAASvhB,UAAU2iB,WAAa,WAC5B,IAAIvN,EAAOtV,KAAKsV,KAAKuM,KAAK,KAAM,MAAO7hB,KAAKsV,KAAKoM,MAAO,KAAM,MAC1DnM,EAAQvV,KAAKuV,MAAMsM,KAAK,KAAM,MAAO7hB,KAAKuV,MAAMmM,MAAO,KAAM,MACjE,OAAO1hB,KAAK6hB,KAAK,KAAM,MAAO7hB,KAAK0hB,MAAOpM,EAAMC,IAQpDkM,EAASvhB,UAAU8iB,eAAiB,WAChC,IAAIC,EAAajjB,KAAKkjB,SACtB,OAAO5Q,KAAKE,IAAI,EAAKyQ,IAAejjB,KAAK8hB,QAAU,GAMvDL,EAASvhB,UAAUgjB,OAAS,WACxB,IAAID,EACJ,GAAIjjB,KAAKuiB,UAAYviB,KAAKsV,KAAKiN,SAC3B,MAAM,IAAI7f,MAAM,0BAA4B1C,KAAK2I,IAAM,IAAM3I,KAAK4B,MAAQ,KAE9E,GAAI5B,KAAKuV,MAAMgN,SACX,MAAM,IAAI7f,MAAM,mBAAqB1C,KAAK2I,IAAM,IAAM3I,KAAK4B,MAAQ,YAGvE,IADAqhB,EAAajjB,KAAKsV,KAAK4N,YACJljB,KAAKuV,MAAM2N,SAC1B,MAAM,IAAIxgB,MAAM,uBAGhB,OAAOugB,GAAcjjB,KAAKuiB,SAAW,EAAI,IAGjDd,EAASE,KAAM,EACfF,EAAS0B,OAAQ,EACV1B,KAKP2B,GAA+B,WAC/B,SAASA,KA2FT,OApFAA,EAAcljB,UAAU2hB,KAAO,SAAUlZ,EAAK/G,EAAO8f,EAAOpM,EAAMC,GAC9D,OAAOvV,MAUXojB,EAAcljB,UAAUkiB,OAAS,SAAUzZ,EAAK/G,EAAOqf,GACnD,OAAO,IAAIQ,GAAS9Y,EAAK/G,EAAO,OASpCwhB,EAAcljB,UAAU+O,OAAS,SAAUtG,EAAKsY,GAC5C,OAAOjhB,MAKXojB,EAAcljB,UAAU4hB,MAAQ,WAC5B,OAAO,GAKXsB,EAAcljB,UAAU8J,QAAU,WAC9B,OAAO,GAUXoZ,EAAcljB,UAAU6hB,iBAAmB,SAAUvC,GACjD,OAAO,GAUX4D,EAAcljB,UAAU8hB,iBAAmB,SAAUxC,GACjD,OAAO,GAKX4D,EAAcljB,UAAUgiB,OAAS,WAC7B,OAAO,MAKXkB,EAAcljB,UAAUiiB,OAAS,WAC7B,OAAO,MAMXiB,EAAcljB,UAAUgjB,OAAS,WAC7B,OAAO,GAMXE,EAAcljB,UAAUqiB,OAAS,WAC7B,OAAO,GAEJa,KAMPxB,GAA2B,WAM3B,SAASA,EAAUyB,EAAaC,QACd,IAAVA,IAAoBA,EAAQ1B,EAAUrD,YAC1Cve,KAAKqjB,YAAcA,EACnBrjB,KAAKsjB,MAAQA,EAyJjB,OA/IA1B,EAAU1hB,UAAUkiB,OAAS,SAAUzZ,EAAK/G,GACxC,OAAO,IAAIggB,EAAU5hB,KAAKqjB,YAAarjB,KAAKsjB,MACvClB,OAAOzZ,EAAK/G,EAAO5B,KAAKqjB,aACxBxB,KAAK,KAAM,KAAMJ,GAAS0B,MAAO,KAAM,QAQhDvB,EAAU1hB,UAAU+O,OAAS,SAAUtG,GACnC,OAAO,IAAIiZ,EAAU5hB,KAAKqjB,YAAarjB,KAAKsjB,MACvCrU,OAAOtG,EAAK3I,KAAKqjB,aACjBxB,KAAK,KAAM,KAAMJ,GAAS0B,MAAO,KAAM,QAShDvB,EAAU1hB,UAAU8H,IAAM,SAAUW,GAGhC,IAFA,IAAI+M,EACAgH,EAAO1c,KAAKsjB,OACR5G,EAAK1S,WAAW,CAEpB,GAAY,KADZ0L,EAAM1V,KAAKqjB,YAAY1a,EAAK+T,EAAK/T,MAE7B,OAAO+T,EAAK9a,MAEP8T,EAAM,EACXgH,EAAOA,EAAKpH,KAEPI,EAAM,IACXgH,EAAOA,EAAKnH,OAGpB,OAAO,MAOXqM,EAAU1hB,UAAUqjB,kBAAoB,SAAU5a,GAE9C,IADA,IAAI+M,EAAKgH,EAAO1c,KAAKsjB,MAAOE,EAAc,MAClC9G,EAAK1S,WAAW,CAEpB,GAAY,KADZ0L,EAAM1V,KAAKqjB,YAAY1a,EAAK+T,EAAK/T,MAClB,CACX,GAAK+T,EAAKpH,KAAKtL,UAMV,OAAIwZ,EACEA,EAAY7a,IAGZ,KARP,IADA+T,EAAOA,EAAKpH,MACJoH,EAAKnH,MAAMvL,WACf0S,EAAOA,EAAKnH,MAChB,OAAOmH,EAAK/T,IASX+M,EAAM,EACXgH,EAAOA,EAAKpH,KAEPI,EAAM,IACX8N,EAAc9G,EACdA,EAAOA,EAAKnH,OAGpB,MAAM,IAAI7S,MAAM,0EAKpBkf,EAAU1hB,UAAU8J,QAAU,WAC1B,OAAOhK,KAAKsjB,MAAMtZ,WAKtB4X,EAAU1hB,UAAU4hB,MAAQ,WACxB,OAAO9hB,KAAKsjB,MAAMxB,SAKtBF,EAAU1hB,UAAUgiB,OAAS,WACzB,OAAOliB,KAAKsjB,MAAMpB,UAKtBN,EAAU1hB,UAAUiiB,OAAS,WACzB,OAAOniB,KAAKsjB,MAAMnB,UAWtBP,EAAU1hB,UAAU6hB,iBAAmB,SAAUvC,GAC7C,OAAOxf,KAAKsjB,MAAMvB,iBAAiBvC,IAUvCoC,EAAU1hB,UAAU8hB,iBAAmB,SAAUxC,GAC7C,OAAOxf,KAAKsjB,MAAMtB,iBAAiBxC,IAQvCoC,EAAU1hB,UAAUujB,YAAc,SAAUC,GACxC,OAAO,IAAI3C,GAAkB/gB,KAAKsjB,MAAO,KAAMtjB,KAAKqjB,aAAa,EAAOK,IAE5E9B,EAAU1hB,UAAUyjB,gBAAkB,SAAUhb,EAAK+a,GACjD,OAAO,IAAI3C,GAAkB/gB,KAAKsjB,MAAO3a,EAAK3I,KAAKqjB,aAAa,EAAOK,IAE3E9B,EAAU1hB,UAAU0jB,uBAAyB,SAAUjb,EAAK+a,GACxD,OAAO,IAAI3C,GAAkB/gB,KAAKsjB,MAAO3a,EAAK3I,KAAKqjB,aAAa,EAAMK,IAE1E9B,EAAU1hB,UAAU2jB,mBAAqB,SAAUH,GAC/C,OAAO,IAAI3C,GAAkB/gB,KAAKsjB,MAAO,KAAMtjB,KAAKqjB,aAAa,EAAMK,IAM3E9B,EAAUrD,WAAa,IAAI6E,GACpBxB,KAkBPkC,GAAQxR,KAAK3E,IAAI,GAIjBoW,GAA2B,WAI3B,SAASA,EAAUjiB,GACf,IAAyBkiB,EAIzBhkB,KAAK8hB,OAJoBkC,EAIHliB,EAAS,EAHpBkR,SAAUV,KAAK3E,IAAIqW,GAAOF,GAAQ,KAI7C9jB,KAAKikB,SAAWjkB,KAAK8hB,MAAQ,EAC7B,IAHwB1P,EAGpB8R,GAHoB9R,EAGLpS,KAAK8hB,MAHe9O,SAASvT,MAAM2S,EAAO,GAAGzN,KAAK,KAAM,IAI3E3E,KAAKmkB,MAASriB,EAAS,EAAKoiB,EAWhC,OANAH,EAAU7jB,UAAUkkB,aAAe,WAE/B,IAAI9C,IAAWthB,KAAKmkB,MAAS,GAAOnkB,KAAKikB,UAEzC,OADAjkB,KAAKikB,WACE3C,GAEJyC,KAiBPM,GAAgB,SAAUC,EAAW5O,EAAK6O,EAAOC,GACjDF,EAAU5S,KAAKgE,GACf,IAAI+O,EAAoB,SAAUC,EAAK3U,GACnC,IACI4U,EACAhc,EAFA7G,EAASiO,EAAO2U,EAGpB,GAAc,GAAV5iB,EACA,OAAO,KAEN,GAAc,GAAVA,EAGL,OAFA6iB,EAAYL,EAAUI,GACtB/b,EAAM4b,EAAQA,EAAMI,GAAaA,EAC1B,IAAIlD,GAAS9Y,EAAKgc,EAAUjI,KAAM+E,GAAS0B,MAAO,KAAM,MAG/D,IAAIyB,EAAS5R,SAAUlR,EAAS,EAAI,IAAM4iB,EACtCpP,EAAOmP,EAAkBC,EAAKE,GAC9BrP,EAAQkP,EAAkBG,EAAS,EAAG7U,GAG1C,OAFA4U,EAAYL,EAAUM,GACtBjc,EAAM4b,EAAQA,EAAMI,GAAaA,EAC1B,IAAIlD,GAAS9Y,EAAKgc,EAAUjI,KAAM+E,GAAS0B,MAAO7N,EAAMC,IA0CnEsP,EAvCmB,SAAUC,GAuB7B,IAtBA,IAAIpI,EAAO,KACPmI,EAAO,KACPtF,EAAQ+E,EAAUxiB,OAClBijB,EAAe,SAAUC,EAAWtD,GACpC,IAAIgD,EAAMnF,EAAQyF,EACdjV,EAAOwP,EACXA,GAASyF,EACT,IAAIC,EAAYR,EAAkBC,EAAM,EAAG3U,GACvC4U,EAAYL,EAAUI,GACtB/b,EAAM4b,EAAQA,EAAMI,GAAaA,EACrCO,EAAc,IAAIzD,GAAS9Y,EAAKgc,EAAUjI,KAAMgF,EAAO,KAAMuD,KAE7DC,EAAgB,SAAUC,GACtBzI,GACAA,EAAKpH,KAAO6P,EACZzI,EAAOyI,IAGPN,EAAOM,EACPzI,EAAOyI,IAGNriB,EAAI,EAAGA,EAAIgiB,EAAOhD,QAAShf,EAAG,CACnC,IAAIsiB,EAAQN,EAAOV,eAEfY,EAAY1S,KAAKE,IAAI,EAAGsS,EAAOhD,OAAShf,EAAI,IAC5CsiB,EACAL,EAAaC,EAAWvD,GAAS0B,QAIjC4B,EAAaC,EAAWvD,GAAS0B,OACjC4B,EAAaC,EAAWvD,GAASE,MAGzC,OAAOkD,EAGAQ,CADE,IAAItB,GAAUO,EAAUxiB,SAErC,OAAO,IAAI8f,GAAU4C,GAAa9O,EAAKmP,IAmBvCS,MAOAC,GAA0B,WAC1B,SAASA,EAASC,EAAUC,GACxBzlB,KAAKwlB,SAAWA,EAChBxlB,KAAKylB,UAAYA,EA8IrB,OA5IAnmB,OAAOyI,eAAewd,EAAU,WAM5Bvd,IAAK,WAKD,OAJA1F,EAAOgjB,IAAkB5E,GAAgB,uCACzCD,GACIA,IACI,IAAI8E,GAAW3F,YAAa0F,KAAoB1F,YAAac,MAGzEpS,YAAY,EACZC,cAAc,IAOlBgX,EAASrlB,UAAU8H,IAAM,SAAU0d,GAC/B,IAAIC,EAAYhc,EAAQ3J,KAAKwlB,SAAUE,GACvC,IAAKC,EACD,MAAM,IAAIjjB,MAAM,wBAA0BgjB,GAC9C,OAAIC,IAAcL,GAGP,KAGAK,GAOfJ,EAASrlB,UAAU0lB,SAAW,SAAUC,GACpC,OAAOpc,EAASzJ,KAAKylB,UAAWI,EAAgBjd,aAOpD2c,EAASrlB,UAAU4lB,SAAW,SAAUD,EAAiBE,GACrDzjB,EAAOujB,IAAoBlI,GAAW,uEAKtC,IAJA,IAUIqI,EAVA1B,KACA2B,GAAkB,EAClBC,EAAOH,EAAiBtC,YAAYhH,GAAUE,MAC9C3b,EAAOklB,EAAK7E,UACTrgB,GACHilB,EACIA,GAAmBJ,EAAgBtI,YAAYvc,EAAK0b,MACxD4H,EAAUviB,KAAKf,GACfA,EAAOklB,EAAK7E,UAIZ2E,EADAC,EACW5B,GAAcC,EAAWuB,EAAgBhJ,cAGzCyI,GAEf,IAAIa,EAAYN,EAAgBjd,WAC5Bwd,EAActc,EAAM9J,KAAKylB,WAC7BW,EAAYD,GAAaN,EACzB,IAAIQ,EAAavc,EAAM9J,KAAKwlB,UAE5B,OADAa,EAAWF,GAAaH,EACjB,IAAIT,EAASc,EAAYD,IAQpCb,EAASrlB,UAAUomB,aAAe,SAAU3B,EAAWoB,GACnD,IAAItf,EAAQzG,KAkCZ,OAAO,IAAIulB,EAjCMpb,EAAInK,KAAKwlB,SAAU,SAAUe,EAAiBJ,GAC3D,IAAI5G,EAAQ5V,EAAQlD,EAAMgf,UAAWU,GAErC,GADA7jB,EAAOid,EAAO,oCAAsC4G,GAChDI,IAAoBjB,GAAgB,CAEpC,GAAI/F,EAAMhC,YAAYoH,EAAUjI,MAAO,CAKnC,IAHA,IAAI4H,KACA4B,EAAOH,EAAiBtC,YAAYhH,GAAUE,MAC9C3b,EAAOklB,EAAK7E,UACTrgB,GACCA,EAAK8G,MAAQ6c,EAAU7c,MACvBwc,EAAUviB,KAAKf,GAEnBA,EAAOklB,EAAK7E,UAGhB,OADAiD,EAAUviB,KAAK4iB,GACRN,GAAcC,EAAW/E,EAAM1C,cAItC,OAAOyI,GAIX,IAAIkB,EAAeT,EAAiB/d,IAAI2c,EAAU7c,MAC9C2e,EAAcF,EAIlB,OAHIC,IACAC,EAAcA,EAAYxX,OAAO,IAAIwN,GAAUkI,EAAU7c,KAAM0e,KAE5DC,EAAYrE,OAAOuC,EAAWA,EAAUjI,QAGvB1c,KAAKylB,YAQzCF,EAASrlB,UAAUwmB,kBAAoB,SAAU/B,EAAWoB,GAiBxD,OAAO,IAAIR,EAhBMpb,EAAInK,KAAKwlB,SAAU,SAAUe,GAC1C,GAAIA,IAAoBjB,GAEpB,OAAOiB,EAGP,IAAIC,EAAeT,EAAiB/d,IAAI2c,EAAU7c,MAClD,OAAI0e,EACOD,EAAgBtX,OAAO,IAAIwN,GAAUkI,EAAU7c,KAAM0e,IAIrDD,IAIavmB,KAAKylB,YAElCF,KAkBX,SAASoB,GAAqBrR,EAAMC,GAChC,OAAOrE,GAAYoE,EAAKxN,KAAMyN,EAAMzN,MAExC,SAAS8e,GAAgBtR,EAAMC,GAC3B,OAAOrE,GAAYoE,EAAMC,GA4B7B,IAAIsR,GAA8B,WAQ9B,SAASA,EAAaC,EAAWxI,EAAeyI,GAC5C/mB,KAAK8mB,UAAYA,EACjB9mB,KAAKse,cAAgBA,EACrBte,KAAK+mB,UAAYA,EACjB/mB,KAAKwe,UAAY,KAMbxe,KAAKse,eACLN,GAAqBhe,KAAKse,eAE1Bte,KAAK8mB,UAAU9c,WACf1H,GAAQtC,KAAKse,eAAiBte,KAAKse,cAActU,UAAW,wCAuXpE,OApXA1K,OAAOyI,eAAe8e,EAAc,cAChC7e,IAAK,WACD,OAAQuW,KACHA,GAAa,IAAIsI,EAAa,IAAIjF,GAAUgF,IAAkB,KAAMrB,GAASyB,WAEtF1Y,YAAY,EACZC,cAAc,IAGlBsY,EAAa3mB,UAAUge,WAAa,WAChC,OAAO,GAGX2I,EAAa3mB,UAAUie,YAAc,WACjC,OAAOne,KAAKse,eAAiBC,IAGjCsI,EAAa3mB,UAAUue,eAAiB,SAAUC,GAC9C,OAAI1e,KAAK8mB,UAAU9c,UAERhK,KAGA,IAAI6mB,EAAa7mB,KAAK8mB,UAAWpI,EAAiB1e,KAAK+mB,YAItEF,EAAa3mB,UAAUye,kBAAoB,SAAUC,GAEjD,GAAkB,cAAdA,EACA,OAAO5e,KAAKme,cAGZ,IAAItJ,EAAQ7U,KAAK8mB,UAAU9e,IAAI4W,GAC/B,OAAiB,OAAV/J,EAAiB0J,GAAa1J,GAI7CgS,EAAa3mB,UAAU2e,SAAW,SAAU/I,GACxC,IAAIsJ,EAAQtJ,EAAK3B,WACjB,OAAc,OAAViL,EACOpf,KACJA,KAAK2e,kBAAkBS,GAAOP,SAAS/I,EAAKzB,aAGvDwS,EAAa3mB,UAAU4e,SAAW,SAAUF,GACxC,OAAyC,OAAlC5e,KAAK8mB,UAAU9e,IAAI4W,IAG9BiI,EAAa3mB,UAAU+e,qBAAuB,SAAUL,EAAWM,GAE/D,GADA5c,EAAO4c,EAAc,8CACH,cAAdN,EACA,OAAO5e,KAAKye,eAAeS,GAG3B,IAAIyF,EAAY,IAAIlI,GAAUmC,EAAWM,GACrCuH,OAAc,EAAQQ,OAAc,EAUxC,OATI/H,EAAalV,WACbyc,EAAczmB,KAAK8mB,UAAU7X,OAAO2P,GACpCqI,EAAcjnB,KAAK+mB,UAAUL,kBAAkB/B,EAAW3kB,KAAK8mB,aAG/DL,EAAczmB,KAAK8mB,UAAU1E,OAAOxD,EAAWM,GAC/C+H,EAAcjnB,KAAK+mB,UAAUT,aAAa3B,EAAW3kB,KAAK8mB,YAGvD,IAAID,EAAaJ,EADVA,EAAYzc,UAAYuU,GAAave,KAAKse,cACN2I,IAI1DJ,EAAa3mB,UAAUif,YAAc,SAAUrJ,EAAMoJ,GACjD,IAAIE,EAAQtJ,EAAK3B,WACjB,GAAc,OAAViL,EACA,OAAOF,EAGP5c,EAA2B,cAApBwT,EAAK3B,YAAmD,IAArB2B,EAAK1B,YAAmB,8CAClE,IAAI8S,EAAoBlnB,KAAK2e,kBAAkBS,GAAOD,YAAYrJ,EAAKzB,WAAY6K,GACnF,OAAOlf,KAAKif,qBAAqBG,EAAO8H,IAIhDL,EAAa3mB,UAAU8J,QAAU,WAC7B,OAAOhK,KAAK8mB,UAAU9c,WAG1B6c,EAAa3mB,UAAUmf,YAAc,WACjC,OAAOrf,KAAK8mB,UAAUhF,SAG1B+E,EAAa3mB,UAAUmO,IAAM,SAAUoR,GACnC,GAAIzf,KAAKgK,UACL,OAAO,KACX,IAAIN,KACAyd,EAAU,EAAGhF,EAAS,EAAGiF,GAAiB,EAW9C,GAVApnB,KAAKsf,aAAaoB,GAAgB,SAAU/X,EAAKqW,GAC7CtV,EAAIf,GAAOqW,EAAU3Q,IAAIoR,GACzB0H,IACIC,GAAkBP,EAAa1T,gBAAgBhM,KAAKwB,GACpDwZ,EAAS7P,KAAK4D,IAAIiM,EAAQtR,OAAOlI,IAGjCye,GAAiB,KAGpB3H,GAAgB2H,GAAkBjF,EAAS,EAAIgF,EAAS,CAEzD,IAAIE,KACJ,IAAK,IAAI1e,KAAOe,EACZ2d,EAAM1e,GAAOe,EAAIf,GACrB,OAAO0e,EAMP,OAHI5H,IAAiBzf,KAAKme,cAAcnU,YACpCN,EAAI,aAAe1J,KAAKme,cAAc9P,OAEnC3E,GAIfmd,EAAa3mB,UAAU2f,KAAO,WAC1B,GAAuB,OAAnB7f,KAAKwe,UAAoB,CACzB,IAAI8I,EAAW,GACVtnB,KAAKme,cAAcnU,YACpBsd,GACI,YACIvJ,GAAiB/d,KAAKme,cAAc9P,OACpC,KACZrO,KAAKsf,aAAaoB,GAAgB,SAAU/X,EAAKqW,GAC7C,IAAIuI,EAAYvI,EAAUa,OACR,KAAd0H,IACAD,GAAY,IAAM3e,EAAM,IAAM4e,KAEtCvnB,KAAKwe,UAAyB,KAAb8I,EAAkB,GAAKzX,EAAKyX,GAEjD,OAAOtnB,KAAKwe,WAGhBqI,EAAa3mB,UAAU6e,wBAA0B,SAAUH,EAAWI,EAAWO,GAC7E,IAAIiI,EAAMxnB,KAAKynB,cAAclI,GAC7B,GAAIiI,EAAK,CACL,IAAIE,EAAcF,EAAIjE,kBAAkB,IAAI9G,GAAUmC,EAAWI,IACjE,OAAO0I,EAAcA,EAAY5f,KAAO,KAGxC,OAAO9H,KAAK8mB,UAAUvD,kBAAkB3E,IAOhDiI,EAAa3mB,UAAUynB,kBAAoB,SAAU9B,GACjD,IAAI2B,EAAMxnB,KAAKynB,cAAc5B,GAC7B,GAAI2B,EAAK,CACL,IAAItF,EAASsF,EAAItF,SACjB,OAAOA,GAAUA,EAAOpa,KAGxB,OAAO9H,KAAK8mB,UAAU5E,UAO9B2E,EAAa3mB,UAAU0nB,cAAgB,SAAU/B,GAC7C,IAAI3D,EAASliB,KAAK2nB,kBAAkB9B,GACpC,OAAI3D,EACO,IAAIzF,GAAUyF,EAAQliB,KAAK8mB,UAAU9e,IAAIka,IAGzC,MAQf2E,EAAa3mB,UAAU2nB,iBAAmB,SAAUhC,GAChD,IAAI2B,EAAMxnB,KAAKynB,cAAc5B,GAC7B,GAAI2B,EAAK,CACL,IAAIrF,EAASqF,EAAIrF,SACjB,OAAOA,GAAUA,EAAOra,KAGxB,OAAO9H,KAAK8mB,UAAU3E,UAO9B0E,EAAa3mB,UAAU4nB,aAAe,SAAUjC,GAC5C,IAAI1D,EAASniB,KAAK6nB,iBAAiBhC,GACnC,OAAI1D,EACO,IAAI1F,GAAU0F,EAAQniB,KAAK8mB,UAAU9e,IAAIma,IAGzC,MAMf0E,EAAa3mB,UAAUof,aAAe,SAAUC,EAAOC,GACnD,IAAIgI,EAAMxnB,KAAKynB,cAAclI,GAC7B,OAAIiI,EACOA,EAAIzF,iBAAiB,SAAUgG,GAClC,OAAOvI,EAAOuI,EAAYjgB,KAAMigB,EAAYrL,QAIzC1c,KAAK8mB,UAAU/E,iBAAiBvC,IAO/CqH,EAAa3mB,UAAUujB,YAAc,SAAUoC,GAC3C,OAAO7lB,KAAK2jB,gBAAgBkC,EAAgBzI,UAAWyI,IAQ3DgB,EAAa3mB,UAAUyjB,gBAAkB,SAAUqE,EAAWnC,GAC1D,IAAI2B,EAAMxnB,KAAKynB,cAAc5B,GAC7B,GAAI2B,EACA,OAAOA,EAAI7D,gBAAgBqE,EAAW,SAAUrf,GAAO,OAAOA,IAK9D,IAFA,IAAItH,EAAWrB,KAAK8mB,UAAUnD,gBAAgBqE,EAAUlgB,KAAM2U,GAAUE,MACpE3b,EAAOK,EAASmgB,OACL,MAARxgB,GAAgB6kB,EAAgB/I,QAAQ9b,EAAMgnB,GAAa,GAC9D3mB,EAASggB,UACTrgB,EAAOK,EAASmgB,OAEpB,OAAOngB,GAOfwlB,EAAa3mB,UAAU2jB,mBAAqB,SAAUgC,GAClD,OAAO7lB,KAAK4jB,uBAAuBiC,EAAgBrI,UAAWqI,IAOlEgB,EAAa3mB,UAAU0jB,uBAAyB,SAAUqE,EAASpC,GAC/D,IAAI2B,EAAMxnB,KAAKynB,cAAc5B,GAC7B,GAAI2B,EACA,OAAOA,EAAI5D,uBAAuBqE,EAAS,SAAUtf,GACjD,OAAOA,IAMX,IAFA,IAAItH,EAAWrB,KAAK8mB,UAAUlD,uBAAuBqE,EAAQngB,KAAM2U,GAAUE,MACzE3b,EAAOK,EAASmgB,OACL,MAARxgB,GAAgB6kB,EAAgB/I,QAAQ9b,EAAMinB,GAAW,GAC5D5mB,EAASggB,UACTrgB,EAAOK,EAASmgB,OAEpB,OAAOngB,GAMfwlB,EAAa3mB,UAAU6f,UAAY,SAAUnK,GACzC,OAAI5V,KAAKgK,UACD4L,EAAM5L,UACC,GAGC,EAGP4L,EAAMsI,cAAgBtI,EAAM5L,UAC1B,EAEF4L,IAAUsS,IACP,EAID,GAMfrB,EAAa3mB,UAAUqgB,UAAY,SAAUsF,GACzC,GAAIA,IAAoBlI,IACpB3d,KAAK+mB,UAAUnB,SAASC,GACxB,OAAO7lB,KAGP,IAAIinB,EAAcjnB,KAAK+mB,UAAUjB,SAASD,EAAiB7lB,KAAK8mB,WAChE,OAAO,IAAID,EAAa7mB,KAAK8mB,UAAW9mB,KAAKse,cAAe2I,IAMpEJ,EAAa3mB,UAAUsgB,UAAY,SAAUjB,GACzC,OAAOA,IAAU5B,IAAa3d,KAAK+mB,UAAUnB,SAASrG,IAK1DsH,EAAa3mB,UAAUyV,OAAS,SAAUC,GACtC,GAAIA,IAAU5V,KACV,OAAO,EAEN,GAAI4V,EAAMsI,aACX,OAAO,EAGP,IAAIiK,EAAoBvS,EACxB,GAAK5V,KAAKme,cAAcxI,OAAOwS,EAAkBhK,eAG5C,CAAA,GAAIne,KAAK8mB,UAAUhF,UAAYqG,EAAkBrB,UAAUhF,QAAS,CAKrE,IAJA,IAAIsG,EAAWpoB,KAAKyjB,YAAY/C,IAC5B2H,EAAYF,EAAkB1E,YAAY/C,IAC1C4H,EAAcF,EAAS/G,UACvBkH,EAAeF,EAAUhH,UACtBiH,GAAeC,GAAc,CAChC,GAAID,EAAYxgB,OAASygB,EAAazgB,OACjCwgB,EAAY5L,KAAK/G,OAAO4S,EAAa7L,MACtC,OAAO,EAEX4L,EAAcF,EAAS/G,UACvBkH,EAAeF,EAAUhH,UAE7B,OAAuB,OAAhBiH,GAAyC,OAAjBC,EAG/B,OAAO,EAlBP,OAAO,GA8BnB1B,EAAa3mB,UAAUunB,cAAgB,SAAU5B,GAC7C,OAAIA,IAAoBlI,GACb,KAGA3d,KAAK+mB,UAAU/e,IAAI6d,EAAgBjd,aAOlDie,EAAa1T,gBAAkB,iBACxB0T,KAwCPqB,GAAa,IAjCY,SAAUxd,GAEnC,SAAS8d,IACL,OAAO9d,EAAOhJ,KAAK1B,KAAM,IAAI4hB,GAAUgF,IAAkBC,GAAatI,WAAYgH,GAASyB,UAAYhnB,KAuB3G,OAzBAF,EAAU0oB,EAAS9d,GAInB8d,EAAQtoB,UAAU6f,UAAY,SAAUnK,GACpC,OAAIA,IAAU5V,KACH,EAGA,GAGfwoB,EAAQtoB,UAAUyV,OAAS,SAAUC,GAEjC,OAAOA,IAAU5V,MAErBwoB,EAAQtoB,UAAUie,YAAc,WAC5B,OAAOne,MAEXwoB,EAAQtoB,UAAUye,kBAAoB,SAAUC,GAC5C,OAAOiI,GAAatI,YAExBiK,EAAQtoB,UAAU8J,QAAU,WACxB,OAAO,GAEJwe,GACT3B,KAOFvnB,OAAOmpB,iBAAiBhM,IACpBY,KACIzb,MAAO,IAAI6a,GAAUzL,GAAU6V,GAAatI,aAEhDmK,KACI9mB,MAAO,IAAI6a,GAAUxL,GAAUiX,OAMvC5K,GAASxF,aAAe+O,GAAatI,WACrCH,GAASR,0BAA4BiJ,GAjyDjC9O,GAkyDOmQ,GA3+CX,SAAsB7Z,GAClByP,GAAazP,EA2+CjBsa,CAAaT,IAiBb,IAAIU,IAAY,EAQhB,SAASC,GAAeC,EAAMhP,GAE1B,QADiB,IAAbA,IAAuBA,EAAW,MACzB,OAATgP,EACA,OAAOjC,GAAatI,WAaxB,GAXoB,iBAATuK,GAAqB,cAAeA,IAC3ChP,EAAWgP,EAAK,cAEpBxmB,EAAoB,OAAbwX,GACiB,iBAAbA,GACa,iBAAbA,GACc,iBAAbA,GAAyB,QAASA,EAAW,uCAAyCA,GAC9E,iBAATgP,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACrDA,EAAOA,EAAK,WAGI,iBAATA,GAAqB,QAASA,EAErC,OAAO,IAAI1K,GADI0K,EACeD,GAAe/O,IAEjD,GAAMgP,aAAgBrpB,QAAUmpB,GA2B3B,CACD,IAAIG,EAASlC,GAAatI,WACtByK,EAAYF,EAWhB,OAVAlf,EAAQof,EAAW,SAAUrgB,EAAKsgB,GAC9B,GAAIxf,EAASuf,EAAWrgB,IACQ,MAAxBA,EAAIoJ,UAAU,EAAG,GAAY,CAE7B,IAAIiN,EAAY6J,GAAeI,IAC3BjK,EAAUd,cAAiBc,EAAUhV,YACrC+e,EAASA,EAAO9J,qBAAqBtW,EAAKqW,OAInD+J,EAAOtK,eAAeoK,GAAe/O,IAvC5C,IAAIoP,KACAC,GAAyB,EACzBC,EAAiBN,EAYrB,GAXAlf,EAAQwf,EAAgB,SAAUzgB,EAAKkM,GACnC,GAAmB,iBAARlM,GAA4C,MAAxBA,EAAIoJ,UAAU,EAAG,GAAY,CAExD,IAAIiN,EAAY6J,GAAeO,EAAezgB,IACzCqW,EAAUhV,YACXmf,EACIA,IAA2BnK,EAAUb,cAAcnU,UACvDkf,EAAWnnB,KAAK,IAAI0a,GAAU9T,EAAKqW,QAItB,GAArBkK,EAAWpnB,OACX,OAAO+kB,GAAatI,WAExB,IAAI8K,EAAWhF,GAAc6E,EAAYvC,GAAsB,SAAUhC,GAAa,OAAOA,EAAU7c,MAAS8e,IAChH,GAAIuC,EAAwB,CACxB,IAAIG,EAAiBjF,GAAc6E,EAAYxI,GAAe7D,cAC9D,OAAO,IAAIgK,GAAawC,EAAUR,GAAe/O,GAAW,IAAIyL,IAAW3F,YAAa0J,IAAoB1J,YAAac,MAGzH,OAAO,IAAImG,GAAawC,EAAUR,GAAe/O,GAAWyL,GAASyB,UApjDjF,SAAyB3Y,GACrBwP,GAAexP,EAskDnBkb,CAAgBV,IAsBhB,IAwnBIW,GAi1BAC,GA/4CAC,GAAc,IA1Dc,SAAUhf,GAEtC,SAASif,IACL,OAAkB,OAAXjf,GAAmBA,EAAO/C,MAAM3H,KAAM4H,YAAc5H,KAqD/D,OAvDAF,EAAU6pB,EAAYjf,GAOtBif,EAAWzpB,UAAU4c,QAAU,SAAUtR,EAAG7L,GACxC,IAAImhB,EAAWtV,EAAEkR,KAAKqD,UAAUpgB,EAAE+c,MAClC,OAAiB,IAAboE,EACO5P,GAAY1F,EAAE1D,KAAMnI,EAAEmI,MAGtBgZ,GAMf6I,EAAWzpB,UAAUqd,YAAc,SAAUb,GACzC,OAAO,GAKXiN,EAAWzpB,UAAU6c,oBAAsB,SAAUC,EAASC,GAC1D,OAAQD,EAAQrH,OAAOsH,IAK3B0M,EAAWzpB,UAAUkd,QAAU,WAC3B,OAAOX,GAAUY,KAKrBsM,EAAWzpB,UAAUsd,QAAU,WAC3B,OAAOf,GAAUiM,KAOrBiB,EAAWzpB,UAAUud,SAAW,SAAUC,EAAY5V,GAClD,IAAI8hB,EAAYf,GAAenL,GAC/B,OAAO,IAAIjB,GAAU3U,EAAM8hB,IAK/BD,EAAWzpB,UAAU0I,SAAW,WAC5B,MAAO,UAEJ+gB,GACT/M,KAuBEiN,GAA2B,SAAUnf,GAErC,SAASmf,EAAUC,GACf,IAAIrjB,EAAQiE,EAAOhJ,KAAK1B,OAASA,KAGjC,OAFAyG,EAAMqjB,WAAaA,EACnBxnB,GAAQwnB,EAAW9f,WAAuC,cAA1B8f,EAAW3V,WAA4B,2DAChE1N,EAmDX,OAxDA3G,EAAU+pB,EAAWnf,GAYrBmf,EAAU3pB,UAAU6pB,aAAe,SAAUC,GACzC,OAAOA,EAAKnL,SAAS7e,KAAK8pB,aAK9BD,EAAU3pB,UAAUqd,YAAc,SAAUb,GACxC,OAAQA,EAAKmC,SAAS7e,KAAK8pB,YAAY9f,WAK3C6f,EAAU3pB,UAAU4c,QAAU,SAAUtR,EAAG7L,GACvC,IAAIsqB,EAASjqB,KAAK+pB,aAAave,EAAEkR,MAC7BwN,EAASlqB,KAAK+pB,aAAapqB,EAAE+c,MAC7BoE,EAAWmJ,EAAOlK,UAAUmK,GAChC,OAAiB,IAAbpJ,EACO5P,GAAY1F,EAAE1D,KAAMnI,EAAEmI,MAGtBgZ,GAMf+I,EAAU3pB,UAAUud,SAAW,SAAUC,EAAY5V,GACjD,IAAI8hB,EAAYf,GAAenL,GAC3BhB,EAAOmK,GAAatI,WAAWY,YAAYnf,KAAK8pB,WAAYF,GAChE,OAAO,IAAInN,GAAU3U,EAAM4U,IAK/BmN,EAAU3pB,UAAUsd,QAAU,WAC1B,IAAId,EAAOmK,GAAatI,WAAWY,YAAYnf,KAAK8pB,WAAY5B,IAChE,OAAO,IAAIzL,GAAUxL,GAAUyL,IAKnCmN,EAAU3pB,UAAU0I,SAAW,WAC3B,OAAO5I,KAAK8pB,WAAWjhB,QAAQlE,KAAK,MAEjCklB,GACTjN,IAqBEuN,GAA8B,WAM9B,SAASA,EAAaC,EAAOC,EAAMC,GAC/BtqB,KAAKoqB,MAAQA,EACbpqB,KAAKqqB,KAAOA,EACZrqB,KAAKsqB,OAASA,EAsIlB,OA9HAH,EAAajqB,UAAUmO,IAAM,WAEzB,OADArC,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QAC9C9B,KAAKoqB,MAAM/b,OAOtB8b,EAAajqB,UAAUqqB,UAAY,WAE/B,OADAve,EAAiB,yBAA0B,EAAG,EAAGpE,UAAU9F,QACpD9B,KAAKoqB,MAAM/b,KAAI,IAI1B8b,EAAajqB,UAAU+b,OAAS,WAG5B,OADAjQ,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU9F,QACjD9B,KAAKuqB,aAOhBJ,EAAajqB,UAAUsqB,OAAS,WAE5B,OADAxe,EAAiB,sBAAuB,EAAG,EAAGpE,UAAU9F,SAChD9B,KAAKoqB,MAAMpgB,WAQvBmgB,EAAajqB,UAAU2U,MAAQ,SAAU4V,GACrCze,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU9F,QAEvD2oB,EAAkBvlB,OAAOulB,GACzB3P,GAAmB,qBAAsB,EAAG2P,GAAiB,GAC7D,IAAIC,EAAY,IAAI7W,GAAK4W,GACrBE,EAAW3qB,KAAKqqB,KAAKxV,MAAM6V,GAC/B,OAAO,IAAIP,EAAanqB,KAAKoqB,MAAMvL,SAAS6L,GAAYC,EAAUjK,KAQtEyJ,EAAajqB,UAAU4e,SAAW,SAAU2L,GACxCze,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU9F,QAC1DgZ,GAAmB,wBAAyB,EAAG2P,GAAiB,GAChE,IAAIC,EAAY,IAAI7W,GAAK4W,GACzB,OAAQzqB,KAAKoqB,MAAMvL,SAAS6L,GAAW1gB,WAO3CmgB,EAAajqB,UAAUie,YAAc,WAGjC,OAFAnS,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU9F,QAEtD9B,KAAKoqB,MAAMjM,cAAc9P,OAUpC8b,EAAajqB,UAAU0J,QAAU,SAAU4V,GACvC,IAAI/Y,EAAQzG,KAGZ,OAFAgM,EAAiB,uBAAwB,EAAG,EAAGpE,UAAU9F,QACzD4K,EAAiB,uBAAwB,EAAG8S,GAAQ,IAChDxf,KAAKoqB,MAAMlM,gBAEIle,KAAKoqB,MAEF9K,aAAatf,KAAKsqB,OAAQ,SAAU3hB,EAAK+T,GAC3D,OAAO8C,EAAO,IAAI2K,EAAazN,EAAMjW,EAAM4jB,KAAKxV,MAAMlM,GAAM+X,QAOpEyJ,EAAajqB,UAAU0qB,YAAc,WAEjC,OADA5e,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU9F,SACzD9B,KAAKoqB,MAAMlM,eAGHle,KAAKoqB,MAAMpgB,WAE3B1K,OAAOyI,eAAeoiB,EAAajqB,UAAW,OAC1C8H,IAAK,WACD,OAAOhI,KAAKqqB,KAAKQ,UAErBvc,YAAY,EACZC,cAAc,IAMlB4b,EAAajqB,UAAUmf,YAAc,WAEjC,OADArT,EAAiB,2BAA4B,EAAG,EAAGpE,UAAU9F,QACtD9B,KAAKoqB,MAAM/K,eAKtB8K,EAAajqB,UAAU4qB,OAAS,WAE5B,OADA9e,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QAC9C9B,KAAKqqB,MAEhB/qB,OAAOyI,eAAeoiB,EAAajqB,UAAW,OAC1C8H,IAAK,WACD,OAAOhI,KAAK8qB,UAEhBxc,YAAY,EACZC,cAAc,IAEX4b,KAsBPY,GAA2B,WAO3B,SAASA,EAAUnQ,EAAWoQ,EAAmBhP,EAAUiP,GACvDjrB,KAAK4a,UAAYA,EACjB5a,KAAKgrB,kBAAoBA,EACzBhrB,KAAKgc,SAAWA,EAChBhc,KAAKirB,SAAWA,EAoCpB,OA/BAF,EAAU7qB,UAAUgrB,QAAU,WAC1B,IAAIC,EAAMnrB,KAAKgc,SAAS8O,SACxB,MAAuB,UAAnB9qB,KAAK4a,UACEuQ,EAAIrV,KAGJqV,EAAIC,YAAYtV,MAM/BiV,EAAU7qB,UAAUmrB,aAAe,WAC/B,OAAOrrB,KAAK4a,WAKhBmQ,EAAU7qB,UAAUorB,eAAiB,WACjC,OAAOtrB,KAAKgrB,kBAAkBM,eAAetrB,OAKjD+qB,EAAU7qB,UAAU0I,SAAW,WAC3B,OAAQ5I,KAAKkrB,UAAUtiB,WACnB,IACA5I,KAAK4a,UACL,IACA3R,EAAUjJ,KAAKgc,SAASuO,cAEzBQ,KAEPQ,GAA6B,WAM7B,SAASA,EAAYP,EAAmBllB,EAAOgQ,GAC3C9V,KAAKgrB,kBAAoBA,EACzBhrB,KAAK8F,MAAQA,EACb9F,KAAK8V,KAAOA,EA0BhB,OArBAyV,EAAYrrB,UAAUgrB,QAAU,WAC5B,OAAOlrB,KAAK8V,MAKhByV,EAAYrrB,UAAUmrB,aAAe,WACjC,MAAO,UAKXE,EAAYrrB,UAAUorB,eAAiB,WACnC,OAAOtrB,KAAKgrB,kBAAkBM,eAAetrB,OAKjDurB,EAAYrrB,UAAU0I,SAAW,WAC7B,OAAO5I,KAAK8V,KAAKlN,WAAa,WAE3B2iB,KAqBPC,GAAwC,WAMxC,SAASA,EAAuBC,EAAWC,EAAiBC,GACxD3rB,KAAKyrB,UAAYA,EACjBzrB,KAAK0rB,gBAAkBA,EACvB1rB,KAAK2rB,SAAWA,EAmEpB,OA9DAH,EAAuBtrB,UAAU0rB,WAAa,SAAUhR,GACpD,MAAqB,UAAdA,GAKX4Q,EAAuBtrB,UAAU2rB,YAAc,SAAUC,EAAQC,GAC7D,IAAIxM,EAAQwM,EAAMC,iBAAiBC,WACnC,OAAO,IAAIlB,GAAU,QAAS/qB,KAAM,IAAImqB,GAAa2B,EAAOI,aAAcH,EAAMjB,SAAUvL,KAK9FiM,EAAuBtrB,UAAUorB,eAAiB,SAAUa,GACxD,IAAIC,EAAMpsB,KAAK2rB,SACf,GAAiC,WAA7BQ,EAAUd,eAA6B,CACvC/oB,EAAOtC,KAAK0rB,gBAAiB,gEAC7B,IAAIW,EAAarsB,KAAK0rB,gBACtB,OAAO,WAEHW,EAAW3qB,KAAK0qB,EAAKD,EAAUrmB,QAInC,IAAIwmB,EAAOtsB,KAAKyrB,UAChB,OAAO,WACHa,EAAK5qB,KAAK0qB,EAAKD,EAAUnQ,YAOrCwP,EAAuBtrB,UAAUqsB,kBAAoB,SAAUzmB,EAAOgQ,GAClE,OAAI9V,KAAK0rB,gBACE,IAAIH,GAAYvrB,KAAM8F,EAAOgQ,GAG7B,MAMf0V,EAAuBtrB,UAAUssB,QAAU,SAAU5W,GACjD,OAAMA,aAAiB4V,KAGb5V,EAAM6V,YAAczrB,KAAKyrB,WAKvB7V,EAAM6V,YAAczrB,KAAKyrB,WAAa7V,EAAM+V,WAAa3rB,KAAK2rB,WAM9EH,EAAuBtrB,UAAUusB,eAAiB,WAC9C,OAA0B,OAAnBzsB,KAAKyrB,WAETD,KAWPkB,GAAwC,WAMxC,SAASA,EAAuBC,EAAYjB,EAAiBC,GACzD3rB,KAAK2sB,WAAaA,EAClB3sB,KAAK0rB,gBAAkBA,EACvB1rB,KAAK2rB,SAAWA,EAyFpB,OApFAe,EAAuBxsB,UAAU0rB,WAAa,SAAUhR,GACpD,IAAIgS,EAA6B,mBAAdhS,EAAiC,cAAgBA,EAGpE,OAFAgS,EACqB,qBAAjBA,EAAsC,gBAAkBA,EACrDnjB,EAASzJ,KAAK2sB,WAAYC,IAKrCF,EAAuBxsB,UAAUqsB,kBAAoB,SAAUzmB,EAAOgQ,GAClE,OAAI9V,KAAK0rB,gBACE,IAAIH,GAAYvrB,KAAM8F,EAAOgQ,GAG7B,MAMf4W,EAAuBxsB,UAAU2rB,YAAc,SAAUC,EAAQC,GAC7DzpB,EAA2B,MAApBwpB,EAAOlN,UAAmB,yCACjC,IAAIuM,EAAMY,EAAMjB,SAASjW,MAA8BiX,EAAgB,WACnEvM,EAAQwM,EAAMC,iBAAiBC,WACnC,OAAO,IAAIlB,GAAUe,EAAOrU,KAAMzX,KAAM,IAAImqB,GAAa2B,EAAOI,aAAcf,EAAK5L,GAAQuM,EAAOb,WAKtGyB,EAAuBxsB,UAAUorB,eAAiB,SAAUa,GACxD,IAAIC,EAAMpsB,KAAK2rB,SACf,GAAiC,WAA7BQ,EAAUd,eAA6B,CACvC/oB,EAAOtC,KAAK0rB,gBAAiB,gEAC7B,IAAImB,EAAa7sB,KAAK0rB,gBACtB,OAAO,WAEHmB,EAAWnrB,KAAK0qB,EAAKD,EAAUrmB,QAInC,IAAIgnB,EAAO9sB,KAAK2sB,WAAWR,EAAUvR,WACrC,OAAO,WACHkS,EAAKprB,KAAK0qB,EAAKD,EAAUnQ,SAAUmQ,EAAUlB,YAOzDyB,EAAuBxsB,UAAUssB,QAAU,SAAU5W,GACjD,GAAIA,aAAiB8W,EAAwB,CACzC,IAAK1sB,KAAK2sB,aAAe/W,EAAM+W,WAC3B,OAAO,EAEN,GAAI3sB,KAAK2rB,WAAa/V,EAAM+V,SAAU,CACvC,IAAIoB,EAAa9iB,EAAS2L,EAAM+W,YAEhC,GAAII,IADY9iB,EAASjK,KAAK2sB,YACA,CAI1B,GAAmB,IAAfI,EAAkB,CAClB,IAAIC,EAAkCxiB,EAAUoL,EAAM+W,YAClDM,EAAiCziB,EAAUxK,KAAK2sB,YACpD,QAAQM,IAAYD,GACdpX,EAAM+W,WAAWK,IACdhtB,KAAK2sB,WAAWM,IACjBrX,EAAM+W,WAAWK,KAAchtB,KAAK2sB,WAAWM,IAIvD,OFllHZ,SAAUvjB,EAAKG,GACvB,IAAK,IAAIlB,KAAOe,EACZ,GAAIpK,OAAOY,UAAUL,eAAe6B,KAAKgI,EAAKf,KACrCkB,EAAGlB,EAAKe,EAAIf,IACb,OAAO,EAInB,OAAO,EE0kHoBukB,CAAMltB,KAAK2sB,WAAY,SAAU/R,EAAWuS,GAAM,OAAOvX,EAAM+W,WAAW/R,KAAeuS,MAKhH,OAAO,GAKXT,EAAuBxsB,UAAUusB,eAAiB,WAC9C,OAA2B,OAApBzsB,KAAK2sB,YAETD,KAyBPU,GAAuB,WACvB,SAASA,EAAMC,EAAMvX,EAAMwX,EAAcC,GACrCvtB,KAAKqtB,KAAOA,EACZrtB,KAAK8V,KAAOA,EACZ9V,KAAKstB,aAAeA,EACpBttB,KAAKutB,eAAiBA,EA6c1B,OA3cAjuB,OAAOyI,eAAeqlB,EAAO,0BACzBplB,IAAK,WAED,OADA1F,EAAOknB,GAAwB,oCACxBA,IAEXpb,IAAK,SAAUC,GACXmb,GAAyBnb,GAE7BC,YAAY,EACZC,cAAc,IAOlB6e,EAAMI,wBAA0B,SAAU9V,GACtC,IAAI+V,EAAY,KACZC,EAAU,KAOd,GANIhW,EAAOiW,aACPF,EAAY/V,EAAOkW,sBAEnBlW,EAAOmW,WACPH,EAAUhW,EAAOoW,oBAEjBpW,EAAOuU,aAAetO,GAAW,CACjC,IAAIoQ,EAAmB,mGAEnBC,EAAoB,wGAExB,GAAItW,EAAOiW,WAAY,CAEnB,GADgBjW,EAAOuW,qBACNjd,GACb,MAAM,IAAItO,MAAMqrB,GAEf,GAAyB,iBAAdN,EACZ,MAAM,IAAI/qB,MAAMsrB,GAGxB,GAAItW,EAAOmW,SAAU,CAEjB,GADcnW,EAAOwW,mBACNjd,GACX,MAAM,IAAIvO,MAAMqrB,GAEf,GAAuB,iBAAZL,EACZ,MAAM,IAAIhrB,MAAMsrB,SAIvB,GAAItW,EAAOuU,aAAevL,IAC3B,GAAkB,MAAb+M,IAAsB5T,GAAgB4T,IAC3B,MAAXC,IAAoB7T,GAAgB6T,GACrC,MAAM,IAAIhrB,MAAM,sKAOpB,GAFAJ,EAAOoV,EAAOuU,qBAAsBpC,IAChCnS,EAAOuU,aAAevC,GAAa,uBACrB,MAAb+D,GAA0C,iBAAdA,GACjB,MAAXC,GAAsC,iBAAZA,EAC3B,MAAM,IAAIhrB,MAAM,0FAU5B0qB,EAAMe,eAAiB,SAAUzW,GAC7B,GAAIA,EAAOiW,YACPjW,EAAOmW,UACPnW,EAAO0W,aACN1W,EAAO2W,mBACR,MAAM,IAAI3rB,MAAM,uGAQxB0qB,EAAMltB,UAAUouB,+BAAiC,SAAUriB,GACvD,IAA4B,IAAxBjM,KAAKutB,eACL,MAAM,IAAI7qB,MAAMuJ,EAAS,gDAMjCmhB,EAAMltB,UAAU8rB,eAAiB,WAC7B,OAAOhsB,KAAKstB,cAKhBF,EAAMltB,UAAU4qB,OAAS,WAKrB,OAJA9e,EAAiB,YAAa,EAAG,EAAGpE,UAAU9F,QAIvC,IAAIsrB,EAAM5D,uBAAuBxpB,KAAKqtB,KAAMrtB,KAAK8V,OAS5DsX,EAAMltB,UAAUquB,GAAK,SAAU3T,EAAW7T,EAAUynB,EAAyB5hB,GACzEZ,EAAiB,WAAY,EAAG,EAAGpE,UAAU9F,QAC7C6Y,GAAkB,WAAY,EAAGC,GAAW,GAC5ClO,EAAiB,WAAY,EAAG3F,GAAU,GAC1C,IAAI0nB,EAAMrB,EAAMsB,yBAAyB,WAAYF,EAAyB5hB,GAC9E,GAAkB,UAAdgO,EACA5a,KAAK2uB,aAAa5nB,EAAU0nB,EAAIrT,OAAQqT,EAAI7hB,aAE3C,CACD,IAAIgiB,KACJA,EAAUhU,GAAa7T,EACvB/G,KAAK6uB,aAAaD,EAAWH,EAAIrT,OAAQqT,EAAI7hB,SAEjD,OAAO7F,GAQXqmB,EAAMltB,UAAUyuB,aAAe,SAAU5nB,EAAU+nB,EAAgBliB,GAC/D,IAAImiB,EAAY,IAAIvD,GAAuBzkB,EAAU+nB,GAAkB,KAAMliB,GAAW,MACxF5M,KAAKqtB,KAAK2B,yBAAyBhvB,KAAM+uB,IAQ7C3B,EAAMltB,UAAU2uB,aAAe,SAAUD,EAAWE,EAAgBliB,GAChE,IAAImiB,EAAY,IAAIrC,GAAuBkC,EAAWE,EAAgBliB,GACtE5M,KAAKqtB,KAAK2B,yBAAyBhvB,KAAM+uB,IAO7C3B,EAAMltB,UAAU+uB,IAAM,SAAUrU,EAAW7T,EAAU6F,GACjDZ,EAAiB,YAAa,EAAG,EAAGpE,UAAU9F,QAC9C6Y,GAAkB,YAAa,EAAGC,GAAW,GAC7ClO,EAAiB,YAAa,EAAG3F,GAAU,GAC3C4F,EAAsB,YAAa,EAAGC,GAAS,GAC/C,IAAImiB,EAAY,KACZH,EAAY,KACE,UAAdhU,EAEAmU,EAAY,IAAIvD,GADIzkB,GAAY,KACsB,KAAM6F,GAAW,MAElEgO,IACD7T,KACA6nB,MACUhU,GAAa7T,GAE3BgoB,EAAY,IAAIrC,GAAuBkC,EAAW,KAAMhiB,GAAW,OAEvE5M,KAAKqtB,KAAK6B,4BAA4BlvB,KAAM+uB,IAUhD3B,EAAMltB,UAAUivB,KAAO,SAAUvU,EAAWwU,EAAcC,EAAiBziB,GACvE,IAAInG,EAAQzG,KACZgM,EAAiB,aAAc,EAAG,EAAGpE,UAAU9F,QAC/C6Y,GAAkB,aAAc,EAAGC,GAAW,GAC9ClO,EAAiB,aAAc,EAAG0iB,GAAc,GAChD,IAAIX,EAAMrB,EAAMsB,yBAAyB,aAAcW,EAAiBziB,GAKpE0iB,GAAY,EACZhU,EAAW,IAAI9U,EAEnB8U,EAAS5U,QAAQM,MAAM,cACvB,IAAIuoB,EAAe,SAAUvT,GAGrBsT,IACAA,GAAY,EACZ7oB,EAAMwoB,IAAIrU,EAAW2U,GACjBH,GACAA,EAAa5e,KAAKie,EAAI7hB,QAAtBwiB,CAA+BpT,GAEnCV,EAAS1U,QAAQoV,KAUzB,OAPAhc,KAAKuuB,GAAG3T,EAAW2U,EACP,SAAU1nB,GAClBpB,EAAMwoB,IAAIrU,EAAW2U,GACjBd,EAAIrT,QACJqT,EAAIrT,OAAO5K,KAAKie,EAAI7hB,QAApB6hB,CAA6B5mB,GACjCyT,EAASzU,OAAOgB,KAEbyT,EAAS5U,SAOpB0mB,EAAMltB,UAAUsvB,aAAe,SAAUC,GAErC,GADAzjB,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU9F,QAClC,iBAAV2tB,GACPnd,KAAKI,MAAM+c,KAAWA,GACtBA,GAAS,EACT,MAAM,IAAI/sB,MAAM,kEAEpB,GAAI1C,KAAKstB,aAAac,WAClB,MAAM,IAAI1rB,MAAM,uGAGpB,OAAO,IAAI0qB,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM9V,KAAKstB,aAAakC,aAAaC,GAAQzvB,KAAKutB,iBAOvFH,EAAMltB,UAAUwvB,YAAc,SAAUD,GAEpC,GADAzjB,EAAiB,oBAAqB,EAAG,EAAGpE,UAAU9F,QACjC,iBAAV2tB,GACPnd,KAAKI,MAAM+c,KAAWA,GACtBA,GAAS,EACT,MAAM,IAAI/sB,MAAM,iEAEpB,GAAI1C,KAAKstB,aAAac,WAClB,MAAM,IAAI1rB,MAAM,sGAGpB,OAAO,IAAI0qB,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM9V,KAAKstB,aAAaoC,YAAYD,GAAQzvB,KAAKutB,iBAOtFH,EAAMltB,UAAUyvB,aAAe,SAAU7Z,GAErC,GADA9J,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU9F,QAC1C,SAATgU,EACA,MAAM,IAAIpT,MAAM,2EAEf,GAAa,cAAToT,EACL,MAAM,IAAIpT,MAAM,qFAEf,GAAa,WAAToT,EACL,MAAM,IAAIpT,MAAM,+EAEpBoY,GAAmB,qBAAsB,EAAGhF,GAAM,GAClD9V,KAAKsuB,+BAA+B,sBACpC,IAAIsB,EAAa,IAAI/b,GAAKiC,GAC1B,GAAI8Z,EAAW5lB,UACX,MAAM,IAAItH,MAAM,qFAEpB,IAAI6c,EAAQ,IAAIsK,GAAU+F,GACtBC,EAAY7vB,KAAKstB,aAAawC,QAAQvQ,GAE1C,OADA6N,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM+Z,GAA8B,IAMzEzC,EAAMltB,UAAU6vB,WAAa,WACzB/jB,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QACrD9B,KAAKsuB,+BAA+B,oBACpC,IAAIuB,EAAY7vB,KAAKstB,aAAawC,QAAQnS,IAE1C,OADAyP,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM+Z,GAA8B,IAMzEzC,EAAMltB,UAAU8vB,gBAAkB,WAC9BhkB,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU9F,QAC1D9B,KAAKsuB,+BAA+B,yBACpC,IAAIuB,EAAY7vB,KAAKstB,aAAawC,QAAQpP,IAE1C,OADA0M,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM+Z,GAA8B,IAMzEzC,EAAMltB,UAAU+vB,aAAe,WAC3BjkB,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU9F,QACvD9B,KAAKsuB,+BAA+B,sBACpC,IAAIuB,EAAY7vB,KAAKstB,aAAawC,QAAQpG,IAE1C,OADA0D,EAAMI,wBAAwBqC,GACvB,IAAIzC,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM+Z,GAA8B,IAOzEzC,EAAMltB,UAAUgwB,QAAU,SAAUtuB,EAAOkG,QACzB,IAAVlG,IAAoBA,EAAQ,MAChCoK,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU9F,QAClDiY,GAAwB,gBAAiB,EAAGnY,EAAO5B,KAAK8V,MAAM,GAC9D+E,GAAY,gBAAiB,EAAG/S,GAAM,GACtC,IAAI+nB,EAAY7vB,KAAKstB,aAAa4C,QAAQtuB,EAAOkG,GAGjD,GAFAslB,EAAMe,eAAe0B,GACrBzC,EAAMI,wBAAwBqC,GAC1B7vB,KAAKstB,aAAaK,WAClB,MAAM,IAAIjrB,MAAM,0FAQpB,YAJc4D,IAAV1E,IACAA,EAAQ,KACRkG,EAAO,MAEJ,IAAIslB,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM+Z,EAAW7vB,KAAKutB,iBAO3DH,EAAMltB,UAAUiwB,MAAQ,SAAUvuB,EAAOkG,QACvB,IAAVlG,IAAoBA,EAAQ,MAChCoK,EAAiB,cAAe,EAAG,EAAGpE,UAAU9F,QAChDiY,GAAwB,cAAe,EAAGnY,EAAO5B,KAAK8V,MAAM,GAC5D+E,GAAY,cAAe,EAAG/S,GAAM,GACpC,IAAI+nB,EAAY7vB,KAAKstB,aAAa6C,MAAMvuB,EAAOkG,GAG/C,GAFAslB,EAAMe,eAAe0B,GACrBzC,EAAMI,wBAAwBqC,GAC1B7vB,KAAKstB,aAAaO,SAClB,MAAM,IAAInrB,MAAM,oFAGpB,OAAO,IAAI0qB,EAAMptB,KAAKqtB,KAAMrtB,KAAK8V,KAAM+Z,EAAW7vB,KAAKutB,iBAS3DH,EAAMltB,UAAUkwB,QAAU,SAAUxuB,EAAOkG,GAIvC,GAHAkE,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU9F,QAClDiY,GAAwB,gBAAiB,EAAGnY,EAAO5B,KAAK8V,MAAM,GAC9D+E,GAAY,gBAAiB,EAAG/S,GAAM,GAClC9H,KAAKstB,aAAaK,WAClB,MAAM,IAAIjrB,MAAM,0FAGpB,GAAI1C,KAAKstB,aAAaO,SAClB,MAAM,IAAInrB,MAAM,sFAGpB,OAAO1C,KAAKkwB,QAAQtuB,EAAOkG,GAAMqoB,MAAMvuB,EAAOkG,IAKlDslB,EAAMltB,UAAU0I,SAAW,WAEvB,OADAoD,EAAiB,iBAAkB,EAAG,EAAGpE,UAAU9F,QAC5C9B,KAAKqtB,KAAKzkB,WAAa5I,KAAK8V,KAAKtB,sBAI5C4Y,EAAMltB,UAAU+b,OAAS,WAGrB,OADAjQ,EAAiB,eAAgB,EAAG,EAAGpE,UAAU9F,QAC1C9B,KAAK4I,YAMhBwkB,EAAMltB,UAAUmwB,YAAc,WAC1B,OAAOrwB,KAAKstB,aAAagD,kBAK7BlD,EAAMltB,UAAUqwB,gBAAkB,WAC9B,IAAI7mB,EAAM1J,KAAKqwB,cACXzgB,EAAK4B,GAAkB9H,GAC3B,MAAc,OAAPkG,EAAc,UAAYA,GAOrCwd,EAAMltB,UAAUswB,QAAU,SAAU5a,GAEhC,GADA5J,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU9F,UAC5C8T,aAAiBwX,GAAQ,CAE3B,MAAM,IAAI1qB,MADK,wFAGnB,IAAI+tB,EAAWzwB,KAAKqtB,OAASzX,EAAMyX,KAC/BqD,EAAW1wB,KAAK8V,KAAKH,OAAOC,EAAME,MAClC6a,EAAsB3wB,KAAKuwB,oBAAsB3a,EAAM2a,kBAC3D,OAAOE,GAAYC,GAAYC,GAUnCvD,EAAMsB,yBAA2B,SAAUziB,EAAQojB,EAAiBziB,GAChE,IAAI6hB,GAAQrT,OAAQ,KAAMxO,QAAS,MACnC,GAAIyiB,GAAmBziB,EACnB6hB,EAAIrT,OAASiU,EACb3iB,EAAiBT,EAAQ,EAAGwiB,EAAIrT,QAAQ,GACxCqT,EAAI7hB,QAAUA,EACdD,EAAsBV,EAAQ,EAAGwiB,EAAI7hB,SAAS,QAE7C,GAAIyiB,EAEL,GAA+B,iBAApBA,GAAoD,OAApBA,EAEvCZ,EAAI7hB,QAAUyiB,MAEb,CAAA,GAA+B,mBAApBA,EAIZ,MAAM,IAAI3sB,MAAM4J,EAAYL,EAAQ,GAAG,GACnC,0DAJJwiB,EAAIrT,OAASiU,EAOrB,OAAOZ,GAEXnvB,OAAOyI,eAAeqlB,EAAMltB,UAAW,OACnC8H,IAAK,WACD,OAAOhI,KAAK8qB,UAEhBxc,YAAY,EACZC,cAAc,IAEX6e,KAuBPwD,GAA4B,WAC5B,SAASA,IACL5wB,KAAKoO,OAkET,OA5DAwiB,EAAW1wB,UAAU2wB,IAAM,SAAUC,EAAMziB,GACvCrO,KAAKoO,IAAI0iB,GAAgB,OAARziB,GAAeA,GAMpCuiB,EAAW1wB,UAAUuJ,SAAW,SAAUd,GACtC,OAAOc,EAASzJ,KAAKoO,IAAKzF,IAM9BioB,EAAW1wB,UAAU8H,IAAM,SAAU8oB,GACjC,OAAO9wB,KAAKyJ,SAASqnB,GAAQ9wB,KAAKoO,IAAI0iB,QAAQxqB,GAKlDsqB,EAAW1wB,UAAU+O,OAAS,SAAU6hB,UAC7B9wB,KAAKoO,IAAI0iB,IAKpBF,EAAW1wB,UAAU6wB,MAAQ,WACzB/wB,KAAKoO,QAMTwiB,EAAW1wB,UAAU8J,QAAU,WAC3B,OAAOA,EAAQhK,KAAKoO,MAKxBwiB,EAAW1wB,UAAU4hB,MAAQ,WACzB,OAAO7X,EAASjK,KAAKoO,MAMzBwiB,EAAW1wB,UAAU8R,KAAO,SAAUnI,GAClCD,EAAQ5J,KAAKoO,IAAK,SAAU7C,EAAGhK,GAAK,OAAOsI,EAAG0B,EAAGhK,MAMrDqvB,EAAW1wB,UAAUuR,KAAO,WACxB,IAAIA,KAIJ,OAHA7H,EAAQ5J,KAAKoO,IAAK,SAAU7C,GACxBkG,EAAK1P,KAAKwJ,KAEPkG,GAEJmf,KAuBPI,GAAoC,WACpC,SAASA,IAKLhxB,KAAKqe,OAAS,KAKdre,KAAK8mB,UAAY,KAuIrB,OA/HAkK,EAAmB9wB,UAAU+wB,KAAO,SAAUnb,GAC1C,GAAmB,MAAf9V,KAAKqe,OACL,OAAOre,KAAKqe,OAAOQ,SAAS/I,GAE3B,GAAKA,EAAK9L,WAA+B,MAAlBhK,KAAK8mB,UAY7B,OAAO,KAXP,IAAIoK,EAAWpb,EAAK3B,WAEpB,OADA2B,EAAOA,EAAKzB,WACRrU,KAAK8mB,UAAUrd,SAASynB,GACRlxB,KAAK8mB,UAAU9e,IAAIkpB,GAClBD,KAAKnb,GAGf,MAcnBkb,EAAmB9wB,UAAUixB,SAAW,SAAUrb,EAAMxN,GACpD,GAAIwN,EAAK9L,UACLhK,KAAKqe,OAAS/V,EACdtI,KAAK8mB,UAAY,UAEhB,GAAoB,OAAhB9mB,KAAKqe,OACVre,KAAKqe,OAASre,KAAKqe,OAAOc,YAAYrJ,EAAMxN,OAE3C,CACqB,MAAlBtI,KAAK8mB,YACL9mB,KAAK8mB,UAAY,IAAI8J,IAEzB,IAAIM,EAAWpb,EAAK3B,WACfnU,KAAK8mB,UAAUrd,SAASynB,IACzBlxB,KAAK8mB,UAAU+J,IAAIK,EAAU,IAAIF,GAErC,IAAInc,EAAQ7U,KAAK8mB,UAAU9e,IAAIkpB,GAC/Bpb,EAAOA,EAAKzB,WACZQ,EAAMsc,SAASrb,EAAMxN,KAS7B0oB,EAAmB9wB,UAAUkxB,OAAS,SAAUtb,GAC5C,GAAIA,EAAK9L,UAGL,OAFAhK,KAAKqe,OAAS,KACdre,KAAK8mB,UAAY,MACV,EAGP,GAAoB,OAAhB9mB,KAAKqe,OAAiB,CACtB,GAAIre,KAAKqe,OAAOH,aAEZ,OAAO,EAGP,IAAItc,EAAQ5B,KAAKqe,OACjBre,KAAKqe,OAAS,KACd,IAAIgT,EAASrxB,KAIb,OAHA4B,EAAM0d,aAAaoB,GAAgB,SAAU/X,EAAK2oB,GAC9CD,EAAOF,SAAS,IAAItd,GAAKlL,GAAM2oB,KAE5BtxB,KAAKoxB,OAAOtb,GAGtB,GAAuB,OAAnB9V,KAAK8mB,UAAoB,CAC9B,IAAIoK,EAAWpb,EAAK3B,WAEpB,GADA2B,EAAOA,EAAKzB,WACRrU,KAAK8mB,UAAUrd,SAASynB,GACLlxB,KAAK8mB,UAAU9e,IAAIkpB,GAAUE,OAAOtb,IAEnD9V,KAAK8mB,UAAU7X,OAAOiiB,GAG9B,QAAIlxB,KAAK8mB,UAAU9c,YACfhK,KAAK8mB,UAAY,MACV,GAOX,OAAO,GAWnBkK,EAAmB9wB,UAAUqxB,YAAc,SAAUC,EAAYC,GACzC,OAAhBzxB,KAAKqe,OACLoT,EAAKD,EAAYxxB,KAAKqe,QAGtBre,KAAKsf,aAAa,SAAU3W,EAAK2oB,GAC7B,IAAIxb,EAAO,IAAIjC,GAAK2d,EAAW5oB,WAAa,IAAMD,GAClD2oB,EAAKC,YAAYzb,EAAM2b,MASnCT,EAAmB9wB,UAAUof,aAAe,SAAUmS,GAC3B,OAAnBzxB,KAAK8mB,WACL9mB,KAAK8mB,UAAU9U,KAAK,SAAUrJ,EAAK2oB,GAC/BG,EAAK9oB,EAAK2oB,MAIfN,KAmCPU,GAAuB,SAAU9vB,EAAO+vB,GACxC,OAAK/vB,GAA0B,iBAAVA,GAIjBU,EAAO,QAASV,EAAO,6CAChB+vB,EAAa/vB,EAAM,SAJnBA,GA6BXgwB,GAA+B,SAAUlV,EAAMiV,GAC/C,IAEI1U,EAFA4U,EAASnV,EAAKyB,cAAc9P,MAC5ByL,EAAW4X,GAAqBG,EAAQF,GAE5C,GAAIjV,EAAKwB,aAAc,CACnB,IAAI4T,EAAWpV,EACX9a,EAAQ8vB,GAAqBI,EAASnS,WAAYgS,GACtD,OAAI/vB,IAAUkwB,EAASnS,YACnB7F,IAAagY,EAAS3T,cAAc9P,MAC7B,IAAI+P,GAASxc,EAAOinB,GAAe/O,IAGnC4C,EAIX,IAAIqV,EAAerV,EAWnB,OAVAO,EAAU8U,EACNjY,IAAaiY,EAAa5T,cAAc9P,QACxC4O,EAAUA,EAAQwB,eAAe,IAAIL,GAAStE,KAElDiY,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,GACpDtyB,KAAKmyB,SAAWA,EAChBnyB,KAAKoyB,WAAaA,EAClBpyB,KAAKqyB,QAAUA,EACfryB,KAAKsyB,OAASA,EACdhwB,GAAQgwB,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,EACS5c,EACA6c,EACAC,GACd5yB,KAAK8V,KAAOA,EACZ9V,KAAK2yB,aAAeA,EACpB3yB,KAAK4yB,OAASA,EAEd5yB,KAAKyX,KAAOgS,GAAcoJ,eAE1B7yB,KAAKkG,OAASgsB,GAAgBK,KAoBlC,OAfAG,EAAaxyB,UAAU4yB,kBAAoB,SAAUlU,GACjD,GAAK5e,KAAK8V,KAAK9L,UAIV,CAAA,GAA+B,MAA3BhK,KAAK2yB,aAAa/wB,MAGvB,OAFAU,EAAOtC,KAAK2yB,aAAaI,SAAS/oB,UAAW,4DAEtChK,KAGP,IAAIilB,EAAYjlB,KAAK2yB,aAAaK,QAAQ,IAAInf,GAAK+K,IACnD,OAAO,IAAI8T,EAAa7e,GAAKof,MAAOhO,EAAWjlB,KAAK4yB,QATpD,OADAtwB,EAAOtC,KAAK8V,KAAK3B,aAAeyK,EAAW,iDACpC,IAAI8T,EAAa1yB,KAAK8V,KAAKzB,WAAYrU,KAAK2yB,aAAc3yB,KAAK4yB,SAYvEF,KAyBPQ,GAAgB,WAIhB,OAHKlB,KACDA,GAAyB,IAAIpQ,GAAUtQ,KAEpC0gB,IAKPmB,GAA+B,WAM/B,SAASA,EAAcvxB,EAAOmxB,QACT,IAAbA,IAAuBA,EAAWG,MACtClzB,KAAK4B,MAAQA,EACb5B,KAAK+yB,SAAWA,EAkTpB,OA3SAI,EAAcC,WAAa,SAAU1pB,GACjC,IAAI4nB,EAAO6B,EAAcF,MAIzB,OAHArpB,EAAQF,EAAK,SAAUghB,EAAW2I,GAC9B/B,EAAOA,EAAKljB,IAAI,IAAIyF,GAAK6W,GAAY2I,KAElC/B,GAMX6B,EAAcjzB,UAAU8J,QAAU,WAC9B,OAAsB,OAAfhK,KAAK4B,OAAkB5B,KAAK+yB,SAAS/oB,WAchDmpB,EAAcjzB,UAAUozB,iCAAmC,SAAUte,EAAcue,GAC/E,GAAkB,MAAdvzB,KAAK4B,OAAiB2xB,EAAUvzB,KAAK4B,OACrC,OAASkU,KAAMjC,GAAKof,MAAOrxB,MAAO5B,KAAK4B,OAGvC,GAAIoT,EAAahL,UACb,OAAO,KAGP,IAAIoV,EAAQpK,EAAab,WACrBU,EAAQ7U,KAAK+yB,SAAS/qB,IAAIoX,GAC9B,GAAc,OAAVvK,EAAgB,CAChB,IAAI2e,EAA4B3e,EAAMye,iCAAiCte,EAAaX,WAAYkf,GAChG,OAAiC,MAA7BC,GAES1d,KADM,IAAIjC,GAAKuL,GAAOvK,MAAM2e,EAA0B1d,MACtClU,MAAO4xB,EAA0B5xB,OAGnD,KAIX,OAAO,MAWvBuxB,EAAcjzB,UAAUuzB,yBAA2B,SAAUze,GACzD,OAAOhV,KAAKszB,iCAAiCte,EAAc,WAAc,OAAO,KAMpFme,EAAcjzB,UAAU8yB,QAAU,SAAUhe,GACxC,GAAIA,EAAahL,UACb,OAAOhK,KAGP,IAAIof,EAAQpK,EAAab,WACrB8Q,EAAYjlB,KAAK+yB,SAAS/qB,IAAIoX,GAClC,OAAkB,OAAd6F,EACOA,EAAU+N,QAAQhe,EAAaX,YAG/B8e,EAAcF,OAWjCE,EAAcjzB,UAAUkO,IAAM,SAAU4G,EAAc0e,GAClD,GAAI1e,EAAahL,UACb,OAAO,IAAImpB,EAAcO,EAAO1zB,KAAK+yB,UAGrC,IAAI3T,EAAQpK,EAAab,WAErBwf,GADQ3zB,KAAK+yB,SAAS/qB,IAAIoX,IAAU+T,EAAcF,OACjC7kB,IAAI4G,EAAaX,WAAYqf,GAC9CjN,EAAczmB,KAAK+yB,SAAS3Q,OAAOhD,EAAOuU,GAC9C,OAAO,IAAIR,EAAcnzB,KAAK4B,MAAO6kB,IAS7C0M,EAAcjzB,UAAU+O,OAAS,SAAU+F,GACvC,GAAIA,EAAahL,UACb,OAAIhK,KAAK+yB,SAAS/oB,UACPmpB,EAAcF,MAGd,IAAIE,EAAc,KAAMnzB,KAAK+yB,UAIxC,IAAI3T,EAAQpK,EAAab,WACrBU,EAAQ7U,KAAK+yB,SAAS/qB,IAAIoX,GAC9B,GAAIvK,EAAO,CACP,IAAI8e,EAAW9e,EAAM5F,OAAO+F,EAAaX,YACrCoS,OAAc,EAOlB,OALIA,EADAkN,EAAS3pB,UACKhK,KAAK+yB,SAAS9jB,OAAOmQ,GAGrBpf,KAAK+yB,SAAS3Q,OAAOhD,EAAOuU,GAE3B,OAAf3zB,KAAK4B,OAAkB6kB,EAAYzc,UAC5BmpB,EAAcF,MAGd,IAAIE,EAAcnzB,KAAK4B,MAAO6kB,GAIzC,OAAOzmB,MAUnBmzB,EAAcjzB,UAAU8H,IAAM,SAAUgN,GACpC,GAAIA,EAAahL,UACb,OAAOhK,KAAK4B,MAGZ,IAAIwd,EAAQpK,EAAab,WACrBU,EAAQ7U,KAAK+yB,SAAS/qB,IAAIoX,GAC9B,OAAIvK,EACOA,EAAM7M,IAAIgN,EAAaX,YAGvB,MAWnB8e,EAAcjzB,UAAU0zB,QAAU,SAAU5e,EAAc6e,GACtD,GAAI7e,EAAahL,UACb,OAAO6pB,EAGP,IAAIzU,EAAQpK,EAAab,WAErBwf,GADQ3zB,KAAK+yB,SAAS/qB,IAAIoX,IAAU+T,EAAcF,OACjCW,QAAQ5e,EAAaX,WAAYwf,GAClDpN,OAAc,EAOlB,OALIA,EADAkN,EAAS3pB,UACKhK,KAAK+yB,SAAS9jB,OAAOmQ,GAGrBpf,KAAK+yB,SAAS3Q,OAAOhD,EAAOuU,GAEvC,IAAIR,EAAcnzB,KAAK4B,MAAO6kB,IAW7C0M,EAAcjzB,UAAU4zB,KAAO,SAAUjqB,GACrC,OAAO7J,KAAK+zB,MAAMlgB,GAAKof,MAAOppB,IAUlCspB,EAAcjzB,UAAU6zB,MAAQ,SAAUC,EAAWnqB,GACjD,IAAIoqB,KAIJ,OAHAj0B,KAAK+yB,SAAShR,iBAAiB,SAAUmP,EAAUjM,GAC/CgP,EAAM/C,GAAYjM,EAAU8O,MAAMC,EAAUnf,MAAMqc,GAAWrnB,KAE1DA,EAAGmqB,EAAWh0B,KAAK4B,MAAOqyB,IASrCd,EAAcjzB,UAAUg0B,WAAa,SAAUpe,EAAMvV,GACjD,OAAOP,KAAKm0B,YAAYre,EAAMjC,GAAKof,MAAO1yB,IAE9C4yB,EAAcjzB,UAAUi0B,YAAc,SAAUC,EAAcJ,EAAWzzB,GACrE,IAAI+gB,IAASthB,KAAK4B,OAAQrB,EAAEyzB,EAAWh0B,KAAK4B,OAC5C,GAAI0f,EACA,OAAOA,EAGP,GAAI8S,EAAapqB,UACb,OAAO,KAGP,IAAIoV,EAAQgV,EAAajgB,WACrBkgB,EAAYr0B,KAAK+yB,SAAS/qB,IAAIoX,GAClC,OAAIiV,EACOA,EAAUF,YAAYC,EAAa/f,WAAY2f,EAAUnf,MAAMuK,GAAQ7e,GAGvE,MAWvB4yB,EAAcjzB,UAAUo0B,cAAgB,SAAUxe,EAAMvV,GACpD,OAAOP,KAAKu0B,eAAeze,EAAMjC,GAAKof,MAAO1yB,IAEjD4yB,EAAcjzB,UAAUq0B,eAAiB,SAAUH,EAAcI,EAAqBj0B,GAClF,GAAI6zB,EAAapqB,UACb,OAAOhK,KAGHA,KAAK4B,OACLrB,EAAEi0B,EAAqBx0B,KAAK4B,OAEhC,IAAIwd,EAAQgV,EAAajgB,WACrBkgB,EAAYr0B,KAAK+yB,SAAS/qB,IAAIoX,GAClC,OAAIiV,EACOA,EAAUE,eAAeH,EAAa/f,WAAYmgB,EAAoB3f,MAAMuK,GAAQ7e,GAGpF4yB,EAAcF,OAWjCE,EAAcjzB,UAAUu0B,QAAU,SAAUl0B,GACxCP,KAAK00B,SAAS7gB,GAAKof,MAAO1yB,IAE9B4yB,EAAcjzB,UAAUw0B,SAAW,SAAUF,EAAqBj0B,GAC9DP,KAAK+yB,SAAShR,iBAAiB,SAAUnD,EAAWqG,GAChDA,EAAUyP,SAASF,EAAoB3f,MAAM+J,GAAYre,KAEzDP,KAAK4B,OACLrB,EAAEi0B,EAAqBx0B,KAAK4B,QAOpCuxB,EAAcjzB,UAAUy0B,aAAe,SAAUp0B,GAC7CP,KAAK+yB,SAAShR,iBAAiB,SAAUnD,EAAWqG,GAC5CA,EAAUrjB,OACVrB,EAAEqe,EAAWqG,EAAUrjB,UAInCuxB,EAAcF,MAAQ,IAAIE,EAAc,MACjCA,KAwBPyB,GAAgC,WAChC,SAASA,EAAe1uB,EAAQ4P,GAC5B9V,KAAKkG,OAASA,EACdlG,KAAK8V,KAAOA,EAEZ9V,KAAKyX,KAAOgS,GAAcoL,gBAU9B,OARAD,EAAe10B,UAAU4yB,kBAAoB,SAAUlU,GACnD,OAAI5e,KAAK8V,KAAK9L,UACH,IAAI4qB,EAAe50B,KAAKkG,OAAQ2N,GAAKof,OAGrC,IAAI2B,EAAe50B,KAAKkG,OAAQlG,KAAK8V,KAAKzB,aAGlDugB,KAyBPE,GAA2B,WAC3B,SAASA,EAAU5uB,EAAQ4P,EAAMkU,GAC7BhqB,KAAKkG,OAASA,EACdlG,KAAK8V,KAAOA,EACZ9V,KAAKgqB,KAAOA,EAEZhqB,KAAKyX,KAAOgS,GAAcsL,UAU9B,OARAD,EAAU50B,UAAU4yB,kBAAoB,SAAUlU,GAC9C,OAAI5e,KAAK8V,KAAK9L,UACH,IAAI8qB,EAAU90B,KAAKkG,OAAQ2N,GAAKof,MAAOjzB,KAAKgqB,KAAKrL,kBAAkBC,IAGnE,IAAIkW,EAAU90B,KAAKkG,OAAQlG,KAAK8V,KAAKzB,WAAYrU,KAAKgqB,OAG9D8K,KAyBPE,GAAuB,WACvB,SAASA,EACS9uB,EACA4P,EACAid,GACd/yB,KAAKkG,OAASA,EACdlG,KAAK8V,KAAOA,EACZ9V,KAAK+yB,SAAWA,EAEhB/yB,KAAKyX,KAAOgS,GAAcwL,MAsC9B,OAjCAD,EAAM90B,UAAU4yB,kBAAoB,SAAUlU,GAC1C,GAAI5e,KAAK8V,KAAK9L,UAAW,CACrB,IAAIib,EAAYjlB,KAAK+yB,SAASC,QAAQ,IAAInf,GAAK+K,IAC/C,OAAIqG,EAAUjb,UAEH,KAEFib,EAAUrjB,MAER,IAAIkzB,GAAU90B,KAAKkG,OAAQ2N,GAAKof,MAAOhO,EAAUrjB,OAIjD,IAAIozB,EAAMh1B,KAAKkG,OAAQ2N,GAAKof,MAAOhO,GAK9C,OADA3iB,EAAOtC,KAAK8V,KAAK3B,aAAeyK,EAAW,kEACpC,IAAIoW,EAAMh1B,KAAKkG,OAAQlG,KAAK8V,KAAKzB,WAAYrU,KAAK+yB,WAMjEiC,EAAM90B,UAAU0I,SAAW,WACvB,MAAQ,aACJ5I,KAAK8V,KACL,KACA9V,KAAKkG,OAAO0C,WACZ,WACA5I,KAAK+yB,SAASnqB,WACd,KAEDosB,KAwBPE,GAA2B,WAM3B,SAASA,EAAU9K,EAAO+K,EAAmBC,GACzCp1B,KAAKoqB,MAAQA,EACbpqB,KAAKm1B,kBAAoBA,EACzBn1B,KAAKo1B,UAAYA,EAwCrB,OAlCAF,EAAUh1B,UAAUm1B,mBAAqB,WACrC,OAAOr1B,KAAKm1B,mBAMhBD,EAAUh1B,UAAUo1B,WAAa,WAC7B,OAAOt1B,KAAKo1B,WAMhBF,EAAUh1B,UAAUq1B,kBAAoB,SAAUzf,GAC9C,GAAIA,EAAK9L,UACL,OAAOhK,KAAKq1B,uBAAyBr1B,KAAKo1B,UAE9C,IAAIlE,EAAWpb,EAAK3B,WACpB,OAAOnU,KAAKw1B,mBAAmBtE,IAMnCgE,EAAUh1B,UAAUs1B,mBAAqB,SAAU7sB,GAC/C,OAAS3I,KAAKq1B,uBAAyBr1B,KAAKo1B,WAAcp1B,KAAKoqB,MAAMtL,SAASnW,IAKlFusB,EAAUh1B,UAAUu1B,QAAU,WAC1B,OAAOz1B,KAAKoqB,OAET8K,KAyBPQ,GAA2B,WAM3B,SAASA,EAAUC,EAAaC,GAC5B51B,KAAK21B,YAAcA,EACnB31B,KAAK41B,aAAeA,EAyDxB,OAjDAF,EAAUx1B,UAAU21B,gBAAkB,SAAUC,EAAWC,EAAUC,GACjE,OAAO,IAAIN,EAAU,IAAIR,GAAUY,EAAWC,EAAUC,GAAWh2B,KAAK41B,eAQ5EF,EAAUx1B,UAAU+1B,iBAAmB,SAAUC,EAAYH,EAAUC,GACnE,OAAO,IAAIN,EAAU11B,KAAK21B,YAAa,IAAIT,GAAUgB,EAAYH,EAAUC,KAK/EN,EAAUx1B,UAAUi2B,cAAgB,WAChC,OAAOn2B,KAAK21B,aAKhBD,EAAUx1B,UAAUk2B,qBAAuB,WACvC,OAAOp2B,KAAK21B,YAAYN,qBAClBr1B,KAAK21B,YAAYF,UACjB,MAKVC,EAAUx1B,UAAUm2B,eAAiB,WACjC,OAAOr2B,KAAK41B,cAKhBF,EAAUx1B,UAAUo2B,sBAAwB,WACxC,OAAOt2B,KAAK41B,aAAaP,qBACnBr1B,KAAK41B,aAAaH,UAClB,MAMVC,EAAUzC,MAAQ,IAAIyC,EAAU,IAAIR,GAAUrO,GAAatI,YACrC,GACR,GAAQ,IAAI2W,GAAUrO,GAAatI,YAC3B,GACR,IACPmX,KA2BPa,GAAwB,WACxB,SAASA,EAAO9e,EAAMyU,EAActN,EAAW4X,EAASvL,GACpDjrB,KAAKyX,KAAOA,EACZzX,KAAKksB,aAAeA,EACpBlsB,KAAK4e,UAAYA,EACjB5e,KAAKw2B,QAAUA,EACfx2B,KAAKirB,SAAWA,EAqDpB,OA/CAsL,EAAOE,YAAc,SAAUza,GAC3B,OAAO,IAAIua,EAAOA,EAAOG,MAAO1a,IAOpCua,EAAOI,iBAAmB,SAAUzF,EAAUlV,GAC1C,OAAO,IAAIua,EAAOA,EAAOK,YAAa5a,EAAUkV,IAOpDqF,EAAOM,mBAAqB,SAAU3F,EAAUlV,GAC5C,OAAO,IAAIua,EAAOA,EAAOO,cAAe9a,EAAUkV,IAQtDqF,EAAOQ,mBAAqB,SAAU7F,EAAU8F,EAAaC,GACzD,OAAO,IAAIV,EAAOA,EAAOW,cAAeF,EAAa9F,EAAU+F,IAOnEV,EAAOY,iBAAmB,SAAUjG,EAAUlV,GAC1C,OAAO,IAAIua,EAAOA,EAAOa,YAAapb,EAAUkV,IAIpDqF,EAAOK,YAAc,cAErBL,EAAOO,cAAgB,gBAEvBP,EAAOW,cAAgB,gBAEvBX,EAAOa,YAAc,cAErBb,EAAOG,MAAQ,QACRH,KAyBPc,GAA+B,WAC/B,SAASA,EAAc/M,GACnBtqB,KAAKsqB,OAASA,EAkGlB,OAhGA+M,EAAcn3B,UAAUif,YAAc,SAAU6K,EAAMrhB,EAAKgrB,EAAU2D,EAAcpxB,EAAQqxB,GACvFj1B,EAAO0nB,EAAKxJ,UAAUxgB,KAAKsqB,QAAS,qDACpC,IAAIkN,EAAWxN,EAAKrL,kBAAkBhW,GAEtC,OAAI6uB,EAAS3Y,SAASyY,GAAc3hB,OAAOge,EAAS9U,SAASyY,KAIrDE,EAASxtB,WAAa2pB,EAAS3pB,UAIxBggB,GAGa,MAAxBuN,IACI5D,EAAS3pB,UACLggB,EAAKlL,SAASnW,GACd4uB,EAAqBE,iBAAiBlB,GAAOM,mBAAmBluB,EAAK6uB,IAGrEl1B,EAAO0nB,EAAK9L,aAAc,uEAGzBsZ,EAASxtB,UACdutB,EAAqBE,iBAAiBlB,GAAOI,iBAAiBhuB,EAAKgrB,IAGnE4D,EAAqBE,iBAAiBlB,GAAOQ,mBAAmBpuB,EAAKgrB,EAAU6D,KAGnFxN,EAAK9L,cAAgByV,EAAS3pB,UACvBggB,EAIAA,EAAK/K,qBAAqBtW,EAAKgrB,GAAUpT,UAAUvgB,KAAKsqB,UAMvE+M,EAAcn3B,UAAUw3B,eAAiB,SAAUlB,EAASmB,EAASJ,GAuBjE,OAtB4B,MAAxBA,IACKf,EAAQtY,cACTsY,EAAQlX,aAAaoB,GAAgB,SAAU/X,EAAKqW,GAC3C2Y,EAAQ7Y,SAASnW,IAClB4uB,EAAqBE,iBAAiBlB,GAAOM,mBAAmBluB,EAAKqW,MAI5E2Y,EAAQzZ,cACTyZ,EAAQrY,aAAaoB,GAAgB,SAAU/X,EAAKqW,GAChD,GAAIwX,EAAQ1X,SAASnW,GAAM,CACvB,IAAI6uB,EAAWhB,EAAQ7X,kBAAkBhW,GACpC6uB,EAAS7hB,OAAOqJ,IACjBuY,EAAqBE,iBAAiBlB,GAAOQ,mBAAmBpuB,EAAKqW,EAAWwY,SAIpFD,EAAqBE,iBAAiBlB,GAAOI,iBAAiBhuB,EAAKqW,OAK5E2Y,EAAQpX,UAAUvgB,KAAKsqB,SAKlC+M,EAAcn3B,UAAUue,eAAiB,SAAU+X,EAASoB,GACxD,OAAIpB,EAAQxsB,UACD6c,GAAatI,WAGbiY,EAAQ/X,eAAemZ,IAMtCP,EAAcn3B,UAAU23B,aAAe,WACnC,OAAO,GAKXR,EAAcn3B,UAAU43B,iBAAmB,WACvC,OAAO93B,MAKXq3B,EAAcn3B,UAAU+rB,SAAW,WAC/B,OAAOjsB,KAAKsqB,QAET+M,KAqBPU,GAAwC,WACxC,SAASA,IACL/3B,KAAKg4B,cAmDT,OA9CAD,EAAuB73B,UAAUu3B,iBAAmB,SAAU3L,GAC1D,IAAIrU,EAAOqU,EAAOrU,KACdyZ,EAAkCpF,EAAOlN,UAC7Ctc,EAAOmV,GAAQ8e,GAAOK,aAClBnf,GAAQ8e,GAAOW,eACfzf,GAAQ8e,GAAOO,cAAe,6CAClCx0B,EAAoB,cAAb4uB,EAA0B,mDACjC,IAAI+G,EAAYtuB,EAAQ3J,KAAKg4B,WAAY9G,GACzC,GAAI+G,EAAW,CACX,IAAIC,EAAUD,EAAUxgB,KACxB,GAAIA,GAAQ8e,GAAOK,aAAesB,GAAW3B,GAAOO,cAChD92B,KAAKg4B,WAAW9G,GAAYqF,GAAOQ,mBAAmB7F,EAAUpF,EAAOI,aAAc+L,EAAU/L,mBAE9F,GAAIzU,GAAQ8e,GAAOO,eACpBoB,GAAW3B,GAAOK,mBACX52B,KAAKg4B,WAAW9G,QAEtB,GAAIzZ,GAAQ8e,GAAOO,eACpBoB,GAAW3B,GAAOW,cAClBl3B,KAAKg4B,WAAW9G,GAAYqF,GAAOM,mBAAmB3F,EAAU+G,EAAUzB,cAEzE,GAAI/e,GAAQ8e,GAAOW,eACpBgB,GAAW3B,GAAOK,YAClB52B,KAAKg4B,WAAW9G,GAAYqF,GAAOI,iBAAiBzF,EAAUpF,EAAOI,kBAEpE,CAAA,GAAIzU,GAAQ8e,GAAOW,eACpBgB,GAAW3B,GAAOW,cAIlB,MAAMz0B,EAAe,mCACjBqpB,EACA,mBACAmM,GANJj4B,KAAKg4B,WAAW9G,GAAYqF,GAAOQ,mBAAmB7F,EAAUpF,EAAOI,aAAc+L,EAAUzB,eAUnGx2B,KAAKg4B,WAAW9G,GAAYpF,GAMpCiM,EAAuB73B,UAAUi4B,WAAa,WAC1C,OFz+KQ,SAAUzuB,GACtB,IAAIW,KACAvH,EAAI,EACR,IAAK,IAAI6F,KAAOe,EACZW,EAAIvH,KAAO4G,EAAIf,GAEnB,OAAO0B,EEm+KI+tB,CAAUp4B,KAAKg4B,aAEnBD,KA+CPM,GAA2B,IAtBa,WACxC,SAASC,KAcT,OATAA,EAAuBp4B,UAAUq4B,iBAAmB,SAAUrH,GAC1D,OAAO,MAKXoH,EAAuBp4B,UAAUs4B,mBAAqB,SAAUjZ,EAAO1K,EAAOhC,GAC1E,OAAO,MAEJylB,MAePG,GAA8C,WAM9C,SAASA,EAA6BC,EAASC,EAAYC,QACvB,IAA5BA,IAAsCA,EAA0B,MACpE54B,KAAK04B,QAAUA,EACf14B,KAAK24B,WAAaA,EAClB34B,KAAK44B,wBAA0BA,EAgCnC,OA3BAH,EAA6Bv4B,UAAUq4B,iBAAmB,SAAUrH,GAChE,IAAIxU,EAAO1c,KAAK24B,WAAWxC,gBAC3B,GAAIzZ,EAAK8Y,mBAAmBtE,GACxB,OAAOxU,EAAK+Y,UAAU9W,kBAAkBuS,GAGxC,IAAI2H,EAA6C,MAAhC74B,KAAK44B,wBAChB,IAAI1D,GAAUl1B,KAAK44B,yBAAyB,GAAM,GAClD54B,KAAK24B,WAAWtC,iBACtB,OAAOr2B,KAAK04B,QAAQI,kBAAkB5H,EAAU2H,IAMxDJ,EAA6Bv4B,UAAUs4B,mBAAqB,SAAUjZ,EAAO1K,EAAOhC,GAChF,IAAIkmB,EAAqD,MAAhC/4B,KAAK44B,wBACxB54B,KAAK44B,wBACL54B,KAAK24B,WAAWrC,wBAClB0C,EAAQh5B,KAAK04B,QAAQO,iBAAiBF,EAAoBlkB,EAAO,EAAGhC,EAAS0M,GACjF,OAAqB,IAAjByZ,EAAMl3B,OACC,KAGAk3B,EAAM,IAGdP,KAsBPS,GAAiC,WASjC,OAJA,SAAyBC,EAAWC,GAChCp5B,KAAKm5B,UAAYA,EACjBn5B,KAAKo5B,QAAUA,MAOnBC,GAA+B,WAI/B,SAASA,EAAcC,GACnBt5B,KAAKs5B,QAAUA,EA4hBnB,OAvhBAD,EAAcn5B,UAAUq5B,cAAgB,SAAUJ,GAC9C72B,EAAO62B,EACFhD,gBACAV,UACAjV,UAAUxgB,KAAKs5B,QAAQrN,YAAa,0BACzC3pB,EAAO62B,EACF9C,iBACAZ,UACAjV,UAAUxgB,KAAKs5B,QAAQrN,YAAa,4BAS7CoN,EAAcn5B,UAAUs5B,eAAiB,SAAUC,EAAcC,EAAWC,EAAaC,GACrF,IACIC,EAAcC,EADdC,EAAc,IAAIhC,GAEtB,GAAI2B,EAAUjiB,OAASgS,GAAcsL,UAAW,CAC5C,IAAIiF,EAAYN,EACZM,EAAU9zB,OAAOisB,SACjB0H,EAAe75B,KAAKi6B,oBAAoBR,EAAcO,EAAUlkB,KAAMkkB,EAAUhQ,KAAM2P,EAAaC,EAAeG,IAGlHz3B,EAAO03B,EAAU9zB,OAAOksB,WAAY,mBAIpC0H,EACIE,EAAU9zB,OAAOosB,QACZmH,EAAapD,iBAAiBf,eAC1B0E,EAAUlkB,KAAK9L,UAC5B6vB,EAAe75B,KAAKk6B,sBAAsBT,EAAcO,EAAUlkB,KAAMkkB,EAAUhQ,KAAM2P,EAAaC,EAAeE,EAAkBC,SAGzI,GAAIL,EAAUjiB,OAASgS,GAAcwL,MAAO,CAC7C,IAAIkF,EAAQT,EACRS,EAAMj0B,OAAOisB,SACb0H,EAAe75B,KAAKo6B,gBAAgBX,EAAcU,EAAMrkB,KAAMqkB,EAAMpH,SAAU4G,EAAaC,EAAeG,IAG1Gz3B,EAAO63B,EAAMj0B,OAAOksB,WAAY,mBAEhC0H,EACIK,EAAMj0B,OAAOosB,QAAUmH,EAAapD,iBAAiBf,aACzDuE,EAAe75B,KAAKq6B,kBAAkBZ,EAAcU,EAAMrkB,KAAMqkB,EAAMpH,SAAU4G,EAAaC,EAAeE,EAAkBC,SAGjI,GAAIL,EAAUjiB,OAASgS,GAAcoJ,eAAgB,CACtD,IAAIyH,EAAeZ,EAKfG,EAJCS,EAAa1H,OAIC5yB,KAAKu6B,iBAAiBd,EAAca,EAAaxkB,KAAM6jB,EAAaC,EAAeG,GAHnF/5B,KAAKw6B,cAAcf,EAAca,EAAaxkB,KAAMwkB,EAAa3H,aAAcgH,EAAaC,EAAeG,OAM7H,CAAA,GAAIL,EAAUjiB,OAASgS,GAAcoL,gBAItC,MAAMpyB,EAAe,2BAA6Bi3B,EAAUjiB,MAH5DoiB,EAAe75B,KAAKy6B,gBAAgBhB,EAAcC,EAAU5jB,KAAM6jB,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,UAAUzrB,UACxE4wB,EAAkBnB,EAAarD,wBAC/B2D,EAAYj4B,OAAS,IACpB23B,EAAatD,gBAAgBd,sBAC7BsF,IACI7E,EACIL,UACA9f,YACRmgB,EACIL,UACAtX,cACAxI,OAAOilB,EAAgBzc,iBAC5B4b,EAAYh4B,KAAKw0B,GAAOE,YACHoD,EAAazD,2BAa9CiD,EAAcn5B,UAAU26B,oCAAsC,SAAU1B,EAAW2B,EAAYnB,EAAazzB,EAAQ6zB,GAChH,IAAIgB,EAAe5B,EAAUhD,gBAC7B,GAA8C,MAA1CwD,EAAYqB,eAAeF,GAE3B,OAAO3B,EAGP,IAAI8B,OAAgB,EAAQpC,OAAa,EACzC,GAAIiC,EAAW9wB,UAGX,GADA1H,EAAO62B,EAAU9C,iBAAiBhB,qBAAsB,8DACpD8D,EAAU9C,iBAAiBf,aAAc,CAIzC,IAAI4F,EAAc/B,EAAU7C,wBACxB6E,EAAmBD,aAAuBrU,GACxCqU,EACArU,GAAatI,WACf6c,EAAwBzB,EAAY0B,0BAA0BF,GAClEF,EAAgBj7B,KAAKs5B,QAAQ5B,eAAeyB,EAAUhD,gBAAgBV,UAAW2F,EAAuBrB,OAEvG,CACD,IAAIuB,EAAe3B,EAAY4B,uBAAuBpC,EAAU7C,yBAChE2E,EAAgBj7B,KAAKs5B,QAAQ5B,eAAeyB,EAAUhD,gBAAgBV,UAAW6F,EAAcvB,OAGlG,CACD,IAAI7I,EAAW4J,EAAW3mB,WAC1B,GAAgB,aAAZ+c,EAAyB,CACzB5uB,EAAiC,GAA1Bw4B,EAAW1mB,YAAkB,yDACpC,IAAIonB,EAAeT,EAAatF,UAChCoD,EAAaM,EAAU9C,iBAAiBZ,UAExC,IAAIgG,EAAkB9B,EAAY+B,mCAAmCZ,EAAYU,EAAc3C,GAE3FoC,EADmB,MAAnBQ,EACgBz7B,KAAKs5B,QAAQ7a,eAAe+c,EAAcC,GAI1CV,EAAatF,cAGhC,CACD,IAAIkG,EAAkBb,EAAWzmB,WAE7BunB,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,EACgB57B,KAAKs5B,QAAQna,YAAY4b,EAAatF,UAAWvE,EAAU0K,EAAeD,EAAiBz1B,EAAQ6zB,GAInGgB,EAAatF,WAIzC,OAAO0D,EAAUtD,gBAAgBoF,EAAeF,EAAa1F,sBAAwByF,EAAW9wB,UAAWhK,KAAKs5B,QAAQzB,iBAchIwB,EAAcn5B,UAAUg6B,sBAAwB,SAAUT,EAAcqB,EAAYgB,EAAanC,EAAaC,EAAeE,EAAkBC,GAC3I,IACIgC,EADAC,EAAgBvC,EAAapD,iBAE7B4F,EAAenC,EACb95B,KAAKs5B,QACLt5B,KAAKs5B,QAAQxB,mBACnB,GAAIgD,EAAW9wB,UACX+xB,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,EAAW3mB,WAC1B,IAAK6nB,EAAczG,kBAAkBuF,IACjCA,EAAW1mB,YAAc,EAEzB,OAAOqlB,EAEX,IAAIkC,EAAkBb,EAAWzmB,WAE7B6K,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,EAAW9wB,UAAWiyB,EAAapE,gBACtI3xB,EAAS,IAAIuyB,GAA6BkB,EAAaE,EAAcD,GACzE,OAAO55B,KAAK66B,oCAAoChB,EAAciB,EAAYnB,EAAazzB,EAAQ6zB,IAYnGV,EAAcn5B,UAAU+5B,oBAAsB,SAAUR,EAAcqB,EAAYgB,EAAanC,EAAaC,EAAeG,GACvH,IACIF,EAAcoB,EADdF,EAAetB,EAAatD,gBAE5BjwB,EAAS,IAAIuyB,GAA6BkB,EAAaF,EAAcG,GACzE,GAAIkB,EAAW9wB,UACXixB,EAAgBj7B,KAAKs5B,QAAQ5B,eAAe+B,EAAatD,gBAAgBV,UAAWqG,EAAa/B,GACjGF,EAAeJ,EAAa5D,gBAAgBoF,GAAe,EAAMj7B,KAAKs5B,QAAQzB,oBAE7E,CACD,IAAI3G,EAAW4J,EAAW3mB,WAC1B,GAAiB,cAAb+c,EACA+J,EAAgBj7B,KAAKs5B,QAAQ7a,eAAegb,EAAatD,gBAAgBV,UAAWqG,GACpFjC,EAAeJ,EAAa5D,gBAAgBoF,EAAeF,EAAa1F,qBAAsB0F,EAAazF,kBAE1G,CACD,IAAIqG,EAAkBb,EAAWzmB,WAC7BmjB,EAAWuD,EAAatF,UAAU9W,kBAAkBuS,GACpDyC,OAAW,EACf,GAAIgI,EAAgB3xB,UAEhB2pB,EAAWmI,MAEV,CACD,IAAI9c,EAAY9Y,EAAOqyB,iBAAiBrH,GAMhCyC,EALS,MAAb3U,EACkC,cAA9B2c,EAAgBrnB,WAChB0K,EAAUH,SAAS8c,EAAgBhnB,UAAU3K,UAGlCgV,EAGAA,EAAUG,YAAYwc,EAAiBG,GAK3CjV,GAAatI,WAGhC,GAAKiZ,EAAS7hB,OAAOge,GAKjBkG,EAAeJ,MALa,CAC5B,IAAI0C,EAAen8B,KAAKs5B,QAAQna,YAAY4b,EAAatF,UAAWvE,EAAUyC,EAAUgI,EAAiBz1B,EAAQ6zB,GACjHF,EAAeJ,EAAa5D,gBAAgBsG,EAAcpB,EAAa1F,qBAAsBr1B,KAAKs5B,QAAQzB,kBAOtH,OAAOgC,GAQXR,EAAc+C,eAAiB,SAAUjD,EAAWjI,GAChD,OAAOiI,EAAUhD,gBAAgBX,mBAAmBtE,IAYxDmI,EAAcn5B,UAAUk6B,gBAAkB,SAAUjB,EAAWrjB,EAAMumB,EAAiB1C,EAAauB,EAAanB,GAC5G,IAAItzB,EAAQzG,KAORs8B,EAAenD,EAanB,OAZAkD,EAAgB5H,QAAQ,SAAUzf,EAAcgK,GAC5C,IAAIud,EAAYzmB,EAAKjB,MAAMG,GACvBqkB,EAAc+C,eAAejD,EAAWoD,EAAUpoB,cAClDmoB,EAAe71B,EAAMwzB,oBAAoBqC,EAAcC,EAAWvd,EAAW2a,EAAauB,EAAanB,MAG/GsC,EAAgB5H,QAAQ,SAAUzf,EAAcgK,GAC5C,IAAIud,EAAYzmB,EAAKjB,MAAMG,GACtBqkB,EAAc+C,eAAejD,EAAWoD,EAAUpoB,cACnDmoB,EAAe71B,EAAMwzB,oBAAoBqC,EAAcC,EAAWvd,EAAW2a,EAAauB,EAAanB,MAGxGuC,GAQXjD,EAAcn5B,UAAUs8B,YAAc,SAAU9f,EAAMyd,GAIlD,OAHAA,EAAM1F,QAAQ,SAAUzf,EAAcgK,GAClCtC,EAAOA,EAAKyC,YAAYnK,EAAcgK,KAEnCtC,GAaX2c,EAAcn5B,UAAUm6B,kBAAoB,SAAUlB,EAAWrjB,EAAMumB,EAAiB1C,EAAauB,EAAapB,EAAkBC,GAChI,IAAItzB,EAAQzG,KAGZ,GAAIm5B,EACC9C,iBACAZ,UACAzrB,YACAmvB,EAAU9C,iBAAiBhB,qBAC5B,OAAO8D,EAQX,IACIsD,EADAH,EAAenD,EAGfsD,EADA3mB,EAAK9L,UACWqyB,EAGAlJ,GAAcF,MAAMW,QAAQ9d,EAAMumB,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,EAAWltB,EAAM+1B,YAAYE,EAAazX,GAC9CqX,EAAe71B,EAAMyzB,sBAAsBoC,EAAc,IAAIzoB,GAAKqd,GAAWyC,EAAUgG,EAAauB,EAAapB,EAAkBC,MAG3I0C,EAAc1J,SAAShR,iBAAiB,SAAUmP,EAAUyL,GACxD,IAAIC,GAAsBzD,EAAU9C,iBAAiBb,mBAAmBtE,IAC5C,MAAxByL,EAAe/6B,MACnB,IAAKi3B,EAAW/Z,SAASoS,KAAc0L,EAAoB,CACvD,IAAIF,EAAcvD,EACb9C,iBACAZ,UACA9W,kBAAkBuS,GACnByC,EAAWltB,EAAM+1B,YAAYE,EAAaC,GAC9CL,EAAe71B,EAAMyzB,sBAAsBoC,EAAc,IAAIzoB,GAAKqd,GAAWyC,EAAUgG,EAAauB,EAAapB,EAAkBC,MAGpIuC,GAYXjD,EAAcn5B,UAAUs6B,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,EAAa/wB,MAAe,CAE5B,GAAKi7B,EAAQ7yB,WAAakxB,EAAY7F,sBAClC6F,EAAY3F,kBAAkBsH,GAC9B,OAAO78B,KAAKk6B,sBAAsBf,EAAW0D,EAAS3B,EAAYzF,UAAU5W,SAASge,GAAUlD,EAAaC,EAAeE,EAAkBC,GAE5I,GAAI8C,EAAQ7yB,UAAW,CAGxB,IAAI8yB,EAAoB3J,GAAcF,MAItC,OAHAiI,EAAYzF,UAAUnW,aAAa3B,GAAW,SAAU7V,EAAM4U,GAC1DogB,EAAoBA,EAAkB1uB,IAAI,IAAIyF,GAAK/L,GAAO4U,KAEvD1c,KAAKq6B,kBAAkBlB,EAAW0D,EAASC,EAAmBnD,EAAaC,EAAeE,EAAkBC,GAGnH,OAAOZ,EAKX,IAAI4D,EAAoB5J,GAAcF,MAOtC,OANAN,EAAa8B,QAAQ,SAAUuI,EAAWp7B,GACtC,IAAIq7B,EAAkBJ,EAAQhoB,MAAMmoB,GAChC9B,EAAY3F,kBAAkB0H,KAC9BF,EAAoBA,EAAkB3uB,IAAI4uB,EAAW9B,EAAYzF,UAAU5W,SAASoe,OAGrFj9B,KAAKq6B,kBAAkBlB,EAAW0D,EAASE,EAAmBpD,EAAaC,EAAeE,EAAkBC,IAW3HV,EAAcn5B,UAAUu6B,gBAAkB,SAAUtB,EAAWrjB,EAAM6jB,EAAaI,GAC9E,IAAImD,EAAgB/D,EAAU9C,iBAC1BwD,EAAeV,EAAUlD,iBAAiBiH,EAAczH,UAAWyH,EAAc7H,sBAAwBvf,EAAK9L,UAAWkzB,EAAc5H,cAC3I,OAAOt1B,KAAK66B,oCAAoChB,EAAc/jB,EAAM6jB,EAAatB,GAA0B0B,IAW/GV,EAAcn5B,UAAUq6B,iBAAmB,SAAUpB,EAAWrjB,EAAM6jB,EAAawD,EAAqBpD,GACpG,IAAIhE,EACJ,GAAwC,MAApC4D,EAAYqB,eAAellB,GAC3B,OAAOqjB,EAGP,IAAIjzB,EAAS,IAAIuyB,GAA6BkB,EAAaR,EAAWgE,GAClEC,EAAgBjE,EAAUhD,gBAAgBV,UAC1CwF,OAAgB,EACpB,GAAInlB,EAAK9L,WAAiC,cAApB8L,EAAK3B,WAA4B,CACnD,IAAI8I,OAAU,EACd,GAAIkc,EAAU9C,iBAAiBhB,qBAC3BpY,EAAU0c,EAAY4B,uBAAuBpC,EAAU7C,6BAEtD,CACD,IAAI+G,EAAiBlE,EAAU9C,iBAAiBZ,UAChDnzB,EAAO+6B,aAA0BxW,GAAc,iDAC/C5J,EAAU0c,EAAY0B,0BAA0BgC,GAEpDpgB,EAAUA,EACVge,EAAgBj7B,KAAKs5B,QAAQ5B,eAAe0F,EAAengB,EAAS8c,OAEnE,CACD,IAAI7I,EAAWpb,EAAK3B,WAChBwf,EAAWgG,EAAYb,kBAAkB5H,EAAUiI,EAAU9C,kBACjD,MAAZ1C,GACAwF,EAAU9C,iBAAiBb,mBAAmBtE,KAC9CyC,EAAWyJ,EAAcze,kBAAkBuS,KAG3C+J,EADY,MAAZtH,EACgB3zB,KAAKs5B,QAAQna,YAAYie,EAAelM,EAAUyC,EAAU7d,EAAKzB,WAAYnO,EAAQ6zB,GAEhGZ,EACJhD,gBACAV,UACA3W,SAASoS,GAEMlxB,KAAKs5B,QAAQna,YAAYie,EAAelM,EAAUrK,GAAatI,WAAYzI,EAAKzB,WAAYnO,EAAQ6zB,GAGpGqD,GAEFpzB,WACdmvB,EAAU9C,iBAAiBhB,uBAE3BU,EAAW4D,EAAY4B,uBAAuBpC,EAAU7C,0BAC3CpY,eACT+c,EAAgBj7B,KAAKs5B,QAAQ5B,eAAeuD,EAAelF,EAAUgE,IAOjF,OAHAhE,EACIoD,EAAU9C,iBAAiBhB,sBACmB,MAA1CsE,EAAYqB,eAAennB,GAAKof,OACjCkG,EAAUtD,gBAAgBoF,EAAelF,EAAU/1B,KAAKs5B,QAAQzB,iBAGxEwB,KAyBPiE,GAAgC,WAKhC,SAASA,EAAeC,GACpBv9B,KAAKu9B,OAASA,EAKdv9B,KAAKsqB,OAAStqB,KAAKu9B,OAAOvR,iBAAiBC,WAuF/C,OAvEAqR,EAAep9B,UAAUs9B,yBAA2B,SAAUpE,EAASqE,EAAYC,GAC/E,IAAIj3B,EAAQzG,KACR29B,KACAC,KAYJ,OAXAxE,EAAQxvB,QAAQ,SAAUkiB,GAClBA,EAAOrU,OAAS8e,GAAOW,eACvBzwB,EAAM6jB,OAAOvN,oBAAoB+O,EAAO0K,QAAS1K,EAAOI,eACxD0R,EAAM77B,KAAKw0B,GAAOY,iBAAiBrL,EAAOlN,UAAWkN,EAAOI,iBAGpElsB,KAAK69B,uBAAuBF,EAAQpH,GAAOO,cAAesC,EAASsE,EAAoBD,GACvFz9B,KAAK69B,uBAAuBF,EAAQpH,GAAOK,YAAawC,EAASsE,EAAoBD,GACrFz9B,KAAK69B,uBAAuBF,EAAQpH,GAAOa,YAAawG,EAAOF,EAAoBD,GACnFz9B,KAAK69B,uBAAuBF,EAAQpH,GAAOW,cAAekC,EAASsE,EAAoBD,GACvFz9B,KAAK69B,uBAAuBF,EAAQpH,GAAOG,MAAO0C,EAASsE,EAAoBD,GACxEE,GAYXL,EAAep9B,UAAU29B,uBAAyB,SAAUF,EAAQ/iB,EAAWwe,EAAS0E,EAAeL,GACnG,IAAIh3B,EAAQzG,KACR+9B,EAAkB3E,EAAQ4E,OAAO,SAAUlS,GAAU,OAAOA,EAAOrU,OAASmD,IAChFmjB,EAAgBrsB,KAAK1R,KAAKi+B,gBAAgBztB,KAAKxQ,OAC/C+9B,EAAgBn0B,QAAQ,SAAUkiB,GAC9B,IAAIoS,EAAqBz3B,EAAM03B,yBAAyBrS,EAAQ2R,GAChEK,EAAcl0B,QAAQ,SAAUw0B,GACxBA,EAAaxS,WAAWE,EAAOrU,OAC/BkmB,EAAO57B,KAAKq8B,EAAavS,YAAYqS,EAAoBz3B,EAAM82B,cAW/ED,EAAep9B,UAAUi+B,yBAA2B,SAAUrS,EAAQ2R,GAClE,MAAoB,UAAhB3R,EAAOrU,MAAoC,kBAAhBqU,EAAOrU,KAC3BqU,GAGPA,EAAOb,SAAWwS,EAAW1e,wBAE7B+M,EAAOlN,UAAWkN,EAAOI,aAAclsB,KAAKsqB,QACrCwB,IASfwR,EAAep9B,UAAU+9B,gBAAkB,SAAUzyB,EAAG7L,GACpD,GAAmB,MAAf6L,EAAEoT,WAAoC,MAAfjf,EAAEif,UACzB,MAAMnc,EAAe,sCAEzB,IAAI47B,EAAW,IAAI5hB,GAAUjR,EAAEoT,UAAWpT,EAAE0gB,cACxCoS,EAAW,IAAI7hB,GAAU9c,EAAEif,UAAWjf,EAAEusB,cAC5C,OAAOlsB,KAAKsqB,OAAOxN,QAAQuhB,EAAUC,IAElChB,KA4BPiB,GAAsB,WAMtB,SAASA,EAAKhB,EAAQiB,GAClBx+B,KAAKu9B,OAASA,EACdv9B,KAAKy+B,uBACL,IAAI/mB,EAAS1X,KAAKu9B,OAAOvR,iBACrB0S,EAAc,IAAIrH,GAAc3f,EAAOuU,YACvC+R,EAAStmB,EAAOinB,gBAKpB3+B,KAAK4+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,gBAK5F73B,KAAK24B,WAAa,IAAIjD,GAAUuF,EAAec,GAK/C/7B,KAAK++B,gBAAkB,IAAIzB,GAAet9B,KAAKu9B,QAqInD,OAhIAgB,EAAKr+B,UAAU8+B,SAAW,WACtB,OAAOh/B,KAAKu9B,QAKhBgB,EAAKr+B,UAAUm2B,eAAiB,WAC5B,OAAOr2B,KAAK24B,WAAWtC,iBAAiBZ,WAM5C8I,EAAKr+B,UAAU++B,uBAAyB,SAAUnpB,GAC9C,IAAIopB,EAAQl/B,KAAK24B,WAAWrC,wBAC5B,OAAI4I,IAGIl/B,KAAKu9B,OAAOvR,iBAAiBmT,iBAC3BrpB,EAAK9L,YAAck1B,EAAMvgB,kBAAkB7I,EAAK3B,YAAYnK,WACvDk1B,EAAMrgB,SAAS/I,GAGvB,MAKXyoB,EAAKr+B,UAAU8J,QAAU,WACrB,OAA2C,IAApChK,KAAKy+B,oBAAoB38B,QAKpCy8B,EAAKr+B,UAAUk/B,qBAAuB,SAAUpU,GAC5ChrB,KAAKy+B,oBAAoB18B,KAAKipB,IAOlCuT,EAAKr+B,UAAUm/B,wBAA0B,SAAUrU,EAAmBsU,GAClE,IAAIC,KACJ,GAAID,EAAa,CACbh9B,EAA4B,MAArB0oB,EAA2B,mDAClC,IAAIwU,EAASx/B,KAAKu9B,OAAOznB,KACzB9V,KAAKy+B,oBAAoB70B,QAAQ,SAAUw0B,GACvCkB,EAAoCA,EACpC,IAAIG,EAAarB,EAAa7R,kBAAkB+S,EAAaE,GACzDC,GACAF,EAAax9B,KAAK09B,KAI9B,GAAIzU,EAAmB,CAEnB,IADA,IAAI0U,KACK58B,EAAI,EAAGA,EAAI9C,KAAKy+B,oBAAoB38B,SAAUgB,EAAG,CACtD,IAAI68B,EAAW3/B,KAAKy+B,oBAAoB37B,GACxC,GAAK68B,EAASnT,QAAQxB,IAGjB,GAAIA,EAAkByB,iBAAkB,CAEzCiT,EAAYA,EAAU9xB,OAAO5N,KAAKy+B,oBAAoB51B,MAAM/F,EAAI,IAChE,YALA48B,EAAU39B,KAAK49B,GAQvB3/B,KAAKy+B,oBAAsBiB,OAG3B1/B,KAAKy+B,uBAET,OAAOc,GAUXhB,EAAKr+B,UAAUs5B,eAAiB,SAAUE,EAAWC,EAAawD,GAC1DzD,EAAUjiB,OAASgS,GAAcwL,OACJ,OAA7ByE,EAAUxzB,OAAOmsB,UACjB/vB,EAAOtC,KAAK24B,WAAWrC,wBAAyB,6DAChDh0B,EAAOtC,KAAK24B,WAAWvC,uBAAwB,4DAEnD,IAAIqD,EAAez5B,KAAK24B,WACpBrX,EAASthB,KAAK4+B,WAAWpF,eAAeC,EAAcC,EAAWC,EAAawD,GAKlF,OAJAn9B,KAAK4+B,WAAWrF,cAAcjY,EAAO6X,WACrC72B,EAAOgf,EAAO6X,UAAU9C,iBAAiBhB,uBACpCoE,EAAapD,iBAAiBhB,qBAAsB,2DACzDr1B,KAAK24B,WAAarX,EAAO6X,UAClBn5B,KAAK4/B,0BAA0Bte,EAAO8X,QAAS9X,EAAO6X,UAAUhD,gBAAgBV,UAAW,OAMtG8I,EAAKr+B,UAAU2/B,iBAAmB,SAAUzB,GACxC,IAAItI,EAAY91B,KAAK24B,WAAWxC,gBAC5B2J,KACChK,EAAUL,UAAUvX,cACL4X,EAAUL,UAChBnW,aAAaoB,GAAgB,SAAU/X,EAAKqW,GAClD8gB,EAAe/9B,KAAKw0B,GAAOI,iBAAiBhuB,EAAKqW,MAMzD,OAHI8W,EAAUT,sBACVyK,EAAe/9B,KAAKw0B,GAAOE,YAAYX,EAAUL,YAE9Cz1B,KAAK4/B,0BAA0BE,EAAgBhK,EAAUL,UAAW2I,IAS/EG,EAAKr+B,UAAU0/B,0BAA4B,SAAUxG,EAASqE,EAAYzS,GACtE,IAAI8S,EAAgB9S,GACbA,GACDhrB,KAAKy+B,oBACX,OAAOz+B,KAAK++B,gBAAgBvB,yBAAyBpE,EAASqE,EAAYK,IAEvES,KA6BPwB,GAA2B,WAC3B,SAASA,IAUL//B,KAAKggC,UAwMT,OAtMA1gC,OAAOyI,eAAeg4B,EAAW,0BAC7B/3B,IAAK,WAED,OADA1F,EAAO2vB,GAA0B,oCAC1BA,IAEX7jB,IAAK,SAAUC,GACX/L,GAAQ2vB,GAA0B,mDAClCA,GAA2B5jB,GAE/BC,YAAY,EACZC,cAAc,IAKlBwxB,EAAU7/B,UAAU8J,QAAU,WAC1B,OAAOA,EAAQhK,KAAKggC,SASxBD,EAAU7/B,UAAUs5B,eAAiB,SAAUE,EAAWC,EAAasG,GACnE,IAAI5N,EAAUqH,EAAUxzB,OAAOmsB,QAC/B,GAAgB,OAAZA,EAAkB,CAClB,IAAI6N,EAAOv2B,EAAQ3J,KAAKggC,OAAQ3N,GAEhC,OADA/vB,EAAe,MAAR49B,EAAc,gDACdA,EAAK1G,eAAeE,EAAWC,EAAasG,GAGnD,IAAIE,KAIJ,OAHAv2B,EAAQ5J,KAAKggC,OAAQ,SAAUr3B,EAAKu3B,GAChCC,EAAWA,EAASvyB,OAAOsyB,EAAK1G,eAAeE,EAAWC,EAAasG,MAEpEE,GAafJ,EAAU7/B,UAAUk/B,qBAAuB,SAAUrT,EAAOf,EAAmB2O,EAAauB,EAAakF,GACrG,IAAI/N,EAAUtG,EAAMwE,kBAChB2P,EAAOv2B,EAAQ3J,KAAKggC,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,GACvBn5B,KAAKggC,OAAO3N,GAAW6N,EAI3B,OADAA,EAAKd,qBAAqBpU,GACnBkV,EAAKL,iBAAiB7U,IAajC+U,EAAU7/B,UAAUm/B,wBAA0B,SAAUtT,EAAOf,EAAmBsU,GAC9E,IAAIjN,EAAUtG,EAAMwE,kBAChB+P,KACAf,KACAgB,EAAkBvgC,KAAKwgC,kBAC3B,GAAgB,YAAZnO,EAAuB,CAEvB,IAAIhB,EAASrxB,KACb4J,EAAQ5J,KAAKggC,OAAQ,SAAUS,EAAaP,GACxCX,EAAeA,EAAa3xB,OAAOsyB,EAAKb,wBAAwBrU,EAAmBsU,IAC/EY,EAAKl2B,mBACEqnB,EAAO2O,OAAOS,GAEhBP,EACAlB,WACAhT,iBACAmT,gBACDmB,EAAQv+B,KAAKm+B,EAAKlB,mBAK7B,CAED,IAAIkB,EAAOv2B,EAAQ3J,KAAKggC,OAAQ3N,GAC5B6N,IACAX,EAAeA,EAAa3xB,OAAOsyB,EAAKb,wBAAwBrU,EAAmBsU,IAC/EY,EAAKl2B,mBACEhK,KAAKggC,OAAO3N,GAEd6N,EACAlB,WACAhT,iBACAmT,gBACDmB,EAAQv+B,KAAKm+B,EAAKlB,cASlC,OAJIuB,IAAoBvgC,KAAKwgC,mBAEzBF,EAAQv+B,KAAK,IAAIg+B,EAAUvW,uBAAuBuC,EAAMsB,KAAMtB,EAAMjW,QAE/DwqB,QAASA,EAAS3C,OAAQ4B,IAKvCQ,EAAU7/B,UAAUwgC,cAAgB,WAChC,IAAIj6B,EAAQzG,KAEZ,OADaV,OAAOmS,KAAKzR,KAAKggC,QAAQ71B,IAAI,SAAUxB,GAAO,OAAOlC,EAAMu5B,OAAOr3B,KACjEq1B,OAAO,SAAUkC,GAC3B,OAAQA,EACHlB,WACAhT,iBACAmT,kBAQbY,EAAU7/B,UAAU++B,uBAAyB,SAAUnpB,GACnD,IAAIolB,EAAc,KAIlB,OAHAtxB,EAAQ5J,KAAKggC,OAAQ,SAAUr3B,EAAKu3B,GAChChF,EAAcA,GAAegF,EAAKjB,uBAAuBnpB,KAEtDolB,GAMX6E,EAAU7/B,UAAUygC,aAAe,SAAU5U,GAEzC,GADaA,EAAMC,iBACRmT,eACP,OAAOn/B,KAAK4gC,kBAGZ,IAAIvO,EAAUtG,EAAMwE,kBACpB,OAAO5mB,EAAQ3J,KAAKggC,OAAQ3N,IAOpC0N,EAAU7/B,UAAU2gC,mBAAqB,SAAU9U,GAC/C,OAAmC,MAA5B/rB,KAAK2gC,aAAa5U,IAK7BgU,EAAU7/B,UAAUsgC,gBAAkB,WAClC,OAAiC,MAA1BxgC,KAAK4gC,mBAKhBb,EAAU7/B,UAAU0gC,gBAAkB,WAClC,IF/rNkBl3B,EAASa,EAC3B5B,EEosNA,OFrsNkBe,EE+rNW1J,KAAKggC,QF9rNlCr3B,EAAM2B,EAAQZ,EE8rN4B,SAAUw2B,GAChD,OAAOA,EACFlB,WACAhT,iBACAmT,gBFlsNc50B,KACbb,EAAIf,KEmsNS,MAEpBo3B,KA2BPe,GAA+B,WAC/B,SAASA,EAAcC,GACnB/gC,KAAK+gC,WAAaA,EAkLtB,OA3KAD,EAAc5gC,UAAU8gC,SAAW,SAAUlrB,EAAM4G,GAC/C,GAAI5G,EAAK9L,UACL,OAAO,IAAI82B,EAAc,IAAI3N,GAAczW,IAG3C,IAAIukB,EAAWjhC,KAAK+gC,WAAWtN,yBAAyB3d,GACxD,GAAgB,MAAZmrB,EAAkB,CAClB,IAAIC,EAAeD,EAASnrB,KACxBlU,EAAQq/B,EAASr/B,MACjBoT,EAAenB,GAAKmB,aAAaksB,EAAcprB,GAEnD,OADAlU,EAAQA,EAAMud,YAAYnK,EAAc0H,GACjC,IAAIokB,EAAc9gC,KAAK+gC,WAAW3yB,IAAI8yB,EAAct/B,IAG3D,IAAIoxB,EAAU,IAAIG,GAAczW,GAEhC,OAAO,IAAIokB,EADQ9gC,KAAK+gC,WAAWnN,QAAQ9d,EAAMkd,KAU7D8N,EAAc5gC,UAAUihC,UAAY,SAAUrrB,EAAMsrB,GAChD,IAAIC,EAAWrhC,KAIf,OAHA4J,EAAQw3B,EAAS,SAAUlQ,EAAUxU,GACjC2kB,EAAWA,EAASL,SAASlrB,EAAKjB,MAAMqc,GAAWxU,KAEhD2kB,GASXP,EAAc5gC,UAAUohC,YAAc,SAAUxrB,GAC5C,OAAIA,EAAK9L,UACE82B,EAAc7N,MAId,IAAI6N,EADQ9gC,KAAK+gC,WAAWnN,QAAQ9d,EAAMqd,GAAcF,SAWvE6N,EAAc5gC,UAAUqhC,iBAAmB,SAAUzrB,GACjD,OAAqC,MAA9B9V,KAAKwhC,gBAAgB1rB,IAShCgrB,EAAc5gC,UAAUshC,gBAAkB,SAAU1rB,GAChD,IAAImrB,EAAWjhC,KAAK+gC,WAAWtN,yBAAyB3d,GACxD,OAAgB,MAAZmrB,EACOjhC,KAAK+gC,WACP/4B,IAAIi5B,EAASnrB,MACb+I,SAAShL,GAAKmB,aAAaisB,EAASnrB,KAAMA,IAGxC,MAQfgrB,EAAc5gC,UAAUuhC,oBAAsB,WAC1C,IAAI1O,KACArW,EAAO1c,KAAK+gC,WAAWn/B,MAgB3B,OAfY,MAAR8a,EAEKA,EAAKwB,cACNxB,EAAK4C,aAAaoB,GAAgB,SAAU9B,EAAWI,GACnD+T,EAAShxB,KAAK,IAAI0a,GAAUmC,EAAWI,MAK/Chf,KAAK+gC,WAAWhO,SAAShR,iBAAiB,SAAUnD,EAAWqG,GACpC,MAAnBA,EAAUrjB,OACVmxB,EAAShxB,KAAK,IAAI0a,GAAUmC,EAAWqG,EAAUrjB,UAItDmxB,GAMX+N,EAAc5gC,UAAUwhC,mBAAqB,SAAU5rB,GACnD,GAAIA,EAAK9L,UACL,OAAOhK,KAGP,IAAI2hC,EAAgB3hC,KAAKwhC,gBAAgB1rB,GACzC,OACW,IAAIgrB,EADM,MAAjBa,EACyB,IAAIxO,GAAcwO,GAGlB3hC,KAAK+gC,WAAW/N,QAAQld,KAQ7DgrB,EAAc5gC,UAAU8J,QAAU,WAC9B,OAAOhK,KAAK+gC,WAAW/2B,WAQ3B82B,EAAc5gC,UAAUyH,MAAQ,SAAU+U,GACtC,OAAOokB,EAAcc,mBAAmB/tB,GAAKof,MAAOjzB,KAAK+gC,WAAYrkB,IAKzEokB,EAAc7N,MAAQ,IAAI6N,EAAc,IAAI3N,GAAc,OAQ1D2N,EAAcc,mBAAqB,SAAU5sB,EAAc6sB,EAAWnlB,GAClE,GAAuB,MAAnBmlB,EAAUjgC,MAEV,OAAO8a,EAAKyC,YAAYnK,EAAc6sB,EAAUjgC,OAGhD,IAAIkgC,EAAkB,KAgBtB,OAfAD,EAAU9O,SAAShR,iBAAiB,SAAUmP,EAAUjM,GACnC,cAAbiM,GAGA5uB,EAA2B,OAApB2iB,EAAUrjB,MAAgB,6CACjCkgC,EAAkB7c,EAAUrjB,OAG5B8a,EAAOokB,EAAcc,mBAAmB5sB,EAAaH,MAAMqc,GAAWjM,EAAWvI,KAIpFA,EAAKmC,SAAS7J,GAAchL,WAAiC,OAApB83B,IAC1CplB,EAAOA,EAAKyC,YAAYnK,EAAaH,MAAM,aAAcitB,IAEtDplB,GAGRokB,KAyBPiB,GAA2B,WAC3B,SAASA,IAQL/hC,KAAKgiC,eAAiBlB,GAAc7N,MASpCjzB,KAAKiiC,cACLjiC,KAAKkiC,cAAgB,EAudzB,OA/cAH,EAAU7hC,UAAUiiC,YAAc,SAAUrsB,GACxC,OAAO,IAAIssB,GAAatsB,EAAM9V,OAUlC+hC,EAAU7hC,UAAUmiC,aAAe,SAAUvsB,EAAMkU,EAAMsY,EAASC,GAC9DjgC,EAAOggC,EAAUtiC,KAAKkiC,aAAc,qDACpB57B,IAAZi8B,IACAA,GAAU,GAEdviC,KAAKiiC,WAAWlgC,MACZ+T,KAAMA,EACNkU,KAAMA,EACNsY,QAASA,EACTC,QAASA,IAETA,IACAviC,KAAKgiC,eAAiBhiC,KAAKgiC,eAAehB,SAASlrB,EAAMkU,IAE7DhqB,KAAKkiC,aAAeI,GASxBP,EAAU7hC,UAAUsiC,SAAW,SAAU1sB,EAAMumB,EAAiBiG,GAC5DhgC,EAAOggC,EAAUtiC,KAAKkiC,aAAc,gDACpCliC,KAAKiiC,WAAWlgC,MACZ+T,KAAMA,EACNid,SAAUsJ,EACViG,QAASA,EACTC,SAAS,IAEbviC,KAAKgiC,eAAiBhiC,KAAKgiC,eAAeb,UAAUrrB,EAAMumB,GAC1Dr8B,KAAKkiC,aAAeI,GAMxBP,EAAU7hC,UAAUuiC,SAAW,SAAUH,GACrC,IAAK,IAAIx/B,EAAI,EAAGA,EAAI9C,KAAKiiC,WAAWngC,OAAQgB,IAAK,CAC7C,IAAI4/B,EAAS1iC,KAAKiiC,WAAWn/B,GAC7B,GAAI4/B,EAAOJ,UAAYA,EACnB,OAAOI,EAGf,OAAO,MAUXX,EAAU7hC,UAAUohC,YAAc,SAAUgB,GAKxC,IAAI77B,EAAQzG,KACRwnB,EAAMxnB,KAAKiiC,WAAWU,UAAU,SAAUzwB,GAC1C,OAAOA,EAAEowB,UAAYA,IAEzBhgC,EAAOklB,GAAO,EAAG,gDACjB,IAAIob,EAAgB5iC,KAAKiiC,WAAWza,GACpCxnB,KAAKiiC,WAAWY,OAAOrb,EAAK,GAI5B,IAHA,IAAIsb,EAAyBF,EAAcL,QACvCQ,GAAsC,EACtCjgC,EAAI9C,KAAKiiC,WAAWngC,OAAS,EAC1BghC,GAA0BhgC,GAAK,GAAG,CACrC,IAAIkgC,EAAehjC,KAAKiiC,WAAWn/B,GAC/BkgC,EAAaT,UACTz/B,GAAK0kB,GACLxnB,KAAKijC,oBAAoBD,EAAcJ,EAAc9sB,MAErDgtB,GAAyB,EAEpBF,EAAc9sB,KAAKrM,SAASu5B,EAAaltB,QAE9CitB,GAAsC,IAG9CjgC,IAEJ,GAAKggC,EAGA,CAAA,GAAIC,EAGL,OADA/iC,KAAKkjC,cACE,EAIP,GAAIN,EAAc5Y,KACdhqB,KAAKgiC,eAAiBhiC,KAAKgiC,eAAeV,YAAYsB,EAAc9sB,UAEnE,CACD,IAAIid,EAAW6P,EAAc7P,SAC7BnpB,EAAQmpB,EAAU,SAAUnU,GACxBnY,EAAMu7B,eAAiBv7B,EAAMu7B,eAAeV,YAAYsB,EAAc9sB,KAAKjB,MAAM+J,MAGzF,OAAO,EAlBP,OAAO,GA4BfmjB,EAAU7hC,UAAUijC,qBAAuB,SAAUrtB,GACjD,OAAO9V,KAAKgiC,eAAeR,gBAAgB1rB,IAY/CisB,EAAU7hC,UAAUq7B,uBAAyB,SAAU6H,EAAUjG,EAAqBkG,EAAmBC,GACrG,GAAKD,GAAsBC,EAqBtB,CACD,IAAInJ,EAAQn6B,KAAKgiC,eAAeN,mBAAmB0B,GACnD,IAAKE,GAAuBnJ,EAAMnwB,UAC9B,OAAOmzB,EAIP,GAAKmG,GACsB,MAAvBnG,GACChD,EAAMoH,iBAAiB1tB,GAAKof,OAG5B,CACD,IAMIsQ,EAAcxB,EAAUyB,WAAWxjC,KAAKiiC,WAN/B,SAAUwB,GACnB,OAASA,EAAMlB,SAAWe,MACpBD,KACIA,EAAkBrsB,QAAQysB,EAAMnB,YACrCmB,EAAM3tB,KAAKrM,SAAS25B,IAAaA,EAAS35B,SAASg6B,EAAM3tB,QAEFstB,GAC5DM,EAAevG,GAAuBtW,GAAatI,WACvD,OAAOglB,EAAY57B,MAAM+7B,GAXzB,OAAO,KA9Bf,IAAI/B,EAAgB3hC,KAAKgiC,eAAeR,gBAAgB4B,GACxD,GAAqB,MAAjBzB,EACA,OAAOA,EAGP,IAAIgC,EAAW3jC,KAAKgiC,eAAeN,mBAAmB0B,GACtD,GAAIO,EAAS35B,UACT,OAAOmzB,EAEN,GAA2B,MAAvBA,GACJwG,EAASpC,iBAAiB1tB,GAAKof,OAI/B,CACD,IAAIyQ,EAAevG,GAAuBtW,GAAatI,WACvD,OAAOolB,EAASh8B,MAAM+7B,GAJtB,OAAO,MA0CvB3B,EAAU7hC,UAAUm7B,0BAA4B,SAAU+H,EAAUQ,GAChE,IAAIzI,EAAmBtU,GAAatI,WAChCslB,EAAc7jC,KAAKgiC,eAAeR,gBAAgB4B,GACtD,GAAIS,EAOA,OANKA,EAAY3lB,cAEb2lB,EAAYvkB,aAAaoB,GAAgB,SAAU9B,EAAWyU,GAC1D8H,EAAmBA,EAAiBlc,qBAAqBL,EAAWyU,KAGrE8H,EAEN,GAAIyI,EAAwB,CAG7B,IAAIE,EAAU9jC,KAAKgiC,eAAeN,mBAAmB0B,GAWrD,OAVAQ,EAAuBtkB,aAAaoB,GAAgB,SAAU9B,EAAWI,GACrE,IAAItC,EAAOonB,EACNpC,mBAAmB,IAAI7tB,GAAK+K,IAC5BjX,MAAMqX,GACXmc,EAAmBA,EAAiBlc,qBAAqBL,EAAWlC,KAGxEonB,EAAQrC,sBAAsB73B,QAAQ,SAAU+a,GAC5CwW,EAAmBA,EAAiBlc,qBAAqB0F,EAAU7c,KAAM6c,EAAUjI,QAEhFye,EASP,OAJYn7B,KAAKgiC,eAAeN,mBAAmB0B,GAC7C3B,sBAAsB73B,QAAQ,SAAU+a,GAC1CwW,EAAmBA,EAAiBlc,qBAAqB0F,EAAU7c,KAAM6c,EAAUjI,QAEhFye,GAuBf4G,EAAU7hC,UAAUw7B,mCAAqC,SAAU0H,EAAU1Y,EAAWqZ,EAAmBC,GACvG1hC,EAAOyhC,GAAqBC,EAAoB,6DAChD,IAAIluB,EAAOstB,EAASvuB,MAAM6V,GAC1B,GAAI1qB,KAAKgiC,eAAeT,iBAAiBzrB,GAGrC,OAAO,KAIP,IAAImuB,EAAajkC,KAAKgiC,eAAeN,mBAAmB5rB,GACxD,OAAImuB,EAAWj6B,UAEJg6B,EAAmBnlB,SAAS6L,GAS5BuZ,EAAWt8B,MAAMq8B,EAAmBnlB,SAAS6L,KAahEqX,EAAU7hC,UAAU44B,kBAAoB,SAAUsK,EAAUlS,EAAU8S,GAClE,IAAIluB,EAAOstB,EAASvuB,MAAMqc,GACtByQ,EAAgB3hC,KAAKgiC,eAAeR,gBAAgB1rB,GACxD,OAAqB,MAAjB6rB,EACOA,EAGHqC,EAAmBxO,mBAAmBtE,GACrBlxB,KAAKgiC,eAAeN,mBAAmB5rB,GACtCnO,MAAMq8B,EAAmBvO,UAAU9W,kBAAkBuS,IAGhE,MAYnB6Q,EAAU7hC,UAAU86B,eAAiB,SAAUllB,GAC3C,OAAO9V,KAAKgiC,eAAeR,gBAAgB1rB,IAc/CisB,EAAU7hC,UAAU+4B,iBAAmB,SAAUmK,EAAUrK,EAAoB/Q,EAAWlG,EAAOjP,EAAS0M,GACtG,IAAI2kB,EACA/J,EAAQn6B,KAAKgiC,eAAeN,mBAAmB0B,GAC/CzB,EAAgBxH,EAAMqH,gBAAgB3tB,GAAKof,OAC/C,GAAqB,MAAjB0O,EACAuC,EAAYvC,MAEX,CAAA,GAA0B,MAAtB5I,EAKL,SAJAmL,EAAY/J,EAAMxyB,MAAMoxB,GAO5B,IADAmL,EAAYA,EAAU3jB,UAAUhB,IACjBvV,WAAck6B,EAAUhmB,aAgBnC,SATA,IANA,IAAI8a,KACAtjB,EAAM6J,EAAM1C,aACZqJ,EAAOrT,EACLqxB,EAAUtgB,uBAAuBoE,EAAWzI,GAC5C2kB,EAAUvgB,gBAAgBqE,EAAWzI,GACvCve,EAAOklB,EAAK7E,UACTrgB,GAAQg4B,EAAMl3B,OAASggB,GACG,IAAzBpM,EAAI1U,EAAMgnB,IACVgR,EAAMj3B,KAAKf,GAEfA,EAAOklB,EAAK7E,UAEhB,OAAO2X,GAYf+I,EAAU7hC,UAAU+iC,oBAAsB,SAAUkB,EAAaruB,GAC7D,OAAIquB,EAAYna,KACLma,EAAYruB,KAAKrM,SAASqM,KAIxBxL,EAAQ65B,EAAYpR,SAAU,SAAUM,EAAWzU,GACxD,OAAOulB,EAAYruB,KAAKjB,MAAM+J,GAAWnV,SAASqM,MAQ9DisB,EAAU7hC,UAAUgjC,WAAa,WAC7BljC,KAAKgiC,eAAiBD,EAAUyB,WAAWxjC,KAAKiiC,WAAYF,EAAUqC,eAAgBvwB,GAAKof,OACvFjzB,KAAKiiC,WAAWngC,OAAS,EACzB9B,KAAKkiC,aAAeliC,KAAKiiC,WAAWjiC,KAAKiiC,WAAWngC,OAAS,GAAGwgC,QAGhEtiC,KAAKkiC,cAAgB,GAU7BH,EAAUqC,eAAiB,SAAUX,GACjC,OAAOA,EAAMlB,SAYjBR,EAAUyB,WAAa,SAAUa,EAAQrG,EAAQsG,GAE7C,IADA,IAAIC,EAAgBzD,GAAc7N,MACzBnwB,EAAI,EAAGA,EAAIuhC,EAAOviC,SAAUgB,EAAG,CACpC,IAAI2gC,EAAQY,EAAOvhC,GAInB,GAAIk7B,EAAOyF,GAAQ,CACf,IAAIlH,EAAYkH,EAAM3tB,KAClBd,OAAe,EACnB,GAAIyuB,EAAMzZ,KACFsa,EAAS76B,SAAS8yB,IAClBvnB,EAAenB,GAAKmB,aAAasvB,EAAU/H,GAC3CgI,EAAgBA,EAAcvD,SAAShsB,EAAcyuB,EAAMzZ,OAEtDuS,EAAU9yB,SAAS66B,KACxBtvB,EAAenB,GAAKmB,aAAaunB,EAAW+H,GAC5CC,EAAgBA,EAAcvD,SAASntB,GAAKof,MAAOwQ,EAAMzZ,KAAKnL,SAAS7J,SAM1E,CAAA,IAAIyuB,EAAM1Q,SAwBX,MAAMtwB,EAAe,8CAvBrB,GAAI6hC,EAAS76B,SAAS8yB,GAClBvnB,EAAenB,GAAKmB,aAAasvB,EAAU/H,GAC3CgI,EAAgBA,EAAcpD,UAAUnsB,EAAcyuB,EAAM1Q,eAE3D,GAAIwJ,EAAU9yB,SAAS66B,GAExB,IADAtvB,EAAenB,GAAKmB,aAAaunB,EAAW+H,IAC3Bt6B,UACbu6B,EAAgBA,EAAcpD,UAAUttB,GAAKof,MAAOwQ,EAAM1Q,cAEzD,CACD,IAAIle,EAAQlL,EAAQ85B,EAAM1Q,SAAU/d,EAAab,YACjD,GAAIU,EAAO,CAEP,IAAI2vB,EAAW3vB,EAAMgK,SAAS7J,EAAaX,YAC3CkwB,EAAgBA,EAAcvD,SAASntB,GAAKof,MAAOuR,OAa3E,OAAOD,GAEJxC,KAQPK,GAA8B,WAK9B,SAASA,EAAatsB,EAAM+rB,GACxB7hC,KAAKykC,UAAY3uB,EACjB9V,KAAK+gC,WAAac,EA4FtB,OAhFAO,EAAaliC,UAAUq7B,uBAAyB,SAAU4B,EAAqBkG,EAAmBC,GAC9F,OAAOtjC,KAAK+gC,WAAWxF,uBAAuBv7B,KAAKykC,UAAWtH,EAAqBkG,EAAmBC,IAS1GlB,EAAaliC,UAAUm7B,0BAA4B,SAAUuI,GACzD,OAAO5jC,KAAK+gC,WAAW1F,0BAA0Br7B,KAAKykC,UAAWb,IAqBrExB,EAAaliC,UAAUw7B,mCAAqC,SAAU5lB,EAAMiuB,EAAmBC,GAC3F,OAAOhkC,KAAK+gC,WAAWrF,mCAAmC17B,KAAKykC,UAAW3uB,EAAMiuB,EAAmBC,IAUvG5B,EAAaliC,UAAU86B,eAAiB,SAAUllB,GAC9C,OAAO9V,KAAK+gC,WAAW/F,eAAeh7B,KAAKykC,UAAU5vB,MAAMiB,KAa/DssB,EAAaliC,UAAU+4B,iBAAmB,SAAUF,EAAoB/Q,EAAWlG,EAAOjP,EAAS0M,GAC/F,OAAOvf,KAAK+gC,WAAW9H,iBAAiBj5B,KAAKykC,UAAW1L,EAAoB/Q,EAAWlG,EAAOjP,EAAS0M,IAU3G6iB,EAAaliC,UAAU44B,kBAAoB,SAAU5H,EAAUwT,GAC3D,OAAO1kC,KAAK+gC,WAAWjI,kBAAkB94B,KAAKykC,UAAWvT,EAAUwT,IAQvEtC,EAAaliC,UAAU2U,MAAQ,SAAU+J,GACrC,OAAO,IAAIwjB,EAAapiC,KAAKykC,UAAU5vB,MAAM+J,GAAY5e,KAAK+gC,aAE3DqB,KAwCPuC,GAA0B,WAK1B,SAASA,EAASC,GACd5kC,KAAK4kC,gBAAkBA,EAMvB5kC,KAAK6kC,eAAiB1R,GAAcF,MAMpCjzB,KAAK8kC,kBAAoB,IAAI/C,GAC7B/hC,KAAK+kC,kBACL/kC,KAAKglC,kBA0nBT,OA/mBAL,EAASzkC,UAAU+kC,mBAAqB,SAAUnvB,EAAMovB,EAAS5C,EAASC,GAGtE,OADAviC,KAAK8kC,kBAAkBzC,aAAavsB,EAAMovB,EAAS5C,EAASC,GACvDA,EAIMviC,KAAKmlC,4BAA4B,IAAIrQ,GAAU5C,GAAgBK,KAAMzc,EAAMovB,QAW1FP,EAASzkC,UAAUklC,eAAiB,SAAUtvB,EAAMumB,EAAiBiG,GAEjEtiC,KAAK8kC,kBAAkBtC,SAAS1sB,EAAMumB,EAAiBiG,GACvD,IAAI+C,EAAalS,GAAcC,WAAWiJ,GAC1C,OAAOr8B,KAAKmlC,4BAA4B,IAAInQ,GAAM9C,GAAgBK,KAAMzc,EAAMuvB,KASlFV,EAASzkC,UAAUo6B,aAAe,SAAUgI,EAAS1P,QAClC,IAAXA,IAAqBA,GAAS,GAClC,IAAI6Q,EAAQzjC,KAAK8kC,kBAAkBrC,SAASH,GAE5C,GADuBtiC,KAAK8kC,kBAAkBxD,YAAYgB,GAIrD,CACD,IAAIgD,EAAiBnS,GAAcF,MAUnC,OATkB,MAAdwQ,EAAMzZ,KAENsb,EAAiBA,EAAel3B,IAAIyF,GAAKof,OAAO,GAGhDrpB,EAAQ65B,EAAM1Q,SAAU,SAAUxe,EAAYmI,GAC1C4oB,EAAiBA,EAAel3B,IAAI,IAAIyF,GAAKU,GAAamI,KAG3D1c,KAAKmlC,4BAA4B,IAAIzS,GAAa+Q,EAAM3tB,KAAMwvB,EAAgB1S,IAbrF,UAuBR+R,EAASzkC,UAAUqlC,qBAAuB,SAAUzvB,EAAMovB,GACtD,OAAOllC,KAAKmlC,4BAA4B,IAAIrQ,GAAU5C,GAAgBM,OAAQ1c,EAAMovB,KASxFP,EAASzkC,UAAUslC,iBAAmB,SAAU1vB,EAAMumB,GAClD,IAAIgJ,EAAalS,GAAcC,WAAWiJ,GAC1C,OAAOr8B,KAAKmlC,4BAA4B,IAAInQ,GAAM9C,GAAgBM,OAAQ1c,EAAMuvB,KAQpFV,EAASzkC,UAAUulC,oBAAsB,SAAU3vB,GAC/C,OAAO9V,KAAKmlC,4BAA4B,IAAIvQ,GAAe1C,GAAgBM,OAAQ1c,KAUvF6uB,EAASzkC,UAAUwlC,0BAA4B,SAAU5vB,EAAMkU,EAAM2b,GACjE,IAAIC,EAAW5lC,KAAK6lC,gBAAgBF,GACpC,GAAgB,MAAZC,EAAkB,CAClB,IAAIE,EAAInB,EAASoB,eAAeH,GAC5BI,EAAYF,EAAEhwB,KAAMuc,EAAUyT,EAAEzT,QAChCrd,EAAenB,GAAKmB,aAAagxB,EAAWlwB,GAC5CtU,EAAK,IAAIszB,GAAU5C,GAAgBO,qBAAqBJ,GAAUrd,EAAcgV,GACpF,OAAOhqB,KAAKimC,sBAAsBD,EAAWxkC,GAI7C,UAWRmjC,EAASzkC,UAAUgmC,sBAAwB,SAAUpwB,EAAMumB,EAAiBsJ,GACxE,IAAIC,EAAW5lC,KAAK6lC,gBAAgBF,GACpC,GAAIC,EAAU,CACV,IAAIE,EAAInB,EAASoB,eAAeH,GAC5BI,EAAYF,EAAEhwB,KAAMuc,EAAUyT,EAAEzT,QAChCrd,EAAenB,GAAKmB,aAAagxB,EAAWlwB,GAC5CuvB,EAAalS,GAAcC,WAAWiJ,GACtC76B,EAAK,IAAIwzB,GAAM9C,GAAgBO,qBAAqBJ,GAAUrd,EAAcqwB,GAChF,OAAOrlC,KAAKimC,sBAAsBD,EAAWxkC,GAI7C,UAURmjC,EAASzkC,UAAUimC,0BAA4B,SAAUrwB,EAAM6vB,GAC3D,IAAIC,EAAW5lC,KAAK6lC,gBAAgBF,GACpC,GAAIC,EAAU,CACV,IAAIE,EAAInB,EAASoB,eAAeH,GAC5BI,EAAYF,EAAEhwB,KAAMuc,EAAUyT,EAAEzT,QAChCrd,EAAenB,GAAKmB,aAAagxB,EAAWlwB,GAC5CtU,EAAK,IAAIozB,GAAe1C,GAAgBO,qBAAqBJ,GAAUrd,GAC3E,OAAOhV,KAAKimC,sBAAsBD,EAAWxkC,GAI7C,UAURmjC,EAASzkC,UAAUk/B,qBAAuB,SAAUrT,EAAOf,GACvD,IAAIlV,EAAOiW,EAAMjW,KACbolB,EAAc,KACdkL,GAA2B,EAG/BpmC,KAAK6kC,eAAevQ,cAAcxe,EAAM,SAAUuwB,EAAiBC,GAC/D,IAAItxB,EAAenB,GAAKmB,aAAaqxB,EAAiBvwB,GACtDolB,EAAcA,GAAeoL,EAAGrH,uBAAuBjqB,GACvDoxB,EACIA,GAA4BE,EAAG9F,oBAEvC,IAUIJ,EAVAmG,EAAYvmC,KAAK6kC,eAAe78B,IAAI8N,IACnCywB,GAKDH,EACIA,GAA4BG,EAAU/F,kBAC1CtF,EAAcA,GAAeqL,EAAUtH,uBAAuBprB,GAAKof,SANnEsT,EAAY,IAAIxG,GAChB//B,KAAK6kC,eAAiB7kC,KAAK6kC,eAAez2B,IAAI0H,EAAMywB,IAQrC,MAAfrL,GACAkF,GAAsB,GAGtBA,GAAsB,EACtBlF,EAAcrU,GAAatI,WACbve,KAAK6kC,eAAe7R,QAAQld,GAClC6e,aAAa,SAAU/V,EAAW4nB,GACtC,IAAI5M,EAAgB4M,EAAevH,uBAAuBprB,GAAKof,OAC3D2G,IACAsB,EAAcA,EAAYjc,qBAAqBL,EAAWgb,OAItE,IAAI6M,EAAoBF,EAAU1F,mBAAmB9U,GACrD,IAAK0a,IAAsB1a,EAAMC,iBAAiBmT,eAAgB,CAE9D,IAAIyG,EAAWjB,EAAS+B,cAAc3a,GACtCzpB,IAASsjC,KAAY5lC,KAAKglC,gBAAiB,0CAC3C,IAAIW,EAAMhB,EAASgC,mBACnB3mC,KAAKglC,eAAeY,GAAYD,EAEhC3lC,KAAK+kC,eAAe,IAAMY,GAAOC,EAErC,IAAIjM,EAAc35B,KAAK8kC,kBAAkB3C,YAAYrsB,GACjD6nB,EAAS4I,EAAUnH,qBAAqBrT,EAAOf,EAAmB2O,EAAauB,EAAakF,GAChG,IAAKqG,IAAsBL,EAA0B,CACjD,IAAIlG,EAA0BqG,EAAU5F,aAAa5U,GACrD4R,EAASA,EAAO/vB,OAAO5N,KAAK4mC,eAAe7a,EAAOmU,IAEtD,OAAOvC,GAaXgH,EAASzkC,UAAUm/B,wBAA0B,SAAUtT,EAAOf,EAAmBsU,GAC7E,IAAI74B,EAAQzG,KAER8V,EAAOiW,EAAMjW,KACb+wB,EAAiB7mC,KAAK6kC,eAAe78B,IAAI8N,GACzCypB,KAIJ,GAAIsH,IAC6B,YAA5B9a,EAAMwE,mBACHsW,EAAehG,mBAAmB9U,IAAS,CAI/C,IAAI+a,EAAmBD,EAAexH,wBAAwBtT,EAAOf,EAAmBsU,GACpFuH,EAAe78B,YACfhK,KAAK6kC,eAAiB7kC,KAAK6kC,eAAe51B,OAAO6G,IAErD,IAAIwqB,EAAUwG,EAAiBxG,QAC/Bf,EAAeuH,EAAiBnJ,OAOhC,IAAIoJ,GAAmB,IACnBzG,EAAQqC,UAAU,SAAU5W,GACxB,OAAOA,EAAMC,iBAAiBmT,iBAElC6H,EAAUhnC,KAAK6kC,eAAe3Q,WAAWpe,EAAM,SAAUd,EAAciyB,GACvE,OAAOA,EAAgBzG,oBAE3B,GAAIuG,IAAoBC,EAAS,CAC7B,IAAIhU,EAAUhzB,KAAK6kC,eAAe7R,QAAQld,GAG1C,IAAKkd,EAAQhpB,UAIT,IAFA,IAAIk9B,EAAWlnC,KAAKmnC,gCAAgCnU,GAE3ClwB,EAAI,EAAGA,EAAIokC,EAASplC,SAAUgB,EAAG,CACtC,IAAIo9B,EAAOgH,EAASpkC,GAAIskC,EAAWlH,EAAKlB,WACpCqI,EAAWrnC,KAAKsnC,uBAAuBpH,GAC3ClgC,KAAK4kC,gBAAgB2C,eAAe5C,EAAS6C,mBAAmBJ,GAAWpnC,KAAKynC,aAAaL,GAAWC,EAASK,OAAQL,EAAShsB,aAU9I,IAAK2rB,GAAW1G,EAAQx+B,OAAS,IAAMw9B,EAGnC,GAAIyH,EAAiB,CAGjB/mC,KAAK4kC,gBAAgB+C,cAAchD,EAAS6C,mBAAmBzb,GAD9C,WAIjBuU,EAAQ12B,QAAQ,SAAUg+B,GACtB,IAAIC,EAAcphC,EAAMu+B,eAAeL,EAAS+B,cAAckB,IAC9DnhC,EAAMm+B,gBAAgB+C,cAAchD,EAAS6C,mBAAmBI,GAAgBC,KAK5F7nC,KAAK8nC,YAAYxH,GAKrB,OAAOf,GAWXoF,EAASzkC,UAAUq7B,uBAAyB,SAAUzlB,EAAMutB,GACxD,IACIxB,EAAY7hC,KAAK8kC,kBACjB5J,EAAcl7B,KAAK6kC,eAAe3Q,WAAWpe,EAAM,SAAUke,EAAWuS,GACxE,IAAIvxB,EAAenB,GAAKmB,aAAagf,EAAWle,GAC5ColB,EAAcqL,EAAUtH,uBAAuBjqB,GACnD,GAAIkmB,EACA,OAAOA,IAGf,OAAO2G,EAAUtG,uBAAuBzlB,EAAMolB,EAAamI,GATnC,IAmB5BsB,EAASzkC,UAAUinC,gCAAkC,SAAUnU,GAC3D,OAAOA,EAAQc,KAAK,SAAU9e,EAAc+yB,EAAqBC,GAC7D,GAAID,GAAuBA,EAAoBvH,kBAE3C,OADmBuH,EAAoBnH,mBAKvC,IAAIqH,KAOJ,OANIF,IACAE,EAAUF,EAAoBrH,iBAElC92B,EAAQo+B,EAAU,SAAUr/B,EAAKu/B,GAC7BD,EAAUA,EAAQr6B,OAAOs6B,KAEtBD,KAQnBtD,EAASzkC,UAAU4nC,YAAc,SAAUK,GACvC,IAAK,IAAIp8B,EAAI,EAAGA,EAAIo8B,EAAQrmC,SAAUiK,EAAG,CACrC,IAAIq8B,EAAeD,EAAQp8B,GAC3B,IAAKq8B,EAAapc,iBAAiBmT,eAAgB,CAE/C,IAAIkJ,EAAkB1D,EAAS+B,cAAc0B,GACzCE,EAAkBtoC,KAAKglC,eAAeqD,UACnCroC,KAAKglC,eAAeqD,UACpBroC,KAAK+kC,eAAe,IAAMuD,MAU7C3D,EAAS6C,mBAAqB,SAAUzb,GACpC,OAAIA,EAAMC,iBAAiBmT,iBACtBpT,EAAMC,iBAAiBuc,YAIKxc,EAAMjB,SAG5BiB,GAWf4Y,EAASzkC,UAAU0mC,eAAiB,SAAU7a,EAAOmU,GACjD,IAAIpqB,EAAOiW,EAAMjW,KACb6vB,EAAM3lC,KAAKynC,aAAa1b,GACxBsb,EAAWrnC,KAAKsnC,uBAAuBpH,GACvCvC,EAAS39B,KAAK4kC,gBAAgB2C,eAAe5C,EAAS6C,mBAAmBzb,GAAQ4Z,EAAK0B,EAASK,OAAQL,EAAShsB,YAChH2X,EAAUhzB,KAAK6kC,eAAe7R,QAAQld,GAG1C,GAAI6vB,EACArjC,GAAQ0wB,EAAQpxB,MAAM4+B,kBAAmB,0DAsBzC,IAlBA,IAAIgI,EAAgBxV,EAAQc,KAAK,SAAU9e,EAAc+yB,EAAqBC,GAC1E,IAAKhzB,EAAahL,WACd+9B,GACAA,EAAoBvH,kBACpB,OAAQuH,EAAoBnH,kBAAkB5B,YAI9C,IAAIyJ,KAOJ,OANIV,IACAU,EAAYA,EAAU76B,OAAOm6B,EAAoBrH,gBAAgBv2B,IAAI,SAAU+1B,GAAQ,OAAOA,EAAKlB,eAEvGp1B,EAAQo+B,EAAU,SAAUr/B,EAAK+/B,GAC7BD,EAAYA,EAAU76B,OAAO86B,KAE1BD,IAGN3lC,EAAI,EAAGA,EAAI0lC,EAAc1mC,SAAUgB,EAAG,CAC3C,IAAI6lC,EAAcH,EAAc1lC,GAChC9C,KAAK4kC,gBAAgB+C,cAAchD,EAAS6C,mBAAmBmB,GAAc3oC,KAAKynC,aAAakB,IAGvG,OAAOhL,GAQXgH,EAASzkC,UAAUonC,uBAAyB,SAAUpH,GAClD,IAAIz5B,EAAQzG,KACR+rB,EAAQmU,EAAKlB,WACb2G,EAAM3lC,KAAKynC,aAAa1b,GAC5B,OACI2b,OAAQ,WAEJ,OADYxH,EAAK7J,kBAAoBxP,GAAatI,YACrCsB,QAEjBxE,WAAY,SAAUutB,GAClB,GAAe,OAAXA,EACA,OAAIjD,EACOl/B,EAAM0/B,0BAA0Bpa,EAAMjW,KAAM6vB,GAG5Cl/B,EAAMg/B,oBAAoB1Z,EAAMjW,MAM3C,IAAI+yB,EAhyQC,SAAUphC,EAAMskB,GACrC,IAAI+c,EAAS,gBACA,YAATrhC,EACAqhC,EACI,0FAGS,qBAARrhC,EACLqhC,EAAS,6DAEI,eAARrhC,IACLqhC,EAAS,8BAEb,IAAIhjC,EAAQ,IAAIpD,MAAM+E,EAAO,OAASskB,EAAMjW,KAAKlN,WAAa,KAAOkgC,GAErE,OADAhjC,EAAM2B,KAAOA,EAAKshC,cACXjjC,EAixQwBkjC,CAAmBJ,EAAQ7c,GAC1C,OAAOtlB,EAAM44B,wBAAwBtT,EACf,KAAM8c,MAW5ClE,EAAS+B,cAAgB,SAAU3a,GAC/B,OAAOA,EAAMjW,KAAKlN,WAAa,IAAMmjB,EAAMwE,mBAQ/CoU,EAASoB,eAAiB,SAAUH,GAChC,IAAIqD,EAAarD,EAAS5uB,QAAQ,KAElC,OADA1U,GAAuB,IAAhB2mC,GAAqBA,EAAarD,EAAS9jC,OAAS,EAAG,kBAE1DuwB,QAASuT,EAAS3yB,OAAOg2B,EAAa,GACtCnzB,KAAM,IAAIjC,GAAK+xB,EAAS3yB,OAAO,EAAGg2B,MAS1CtE,EAASzkC,UAAU2lC,gBAAkB,SAAUF,GAC3C,OAAO3lC,KAAK+kC,eAAe,IAAMY,IAQrChB,EAASzkC,UAAUunC,aAAe,SAAU1b,GACxC,IAAI6Z,EAAWjB,EAAS+B,cAAc3a,GACtC,OAAOpiB,EAAQ3J,KAAKglC,eAAgBY,IAOxCjB,EAASgC,iBAAmB,WACxB,OAAOhC,EAASuE,iBAUpBvE,EAASzkC,UAAU+lC,sBAAwB,SAAUD,EAAWtM,GAC5D,IAAI6M,EAAYvmC,KAAK6kC,eAAe78B,IAAIg+B,GACxC1jC,EAAOikC,EAAW,wDAClB,IAAI5M,EAAc35B,KAAK8kC,kBAAkB3C,YAAY6D,GACrD,OAAOO,EAAU/M,eAAeE,EAAWC,EAC1B,OAmBrBgL,EAASzkC,UAAUilC,4BAA8B,SAAUzL,GACvD,OAAO15B,KAAKmpC,sBAAsBzP,EAAW15B,KAAK6kC,eACjC,KAAM7kC,KAAK8kC,kBAAkB3C,YAAYtuB,GAAKof,SAYnE0R,EAASzkC,UAAUipC,sBAAwB,SAAUzP,EAAW0P,EAAelO,EAAavB,GACxF,GAAID,EAAU5jB,KAAK9L,UACf,OAAOhK,KAAKqpC,iCAAiC3P,EAAW0P,EAAelO,EAAavB,GAGpF,IAAI4M,EAAY6C,EAAcphC,IAAI6L,GAAKof,OAEpB,MAAfiI,GAAoC,MAAbqL,IACvBrL,EAAcqL,EAAUtH,uBAAuBprB,GAAKof,QAExD,IAAI0K,KACA/e,EAAY8a,EAAU5jB,KAAK3B,WAC3Bm1B,EAAiB5P,EAAU5G,kBAAkBlU,GAC7CqG,EAAYmkB,EAAcrW,SAAS/qB,IAAI4W,GAC3C,GAAIqG,GAAaqkB,EAAgB,CAC7B,IAAIC,EAAmBrO,EACjBA,EAAYvc,kBAAkBC,GAC9B,KACF4qB,EAAmB7P,EAAY9kB,MAAM+J,GACzC+e,EAASA,EAAO/vB,OAAO5N,KAAKmpC,sBAAsBG,EAAgBrkB,EAAWskB,EAAkBC,IAKnG,OAHIjD,IACA5I,EAASA,EAAO/vB,OAAO24B,EAAU/M,eAAeE,EAAWC,EAAauB,KAErEyC,GAafgH,EAASzkC,UAAUmpC,iCAAmC,SAAU3P,EAAW0P,EAAelO,EAAavB,GACnG,IAAIlzB,EAAQzG,KACRumC,EAAY6C,EAAcphC,IAAI6L,GAAKof,OAEpB,MAAfiI,GAAoC,MAAbqL,IACvBrL,EAAcqL,EAAUtH,uBAAuBprB,GAAKof,QAExD,IAAI0K,KAcJ,OAbAyL,EAAcrW,SAAShR,iBAAiB,SAAUnD,EAAWqG,GACzD,IAAIskB,EAAmBrO,EACjBA,EAAYvc,kBAAkBC,GAC9B,KACF4qB,EAAmB7P,EAAY9kB,MAAM+J,GACrC0qB,EAAiB5P,EAAU5G,kBAAkBlU,GAC7C0qB,IACA3L,EAASA,EAAO/vB,OAAOnH,EAAM4iC,iCAAiCC,EAAgBrkB,EAAWskB,EAAkBC,OAG/GjD,IACA5I,EAASA,EAAO/vB,OAAO24B,EAAU/M,eAAeE,EAAWC,EAAauB,KAErEyC,GAOXgH,EAASuE,cAAgB,EAClBvE,KAuBP8E,GAAgC,WAChC,SAASA,IACLzpC,KAAK0pC,UAAY7iB,GAAatI,WAQlC,OANAkrB,EAAevpC,UAAUu1B,QAAU,SAAU3f,GACzC,OAAO9V,KAAK0pC,UAAU7qB,SAAS/I,IAEnC2zB,EAAevpC,UAAUypC,eAAiB,SAAU7zB,EAAM8zB,GACtD5pC,KAAK0pC,UAAY1pC,KAAK0pC,UAAUvqB,YAAYrJ,EAAM8zB,IAE/CH,KAqBPI,GAAmC,WAInC,SAASA,EAAkBC,GACvB9pC,KAAK8pC,KAAOA,EAsDhB,OAhDAD,EAAkB3pC,UAAU6pC,SAAW,SAAUC,GAC7C,OAAOhqC,KAAK8pC,KAAe,SAAY,SAAEE,GAAcC,KAAK,KAE5D,SAAUpB,GAGN,OAAIA,GAA8B,+BAAlBA,EAASphC,MACrBkG,EAAI,kEACG,MAGAhH,QAAQE,OAAOgiC,MAIlCgB,EAAkB3pC,UAAUgqC,uBAAyB,SAAU7C,GAG3DrnC,KAAK8pC,KAAe,SAAwB,qBAAEzC,IAElDwC,EAAkB3pC,UAAUiqC,0BAA4B,SAAU9C,GAC9DrnC,KAAK8pC,KAAe,SAA2B,wBAAEzC,IAErDwC,EAAkB3pC,UAAUkqC,sBAAwB,WAChD,IAAIC,EAAe,0DACfrqC,KAAK8pC,KAAKhiC,KACV,iFAEA,eAAgB9H,KAAK8pC,KAAKQ,QAC1BD,GACI,uJAIC,mBAAoBrqC,KAAK8pC,KAAKQ,QACnCD,GACI,2JAKJA,GACI,kKAIRt8B,GAAKs8B,IAEFR,KAuBPU,GAAiC,WACjC,SAASA,IACLvqC,KAAKwqC,aAWT,OATAD,EAAgBrqC,UAAUuqC,iBAAmB,SAAU3iC,EAAM4iC,QAC1C,IAAXA,IAAqBA,EAAS,GAC7BjhC,EAASzJ,KAAKwqC,UAAW1iC,KAC1B9H,KAAKwqC,UAAU1iC,GAAQ,GAC3B9H,KAAKwqC,UAAU1iC,IAAS4iC,GAE5BH,EAAgBrqC,UAAU8H,IAAM,WAC5B,OAAOjC,EAAS/F,KAAKwqC,YAElBD,KAkBPI,GAA8B,WAC9B,SAASA,KAkBT,OAhBAA,EAAaC,cAAgB,SAAUpyB,GACnC,IAAIqyB,EAAaryB,EAAS5P,WAI1B,OAHK5I,KAAK8qC,aAAaD,KACnB7qC,KAAK8qC,aAAaD,GAAc,IAAIN,IAEjCvqC,KAAK8qC,aAAaD,IAE7BF,EAAaI,oBAAsB,SAAUvyB,EAAUwyB,GACnD,IAAIH,EAAaryB,EAAS5P,WAI1B,OAHK5I,KAAKirC,WAAWJ,KACjB7qC,KAAKirC,WAAWJ,GAAcG,KAE3BhrC,KAAKirC,WAAWJ,IAE3BF,EAAaG,gBACbH,EAAaM,cACNN,KAwBPO,GAA+B,WAC/B,SAASA,EAAcC,GACnBnrC,KAAKmrC,YAAcA,EACnBnrC,KAAKorC,MAAQ,KAajB,OAXAF,EAAchrC,UAAU8H,IAAM,WAC1B,IAAIqjC,EAAWrrC,KAAKmrC,YAAYnjC,MAC5BsjC,EAAQxhC,EAAMuhC,GAOlB,OANIrrC,KAAKorC,OACLxhC,EAAQ5J,KAAKorC,MAAO,SAAUG,EAAM3pC,GAChC0pC,EAAMC,GAAQD,EAAMC,GAAQ3pC,IAGpC5B,KAAKorC,MAAQC,EACNC,GAEJJ,KAqBPM,GAAuB,IACvBC,GAAuB,IAMvBC,GAA+B,WAK/B,SAASA,EAAcC,EAAYC,GAC/B5rC,KAAK4rC,QAAUA,EACf5rC,KAAK6rC,kBACL7rC,KAAK8rC,eAAiB,IAAIZ,GAAcS,GACxC,IAAI/3B,EAAU43B,IACTC,GAAuBD,IAAwBl5B,KAAKkK,SACzD9I,GAAsB1T,KAAK+rC,aAAav7B,KAAKxQ,MAAOsS,KAAKI,MAAMkB,IAsBnE,OApBA83B,EAAcxrC,UAAU8rC,YAAc,SAAUT,GAC5CvrC,KAAK6rC,eAAeN,IAAQ,GAEhCG,EAAcxrC,UAAU6rC,aAAe,WACnC,IAAItlC,EAAQzG,KACRisC,EAAQjsC,KAAK8rC,eAAe9jC,MAC5BkkC,KACAC,GAAoB,EACxBviC,EAAQqiC,EAAO,SAAUV,EAAM3pC,GACvBA,EAAQ,GAAK6H,EAAShD,EAAMolC,eAAgBN,KAC5CW,EAAcX,GAAQ3pC,EACtBuqC,GAAoB,KAGxBA,GACAnsC,KAAK4rC,QAAQQ,YAAYF,GAG7Bx4B,GAAsB1T,KAAK+rC,aAAav7B,KAAKxQ,MAAOsS,KAAKI,MAAsB,EAAhBJ,KAAKkK,SAnChD,OAqCjBkvB,KAgCPW,GAA4B,WAC5B,SAASA,IAKLrsC,KAAKssC,eAMLtsC,KAAKusC,gBAAkB,EA+E3B,OA1EAF,EAAWnsC,UAAUssC,YAAc,SAAUC,GAGzC,IADA,IAAIC,EAAW,KACN5pC,EAAI,EAAGA,EAAI2pC,EAAc3qC,OAAQgB,IAAK,CAC3C,IAAIqpB,EAAYsgB,EAAc3pC,GAC1B6pC,EAAYxgB,EAAUjB,UACT,OAAbwhB,GAAsBC,EAAUh3B,OAAO+2B,EAASxhB,aAChDlrB,KAAKssC,YAAYvqC,KAAK2qC,GACtBA,EAAW,MAEE,OAAbA,IACAA,EAAW,IAAIE,GAAUD,IAE7BD,EAAS7b,IAAI1E,GAEbugB,GACA1sC,KAAKssC,YAAYvqC,KAAK2qC,IAY9BL,EAAWnsC,UAAU2sC,kBAAoB,SAAU/2B,EAAM22B,GACrDzsC,KAAKwsC,YAAYC,GACjBzsC,KAAK8sC,oCAAoC,SAAUH,GAC/C,OAAOA,EAAUh3B,OAAOG,MAYhCu2B,EAAWnsC,UAAU6sC,0BAA4B,SAAUC,EAAaP,GACpEzsC,KAAKwsC,YAAYC,GACjBzsC,KAAK8sC,oCAAoC,SAAUH,GAC/C,OAAOA,EAAUljC,SAASujC,IAAgBA,EAAYvjC,SAASkjC,MAOvEN,EAAWnsC,UAAU4sC,oCAAsC,SAAUvZ,GACjEvzB,KAAKusC,kBAEL,IADA,IAAIU,GAAU,EACLnqC,EAAI,EAAGA,EAAI9C,KAAKssC,YAAYxqC,OAAQgB,IAAK,CAC9C,IAAIoqC,EAAYltC,KAAKssC,YAAYxpC,GACjC,GAAIoqC,EAEI3Z,EADY2Z,EAAUhiB,YAEtBlrB,KAAKssC,YAAYxpC,GAAGqqC,QACpBntC,KAAKssC,YAAYxpC,GAAK,MAGtBmqC,GAAU,EAIlBA,IACAjtC,KAAKssC,gBAETtsC,KAAKusC,mBAEFF,KAMPO,GAA2B,WAC3B,SAASA,EAAU1yB,GACfla,KAAKka,MAAQA,EAKbla,KAAKotC,WA8BT,OAzBAR,EAAU1sC,UAAU2wB,IAAM,SAAU1E,GAChCnsB,KAAKotC,QAAQrrC,KAAKoqB,IAKtBygB,EAAU1sC,UAAUitC,MAAQ,WACxB,IAAK,IAAIrqC,EAAI,EAAGA,EAAI9C,KAAKotC,QAAQtrC,OAAQgB,IAAK,CAC1C,IAAIqpB,EAAYnsB,KAAKotC,QAAQtqC,GAC7B,GAAkB,OAAdqpB,EAAoB,CACpBnsB,KAAKotC,QAAQtqC,GAAK,KAClB,IAAIuqC,EAAUlhB,EAAUb,iBACpBnb,GACAxC,EAAI,UAAYwe,EAAUvjB,YAE9B0K,GAAe+5B,MAO3BT,EAAU1sC,UAAUgrB,QAAU,WAC1B,OAAOlrB,KAAKka,OAET0yB,KAsBPU,GAA8B,WAI9B,SAASA,EAAaC,GAClBvtC,KAAKutC,eAAiBA,EACtBvtC,KAAKwtC,cACLlrC,EAAO7C,MAAMqE,QAAQypC,IAAmBA,EAAezrC,OAAS,EAAG,8BA6CvE,OAtCAwrC,EAAaptC,UAAUutC,QAAU,SAAU7yB,GAEvC,IADA,IAAI1K,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,EAAK,GAAKzF,UAAUyF,GAEjC,GAAI5N,MAAMqE,QAAQ9D,KAAKwtC,WAAW5yB,IAG9B,IADA,IAAI8yB,EAAY1tC,KAAKwtC,WAAW5yB,GAAW/R,QAClC/F,EAAI,EAAGA,EAAI4qC,EAAU5rC,OAAQgB,IAClC4qC,EAAU5qC,GAAGiE,SAASY,MAAM+lC,EAAU5qC,GAAG8J,QAASsD,IAI9Do9B,EAAaptC,UAAUquB,GAAK,SAAU3T,EAAW7T,EAAU6F,GACvD5M,KAAK2tC,mBAAmB/yB,GACxB5a,KAAKwtC,WAAW5yB,GAAa5a,KAAKwtC,WAAW5yB,OAC7C5a,KAAKwtC,WAAW5yB,GAAW7Y,MAAOgF,SAAUA,EAAU6F,QAASA,IAC/D,IAAIuf,EAAYnsB,KAAK4tC,gBAAgBhzB,GACjCuR,GACAplB,EAASY,MAAMiF,EAASuf,IAGhCmhB,EAAaptC,UAAU+uB,IAAM,SAAUrU,EAAW7T,EAAU6F,GACxD5M,KAAK2tC,mBAAmB/yB,GAExB,IADA,IAAI8yB,EAAY1tC,KAAKwtC,WAAW5yB,OACvB9X,EAAI,EAAGA,EAAI4qC,EAAU5rC,OAAQgB,IAClC,GAAI4qC,EAAU5qC,GAAGiE,WAAaA,KACxB6F,GAAWA,IAAY8gC,EAAU5qC,GAAG8J,SAEtC,YADA8gC,EAAU7K,OAAO//B,EAAG,IAKhCwqC,EAAaptC,UAAUytC,mBAAqB,SAAU/yB,GAClDtY,EAAOtC,KAAKutC,eAAetc,KAAK,SAAU4c,GACtC,OAAOA,IAAOjzB,IACd,kBAAoBA,IAErB0yB,KAqBPQ,GAAmC,SAAUpjC,GAE7C,SAASojC,IACL,IACIC,EACAC,EAFAvnC,EAAQiE,EAAOhJ,KAAK1B,MAAO,aAAeA,KAqC9C,MAlCwB,oBAAbiuC,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,iBAOjBtnC,EAAM0nC,UAAW,EACbH,GACAC,SAASC,iBAAiBF,EAAkB,WACxC,IAAIzL,GAAW0L,SAASF,GACpBxL,IAAY97B,EAAM0nC,WAClB1nC,EAAM0nC,SAAW5L,EACjB97B,EAAMgnC,QAAQ,UAAWlL,MAE9B,GAEA97B,EAaX,OApDA3G,EAAUguC,EAAmBpjC,GAyC7BojC,EAAkBM,YAAc,WAC5B,OAAO,IAAIN,GAMfA,EAAkB5tC,UAAU0tC,gBAAkB,SAAUhzB,GAEpD,OADAtY,EAAqB,YAAdsY,EAAyB,uBAAyBA,IACjD5a,KAAKmuC,WAEVL,GACTR,IA0BEe,GAA+B,SAAU3jC,GAEzC,SAAS2jC,IACL,IAAI5nC,EAAQiE,EAAOhJ,KAAK1B,MAAO,YAAcA,KAsB7C,OArBAyG,EAAM6nC,SAAU,EAKM,oBAAXpnC,aAC4B,IAA5BA,OAAOgnC,kBACbjnC,MACDC,OAAOgnC,iBAAiB,SAAU,WACzBznC,EAAM6nC,UACP7nC,EAAM6nC,SAAU,EAChB7nC,EAAMgnC,QAAQ,UAAU,MAE7B,GACHvmC,OAAOgnC,iBAAiB,UAAW,WAC3BznC,EAAM6nC,UACN7nC,EAAM6nC,SAAU,EAChB7nC,EAAMgnC,QAAQ,UAAU,MAE7B,IAEAhnC,EAmBX,OA3CA3G,EAAUuuC,EAAe3jC,GA0BzB2jC,EAAcD,YAAc,WACxB,OAAO,IAAIC,GAMfA,EAAcnuC,UAAU0tC,gBAAkB,SAAUhzB,GAEhD,OADAtY,EAAqB,WAAdsY,EAAwB,uBAAyBA,IAChD5a,KAAKsuC,UAKjBD,EAAcnuC,UAAUquC,gBAAkB,WACtC,OAAOvuC,KAAKsuC,SAETD,GACTf,IAsBEkB,GAAgC,WAIhC,SAASA,EAAeC,GACpBzuC,KAAKyuC,WAAaA,EAClBzuC,KAAK0uC,oBACL1uC,KAAK2uC,mBAAqB,EAC1B3uC,KAAK4uC,oBAAsB,EAC3B5uC,KAAK6uC,QAAU,KAiDnB,OA/CAL,EAAetuC,UAAU4uC,WAAa,SAAUC,EAAahoC,GACzD/G,KAAK4uC,mBAAqBG,EAC1B/uC,KAAK6uC,QAAU9nC,EACX/G,KAAK4uC,mBAAqB5uC,KAAK2uC,qBAC/B3uC,KAAK6uC,UACL7uC,KAAK6uC,QAAU,OAUvBL,EAAetuC,UAAU8uC,eAAiB,SAAUC,EAAY3mC,GAC5D,IAAI7B,EAAQzG,KACZA,KAAK0uC,iBAAiBO,GAAc3mC,EAwBpC,IAvBA,IAAI4mC,EAAU,WACV,IAAIC,EAAYC,EAAOV,iBAAiBU,EAAOT,2BACxCS,EAAOV,iBAAiBU,EAAOT,oBAQtC,IAPA,IAAIU,EAAU,SAAUvsC,GAChBqsC,EAAUrsC,IACVwQ,GAAe,WACX7M,EAAMgoC,WAAWU,EAAUrsC,OAI9BA,EAAI,EAAGA,EAAIqsC,EAAUrtC,SAAUgB,EACpCusC,EAAQvsC,GAEZ,GAAIssC,EAAOT,qBAAuBS,EAAOR,mBAKrC,OAJIQ,EAAOP,UACPO,EAAOP,UACPO,EAAOP,QAAU,MAEd,QAEXO,EAAOT,sBAEPS,EAASpvC,KACNA,KAAK0uC,iBAAiB1uC,KAAK2uC,qBAAqB,CAEnD,GAAgB,UADFO,IAEV,QAGLV,KAqBPc,GAAoC,aACpCC,GAAiC,UAoCjCC,GAAuC,WASvC,SAASA,EAAsBC,EAAQj3B,EAAUk3B,EAAoBC,GACjE3vC,KAAKyvC,OAASA,EACdzvC,KAAKwY,SAAWA,EAChBxY,KAAK0vC,mBAAqBA,EAC1B1vC,KAAK2vC,cAAgBA,EACrB3vC,KAAK4vC,UAAY,EACjB5vC,KAAK6vC,cAAgB,EACrB7vC,KAAK8vC,gBAAiB,EACtB9vC,KAAK+vC,KAAOt/B,GAAWg/B,GACvBzvC,KAAKgwC,OAASrF,GAAaC,cAAcpyB,GACzCxY,KAAKiwC,MAAQ,SAAUv4B,GACnB,OAAOc,EAAShB,cAAchB,GAAckB,IAsOpD,OA9NA83B,EAAsBtvC,UAAUgwC,KAAO,SAAUC,EAAWC,GACxD,IAAI3pC,EAAQzG,KACZA,KAAKqwC,cAAgB,EACrBrwC,KAAKswC,cAAgBF,EACrBpwC,KAAKuwC,gBAAkB,IAAI/B,GAAe2B,GAC1CnwC,KAAKwwC,WAAY,EACjBxwC,KAAKywC,qBAAuBl9B,WAAW,WACnC9M,EAAMspC,KAAK,gCAEXtpC,EAAMiqC,YACNjqC,EAAMgqC,qBAAuB,MAC9Bn+B,KAAKI,MA9CS,MAh/SC,SAAU7I,GAChC,GAAIxC,KAAuC,aAAxB4mC,SAAS0C,WACxB9mC,QAEC,CAGD,IAAI+mC,GAAW,EACXC,EAAc,WACT5C,SAAS3tC,KAITswC,IACDA,GAAW,EACX/mC,KALA0J,WAAWs9B,EAAav+B,KAAKI,MAAM,MAQvCu7B,SAASC,kBACTD,SAASC,iBAAiB,mBAAoB2C,GAAa,GAE3D3pC,OAAOgnC,iBAAiB,OAAQ2C,GAAa,IAExC5C,SAAS6C,cAEd7C,SAAS6C,YAAY,qBAAsB,WACX,aAAxB7C,SAAS0C,YACTE,MAGR3pC,OAAO4pC,YAAY,SAAUD,KAkgTjCE,CAAoB,WAChB,IAAItqC,EAAM+pC,UAAV,CAGA/pC,EAAMuqC,gBAAkB,IAAIC,GAA2B,WAEnD,IADA,IAAI7jC,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzB,IAAI6jC,EAAU9jC,EAAK,GAAI+jC,EAAO/jC,EAAK,GAAIgkC,EAAOhkC,EAAK,GAEnD,GADA3G,EAAM4qC,wBAAwBjkC,GACzB3G,EAAMuqC,gBAOX,GALIvqC,EAAMgqC,uBACNa,aAAa7qC,EAAMgqC,sBACnBhqC,EAAMgqC,qBAAuB,MAEjChqC,EAAMqpC,gBAAiB,EAjGH,SAkGhBoB,EACAzqC,EAAMmJ,GAAKuhC,EACX1qC,EAAM8qC,SAAWH,MAEhB,CAAA,GArGiB,UAqGbF,EAiBL,MAAM,IAAIxuC,MAAM,kCAAoCwuC,GAfhDC,GAGA1qC,EAAMuqC,gBAAgBQ,cAAe,EAGrC/qC,EAAM8pC,gBAAgBzB,WAAWqC,EAAM,WACnC1qC,EAAMiqC,eAIVjqC,EAAMiqC,cAMf,WAEC,IADA,IAAItjC,KACKC,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpCD,EAAKC,GAAMzF,UAAUyF,GAEzB,IAAIokC,EAAKrkC,EAAK,GAAI9E,EAAO8E,EAAK,GAC9B3G,EAAM4qC,wBAAwBjkC,GAC9B3G,EAAM8pC,gBAAgBvB,eAAeyC,EAAInpC,IAC1C,WACC7B,EAAMiqC,aACPjqC,EAAMwpC,OAGT,IAAIyB,GACJC,MAA2C,KAC3CD,EAAwC,IAAIp/B,KAAKI,MAAsB,IAAhBJ,KAAKkK,UACxD/V,EAAMuqC,gBAAgBY,2BACtBF,EAA6C,GAAIjrC,EAAMuqC,gBAAgBY,0BAC3EF,EAAuB,EAp6RZ,IAq6RPjrC,EAAMipC,qBACNgC,EAAiC,EAAIjrC,EAAMipC,oBAE3CjpC,EAAMkpC,gBACN+B,EAA4B,GAAIjrC,EAAMkpC,gBAErCtoC,KACmB,oBAAbgR,UACPA,SAASw5B,OACgC,IAAzCx5B,SAASw5B,KAAK76B,QAz6RX,oBA06RH06B,EAAuB,EA36RvB,KA66RJ,IAAII,EAAarrC,EAAMwpC,MAAMyB,GAC7BjrC,EAAMspC,KAAK,+BAAiC+B,GAC5CrrC,EAAMuqC,gBAAgBe,OAAOD,EAAY,kBAQjDtC,EAAsBtvC,UAAUyxC,MAAQ,WACpC3xC,KAAKgxC,gBAAgBgB,cAAchyC,KAAK4P,GAAI5P,KAAKuxC,UACjDvxC,KAAKiyC,uBAAuBjyC,KAAK4P,GAAI5P,KAAKuxC,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,iBAAXrrC,QACbA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUC,KAAKD,OAAOmR,SAASw5B,UAQV,iBAAZW,SAA8C,iBAAfA,QAAQC,MAi5SxCprC,KAKbmoC,EAAsBtvC,UAAUwyC,sBAAwB,aAKxDlD,EAAsBtvC,UAAUyyC,UAAY,WACxC3yC,KAAKwwC,WAAY,EACbxwC,KAAKgxC,kBACLhxC,KAAKgxC,gBAAgB4B,QACrB5yC,KAAKgxC,gBAAkB,MAGvBhxC,KAAK6yC,iBACL5E,SAAS3tC,KAAKwyC,YAAY9yC,KAAK6yC,gBAC/B7yC,KAAK6yC,eAAiB,MAEtB7yC,KAAKywC,uBACLa,aAAatxC,KAAKywC,sBAClBzwC,KAAKywC,qBAAuB,OAOpCjB,EAAsBtvC,UAAUwwC,UAAY,WACnC1wC,KAAKwwC,YACNxwC,KAAK+vC,KAAK,8BACV/vC,KAAK2yC,YACD3yC,KAAKswC,gBACLtwC,KAAKswC,cAActwC,KAAK8vC,gBACxB9vC,KAAKswC,cAAgB,QAQjCd,EAAsBtvC,UAAU0yC,MAAQ,WAC/B5yC,KAAKwwC,YACNxwC,KAAK+vC,KAAK,6BACV/vC,KAAK2yC,cAQbnD,EAAsBtvC,UAAU6yC,KAAO,SAAUzqC,GAC7C,IAAI0qC,EAAU/pC,EAAUX,GACxBtI,KAAK4vC,WAAaoD,EAAQlxC,OAC1B9B,KAAKgwC,OAAOvF,iBAAiB,aAAcuI,EAAQlxC,QAQnD,IANA,IFltTAgO,EEktTImjC,GFltTJnjC,EAAYnN,EEktTkBqwC,GFjtT3B/vC,EAAOU,gBAAgBmM,GAAW,IEotTjCgC,EAAWH,GAAkBshC,EAzOlBC,MA4ONpwC,EAAI,EAAGA,EAAIgP,EAAShQ,OAAQgB,IACjC9C,KAAKgxC,gBAAgBmC,eAAenzC,KAAKqwC,cAAev+B,EAAShQ,OAAQgQ,EAAShP,IAClF9C,KAAKqwC,iBAUbb,EAAsBtvC,UAAU+xC,uBAAyB,SAAUriC,EAAIwjC,GACnE,IAAI/rC,IAAJ,CAEArH,KAAK6yC,eAAiB5E,SAASsE,cAAc,UAC7C,IAAIb,GACJ2B,OAA2D,KAC3D3B,EAAoC,GAAI9hC,EACxC8hC,EAAoC,GAAI0B,EACxCpzC,KAAK6yC,eAAeS,IAAMtzC,KAAKiwC,MAAMyB,GACrC1xC,KAAK6yC,eAAeU,MAAMC,QAAU,OACpCvF,SAAS3tC,KAAKmzC,YAAYzzC,KAAK6yC,kBAOnCrD,EAAsBtvC,UAAUmxC,wBAA0B,SAAUjkC,GAEhE,IAAIyiC,EAAgB5mC,EAAUmE,GAAMtL,OACpC9B,KAAK6vC,eAAiBA,EACtB7vC,KAAKgwC,OAAOvF,iBAAiB,iBAAkBoF,IAE5CL,KAMPyB,GAA4C,WAO5C,SAASA,EAA2ByC,EAAWC,EAAavD,EAAcH,GAoBtE,GAnBAjwC,KAAKowC,aAAeA,EACpBpwC,KAAKiwC,MAAQA,EAMbjwC,KAAK4zC,oBAAsB,IAAIhjB,GAE/B5wB,KAAK6zC,eAML7zC,KAAK8zC,cAAgBxhC,KAAKI,MAAsB,IAAhBJ,KAAKkK,UAGrCxc,KAAKwxC,cAAe,EACfnqC,IAkCDrH,KAAK0zC,UAAYA,EACjB1zC,KAAK2zC,YAAcA,MAnCL,CAKd3zC,KAAK4xC,yBAA2BjiC,IAChCzI,OAAOooC,GAAoCtvC,KAAK4xC,0BAA4B8B,EAC5ExsC,OAAOqoC,GAAiCvvC,KAAK4xC,0BAA4B+B,EAEzE3zC,KAAK+zC,SAAW9C,EAA2B+C,gBAE3C,IAAIC,EAAS,GAGb,GAAIj0C,KAAK+zC,SAAST,KACwC,gBAAtDtzC,KAAK+zC,SAAST,IAAIrgC,OAAO,EAAG,cAAcnR,QAE1CmyC,EAAS,4BADWhG,SAASl3B,OAC0B,eAE3D,IAAIm9B,EAAiB,eAAiBD,EAAS,iBAC/C,IACIj0C,KAAK+zC,SAASI,IAAIjE,OAClBlwC,KAAK+zC,SAASI,IAAI1Q,MAAMyQ,GACxBl0C,KAAK+zC,SAASI,IAAIvB,QAEtB,MAAO5wC,GACH2L,EAAI,2BACA3L,EAAEiG,OACF0F,EAAI3L,EAAEiG,OAEV0F,EAAI3L,KAsPhB,OAxOAivC,EAA2B+C,cAAgB,WACvC,IAAII,EAASnG,SAASsE,cAAc,UAGpC,GAFA6B,EAAOb,MAAMC,QAAU,QAEnBvF,SAAS3tC,KAuBT,KAAM,oGAtBN2tC,SAAS3tC,KAAKmzC,YAAYW,GAC1B,IAIYA,EAAOC,cAAcpG,UAGzBtgC,EAAI,iCAGZ,MAAO3L,GACH,IAAI+U,EAASk3B,SAASl3B,OACtBq9B,EAAOd,IACH,gEACIv8B,EACA,2BAkBhB,OATIq9B,EAAOE,gBACPF,EAAOD,IAAMC,EAAOE,gBAEfF,EAAOC,cACZD,EAAOD,IAAMC,EAAOC,cAAcpG,SAE7BmG,EAAOnG,WACZmG,EAAOD,IAAMC,EAAOnG,UAEjBmG,GAKXnD,EAA2B/wC,UAAU0yC,MAAQ,WACzC,IAAInsC,EAAQzG,KAeZ,GAbAA,KAAKu0C,OAAQ,EACTv0C,KAAK+zC,WAIL/zC,KAAK+zC,SAASI,IAAI7zC,KAAKk0C,UAAY,GACnCjhC,WAAW,WACgB,OAAnB9M,EAAMstC,WACN9F,SAAS3tC,KAAKwyC,YAAYrsC,EAAMstC,UAChCttC,EAAMstC,SAAW,OAEtBzhC,KAAKI,MAAM,KAEdrL,KAAerH,KAAKy0C,KAAM,CAC1B,IAAI/C,GACJgD,QAAmD,KACnDhD,EAAoC,GAAI1xC,KAAKy0C,KAC7C/C,EAAoC,GAAI1xC,KAAK20C,KAC7C,IAAIC,EAAS50C,KAAKiwC,MAAMyB,GACxBT,EAA2B4D,gBAAgBD,GAG/C,IAAIxE,EAAepwC,KAAKowC,aACpBA,IACApwC,KAAKowC,aAAe,KACpBA,MAQRa,EAA2B/wC,UAAU8xC,cAAgB,SAAUpiC,EAAIwjC,GAK/D,IAJApzC,KAAKy0C,KAAO7kC,EACZ5P,KAAK20C,KAAOvB,EACZpzC,KAAKu0C,OAAQ,EAENv0C,KAAK80C,kBAShB7D,EAA2B/wC,UAAU40C,YAAc,WAI/C,GAAI90C,KAAKu0C,OACLv0C,KAAKwxC,cACLxxC,KAAK4zC,oBAAoB9xB,SAAW9hB,KAAK6zC,YAAY/xC,OAAS,EAAI,EAAI,GAAI,CAE1E9B,KAAK8zC,gBACL,IAAIpC,KACJA,EAAoC,GAAI1xC,KAAKy0C,KAC7C/C,EAAoC,GAAI1xC,KAAK20C,KAC7CjD,EAAwC,IAAI1xC,KAAK8zC,cAKjD,IAJA,IAAIc,EAAS50C,KAAKiwC,MAAMyB,GAEpBqD,EAAgB,GAChBjyC,EAAI,EACD9C,KAAK6zC,YAAY/xC,OAAS,GAAG,CAGhC,KADc9B,KAAK6zC,YAAY,GACnBn0C,EAAEoC,OA/cR,GA+cmCizC,EAAcjzC,QAhd/C,MAweJ,MArBA,IAAIkzC,EAASh1C,KAAK6zC,YAAYoB,QAC9BF,EACIA,EACI,OAEAjyC,EACA,IACAkyC,EAAOE,IACP,MAEApyC,EACA,IACAkyC,EAAOG,GACP,KAEAryC,EACA,IACAkyC,EAAOt1C,EACfoD,IAQR,OAFA8xC,GAAkBG,EAClB/0C,KAAKo1C,gBAAgBR,EAAQ50C,KAAK8zC,gBAC3B,EAGP,OAAO,GASf7C,EAA2B/wC,UAAUizC,eAAiB,SAAUkC,EAAQC,EAAWhtC,GAE/EtI,KAAK6zC,YAAY9xC,MAAOmzC,IAAKG,EAAQF,GAAIG,EAAW51C,EAAG4I,IAGnDtI,KAAKu0C,OACLv0C,KAAK80C,eASb7D,EAA2B/wC,UAAUk1C,gBAAkB,SAAUG,EAAKC,GAClE,IAAI/uC,EAAQzG,KAEZA,KAAK4zC,oBAAoB/iB,IAAI2kB,EAAQ,GACrC,IAAIC,EAAe,WACfhvC,EAAMmtC,oBAAoB3kC,OAAOumC,GACjC/uC,EAAMquC,eAINY,EAAmBniC,WAAWkiC,EAAcnjC,KAAKI,MAxgB5B,OA+gBzB1S,KAAK+xC,OAAOwD,EANO,WAEfjE,aAAaoE,GAEbD,OASRxE,EAA2B/wC,UAAU6xC,OAAS,SAAUwD,EAAKI,GACzD,IAAIlvC,EAAQzG,KACRqH,IACArH,KAAK41C,eAAeL,EAAKI,GAGzBpiC,WAAW,WACP,IAEI,IAAK9M,EAAM+qC,aACP,OACJ,IAAIqE,EAAcpvC,EAAMstC,SAASI,IAAI5B,cAAc,UACnDsD,EAAYp+B,KAAO,kBACnBo+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,WAClBxoC,EAAI,oCAAsC4nC,GAC1C9uC,EAAM+qC,cAAe,EACrB/qC,EAAMmsC,SAEVnsC,EAAMstC,SAASI,IAAI7zC,KAAKmzC,YAAYoC,GAExC,MAAO7zC,MAGRsQ,KAAKI,MAAM,KAGfu+B,KAoBPmF,GAAgB,KACQ,oBAAjBC,aACPD,GAAgBC,aAEU,oBAAdC,YACZF,GAAgBE,WAOpB,IAAIC,GAAqC,WAQrC,SAASA,EAAoB9G,EAAQj3B,EAAUk3B,EAAoBC,GAC/D3vC,KAAKyvC,OAASA,EACdzvC,KAAKw2C,eAAiB,KACtBx2C,KAAKy2C,OAAS,KACdz2C,KAAK02C,YAAc,EACnB12C,KAAK4vC,UAAY,EACjB5vC,KAAK6vC,cAAgB,EACrB7vC,KAAK+vC,KAAOt/B,GAAWzQ,KAAKyvC,QAC5BzvC,KAAKgwC,OAASrF,GAAaC,cAAcpyB,GACzCxY,KAAK2X,QAAU4+B,EAAoBI,eAAen+B,EAAUk3B,EAAoBC,GA6RpF,OAnRA4G,EAAoBI,eAAiB,SAAUn+B,EAAUk3B,EAAoBC,GACzE,IAAI+B,GACJnwC,EA56Se,KAy7Sf,OAZK8F,KACmB,oBAAbgR,UACPA,SAASw5B,OACgC,IAAzCx5B,SAASw5B,KAAK76B,QA36SP,oBA46SP06B,EAAuB,EA76SnB,KA+6SJhC,IACAgC,EAAiC,EAAIhC,GAErCC,IACA+B,EAA4B,GAAI/B,GAE7Bn3B,EAAShB,cAl7SR,YAk7SiCk6B,IAO7C6E,EAAoBr2C,UAAUgwC,KAAO,SAAUC,EAAWC,GACtD,IAAI3pC,EAAQzG,KACZA,KAAKowC,aAAeA,EACpBpwC,KAAKmwC,UAAYA,EACjBnwC,KAAK+vC,KAAK,2BAA6B/vC,KAAK2X,SAC5C3X,KAAK8vC,gBAAiB,EAEtBtgC,EAAkBpB,IAAI,8BAA8B,GACpD,IACI,GAAI/G,IAAa,CACb,IAAIuvC,EAAS10C,EAAUE,WAAa,YAAc,OAE9CkoC,GACAuM,SACIC,aAAc,cAAuCC,EAAS10C,YAAc,IAAM20C,QAAQC,SAAW,IAAML,IAI/GM,EAAMF,QAAa,IACnBG,EAA0C,GAAlCn3C,KAAK2X,QAAQX,QAAQ,UAC3BkgC,EAAiB,aAAKA,EAAiB,YACvCA,EAAgB,YAAKA,EAAgB,WACvCC,IACA7M,EAAe,OAAM8M,OAAQD,IAEjCn3C,KAAKq3C,OAAS,IAAIjB,GAAcp2C,KAAK2X,WAAa2yB,QAGlDtqC,KAAKq3C,OAAS,IAAIjB,GAAcp2C,KAAK2X,SAG7C,MAAO3V,GACHhC,KAAK+vC,KAAK,kCACV,IAAIlH,EAAW7mC,EAAEQ,SAAWR,EAAEsG,KAK9B,OAJIugC,GACA7oC,KAAK+vC,KAAKlH,QAEd7oC,KAAK0wC,YAGT1wC,KAAKq3C,OAAOC,OAAS,WACjB7wC,EAAMspC,KAAK,wBACXtpC,EAAMqpC,gBAAiB,GAE3B9vC,KAAKq3C,OAAOE,QAAU,WAClB9wC,EAAMspC,KAAK,0CACXtpC,EAAM4wC,OAAS,KACf5wC,EAAMiqC,aAEV1wC,KAAKq3C,OAAOG,UAAY,SAAUC,GAC9BhxC,EAAMixC,oBAAoBD,IAE9Bz3C,KAAKq3C,OAAOlB,QAAU,SAAUn0C,GAC5ByE,EAAMspC,KAAK,yCACX,IAAIlH,EAAW7mC,EAAEQ,SAAWR,EAAEsG,KAC1BugC,GACApiC,EAAMspC,KAAKlH,GAEfpiC,EAAMiqC,cAMd6F,EAAoBr2C,UAAUyxC,MAAQ,aACtC4E,EAAoBnE,cAAgB,WAChCmE,EAAoBlE,gBAAiB,GAEzCkE,EAAoBjE,YAAc,WAC9B,IAAIqF,GAAe,EACnB,GAAyB,oBAAdvwC,WAA6BA,UAAUwwC,UAAW,CACzD,IACIC,EAAkBzwC,UAAUwwC,UAAUlvC,MADpB,kCAElBmvC,GAAmBA,EAAgB/1C,OAAS,GACxCg2C,WAAWD,EAAgB,IAAM,MACjCF,GAAe,GAI3B,OAASA,GACa,OAAlBvB,KACCG,EAAoBlE,gBAM7BkE,EAAoBwB,iBAAmB,WAGnC,OAAQvoC,EAAkBJ,oBACkC,IAAxDI,EAAkBxH,IAAI,+BAE9BuuC,EAAoBr2C,UAAUwyC,sBAAwB,WAClDljC,EAAkBP,OAAO,+BAE7BsnC,EAAoBr2C,UAAU83C,aAAe,SAAU1vC,GAEnD,GADAtI,KAAKy2C,OAAO10C,KAAKuG,GACbtI,KAAKy2C,OAAO30C,QAAU9B,KAAK02C,YAAa,CACxC,IAAIuB,EAAWj4C,KAAKy2C,OAAO9xC,KAAK,IAChC3E,KAAKy2C,OAAS,KACd,IAAIyB,EAAWpvC,EAASmvC,GAExBj4C,KAAKmwC,UAAU+H,KAOvB3B,EAAoBr2C,UAAUi4C,qBAAuB,SAAUC,GAC3Dp4C,KAAK02C,YAAc0B,EACnBp4C,KAAKy2C,WAQTF,EAAoBr2C,UAAUm4C,mBAAqB,SAAU/vC,GAIzD,GAHAhG,EAAuB,OAAhBtC,KAAKy2C,OAAiB,kCAGzBnuC,EAAKxG,QAAU,EAAG,CAClB,IAAIs2C,EAAavnC,OAAOvI,GACxB,IAAKgwC,MAAMF,GAEP,OADAp4C,KAAKm4C,qBAAqBC,GACnB,KAIf,OADAp4C,KAAKm4C,qBAAqB,GACnB7vC,GAMXiuC,EAAoBr2C,UAAUw3C,oBAAsB,SAAUa,GAC1D,GAAoB,OAAhBv4C,KAAKq3C,OAAT,CAEA,IAAI/uC,EAAOiwC,EAAW,KAItB,GAHAv4C,KAAK6vC,eAAiBvnC,EAAKxG,OAC3B9B,KAAKgwC,OAAOvF,iBAAiB,iBAAkBniC,EAAKxG,QACpD9B,KAAKw4C,iBACe,OAAhBx4C,KAAKy2C,OAELz2C,KAAKg4C,aAAa1vC,OAEjB,CAED,IAAImwC,EAAgBz4C,KAAKq4C,mBAAmB/vC,GACtB,OAAlBmwC,GACAz4C,KAAKg4C,aAAaS,MAQ9BlC,EAAoBr2C,UAAU6yC,KAAO,SAAUzqC,GAC3CtI,KAAKw4C,iBACL,IAAIxF,EAAU/pC,EAAUX,GACxBtI,KAAK4vC,WAAaoD,EAAQlxC,OAC1B9B,KAAKgwC,OAAOvF,iBAAiB,aAAcuI,EAAQlxC,QAGnD,IAAIgQ,EAAWH,GAAkBqhC,EAvOV,OAyOnBlhC,EAAShQ,OAAS,GAClB9B,KAAK04C,YAAYxzC,OAAO4M,EAAShQ,SAGrC,IAAK,IAAIgB,EAAI,EAAGA,EAAIgP,EAAShQ,OAAQgB,IACjC9C,KAAK04C,YAAY5mC,EAAShP,KAGlCyzC,EAAoBr2C,UAAUyyC,UAAY,WACtC3yC,KAAKwwC,WAAY,EACbxwC,KAAKw2C,iBACLmC,cAAc34C,KAAKw2C,gBACnBx2C,KAAKw2C,eAAiB,MAEtBx2C,KAAKq3C,SACLr3C,KAAKq3C,OAAOzE,QACZ5yC,KAAKq3C,OAAS,OAGtBd,EAAoBr2C,UAAUwwC,UAAY,WACjC1wC,KAAKwwC,YACNxwC,KAAK+vC,KAAK,+BACV/vC,KAAK2yC,YAED3yC,KAAKowC,eACLpwC,KAAKowC,aAAapwC,KAAK8vC,gBACvB9vC,KAAKowC,aAAe,QAQhCmG,EAAoBr2C,UAAU0yC,MAAQ,WAC7B5yC,KAAKwwC,YACNxwC,KAAK+vC,KAAK,6BACV/vC,KAAK2yC,cAOb4D,EAAoBr2C,UAAUs4C,eAAiB,WAC3C,IAAI/xC,EAAQzG,KACZ24C,cAAc34C,KAAKw2C,gBACnBx2C,KAAKw2C,eAAiBoC,YAAY,WAE1BnyC,EAAM4wC,QACN5wC,EAAMiyC,YAAY,KAEtBjyC,EAAM+xC,kBACPlmC,KAAKI,MA7RmB,QAqS/B6jC,EAAoBr2C,UAAUw4C,YAAc,SAAU91C,GAIlD,IACI5C,KAAKq3C,OAAOtE,KAAKnwC,GAErB,MAAOZ,GACHhC,KAAK+vC,KAAK,0CAA2C/tC,EAAEQ,SAAWR,EAAEsG,KAAM,uBAC1EiL,WAAWvT,KAAK0wC,UAAUlgC,KAAKxQ,MAAO,KAO9Cu2C,EAAoBsC,6BAA+B,EAKnDtC,EAAoBuC,eAAiB,IAC9BvC,KA0BPwC,GAAkC,WAIlC,SAASA,EAAiBvgC,GACtBxY,KAAKg5C,gBAAgBxgC,GA6DzB,OA3DAlZ,OAAOyI,eAAegxC,EAAkB,kBAKpC/wC,IAAK,WACD,OAAQwnC,GAAuB+G,KAEnCjoC,YAAY,EACZC,cAAc,IAMlBwqC,EAAiB74C,UAAU84C,gBAAkB,SAAUxgC,GACnD,IAAIygC,EAAwB1C,IAAuBA,GAAiC,cAChF2C,EAAuBD,IAA0B1C,GAAoBwB,mBAMzE,GALIv/B,EAAS3B,gBACJoiC,GACDlrC,GAAK,mFACTmrC,GAAuB,GAEvBA,EACAl5C,KAAKm5C,aAAe5C,QAEnB,CACD,IAAI6C,EAAgBp5C,KAAKm5C,eACzBnnC,GAAK+mC,EAAiBM,eAAgB,SAAUv2C,EAAGw2C,GAC3CA,GAAaA,EAAuB,eACpCF,EAAar3C,KAAKu3C,OASlCP,EAAiB74C,UAAUq5C,iBAAmB,WAC1C,GAAIv5C,KAAKm5C,YAAYr3C,OAAS,EAC1B,OAAO9B,KAAKm5C,YAAY,GAGxB,MAAM,IAAIz2C,MAAM,4BAOxBq2C,EAAiB74C,UAAUs5C,iBAAmB,WAC1C,OAAIx5C,KAAKm5C,YAAYr3C,OAAS,EACnB9B,KAAKm5C,YAAY,GAGjB,MAGRJ,KA4CPU,GAA4B,WAU5B,SAASA,EAAW7pC,EAAI8pC,EAAWjL,EAAYkL,EAAUrJ,EAAesJ,EAASjK,GAC7E3vC,KAAK4P,GAAKA,EACV5P,KAAK05C,UAAYA,EACjB15C,KAAKyuC,WAAaA,EAClBzuC,KAAK25C,SAAWA,EAChB35C,KAAKswC,cAAgBA,EACrBtwC,KAAK45C,QAAUA,EACf55C,KAAK2vC,cAAgBA,EACrB3vC,KAAK65C,gBAAkB,EACvB75C,KAAK85C,uBACL95C,KAAK+5C,OAAS,EACd/5C,KAAK+vC,KAAOt/B,GAAW,KAAOzQ,KAAK4P,GAAK,KACxC5P,KAAKg6C,kBAAoB,IAAIjB,GAAiBW,GAC9C15C,KAAK+vC,KAAK,sBACV/vC,KAAKi6C,SAiaT,OA3ZAR,EAAWv5C,UAAU+5C,OAAS,WAC1B,IAAIxzC,EAAQzG,KACRk6C,EAAOl6C,KAAKg6C,kBAAkBT,mBAClCv5C,KAAKm6C,MAAQ,IAAID,EAAKl6C,KAAKo6C,mBAAoBp6C,KAAK05C,eAAWpzC,EAAWtG,KAAK2vC,eAG/E3vC,KAAKq6C,0BAA4BH,EAAmC,8BAAK,EACzE,IAAII,EAAoBt6C,KAAKu6C,cAAcv6C,KAAKm6C,OAC5CK,EAAmBx6C,KAAKy6C,iBAAiBz6C,KAAKm6C,OAClDn6C,KAAK06C,IAAM16C,KAAKm6C,MAChBn6C,KAAK26C,IAAM36C,KAAKm6C,MAChBn6C,KAAK46C,eAAiB,KACtB56C,KAAK66C,YAAa,EAOlBtnC,WAAW,WAEP9M,EAAM0zC,OAAS1zC,EAAM0zC,MAAMjK,KAAKoK,EAAmBE,IACpDloC,KAAKI,MAAM,IACd,IAAIooC,EAAoBZ,EAAqB,gBAAK,EAC9CY,EAAoB,IACpB96C,KAAK+6C,gBAAkBrnC,GAAsB,WACzCjN,EAAMs0C,gBAAkB,KACnBt0C,EAAMo0C,aACHp0C,EAAM0zC,OACN1zC,EAAM0zC,MAAMtK,cA5EE,QA6EdppC,EAAMspC,KAAK,wDACPtpC,EAAM0zC,MAAMtK,cACZ,wCACJppC,EAAMo0C,YAAa,EACnBp0C,EAAM0zC,MAAMzH,yBAEPjsC,EAAM0zC,OACX1zC,EAAM0zC,MAAMvK,UArFF,MAsFVnpC,EAAMspC,KAAK,oDACPtpC,EAAM0zC,MAAMvK,UACZ,uCAKJnpC,EAAMspC,KAAK,+CACXtpC,EAAMmsC,WAGftgC,KAAKI,MAAMooC,MAOtBrB,EAAWv5C,UAAUk6C,iBAAmB,WACpC,MAAO,KAAOp6C,KAAK4P,GAAK,IAAM5P,KAAK65C,mBAEvCJ,EAAWv5C,UAAUu6C,iBAAmB,SAAUP,GAC9C,IAAIzzC,EAAQzG,KACZ,OAAO,SAAUg7C,GACTd,IAASzzC,EAAM0zC,MACf1zC,EAAMw0C,kBAAkBD,GAEnBd,IAASzzC,EAAMm0C,gBACpBn0C,EAAMspC,KAAK,8BACXtpC,EAAMy0C,8BAGNz0C,EAAMspC,KAAK,+BAIvB0J,EAAWv5C,UAAUq6C,cAAgB,SAAUL,GAC3C,IAAIzzC,EAAQzG,KACZ,OAAO,SAAUwC,GACO,GAAhBiE,EAAMszC,SACFG,IAASzzC,EAAMk0C,IACfl0C,EAAM00C,0BAA0B34C,GAE3B03C,IAASzzC,EAAMm0C,eACpBn0C,EAAM20C,4BAA4B54C,GAGlCiE,EAAMspC,KAAK,gCAS3B0J,EAAWv5C,UAAUm7C,YAAc,SAAUC,GAEzC,IAAIC,GAAQ96C,EAAG,IAAKf,EAAG47C,GACvBt7C,KAAKw7C,UAAUD,IAEnB9B,EAAWv5C,UAAUu7C,qBAAuB,WACpCz7C,KAAK06C,MAAQ16C,KAAK46C,gBAAkB56C,KAAK26C,MAAQ36C,KAAK46C,iBACtD56C,KAAK+vC,KAAK,2CAA6C/vC,KAAK46C,eAAenL,QAC3EzvC,KAAKm6C,MAAQn6C,KAAK46C,eAClB56C,KAAK46C,eAAiB,OAI9BnB,EAAWv5C,UAAUw7C,oBAAsB,SAAUC,GACjD,GA1JW,MA0JSA,EAAa,CAC7B,IAAIC,EAAMD,EAAwB,EArJ7B,MAsJDC,EACA57C,KAAK67C,6BA1JD,MA4JCD,GAEL57C,KAAK+vC,KAAK,wCACV/vC,KAAK46C,eAAehI,QAEhB5yC,KAAK06C,MAAQ16C,KAAK46C,gBAClB56C,KAAK26C,MAAQ36C,KAAK46C,gBAClB56C,KAAK4yC,SAjKN,MAoKEgJ,IACL57C,KAAK+vC,KAAK,0BACV/vC,KAAK87C,8BACL97C,KAAK67C,gCAIjBpC,EAAWv5C,UAAUk7C,4BAA8B,SAAUW,GACzD,IAAIC,EAAQzqC,GAAW,IAAKwqC,GACxBzzC,EAAOiJ,GAAW,IAAKwqC,GAC3B,GAAa,KAATC,EACAh8C,KAAK07C,oBAAoBpzC,OAExB,CAAA,GAAa,KAAT0zC,EAKL,MAAM,IAAIt5C,MAAM,2BAA6Bs5C,GAH7Ch8C,KAAK85C,oBAAoB/3C,KAAKuG,KAMtCmxC,EAAWv5C,UAAU27C,2BAA6B,WAC1C77C,KAAK87C,6BAA+B,GACpC97C,KAAK+vC,KAAK,oCACV/vC,KAAK66C,YAAa,EAClB76C,KAAK46C,eAAelI,wBACpB1yC,KAAKi8C,wBAILj8C,KAAK+vC,KAAK,8BACV/vC,KAAK46C,eAAe7H,MAAOtyC,EAAG,IAAKf,GAAKe,EAhMzC,IAgMkDf,UAGzD+5C,EAAWv5C,UAAU+7C,oBAAsB,WAEvCj8C,KAAK46C,eAAejJ,QAEpB3xC,KAAK+vC,KAAK,mCACV/vC,KAAK46C,eAAe7H,MAAOtyC,EAAG,IAAKf,GAAKe,EA1M/B,IA0M8Cf,QAGvDM,KAAK+vC,KAAK,kCACV/vC,KAAKm6C,MAAMpH,MAAOtyC,EAAG,IAAKf,GAAKe,EA7MhB,IA6MqCf,QACpDM,KAAK06C,IAAM16C,KAAK46C,eAChB56C,KAAKy7C,wBAEThC,EAAWv5C,UAAUi7C,0BAA4B,SAAUY,GAEvD,IAAIC,EAAQzqC,GAAW,IAAKwqC,GACxBzzC,EAAOiJ,GAAW,IAAKwqC,GACd,KAATC,EACAh8C,KAAKk8C,WAAW5zC,GAEF,KAAT0zC,GACLh8C,KAAKm8C,eAAe7zC,IAG5BmxC,EAAWv5C,UAAUi8C,eAAiB,SAAU35C,GAC5CxC,KAAKo8C,qBAELp8C,KAAKyuC,WAAWjsC,IAEpBi3C,EAAWv5C,UAAUk8C,mBAAqB,WACjCp8C,KAAK66C,aACN76C,KAAKq6C,4BACDr6C,KAAKq6C,2BAA6B,IAClCr6C,KAAK+vC,KAAK,kCACV/vC,KAAK66C,YAAa,EAClB76C,KAAKm6C,MAAMzH,2BAIvB+G,EAAWv5C,UAAUg8C,WAAa,SAAUP,GACxC,IAAIC,EAAMrqC,GAnPC,IAmPwBoqC,GACnC,GAnPW,MAmPSA,EAAa,CAC7B,IAAIU,EAAUV,EAAwB,EACtC,GA7OO,MA6OHC,EACA57C,KAAKs8C,aAAaD,QAEjB,GAlPM,MAkPFT,EAA0B,CAC/B57C,KAAK+vC,KAAK,qCACV/vC,KAAK26C,IAAM36C,KAAK46C,eAChB,IAAK,IAAI93C,EAAI,EAAGA,EAAI9C,KAAK85C,oBAAoBh4C,SAAUgB,EACnD9C,KAAKm8C,eAAen8C,KAAK85C,oBAAoBh3C,IAEjD9C,KAAK85C,uBACL95C,KAAKy7C,2BA9PE,MAgQFG,EAGL57C,KAAKu8C,sBAAsBF,GAlQvB,MAoQCT,EAEL57C,KAAKw8C,SAASH,GArQV,MAuQCT,EACL91C,GAAM,iBAAmBu2C,GAvQtB,MAyQET,GACL57C,KAAK+vC,KAAK,wBACV/vC,KAAKo8C,qBACLp8C,KAAKy8C,iCAGL32C,GAAM,mCAAqC81C,KASvDnC,EAAWv5C,UAAUo8C,aAAe,SAAUI,GAC1C,IAAIC,EAAYD,EAAUvH,GACtByH,EAAUF,EAAUn7C,EACpBmV,EAAOgmC,EAAUG,EACrB78C,KAAK88C,UAAYJ,EAAUxqC,EAC3BlS,KAAK05C,UAAUpiC,WAAWZ,GAEP,GAAf1W,KAAK+5C,SACL/5C,KAAKm6C,MAAMxI,QACX3xC,KAAK+8C,yBAAyB/8C,KAAKm6C,MAAOwC,GA3lU/B,MA4lUcC,GACrB7uC,GAAK,sCAGT/N,KAAKg9C,qBAGbvD,EAAWv5C,UAAU88C,iBAAmB,WACpC,IAAI9C,EAAOl6C,KAAKg6C,kBAAkBR,mBAC9BU,GACAl6C,KAAKi9C,cAAc/C,IAG3BT,EAAWv5C,UAAU+8C,cAAgB,SAAU/C,GAC3C,IAAIzzC,EAAQzG,KACZA,KAAK46C,eAAiB,IAAIV,EAAKl6C,KAAKo6C,mBAAoBp6C,KAAK05C,UAAW15C,KAAK88C,WAG7E98C,KAAK87C,4BACD5B,EAAmC,8BAAK,EAC5C,IAAI/J,EAAYnwC,KAAKu6C,cAAcv6C,KAAK46C,gBACpCxK,EAAepwC,KAAKy6C,iBAAiBz6C,KAAK46C,gBAC9C56C,KAAK46C,eAAe1K,KAAKC,EAAWC,GAEpC18B,GAAsB,WACdjN,EAAMm0C,iBACNn0C,EAAMspC,KAAK,gCACXtpC,EAAMm0C,eAAehI,UAE1BtgC,KAAKI,MA7UM,OA+UlB+mC,EAAWv5C,UAAUs8C,SAAW,SAAU9lC,GACtC1W,KAAK+vC,KAAK,qCAAuCr5B,GACjD1W,KAAK05C,UAAUpiC,WAAWZ,GAGN,IAAhB1W,KAAK+5C,OACL/5C,KAAK4yC,SAIL5yC,KAAKk9C,oBACLl9C,KAAKi6C,WAGbR,EAAWv5C,UAAU68C,yBAA2B,SAAU7C,EAAMyC,GAC5D,IAAIl2C,EAAQzG,KACZA,KAAK+vC,KAAK,oCACV/vC,KAAKm6C,MAAQD,EACbl6C,KAAK+5C,OAAS,EACV/5C,KAAK25C,WACL35C,KAAK25C,SAASgD,EAAW38C,KAAK88C,WAC9B98C,KAAK25C,SAAW,MAImB,IAAnC35C,KAAKq6C,2BACLr6C,KAAK+vC,KAAK,kCACV/vC,KAAK66C,YAAa,GAGlBnnC,GAAsB,WAClBjN,EAAMg2C,iCACPnqC,KAAKI,MA5WsB,OA+WtC+mC,EAAWv5C,UAAUu8C,8BAAgC,WAE5Cz8C,KAAK66C,YAA8B,IAAhB76C,KAAK+5C,SACzB/5C,KAAK+vC,KAAK,4BACV/vC,KAAKw7C,WAAY/6C,EAAG,IAAKf,GAAKe,EArW/B,IAqWwCf,UAG/C+5C,EAAWv5C,UAAUg7C,2BAA6B,WAC9C,IAAIhB,EAAOl6C,KAAK46C,eAChB56C,KAAK46C,eAAiB,KAClB56C,KAAK06C,MAAQR,GAAQl6C,KAAK26C,MAAQT,GAElCl6C,KAAK4yC,SASb6G,EAAWv5C,UAAU+6C,kBAAoB,SAAUD,GAC/Ch7C,KAAKm6C,MAAQ,KAGRa,GAAiC,IAAhBh7C,KAAK+5C,OASF,IAAhB/5C,KAAK+5C,QACV/5C,KAAK+vC,KAAK,8BATV/vC,KAAK+vC,KAAK,+BAEN/vC,KAAK05C,UAAUtiC,oBACf5H,EAAkBP,OAAO,QAAUjP,KAAK05C,UAAUhjC,MAElD1W,KAAK05C,UAAUziC,aAAejX,KAAK05C,UAAUhjC,OAMrD1W,KAAK4yC,SAOT6G,EAAWv5C,UAAUq8C,sBAAwB,SAAUzT,GACnD9oC,KAAK+vC,KAAK,0DACN/vC,KAAK45C,UACL55C,KAAK45C,QAAQ9Q,GACb9oC,KAAK45C,QAAU,MAInB55C,KAAKswC,cAAgB,KACrBtwC,KAAK4yC,SAET6G,EAAWv5C,UAAUs7C,UAAY,SAAUlzC,GACvC,GAAoB,IAAhBtI,KAAK+5C,OACL,KAAM,8BAGN/5C,KAAK06C,IAAI3H,KAAKzqC,IAMtBmxC,EAAWv5C,UAAU0yC,MAAQ,WACL,IAAhB5yC,KAAK+5C,SACL/5C,KAAK+vC,KAAK,gCACV/vC,KAAK+5C,OAAS,EACd/5C,KAAKk9C,oBACDl9C,KAAKswC,gBACLtwC,KAAKswC,gBACLtwC,KAAKswC,cAAgB,QAQjCmJ,EAAWv5C,UAAUg9C,kBAAoB,WACrCl9C,KAAK+vC,KAAK,iCACN/vC,KAAKm6C,QACLn6C,KAAKm6C,MAAMvH,QACX5yC,KAAKm6C,MAAQ,MAEbn6C,KAAK46C,iBACL56C,KAAK46C,eAAehI,QACpB5yC,KAAK46C,eAAiB,MAEtB56C,KAAK+6C,kBACLzJ,aAAatxC,KAAK+6C,iBAClB/6C,KAAK+6C,gBAAkB,OAGxBtB,KAwBP0D,GAA+B,WAC/B,SAASA,KA0CT,OAlCAA,EAAcj9C,UAAUk9C,IAAM,SAAU7oC,EAAYjM,EAAM+S,EAAYwE,KAOtEs9B,EAAcj9C,UAAUi6B,MAAQ,SAAU5lB,EAAYjM,EAAM+S,EAAYwE,KAKxEs9B,EAAcj9C,UAAUm9C,iBAAmB,SAAUl0C,KAMrDg0C,EAAcj9C,UAAUo9C,gBAAkB,SAAU/oC,EAAYjM,EAAM+S,KAMtE8hC,EAAcj9C,UAAUq9C,kBAAoB,SAAUhpC,EAAYjM,EAAM+S,KAKxE8hC,EAAcj9C,UAAUqb,mBAAqB,SAAUhH,EAAY8G,KAInE8hC,EAAcj9C,UAAUksC,YAAc,SAAUH,KACzCkR,KAkBPK,GAAsB,IACtBC,GAA8B,IAa9BC,GAAsC,SAAUhzC,GAWhD,SAASgzC,EAAqBhE,EAAWiE,EAAeC,EAAkBC,EAAqBC,EAAoBC,GAC/G,IAAIt3C,EAAQiE,EAAOhJ,KAAK1B,OAASA,KAwCjC,GAvCAyG,EAAMizC,UAAYA,EAClBjzC,EAAMk3C,cAAgBA,EACtBl3C,EAAMm3C,iBAAmBA,EACzBn3C,EAAMo3C,oBAAsBA,EAC5Bp3C,EAAMq3C,mBAAqBA,EAC3Br3C,EAAMs3C,cAAgBA,EAEtBt3C,EAAMmJ,GAAK8tC,EAAqBM,8BAChCv3C,EAAMspC,KAAOt/B,GAAW,KAAOhK,EAAMmJ,GAAK,KAE1CnJ,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,EAAMkpC,cAAgB,KAEtBlpC,EAAMi4C,0BAA4B,KAElCj4C,EAAM0nC,UAAW,EAEjB1nC,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,GACvBtR,GAAkBM,cAAc7f,GAAG,UAAW9nB,EAAM44C,WAAY54C,IACrB,IAAvCizC,EAAUhjC,KAAKM,QAAQ,YACvBq3B,GAAcD,cAAc7f,GAAG,SAAU9nB,EAAM64C,UAAW74C,GAEvDA,EAkrBX,OA7uBA3G,EAAU49C,EAAsBhzC,GAmEhCgzC,EAAqBx9C,UAAUm7C,YAAc,SAAU77B,EAAQlf,EAAMi/C,GACjE,IAAIC,IAAcx/C,KAAK4+C,eACnBrD,GAAQzV,EAAG0Z,EAAWh0C,EAAGgU,EAAQ7f,EAAGW,GACxCN,KAAK+vC,KAAK9mC,EAAUsyC,IACpBj5C,EAAOtC,KAAKs+C,WAAY,0DACxBt+C,KAAK6+C,UAAUxD,YAAYE,GACvBgE,IACAv/C,KAAK2+C,eAAea,GAAaD,IAMzC7B,EAAqBx9C,UAAUu/C,OAAS,SAAU1zB,EAAO2zB,EAAe/Z,EAAKtqB,GACzE,IAAIgX,EAAUtG,EAAMwE,kBAChBhc,EAAawX,EAAMjW,KAAKlN,WAC5B5I,KAAK+vC,KAAK,qBAAuBx7B,EAAa,IAAM8d,GACpDryB,KAAKk+C,SAAS3pC,GAAcvU,KAAKk+C,SAAS3pC,OAC1CjS,EAAOypB,EAAMC,iBAAiBuc,cACzBxc,EAAMC,iBAAiBmT,eAAgB,sDAC5C78B,GAAQtC,KAAKk+C,SAAS3pC,GAAY8d,GAAU,gDAC5C,IAAIstB,GACAtkC,WAAYA,EACZqsB,OAAQgY,EACR3zB,MAAOA,EACP4Z,IAAKA,GAET3lC,KAAKk+C,SAAS3pC,GAAY8d,GAAWstB,EACjC3/C,KAAKs+C,YACLt+C,KAAK4/C,YAAYD,IAUzBjC,EAAqBx9C,UAAU0/C,YAAc,SAAUD,GACnD,IAAIl5C,EAAQzG,KACR+rB,EAAQ4zB,EAAW5zB,MACnBxX,EAAawX,EAAMjW,KAAKlN,WACxBypB,EAAUtG,EAAMwE,kBACpBvwB,KAAK+vC,KAAK,aAAex7B,EAAa,QAAU8d,GAChD,IAAIwtB,GAAiBjgD,EAAG2U,GAGpBorC,EAAWha,MACXka,EAAO,EAAI9zB,EAAMsE,cACjBwvB,EAAO,EAAIF,EAAWha,KAE1Bka,EAAgB,EAAIF,EAAWjY,SAC/B1nC,KAAKq7C,YAPQ,IAOYwE,EAAK,SAAUr9C,GACpC,IAAI65C,EAAU75C,EAAoB,EAC9BomC,EAASpmC,EAAsB,EAEnCk7C,EAAqBoC,sBAAsBzD,EAAStwB,IAC5BtlB,EAAMy3C,SAAS3pC,IAAe9N,EAAMy3C,SAAS3pC,GAAY8d,MAEvDstB,IACtBl5C,EAAMspC,KAAK,kBAAmBvtC,GACf,OAAXomC,GACAniC,EAAMs5C,cAAcxrC,EAAY8d,GAEhCstB,EAAWtkC,YACXskC,EAAWtkC,WAAWutB,EAAQyT,OAU9CqB,EAAqBoC,sBAAwB,SAAUzD,EAAStwB,GAC5D,GAAIswB,GAA8B,iBAAZA,GAAwB5yC,EAAS4yC,EAAS,KAAM,CAClE,IAAI2D,EAAWr2C,EAAQ0yC,EAAS,KAChC,GAAI58C,MAAMqE,QAAQk8C,KAAcA,EAAShpC,QAAQ,YAAa,CAC1D,IAAIipC,EAAY,gBACZl0B,EACKC,iBACAC,WACArjB,WACL,IACAs3C,EAAYn0B,EAAMjW,KAAKlN,WAC3BmF,GAAK,wGAC6CkyC,EAAY,OACzDC,EAAY,sDAO7BxC,EAAqBx9C,UAAUm9C,iBAAmB,SAAUl0C,GACxDnJ,KAAK8+C,WAAa31C,EAClBnJ,KAAK+vC,KAAK,wBACN/vC,KAAK8+C,WACL9+C,KAAKmgD,UAKDngD,KAAKs+C,YACLt+C,KAAKq7C,YAAY,YAAc,cAGvCr7C,KAAKogD,uCAAuCj3C,IAMhDu0C,EAAqBx9C,UAAUkgD,uCAAyC,SAAUC,GAG9E,IFpyVAh3C,GEoyVuBg3C,GAAoC,KAAtBA,EAAWv+C,QFnyV3B,iBADrBuH,EAASH,EEqyVuBm3C,GFryVTh3C,UAC8B,IAApBA,EAAc,SEqyV3CrJ,KAAK+vC,KAAK,iEACV/vC,KAAKw+C,mBAzMoB,MAgNjCd,EAAqBx9C,UAAUigD,QAAU,WACrC,IFh0VAG,EAAyBj3C,EEg0VrB5C,EAAQzG,KACZ,GAAIA,KAAKs+C,YAAct+C,KAAK8+C,WAAY,CACpC,IAAIyB,EAAUvgD,KAAK8+C,WACf0B,GFn0VRF,EAAUp3C,EEm0VyBq3C,GFn0VVl3C,EAASi3C,EAAQj3C,OACpCi3C,EAAQh3C,WACZD,GACgB,iBAAXA,GACPA,EAAOxJ,eAAe,OE+zVwB,OAAS,SAC/C4gD,GAAgBC,KAAMH,GACC,OAAvBvgD,KAAK+9C,cACL0C,EAAoB,QAAI,EAEW,iBAAvBzgD,KAAK+9C,gBACjB0C,EAAqB,QAAIzgD,KAAK+9C,eAElC/9C,KAAKq7C,YAAYmF,EAAYC,EAAa,SAAUp2C,GAChD,IAAIu+B,EAASv+B,EAAkB,EAC3B/B,EAAO+B,EAAgB,GAAK,QAC5B5D,EAAMq4C,aAAeyB,IACN,OAAX3X,EACAniC,EAAMu4C,uBAAyB,EAI/Bv4C,EAAMk6C,eAAe/X,EAAQtgC,QASjDo1C,EAAqBx9C,UAAU0gD,SAAW,SAAU70B,EAAO4Z,GACvD,IAAIpxB,EAAawX,EAAMjW,KAAKlN,WACxBypB,EAAUtG,EAAMwE,kBACpBvwB,KAAK+vC,KAAK,uBAAyBx7B,EAAa,IAAM8d,GACtD/vB,EAAOypB,EAAMC,iBAAiBuc,cACzBxc,EAAMC,iBAAiBmT,eAAgB,wDAC/Bn/B,KAAK+/C,cAAcxrC,EAAY8d,IAC9BryB,KAAKs+C,YACft+C,KAAK6gD,cAActsC,EAAY8d,EAAStG,EAAMsE,cAAesV,IAGrE+X,EAAqBx9C,UAAU2gD,cAAgB,SAAUtsC,EAAY8d,EAASyuB,EAAUnb,GACpF3lC,KAAK+vC,KAAK,eAAiBx7B,EAAa,QAAU8d,GAClD,IAAIwtB,GAAiBjgD,EAAG2U,GAGpBoxB,IACAka,EAAO,EAAIiB,EACXjB,EAAO,EAAIla,GAEf3lC,KAAKq7C,YANQ,IAMYwE,IAK7BnC,EAAqBx9C,UAAUo9C,gBAAkB,SAAU/oC,EAAYjM,EAAM+S,GACrErb,KAAKs+C,WACLt+C,KAAK+gD,kBAAkB,IAAKxsC,EAAYjM,EAAM+S,GAG9Crb,KAAKq+C,0BAA0Bt8C,MAC3BwS,WAAYA,EACZiL,OAAQ,IACRlX,KAAMA,EACN+S,WAAYA,KAOxBqiC,EAAqBx9C,UAAUq9C,kBAAoB,SAAUhpC,EAAYjM,EAAM+S,GACvErb,KAAKs+C,WACLt+C,KAAK+gD,kBAAkB,KAAMxsC,EAAYjM,EAAM+S,GAG/Crb,KAAKq+C,0BAA0Bt8C,MAC3BwS,WAAYA,EACZiL,OAAQ,KACRlX,KAAMA,EACN+S,WAAYA,KAOxBqiC,EAAqBx9C,UAAUqb,mBAAqB,SAAUhH,EAAY8G,GAClErb,KAAKs+C,WACLt+C,KAAK+gD,kBAAkB,KAAMxsC,EAAY,KAAM8G,GAG/Crb,KAAKq+C,0BAA0Bt8C,MAC3BwS,WAAYA,EACZiL,OAAQ,KACRlX,KAAM,KACN+S,WAAYA,KAIxBqiC,EAAqBx9C,UAAU6gD,kBAAoB,SAAUvhC,EAAQjL,EAAYjM,EAAM+S,GACnF,IAAI2lC,GAAqBphD,EAAG2U,EAAqB7U,EAAG4I,GACpDtI,KAAK+vC,KAAK,gBAAkBvwB,EAAQwhC,GACpChhD,KAAKq7C,YAAY77B,EAAQwhC,EAAS,SAAUC,GACpC5lC,GACA9H,WAAW,WACP8H,EAAW4lC,EAAuB,EAAGA,EAAuB,IAC7D3uC,KAAKI,MAAM,OAO1BgrC,EAAqBx9C,UAAUk9C,IAAM,SAAU7oC,EAAYjM,EAAM+S,EAAYwE,GACzE7f,KAAKkhD,YAAY,IAAK3sC,EAAYjM,EAAM+S,EAAYwE,IAKxD69B,EAAqBx9C,UAAUi6B,MAAQ,SAAU5lB,EAAYjM,EAAM+S,EAAYwE,GAC3E7f,KAAKkhD,YAAY,IAAK3sC,EAAYjM,EAAM+S,EAAYwE,IAExD69B,EAAqBx9C,UAAUghD,YAAc,SAAU1hC,EAAQjL,EAAYjM,EAAM+S,EAAYwE,GACzF,IAAImhC,GACSphD,EAAG2U,EACH7U,EAAG4I,QAEHhC,IAATuZ,IACAmhC,EAAoB,EAAInhC,GAE5B7f,KAAKm+C,iBAAiBp8C,MAClByd,OAAQA,EACRwhC,QAASA,EACT3lC,WAAYA,IAEhBrb,KAAKo+C,uBACL,IAAI7+B,EAAQvf,KAAKm+C,iBAAiBr8C,OAAS,EACvC9B,KAAKs+C,WACLt+C,KAAKmhD,SAAS5hC,GAGdvf,KAAK+vC,KAAK,kBAAoBx7B,IAGtCmpC,EAAqBx9C,UAAUihD,SAAW,SAAU5hC,GAChD,IAAI9Y,EAAQzG,KACRwf,EAASxf,KAAKm+C,iBAAiB5+B,GAAOC,OACtCwhC,EAAUhhD,KAAKm+C,iBAAiB5+B,GAAOyhC,QACvC3lC,EAAarb,KAAKm+C,iBAAiB5+B,GAAOlE,WAC9Crb,KAAKm+C,iBAAiB5+B,GAAO6hC,OAASphD,KAAKs+C,WAC3Ct+C,KAAKq7C,YAAY77B,EAAQwhC,EAAS,SAAUx+C,GACxCiE,EAAMspC,KAAKvwB,EAAS,YAAahd,UAC1BiE,EAAM03C,iBAAiB5+B,GAC9B9Y,EAAM23C,uBAE6B,IAA/B33C,EAAM23C,uBACN33C,EAAM03C,qBAEN9iC,GACAA,EAAW7Y,EAAsB,EAAGA,EAAsB,MAMtEk7C,EAAqBx9C,UAAUksC,YAAc,SAAUH,GACnD,IAAIxlC,EAAQzG,KAEZ,GAAIA,KAAKs+C,WAAY,CACjB,IAAI0C,GAAyBj+C,EAAGkpC,GAChCjsC,KAAK+vC,KAAK,cAAeiR,GACzBhhD,KAAKq7C,YAAsB,IAAK2F,EAAS,SAAU1/B,GAE/C,GAAe,OADFA,EAAqB,EACb,CACjB,IAAI+/B,EAAc//B,EAAqB,EACvC7a,EAAMspC,KAAK,cAAe,wBAA0BsR,QASpE3D,EAAqBx9C,UAAUi8C,eAAiB,SAAU35C,GACtD,GAAI,MAAOA,EAAS,CAEhBxC,KAAK+vC,KAAK,gBAAkB9mC,EAAUzG,IACtC,IAAI8+C,EAAS9+C,EAAW,EACpB+8C,EAAav/C,KAAK2+C,eAAe2C,GACjC/B,WACOv/C,KAAK2+C,eAAe2C,GAC3B/B,EAAW/8C,EAAoB,QAGlC,CAAA,GAAI,UAAWA,EAChB,KAAM,qCAAuCA,EAAe,MAEvD,MAAOA,GAEZxC,KAAKuhD,YAAY/+C,EAAW,EAAGA,EAAW,KAGlDk7C,EAAqBx9C,UAAUqhD,YAAc,SAAU/hC,EAAQlf,GAC3DN,KAAK+vC,KAAK,sBAAuBvwB,EAAQlf,GAC1B,MAAXkf,EACAxf,KAAK29C,cAAcr9C,EAAiB,EAAGA,EAAiB,GAC5C,EAAOA,EAAQ,GACX,MAAXkf,EACLxf,KAAK29C,cAAcr9C,EAAiB,EAAGA,EAAiB,GAC3C,EAAMA,EAAQ,GACX,MAAXkf,EACLxf,KAAKwhD,iBAAiBlhD,EAAiB,EAAGA,EAAkB,GAC5C,OAAXkf,EACLxf,KAAK2gD,eAAergD,EAAwB,EAAGA,EAA0B,GACzD,OAAXkf,EACLxf,KAAKyhD,uBAAuBnhD,GAE5BwF,GAAM,6CACFmD,EAAUuW,GACV,uCAEZk+B,EAAqBx9C,UAAUy5C,SAAW,SAAUgD,EAAWG,GAC3D98C,KAAK+vC,KAAK,oBACV/vC,KAAKs+C,YAAa,EAClBt+C,KAAKm/C,gCAAiC,IAAIh5C,MAAOE,UACjDrG,KAAK0hD,iBAAiB/E,GACtB38C,KAAK2vC,cAAgBmN,EACjB98C,KAAKi/C,kBACLj/C,KAAK2hD,oBAET3hD,KAAK4hD,gBACL5hD,KAAKi/C,kBAAmB,EACxBj/C,KAAK49C,kBAAiB,IAE1BF,EAAqBx9C,UAAUk/C,iBAAmB,SAAUxrC,GACxD,IAAInN,EAAQzG,KACZsC,GAAQtC,KAAK6+C,UAAW,0DACpB7+C,KAAK0+C,2BACLpN,aAAatxC,KAAK0+C,2BAItB1+C,KAAK0+C,0BAA4BnrC,WAAW,WACxC9M,EAAMi4C,0BAA4B,KAClCj4C,EAAMo7C,wBACPvvC,KAAKI,MAAMkB,KAMlB8pC,EAAqBx9C,UAAUm/C,WAAa,SAAU9c,GAE9CA,IACCviC,KAAKmuC,UACNnuC,KAAKu+C,kBAAoBv+C,KAAKw+C,qBAC9Bx+C,KAAK+vC,KAAK,2CACV/vC,KAAKu+C,gBAAkBf,GAClBx9C,KAAK6+C,WACN7+C,KAAKo/C,iBAAiB,IAG9Bp/C,KAAKmuC,SAAW5L,GAEpBmb,EAAqBx9C,UAAUo/C,UAAY,SAAUwC,GAC7CA,GACA9hD,KAAK+vC,KAAK,wBACV/vC,KAAKu+C,gBAAkBf,GAClBx9C,KAAK6+C,WACN7+C,KAAKo/C,iBAAiB,KAI1Bp/C,KAAK+vC,KAAK,8CACN/vC,KAAK6+C,WACL7+C,KAAK6+C,UAAUjM,UAI3B8K,EAAqBx9C,UAAU6hD,sBAAwB,WAQnD,GAPA/hD,KAAK+vC,KAAK,4BACV/vC,KAAKs+C,YAAa,EAClBt+C,KAAK6+C,UAAY,KAEjB7+C,KAAKgiD,0BAELhiD,KAAK2+C,kBACD3+C,KAAKiiD,mBAAoB,CACzB,GAAKjiD,KAAKmuC,UAKL,GAAInuC,KAAKm/C,+BAAgC,EAEN,IAAIh5C,MAAOE,UAAYrG,KAAKm/C,+BAvf5C,MAyfhBn/C,KAAKu+C,gBAAkBf,IAC3Bx9C,KAAKm/C,+BAAiC,WATtCn/C,KAAK+vC,KAAK,8CACV/vC,KAAKu+C,gBAAkBv+C,KAAKw+C,mBAC5Bx+C,KAAKk/C,4BAA6B,IAAI/4C,MAAOE,UASjD,IAAI67C,GAA8B,IAAI/7C,MAAOE,UAAYrG,KAAKk/C,2BAC1DiD,EAAiB7vC,KAAK4D,IAAI,EAAGlW,KAAKu+C,gBAAkB2D,GACxDC,EAAiB7vC,KAAKkK,SAAW2lC,EACjCniD,KAAK+vC,KAAK,0BAA4BoS,EAAiB,MACvDniD,KAAKo/C,iBAAiB+C,GAEtBniD,KAAKu+C,gBAAkBjsC,KAAKG,IAAIzS,KAAKw+C,mBAngBhB,IAmgBoCx+C,KAAKu+C,iBAElEv+C,KAAK49C,kBAAiB,IAE1BF,EAAqBx9C,UAAU2hD,qBAAuB,WAClD,GAAI7hD,KAAKiiD,mBAAoB,CACzBjiD,KAAK+vC,KAAK,+BACV/vC,KAAKk/C,4BAA6B,IAAI/4C,MAAOE,UAC7CrG,KAAKm/C,+BAAiC,KACtC,IAAIiD,EAAkBpiD,KAAKm8C,eAAe3rC,KAAKxQ,MAC3CqiD,EAAYriD,KAAK25C,SAASnpC,KAAKxQ,MAC/BsiD,EAAiBtiD,KAAK+hD,sBAAsBvxC,KAAKxQ,MACjDuiD,EAAWviD,KAAK4P,GAAK,IAAM8tC,EAAqB8E,oBAChDnxB,EAASrxB,KACTyiD,EAAkBziD,KAAK2vC,cACvB+S,GAAa,EACbC,EAAe,KACfC,EAAY,WACRD,EACAA,EAAa/P,SAGb8P,GAAa,EACbJ,MAORtiD,KAAK6+C,WACDjM,MAAOgQ,EACPvH,YANgB,SAAUE,GAC1Bj5C,EAAOqgD,EAAc,0DACrBA,EAAatH,YAAYE,KAM7B,IAAIvR,EAAehqC,KAAK++C,mBACxB/+C,KAAK++C,oBAAqB,EAE1B/+C,KAAK89C,mBACA/T,SAASC,GACTC,KAAK,SAAU3oB,GACXohC,EAUD/0C,EAAI,0CATJA,EAAI,8CACJ0jB,EAAOytB,WAAax9B,GAAUA,EAAOuhC,YACrCF,EAAe,IAAIlJ,GAAW8I,EAAUlxB,EAAOqoB,UAAW0I,EAAiBC,EAAWC,EACxE,SAAUxZ,GACpB/6B,GAAK+6B,EAAS,KAAOzX,EAAOqoB,UAAU9wC,WAAa,KACnDyoB,EAAOyxB,UA/iBI,gBAgjBZL,MAMNxY,KAAK,KAAM,SAAUpB,GACtBxX,EAAO0e,KAAK,wBAA0BlH,GACjC6Z,IACGxgD,EAAUE,YAIV2L,GAAK86B,GAET+Z,SAQhBlF,EAAqBx9C,UAAU4iD,UAAY,SAAUha,GACjDn7B,EAAI,uCAAyCm7B,GAC7C9oC,KAAKi+C,kBAAkBnV,IAAU,EAC7B9oC,KAAK6+C,UACL7+C,KAAK6+C,UAAUjM,SAGX5yC,KAAK0+C,4BACLpN,aAAatxC,KAAK0+C,2BAClB1+C,KAAK0+C,0BAA4B,MAEjC1+C,KAAKs+C,YACLt+C,KAAK+hD,0BAOjBrE,EAAqBx9C,UAAU6iD,OAAS,SAAUja,GAC9Cn7B,EAAI,mCAAqCm7B,UAClC9oC,KAAKi+C,kBAAkBnV,GAC1B9+B,EAAQhK,KAAKi+C,qBACbj+C,KAAKu+C,gBAAkBf,GAClBx9C,KAAK6+C,WACN7+C,KAAKo/C,iBAAiB,KAIlC1B,EAAqBx9C,UAAUwhD,iBAAmB,SAAU/E,GACxD,IAAIrR,EAAQqR,GAAY,IAAIx2C,MAAOE,UACnCrG,KAAK69C,qBAAsBmF,iBAAkB1X,KAEjDoS,EAAqBx9C,UAAU8hD,wBAA0B,WACrD,IAAK,IAAIl/C,EAAI,EAAGA,EAAI9C,KAAKm+C,iBAAiBr8C,OAAQgB,IAAK,CACnD,IAAIs6C,EAAMp9C,KAAKm+C,iBAAiBr7C,GAC5Bs6C,GAAgB,MAAOA,EAAI4D,SAAW5D,EAAIgE,SACtChE,EAAI/hC,YACJ+hC,EAAI/hC,WAAW,qBACZrb,KAAKm+C,iBAAiBr7C,GAC7B9C,KAAKo+C,wBAIqB,IAA9Bp+C,KAAKo+C,uBACLp+C,KAAKm+C,sBAObT,EAAqBx9C,UAAUshD,iBAAmB,SAAUjtC,EAAYwX,GAEpE,IAAIsG,EAKAA,EAJCtG,EAISA,EAAM5hB,IAAI,SAAU84C,GAAK,OAAOzxC,GAAkByxC,KAAOt+C,KAAK,KAH9D,UAKd,IAAI86C,EAASz/C,KAAK+/C,cAAcxrC,EAAY8d,GACxCotB,GAAUA,EAAOpkC,YACjBokC,EAAOpkC,WAAW,sBAQ1BqiC,EAAqBx9C,UAAU6/C,cAAgB,SAAUxrC,EAAY8d,GACjE,IACIotB,EADAyD,EAAuB,IAAIrvC,GAAKU,GAAY3L,WAahD,YAX4CtC,IAAxCtG,KAAKk+C,SAASgF,IACdzD,EAASz/C,KAAKk+C,SAASgF,GAAsB7wB,UACtCryB,KAAKk+C,SAASgF,GAAsB7wB,GACW,IAAlDpoB,EAASjK,KAAKk+C,SAASgF,YAChBljD,KAAKk+C,SAASgF,IAKzBzD,OAASn5C,EAENm5C,GAEX/B,EAAqBx9C,UAAUygD,eAAiB,SAAUwC,EAAYC,GAClEz1C,EAAI,uBAAyBw1C,EAAa,IAAMC,GAChDpjD,KAAK8+C,WAAa,KAClB9+C,KAAK++C,oBAAqB,EAC1B/+C,KAAK6+C,UAAUjM,QACI,kBAAfuQ,GAAiD,sBAAfA,IAIlCnjD,KAAKg/C,yBACDh/C,KAAKg/C,wBAtqBc,IAwqBnBh/C,KAAKu+C,gBA7qBgB,IAgrBrBv+C,KAAK89C,mBAAmB1T,2BAIpCsT,EAAqBx9C,UAAUuhD,uBAAyB,SAAUnhD,GAC1DN,KAAKy+C,uBACLz+C,KAAKy+C,uBAAuBn+C,GAGxB,QAASA,GACTuF,QAAQ8H,IAAI,aAAerN,EAAU,IAAEmI,QAAQ,KAAM,kBAIjEi1C,EAAqBx9C,UAAU0hD,cAAgB,WAC3C,IAAIn7C,EAAQzG,KAEZA,KAAKmgD,UAGLv2C,EAAQ5J,KAAKk+C,SAAU,SAAU3pC,EAAY4zB,GACzCv+B,EAAQu+B,EAAS,SAAUx/B,EAAKg3C,GAC5Bl5C,EAAMm5C,YAAYD,OAG1B,IAAK,IAAI78C,EAAI,EAAGA,EAAI9C,KAAKm+C,iBAAiBr8C,OAAQgB,IAC1C9C,KAAKm+C,iBAAiBr7C,IACtB9C,KAAKmhD,SAASr+C,GAEtB,KAAO9C,KAAKq+C,0BAA0Bv8C,QAAQ,CAC1C,IAAIk/C,EAAUhhD,KAAKq+C,0BAA0BpJ,QAC7Cj1C,KAAK+gD,kBAAkBC,EAAQxhC,OAAQwhC,EAAQzsC,WAAYysC,EAAQ14C,KAAM04C,EAAQ3lC,cAOzFqiC,EAAqBx9C,UAAUyhD,kBAAoB,WAC/C,IAAI1V,KACAoX,EAAa,KACbnhD,EAAUE,WACVihD,EAAa,aAERnhD,EAAUC,cACfkhD,EAAa,QAEjBpX,EAAM,OAASoX,EAAa,IAAMtM,EAAS10C,YAAYoG,QAAQ,MAAO,MAAQ,EAC1ExB,IACAglC,EAAM,qBAAuB,EFpjXR,iBAAd7kC,WAAmD,gBAAzBA,UAAmB,UEujXpD6kC,EAAM,yBAA2B,GAErCjsC,KAAKosC,YAAYH,IAMrByR,EAAqBx9C,UAAU+hD,iBAAmB,WAC9C,IAAIH,EAASzT,GAAcD,cAAcG,kBACzC,OAAOvkC,EAAQhK,KAAKi+C,oBAAsB6D,GAK9CpE,EAAqBM,4BAA8B,EAMnDN,EAAqB8E,kBAAoB,EAClC9E,GACTP,IAsBEmG,GAAoC,SAAU54C,GAQ9C,SAAS44C,EAAmB5J,EAAWiE,EAAeG,GAClD,IAAIr3C,EAAQiE,EAAOhJ,KAAK1B,OAASA,KAajC,OAZAyG,EAAMizC,UAAYA,EAClBjzC,EAAMk3C,cAAgBA,EACtBl3C,EAAMq3C,mBAAqBA,EAE3Br3C,EAAMspC,KAAOt/B,GAAW,WAOxBhK,EAAMy3C,YACCz3C,EA6HX,OAlJA3G,EAAUwjD,EAAoB54C,GAuB9B44C,EAAmBpjD,UAAUksC,YAAc,SAAUH,GACjD,MAAM,IAAIvpC,MAAM,4BAQpB4gD,EAAmBC,aAAe,SAAUx3B,EAAO4Z,GAC/C,YAAYr/B,IAARq/B,EACO,OAASA,GAGhBrjC,EAAOypB,EAAMC,iBAAiBuc,YAAa,kDACpCxc,EAAMjW,KAAKlN,aAI1B06C,EAAmBpjD,UAAUu/C,OAAS,SAAU1zB,EAAO2zB,EAAe/Z,EAAKtqB,GACvE,IAAI5U,EAAQzG,KACRuU,EAAawX,EAAMjW,KAAKlN,WAC5B5I,KAAK+vC,KAAK,qBAAuBx7B,EAAa,IAAMwX,EAAMwE,mBAE1D,IAAIizB,EAAWF,EAAmBC,aAAax3B,EAAO4Z,GAClD8d,KACJzjD,KAAKk+C,SAASsF,GAAYC,EAC1B,IAAIC,EAAwB33B,EACvBC,iBACA23B,8BACL3jD,KAAK4jD,aAAarvC,EAAa,QAASmvC,EAAuB,SAAU7a,EAAUvnB,GAC/E,IAAIhZ,EAAOgZ,GACM,MAAbunB,IACAvgC,EAAO,KACPugC,EAAW,MAEE,OAAbA,GACApiC,EAAMk3C,cAAcppC,EAAYjM,GAAmB,EAAOq9B,GAE1Dh8B,EAAQlD,EAAMy3C,SAAUsF,KAAcC,IAWtCpoC,EATKwtB,EAGgB,KAAZA,EACM,oBAGA,cAAgBA,EANhB,KAQM,SAKjCya,EAAmBpjD,UAAU0gD,SAAW,SAAU70B,EAAO4Z,GACrD,IAAI6d,EAAWF,EAAmBC,aAAax3B,EAAO4Z,UAC/C3lC,KAAKk+C,SAASsF,IAGzBF,EAAmBpjD,UAAUm9C,iBAAmB,SAAUl0C,KAY1Dm6C,EAAmBpjD,UAAU0jD,aAAe,SAAUrvC,EAAYsvC,EAAuB98C,GACrF,IAAIN,EAAQzG,UACkB,IAA1B6jD,IAAoCA,MACxCA,EAA8B,OAAI,SAClC7jD,KAAK89C,mBACA/T,UAA2B,GAC3BE,KAAK,SAAU6Z,GAChB,IAAIC,EAAYD,GAAiBA,EAAcjB,YAC3CkB,IACAF,EAA4B,KAAIE,GAEpC,IF1zWJrsC,EE0zWQ69B,GAAO9uC,EAAMizC,UAAU/iC,OAAS,WAAa,WAC7ClQ,EAAMizC,UAAUhjC,KAChBnC,EACA,KF7zWRmD,KACJ9N,EE6zWwBi6C,EF7zWG,SAAUl7C,EAAK/G,GAClCnC,MAAMqE,QAAQlC,GACdA,EAAMgI,QAAQ,SAAUo6C,GACpBtsC,EAAO3V,KAAK0S,mBAAmB9L,GAAO,IAAM8L,mBAAmBuvC,MAInEtsC,EAAO3V,KAAK0S,mBAAmB9L,GAAO,IAAM8L,mBAAmB7S,MAGhE8V,EAAO5V,OAAS,IAAM4V,EAAO/S,KAAK,KAAO,IEozWxC8B,EAAMspC,KAAK,4BAA8BwF,GACzC,IAAI0O,EAAM,IAAIC,eACdD,EAAIjO,mBAAqB,WACrB,GAAIjvC,GAA+B,IAAnBk9C,EAAItT,WAAkB,CAClClqC,EAAMspC,KAAK,qBAAuBwF,EAAM,qBAAsB0O,EAAIrb,OAAQ,YAAaqb,EAAIE,cAC3F,IAAI95C,EAAM,KACV,GAAI45C,EAAIrb,QAAU,KAAOqb,EAAIrb,OAAS,IAAK,CACvC,IACIv+B,EAAMvB,EAASm7C,EAAIE,cAEvB,MAAOniD,GACH+L,GAAK,qCACDwnC,EACA,KACA0O,EAAIE,cAEZp9C,EAAS,KAAMsD,QAII,MAAf45C,EAAIrb,QAAiC,MAAfqb,EAAIrb,QAC1B76B,GAAK,sCACDwnC,EACA,YACA0O,EAAIrb,QAEZ7hC,EAASk9C,EAAIrb,QAEjB7hC,EAAW,OAGnBk9C,EAAI/T,KAAK,MAAOqF,GAAuB,GACvC0O,EAAIlR,UAGLuQ,GACTnG,IAqBEiH,GAAsB,WAMtB,SAASA,EAAK1K,EAAW2K,EAAiBC,GACtC,IAAI79C,EAAQzG,KACZA,KAAK05C,UAAYA,EACjB15C,KAAKskD,IAAMA,EACXtkD,KAAKukD,gBAAkB,EACvBvkD,KAAK8rC,eAAiB,KACtB9rC,KAAKwkD,YAAc,IAAInY,GACvBrsC,KAAKykD,aAAe,EACpBzkD,KAAK0kD,6BAA+B,KAEpC1kD,KAAKswC,cAAgB,IAAItf,GAKzBhxB,KAAK2kD,sBAAwB,KAE7B,IAAIC,EAAoB,IAAI/a,GAAkBya,GAE9C,GADAtkD,KAAKgwC,OAASrF,GAAaC,cAAc8O,GACrC2K,GAAmB7wC,KACnBxT,KAAK4rC,QAAU,IAAI0X,GAAmBtjD,KAAK05C,UAAW15C,KAAK29C,cAAcntC,KAAKxQ,MAAO4kD,GAErFrxC,WAAWvT,KAAK49C,iBAAiBptC,KAAKxQ,MAAM,GAAO,OAElD,CACD,IAAI6kD,EAAeP,EAAIha,QAAsC,6BAE7D,QAA4B,IAAjBua,GAAiD,OAAjBA,EAAuB,CAC9D,GAA4B,iBAAjBA,EACP,MAAM,IAAIniD,MAAM,sEAEpB,IACIuG,EAAU47C,GAEd,MAAO7iD,GACH,MAAM,IAAIU,MAAM,kCAAoCV,IAG5DhC,KAAK2kD,sBAAwB,IAAIjH,GAAqB19C,KAAK05C,UAAW15C,KAAK29C,cAAcntC,KAAKxQ,MAAOA,KAAK49C,iBAAiBptC,KAAKxQ,MAAOA,KAAK69C,oBAAoBrtC,KAAKxQ,MAAO4kD,EAAmBC,GAC/L7kD,KAAK4rC,QAAU5rC,KAAK2kD,sBAExBC,EAAkB1a,uBAAuB,SAAU/gC,GAC/C1C,EAAMmlC,QAAQyR,iBAAiBl0C,KAInCnJ,KAAK8kD,eAAiBna,GAAaI,oBAAoB2O,EAAW,WAAc,OAAO,IAAIhO,GAAcjlC,EAAMupC,OAAQvpC,EAAMmlC,WAC7H5rC,KAAK+kD,qBAEL/kD,KAAKglD,UAAY,IAAIvb,GACrBzpC,KAAKilD,cAAgB,IAAItgB,IACrB4C,eAAgB,SAAUxb,EAAO4Z,EAAK+Z,EAAerkC,GACjD,IAAI6pC,KACAxoC,EAAOjW,EAAMu+C,UAAUvvB,QAAQ1J,EAAMjW,MASzC,OANK4G,EAAK1S,YACNk7C,EAAaz+C,EAAMw+C,cAAc1f,qBAAqBxZ,EAAMjW,KAAM4G,GAClEnJ,WAAW,WACP8H,EAAW,OACZ,IAEA6pC,GAEXvd,cAAe,eAEnB3nC,KAAKmlD,YAAY,aAAa,GAC9BnlD,KAAKolD,gBAAkB,IAAIzgB,IACvB4C,eAAgB,SAAUxb,EAAO4Z,EAAK+Z,EAAerkC,GAMjD,OALA5U,EAAMmlC,QAAQ6T,OAAO1zB,EAAO2zB,EAAe/Z,EAAK,SAAUiD,EAAQtgC,GAC9D,IAAIq1B,EAAStiB,EAAWutB,EAAQtgC,GAChC7B,EAAM+9C,YAAYzX,0BAA0BhhB,EAAMjW,KAAM6nB,SAKhEgK,cAAe,SAAU5b,EAAO4Z,GAC5Bl/B,EAAMmlC,QAAQgV,SAAS70B,EAAO4Z,MAkZ1C,OA3YAye,EAAKlkD,UAAU0I,SAAW,WACtB,OAAS5I,KAAK05C,UAAU/iC,OAAS,WAAa,WAAa3W,KAAK05C,UAAUhjC,MAK9E0tC,EAAKlkD,UAAU4H,KAAO,WAClB,OAAO9H,KAAK05C,UAAU9iC,WAK1BwtC,EAAKlkD,UAAUmlD,WAAa,WACxB,IACIC,EADatlD,KAAKglD,UAAUvvB,QAAQ,IAAI5hB,GAAK,2BACzBxF,OAAS,EACjC,OAAO,IAAIlI,MAAOE,UAAYi/C,GAMlClB,EAAKlkD,UAAUqlD,qBAAuB,WAClC,OArqOJC,GAD+BA,GAuqOvB7I,UAAW38C,KAAKqlD,oBArqON,UAAIG,EAAkB,YAAK,IAAIr/C,MAAOE,UACjDm/C,EAHc,IAAUA,GAmrO/BpB,EAAKlkD,UAAUy9C,cAAgB,SAAUppC,EAAYjM,EAAMm9C,EAAS9f,GAEhE3lC,KAAKukD,kBACL,IAAIzuC,EAAO,IAAIjC,GAAKU,GACpBjM,EAAOtI,KAAK0kD,6BACN1kD,KAAK0kD,6BAA6BnwC,EAAYjM,GAC9CA,EACN,IAAIq1B,KACJ,GAAIgI,EACA,GAAI8f,EAAS,CACT,IAAIC,EAAiBv7C,EAAI7B,EAAM,SAAUq9C,GACrC,OAAO98B,GAAe88B,KAE1BhoB,EAAS39B,KAAKolD,gBAAgBlf,sBAAsBpwB,EAAM4vC,EAAgB/f,OAEzE,CACD,IAAIigB,EAAa/8B,GAAevgB,GAChCq1B,EAAS39B,KAAKolD,gBAAgB1f,0BAA0B5vB,EAAM8vC,EAAYjgB,QAG7E,GAAI8f,EAAS,CACd,IAAIppB,EAAkBlyB,EAAI7B,EAAM,SAAUq9C,GACtC,OAAO98B,GAAe88B,KAE1BhoB,EAAS39B,KAAKolD,gBAAgB5f,iBAAiB1vB,EAAMumB,OAEpD,CACD,IAAIrS,EAAOnB,GAAevgB,GAC1Bq1B,EAAS39B,KAAKolD,gBAAgB7f,qBAAqBzvB,EAAMkU,GAE7D,IAAIsN,EAAexhB,EACf6nB,EAAO77B,OAAS,IAGhBw1B,EAAet3B,KAAK6lD,mBAAmB/vC,IAE3C9V,KAAKwkD,YAAYzX,0BAA0BzV,EAAcqG,IAO7DymB,EAAKlkD,UAAU4lD,qBAAuB,SAAU/+C,GAC5C/G,KAAK0kD,6BAA+B39C,GAMxCq9C,EAAKlkD,UAAU09C,iBAAmB,SAAUmI,GACxC/lD,KAAKmlD,YAAY,YAAaY,IACR,IAAlBA,GACA/lD,KAAKgmD,0BAOb5B,EAAKlkD,UAAU29C,oBAAsB,SAAUzc,GAC3C,IAAI36B,EAAQzG,KACZgS,GAAKovB,EAAS,SAAUx/B,EAAO+G,GAC3BlC,EAAM0+C,YAAYx8C,EAAK/G,MAS/BwiD,EAAKlkD,UAAUilD,YAAc,SAAU5wC,EAAY3S,GAC/C,IAAIkU,EAAO,IAAIjC,GAAK,UAAYU,GAC5B0I,EAAU4L,GAAejnB,GAC7B5B,KAAKglD,UAAUrb,eAAe7zB,EAAMmH,GACpC,IAAI0gB,EAAS39B,KAAKilD,cAAc1f,qBAAqBzvB,EAAMmH,GAC3Djd,KAAKwkD,YAAYzX,0BAA0Bj3B,EAAM6nB,IAMrDymB,EAAKlkD,UAAU+lD,gBAAkB,WAC7B,OAAOjmD,KAAKykD,gBAQhBL,EAAKlkD,UAAUub,gBAAkB,SAAU3F,EAAMowC,EAAQtuB,EAAavc,GAClE,IAAI5U,EAAQzG,KACZA,KAAK+vC,KAAK,OACNj6B,KAAMA,EAAKlN,WACXhH,MAAOskD,EACPpsC,SAAU8d,IAId,IAAIjG,EAAe3xB,KAAKulD,uBACpBY,EAAoBt9B,GAAeq9B,EAAQtuB,GAC3C3a,EAAU2U,GAA6Bu0B,EAAmBx0B,GAC1D2Q,EAAUtiC,KAAKimD,kBACftoB,EAAS39B,KAAKolD,gBAAgBngB,mBAAmBnvB,EAAMmH,EAASqlB,GAAS,GAC7EtiC,KAAKwkD,YAAYhY,YAAY7O,GAC7B39B,KAAK4rC,QAAQwR,IAAItnC,EAAKlN,WAAYu9C,EAAkB93C,KAAgB,GAAO,SAAUu6B,EAAQyY,GACzF,IAAI+E,EAAqB,OAAXxd,EACTwd,GACDr4C,GAAK,UAAY+H,EAAO,YAAc8yB,GAE1C,IAAIyd,EAAc5/C,EAAM2+C,gBAAgB9qB,aAAagI,GAAU8jB,GAC/D3/C,EAAM+9C,YAAYzX,0BAA0Bj3B,EAAMuwC,GAClD5/C,EAAM6/C,uBAAuBjrC,EAAYutB,EAAQyY,KAErD,IAAI/pB,EAAet3B,KAAKumD,mBAAmBzwC,GAC3C9V,KAAK6lD,mBAAmBvuB,GAExBt3B,KAAKwkD,YAAYzX,0BAA0BzV,OAO/C8sB,EAAKlkD,UAAUuL,OAAS,SAAUqK,EAAM0wC,EAAiBnrC,GACrD,IAAI5U,EAAQzG,KACZA,KAAK+vC,KAAK,UAAYj6B,KAAMA,EAAKlN,WAAYhH,MAAO4kD,IAEpD,IAAIC,GAAQ,EACR90B,EAAe3xB,KAAKulD,uBACpBlpB,KAMJ,GALAzyB,EAAQ48C,EAAiB,SAAUE,EAAYC,GAC3CF,GAAQ,EACR,IAAIN,EAAoBt9B,GAAe89B,GACvCtqB,EAAgBqqB,GAAc90B,GAA6Bu0B,EAAmBx0B,KAE7E80B,EAsBD94C,EAAI,wDACJ3N,KAAKsmD,uBAAuBjrC,EAAY,UAvBhC,CACR,IAAIurC,EAAY5mD,KAAKimD,kBACjBtoB,EAAS39B,KAAKolD,gBAAgBhgB,eAAetvB,EAAMumB,EAAiBuqB,GACxE5mD,KAAKwkD,YAAYhY,YAAY7O,GAC7B39B,KAAK4rC,QAAQzR,MAAMrkB,EAAKlN,WAAY49C,EAAiB,SAAU5d,EAAQyY,GACnE,IAAI+E,EAAqB,OAAXxd,EACTwd,GACDr4C,GAAK,aAAe+H,EAAO,YAAc8yB,GAE7C,IAAIyd,EAAc5/C,EAAM2+C,gBAAgB9qB,aAAassB,GAAYR,GAC7D9uB,EAAe+uB,EAAYvkD,OAAS,EAAI2E,EAAMo/C,mBAAmB/vC,GAAQA,EAC7ErP,EAAM+9C,YAAYzX,0BAA0BzV,EAAc+uB,GAC1D5/C,EAAM6/C,uBAAuBjrC,EAAYutB,EAAQyY,KAErDz3C,EAAQ48C,EAAiB,SAAUxZ,GAC/B,IAAI1V,EAAe7wB,EAAM8/C,mBAAmBzwC,EAAKjB,MAAMm4B,IACvDvmC,EAAMo/C,mBAAmBvuB,KAG7Bt3B,KAAKwkD,YAAYzX,0BAA0Bj3B,QAWnDsuC,EAAKlkD,UAAU8lD,uBAAyB,WACpC,IAAIv/C,EAAQzG,KACZA,KAAK+vC,KAAK,sBACV,IAAIpe,EAAe3xB,KAAKulD,uBAEpB5nB,MAp0OmB,SAAUrM,EAAMK,GAC3C,IAAIk1B,EAAe,IAAI71B,GAIvB,OAHAM,EAAKC,YAAY,IAAI1d,GAAK,IAAK,SAAUiC,EAAM4G,GAC3CmqC,EAAa11B,SAASrb,EAAM8b,GAA6BlV,EAAMiV,MAE5Dk1B,GA8zO4BC,CAAyB9mD,KAAKswC,cAAe3e,GAEnDJ,YAAY1d,GAAKof,MAAO,SAAUnd,EAAMkU,GAC7D2T,EAASA,EAAO/vB,OAAOnH,EAAM2+C,gBAAgB7f,qBAAqBzvB,EAAMkU,IACxE,IAAIsN,EAAe7wB,EAAM8/C,mBAAmBzwC,GAC5CrP,EAAMo/C,mBAAmBvuB,KAE7Bt3B,KAAKswC,cAAgB,IAAItf,GACzBhxB,KAAKwkD,YAAYzX,0BAA0Bl5B,GAAKof,MAAO0K,IAM3DymB,EAAKlkD,UAAUqb,mBAAqB,SAAUzF,EAAMuF,GAChD,IAAI5U,EAAQzG,KACZA,KAAK4rC,QAAQrwB,mBAAmBzF,EAAKlN,WAAY,SAAUggC,EAAQyY,GAChD,OAAXzY,GACAniC,EAAM6pC,cAAclf,OAAOtb,GAE/BrP,EAAM6/C,uBAAuBjrC,EAAYutB,EAAQyY,MAQzD+C,EAAKlkD,UAAUsb,gBAAkB,SAAU1F,EAAMlU,EAAOyZ,GACpD,IAAI5U,EAAQzG,KACRid,EAAU4L,GAAejnB,GAC7B5B,KAAK4rC,QAAQ0R,gBAAgBxnC,EAAKlN,WAAYqU,EAAQ5O,KAAgB,GAAO,SAAUu6B,EAAQyY,GAC5E,OAAXzY,GACAniC,EAAM6pC,cAAcnf,SAASrb,EAAMmH,GAEvCxW,EAAM6/C,uBAAuBjrC,EAAYutB,EAAQyY,MASzD+C,EAAKlkD,UAAUwb,4BAA8B,SAAU5F,EAAMlU,EAAOkY,EAAUuB,GAC1E,IAAI5U,EAAQzG,KACRid,EAAU4L,GAAejnB,EAAOkY,GACpC9Z,KAAK4rC,QAAQ0R,gBAAgBxnC,EAAKlN,WAAYqU,EAAQ5O,KAAgB,GAAO,SAAUu6B,EAAQyY,GAC5E,OAAXzY,GACAniC,EAAM6pC,cAAcnf,SAASrb,EAAMmH,GAEvCxW,EAAM6/C,uBAAuBjrC,EAAYutB,EAAQyY,MAQzD+C,EAAKlkD,UAAU2b,mBAAqB,SAAU/F,EAAM0wC,EAAiBnrC,GACjE,IAAI5U,EAAQzG,KACZ,GAAIgK,EAAQw8C,GAGR,OAFA74C,EAAI,4EACJ3N,KAAKsmD,uBAAuBjrC,EAAY,MAG5Crb,KAAK4rC,QAAQ2R,kBAAkBznC,EAAKlN,WAAY49C,EAAiB,SAAU5d,EAAQyY,GAChE,OAAXzY,GACAh/B,EAAQ48C,EAAiB,SAAU5nC,EAAWI,GAC1C,IAAIE,EAAe2J,GAAe7J,GAClCvY,EAAM6pC,cAAcnf,SAASrb,EAAKjB,MAAM+J,GAAYM,KAG5DzY,EAAM6/C,uBAAuBjrC,EAAYutB,EAAQyY,MAOzD+C,EAAKlkD,UAAU8uB,yBAA2B,SAAUjD,EAAOf,GACvD,IAAI2S,EAEAA,EAD0B,UAA1B5R,EAAMjW,KAAK3B,WACFnU,KAAKilD,cAAc7lB,qBAAqBrT,EAAOf,GAG/ChrB,KAAKolD,gBAAgBhmB,qBAAqBrT,EAAOf,GAE9DhrB,KAAKwkD,YAAY3X,kBAAkB9gB,EAAMjW,KAAM6nB,IAMnDymB,EAAKlkD,UAAUgvB,4BAA8B,SAAUnD,EAAOf,GAG1D,IAAI2S,EAEAA,EAD0B,UAA1B5R,EAAMjW,KAAK3B,WACFnU,KAAKilD,cAAc5lB,wBAAwBtT,EAAOf,GAGlDhrB,KAAKolD,gBAAgB/lB,wBAAwBtT,EAAOf,GAEjEhrB,KAAKwkD,YAAY3X,kBAAkB9gB,EAAMjW,KAAM6nB,IAEnDymB,EAAKlkD,UAAU4iD,UAAY,WACnB9iD,KAAK2kD,uBACL3kD,KAAK2kD,sBAAsB7B,UAzZhB,mBA4ZnBsB,EAAKlkD,UAAU6iD,OAAS,WAChB/iD,KAAK2kD,uBACL3kD,KAAK2kD,sBAAsB5B,OA9ZhB,mBAianBqB,EAAKlkD,UAAU+rC,MAAQ,SAAU8a,GAE7B,QADkB,IAAdA,IAAwBA,GAAY,GACjB,oBAAZlhD,QAAX,CAEA,IAAIomC,EACA8a,GACK/mD,KAAK8rC,iBACN9rC,KAAK8rC,eAAiB,IAAIZ,GAAclrC,KAAKgwC,SACjD/D,EAAQjsC,KAAK8rC,eAAe9jC,OAG5BikC,EAAQjsC,KAAKgwC,OAAOhoC,MAExB,IAAIg/C,EAAc1nD,OAAOmS,KAAKw6B,GAAOgb,OAAO,SAAUC,EAAeC,GACjE,OAAO70C,KAAK4D,IAAIixC,EAAarlD,OAAQolD,IACtC,GACHt9C,EAAQqiC,EAAO,SAAUV,EAAM3pC,GAE3B,IAAK,IAAIkB,EAAIyoC,EAAKzpC,OAAQgB,EAAIkkD,EAAc,EAAGlkD,IAC3CyoC,GAAQ,IACZ1lC,QAAQ8H,IAAI49B,EAAO3pC,OAG3BwiD,EAAKlkD,UAAUknD,sBAAwB,SAAUC,GAC7CrnD,KAAKgwC,OAAOvF,iBAAiB4c,GAC7BrnD,KAAK8kD,eAAe9Y,YAAYqb,IAMpCjD,EAAKlkD,UAAU6vC,KAAO,WAElB,IADA,IAAI7/B,KACK7C,EAAK,EAAGA,EAAKzF,UAAU9F,OAAQuL,IACpC6C,EAAS7C,GAAMzF,UAAUyF,GAE7B,IAAIqD,EAAS,GACT1Q,KAAK2kD,wBACLj0C,EAAS1Q,KAAK2kD,sBAAsB/0C,GAAK,KAE7CjC,EAAIhG,WAAM,GAAS+I,GAAQ9C,OAAOsC,KAOtCk0C,EAAKlkD,UAAUomD,uBAAyB,SAAUv/C,EAAU6hC,EAAQyY,GAC5Dt6C,GACAuM,GAAe,WACX,GAAc,MAAVs1B,EACA7hC,EAAS,UAER,CACD,IAAIU,GAAQmhC,GAAU,SAASG,cAC3BvmC,EAAUiF,EACV45C,IACA7+C,GAAW,KAAO6+C,GACtB,IAAIxY,EAAW,IAAInmC,MAAMF,GACzBqmC,EAASphC,KAAOA,EAChBV,EAAS8hC,OAKzBvpC,OAAOyI,eAAeq8C,EAAKlkD,UAAW,YAClC8H,IAAK,WACD,OAAOhI,KAAKsnD,aAAetnD,KAAKsnD,WAAa,IAAIC,GAASvnD,QAE9DsO,YAAY,EACZC,cAAc,IAEX61C,KAwBPoD,GAA8B,WAI9B,SAASA,EAAa9vC,GAClB1X,KAAKynD,eAAiB,IAAIpwB,GAAc3f,EAAOuU,YAC/CjsB,KAAKsqB,OAAS5S,EAAOuU,WACrBjsB,KAAK0nD,WAAaF,EAAaG,cAAcjwC,GAC7C1X,KAAK4nD,SAAWJ,EAAaK,YAAYnwC,GAuG7C,OAlGA8vC,EAAatnD,UAAU4nD,aAAe,WAClC,OAAO9nD,KAAK0nD,YAKhBF,EAAatnD,UAAU6nD,WAAa,WAChC,OAAO/nD,KAAK4nD,UAMhBJ,EAAatnD,UAAUssB,QAAU,SAAU9P,GACvC,OAAQ1c,KAAKsqB,OAAOxN,QAAQ9c,KAAK8nD,eAAgBprC,IAAS,GACtD1c,KAAKsqB,OAAOxN,QAAQJ,EAAM1c,KAAK+nD,eAAiB,GAKxDP,EAAatnD,UAAUif,YAAc,SAAU6K,EAAMrhB,EAAKgrB,EAAU2D,EAAcpxB,EAAQqxB,GAItF,OAHKv3B,KAAKwsB,QAAQ,IAAI/P,GAAU9T,EAAKgrB,MACjCA,EAAW9M,GAAatI,YAErBve,KAAKynD,eAAetoC,YAAY6K,EAAMrhB,EAAKgrB,EAAU2D,EAAcpxB,EAAQqxB,IAKtFiwB,EAAatnD,UAAUw3B,eAAiB,SAAUlB,EAASmB,EAASJ,GAC5DI,EAAQzZ,eAERyZ,EAAU9Q,GAAatI,YAE3B,IAAIyX,EAAW2B,EAAQpX,UAAUvgB,KAAKsqB,QAEtC0L,EAAWA,EAASvX,eAAeoI,GAAatI,YAChD,IAAIypC,EAAOhoD,KAMX,OALA23B,EAAQrY,aAAaoB,GAAgB,SAAU/X,EAAKqW,GAC3CgpC,EAAKx7B,QAAQ,IAAI/P,GAAU9T,EAAKqW,MACjCgX,EAAWA,EAAS/W,qBAAqBtW,EAAKke,GAAatI,eAG5Dve,KAAKynD,eAAe/vB,eAAelB,EAASR,EAAUuB,IAKjEiwB,EAAatnD,UAAUue,eAAiB,SAAU+X,EAASoB,GAEvD,OAAOpB,GAKXgxB,EAAatnD,UAAU23B,aAAe,WAClC,OAAO,GAKX2vB,EAAatnD,UAAU43B,iBAAmB,WACtC,OAAO93B,KAAKynD,gBAKhBD,EAAatnD,UAAU+rB,SAAW,WAC9B,OAAOjsB,KAAKsqB,QAOhBk9B,EAAaG,cAAgB,SAAUjwC,GACnC,GAAIA,EAAOiW,WAAY,CACnB,IAAIs6B,EAAYvwC,EAAOuW,oBACvB,OAAOvW,EAAOuU,WAAWxO,SAAS/F,EAAOkW,qBAAsBq6B,GAG/D,OAAOvwC,EAAOuU,WAAW7O,WAQjCoqC,EAAaK,YAAc,SAAUnwC,GACjC,GAAIA,EAAOmW,SAAU,CACjB,IAAIq6B,EAAUxwC,EAAOwW,kBACrB,OAAOxW,EAAOuU,WAAWxO,SAAS/F,EAAOoW,mBAAoBo6B,GAG7D,OAAOxwC,EAAOuU,WAAWzO,WAG1BgqC,KAwBPW,GAA+B,WAI/B,SAASA,EAAczwC,GACnB1X,KAAKooD,cAAgB,IAAIZ,GAAa9vC,GACtC1X,KAAKsqB,OAAS5S,EAAOuU,WACrBjsB,KAAKqoD,OAAS3wC,EAAO4wC,WACrBtoD,KAAKuoD,UAAY7wC,EAAO8wC,iBA0N5B,OArNAL,EAAcjoD,UAAUif,YAAc,SAAU6K,EAAMrhB,EAAKgrB,EAAU2D,EAAcpxB,EAAQqxB,GAIvF,OAHKv3B,KAAKooD,cAAc57B,QAAQ,IAAI/P,GAAU9T,EAAKgrB,MAC/CA,EAAW9M,GAAatI,YAExByL,EAAKrL,kBAAkBhW,GAAKgN,OAAOge,GAE5B3J,EAEFA,EAAK3K,cAAgBrf,KAAKqoD,OACxBroD,KAAKooD,cACPtwB,mBACA3Y,YAAY6K,EAAMrhB,EAAKgrB,EAAU2D,EAAcpxB,EAAQqxB,GAGrDv3B,KAAKyoD,sBAAsBz+B,EAAMrhB,EAAKgrB,EAAUztB,EAAQqxB,IAMvE4wB,EAAcjoD,UAAUw3B,eAAiB,SAAUlB,EAASmB,EAASJ,GACjE,IAAIvB,EACJ,GAAI2B,EAAQzZ,cAAgByZ,EAAQ3tB,UAEhCgsB,EAAWnP,GAAatI,WAAWgC,UAAUvgB,KAAKsqB,aAGlD,GAAkB,EAAdtqB,KAAKqoD,OAAa1wB,EAAQtY,eAC1BsY,EAAQnX,UAAUxgB,KAAKsqB,QAAS,CAEhC0L,EAAWnP,GAAatI,WAAWgC,UAAUvgB,KAAKsqB,QAElD,IAAIjpB,OAAW,EAEXA,EADArB,KAAKuoD,SACM5wB,EAAQ/T,uBAAuB5jB,KAAKooD,cAAcL,aAAc/nD,KAAKsqB,QAGrEqN,EAAQhU,gBAAgB3jB,KAAKooD,cAAcN,eAAgB9nD,KAAKsqB,QAG/E,IADA,IAAIxI,EAAQ,EACLzgB,EAASkgB,WAAaO,EAAQ9hB,KAAKqoD,QAAQ,CAC9C,IAAIrnD,EAAOK,EAASggB,UAUpB,KARIrhB,KAAKuoD,SAEDvoD,KAAKsqB,OAAOxN,QAAQ9c,KAAKooD,cAAcN,eAAgB9mD,IAAS,EAIhEhB,KAAKsqB,OAAOxN,QAAQ9b,EAAMhB,KAAKooD,cAAcL,eAAiB,GAQlE,MALA/xB,EAAWA,EAAS/W,qBAAqBje,EAAK8G,KAAM9G,EAAK0b,MACzDoF,SAQP,CAIDkU,GAFAA,EAAW2B,EAAQpX,UAAUvgB,KAAKsqB,SAEd7L,eAAeoI,GAAatI,YAChD,IAAIyJ,OAAY,EACZC,OAAU,EACVvS,OAAM,EACNrU,OAAW,EACf,GAAIrB,KAAKuoD,SAAU,CACflnD,EAAW20B,EAASnS,mBAAmB7jB,KAAKsqB,QAC5CtC,EAAYhoB,KAAKooD,cAAcL,aAC/B9/B,EAAUjoB,KAAKooD,cAAcN,eAC7B,IAAIY,EAAiB1oD,KAAKsqB,OAAOzN,aACjCnH,EAAM,SAAUlK,EAAG7L,GAAK,OAAO+oD,EAAe/oD,EAAG6L,SAGjDnK,EAAW20B,EAASvS,YAAYzjB,KAAKsqB,QACrCtC,EAAYhoB,KAAKooD,cAAcN,eAC/B7/B,EAAUjoB,KAAKooD,cAAcL,aAC7BryC,EAAM1V,KAAKsqB,OAAOzN,aAElBiF,EAAQ,EAEZ,IAFA,IACI6mC,GAAiB,EACdtnD,EAASkgB,WAAW,CACnBvgB,EAAOK,EAASggB,WACfsnC,GAAkBjzC,EAAIsS,EAAWhnB,IAAS,IAE3C2nD,GAAiB,GAEPA,GAAkB7mC,EAAQ9hB,KAAKqoD,QAAU3yC,EAAI1U,EAAMinB,IAAY,EAEzEnG,IAGAkU,EAAWA,EAAS/W,qBAAqBje,EAAK8G,KAAM+e,GAAatI,aAKjF,OAAOve,KAAKooD,cACPtwB,mBACAJ,eAAelB,EAASR,EAAUuB,IAK3C4wB,EAAcjoD,UAAUue,eAAiB,SAAU+X,EAASoB,GAExD,OAAOpB,GAKX2xB,EAAcjoD,UAAU23B,aAAe,WACnC,OAAO,GAKXswB,EAAcjoD,UAAU43B,iBAAmB,WACvC,OAAO93B,KAAKooD,cAActwB,oBAK9BqwB,EAAcjoD,UAAU+rB,SAAW,WAC/B,OAAOjsB,KAAKsqB,QAWhB69B,EAAcjoD,UAAUuoD,sBAAwB,SAAUz+B,EAAMkH,EAAUmC,EAAWntB,EAAQ0iD,GAEzF,IAAIlzC,EACJ,GAAI1V,KAAKuoD,SAAU,CACf,IAAIM,EAAa7oD,KAAKsqB,OAAOzN,aAC7BnH,EAAM,SAAUlK,EAAG7L,GAAK,OAAOkpD,EAAWlpD,EAAG6L,SAG7CkK,EAAM1V,KAAKsqB,OAAOzN,aAEtB,IAAIugB,EAAgBpT,EACpB1nB,EAAO86B,EAAc/d,eAAiBrf,KAAKqoD,OAAQ,IACnD,IAAIS,EAAoB,IAAIrsC,GAAUyU,EAAUmC,GAC5C01B,EAAiB/oD,KAAKuoD,SACpBnrB,EAAcxV,cAAc5nB,KAAKsqB,QACjC8S,EAActV,aAAa9nB,KAAKsqB,QAClC0+B,EAAUhpD,KAAKooD,cAAc57B,QAAQs8B,GACzC,GAAI1rB,EAActe,SAASoS,GAAW,CAGlC,IAFA,IAAI+3B,EAAe7rB,EAAcze,kBAAkBuS,GAC/CmD,EAAYnuB,EAAOsyB,mBAAmBx4B,KAAKsqB,OAAQy+B,EAAgB/oD,KAAKuoD,UACxD,MAAbl0B,IACFA,EAAUvsB,MAAQopB,GAAYkM,EAActe,SAASuV,EAAUvsB,QAIhEusB,EAAYnuB,EAAOsyB,mBAAmBx4B,KAAKsqB,OAAQ+J,EAAWr0B,KAAKuoD,UAEvE,IAAIW,EAA2B,MAAb70B,EAAoB,EAAI3e,EAAI2e,EAAWy0B,GAEzD,GADsBE,IAAY31B,EAAUrpB,WAAak/C,GAAe,EAKpE,OAHyB,MAArBN,GACAA,EAAkBnxB,iBAAiBlB,GAAOQ,mBAAmB7F,EAAUmC,EAAW41B,IAE/E7rB,EAAcne,qBAAqBiS,EAAUmC,GAG3B,MAArBu1B,GACAA,EAAkBnxB,iBAAiBlB,GAAOM,mBAAmB3F,EAAU+3B,IAE3E,IAAIhuB,EAAgBmC,EAAcne,qBAAqBiS,EAAUrK,GAAatI,YAE9E,OADoC,MAAb8V,GAAqBr0B,KAAKooD,cAAc57B,QAAQ6H,IAE1C,MAArBu0B,GACAA,EAAkBnxB,iBAAiBlB,GAAOI,iBAAiBtC,EAAUvsB,KAAMusB,EAAU3X,OAElFue,EAAchc,qBAAqBoV,EAAUvsB,KAAMusB,EAAU3X,OAG7Due,EAId,OAAI5H,EAAUrpB,UAERggB,EAEFg/B,GACDtzC,EAAIqzC,EAAgBD,IAAsB,GACjB,MAArBF,IACAA,EAAkBnxB,iBAAiBlB,GAAOM,mBAAmBkyB,EAAejhD,KAAMihD,EAAersC,OACjGksC,EAAkBnxB,iBAAiBlB,GAAOI,iBAAiBzF,EAAUmC,KAElE+J,EACFne,qBAAqBiS,EAAUmC,GAC/BpU,qBAAqB8pC,EAAejhD,KAAM+e,GAAatI,aAOzDyL,GAGRm+B,KAwBPgB,GAA6B,WAC7B,SAASA,IACLnpD,KAAKopD,WAAY,EACjBppD,KAAKqpD,WAAY,EACjBrpD,KAAKspD,eAAgB,EACrBtpD,KAAKupD,SAAU,EACfvpD,KAAKwpD,aAAc,EACnBxpD,KAAKqoD,OAAS,EACdroD,KAAKypD,UAAY,GACjBzpD,KAAK0pD,iBAAmB,KACxB1pD,KAAK2pD,gBAAkB,GACvB3pD,KAAK4pD,eAAiB,KACtB5pD,KAAK6pD,cAAgB,GACrB7pD,KAAKsqB,OAAS5J,GAmWlB,OA9VAyoC,EAAYjpD,UAAUytB,SAAW,WAC7B,OAAO3tB,KAAKqpD,WAKhBF,EAAYjpD,UAAUsoD,eAAiB,WACnC,MAAuB,KAAnBxoD,KAAKypD,UAKEzpD,KAAKqpD,UAGJrpD,KAAKypD,YAAcN,EAAYW,yBAAyBC,gBAOxEZ,EAAYjpD,UAAU0tB,mBAAqB,WAEvC,OADAtrB,EAAOtC,KAAKqpD,UAAW,oCAChBrpD,KAAK0pD,kBAOhBP,EAAYjpD,UAAU+tB,kBAAoB,WAEtC,OADA3rB,EAAOtC,KAAKqpD,UAAW,oCACnBrpD,KAAKspD,cACEtpD,KAAK2pD,gBAGL34C,IAMfm4C,EAAYjpD,UAAU2tB,OAAS,WAC3B,OAAO7tB,KAAKupD,SAMhBJ,EAAYjpD,UAAU4tB,iBAAmB,WAErC,OADAxrB,EAAOtC,KAAKupD,QAAS,kCACdvpD,KAAK4pD,gBAOhBT,EAAYjpD,UAAUguB,gBAAkB,WAEpC,OADA5rB,EAAOtC,KAAKupD,QAAS,kCACjBvpD,KAAKwpD,YACExpD,KAAK6pD,cAGL54C,IAMfk4C,EAAYjpD,UAAUkuB,SAAW,WAC7B,OAAOpuB,KAAKopD,WAKhBD,EAAYjpD,UAAUmuB,iBAAmB,WACrC,OAAOruB,KAAKopD,WAAgC,KAAnBppD,KAAKypD,WAMlCN,EAAYjpD,UAAUooD,SAAW,WAE7B,OADAhmD,EAAOtC,KAAKopD,UAAW,oCAChBppD,KAAKqoD,QAKhBc,EAAYjpD,UAAU+rB,SAAW,WAC7B,OAAOjsB,KAAKsqB,QAMhB6+B,EAAYjpD,UAAU8pD,MAAQ,WAC1B,IAAInoC,EAAO,IAAIsnC,EAaf,OAZAtnC,EAAKunC,UAAYppD,KAAKopD,UACtBvnC,EAAKwmC,OAASroD,KAAKqoD,OACnBxmC,EAAKwnC,UAAYrpD,KAAKqpD,UACtBxnC,EAAK6nC,iBAAmB1pD,KAAK0pD,iBAC7B7nC,EAAKynC,cAAgBtpD,KAAKspD,cAC1BznC,EAAK8nC,gBAAkB3pD,KAAK2pD,gBAC5B9nC,EAAK0nC,QAAUvpD,KAAKupD,QACpB1nC,EAAK+nC,eAAiB5pD,KAAK4pD,eAC3B/nC,EAAK2nC,YAAcxpD,KAAKwpD,YACxB3nC,EAAKgoC,cAAgB7pD,KAAK6pD,cAC1BhoC,EAAKyI,OAAStqB,KAAKsqB,OACnBzI,EAAK4nC,UAAYzpD,KAAKypD,UACf5nC,GAMXsnC,EAAYjpD,UAAUuvB,MAAQ,SAAUw6B,GACpC,IAAIp6B,EAAY7vB,KAAKgqD,QAIrB,OAHAn6B,EAAUu5B,WAAY,EACtBv5B,EAAUw4B,OAAS4B,EACnBp6B,EAAU45B,UAAY,GACf55B,GAMXs5B,EAAYjpD,UAAUsvB,aAAe,SAAUy6B,GAC3C,IAAIp6B,EAAY7vB,KAAKgqD,QAIrB,OAHAn6B,EAAUu5B,WAAY,EACtBv5B,EAAUw4B,OAAS4B,EACnBp6B,EAAU45B,UAAYN,EAAYW,yBAAyBC,eACpDl6B,GAMXs5B,EAAYjpD,UAAUwvB,YAAc,SAAUu6B,GAC1C,IAAIp6B,EAAY7vB,KAAKgqD,QAIrB,OAHAn6B,EAAUu5B,WAAY,EACtBv5B,EAAUw4B,OAAS4B,EACnBp6B,EAAU45B,UAAYN,EAAYW,yBAAyBI,gBACpDr6B,GAOXs5B,EAAYjpD,UAAUgwB,QAAU,SAAUxS,EAAY/U,GAClD,IAAIknB,EAAY7vB,KAAKgqD,QAcrB,OAbAn6B,EAAUw5B,WAAY,OACD/iD,IAAfoX,IACFA,EAAa,MAEjBmS,EAAU65B,iBAAmBhsC,EAClB,MAAP/U,GACAknB,EAAUy5B,eAAgB,EAC1Bz5B,EAAU85B,gBAAkBhhD,IAG5BknB,EAAUy5B,eAAgB,EAC1Bz5B,EAAU85B,gBAAkB,IAEzB95B,GAOXs5B,EAAYjpD,UAAUiwB,MAAQ,SAAUzS,EAAY/U,GAChD,IAAIknB,EAAY7vB,KAAKgqD,QAcrB,OAbAn6B,EAAU05B,SAAU,OACCjjD,IAAfoX,IACFA,EAAa,MAEjBmS,EAAU+5B,eAAiBlsC,OACfpX,IAARqC,GACAknB,EAAU25B,aAAc,EACxB35B,EAAUg6B,cAAgBlhD,IAG1BknB,EAAU25B,aAAc,EACxB35B,EAAUg6B,cAAgB,IAEvBh6B,GAMXs5B,EAAYjpD,UAAU4vB,QAAU,SAAUvQ,GACtC,IAAIsQ,EAAY7vB,KAAKgqD,QAErB,OADAn6B,EAAUvF,OAAS/K,EACZsQ,GAKXs5B,EAAYjpD,UAAUowB,eAAiB,WACnC,IAAI65B,EAA0BhB,EAAYW,yBACtCpgD,KAaJ,GAZI1J,KAAKqpD,YACL3/C,EAAIygD,EAAwBC,mBAAqBpqD,KAAK0pD,iBAClD1pD,KAAKspD,gBACL5/C,EAAIygD,EAAwBE,kBAAoBrqD,KAAK2pD,kBAGzD3pD,KAAKupD,UACL7/C,EAAIygD,EAAwBG,iBAAmBtqD,KAAK4pD,eAChD5pD,KAAKwpD,cACL9/C,EAAIygD,EAAwBI,gBAAkBvqD,KAAK6pD,gBAGvD7pD,KAAKopD,UAAW,CAChB1/C,EAAIygD,EAAwBK,OAASxqD,KAAKqoD,OAC1C,IAAIoC,EAAWzqD,KAAKypD,UACH,KAAbgB,IAEIA,EADAzqD,KAAKwoD,iBACM2B,EAAwBJ,eAGxBI,EAAwBD,iBAG3CxgD,EAAIygD,EAAwBO,WAAaD,EAM7C,OAHIzqD,KAAKsqB,SAAW5J,KAChBhX,EAAIygD,EAAwBQ,OAAS3qD,KAAKsqB,OAAO1hB,YAE9Cc,GAKXy/C,EAAYjpD,UAAUi/B,aAAe,WACjC,QAASn/B,KAAKqpD,WAAarpD,KAAKupD,SAAWvpD,KAAKopD,YAKpDD,EAAYjpD,UAAUqoC,UAAY,WAC9B,OAAOvoC,KAAKm/B,gBAAkBn/B,KAAKsqB,QAAU5J,IAKjDyoC,EAAYjpD,UAAUy+B,cAAgB,WAClC,OAAI3+B,KAAKm/B,eACE,IAAI9H,GAAcr3B,KAAKisB,YAEzBjsB,KAAKouB,WACH,IAAI+5B,GAAcnoD,MAGlB,IAAIwnD,GAAaxnD,OAQhCmpD,EAAYjpD,UAAUyjD,4BAA8B,WAChD,IAKI7zB,EALA86B,EAAiBzB,EAAY0B,sBAC7BC,KACJ,OAAI9qD,KAAKuoC,YACEuiB,GAGP9qD,KAAKsqB,SAAW5J,GAChBoP,EAAU86B,EAAelqC,eAEpB1gB,KAAKsqB,SAAWZ,GACrBoG,EAAU86B,EAAelhC,YAEpB1pB,KAAKsqB,SAAW3M,GACrBmS,EAAU86B,EAAejtC,WAGzBrb,EAAOtC,KAAKsqB,kBAAkBT,GAAW,4BACzCiG,EAAU9vB,KAAKsqB,OAAO1hB,YAE1BkiD,EAAGF,EAAeG,UAAY9hD,EAAU6mB,GACpC9vB,KAAKqpD,YACLyB,EAAGF,EAAeI,UAAY/hD,EAAUjJ,KAAK0pD,kBACzC1pD,KAAKspD,gBACLwB,EAAGF,EAAeI,WAAa,IAAM/hD,EAAUjJ,KAAK2pD,mBAGxD3pD,KAAKupD,UACLuB,EAAGF,EAAeK,QAAUhiD,EAAUjJ,KAAK4pD,gBACvC5pD,KAAKwpD,cACLsB,EAAGF,EAAeK,SAAW,IAAMhiD,EAAUjJ,KAAK6pD,iBAGtD7pD,KAAKopD,YACDppD,KAAKwoD,iBACLsC,EAAGF,EAAeM,gBAAkBlrD,KAAKqoD,OAGzCyC,EAAGF,EAAeO,eAAiBnrD,KAAKqoD,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,UACVrqC,eAAgB,YAChBgJ,YAAa,SACb/L,UAAW,OACXqtC,SAAU,UACVC,OAAQ,QACRC,eAAgB,eAChBC,cAAe,eAOnBhC,EAAYiC,QAAU,IAAIjC,EACnBA,KAkBPkC,GAA2B,SAAU3gD,GAarC,SAAS2gD,EAAUh+B,EAAMvX,GAErB,KAAMuX,aAAgB+2B,IAClB,MAAM,IAAI1hD,MAAM,6DAIpB,OADQgI,EAAOhJ,KAAK1B,KAAMqtB,EAAMvX,EAAMqzC,GAAYiC,SAAS,IAAUprD,KA6OzE,OA/PAF,EAAUurD,EAAW3gD,GAsBrB2gD,EAAUnrD,UAAU2qB,OAAS,WAEzB,OADA7e,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU9F,QAC9C9B,KAAK8V,KAAK9L,UACH,KAEAhK,KAAK8V,KAAKxB,WAMzB+2C,EAAUnrD,UAAU2U,MAAQ,SAAUN,GAWlC,OAVAvI,EAAiB,kBAAmB,EAAG,EAAGpE,UAAU9F,QAC1B,iBAAfyS,EACPA,EAAarP,OAAOqP,GAEbA,aAAsBV,KACA,OAAzB7T,KAAK8V,KAAK3B,WAphYG,SAAUlI,EAAQM,EAAgBgI,EAAY/H,GACnE+H,IAEAA,EAAaA,EAAW9L,QAAQ,mBAAoB,MAExDqS,GAAmB7O,EAAQM,EAAgBgI,EAAY/H,GAghY3C8+C,CAAuB,kBAAmB,EAAG/2C,GAAY,GAEzDuG,GAAmB,kBAAmB,EAAGvG,GAAY,IAEtD,IAAI82C,EAAUrrD,KAAKqtB,KAAMrtB,KAAK8V,KAAKjB,MAAMN,KAGpD82C,EAAUnrD,UAAUkrB,UAAY,WAC5Bpf,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QACrD,IAAIypD,EAAavrD,KAAK8V,KAAKnB,SAC3B,OAAsB,OAAf42C,EAAsB,KAAO,IAAIF,EAAUrrD,KAAKqtB,KAAMk+B,IAGjEF,EAAUnrD,UAAUsrD,QAAU,WAC1Bx/C,EAAiB,iBAAkB,EAAG,EAAGpE,UAAU9F,QAEnD,IADA,IAAIqpB,EAAMnrB,KACiB,OAApBmrB,EAAIC,aACPD,EAAMA,EAAIC,YAEd,OAAOD,GAGXkgC,EAAUnrD,UAAUurD,aAAe,WAC/B,OAAOzrD,KAAKqtB,KAAKq+B,UAOrBL,EAAUnrD,UAAUkO,IAAM,SAAU83C,EAAQ7qC,GACxCrP,EAAiB,gBAAiB,EAAG,EAAGpE,UAAU9F,QAClDiZ,GAAqB,gBAAiB/a,KAAK8V,MAC3CiE,GAAwB,gBAAiB,EAAGmsC,EAAQlmD,KAAK8V,MAAM,GAC/DpJ,EAAiB,gBAAiB,EAAG2O,GAAY,GACjD,IAAIC,EAAW,IAAI9U,EAGnB,OAFAxG,KAAKqtB,KAAK5R,gBAAgBzb,KAAK8V,KAAMowC,EACvB,KAAM5qC,EAASxU,aAAauU,IACnCC,EAAS5U,SAOpB2kD,EAAUnrD,UAAUuL,OAAS,SAAUkQ,EAAeN,GAGlD,GAFArP,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QACrDiZ,GAAqB,mBAAoB/a,KAAK8V,MAC1CrW,MAAMqE,QAAQ6X,GAAgB,CAE9B,IADA,IAAIC,KACK9Y,EAAI,EAAGA,EAAI6Y,EAAc7Z,SAAUgB,EACxC8Y,EAAiB,GAAK9Y,GAAK6Y,EAAc7Y,GAE7C6Y,EAAgBC,EAChB7N,GAAK,wMAKTsM,GAA6B,mBAAoB,EAAGsB,EAAe3b,KAAK8V,MAAM,GAC9EpJ,EAAiB,mBAAoB,EAAG2O,GAAY,GACpD,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKqtB,KAAK5hB,OAAOzL,KAAK8V,KAAM6F,EAAeL,EAASxU,aAAauU,IAC1DC,EAAS5U,SAQpB2kD,EAAUnrD,UAAUub,gBAAkB,SAAUyqC,EAAQtuB,EAAavc,GAMjE,GALArP,EAAiB,4BAA6B,EAAG,EAAGpE,UAAU9F,QAC9DiZ,GAAqB,4BAA6B/a,KAAK8V,MACvDiE,GAAwB,4BAA6B,EAAGmsC,EAAQlmD,KAAK8V,MAAM,GAC3E4E,GAAiB,4BAA6B,EAAGkd,GAAa,GAC9DlrB,EAAiB,4BAA6B,EAAG2O,GAAY,GACvC,YAAlBrb,KAAK6qB,UAA4C,UAAlB7qB,KAAK6qB,SACpC,KAAM,qCACF7qB,KAAK6qB,SACL,0BACR,IAAIvP,EAAW,IAAI9U,EAEnB,OADAxG,KAAKqtB,KAAK5R,gBAAgBzb,KAAK8V,KAAMowC,EAAQtuB,EAAatc,EAASxU,aAAauU,IACzEC,EAAS5U,SAMpB2kD,EAAUnrD,UAAU+O,OAAS,SAAUoM,GAInC,OAHArP,EAAiB,mBAAoB,EAAG,EAAGpE,UAAU9F,QACrDiZ,GAAqB,mBAAoB/a,KAAK8V,MAC9CpJ,EAAiB,mBAAoB,EAAG2O,GAAY,GAC7Crb,KAAKoO,IAAI,KAAMiN,IAQ1BgwC,EAAUnrD,UAAUyrD,YAAc,SAAUC,EAAmBvwC,EAAYwwC,GAQvE,GAPA7/C,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU9F,QAC1DiZ,GAAqB,wBAAyB/a,KAAK8V,MACnDpJ,EAAiB,wBAAyB,EAAGk/C,GAAmB,GAChEl/C,EAAiB,wBAAyB,EAAG2O,GAAY,GArmY3C,SAAUpP,EAAQM,EAAgBu/C,EAAMt/C,GAC1D,KAAIA,QAAqBlG,IAATwlD,IAEI,kBAATA,EACP,MAAM,IAAIppD,MAAM4J,EAAYL,EAAQM,EAAgBC,GAAY,sBAomYhEu/C,CAAgB,wBAAyB,EAAGF,GAAc,GACpC,YAAlB7rD,KAAK6qB,UAA4C,UAAlB7qB,KAAK6qB,SACpC,KAAM,iCACF7qB,KAAK6qB,SACL,+BACavkB,IAAjBulD,IACAA,GAAe,GACnB,IAAIvwC,EAAW,IAAI9U,EACO,mBAAf6U,GACPC,EAAS5U,QAAQM,MAAM,cAc3B,OADAhH,KAAKqtB,KAAK2+B,iBAAiBhsD,KAAK8V,KAAM81C,EAXhB,SAAU/iB,EAAU9sB,EAAWC,GAC7C6sB,EACAvtB,EAASzU,OAAOgiC,GAGhBvtB,EAAS1U,QAAQ,IAAIkV,GAAkBC,EAAWC,IAE5B,mBAAfX,GACPA,EAAWwtB,EAAU9sB,EAAWC,IAGkC6vC,GACnEvwC,EAAS5U,SAOpB2kD,EAAUnrD,UAAU+rD,YAAc,SAAUnyC,EAAUuB,GAClDrP,EAAiB,wBAAyB,EAAG,EAAGpE,UAAU9F,QAC1DiZ,GAAqB,wBAAyB/a,KAAK8V,MACnD4E,GAAiB,wBAAyB,EAAGZ,GAAU,GACvDpN,EAAiB,wBAAyB,EAAG2O,GAAY,GACzD,IAAIC,EAAW,IAAI9U,EAEnB,OADAxG,KAAKqtB,KAAK5R,gBAAgBzb,KAAK8V,KAAKjB,MAAM,aAAciF,EAAU,KAAMwB,EAASxU,aAAauU,IACvFC,EAAS5U,SAOpB2kD,EAAUnrD,UAAU6B,KAAO,SAAUH,EAAOyZ,GACxCrP,EAAiB,iBAAkB,EAAG,EAAGpE,UAAU9F,QACnDiZ,GAAqB,iBAAkB/a,KAAK8V,MAC5CiE,GAAwB,iBAAkB,EAAGnY,EAAO5B,KAAK8V,MAAM,GAC/DpJ,EAAiB,iBAAkB,EAAG2O,GAAY,GAClD,IASI3U,EATA6G,EAAMvN,KAAKqtB,KAAKg4B,aAChBv9C,EAAOoU,GAAW3O,GAMlB2+C,EAAmBlsD,KAAK6U,MAAM/M,GAC9BqkD,EAAUnsD,KAAK6U,MAAM/M,GAazB,OAVIpB,EADS,MAAT9E,EACUsqD,EAAiB99C,IAAIxM,EAAOyZ,GAAY4uB,KAAK,WAAc,OAAOkiB,IAGlExlD,QAAQC,QAAQulD,GAE9BD,EAAiBjiB,KAAOvjC,EAAQujC,KAAKz5B,KAAK9J,GAC1CwlD,EAAiBllD,MAAQN,EAAQujC,KAAKz5B,KAAK9J,OAASJ,GAC1B,mBAAf+U,GACP3U,EAAQM,MAAM,cAEXklD,GAKXb,EAAUnrD,UAAUkwC,aAAe,WAE/B,OADAr1B,GAAqB,yBAA0B/a,KAAK8V,MAC7C,IAAIoF,GAAalb,KAAKqtB,KAAMrtB,KAAK8V,OAE5CxW,OAAOyI,eAAesjD,EAAUnrD,UAAW,YACvC8H,IAAK,WACD,OAAOhI,KAAKyrD,gBAEhBn9C,YAAY,EACZC,cAAc,IAElBjP,OAAOyI,eAAesjD,EAAUnrD,UAAW,OACvC8H,IAAK,WACD,OAAOhI,KAAK6qB,UAEhBvc,YAAY,EACZC,cAAc,IAElBjP,OAAOyI,eAAesjD,EAAUnrD,UAAW,UACvC8H,IAAK,WACD,OAAOhI,KAAKorB,aAEhB9c,YAAY,EACZC,cAAc,IAElBjP,OAAOyI,eAAesjD,EAAUnrD,UAAW,QACvC8H,IAAK,WACD,OAAOhI,KAAKwrD,WAEhBl9C,YAAY,EACZC,cAAc,IAEX88C,GACTj+B,IAOFA,GAAM5D,uBAAyB6hC,GAC/BtrB,GAAUvW,uBAAyB6hC,GAoBnC,IA+NIe,GA/NAC,GAA0B,WAQ1B,OAPA,WAGIrsD,KAAK+yB,YACL/yB,KAAKssD,WAAa,EAClBtsD,KAAK4B,MAAQ,SASjB2qD,GAAsB,WAOtB,SAASA,EAAKC,EAAOC,EAASriC,QACZ,IAAVoiC,IAAoBA,EAAQ,SAChB,IAAZC,IAAsBA,EAAU,WACtB,IAAVriC,IAAoBA,EAAQ,IAAIiiC,IACpCrsD,KAAKwsD,MAAQA,EACbxsD,KAAKysD,QAAUA,EACfzsD,KAAKoqB,MAAQA,EA0KjB,OAlKAmiC,EAAKrsD,UAAUwsD,QAAU,SAAUC,GAI/B,IAFA,IACkB3rD,EADd8U,EAAO62C,aAAmB94C,GAAO84C,EAAU,IAAI94C,GAAK84C,GACpD93C,EAAQ7U,KACwB,QAA5BgB,EAAO8U,EAAK3B,aAAsB,CAEtCU,EAAQ,IAAI03C,EAAKvrD,EAAM6T,EADPlL,EAAQkL,EAAMuV,MAAM2I,SAAU/xB,IAAS,IAAIqrD,IAE3Dv2C,EAAOA,EAAKzB,WAEhB,OAAOQ,GAOX03C,EAAKrsD,UAAUyf,SAAW,WACtB,OAAO3f,KAAKoqB,MAAMxoB,OAOtB2qD,EAAKrsD,UAAU0sD,SAAW,SAAUhrD,GAChCU,OAAwB,IAAVV,EAAuB,iCACrC5B,KAAKoqB,MAAMxoB,MAAQA,EACnB5B,KAAK6sD,kBAKTN,EAAKrsD,UAAU6wB,MAAQ,WACnB/wB,KAAKoqB,MAAMxoB,MAAQ,KACnB5B,KAAKoqB,MAAM2I,YACX/yB,KAAKoqB,MAAMkiC,WAAa,EACxBtsD,KAAK6sD,kBAKTN,EAAKrsD,UAAU0qB,YAAc,WACzB,OAAO5qB,KAAKoqB,MAAMkiC,WAAa,GAKnCC,EAAKrsD,UAAU8J,QAAU,WACrB,OAA2B,OAApBhK,KAAK2f,aAAwB3f,KAAK4qB,eAO7C2hC,EAAKrsD,UAAUof,aAAe,SAAUE,GACpC,IAAI/Y,EAAQzG,KACZ4J,EAAQ5J,KAAKoqB,MAAM2I,SAAU,SAAUle,EAAOoQ,GAC1CzF,EAAO,IAAI+sC,EAAK13C,EAAOpO,EAAOwe,OAYtCsnC,EAAKrsD,UAAU4sD,kBAAoB,SAAUttC,EAAQutC,EAAaC,GAC1DD,IAAgBC,GAChBxtC,EAAOxf,MACXA,KAAKsf,aAAa,SAAUzK,GACxBA,EAAMi4C,kBAAkBttC,GAAyB,EAAMwtC,KAEvDD,GAAeC,GACfxtC,EAAOxf,OAUfusD,EAAKrsD,UAAU+sD,gBAAkB,SAAUztC,EAAQutC,GAE/C,IADA,IAAIrwC,EAAOqwC,EAAc/sD,KAAOA,KAAK2U,SACrB,OAAT+H,GAAe,CAClB,GAAI8C,EAAO9C,GACP,OAAO,EAEXA,EAAOA,EAAK/H,SAEhB,OAAO,GASX43C,EAAKrsD,UAAUgtD,oCAAsC,SAAU1tC,GAC3Dxf,KAAKsf,aAAa,SAAUzK,GACC,OAArBA,EAAM8K,WACNH,EAAO3K,GAEPA,EAAMq4C,oCAAoC1tC,MAMtD+sC,EAAKrsD,UAAU4V,KAAO,WAClB,OAAO,IAAIjC,GAAsB,OAAjB7T,KAAKysD,QACfzsD,KAAKwsD,MACLxsD,KAAKysD,QAAQ32C,OAAS,IAAM9V,KAAKwsD,QAK3CD,EAAKrsD,UAAU4H,KAAO,WAClB,OAAO9H,KAAKwsD,OAKhBD,EAAKrsD,UAAUyU,OAAS,WACpB,OAAO3U,KAAKysD,SAOhBF,EAAKrsD,UAAU2sD,eAAiB,WACP,OAAjB7sD,KAAKysD,SACLzsD,KAAKysD,QAAQU,aAAantD,KAAKwsD,MAAOxsD,OAS9CusD,EAAKrsD,UAAUitD,aAAe,SAAUvuC,EAAW/J,GAC/C,IAAIu4C,EAAav4C,EAAM7K,UACnBqjD,EAAc5jD,EAASzJ,KAAKoqB,MAAM2I,SAAUnU,GAC5CwuC,GAAcC,UACPrtD,KAAKoqB,MAAM2I,SAASnU,GAC3B5e,KAAKoqB,MAAMkiC,aACXtsD,KAAK6sD,kBAECO,GAAeC,IACrBrtD,KAAKoqB,MAAM2I,SAASnU,GAAa/J,EAAMuV,MACvCpqB,KAAKoqB,MAAMkiC,aACXtsD,KAAK6sD,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,GAAKlkD,UAAU6kD,mBAAqB,WAOhC/kD,KAAKutD,sBAAwB,IAAIhB,IAUrCnI,GAAKlkD,UAAU8rD,iBAAmB,SAAUl2C,EAAM81C,EAAmBvwC,EAAYwwC,GAC7E7rD,KAAK+vC,KAAK,kBAAoBj6B,GAE9B,IAAI03C,EAAgB,aAChBC,EAAW,IAAIpC,GAAUrrD,KAAM8V,GACnC23C,EAASl/B,GAAG,QAASi/B,GACrB,IAII7B,GACA71C,KAAMA,EACNrK,OAAQmgD,EACRvwC,WAAYA,EAEZutB,OAAQ,KAER8kB,MAAO/9C,IAEPk8C,aAAcA,EAEd8B,WAAY,EAEZC,UAjBY,WACZH,EAASx+B,IAAI,QAASu+B,IAkBtBK,YAAa,KACbC,eAAgB,KAChBC,qBAAsB,KACtBC,yBAA0B,KAC1BC,8BAA+B,MAG/BC,EAAeluD,KAAKmuD,gBAAgBr4C,GACxC61C,EAAYoC,qBAAuBG,EACnC,IAAIhI,EAASyF,EAAYlgD,OAAOyiD,EAAa7/C,OAC7C,QAAe/H,IAAX4/C,GAKA,GAHAyF,EAAYiC,YACZjC,EAAYqC,yBAA2B,KACvCrC,EAAYsC,8BAAgC,KACxCtC,EAAYtwC,WAAY,CAExB,IAAIW,EAAW,IAAImO,GAAawhC,EAAYoC,qBAAsB,IAAI1C,GAAUrrD,KAAM2rD,EAAY71C,MAAO4K,IACzGirC,EAAYtwC,WAAW,MAAM,EAAOW,QAGvC,CACDhC,GAAqB,qCAAsCksC,EAAQyF,EAAY71C,MAE/E61C,EAAY/iB,OAASwjB,GAAkBgC,IACvC,IAAIC,EAAYruD,KAAKutD,sBAAsBb,QAAQ52C,GAC/Cw4C,EAAYD,EAAU1uC,eAC1B2uC,EAAUvsD,KAAK4pD,GACf0C,EAAUzB,SAAS0B,GAInB,IAAIC,OAAkB,EACtB,GAAsB,iBAAXrI,GACI,OAAXA,GACAz8C,EAASy8C,EAAQ,aACjBqI,EAAkB5kD,EAAQu8C,EAAQ,aAClC5jD,EAAOuX,GAAgB00C,GAAkB,yHAMzCA,GAFkBvuD,KAAKolD,gBAAgB7pB,uBAAuBzlB,IAC1D+Q,GAAatI,YACaJ,cAAc9P,MAEhDkgD,EAAoDA,EACpD,IAAI58B,EAAe3xB,KAAKulD,uBACpBY,EAAoBt9B,GAAeq9B,EAAQqI,GAC3CtxC,EAAU2U,GAA6Bu0B,EAAmBx0B,GAC9Dg6B,EAAYqC,yBAA2B7H,EACvCwF,EAAYsC,8BAAgChxC,EAC5C0uC,EAAYmC,eAAiB9tD,KAAKimD,kBAClC,IAAItoB,EAAS39B,KAAKolD,gBAAgBngB,mBAAmBnvB,EAAMmH,EAAS0uC,EAAYmC,eAAgBnC,EAAYE,cAC5G7rD,KAAKwkD,YAAYzX,0BAA0Bj3B,EAAM6nB,GACjD39B,KAAKwuD,2BASbpK,GAAKlkD,UAAUiuD,gBAAkB,SAAUr4C,EAAM24C,GAC7C,OAAQzuD,KAAKolD,gBAAgB7pB,uBAAuBzlB,EAAM24C,IACtD5nC,GAAatI,YAYrB6lC,GAAKlkD,UAAUsuD,uBAAyB,SAAU9xC,GAC9C,IAAIjW,EAAQzG,KAMZ,QALa,IAAT0c,IAAmBA,EAAO1c,KAAKutD,uBAE9B7wC,GACD1c,KAAK0uD,qCAAqChyC,GAEtB,OAApBA,EAAKiD,WAAqB,CAC1B,IAAIgvC,EAAQ3uD,KAAK4uD,uBAAuBlyC,GACxCpa,EAAOqsD,EAAM7sD,OAAS,EAAG,yCACZ6sD,EAAMzhC,MAAM,SAAUy+B,GAAe,OAAOA,EAAY/iB,SAAWwjB,GAAkBgC,OAG9FpuD,KAAK6uD,sBAAsBnyC,EAAK5G,OAAQ64C,QAGvCjyC,EAAKkO,eACVlO,EAAK4C,aAAa,SAAUN,GACxBvY,EAAM+nD,uBAAuBxvC,MAWzColC,GAAKlkD,UAAU2uD,sBAAwB,SAAU/4C,EAAM64C,GASnD,IARA,IAAIloD,EAAQzG,KAER8uD,EAAeH,EAAMxkD,IAAI,SAAU4kD,GACnC,OAAOA,EAAIjB,iBAEXkB,EAAchvD,KAAKmuD,gBAAgBr4C,EAAMg5C,GACzCG,EAAaD,EACbE,EAAaF,EAAYnvC,OACpB/c,EAAI,EAAGA,EAAI6rD,EAAM7sD,OAAQgB,IAAK,CACnC,IAAIisD,EAAMJ,EAAM7rD,GAChBR,EAAOysD,EAAInmB,SAAWwjB,GAAkBgC,IAAK,iEAC7CW,EAAInmB,OAASwjB,GAAkB+C,KAC/BJ,EAAIpB,aACJ,IAAI34C,EAAenB,GAAKmB,aAAac,EAAMi5C,EAAIj5C,MAE/Cm5C,EAAaA,EAAW9vC,YAAYnK,EAAkC+5C,EAAIf,0BAE9E,IAAIoB,EAAaH,EAAW5gD,KAAI,GAC5BghD,EAAav5C,EAEjB9V,KAAK4rC,QAAQwR,IAAIiS,EAAWzmD,WAAYwmD,EAAY,SAAUxmB,GAC1DniC,EAAMspC,KAAK,4BACPj6B,KAAMu5C,EAAWzmD,WACjBggC,OAAQA,IAEZ,IAAIjL,KACJ,GAAe,OAAXiL,EAAiB,CAIjB,IADA,IAAIha,KACK9rB,EAAI,EAAGA,EAAI6rD,EAAM7sD,OAAQgB,IAAK,CAGnC,GAFA6rD,EAAM7rD,GAAG8lC,OAASwjB,GAAkBkD,UACpC3xB,EAASA,EAAO/vB,OAAOnH,EAAM2+C,gBAAgB9qB,aAAaq0B,EAAM7rD,GAAGgrD,iBAC/Da,EAAM7rD,GAAGuY,WAAY,CAErB,IAAIqB,EAAOiyC,EAAM7rD,GAAGmrD,8BAChB9iC,EAAM,IAAIkgC,GAAU5kD,EAAOkoD,EAAM7rD,GAAGgT,MACpCkG,EAAW,IAAImO,GAAazN,EAAMyO,EAAKzK,IAC3CkO,EAAU7sB,KAAK4sD,EAAM7rD,GAAGuY,WAAW7K,KAAK,KAAM,MAAM,EAAMwL,IAE9D2yC,EAAM7rD,GAAG8qD,YAGbnnD,EAAMioD,qCAAqCjoD,EAAM8mD,sBAAsBb,QAAQ52C,IAE/ErP,EAAM+nD,yBACN/nD,EAAM+9C,YAAYzX,0BAA0Bj3B,EAAM6nB,GAElD,IAAS76B,EAAI,EAAGA,EAAI8rB,EAAU9sB,OAAQgB,IAClCwQ,GAAesb,EAAU9rB,QAG5B,CAED,GAAe,cAAX8lC,EACA,IAAS9lC,EAAI,EAAGA,EAAI6rD,EAAM7sD,OAAQgB,IAC1B6rD,EAAM7rD,GAAG8lC,SAAWwjB,GAAkBmD,iBACtCZ,EAAM7rD,GAAG8lC,OAASwjB,GAAkBoD,YAEpCb,EAAM7rD,GAAG8lC,OAASwjB,GAAkBgC,QAG3C,CACDrgD,GAAK,kBAAoBshD,EAAWzmD,WAAa,YAAcggC,GAC/D,IAAS9lC,EAAI,EAAGA,EAAI6rD,EAAM7sD,OAAQgB,IAC9B6rD,EAAM7rD,GAAG8lC,OAASwjB,GAAkBoD,YACpCb,EAAM7rD,GAAG+qD,YAAcjlB,EAG/BniC,EAAMo/C,mBAAmB/vC,KAE9Bo5C,IAcP9K,GAAKlkD,UAAU2lD,mBAAqB,SAAU7Y,GAC1C,IAAIyiB,EAA0BzvD,KAAK0vD,4BAA4B1iB,GAC3Dl3B,EAAO25C,EAAwB35C,OAC/B64C,EAAQ3uD,KAAK4uD,uBAAuBa,GAExC,OADAzvD,KAAK2vD,uBAAuBhB,EAAO74C,GAC5BA,GASXsuC,GAAKlkD,UAAUyvD,uBAAyB,SAAUhB,EAAO74C,GACrD,GAAqB,IAAjB64C,EAAM7sD,OAAV,CAcA,IATA,IAiEmB8rD,EAjEfh/B,KACA+O,KAKAmxB,EAHcH,EAAM3wB,OAAO,SAAUilB,GACrC,OAAOA,EAAEra,SAAWwjB,GAAkBgC,MAEXjkD,IAAI,SAAU84C,GACzC,OAAOA,EAAE6K,iBAEJhrD,EAAI,EAAGA,EAAI6rD,EAAM7sD,OAAQgB,IAAK,CACnC,IAAI6oD,EAAcgD,EAAM7rD,GACpBkS,EAAenB,GAAKmB,aAAac,EAAM61C,EAAY71C,MACnD85C,GAAmB,EAAO/B,OAAc,EAE5C,GADAvrD,EAAwB,OAAjB0S,EAAuB,iEAC1B22C,EAAY/iB,SAAWwjB,GAAkBoD,YACzCI,GAAmB,EACnB/B,EAAclC,EAAYkC,YAC1BlwB,EAASA,EAAO/vB,OAAO5N,KAAKolD,gBAAgB9qB,aAAaqxB,EAAYmC,gBAAgB,SAEpF,GAAInC,EAAY/iB,SAAWwjB,GAAkBgC,IAC9C,GAAIzC,EAAYgC,YAAcvJ,GAAKkJ,yBAC/BsC,GAAmB,EACnB/B,EAAc,WACdlwB,EAASA,EAAO/vB,OAAO5N,KAAKolD,gBAAgB9qB,aAAaqxB,EAAYmC,gBAAgB,QAEpF,CAED,IAAI+B,EAAc7vD,KAAKmuD,gBAAgBxC,EAAY71C,KAAMg5C,GACzDnD,EAAYoC,qBAAuB8B,EACnC,IAAI3qB,EAAUypB,EAAM7rD,GAAG2I,OAAOokD,EAAYxhD,OAC1C,QAAgB/H,IAAZ4+B,EAAuB,CACvBlrB,GAAqB,qCAAsCkrB,EAASymB,EAAY71C,MAChF,IAAIg6C,EAAcjnC,GAAeqc,GACY,iBAAZA,GAClB,MAAXA,GACAz7B,EAASy7B,EAAS,eAGlB4qB,EAAcA,EAAYrxC,eAAeoxC,EAAY1xC,gBAEzD,IAAI4xC,EAAapE,EAAYmC,eACzBn8B,EAAe3xB,KAAKulD,uBACpByK,EAAkBp+B,GAA6Bk+B,EAAan+B,GAChEg6B,EAAYqC,yBAA2B8B,EACvCnE,EAAYsC,8BAAgC+B,EAC5CrE,EAAYmC,eAAiB9tD,KAAKimD,kBAElC6I,EAAajsB,OAAOisB,EAAa93C,QAAQ+4C,GAAa,GAEtDpyB,GADAA,EAASA,EAAO/vB,OAAO5N,KAAKolD,gBAAgBngB,mBAAmB0mB,EAAY71C,KAAMk6C,EAAiBrE,EAAYmC,eAAgBnC,EAAYE,gBAC1Hj+C,OAAO5N,KAAKolD,gBAAgB9qB,aAAay1B,GAAY,SAGrEH,GAAmB,EACnB/B,EAAc,SACdlwB,EAASA,EAAO/vB,OAAO5N,KAAKolD,gBAAgB9qB,aAAaqxB,EAAYmC,gBAAgB,IAMjG,GAFA9tD,KAAKwkD,YAAYzX,0BAA0Bj3B,EAAM6nB,GACjDA,KACIiyB,IAEAjB,EAAM7rD,GAAG8lC,OAASwjB,GAAkBkD,UAGzB1B,EAERe,EAAM7rD,GAAG8qD,UADRr6C,WAAWq6C,EAAWt7C,KAAKI,MAAM,IAEjCi8C,EAAM7rD,GAAGuY,YACT,GAAoB,WAAhBwyC,EAA0B,CAC1B,IAAI1iC,EAAM,IAAIkgC,GAAUrrD,KAAM2uD,EAAM7rD,GAAGgT,MAEnCm6C,EAAiCtB,EAAM7rD,GAAGirD,qBAC1C/xC,EAAW,IAAImO,GAAa8lC,EAAW9kC,EAAKzK,IAChDkO,EAAU7sB,KAAK4sD,EAAM7rD,GAAGuY,WAAW7K,KAAK,KAAM,MAAM,EAAOwL,SAG3D4S,EAAU7sB,KAAK4sD,EAAM7rD,GAAGuY,WAAW7K,KAAK,KAAM,IAAI9N,MAAMmrD,IAAc,EAAO,OAM7F7tD,KAAK0uD,qCAAqC1uD,KAAKutD,uBAE/C,IAASzqD,EAAI,EAAGA,EAAI8rB,EAAU9sB,OAAQgB,IAClCwQ,GAAesb,EAAU9rB,IAG7B9C,KAAKwuD,2BAUTpK,GAAKlkD,UAAUwvD,4BAA8B,SAAU55C,GAInD,IAHA,IAAIsJ,EAEA8wC,EAAkBlwD,KAAKutD,sBACU,QAA7BnuC,EAAQtJ,EAAK3B,aACc,OAA/B+7C,EAAgBvwC,YAChBuwC,EAAkBA,EAAgBxD,QAAQttC,GAC1CtJ,EAAOA,EAAKzB,WAEhB,OAAO67C,GASX9L,GAAKlkD,UAAU0uD,uBAAyB,SAAUsB,GAE9C,IAAIC,KAMJ,OALAnwD,KAAKowD,mCAAmCF,EAAiBC,GAEzDA,EAAiBz+C,KAAK,SAAUlG,EAAG7L,GAC/B,OAAO6L,EAAEkiD,MAAQ/tD,EAAE+tD,QAEhByC,GAOX/L,GAAKlkD,UAAUkwD,mCAAqC,SAAU1zC,EAAMiyC,GAChE,IAAIloD,EAAQzG,KACRsuD,EAAY5xC,EAAKiD,WACrB,GAAkB,OAAd2uC,EACA,IAAK,IAAIxrD,EAAI,EAAGA,EAAIwrD,EAAUxsD,OAAQgB,IAClC6rD,EAAM5sD,KAAKusD,EAAUxrD,IAG7B4Z,EAAK4C,aAAa,SAAUzK,GACxBpO,EAAM2pD,mCAAmCv7C,EAAO85C,MASxDvK,GAAKlkD,UAAUwuD,qCAAuC,SAAUhyC,GAC5D,IAAIjW,EAAQzG,KACR2uD,EAAQjyC,EAAKiD,WACjB,GAAIgvC,EAAO,CAEP,IADA,IAAI0B,EAAK,EACAC,EAAO,EAAGA,EAAO3B,EAAM7sD,OAAQwuD,IAChC3B,EAAM2B,GAAM1nB,SAAWwjB,GAAkBkD,YACzCX,EAAM0B,GAAM1B,EAAM2B,GAClBD,KAGR1B,EAAM7sD,OAASuuD,EACf3zC,EAAKkwC,SAAS+B,EAAM7sD,OAAS,EAAI6sD,EAAQ,MAE7CjyC,EAAK4C,aAAa,SAAUN,GACxBvY,EAAMioD,qCAAqC1vC,MAWnDolC,GAAKlkD,UAAUqmD,mBAAqB,SAAUzwC,GAC1C,IAAIrP,EAAQzG,KACRs3B,EAAet3B,KAAK0vD,4BAA4B55C,GAAMA,OACtDo6C,EAAkBlwD,KAAKutD,sBAAsBb,QAAQ52C,GAQzD,OAPAo6C,EAAgBjD,gBAAgB,SAAUvwC,GACtCjW,EAAM8pD,yBAAyB7zC,KAEnC1c,KAAKuwD,yBAAyBL,GAC9BA,EAAgBpD,kBAAkB,SAAUpwC,GACxCjW,EAAM8pD,yBAAyB7zC,KAE5B4a,GAQX8sB,GAAKlkD,UAAUqwD,yBAA2B,SAAU7zC,GAChD,IAAIiyC,EAAQjyC,EAAKiD,WACjB,GAAc,OAAVgvC,EAAgB,CAQhB,IALA,IAAI//B,KAGA+O,KACA6yB,GAAY,EACP1tD,EAAI,EAAGA,EAAI6rD,EAAM7sD,OAAQgB,IAC9B,GAAI6rD,EAAM7rD,GAAG8lC,SAAWwjB,GAAkBmD,uBAGrC,GAAIZ,EAAM7rD,GAAG8lC,SAAWwjB,GAAkB+C,KAC3C7sD,EAAOkuD,IAAa1tD,EAAI,EAAG,mDAC3B0tD,EAAW1tD,EAEX6rD,EAAM7rD,GAAG8lC,OAASwjB,GAAkBmD,iBACpCZ,EAAM7rD,GAAG+qD,YAAc,WAOvB,GAJAvrD,EAAOqsD,EAAM7rD,GAAG8lC,SAAWwjB,GAAkBgC,IAAK,0CAElDO,EAAM7rD,GAAG8qD,YACTjwB,EAASA,EAAO/vB,OAAO5N,KAAKolD,gBAAgB9qB,aAAaq0B,EAAM7rD,GAAGgrD,gBAAgB,IAC9Ea,EAAM7rD,GAAGuY,WAAY,CAErBuT,EAAU7sB,KAAK4sD,EAAM7rD,GAAGuY,WAAW7K,KAAK,KAAM,IAAI9N,MAAM,QAAQ,EADjD,QAKT,IAAd8tD,EAEA9zC,EAAKkwC,SAAS,MAId+B,EAAM7sD,OAAS0uD,EAAW,EAG9BxwD,KAAKwkD,YAAYzX,0BAA0BrwB,EAAK5G,OAAQ6nB,GACxD,IAAS76B,EAAI,EAAGA,EAAI8rB,EAAU9sB,OAAQgB,IAClCwQ,GAAesb,EAAU9rB,MAqBrC,IACI2tD,GAIAC,GAA6B,WAC7B,SAASA,IAIL1wD,KAAK2wD,UAKL3wD,KAAK4wD,gBAAiB,EAyF1B,OAvFAF,EAAYtiB,YAAc,WAItB,OAHKqiB,KACDA,GAAkB,IAAIC,GAEnBD,IAGXC,EAAYxwD,UAAU4iD,UAAY,WAC9B,IAAK,IAAI+N,KAAW7wD,KAAK2wD,OACrB,IAAK,IAAIG,KAAS9wD,KAAK2wD,OAAOE,GAC1B7wD,KAAK2wD,OAAOE,GAASC,GAAOhO,aAIxC4N,EAAYxwD,UAAU6iD,OAAS,WAC3B,IAAK,IAAI8N,KAAW7wD,KAAK2wD,OACrB,IAAK,IAAIG,KAAS9wD,KAAK2wD,OAAOE,GAC1B7wD,KAAK2wD,OAAOE,GAASC,GAAO/N,UAUxC2N,EAAYxwD,UAAU6wD,gBAAkB,SAAUzM,EAAK/O,GACnD,IAAIub,EAAQvb,GAAO+O,EAAIha,QAA2B,iBACpChkC,IAAVwqD,GACAngD,GAAM,wHAIV,IAAIuH,EAAYF,GAAc84C,GAC1Bt4C,EAAWN,EAAUM,SAOzB,OANAwC,GAAY,gCAAiC,EAAG9C,GAC3CA,EAAUpC,KAAK9L,WAChB2G,GAAM,4FAGC3Q,KAAKgxD,WAAWx4C,EAAU8rC,GACzBoH,UAOhBgF,EAAYxwD,UAAU+wD,WAAa,SAAU5jC,GACzC,IAAI6jC,EAAWvnD,EAAQ3J,KAAK2wD,OAAQtjC,EAAKi3B,IAAIx8C,MAExCopD,GAAYvnD,EAAQunD,EAAU7jC,EAAKqsB,UAAU7hC,iBAAmBwV,GACjE1c,GAAM,YAAc0c,EAAKi3B,IAAIx8C,KAAO,IAAMulB,EAAKqsB,UAAY,+BAE/DrsB,EAAKy1B,mBACEoO,EAAS7jC,EAAKqsB,UAAU7hC,gBAUnC64C,EAAYxwD,UAAU8wD,WAAa,SAAUx4C,EAAU8rC,GACnD,IAAI4M,EAAWvnD,EAAQ3J,KAAK2wD,OAAQrM,EAAIx8C,MACnCopD,IACDA,KACAlxD,KAAK2wD,OAAOrM,EAAIx8C,MAAQopD,GAE5B,IAAI7jC,EAAO1jB,EAAQunD,EAAU14C,EAASX,eAMtC,OALIwV,GACA1c,GAAM,2HAEV0c,EAAO,IAAI+2B,GAAK5rC,EAAUxY,KAAK4wD,eAAgBtM,GAC/C4M,EAAS14C,EAASX,eAAiBwV,EAC5BA,GAMXqjC,EAAYxwD,UAAUmkD,gBAAkB,SAAUA,GAC9CrkD,KAAK4wD,eAAiBvM,GAEnBqM,KAsBPnJ,GAA0B,WAK1B,SAASA,EAASpsC,GACdnb,KAAKmb,MAAQA,EACPA,aAAiBipC,IACnBzzC,GAAM,wEAGV3Q,KAAKsjB,MAAQ,IAAI+nC,GAAUlwC,EAAOtH,GAAKof,OACvCjzB,KAAKmxD,SAAW,IAAIC,GAAkBpxD,MAmE1C,OAjEAV,OAAOyI,eAAew/C,EAASrnD,UAAW,OACtC8H,IAAK,WACD,OAAOhI,KAAKmb,MAAMmpC,KAEtBh2C,YAAY,EACZC,cAAc,IAElBg5C,EAASrnD,UAAUirB,IAAM,SAAUrV,GAG/B,OAFA9V,KAAKqxD,cAAc,OACnBrlD,EAAiB,eAAgB,EAAG,EAAGpE,UAAU9F,QAC7CgU,aAAgBu1C,GACTrrD,KAAKsxD,WAAWx7C,EAAKlN,iBAEhBtC,IAATwP,EAAqB9V,KAAKsjB,MAAMzO,MAAMiB,GAAQ9V,KAAKsjB,OAS9DikC,EAASrnD,UAAUoxD,WAAa,SAAU/b,GAEtC,IAAIgc,EAAU,sBACdvxD,KAAKqxD,cAAcE,GACnBvlD,EAAiBulD,EAAS,EAAG,EAAG3pD,UAAU9F,QAC1C,IAAI0vD,EAAYx5C,GAAcu9B,GAC9Bv6B,GAAYu2C,EAAS,EAAGC,GACxB,IAAIh5C,EAAWg5C,EAAUh5C,SAUzB,OATIA,EAAS9B,OAAS1W,KAAKmb,MAAMu+B,UAAUhjC,MACvC/F,GAAM4gD,EACF,2DAEA/4C,EAAS9B,KACT,iBACA1W,KAAKmb,MAAMu+B,UAAUhjC,KACrB,KAED1W,KAAKmrB,IAAIqmC,EAAU17C,KAAKlN,aAKnC2+C,EAASrnD,UAAUmxD,cAAgB,SAAUE,GACtB,OAAfvxD,KAAKmb,OACLxK,GAAM,eAAiB4gD,EAAU,4BAIzChK,EAASrnD,UAAUuxD,UAAY,WAC3BzlD,EAAiB,qBAAsB,EAAG,EAAGpE,UAAU9F,QACvD9B,KAAKqxD,cAAc,aACnBrxD,KAAKmb,MAAM2nC,aAEfyE,EAASrnD,UAAUwxD,SAAW,WAC1B1lD,EAAiB,oBAAqB,EAAG,EAAGpE,UAAU9F,QACtD9B,KAAKqxD,cAAc,YACnBrxD,KAAKmb,MAAM4nC,UAEfwE,EAASoK,aACLC,WACIC,MAAO,cAGRtK,KAEP6J,GAAmC,WAEnC,SAASA,EAAkB1F,GACvB1rD,KAAK0rD,SAAWA,EAgBpB,OAbA0F,EAAkBlxD,UAAU4xD,OAAS,WACjC,OH5udkBzxD,EG4udDL,KH5udU+xD,OG4udJ,EH5udmBC,EG4udH,WACnC,OAAO5xD,EAAYJ,KAAM,SAAUqZ,GAO/B,OANArZ,KAAK0rD,SAAS2F,cAAc,UAC5BX,GAAYtiB,cAAc6iB,WAAWjxD,KAAK0rD,SAASvwC,OACnDnb,KAAK0rD,SAASvwC,MAAQ,KACtBnb,KAAK0rD,SAASpoC,MAAQ,KACtBtjB,KAAK0rD,SAASyF,SAAW,KACzBnxD,KAAK0rD,SAAW,MACR,MHnvdb,KADoCuG,OG4udR,KH3udjBA,EAAItrD,UAAU,SAAUC,EAASC,GAC/C,SAASqrD,EAAUtwD,GAAS,IAAMK,EAAK+vD,EAAUhxD,KAAKY,IAAW,MAAOI,GAAK6E,EAAO7E,IACpF,SAASmwD,EAASvwD,GAAS,IAAMK,EAAK+vD,EAAiB,MAAEpwD,IAAW,MAAOI,GAAK6E,EAAO7E,IACvF,SAASC,EAAKqf,GAAUA,EAAO3f,KAAOiF,EAAQ0a,EAAO1f,OAAS,IAAIqwD,EAAE,SAAUrrD,GAAWA,EAAQ0a,EAAO1f,SAAWqoC,KAAKioB,EAAWC,GACnIlwD,GAAM+vD,EAAYA,EAAUrqD,MAAMtH,EAAS0xD,QAAmB/wD,UAL/D,IAAmBX,EAAS0xD,EAAYE,EAAGD,GGwvdvCZ,KAoDPD,GAAwB7xD,OAAO8yD,QACjCC,iBA5BqB,WACnB9b,GAAoBnE,gBACpB5C,GAAsB0C,cA2BxBogB,gBAzBoB,WAClB9iB,GAAsB4C,iBAyBxB6G,sBAtB0B,WACxB,OAAO1C,GAAiC,eAsB1Cgc,yBApB6B,SAAUpnC,EAAKpkB,GAC1CokB,EAAIkC,KAAKs3B,sBAAsBlG,uBAAyB13C,GAoB1DklC,MAlBU,SAAU9gB,EAAK47B,GACvB57B,EAAIkC,KAAK4e,MAAM8a,IAkBjBK,sBAhB0B,SAAUj8B,EAAKk8B,GACvCl8B,EAAIkC,KAAK+5B,sBAAsBC,IAgBjC9C,gBAdoB,SAAUp5B,GAC5B,OAAOA,EAAIkC,KAAKk3B,iBAclBiO,oBAZwB,SAAUrnC,EAAKpkB,GACrC,OAAOokB,EAAIkC,KAAKy4B,qBAAqB/+C,MA6BrC0rD,GAAiB/U,GAKrBA,GAAqBx9C,UAAUwyD,aAAe,SAAUn+C,EAAY8G,GAChErb,KAAKq7C,YAAY,KAAOz7C,EAAG2U,GAAc8G,IAM7CqiC,GAAqBx9C,UAAUyyD,KAAO,SAAUrqD,EAAMsqD,GAClD5yD,KAAKq7C,YAAY,QAAU37C,EAAG4I,GAAQsqD,IAG1C,IAAIC,GAAqBpZ,GAoBrBqZ,GAAmBr8C,GAwBnBs8C,GAA2BzzD,OAAO8yD,QACpCK,eAAgBA,GAChBI,mBAAoBA,GACpBG,WA1Ce,SAAUC,GACvB,IAAIC,EAASxV,GAAqBx9C,UAAUk9C,IAO5C,OANAM,GAAqBx9C,UAAUk9C,IAAM,SAAU7oC,EAAYjM,EAAM6qD,EAAgBC,QAC5D9sD,IAAb8sD,IACAA,EAAWH,KAEfC,EAAOxxD,KAAK1B,KAAMuU,EAAYjM,EAAM6qD,EAAgBC,IAEjD,WACH1V,GAAqBx9C,UAAUk9C,IAAM8V,IAkC3CJ,iBAAkBA,GAClBviC,gBAxBoB,SAAUxE,GAC5B,OAAOA,EAAMwE,mBAwBf8iC,QAlBY,SAAUC,GACpB,OAAOA,EAAYjmC,KAAKs3B,sBAAsBzG,UAkBhDmG,gBAXoB,SAAUA,GAC5BqM,GAAYtiB,cAAciW,gBAAgBA,MA4B1CsN,GAAcpK,GAASoK,YAGnB/6C,GAeSmgC,EAfYoa,SAASoC,gBAAgB,WAAY,SAAUjP,EAAKkP,EAAQje,GAAO,OAAOmb,GAAYtiB,cAAc2iB,gBAAgBzM,EAAK/O,KAG9I8V,UAAWA,GACXj+B,MAAOA,GACPm6B,SAAUA,GACVl3C,cAAeA,EACf8gD,SAAUA,GACVQ,YAAaA,GACboB,YAAaA,IACd,MAAM,GACL1rD,MACAosD,OAAOC,QAAU98C,+HAdzB,IAEQA,GAlsaAuF,GAGAC,GAKAC,GA1lDAzM"}