{"ast":null,"code":"import { __assign, __extends } from 'tslib';\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n/**\r\n * @fileoverview Firebase constants. Some of these (@defines) can be overridden at compile-time.\r\n */\n\nvar CONSTANTS = {\n /**\r\n * @define {boolean} Whether this is the client Node.js SDK.\r\n */\n NODE_CLIENT: false,\n\n /**\r\n * @define {boolean} Whether this is the Admin Node.js SDK.\r\n */\n NODE_ADMIN: false,\n\n /**\r\n * Firebase SDK Version\r\n */\n SDK_VERSION: '${JSCORE_VERSION}'\n};\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n/**\r\n * Throws an error if the provided assertion is falsy\r\n */\n\nvar assert = function (assertion, message) {\n if (!assertion) {\n throw assertionError(message);\n }\n};\n/**\r\n * Returns an Error object suitable for throwing.\r\n */\n\n\nvar assertionError = function (message) {\n return new Error('Firebase Database (' + CONSTANTS.SDK_VERSION + ') INTERNAL ASSERT FAILED: ' + message);\n};\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n\nvar stringToByteArray$1 = function (str) {\n // TODO(user): Use native implementations if/when available\n var out = [];\n var p = 0;\n\n for (var i = 0; i < str.length; i++) {\n var c = str.charCodeAt(i);\n\n if (c < 128) {\n out[p++] = c;\n } else if (c < 2048) {\n out[p++] = c >> 6 | 192;\n out[p++] = c & 63 | 128;\n } else if ((c & 0xfc00) === 0xd800 && i + 1 < str.length && (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {\n // Surrogate Pair\n c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\n out[p++] = c >> 18 | 240;\n out[p++] = c >> 12 & 63 | 128;\n out[p++] = c >> 6 & 63 | 128;\n out[p++] = c & 63 | 128;\n } else {\n out[p++] = c >> 12 | 224;\n out[p++] = c >> 6 & 63 | 128;\n out[p++] = c & 63 | 128;\n }\n }\n\n return out;\n};\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 bytes Array of numbers representing characters.\r\n * @return Stringification of the array.\r\n */\n\n\nvar byteArrayToString = function (bytes) {\n // TODO(user): Use native implementations if/when available\n var out = [];\n var pos = 0,\n c = 0;\n\n while (pos < bytes.length) {\n var c1 = bytes[pos++];\n\n if (c1 < 128) {\n out[c++] = String.fromCharCode(c1);\n } else if (c1 > 191 && c1 < 224) {\n var c2 = bytes[pos++];\n out[c++] = String.fromCharCode((c1 & 31) << 6 | c2 & 63);\n } else if (c1 > 239 && c1 < 365) {\n // Surrogate Pair\n var c2 = bytes[pos++];\n var c3 = bytes[pos++];\n var c4 = bytes[pos++];\n var u = ((c1 & 7) << 18 | (c2 & 63) << 12 | (c3 & 63) << 6 | c4 & 63) - 0x10000;\n out[c++] = String.fromCharCode(0xd800 + (u >> 10));\n out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\n } else {\n var c2 = bytes[pos++];\n var c3 = bytes[pos++];\n out[c++] = String.fromCharCode((c1 & 15) << 12 | (c2 & 63) << 6 | c3 & 63);\n }\n }\n\n return out.join('');\n}; // We define it as an object literal instead of a class because a class compiled down to es5 can't\n// be treeshaked. https://github.com/rollup/rollup/issues/1691\n// Static lookup maps, lazily populated by init_()\n\n\nvar base64 = {\n /**\r\n * Maps bytes to characters.\r\n */\n byteToCharMap_: null,\n\n /**\r\n * Maps characters to bytes.\r\n */\n charToByteMap_: null,\n\n /**\r\n * Maps bytes to websafe characters.\r\n * @private\r\n */\n byteToCharMapWebSafe_: null,\n\n /**\r\n * Maps websafe characters to bytes.\r\n * @private\r\n */\n charToByteMapWebSafe_: null,\n\n /**\r\n * Our default alphabet, shared between\r\n * ENCODED_VALS and ENCODED_VALS_WEBSAFE\r\n */\n ENCODED_VALS_BASE: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n /**\r\n * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\r\n */\n get ENCODED_VALS() {\n return this.ENCODED_VALS_BASE + '+/=';\n },\n\n /**\r\n * Our websafe alphabet.\r\n */\n get ENCODED_VALS_WEBSAFE() {\n return this.ENCODED_VALS_BASE + '-_.';\n },\n\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 */\n HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n /**\r\n * Base64-encode an array of bytes.\r\n *\r\n * @param input An array of bytes (numbers with\r\n * value in [0, 255]) to encode.\r\n * @param webSafe Boolean indicating we should use the\r\n * alternative alphabet.\r\n * @return The base64 encoded string.\r\n */\n encodeByteArray: function (input, webSafe) {\n if (!Array.isArray(input)) {\n throw Error('encodeByteArray takes an array as a parameter');\n }\n\n this.init_();\n var byteToCharMap = webSafe ? this.byteToCharMapWebSafe_ : this.byteToCharMap_;\n var output = [];\n\n for (var i = 0; i < input.length; i += 3) {\n var byte1 = input[i];\n var haveByte2 = i + 1 < input.length;\n var byte2 = haveByte2 ? input[i + 1] : 0;\n var haveByte3 = i + 2 < input.length;\n var byte3 = haveByte3 ? input[i + 2] : 0;\n var outByte1 = byte1 >> 2;\n var outByte2 = (byte1 & 0x03) << 4 | byte2 >> 4;\n var outByte3 = (byte2 & 0x0f) << 2 | byte3 >> 6;\n var outByte4 = byte3 & 0x3f;\n\n if (!haveByte3) {\n outByte4 = 64;\n\n if (!haveByte2) {\n outByte3 = 64;\n }\n }\n\n output.push(byteToCharMap[outByte1], byteToCharMap[outByte2], byteToCharMap[outByte3], byteToCharMap[outByte4]);\n }\n\n return output.join('');\n },\n\n /**\r\n * Base64-encode a string.\r\n *\r\n * @param input A string to encode.\r\n * @param webSafe If true, we should use the\r\n * alternative alphabet.\r\n * @return The base64 encoded string.\r\n */\n encodeString: function (input, webSafe) {\n // Shortcut for Mozilla browsers that implement\n // a native base64 encoder in the form of \"btoa/atob\"\n if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n return btoa(input);\n }\n\n return this.encodeByteArray(stringToByteArray$1(input), webSafe);\n },\n\n /**\r\n * Base64-decode a string.\r\n *\r\n * @param input to decode.\r\n * @param webSafe True if we should use the\r\n * alternative alphabet.\r\n * @return string representing the decoded value.\r\n */\n decodeString: function (input, webSafe) {\n // Shortcut for Mozilla browsers that implement\n // a native base64 encoder in the form of \"btoa/atob\"\n if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n return atob(input);\n }\n\n return byteArrayToString(this.decodeStringToByteArray(input, webSafe));\n },\n\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 input Input to decode.\r\n * @param webSafe True if we should use the web-safe alphabet.\r\n * @return bytes representing the decoded value.\r\n */\n decodeStringToByteArray: function (input, webSafe) {\n this.init_();\n var charToByteMap = webSafe ? this.charToByteMapWebSafe_ : this.charToByteMap_;\n var output = [];\n\n for (var i = 0; i < input.length;) {\n var byte1 = charToByteMap[input.charAt(i++)];\n var haveByte2 = i < input.length;\n var byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n ++i;\n var haveByte3 = i < input.length;\n var byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n ++i;\n var haveByte4 = i < input.length;\n var byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n ++i;\n\n if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n throw Error();\n }\n\n var outByte1 = byte1 << 2 | byte2 >> 4;\n output.push(outByte1);\n\n if (byte3 !== 64) {\n var outByte2 = byte2 << 4 & 0xf0 | byte3 >> 2;\n output.push(outByte2);\n\n if (byte4 !== 64) {\n var outByte3 = byte3 << 6 & 0xc0 | byte4;\n output.push(outByte3);\n }\n }\n }\n\n return output;\n },\n\n /**\r\n * Lazy static initialization function. Called before\r\n * accessing any of the static map variables.\r\n * @private\r\n */\n init_: function () {\n if (!this.byteToCharMap_) {\n this.byteToCharMap_ = {};\n this.charToByteMap_ = {};\n this.byteToCharMapWebSafe_ = {};\n this.charToByteMapWebSafe_ = {}; // We want quick mappings back and forth, so we precompute two maps.\n\n for (var i = 0; i < this.ENCODED_VALS.length; i++) {\n this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n this.charToByteMap_[this.byteToCharMap_[i]] = i;\n this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i; // Be forgiving when decoding and correctly decode both encodings.\n\n if (i >= this.ENCODED_VALS_BASE.length) {\n this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n }\n }\n }\n }\n};\n/**\r\n * URL-safe base64 encoding\r\n */\n\nvar base64Encode = function (str) {\n var utf8Bytes = stringToByteArray$1(str);\n return base64.encodeByteArray(utf8Bytes, true);\n};\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 str To be decoded\r\n * @return Decoded result, if possible\r\n */\n\n\nvar base64Decode = function (str) {\n try {\n return base64.decodeString(str, true);\n } catch (e) {\n console.error('base64Decode failed: ', e);\n }\n\n return null;\n};\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n/**\r\n * Do a deep-copy of basic JavaScript Objects or Arrays.\r\n */\n\n\nfunction deepCopy(value) {\n return deepExtend(undefined, value);\n}\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\n * Note: we don't merge __proto__ to prevent prototype pollution\r\n */\n\n\nfunction deepExtend(target, source) {\n if (!(source instanceof Object)) {\n return source;\n }\n\n switch (source.constructor) {\n case Date:\n // Treat Dates like scalars; if the target date object had any child\n // properties - they will be lost!\n var dateValue = source;\n return new Date(dateValue.getTime());\n\n case Object:\n if (target === undefined) {\n target = {};\n }\n\n break;\n\n case Array:\n // Always copy the array source and overwrite the target.\n target = [];\n break;\n\n default:\n // Not a plain Object - treat it as a scalar.\n return source;\n }\n\n for (var prop in source) {\n // use isValidKey to guard against prototype pollution. See https://snyk.io/vuln/SNYK-JS-LODASH-450202\n if (!source.hasOwnProperty(prop) || !isValidKey(prop)) {\n continue;\n }\n\n target[prop] = deepExtend(target[prop], source[prop]);\n }\n\n return target;\n}\n\nfunction isValidKey(key) {\n return key !== '__proto__';\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n\nvar Deferred =\n/** @class */\nfunction () {\n function Deferred() {\n var _this = this;\n\n this.reject = function () {};\n\n this.resolve = function () {};\n\n this.promise = new Promise(function (resolve, reject) {\n _this.resolve = resolve;\n _this.reject = reject;\n });\n }\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 */\n\n\n Deferred.prototype.wrapCallback = function (callback) {\n var _this = this;\n\n return function (error, value) {\n if (error) {\n _this.reject(error);\n } else {\n _this.resolve(value);\n }\n\n if (typeof callback === 'function') {\n // Attaching noop handler just in case developer wasn't expecting\n // promises\n _this.promise.catch(function () {}); // Some of our callbacks don't expect a value and our own tests\n // assert that the parameter length is 1\n\n\n if (callback.length === 1) {\n callback(error);\n } else {\n callback(error, value);\n }\n }\n };\n };\n\n return Deferred;\n}();\n/**\r\n * @license\r\n * Copyright 2021 Google LLC\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\n\nfunction createMockUserToken(token, projectId) {\n if (token.uid) {\n throw new Error('The \"uid\" field is no longer supported by mockUserToken. Please use \"sub\" instead for Firebase Auth User ID.');\n } // Unsecured JWTs use \"none\" as the algorithm.\n\n\n var header = {\n alg: 'none',\n type: 'JWT'\n };\n var project = projectId || 'demo-project';\n var iat = token.iat || 0;\n var sub = token.sub || token.user_id;\n\n if (!sub) {\n throw new Error(\"mockUserToken must contain 'sub' or 'user_id' field!\");\n }\n\n var payload = __assign({\n // Set all required fields to decent defaults\n iss: \"https://securetoken.google.com/\" + project,\n aud: project,\n iat: iat,\n exp: iat + 3600,\n auth_time: iat,\n sub: sub,\n user_id: sub,\n firebase: {\n sign_in_provider: 'custom',\n identities: {}\n }\n }, token); // Unsecured JWTs use the empty string as a signature.\n\n\n var signature = '';\n return [base64.encodeString(JSON.stringify(header),\n /*webSafe=*/\n false), base64.encodeString(JSON.stringify(payload),\n /*webSafe=*/\n false), signature].join('.');\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n/**\r\n * Returns navigator.userAgent string or '' if it's not defined.\r\n * @return user agent string\r\n */\n\n\nfunction getUA() {\n if (typeof navigator !== 'undefined' && typeof navigator['userAgent'] === 'string') {\n return navigator['userAgent'];\n } else {\n return '';\n }\n}\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\r\n * in the Ripple emulator) nor Cordova `onDeviceReady`, which would normally\r\n * wait for a callback.\r\n */\n\n\nfunction isMobileCordova() {\n return typeof window !== 'undefined' && // @ts-ignore Setting up an broadly applicable index signature for Window\n // just to deal with this case would probably be a bad idea.\n !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) && /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA());\n}\n/**\r\n * Detect Node.js.\r\n *\r\n * @return true if Node.js environment is detected.\r\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\n\n\nfunction isNode() {\n try {\n return Object.prototype.toString.call(global.process) === '[object process]';\n } catch (e) {\n return false;\n }\n}\n/**\r\n * Detect Browser Environment\r\n */\n\n\nfunction isBrowser() {\n return typeof self === 'object' && self.self === self;\n}\n\nfunction isBrowserExtension() {\n var runtime = typeof chrome === 'object' ? chrome.runtime : typeof browser === 'object' ? browser.runtime : undefined;\n return typeof runtime === 'object' && runtime.id !== undefined;\n}\n/**\r\n * Detect React Native.\r\n *\r\n * @return true if ReactNative environment is detected.\r\n */\n\n\nfunction isReactNative() {\n return typeof navigator === 'object' && navigator['product'] === 'ReactNative';\n}\n/** Detects Electron apps. */\n\n\nfunction isElectron() {\n return getUA().indexOf('Electron/') >= 0;\n}\n/** Detects Internet Explorer. */\n\n\nfunction isIE() {\n var ua = getUA();\n return ua.indexOf('MSIE ') >= 0 || ua.indexOf('Trident/') >= 0;\n}\n/** Detects Universal Windows Platform apps. */\n\n\nfunction isUWP() {\n return getUA().indexOf('MSAppHost/') >= 0;\n}\n/**\r\n * Detect whether the current SDK build is the Node version.\r\n *\r\n * @return true if it's the Node SDK build.\r\n */\n\n\nfunction isNodeSdk() {\n return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n/** Returns true if we are running in Safari. */\n\n\nfunction isSafari() {\n return !isNode() && navigator.userAgent.includes('Safari') && !navigator.userAgent.includes('Chrome');\n}\n/**\r\n * This method checks if indexedDB is supported by current browser/service worker context\r\n * @return true if indexedDB is supported by current browser/service worker context\r\n */\n\n\nfunction isIndexedDBAvailable() {\n return 'indexedDB' in self && indexedDB != null;\n}\n/**\r\n * This method validates browser/sw context for indexedDB by opening a dummy indexedDB database and reject\r\n * if errors occur during the database open operation.\r\n *\r\n * @throws exception if current browser/sw context can't run idb.open (ex: Safari iframe, Firefox\r\n * private browsing)\r\n */\n\n\nfunction validateIndexedDBOpenable() {\n return new Promise(function (resolve, reject) {\n try {\n var preExist_1 = true;\n var DB_CHECK_NAME_1 = 'validate-browser-context-for-indexeddb-analytics-module';\n var request_1 = self.indexedDB.open(DB_CHECK_NAME_1);\n\n request_1.onsuccess = function () {\n request_1.result.close(); // delete database only when it doesn't pre-exist\n\n if (!preExist_1) {\n self.indexedDB.deleteDatabase(DB_CHECK_NAME_1);\n }\n\n resolve(true);\n };\n\n request_1.onupgradeneeded = function () {\n preExist_1 = false;\n };\n\n request_1.onerror = function () {\n var _a;\n\n reject(((_a = request_1.error) === null || _a === void 0 ? void 0 : _a.message) || '');\n };\n } catch (error) {\n reject(error);\n }\n });\n}\n/**\r\n *\r\n * This method checks whether cookie is enabled within current browser\r\n * @return true if cookie is enabled within current browser\r\n */\n\n\nfunction areCookiesEnabled() {\n if (!navigator || !navigator.cookieEnabled) {\n return false;\n }\n\n return true;\n}\n/**\r\n * Polyfill for `globalThis` object.\r\n * @returns the `globalThis` object for the given environment.\r\n */\n\n\nfunction getGlobal() {\n if (typeof self !== 'undefined') {\n return self;\n }\n\n if (typeof window !== 'undefined') {\n return window;\n }\n\n if (typeof global !== 'undefined') {\n return global;\n }\n\n throw new Error('Unable to locate global object.');\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n\nvar ERROR_NAME = 'FirebaseError'; // Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\n\nvar FirebaseError =\n/** @class */\nfunction (_super) {\n __extends(FirebaseError, _super);\n\n function FirebaseError(code, message, customData) {\n var _this = _super.call(this, message) || this;\n\n _this.code = code;\n _this.customData = customData;\n _this.name = ERROR_NAME; // Fix For ES5\n // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n\n Object.setPrototypeOf(_this, FirebaseError.prototype); // Maintains proper stack trace for where our error was thrown.\n // Only available on V8.\n\n if (Error.captureStackTrace) {\n Error.captureStackTrace(_this, ErrorFactory.prototype.create);\n }\n\n return _this;\n }\n\n return FirebaseError;\n}(Error);\n\nvar ErrorFactory =\n/** @class */\nfunction () {\n function ErrorFactory(service, serviceName, errors) {\n this.service = service;\n this.serviceName = serviceName;\n this.errors = errors;\n }\n\n ErrorFactory.prototype.create = function (code) {\n var data = [];\n\n for (var _i = 1; _i < arguments.length; _i++) {\n data[_i - 1] = arguments[_i];\n }\n\n var customData = data[0] || {};\n var fullCode = this.service + \"/\" + code;\n var template = this.errors[code];\n var message = template ? replaceTemplate(template, customData) : 'Error'; // Service Name: Error message (service/code).\n\n var fullMessage = this.serviceName + \": \" + message + \" (\" + fullCode + \").\";\n var error = new FirebaseError(fullCode, fullMessage, customData);\n return error;\n };\n\n return ErrorFactory;\n}();\n\nfunction replaceTemplate(template, data) {\n return template.replace(PATTERN, function (_, key) {\n var value = data[key];\n return value != null ? String(value) : \"<\" + key + \"?>\";\n });\n}\n\nvar PATTERN = /\\{\\$([^}]+)}/g;\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\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 */\n\nfunction jsonEval(str) {\n return JSON.parse(str);\n}\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 */\n\n\nfunction stringify(data) {\n return JSON.stringify(data);\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\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 */\n\n\nvar decode = function (token) {\n var header = {},\n claims = {},\n data = {},\n signature = '';\n\n try {\n var parts = token.split('.');\n header = jsonEval(base64Decode(parts[0]) || '');\n claims = jsonEval(base64Decode(parts[1]) || '');\n signature = parts[2];\n data = claims['d'] || {};\n delete claims['d'];\n } catch (e) {}\n\n return {\n header: header,\n claims: claims,\n data: data,\n signature: signature\n };\n};\n/**\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 */\n\n\nvar isValidTimestamp = function (token) {\n var claims = decode(token).claims;\n var now = Math.floor(new Date().getTime() / 1000);\n var validSince = 0,\n validUntil = 0;\n\n if (typeof claims === 'object') {\n if (claims.hasOwnProperty('nbf')) {\n validSince = claims['nbf'];\n } else if (claims.hasOwnProperty('iat')) {\n validSince = claims['iat'];\n }\n\n if (claims.hasOwnProperty('exp')) {\n validUntil = claims['exp'];\n } else {\n // token will expire after 24h by default\n validUntil = validSince + 86400;\n }\n }\n\n return !!now && !!validSince && !!validUntil && now >= validSince && now <= validUntil;\n};\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 */\n\n\nvar issuedAtTime = function (token) {\n var claims = decode(token).claims;\n\n if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n return claims['iat'];\n }\n\n return null;\n};\n/**\r\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time.\r\n *\r\n * Notes:\r\n * - May return a false negative if there's no native base64 decoding support.\r\n * - Doesn't check if the token is actually valid.\r\n */\n\n\nvar isValidFormat = function (token) {\n var decoded = decode(token),\n claims = decoded.claims;\n return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\n};\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 */\n\n\nvar isAdmin = function (token) {\n var claims = decode(token).claims;\n return typeof claims === 'object' && claims['admin'] === true;\n};\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n\nfunction contains(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nfunction safeGet(obj, key) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n return obj[key];\n } else {\n return undefined;\n }\n}\n\nfunction isEmpty(obj) {\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction map(obj, fn, contextObj) {\n var res = {};\n\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n res[key] = fn.call(contextObj, obj[key], key, obj);\n }\n }\n\n return res;\n}\n/**\r\n * Deep equal two objects. Support Arrays and Objects.\r\n */\n\n\nfunction deepEqual(a, b) {\n if (a === b) {\n return true;\n }\n\n var aKeys = Object.keys(a);\n var bKeys = Object.keys(b);\n\n for (var _i = 0, aKeys_1 = aKeys; _i < aKeys_1.length; _i++) {\n var k = aKeys_1[_i];\n\n if (!bKeys.includes(k)) {\n return false;\n }\n\n var aProp = a[k];\n var bProp = b[k];\n\n if (isObject(aProp) && isObject(bProp)) {\n if (!deepEqual(aProp, bProp)) {\n return false;\n }\n } else if (aProp !== bProp) {\n return false;\n }\n }\n\n for (var _a = 0, bKeys_1 = bKeys; _a < bKeys_1.length; _a++) {\n var k = bKeys_1[_a];\n\n if (!aKeys.includes(k)) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction isObject(thing) {\n return thing !== null && typeof thing === 'object';\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\n/**\r\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a\r\n * params object (e.g. {arg: 'val', arg2: 'val2'})\r\n * Note: You must prepend it with ? when adding it to a URL.\r\n */\n\n\nfunction querystring(querystringParams) {\n var params = [];\n\n var _loop_1 = function (key, value) {\n if (Array.isArray(value)) {\n value.forEach(function (arrayVal) {\n params.push(encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal));\n });\n } else {\n params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n }\n };\n\n for (var _i = 0, _a = Object.entries(querystringParams); _i < _a.length; _i++) {\n var _b = _a[_i],\n key = _b[0],\n value = _b[1];\n\n _loop_1(key, value);\n }\n\n return params.length ? '&' + params.join('&') : '';\n}\n/**\r\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object\r\n * (e.g. {arg: 'val', arg2: 'val2'})\r\n */\n\n\nfunction querystringDecode(querystring) {\n var obj = {};\n var tokens = querystring.replace(/^\\?/, '').split('&');\n tokens.forEach(function (token) {\n if (token) {\n var _a = token.split('='),\n key = _a[0],\n value = _a[1];\n\n obj[decodeURIComponent(key)] = decodeURIComponent(value);\n }\n });\n return obj;\n}\n/**\r\n * Extract the query string part of a URL, including the leading question mark (if present).\r\n */\n\n\nfunction extractQuerystring(url) {\n var queryStart = url.indexOf('?');\n\n if (!queryStart) {\n return '';\n }\n\n var fragmentStart = url.indexOf('#', queryStart);\n return url.substring(queryStart, fragmentStart > 0 ? fragmentStart : undefined);\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\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 */\n\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 * @final\r\n * @struct\r\n */\n\n\nvar Sha1 =\n/** @class */\nfunction () {\n function Sha1() {\n /**\r\n * Holds the previous values of accumulated variables a-e in the compress_\r\n * function.\r\n * @private\r\n */\n this.chain_ = [];\n /**\r\n * A buffer holding the partially computed hash result.\r\n * @private\r\n */\n\n this.buf_ = [];\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 * @private\r\n */\n\n this.W_ = [];\n /**\r\n * Contains data needed to pad messages less than 64 bytes.\r\n * @private\r\n */\n\n this.pad_ = [];\n /**\r\n * @private {number}\r\n */\n\n this.inbuf_ = 0;\n /**\r\n * @private {number}\r\n */\n\n this.total_ = 0;\n this.blockSize = 512 / 8;\n this.pad_[0] = 128;\n\n for (var i = 1; i < this.blockSize; ++i) {\n this.pad_[i] = 0;\n }\n\n this.reset();\n }\n\n Sha1.prototype.reset = function () {\n this.chain_[0] = 0x67452301;\n this.chain_[1] = 0xefcdab89;\n this.chain_[2] = 0x98badcfe;\n this.chain_[3] = 0x10325476;\n this.chain_[4] = 0xc3d2e1f0;\n this.inbuf_ = 0;\n this.total_ = 0;\n };\n /**\r\n * Internal compress helper function.\r\n * @param buf Block to compress.\r\n * @param offset Offset of the block in the buffer.\r\n * @private\r\n */\n\n\n Sha1.prototype.compress_ = function (buf, offset) {\n if (!offset) {\n offset = 0;\n }\n\n var W = this.W_; // get 16 big endian words\n\n if (typeof buf === 'string') {\n for (var i = 0; i < 16; i++) {\n // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n // have a bug that turns the post-increment ++ operator into pre-increment\n // during JIT compilation. We have code that depends heavily on SHA-1 for\n // correctness and which is affected by this bug, so I've removed all uses\n // of post-increment ++ in which the result value is used. We can revert\n // this change once the Safari bug\n // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n // most clients have been updated.\n W[i] = buf.charCodeAt(offset) << 24 | buf.charCodeAt(offset + 1) << 16 | buf.charCodeAt(offset + 2) << 8 | buf.charCodeAt(offset + 3);\n offset += 4;\n }\n } else {\n for (var i = 0; i < 16; i++) {\n W[i] = buf[offset] << 24 | buf[offset + 1] << 16 | buf[offset + 2] << 8 | buf[offset + 3];\n offset += 4;\n }\n } // expand to 80 words\n\n\n for (var i = 16; i < 80; i++) {\n var t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n W[i] = (t << 1 | t >>> 31) & 0xffffffff;\n }\n\n var a = this.chain_[0];\n var b = this.chain_[1];\n var c = this.chain_[2];\n var d = this.chain_[3];\n var e = this.chain_[4];\n var f, k; // TODO(user): Try to unroll this loop to speed up the computation.\n\n for (var i = 0; i < 80; i++) {\n if (i < 40) {\n if (i < 20) {\n f = d ^ b & (c ^ d);\n k = 0x5a827999;\n } else {\n f = b ^ c ^ d;\n k = 0x6ed9eba1;\n }\n } else {\n if (i < 60) {\n f = b & c | d & (b | c);\n k = 0x8f1bbcdc;\n } else {\n f = b ^ c ^ d;\n k = 0xca62c1d6;\n }\n }\n\n var t = (a << 5 | a >>> 27) + f + e + k + W[i] & 0xffffffff;\n e = d;\n d = c;\n c = (b << 30 | b >>> 2) & 0xffffffff;\n b = a;\n a = t;\n }\n\n this.chain_[0] = this.chain_[0] + a & 0xffffffff;\n this.chain_[1] = this.chain_[1] + b & 0xffffffff;\n this.chain_[2] = this.chain_[2] + c & 0xffffffff;\n this.chain_[3] = this.chain_[3] + d & 0xffffffff;\n this.chain_[4] = this.chain_[4] + e & 0xffffffff;\n };\n\n Sha1.prototype.update = function (bytes, length) {\n // TODO(johnlenz): tighten the function signature and remove this check\n if (bytes == null) {\n return;\n }\n\n if (length === undefined) {\n length = bytes.length;\n }\n\n var lengthMinusBlock = length - this.blockSize;\n var n = 0; // Using local instead of member variables gives ~5% speedup on Firefox 16.\n\n var buf = this.buf_;\n var inbuf = this.inbuf_; // The outer while loop should execute at most twice.\n\n while (n < length) {\n // When we have no data in the block to top up, we can directly process the\n // input buffer (assuming it contains sufficient data). This gives ~25%\n // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n // the data is provided in large chunks (or in multiples of 64 bytes).\n if (inbuf === 0) {\n while (n <= lengthMinusBlock) {\n this.compress_(bytes, n);\n n += this.blockSize;\n }\n }\n\n if (typeof bytes === 'string') {\n while (n < length) {\n buf[inbuf] = bytes.charCodeAt(n);\n ++inbuf;\n ++n;\n\n if (inbuf === this.blockSize) {\n this.compress_(buf);\n inbuf = 0; // Jump to the outer loop so we use the full-block optimization.\n\n break;\n }\n }\n } else {\n while (n < length) {\n buf[inbuf] = bytes[n];\n ++inbuf;\n ++n;\n\n if (inbuf === this.blockSize) {\n this.compress_(buf);\n inbuf = 0; // Jump to the outer loop so we use the full-block optimization.\n\n break;\n }\n }\n }\n }\n\n this.inbuf_ = inbuf;\n this.total_ += length;\n };\n /** @override */\n\n\n Sha1.prototype.digest = function () {\n var digest = [];\n var totalBits = this.total_ * 8; // Add pad 0x80 0x00*.\n\n if (this.inbuf_ < 56) {\n this.update(this.pad_, 56 - this.inbuf_);\n } else {\n this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n } // Add # bits.\n\n\n for (var i = this.blockSize - 1; i >= 56; i--) {\n this.buf_[i] = totalBits & 255;\n totalBits /= 256; // Don't use bit-shifting here!\n }\n\n this.compress_(this.buf_);\n var n = 0;\n\n for (var i = 0; i < 5; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n digest[n] = this.chain_[i] >> j & 255;\n ++n;\n }\n }\n\n return digest;\n };\n\n return Sha1;\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 */\n\n\nfunction createSubscribe(executor, onNoObservers) {\n var proxy = new ObserverProxy(executor, onNoObservers);\n return proxy.subscribe.bind(proxy);\n}\n/**\r\n * Implement fan-out for any number of Observers attached via a subscribe\r\n * function.\r\n */\n\n\nvar ObserverProxy =\n/** @class */\nfunction () {\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 */\n function ObserverProxy(executor, onNoObservers) {\n var _this = this;\n\n this.observers = [];\n this.unsubscribes = [];\n this.observerCount = 0; // Micro-task scheduling by calling task.then().\n\n this.task = Promise.resolve();\n this.finalized = false;\n this.onNoObservers = onNoObservers; // Call the executor asynchronously so subscribers that are called\n // synchronously after the creation of the subscribe function\n // can still receive the very first value generated in the executor.\n\n this.task.then(function () {\n executor(_this);\n }).catch(function (e) {\n _this.error(e);\n });\n }\n\n ObserverProxy.prototype.next = function (value) {\n this.forEachObserver(function (observer) {\n observer.next(value);\n });\n };\n\n ObserverProxy.prototype.error = function (error) {\n this.forEachObserver(function (observer) {\n observer.error(error);\n });\n this.close(error);\n };\n\n ObserverProxy.prototype.complete = function () {\n this.forEachObserver(function (observer) {\n observer.complete();\n });\n this.close();\n };\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 */\n\n\n ObserverProxy.prototype.subscribe = function (nextOrObserver, error, complete) {\n var _this = this;\n\n var observer;\n\n if (nextOrObserver === undefined && error === undefined && complete === undefined) {\n throw new Error('Missing Observer.');\n } // Assemble an Observer object when passed as callback functions.\n\n\n if (implementsAnyMethods(nextOrObserver, ['next', 'error', 'complete'])) {\n observer = nextOrObserver;\n } else {\n observer = {\n next: nextOrObserver,\n error: error,\n complete: complete\n };\n }\n\n if (observer.next === undefined) {\n observer.next = noop;\n }\n\n if (observer.error === undefined) {\n observer.error = noop;\n }\n\n if (observer.complete === undefined) {\n observer.complete = noop;\n }\n\n var unsub = this.unsubscribeOne.bind(this, this.observers.length); // Attempt to subscribe to a terminated Observable - we\n // just respond to the Observer with the final error or complete\n // event.\n\n if (this.finalized) {\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n this.task.then(function () {\n try {\n if (_this.finalError) {\n observer.error(_this.finalError);\n } else {\n observer.complete();\n }\n } catch (e) {// nothing\n }\n\n return;\n });\n }\n\n this.observers.push(observer);\n return unsub;\n }; // Unsubscribe is synchronous - we guarantee that no events are sent to\n // any unsubscribed Observer.\n\n\n ObserverProxy.prototype.unsubscribeOne = function (i) {\n if (this.observers === undefined || this.observers[i] === undefined) {\n return;\n }\n\n delete this.observers[i];\n this.observerCount -= 1;\n\n if (this.observerCount === 0 && this.onNoObservers !== undefined) {\n this.onNoObservers(this);\n }\n };\n\n ObserverProxy.prototype.forEachObserver = function (fn) {\n if (this.finalized) {\n // Already closed by previous event....just eat the additional values.\n return;\n } // Since sendOne calls asynchronously - there is no chance that\n // this.observers will become undefined.\n\n\n for (var i = 0; i < this.observers.length; i++) {\n this.sendOne(i, fn);\n }\n }; // Call the Observer via one of it's callback function. We are careful to\n // confirm that the observe has not been unsubscribed since this asynchronous\n // function had been queued.\n\n\n ObserverProxy.prototype.sendOne = function (i, fn) {\n var _this = this; // Execute the callback asynchronously\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n\n\n this.task.then(function () {\n if (_this.observers !== undefined && _this.observers[i] !== undefined) {\n try {\n fn(_this.observers[i]);\n } catch (e) {\n // Ignore exceptions raised in Observers or missing methods of an\n // Observer.\n // Log error to console. b/31404806\n if (typeof console !== 'undefined' && console.error) {\n console.error(e);\n }\n }\n }\n });\n };\n\n ObserverProxy.prototype.close = function (err) {\n var _this = this;\n\n if (this.finalized) {\n return;\n }\n\n this.finalized = true;\n\n if (err !== undefined) {\n this.finalError = err;\n } // Proxy is no longer needed - garbage collect references\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n\n\n this.task.then(function () {\n _this.observers = undefined;\n _this.onNoObservers = undefined;\n });\n };\n\n return ObserverProxy;\n}();\n/** Turn synchronous function into one called asynchronously. */\n// eslint-disable-next-line @typescript-eslint/ban-types\n\n\nfunction async(fn, onError) {\n return function () {\n var args = [];\n\n for (var _i = 0; _i < arguments.length; _i++) {\n args[_i] = arguments[_i];\n }\n\n Promise.resolve(true).then(function () {\n fn.apply(void 0, args);\n }).catch(function (error) {\n if (onError) {\n onError(error);\n }\n });\n };\n}\n/**\r\n * Return true if the object passed in implements any of the named methods.\r\n */\n\n\nfunction implementsAnyMethods(obj, methods) {\n if (typeof obj !== 'object' || obj === null) {\n return false;\n }\n\n for (var _i = 0, methods_1 = methods; _i < methods_1.length; _i++) {\n var method = methods_1[_i];\n\n if (method in obj && typeof obj[method] === 'function') {\n return true;\n }\n }\n\n return false;\n}\n\nfunction noop() {// do nothing\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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\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 fnName The function name\r\n * @param minCount The minimum number of arguments to allow for the function call\r\n * @param maxCount The maximum number of argument to allow for the function call\r\n * @param argCount The actual number of arguments provided.\r\n */\n\n\nvar validateArgCount = function (fnName, minCount, maxCount, argCount) {\n var argError;\n\n if (argCount < minCount) {\n argError = 'at least ' + minCount;\n } else if (argCount > maxCount) {\n argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n }\n\n if (argError) {\n var error = fnName + ' failed: Was called with ' + argCount + (argCount === 1 ? ' argument.' : ' arguments.') + ' Expects ' + argError + '.';\n throw new Error(error);\n }\n};\n/**\r\n * Generates a string to prefix an error message about failed argument validation\r\n *\r\n * @param fnName The function name\r\n * @param argName The name of the argument\r\n * @return The prefix to add to the error thrown for validation.\r\n */\n\n\nfunction errorPrefix(fnName, argName) {\n return fnName + \" failed: \" + argName + \" argument \";\n}\n/**\r\n * @param fnName\r\n * @param argumentNumber\r\n * @param namespace\r\n * @param optional\r\n */\n\n\nfunction validateNamespace(fnName, namespace, optional) {\n if (optional && !namespace) {\n return;\n }\n\n if (typeof namespace !== 'string') {\n //TODO: I should do more validation here. We only allow certain chars in namespaces.\n throw new Error(errorPrefix(fnName, 'namespace') + 'must be a valid firebase namespace.');\n }\n}\n\nfunction validateCallback(fnName, argumentName, // eslint-disable-next-line @typescript-eslint/ban-types\ncallback, optional) {\n if (optional && !callback) {\n return;\n }\n\n if (typeof callback !== 'function') {\n throw new Error(errorPrefix(fnName, argumentName) + 'must be a valid function.');\n }\n}\n\nfunction validateContextObject(fnName, argumentName, context, optional) {\n if (optional && !context) {\n return;\n }\n\n if (typeof context !== 'object' || context === null) {\n throw new Error(errorPrefix(fnName, argumentName) + 'must be a valid context object.');\n }\n}\n/**\r\n * @license\r\n * Copyright 2017 Google LLC\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// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in Javascript. All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n\n/**\r\n * @param {string} str\r\n * @return {Array}\r\n */\n\n\nvar stringToByteArray = function (str) {\n var out = [];\n var p = 0;\n\n for (var i = 0; i < str.length; i++) {\n var c = str.charCodeAt(i); // Is this the lead surrogate in a surrogate pair?\n\n if (c >= 0xd800 && c <= 0xdbff) {\n var high = c - 0xd800; // the high 10 bits.\n\n i++;\n assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n var low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n\n c = 0x10000 + (high << 10) + low;\n }\n\n if (c < 128) {\n out[p++] = c;\n } else if (c < 2048) {\n out[p++] = c >> 6 | 192;\n out[p++] = c & 63 | 128;\n } else if (c < 65536) {\n out[p++] = c >> 12 | 224;\n out[p++] = c >> 6 & 63 | 128;\n out[p++] = c & 63 | 128;\n } else {\n out[p++] = c >> 18 | 240;\n out[p++] = c >> 12 & 63 | 128;\n out[p++] = c >> 6 & 63 | 128;\n out[p++] = c & 63 | 128;\n }\n }\n\n return out;\n};\n/**\r\n * Calculate length without actually converting; useful for doing cheaper validation.\r\n * @param {string} str\r\n * @return {number}\r\n */\n\n\nvar stringLength = function (str) {\n var p = 0;\n\n for (var i = 0; i < str.length; i++) {\n var c = str.charCodeAt(i);\n\n if (c < 128) {\n p++;\n } else if (c < 2048) {\n p += 2;\n } else if (c >= 0xd800 && c <= 0xdbff) {\n // Lead surrogate of a surrogate pair. The pair together will take 4 bytes to represent.\n p += 4;\n i++; // skip trail surrogate.\n } else {\n p += 3;\n }\n }\n\n return p;\n};\n/**\r\n * @license\r\n * Copyright 2019 Google LLC\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\n/**\r\n * The amount of milliseconds to exponentially increase.\r\n */\n\n\nvar DEFAULT_INTERVAL_MILLIS = 1000;\n/**\r\n * The factor to backoff by.\r\n * Should be a number greater than 1.\r\n */\n\nvar DEFAULT_BACKOFF_FACTOR = 2;\n/**\r\n * The maximum milliseconds to increase to.\r\n *\r\n * <p>Visible for testing\r\n */\n\nvar MAX_VALUE_MILLIS = 4 * 60 * 60 * 1000; // Four hours, like iOS and Android.\n\n/**\r\n * The percentage of backoff time to randomize by.\r\n * See\r\n * http://go/safe-client-behavior#step-1-determine-the-appropriate-retry-interval-to-handle-spike-traffic\r\n * for context.\r\n *\r\n * <p>Visible for testing\r\n */\n\nvar RANDOM_FACTOR = 0.5;\n/**\r\n * Based on the backoff method from\r\n * https://github.com/google/closure-library/blob/master/closure/goog/math/exponentialbackoff.js.\r\n * Extracted here so we don't need to pass metadata and a stateful ExponentialBackoff object around.\r\n */\n\nfunction calculateBackoffMillis(backoffCount, intervalMillis, backoffFactor) {\n if (intervalMillis === void 0) {\n intervalMillis = DEFAULT_INTERVAL_MILLIS;\n }\n\n if (backoffFactor === void 0) {\n backoffFactor = DEFAULT_BACKOFF_FACTOR;\n } // Calculates an exponentially increasing value.\n // Deviation: calculates value from count and a constant interval, so we only need to save value\n // and count to restore state.\n\n\n var currBaseValue = intervalMillis * Math.pow(backoffFactor, backoffCount); // A random \"fuzz\" to avoid waves of retries.\n // Deviation: randomFactor is required.\n\n var randomWait = Math.round( // A fraction of the backoff value to add/subtract.\n // Deviation: changes multiplication order to improve readability.\n RANDOM_FACTOR * currBaseValue * ( // A random float (rounded to int by Math.round above) in the range [-1, 1]. Determines\n // if we add or subtract.\n Math.random() - 0.5) * 2); // Limits backoff to max to avoid effectively permanent backoff.\n\n return Math.min(MAX_VALUE_MILLIS, currBaseValue + randomWait);\n}\n/**\r\n * @license\r\n * Copyright 2020 Google LLC\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\n/**\r\n * Provide English ordinal letters after a number\r\n */\n\n\nfunction ordinal(i) {\n if (!Number.isFinite(i)) {\n return \"\" + i;\n }\n\n return i + indicator(i);\n}\n\nfunction indicator(i) {\n i = Math.abs(i);\n var cent = i % 100;\n\n if (cent >= 10 && cent <= 20) {\n return 'th';\n }\n\n var dec = i % 10;\n\n if (dec === 1) {\n return 'st';\n }\n\n if (dec === 2) {\n return 'nd';\n }\n\n if (dec === 3) {\n return 'rd';\n }\n\n return 'th';\n}\n/**\r\n * @license\r\n * Copyright 2021 Google LLC\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\n\nfunction getModularInstance(service) {\n if (service && service._delegate) {\n return service._delegate;\n } else {\n return service;\n }\n}\n\nexport { CONSTANTS, Deferred, ErrorFactory, FirebaseError, MAX_VALUE_MILLIS, RANDOM_FACTOR, Sha1, areCookiesEnabled, assert, assertionError, async, base64, base64Decode, base64Encode, calculateBackoffMillis, contains, createMockUserToken, createSubscribe, decode, deepCopy, deepEqual, deepExtend, errorPrefix, extractQuerystring, getGlobal, getModularInstance, getUA, isAdmin, isBrowser, isBrowserExtension, isElectron, isEmpty, isIE, isIndexedDBAvailable, isMobileCordova, isNode, isNodeSdk, isReactNative, isSafari, isUWP, isValidFormat, isValidTimestamp, issuedAtTime, jsonEval, map, ordinal, querystring, querystringDecode, safeGet, stringLength, stringToByteArray, stringify, validateArgCount, validateCallback, validateContextObject, validateIndexedDBOpenable, validateNamespace };","map":{"version":3,"sources":["../src/constants.ts","../src/assert.ts","../src/crypt.ts","../src/deepCopy.ts","../src/deferred.ts","../src/emulator.ts","../src/environment.ts","../src/errors.ts","../src/json.ts","../src/jwt.ts","../src/obj.ts","../src/query.ts","../src/sha1.ts","../src/subscribe.ts","../src/validation.ts","../src/utf8.ts","../src/exponential_backoff.ts","../src/formatters.ts","../src/compat.ts"],"names":["stringToByteArray"],"mappings":";AAAA;;;;;;;;;;;;;;;;;AAiBA;;;;IAIa,SAAS,GAAG;;;;AAIvB,EAAA,WAAW,EAAE,KAJU;;;;;AAQvB,EAAA,UAAU,EAAE,KARW;;;;;AAavB,EAAA,WAAW,EAAE;AAbU,C;ACrBzB;;;;;;;;;;;;;;;;;AAmBA;;;;IAGa,MAAM,GAAG,UAAU,SAAV,EAA8B,OAA9B,EAA6C;AACjE,MAAI,CAAC,SAAL,EAAgB;AACd,UAAM,cAAc,CAAC,OAAD,CAApB;AACD;AACH,C;AAEA;;;;;IAGa,cAAc,GAAG,UAAU,OAAV,EAAyB;AACrD,SAAO,IAAI,KAAJ,CACL,wBACE,SAAS,CAAC,WADZ,GAEE,4BAFF,GAGE,OAJG,CAAP;AAMF,C;ACtCA;;;;;;;;;;;;;;;;;;AAiBA,IAAMA,mBAAiB,GAAG,UAAU,GAAV,EAAqB;;AAE7C,MAAM,GAAG,GAAa,EAAtB;AACA,MAAI,CAAC,GAAG,CAAR;;AACA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAAG,CAAC,MAAxB,EAAgC,CAAC,EAAjC,EAAqC;AACnC,QAAI,CAAC,GAAG,GAAG,CAAC,UAAJ,CAAe,CAAf,CAAR;;AACA,QAAI,CAAC,GAAG,GAAR,EAAa;AACX,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,CAAX;AACD,KAFD,MAEO,IAAI,CAAC,GAAG,IAAR,EAAc;AACnB,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,IAAI,CAAN,GAAW,GAAtB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,GAAG,EAAL,GAAW,GAAtB;AACD,KAHM,MAGA,IACL,CAAC,CAAC,GAAG,MAAL,MAAiB,MAAjB,IACA,CAAC,GAAG,CAAJ,GAAQ,GAAG,CAAC,MADZ,IAEA,CAAC,GAAG,CAAC,UAAJ,CAAe,CAAC,GAAG,CAAnB,IAAwB,MAAzB,MAAqC,MAHhC,EAIL;;AAEA,MAAA,CAAC,GAAG,WAAW,CAAC,CAAC,GAAG,MAAL,KAAgB,EAA3B,KAAkC,GAAG,CAAC,UAAJ,CAAe,EAAE,CAAjB,IAAsB,MAAxD,CAAJ;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,IAAI,EAAN,GAAY,GAAvB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAa,CAAC,IAAI,EAAN,GAAY,EAAb,GAAmB,GAA9B;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAa,CAAC,IAAI,CAAN,GAAW,EAAZ,GAAkB,GAA7B;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,GAAG,EAAL,GAAW,GAAtB;AACD,KAXM,MAWA;AACL,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,IAAI,EAAN,GAAY,GAAvB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAa,CAAC,IAAI,CAAN,GAAW,EAAZ,GAAkB,GAA7B;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,GAAG,EAAL,GAAW,GAAtB;AACD;AACF;;AACD,SAAO,GAAP;AACD,CA7BD;AA+BA;;;;;;;;AAMA,IAAM,iBAAiB,GAAG,UAAU,KAAV,EAAyB;;AAEjD,MAAM,GAAG,GAAa,EAAtB;AACA,MAAI,GAAG,GAAG,CAAV;AAAA,MACE,CAAC,GAAG,CADN;;AAEA,SAAO,GAAG,GAAG,KAAK,CAAC,MAAnB,EAA2B;AACzB,QAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;;AACA,QAAI,EAAE,GAAG,GAAT,EAAc;AACZ,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,MAAM,CAAC,YAAP,CAAoB,EAApB,CAAX;AACD,KAFD,MAEO,IAAI,EAAE,GAAG,GAAL,IAAY,EAAE,GAAG,GAArB,EAA0B;AAC/B,UAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,MAAM,CAAC,YAAP,CAAqB,CAAC,EAAE,GAAG,EAAN,KAAa,CAAd,GAAoB,EAAE,GAAG,EAA7C,CAAX;AACD,KAHM,MAGA,IAAI,EAAE,GAAG,GAAL,IAAY,EAAE,GAAG,GAArB,EAA0B;;AAE/B,UAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;AACA,UAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;AACA,UAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;AACA,UAAM,CAAC,GACL,CAAE,CAAC,EAAE,GAAG,CAAN,KAAY,EAAb,GAAoB,CAAC,EAAE,GAAG,EAAN,KAAa,EAAjC,GAAwC,CAAC,EAAE,GAAG,EAAN,KAAa,CAArD,GAA2D,EAAE,GAAG,EAAjE,IACA,OAFF;AAGA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,MAAM,CAAC,YAAP,CAAoB,UAAU,CAAC,IAAI,EAAf,CAApB,CAAX;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,MAAM,CAAC,YAAP,CAAoB,UAAU,CAAC,GAAG,IAAd,CAApB,CAAX;AACD,KAVM,MAUA;AACL,UAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;AACA,UAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAJ,CAAhB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,MAAM,CAAC,YAAP,CACR,CAAC,EAAE,GAAG,EAAN,KAAa,EAAd,GAAqB,CAAC,EAAE,GAAG,EAAN,KAAa,CAAlC,GAAwC,EAAE,GAAG,EADpC,CAAX;AAGD;AACF;;AACD,SAAO,GAAG,CAAC,IAAJ,CAAS,EAAT,CAAP;AACD,CA/BD,C,CAiDA;AACA;AACA;;;IACa,MAAM,GAAW;;;;AAI5B,EAAA,cAAc,EAAE,IAJY;;;;;AAS5B,EAAA,cAAc,EAAE,IATY;;;;;;AAe5B,EAAA,qBAAqB,EAAE,IAfK;;;;;;AAqB5B,EAAA,qBAAqB,EAAE,IArBK;;;;;;AA2B5B,EAAA,iBAAiB,EACf,+BAA+B,4BAA/B,GAA8D,YA5BpC;;;;;AAiC5B,MAAI,YAAJ,GAAgB;AACd,WAAO,KAAK,iBAAL,GAAyB,KAAhC;AACD,GAnC2B;;;;;AAwC5B,MAAI,oBAAJ,GAAwB;AACtB,WAAO,KAAK,iBAAL,GAAyB,KAAhC;AACD,GA1C2B;;;;;;;;;AAmD5B,EAAA,kBAAkB,EAAE,OAAO,IAAP,KAAgB,UAnDR;;;;;;;;;;;AA8D5B,EAAA,eAAe,EAAf,UAAgB,KAAhB,EAA8C,OAA9C,EAA+D;AAC7D,QAAI,CAAC,KAAK,CAAC,OAAN,CAAc,KAAd,CAAL,EAA2B;AACzB,YAAM,KAAK,CAAC,+CAAD,CAAX;AACD;;AAED,SAAK,KAAL;AAEA,QAAM,aAAa,GAAG,OAAO,GACzB,KAAK,qBADoB,GAEzB,KAAK,cAFT;AAIA,QAAM,MAAM,GAAG,EAAf;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,CAAC,MAA1B,EAAkC,CAAC,IAAI,CAAvC,EAA0C;AACxC,UAAM,KAAK,GAAG,KAAK,CAAC,CAAD,CAAnB;AACA,UAAM,SAAS,GAAG,CAAC,GAAG,CAAJ,GAAQ,KAAK,CAAC,MAAhC;AACA,UAAM,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,CAAL,CAAR,GAAkB,CAAzC;AACA,UAAM,SAAS,GAAG,CAAC,GAAG,CAAJ,GAAQ,KAAK,CAAC,MAAhC;AACA,UAAM,KAAK,GAAG,SAAS,GAAG,KAAK,CAAC,CAAC,GAAG,CAAL,CAAR,GAAkB,CAAzC;AAEA,UAAM,QAAQ,GAAG,KAAK,IAAI,CAA1B;AACA,UAAM,QAAQ,GAAI,CAAC,KAAK,GAAG,IAAT,KAAkB,CAAnB,GAAyB,KAAK,IAAI,CAAnD;AACA,UAAI,QAAQ,GAAI,CAAC,KAAK,GAAG,IAAT,KAAkB,CAAnB,GAAyB,KAAK,IAAI,CAAjD;AACA,UAAI,QAAQ,GAAG,KAAK,GAAG,IAAvB;;AAEA,UAAI,CAAC,SAAL,EAAgB;AACd,QAAA,QAAQ,GAAG,EAAX;;AAEA,YAAI,CAAC,SAAL,EAAgB;AACd,UAAA,QAAQ,GAAG,EAAX;AACD;AACF;;AAED,MAAA,MAAM,CAAC,IAAP,CACE,aAAa,CAAC,QAAD,CADf,EAEE,aAAa,CAAC,QAAD,CAFf,EAGE,aAAa,CAAC,QAAD,CAHf,EAIE,aAAa,CAAC,QAAD,CAJf;AAMD;;AAED,WAAO,MAAM,CAAC,IAAP,CAAY,EAAZ,CAAP;AACD,GAxG2B;;;;;;;;;;AAkH5B,EAAA,YAAY,EAAZ,UAAa,KAAb,EAA4B,OAA5B,EAA6C;;;AAG3C,QAAI,KAAK,kBAAL,IAA2B,CAAC,OAAhC,EAAyC;AACvC,aAAO,IAAI,CAAC,KAAD,CAAX;AACD;;AACD,WAAO,KAAK,eAAL,CAAqBA,mBAAiB,CAAC,KAAD,CAAtC,EAA+C,OAA/C,CAAP;AACD,GAzH2B;;;;;;;;;;AAmI5B,EAAA,YAAY,EAAZ,UAAa,KAAb,EAA4B,OAA5B,EAA4C;;;AAG1C,QAAI,KAAK,kBAAL,IAA2B,CAAC,OAAhC,EAAyC;AACvC,aAAO,IAAI,CAAC,KAAD,CAAX;AACD;;AACD,WAAO,iBAAiB,CAAC,KAAK,uBAAL,CAA6B,KAA7B,EAAoC,OAApC,CAAD,CAAxB;AACD,GA1I2B;;;;;;;;;;;;;;;;;AA2J5B,EAAA,uBAAuB,EAAvB,UAAwB,KAAxB,EAAuC,OAAvC,EAAuD;AACrD,SAAK,KAAL;AAEA,QAAM,aAAa,GAAG,OAAO,GACzB,KAAK,qBADoB,GAEzB,KAAK,cAFT;AAIA,QAAM,MAAM,GAAa,EAAzB;;AAEA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,CAAC,MAA1B,GAAoC;AAClC,UAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,MAAN,CAAa,CAAC,EAAd,CAAD,CAA3B;AAEA,UAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,MAA5B;AACA,UAAM,KAAK,GAAG,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,MAAN,CAAa,CAAb,CAAD,CAAhB,GAAoC,CAA3D;AACA,QAAE,CAAF;AAEA,UAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,MAA5B;AACA,UAAM,KAAK,GAAG,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,MAAN,CAAa,CAAb,CAAD,CAAhB,GAAoC,EAA3D;AACA,QAAE,CAAF;AAEA,UAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,MAA5B;AACA,UAAM,KAAK,GAAG,SAAS,GAAG,aAAa,CAAC,KAAK,CAAC,MAAN,CAAa,CAAb,CAAD,CAAhB,GAAoC,EAA3D;AACA,QAAE,CAAF;;AAEA,UAAI,KAAK,IAAI,IAAT,IAAiB,KAAK,IAAI,IAA1B,IAAkC,KAAK,IAAI,IAA3C,IAAmD,KAAK,IAAI,IAAhE,EAAsE;AACpE,cAAM,KAAK,EAAX;AACD;;AAED,UAAM,QAAQ,GAAI,KAAK,IAAI,CAAV,GAAgB,KAAK,IAAI,CAA1C;AACA,MAAA,MAAM,CAAC,IAAP,CAAY,QAAZ;;AAEA,UAAI,KAAK,KAAK,EAAd,EAAkB;AAChB,YAAM,QAAQ,GAAK,KAAK,IAAI,CAAV,GAAe,IAAhB,GAAyB,KAAK,IAAI,CAAnD;AACA,QAAA,MAAM,CAAC,IAAP,CAAY,QAAZ;;AAEA,YAAI,KAAK,KAAK,EAAd,EAAkB;AAChB,cAAM,QAAQ,GAAK,KAAK,IAAI,CAAV,GAAe,IAAhB,GAAwB,KAAzC;AACA,UAAA,MAAM,CAAC,IAAP,CAAY,QAAZ;AACD;AACF;AACF;;AAED,WAAO,MAAP;AACD,GAtM2B;;;;;;;AA6M5B,EAAA,KAAK,EAAA,YAAA;AACH,QAAI,CAAC,KAAK,cAAV,EAA0B;AACxB,WAAK,cAAL,GAAsB,EAAtB;AACA,WAAK,cAAL,GAAsB,EAAtB;AACA,WAAK,qBAAL,GAA6B,EAA7B;AACA,WAAK,qBAAL,GAA6B,EAA7B,CAJwB,C;;AAOxB,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,YAAL,CAAkB,MAAtC,EAA8C,CAAC,EAA/C,EAAmD;AACjD,aAAK,cAAL,CAAoB,CAApB,IAAyB,KAAK,YAAL,CAAkB,MAAlB,CAAyB,CAAzB,CAAzB;AACA,aAAK,cAAL,CAAoB,KAAK,cAAL,CAAoB,CAApB,CAApB,IAA8C,CAA9C;AACA,aAAK,qBAAL,CAA2B,CAA3B,IAAgC,KAAK,oBAAL,CAA0B,MAA1B,CAAiC,CAAjC,CAAhC;AACA,aAAK,qBAAL,CAA2B,KAAK,qBAAL,CAA2B,CAA3B,CAA3B,IAA4D,CAA5D,CAJiD,C;;AAOjD,YAAI,CAAC,IAAI,KAAK,iBAAL,CAAuB,MAAhC,EAAwC;AACtC,eAAK,cAAL,CAAoB,KAAK,oBAAL,CAA0B,MAA1B,CAAiC,CAAjC,CAApB,IAA2D,CAA3D;AACA,eAAK,qBAAL,CAA2B,KAAK,YAAL,CAAkB,MAAlB,CAAyB,CAAzB,CAA3B,IAA0D,CAA1D;AACD;AACF;AACF;AACF;AAlO2B,C;AAqO9B;;;;IAGa,YAAY,GAAG,UAAU,GAAV,EAAqB;AAC/C,MAAM,SAAS,GAAGA,mBAAiB,CAAC,GAAD,CAAnC;AACA,SAAO,MAAM,CAAC,eAAP,CAAuB,SAAvB,EAAkC,IAAlC,CAAP;AACF,C;AAEA;;;;;;;;;;;IASa,YAAY,GAAG,UAAU,GAAV,EAAqB;AAC/C,MAAI;AACF,WAAO,MAAM,CAAC,YAAP,CAAoB,GAApB,EAAyB,IAAzB,CAAP;AACD,GAFD,CAEE,OAAO,CAAP,EAAU;AACV,IAAA,OAAO,CAAC,KAAR,CAAc,uBAAd,EAAuC,CAAvC;AACD;;AACD,SAAO,IAAP;AACF,C;ACvWA;;;;;;;;;;;;;;;;;AAiBA;;;;;SAGgB,Q,CAAY,K,EAAQ;AAClC,SAAO,UAAU,CAAC,SAAD,EAAY,KAAZ,CAAjB;AACD;AAED;;;;;;;;;;;;;;;;SAcgB,U,CAAW,M,EAAiB,M,EAAe;AACzD,MAAI,EAAE,MAAM,YAAY,MAApB,CAAJ,EAAiC;AAC/B,WAAO,MAAP;AACD;;AAED,UAAQ,MAAM,CAAC,WAAf;AACE,SAAK,IAAL;;;AAGE,UAAM,SAAS,GAAG,MAAlB;AACA,aAAO,IAAI,IAAJ,CAAS,SAAS,CAAC,OAAV,EAAT,CAAP;;AAEF,SAAK,MAAL;AACE,UAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,QAAA,MAAM,GAAG,EAAT;AACD;;AACD;;AACF,SAAK,KAAL;;AAEE,MAAA,MAAM,GAAG,EAAT;AACA;;AAEF;;AAEE,aAAO,MAAP;AAnBJ;;AAsBA,OAAK,IAAM,IAAX,IAAmB,MAAnB,EAA2B;;AAEzB,QAAI,CAAC,MAAM,CAAC,cAAP,CAAsB,IAAtB,CAAD,IAAgC,CAAC,UAAU,CAAC,IAAD,CAA/C,EAAuD;AACrD;AACD;;AACA,IAAA,MAAkC,CAAC,IAAD,CAAlC,GAA2C,UAAU,CACnD,MAAkC,CAAC,IAAD,CADiB,EAEnD,MAAkC,CAAC,IAAD,CAFiB,CAArD;AAIF;;AAED,SAAO,MAAP;AACD;;AAED,SAAS,UAAT,CAAoB,GAApB,EAA+B;AAC7B,SAAO,GAAG,KAAK,WAAf;AACF;ACjFA;;;;;;;;;;;;;;;;;;;;;AAqBE,WAAA,QAAA,GAAA;AAAA,QAAA,KAAA,GAAA,IAAA;;AAFA,SAAA,MAAA,GAAoC,YAAA,CAAQ,CAA5C;;AACA,SAAA,OAAA,GAAqC,YAAA,CAAQ,CAA7C;;AAEE,SAAK,OAAL,GAAe,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AACzC,MAAA,KAAI,CAAC,OAAL,GAAe,OAAf;AACA,MAAA,KAAI,CAAC,MAAL,GAAc,MAAd;AACD,KAHc,CAAf;AAID;;;;;;;;AAOD,EAAA,QAAA,CAAA,SAAA,CAAA,YAAA,GAAA,UACE,QADF,EACuD;AADvD,QAAA,KAAA,GAAA,IAAA;;AAGE,WAAO,UAAC,KAAD,EAAQ,KAAR,EAAc;AACnB,UAAI,KAAJ,EAAW;AACT,QAAA,KAAI,CAAC,MAAL,CAAY,KAAZ;AACD,OAFD,MAEO;AACL,QAAA,KAAI,CAAC,OAAL,CAAa,KAAb;AACD;;AACD,UAAI,OAAO,QAAP,KAAoB,UAAxB,EAAoC;;;AAGlC,QAAA,KAAI,CAAC,OAAL,CAAa,KAAb,CAAmB,YAAA,CAAQ,CAA3B,EAHkC,C;;;;AAOlC,YAAI,QAAQ,CAAC,MAAT,KAAoB,CAAxB,EAA2B;AACzB,UAAA,QAAQ,CAAC,KAAD,CAAR;AACD,SAFD,MAEO;AACL,UAAA,QAAQ,CAAC,KAAD,EAAQ,KAAR,CAAR;AACD;AACF;AACF,KAnBD;AAoBD,GAvBD;;AAwBF,SAAA,QAAA;AAAC,C;ACzDD;;;;;;;;;;;;;;;;;;SA8FgB,mB,CACd,K,EACA,S,EAAkB;AAElB,MAAI,KAAK,CAAC,GAAV,EAAe;AACb,UAAM,IAAI,KAAJ,CACJ,8GADI,CAAN;AAGD,GANiB,C;;;AAQlB,MAAM,MAAM,GAAG;AACb,IAAA,GAAG,EAAE,MADQ;AAEb,IAAA,IAAI,EAAE;AAFO,GAAf;AAKA,MAAM,OAAO,GAAG,SAAS,IAAI,cAA7B;AACA,MAAM,GAAG,GAAG,KAAK,CAAC,GAAN,IAAa,CAAzB;AACA,MAAM,GAAG,GAAG,KAAK,CAAC,GAAN,IAAa,KAAK,CAAC,OAA/B;;AACA,MAAI,CAAC,GAAL,EAAU;AACR,UAAM,IAAI,KAAJ,CAAU,sDAAV,CAAN;AACD;;AAED,MAAM,OAAO,GAAA,QAAA,CAAA;;AAEX,IAAA,GAAG,EAAE,oCAAkC,OAF5B;AAGX,IAAA,GAAG,EAAE,OAHM;AAIX,IAAA,GAAG,EAAA,GAJQ;AAKX,IAAA,GAAG,EAAE,GAAG,GAAG,IALA;AAMX,IAAA,SAAS,EAAE,GANA;AAOX,IAAA,GAAG,EAAA,GAPQ;AAQX,IAAA,OAAO,EAAE,GARE;AASX,IAAA,QAAQ,EAAE;AACR,MAAA,gBAAgB,EAAE,QADV;AAER,MAAA,UAAU,EAAE;AAFJ;AATC,GAAA,EAeR,KAfQ,CAAb,CApBkB,C;;;AAuClB,MAAM,SAAS,GAAG,EAAlB;AACA,SAAO,CACL,MAAM,CAAC,YAAP,CAAoB,IAAI,CAAC,SAAL,CAAe,MAAf,CAApB;AAA0C;AAAe,OAAzD,CADK,EAEL,MAAM,CAAC,YAAP,CAAoB,IAAI,CAAC,SAAL,CAAe,OAAf,CAApB;AAA2C;AAAe,OAA1D,CAFK,EAGL,SAHK,EAIL,IAJK,CAIA,GAJA,CAAP;AAKF;AC7IA;;;;;;;;;;;;;;;;;AAmBA;;;;;;SAIgB,K,GAAK;AACnB,MACE,OAAO,SAAP,KAAqB,WAArB,IACA,OAAO,SAAS,CAAC,WAAD,CAAhB,KAAkC,QAFpC,EAGE;AACA,WAAO,SAAS,CAAC,WAAD,CAAhB;AACD,GALD,MAKO;AACL,WAAO,EAAP;AACD;AACF;AAED;;;;;;;;;SAOgB,e,GAAe;AAC7B,SACE,OAAO,MAAP,KAAkB,WAAlB,I;;AAGA,GAAC,EAAE,MAAM,CAAC,SAAD,CAAN,IAAqB,MAAM,CAAC,UAAD,CAA3B,IAA2C,MAAM,CAAC,UAAD,CAAnD,CAHD,IAIA,oDAAoD,IAApD,CAAyD,KAAK,EAA9D,CALF;AAOD;AAED;;;;;AAKA;;;SACgB,M,GAAM;AACpB,MAAI;AACF,WACE,MAAM,CAAC,SAAP,CAAiB,QAAjB,CAA0B,IAA1B,CAA+B,MAAM,CAAC,OAAtC,MAAmD,kBADrD;AAGD,GAJD,CAIE,OAAO,CAAP,EAAU;AACV,WAAO,KAAP;AACD;AACF;AAED;;;;;SAGgB,S,GAAS;AACvB,SAAO,OAAO,IAAP,KAAgB,QAAhB,IAA4B,IAAI,CAAC,IAAL,KAAc,IAAjD;AACD;;SAUe,kB,GAAkB;AAChC,MAAM,OAAO,GACX,OAAO,MAAP,KAAkB,QAAlB,GACI,MAAM,CAAC,OADX,GAEI,OAAO,OAAP,KAAmB,QAAnB,GACA,OAAO,CAAC,OADR,GAEA,SALN;AAMA,SAAO,OAAO,OAAP,KAAmB,QAAnB,IAA+B,OAAO,CAAC,EAAR,KAAe,SAArD;AACD;AAED;;;;;;;SAKgB,a,GAAa;AAC3B,SACE,OAAO,SAAP,KAAqB,QAArB,IAAiC,SAAS,CAAC,SAAD,CAAT,KAAyB,aAD5D;AAGD;AAED;;;SACgB,U,GAAU;AACxB,SAAO,KAAK,GAAG,OAAR,CAAgB,WAAhB,KAAgC,CAAvC;AACD;AAED;;;SACgB,I,GAAI;AAClB,MAAM,EAAE,GAAG,KAAK,EAAhB;AACA,SAAO,EAAE,CAAC,OAAH,CAAW,OAAX,KAAuB,CAAvB,IAA4B,EAAE,CAAC,OAAH,CAAW,UAAX,KAA0B,CAA7D;AACD;AAED;;;SACgB,K,GAAK;AACnB,SAAO,KAAK,GAAG,OAAR,CAAgB,YAAhB,KAAiC,CAAxC;AACD;AAED;;;;;;;SAKgB,S,GAAS;AACvB,SAAO,SAAS,CAAC,WAAV,KAA0B,IAA1B,IAAkC,SAAS,CAAC,UAAV,KAAyB,IAAlE;AACD;AAED;;;SACgB,Q,GAAQ;AACtB,SACE,CAAC,MAAM,EAAP,IACA,SAAS,CAAC,SAAV,CAAoB,QAApB,CAA6B,QAA7B,CADA,IAEA,CAAC,SAAS,CAAC,SAAV,CAAoB,QAApB,CAA6B,QAA7B,CAHH;AAKD;AAED;;;;;;SAIgB,oB,GAAoB;AAClC,SAAO,eAAe,IAAf,IAAuB,SAAS,IAAI,IAA3C;AACD;AAED;;;;;;;;;SAOgB,yB,GAAyB;AACvC,SAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAU,MAAV,EAAgB;AACjC,QAAI;AACF,UAAI,UAAQ,GAAY,IAAxB;AACA,UAAM,eAAa,GACjB,yDADF;AAEA,UAAM,SAAO,GAAG,IAAI,CAAC,SAAL,CAAe,IAAf,CAAoB,eAApB,CAAhB;;AACA,MAAA,SAAO,CAAC,SAAR,GAAoB,YAAA;AAClB,QAAA,SAAO,CAAC,MAAR,CAAe,KAAf,GADkB,C;;AAGlB,YAAI,CAAC,UAAL,EAAe;AACb,UAAA,IAAI,CAAC,SAAL,CAAe,cAAf,CAA8B,eAA9B;AACD;;AACD,QAAA,OAAO,CAAC,IAAD,CAAP;AACD,OAPD;;AAQA,MAAA,SAAO,CAAC,eAAR,GAA0B,YAAA;AACxB,QAAA,UAAQ,GAAG,KAAX;AACD,OAFD;;AAIA,MAAA,SAAO,CAAC,OAAR,GAAkB,YAAA;;;AAChB,QAAA,MAAM,CAAC,CAAA,CAAA,EAAA,GAAA,SAAO,CAAC,KAAR,MAAa,IAAb,IAAa,EAAA,KAAA,KAAA,CAAb,GAAa,KAAA,CAAb,GAAa,EAAA,CAAE,OAAf,KAA0B,EAA3B,CAAN;AACD,OAFD;AAGD,KApBD,CAoBE,OAAO,KAAP,EAAc;AACd,MAAA,MAAM,CAAC,KAAD,CAAN;AACD;AACF,GAxBM,CAAP;AAyBD;AAED;;;;;;;SAKgB,iB,GAAiB;AAC/B,MAAI,CAAC,SAAD,IAAc,CAAC,SAAS,CAAC,aAA7B,EAA4C;AAC1C,WAAO,KAAP;AACD;;AACD,SAAO,IAAP;AACD;AAED;;;;;;SAIgB,S,GAAS;AACvB,MAAI,OAAO,IAAP,KAAgB,WAApB,EAAiC;AAC/B,WAAO,IAAP;AACD;;AACD,MAAI,OAAO,MAAP,KAAkB,WAAtB,EAAmC;AACjC,WAAO,MAAP;AACD;;AACD,MAAI,OAAO,MAAP,KAAkB,WAAtB,EAAmC;AACjC,WAAO,MAAP;AACD;;AACD,QAAM,IAAI,KAAJ,CAAU,iCAAV,CAAN;AACF;AC/MA;;;;;;;;;;;;;;;;;;AA6DA,IAAM,UAAU,GAAG,eAAnB,C,CAUA;AACA;;;;;AACmC,EAAA,SAAA,CAAA,aAAA,EAAA,MAAA,CAAA;;AAGjC,WAAA,aAAA,CACW,IADX,EAEE,OAFF,EAGS,UAHT,EAG6C;AAH7C,QAAA,KAAA,GAKE,MAAA,CAAA,IAAA,CAAA,IAAA,EAAM,OAAN,KAAc,IALhB;;AACW,IAAA,KAAA,CAAA,IAAA,GAAA,IAAA;AAEF,IAAA,KAAA,CAAA,UAAA,GAAA,UAAA;AALA,IAAA,KAAA,CAAA,IAAA,GAAO,UAAP,CAKoC,C;;;AAM3C,IAAA,MAAM,CAAC,cAAP,CAAsB,KAAtB,EAA4B,aAAa,CAAC,SAA1C,EAN2C,C;;;AAU3C,QAAI,KAAK,CAAC,iBAAV,EAA6B;AAC3B,MAAA,KAAK,CAAC,iBAAN,CAAwB,KAAxB,EAA8B,YAAY,CAAC,SAAb,CAAuB,MAArD;AACD;;;AACF;;AACH,SAAA,aAAA;AApBA,C,CAAmC,K;;;;;AA0BjC,WAAA,YAAA,CACmB,OADnB,EAEmB,WAFnB,EAGmB,MAHnB,EAG8C;AAF3B,SAAA,OAAA,GAAA,OAAA;AACA,SAAA,WAAA,GAAA,WAAA;AACA,SAAA,MAAA,GAAA,MAAA;AACf;;AAEJ,EAAA,YAAA,CAAA,SAAA,CAAA,MAAA,GAAA,UACE,IADF,EACS;AACP,QAAA,IAAA,GAAA,EAAA;;SAAA,IAAA,EAAA,GAAA,C,EAAA,EAAA,GAAA,SAAA,CAAA,M,EAAA,EAAA,E,EAA4D;AAA5D,MAAA,IAAA,CAAA,EAAA,GAAA,CAAA,CAAA,GAAA,SAAA,CAAA,EAAA,CAAA;;;AAEA,QAAM,UAAU,GAAI,IAAI,CAAC,CAAD,CAAJ,IAAyB,EAA7C;AACA,QAAM,QAAQ,GAAM,KAAK,OAAL,GAAY,GAAZ,GAAgB,IAApC;AACA,QAAM,QAAQ,GAAG,KAAK,MAAL,CAAY,IAAZ,CAAjB;AAEA,QAAM,OAAO,GAAG,QAAQ,GAAG,eAAe,CAAC,QAAD,EAAW,UAAX,CAAlB,GAA2C,OAAnE,CAPO,C;;AASP,QAAM,WAAW,GAAM,KAAK,WAAL,GAAgB,IAAhB,GAAqB,OAArB,GAA4B,IAA5B,GAAiC,QAAjC,GAAyC,IAAhE;AAEA,QAAM,KAAK,GAAG,IAAI,aAAJ,CAAkB,QAAlB,EAA4B,WAA5B,EAAyC,UAAzC,CAAd;AAEA,WAAO,KAAP;AACD,GAfD;;AAgBF,SAAA,YAAA;AAAC,C;;AAED,SAAS,eAAT,CAAyB,QAAzB,EAA2C,IAA3C,EAA0D;AACxD,SAAO,QAAQ,CAAC,OAAT,CAAiB,OAAjB,EAA0B,UAAC,CAAD,EAAI,GAAJ,EAAO;AACtC,QAAM,KAAK,GAAG,IAAI,CAAC,GAAD,CAAlB;AACA,WAAO,KAAK,IAAI,IAAT,GAAgB,MAAM,CAAC,KAAD,CAAtB,GAAgC,MAAI,GAAJ,GAAO,IAA9C;AACD,GAHM,CAAP;AAID;;AAED,IAAM,OAAO,GAAG,eAAhB;AClIA;;;;;;;;;;;;;;;;;AAiBA;;;;;;;SAMgB,Q,CAAS,G,EAAW;AAClC,SAAO,IAAI,CAAC,KAAL,CAAW,GAAX,CAAP;AACD;AAED;;;;;;;SAKgB,S,CAAU,I,EAAa;AACrC,SAAO,IAAI,CAAC,SAAL,CAAe,IAAf,CAAP;AACF;AClCA;;;;;;;;;;;;;;;;;AA+BA;;;;;;;;;IAOa,MAAM,GAAG,UAAU,KAAV,EAAuB;AAC3C,MAAI,MAAM,GAAG,EAAb;AAAA,MACE,MAAM,GAAW,EADnB;AAAA,MAEE,IAAI,GAAG,EAFT;AAAA,MAGE,SAAS,GAAG,EAHd;;AAKA,MAAI;AACF,QAAM,KAAK,GAAG,KAAK,CAAC,KAAN,CAAY,GAAZ,CAAd;AACA,IAAA,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAD,CAAN,CAAZ,IAA0B,EAA3B,CAAjB;AACA,IAAA,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAD,CAAN,CAAZ,IAA0B,EAA3B,CAAjB;AACA,IAAA,SAAS,GAAG,KAAK,CAAC,CAAD,CAAjB;AACA,IAAA,IAAI,GAAG,MAAM,CAAC,GAAD,CAAN,IAAe,EAAtB;AACA,WAAO,MAAM,CAAC,GAAD,CAAb;AACD,GAPD,CAOE,OAAO,CAAP,EAAU,CAAE;;AAEd,SAAO;AACL,IAAA,MAAM,EAAA,MADD;AAEL,IAAA,MAAM,EAAA,MAFD;AAGL,IAAA,IAAI,EAAA,IAHC;AAIL,IAAA,SAAS,EAAA;AAJJ,GAAP;AAMF,C;AASA;;;;;;;;;;IAQa,gBAAgB,GAAG,UAAU,KAAV,EAAuB;AACrD,MAAM,MAAM,GAAW,MAAM,CAAC,KAAD,CAAN,CAAc,MAArC;AACA,MAAM,GAAG,GAAW,IAAI,CAAC,KAAL,CAAW,IAAI,IAAJ,GAAW,OAAX,KAAuB,IAAlC,CAApB;AACA,MAAI,UAAU,GAAW,CAAzB;AAAA,MACE,UAAU,GAAW,CADvB;;AAGA,MAAI,OAAO,MAAP,KAAkB,QAAtB,EAAgC;AAC9B,QAAI,MAAM,CAAC,cAAP,CAAsB,KAAtB,CAAJ,EAAkC;AAChC,MAAA,UAAU,GAAG,MAAM,CAAC,KAAD,CAAnB;AACD,KAFD,MAEO,IAAI,MAAM,CAAC,cAAP,CAAsB,KAAtB,CAAJ,EAAkC;AACvC,MAAA,UAAU,GAAG,MAAM,CAAC,KAAD,CAAnB;AACD;;AAED,QAAI,MAAM,CAAC,cAAP,CAAsB,KAAtB,CAAJ,EAAkC;AAChC,MAAA,UAAU,GAAG,MAAM,CAAC,KAAD,CAAnB;AACD,KAFD,MAEO;;AAEL,MAAA,UAAU,GAAG,UAAU,GAAG,KAA1B;AACD;AACF;;AAED,SACE,CAAC,CAAC,GAAF,IACA,CAAC,CAAC,UADF,IAEA,CAAC,CAAC,UAFF,IAGA,GAAG,IAAI,UAHP,IAIA,GAAG,IAAI,UALT;AAOF,C;AAEA;;;;;;;;;IAOa,YAAY,GAAG,UAAU,KAAV,EAAuB;AACjD,MAAM,MAAM,GAAW,MAAM,CAAC,KAAD,CAAN,CAAc,MAArC;;AACA,MAAI,OAAO,MAAP,KAAkB,QAAlB,IAA8B,MAAM,CAAC,cAAP,CAAsB,KAAtB,CAAlC,EAAgE;AAC9D,WAAO,MAAM,CAAC,KAAD,CAAb;AACD;;AACD,SAAO,IAAP;AACF,C;AAEA;;;;;;;;;IAOa,aAAa,GAAG,UAAU,KAAV,EAAuB;AAClD,MAAM,OAAO,GAAG,MAAM,CAAC,KAAD,CAAtB;AAAA,MACE,MAAM,GAAG,OAAO,CAAC,MADnB;AAGA,SAAO,CAAC,CAAC,MAAF,IAAY,OAAO,MAAP,KAAkB,QAA9B,IAA0C,MAAM,CAAC,cAAP,CAAsB,KAAtB,CAAjD;AACF,C;AAEA;;;;;;;;;IAOa,OAAO,GAAG,UAAU,KAAV,EAAuB;AAC5C,MAAM,MAAM,GAAW,MAAM,CAAC,KAAD,CAAN,CAAc,MAArC;AACA,SAAO,OAAO,MAAP,KAAkB,QAAlB,IAA8B,MAAM,CAAC,OAAD,CAAN,KAAoB,IAAzD;AACF,C;ACjJA;;;;;;;;;;;;;;;;;;SAiBgB,Q,CAA2B,G,EAAQ,G,EAAW;AAC5D,SAAO,MAAM,CAAC,SAAP,CAAiB,cAAjB,CAAgC,IAAhC,CAAqC,GAArC,EAA0C,GAA1C,CAAP;AACD;;SAEe,O,CACd,G,EACA,G,EAAM;AAEN,MAAI,MAAM,CAAC,SAAP,CAAiB,cAAjB,CAAgC,IAAhC,CAAqC,GAArC,EAA0C,GAA1C,CAAJ,EAAoD;AAClD,WAAO,GAAG,CAAC,GAAD,CAAV;AACD,GAFD,MAEO;AACL,WAAO,SAAP;AACD;AACF;;SAEe,O,CAAQ,G,EAAW;AACjC,OAAK,IAAM,GAAX,IAAkB,GAAlB,EAAuB;AACrB,QAAI,MAAM,CAAC,SAAP,CAAiB,cAAjB,CAAgC,IAAhC,CAAqC,GAArC,EAA0C,GAA1C,CAAJ,EAAoD;AAClD,aAAO,KAAP;AACD;AACF;;AACD,SAAO,IAAP;AACD;;SAEe,G,CACd,G,EACA,E,EACA,U,EAAoB;AAEpB,MAAM,GAAG,GAA+B,EAAxC;;AACA,OAAK,IAAM,GAAX,IAAkB,GAAlB,EAAuB;AACrB,QAAI,MAAM,CAAC,SAAP,CAAiB,cAAjB,CAAgC,IAAhC,CAAqC,GAArC,EAA0C,GAA1C,CAAJ,EAAoD;AAClD,MAAA,GAAG,CAAC,GAAD,CAAH,GAAW,EAAE,CAAC,IAAH,CAAQ,UAAR,EAAoB,GAAG,CAAC,GAAD,CAAvB,EAA8B,GAA9B,EAAmC,GAAnC,CAAX;AACD;AACF;;AACD,SAAO,GAAP;AACD;AAED;;;;;SAGgB,S,CAAU,C,EAAW,C,EAAS;AAC5C,MAAI,CAAC,KAAK,CAAV,EAAa;AACX,WAAO,IAAP;AACD;;AAED,MAAM,KAAK,GAAG,MAAM,CAAC,IAAP,CAAY,CAAZ,CAAd;AACA,MAAM,KAAK,GAAG,MAAM,CAAC,IAAP,CAAY,CAAZ,CAAd;;AACA,OAAgB,IAAA,EAAA,GAAA,CAAA,EAAA,OAAA,GAAA,KAAhB,EAAgB,EAAA,GAAA,OAAA,CAAA,MAAhB,EAAgB,EAAA,EAAhB,EAAuB;AAAlB,QAAM,CAAC,GAAA,OAAA,CAAA,EAAA,CAAP;;AACH,QAAI,CAAC,KAAK,CAAC,QAAN,CAAe,CAAf,CAAL,EAAwB;AACtB,aAAO,KAAP;AACD;;AAED,QAAM,KAAK,GAAI,CAA6B,CAAC,CAAD,CAA5C;AACA,QAAM,KAAK,GAAI,CAA6B,CAAC,CAAD,CAA5C;;AACA,QAAI,QAAQ,CAAC,KAAD,CAAR,IAAmB,QAAQ,CAAC,KAAD,CAA/B,EAAwC;AACtC,UAAI,CAAC,SAAS,CAAC,KAAD,EAAQ,KAAR,CAAd,EAA8B;AAC5B,eAAO,KAAP;AACD;AACF,KAJD,MAIO,IAAI,KAAK,KAAK,KAAd,EAAqB;AAC1B,aAAO,KAAP;AACD;AACF;;AAED,OAAgB,IAAA,EAAA,GAAA,CAAA,EAAA,OAAA,GAAA,KAAhB,EAAgB,EAAA,GAAA,OAAA,CAAA,MAAhB,EAAgB,EAAA,EAAhB,EAAuB;AAAlB,QAAM,CAAC,GAAA,OAAA,CAAA,EAAA,CAAP;;AACH,QAAI,CAAC,KAAK,CAAC,QAAN,CAAe,CAAf,CAAL,EAAwB;AACtB,aAAO,KAAP;AACD;AACF;;AACD,SAAO,IAAP;AACD;;AAED,SAAS,QAAT,CAAkB,KAAlB,EAAgC;AAC9B,SAAO,KAAK,KAAK,IAAV,IAAkB,OAAO,KAAP,KAAiB,QAA1C;AACF;AC3FA;;;;;;;;;;;;;;;;;AAiBA;;;;;;;SAKgB,W,CAAY,iB,EAE3B;AACC,MAAM,MAAM,GAAG,EAAf;;0BACY,G,EAAK,K,EAAK;AACpB,QAAI,KAAK,CAAC,OAAN,CAAc,KAAd,CAAJ,EAA0B;AACxB,MAAA,KAAK,CAAC,OAAN,CAAc,UAAA,QAAA,EAAQ;AACpB,QAAA,MAAM,CAAC,IAAP,CACE,kBAAkB,CAAC,GAAD,CAAlB,GAA0B,GAA1B,GAAgC,kBAAkB,CAAC,QAAD,CADpD;AAGD,OAJD;AAKD,KAND,MAMO;AACL,MAAA,MAAM,CAAC,IAAP,CAAY,kBAAkB,CAAC,GAAD,CAAlB,GAA0B,GAA1B,GAAgC,kBAAkB,CAAC,KAAD,CAA9D;AACD;;;AATH,OAA2B,IAAA,EAAA,GAAA,CAAA,EAAA,EAAA,GAAA,MAAM,CAAC,OAAP,CAAe,iBAAf,CAA3B,EAA2B,EAAA,GAAA,EAAA,CAAA,MAA3B,EAA2B,EAAA,EAA3B,EAA4D;AAAjD,QAAA,EAAA,GAAA,EAAA,CAAA,EAAA,CAAA;AAAA,QAAC,GAAG,GAAA,EAAA,CAAA,CAAA,CAAJ;AAAA,QAAM,KAAK,GAAA,EAAA,CAAA,CAAA,CAAX;;YAAC,G,EAAK,K;AAUhB;;AACD,SAAO,MAAM,CAAC,MAAP,GAAgB,MAAM,MAAM,CAAC,IAAP,CAAY,GAAZ,CAAtB,GAAyC,EAAhD;AACD;AAED;;;;;;SAIgB,iB,CAAkB,W,EAAmB;AACnD,MAAM,GAAG,GAA2B,EAApC;AACA,MAAM,MAAM,GAAG,WAAW,CAAC,OAAZ,CAAoB,KAApB,EAA2B,EAA3B,EAA+B,KAA/B,CAAqC,GAArC,CAAf;AAEA,EAAA,MAAM,CAAC,OAAP,CAAe,UAAA,KAAA,EAAK;AAClB,QAAI,KAAJ,EAAW;AACH,UAAA,EAAA,GAAe,KAAK,CAAC,KAAN,CAAY,GAAZ,CAAf;AAAA,UAAC,GAAG,GAAA,EAAA,CAAA,CAAA,CAAJ;AAAA,UAAM,KAAK,GAAA,EAAA,CAAA,CAAA,CAAX;;AACN,MAAA,GAAG,CAAC,kBAAkB,CAAC,GAAD,CAAnB,CAAH,GAA+B,kBAAkB,CAAC,KAAD,CAAjD;AACD;AACF,GALD;AAMA,SAAO,GAAP;AACD;AAED;;;;;SAGgB,kB,CAAmB,G,EAAW;AAC5C,MAAM,UAAU,GAAG,GAAG,CAAC,OAAJ,CAAY,GAAZ,CAAnB;;AACA,MAAI,CAAC,UAAL,EAAiB;AACf,WAAO,EAAP;AACD;;AACD,MAAM,aAAa,GAAG,GAAG,CAAC,OAAJ,CAAY,GAAZ,EAAiB,UAAjB,CAAtB;AACA,SAAO,GAAG,CAAC,SAAJ,CACL,UADK,EAEL,aAAa,GAAG,CAAhB,GAAoB,aAApB,GAAoC,SAF/B,CAAP;AAIF;ACtEA;;;;;;;;;;;;;;;;;AAiBA;;;;;;;;;;;;;;;;AAgBA;;;;;;;;;;;;;AA+CE,WAAA,IAAA,GAAA;;;;;;AAjCQ,SAAA,MAAA,GAAmB,EAAnB;;;;;;AAMA,SAAA,IAAA,GAAiB,EAAjB;;;;;;;AAOA,SAAA,EAAA,GAAe,EAAf;;;;;;AAMA,SAAA,IAAA,GAAiB,EAAjB;;;;;AAKA,SAAA,MAAA,GAAiB,CAAjB;;;;;AAKA,SAAA,MAAA,GAAiB,CAAjB;AAKN,SAAK,SAAL,GAAiB,MAAM,CAAvB;AAEA,SAAK,IAAL,CAAU,CAAV,IAAe,GAAf;;AACA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,SAAzB,EAAoC,EAAE,CAAtC,EAAyC;AACvC,WAAK,IAAL,CAAU,CAAV,IAAe,CAAf;AACD;;AAED,SAAK,KAAL;AACD;;AAED,EAAA,IAAA,CAAA,SAAA,CAAA,KAAA,GAAA,YAAA;AACE,SAAK,MAAL,CAAY,CAAZ,IAAiB,UAAjB;AACA,SAAK,MAAL,CAAY,CAAZ,IAAiB,UAAjB;AACA,SAAK,MAAL,CAAY,CAAZ,IAAiB,UAAjB;AACA,SAAK,MAAL,CAAY,CAAZ,IAAiB,UAAjB;AACA,SAAK,MAAL,CAAY,CAAZ,IAAiB,UAAjB;AAEA,SAAK,MAAL,GAAc,CAAd;AACA,SAAK,MAAL,GAAc,CAAd;AACD,GATD;;;;;;;;;AAiBA,EAAA,IAAA,CAAA,SAAA,CAAA,SAAA,GAAA,UAAU,GAAV,EAA+C,MAA/C,EAA8D;AAC5D,QAAI,CAAC,MAAL,EAAa;AACX,MAAA,MAAM,GAAG,CAAT;AACD;;AAED,QAAM,CAAC,GAAG,KAAK,EAAf,CAL4D,C;;AAQ5D,QAAI,OAAO,GAAP,KAAe,QAAnB,EAA6B;AAC3B,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,EAApB,EAAwB,CAAC,EAAzB,EAA6B;;;;;;;;;AAS3B,QAAA,CAAC,CAAC,CAAD,CAAD,GACG,GAAG,CAAC,UAAJ,CAAe,MAAf,KAA0B,EAA3B,GACC,GAAG,CAAC,UAAJ,CAAe,MAAM,GAAG,CAAxB,KAA8B,EAD/B,GAEC,GAAG,CAAC,UAAJ,CAAe,MAAM,GAAG,CAAxB,KAA8B,CAF/B,GAGA,GAAG,CAAC,UAAJ,CAAe,MAAM,GAAG,CAAxB,CAJF;AAKA,QAAA,MAAM,IAAI,CAAV;AACD;AACF,KAjBD,MAiBO;AACL,WAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,EAApB,EAAwB,CAAC,EAAzB,EAA6B;AAC3B,QAAA,CAAC,CAAC,CAAD,CAAD,GACG,GAAG,CAAC,MAAD,CAAH,IAAe,EAAhB,GACC,GAAG,CAAC,MAAM,GAAG,CAAV,CAAH,IAAmB,EADpB,GAEC,GAAG,CAAC,MAAM,GAAG,CAAV,CAAH,IAAmB,CAFpB,GAGA,GAAG,CAAC,MAAM,GAAG,CAAV,CAJL;AAKA,QAAA,MAAM,IAAI,CAAV;AACD;AACF,KAlC2D,C;;;AAqC5D,SAAK,IAAI,CAAC,GAAG,EAAb,EAAiB,CAAC,GAAG,EAArB,EAAyB,CAAC,EAA1B,EAA8B;AAC5B,UAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAL,CAAD,GAAW,CAAC,CAAC,CAAC,GAAG,CAAL,CAAZ,GAAsB,CAAC,CAAC,CAAC,GAAG,EAAL,CAAvB,GAAkC,CAAC,CAAC,CAAC,GAAG,EAAL,CAA7C;AACA,MAAA,CAAC,CAAC,CAAD,CAAD,GAAO,CAAE,CAAC,IAAI,CAAN,GAAY,CAAC,KAAK,EAAnB,IAA0B,UAAjC;AACD;;AAED,QAAI,CAAC,GAAG,KAAK,MAAL,CAAY,CAAZ,CAAR;AACA,QAAI,CAAC,GAAG,KAAK,MAAL,CAAY,CAAZ,CAAR;AACA,QAAI,CAAC,GAAG,KAAK,MAAL,CAAY,CAAZ,CAAR;AACA,QAAI,CAAC,GAAG,KAAK,MAAL,CAAY,CAAZ,CAAR;AACA,QAAI,CAAC,GAAG,KAAK,MAAL,CAAY,CAAZ,CAAR;AACA,QAAI,CAAJ,EAAO,CAAP,CA/C4D,C;;AAkD5D,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,EAApB,EAAwB,CAAC,EAAzB,EAA6B;AAC3B,UAAI,CAAC,GAAG,EAAR,EAAY;AACV,YAAI,CAAC,GAAG,EAAR,EAAY;AACV,UAAA,CAAC,GAAG,CAAC,GAAI,CAAC,IAAI,CAAC,GAAG,CAAR,CAAV;AACA,UAAA,CAAC,GAAG,UAAJ;AACD,SAHD,MAGO;AACL,UAAA,CAAC,GAAG,CAAC,GAAG,CAAJ,GAAQ,CAAZ;AACA,UAAA,CAAC,GAAG,UAAJ;AACD;AACF,OARD,MAQO;AACL,YAAI,CAAC,GAAG,EAAR,EAAY;AACV,UAAA,CAAC,GAAI,CAAC,GAAG,CAAL,GAAW,CAAC,IAAI,CAAC,GAAG,CAAR,CAAhB;AACA,UAAA,CAAC,GAAG,UAAJ;AACD,SAHD,MAGO;AACL,UAAA,CAAC,GAAG,CAAC,GAAG,CAAJ,GAAQ,CAAZ;AACA,UAAA,CAAC,GAAG,UAAJ;AACD;AACF;;AAED,UAAM,CAAC,GAAI,CAAE,CAAC,IAAI,CAAN,GAAY,CAAC,KAAK,EAAnB,IAA0B,CAA1B,GAA8B,CAA9B,GAAkC,CAAlC,GAAsC,CAAC,CAAC,CAAD,CAAxC,GAA+C,UAAzD;AACA,MAAA,CAAC,GAAG,CAAJ;AACA,MAAA,CAAC,GAAG,CAAJ;AACA,MAAA,CAAC,GAAG,CAAE,CAAC,IAAI,EAAN,GAAa,CAAC,KAAK,CAApB,IAA0B,UAA9B;AACA,MAAA,CAAC,GAAG,CAAJ;AACA,MAAA,CAAC,GAAG,CAAJ;AACD;;AAED,SAAK,MAAL,CAAY,CAAZ,IAAkB,KAAK,MAAL,CAAY,CAAZ,IAAiB,CAAlB,GAAuB,UAAxC;AACA,SAAK,MAAL,CAAY,CAAZ,IAAkB,KAAK,MAAL,CAAY,CAAZ,IAAiB,CAAlB,GAAuB,UAAxC;AACA,SAAK,MAAL,CAAY,CAAZ,IAAkB,KAAK,MAAL,CAAY,CAAZ,IAAiB,CAAlB,GAAuB,UAAxC;AACA,SAAK,MAAL,CAAY,CAAZ,IAAkB,KAAK,MAAL,CAAY,CAAZ,IAAiB,CAAlB,GAAuB,UAAxC;AACA,SAAK,MAAL,CAAY,CAAZ,IAAkB,KAAK,MAAL,CAAY,CAAZ,IAAiB,CAAlB,GAAuB,UAAxC;AACD,GAlFD;;AAoFA,EAAA,IAAA,CAAA,SAAA,CAAA,MAAA,GAAA,UAAO,KAAP,EAA+C,MAA/C,EAA8D;;AAE5D,QAAI,KAAK,IAAI,IAAb,EAAmB;AACjB;AACD;;AAED,QAAI,MAAM,KAAK,SAAf,EAA0B;AACxB,MAAA,MAAM,GAAG,KAAK,CAAC,MAAf;AACD;;AAED,QAAM,gBAAgB,GAAG,MAAM,GAAG,KAAK,SAAvC;AACA,QAAI,CAAC,GAAG,CAAR,CAX4D,C;;AAa5D,QAAM,GAAG,GAAG,KAAK,IAAjB;AACA,QAAI,KAAK,GAAG,KAAK,MAAjB,CAd4D,C;;AAiB5D,WAAO,CAAC,GAAG,MAAX,EAAmB;;;;;AAKjB,UAAI,KAAK,KAAK,CAAd,EAAiB;AACf,eAAO,CAAC,IAAI,gBAAZ,EAA8B;AAC5B,eAAK,SAAL,CAAe,KAAf,EAAsB,CAAtB;AACA,UAAA,CAAC,IAAI,KAAK,SAAV;AACD;AACF;;AAED,UAAI,OAAO,KAAP,KAAiB,QAArB,EAA+B;AAC7B,eAAO,CAAC,GAAG,MAAX,EAAmB;AACjB,UAAA,GAAG,CAAC,KAAD,CAAH,GAAa,KAAK,CAAC,UAAN,CAAiB,CAAjB,CAAb;AACA,YAAE,KAAF;AACA,YAAE,CAAF;;AACA,cAAI,KAAK,KAAK,KAAK,SAAnB,EAA8B;AAC5B,iBAAK,SAAL,CAAe,GAAf;AACA,YAAA,KAAK,GAAG,CAAR,CAF4B,C;;AAI5B;AACD;AACF;AACF,OAZD,MAYO;AACL,eAAO,CAAC,GAAG,MAAX,EAAmB;AACjB,UAAA,GAAG,CAAC,KAAD,CAAH,GAAa,KAAK,CAAC,CAAD,CAAlB;AACA,YAAE,KAAF;AACA,YAAE,CAAF;;AACA,cAAI,KAAK,KAAK,KAAK,SAAnB,EAA8B;AAC5B,iBAAK,SAAL,CAAe,GAAf;AACA,YAAA,KAAK,GAAG,CAAR,CAF4B,C;;AAI5B;AACD;AACF;AACF;AACF;;AAED,SAAK,MAAL,GAAc,KAAd;AACA,SAAK,MAAL,IAAe,MAAf;AACD,GA1DD;;;;AA6DA,EAAA,IAAA,CAAA,SAAA,CAAA,MAAA,GAAA,YAAA;AACE,QAAM,MAAM,GAAa,EAAzB;AACA,QAAI,SAAS,GAAG,KAAK,MAAL,GAAc,CAA9B,CAFF,C;;AAKE,QAAI,KAAK,MAAL,GAAc,EAAlB,EAAsB;AACpB,WAAK,MAAL,CAAY,KAAK,IAAjB,EAAuB,KAAK,KAAK,MAAjC;AACD,KAFD,MAEO;AACL,WAAK,MAAL,CAAY,KAAK,IAAjB,EAAuB,KAAK,SAAL,IAAkB,KAAK,MAAL,GAAc,EAAhC,CAAvB;AACD,KATH,C;;;AAYE,SAAK,IAAI,CAAC,GAAG,KAAK,SAAL,GAAiB,CAA9B,EAAiC,CAAC,IAAI,EAAtC,EAA0C,CAAC,EAA3C,EAA+C;AAC7C,WAAK,IAAL,CAAU,CAAV,IAAe,SAAS,GAAG,GAA3B;AACA,MAAA,SAAS,IAAI,GAAb,CAF6C,CAE5B;AAClB;;AAED,SAAK,SAAL,CAAe,KAAK,IAApB;AAEA,QAAI,CAAC,GAAG,CAAR;;AACA,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,CAApB,EAAuB,CAAC,EAAxB,EAA4B;AAC1B,WAAK,IAAI,CAAC,GAAG,EAAb,EAAiB,CAAC,IAAI,CAAtB,EAAyB,CAAC,IAAI,CAA9B,EAAiC;AAC/B,QAAA,MAAM,CAAC,CAAD,CAAN,GAAa,KAAK,MAAL,CAAY,CAAZ,KAAkB,CAAnB,GAAwB,GAApC;AACA,UAAE,CAAF;AACD;AACF;;AACD,WAAO,MAAP;AACD,GA3BD;;AA4BF,SAAA,IAAA;AAAC,C;ACrOD;;;;;;;;;;SAQgB,e,CACd,Q,EACA,a,EAA2B;AAE3B,MAAM,KAAK,GAAG,IAAI,aAAJ,CAAqB,QAArB,EAA+B,aAA/B,CAAd;AACA,SAAO,KAAK,CAAC,SAAN,CAAgB,IAAhB,CAAqB,KAArB,CAAP;AACD;AAED;;;;;;AAIA,IAAA,aAAA;AAAA;AAAA,YAAA;;;;;;AAeE,WAAA,aAAA,CAAY,QAAZ,EAAmC,aAAnC,EAA8D;AAA9D,QAAA,KAAA,GAAA,IAAA;;AAdQ,SAAA,SAAA,GAA4C,EAA5C;AACA,SAAA,YAAA,GAA8B,EAA9B;AAEA,SAAA,aAAA,GAAgB,CAAhB,CAWsD,C;;AATtD,SAAA,IAAA,GAAO,OAAO,CAAC,OAAR,EAAP;AACA,SAAA,SAAA,GAAY,KAAZ;AASN,SAAK,aAAL,GAAqB,aAArB,CAD4D,C;;;;AAK5D,SAAK,IAAL,CACG,IADH,CACQ,YAAA;AACJ,MAAA,QAAQ,CAAC,KAAD,CAAR;AACD,KAHH,EAIG,KAJH,CAIS,UAAA,CAAA,EAAC;AACN,MAAA,KAAI,CAAC,KAAL,CAAW,CAAX;AACD,KANH;AAOD;;AAED,EAAA,aAAA,CAAA,SAAA,CAAA,IAAA,GAAA,UAAK,KAAL,EAAa;AACX,SAAK,eAAL,CAAqB,UAAC,QAAD,EAAsB;AACzC,MAAA,QAAQ,CAAC,IAAT,CAAc,KAAd;AACD,KAFD;AAGD,GAJD;;AAMA,EAAA,aAAA,CAAA,SAAA,CAAA,KAAA,GAAA,UAAM,KAAN,EAAkB;AAChB,SAAK,eAAL,CAAqB,UAAC,QAAD,EAAsB;AACzC,MAAA,QAAQ,CAAC,KAAT,CAAe,KAAf;AACD,KAFD;AAGA,SAAK,KAAL,CAAW,KAAX;AACD,GALD;;AAOA,EAAA,aAAA,CAAA,SAAA,CAAA,QAAA,GAAA,YAAA;AACE,SAAK,eAAL,CAAqB,UAAC,QAAD,EAAsB;AACzC,MAAA,QAAQ,CAAC,QAAT;AACD,KAFD;AAGA,SAAK,KAAL;AACD,GALD;;;;;;;;;AAaA,EAAA,aAAA,CAAA,SAAA,CAAA,SAAA,GAAA,UACE,cADF,EAEE,KAFF,EAGE,QAHF,EAGuB;AAHvB,QAAA,KAAA,GAAA,IAAA;;AAKE,QAAI,QAAJ;;AAEA,QACE,cAAc,KAAK,SAAnB,IACA,KAAK,KAAK,SADV,IAEA,QAAQ,KAAK,SAHf,EAIE;AACA,YAAM,IAAI,KAAJ,CAAU,mBAAV,CAAN;AACD,KAVoB,C;;;AAarB,QACE,oBAAoB,CAAC,cAAD,EAA+C,CACjE,MADiE,EAEjE,OAFiE,EAGjE,UAHiE,CAA/C,CADtB,EAME;AACA,MAAA,QAAQ,GAAG,cAAX;AACD,KARD,MAQO;AACL,MAAA,QAAQ,GAAG;AACT,QAAA,IAAI,EAAE,cADG;AAET,QAAA,KAAK,EAAA,KAFI;AAGT,QAAA,QAAQ,EAAA;AAHC,OAAX;AAKD;;AAED,QAAI,QAAQ,CAAC,IAAT,KAAkB,SAAtB,EAAiC;AAC/B,MAAA,QAAQ,CAAC,IAAT,GAAgB,IAAhB;AACD;;AACD,QAAI,QAAQ,CAAC,KAAT,KAAmB,SAAvB,EAAkC;AAChC,MAAA,QAAQ,CAAC,KAAT,GAAiB,IAAjB;AACD;;AACD,QAAI,QAAQ,CAAC,QAAT,KAAsB,SAA1B,EAAqC;AACnC,MAAA,QAAQ,CAAC,QAAT,GAAoB,IAApB;AACD;;AAED,QAAM,KAAK,GAAG,KAAK,cAAL,CAAoB,IAApB,CAAyB,IAAzB,EAA+B,KAAK,SAAL,CAAgB,MAA/C,CAAd,CAvCqB,C;;;;AA4CrB,QAAI,KAAK,SAAT,EAAoB;;AAElB,WAAK,IAAL,CAAU,IAAV,CAAe,YAAA;AACb,YAAI;AACF,cAAI,KAAI,CAAC,UAAT,EAAqB;AACnB,YAAA,QAAQ,CAAC,KAAT,CAAe,KAAI,CAAC,UAApB;AACD,WAFD,MAEO;AACL,YAAA,QAAQ,CAAC,QAAT;AACD;AACF,SAND,CAME,OAAO,CAAP,EAAU,C;AAEX;;AACD;AACD,OAXD;AAYD;;AAED,SAAK,SAAL,CAAgB,IAAhB,CAAqB,QAArB;AAEA,WAAO,KAAP;AACD,GAlED,CAvDF,C;;;;AA6HU,EAAA,aAAA,CAAA,SAAA,CAAA,cAAA,GAAR,UAAuB,CAAvB,EAAgC;AAC9B,QAAI,KAAK,SAAL,KAAmB,SAAnB,IAAgC,KAAK,SAAL,CAAe,CAAf,MAAsB,SAA1D,EAAqE;AACnE;AACD;;AAED,WAAO,KAAK,SAAL,CAAe,CAAf,CAAP;AAEA,SAAK,aAAL,IAAsB,CAAtB;;AACA,QAAI,KAAK,aAAL,KAAuB,CAAvB,IAA4B,KAAK,aAAL,KAAuB,SAAvD,EAAkE;AAChE,WAAK,aAAL,CAAmB,IAAnB;AACD;AACF,GAXO;;AAaA,EAAA,aAAA,CAAA,SAAA,CAAA,eAAA,GAAR,UAAwB,EAAxB,EAA2D;AACzD,QAAI,KAAK,SAAT,EAAoB;;AAElB;AACD,KAJwD,C;;;;AAQzD,SAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,KAAK,SAAL,CAAgB,MAApC,EAA4C,CAAC,EAA7C,EAAiD;AAC/C,WAAK,OAAL,CAAa,CAAb,EAAgB,EAAhB;AACD;AACF,GAXO,CA1IV,C;;;;;AA0JU,EAAA,aAAA,CAAA,SAAA,CAAA,OAAA,GAAR,UAAgB,CAAhB,EAA2B,EAA3B,EAA8D;AAA9D,QAAA,KAAA,GAAA,IAAA,CAA8D,C;;;;AAG5D,SAAK,IAAL,CAAU,IAAV,CAAe,YAAA;AACb,UAAI,KAAI,CAAC,SAAL,KAAmB,SAAnB,IAAgC,KAAI,CAAC,SAAL,CAAe,CAAf,MAAsB,SAA1D,EAAqE;AACnE,YAAI;AACF,UAAA,EAAE,CAAC,KAAI,CAAC,SAAL,CAAe,CAAf,CAAD,CAAF;AACD,SAFD,CAEE,OAAO,CAAP,EAAU;;;;AAIV,cAAI,OAAO,OAAP,KAAmB,WAAnB,IAAkC,OAAO,CAAC,KAA9C,EAAqD;AACnD,YAAA,OAAO,CAAC,KAAR,CAAc,CAAd;AACD;AACF;AACF;AACF,KAbD;AAcD,GAjBO;;AAmBA,EAAA,aAAA,CAAA,SAAA,CAAA,KAAA,GAAR,UAAc,GAAd,EAAyB;AAAzB,QAAA,KAAA,GAAA,IAAA;;AACE,QAAI,KAAK,SAAT,EAAoB;AAClB;AACD;;AACD,SAAK,SAAL,GAAiB,IAAjB;;AACA,QAAI,GAAG,KAAK,SAAZ,EAAuB;AACrB,WAAK,UAAL,GAAkB,GAAlB;AACD,KAPsB,C;;;;AAUvB,SAAK,IAAL,CAAU,IAAV,CAAe,YAAA;AACb,MAAA,KAAI,CAAC,SAAL,GAAiB,SAAjB;AACA,MAAA,KAAI,CAAC,aAAL,GAAqB,SAArB;AACD,KAHD;AAID,GAdO;;AAeV,SAAA,aAAA;AAAC,CA5LD,EAAA;AA8LA;AACA;;;SACgB,K,CAAM,E,EAAc,O,EAAiB;AACnD,SAAO,YAAA;AAAC,QAAA,IAAA,GAAA,EAAA;;SAAA,IAAA,EAAA,GAAA,C,EAAA,EAAA,GAAA,SAAA,CAAA,M,EAAA,EAAA,E,EAAkB;AAAlB,MAAA,IAAA,CAAA,EAAA,CAAA,GAAA,SAAA,CAAA,EAAA,CAAA;;;AACN,IAAA,OAAO,CAAC,OAAR,CAAgB,IAAhB,EACG,IADH,CACQ,YAAA;AACJ,MAAA,EAAE,CAAA,KAAF,CAAE,KAAA,CAAF,EAAM,IAAN;AACD,KAHH,EAIG,KAJH,CAIS,UAAC,KAAD,EAAa;AAClB,UAAI,OAAJ,EAAa;AACX,QAAA,OAAO,CAAC,KAAD,CAAP;AACD;AACF,KARH;AASD,GAVD;AAWD;AAED;;;;;AAGA,SAAS,oBAAT,CACE,GADF,EAEE,OAFF,EAEmB;AAEjB,MAAI,OAAO,GAAP,KAAe,QAAf,IAA2B,GAAG,KAAK,IAAvC,EAA6C;AAC3C,WAAO,KAAP;AACD;;AAED,OAAqB,IAAA,EAAA,GAAA,CAAA,EAAA,SAAA,GAAA,OAArB,EAAqB,EAAA,GAAA,SAAA,CAAA,MAArB,EAAqB,EAAA,EAArB,EAA8B;AAAzB,QAAM,MAAM,GAAA,SAAA,CAAA,EAAA,CAAZ;;AACH,QAAI,MAAM,IAAI,GAAV,IAAiB,OAAO,GAAG,CAAC,MAAD,CAAV,KAAuB,UAA5C,EAAwD;AACtD,aAAO,IAAP;AACD;AACF;;AAED,SAAO,KAAP;AACD;;AAED,SAAS,IAAT,GAAa,C;AAEb;AC5SA;;;;;;;;;;;;;;;;;AAiBA;;;;;;;;;;;IASa,gBAAgB,GAAG,UAC9B,MAD8B,EAE9B,QAF8B,EAG9B,QAH8B,EAI9B,QAJ8B,EAId;AAEhB,MAAI,QAAJ;;AACA,MAAI,QAAQ,GAAG,QAAf,EAAyB;AACvB,IAAA,QAAQ,GAAG,cAAc,QAAzB;AACD,GAFD,MAEO,IAAI,QAAQ,GAAG,QAAf,EAAyB;AAC9B,IAAA,QAAQ,GAAG,QAAQ,KAAK,CAAb,GAAiB,MAAjB,GAA0B,kBAAkB,QAAvD;AACD;;AACD,MAAI,QAAJ,EAAc;AACZ,QAAM,KAAK,GACT,MAAM,GACN,2BADA,GAEA,QAFA,IAGC,QAAQ,KAAK,CAAb,GAAiB,YAAjB,GAAgC,aAHjC,IAIA,WAJA,GAKA,QALA,GAMA,GAPF;AAQA,UAAM,IAAI,KAAJ,CAAU,KAAV,CAAN;AACD;AACH,C;AAEA;;;;;;;;;SAOgB,W,CAAY,M,EAAgB,O,EAAe;AACzD,SAAU,MAAM,GAAA,WAAN,GAAkB,OAAlB,GAAyB,YAAnC;AACD;AAED;;;;;;;;SAMgB,iB,CACd,M,EACA,S,EACA,Q,EAAiB;AAEjB,MAAI,QAAQ,IAAI,CAAC,SAAjB,EAA4B;AAC1B;AACD;;AACD,MAAI,OAAO,SAAP,KAAqB,QAAzB,EAAmC;;AAEjC,UAAM,IAAI,KAAJ,CACJ,WAAW,CAAC,MAAD,EAAS,WAAT,CAAX,GAAmC,qCAD/B,CAAN;AAGD;AACF;;SAEe,gB,CACd,M,EACA,Y,EACA;AACA,Q,EACA,Q,EAAiB;AAEjB,MAAI,QAAQ,IAAI,CAAC,QAAjB,EAA2B;AACzB;AACD;;AACD,MAAI,OAAO,QAAP,KAAoB,UAAxB,EAAoC;AAClC,UAAM,IAAI,KAAJ,CACJ,WAAW,CAAC,MAAD,EAAS,YAAT,CAAX,GAAoC,2BADhC,CAAN;AAGD;AACF;;SAEe,qB,CACd,M,EACA,Y,EACA,O,EACA,Q,EAAiB;AAEjB,MAAI,QAAQ,IAAI,CAAC,OAAjB,EAA0B;AACxB;AACD;;AACD,MAAI,OAAO,OAAP,KAAmB,QAAnB,IAA+B,OAAO,KAAK,IAA/C,EAAqD;AACnD,UAAM,IAAI,KAAJ,CACJ,WAAW,CAAC,MAAD,EAAS,YAAT,CAAX,GAAoC,iCADhC,CAAN;AAGD;AACH;ACnHA;;;;;;;;;;;;;;;;AAmBA;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;IAIa,iBAAiB,GAAG,UAAU,GAAV,EAAqB;AACpD,MAAM,GAAG,GAAa,EAAtB;AACA,MAAI,CAAC,GAAG,CAAR;;AACA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAAG,CAAC,MAAxB,EAAgC,CAAC,EAAjC,EAAqC;AACnC,QAAI,CAAC,GAAG,GAAG,CAAC,UAAJ,CAAe,CAAf,CAAR,CADmC,C;;AAInC,QAAI,CAAC,IAAI,MAAL,IAAe,CAAC,IAAI,MAAxB,EAAgC;AAC9B,UAAM,IAAI,GAAG,CAAC,GAAG,MAAjB,CAD8B,CACN;;AACxB,MAAA,CAAC;AACD,MAAA,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAT,EAAiB,yCAAjB,CAAN;AACA,UAAM,GAAG,GAAG,GAAG,CAAC,UAAJ,CAAe,CAAf,IAAoB,MAAhC,CAJ8B,CAIS;;AACvC,MAAA,CAAC,GAAG,WAAW,IAAI,IAAI,EAAnB,IAAyB,GAA7B;AACD;;AAED,QAAI,CAAC,GAAG,GAAR,EAAa;AACX,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAW,CAAX;AACD,KAFD,MAEO,IAAI,CAAC,GAAG,IAAR,EAAc;AACnB,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,IAAI,CAAN,GAAW,GAAtB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,GAAG,EAAL,GAAW,GAAtB;AACD,KAHM,MAGA,IAAI,CAAC,GAAG,KAAR,EAAe;AACpB,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,IAAI,EAAN,GAAY,GAAvB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAa,CAAC,IAAI,CAAN,GAAW,EAAZ,GAAkB,GAA7B;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,GAAG,EAAL,GAAW,GAAtB;AACD,KAJM,MAIA;AACL,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,IAAI,EAAN,GAAY,GAAvB;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAa,CAAC,IAAI,EAAN,GAAY,EAAb,GAAmB,GAA9B;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAa,CAAC,IAAI,CAAN,GAAW,EAAZ,GAAkB,GAA7B;AACA,MAAA,GAAG,CAAC,CAAC,EAAF,CAAH,GAAY,CAAC,GAAG,EAAL,GAAW,GAAtB;AACD;AACF;;AACD,SAAO,GAAP;AACF,C;AAEA;;;;;;;IAKa,YAAY,GAAG,UAAU,GAAV,EAAqB;AAC/C,MAAI,CAAC,GAAG,CAAR;;AACA,OAAK,IAAI,CAAC,GAAG,CAAb,EAAgB,CAAC,GAAG,GAAG,CAAC,MAAxB,EAAgC,CAAC,EAAjC,EAAqC;AACnC,QAAM,CAAC,GAAG,GAAG,CAAC,UAAJ,CAAe,CAAf,CAAV;;AACA,QAAI,CAAC,GAAG,GAAR,EAAa;AACX,MAAA,CAAC;AACF,KAFD,MAEO,IAAI,CAAC,GAAG,IAAR,EAAc;AACnB,MAAA,CAAC,IAAI,CAAL;AACD,KAFM,MAEA,IAAI,CAAC,IAAI,MAAL,IAAe,CAAC,IAAI,MAAxB,EAAgC;;AAErC,MAAA,CAAC,IAAI,CAAL;AACA,MAAA,CAAC,GAHoC,CAGjC;AACL,KAJM,MAIA;AACL,MAAA,CAAC,IAAI,CAAL;AACD;AACF;;AACD,SAAO,CAAP;AACF,C;AC1FA;;;;;;;;;;;;;;;;;AAiBA;;;;;AAGA,IAAM,uBAAuB,GAAG,IAAhC;AAEA;;;;;AAIA,IAAM,sBAAsB,GAAG,CAA/B;AAEA;;;;;;IAKa,gBAAgB,GAAG,IAAI,EAAJ,GAAS,EAAT,GAAc,I,EAAK;;AAEnD;;;;;;;;;IAQa,aAAa,GAAG,G;AAE7B;;;;;;SAKgB,sB,CACd,Y,EACA,c,EACA,a,EAA8C;AAD9C,MAAA,cAAA,KAAA,KAAA,CAAA,EAAA;AAAA,IAAA,cAAA,GAAA,uBAAA;AAAgD;;AAChD,MAAA,aAAA,KAAA,KAAA,CAAA,EAAA;AAAA,IAAA,aAAA,GAAA,sBAAA;AAA8C,GAAA,C;;;;;AAK9C,MAAM,aAAa,GAAG,cAAc,GAAG,IAAI,CAAC,GAAL,CAAS,aAAT,EAAwB,YAAxB,CAAvC,CAL8C,C;;;AAS9C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAL,E;;AAGjB,EAAA,aAAa,GACX,aADF,K;;AAIG,EAAA,IAAI,CAAC,MAAL,KAAgB,GAJnB,IAKE,CARe,CAAnB,CAT8C,C;;AAqB9C,SAAO,IAAI,CAAC,GAAL,CAAS,gBAAT,EAA2B,aAAa,GAAG,UAA3C,CAAP;AACF;AC3EA;;;;;;;;;;;;;;;;;AAiBA;;;;;SAGgB,O,CAAQ,C,EAAS;AAC/B,MAAI,CAAC,MAAM,CAAC,QAAP,CAAgB,CAAhB,CAAL,EAAyB;AACvB,WAAO,KAAG,CAAV;AACD;;AACD,SAAO,CAAC,GAAG,SAAS,CAAC,CAAD,CAApB;AACD;;AAED,SAAS,SAAT,CAAmB,CAAnB,EAA4B;AAC1B,EAAA,CAAC,GAAG,IAAI,CAAC,GAAL,CAAS,CAAT,CAAJ;AACA,MAAM,IAAI,GAAG,CAAC,GAAG,GAAjB;;AACA,MAAI,IAAI,IAAI,EAAR,IAAc,IAAI,IAAI,EAA1B,EAA8B;AAC5B,WAAO,IAAP;AACD;;AACD,MAAM,GAAG,GAAG,CAAC,GAAG,EAAhB;;AACA,MAAI,GAAG,KAAK,CAAZ,EAAe;AACb,WAAO,IAAP;AACD;;AACD,MAAI,GAAG,KAAK,CAAZ,EAAe;AACb,WAAO,IAAP;AACD;;AACD,MAAI,GAAG,KAAK,CAAZ,EAAe;AACb,WAAO,IAAP;AACD;;AACD,SAAO,IAAP;AACF;AC5CA;;;;;;;;;;;;;;;;;;SAqBgB,kB,CACd,O,EAAwC;AAExC,MAAI,OAAO,IAAK,OAA8B,CAAC,SAA/C,EAA0D;AACxD,WAAQ,OAA8B,CAAC,SAAvC;AACD,GAFD,MAEO;AACL,WAAO,OAAP;AACD;AACH","sourcesContent":["/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview Firebase constants. Some of these (@defines) can be overridden at compile-time.\n */\n\nexport const CONSTANTS = {\n /**\n * @define {boolean} Whether this is the client Node.js SDK.\n */\n NODE_CLIENT: false,\n /**\n * @define {boolean} Whether this is the Admin Node.js SDK.\n */\n NODE_ADMIN: false,\n\n /**\n * Firebase SDK Version\n */\n SDK_VERSION: '${JSCORE_VERSION}'\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CONSTANTS } from './constants';\n\n/**\n * Throws an error if the provided assertion is falsy\n */\nexport const assert = function (assertion: unknown, message: string): void {\n if (!assertion) {\n throw assertionError(message);\n }\n};\n\n/**\n * Returns an Error object suitable for throwing.\n */\nexport const assertionError = function (message: string): Error {\n return new Error(\n 'Firebase Database (' +\n CONSTANTS.SDK_VERSION +\n ') INTERNAL ASSERT FAILED: ' +\n message\n );\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nconst stringToByteArray = function (str: string): number[] {\n // TODO(user): Use native implementations if/when available\n const out: number[] = [];\n let p = 0;\n for (let i = 0; i < str.length; i++) {\n let c = str.charCodeAt(i);\n if (c < 128) {\n out[p++] = c;\n } else if (c < 2048) {\n out[p++] = (c >> 6) | 192;\n out[p++] = (c & 63) | 128;\n } else if (\n (c & 0xfc00) === 0xd800 &&\n i + 1 < str.length &&\n (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00\n ) {\n // Surrogate Pair\n c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);\n out[p++] = (c >> 18) | 240;\n out[p++] = ((c >> 12) & 63) | 128;\n out[p++] = ((c >> 6) & 63) | 128;\n out[p++] = (c & 63) | 128;\n } else {\n out[p++] = (c >> 12) | 224;\n out[p++] = ((c >> 6) & 63) | 128;\n out[p++] = (c & 63) | 128;\n }\n }\n return out;\n};\n\n/**\n * Turns an array of numbers into the string given by the concatenation of the\n * characters to which the numbers correspond.\n * @param bytes Array of numbers representing characters.\n * @return Stringification of the array.\n */\nconst byteArrayToString = function (bytes: number[]): string {\n // TODO(user): Use native implementations if/when available\n const out: string[] = [];\n let pos = 0,\n c = 0;\n while (pos < bytes.length) {\n const c1 = bytes[pos++];\n if (c1 < 128) {\n out[c++] = String.fromCharCode(c1);\n } else if (c1 > 191 && c1 < 224) {\n const c2 = bytes[pos++];\n out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));\n } else if (c1 > 239 && c1 < 365) {\n // Surrogate Pair\n const c2 = bytes[pos++];\n const c3 = bytes[pos++];\n const c4 = bytes[pos++];\n const u =\n (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -\n 0x10000;\n out[c++] = String.fromCharCode(0xd800 + (u >> 10));\n out[c++] = String.fromCharCode(0xdc00 + (u & 1023));\n } else {\n const c2 = bytes[pos++];\n const c3 = bytes[pos++];\n out[c++] = String.fromCharCode(\n ((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)\n );\n }\n }\n return out.join('');\n};\n\ninterface Base64 {\n byteToCharMap_: { [key: number]: string } | null;\n charToByteMap_: { [key: string]: number } | null;\n byteToCharMapWebSafe_: { [key: number]: string } | null;\n charToByteMapWebSafe_: { [key: string]: number } | null;\n ENCODED_VALS_BASE: string;\n readonly ENCODED_VALS: string;\n readonly ENCODED_VALS_WEBSAFE: string;\n HAS_NATIVE_SUPPORT: boolean;\n encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string;\n encodeString(input: string, webSafe?: boolean): string;\n decodeString(input: string, webSafe: boolean): string;\n decodeStringToByteArray(input: string, webSafe: boolean): number[];\n init_(): void;\n}\n\n// We define it as an object literal instead of a class because a class compiled down to es5 can't\n// be treeshaked. https://github.com/rollup/rollup/issues/1691\n// Static lookup maps, lazily populated by init_()\nexport const base64: Base64 = {\n /**\n * Maps bytes to characters.\n */\n byteToCharMap_: null,\n\n /**\n * Maps characters to bytes.\n */\n charToByteMap_: null,\n\n /**\n * Maps bytes to websafe characters.\n * @private\n */\n byteToCharMapWebSafe_: null,\n\n /**\n * Maps websafe characters to bytes.\n * @private\n */\n charToByteMapWebSafe_: null,\n\n /**\n * Our default alphabet, shared between\n * ENCODED_VALS and ENCODED_VALS_WEBSAFE\n */\n ENCODED_VALS_BASE:\n 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',\n\n /**\n * Our default alphabet. Value 64 (=) is special; it means \"nothing.\"\n */\n get ENCODED_VALS() {\n return this.ENCODED_VALS_BASE + '+/=';\n },\n\n /**\n * Our websafe alphabet.\n */\n get ENCODED_VALS_WEBSAFE() {\n return this.ENCODED_VALS_BASE + '-_.';\n },\n\n /**\n * Whether this browser supports the atob and btoa functions. This extension\n * started at Mozilla but is now implemented by many browsers. We use the\n * ASSUME_* variables to avoid pulling in the full useragent detection library\n * but still allowing the standard per-browser compilations.\n *\n */\n HAS_NATIVE_SUPPORT: typeof atob === 'function',\n\n /**\n * Base64-encode an array of bytes.\n *\n * @param input An array of bytes (numbers with\n * value in [0, 255]) to encode.\n * @param webSafe Boolean indicating we should use the\n * alternative alphabet.\n * @return The base64 encoded string.\n */\n encodeByteArray(input: number[] | Uint8Array, webSafe?: boolean): string {\n if (!Array.isArray(input)) {\n throw Error('encodeByteArray takes an array as a parameter');\n }\n\n this.init_();\n\n const byteToCharMap = webSafe\n ? this.byteToCharMapWebSafe_!\n : this.byteToCharMap_!;\n\n const output = [];\n\n for (let i = 0; i < input.length; i += 3) {\n const byte1 = input[i];\n const haveByte2 = i + 1 < input.length;\n const byte2 = haveByte2 ? input[i + 1] : 0;\n const haveByte3 = i + 2 < input.length;\n const byte3 = haveByte3 ? input[i + 2] : 0;\n\n const outByte1 = byte1 >> 2;\n const outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);\n let outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);\n let outByte4 = byte3 & 0x3f;\n\n if (!haveByte3) {\n outByte4 = 64;\n\n if (!haveByte2) {\n outByte3 = 64;\n }\n }\n\n output.push(\n byteToCharMap[outByte1],\n byteToCharMap[outByte2],\n byteToCharMap[outByte3],\n byteToCharMap[outByte4]\n );\n }\n\n return output.join('');\n },\n\n /**\n * Base64-encode a string.\n *\n * @param input A string to encode.\n * @param webSafe If true, we should use the\n * alternative alphabet.\n * @return The base64 encoded string.\n */\n encodeString(input: string, webSafe?: boolean): string {\n // Shortcut for Mozilla browsers that implement\n // a native base64 encoder in the form of \"btoa/atob\"\n if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n return btoa(input);\n }\n return this.encodeByteArray(stringToByteArray(input), webSafe);\n },\n\n /**\n * Base64-decode a string.\n *\n * @param input to decode.\n * @param webSafe True if we should use the\n * alternative alphabet.\n * @return string representing the decoded value.\n */\n decodeString(input: string, webSafe: boolean): string {\n // Shortcut for Mozilla browsers that implement\n // a native base64 encoder in the form of \"btoa/atob\"\n if (this.HAS_NATIVE_SUPPORT && !webSafe) {\n return atob(input);\n }\n return byteArrayToString(this.decodeStringToByteArray(input, webSafe));\n },\n\n /**\n * Base64-decode a string.\n *\n * In base-64 decoding, groups of four characters are converted into three\n * bytes. If the encoder did not apply padding, the input length may not\n * be a multiple of 4.\n *\n * In this case, the last group will have fewer than 4 characters, and\n * padding will be inferred. If the group has one or two characters, it decodes\n * to one byte. If the group has three characters, it decodes to two bytes.\n *\n * @param input Input to decode.\n * @param webSafe True if we should use the web-safe alphabet.\n * @return bytes representing the decoded value.\n */\n decodeStringToByteArray(input: string, webSafe: boolean): number[] {\n this.init_();\n\n const charToByteMap = webSafe\n ? this.charToByteMapWebSafe_!\n : this.charToByteMap_!;\n\n const output: number[] = [];\n\n for (let i = 0; i < input.length; ) {\n const byte1 = charToByteMap[input.charAt(i++)];\n\n const haveByte2 = i < input.length;\n const byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;\n ++i;\n\n const haveByte3 = i < input.length;\n const byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;\n ++i;\n\n const haveByte4 = i < input.length;\n const byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;\n ++i;\n\n if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {\n throw Error();\n }\n\n const outByte1 = (byte1 << 2) | (byte2 >> 4);\n output.push(outByte1);\n\n if (byte3 !== 64) {\n const outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);\n output.push(outByte2);\n\n if (byte4 !== 64) {\n const outByte3 = ((byte3 << 6) & 0xc0) | byte4;\n output.push(outByte3);\n }\n }\n }\n\n return output;\n },\n\n /**\n * Lazy static initialization function. Called before\n * accessing any of the static map variables.\n * @private\n */\n init_() {\n if (!this.byteToCharMap_) {\n this.byteToCharMap_ = {};\n this.charToByteMap_ = {};\n this.byteToCharMapWebSafe_ = {};\n this.charToByteMapWebSafe_ = {};\n\n // We want quick mappings back and forth, so we precompute two maps.\n for (let i = 0; i < this.ENCODED_VALS.length; i++) {\n this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);\n this.charToByteMap_[this.byteToCharMap_[i]] = i;\n this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);\n this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;\n\n // Be forgiving when decoding and correctly decode both encodings.\n if (i >= this.ENCODED_VALS_BASE.length) {\n this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;\n this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;\n }\n }\n }\n }\n};\n\n/**\n * URL-safe base64 encoding\n */\nexport const base64Encode = function (str: string): string {\n const utf8Bytes = stringToByteArray(str);\n return base64.encodeByteArray(utf8Bytes, true);\n};\n\n/**\n * URL-safe base64 decoding\n *\n * NOTE: DO NOT use the global atob() function - it does NOT support the\n * base64Url variant encoding.\n *\n * @param str To be decoded\n * @return Decoded result, if possible\n */\nexport const base64Decode = function (str: string): string | null {\n try {\n return base64.decodeString(str, true);\n } catch (e) {\n console.error('base64Decode failed: ', e);\n }\n return null;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Do a deep-copy of basic JavaScript Objects or Arrays.\n */\nexport function deepCopy<T>(value: T): T {\n return deepExtend(undefined, value) as T;\n}\n\n/**\n * Copy properties from source to target (recursively allows extension\n * of Objects and Arrays). Scalar values in the target are over-written.\n * If target is undefined, an object of the appropriate type will be created\n * (and returned).\n *\n * We recursively copy all child properties of plain Objects in the source- so\n * that namespace- like dictionaries are merged.\n *\n * Note that the target can be a function, in which case the properties in\n * the source Object are copied onto it as static properties of the Function.\n *\n * Note: we don't merge __proto__ to prevent prototype pollution\n */\nexport function deepExtend(target: unknown, source: unknown): unknown {\n if (!(source instanceof Object)) {\n return source;\n }\n\n switch (source.constructor) {\n case Date:\n // Treat Dates like scalars; if the target date object had any child\n // properties - they will be lost!\n const dateValue = source as Date;\n return new Date(dateValue.getTime());\n\n case Object:\n if (target === undefined) {\n target = {};\n }\n break;\n case Array:\n // Always copy the array source and overwrite the target.\n target = [];\n break;\n\n default:\n // Not a plain Object - treat it as a scalar.\n return source;\n }\n\n for (const prop in source) {\n // use isValidKey to guard against prototype pollution. See https://snyk.io/vuln/SNYK-JS-LODASH-450202\n if (!source.hasOwnProperty(prop) || !isValidKey(prop)) {\n continue;\n }\n (target as Record<string, unknown>)[prop] = deepExtend(\n (target as Record<string, unknown>)[prop],\n (source as Record<string, unknown>)[prop]\n );\n }\n\n return target;\n}\n\nfunction isValidKey(key: string): boolean {\n return key !== '__proto__';\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport class Deferred<R> {\n promise: Promise<R>;\n reject: (value?: unknown) => void = () => {};\n resolve: (value?: unknown) => void = () => {};\n constructor() {\n this.promise = new Promise((resolve, reject) => {\n this.resolve = resolve as (value?: unknown) => void;\n this.reject = reject as (value?: unknown) => void;\n });\n }\n\n /**\n * Our API internals are not promiseified and cannot because our callback APIs have subtle expectations around\n * invoking promises inline, which Promises are forbidden to do. This method accepts an optional node-style callback\n * and returns a node-style callback which will resolve or reject the Deferred's promise.\n */\n wrapCallback(\n callback?: (error?: unknown, value?: unknown) => void\n ): (error: unknown, value?: unknown) => void {\n return (error, value?) => {\n if (error) {\n this.reject(error);\n } else {\n this.resolve(value);\n }\n if (typeof callback === 'function') {\n // Attaching noop handler just in case developer wasn't expecting\n // promises\n this.promise.catch(() => {});\n\n // Some of our callbacks don't expect a value and our own tests\n // assert that the parameter length is 1\n if (callback.length === 1) {\n callback(error);\n } else {\n callback(error, value);\n }\n }\n };\n }\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64 } from './crypt';\n\n// Firebase Auth tokens contain snake_case claims following the JWT standard / convention.\n/* eslint-disable camelcase */\n\nexport type FirebaseSignInProvider =\n | 'custom'\n | 'email'\n | 'password'\n | 'phone'\n | 'anonymous'\n | 'google.com'\n | 'facebook.com'\n | 'github.com'\n | 'twitter.com'\n | 'microsoft.com'\n | 'apple.com';\n\ninterface FirebaseIdToken {\n // Always set to https://securetoken.google.com/PROJECT_ID\n iss: string;\n\n // Always set to PROJECT_ID\n aud: string;\n\n // The user's unique ID\n sub: string;\n\n // The token issue time, in seconds since epoch\n iat: number;\n\n // The token expiry time, normally 'iat' + 3600\n exp: number;\n\n // The user's unique ID. Must be equal to 'sub'\n user_id: string;\n\n // The time the user authenticated, normally 'iat'\n auth_time: number;\n\n // The sign in provider, only set when the provider is 'anonymous'\n provider_id?: 'anonymous';\n\n // The user's primary email\n email?: string;\n\n // The user's email verification status\n email_verified?: boolean;\n\n // The user's primary phone number\n phone_number?: string;\n\n // The user's display name\n name?: string;\n\n // The user's profile photo URL\n picture?: string;\n\n // Information on all identities linked to this user\n firebase: {\n // The primary sign-in provider\n sign_in_provider: FirebaseSignInProvider;\n\n // A map of providers to the user's list of unique identifiers from\n // each provider\n identities?: { [provider in FirebaseSignInProvider]?: string[] };\n };\n\n // Custom claims set by the developer\n [claim: string]: unknown;\n\n uid?: never; // Try to catch a common mistake of \"uid\" (should be \"sub\" instead).\n}\n\nexport type EmulatorMockTokenOptions = ({ user_id: string } | { sub: string }) &\n Partial<FirebaseIdToken>;\n\nexport function createMockUserToken(\n token: EmulatorMockTokenOptions,\n projectId?: string\n): string {\n if (token.uid) {\n throw new Error(\n 'The \"uid\" field is no longer supported by mockUserToken. Please use \"sub\" instead for Firebase Auth User ID.'\n );\n }\n // Unsecured JWTs use \"none\" as the algorithm.\n const header = {\n alg: 'none',\n type: 'JWT'\n };\n\n const project = projectId || 'demo-project';\n const iat = token.iat || 0;\n const sub = token.sub || token.user_id;\n if (!sub) {\n throw new Error(\"mockUserToken must contain 'sub' or 'user_id' field!\");\n }\n\n const payload: FirebaseIdToken = {\n // Set all required fields to decent defaults\n iss: `https://securetoken.google.com/${project}`,\n aud: project,\n iat,\n exp: iat + 3600,\n auth_time: iat,\n sub,\n user_id: sub,\n firebase: {\n sign_in_provider: 'custom',\n identities: {}\n },\n\n // Override with user options\n ...token\n };\n\n // Unsecured JWTs use the empty string as a signature.\n const signature = '';\n return [\n base64.encodeString(JSON.stringify(header), /*webSafe=*/ false),\n base64.encodeString(JSON.stringify(payload), /*webSafe=*/ false),\n signature\n ].join('.');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { CONSTANTS } from './constants';\n\n/**\n * Returns navigator.userAgent string or '' if it's not defined.\n * @return user agent string\n */\nexport function getUA(): string {\n if (\n typeof navigator !== 'undefined' &&\n typeof navigator['userAgent'] === 'string'\n ) {\n return navigator['userAgent'];\n } else {\n return '';\n }\n}\n\n/**\n * Detect Cordova / PhoneGap / Ionic frameworks on a mobile device.\n *\n * Deliberately does not rely on checking `file://` URLs (as this fails PhoneGap\n * in the Ripple emulator) nor Cordova `onDeviceReady`, which would normally\n * wait for a callback.\n */\nexport function isMobileCordova(): boolean {\n return (\n typeof window !== 'undefined' &&\n // @ts-ignore Setting up an broadly applicable index signature for Window\n // just to deal with this case would probably be a bad idea.\n !!(window['cordova'] || window['phonegap'] || window['PhoneGap']) &&\n /ios|iphone|ipod|ipad|android|blackberry|iemobile/i.test(getUA())\n );\n}\n\n/**\n * Detect Node.js.\n *\n * @return true if Node.js environment is detected.\n */\n// Node detection logic from: https://github.com/iliakan/detect-node/\nexport function isNode(): boolean {\n try {\n return (\n Object.prototype.toString.call(global.process) === '[object process]'\n );\n } catch (e) {\n return false;\n }\n}\n\n/**\n * Detect Browser Environment\n */\nexport function isBrowser(): boolean {\n return typeof self === 'object' && self.self === self;\n}\n\n/**\n * Detect browser extensions (Chrome and Firefox at least).\n */\ninterface BrowserRuntime {\n id?: unknown;\n}\ndeclare const chrome: { runtime?: BrowserRuntime };\ndeclare const browser: { runtime?: BrowserRuntime };\nexport function isBrowserExtension(): boolean {\n const runtime =\n typeof chrome === 'object'\n ? chrome.runtime\n : typeof browser === 'object'\n ? browser.runtime\n : undefined;\n return typeof runtime === 'object' && runtime.id !== undefined;\n}\n\n/**\n * Detect React Native.\n *\n * @return true if ReactNative environment is detected.\n */\nexport function isReactNative(): boolean {\n return (\n typeof navigator === 'object' && navigator['product'] === 'ReactNative'\n );\n}\n\n/** Detects Electron apps. */\nexport function isElectron(): boolean {\n return getUA().indexOf('Electron/') >= 0;\n}\n\n/** Detects Internet Explorer. */\nexport function isIE(): boolean {\n const ua = getUA();\n return ua.indexOf('MSIE ') >= 0 || ua.indexOf('Trident/') >= 0;\n}\n\n/** Detects Universal Windows Platform apps. */\nexport function isUWP(): boolean {\n return getUA().indexOf('MSAppHost/') >= 0;\n}\n\n/**\n * Detect whether the current SDK build is the Node version.\n *\n * @return true if it's the Node SDK build.\n */\nexport function isNodeSdk(): boolean {\n return CONSTANTS.NODE_CLIENT === true || CONSTANTS.NODE_ADMIN === true;\n}\n\n/** Returns true if we are running in Safari. */\nexport function isSafari(): boolean {\n return (\n !isNode() &&\n navigator.userAgent.includes('Safari') &&\n !navigator.userAgent.includes('Chrome')\n );\n}\n\n/**\n * This method checks if indexedDB is supported by current browser/service worker context\n * @return true if indexedDB is supported by current browser/service worker context\n */\nexport function isIndexedDBAvailable(): boolean {\n return 'indexedDB' in self && indexedDB != null;\n}\n\n/**\n * This method validates browser/sw context for indexedDB by opening a dummy indexedDB database and reject\n * if errors occur during the database open operation.\n *\n * @throws exception if current browser/sw context can't run idb.open (ex: Safari iframe, Firefox\n * private browsing)\n */\nexport function validateIndexedDBOpenable(): Promise<boolean> {\n return new Promise((resolve, reject) => {\n try {\n let preExist: boolean = true;\n const DB_CHECK_NAME =\n 'validate-browser-context-for-indexeddb-analytics-module';\n const request = self.indexedDB.open(DB_CHECK_NAME);\n request.onsuccess = () => {\n request.result.close();\n // delete database only when it doesn't pre-exist\n if (!preExist) {\n self.indexedDB.deleteDatabase(DB_CHECK_NAME);\n }\n resolve(true);\n };\n request.onupgradeneeded = () => {\n preExist = false;\n };\n\n request.onerror = () => {\n reject(request.error?.message || '');\n };\n } catch (error) {\n reject(error);\n }\n });\n}\n\n/**\n *\n * This method checks whether cookie is enabled within current browser\n * @return true if cookie is enabled within current browser\n */\nexport function areCookiesEnabled(): boolean {\n if (!navigator || !navigator.cookieEnabled) {\n return false;\n }\n return true;\n}\n\n/**\n * Polyfill for `globalThis` object.\n * @returns the `globalThis` object for the given environment.\n */\nexport function getGlobal(): typeof globalThis {\n if (typeof self !== 'undefined') {\n return self;\n }\n if (typeof window !== 'undefined') {\n return window;\n }\n if (typeof global !== 'undefined') {\n return global;\n }\n throw new Error('Unable to locate global object.');\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @fileoverview Standardized Firebase Error.\n *\n * Usage:\n *\n * // Typescript string literals for type-safe codes\n * type Err =\n * 'unknown' |\n * 'object-not-found'\n * ;\n *\n * // Closure enum for type-safe error codes\n * // at-enum {string}\n * var Err = {\n * UNKNOWN: 'unknown',\n * OBJECT_NOT_FOUND: 'object-not-found',\n * }\n *\n * let errors: Map<Err, string> = {\n * 'generic-error': \"Unknown error\",\n * 'file-not-found': \"Could not find file: {$file}\",\n * };\n *\n * // Type-safe function - must pass a valid error code as param.\n * let error = new ErrorFactory<Err>('service', 'Service', errors);\n *\n * ...\n * throw error.create(Err.GENERIC);\n * ...\n * throw error.create(Err.FILE_NOT_FOUND, {'file': fileName});\n * ...\n * // Service: Could not file file: foo.txt (service/file-not-found).\n *\n * catch (e) {\n * assert(e.message === \"Could not find file: foo.txt.\");\n * if (e.code === 'service/file-not-found') {\n * console.log(\"Could not read file: \" + e['file']);\n * }\n * }\n */\n\nexport type ErrorMap<ErrorCode extends string> = {\n readonly [K in ErrorCode]: string;\n};\n\nconst ERROR_NAME = 'FirebaseError';\n\nexport interface StringLike {\n toString(): string;\n}\n\nexport interface ErrorData {\n [key: string]: unknown;\n}\n\n// Based on code from:\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types\nexport class FirebaseError extends Error {\n readonly name = ERROR_NAME;\n\n constructor(\n readonly code: string,\n message: string,\n public customData?: Record<string, unknown>\n ) {\n super(message);\n\n // Fix For ES5\n // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work\n Object.setPrototypeOf(this, FirebaseError.prototype);\n\n // Maintains proper stack trace for where our error was thrown.\n // Only available on V8.\n if (Error.captureStackTrace) {\n Error.captureStackTrace(this, ErrorFactory.prototype.create);\n }\n }\n}\n\nexport class ErrorFactory<\n ErrorCode extends string,\n ErrorParams extends { readonly [K in ErrorCode]?: ErrorData } = {}\n> {\n constructor(\n private readonly service: string,\n private readonly serviceName: string,\n private readonly errors: ErrorMap<ErrorCode>\n ) {}\n\n create<K extends ErrorCode>(\n code: K,\n ...data: K extends keyof ErrorParams ? [ErrorParams[K]] : []\n ): FirebaseError {\n const customData = (data[0] as ErrorData) || {};\n const fullCode = `${this.service}/${code}`;\n const template = this.errors[code];\n\n const message = template ? replaceTemplate(template, customData) : 'Error';\n // Service Name: Error message (service/code).\n const fullMessage = `${this.serviceName}: ${message} (${fullCode}).`;\n\n const error = new FirebaseError(fullCode, fullMessage, customData);\n\n return error;\n }\n}\n\nfunction replaceTemplate(template: string, data: ErrorData): string {\n return template.replace(PATTERN, (_, key) => {\n const value = data[key];\n return value != null ? String(value) : `<${key}?>`;\n });\n}\n\nconst PATTERN = /\\{\\$([^}]+)}/g;\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Evaluates a JSON string into a javascript object.\n *\n * @param {string} str A string containing JSON.\n * @return {*} The javascript object representing the specified JSON.\n */\nexport function jsonEval(str: string): unknown {\n return JSON.parse(str);\n}\n\n/**\n * Returns JSON representing a javascript object.\n * @param {*} data Javascript object to be stringified.\n * @return {string} The JSON contents of the object.\n */\nexport function stringify(data: unknown): string {\n return JSON.stringify(data);\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { base64Decode } from './crypt';\nimport { jsonEval } from './json';\n\ninterface Claims {\n [key: string]: {};\n}\n\ninterface DecodedToken {\n header: object;\n claims: Claims;\n data: object;\n signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token into constituent parts.\n *\n * Notes:\n * - May return with invalid / incomplete claims if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const decode = function (token: string): DecodedToken {\n let header = {},\n claims: Claims = {},\n data = {},\n signature = '';\n\n try {\n const parts = token.split('.');\n header = jsonEval(base64Decode(parts[0]) || '') as object;\n claims = jsonEval(base64Decode(parts[1]) || '') as Claims;\n signature = parts[2];\n data = claims['d'] || {};\n delete claims['d'];\n } catch (e) {}\n\n return {\n header,\n claims,\n data,\n signature\n };\n};\n\ninterface DecodedToken {\n header: object;\n claims: Claims;\n data: object;\n signature: string;\n}\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its time-based claims. Will return true if the\n * token is within the time window authorized by the 'nbf' (not-before) and 'iat' (issued-at) claims.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidTimestamp = function (token: string): boolean {\n const claims: Claims = decode(token).claims;\n const now: number = Math.floor(new Date().getTime() / 1000);\n let validSince: number = 0,\n validUntil: number = 0;\n\n if (typeof claims === 'object') {\n if (claims.hasOwnProperty('nbf')) {\n validSince = claims['nbf'] as number;\n } else if (claims.hasOwnProperty('iat')) {\n validSince = claims['iat'] as number;\n }\n\n if (claims.hasOwnProperty('exp')) {\n validUntil = claims['exp'] as number;\n } else {\n // token will expire after 24h by default\n validUntil = validSince + 86400;\n }\n }\n\n return (\n !!now &&\n !!validSince &&\n !!validUntil &&\n now >= validSince &&\n now <= validUntil\n );\n};\n\n/**\n * Decodes a Firebase auth. token and returns its issued at time if valid, null otherwise.\n *\n * Notes:\n * - May return null if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const issuedAtTime = function (token: string): number | null {\n const claims: Claims = decode(token).claims;\n if (typeof claims === 'object' && claims.hasOwnProperty('iat')) {\n return claims['iat'] as number;\n }\n return null;\n};\n\n/**\n * Decodes a Firebase auth. token and checks the validity of its format. Expects a valid issued-at time.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isValidFormat = function (token: string): boolean {\n const decoded = decode(token),\n claims = decoded.claims;\n\n return !!claims && typeof claims === 'object' && claims.hasOwnProperty('iat');\n};\n\n/**\n * Attempts to peer into an auth token and determine if it's an admin auth token by looking at the claims portion.\n *\n * Notes:\n * - May return a false negative if there's no native base64 decoding support.\n * - Doesn't check if the token is actually valid.\n */\nexport const isAdmin = function (token: string): boolean {\n const claims: Claims = decode(token).claims;\n return typeof claims === 'object' && claims['admin'] === true;\n};\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport function contains<T extends object>(obj: T, key: string): boolean {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexport function safeGet<T extends object, K extends keyof T>(\n obj: T,\n key: K\n): T[K] | undefined {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n return obj[key];\n } else {\n return undefined;\n }\n}\n\nexport function isEmpty(obj: object): obj is {} {\n for (const key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n return false;\n }\n }\n return true;\n}\n\nexport function map<K extends string, V, U>(\n obj: { [key in K]: V },\n fn: (value: V, key: K, obj: { [key in K]: V }) => U,\n contextObj?: unknown\n): { [key in K]: U } {\n const res: Partial<{ [key in K]: U }> = {};\n for (const key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) {\n res[key] = fn.call(contextObj, obj[key], key, obj);\n }\n }\n return res as { [key in K]: U };\n}\n\n/**\n * Deep equal two objects. Support Arrays and Objects.\n */\nexport function deepEqual(a: object, b: object): boolean {\n if (a === b) {\n return true;\n }\n\n const aKeys = Object.keys(a);\n const bKeys = Object.keys(b);\n for (const k of aKeys) {\n if (!bKeys.includes(k)) {\n return false;\n }\n\n const aProp = (a as Record<string, unknown>)[k];\n const bProp = (b as Record<string, unknown>)[k];\n if (isObject(aProp) && isObject(bProp)) {\n if (!deepEqual(aProp, bProp)) {\n return false;\n }\n } else if (aProp !== bProp) {\n return false;\n }\n }\n\n for (const k of bKeys) {\n if (!aKeys.includes(k)) {\n return false;\n }\n }\n return true;\n}\n\nfunction isObject(thing: unknown): thing is object {\n return thing !== null && typeof thing === 'object';\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Returns a querystring-formatted string (e.g. &arg=val&arg2=val2) from a\n * params object (e.g. {arg: 'val', arg2: 'val2'})\n * Note: You must prepend it with ? when adding it to a URL.\n */\nexport function querystring(querystringParams: {\n [key: string]: string | number;\n}): string {\n const params = [];\n for (const [key, value] of Object.entries(querystringParams)) {\n if (Array.isArray(value)) {\n value.forEach(arrayVal => {\n params.push(\n encodeURIComponent(key) + '=' + encodeURIComponent(arrayVal)\n );\n });\n } else {\n params.push(encodeURIComponent(key) + '=' + encodeURIComponent(value));\n }\n }\n return params.length ? '&' + params.join('&') : '';\n}\n\n/**\n * Decodes a querystring (e.g. ?arg=val&arg2=val2) into a params object\n * (e.g. {arg: 'val', arg2: 'val2'})\n */\nexport function querystringDecode(querystring: string): Record<string, string> {\n const obj: Record<string, string> = {};\n const tokens = querystring.replace(/^\\?/, '').split('&');\n\n tokens.forEach(token => {\n if (token) {\n const [key, value] = token.split('=');\n obj[decodeURIComponent(key)] = decodeURIComponent(value);\n }\n });\n return obj;\n}\n\n/**\n * Extract the query string part of a URL, including the leading question mark (if present).\n */\nexport function extractQuerystring(url: string): string {\n const queryStart = url.indexOf('?');\n if (!queryStart) {\n return '';\n }\n const fragmentStart = url.indexOf('#', queryStart);\n return url.substring(\n queryStart,\n fragmentStart > 0 ? fragmentStart : undefined\n );\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * @fileoverview SHA-1 cryptographic hash.\n * Variable names follow the notation in FIPS PUB 180-3:\n * http://csrc.nist.gov/publications/fips/fips180-3/fips180-3_final.pdf.\n *\n * Usage:\n * var sha1 = new sha1();\n * sha1.update(bytes);\n * var hash = sha1.digest();\n *\n * Performance:\n * Chrome 23: ~400 Mbit/s\n * Firefox 16: ~250 Mbit/s\n *\n */\n\n/**\n * SHA-1 cryptographic hash constructor.\n *\n * The properties declared here are discussed in the above algorithm document.\n * @constructor\n * @final\n * @struct\n */\nexport class Sha1 {\n /**\n * Holds the previous values of accumulated variables a-e in the compress_\n * function.\n * @private\n */\n private chain_: number[] = [];\n\n /**\n * A buffer holding the partially computed hash result.\n * @private\n */\n private buf_: number[] = [];\n\n /**\n * An array of 80 bytes, each a part of the message to be hashed. Referred to\n * as the message schedule in the docs.\n * @private\n */\n private W_: number[] = [];\n\n /**\n * Contains data needed to pad messages less than 64 bytes.\n * @private\n */\n private pad_: number[] = [];\n\n /**\n * @private {number}\n */\n private inbuf_: number = 0;\n\n /**\n * @private {number}\n */\n private total_: number = 0;\n\n blockSize: number;\n\n constructor() {\n this.blockSize = 512 / 8;\n\n this.pad_[0] = 128;\n for (let i = 1; i < this.blockSize; ++i) {\n this.pad_[i] = 0;\n }\n\n this.reset();\n }\n\n reset(): void {\n this.chain_[0] = 0x67452301;\n this.chain_[1] = 0xefcdab89;\n this.chain_[2] = 0x98badcfe;\n this.chain_[3] = 0x10325476;\n this.chain_[4] = 0xc3d2e1f0;\n\n this.inbuf_ = 0;\n this.total_ = 0;\n }\n\n /**\n * Internal compress helper function.\n * @param buf Block to compress.\n * @param offset Offset of the block in the buffer.\n * @private\n */\n compress_(buf: number[] | Uint8Array | string, offset?: number): void {\n if (!offset) {\n offset = 0;\n }\n\n const W = this.W_;\n\n // get 16 big endian words\n if (typeof buf === 'string') {\n for (let i = 0; i < 16; i++) {\n // TODO(user): [bug 8140122] Recent versions of Safari for Mac OS and iOS\n // have a bug that turns the post-increment ++ operator into pre-increment\n // during JIT compilation. We have code that depends heavily on SHA-1 for\n // correctness and which is affected by this bug, so I've removed all uses\n // of post-increment ++ in which the result value is used. We can revert\n // this change once the Safari bug\n // (https://bugs.webkit.org/show_bug.cgi?id=109036) has been fixed and\n // most clients have been updated.\n W[i] =\n (buf.charCodeAt(offset) << 24) |\n (buf.charCodeAt(offset + 1) << 16) |\n (buf.charCodeAt(offset + 2) << 8) |\n buf.charCodeAt(offset + 3);\n offset += 4;\n }\n } else {\n for (let i = 0; i < 16; i++) {\n W[i] =\n (buf[offset] << 24) |\n (buf[offset + 1] << 16) |\n (buf[offset + 2] << 8) |\n buf[offset + 3];\n offset += 4;\n }\n }\n\n // expand to 80 words\n for (let i = 16; i < 80; i++) {\n const t = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];\n W[i] = ((t << 1) | (t >>> 31)) & 0xffffffff;\n }\n\n let a = this.chain_[0];\n let b = this.chain_[1];\n let c = this.chain_[2];\n let d = this.chain_[3];\n let e = this.chain_[4];\n let f, k;\n\n // TODO(user): Try to unroll this loop to speed up the computation.\n for (let i = 0; i < 80; i++) {\n if (i < 40) {\n if (i < 20) {\n f = d ^ (b & (c ^ d));\n k = 0x5a827999;\n } else {\n f = b ^ c ^ d;\n k = 0x6ed9eba1;\n }\n } else {\n if (i < 60) {\n f = (b & c) | (d & (b | c));\n k = 0x8f1bbcdc;\n } else {\n f = b ^ c ^ d;\n k = 0xca62c1d6;\n }\n }\n\n const t = (((a << 5) | (a >>> 27)) + f + e + k + W[i]) & 0xffffffff;\n e = d;\n d = c;\n c = ((b << 30) | (b >>> 2)) & 0xffffffff;\n b = a;\n a = t;\n }\n\n this.chain_[0] = (this.chain_[0] + a) & 0xffffffff;\n this.chain_[1] = (this.chain_[1] + b) & 0xffffffff;\n this.chain_[2] = (this.chain_[2] + c) & 0xffffffff;\n this.chain_[3] = (this.chain_[3] + d) & 0xffffffff;\n this.chain_[4] = (this.chain_[4] + e) & 0xffffffff;\n }\n\n update(bytes?: number[] | Uint8Array | string, length?: number): void {\n // TODO(johnlenz): tighten the function signature and remove this check\n if (bytes == null) {\n return;\n }\n\n if (length === undefined) {\n length = bytes.length;\n }\n\n const lengthMinusBlock = length - this.blockSize;\n let n = 0;\n // Using local instead of member variables gives ~5% speedup on Firefox 16.\n const buf = this.buf_;\n let inbuf = this.inbuf_;\n\n // The outer while loop should execute at most twice.\n while (n < length) {\n // When we have no data in the block to top up, we can directly process the\n // input buffer (assuming it contains sufficient data). This gives ~25%\n // speedup on Chrome 23 and ~15% speedup on Firefox 16, but requires that\n // the data is provided in large chunks (or in multiples of 64 bytes).\n if (inbuf === 0) {\n while (n <= lengthMinusBlock) {\n this.compress_(bytes, n);\n n += this.blockSize;\n }\n }\n\n if (typeof bytes === 'string') {\n while (n < length) {\n buf[inbuf] = bytes.charCodeAt(n);\n ++inbuf;\n ++n;\n if (inbuf === this.blockSize) {\n this.compress_(buf);\n inbuf = 0;\n // Jump to the outer loop so we use the full-block optimization.\n break;\n }\n }\n } else {\n while (n < length) {\n buf[inbuf] = bytes[n];\n ++inbuf;\n ++n;\n if (inbuf === this.blockSize) {\n this.compress_(buf);\n inbuf = 0;\n // Jump to the outer loop so we use the full-block optimization.\n break;\n }\n }\n }\n }\n\n this.inbuf_ = inbuf;\n this.total_ += length;\n }\n\n /** @override */\n digest(): number[] {\n const digest: number[] = [];\n let totalBits = this.total_ * 8;\n\n // Add pad 0x80 0x00*.\n if (this.inbuf_ < 56) {\n this.update(this.pad_, 56 - this.inbuf_);\n } else {\n this.update(this.pad_, this.blockSize - (this.inbuf_ - 56));\n }\n\n // Add # bits.\n for (let i = this.blockSize - 1; i >= 56; i--) {\n this.buf_[i] = totalBits & 255;\n totalBits /= 256; // Don't use bit-shifting here!\n }\n\n this.compress_(this.buf_);\n\n let n = 0;\n for (let i = 0; i < 5; i++) {\n for (let j = 24; j >= 0; j -= 8) {\n digest[n] = (this.chain_[i] >> j) & 255;\n ++n;\n }\n }\n return digest;\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nexport type NextFn<T> = (value: T) => void;\nexport type ErrorFn = (error: Error) => void;\nexport type CompleteFn = () => void;\n\nexport interface Observer<T> {\n // Called once for each value in a stream of values.\n next: NextFn<T>;\n\n // A stream terminates by a single call to EITHER error() or complete().\n error: ErrorFn;\n\n // No events will be sent to next() once complete() is called.\n complete: CompleteFn;\n}\n\nexport type PartialObserver<T> = Partial<Observer<T>>;\n\n// TODO: Support also Unsubscribe.unsubscribe?\nexport type Unsubscribe = () => void;\n\n/**\n * The Subscribe interface has two forms - passing the inline function\n * callbacks, or a object interface with callback properties.\n */\nexport interface Subscribe<T> {\n (next?: NextFn<T>, error?: ErrorFn, complete?: CompleteFn): Unsubscribe;\n (observer: PartialObserver<T>): Unsubscribe;\n}\n\nexport interface Observable<T> {\n // Subscribe method\n subscribe: Subscribe<T>;\n}\n\nexport type Executor<T> = (observer: Observer<T>) => void;\n\n/**\n * Helper to make a Subscribe function (just like Promise helps make a\n * Thenable).\n *\n * @param executor Function which can make calls to a single Observer\n * as a proxy.\n * @param onNoObservers Callback when count of Observers goes to zero.\n */\nexport function createSubscribe<T>(\n executor: Executor<T>,\n onNoObservers?: Executor<T>\n): Subscribe<T> {\n const proxy = new ObserverProxy<T>(executor, onNoObservers);\n return proxy.subscribe.bind(proxy);\n}\n\n/**\n * Implement fan-out for any number of Observers attached via a subscribe\n * function.\n */\nclass ObserverProxy<T> implements Observer<T> {\n private observers: Array<Observer<T>> | undefined = [];\n private unsubscribes: Unsubscribe[] = [];\n private onNoObservers: Executor<T> | undefined;\n private observerCount = 0;\n // Micro-task scheduling by calling task.then().\n private task = Promise.resolve();\n private finalized = false;\n private finalError?: Error;\n\n /**\n * @param executor Function which can make calls to a single Observer\n * as a proxy.\n * @param onNoObservers Callback when count of Observers goes to zero.\n */\n constructor(executor: Executor<T>, onNoObservers?: Executor<T>) {\n this.onNoObservers = onNoObservers;\n // Call the executor asynchronously so subscribers that are called\n // synchronously after the creation of the subscribe function\n // can still receive the very first value generated in the executor.\n this.task\n .then(() => {\n executor(this);\n })\n .catch(e => {\n this.error(e);\n });\n }\n\n next(value: T): void {\n this.forEachObserver((observer: Observer<T>) => {\n observer.next(value);\n });\n }\n\n error(error: Error): void {\n this.forEachObserver((observer: Observer<T>) => {\n observer.error(error);\n });\n this.close(error);\n }\n\n complete(): void {\n this.forEachObserver((observer: Observer<T>) => {\n observer.complete();\n });\n this.close();\n }\n\n /**\n * Subscribe function that can be used to add an Observer to the fan-out list.\n *\n * - We require that no event is sent to a subscriber sychronously to their\n * call to subscribe().\n */\n subscribe(\n nextOrObserver?: NextFn<T> | PartialObserver<T>,\n error?: ErrorFn,\n complete?: CompleteFn\n ): Unsubscribe {\n let observer: Observer<T>;\n\n if (\n nextOrObserver === undefined &&\n error === undefined &&\n complete === undefined\n ) {\n throw new Error('Missing Observer.');\n }\n\n // Assemble an Observer object when passed as callback functions.\n if (\n implementsAnyMethods(nextOrObserver as { [key: string]: unknown }, [\n 'next',\n 'error',\n 'complete'\n ])\n ) {\n observer = nextOrObserver as Observer<T>;\n } else {\n observer = {\n next: nextOrObserver as NextFn<T>,\n error,\n complete\n } as Observer<T>;\n }\n\n if (observer.next === undefined) {\n observer.next = noop as NextFn<T>;\n }\n if (observer.error === undefined) {\n observer.error = noop as ErrorFn;\n }\n if (observer.complete === undefined) {\n observer.complete = noop as CompleteFn;\n }\n\n const unsub = this.unsubscribeOne.bind(this, this.observers!.length);\n\n // Attempt to subscribe to a terminated Observable - we\n // just respond to the Observer with the final error or complete\n // event.\n if (this.finalized) {\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n this.task.then(() => {\n try {\n if (this.finalError) {\n observer.error(this.finalError);\n } else {\n observer.complete();\n }\n } catch (e) {\n // nothing\n }\n return;\n });\n }\n\n this.observers!.push(observer as Observer<T>);\n\n return unsub;\n }\n\n // Unsubscribe is synchronous - we guarantee that no events are sent to\n // any unsubscribed Observer.\n private unsubscribeOne(i: number): void {\n if (this.observers === undefined || this.observers[i] === undefined) {\n return;\n }\n\n delete this.observers[i];\n\n this.observerCount -= 1;\n if (this.observerCount === 0 && this.onNoObservers !== undefined) {\n this.onNoObservers(this);\n }\n }\n\n private forEachObserver(fn: (observer: Observer<T>) => void): void {\n if (this.finalized) {\n // Already closed by previous event....just eat the additional values.\n return;\n }\n\n // Since sendOne calls asynchronously - there is no chance that\n // this.observers will become undefined.\n for (let i = 0; i < this.observers!.length; i++) {\n this.sendOne(i, fn);\n }\n }\n\n // Call the Observer via one of it's callback function. We are careful to\n // confirm that the observe has not been unsubscribed since this asynchronous\n // function had been queued.\n private sendOne(i: number, fn: (observer: Observer<T>) => void): void {\n // Execute the callback asynchronously\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n this.task.then(() => {\n if (this.observers !== undefined && this.observers[i] !== undefined) {\n try {\n fn(this.observers[i]);\n } catch (e) {\n // Ignore exceptions raised in Observers or missing methods of an\n // Observer.\n // Log error to console. b/31404806\n if (typeof console !== 'undefined' && console.error) {\n console.error(e);\n }\n }\n }\n });\n }\n\n private close(err?: Error): void {\n if (this.finalized) {\n return;\n }\n this.finalized = true;\n if (err !== undefined) {\n this.finalError = err;\n }\n // Proxy is no longer needed - garbage collect references\n // eslint-disable-next-line @typescript-eslint/no-floating-promises\n this.task.then(() => {\n this.observers = undefined;\n this.onNoObservers = undefined;\n });\n }\n}\n\n/** Turn synchronous function into one called asynchronously. */\n// eslint-disable-next-line @typescript-eslint/ban-types\nexport function async(fn: Function, onError?: ErrorFn): Function {\n return (...args: unknown[]) => {\n Promise.resolve(true)\n .then(() => {\n fn(...args);\n })\n .catch((error: Error) => {\n if (onError) {\n onError(error);\n }\n });\n };\n}\n\n/**\n * Return true if the object passed in implements any of the named methods.\n */\nfunction implementsAnyMethods(\n obj: { [key: string]: unknown },\n methods: string[]\n): boolean {\n if (typeof obj !== 'object' || obj === null) {\n return false;\n }\n\n for (const method of methods) {\n if (method in obj && typeof obj[method] === 'function') {\n return true;\n }\n }\n\n return false;\n}\n\nfunction noop(): void {\n // do nothing\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Check to make sure the appropriate number of arguments are provided for a public function.\n * Throws an error if it fails.\n *\n * @param fnName The function name\n * @param minCount The minimum number of arguments to allow for the function call\n * @param maxCount The maximum number of argument to allow for the function call\n * @param argCount The actual number of arguments provided.\n */\nexport const validateArgCount = function (\n fnName: string,\n minCount: number,\n maxCount: number,\n argCount: number\n): void {\n let argError;\n if (argCount < minCount) {\n argError = 'at least ' + minCount;\n } else if (argCount > maxCount) {\n argError = maxCount === 0 ? 'none' : 'no more than ' + maxCount;\n }\n if (argError) {\n const error =\n fnName +\n ' failed: Was called with ' +\n argCount +\n (argCount === 1 ? ' argument.' : ' arguments.') +\n ' Expects ' +\n argError +\n '.';\n throw new Error(error);\n }\n};\n\n/**\n * Generates a string to prefix an error message about failed argument validation\n *\n * @param fnName The function name\n * @param argName The name of the argument\n * @return The prefix to add to the error thrown for validation.\n */\nexport function errorPrefix(fnName: string, argName: string): string {\n return `${fnName} failed: ${argName} argument `;\n}\n\n/**\n * @param fnName\n * @param argumentNumber\n * @param namespace\n * @param optional\n */\nexport function validateNamespace(\n fnName: string,\n namespace: string,\n optional: boolean\n): void {\n if (optional && !namespace) {\n return;\n }\n if (typeof namespace !== 'string') {\n //TODO: I should do more validation here. We only allow certain chars in namespaces.\n throw new Error(\n errorPrefix(fnName, 'namespace') + 'must be a valid firebase namespace.'\n );\n }\n}\n\nexport function validateCallback(\n fnName: string,\n argumentName: string,\n // eslint-disable-next-line @typescript-eslint/ban-types\n callback: Function,\n optional: boolean\n): void {\n if (optional && !callback) {\n return;\n }\n if (typeof callback !== 'function') {\n throw new Error(\n errorPrefix(fnName, argumentName) + 'must be a valid function.'\n );\n }\n}\n\nexport function validateContextObject(\n fnName: string,\n argumentName: string,\n context: unknown,\n optional: boolean\n): void {\n if (optional && !context) {\n return;\n }\n if (typeof context !== 'object' || context === null) {\n throw new Error(\n errorPrefix(fnName, argumentName) + 'must be a valid context object.'\n );\n }\n}\n","/**\n * @license\n * Copyright 2017 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { assert } from './assert';\n\n// Code originally came from goog.crypt.stringToUtf8ByteArray, but for some reason they\n// automatically replaced '\\r\\n' with '\\n', and they didn't handle surrogate pairs,\n// so it's been modified.\n\n// Note that not all Unicode characters appear as single characters in JavaScript strings.\n// fromCharCode returns the UTF-16 encoding of a character - so some Unicode characters\n// use 2 characters in Javascript. All 4-byte UTF-8 characters begin with a first\n// character in the range 0xD800 - 0xDBFF (the first character of a so-called surrogate\n// pair).\n// See http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3\n\n/**\n * @param {string} str\n * @return {Array}\n */\nexport const stringToByteArray = function (str: string): number[] {\n const out: number[] = [];\n let p = 0;\n for (let i = 0; i < str.length; i++) {\n let c = str.charCodeAt(i);\n\n // Is this the lead surrogate in a surrogate pair?\n if (c >= 0xd800 && c <= 0xdbff) {\n const high = c - 0xd800; // the high 10 bits.\n i++;\n assert(i < str.length, 'Surrogate pair missing trail surrogate.');\n const low = str.charCodeAt(i) - 0xdc00; // the low 10 bits.\n c = 0x10000 + (high << 10) + low;\n }\n\n if (c < 128) {\n out[p++] = c;\n } else if (c < 2048) {\n out[p++] = (c >> 6) | 192;\n out[p++] = (c & 63) | 128;\n } else if (c < 65536) {\n out[p++] = (c >> 12) | 224;\n out[p++] = ((c >> 6) & 63) | 128;\n out[p++] = (c & 63) | 128;\n } else {\n out[p++] = (c >> 18) | 240;\n out[p++] = ((c >> 12) & 63) | 128;\n out[p++] = ((c >> 6) & 63) | 128;\n out[p++] = (c & 63) | 128;\n }\n }\n return out;\n};\n\n/**\n * Calculate length without actually converting; useful for doing cheaper validation.\n * @param {string} str\n * @return {number}\n */\nexport const stringLength = function (str: string): number {\n let p = 0;\n for (let i = 0; i < str.length; i++) {\n const c = str.charCodeAt(i);\n if (c < 128) {\n p++;\n } else if (c < 2048) {\n p += 2;\n } else if (c >= 0xd800 && c <= 0xdbff) {\n // Lead surrogate of a surrogate pair. The pair together will take 4 bytes to represent.\n p += 4;\n i++; // skip trail surrogate.\n } else {\n p += 3;\n }\n }\n return p;\n};\n","/**\n * @license\n * Copyright 2019 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * The amount of milliseconds to exponentially increase.\n */\nconst DEFAULT_INTERVAL_MILLIS = 1000;\n\n/**\n * The factor to backoff by.\n * Should be a number greater than 1.\n */\nconst DEFAULT_BACKOFF_FACTOR = 2;\n\n/**\n * The maximum milliseconds to increase to.\n *\n * <p>Visible for testing\n */\nexport const MAX_VALUE_MILLIS = 4 * 60 * 60 * 1000; // Four hours, like iOS and Android.\n\n/**\n * The percentage of backoff time to randomize by.\n * See\n * http://go/safe-client-behavior#step-1-determine-the-appropriate-retry-interval-to-handle-spike-traffic\n * for context.\n *\n * <p>Visible for testing\n */\nexport const RANDOM_FACTOR = 0.5;\n\n/**\n * Based on the backoff method from\n * https://github.com/google/closure-library/blob/master/closure/goog/math/exponentialbackoff.js.\n * Extracted here so we don't need to pass metadata and a stateful ExponentialBackoff object around.\n */\nexport function calculateBackoffMillis(\n backoffCount: number,\n intervalMillis: number = DEFAULT_INTERVAL_MILLIS,\n backoffFactor: number = DEFAULT_BACKOFF_FACTOR\n): number {\n // Calculates an exponentially increasing value.\n // Deviation: calculates value from count and a constant interval, so we only need to save value\n // and count to restore state.\n const currBaseValue = intervalMillis * Math.pow(backoffFactor, backoffCount);\n\n // A random \"fuzz\" to avoid waves of retries.\n // Deviation: randomFactor is required.\n const randomWait = Math.round(\n // A fraction of the backoff value to add/subtract.\n // Deviation: changes multiplication order to improve readability.\n RANDOM_FACTOR *\n currBaseValue *\n // A random float (rounded to int by Math.round above) in the range [-1, 1]. Determines\n // if we add or subtract.\n (Math.random() - 0.5) *\n 2\n );\n\n // Limits backoff to max to avoid effectively permanent backoff.\n return Math.min(MAX_VALUE_MILLIS, currBaseValue + randomWait);\n}\n","/**\n * @license\n * Copyright 2020 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Provide English ordinal letters after a number\n */\nexport function ordinal(i: number): string {\n if (!Number.isFinite(i)) {\n return `${i}`;\n }\n return i + indicator(i);\n}\n\nfunction indicator(i: number): string {\n i = Math.abs(i);\n const cent = i % 100;\n if (cent >= 10 && cent <= 20) {\n return 'th';\n }\n const dec = i % 10;\n if (dec === 1) {\n return 'st';\n }\n if (dec === 2) {\n return 'nd';\n }\n if (dec === 3) {\n return 'rd';\n }\n return 'th';\n}\n","/**\n * @license\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nexport interface Compat<T> {\n _delegate: T;\n}\n\nexport function getModularInstance<ExpService>(\n service: Compat<ExpService> | ExpService\n): ExpService {\n if (service && (service as Compat<ExpService>)._delegate) {\n return (service as Compat<ExpService>)._delegate;\n } else {\n return service as ExpService;\n }\n}\n"]},"metadata":{},"sourceType":"module"}