text: import { _getProvider, getApp, _removeServiceInstance, _registerComponent, registerVersion, SDK_VERSION } from 'https://www.gstatic.com/firebasejs/9.0.2/firebase-app.js';
  
  /*! *****************************************************************************
  Copyright (c) Microsoft Corporation.
  
  Permission to use, copy, modify, and/or distribute this software for any
  purpose with or without fee is hereby granted.
  
  THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
  REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
  AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
  INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
  LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
  OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  PERFORMANCE OF THIS SOFTWARE.
  ***************************************************************************** */
  /* global Reflect, Promise */
  
  var extendStatics = function(d, b) {
      extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
      return extendStatics(d, b);
  };
  
  function __extends(d, b) {
      if (typeof b !== "function" && b !== null)
          throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
      extendStatics(d, b);
      function __() { this.constructor = d; }
      d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
  }
  
  var __assign = function() {
      __assign = Object.assign || function __assign(t) {
          for (var s, i = 1, n = arguments.length; i < n; i++) {
              s = arguments[i];
              for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
          }
          return t;
      };
      return __assign.apply(this, arguments);
  };
  
  function __spreadArray(to, from) {
      for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
          to[j] = from[i];
      return to;
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  var stringToByteArray$1 = function (str) {
      // TODO(user): Use native implementations if/when available
      var out = [];
      var p = 0;
      for (var i = 0; i < str.length; i++) {
          var c = str.charCodeAt(i);
          if (c < 128) {
              out[p++] = c;
          }
          else if (c < 2048) {
              out[p++] = (c >> 6) | 192;
              out[p++] = (c & 63) | 128;
          }
          else if ((c & 0xfc00) === 0xd800 &&
              i + 1 < str.length &&
              (str.charCodeAt(i + 1) & 0xfc00) === 0xdc00) {
              // Surrogate Pair
              c = 0x10000 + ((c & 0x03ff) << 10) + (str.charCodeAt(++i) & 0x03ff);
              out[p++] = (c >> 18) | 240;
              out[p++] = ((c >> 12) & 63) | 128;
              out[p++] = ((c >> 6) & 63) | 128;
              out[p++] = (c & 63) | 128;
          }
          else {
              out[p++] = (c >> 12) | 224;
              out[p++] = ((c >> 6) & 63) | 128;
              out[p++] = (c & 63) | 128;
          }
      }
      return out;
  };
  /**
   * Turns an array of numbers into the string given by the concatenation of the
   * characters to which the numbers correspond.
   * @param bytes Array of numbers representing characters.
   * @return Stringification of the array.
   */
  var byteArrayToString = function (bytes) {
      // TODO(user): Use native implementations if/when available
      var out = [];
      var pos = 0, c = 0;
      while (pos < bytes.length) {
          var c1 = bytes[pos++];
          if (c1 < 128) {
              out[c++] = String.fromCharCode(c1);
          }
          else if (c1 > 191 && c1 < 224) {
              var c2 = bytes[pos++];
              out[c++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63));
          }
          else if (c1 > 239 && c1 < 365) {
              // Surrogate Pair
              var c2 = bytes[pos++];
              var c3 = bytes[pos++];
              var c4 = bytes[pos++];
              var u = (((c1 & 7) << 18) | ((c2 & 63) << 12) | ((c3 & 63) << 6) | (c4 & 63)) -
                  0x10000;
              out[c++] = String.fromCharCode(0xd800 + (u >> 10));
              out[c++] = String.fromCharCode(0xdc00 + (u & 1023));
          }
          else {
              var c2 = bytes[pos++];
              var c3 = bytes[pos++];
              out[c++] = String.fromCharCode(((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
          }
      }
      return out.join('');
  };
  // We define it as an object literal instead of a class because a class compiled down to es5 can't
  // be treeshaked. https://github.com/rollup/rollup/issues/1691
  // Static lookup maps, lazily populated by init_()
  var base64 = {
      /**
       * Maps bytes to characters.
       */
      byteToCharMap_: null,
      /**
       * Maps characters to bytes.
       */
      charToByteMap_: null,
      /**
       * Maps bytes to websafe characters.
       * @private
       */
      byteToCharMapWebSafe_: null,
      /**
       * Maps websafe characters to bytes.
       * @private
       */
      charToByteMapWebSafe_: null,
      /**
       * Our default alphabet, shared between
       * ENCODED_VALS and ENCODED_VALS_WEBSAFE
       */
      ENCODED_VALS_BASE: 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' + 'abcdefghijklmnopqrstuvwxyz' + '0123456789',
      /**
       * Our default alphabet. Value 64 (=) is special; it means "nothing."
       */
      get ENCODED_VALS() {
          return this.ENCODED_VALS_BASE + '+/=';
      },
      /**
       * Our websafe alphabet.
       */
      get ENCODED_VALS_WEBSAFE() {
          return this.ENCODED_VALS_BASE + '-_.';
      },
      /**
       * Whether this browser supports the atob and btoa functions. This extension
       * started at Mozilla but is now implemented by many browsers. We use the
       * ASSUME_* variables to avoid pulling in the full useragent detection library
       * but still allowing the standard per-browser compilations.
       *
       */
      HAS_NATIVE_SUPPORT: typeof atob === 'function',
      /**
       * Base64-encode an array of bytes.
       *
       * @param input An array of bytes (numbers with
       *     value in [0, 255]) to encode.
       * @param webSafe Boolean indicating we should use the
       *     alternative alphabet.
       * @return The base64 encoded string.
       */
      encodeByteArray: function (input, webSafe) {
          if (!Array.isArray(input)) {
              throw Error('encodeByteArray takes an array as a parameter');
          }
          this.init_();
          var byteToCharMap = webSafe
              ? this.byteToCharMapWebSafe_
              : this.byteToCharMap_;
          var output = [];
          for (var i = 0; i < input.length; i += 3) {
              var byte1 = input[i];
              var haveByte2 = i + 1 < input.length;
              var byte2 = haveByte2 ? input[i + 1] : 0;
              var haveByte3 = i + 2 < input.length;
              var byte3 = haveByte3 ? input[i + 2] : 0;
              var outByte1 = byte1 >> 2;
              var outByte2 = ((byte1 & 0x03) << 4) | (byte2 >> 4);
              var outByte3 = ((byte2 & 0x0f) << 2) | (byte3 >> 6);
              var outByte4 = byte3 & 0x3f;
              if (!haveByte3) {
                  outByte4 = 64;
                  if (!haveByte2) {
                      outByte3 = 64;
                  }
              }
              output.push(byteToCharMap[outByte1], byteToCharMap[outByte2], byteToCharMap[outByte3], byteToCharMap[outByte4]);
          }
          return output.join('');
      },
      /**
       * Base64-encode a string.
       *
       * @param input A string to encode.
       * @param webSafe If true, we should use the
       *     alternative alphabet.
       * @return The base64 encoded string.
       */
      encodeString: function (input, webSafe) {
          // Shortcut for Mozilla browsers that implement
          // a native base64 encoder in the form of "btoa/atob"
          if (this.HAS_NATIVE_SUPPORT && !webSafe) {
              return btoa(input);
          }
          return this.encodeByteArray(stringToByteArray$1(input), webSafe);
      },
      /**
       * Base64-decode a string.
       *
       * @param input to decode.
       * @param webSafe True if we should use the
       *     alternative alphabet.
       * @return string representing the decoded value.
       */
      decodeString: function (input, webSafe) {
          // Shortcut for Mozilla browsers that implement
          // a native base64 encoder in the form of "btoa/atob"
          if (this.HAS_NATIVE_SUPPORT && !webSafe) {
              return atob(input);
          }
          return byteArrayToString(this.decodeStringToByteArray(input, webSafe));
      },
      /**
       * Base64-decode a string.
       *
       * In base-64 decoding, groups of four characters are converted into three
       * bytes.  If the encoder did not apply padding, the input length may not
       * be a multiple of 4.
       *
       * In this case, the last group will have fewer than 4 characters, and
       * padding will be inferred.  If the group has one or two characters, it decodes
       * to one byte.  If the group has three characters, it decodes to two bytes.
       *
       * @param input Input to decode.
       * @param webSafe True if we should use the web-safe alphabet.
       * @return bytes representing the decoded value.
       */
      decodeStringToByteArray: function (input, webSafe) {
          this.init_();
          var charToByteMap = webSafe
              ? this.charToByteMapWebSafe_
              : this.charToByteMap_;
          var output = [];
          for (var i = 0; i < input.length;) {
              var byte1 = charToByteMap[input.charAt(i++)];
              var haveByte2 = i < input.length;
              var byte2 = haveByte2 ? charToByteMap[input.charAt(i)] : 0;
              ++i;
              var haveByte3 = i < input.length;
              var byte3 = haveByte3 ? charToByteMap[input.charAt(i)] : 64;
              ++i;
              var haveByte4 = i < input.length;
              var byte4 = haveByte4 ? charToByteMap[input.charAt(i)] : 64;
              ++i;
              if (byte1 == null || byte2 == null || byte3 == null || byte4 == null) {
                  throw Error();
              }
              var outByte1 = (byte1 << 2) | (byte2 >> 4);
              output.push(outByte1);
              if (byte3 !== 64) {
                  var outByte2 = ((byte2 << 4) & 0xf0) | (byte3 >> 2);
                  output.push(outByte2);
                  if (byte4 !== 64) {
                      var outByte3 = ((byte3 << 6) & 0xc0) | byte4;
                      output.push(outByte3);
                  }
              }
          }
          return output;
      },
      /**
       * Lazy static initialization function. Called before
       * accessing any of the static map variables.
       * @private
       */
      init_: function () {
          if (!this.byteToCharMap_) {
              this.byteToCharMap_ = {};
              this.charToByteMap_ = {};
              this.byteToCharMapWebSafe_ = {};
              this.charToByteMapWebSafe_ = {};
              // We want quick mappings back and forth, so we precompute two maps.
              for (var i = 0; i < this.ENCODED_VALS.length; i++) {
                  this.byteToCharMap_[i] = this.ENCODED_VALS.charAt(i);
                  this.charToByteMap_[this.byteToCharMap_[i]] = i;
                  this.byteToCharMapWebSafe_[i] = this.ENCODED_VALS_WEBSAFE.charAt(i);
                  this.charToByteMapWebSafe_[this.byteToCharMapWebSafe_[i]] = i;
                  // Be forgiving when decoding and correctly decode both encodings.
                  if (i >= this.ENCODED_VALS_BASE.length) {
                      this.charToByteMap_[this.ENCODED_VALS_WEBSAFE.charAt(i)] = i;
                      this.charToByteMapWebSafe_[this.ENCODED_VALS.charAt(i)] = i;
                  }
              }
          }
      }
  };
  /**
   * URL-safe base64 encoding
   */
  var base64Encode = function (str) {
      var utf8Bytes = stringToByteArray$1(str);
      return base64.encodeByteArray(utf8Bytes, true);
  };
  /**
   * URL-safe base64 encoding (without "." padding in the end).
   * e.g. Used in JSON Web Token (JWT) parts.
   */
  var base64urlEncodeWithoutPadding = function (str) {
      // Use base64url encoding and remove padding in the end (dot characters).
      return base64Encode(str).replace(/\./g, '');
  };
  
  /**
   * @license
   * Copyright 2021 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  function createMockUserToken(token, projectId) {
      if (token.uid) {
          throw new Error('The "uid" field is no longer supported by mockUserToken. Please use "sub" instead for Firebase Auth User ID.');
      }
      // Unsecured JWTs use "none" as the algorithm.
      var header = {
          alg: 'none',
          type: 'JWT'
      };
      var project = projectId || 'demo-project';
      var iat = token.iat || 0;
      var sub = token.sub || token.user_id;
      if (!sub) {
          throw new Error("mockUserToken must contain 'sub' or 'user_id' field!");
      }
      var payload = __assign({ 
          // Set all required fields to decent defaults
          iss: "https://securetoken.google.com/" + project, aud: project, iat: iat, exp: iat + 3600, auth_time: iat, sub: sub, user_id: sub, firebase: {
              sign_in_provider: 'custom',
              identities: {}
          } }, token);
      // Unsecured JWTs use the empty string as a signature.
      var signature = '';
      return [
          base64urlEncodeWithoutPadding(JSON.stringify(header)),
          base64urlEncodeWithoutPadding(JSON.stringify(payload)),
          signature
      ].join('.');
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  var ERROR_NAME = 'FirebaseError';
  // Based on code from:
  // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Error#Custom_Error_Types
  var FirebaseError = /** @class */ (function (_super) {
      __extends(FirebaseError, _super);
      function FirebaseError(code, message, customData) {
          var _this = _super.call(this, message) || this;
          _this.code = code;
          _this.customData = customData;
          _this.name = ERROR_NAME;
          // Fix For ES5
          // https://github.com/Microsoft/TypeScript-wiki/blob/master/Breaking-Changes.md#extending-built-ins-like-error-array-and-map-may-no-longer-work
          Object.setPrototypeOf(_this, FirebaseError.prototype);
          // Maintains proper stack trace for where our error was thrown.
          // Only available on V8.
          if (Error.captureStackTrace) {
              Error.captureStackTrace(_this, ErrorFactory.prototype.create);
          }
          return _this;
      }
      return FirebaseError;
  }(Error));
  var ErrorFactory = /** @class */ (function () {
      function ErrorFactory(service, serviceName, errors) {
          this.service = service;
          this.serviceName = serviceName;
          this.errors = errors;
      }
      ErrorFactory.prototype.create = function (code) {
          var data = [];
          for (var _i = 1; _i < arguments.length; _i++) {
              data[_i - 1] = arguments[_i];
          }
          var customData = data[0] || {};
          var fullCode = this.service + "/" + code;
          var template = this.errors[code];
          var message = template ? replaceTemplate(template, customData) : 'Error';
          // Service Name: Error message (service/code).
          var fullMessage = this.serviceName + ": " + message + " (" + fullCode + ").";
          var error = new FirebaseError(fullCode, fullMessage, customData);
          return error;
      };
      return ErrorFactory;
  }());
  function replaceTemplate(template, data) {
      return template.replace(PATTERN, function (_, key) {
          var value = data[key];
          return value != null ? String(value) : "<" + key + "?>";
      });
  }
  var PATTERN = /\{\$([^}]+)}/g;
  
  /**
   * @license
   * Copyright 2021 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  function getModularInstance(service) {
      if (service && service._delegate) {
          return service._delegate;
      }
      else {
          return service;
      }
  }
  
  /**
   * Component for service name T, e.g. `auth`, `auth-internal`
   */
  var Component = /** @class */ (function () {
      /**
       *
       * @param name The public service name, e.g. app, auth, firestore, database
       * @param instanceFactory Service factory responsible for creating the public interface
       * @param type whether the service provided by the component is public or private
       */
      function Component(name, instanceFactory, type) {
          this.name = name;
          this.instanceFactory = instanceFactory;
          this.type = type;
          this.multipleInstances = false;
          /**
           * Properties to be added to the service namespace
           */
          this.serviceProps = {};
          this.instantiationMode = "LAZY" /* LAZY */;
          this.onInstanceCreated = null;
      }
      Component.prototype.setInstantiationMode = function (mode) {
          this.instantiationMode = mode;
          return this;
      };
      Component.prototype.setMultipleInstances = function (multipleInstances) {
          this.multipleInstances = multipleInstances;
          return this;
      };
      Component.prototype.setServiceProps = function (props) {
          this.serviceProps = props;
          return this;
      };
      Component.prototype.setInstanceCreatedCallback = function (callback) {
          this.onInstanceCreated = callback;
          return this;
      };
      return Component;
  }());
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  var _a;
  /**
   * The JS SDK supports 5 log levels and also allows a user the ability to
   * silence the logs altogether.
   *
   * The order is a follows:
   * DEBUG < VERBOSE < INFO < WARN < ERROR
   *
   * All of the log types above the current log level will be captured (i.e. if
   * you set the log level to `INFO`, errors will still be logged, but `DEBUG` and
   * `VERBOSE` logs will not)
   */
  var LogLevel;
  (function (LogLevel) {
      LogLevel[LogLevel["DEBUG"] = 0] = "DEBUG";
      LogLevel[LogLevel["VERBOSE"] = 1] = "VERBOSE";
      LogLevel[LogLevel["INFO"] = 2] = "INFO";
      LogLevel[LogLevel["WARN"] = 3] = "WARN";
      LogLevel[LogLevel["ERROR"] = 4] = "ERROR";
      LogLevel[LogLevel["SILENT"] = 5] = "SILENT";
  })(LogLevel || (LogLevel = {}));
  var levelStringToEnum = {
      'debug': LogLevel.DEBUG,
      'verbose': LogLevel.VERBOSE,
      'info': LogLevel.INFO,
      'warn': LogLevel.WARN,
      'error': LogLevel.ERROR,
      'silent': LogLevel.SILENT
  };
  /**
   * The default log level
   */
  var defaultLogLevel = LogLevel.INFO;
  /**
   * By default, `console.debug` is not displayed in the developer console (in
   * chrome). To avoid forcing users to have to opt-in to these logs twice
   * (i.e. once for firebase, and once in the console), we are sending `DEBUG`
   * logs to the `console.log` function.
   */
  var ConsoleMethod = (_a = {},
      _a[LogLevel.DEBUG] = 'log',
      _a[LogLevel.VERBOSE] = 'log',
      _a[LogLevel.INFO] = 'info',
      _a[LogLevel.WARN] = 'warn',
      _a[LogLevel.ERROR] = 'error',
      _a);
  /**
   * The default log handler will forward DEBUG, VERBOSE, INFO, WARN, and ERROR
   * messages on to their corresponding console counterparts (if the log method
   * is supported by the current log level)
   */
  var defaultLogHandler = function (instance, logType) {
      var args = [];
      for (var _i = 2; _i < arguments.length; _i++) {
          args[_i - 2] = arguments[_i];
      }
      if (logType < instance.logLevel) {
          return;
      }
      var now = new Date().toISOString();
      var method = ConsoleMethod[logType];
      if (method) {
          console[method].apply(console, __spreadArray(["[" + now + "]  " + instance.name + ":"], args));
      }
      else {
          throw new Error("Attempted to log a message with an invalid logType (value: " + logType + ")");
      }
  };
  var Logger = /** @class */ (function () {
      /**
       * Gives you an instance of a Logger to capture messages according to
       * Firebase's logging scheme.
       *
       * @param name The name that the logs will be associated with
       */
      function Logger(name) {
          this.name = name;
          /**
           * The log level of the given Logger instance.
           */
          this._logLevel = defaultLogLevel;
          /**
           * The main (internal) log handler for the Logger instance.
           * Can be set to a new function in internal package code but not by user.
           */
          this._logHandler = defaultLogHandler;
          /**
           * The optional, additional, user-defined log handler for the Logger instance.
           */
          this._userLogHandler = null;
      }
      Object.defineProperty(Logger.prototype, "logLevel", {
          get: function () {
              return this._logLevel;
          },
          set: function (val) {
              if (!(val in LogLevel)) {
                  throw new TypeError("Invalid value \"" + val + "\" assigned to `logLevel`");
              }
              this._logLevel = val;
          },
          enumerable: false,
          configurable: true
      });
      // Workaround for setter/getter having to be the same type.
      Logger.prototype.setLogLevel = function (val) {
          this._logLevel = typeof val === 'string' ? levelStringToEnum[val] : val;
      };
      Object.defineProperty(Logger.prototype, "logHandler", {
          get: function () {
              return this._logHandler;
          },
          set: function (val) {
              if (typeof val !== 'function') {
                  throw new TypeError('Value assigned to `logHandler` must be a function');
              }
              this._logHandler = val;
          },
          enumerable: false,
          configurable: true
      });
      Object.defineProperty(Logger.prototype, "userLogHandler", {
          get: function () {
              return this._userLogHandler;
          },
          set: function (val) {
              this._userLogHandler = val;
          },
          enumerable: false,
          configurable: true
      });
      /**
       * The functions below are all based on the `console` interface
       */
      Logger.prototype.debug = function () {
          var args = [];
          for (var _i = 0; _i < arguments.length; _i++) {
              args[_i] = arguments[_i];
          }
          this._userLogHandler && this._userLogHandler.apply(this, __spreadArray([this, LogLevel.DEBUG], args));
          this._logHandler.apply(this, __spreadArray([this, LogLevel.DEBUG], args));
      };
      Logger.prototype.log = function () {
          var args = [];
          for (var _i = 0; _i < arguments.length; _i++) {
              args[_i] = arguments[_i];
          }
          this._userLogHandler && this._userLogHandler.apply(this, __spreadArray([this, LogLevel.VERBOSE], args));
          this._logHandler.apply(this, __spreadArray([this, LogLevel.VERBOSE], args));
      };
      Logger.prototype.info = function () {
          var args = [];
          for (var _i = 0; _i < arguments.length; _i++) {
              args[_i] = arguments[_i];
          }
          this._userLogHandler && this._userLogHandler.apply(this, __spreadArray([this, LogLevel.INFO], args));
          this._logHandler.apply(this, __spreadArray([this, LogLevel.INFO], args));
      };
      Logger.prototype.warn = function () {
          var args = [];
          for (var _i = 0; _i < arguments.length; _i++) {
              args[_i] = arguments[_i];
          }
          this._userLogHandler && this._userLogHandler.apply(this, __spreadArray([this, LogLevel.WARN], args));
          this._logHandler.apply(this, __spreadArray([this, LogLevel.WARN], args));
      };
      Logger.prototype.error = function () {
          var args = [];
          for (var _i = 0; _i < arguments.length; _i++) {
              args[_i] = arguments[_i];
          }
          this._userLogHandler && this._userLogHandler.apply(this, __spreadArray([this, LogLevel.ERROR], args));
          this._logHandler.apply(this, __spreadArray([this, LogLevel.ERROR], args));
      };
      return Logger;
  }());
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Simple wrapper around a nullable UID. Mostly exists to make code more
   * readable.
   */
  class h {
      constructor(t) {
          this.uid = t;
      }
      isAuthenticated() {
          return null != this.uid;
      }
      /**
       * Returns a key representing this user, suitable for inclusion in a
       * dictionary.
       */    toKey() {
          return this.isAuthenticated() ? "uid:" + this.uid : "anonymous-user";
      }
      isEqual(t) {
          return t.uid === this.uid;
      }
  }
  
  /** A user with a null UID. */ h.UNAUTHENTICATED = new h(null), 
  // TODO(mikelehen): Look into getting a proper uid-equivalent for
  // non-FirebaseAuth providers.
  h.GOOGLE_CREDENTIALS = new h("google-credentials-uid"), h.FIRST_PARTY = new h("first-party-uid"), 
  h.MOCK_USER = new h("mock-user");
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  let l = "9.0.2";
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  const f = new Logger("@firebase/firestore");
  
  /**
   * Sets the verbosity of Cloud Firestore logs (debug, error, or silent).
   *
   * @param logLevel - The verbosity you set for activity and error logging. Can
   *   be any of the following values:
   *
   *   <ul>
   *     <li>`debug` for the most verbose logging level, primarily for
   *     debugging.</li>
   *     <li>`error` to log errors only.</li>
   *     <li><code>`silent` to turn off logging.</li>
   *   </ul>
   */ function d(t) {
      f.setLogLevel(t);
  }
  
  function w(t, ...n) {
      if (f.logLevel <= LogLevel.DEBUG) {
          const e = n.map(y);
          f.debug(`Firestore (${l}): ${t}`, ...e);
      }
  }
  
  function m(t, ...n) {
      if (f.logLevel <= LogLevel.ERROR) {
          const e = n.map(y);
          f.error(`Firestore (${l}): ${t}`, ...e);
      }
  }
  
  /**
   * @internal
   */ function p(t, ...n) {
      if (f.logLevel <= LogLevel.WARN) {
          const e = n.map(y);
          f.warn(`Firestore (${l}): ${t}`, ...e);
      }
  }
  
  /**
   * Converts an additional log parameter to a string representation.
   */ function y(t) {
      if ("string" == typeof t) return t;
      try {
          return n = t, JSON.stringify(n);
      } catch (n) {
          // Converting to JSON failed, just log the object directly
          return t;
      }
      /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
      /** Formats an object as a JSON string, suitable for logging. */
      var n;
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Unconditionally fails, throwing an Error with the given message.
   * Messages are stripped in production builds.
   *
   * Returns `never` and can be used in expressions:
   * @example
   * let futureVar = fail('not implemented yet');
   */ function _(t = "Unexpected state") {
      // Log the failure in addition to throw an exception, just in case the
      // exception is swallowed.
      const n = `FIRESTORE (${l}) INTERNAL ASSERTION FAILED: ` + t;
      // NOTE: We don't use FirestoreError here because these are internal failures
      // that cannot be handled by the user. (Also it would create a circular
      // dependency between the error and assert modules which doesn't work.)
      throw m(n), new Error(n);
  }
  
  /**
   * Fails if the given assertion condition is false, throwing an Error with the
   * given message if it did.
   *
   * Messages are stripped in production builds.
   */ function g(t, n) {
      t || _();
  }
  
  /**
   * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
   * instance of `T` before casting.
   */ function b(t, 
  // eslint-disable-next-line @typescript-eslint/no-explicit-any
  n) {
      return t;
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ const v = "ok", E = "cancelled", I = "unknown", T = "invalid-argument", A = "deadline-exceeded", P = "not-found", R = "already-exists", V = "permission-denied", N = "unauthenticated", D = "resource-exhausted", $ = "failed-precondition", F = "aborted", S = "out-of-range", q = "unimplemented", x = "internal", O = "unavailable", C = "data-loss";
  
  /** An error returned by a Firestore operation. */ class L extends Error {
      /** @hideconstructor */
      constructor(
      /**
       * The backend error code associated with this error.
       */
      t, 
      /**
       * A custom error description.
       */
      n) {
          super(n), this.code = t, this.message = n, 
          /** The custom name for all FirestoreErrors. */
          this.name = "FirebaseError", 
          // HACK: We write a toString property directly because Error is not a real
          // class and so inheritance does not work correctly. We could alternatively
          // do the same "back-door inheritance" trick that FirebaseError does.
          this.toString = () => `${this.name}: [code=${this.code}]: ${this.message}`;
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ class U {
      constructor() {
          this.promise = new Promise(((t, n) => {
              this.resolve = t, this.reject = n;
          }));
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ class j {
      constructor(t, n) {
          this.user = n, this.type = "OAuth", this.authHeaders = {}, 
          // Set the headers using Object Literal notation to avoid minification
          this.authHeaders.Authorization = `Bearer ${t}`;
      }
  }
  
  /**
   * A CredentialsProvider that always yields an empty token.
   * @internal
   */ class k {
      getToken() {
          return Promise.resolve(null);
      }
      invalidateToken() {}
      start(t, n) {
          // Fire with initial user.
          t.enqueueRetryable((() => n(h.UNAUTHENTICATED)));
      }
      shutdown() {}
  }
  
  /**
   * A CredentialsProvider that always returns a constant token. Used for
   * emulator token mocking.
   */ class M {
      constructor(t) {
          this.token = t, 
          /**
           * Stores the listener registered with setChangeListener()
           * This isn't actually necessary since the UID never changes, but we use this
           * to verify the listen contract is adhered to in tests.
           */
          this.changeListener = null;
      }
      getToken() {
          return Promise.resolve(this.token);
      }
      invalidateToken() {}
      start(t, n) {
          this.changeListener = n, 
          // Fire with initial user.
          t.enqueueRetryable((() => n(this.token.user)));
      }
      shutdown() {
          this.changeListener = null;
      }
  }
  
  /** Credential provider for the Lite SDK. */ class B {
      constructor(t) {
          this.auth = null, t.onInit((t => {
              this.auth = t;
          }));
      }
      getToken() {
          return this.auth ? this.auth.getToken().then((t => t ? (g("string" == typeof t.accessToken), 
          new j(t.accessToken, new h(this.auth.getUid()))) : null)) : Promise.resolve(null);
      }
      invalidateToken() {}
      start(t, n) {}
      shutdown() {}
  }
  
  /*
   * FirstPartyToken provides a fresh token each time its value
   * is requested, because if the token is too old, requests will be rejected.
   * Technically this may no longer be necessary since the SDK should gracefully
   * recover from unauthenticated errors (see b/33147818 for context), but it's
   * safer to keep the implementation as-is.
   */ class Q {
      constructor(t, n, e) {
          this.t = t, this.i = n, this.o = e, this.type = "FirstParty", this.user = h.FIRST_PARTY;
      }
      get authHeaders() {
          const t = {
              "X-Goog-AuthUser": this.i
          }, n = this.t.auth.getAuthHeaderValueForFirstParty([]);
          // Use array notation to prevent minification
                  return n && (t.Authorization = n), this.o && (t["X-Goog-Iam-Authorization-Token"] = this.o), 
          t;
      }
  }
  
  /*
   * Provides user credentials required for the Firestore JavaScript SDK
   * to authenticate the user, using technique that is only available
   * to applications hosted by Google.
   */ class z {
      constructor(t, n, e) {
          this.t = t, this.i = n, this.o = e;
      }
      getToken() {
          return Promise.resolve(new Q(this.t, this.i, this.o));
      }
      start(t, n) {
          // Fire with initial uid.
          t.enqueueRetryable((() => n(h.FIRST_PARTY)));
      }
      shutdown() {}
      invalidateToken() {}
  }
  
  /**
   * Builds a CredentialsProvider depending on the type of
   * the credentials passed in.
   */
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  class W {
      /**
       * Constructs a DatabaseInfo using the provided host, databaseId and
       * persistenceKey.
       *
       * @param databaseId - The database to use.
       * @param appId - The Firebase App Id.
       * @param persistenceKey - A unique identifier for this Firestore's local
       * storage (used in conjunction with the databaseId).
       * @param host - The Firestore backend host to connect to.
       * @param ssl - Whether to use SSL when connecting.
       * @param forceLongPolling - Whether to use the forceLongPolling option
       * when using WebChannel as the network transport.
       * @param autoDetectLongPolling - Whether to use the detectBufferingProxy
       * option when using WebChannel as the network transport.
       * @param useFetchStreams Whether to use the Fetch API instead of
       * XMLHTTPRequest
       */
      constructor(t, n, e, r, s, i, o, u) {
          this.databaseId = t, this.appId = n, this.persistenceKey = e, this.host = r, this.ssl = s, 
          this.forceLongPolling = i, this.autoDetectLongPolling = o, this.useFetchStreams = u;
      }
  }
  
  /** The default database name for a project. */
  /**
   * Represents the database ID a Firestore client is associated with.
   * @internal
   */
  class G {
      constructor(t, n) {
          this.projectId = t, this.database = n || "(default)";
      }
      get isDefaultDatabase() {
          return "(default)" === this.database;
      }
      isEqual(t) {
          return t instanceof G && t.projectId === this.projectId && t.database === this.database;
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Path represents an ordered sequence of string segments.
   */
  class H {
      constructor(t, n, e) {
          void 0 === n ? n = 0 : n > t.length && _(), void 0 === e ? e = t.length - n : e > t.length - n && _(), 
          this.segments = t, this.offset = n, this.len = e;
      }
      get length() {
          return this.len;
      }
      isEqual(t) {
          return 0 === H.comparator(this, t);
      }
      child(t) {
          const n = this.segments.slice(this.offset, this.limit());
          return t instanceof H ? t.forEach((t => {
              n.push(t);
          })) : n.push(t), this.construct(n);
      }
      /** The index of one past the last segment of the path. */    limit() {
          return this.offset + this.length;
      }
      popFirst(t) {
          return t = void 0 === t ? 1 : t, this.construct(this.segments, this.offset + t, this.length - t);
      }
      popLast() {
          return this.construct(this.segments, this.offset, this.length - 1);
      }
      firstSegment() {
          return this.segments[this.offset];
      }
      lastSegment() {
          return this.get(this.length - 1);
      }
      get(t) {
          return this.segments[this.offset + t];
      }
      isEmpty() {
          return 0 === this.length;
      }
      isPrefixOf(t) {
          if (t.length < this.length) return !1;
          for (let n = 0; n < this.length; n++) if (this.get(n) !== t.get(n)) return !1;
          return !0;
      }
      isImmediateParentOf(t) {
          if (this.length + 1 !== t.length) return !1;
          for (let n = 0; n < this.length; n++) if (this.get(n) !== t.get(n)) return !1;
          return !0;
      }
      forEach(t) {
          for (let n = this.offset, e = this.limit(); n < e; n++) t(this.segments[n]);
      }
      toArray() {
          return this.segments.slice(this.offset, this.limit());
      }
      static comparator(t, n) {
          const e = Math.min(t.length, n.length);
          for (let r = 0; r < e; r++) {
              const e = t.get(r), s = n.get(r);
              if (e < s) return -1;
              if (e > s) return 1;
          }
          return t.length < n.length ? -1 : t.length > n.length ? 1 : 0;
      }
  }
  
  /**
   * A slash-separated path for navigating resources (documents and collections)
   * within Firestore.
   *
   * @internal
   */ class Y extends H {
      construct(t, n, e) {
          return new Y(t, n, e);
      }
      canonicalString() {
          // NOTE: The client is ignorant of any path segments containing escape
          // sequences (e.g. __id123__) and just passes them through raw (they exist
          // for legacy reasons and should not be used frequently).
          return this.toArray().join("/");
      }
      toString() {
          return this.canonicalString();
      }
      /**
       * Creates a resource path from the given slash-delimited string. If multiple
       * arguments are provided, all components are combined. Leading and trailing
       * slashes from all components are ignored.
       */    static fromString(...t) {
          // NOTE: The client is ignorant of any path segments containing escape
          // sequences (e.g. __id123__) and just passes them through raw (they exist
          // for legacy reasons and should not be used frequently).
          const n = [];
          for (const e of t) {
              if (e.indexOf("//") >= 0) throw new L(T, `Invalid segment (${e}). Paths must not contain // in them.`);
              // Strip leading and traling slashed.
                          n.push(...e.split("/").filter((t => t.length > 0)));
          }
          return new Y(n);
      }
      static emptyPath() {
          return new Y([]);
      }
  }
  
  const K = /^[_a-zA-Z][_a-zA-Z0-9]*$/;
  
  /**
   * A dot-separated path for navigating sub-objects within a document.
   * @internal
   */ class J extends H {
      construct(t, n, e) {
          return new J(t, n, e);
      }
      /**
       * Returns true if the string could be used as a segment in a field path
       * without escaping.
       */    static isValidIdentifier(t) {
          return K.test(t);
      }
      canonicalString() {
          return this.toArray().map((t => (t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), 
          J.isValidIdentifier(t) || (t = "`" + t + "`"), t))).join(".");
      }
      toString() {
          return this.canonicalString();
      }
      /**
       * Returns true if this field references the key of a document.
       */    isKeyField() {
          return 1 === this.length && "__name__" === this.get(0);
      }
      /**
       * The field designating the key of a document.
       */    static keyField() {
          return new J([ "__name__" ]);
      }
      /**
       * Parses a field string from the given server-formatted string.
       *
       * - Splitting the empty string is not allowed (for now at least).
       * - Empty segments within the string (e.g. if there are two consecutive
       *   separators) are not allowed.
       *
       * TODO(b/37244157): we should make this more strict. Right now, it allows
       * non-identifier path components, even if they aren't escaped.
       */    static fromServerFormat(t) {
          const n = [];
          let e = "", r = 0;
          const s = () => {
              if (0 === e.length) throw new L(T, `Invalid field path (${t}). Paths must not be empty, begin with '.', end with '.', or contain '..'`);
              n.push(e), e = "";
          };
          let i = !1;
          for (;r < t.length; ) {
              const n = t[r];
              if ("\\" === n) {
                  if (r + 1 === t.length) throw new L(T, "Path has trailing escape character: " + t);
                  const n = t[r + 1];
                  if ("\\" !== n && "." !== n && "`" !== n) throw new L(T, "Path has invalid escape sequence: " + t);
                  e += n, r += 2;
              } else "`" === n ? (i = !i, r++) : "." !== n || i ? (e += n, r++) : (s(), r++);
          }
          if (s(), i) throw new L(T, "Unterminated ` in path: " + t);
          return new J(n);
      }
      static emptyPath() {
          return new J([]);
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * @internal
   */ class Z {
      constructor(t) {
          this.path = t;
      }
      static fromPath(t) {
          return new Z(Y.fromString(t));
      }
      static fromName(t) {
          return new Z(Y.fromString(t).popFirst(5));
      }
      /** Returns true if the document is in the specified collectionId. */    hasCollectionId(t) {
          return this.path.length >= 2 && this.path.get(this.path.length - 2) === t;
      }
      isEqual(t) {
          return null !== t && 0 === Y.comparator(this.path, t.path);
      }
      toString() {
          return this.path.toString();
      }
      static comparator(t, n) {
          return Y.comparator(t.path, n.path);
      }
      static isDocumentKey(t) {
          return t.length % 2 == 0;
      }
      /**
       * Creates and returns a new document key with the given segments.
       *
       * @param segments - The segments of the path to the document
       * @returns A new instance of DocumentKey
       */    static fromSegments(t) {
          return new Z(new Y(t.slice()));
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ function X(t, n, e) {
      if (!e) throw new L(T, `Function ${t}() cannot be called with an empty ${n}.`);
  }
  
  /**
   * Validates that two boolean options are not set at the same time.
   * @internal
   */
  /**
   * Validates that `path` refers to a document (indicated by the fact it contains
   * an even numbers of segments).
   */
  function tt(t) {
      if (!Z.isDocumentKey(t)) throw new L(T, `Invalid document reference. Document references must have an even number of segments, but ${t} has ${t.length}.`);
  }
  
  /**
   * Validates that `path` refers to a collection (indicated by the fact it
   * contains an odd numbers of segments).
   */ function nt(t) {
      if (Z.isDocumentKey(t)) throw new L(T, `Invalid collection reference. Collection references must have an odd number of segments, but ${t} has ${t.length}.`);
  }
  
  /**
   * Returns true if it's a non-null object without a custom prototype
   * (i.e. excludes Array, Date, etc.).
   */
  /** Returns a string describing the type / value of the provided input. */
  function et(t) {
      if (void 0 === t) return "undefined";
      if (null === t) return "null";
      if ("string" == typeof t) return t.length > 20 && (t = `${t.substring(0, 20)}...`), 
      JSON.stringify(t);
      if ("number" == typeof t || "boolean" == typeof t) return "" + t;
      if ("object" == typeof t) {
          if (t instanceof Array) return "an array";
          {
              const n = 
              /** Hacky method to try to get the constructor name for an object. */
              function(t) {
                  if (t.constructor) {
                      const n = /function\s+([^\s(]+)\s*\(/.exec(t.constructor.toString());
                      if (n && n.length > 1) return n[1];
                  }
                  return null;
              }
              /**
   * Casts `obj` to `T`, optionally unwrapping Compat types to expose the
   * underlying instance. Throws if  `obj` is not an instance of `T`.
   *
   * This cast is used in the Lite and Full SDK to verify instance types for
   * arguments passed to the public API.
   * @internal
   */ (t);
              return n ? `a custom ${n} object` : "an object";
          }
      }
      return "function" == typeof t ? "a function" : _();
  }
  
  function rt(t, 
  // eslint-disable-next-line @typescript-eslint/no-explicit-any
  n) {
      if ("_delegate" in t && (
      // Unwrap Compat types
      // eslint-disable-next-line @typescript-eslint/no-explicit-any
      t = t._delegate), !(t instanceof n)) {
          if (n.name === t.constructor.name) throw new L(T, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
          {
              const e = et(t);
              throw new L(T, `Expected type '${n.name}', but it was: ${e}`);
          }
      }
      return t;
  }
  
  function st(t, n) {
      if (n <= 0) throw new L(T, `Function ${t}() requires a positive number, but it was: ${n}.`);
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Returns whether a variable is either undefined or null.
   */ function it(t) {
      return null == t;
  }
  
  /** Returns whether the value represents -0. */ function ot(t) {
      // Detect if the value is -0.0. Based on polyfill from
      // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is
      return 0 === t && 1 / t == -1 / 0;
  }
  
  /**
   * Returns whether a value is an integer and in the safe integer range
   * @param value - The value to test for being an integer and in the safe range
   */
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  const ut = {
      BatchGetDocuments: "batchGet",
      Commit: "commit",
      RunQuery: "runQuery"
  };
  
  /**
   * Maps RPC names to the corresponding REST endpoint name.
   *
   * We use array notation to avoid mangling.
   */
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Error Codes describing the different ways GRPC can fail. These are copied
   * directly from GRPC's sources here:
   *
   * https://github.com/grpc/grpc/blob/bceec94ea4fc5f0085d81235d8e1c06798dc341a/include/grpc%2B%2B/impl/codegen/status_code_enum.h
   *
   * Important! The names of these identifiers matter because the string forms
   * are used for reverse lookups from the webchannel stream. Do NOT change the
   * names of these identifiers or change this into a const enum.
   */
  var ct, at;
  
  /**
   * Converts an HTTP Status Code to the equivalent error code.
   *
   * @param status - An HTTP Status Code, like 200, 404, 503, etc.
   * @returns The equivalent Code. Unknown status codes are mapped to
   *     Code.UNKNOWN.
   */
  function ht(t) {
      if (void 0 === t) return m("RPC_ERROR", "HTTP error has no status"), I;
      // The canonical error codes for Google APIs [1] specify mapping onto HTTP
      // status codes but the mapping is not bijective. In each case of ambiguity
      // this function chooses a primary error.
      
      // [1]
      // https://github.com/googleapis/googleapis/blob/master/google/rpc/code.proto
          switch (t) {
        case 200:
          // OK
          return v;
  
        case 400:
          // Bad Request
          return $;
  
          // Other possibilities based on the forward mapping
          // return Code.INVALID_ARGUMENT;
          // return Code.OUT_OF_RANGE;
                case 401:
          // Unauthorized
          return N;
  
        case 403:
          // Forbidden
          return V;
  
        case 404:
          // Not Found
          return P;
  
        case 409:
          // Conflict
          return F;
  
          // Other possibilities:
          // return Code.ALREADY_EXISTS;
                case 416:
          // Range Not Satisfiable
          return S;
  
        case 429:
          // Too Many Requests
          return D;
  
        case 499:
          // Client Closed Request
          return E;
  
        case 500:
          // Internal Server Error
          return I;
  
          // Other possibilities:
          // return Code.INTERNAL;
          // return Code.DATA_LOSS;
                case 501:
          // Unimplemented
          return q;
  
        case 503:
          // Service Unavailable
          return O;
  
        case 504:
          // Gateway Timeout
          return A;
  
        default:
          return t >= 200 && t < 300 ? v : t >= 400 && t < 500 ? $ : t >= 500 && t < 600 ? x : I;
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A Rest-based connection that relies on the native HTTP stack
   * (e.g. `fetch` or a polyfill).
   */ (at = ct || (ct = {}))[at.OK = 0] = "OK", at[at.CANCELLED = 1] = "CANCELLED", 
  at[at.UNKNOWN = 2] = "UNKNOWN", at[at.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
  at[at.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", at[at.NOT_FOUND = 5] = "NOT_FOUND", 
  at[at.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", at[at.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
  at[at.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", at[at.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
  at[at.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", at[at.ABORTED = 10] = "ABORTED", 
  at[at.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", at[at.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
  at[at.INTERNAL = 13] = "INTERNAL", at[at.UNAVAILABLE = 14] = "UNAVAILABLE", at[at.DATA_LOSS = 15] = "DATA_LOSS";
  
  class lt extends 
  /**
   * Base class for all Rest-based connections to the backend (WebChannel and
   * HTTP).
   */
  class {
      constructor(t) {
          this.databaseInfo = t, this.databaseId = t.databaseId;
          const n = t.ssl ? "https" : "http";
          this.u = n + "://" + t.host, this.h = "projects/" + this.databaseId.projectId + "/databases/" + this.databaseId.database + "/documents";
      }
      l(t, n, e, r) {
          const s = this.m(t, n);
          w("RestConnection", "Sending: ", s, e);
          const i = {};
          return this.p(i, r), this.g(t, s, i, e).then((t => (w("RestConnection", "Received: ", t), 
          t)), (n => {
              throw p("RestConnection", `${t} failed with error: `, n, "url: ", s, "request:", e), 
              n;
          }));
      }
      v(t, n, e, r) {
          // The REST API automatically aggregates all of the streamed results, so we
          // can just use the normal invoke() method.
          return this.l(t, n, e, r);
      }
      /**
       * Modifies the headers for a request, adding any authorization token if
       * present and any additional headers for the request.
       */    p(t, n) {
          if (t["X-Goog-Api-Client"] = "gl-js/ fire/" + l, 
          // Content-Type: text/plain will avoid preflight requests which might
          // mess with CORS and redirects by proxies. If we add custom headers
          // we will need to change this code to potentially use the $httpOverwrite
          // parameter supported by ESF to avoid triggering preflight requests.
          t["Content-Type"] = "text/plain", this.databaseInfo.appId && (t["X-Firebase-GMPID"] = this.databaseInfo.appId), 
          n) for (const e in n.authHeaders) n.authHeaders.hasOwnProperty(e) && (t[e] = n.authHeaders[e]);
      }
      m(t, n) {
          const e = ut[t];
          return `${this.u}/v1/${n}:${e}`;
      }
  } {
      /**
       * @param databaseInfo - The connection info.
       * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
       */
      constructor(t, n) {
          super(t), this.I = n;
      }
      T(t, n) {
          throw new Error("Not supported by FetchConnection");
      }
      async g(t, n, e, r) {
          const s = JSON.stringify(r);
          let i;
          try {
              i = await this.I(n, {
                  method: "POST",
                  headers: e,
                  body: s
              });
          } catch (t) {
              throw new L(ht(t.status), "Request failed with error: " + t.statusText);
          }
          if (!i.ok) throw new L(ht(i.status), "Request failed with error: " + i.statusText);
          return i.json();
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /** Initializes the HTTP connection for the REST API. */
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Generates `nBytes` of random bytes.
   *
   * If `nBytes < 0` , an error will be thrown.
   */
  function ft(t) {
      // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
      const n = 
      // eslint-disable-next-line @typescript-eslint/no-explicit-any
      "undefined" != typeof self && (self.crypto || self.msCrypto), e = new Uint8Array(t);
      if (n && "function" == typeof n.getRandomValues) n.getRandomValues(e); else 
      // Falls back to Math.random
      for (let n = 0; n < t; n++) e[n] = Math.floor(256 * Math.random());
      return e;
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ class dt {
      static A() {
          // Alphanumeric characters
          const t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", n = Math.floor(256 / t.length) * t.length;
          // The largest byte value that is a multiple of `char.length`.
                  let e = "";
          for (;e.length < 20; ) {
              const r = ft(40);
              for (let s = 0; s < r.length; ++s) 
              // Only accept values that are [0, maxMultiple), this ensures they can
              // be evenly mapped to indices of `chars` via a modulo operation.
              e.length < 20 && r[s] < n && (e += t.charAt(r[s] % t.length));
          }
          return e;
      }
  }
  
  function wt(t, n) {
      return t < n ? -1 : t > n ? 1 : 0;
  }
  
  /** Helper to compare arrays using isEqual(). */ function mt(t, n, e) {
      return t.length === n.length && t.every(((t, r) => e(t, n[r])));
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  // The earliest date supported by Firestore timestamps (0001-01-01T00:00:00Z).
  /**
   * A `Timestamp` represents a point in time independent of any time zone or
   * calendar, represented as seconds and fractions of seconds at nanosecond
   * resolution in UTC Epoch time.
   *
   * It is encoded using the Proleptic Gregorian Calendar which extends the
   * Gregorian calendar backwards to year one. It is encoded assuming all minutes
   * are 60 seconds long, i.e. leap seconds are "smeared" so that no leap second
   * table is needed for interpretation. Range is from 0001-01-01T00:00:00Z to
   * 9999-12-31T23:59:59.999999999Z.
   *
   * For examples and further specifications, refer to the
   * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
   */
  class pt {
      /**
       * Creates a new timestamp.
       *
       * @param seconds - The number of seconds of UTC time since Unix epoch
       *     1970-01-01T00:00:00Z. Must be from 0001-01-01T00:00:00Z to
       *     9999-12-31T23:59:59Z inclusive.
       * @param nanoseconds - The non-negative fractions of a second at nanosecond
       *     resolution. Negative second values with fractions must still have
       *     non-negative nanoseconds values that count forward in time. Must be
       *     from 0 to 999,999,999 inclusive.
       */
      constructor(
      /**
       * The number of seconds of UTC time since Unix epoch 1970-01-01T00:00:00Z.
       */
      t, 
      /**
       * The fractions of a second at nanosecond resolution.*
       */
      n) {
          if (this.seconds = t, this.nanoseconds = n, n < 0) throw new L(T, "Timestamp nanoseconds out of range: " + n);
          if (n >= 1e9) throw new L(T, "Timestamp nanoseconds out of range: " + n);
          if (t < -62135596800) throw new L(T, "Timestamp seconds out of range: " + t);
          // This will break in the year 10,000.
                  if (t >= 253402300800) throw new L(T, "Timestamp seconds out of range: " + t);
      }
      /**
       * Creates a new timestamp with the current date, with millisecond precision.
       *
       * @returns a new timestamp representing the current date.
       */    static now() {
          return pt.fromMillis(Date.now());
      }
      /**
       * Creates a new timestamp from the given date.
       *
       * @param date - The date to initialize the `Timestamp` from.
       * @returns A new `Timestamp` representing the same point in time as the given
       *     date.
       */    static fromDate(t) {
          return pt.fromMillis(t.getTime());
      }
      /**
       * Creates a new timestamp from the given number of milliseconds.
       *
       * @param milliseconds - Number of milliseconds since Unix epoch
       *     1970-01-01T00:00:00Z.
       * @returns A new `Timestamp` representing the same point in time as the given
       *     number of milliseconds.
       */    static fromMillis(t) {
          const n = Math.floor(t / 1e3), e = Math.floor(1e6 * (t - 1e3 * n));
          return new pt(n, e);
      }
      /**
       * Converts a `Timestamp` to a JavaScript `Date` object. This conversion
       * causes a loss of precision since `Date` objects only support millisecond
       * precision.
       *
       * @returns JavaScript `Date` object representing the same point in time as
       *     this `Timestamp`, with millisecond precision.
       */    toDate() {
          return new Date(this.toMillis());
      }
      /**
       * Converts a `Timestamp` to a numeric timestamp (in milliseconds since
       * epoch). This operation causes a loss of precision.
       *
       * @returns The point in time corresponding to this timestamp, represented as
       *     the number of milliseconds since Unix epoch 1970-01-01T00:00:00Z.
       */    toMillis() {
          return 1e3 * this.seconds + this.nanoseconds / 1e6;
      }
      _compareTo(t) {
          return this.seconds === t.seconds ? wt(this.nanoseconds, t.nanoseconds) : wt(this.seconds, t.seconds);
      }
      /**
       * Returns true if this `Timestamp` is equal to the provided one.
       *
       * @param other - The `Timestamp` to compare against.
       * @returns true if this `Timestamp` is equal to the provided one.
       */    isEqual(t) {
          return t.seconds === this.seconds && t.nanoseconds === this.nanoseconds;
      }
      /** Returns a textual representation of this `Timestamp`. */    toString() {
          return "Timestamp(seconds=" + this.seconds + ", nanoseconds=" + this.nanoseconds + ")";
      }
      /** Returns a JSON-serializable representation of this `Timestamp`. */    toJSON() {
          return {
              seconds: this.seconds,
              nanoseconds: this.nanoseconds
          };
      }
      /**
       * Converts this object to a primitive string, which allows `Timestamp` objects
       * to be compared using the `>`, `<=`, `>=` and `>` operators.
       */    valueOf() {
          // This method returns a string of the form <seconds>.<nanoseconds> where
          // <seconds> is translated to have a non-negative value and both <seconds>
          // and <nanoseconds> are left-padded with zeroes to be a consistent length.
          // Strings with this format then have a lexiographical ordering that matches
          // the expected ordering. The <seconds> translation is done to avoid having
          // a leading negative sign (i.e. a leading '-' character) in its string
          // representation, which would affect its lexiographical ordering.
          const t = this.seconds - -62135596800;
          // Note: Up to 12 decimal digits are required to represent all valid
          // 'seconds' values.
                  return String(t).padStart(12, "0") + "." + String(this.nanoseconds).padStart(9, "0");
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A version of a document in Firestore. This corresponds to the version
   * timestamp, such as update_time or read_time.
   */ class yt {
      constructor(t) {
          this.timestamp = t;
      }
      static fromTimestamp(t) {
          return new yt(t);
      }
      static min() {
          return new yt(new pt(0, 0));
      }
      compareTo(t) {
          return this.timestamp._compareTo(t.timestamp);
      }
      isEqual(t) {
          return this.timestamp.isEqual(t.timestamp);
      }
      /** Returns a number representation of the version for use in spec tests. */    toMicroseconds() {
          // Convert to microseconds.
          return 1e6 * this.timestamp.seconds + this.timestamp.nanoseconds / 1e3;
      }
      toString() {
          return "SnapshotVersion(" + this.timestamp.toString() + ")";
      }
      toTimestamp() {
          return this.timestamp;
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ function _t(t) {
      let n = 0;
      for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n++;
      return n;
  }
  
  function gt(t, n) {
      for (const e in t) Object.prototype.hasOwnProperty.call(t, e) && n(e, t[e]);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Provides a set of fields that can be used to partially patch a document.
   * FieldMask is used in conjunction with ObjectValue.
   * Examples:
   *   foo - Overwrites foo entirely with the provided value. If foo is not
   *         present in the companion ObjectValue, the field is deleted.
   *   foo.bar - Overwrites only the field bar of the object foo.
   *             If foo is not an object, foo is replaced with an object
   *             containing foo
   */
  class bt {
      constructor(t) {
          this.fields = t, 
          // TODO(dimond): validation of FieldMask
          // Sort the field mask to support `FieldMask.isEqual()` and assert below.
          t.sort(J.comparator);
      }
      /**
       * Verifies that `fieldPath` is included by at least one field in this field
       * mask.
       *
       * This is an O(n) operation, where `n` is the size of the field mask.
       */    covers(t) {
          for (const n of this.fields) if (n.isPrefixOf(t)) return !0;
          return !1;
      }
      isEqual(t) {
          return mt(this.fields, t.fields, ((t, n) => t.isEqual(n)));
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /** Converts a Base64 encoded string to a binary string. */
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Immutable class that represents a "proto" byte string.
   *
   * Proto byte strings can either be Base64-encoded strings or Uint8Arrays when
   * sent on the wire. This class abstracts away this differentiation by holding
   * the proto byte string in a common class that must be converted into a string
   * before being sent as a proto.
   * @internal
   */
  class vt {
      constructor(t) {
          this.binaryString = t;
      }
      static fromBase64String(t) {
          const n = atob(t);
          return new vt(n);
      }
      static fromUint8Array(t) {
          const n = 
          /**
   * Helper function to convert an Uint8array to a binary string.
   */
          function(t) {
              let n = "";
              for (let e = 0; e < t.length; ++e) n += String.fromCharCode(t[e]);
              return n;
          }
          /**
   * Helper function to convert a binary string to an Uint8Array.
   */ (t);
          return new vt(n);
      }
      toBase64() {
          return t = this.binaryString, btoa(t);
          /** Converts a binary string to a Base64 encoded string. */
          var t;
      }
      toUint8Array() {
          return function(t) {
              const n = new Uint8Array(t.length);
              for (let e = 0; e < t.length; e++) n[e] = t.charCodeAt(e);
              return n;
          }
          /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
          // A RegExp matching ISO 8601 UTC timestamps with optional fraction.
          (this.binaryString);
      }
      approximateByteSize() {
          return 2 * this.binaryString.length;
      }
      compareTo(t) {
          return wt(this.binaryString, t.binaryString);
      }
      isEqual(t) {
          return this.binaryString === t.binaryString;
      }
  }
  
  vt.EMPTY_BYTE_STRING = new vt("");
  
  const Et = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  
  /**
   * Converts the possible Proto values for a timestamp value into a "seconds and
   * nanos" representation.
   */ function It(t) {
      // The json interface (for the browser) will return an iso timestamp string,
      // while the proto js library (for node) will return a
      // google.protobuf.Timestamp instance.
      if (g(!!t), "string" == typeof t) {
          // The date string can have higher precision (nanos) than the Date class
          // (millis), so we do some custom parsing here.
          // Parse the nanos right out of the string.
          let n = 0;
          const e = Et.exec(t);
          if (g(!!e), e[1]) {
              // Pad the fraction out to 9 digits (nanos).
              let t = e[1];
              t = (t + "000000000").substr(0, 9), n = Number(t);
          }
          // Parse the date to get the seconds.
                  const r = new Date(t);
          return {
              seconds: Math.floor(r.getTime() / 1e3),
              nanos: n
          };
      }
      return {
          seconds: Tt(t.seconds),
          nanos: Tt(t.nanos)
      };
  }
  
  /**
   * Converts the possible Proto types for numbers into a JavaScript number.
   * Returns 0 if the value is not numeric.
   */ function Tt(t) {
      // TODO(bjornick): Handle int64 greater than 53 bits.
      return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
  }
  
  /** Converts the possible Proto types for Blobs into a ByteString. */ function At(t) {
      return "string" == typeof t ? vt.fromBase64String(t) : vt.fromUint8Array(t);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Represents a locally-applied ServerTimestamp.
   *
   * Server Timestamps are backed by MapValues that contain an internal field
   * `__type__` with a value of `server_timestamp`. The previous value and local
   * write time are stored in its `__previous_value__` and `__local_write_time__`
   * fields respectively.
   *
   * Notes:
   * - ServerTimestampValue instances are created as the result of applying a
   *   transform. They can only exist in the local view of a document. Therefore
   *   they do not need to be parsed or serialized.
   * - When evaluated locally (e.g. for snapshot.data()), they by default
   *   evaluate to `null`. This behavior can be configured by passing custom
   *   FieldValueOptions to value().
   * - With respect to other ServerTimestampValues, they sort by their
   *   localWriteTime.
   */ function Pt(t) {
      var n, e;
      return "server_timestamp" === (null === (e = ((null === (n = null == t ? void 0 : t.mapValue) || void 0 === n ? void 0 : n.fields) || {}).__type__) || void 0 === e ? void 0 : e.stringValue);
  }
  
  /**
   * Returns the value of the field before this ServerTimestamp was set.
   *
   * Preserving the previous values allows the user to display the last resoled
   * value until the backend responds with the timestamp.
   */ function Rt(t) {
      const n = t.mapValue.fields.__previous_value__;
      return Pt(n) ? Rt(n) : n;
  }
  
  /**
   * Returns the local time at which this timestamp was first set.
   */ function Vt(t) {
      const n = It(t.mapValue.fields.__local_write_time__.timestampValue);
      return new pt(n.seconds, n.nanos);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /** Extracts the backend's type order for the provided value. */ function Nt(t) {
      return "nullValue" in t ? 0 /* NullValue */ : "booleanValue" in t ? 1 /* BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* NumberValue */ : "timestampValue" in t ? 3 /* TimestampValue */ : "stringValue" in t ? 5 /* StringValue */ : "bytesValue" in t ? 6 /* BlobValue */ : "referenceValue" in t ? 7 /* RefValue */ : "geoPointValue" in t ? 8 /* GeoPointValue */ : "arrayValue" in t ? 9 /* ArrayValue */ : "mapValue" in t ? Pt(t) ? 4 /* ServerTimestampValue */ : 10 /* ObjectValue */ : _();
  }
  
  /** Tests `left` and `right` for equality based on the backend semantics. */ function Dt(t, n) {
      const e = Nt(t);
      if (e !== Nt(n)) return !1;
      switch (e) {
        case 0 /* NullValue */ :
          return !0;
  
        case 1 /* BooleanValue */ :
          return t.booleanValue === n.booleanValue;
  
        case 4 /* ServerTimestampValue */ :
          return Vt(t).isEqual(Vt(n));
  
        case 3 /* TimestampValue */ :
          return function(t, n) {
              if ("string" == typeof t.timestampValue && "string" == typeof n.timestampValue && t.timestampValue.length === n.timestampValue.length) 
              // Use string equality for ISO 8601 timestamps
              return t.timestampValue === n.timestampValue;
              const e = It(t.timestampValue), r = It(n.timestampValue);
              return e.seconds === r.seconds && e.nanos === r.nanos;
          }(t, n);
  
        case 5 /* StringValue */ :
          return t.stringValue === n.stringValue;
  
        case 6 /* BlobValue */ :
          return function(t, n) {
              return At(t.bytesValue).isEqual(At(n.bytesValue));
          }(t, n);
  
        case 7 /* RefValue */ :
          return t.referenceValue === n.referenceValue;
  
        case 8 /* GeoPointValue */ :
          return function(t, n) {
              return Tt(t.geoPointValue.latitude) === Tt(n.geoPointValue.latitude) && Tt(t.geoPointValue.longitude) === Tt(n.geoPointValue.longitude);
          }(t, n);
  
        case 2 /* NumberValue */ :
          return function(t, n) {
              if ("integerValue" in t && "integerValue" in n) return Tt(t.integerValue) === Tt(n.integerValue);
              if ("doubleValue" in t && "doubleValue" in n) {
                  const e = Tt(t.doubleValue), r = Tt(n.doubleValue);
                  return e === r ? ot(e) === ot(r) : isNaN(e) && isNaN(r);
              }
              return !1;
          }(t, n);
  
        case 9 /* ArrayValue */ :
          return mt(t.arrayValue.values || [], n.arrayValue.values || [], Dt);
  
        case 10 /* ObjectValue */ :
          return function(t, n) {
              const e = t.mapValue.fields || {}, r = n.mapValue.fields || {};
              if (_t(e) !== _t(r)) return !1;
              for (const t in e) if (e.hasOwnProperty(t) && (void 0 === r[t] || !Dt(e[t], r[t]))) return !1;
              return !0;
          }
          /** Returns true if the ArrayValue contains the specified element. */ (t, n);
  
        default:
          return _();
      }
  }
  
  function $t(t, n) {
      return void 0 !== (t.values || []).find((t => Dt(t, n)));
  }
  
  function Ft(t, n) {
      const e = Nt(t), r = Nt(n);
      if (e !== r) return wt(e, r);
      switch (e) {
        case 0 /* NullValue */ :
          return 0;
  
        case 1 /* BooleanValue */ :
          return wt(t.booleanValue, n.booleanValue);
  
        case 2 /* NumberValue */ :
          return function(t, n) {
              const e = Tt(t.integerValue || t.doubleValue), r = Tt(n.integerValue || n.doubleValue);
              return e < r ? -1 : e > r ? 1 : e === r ? 0 : 
              // one or both are NaN.
              isNaN(e) ? isNaN(r) ? 0 : -1 : 1;
          }(t, n);
  
        case 3 /* TimestampValue */ :
          return St(t.timestampValue, n.timestampValue);
  
        case 4 /* ServerTimestampValue */ :
          return St(Vt(t), Vt(n));
  
        case 5 /* StringValue */ :
          return wt(t.stringValue, n.stringValue);
  
        case 6 /* BlobValue */ :
          return function(t, n) {
              const e = At(t), r = At(n);
              return e.compareTo(r);
          }(t.bytesValue, n.bytesValue);
  
        case 7 /* RefValue */ :
          return function(t, n) {
              const e = t.split("/"), r = n.split("/");
              for (let t = 0; t < e.length && t < r.length; t++) {
                  const n = wt(e[t], r[t]);
                  if (0 !== n) return n;
              }
              return wt(e.length, r.length);
          }(t.referenceValue, n.referenceValue);
  
        case 8 /* GeoPointValue */ :
          return function(t, n) {
              const e = wt(Tt(t.latitude), Tt(n.latitude));
              if (0 !== e) return e;
              return wt(Tt(t.longitude), Tt(n.longitude));
          }(t.geoPointValue, n.geoPointValue);
  
        case 9 /* ArrayValue */ :
          return function(t, n) {
              const e = t.values || [], r = n.values || [];
              for (let t = 0; t < e.length && t < r.length; ++t) {
                  const n = Ft(e[t], r[t]);
                  if (n) return n;
              }
              return wt(e.length, r.length);
          }(t.arrayValue, n.arrayValue);
  
        case 10 /* ObjectValue */ :
          return function(t, n) {
              const e = t.fields || {}, r = Object.keys(e), s = n.fields || {}, i = Object.keys(s);
              // Even though MapValues are likely sorted correctly based on their insertion
              // order (e.g. when received from the backend), local modifications can bring
              // elements out of order. We need to re-sort the elements to ensure that
              // canonical IDs are independent of insertion order.
              r.sort(), i.sort();
              for (let t = 0; t < r.length && t < i.length; ++t) {
                  const n = wt(r[t], i[t]);
                  if (0 !== n) return n;
                  const o = Ft(e[r[t]], s[i[t]]);
                  if (0 !== o) return o;
              }
              return wt(r.length, i.length);
          }
          /** Returns a reference value for the provided database and key. */ (t.mapValue, n.mapValue);
  
        default:
          throw _();
      }
  }
  
  function St(t, n) {
      if ("string" == typeof t && "string" == typeof n && t.length === n.length) return wt(t, n);
      const e = It(t), r = It(n), s = wt(e.seconds, r.seconds);
      return 0 !== s ? s : wt(e.nanos, r.nanos);
  }
  
  function qt(t, n) {
      return {
          referenceValue: `projects/${t.projectId}/databases/${t.database}/documents/${n.path.canonicalString()}`
      };
  }
  
  /** Returns true if `value` is an ArrayValue. */ function xt(t) {
      return !!t && "arrayValue" in t;
  }
  
  /** Returns true if `value` is a NullValue. */ function Ot(t) {
      return !!t && "nullValue" in t;
  }
  
  /** Returns true if `value` is NaN. */ function Ct(t) {
      return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
  }
  
  /** Returns true if `value` is a MapValue. */ function Lt(t) {
      return !!t && "mapValue" in t;
  }
  
  /** Creates a deep copy of `source`. */ function Ut(t) {
      if (t.geoPointValue) return {
          geoPointValue: Object.assign({}, t.geoPointValue)
      };
      if (t.timestampValue && "object" == typeof t.timestampValue) return {
          timestampValue: Object.assign({}, t.timestampValue)
      };
      if (t.mapValue) {
          const n = {
              mapValue: {
                  fields: {}
              }
          };
          return gt(t.mapValue.fields, ((t, e) => n.mapValue.fields[t] = Ut(e))), n;
      }
      if (t.arrayValue) {
          const n = {
              arrayValue: {
                  values: []
              }
          };
          for (let e = 0; e < (t.arrayValue.values || []).length; ++e) n.arrayValue.values[e] = Ut(t.arrayValue.values[e]);
          return n;
      }
      return Object.assign({}, t);
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * An ObjectValue represents a MapValue in the Firestore Proto and offers the
   * ability to add and remove fields (via the ObjectValueBuilder).
   */ class jt {
      constructor(t) {
          this.value = t;
      }
      static empty() {
          return new jt({
              mapValue: {}
          });
      }
      /**
       * Returns the value at the given path or null.
       *
       * @param path - the path to search
       * @returns The value at the path or null if the path is not set.
       */    field(t) {
          if (t.isEmpty()) return this.value;
          {
              let n = this.value;
              for (let e = 0; e < t.length - 1; ++e) if (n = (n.mapValue.fields || {})[t.get(e)], 
              !Lt(n)) return null;
              return n = (n.mapValue.fields || {})[t.lastSegment()], n || null;
          }
      }
      /**
       * Sets the field to the provided value.
       *
       * @param path - The field path to set.
       * @param value - The value to set.
       */    set(t, n) {
          this.getFieldsMap(t.popLast())[t.lastSegment()] = Ut(n);
      }
      /**
       * Sets the provided fields to the provided values.
       *
       * @param data - A map of fields to values (or null for deletes).
       */    setAll(t) {
          let n = J.emptyPath(), e = {}, r = [];
          t.forEach(((t, s) => {
              if (!n.isImmediateParentOf(s)) {
                  // Insert the accumulated changes at this parent location
                  const t = this.getFieldsMap(n);
                  this.applyChanges(t, e, r), e = {}, r = [], n = s.popLast();
              }
              t ? e[s.lastSegment()] = Ut(t) : r.push(s.lastSegment());
          }));
          const s = this.getFieldsMap(n);
          this.applyChanges(s, e, r);
      }
      /**
       * Removes the field at the specified path. If there is no field at the
       * specified path, nothing is changed.
       *
       * @param path - The field path to remove.
       */    delete(t) {
          const n = this.field(t.popLast());
          Lt(n) && n.mapValue.fields && delete n.mapValue.fields[t.lastSegment()];
      }
      isEqual(t) {
          return Dt(this.value, t.value);
      }
      /**
       * Returns the map that contains the leaf element of `path`. If the parent
       * entry does not yet exist, or if it is not a map, a new map will be created.
       */    getFieldsMap(t) {
          let n = this.value;
          n.mapValue.fields || (n.mapValue = {
              fields: {}
          });
          for (let e = 0; e < t.length; ++e) {
              let r = n.mapValue.fields[t.get(e)];
              Lt(r) && r.mapValue.fields || (r = {
                  mapValue: {
                      fields: {}
                  }
              }, n.mapValue.fields[t.get(e)] = r), n = r;
          }
          return n.mapValue.fields;
      }
      /**
       * Modifies `fieldsMap` by adding, replacing or deleting the specified
       * entries.
       */    applyChanges(t, n, e) {
          gt(n, ((n, e) => t[n] = e));
          for (const n of e) delete t[n];
      }
      clone() {
          return new jt(Ut(this.value));
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Represents a document in Firestore with a key, version, data and whether it
   * has local mutations applied to it.
   *
   * Documents can transition between states via `convertToFoundDocument()`,
   * `convertToNoDocument()` and `convertToUnknownDocument()`. If a document does
   * not transition to one of these states even after all mutations have been
   * applied, `isValidDocument()` returns false and the document should be removed
   * from all views.
   */ class kt {
      constructor(t, n, e, r, s) {
          this.key = t, this.documentType = n, this.version = e, this.data = r, this.documentState = s;
      }
      /**
       * Creates a document with no known version or data, but which can serve as
       * base document for mutations.
       */    static newInvalidDocument(t) {
          return new kt(t, 0 /* INVALID */ , yt.min(), jt.empty(), 0 /* SYNCED */);
      }
      /**
       * Creates a new document that is known to exist with the given data at the
       * given version.
       */    static newFoundDocument(t, n, e) {
          return new kt(t, 1 /* FOUND_DOCUMENT */ , n, e, 0 /* SYNCED */);
      }
      /** Creates a new document that is known to not exist at the given version. */    static newNoDocument(t, n) {
          return new kt(t, 2 /* NO_DOCUMENT */ , n, jt.empty(), 0 /* SYNCED */);
      }
      /**
       * Creates a new document that is known to exist at the given version but
       * whose data is not known (e.g. a document that was updated without a known
       * base document).
       */    static newUnknownDocument(t, n) {
          return new kt(t, 3 /* UNKNOWN_DOCUMENT */ , n, jt.empty(), 2 /* HAS_COMMITTED_MUTATIONS */);
      }
      /**
       * Changes the document type to indicate that it exists and that its version
       * and data are known.
       */    convertToFoundDocument(t, n) {
          return this.version = t, this.documentType = 1 /* FOUND_DOCUMENT */ , this.data = n, 
          this.documentState = 0 /* SYNCED */ , this;
      }
      /**
       * Changes the document type to indicate that it doesn't exist at the given
       * version.
       */    convertToNoDocument(t) {
          return this.version = t, this.documentType = 2 /* NO_DOCUMENT */ , this.data = jt.empty(), 
          this.documentState = 0 /* SYNCED */ , this;
      }
      /**
       * Changes the document type to indicate that it exists at a given version but
       * that its data is not known (e.g. a document that was updated without a known
       * base document).
       */    convertToUnknownDocument(t) {
          return this.version = t, this.documentType = 3 /* UNKNOWN_DOCUMENT */ , this.data = jt.empty(), 
          this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
      }
      setHasCommittedMutations() {
          return this.documentState = 2 /* HAS_COMMITTED_MUTATIONS */ , this;
      }
      setHasLocalMutations() {
          return this.documentState = 1 /* HAS_LOCAL_MUTATIONS */ , this;
      }
      get hasLocalMutations() {
          return 1 /* HAS_LOCAL_MUTATIONS */ === this.documentState;
      }
      get hasCommittedMutations() {
          return 2 /* HAS_COMMITTED_MUTATIONS */ === this.documentState;
      }
      get hasPendingWrites() {
          return this.hasLocalMutations || this.hasCommittedMutations;
      }
      isValidDocument() {
          return 0 /* INVALID */ !== this.documentType;
      }
      isFoundDocument() {
          return 1 /* FOUND_DOCUMENT */ === this.documentType;
      }
      isNoDocument() {
          return 2 /* NO_DOCUMENT */ === this.documentType;
      }
      isUnknownDocument() {
          return 3 /* UNKNOWN_DOCUMENT */ === this.documentType;
      }
      isEqual(t) {
          return t instanceof kt && this.key.isEqual(t.key) && this.version.isEqual(t.version) && this.documentType === t.documentType && this.documentState === t.documentState && this.data.isEqual(t.data);
      }
      clone() {
          return new kt(this.key, this.documentType, this.version, this.data.clone(), this.documentState);
      }
      toString() {
          return `Document(${this.key}, ${this.version}, ${JSON.stringify(this.data.value)}, {documentType: ${this.documentType}}), {documentState: ${this.documentState}})`;
      }
  }
  
  /**
   * @license
   * Copyright 2019 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  // Visible for testing
  class Mt {
      constructor(t, n = null, e = [], r = [], s = null, i = null, o = null) {
          this.path = t, this.collectionGroup = n, this.orderBy = e, this.filters = r, this.limit = s, 
          this.startAt = i, this.endAt = o, this.P = null;
      }
  }
  
  /**
   * Initializes a Target with a path and optional additional query constraints.
   * Path must currently be empty if this is a collection group query.
   *
   * NOTE: you should always construct `Target` from `Query.toTarget` instead of
   * using this factory method, because `Query` provides an implicit `orderBy`
   * property.
   */ function Bt(t, n = null, e = [], r = [], s = null, i = null, o = null) {
      return new Mt(t, n, e, r, s, i, o);
  }
  
  class Qt extends class {} {
      constructor(t, n, e) {
          super(), this.field = t, this.op = n, this.value = e;
      }
      /**
       * Creates a filter based on the provided arguments.
       */    static create(t, n, e) {
          return t.isKeyField() ? "in" /* IN */ === n || "not-in" /* NOT_IN */ === n ? this.R(t, n, e) : new zt(t, n, e) : "array-contains" /* ARRAY_CONTAINS */ === n ? new Yt(t, e) : "in" /* IN */ === n ? new Kt(t, e) : "not-in" /* NOT_IN */ === n ? new Jt(t, e) : "array-contains-any" /* ARRAY_CONTAINS_ANY */ === n ? new Zt(t, e) : new Qt(t, n, e);
      }
      static R(t, n, e) {
          return "in" /* IN */ === n ? new Wt(t, e) : new Gt(t, e);
      }
      matches(t) {
          const n = t.data.field(this.field);
          // Types do not have to match in NOT_EQUAL filters.
                  return "!=" /* NOT_EQUAL */ === this.op ? null !== n && this.V(Ft(n, this.value)) : null !== n && Nt(this.value) === Nt(n) && this.V(Ft(n, this.value));
          // Only compare types with matching backend order (such as double and int).
          }
      V(t) {
          switch (this.op) {
            case "<" /* LESS_THAN */ :
              return t < 0;
  
            case "<=" /* LESS_THAN_OR_EQUAL */ :
              return t <= 0;
  
            case "==" /* EQUAL */ :
              return 0 === t;
  
            case "!=" /* NOT_EQUAL */ :
              return 0 !== t;
  
            case ">" /* GREATER_THAN */ :
              return t > 0;
  
            case ">=" /* GREATER_THAN_OR_EQUAL */ :
              return t >= 0;
  
            default:
              return _();
          }
      }
      N() {
          return [ "<" /* LESS_THAN */ , "<=" /* LESS_THAN_OR_EQUAL */ , ">" /* GREATER_THAN */ , ">=" /* GREATER_THAN_OR_EQUAL */ , "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ].indexOf(this.op) >= 0;
      }
  }
  
  /** Filter that matches on key fields (i.e. '__name__'). */
  class zt extends Qt {
      constructor(t, n, e) {
          super(t, n, e), this.key = Z.fromName(e.referenceValue);
      }
      matches(t) {
          const n = Z.comparator(t.key, this.key);
          return this.V(n);
      }
  }
  
  /** Filter that matches on key fields within an array. */ class Wt extends Qt {
      constructor(t, n) {
          super(t, "in" /* IN */ , n), this.keys = Ht("in" /* IN */ , n);
      }
      matches(t) {
          return this.keys.some((n => n.isEqual(t.key)));
      }
  }
  
  /** Filter that matches on key fields not present within an array. */ class Gt extends Qt {
      constructor(t, n) {
          super(t, "not-in" /* NOT_IN */ , n), this.keys = Ht("not-in" /* NOT_IN */ , n);
      }
      matches(t) {
          return !this.keys.some((n => n.isEqual(t.key)));
      }
  }
  
  function Ht(t, n) {
      var e;
      return ((null === (e = n.arrayValue) || void 0 === e ? void 0 : e.values) || []).map((t => Z.fromName(t.referenceValue)));
  }
  
  /** A Filter that implements the array-contains operator. */ class Yt extends Qt {
      constructor(t, n) {
          super(t, "array-contains" /* ARRAY_CONTAINS */ , n);
      }
      matches(t) {
          const n = t.data.field(this.field);
          return xt(n) && $t(n.arrayValue, this.value);
      }
  }
  
  /** A Filter that implements the IN operator. */ class Kt extends Qt {
      constructor(t, n) {
          super(t, "in" /* IN */ , n);
      }
      matches(t) {
          const n = t.data.field(this.field);
          return null !== n && $t(this.value.arrayValue, n);
      }
  }
  
  /** A Filter that implements the not-in operator. */ class Jt extends Qt {
      constructor(t, n) {
          super(t, "not-in" /* NOT_IN */ , n);
      }
      matches(t) {
          if ($t(this.value.arrayValue, {
              nullValue: "NULL_VALUE"
          })) return !1;
          const n = t.data.field(this.field);
          return null !== n && !$t(this.value.arrayValue, n);
      }
  }
  
  /** A Filter that implements the array-contains-any operator. */ class Zt extends Qt {
      constructor(t, n) {
          super(t, "array-contains-any" /* ARRAY_CONTAINS_ANY */ , n);
      }
      matches(t) {
          const n = t.data.field(this.field);
          return !(!xt(n) || !n.arrayValue.values) && n.arrayValue.values.some((t => $t(this.value.arrayValue, t)));
      }
  }
  
  /**
   * Represents a bound of a query.
   *
   * The bound is specified with the given components representing a position and
   * whether it's just before or just after the position (relative to whatever the
   * query order is).
   *
   * The position represents a logical index position for a query. It's a prefix
   * of values for the (potentially implicit) order by clauses of a query.
   *
   * Bound provides a function to determine whether a document comes before or
   * after a bound. This is influenced by whether the position is just before or
   * just after the provided values.
   */ class Xt {
      constructor(t, n) {
          this.position = t, this.before = n;
      }
  }
  
  /**
   * An ordering on a field, in some Direction. Direction defaults to ASCENDING.
   */ class tn {
      constructor(t, n = "asc" /* ASCENDING */) {
          this.field = t, this.dir = n;
      }
  }
  
  function nn(t, n) {
      return t.dir === n.dir && t.field.isEqual(n.field);
  }
  
  function en(t, n) {
      if (null === t) return null === n;
      if (null === n) return !1;
      if (t.before !== n.before || t.position.length !== n.position.length) return !1;
      for (let e = 0; e < t.position.length; e++) {
          if (!Dt(t.position[e], n.position[e])) return !1;
      }
      return !0;
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Query encapsulates all the query attributes we support in the SDK. It can
   * be run against the LocalStore, as well as be converted to a `Target` to
   * query the RemoteStore results.
   *
   * Visible for testing.
   */ class rn {
      /**
       * Initializes a Query with a path and optional additional query constraints.
       * Path must currently be empty if this is a collection group query.
       */
      constructor(t, n = null, e = [], r = [], s = null, i = "F" /* First */ , o = null, u = null) {
          this.path = t, this.collectionGroup = n, this.explicitOrderBy = e, this.filters = r, 
          this.limit = s, this.limitType = i, this.startAt = o, this.endAt = u, this.D = null, 
          // The corresponding `Target` of this `Query` instance.
          this.$ = null, this.startAt, this.endAt;
      }
  }
  
  /** Creates a new Query for a query that matches all documents at `path` */ function sn(t) {
      return !it(t.limit) && "L" /* Last */ === t.limitType;
  }
  
  function on(t) {
      return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
  }
  
  function un(t) {
      for (const n of t.filters) if (n.N()) return n.field;
      return null;
  }
  
  /**
   * Checks if any of the provided Operators are included in the query and
   * returns the first one that is, or null if none are.
   */
  /**
   * Returns whether the query matches a collection group rather than a specific
   * collection.
   */
  function cn(t) {
      return null !== t.collectionGroup;
  }
  
  /**
   * Returns the implicit order by constraint that is used to execute the Query,
   * which can be different from the order by constraints the user provided (e.g.
   * the SDK and backend always orders by `__name__`).
   */ function an(t) {
      const n = b(t);
      if (null === n.D) {
          n.D = [];
          const t = un(n), e = on(n);
          if (null !== t && null === e) 
          // In order to implicitly add key ordering, we must also add the
          // inequality filter field for it to be a valid query.
          // Note that the default inequality field and key ordering is ascending.
          t.isKeyField() || n.D.push(new tn(t)), n.D.push(new tn(J.keyField(), "asc" /* ASCENDING */)); else {
              let t = !1;
              for (const e of n.explicitOrderBy) n.D.push(e), e.field.isKeyField() && (t = !0);
              if (!t) {
                  // The order of the implicit key ordering always matches the last
                  // explicit order by
                  const t = n.explicitOrderBy.length > 0 ? n.explicitOrderBy[n.explicitOrderBy.length - 1].dir : "asc" /* ASCENDING */;
                  n.D.push(new tn(J.keyField(), t));
              }
          }
      }
      return n.D;
  }
  
  /**
   * Converts this `Query` instance to it's corresponding `Target` representation.
   */ function hn(t) {
      const n = b(t);
      if (!n.$) if ("F" /* First */ === n.limitType) n.$ = Bt(n.path, n.collectionGroup, an(n), n.filters, n.limit, n.startAt, n.endAt); else {
          // Flip the orderBy directions since we want the last results
          const t = [];
          for (const e of an(n)) {
              const n = "desc" /* DESCENDING */ === e.dir ? "asc" /* ASCENDING */ : "desc" /* DESCENDING */;
              t.push(new tn(e.field, n));
          }
          // We need to swap the cursors to match the now-flipped query ordering.
                  const e = n.endAt ? new Xt(n.endAt.position, !n.endAt.before) : null, r = n.startAt ? new Xt(n.startAt.position, !n.startAt.before) : null;
          // Now return as a LimitType.First query.
          n.$ = Bt(n.path, n.collectionGroup, t, n.filters, n.limit, e, r);
      }
      return n.$;
  }
  
  function ln(t, n) {
      return function(t, n) {
          if (t.limit !== n.limit) return !1;
          if (t.orderBy.length !== n.orderBy.length) return !1;
          for (let e = 0; e < t.orderBy.length; e++) if (!nn(t.orderBy[e], n.orderBy[e])) return !1;
          if (t.filters.length !== n.filters.length) return !1;
          for (let s = 0; s < t.filters.length; s++) if (e = t.filters[s], r = n.filters[s], 
          e.op !== r.op || !e.field.isEqual(r.field) || !Dt(e.value, r.value)) return !1;
          var e, r;
          return t.collectionGroup === n.collectionGroup && !!t.path.isEqual(n.path) && !!en(t.startAt, n.startAt) && en(t.endAt, n.endAt);
      }(hn(t), hn(n)) && t.limitType === n.limitType;
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Returns an DoubleValue for `value` that is encoded based the serializer's
   * `useProto3Json` setting.
   */
  /**
   * Returns a value for a number that's appropriate to put into a proto.
   * The return value is an IntegerValue if it can safely represent the value,
   * otherwise a DoubleValue is returned.
   */
  function fn(t, n) {
      return function(t) {
          return "number" == typeof t && Number.isInteger(t) && !ot(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
      }(n) ? 
      /**
   * Returns an IntegerValue for `value`.
   */
      function(t) {
          return {
              integerValue: "" + t
          };
      }(n) : function(t, n) {
          if (t.F) {
              if (isNaN(n)) return {
                  doubleValue: "NaN"
              };
              if (n === 1 / 0) return {
                  doubleValue: "Infinity"
              };
              if (n === -1 / 0) return {
                  doubleValue: "-Infinity"
              };
          }
          return {
              doubleValue: ot(n) ? "-0" : n
          };
      }(t, n);
  }
  
  /**
   * @license
   * Copyright 2018 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /** Used to represent a field transform on a mutation. */ class dn {
      constructor() {
          // Make sure that the structural type of `TransformOperation` is unique.
          // See https://github.com/microsoft/TypeScript/issues/5451
          this._ = void 0;
      }
  }
  
  /** Transforms a value into a server-generated timestamp. */ class wn extends dn {}
  
  /** Transforms an array value via a union operation. */ class mn extends dn {
      constructor(t) {
          super(), this.elements = t;
      }
  }
  
  /** Transforms an array value via a remove operation. */ class pn extends dn {
      constructor(t) {
          super(), this.elements = t;
      }
  }
  
  /**
   * Implements the backend semantics for locally computed NUMERIC_ADD (increment)
   * transforms. Converts all field values to integers or doubles, but unlike the
   * backend does not cap integer values at 2^63. Instead, JavaScript number
   * arithmetic is used and precision loss can occur for values greater than 2^53.
   */ class yn extends dn {
      constructor(t, n) {
          super(), this.S = t, this.q = n;
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /** A field path and the TransformOperation to perform upon it. */ class _n {
      constructor(t, n) {
          this.field = t, this.transform = n;
      }
  }
  
  /**
   * Encodes a precondition for a mutation. This follows the model that the
   * backend accepts with the special case of an explicit "empty" precondition
   * (meaning no precondition).
   */ class gn {
      constructor(t, n) {
          this.updateTime = t, this.exists = n;
      }
      /** Creates a new empty Precondition. */    static none() {
          return new gn;
      }
      /** Creates a new Precondition with an exists flag. */    static exists(t) {
          return new gn(void 0, t);
      }
      /** Creates a new Precondition based on a version a document exists at. */    static updateTime(t) {
          return new gn(t);
      }
      /** Returns whether this Precondition is empty. */    get isNone() {
          return void 0 === this.updateTime && void 0 === this.exists;
      }
      isEqual(t) {
          return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
      }
  }
  
  /**
   * A mutation describes a self-contained change to a document. Mutations can
   * create, replace, delete, and update subsets of documents.
   *
   * Mutations not only act on the value of the document but also its version.
   *
   * For local mutations (mutations that haven't been committed yet), we preserve
   * the existing version for Set and Patch mutations. For Delete mutations, we
   * reset the version to 0.
   *
   * Here's the expected transition table.
   *
   * MUTATION           APPLIED TO            RESULTS IN
   *
   * SetMutation        Document(v3)          Document(v3)
   * SetMutation        NoDocument(v3)        Document(v0)
   * SetMutation        InvalidDocument(v0)   Document(v0)
   * PatchMutation      Document(v3)          Document(v3)
   * PatchMutation      NoDocument(v3)        NoDocument(v3)
   * PatchMutation      InvalidDocument(v0)   UnknownDocument(v3)
   * DeleteMutation     Document(v3)          NoDocument(v0)
   * DeleteMutation     NoDocument(v3)        NoDocument(v0)
   * DeleteMutation     InvalidDocument(v0)   NoDocument(v0)
   *
   * For acknowledged mutations, we use the updateTime of the WriteResponse as
   * the resulting version for Set and Patch mutations. As deletes have no
   * explicit update time, we use the commitTime of the WriteResponse for
   * Delete mutations.
   *
   * If a mutation is acknowledged by the backend but fails the precondition check
   * locally, we transition to an `UnknownDocument` and rely on Watch to send us
   * the updated version.
   *
   * Field transforms are used only with Patch and Set Mutations. We use the
   * `updateTransforms` message to store transforms, rather than the `transforms`s
   * messages.
   *
   * ## Subclassing Notes
   *
   * Every type of mutation needs to implement its own applyToRemoteDocument() and
   * applyToLocalView() to implement the actual behavior of applying the mutation
   * to some source document (see `setMutationApplyToRemoteDocument()` for an
   * example).
   */ class bn {}
  
  /**
   * A mutation that creates or replaces the document at the given key with the
   * object value contents.
   */ class vn extends bn {
      constructor(t, n, e, r = []) {
          super(), this.key = t, this.value = n, this.precondition = e, this.fieldTransforms = r, 
          this.type = 0 /* Set */;
      }
  }
  
  /**
   * A mutation that modifies fields of the document at the given key with the
   * given values. The values are applied through a field mask:
   *
   *  * When a field is in both the mask and the values, the corresponding field
   *    is updated.
   *  * When a field is in neither the mask nor the values, the corresponding
   *    field is unmodified.
   *  * When a field is in the mask but not in the values, the corresponding field
   *    is deleted.
   *  * When a field is not in the mask but is in the values, the values map is
   *    ignored.
   */ class En extends bn {
      constructor(t, n, e, r, s = []) {
          super(), this.key = t, this.data = n, this.fieldMask = e, this.precondition = r, 
          this.fieldTransforms = s, this.type = 1 /* Patch */;
      }
  }
  
  /** A mutation that deletes the document at the given key. */ class In extends bn {
      constructor(t, n) {
          super(), this.key = t, this.precondition = n, this.type = 2 /* Delete */ , this.fieldTransforms = [];
      }
  }
  
  /**
   * A mutation that verifies the existence of the document at the given key with
   * the provided precondition.
   *
   * The `verify` operation is only used in Transactions, and this class serves
   * primarily to facilitate serialization into protos.
   */ class Tn extends bn {
      constructor(t, n) {
          super(), this.key = t, this.precondition = n, this.type = 3 /* Verify */ , this.fieldTransforms = [];
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ const An = (() => {
      const t = {
          asc: "ASCENDING",
          desc: "DESCENDING"
      };
      return t;
  })(), Pn = (() => {
      const t = {
          "<": "LESS_THAN",
          "<=": "LESS_THAN_OR_EQUAL",
          ">": "GREATER_THAN",
          ">=": "GREATER_THAN_OR_EQUAL",
          "==": "EQUAL",
          "!=": "NOT_EQUAL",
          "array-contains": "ARRAY_CONTAINS",
          in: "IN",
          "not-in": "NOT_IN",
          "array-contains-any": "ARRAY_CONTAINS_ANY"
      };
      return t;
  })();
  
  /**
   * This class generates JsonObject values for the Datastore API suitable for
   * sending to either GRPC stub methods or via the JSON/HTTP REST API.
   *
   * The serializer supports both Protobuf.js and Proto3 JSON formats. By
   * setting `useProto3Json` to true, the serializer will use the Proto3 JSON
   * format.
   *
   * For a description of the Proto3 JSON format check
   * https://developers.google.com/protocol-buffers/docs/proto3#json
   *
   * TODO(klimt): We can remove the databaseId argument if we keep the full
   * resource name in documents.
   */
  class Rn {
      constructor(t, n) {
          this.databaseId = t, this.F = n;
      }
  }
  
  /**
   * Returns a value for a number (or null) that's appropriate to put into
   * a google.protobuf.Int32Value proto.
   * DO NOT USE THIS FOR ANYTHING ELSE.
   * This method cheats. It's typed as returning "number" because that's what
   * our generated proto interfaces say Int32Value must be. But GRPC actually
   * expects a { value: <number> } struct.
   */
  /**
   * Returns a value for a Date that's appropriate to put into a proto.
   */
  function Vn(t, n) {
      if (t.F) {
          return `${new Date(1e3 * n.seconds).toISOString().replace(/\.\d*/, "").replace("Z", "")}.${("000000000" + n.nanoseconds).slice(-9)}Z`;
      }
      return {
          seconds: "" + n.seconds,
          nanos: n.nanoseconds
      };
  }
  
  /**
   * Returns a value for bytes that's appropriate to put in a proto.
   *
   * Visible for testing.
   */
  function Nn(t, n) {
      return t.F ? n.toBase64() : n.toUint8Array();
  }
  
  function Dn(t, n) {
      return Vn(t, n.toTimestamp());
  }
  
  function $n(t) {
      return g(!!t), yt.fromTimestamp(function(t) {
          const n = It(t);
          return new pt(n.seconds, n.nanos);
      }(t));
  }
  
  function Fn(t, n) {
      return function(t) {
          return new Y([ "projects", t.projectId, "databases", t.database ]);
      }(t).child("documents").child(n).canonicalString();
  }
  
  function Sn(t, n) {
      return Fn(t.databaseId, n.path);
  }
  
  function qn(t, n) {
      const e = function(t) {
          const n = Y.fromString(t);
          return g(Wn(n)), n;
      }(n);
      if (e.get(1) !== t.databaseId.projectId) throw new L(T, "Tried to deserialize key from different project: " + e.get(1) + " vs " + t.databaseId.projectId);
      if (e.get(3) !== t.databaseId.database) throw new L(T, "Tried to deserialize key from different database: " + e.get(3) + " vs " + t.databaseId.database);
      return new Z((g((r = e).length > 4 && "documents" === r.get(4)), r.popFirst(5)));
      var r;
      /** Creates a Document proto from key and fields (but no create/update time) */}
  
  function xn(t, n) {
      return Fn(t.databaseId, n);
  }
  
  function On(t) {
      return new Y([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
  }
  
  function Cn(t, n, e) {
      return {
          name: Sn(t, n),
          fields: e.value.mapValue.fields
      };
  }
  
  function Ln(t, n) {
      return "found" in n ? function(t, n) {
          g(!!n.found), n.found.name, n.found.updateTime;
          const e = qn(t, n.found.name), r = $n(n.found.updateTime), s = new jt({
              mapValue: {
                  fields: n.found.fields
              }
          });
          return kt.newFoundDocument(e, r, s);
      }(t, n) : "missing" in n ? function(t, n) {
          g(!!n.missing), g(!!n.readTime);
          const e = qn(t, n.missing), r = $n(n.readTime);
          return kt.newNoDocument(e, r);
      }(t, n) : _();
  }
  
  function Un(t, n) {
      let e;
      if (n instanceof vn) e = {
          update: Cn(t, n.key, n.value)
      }; else if (n instanceof In) e = {
          delete: Sn(t, n.key)
      }; else if (n instanceof En) e = {
          update: Cn(t, n.key, n.data),
          updateMask: zn(n.fieldMask)
      }; else {
          if (!(n instanceof Tn)) return _();
          e = {
              verify: Sn(t, n.key)
          };
      }
      return n.fieldTransforms.length > 0 && (e.updateTransforms = n.fieldTransforms.map((t => function(t, n) {
          const e = n.transform;
          if (e instanceof wn) return {
              fieldPath: n.field.canonicalString(),
              setToServerValue: "REQUEST_TIME"
          };
          if (e instanceof mn) return {
              fieldPath: n.field.canonicalString(),
              appendMissingElements: {
                  values: e.elements
              }
          };
          if (e instanceof pn) return {
              fieldPath: n.field.canonicalString(),
              removeAllFromArray: {
                  values: e.elements
              }
          };
          if (e instanceof yn) return {
              fieldPath: n.field.canonicalString(),
              increment: e.q
          };
          throw _();
      }(0, t)))), n.precondition.isNone || (e.currentDocument = function(t, n) {
          return void 0 !== n.updateTime ? {
              updateTime: Dn(t, n.updateTime)
          } : void 0 !== n.exists ? {
              exists: n.exists
          } : _();
      }(t, n.precondition)), e;
  }
  
  function jn(t, n) {
      // Dissect the path into parent, collectionId, and optional key filter.
      const e = {
          structuredQuery: {}
      }, r = n.path;
      null !== n.collectionGroup ? (e.parent = xn(t, r), e.structuredQuery.from = [ {
          collectionId: n.collectionGroup,
          allDescendants: !0
      } ]) : (e.parent = xn(t, r.popLast()), e.structuredQuery.from = [ {
          collectionId: r.lastSegment()
      } ]);
      const s = function(t) {
          if (0 === t.length) return;
          const n = t.map((t => 
          // visible for testing
          function(t) {
              if ("==" /* EQUAL */ === t.op) {
                  if (Ct(t.value)) return {
                      unaryFilter: {
                          field: Qn(t.field),
                          op: "IS_NAN"
                      }
                  };
                  if (Ot(t.value)) return {
                      unaryFilter: {
                          field: Qn(t.field),
                          op: "IS_NULL"
                      }
                  };
              } else if ("!=" /* NOT_EQUAL */ === t.op) {
                  if (Ct(t.value)) return {
                      unaryFilter: {
                          field: Qn(t.field),
                          op: "IS_NOT_NAN"
                      }
                  };
                  if (Ot(t.value)) return {
                      unaryFilter: {
                          field: Qn(t.field),
                          op: "IS_NOT_NULL"
                      }
                  };
              }
              return {
                  fieldFilter: {
                      field: Qn(t.field),
                      op: Bn(t.op),
                      value: t.value
                  }
              };
          }(t)));
          if (1 === n.length) return n[0];
          return {
              compositeFilter: {
                  op: "AND",
                  filters: n
              }
          };
      }(n.filters);
      s && (e.structuredQuery.where = s);
      const i = function(t) {
          if (0 === t.length) return;
          return t.map((t => 
          // visible for testing
          function(t) {
              return {
                  field: Qn(t.field),
                  direction: Mn(t.dir)
              };
          }(t)));
      }(n.orderBy);
      i && (e.structuredQuery.orderBy = i);
      const o = function(t, n) {
          return t.F || it(n) ? n : {
              value: n
          };
      }(t, n.limit);
      return null !== o && (e.structuredQuery.limit = o), n.startAt && (e.structuredQuery.startAt = kn(n.startAt)), 
      n.endAt && (e.structuredQuery.endAt = kn(n.endAt)), e;
  }
  
  function kn(t) {
      return {
          before: t.before,
          values: t.position
      };
  }
  
  // visible for testing
  function Mn(t) {
      return An[t];
  }
  
  // visible for testing
  function Bn(t) {
      return Pn[t];
  }
  
  function Qn(t) {
      return {
          fieldPath: t.canonicalString()
      };
  }
  
  function zn(t) {
      const n = [];
      return t.fields.forEach((t => n.push(t.canonicalString()))), {
          fieldPaths: n
      };
  }
  
  function Wn(t) {
      // Resource names have at least 4 components (project ID, database ID)
      return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ function Gn(t) {
      return new Rn(t, /* useProto3Json= */ !0);
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A helper for running delayed tasks following an exponential backoff curve
   * between attempts.
   *
   * Each delay is made up of a "base" delay which follows the exponential
   * backoff curve, and a +/- 50% "jitter" that is calculated and added to the
   * base delay. This prevents clients from accidentally synchronizing their
   * delays causing spikes of load to the backend.
   */
  class Hn {
      constructor(
      /**
       * The AsyncQueue to run backoff operations on.
       */
      t, 
      /**
       * The ID to use when scheduling backoff operations on the AsyncQueue.
       */
      n, 
      /**
       * The initial delay (used as the base delay on the first retry attempt).
       * Note that jitter will still be applied, so the actual delay could be as
       * little as 0.5*initialDelayMs.
       */
      e = 1e3
      /**
       * The multiplier to use to determine the extended base delay after each
       * attempt.
       */ , r = 1.5
      /**
       * The maximum base delay after which no further backoff is performed.
       * Note that jitter will still be applied, so the actual delay could be as
       * much as 1.5*maxDelayMs.
       */ , s = 6e4) {
          this.O = t, this.timerId = n, this.C = e, this.L = r, this.U = s, this.j = 0, this.k = null, 
          /** The last backoff attempt, as epoch milliseconds. */
          this.M = Date.now(), this.reset();
      }
      /**
       * Resets the backoff delay.
       *
       * The very next backoffAndWait() will have no delay. If it is called again
       * (i.e. due to an error), initialDelayMs (plus jitter) will be used, and
       * subsequent ones will increase according to the backoffFactor.
       */    reset() {
          this.j = 0;
      }
      /**
       * Resets the backoff delay to the maximum delay (e.g. for use after a
       * RESOURCE_EXHAUSTED error).
       */    B() {
          this.j = this.U;
      }
      /**
       * Returns a promise that resolves after currentDelayMs, and increases the
       * delay for any subsequent attempts. If there was a pending backoff operation
       * already, it will be canceled.
       */    W(t) {
          // Cancel any pending backoff operation.
          this.cancel();
          // First schedule using the current base (which may be 0 and should be
          // honored as such).
          const n = Math.floor(this.j + this.G()), e = Math.max(0, Date.now() - this.M), r = Math.max(0, n - e);
          // Guard against lastAttemptTime being in the future due to a clock change.
                  r > 0 && w("ExponentialBackoff", `Backing off for ${r} ms (base delay: ${this.j} ms, delay with jitter: ${n} ms, last attempt: ${e} ms ago)`), 
          this.k = this.O.enqueueAfterDelay(this.timerId, r, (() => (this.M = Date.now(), 
          t()))), 
          // Apply backoff factor to determine next delay and ensure it is within
          // bounds.
          this.j *= this.L, this.j < this.C && (this.j = this.C), this.j > this.U && (this.j = this.U);
      }
      H() {
          null !== this.k && (this.k.skipDelay(), this.k = null);
      }
      cancel() {
          null !== this.k && (this.k.cancel(), this.k = null);
      }
      /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */    G() {
          return (Math.random() - .5) * this.j;
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Datastore and its related methods are a wrapper around the external Google
   * Cloud Datastore grpc API, which provides an interface that is more convenient
   * for the rest of the client SDK architecture to consume.
   */
  /**
   * An implementation of Datastore that exposes additional state for internal
   * consumption.
   */
  class Yn extends class {} {
      constructor(t, n, e) {
          super(), this.credentials = t, this.Y = n, this.S = e, this.K = !1;
      }
      J() {
          if (this.K) throw new L($, "The client has already been terminated.");
      }
      /** Gets an auth token and invokes the provided RPC. */    l(t, n, e) {
          return this.J(), this.credentials.getToken().then((r => this.Y.l(t, n, e, r))).catch((t => {
              throw "FirebaseError" === t.name ? (t.code === N && this.credentials.invalidateToken(), 
              t) : new L(I, t.toString());
          }));
      }
      /** Gets an auth token and invokes the provided RPC with streamed results. */    v(t, n, e) {
          return this.J(), this.credentials.getToken().then((r => this.Y.v(t, n, e, r))).catch((t => {
              throw "FirebaseError" === t.name ? (t.code === N && this.credentials.invalidateToken(), 
              t) : new L(I, t.toString());
          }));
      }
      terminate() {
          this.K = !0;
      }
  }
  
  // TODO(firestorexp): Make sure there is only one Datastore instance per
  // firestore-exp client.
  async function Kn(t, n) {
      const e = b(t), r = On(e.S) + "/documents", s = {
          writes: n.map((t => Un(e.S, t)))
      };
      await e.l("Commit", r, s);
  }
  
  async function Jn(t, n) {
      const e = b(t), r = On(e.S) + "/documents", s = {
          documents: n.map((t => Sn(e.S, t)))
      }, i = await e.v("BatchGetDocuments", r, s), o = new Map;
      i.forEach((t => {
          const n = Ln(e.S, t);
          o.set(n.key.toString(), n);
      }));
      const u = [];
      return n.forEach((t => {
          const n = o.get(t.toString());
          g(!!n), u.push(n);
      })), u;
  }
  
  async function Zn(t, n) {
      const e = b(t), r = jn(e.S, hn(n));
      return (await e.v("RunQuery", r.parent, {
          structuredQuery: r.structuredQuery
      })).filter((t => !!t.document)).map((t => function(t, n, e) {
          const r = qn(t, n.name), s = $n(n.updateTime), i = new jt({
              mapValue: {
                  fields: n.fields
              }
          }), o = kt.newFoundDocument(r, s, i);
          return e && o.setHasCommittedMutations(), e ? o.setHasCommittedMutations() : o;
      }(e.S, t.document, void 0)));
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ const Xn = new Map;
  
  /**
   * An instance map that ensures only one Datastore exists per Firestore
   * instance.
   */
  /**
   * Returns an initialized and started Datastore for the given Firestore
   * instance. Callers must invoke removeComponents() when the Firestore
   * instance is terminated.
   */
  function te(t) {
      if (t._terminated) throw new L($, "The client has already been terminated.");
      if (!Xn.has(t)) {
          w("ComponentProvider", "Initializing Datastore");
          const i = function(t) {
              return new lt(t, fetch.bind(null));
          }((n = t._databaseId, e = t.app.options.appId || "", r = t._persistenceKey, s = t._freezeSettings(), 
          new W(n, e, r, s.host, s.ssl, s.experimentalForceLongPolling, s.experimentalAutoDetectLongPolling, s.useFetchStreams))), o = Gn(t._databaseId), u = function(t, n, e) {
              return new Yn(t, n, e);
          }(t._credentials, i, o);
          Xn.set(t, u);
      }
      var n, e, r, s;
      /**
   * @license
   * Copyright 2018 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */    return Xn.get(t);
  }
  
  /**
   * Removes all components associated with the provided instance. Must be called
   * when the `Firestore` instance is terminated.
   */
  /**
   * A concrete type describing all the values that can be applied via a
   * user-supplied `FirestoreSettings` object. This is a separate type so that
   * defaults can be supplied and the value can be checked for equality.
   */
  class ne {
      constructor(t) {
          var n;
          if (void 0 === t.host) {
              if (void 0 !== t.ssl) throw new L(T, "Can't provide ssl option if host option is not set");
              this.host = "firestore.googleapis.com", this.ssl = true;
          } else this.host = t.host, this.ssl = null === (n = t.ssl) || void 0 === n || n;
          if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
          void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
              if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new L(T, "cacheSizeBytes must be at least 1048576");
              this.cacheSizeBytes = t.cacheSizeBytes;
          }
          this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
          this.useFetchStreams = !!t.useFetchStreams, function(t, n, e, r) {
              if (!0 === n && !0 === r) throw new L(T, `${t} and ${e} cannot be used together.`);
          }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling);
      }
      isEqual(t) {
          return this.host === t.host && this.ssl === t.ssl && this.credentials === t.credentials && this.cacheSizeBytes === t.cacheSizeBytes && this.experimentalForceLongPolling === t.experimentalForceLongPolling && this.experimentalAutoDetectLongPolling === t.experimentalAutoDetectLongPolling && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * The Cloud Firestore service interface.
   *
   * Do not call this constructor directly. Instead, use {@link getFirestore}.
   */ class ee {
      /** @hideconstructor */
      constructor(t, n) {
          this._credentials = n, 
          /**
           * Whether it's a Firestore or Firestore Lite instance.
           */
          this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new ne({}), 
          this._settingsFrozen = !1, t instanceof G ? this._databaseId = t : (this._app = t, 
          this._databaseId = function(t) {
              if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new L(T, '"projectId" not provided in firebase.initializeApp.');
              return new G(t.options.projectId);
          }
          /**
   * Initializes a new instance of Cloud Firestore with the provided settings.
   * Can only be called before any other functions, including
   * {@link getFirestore}. If the custom settings are empty, this function is
   * equivalent to calling {@link getFirestore}.
   *
   * @param app - The {@link https://www.gstatic.com/firebasejs/9.0.2/firebase-app.js#FirebaseApp} with which the `Firestore` instance will
   * be associated.
   * @param settings - A settings object to configure the `Firestore` instance.
   * @returns A newly initialized `Firestore` instance.
   */ (t));
      }
      /**
       * The {@link https://www.gstatic.com/firebasejs/9.0.2/firebase-app.js#FirebaseApp} associated with this `Firestore` service
       * instance.
       */    get app() {
          if (!this._app) throw new L($, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
          return this._app;
      }
      get _initialized() {
          return this._settingsFrozen;
      }
      get _terminated() {
          return void 0 !== this._terminateTask;
      }
      _setSettings(t) {
          if (this._settingsFrozen) throw new L($, "Firestore has already been started and its settings can no longer be changed. You can only modify settings before calling any other methods on a Firestore object.");
          this._settings = new ne(t), void 0 !== t.credentials && (this._credentials = function(t) {
              if (!t) return new k;
              switch (t.type) {
                case "gapi":
                  const n = t.client;
                  // Make sure this really is a Gapi client.
                                  return g(!("object" != typeof n || null === n || !n.auth || !n.auth.getAuthHeaderValueForFirstParty)), 
                  new z(n, t.sessionIndex || "0", t.iamToken || null);
  
                case "provider":
                  return t.client;
  
                default:
                  throw new L(T, "makeCredentialsProvider failed due to invalid credential type");
              }
          }(t.credentials));
      }
      _getSettings() {
          return this._settings;
      }
      _freezeSettings() {
          return this._settingsFrozen = !0, this._settings;
      }
      _delete() {
          return this._terminateTask || (this._terminateTask = this._terminate()), this._terminateTask;
      }
      /** Returns a JSON-serializable representation of this `Firestore` instance. */    toJSON() {
          return {
              app: this._app,
              databaseId: this._databaseId,
              settings: this._settings
          };
      }
      /**
       * Terminates all components used by this client. Subclasses can override
       * this method to clean up their own dependencies, but must also call this
       * method.
       *
       * Only ever called once.
       */    _terminate() {
          return function(t) {
              const n = Xn.get(t);
              n && (w("ComponentProvider", "Removing Datastore"), Xn.delete(t), n.terminate());
          }(this), Promise.resolve();
      }
  }
  
  function re(t, n) {
      const e = _getProvider(t, "firestore/lite");
      if (e.isInitialized()) throw new L($, "Firestore can only be initialized once per app.");
      return e.initialize({
          options: n
      });
  }
  
  /**
   * Returns the existing `Firestore` instance that is associated with the
   * provided {@link https://www.gstatic.com/firebasejs/9.0.2/firebase-app.js#FirebaseApp}. If no instance exists, initializes a new
   * instance with default settings.
   *
   * @param app - The {@link https://www.gstatic.com/firebasejs/9.0.2/firebase-app.js#FirebaseApp} instance that the returned `Firestore`
   * instance is associated with.
   * @returns The `Firestore` instance of the provided app.
   */ function se(n = getApp()) {
      return _getProvider(n, "firestore/lite").getImmediate();
  }
  
  /**
   * Modify this instance to communicate with the Cloud Firestore emulator.
   *
   * Note: This must be called before this instance has been used to do any
   * operations.
   *
   * @param firestore - The `Firestore` instance to configure to connect to the
   * emulator.
   * @param host - the emulator host (ex: localhost).
   * @param port - the emulator port (ex: 9000).
   * @param options.mockUserToken - the mock auth token to use for unit testing
   * Security Rules.
   */ function ie(t, n, e, r = {}) {
      var s;
      const i = (t = rt(t, ee))._getSettings();
      if ("firestore.googleapis.com" !== i.host && i.host !== n && p("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
      t._setSettings(Object.assign(Object.assign({}, i), {
          host: `${n}:${e}`,
          ssl: !1
      })), r.mockUserToken) {
          let n, e;
          if ("string" == typeof r.mockUserToken) n = r.mockUserToken, e = h.MOCK_USER; else {
              // Let createMockUserToken validate first (catches common mistakes like
              // invalid field "uid" and missing field "sub" / "user_id".)
              n = createMockUserToken(r.mockUserToken, null === (s = t._app) || void 0 === s ? void 0 : s.options.projectId);
              const i = r.mockUserToken.sub || r.mockUserToken.user_id;
              if (!i) throw new L(T, "mockUserToken must contain 'sub' or 'user_id' field!");
              e = new h(i);
          }
          t._credentials = new M(new j(n, e));
      }
  }
  
  /**
   * Terminates the provided `Firestore` instance.
   *
   * After calling `terminate()` only the `clearIndexedDbPersistence()` functions
   * may be used. Any other function will throw a `FirestoreError`. Termination
   * does not cancel any pending writes, and any promises that are awaiting a
   * response from the server will not be resolved.
   *
   * To restart after termination, create a new instance of `Firestore` with
   * {@link getFirestore}.
   *
   * Note: Under normal circumstances, calling `terminate()` is not required. This
   * function is useful only when you want to force this instance to release all of
   * its resources or in combination with {@link clearIndexedDbPersistence} to
   * ensure that all local state is destroyed between test runs.
   *
   * @param firestore - The `Firestore` instance to terminate.
   * @returns A `Promise` that is resolved when the instance has been successfully
   * terminated.
   */ function oe(t) {
      return t = rt(t, ee), _removeServiceInstance(t.app, "firestore/lite"), t._delete();
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A `DocumentReference` refers to a document location in a Firestore database
   * and can be used to write, read, or listen to the location. The document at
   * the referenced location may or may not exist.
   */
  class ue {
      /** @hideconstructor */
      constructor(t, 
      /**
       * If provided, the `FirestoreDataConverter` associated with this instance.
       */
      n, e) {
          this.converter = n, this._key = e, 
          /** The type of this Firestore reference. */
          this.type = "document", this.firestore = t;
      }
      get _path() {
          return this._key.path;
      }
      /**
       * The document's identifier within its collection.
       */    get id() {
          return this._key.path.lastSegment();
      }
      /**
       * A string representing the path of the referenced document (relative
       * to the root of the database).
       */    get path() {
          return this._key.path.canonicalString();
      }
      /**
       * The collection this `DocumentReference` belongs to.
       */    get parent() {
          return new ae(this.firestore, this.converter, this._key.path.popLast());
      }
      withConverter(t) {
          return new ue(this.firestore, t, this._key);
      }
  }
  
  /**
   * A `Query` refers to a query which you can read or listen to. You can also
   * construct refined `Query` objects by adding filters and ordering.
   */ class ce {
      // This is the lite version of the Query class in the main SDK.
      /** @hideconstructor protected */
      constructor(t, 
      /**
       * If provided, the `FirestoreDataConverter` associated with this instance.
       */
      n, e) {
          this.converter = n, this._query = e, 
          /** The type of this Firestore reference. */
          this.type = "query", this.firestore = t;
      }
      withConverter(t) {
          return new ce(this.firestore, t, this._query);
      }
  }
  
  /**
   * A `CollectionReference` object can be used for adding documents, getting
   * document references, and querying for documents (using {@link query}).
   */ class ae extends ce {
      /** @hideconstructor */
      constructor(t, n, e) {
          super(t, n, new rn(e)), this._path = e, 
          /** The type of this Firestore reference. */
          this.type = "collection";
      }
      /** The collection's identifier. */    get id() {
          return this._query.path.lastSegment();
      }
      /**
       * A string representing the path of the referenced collection (relative
       * to the root of the database).
       */    get path() {
          return this._query.path.canonicalString();
      }
      /**
       * A reference to the containing `DocumentReference` if this is a
       * subcollection. If this isn't a subcollection, the reference is null.
       */    get parent() {
          const t = this._path.popLast();
          return t.isEmpty() ? null : new ue(this.firestore, 
          /* converter= */ null, new Z(t));
      }
      withConverter(t) {
          return new ae(this.firestore, t, this._path);
      }
  }
  
  function he(t, n, ...e) {
      if (t = getModularInstance(t), X("collection", "path", n), t instanceof ee) {
          const r = Y.fromString(n, ...e);
          return nt(r), new ae(t, /* converter= */ null, r);
      }
      {
          if (!(t instanceof ue || t instanceof ae)) throw new L(T, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
          const r = t._path.child(Y.fromString(n, ...e));
          return nt(r), new ae(t.firestore, 
          /* converter= */ null, r);
      }
  }
  
  // TODO(firestorelite): Consider using ErrorFactory -
  // https://github.com/firebase/firebase-js-sdk/blob/0131e1f/packages/util/src/errors.ts#L106
  /**
   * Creates and returns a new `Query` instance that includes all documents in the
   * database that are contained in a collection or subcollection with the
   * given `collectionId`.
   *
   * @param firestore - A reference to the root `Firestore` instance.
   * @param collectionId - Identifies the collections to query over. Every
   * collection or subcollection with this ID as the last segment of its path
   * will be included. Cannot contain a slash.
   * @returns The created `Query`.
   */ function le(t, n) {
      if (t = rt(t, ee), X("collectionGroup", "collection id", n), n.indexOf("/") >= 0) throw new L(T, `Invalid collection ID '${n}' passed to function collectionGroup(). Collection IDs must not contain '/'.`);
      return new ce(t, 
      /* converter= */ null, 
      /**
   * Creates a new Query for a collection group query that matches all documents
   * within the provided collection group.
   */
      function(t) {
          return new rn(Y.emptyPath(), t);
      }(n));
  }
  
  function fe(t, n, ...e) {
      if (t = getModularInstance(t), 
      // We allow omission of 'pathString' but explicitly prohibit passing in both
      // 'undefined' and 'null'.
      1 === arguments.length && (n = dt.A()), X("doc", "path", n), t instanceof ee) {
          const r = Y.fromString(n, ...e);
          return tt(r), new ue(t, 
          /* converter= */ null, new Z(r));
      }
      {
          if (!(t instanceof ue || t instanceof ae)) throw new L(T, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
          const r = t._path.child(Y.fromString(n, ...e));
          return tt(r), new ue(t.firestore, t instanceof ae ? t.converter : null, new Z(r));
      }
  }
  
  /**
   * Returns true if the provided references are equal.
   *
   * @param left - A reference to compare.
   * @param right - A reference to compare.
   * @returns true if the references point to the same location in the same
   * Firestore database.
   */ function de(t, n) {
      return t = getModularInstance(t), n = getModularInstance(n), (t instanceof ue || t instanceof ae) && (n instanceof ue || n instanceof ae) && (t.firestore === n.firestore && t.path === n.path && t.converter === n.converter);
  }
  
  /**
   * Returns true if the provided queries point to the same collection and apply
   * the same constraints.
   *
   * @param left - A `Query` to compare.
   * @param right - A `Query` to compare.
   * @returns true if the references point to the same location in the same
   * Firestore database.
   */ function we(t, n) {
      return t = getModularInstance(t), n = getModularInstance(n), t instanceof ce && n instanceof ce && (t.firestore === n.firestore && ln(t._query, n._query) && t.converter === n.converter);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A `FieldPath` refers to a field in a document. The path may consist of a
   * single field name (referring to a top-level field in the document), or a
   * list of field names (referring to a nested field in the document).
   *
   * Create a `FieldPath` by providing field names. If more than one field
   * name is provided, the path will point to a nested field in a document.
   */ class me {
      /**
       * Creates a `FieldPath` from the provided field names. If more than one field
       * name is provided, the path will point to a nested field in a document.
       *
       * @param fieldNames - A list of field names.
       */
      constructor(...t) {
          for (let n = 0; n < t.length; ++n) if (0 === t[n].length) throw new L(T, "Invalid field name at argument $(i + 1). Field names must not be empty.");
          this._internalPath = new J(t);
      }
      /**
       * Returns true if this `FieldPath` is equal to the provided one.
       *
       * @param other - The `FieldPath` to compare against.
       * @returns true if this `FieldPath` is equal to the provided one.
       */    isEqual(t) {
          return this._internalPath.isEqual(t._internalPath);
      }
  }
  
  /**
   * Returns a special sentinel `FieldPath` to refer to the ID of a document.
   * It can be used in queries to sort or filter by the document ID.
   */ function pe() {
      return new me("__name__");
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * An immutable object representing an array of bytes.
   */ class ye {
      /** @hideconstructor */
      constructor(t) {
          this._byteString = t;
      }
      /**
       * Creates a new `Bytes` object from the given Base64 string, converting it to
       * bytes.
       *
       * @param base64 - The Base64 string used to create the `Bytes` object.
       */    static fromBase64String(t) {
          try {
              return new ye(vt.fromBase64String(t));
          } catch (t) {
              throw new L(T, "Failed to construct data from Base64 string: " + t);
          }
      }
      /**
       * Creates a new `Bytes` object from the given Uint8Array.
       *
       * @param array - The Uint8Array used to create the `Bytes` object.
       */    static fromUint8Array(t) {
          return new ye(vt.fromUint8Array(t));
      }
      /**
       * Returns the underlying bytes as a Base64-encoded string.
       *
       * @returns The Base64-encoded string created from the `Bytes` object.
       */    toBase64() {
          return this._byteString.toBase64();
      }
      /**
       * Returns the underlying bytes in a new `Uint8Array`.
       *
       * @returns The Uint8Array created from the `Bytes` object.
       */    toUint8Array() {
          return this._byteString.toUint8Array();
      }
      /**
       * Returns a string representation of the `Bytes` object.
       *
       * @returns A string representation of the `Bytes` object.
       */    toString() {
          return "Bytes(base64: " + this.toBase64() + ")";
      }
      /**
       * Returns true if this `Bytes` object is equal to the provided one.
       *
       * @param other - The `Bytes` object to compare against.
       * @returns true if this `Bytes` object is equal to the provided one.
       */    isEqual(t) {
          return this._byteString.isEqual(t._byteString);
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Sentinel values that can be used when writing document fields with `set()`
   * or `update()`.
   */ class _e {
      /**
       * @param _methodName - The public API endpoint that returns this class.
       * @hideconstructor
       */
      constructor(t) {
          this._methodName = t;
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * An immutable object representing a geographic location in Firestore. The
   * location is represented as latitude/longitude pair.
   *
   * Latitude values are in the range of [-90, 90].
   * Longitude values are in the range of [-180, 180].
   */ class ge {
      /**
       * Creates a new immutable `GeoPoint` object with the provided latitude and
       * longitude values.
       * @param latitude - The latitude as number between -90 and 90.
       * @param longitude - The longitude as number between -180 and 180.
       */
      constructor(t, n) {
          if (!isFinite(t) || t < -90 || t > 90) throw new L(T, "Latitude must be a number between -90 and 90, but was: " + t);
          if (!isFinite(n) || n < -180 || n > 180) throw new L(T, "Longitude must be a number between -180 and 180, but was: " + n);
          this._lat = t, this._long = n;
      }
      /**
       * The latitude of this `GeoPoint` instance.
       */    get latitude() {
          return this._lat;
      }
      /**
       * The longitude of this `GeoPoint` instance.
       */    get longitude() {
          return this._long;
      }
      /**
       * Returns true if this `GeoPoint` is equal to the provided one.
       *
       * @param other - The `GeoPoint` to compare against.
       * @returns true if this `GeoPoint` is equal to the provided one.
       */    isEqual(t) {
          return this._lat === t._lat && this._long === t._long;
      }
      /** Returns a JSON-serializable representation of this GeoPoint. */    toJSON() {
          return {
              latitude: this._lat,
              longitude: this._long
          };
      }
      /**
       * Actually private to JS consumers of our API, so this function is prefixed
       * with an underscore.
       */    _compareTo(t) {
          return wt(this._lat, t._lat) || wt(this._long, t._long);
      }
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ const be = /^__.*__$/;
  
  /** The result of parsing document data (e.g. for a setData call). */ class ve {
      constructor(t, n, e) {
          this.data = t, this.fieldMask = n, this.fieldTransforms = e;
      }
      toMutation(t, n) {
          return null !== this.fieldMask ? new En(t, this.data, this.fieldMask, n, this.fieldTransforms) : new vn(t, this.data, n, this.fieldTransforms);
      }
  }
  
  /** The result of parsing "update" data (i.e. for an updateData call). */ class Ee {
      constructor(t, 
      // The fieldMask does not include document transforms.
      n, e) {
          this.data = t, this.fieldMask = n, this.fieldTransforms = e;
      }
      toMutation(t, n) {
          return new En(t, this.data, this.fieldMask, n, this.fieldTransforms);
      }
  }
  
  function Ie(t) {
      switch (t) {
        case 0 /* Set */ :
   // fall through
                case 2 /* MergeSet */ :
   // fall through
                case 1 /* Update */ :
          return !0;
  
        case 3 /* Argument */ :
        case 4 /* ArrayArgument */ :
          return !1;
  
        default:
          throw _();
      }
  }
  
  /** A "context" object passed around while parsing user data. */ class Te {
      /**
       * Initializes a ParseContext with the given source and path.
       *
       * @param settings - The settings for the parser.
       * @param databaseId - The database ID of the Firestore instance.
       * @param serializer - The serializer to use to generate the Value proto.
       * @param ignoreUndefinedProperties - Whether to ignore undefined properties
       * rather than throw.
       * @param fieldTransforms - A mutable list of field transforms encountered
       * while parsing the data.
       * @param fieldMask - A mutable list of field paths encountered while parsing
       * the data.
       *
       * TODO(b/34871131): We don't support array paths right now, so path can be
       * null to indicate the context represents any location within an array (in
       * which case certain features will not work and errors will be somewhat
       * compromised).
       */
      constructor(t, n, e, r, s, i) {
          this.settings = t, this.databaseId = n, this.S = e, this.ignoreUndefinedProperties = r, 
          // Minor hack: If fieldTransforms is undefined, we assume this is an
          // external call and we need to validate the entire path.
          void 0 === s && this.Z(), this.fieldTransforms = s || [], this.fieldMask = i || [];
      }
      get path() {
          return this.settings.path;
      }
      get X() {
          return this.settings.X;
      }
      /** Returns a new context with the specified settings overwritten. */    tt(t) {
          return new Te(Object.assign(Object.assign({}, this.settings), t), this.databaseId, this.S, this.ignoreUndefinedProperties, this.fieldTransforms, this.fieldMask);
      }
      nt(t) {
          var n;
          const e = null === (n = this.path) || void 0 === n ? void 0 : n.child(t), r = this.tt({
              path: e,
              et: !1
          });
          return r.rt(t), r;
      }
      st(t) {
          var n;
          const e = null === (n = this.path) || void 0 === n ? void 0 : n.child(t), r = this.tt({
              path: e,
              et: !1
          });
          return r.Z(), r;
      }
      it(t) {
          // TODO(b/34871131): We don't support array paths right now; so make path
          // undefined.
          return this.tt({
              path: void 0,
              et: !0
          });
      }
      ot(t) {
          return Qe(t, this.settings.methodName, this.settings.ut || !1, this.path, this.settings.ct);
      }
      /** Returns 'true' if 'fieldPath' was traversed when creating this context. */    contains(t) {
          return void 0 !== this.fieldMask.find((n => t.isPrefixOf(n))) || void 0 !== this.fieldTransforms.find((n => t.isPrefixOf(n.field)));
      }
      Z() {
          // TODO(b/34871131): Remove null check once we have proper paths for fields
          // within arrays.
          if (this.path) for (let t = 0; t < this.path.length; t++) this.rt(this.path.get(t));
      }
      rt(t) {
          if (0 === t.length) throw this.ot("Document fields must not be empty");
          if (Ie(this.X) && be.test(t)) throw this.ot('Document fields cannot begin and end with "__"');
      }
  }
  
  /**
   * Helper for parsing raw user input (provided via the API) into internal model
   * classes.
   */ class Ae {
      constructor(t, n, e) {
          this.databaseId = t, this.ignoreUndefinedProperties = n, this.S = e || Gn(t);
      }
      /** Creates a new top-level parse context. */    at(t, n, e, r = !1) {
          return new Te({
              X: t,
              methodName: n,
              ct: e,
              path: J.emptyPath(),
              et: !1,
              ut: r
          }, this.databaseId, this.S, this.ignoreUndefinedProperties);
      }
  }
  
  function Pe(t) {
      const n = t._freezeSettings(), e = Gn(t._databaseId);
      return new Ae(t._databaseId, !!n.ignoreUndefinedProperties, e);
  }
  
  /** Parse document data from a set() call. */ function Re(t, n, e, r, s, i = {}) {
      const o = t.at(i.merge || i.mergeFields ? 2 /* MergeSet */ : 0 /* Set */ , n, e, s);
      je("Data must be an object, but it was:", o, r);
      const u = Le(r, o);
      let c, a;
      if (i.merge) c = new bt(o.fieldMask), a = o.fieldTransforms; else if (i.mergeFields) {
          const t = [];
          for (const r of i.mergeFields) {
              const s = ke(n, r, e);
              if (!o.contains(s)) throw new L(T, `Field '${s}' is specified in your field mask but missing from your input data.`);
              ze(t, s) || t.push(s);
          }
          c = new bt(t), a = o.fieldTransforms.filter((t => c.covers(t.field)));
      } else c = null, a = o.fieldTransforms;
      return new ve(new jt(u), c, a);
  }
  
  class Ve extends _e {
      _toFieldTransform(t) {
          if (2 /* MergeSet */ !== t.X) throw 1 /* Update */ === t.X ? t.ot(`${this._methodName}() can only appear at the top level of your update data`) : t.ot(`${this._methodName}() cannot be used with set() unless you pass {merge:true}`);
          // No transform to add for a delete, but we need to add it to our
          // fieldMask so it gets deleted.
          return t.fieldMask.push(t.path), null;
      }
      isEqual(t) {
          return t instanceof Ve;
      }
  }
  
  /**
   * Creates a child context for parsing SerializableFieldValues.
   *
   * This is different than calling `ParseContext.contextWith` because it keeps
   * the fieldTransforms and fieldMask separate.
   *
   * The created context has its `dataSource` set to `UserDataSource.Argument`.
   * Although these values are used with writes, any elements in these FieldValues
   * are not considered writes since they cannot contain any FieldValue sentinels,
   * etc.
   *
   * @param fieldValue - The sentinel FieldValue for which to create a child
   *     context.
   * @param context - The parent context.
   * @param arrayElement - Whether or not the FieldValue has an array.
   */ function Ne(t, n, e) {
      return new Te({
          X: 3 /* Argument */ ,
          ct: n.settings.ct,
          methodName: t._methodName,
          et: e
      }, n.databaseId, n.S, n.ignoreUndefinedProperties);
  }
  
  class De extends _e {
      _toFieldTransform(t) {
          return new _n(t.path, new wn);
      }
      isEqual(t) {
          return t instanceof De;
      }
  }
  
  class $e extends _e {
      constructor(t, n) {
          super(t), this.ht = n;
      }
      _toFieldTransform(t) {
          const n = Ne(this, t, 
          /*array=*/ !0), e = this.ht.map((t => Ce(t, n))), r = new mn(e);
          return new _n(t.path, r);
      }
      isEqual(t) {
          // TODO(mrschmidt): Implement isEquals
          return this === t;
      }
  }
  
  class Fe extends _e {
      constructor(t, n) {
          super(t), this.ht = n;
      }
      _toFieldTransform(t) {
          const n = Ne(this, t, 
          /*array=*/ !0), e = this.ht.map((t => Ce(t, n))), r = new pn(e);
          return new _n(t.path, r);
      }
      isEqual(t) {
          // TODO(mrschmidt): Implement isEquals
          return this === t;
      }
  }
  
  class Se extends _e {
      constructor(t, n) {
          super(t), this.lt = n;
      }
      _toFieldTransform(t) {
          const n = new yn(t.S, fn(t.S, this.lt));
          return new _n(t.path, n);
      }
      isEqual(t) {
          // TODO(mrschmidt): Implement isEquals
          return this === t;
      }
  }
  
  /** Parse update data from an update() call. */ function qe(t, n, e, r) {
      const s = t.at(1 /* Update */ , n, e);
      je("Data must be an object, but it was:", s, r);
      const i = [], o = jt.empty();
      gt(r, ((t, r) => {
          const u = Be(n, t, e);
          // For Compat types, we have to "extract" the underlying types before
          // performing validation.
                  r = getModularInstance(r);
          const c = s.st(u);
          if (r instanceof Ve) 
          // Add it to the field mask, but don't add anything to updateData.
          i.push(u); else {
              const t = Ce(r, c);
              null != t && (i.push(u), o.set(u, t));
          }
      }));
      const u = new bt(i);
      return new Ee(o, u, s.fieldTransforms);
  }
  
  /** Parse update data from a list of field/value arguments. */ function xe(t, n, e, r, s, i) {
      const o = t.at(1 /* Update */ , n, e), u = [ ke(n, r, e) ], c = [ s ];
      if (i.length % 2 != 0) throw new L(T, `Function ${n}() needs to be called with an even number of arguments that alternate between field names and values.`);
      for (let t = 0; t < i.length; t += 2) u.push(ke(n, i[t])), c.push(i[t + 1]);
      const h = [], l = jt.empty();
      // We iterate in reverse order to pick the last value for a field if the
      // user specified the field multiple times.
      for (let t = u.length - 1; t >= 0; --t) if (!ze(h, u[t])) {
          const n = u[t];
          let e = c[t];
          // For Compat types, we have to "extract" the underlying types before
          // performing validation.
                  e = getModularInstance(e);
          const r = o.st(n);
          if (e instanceof Ve) 
          // Add it to the field mask, but don't add anything to updateData.
          h.push(n); else {
              const t = Ce(e, r);
              null != t && (h.push(n), l.set(n, t));
          }
      }
      const f = new bt(h);
      return new Ee(l, f, o.fieldTransforms);
  }
  
  /**
   * Parse a "query value" (e.g. value in a where filter or a value in a cursor
   * bound).
   *
   * @param allowArrays - Whether the query value is an array that may directly
   * contain additional arrays (e.g. the operand of an `in` query).
   */ function Oe(t, n, e, r = !1) {
      return Ce(e, t.at(r ? 4 /* ArrayArgument */ : 3 /* Argument */ , n));
  }
  
  /**
   * Parses user data to Protobuf Values.
   *
   * @param input - Data to be parsed.
   * @param context - A context object representing the current path being parsed,
   * the source of the data being parsed, etc.
   * @returns The parsed value, or null if the value was a FieldValue sentinel
   * that should not be included in the resulting parsed data.
   */ function Ce(t, n) {
      if (Ue(
      // Unwrap the API type from the Compat SDK. This will return the API type
      // from firestore-exp.
      t = getModularInstance(t))) return je("Unsupported field value:", n, t), Le(t, n);
      if (t instanceof _e) 
      // FieldValues usually parse into transforms (except FieldValue.delete())
      // in which case we do not want to include this field in our parsed data
      // (as doing so will overwrite the field directly prior to the transform
      // trying to transform it). So we don't add this location to
      // context.fieldMask and we return null as our parsing result.
      /**
   * "Parses" the provided FieldValueImpl, adding any necessary transforms to
   * context.fieldTransforms.
   */
      return function(t, n) {
          // Sentinels are only supported with writes, and not within arrays.
          if (!Ie(n.X)) throw n.ot(`${t._methodName}() can only be used with update() and set()`);
          if (!n.path) throw n.ot(`${t._methodName}() is not currently supported inside arrays`);
          const e = t._toFieldTransform(n);
          e && n.fieldTransforms.push(e);
      }
      /**
   * Helper to parse a scalar value (i.e. not an Object, Array, or FieldValue)
   *
   * @returns The parsed value
   */ (t, n), null;
      if (void 0 === t && n.ignoreUndefinedProperties) 
      // If the input is undefined it can never participate in the fieldMask, so
      // don't handle this below. If `ignoreUndefinedProperties` is false,
      // `parseScalarValue` will reject an undefined value.
      return null;
      if (
      // If context.path is null we are inside an array and we don't support
      // field mask paths more granular than the top-level array.
      n.path && n.fieldMask.push(n.path), t instanceof Array) {
          // TODO(b/34871131): Include the path containing the array in the error
          // message.
          // In the case of IN queries, the parsed data is an array (representing
          // the set of values to be included for the IN query) that may directly
          // contain additional arrays (each representing an individual field
          // value), so we disable this validation.
          if (n.settings.et && 4 /* ArrayArgument */ !== n.X) throw n.ot("Nested arrays are not supported");
          return function(t, n) {
              const e = [];
              let r = 0;
              for (const s of t) {
                  let t = Ce(s, n.it(r));
                  null == t && (
                  // Just include nulls in the array for fields being replaced with a
                  // sentinel.
                  t = {
                      nullValue: "NULL_VALUE"
                  }), e.push(t), r++;
              }
              return {
                  arrayValue: {
                      values: e
                  }
              };
          }(t, n);
      }
      return function(t, n) {
          if (null === (t = getModularInstance(t))) return {
              nullValue: "NULL_VALUE"
          };
          if ("number" == typeof t) return fn(n.S, t);
          if ("boolean" == typeof t) return {
              booleanValue: t
          };
          if ("string" == typeof t) return {
              stringValue: t
          };
          if (t instanceof Date) {
              const e = pt.fromDate(t);
              return {
                  timestampValue: Vn(n.S, e)
              };
          }
          if (t instanceof pt) {
              // Firestore backend truncates precision down to microseconds. To ensure
              // offline mode works the same with regards to truncation, perform the
              // truncation immediately without waiting for the backend to do that.
              const e = new pt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
              return {
                  timestampValue: Vn(n.S, e)
              };
          }
          if (t instanceof ge) return {
              geoPointValue: {
                  latitude: t.latitude,
                  longitude: t.longitude
              }
          };
          if (t instanceof ye) return {
              bytesValue: Nn(n.S, t._byteString)
          };
          if (t instanceof ue) {
              const e = n.databaseId, r = t.firestore._databaseId;
              if (!r.isEqual(e)) throw n.ot(`Document reference is for database ${r.projectId}/${r.database} but should be for database ${e.projectId}/${e.database}`);
              return {
                  referenceValue: Fn(t.firestore._databaseId || n.databaseId, t._key.path)
              };
          }
          throw n.ot(`Unsupported field value: ${et(t)}`);
      }
      /**
   * Checks whether an object looks like a JSON object that should be converted
   * into a struct. Normal class/prototype instances are considered to look like
   * JSON objects since they should be converted to a struct value. Arrays, Dates,
   * GeoPoints, etc. are not considered to look like JSON objects since they map
   * to specific FieldValue types other than ObjectValue.
   */ (t, n);
  }
  
  function Le(t, n) {
      const e = {};
      return !function(t) {
          for (const n in t) if (Object.prototype.hasOwnProperty.call(t, n)) return !1;
          return !0;
      }(t) ? gt(t, ((t, r) => {
          const s = Ce(r, n.nt(t));
          null != s && (e[t] = s);
      })) : 
      // If we encounter an empty object, we explicitly add it to the update
      // mask to ensure that the server creates a map entry.
      n.path && n.path.length > 0 && n.fieldMask.push(n.path), {
          mapValue: {
              fields: e
          }
      };
  }
  
  function Ue(t) {
      return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof pt || t instanceof ge || t instanceof ye || t instanceof ue || t instanceof _e);
  }
  
  function je(t, n, e) {
      if (!Ue(e) || !function(t) {
          return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
      }(e)) {
          const r = et(e);
          throw "an object" === r ? n.ot(t + " a custom object") : n.ot(t + " " + r);
      }
  }
  
  /**
   * Helper that calls fromDotSeparatedString() but wraps any error thrown.
   */ function ke(t, n, e) {
      if ((
      // If required, replace the FieldPath Compat class with with the firestore-exp
      // FieldPath.
      n = getModularInstance(n)) instanceof me) return n._internalPath;
      if ("string" == typeof n) return Be(t, n);
      throw Qe("Field path arguments must be of type string or FieldPath.", t, 
      /* hasConverter= */ !1, 
      /* path= */ void 0, e);
  }
  
  /**
   * Matches any characters in a field path string that are reserved.
   */ const Me = new RegExp("[~\\*/\\[\\]]");
  
  /**
   * Wraps fromDotSeparatedString with an error message about the method that
   * was thrown.
   * @param methodName - The publicly visible method name
   * @param path - The dot-separated string form of a field path which will be
   * split on dots.
   * @param targetDoc - The document against which the field path will be
   * evaluated.
   */ function Be(t, n, e) {
      if (n.search(Me) >= 0) throw Qe(`Invalid field path (${n}). Paths must not contain '~', '*', '/', '[', or ']'`, t, 
      /* hasConverter= */ !1, 
      /* path= */ void 0, e);
      try {
          return new me(...n.split("."))._internalPath;
      } catch (r) {
          throw Qe(`Invalid field path (${n}). Paths must not be empty, begin with '.', end with '.', or contain '..'`, t, 
          /* hasConverter= */ !1, 
          /* path= */ void 0, e);
      }
  }
  
  function Qe(t, n, e, r, s) {
      const i = r && !r.isEmpty(), o = void 0 !== s;
      let u = `Function ${n}() called with invalid data`;
      e && (u += " (via `toFirestore()`)"), u += ". ";
      let c = "";
      return (i || o) && (c += " (found", i && (c += ` in field ${r}`), o && (c += ` in document ${s}`), 
      c += ")"), new L(T, u + t + c);
  }
  
  /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */ function ze(t, n) {
      return t.some((t => t.isEqual(n)));
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A `DocumentSnapshot` contains data read from a document in your Firestore
   * database. The data can be extracted with `.data()` or `.get(<field>)` to
   * get a specific field.
   *
   * For a `DocumentSnapshot` that points to a non-existing document, any data
   * access will return 'undefined'. You can use the `exists()` method to
   * explicitly verify a document's existence.
   */ class We {
      // Note: This class is stripped down version of the DocumentSnapshot in
      // the legacy SDK. The changes are:
      // - No support for SnapshotMetadata.
      // - No support for SnapshotOptions.
      /** @hideconstructor protected */
      constructor(t, n, e, r, s) {
          this._firestore = t, this._userDataWriter = n, this._key = e, this._document = r, 
          this._converter = s;
      }
      /** Property of the `DocumentSnapshot` that provides the document's ID. */    get id() {
          return this._key.path.lastSegment();
      }
      /**
       * The `DocumentReference` for the document included in the `DocumentSnapshot`.
       */    get ref() {
          return new ue(this._firestore, this._converter, this._key);
      }
      /**
       * Signals whether or not the document at the snapshot's location exists.
       *
       * @returns true if the document exists.
       */    exists() {
          return null !== this._document;
      }
      /**
       * Retrieves all fields in the document as an `Object`. Returns `undefined` if
       * the document doesn't exist.
       *
       * @returns An `Object` containing all fields in the document or `undefined`
       * if the document doesn't exist.
       */    data() {
          if (this._document) {
              if (this._converter) {
                  // We only want to use the converter and create a new DocumentSnapshot
                  // if a converter has been provided.
                  const t = new Ge(this._firestore, this._userDataWriter, this._key, this._document, 
                  /* converter= */ null);
                  return this._converter.fromFirestore(t);
              }
              return this._userDataWriter.convertValue(this._document.data.value);
          }
      }
      /**
       * Retrieves the field specified by `fieldPath`. Returns `undefined` if the
       * document or field doesn't exist.
       *
       * @param fieldPath - The path (for example 'foo' or 'foo.bar') to a specific
       * field.
       * @returns The data at the specified field location or undefined if no such
       * field exists in the document.
       */
      // We are using `any` here to avoid an explicit cast by our users.
      // eslint-disable-next-line @typescript-eslint/no-explicit-any
      get(t) {
          if (this._document) {
              const n = this._document.data.field(Ke("DocumentSnapshot.get", t));
              if (null !== n) return this._userDataWriter.convertValue(n);
          }
      }
  }
  
  /**
   * A `QueryDocumentSnapshot` contains data read from a document in your
   * Firestore database as part of a query. The document is guaranteed to exist
   * and its data can be extracted with `.data()` or `.get(<field>)` to get a
   * specific field.
   *
   * A `QueryDocumentSnapshot` offers the same API surface as a
   * `DocumentSnapshot`. Since query results contain only existing documents, the
   * `exists` property will always be true and `data()` will never return
   * 'undefined'.
   */ class Ge extends We {
      /**
       * Retrieves all fields in the document as an `Object`.
       *
       * @override
       * @returns An `Object` containing all fields in the document.
       */
      data() {
          return super.data();
      }
  }
  
  /**
   * A `QuerySnapshot` contains zero or more `DocumentSnapshot` objects
   * representing the results of a query. The documents can be accessed as an
   * array via the `docs` property or enumerated using the `forEach` method. The
   * number of documents can be determined via the `empty` and `size`
   * properties.
   */ class He {
      /** @hideconstructor */
      constructor(t, n) {
          this._docs = n, this.query = t;
      }
      /** An array of all the documents in the `QuerySnapshot`. */    get docs() {
          return [ ...this._docs ];
      }
      /** The number of documents in the `QuerySnapshot`. */    get size() {
          return this.docs.length;
      }
      /** True if there are no documents in the `QuerySnapshot`. */    get empty() {
          return 0 === this.docs.length;
      }
      /**
       * Enumerates all of the documents in the `QuerySnapshot`.
       *
       * @param callback - A callback to be called with a `QueryDocumentSnapshot` for
       * each document in the snapshot.
       * @param thisArg - The `this` binding for the callback.
       */    forEach(t, n) {
          this._docs.forEach(t, n);
      }
  }
  
  /**
   * Returns true if the provided snapshots are equal.
   *
   * @param left - A snapshot to compare.
   * @param right - A snapshot to compare.
   * @returns true if the snapshots are equal.
   */ function Ye(t, n) {
      return t = getModularInstance(t), n = getModularInstance(n), t instanceof We && n instanceof We ? t._firestore === n._firestore && t._key.isEqual(n._key) && (null === t._document ? null === n._document : t._document.isEqual(n._document)) && t._converter === n._converter : t instanceof He && n instanceof He && (we(t.query, n.query) && mt(t.docs, n.docs, Ye));
  }
  
  /**
   * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
   */ function Ke(t, n) {
      return "string" == typeof n ? Be(t, n) : n instanceof me ? n._internalPath : n._delegate._internalPath;
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A `QueryConstraint` is used to narrow the set of documents returned by a
   * Firestore query. `QueryConstraint`s are created by invoking {@link where},
   * {@link orderBy}, {@link (startAt:1)}, {@link (startAfter:1)}, {@link
   * endBefore:1}, {@link (endAt:1)}, {@link limit} or {@link limitToLast} and
   * can then be passed to {@link query} to create a new query instance that
   * also contains this `QueryConstraint`.
   */
  class Je {}
  
  /**
   * Creates a new immutable instance of {@link Query} that is extended to also include
   * additional query constraints.
   *
   * @param query - The {@link Query} instance to use as a base for the new constraints.
   * @param queryConstraints - The list of {@link QueryConstraint}s to apply.
   * @throws if any of the provided query constraints cannot be combined with the
   * existing or new constraints.
   */ function Ze(t, ...n) {
      for (const e of n) t = e._apply(t);
      return t;
  }
  
  class Xe extends Je {
      constructor(t, n, e) {
          super(), this.ft = t, this.dt = n, this.wt = e, this.type = "where";
      }
      _apply(t) {
          const n = Pe(t.firestore), e = function(t, n, e, r, s, i, o) {
              let u;
              if (s.isKeyField()) {
                  if ("array-contains" /* ARRAY_CONTAINS */ === i || "array-contains-any" /* ARRAY_CONTAINS_ANY */ === i) throw new L(T, `Invalid Query. You can't perform '${i}' queries on FieldPath.documentId().`);
                  if ("in" /* IN */ === i || "not-in" /* NOT_IN */ === i) {
                      wr(o, i);
                      const n = [];
                      for (const e of o) n.push(dr(r, t, e));
                      u = {
                          arrayValue: {
                              values: n
                          }
                      };
                  } else u = dr(r, t, o);
              } else "in" /* IN */ !== i && "not-in" /* NOT_IN */ !== i && "array-contains-any" /* ARRAY_CONTAINS_ANY */ !== i || wr(o, i), 
              u = Oe(e, n, o, 
              /* allowArrays= */ "in" /* IN */ === i || "not-in" /* NOT_IN */ === i);
              const c = Qt.create(s, i, u);
              return function(t, n) {
                  if (n.N()) {
                      const e = un(t);
                      if (null !== e && !e.isEqual(n.field)) throw new L(T, `Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '${e.toString()}' and '${n.field.toString()}'`);
                      const r = on(t);
                      null !== r && mr(t, n.field, r);
                  }
                  const e = function(t, n) {
                      for (const e of t.filters) if (n.indexOf(e.op) >= 0) return e.op;
                      return null;
                  }(t, 
                  /**
   * Given an operator, returns the set of operators that cannot be used with it.
   *
   * Operators in a query must adhere to the following set of rules:
   * 1. Only one array operator is allowed.
   * 2. Only one disjunctive operator is allowed.
   * 3. `NOT_EQUAL` cannot be used with another `NOT_EQUAL` operator.
   * 4. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.
   *
   * Array operators: `ARRAY_CONTAINS`, `ARRAY_CONTAINS_ANY`
   * Disjunctive operators: `IN`, `ARRAY_CONTAINS_ANY`, `NOT_IN`
   */
                  function(t) {
                      switch (t) {
                        case "!=" /* NOT_EQUAL */ :
                          return [ "!=" /* NOT_EQUAL */ , "not-in" /* NOT_IN */ ];
  
                        case "array-contains" /* ARRAY_CONTAINS */ :
                          return [ "array-contains" /* ARRAY_CONTAINS */ , "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "not-in" /* NOT_IN */ ];
  
                        case "in" /* IN */ :
                          return [ "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "in" /* IN */ , "not-in" /* NOT_IN */ ];
  
                        case "array-contains-any" /* ARRAY_CONTAINS_ANY */ :
                          return [ "array-contains" /* ARRAY_CONTAINS */ , "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "in" /* IN */ , "not-in" /* NOT_IN */ ];
  
                        case "not-in" /* NOT_IN */ :
                          return [ "array-contains" /* ARRAY_CONTAINS */ , "array-contains-any" /* ARRAY_CONTAINS_ANY */ , "in" /* IN */ , "not-in" /* NOT_IN */ , "!=" /* NOT_EQUAL */ ];
  
                        default:
                          return [];
                      }
                  }(n.op));
                  if (null !== e) 
                  // Special case when it's a duplicate op to give a slightly clearer error message.
                  throw e === n.op ? new L(T, `Invalid query. You cannot use more than one '${n.op.toString()}' filter.`) : new L(T, `Invalid query. You cannot use '${n.op.toString()}' filters with '${e.toString()}' filters.`);
              }(t, c), c;
          }(t._query, "where", n, t.firestore._databaseId, this.ft, this.dt, this.wt);
          return new ce(t.firestore, t.converter, function(t, n) {
              const e = t.filters.concat([ n ]);
              return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), e, t.limit, t.limitType, t.startAt, t.endAt);
          }(t._query, e));
      }
  }
  
  /**
   * Creates a {@link QueryConstraint} that enforces that documents must contain the
   * specified field and that the value should satisfy the relation constraint
   * provided.
   *
   * @param fieldPath - The path to compare
   * @param opStr - The operation string (e.g "&lt;", "&lt;=", "==", "&lt;",
   *   "&lt;=", "!=").
   * @param value - The value for comparison
   * @returns The created {@link Query}.
   */ function tr(t, n, e) {
      const r = n, s = Ke("where", t);
      return new Xe(s, r, e);
  }
  
  class nr extends Je {
      constructor(t, n) {
          super(), this.ft = t, this.yt = n, this.type = "orderBy";
      }
      _apply(t) {
          const n = function(t, n, e) {
              if (null !== t.startAt) throw new L(T, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
              if (null !== t.endAt) throw new L(T, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
              const r = new tn(n, e);
              return function(t, n) {
                  if (null === on(t)) {
                      // This is the first order by. It must match any inequality.
                      const e = un(t);
                      null !== e && mr(t, e, n.field);
                  }
              }(t, r), r;
          }
          /**
   * Create a `Bound` from a query and a document.
   *
   * Note that the `Bound` will always include the key of the document
   * and so only the provided document will compare equal to the returned
   * position.
   *
   * Will throw if the document does not contain all fields of the order by
   * of the query or if any of the fields in the order by are an uncommitted
   * server timestamp.
   */ (t._query, this.ft, this.yt);
          return new ce(t.firestore, t.converter, function(t, n) {
              // TODO(dimond): validate that orderBy does not list the same key twice.
              const e = t.explicitOrderBy.concat([ n ]);
              return new rn(t.path, t.collectionGroup, e, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
          }(t._query, n));
      }
  }
  
  /**
   * Creates a {@link QueryConstraint} that sorts the query result by the
   * specified field, optionally in descending order instead of ascending.
   *
   * @param fieldPath - The field to sort by.
   * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
   * not specified, order will be ascending.
   * @returns The created {@link Query}.
   */ function er(t, n = "asc") {
      const e = n, r = Ke("orderBy", t);
      return new nr(r, e);
  }
  
  class rr extends Je {
      constructor(t, n, e) {
          super(), this.type = t, this._t = n, this.gt = e;
      }
      _apply(t) {
          return new ce(t.firestore, t.converter, function(t, n, e) {
              return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), n, e, t.startAt, t.endAt);
          }(t._query, this._t, this.gt));
      }
  }
  
  /**
   * Creates a {@link QueryConstraint} that only returns the first matching documents.
   *
   * @param limit - The maximum number of items to return.
   * @returns The created {@link Query}.
   */ function sr(t) {
      return st("limit", t), new rr("limit", t, "F" /* First */);
  }
  
  /**
   * Creates a {@link QueryConstraint} that only returns the last matching documents.
   *
   * You must specify at least one `orderBy` clause for `limitToLast` queries,
   * otherwise an exception will be thrown during execution.
   *
   * @param limit - The maximum number of items to return.
   * @returns The created {@link Query}.
   */ function ir(t) {
      return st("limitToLast", t), new rr("limitToLast", t, "L" /* Last */);
  }
  
  class or extends Je {
      constructor(t, n, e) {
          super(), this.type = t, this.bt = n, this.vt = e;
      }
      _apply(t) {
          const n = fr(t, this.type, this.bt, this.vt);
          return new ce(t.firestore, t.converter, function(t, n) {
              return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, n, t.endAt);
          }(t._query, n));
      }
  }
  
  function ur(...t) {
      return new or("startAt", t, /*before=*/ !0);
  }
  
  function cr(...t) {
      return new or("startAfter", t, 
      /*before=*/ !1);
  }
  
  class ar extends Je {
      constructor(t, n, e) {
          super(), this.type = t, this.bt = n, this.vt = e;
      }
      _apply(t) {
          const n = fr(t, this.type, this.bt, this.vt);
          return new ce(t.firestore, t.converter, function(t, n) {
              return new rn(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, n);
          }(t._query, n));
      }
  }
  
  function hr(...t) {
      return new ar("endBefore", t, /*before=*/ !0);
  }
  
  function lr(...t) {
      return new ar("endAt", t, /*before=*/ !1);
  }
  
  /** Helper function to create a bound from a document or fields */ function fr(t, n, e, r) {
      if (e[0] = getModularInstance(e[0]), e[0] instanceof We) return function(t, n, e, r, s) {
          if (!r) throw new L(P, `Can't use a DocumentSnapshot that doesn't exist for ${e}().`);
          const i = [];
          // Because people expect to continue/end a query at the exact document
          // provided, we need to use the implicit sort order rather than the explicit
          // sort order, because it's guaranteed to contain the document key. That way
          // the position becomes unambiguous and the query continues/ends exactly at
          // the provided document. Without the key (by using the explicit sort
          // orders), multiple documents could match the position, yielding duplicate
          // results.
                  for (const e of an(t)) if (e.field.isKeyField()) i.push(qt(n, r.key)); else {
              const t = r.data.field(e.field);
              if (Pt(t)) throw new L(T, 'Invalid query. You are trying to start or end a query using a document for which the field "' + e.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
              if (null === t) {
                  const t = e.field.canonicalString();
                  throw new L(T, `Invalid query. You are trying to start or end a query using a document for which the field '${t}' (used as the orderBy) does not exist.`);
              }
              i.push(t);
          }
          return new Xt(i, s);
      }
      /**
   * Converts a list of field values to a `Bound` for the given query.
   */ (t._query, t.firestore._databaseId, n, e[0]._document, r);
      {
          const s = Pe(t.firestore);
          return function(t, n, e, r, s, i) {
              // Use explicit order by's because it has to match the query the user made
              const o = t.explicitOrderBy;
              if (s.length > o.length) throw new L(T, `Too many arguments provided to ${r}(). The number of arguments must be less than or equal to the number of orderBy() clauses`);
              const u = [];
              for (let i = 0; i < s.length; i++) {
                  const c = s[i];
                  if (o[i].field.isKeyField()) {
                      if ("string" != typeof c) throw new L(T, `Invalid query. Expected a string for document ID in ${r}(), but got a ${typeof c}`);
                      if (!cn(t) && -1 !== c.indexOf("/")) throw new L(T, `Invalid query. When querying a collection and ordering by FieldPath.documentId(), the value passed to ${r}() must be a plain document ID, but '${c}' contains a slash.`);
                      const e = t.path.child(Y.fromString(c));
                      if (!Z.isDocumentKey(e)) throw new L(T, `Invalid query. When querying a collection group and ordering by FieldPath.documentId(), the value passed to ${r}() must result in a valid document path, but '${e}' is not because it contains an odd number of segments.`);
                      const s = new Z(e);
                      u.push(qt(n, s));
                  } else {
                      const t = Oe(e, r, c);
                      u.push(t);
                  }
              }
              return new Xt(u, i);
          }
          /**
   * Parses the given `documentIdValue` into a `ReferenceValue`, throwing
   * appropriate errors if the value is anything other than a `DocumentReference`
   * or `string`, or if the string is malformed.
   */ (t._query, t.firestore._databaseId, s, n, e, r);
      }
  }
  
  function dr(t, n, e) {
      if ("string" == typeof (e = getModularInstance(e))) {
          if ("" === e) throw new L(T, "Invalid query. When querying with FieldPath.documentId(), you must provide a valid document ID, but it was an empty string.");
          if (!cn(n) && -1 !== e.indexOf("/")) throw new L(T, `Invalid query. When querying a collection by FieldPath.documentId(), you must provide a plain document ID, but '${e}' contains a '/' character.`);
          const r = n.path.child(Y.fromString(e));
          if (!Z.isDocumentKey(r)) throw new L(T, `Invalid query. When querying a collection group by FieldPath.documentId(), the value provided must result in a valid document path, but '${r}' is not because it has an odd number of segments (${r.length}).`);
          return qt(t, new Z(r));
      }
      if (e instanceof ue) return qt(t, e._key);
      throw new L(T, `Invalid query. When querying with FieldPath.documentId(), you must provide a valid string or a DocumentReference, but it was: ${et(e)}.`);
  }
  
  /**
   * Validates that the value passed into a disjunctive filter satisfies all
   * array requirements.
   */ function wr(t, n) {
      if (!Array.isArray(t) || 0 === t.length) throw new L(T, `Invalid Query. A non-empty array is required for '${n.toString()}' filters.`);
      if (t.length > 10) throw new L(T, `Invalid Query. '${n.toString()}' filters support a maximum of 10 elements in the value array.`);
  }
  
  function mr(t, n, e) {
      if (!e.isEqual(n)) throw new L(T, `Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '${n.toString()}' and so you must also use '${n.toString()}' as your first argument to orderBy(), but your first orderBy() is on field '${e.toString()}' instead.`);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Converts Firestore's internal types to the JavaScript types that we expose
   * to the user.
   *
   * @internal
   */
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Converts custom model object of type T into `DocumentData` by applying the
   * converter if it exists.
   *
   * This function is used when converting user objects to `DocumentData`
   * because we want to provide the user with a more specific error message if
   * their `set()` or fails due to invalid data originating from a `toFirestore()`
   * call.
   */
  function pr(t, n, e) {
      let r;
      // Cast to `any` in order to satisfy the union type constraint on
      // toFirestore().
      // eslint-disable-next-line @typescript-eslint/no-explicit-any
      return r = t ? e && (e.merge || e.mergeFields) ? t.toFirestore(n, e) : t.toFirestore(n) : n, 
      r;
  }
  
  class yr extends class {
      convertValue(t, n = "none") {
          switch (Nt(t)) {
            case 0 /* NullValue */ :
              return null;
  
            case 1 /* BooleanValue */ :
              return t.booleanValue;
  
            case 2 /* NumberValue */ :
              return Tt(t.integerValue || t.doubleValue);
  
            case 3 /* TimestampValue */ :
              return this.convertTimestamp(t.timestampValue);
  
            case 4 /* ServerTimestampValue */ :
              return this.convertServerTimestamp(t, n);
  
            case 5 /* StringValue */ :
              return t.stringValue;
  
            case 6 /* BlobValue */ :
              return this.convertBytes(At(t.bytesValue));
  
            case 7 /* RefValue */ :
              return this.convertReference(t.referenceValue);
  
            case 8 /* GeoPointValue */ :
              return this.convertGeoPoint(t.geoPointValue);
  
            case 9 /* ArrayValue */ :
              return this.convertArray(t.arrayValue, n);
  
            case 10 /* ObjectValue */ :
              return this.convertObject(t.mapValue, n);
  
            default:
              throw _();
          }
      }
      convertObject(t, n) {
          const e = {};
          return gt(t.fields, ((t, r) => {
              e[t] = this.convertValue(r, n);
          })), e;
      }
      convertGeoPoint(t) {
          return new ge(Tt(t.latitude), Tt(t.longitude));
      }
      convertArray(t, n) {
          return (t.values || []).map((t => this.convertValue(t, n)));
      }
      convertServerTimestamp(t, n) {
          switch (n) {
            case "previous":
              const e = Rt(t);
              return null == e ? null : this.convertValue(e, n);
  
            case "estimate":
              return this.convertTimestamp(Vt(t));
  
            default:
              return null;
          }
      }
      convertTimestamp(t) {
          const n = It(t);
          return new pt(n.seconds, n.nanos);
      }
      convertDocumentKey(t, n) {
          const e = Y.fromString(t);
          g(Wn(e));
          const r = new G(e.get(1), e.get(3)), s = new Z(e.popFirst(5));
          return r.isEqual(n) || 
          // TODO(b/64130202): Somehow support foreign references.
          m(`Document ${s} contains a document reference within a different database (${r.projectId}/${r.database}) which is not supported. It will be treated as a reference in the current database (${n.projectId}/${n.database}) instead.`), 
          s;
      }
  } {
      constructor(t) {
          super(), this.firestore = t;
      }
      convertBytes(t) {
          return new ye(t);
      }
      convertReference(t) {
          const n = this.convertDocumentKey(t, this.firestore._databaseId);
          return new ue(this.firestore, /* converter= */ null, n);
      }
  }
  
  /**
   * Reads the document referred to by the specified document reference.
   *
   * All documents are directly fetched from the server, even if the document was
   * previously read or modified. Recent modifications are only reflected in the
   * retrieved `DocumentSnapshot` if they have already been applied by the
   * backend. If the client is offline, the read fails. If you like to use
   * caching or see local modifications, please use the full Firestore SDK.
   *
   * @param reference - The reference of the document to fetch.
   * @returns A Promise resolved with a `DocumentSnapshot` containing the current
   * document contents.
   */ function _r(t) {
      const n = te((t = rt(t, ue)).firestore), e = new yr(t.firestore);
      return Jn(n, [ t._key ]).then((n => {
          g(1 === n.length);
          const r = n[0];
          return new We(t.firestore, e, t._key, r.isFoundDocument() ? r : null, t.converter);
      }));
  }
  
  /**
   * Executes the query and returns the results as a {@link QuerySnapshot}.
   *
   * All queries are executed directly by the server, even if the the query was
   * previously executed. Recent modifications are only reflected in the retrieved
   * results if they have already been applied by the backend. If the client is
   * offline, the operation fails. To see previously cached result and local
   * modifications, use the full Firestore SDK.
   *
   * @param query - The `Query` to execute.
   * @returns A Promise that will be resolved with the results of the query.
   */ function gr(t) {
      !function(t) {
          if (sn(t) && 0 === t.explicitOrderBy.length) throw new L(q, "limitToLast() queries require specifying at least one orderBy() clause");
      }((t = rt(t, ce))._query);
      const n = te(t.firestore), e = new yr(t.firestore);
      return Zn(n, t._query).then((n => {
          const r = n.map((n => new Ge(t.firestore, e, n.key, n, t.converter)));
          return sn(t._query) && 
          // Limit to last queries reverse the orderBy constraint that was
          // specified by the user. As such, we need to reverse the order of the
          // results to return the documents in the expected order.
          r.reverse(), new He(t, r);
      }));
  }
  
  function br(t, n, e) {
      const r = pr((t = rt(t, ue)).converter, n, e), s = Re(Pe(t.firestore), "setDoc", t._key, r, null !== t.converter, e);
      return Kn(te(t.firestore), [ s.toMutation(t._key, gn.none()) ]);
  }
  
  function vr(t, n, e, ...r) {
      const s = Pe((t = rt(t, ue)).firestore);
      // For Compat types, we have to "extract" the underlying types before
      // performing validation.
          let i;
      i = "string" == typeof (n = getModularInstance(n)) || n instanceof me ? xe(s, "updateDoc", t._key, n, e, r) : qe(s, "updateDoc", t._key, n);
      return Kn(te(t.firestore), [ i.toMutation(t._key, gn.exists(!0)) ]);
  }
  
  /**
   * Deletes the document referred to by the specified `DocumentReference`.
   *
   * The deletion will only be reflected in document reads that occur after the
   * returned promise resolves. If the client is offline, the
   * delete fails. If you would like to see local modifications or buffer writes
   * until the client is online, use the full Firestore SDK.
   *
   * @param reference - A reference to the document to delete.
   * @returns A `Promise` resolved once the document has been successfully
   * deleted from the backend.
   */ function Er(t) {
      return Kn(te((t = rt(t, ue)).firestore), [ new In(t._key, gn.none()) ]);
  }
  
  /**
   * Add a new document to specified `CollectionReference` with the given data,
   * assigning it a document ID automatically.
   *
   * The result of this write will only be reflected in document reads that occur
   * after the returned promise resolves. If the client is offline, the
   * write fails. If you would like to see local modifications or buffer writes
   * until the client is online, use the full Firestore SDK.
   *
   * @param reference - A reference to the collection to add this document to.
   * @param data - An Object containing the data for the new document.
   * @returns A `Promise` resolved with a `DocumentReference` pointing to the
   * newly created document after it has been written to the backend.
   */ function Ir(t, n) {
      const e = fe(t = rt(t, ae)), r = pr(t.converter, n), s = Re(Pe(t.firestore), "addDoc", e._key, r, null !== e.converter, {});
      return Kn(te(t.firestore), [ s.toMutation(e._key, gn.exists(!1)) ]).then((() => e));
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Returns a sentinel for use with {@link @firebase/firestore/lite#(updateDoc:1)} or
   * {@link @firebase/firestore/lite#(setDoc:1)} with `{merge: true}` to mark a field for deletion.
   */ function Tr() {
      return new Ve("deleteField");
  }
  
  /**
   * Returns a sentinel used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link @firebase/firestore/lite#(updateDoc:1)} to
   * include a server-generated timestamp in the written data.
   */ function Ar() {
      return new De("serverTimestamp");
  }
  
  /**
   * Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link
   * @firebase/firestore/lite#(updateDoc:1)} that tells the server to union the given elements with any array
   * value that already exists on the server. Each specified element that doesn't
   * already exist in the array will be added to the end. If the field being
   * modified is not already an array it will be overwritten with an array
   * containing exactly the specified elements.
   *
   * @param elements - The elements to union into the array.
   * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
   * `updateDoc()`.
   */ function Pr(...t) {
      // NOTE: We don't actually parse the data until it's used in set() or
      // update() since we'd need the Firestore instance to do this.
      return new $e("arrayUnion", t);
  }
  
  /**
   * Returns a special value that can be used with {@link (setDoc:1)} or {@link
   * updateDoc:1} that tells the server to remove the given elements from any
   * array value that already exists on the server. All instances of each element
   * specified will be removed from the array. If the field being modified is not
   * already an array it will be overwritten with an empty array.
   *
   * @param elements - The elements to remove from the array.
   * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
   * `updateDoc()`
   */ function Rr(...t) {
      // NOTE: We don't actually parse the data until it's used in set() or
      // update() since we'd need the Firestore instance to do this.
      return new Fe("arrayRemove", t);
  }
  
  /**
   * Returns a special value that can be used with {@link @firebase/firestore/lite#(setDoc:1)} or {@link
   * @firebase/firestore/lite#(updateDoc:1)} that tells the server to increment the field's current value by
   * the given value.
   *
   * If either the operand or the current field value uses floating point
   * precision, all arithmetic follows IEEE 754 semantics. If both values are
   * integers, values outside of JavaScript's safe number range
   * (`Number.MIN_SAFE_INTEGER` to `Number.MAX_SAFE_INTEGER`) are also subject to
   * precision loss. Furthermore, once processed by the Firestore backend, all
   * integer operations are capped between -2^63 and 2^63-1.
   *
   * If the current field value is not of type `number`, or if the field does not
   * yet exist, the transformation sets the field to the given value.
   *
   * @param n - The value to increment by.
   * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
   * `updateDoc()`
   */ function Vr(t) {
      return new Se("increment", t);
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * A write batch, used to perform multiple writes as a single atomic unit.
   *
   * A `WriteBatch` object can be acquired by calling {@link writeBatch}. It
   * provides methods for adding writes to the write batch. None of the writes
   * will be committed (or visible locally) until {@link WriteBatch.commit} is
   * called.
   */ class Nr {
      /** @hideconstructor */
      constructor(t, n) {
          this._firestore = t, this._commitHandler = n, this._mutations = [], this._committed = !1, 
          this._dataReader = Pe(t);
      }
      set(t, n, e) {
          this._verifyNotCommitted();
          const r = Dr(t, this._firestore), s = pr(r.converter, n, e), i = Re(this._dataReader, "WriteBatch.set", r._key, s, null !== r.converter, e);
          return this._mutations.push(i.toMutation(r._key, gn.none())), this;
      }
      update(t, n, e, ...r) {
          this._verifyNotCommitted();
          const s = Dr(t, this._firestore);
          // For Compat types, we have to "extract" the underlying types before
          // performing validation.
                  let i;
          return i = "string" == typeof (n = getModularInstance(n)) || n instanceof me ? xe(this._dataReader, "WriteBatch.update", s._key, n, e, r) : qe(this._dataReader, "WriteBatch.update", s._key, n), 
          this._mutations.push(i.toMutation(s._key, gn.exists(!0))), this;
      }
      /**
       * Deletes the document referred to by the provided {@link DocumentReference}.
       *
       * @param documentRef - A reference to the document to be deleted.
       * @returns This `WriteBatch` instance. Used for chaining method calls.
       */    delete(t) {
          this._verifyNotCommitted();
          const n = Dr(t, this._firestore);
          return this._mutations = this._mutations.concat(new In(n._key, gn.none())), this;
      }
      /**
       * Commits all of the writes in this write batch as a single atomic unit.
       *
       * The result of these writes will only be reflected in document reads that
       * occur after the returned promise resolves. If the client is offline, the
       * write fails. If you would like to see local modifications or buffer writes
       * until the client is online, use the full Firestore SDK.
       *
       * @returns A `Promise` resolved once all of the writes in the batch have been
       * successfully written to the backend as an atomic unit (note that it won't
       * resolve while you're offline).
       */    commit() {
          return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
      }
      _verifyNotCommitted() {
          if (this._committed) throw new L($, "A write batch can no longer be used after commit() has been called.");
      }
  }
  
  function Dr(t, n) {
      if ((t = getModularInstance(t)).firestore !== n) throw new L(T, "Provided document reference is from a different Firestore instance.");
      return t;
  }
  
  /**
   * Creates a write batch, used for performing multiple writes as a single
   * atomic operation. The maximum number of writes allowed in a single WriteBatch
   * is 500.
   *
   * The result of these writes will only be reflected in document reads that
   * occur after the returned promise resolves. If the client is offline, the
   * write fails. If you would like to see local modifications or buffer writes
   * until the client is online, use the full Firestore SDK.
   *
   * @returns A `WriteBatch` that can be used to atomically execute multiple
   * writes.
   */ function $r(t) {
      const n = te(t = rt(t, ee));
      return new Nr(t, (t => Kn(n, t)));
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Internal transaction object responsible for accumulating the mutations to
   * perform and the base versions for any documents read.
   */ class Fr {
      constructor(t) {
          this.datastore = t, 
          // The version of each document that was read during this transaction.
          this.readVersions = new Map, this.mutations = [], this.committed = !1, 
          /**
           * A deferred usage error that occurred previously in this transaction that
           * will cause the transaction to fail once it actually commits.
           */
          this.lastWriteError = null, 
          /**
           * Set of documents that have been written in the transaction.
           *
           * When there's more than one write to the same key in a transaction, any
           * writes after the first are handled differently.
           */
          this.writtenDocs = new Set;
      }
      async lookup(t) {
          if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new L(T, "Firestore transactions require all reads to be executed before all writes.");
          const n = await Jn(this.datastore, t);
          return n.forEach((t => this.recordVersion(t))), n;
      }
      set(t, n) {
          this.write(n.toMutation(t, this.precondition(t))), this.writtenDocs.add(t.toString());
      }
      update(t, n) {
          try {
              this.write(n.toMutation(t, this.preconditionForUpdate(t)));
          } catch (t) {
              this.lastWriteError = t;
          }
          this.writtenDocs.add(t.toString());
      }
      delete(t) {
          this.write(new In(t, this.precondition(t))), this.writtenDocs.add(t.toString());
      }
      async commit() {
          if (this.ensureCommitNotCalled(), this.lastWriteError) throw this.lastWriteError;
          const t = this.readVersions;
          // For each mutation, note that the doc was written.
                  this.mutations.forEach((n => {
              t.delete(n.key.toString());
          })), 
          // For each document that was read but not written to, we want to perform
          // a `verify` operation.
          t.forEach(((t, n) => {
              const e = Z.fromPath(n);
              this.mutations.push(new Tn(e, this.precondition(e)));
          })), await Kn(this.datastore, this.mutations), this.committed = !0;
      }
      recordVersion(t) {
          let n;
          if (t.isFoundDocument()) n = t.version; else {
              if (!t.isNoDocument()) throw _();
              // For deleted docs, we must use baseVersion 0 when we overwrite them.
              n = yt.min();
          }
          const e = this.readVersions.get(t.key.toString());
          if (e) {
              if (!n.isEqual(e)) 
              // This transaction will fail no matter what.
              throw new L(F, "Document version changed between two reads.");
          } else this.readVersions.set(t.key.toString(), n);
      }
      /**
       * Returns the version of this document when it was read in this transaction,
       * as a precondition, or no precondition if it was not read.
       */    precondition(t) {
          const n = this.readVersions.get(t.toString());
          return !this.writtenDocs.has(t.toString()) && n ? gn.updateTime(n) : gn.none();
      }
      /**
       * Returns the precondition for a document if the operation is an update.
       */    preconditionForUpdate(t) {
          const n = this.readVersions.get(t.toString());
          // The first time a document is written, we want to take into account the
          // read time and existence
                  if (!this.writtenDocs.has(t.toString()) && n) {
              if (n.isEqual(yt.min())) 
              // The document doesn't exist, so fail the transaction.
              // This has to be validated locally because you can't send a
              // precondition that a document does not exist without changing the
              // semantics of the backend write to be an insert. This is the reverse
              // of what we want, since we want to assert that the document doesn't
              // exist but then send the update and have it fail. Since we can't
              // express that to the backend, we have to validate locally.
              // Note: this can change once we can send separate verify writes in the
              // transaction.
              throw new L(T, "Can't update a document that doesn't exist.");
              // Document exists, base precondition on document update time.
                          return gn.updateTime(n);
          }
          // Document was not read, so we just use the preconditions for a blind
          // update.
          return gn.exists(!0);
      }
      write(t) {
          this.ensureCommitNotCalled(), this.mutations.push(t);
      }
      ensureCommitNotCalled() {}
  }
  
  /**
   * @license
   * Copyright 2019 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * TransactionRunner encapsulates the logic needed to run and retry transactions
   * with backoff.
   */
  class Sr {
      constructor(t, n, e, r) {
          this.asyncQueue = t, this.datastore = n, this.updateFunction = e, this.deferred = r, 
          this.Et = 5, this.It = new Hn(this.asyncQueue, "transaction_retry" /* TransactionRetry */);
      }
      /** Runs the transaction and sets the result on deferred. */    run() {
          this.Et -= 1, this.Tt();
      }
      Tt() {
          this.It.W((async () => {
              const t = new Fr(this.datastore), n = this.At(t);
              n && n.then((n => {
                  this.asyncQueue.enqueueAndForget((() => t.commit().then((() => {
                      this.deferred.resolve(n);
                  })).catch((t => {
                      this.Pt(t);
                  }))));
              })).catch((t => {
                  this.Pt(t);
              }));
          }));
      }
      At(t) {
          try {
              const n = this.updateFunction(t);
              return !it(n) && n.catch && n.then ? n : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
              null);
          } catch (t) {
              // Do not retry errors thrown by user provided updateFunction.
              return this.deferred.reject(t), null;
          }
      }
      Pt(t) {
          this.Et > 0 && this.Rt(t) ? (this.Et -= 1, this.asyncQueue.enqueueAndForget((() => (this.Tt(), 
          Promise.resolve())))) : this.deferred.reject(t);
      }
      Rt(t) {
          if ("FirebaseError" === t.name) {
              // In transactions, the backend will fail outdated reads with FAILED_PRECONDITION and
              // non-matching document versions with ABORTED. These errors should be retried.
              const n = t.code;
              return "aborted" === n || "failed-precondition" === n || !
              /**
   * Determines whether an error code represents a permanent error when received
   * in response to a non-write operation.
   *
   * See isPermanentWriteError for classifying write errors.
   */
              function(t) {
                  switch (t) {
                    case v:
                      return _();
  
                    case E:
                    case I:
                    case A:
                    case D:
                    case x:
                    case O:
   // Unauthenticated means something went wrong with our token and we need
                      // to retry with new credentials which will happen automatically.
                                        case N:
                      return !1;
  
                    case T:
                    case P:
                    case R:
                    case V:
                    case $:
   // Aborted might be retried in some scenarios, but that is dependant on
                      // the context and should handled individually by the calling code.
                      // See https://cloud.google.com/apis/design/errors.
                                        case F:
                    case S:
                    case q:
                    case C:
                      return !0;
  
                    default:
                      return _();
                  }
              }(n);
          }
          return !1;
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /** The Platform's 'document' implementation or null if not available. */ function qr() {
      // `document` is not always available, e.g. in ReactNative and WebWorkers.
      // eslint-disable-next-line no-restricted-globals
      return "undefined" != typeof document ? document : null;
  }
  
  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
  /**
   * Represents an operation scheduled to be run in the future on an AsyncQueue.
   *
   * It is created via DelayedOperation.createAndSchedule().
   *
   * Supports cancellation (via cancel()) and early execution (via skipDelay()).
   *
   * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
   * in newer versions of TypeScript defines `finally`, which is not available in
   * IE.
   */ class xr {
      constructor(t, n, e, r, s) {
          this.asyncQueue = t, this.timerId = n, this.targetTimeMs = e, this.op = r, this.removalCallback = s, 
          this.deferred = new U, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
          // It's normal for the deferred promise to be canceled (due to cancellation)
          // and so we attach a dummy catch callback to avoid
          // 'UnhandledPromiseRejectionWarning' log spam.
          this.deferred.promise.catch((t => {}));
      }
      /**
       * Creates and returns a DelayedOperation that has been scheduled to be
       * executed on the provided asyncQueue after the provided delayMs.
       *
       * @param asyncQueue - The queue to schedule the operation on.
       * @param id - A Timer ID identifying the type of operation this is.
       * @param delayMs - The delay (ms) before the operation should be scheduled.
       * @param op - The operation to run.
       * @param removalCallback - A callback to be called synchronously once the
       *   operation is executed or canceled, notifying the AsyncQueue to remove it
       *   from its delayedOperations list.
       *   PORTING NOTE: This exists to prevent making removeDelayedOperation() and
       *   the DelayedOperation class public.
       */    static createAndSchedule(t, n, e, r, s) {
          const i = Date.now() + e, o = new xr(t, n, i, r, s);
          return o.start(e), o;
      }
      /**
       * Starts the timer. This is called immediately after construction by
       * createAndSchedule().
       */    start(t) {
          this.timerHandle = setTimeout((() => this.handleDelayElapsed()), t);
      }
      /**
       * Queues the operation to run immediately (if it hasn't already been run or
       * canceled).
       */    skipDelay() {
          return this.handleDelayElapsed();
      }
      /**
       * Cancels the operation if it hasn't already been executed or canceled. The
       * promise will be rejected.
       *
       * As long as the operation has not yet been run, calling cancel() provides a
       * guarantee that the operation will not be run.
       */    cancel(t) {
          null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new L(E, "Operation cancelled" + (t ? ": " + t : ""))));
      }
      handleDelayElapsed() {
          this.asyncQueue.enqueueAndForget((() => null !== this.timerHandle ? (this.clearTimeout(), 
          this.op().then((t => this.deferred.resolve(t)))) : Promise.resolve()));
      }
      clearTimeout() {
          null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
          this.timerHandle = null);
      }
  }
  
  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ class Or {
      constructor() {
          // The last promise in the queue.
          this.Vt = Promise.resolve(), 
          // A list of retryable operations. Retryable operations are run in order and
          // retried with backoff.
          this.Nt = [], 
          // Is this AsyncQueue being shut down? Once it is set to true, it will not
          // be changed again.
          this.Dt = !1, 
          // Operations scheduled to be queued in the future. Operations are
          // automatically removed after they are run or canceled.
          this.$t = [], 
          // visible for testing
          this.Ft = null, 
          // Flag set while there's an outstanding AsyncQueue operation, used for
          // assertion sanity-checks.
          this.St = !1, 
          // Enabled during shutdown on Safari to prevent future access to IndexedDB.
          this.qt = !1, 
          // List of TimerIds to fast-forward delays for.
          this.xt = [], 
          // Backoff timer used to schedule retries for retryable operations
          this.It = new Hn(this, "async_queue_retry" /* AsyncQueueRetry */), 
          // Visibility handler that triggers an immediate retry of all retryable
          // operations. Meant to speed up recovery when we regain file system access
          // after page comes into foreground.
          this.Ot = () => {
              const t = qr();
              t && w("AsyncQueue", "Visibility state changed to " + t.visibilityState), this.It.H();
          };
          const t = qr();
          t && "function" == typeof t.addEventListener && t.addEventListener("visibilitychange", this.Ot);
      }
      get isShuttingDown() {
          return this.Dt;
      }
      /**
       * Adds a new operation to the queue without waiting for it to complete (i.e.
       * we ignore the Promise result).
       */    enqueueAndForget(t) {
          // eslint-disable-next-line @typescript-eslint/no-floating-promises
          this.enqueue(t);
      }
      enqueueAndForgetEvenWhileRestricted(t) {
          this.Ct(), 
          // eslint-disable-next-line @typescript-eslint/no-floating-promises
          this.Lt(t);
      }
      enterRestrictedMode(t) {
          if (!this.Dt) {
              this.Dt = !0, this.qt = t || !1;
              const n = qr();
              n && "function" == typeof n.removeEventListener && n.removeEventListener("visibilitychange", this.Ot);
          }
      }
      enqueue(t) {
          if (this.Ct(), this.Dt) 
          // Return a Promise which never resolves.
          return new Promise((() => {}));
          // Create a deferred Promise that we can return to the callee. This
          // allows us to return a "hanging Promise" only to the callee and still
          // advance the queue even when the operation is not run.
                  const n = new U;
          return this.Lt((() => this.Dt && this.qt ? Promise.resolve() : (t().then(n.resolve, n.reject), 
          n.promise))).then((() => n.promise));
      }
      enqueueRetryable(t) {
          this.enqueueAndForget((() => (this.Nt.push(t), this.Ut())));
      }
      /**
       * Runs the next operation from the retryable queue. If the operation fails,
       * reschedules with backoff.
       */    async Ut() {
          if (0 !== this.Nt.length) {
              try {
                  await this.Nt[0](), this.Nt.shift(), this.It.reset();
              } catch (t) {
                  if (!
                  /**
   * @license
   * Copyright 2017 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
                  /** Verifies whether `e` is an IndexedDbTransactionError. */
                  function(t) {
                      // Use name equality, as instanceof checks on errors don't work with errors
                      // that wrap other errors.
                      return "IndexedDbTransactionError" === t.name;
                  }
                  /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */ (t)) throw t;
   // Failure will be handled by AsyncQueue
                                  w("AsyncQueue", "Operation failed with retryable error: " + t);
              }
              this.Nt.length > 0 && 
              // If there are additional operations, we re-schedule `retryNextOp()`.
              // This is necessary to run retryable operations that failed during
              // their initial attempt since we don't know whether they are already
              // enqueued. If, for example, `op1`, `op2`, `op3` are enqueued and `op1`
              // needs to  be re-run, we will run `op1`, `op1`, `op2` using the
              // already enqueued calls to `retryNextOp()`. `op3()` will then run in the
              // call scheduled here.
              // Since `backoffAndRun()` cancels an existing backoff and schedules a
              // new backoff on every call, there is only ever a single additional
              // operation in the queue.
              this.It.W((() => this.Ut()));
          }
      }
      Lt(t) {
          const n = this.Vt.then((() => (this.St = !0, t().catch((t => {
              this.Ft = t, this.St = !1;
              // Re-throw the error so that this.tail becomes a rejected Promise and
              // all further attempts to chain (via .then) will just short-circuit
              // and return the rejected Promise.
              throw m("INTERNAL UNHANDLED ERROR: ", 
              /**
   * Chrome includes Error.message in Error.stack. Other browsers do not.
   * This returns expected output of message + stack when available.
   * @param error - Error or FirestoreError
   */
              function(t) {
                  let n = t.message || "";
                  t.stack && (n = t.stack.includes(t.message) ? t.stack : t.message + "\n" + t.stack);
                  return n;
              }
              /**
   * @license
   * Copyright 2020 Google LLC
   *
   * Licensed under the Apache License, Version 2.0 (the "License");
   * you may not use this file except in compliance with the License.
   * You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing, software
   * distributed under the License is distributed on an "AS IS" BASIS,
   * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   * See the License for the specific language governing permissions and
   * limitations under the License.
   */
              // TODO(mrschmidt) Consider using `BaseTransaction` as the base class in the
              // legacy SDK.
              /**
   * A reference to a transaction.
   *
   * The `Transaction` object passed to a transaction's `updateFunction` provides
   * the methods to read and write data within the transaction context. See
   * {@link runTransaction}.
   */ (t)), t;
          })).then((t => (this.St = !1, t))))));
          return this.Vt = n, n;
      }
      enqueueAfterDelay(t, n, e) {
          this.Ct(), 
          // Fast-forward delays for timerIds that have been overriden.
          this.xt.indexOf(t) > -1 && (n = 0);
          const r = xr.createAndSchedule(this, t, n, e, (t => this.jt(t)));
          return this.$t.push(r), r;
      }
      Ct() {
          this.Ft && _();
      }
      verifyOperationInProgress() {}
      /**
       * Waits until all currently queued tasks are finished executing. Delayed
       * operations are not run.
       */    async kt() {
          // Operations in the queue prior to draining may have enqueued additional
          // operations. Keep draining the queue until the tail is no longer advanced,
          // which indicates that no more new operations were enqueued and that all
          // operations were executed.
          let t;
          do {
              t = this.Vt, await t;
          } while (t !== this.Vt);
      }
      /**
       * For Tests: Determine if a delayed operation with a particular TimerId
       * exists.
       */    Mt(t) {
          for (const n of this.$t) if (n.timerId === t) return !0;
          return !1;
      }
      /**
       * For Tests: Runs some or all delayed operations early.
       *
       * @param lastTimerId - Delayed operations up to and including this TimerId
       * will be drained. Pass TimerId.All to run all delayed operations.
       * @returns a Promise that resolves once all operations have been run.
       */    Bt(t) {
          // Note that draining may generate more delayed ops, so we do that first.
          return this.kt().then((() => {
              // Run ops in the same order they'd run if they ran naturally.
              this.$t.sort(((t, n) => t.targetTimeMs - n.targetTimeMs));
              for (const n of this.$t) if (n.skipDelay(), "all" /* All */ !== t && n.timerId === t) break;
              return this.kt();
          }));
      }
      /**
       * For Tests: Skip all subsequent delays for a timer id.
       */    Qt(t) {
          this.xt.push(t);
      }
      /** Called once a DelayedOperation is run or canceled. */    jt(t) {
          // NOTE: indexOf / slice are O(n), but delayedOperations is expected to be small.
          const n = this.$t.indexOf(t);
          this.$t.splice(n, 1);
      }
  }
  
  class Cr {
      /** @hideconstructor */
      constructor(t, n) {
          this._firestore = t, this._transaction = n, this._dataReader = Pe(t);
      }
      /**
       * Reads the document referenced by the provided {@link DocumentReference}.
       *
       * @param documentRef - A reference to the document to be read.
       * @returns A `DocumentSnapshot` with the read data.
       */    get(t) {
          const n = Dr(t, this._firestore), e = new yr(this._firestore);
          return this._transaction.lookup([ n._key ]).then((t => {
              if (!t || 1 !== t.length) return _();
              const r = t[0];
              if (r.isFoundDocument()) return new We(this._firestore, e, r.key, r, n.converter);
              if (r.isNoDocument()) return new We(this._firestore, e, n._key, null, n.converter);
              throw _();
          }));
      }
      set(t, n, e) {
          const r = Dr(t, this._firestore), s = pr(r.converter, n, e), i = Re(this._dataReader, "Transaction.set", r._key, s, null !== r.converter, e);
          return this._transaction.set(r._key, i), this;
      }
      update(t, n, e, ...r) {
          const s = Dr(t, this._firestore);
          // For Compat types, we have to "extract" the underlying types before
          // performing validation.
                  let i;
          return i = "string" == typeof (n = getModularInstance(n)) || n instanceof me ? xe(this._dataReader, "Transaction.update", s._key, n, e, r) : qe(this._dataReader, "Transaction.update", s._key, n), 
          this._transaction.update(s._key, i), this;
      }
      /**
       * Deletes the document referred to by the provided {@link DocumentReference}.
       *
       * @param documentRef - A reference to the document to be deleted.
       * @returns This `Transaction` instance. Used for chaining method calls.
       */    delete(t) {
          const n = Dr(t, this._firestore);
          return this._transaction.delete(n._key), this;
      }
  }
  
  /**
   * Executes the given `updateFunction` and then attempts to commit the changes
   * applied within the transaction. If any document read within the transaction
   * has changed, Cloud Firestore retries the `updateFunction`. If it fails to
   * commit after 5 attempts, the transaction fails.
   *
   * The maximum number of writes allowed in a single transaction is 500.
   *
   * @param firestore - A reference to the Firestore database to run this
   * transaction against.
   * @param updateFunction - The function to execute within the transaction
   * context.
   * @returns If the transaction completed successfully or was explicitly aborted
   * (the `updateFunction` returned a failed promise), the promise returned by the
   * `updateFunction `is returned here. Otherwise, if the transaction failed, a
   * rejected promise with the corresponding failure error is returned.
   */ function Lr(t, n) {
      const e = te(t = rt(t, ee)), r = new U;
      return new Sr(new Or, e, (e => n(new Cr(t, e))), r).run(), r.promise;
  }
  
  /**
   * Firestore Lite
   *
   * @remarks Firestore Lite is a small online-only SDK that allows read
   * and write access to your Firestore database. All operations connect
   * directly to the backend, and `onSnapshot()` APIs are not supported.
   * @packageDocumentation
   */ !function(t) {
      l = t;
  }(`${SDK_VERSION}_lite`), _registerComponent(new Component("firestore/lite", ((t, {options: n}) => {
      const e = t.getProvider("app").getImmediate(), r = new ee(e, new B(t.getProvider("auth-internal")));
      return n && r._setSettings(n), r;
  }), "PUBLIC" /* PUBLIC */)), registerVersion("firestore-lite", "3.0.2", "node");
  
  export { ye as Bytes, ae as CollectionReference, ue as DocumentReference, We as DocumentSnapshot, me as FieldPath, _e as FieldValue, ee as Firestore, L as FirestoreError, ge as GeoPoint, ce as Query, Je as QueryConstraint, Ge as QueryDocumentSnapshot, He as QuerySnapshot, pt as Timestamp, Cr as Transaction, Nr as WriteBatch, Ir as addDoc, Rr as arrayRemove, Pr as arrayUnion, he as collection, le as collectionGroup, ie as connectFirestoreEmulator, Er as deleteDoc, Tr as deleteField, fe as doc, pe as documentId, lr as endAt, hr as endBefore, _r as getDoc, gr as getDocs, se as getFirestore, Vr as increment, re as initializeFirestore, sr as limit, ir as limitToLast, er as orderBy, Ze as query, we as queryEqual, de as refEqual, Lr as runTransaction, Ar as serverTimestamp, br as setDoc, d as setLogLevel, Ye as snapshotEqual, cr as startAfter, ur as startAt, oe as terminate, vr as updateDoc, tr as where, $r as writeBatch };
  
  //# sourceMappingURL=firebase-firestore-lite.js.map
  