@firebase/firestore 3.8.4 → 3.9.0-20230314181055

package/dist/lite/index.browser.esm5.js

@@ -67,7 +67,7 @@ v.MOCK_USER = new v("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var g = "9.17.2", w = new l("@firebase/firestore");
+var g = "9.18.0-20230314181055", w = new l("@firebase/firestore");
 
 /**
  * @license
@@ -659,6 +659,49 @@ function lt(t, e) {
     if (e <= 0) throw new B(V, "Function ".concat(t, "() requires a positive number, but it was: ").concat(e, "."));
 }
 
+/**
+ * @license
+ * Copyright 2023 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 value returned from the most recent invocation of
+ * `generateUniqueDebugId()`, or null if it has never been invoked.
+ */ var ft = null;
+
+/**
+ * Generates and returns an initial value for `lastUniqueDebugId`.
+ *
+ * The returned value is randomly selected from a range of integers that are
+ * represented as 8 hexadecimal digits. This means that (within reason) any
+ * numbers generated by incrementing the returned number by 1 will also be
+ * represented by 8 hexadecimal digits. This leads to all "IDs" having the same
+ * length when converted to a hexadecimal string, making reading logs containing
+ * these IDs easier to follow. And since the return value is randomly selected
+ * it will help to differentiate between logs from different executions.
+ */
+/**
+ * Generates and returns a unique ID as a hexadecimal string.
+ *
+ * The returned ID is intended to be used in debug logging messages to help
+ * correlate log messages that may be spatially separated in the logs, but
+ * logically related. For example, a network connection could include the same
+ * "debug ID" string in all of its log messages to help trace a specific
+ * connection over time.
+ *
+ * @return the 10-character generated ID (e.g. "0xa1b2c3d4").
+ */
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -677,11 +720,12 @@ function lt(t, e) {
  */
 /**
  * Returns whether a variable is either undefined or null.
- */ function ft(t) {
+ */
+function ht(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function ht(t) {
+/** Returns whether the value represents -0. */ function pt(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;
@@ -706,7 +750,7 @@ function lt(t, e) {
  * 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 pt, dt, yt = {
+ */ var dt, yt, mt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -751,7 +795,7 @@ function lt(t, e) {
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function mt(t) {
+function vt(t) {
     if (void 0 === t) return T("RPC_ERROR", "HTTP error has no status"), P;
     // 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
@@ -843,16 +887,16 @@ function mt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (dt = pt || (pt = {}))[dt.OK = 0] = "OK", dt[dt.CANCELLED = 1] = "CANCELLED", 
-dt[dt.UNKNOWN = 2] = "UNKNOWN", dt[dt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-dt[dt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", dt[dt.NOT_FOUND = 5] = "NOT_FOUND", 
-dt[dt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", dt[dt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-dt[dt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", dt[dt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-dt[dt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", dt[dt.ABORTED = 10] = "ABORTED", 
-dt[dt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", dt[dt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-dt[dt.INTERNAL = 13] = "INTERNAL", dt[dt.UNAVAILABLE = 14] = "UNAVAILABLE", dt[dt.DATA_LOSS = 15] = "DATA_LOSS";
-
-var vt = /** @class */ function(r) {
+ */ (yt = dt || (dt = {}))[yt.OK = 0] = "OK", yt[yt.CANCELLED = 1] = "CANCELLED", 
+yt[yt.UNKNOWN = 2] = "UNKNOWN", yt[yt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+yt[yt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", yt[yt.NOT_FOUND = 5] = "NOT_FOUND", 
+yt[yt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", yt[yt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+yt[yt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", yt[yt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+yt[yt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", yt[yt.ABORTED = 10] = "ABORTED", 
+yt[yt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", yt[yt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+yt[yt.INTERNAL = 13] = "INTERNAL", yt[yt.UNAVAILABLE = 14] = "UNAVAILABLE", yt[yt.DATA_LOSS = 15] = "DATA_LOSS";
+
+var gt = /** @class */ function(r) {
     /**
      * @param databaseInfo - The connection info.
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
@@ -886,14 +930,14 @@ var vt = /** @class */ function(r) {
                     return a = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw u = n.sent(), new B(mt((s = u).status), "Request failed with error: " + s.statusText);
+                    throw u = n.sent(), new B(vt((s = u).status), "Request failed with error: " + s.statusText);
 
                   case 4:
                     return a.ok ? [ 3 /*break*/ , 6 ] : [ 4 /*yield*/ , a.json() ];
 
                   case 5:
                     throw c = n.sent(), Array.isArray(c) && (c = c[0]), l = null === (t = null == c ? void 0 : c.error) || void 0 === t ? void 0 : t.message, 
-                    new B(mt(a.status), "Request failed with error: ".concat(null != l ? l : a.statusText));
+                    new B(vt(a.status), "Request failed with error: ".concat(null != l ? l : a.statusText));
 
                   case 6:
                     return [ 2 /*return*/ , a.json() ];
@@ -916,13 +960,15 @@ var vt = /** @class */ function(r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype.A = function(t, e, n, r, i) {
-        var o = this.I(t, e);
-        b("RestConnection", "Sending: ", o, n);
-        var a = {};
-        return this.T(a, r, i), this.R(t, o, a, n).then((function(t) {
-            return b("RestConnection", "Received: ", t), t;
+        var o = (null === ft ? ft = 268435456 + Math.round(2147483648 * Math.random()) : ft++, 
+        "0x" + ft.toString(16)), a = this.I(t, e);
+        b("RestConnection", "Sending RPC '".concat(t, "' ").concat(o, ":"), a, n);
+        var u = {};
+        return this.T(u, r, i), this.R(t, a, u, n).then((function(e) {
+            return b("RestConnection", "Received RPC '".concat(t, "' ").concat(o, ": "), e), 
+            e;
         }), (function(e) {
-            throw E("RestConnection", "".concat(t, " failed with error: "), e, "url: ", o, "request:", n), 
+            throw E("RestConnection", "RPC '".concat(t, "' ").concat(o, " failed with error: "), e, "url: ", a, "request:", n), 
             e;
         }));
     }, t.prototype.P = function(t, e, n, r, i, o) {
@@ -947,10 +993,10 @@ var vt = /** @class */ function(r) {
             return t[n] = e;
         }));
     }, t.prototype.I = function(t, e) {
-        var n = yt[t];
+        var n = mt[t];
         return "".concat(this.p, "/v1/").concat(e, ":").concat(n);
     }, t;
-}()), gt = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/, wt = /** @class */ function() {
+}()), wt = /^[_a-zA-Z][_a-zA-Z0-9]*(?:\.[_a-zA-Z][_a-zA-Z0-9]*)*$/, _t = /** @class */ function() {
     /**
      * @internal
      * @param alias Un-escaped alias representation
@@ -961,7 +1007,7 @@ var vt = /** @class */ function(r) {
     /**
      * Returns true if the string could be used as an alias.
      */    return t.D = function(t) {
-        return gt.test(t);
+        return wt.test(t);
     }, 
     /**
      * Return an escaped and quoted string representation of the alias.
@@ -970,7 +1016,7 @@ var vt = /** @class */ function(r) {
         var e = this.alias.replace(/\\/g, "\\\\").replace(/`/g, "\\`");
         return t.D(e) || (e = "`" + e + "`"), e;
     }, t;
-}(), _t = function(t, e, n) {
+}(), bt = function(t, e, n) {
     this.alias = t, this.N = e, this.fieldPath = n;
 };
 
@@ -1028,7 +1074,7 @@ var vt = /** @class */ function(r) {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function bt(t) {
+function Tt(t) {
     // Polyfills for IE and WebWorker by using `self` and `msCrypto` when `crypto` is not available.
     var e = 
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
@@ -1054,14 +1100,14 @@ function bt(t) {
  * 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 Tt = /** @class */ function() {
+ */ var Et = /** @class */ function() {
     function t() {}
     return t.F = function() {
         for (
         // Alphanumeric characters
         var t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", e = Math.floor(256 / t.length) * t.length, n = ""
         // The largest byte value that is a multiple of `char.length`.
-        ; n.length < 20; ) for (var r = bt(40), i = 0; i < r.length; ++i) 
+        ; n.length < 20; ) for (var r = Tt(40), i = 0; i < r.length; ++i) 
         // Only accept values that are [0, maxMultiple), this ensures they can
         // be evenly mapped to indices of `chars` via a modulo operation.
         n.length < 20 && r[i] < e && (n += t.charAt(r[i] % t.length));
@@ -1069,11 +1115,11 @@ function bt(t) {
     }, t;
 }();
 
-function Et(t, e) {
+function St(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function St(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function kt(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -1094,13 +1140,13 @@ function Et(t, e) {
  * 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 kt(t) {
+ */ function At(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function At(t, e) {
+function It(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1122,13 +1168,13 @@ function At(t, e) {
  */
 /**
  * An error encountered while decoding base64 string.
- */ var It = /** @class */ function(e) {
+ */ var Ft = /** @class */ function(e) {
     function n() {
         var t = this;
         return (t = e.apply(this, arguments) || this).name = "Base64DecodeError", t;
     }
     return t(n, e), n;
-}(Error), Ft = /** @class */ function() {
+}(Error), Pt = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1137,7 +1183,7 @@ function At(t, e) {
             try {
                 return atob(t);
             } catch (t) {
-                throw t instanceof DOMException ? new It("Invalid base64 string: " + t) : t;
+                throw t instanceof DOMException ? new Ft("Invalid base64 string: " + t) : t;
             }
         }(e);
         return new t(n);
@@ -1177,7 +1223,7 @@ function At(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return Et(this.binaryString, t.binaryString);
+        return St(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1224,14 +1270,14 @@ function At(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ Ft.EMPTY_BYTE_STRING = new Ft("");
+ */ Pt.EMPTY_BYTE_STRING = new Pt("");
 
-var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+var Vt = 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 Vt(t) {
+ */ function Dt(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.
@@ -1239,7 +1285,7 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         // 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.
-        var e = 0, n = Pt.exec(t);
+        var e = 0, n = Vt.exec(t);
         if (A(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
@@ -1253,21 +1299,21 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Dt(t.seconds),
-        nanos: Dt(t.nanos)
+        seconds: Nt(t.seconds),
+        nanos: Nt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Dt(t) {
+ */ function Nt(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 Nt(t) {
-    return "string" == typeof t ? Ft.fromBase64String(t) : Ft.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Ot(t) {
+    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
 }
 
 /**
@@ -1300,7 +1346,7 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * For examples and further specifications, refer to the
  * {@link https://github.com/google/protobuf/blob/master/src/google/protobuf/timestamp.proto | Timestamp definition}.
- */ var Ot = /** @class */ function() {
+ */ var qt = /** @class */ function() {
     /**
      * Creates a new timestamp.
      *
@@ -1377,7 +1423,7 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     t.prototype.toMillis = function() {
         return 1e3 * this.seconds + this.nanoseconds / 1e6;
     }, t.prototype._compareTo = function(t) {
-        return this.seconds === t.seconds ? Et(this.nanoseconds, t.nanoseconds) : Et(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? St(this.nanoseconds, t.nanoseconds) : St(this.seconds, t.seconds);
     }, 
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1449,7 +1495,7 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function qt(t) {
+ */ function Rt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1459,16 +1505,16 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *
  * Preserving the previous values allows the user to display the last resoled
  * value until the backend responds with the timestamp.
- */ function Rt(t) {
+ */ function Ct(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return qt(e) ? Rt(e) : e;
+    return Rt(e) ? Ct(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ct(t) {
-    var e = Vt(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new Ot(e.seconds, e.nanos);
+ */ function xt(t) {
+    var e = Dt(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new qt(e.seconds, e.nanos);
 }
 
 /**
@@ -1486,7 +1532,7 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * 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 xt = {
+ */ var Mt = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -1494,18 +1540,18 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     }
 };
 
-/** Extracts the backend's type order for the provided value. */ function Mt(t) {
-    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? qt(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
+/** Extracts the backend's type order for the provided value. */ function Lt(t) {
+    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? Rt(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
     }(t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : k();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Lt(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function jt(t, e) {
     if (t === e) return !0;
-    var n = Mt(t);
-    if (n !== Mt(e)) return !1;
+    var n = Lt(t);
+    if (n !== Lt(e)) return !1;
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
@@ -1515,14 +1561,14 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === e.booleanValue;
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return Ct(t).isEqual(Ct(e));
+        return xt(t).isEqual(xt(e));
 
       case 3 /* TypeOrder.TimestampValue */ :
         return function(t, e) {
             if ("string" == typeof t.timestampValue && "string" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === e.timestampValue;
-            var n = Vt(t.timestampValue), r = Vt(e.timestampValue);
+            var n = Dt(t.timestampValue), r = Dt(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1531,7 +1577,7 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            return Nt(t.bytesValue).isEqual(Nt(e.bytesValue));
+            return Ot(t.bytesValue).isEqual(Ot(e.bytesValue));
         }(t, e);
 
       case 7 /* TypeOrder.RefValue */ :
@@ -1539,27 +1585,27 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            return Dt(t.geoPointValue.latitude) === Dt(e.geoPointValue.latitude) && Dt(t.geoPointValue.longitude) === Dt(e.geoPointValue.longitude);
+            return Nt(t.geoPointValue.latitude) === Nt(e.geoPointValue.latitude) && Nt(t.geoPointValue.longitude) === Nt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return Dt(t.integerValue) === Dt(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return Nt(t.integerValue) === Nt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                var n = Dt(t.doubleValue), r = Dt(e.doubleValue);
-                return n === r ? ht(n) === ht(r) : isNaN(n) && isNaN(r);
+                var n = Nt(t.doubleValue), r = Nt(e.doubleValue);
+                return n === r ? pt(n) === pt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* TypeOrder.ArrayValue */ :
-        return St(t.arrayValue.values || [], e.arrayValue.values || [], Lt);
+        return kt(t.arrayValue.values || [], e.arrayValue.values || [], jt);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (kt(n) !== kt(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Lt(n[i], r[i]))) return !1;
+            if (At(n) !== At(r)) return !1;
+            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !jt(n[i], r[i]))) return !1;
             return !0;
         }(t, e);
 
@@ -1568,76 +1614,76 @@ var Pt = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     }
 }
 
-function jt(t, e) {
+function Ut(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return Lt(t, e);
+        return jt(t, e);
     }));
 }
 
-function Ut(t, e) {
+function Bt(t, e) {
     if (t === e) return 0;
-    var n = Mt(t), r = Mt(e);
-    if (n !== r) return Et(n, r);
+    var n = Lt(t), r = Lt(e);
+    if (n !== r) return St(n, r);
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
         return 0;
 
       case 1 /* TypeOrder.BooleanValue */ :
-        return Et(t.booleanValue, e.booleanValue);
+        return St(t.booleanValue, e.booleanValue);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
-            var n = Dt(t.integerValue || t.doubleValue), r = Dt(e.integerValue || e.doubleValue);
+            var n = Nt(t.integerValue || t.doubleValue), r = Nt(e.integerValue || e.doubleValue);
             return n < r ? -1 : n > r ? 1 : n === r ? 0 : 
             // one or both are NaN.
             isNaN(n) ? isNaN(r) ? 0 : -1 : 1;
         }(t, e);
 
       case 3 /* TypeOrder.TimestampValue */ :
-        return Bt(t.timestampValue, e.timestampValue);
+        return zt(t.timestampValue, e.timestampValue);
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return Bt(Ct(t), Ct(e));
+        return zt(xt(t), xt(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return Et(t.stringValue, e.stringValue);
+        return St(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            var n = Nt(t), r = Nt(e);
+            var n = Ot(t), r = Ot(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
       case 7 /* TypeOrder.RefValue */ :
         return function(t, e) {
             for (var n = t.split("/"), r = e.split("/"), i = 0; i < n.length && i < r.length; i++) {
-                var o = Et(n[i], r[i]);
+                var o = St(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return Et(n.length, r.length);
+            return St(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            var n = Et(Dt(t.latitude), Dt(e.latitude));
-            return 0 !== n ? n : Et(Dt(t.longitude), Dt(e.longitude));
+            var n = St(Nt(t.latitude), Nt(e.latitude));
+            return 0 !== n ? n : St(Nt(t.longitude), Nt(e.longitude));
         }(t.geoPointValue, e.geoPointValue);
 
       case 9 /* TypeOrder.ArrayValue */ :
         return function(t, e) {
             for (var n = t.values || [], r = e.values || [], i = 0; i < n.length && i < r.length; ++i) {
-                var o = Ut(n[i], r[i]);
+                var o = Bt(n[i], r[i]);
                 if (o) return o;
             }
-            return Et(n.length, r.length);
+            return St(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
-            if (t === xt && e === xt) return 0;
-            if (t === xt) return 1;
-            if (e === xt) return -1;
+            if (t === Mt && e === Mt) return 0;
+            if (t === Mt) return 1;
+            if (e === Mt) return -1;
             var n = t.fields || {}, r = Object.keys(n), i = e.fields || {}, o = Object.keys(i);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1645,12 +1691,12 @@ function Ut(t, e) {
             // canonical IDs are independent of insertion order.
                         r.sort(), o.sort();
             for (var a = 0; a < r.length && a < o.length; ++a) {
-                var u = Et(r[a], o[a]);
+                var u = St(r[a], o[a]);
                 if (0 !== u) return u;
-                var s = Ut(n[r[a]], i[o[a]]);
+                var s = Bt(n[r[a]], i[o[a]]);
                 if (0 !== s) return s;
             }
-            return Et(r.length, o.length);
+            return St(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
@@ -1658,35 +1704,35 @@ function Ut(t, e) {
     }
 }
 
-function Bt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Et(t, e);
-    var n = Vt(t), r = Vt(e), i = Et(n.seconds, r.seconds);
-    return 0 !== i ? i : Et(n.nanos, r.nanos);
+function zt(t, e) {
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return St(t, e);
+    var n = Dt(t), r = Dt(e), i = St(n.seconds, r.seconds);
+    return 0 !== i ? i : St(n.nanos, r.nanos);
 }
 
-function zt(t, e) {
+function Kt(t, e) {
     return {
         referenceValue: "projects/".concat(t.projectId, "/databases/").concat(t.database, "/documents/").concat(e.path.canonicalString())
     };
 }
 
-/** Returns true if `value` is an ArrayValue. */ function Kt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Qt(t) {
     return !!t && "arrayValue" in t;
 }
 
-/** Returns true if `value` is a NullValue. */ function Qt(t) {
+/** Returns true if `value` is a NullValue. */ function Gt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Gt(t) {
+/** Returns true if `value` is NaN. */ function Yt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Yt(t) {
+/** Returns true if `value` is a MapValue. */ function Wt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Wt(t) {
+/** Creates a deep copy of `source`. */ function Ht(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1699,8 +1745,8 @@ function zt(t, e) {
                 fields: {}
             }
         };
-        return At(t.mapValue.fields, (function(t, n) {
-            return e.mapValue.fields[t] = Wt(n);
+        return It(t.mapValue.fields, (function(t, n) {
+            return e.mapValue.fields[t] = Ht(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1708,21 +1754,21 @@ function zt(t, e) {
             arrayValue: {
                 values: []
             }
-        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Wt(t.arrayValue.values[r]);
+        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Ht(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
 }
 
-var Ht = function(t, e) {
+var Xt = function(t, e) {
     this.position = t, this.inclusive = e;
 };
 
-function Xt(t, e) {
+function Jt(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
-    for (var n = 0; n < t.position.length; n++) if (!Lt(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!jt(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -1741,7 +1787,7 @@ function Xt(t, e) {
  * 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 Jt = function() {}, Zt = /** @class */ function(e) {
+ */ var Zt = function() {}, $t = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this) || this).field = t, i.op = n, i.value = r, i;
@@ -1749,13 +1795,13 @@ function Xt(t, e) {
     /**
      * Creates a filter based on the provided arguments.
      */    return t(n, e), n.create = function(t, e, r) {
-        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, r) : new ee(t, e, r) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new oe(t, r) : "in" /* Operator.IN */ === e ? new ae(t, r) : "not-in" /* Operator.NOT_IN */ === e ? new ue(t, r) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new se(t, r) : new n(t, e, r);
+        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, r) : new ne(t, e, r) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new ae(t, r) : "in" /* Operator.IN */ === e ? new ue(t, r) : "not-in" /* Operator.NOT_IN */ === e ? new se(t, r) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new ce(t, r) : new n(t, e, r);
     }, n.createKeyFieldInFilter = function(t, e, n) {
-        return "in" /* Operator.IN */ === e ? new ne(t, n) : new re(t, n);
+        return "in" /* Operator.IN */ === e ? new re(t, n) : new ie(t, n);
     }, n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
         // Types do not have to match in NOT_EQUAL filters.
-                return "!=" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Ut(e, this.value)) : null !== e && Mt(this.value) === Mt(e) && this.matchesComparison(Ut(e, this.value));
+                return "!=" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Bt(e, this.value)) : null !== e && Lt(this.value) === Lt(e) && this.matchesComparison(Bt(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.matchesComparison = function(t) {
         switch (this.op) {
@@ -1789,7 +1835,7 @@ function Xt(t, e) {
     }, n.prototype.getFirstInequalityField = function() {
         return this.isInequality() ? this.field : null;
     }, n;
-}(Jt), $t = /** @class */ function(e) {
+}(Zt), te = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).filters = t, r.op = n, r.S = null, r;
@@ -1828,19 +1874,19 @@ function Xt(t, e) {
         }
         return null;
     }, n;
-}(Jt);
-
-function te(t, e) {
-    return t instanceof Zt ? function(t, e) {
-        return e instanceof Zt && t.op === e.op && t.field.isEqual(e.field) && Lt(t.value, e.value);
-    }(t, e) : t instanceof $t ? function(t, e) {
-        return e instanceof $t && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
-            return t && te(n, e.filters[r]);
+}(Zt);
+
+function ee(t, e) {
+    return t instanceof $t ? function(t, e) {
+        return e instanceof $t && t.op === e.op && t.field.isEqual(e.field) && jt(t.value, e.value);
+    }(t, e) : t instanceof te ? function(t, e) {
+        return e instanceof te && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
+            return t && ee(n, e.filters[r]);
         }), !0);
     }(t, e) : void k();
 }
 
-var ee = /** @class */ function(e) {
+var ne = /** @class */ function(e) {
     function n(t, n, r) {
         var i = this;
         return (i = e.call(this, t, n, r) || this).key = it.fromName(r.referenceValue), 
@@ -1850,10 +1896,10 @@ var ee = /** @class */ function(e) {
         var e = it.comparator(t.key, this.key);
         return this.matchesComparison(e);
     }, n;
-}(Zt), ne = /** @class */ function(e) {
+}($t), re = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* Operator.IN */ , n) || this).keys = ie("in" /* Operator.IN */ , n), 
+        return (r = e.call(this, t, "in" /* Operator.IN */ , n) || this).keys = oe("in" /* Operator.IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1861,10 +1907,10 @@ var ee = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Zt), re = /** @class */ function(e) {
+}($t), ie = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "not-in" /* Operator.NOT_IN */ , n) || this).keys = ie("not-in" /* Operator.NOT_IN */ , n), 
+        return (r = e.call(this, t, "not-in" /* Operator.NOT_IN */ , n) || this).keys = oe("not-in" /* Operator.NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1872,57 +1918,57 @@ var ee = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Zt);
+}($t);
 
-/** Filter that matches on key fields within an array. */ function ie(t, e) {
+/** Filter that matches on key fields within an array. */ function oe(t, e) {
     var n;
     return ((null === (n = e.arrayValue) || void 0 === n ? void 0 : n.values) || []).map((function(t) {
         return it.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var oe = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var ae = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains" /* Operator.ARRAY_CONTAINS */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return Kt(e) && jt(e.arrayValue, this.value);
+        return Qt(e) && Ut(e.arrayValue, this.value);
     }, n;
-}(Zt), ae = /** @class */ function(e) {
+}($t), ue = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "in" /* Operator.IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = t.data.field(this.field);
-        return null !== e && jt(this.value.arrayValue, e);
+        return null !== e && Ut(this.value.arrayValue, e);
     }, n;
-}(Zt), ue = /** @class */ function(e) {
+}($t), se = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "not-in" /* Operator.NOT_IN */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        if (jt(this.value.arrayValue, {
+        if (Ut(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !jt(this.value.arrayValue, e);
+        return null !== e && !Ut(this.value.arrayValue, e);
     }, n;
-}(Zt), se = /** @class */ function(e) {
+}($t), ce = /** @class */ function(e) {
     function n(t, n) {
         return e.call(this, t, "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ , n) || this;
     }
     return t(n, e), n.prototype.matches = function(t) {
         var e = this, n = t.data.field(this.field);
-        return !(!Kt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return jt(e.value.arrayValue, t);
+        return !(!Qt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Ut(e.value.arrayValue, t);
         }));
     }, n;
-}(Zt), ce = function(t, e /* Direction.ASCENDING */) {
+}($t), le = function(t, e /* Direction.ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function le(t, e) {
+/** A Filter that implements the IN operator. */ function fe(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
@@ -1945,16 +1991,16 @@ var ee = /** @class */ function(e) {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ var fe = /** @class */ function() {
+ */ var he = /** @class */ function() {
     function t(t) {
         this.timestamp = t;
     }
     return t.fromTimestamp = function(e) {
         return new t(e);
     }, t.min = function() {
-        return new t(new Ot(0, 0));
+        return new t(new qt(0, 0));
     }, t.max = function() {
-        return new t(new Ot(253402300799, 999999999));
+        return new t(new qt(253402300799, 999999999));
     }, t.prototype.compareTo = function(t) {
         return this.timestamp._compareTo(t.timestamp);
     }, t.prototype.isEqual = function(t) {
@@ -1968,17 +2014,17 @@ var ee = /** @class */ function(e) {
     }, t.prototype.toTimestamp = function() {
         return this.timestamp;
     }, t;
-}(), he = /** @class */ function() {
+}(), pe = /** @class */ function() {
     function t(t, e) {
-        this.comparator = t, this.root = e || de.EMPTY;
+        this.comparator = t, this.root = e || ye.EMPTY;
     }
     // Returns a copy of the map, with the specified key/value added or replaced.
         return t.prototype.insert = function(e, n) {
-        return new t(this.comparator, this.root.insert(e, n, this.comparator).copy(null, null, de.BLACK, null, null));
+        return new t(this.comparator, this.root.insert(e, n, this.comparator).copy(null, null, ye.BLACK, null, null));
     }, 
     // Returns a copy of the map, with the specified key removed.
     t.prototype.remove = function(e) {
-        return new t(this.comparator, this.root.remove(e, this.comparator).copy(null, null, de.BLACK, null, null));
+        return new t(this.comparator, this.root.remove(e, this.comparator).copy(null, null, ye.BLACK, null, null));
     }, 
     // Returns the value of the node with the given key, or null.
     t.prototype.get = function(t) {
@@ -2047,15 +2093,15 @@ var ee = /** @class */ function(e) {
     }, 
     // Returns an iterator over the SortedMap.
     t.prototype.getIterator = function() {
-        return new pe(this.root, null, this.comparator, !1);
+        return new de(this.root, null, this.comparator, !1);
     }, t.prototype.getIteratorFrom = function(t) {
-        return new pe(this.root, t, this.comparator, !1);
+        return new de(this.root, t, this.comparator, !1);
     }, t.prototype.getReverseIterator = function() {
-        return new pe(this.root, null, this.comparator, !0);
+        return new de(this.root, null, this.comparator, !0);
     }, t.prototype.getReverseIteratorFrom = function(t) {
-        return new pe(this.root, t, this.comparator, !0);
+        return new de(this.root, t, this.comparator, !0);
     }, t;
-}(), pe = /** @class */ function() {
+}(), de = /** @class */ function() {
     function t(t, e, n, r) {
         this.isReverse = r, this.nodeStack = [];
         for (var i = 1; !t.isEmpty(); ) if (i = e ? n(t.key, e) : 1, 
@@ -2092,7 +2138,7 @@ var ee = /** @class */ function(e) {
             value: t.value
         };
     }, t;
-}(), de = /** @class */ function() {
+}(), ye = /** @class */ function() {
     function t(e, n, r, i, o) {
         this.key = e, this.value = n, this.color = null != r ? r : t.RED, this.left = null != i ? i : t.EMPTY, 
         this.right = null != o ? o : t.EMPTY, this.size = this.left.size + 1 + this.right.size;
@@ -2213,9 +2259,9 @@ var ee = /** @class */ function(e) {
 // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-de.EMPTY = null, de.RED = !0, de.BLACK = !1, 
+ye.EMPTY = null, ye.RED = !0, ye.BLACK = !1, 
 // end LLRBEmptyNode
-de.EMPTY = new (/** @class */ function() {
+ye.EMPTY = new (/** @class */ function() {
     function t() {
         this.size = 0;
     }
@@ -2256,7 +2302,7 @@ de.EMPTY = new (/** @class */ function() {
     }, 
     // Returns a copy of the tree, with the specified key/value added.
     t.prototype.insert = function(t, e, n) {
-        return new de(t, e);
+        return new ye(t, e);
     }, 
     // Returns a copy of the tree, with the specified key removed.
     t.prototype.remove = function(t, e) {
@@ -2305,9 +2351,9 @@ de.EMPTY = new (/** @class */ function() {
  * NOTE: if provided comparator returns 0 for two elements, we consider them to
  * be equal!
  */
-var ye = /** @class */ function() {
+var me = /** @class */ function() {
     function t(t) {
-        this.comparator = t, this.data = new he(this.comparator);
+        this.comparator = t, this.data = new pe(this.comparator);
     }
     return t.prototype.has = function(t) {
         return null !== this.data.get(t);
@@ -2347,9 +2393,9 @@ var ye = /** @class */ function() {
         var e = this.data.getIteratorFrom(t);
         return e.hasNext() ? e.getNext().key : null;
     }, t.prototype.getIterator = function() {
-        return new me(this.data.getIterator());
+        return new ve(this.data.getIterator());
     }, t.prototype.getIteratorFrom = function(t) {
-        return new me(this.data.getIteratorFrom(t));
+        return new ve(this.data.getIteratorFrom(t));
     }, 
     /** Inserts or updates an element */ t.prototype.add = function(t) {
         return this.copy(this.data.remove(t).insert(t, !0));
@@ -2386,7 +2432,7 @@ var ye = /** @class */ function() {
         var n = new t(this.comparator);
         return n.data = e, n;
     }, t;
-}(), me = /** @class */ function() {
+}(), ve = /** @class */ function() {
     function t(t) {
         this.iter = t;
     }
@@ -2395,7 +2441,7 @@ var ye = /** @class */ function() {
     }, t.prototype.hasNext = function() {
         return this.iter.hasNext();
     }, t;
-}(), ve = /** @class */ function() {
+}(), ge = /** @class */ function() {
     function t(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
@@ -2410,7 +2456,7 @@ var ye = /** @class */ function() {
      * fields paths to this field mask.
      */
     t.prototype.unionWith = function(e) {
-        for (var n = new ye(rt.comparator), r = 0, i = this.fields; r < i.length; r++) {
+        for (var n = new me(rt.comparator), r = 0, i = this.fields; r < i.length; r++) {
             var o = i[r];
             n = n.add(o);
         }
@@ -2432,11 +2478,11 @@ var ye = /** @class */ function() {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return St(this.fields, t.fields, (function(t, e) {
+        return kt(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), ge = /** @class */ function() {
+}(), we = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -2453,7 +2499,7 @@ var ye = /** @class */ function() {
      */
     t.prototype.field = function(t) {
         if (t.isEmpty()) return this.value;
-        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Yt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
+        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Wt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
         return (e = (e.mapValue.fields || {})[t.lastSegment()]) || null;
     }, 
     /**
@@ -2463,7 +2509,7 @@ var ye = /** @class */ function() {
      * @param value - The value to set.
      */
     t.prototype.set = function(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Wt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Ht(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -2478,7 +2524,7 @@ var ye = /** @class */ function() {
                 var a = e.getFieldsMap(n);
                 e.applyChanges(a, r, i), r = {}, i = [], n = o.popLast();
             }
-            t ? r[o.lastSegment()] = Wt(t) : i.push(o.lastSegment());
+            t ? r[o.lastSegment()] = Ht(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -2491,9 +2537,9 @@ var ye = /** @class */ function() {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        Yt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Wt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return Lt(this.value, t.value);
+        return jt(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2506,7 +2552,7 @@ var ye = /** @class */ function() {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            Yt(r) && r.mapValue.fields || (r = {
+            Wt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -2519,7 +2565,7 @@ var ye = /** @class */ function() {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        At(e, (function(e, n) {
+        It(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -2527,9 +2573,9 @@ var ye = /** @class */ function() {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(Wt(this.value));
+        return new t(Ht(this.value));
     }, t;
-}(), we = /** @class */ function() {
+}(), _e = /** @class */ function() {
     function t(t, e, n, r, i, o, a) {
         this.key = t, this.documentType = e, this.version = n, this.readTime = r, this.createTime = i, 
         this.data = o, this.documentState = a
@@ -2540,9 +2586,9 @@ var ye = /** @class */ function() {
     }
     return t.newInvalidDocument = function(e) {
         return new t(e, 0 /* DocumentType.INVALID */ , 
-        /* version */ fe.min(), 
-        /* readTime */ fe.min(), 
-        /* createTime */ fe.min(), ge.empty(), 0 /* DocumentState.SYNCED */);
+        /* version */ he.min(), 
+        /* readTime */ he.min(), 
+        /* createTime */ he.min(), we.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -2551,14 +2597,14 @@ var ye = /** @class */ function() {
     t.newFoundDocument = function(e, n, r, i) {
         return new t(e, 1 /* DocumentType.FOUND_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ fe.min(), 
+        /* readTime */ he.min(), 
         /* createTime */ r, i, 0 /* DocumentState.SYNCED */);
     }, 
     /** Creates a new document that is known to not exist at the given version. */ t.newNoDocument = function(e, n) {
         return new t(e, 2 /* DocumentType.NO_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ fe.min(), 
-        /* createTime */ fe.min(), ge.empty(), 0 /* DocumentState.SYNCED */);
+        /* readTime */ he.min(), 
+        /* createTime */ he.min(), we.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -2568,8 +2614,8 @@ var ye = /** @class */ function() {
     t.newUnknownDocument = function(e, n) {
         return new t(e, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ fe.min(), 
-        /* createTime */ fe.min(), ge.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
+        /* readTime */ he.min(), 
+        /* createTime */ he.min(), we.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2581,7 +2627,7 @@ var ye = /** @class */ function() {
         // update from Watch or due to applying a local set mutation on top
         // of a deleted document, our best guess about its createTime would be the
         // version at which the document transitioned to a FOUND_DOCUMENT.
-        return !this.createTime.isEqual(fe.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
+        return !this.createTime.isEqual(he.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
         this.version = t, this.documentType = 1 /* DocumentType.FOUND_DOCUMENT */ , this.data = e, 
         this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }, 
@@ -2591,7 +2637,7 @@ var ye = /** @class */ function() {
      */
     t.prototype.convertToNoDocument = function(t) {
         return this.version = t, this.documentType = 2 /* DocumentType.NO_DOCUMENT */ , 
-        this.data = ge.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
+        this.data = we.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }, 
     /**
      * Changes the document type to indicate that it exists at a given version but
@@ -2600,12 +2646,12 @@ var ye = /** @class */ function() {
      */
     t.prototype.convertToUnknownDocument = function(t) {
         return this.version = t, this.documentType = 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
-        this.data = ge.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
+        this.data = we.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
         this;
     }, t.prototype.setHasCommittedMutations = function() {
         return this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , this;
     }, t.prototype.setHasLocalMutations = function() {
-        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = fe.min(), 
+        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = he.min(), 
         this;
     }, t.prototype.setReadTime = function(t) {
         return this.readTime = t, this;
@@ -2642,7 +2688,7 @@ var ye = /** @class */ function() {
     }, t.prototype.toString = function() {
         return "Document(".concat(this.key, ", ").concat(this.version, ", ").concat(JSON.stringify(this.data.value), ", {createTime: ").concat(this.createTime, "}), {documentType: ").concat(this.documentType, "}), {documentState: ").concat(this.documentState, "})");
     }, t;
-}(), _e = function(t, e, n, r, i, o, a) {
+}(), be = function(t, e, n, r, i, o, a) {
     void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
     this.path = t, this.collectionGroup = e, this.orderBy = n, this.filters = r, this.limit = i, 
@@ -2657,10 +2703,10 @@ var ye = /** @class */ function() {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function be(t, e, n, r, i, o, a) {
+function Te(t, e, n, r, i, o, a) {
     return void 0 === e && (e = null), void 0 === n && (n = []), void 0 === r && (r = []), 
     void 0 === i && (i = null), void 0 === o && (o = null), void 0 === a && (a = null), 
-    new _e(t, e, n, r, i, o, a);
+    new be(t, e, n, r, i, o, a);
 }
 
 /**
@@ -2685,7 +2731,7 @@ function be(t, e, n, r, i, o, a) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var Te = 
+ */ var Ee = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2700,11 +2746,11 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
     this.C = null, this.startAt, this.endAt;
 };
 
-/** Creates a new Query for a query that matches all documents at `path` */ function Ee(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function Se(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function Se(t) {
+function ke(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e].getFirstInequalityField();
         if (null !== r) return r;
@@ -2719,7 +2765,7 @@ function Se(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function ke(t) {
+ */ function Ae(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2727,16 +2773,16 @@ function Se(t) {
  * 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 Ae(t) {
+ */ function Ie(t) {
     var e = I(t);
     if (null === e.k) {
         e.k = [];
-        var n = Se(e), r = Ee(e);
+        var n = ke(e), r = Se(e);
         if (null !== n && null === r) 
         // 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.
-        n.isKeyField() || e.k.push(new ce(n)), e.k.push(new ce(rt.keyField(), "asc" /* Direction.ASCENDING */)); else {
+        n.isKeyField() || e.k.push(new le(n)), e.k.push(new le(rt.keyField(), "asc" /* Direction.ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var u = a[o];
                 e.k.push(u), u.field.isKeyField() && (i = !0);
@@ -2745,7 +2791,7 @@ function Se(t) {
                 // The order of the implicit key ordering always matches the last
                 // explicit order by
                 var s = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* Direction.ASCENDING */;
-                e.k.push(new ce(rt.keyField(), s));
+                e.k.push(new le(rt.keyField(), s));
             }
         }
     }
@@ -2754,27 +2800,27 @@ function Se(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function Ie(t) {
+ */ function Fe(t) {
     var e = I(t);
-    if (!e.C) if ("F" /* LimitType.First */ === e.limitType) e.C = be(e.path, e.collectionGroup, Ae(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.C) if ("F" /* LimitType.First */ === e.limitType) e.C = Te(e.path, e.collectionGroup, Ie(e), e.filters, e.limit, e.startAt, e.endAt); else {
         for (
         // Flip the orderBy directions since we want the last results
-        var n = [], r = 0, i = Ae(e); r < i.length; r++) {
+        var n = [], r = 0, i = Ie(e); r < i.length; r++) {
             var o = i[r], a = "desc" /* Direction.DESCENDING */ === o.dir ? "asc" /* Direction.ASCENDING */ : "desc" /* Direction.DESCENDING */;
-            n.push(new ce(o.field, a));
+            n.push(new le(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var u = e.endAt ? new Ht(e.endAt.position, e.endAt.inclusive) : null, s = e.startAt ? new Ht(e.startAt.position, e.startAt.inclusive) : null;
+                var u = e.endAt ? new Xt(e.endAt.position, e.endAt.inclusive) : null, s = e.startAt ? new Xt(e.startAt.position, e.startAt.inclusive) : null;
         // Now return as a LimitType.First query.
-                e.C = be(e.path, e.collectionGroup, n, e.filters, e.limit, u, s);
+                e.C = Te(e.path, e.collectionGroup, n, e.filters, e.limit, u, s);
     }
     return e.C;
 }
 
-function Fe(t, e) {
-    e.getFirstInequalityField(), Se(t);
+function Pe(t, e) {
+    e.getFirstInequalityField(), ke(t);
     var n = t.filters.concat([ e ]);
-    return new Te(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+    return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
 
 /**
@@ -2802,9 +2848,9 @@ function Fe(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function Pe(t, e) {
+function Ve(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !ht(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !pt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
      * Returns an IntegerValue for `value`.
@@ -2826,7 +2872,7 @@ function Pe(t, e) {
             };
         }
         return {
-            doubleValue: ht(e) ? "-0" : e
+            doubleValue: pt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2847,36 +2893,36 @@ function Pe(t, e) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-/** Used to represent a field transform on a mutation. */ var Ve = function() {
+/** Used to represent a field transform on a mutation. */ var De = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
-}, De = /** @class */ function(e) {
+}, Ne = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(Ve), Ne = /** @class */ function(e) {
+}(De), Oe = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Ve), Oe = /** @class */ function(e) {
+}(De), qe = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Ve), qe = /** @class */ function(e) {
+}(De), Re = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).M = t, r.U = n, r;
     }
     return t(n, e), n;
-}(Ve), Re = function(t, e) {
+}(De), Ce = function(t, e) {
     this.field = t, this.transform = e;
-}, Ce = /** @class */ function() {
+}, xe = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2898,7 +2944,7 @@ function Pe(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), xe = function() {}, Me = /** @class */ function(e) {
+}(), Me = function() {}, Le = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2908,7 +2954,7 @@ function Pe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(xe), Le = /** @class */ function(e) {
+}(Me), je = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2918,7 +2964,7 @@ function Pe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return this.fieldMask;
     }, n;
-}(xe), je = /** @class */ function(e) {
+}(Me), Ue = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 2 /* MutationType.Delete */ , 
@@ -2927,7 +2973,7 @@ function Pe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(xe), Ue = /** @class */ function(e) {
+}(Me), Be = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).key = t, r.precondition = n, r.type = 3 /* MutationType.Verify */ , 
@@ -2936,10 +2982,10 @@ function Pe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(xe), Be = {
+}(Me), ze = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, ze = {
+}, Ke = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2950,10 +2996,10 @@ function Pe(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, Ke = {
+}, Qe = {
     and: "AND",
     or: "OR"
-}, Qe = function(t, e) {
+}, Ge = function(t, e) {
     this.databaseId = t, this.L = e;
 };
 
@@ -2969,7 +3015,7 @@ function Pe(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Ge(t, e) {
+function Ye(t, e) {
     return t.L ? "".concat(new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", ""), ".").concat(("000000000" + e.nanoseconds).slice(-9), "Z") : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
@@ -2980,69 +3026,69 @@ function Ge(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Ye(t, e) {
+ */ function We(t, e) {
     return t.L ? e.toBase64() : e.toUint8Array();
 }
 
-function We(t, e) {
-    return Ge(t, e.toTimestamp());
+function He(t, e) {
+    return Ye(t, e.toTimestamp());
 }
 
-function He(t) {
-    return A(!!t), fe.fromTimestamp(function(t) {
-        var e = Vt(t);
-        return new Ot(e.seconds, e.nanos);
+function Xe(t) {
+    return A(!!t), he.fromTimestamp(function(t) {
+        var e = Dt(t);
+        return new qt(e.seconds, e.nanos);
     }(t));
 }
 
-function Xe(t, e) {
+function Je(t, e) {
     return function(t) {
         return new et([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents").child(e).canonicalString();
 }
 
-function Je(t, e) {
-    return Xe(t.databaseId, e.path);
+function Ze(t, e) {
+    return Je(t.databaseId, e.path);
 }
 
-function Ze(t, e) {
+function $e(t, e) {
     var n, r = function(t) {
         var e = et.fromString(t);
-        return A(ln(e)), e;
+        return A(fn(e)), e;
     }(e);
     if (r.get(1) !== t.databaseId.projectId) throw new B(V, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
     if (r.get(3) !== t.databaseId.database) throw new B(V, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
     return new it((A((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function $e(t, e) {
-    return Xe(t.databaseId, e);
+function tn(t, e) {
+    return Je(t.databaseId, e);
 }
 
-function tn(t) {
+function en(t) {
     return new et([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function en(t, e, n) {
+function nn(t, e, n) {
     return {
-        name: Je(t, e),
+        name: Ze(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function nn(t, e) {
+function rn(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     var n = {
         structuredQuery: {}
     }, r = e.path;
-    null !== e.collectionGroup ? (n.parent = $e(t, r), n.structuredQuery.from = [ {
+    null !== e.collectionGroup ? (n.parent = tn(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = $e(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = tn(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     var i = function(t) {
-        if (0 !== t.length) return sn($t.create(t, "and" /* CompositeOperator.AND */));
+        if (0 !== t.length) return cn(te.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     i && (n.structuredQuery.where = i);
     var o = function(t) {
@@ -3050,15 +3096,15 @@ function nn(t, e) {
             // visible for testing
             return function(t) {
                 return {
-                    field: un(t.field),
-                    direction: rn(t.dir)
+                    field: sn(t.field),
+                    direction: on(t.dir)
                 };
             }(t);
         }));
     }(e.orderBy);
     o && (n.structuredQuery.orderBy = o);
     var a, u = function(t, e) {
-        return t.L || ft(e) ? e : {
+        return t.L || ht(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -3073,75 +3119,75 @@ function nn(t, e) {
     }(e.endAt)), n;
 }
 
-function rn(t) {
-    return Be[t];
-}
-
-// visible for testing
 function on(t) {
     return ze[t];
 }
 
+// visible for testing
 function an(t) {
     return Ke[t];
 }
 
 function un(t) {
+    return Qe[t];
+}
+
+function sn(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function sn(t) {
-    return t instanceof Zt ? function(t) {
+function cn(t) {
+    return t instanceof $t ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
-            if (Gt(t.value)) return {
+            if (Yt(t.value)) return {
                 unaryFilter: {
-                    field: un(t.field),
+                    field: sn(t.field),
                     op: "IS_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (Gt(t.value)) return {
                 unaryFilter: {
-                    field: un(t.field),
+                    field: sn(t.field),
                     op: "IS_NULL"
                 }
             };
         } else if ("!=" /* Operator.NOT_EQUAL */ === t.op) {
-            if (Gt(t.value)) return {
+            if (Yt(t.value)) return {
                 unaryFilter: {
-                    field: un(t.field),
+                    field: sn(t.field),
                     op: "IS_NOT_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (Gt(t.value)) return {
                 unaryFilter: {
-                    field: un(t.field),
+                    field: sn(t.field),
                     op: "IS_NOT_NULL"
                 }
             };
         }
         return {
             fieldFilter: {
-                field: un(t.field),
-                op: on(t.op),
+                field: sn(t.field),
+                op: an(t.op),
                 value: t.value
             }
         };
-    }(t) : t instanceof $t ? function(t) {
+    }(t) : t instanceof te ? function(t) {
         var e = t.getFilters().map((function(t) {
-            return sn(t);
+            return cn(t);
         }));
         return 1 === e.length ? e[0] : {
             compositeFilter: {
-                op: an(t.op),
+                op: un(t.op),
                 filters: e
             }
         };
     }(t) : k();
 }
 
-function cn(t) {
+function ln(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -3150,7 +3196,7 @@ function cn(t) {
     };
 }
 
-function ln(t) {
+function fn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3170,8 +3216,8 @@ function ln(t) {
  * 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 fn(t) {
-    return new Qe(t, /* useProto3Json= */ !0);
+ */ function hn(t) {
+    return new Ge(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3198,7 +3244,7 @@ function ln(t) {
  * 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.
- */ var hn = /** @class */ function() {
+ */ var pn = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3272,7 +3318,7 @@ function ln(t) {
     /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.X = function() {
         return (Math.random() - .5) * this.K;
     }, t;
-}(), pn = /** @class */ function(e) {
+}(), dn = /** @class */ function(e) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
@@ -3332,49 +3378,49 @@ function ln(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function dn(t, r) {
+function yn(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = I(t), i = tn(e.M) + "/documents", o = {
+                return e = I(t), i = en(e.M) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof Me) n = {
-                                update: en(t, e.key, e.value)
+                            if (e instanceof Le) n = {
+                                update: nn(t, e.key, e.value)
+                            }; else if (e instanceof Ue) n = {
+                                delete: Ze(t, e.key)
                             }; else if (e instanceof je) n = {
-                                delete: Je(t, e.key)
-                            }; else if (e instanceof Le) n = {
-                                update: en(t, e.key, e.data),
-                                updateMask: cn(e.fieldMask)
+                                update: nn(t, e.key, e.data),
+                                updateMask: ln(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ue)) return k();
+                                if (!(e instanceof Be)) return k();
                                 n = {
-                                    verify: Je(t, e.key)
+                                    verify: Ze(t, e.key)
                                 };
                             }
                             return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((function(t) {
                                 return function(t, e) {
                                     var n = e.transform;
-                                    if (n instanceof De) return {
+                                    if (n instanceof Ne) return {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof Ne) return {
+                                    if (n instanceof Oe) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof Oe) return {
+                                    if (n instanceof qe) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof qe) return {
+                                    if (n instanceof Re) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.U
                                     };
@@ -3382,7 +3428,7 @@ function dn(t, r) {
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: We(t, e.updateTime)
+                                    updateTime: He(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
                                 } : k();
@@ -3398,15 +3444,15 @@ function dn(t, r) {
     }));
 }
 
-function yn(t, r) {
+function mn(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o, a, u, s;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = I(t), i = tn(e.M) + "/documents", o = {
+                return e = I(t), i = en(e.M) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Je(e.M, t);
+                        return Ze(e.M, t);
                     }))
                 }, [ 4 /*yield*/ , e.P("BatchGetDocuments", i, o, r.length) ];
 
@@ -3415,16 +3461,16 @@ function yn(t, r) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
                             A(!!e.found), e.found.name, e.found.updateTime;
-                            var n = Ze(t, e.found.name), r = He(e.found.updateTime), i = e.found.createTime ? He(e.found.createTime) : fe.min(), o = new ge({
+                            var n = $e(t, e.found.name), r = Xe(e.found.updateTime), i = e.found.createTime ? Xe(e.found.createTime) : he.min(), o = new we({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return we.newFoundDocument(n, r, i, o);
+                            return _e.newFoundDocument(n, r, i, o);
                         }(t, e) : "missing" in e ? function(t, e) {
                             A(!!e.missing), A(!!e.readTime);
-                            var n = Ze(t, e.missing), r = He(e.readTime);
-                            return we.newNoDocument(n, r);
+                            var n = $e(t, e.missing), r = Xe(e.readTime);
+                            return _e.newNoDocument(n, r);
                         }(t, e) : k();
                     }(e.M, t);
                     u.set(n.key.toString(), n);
@@ -3453,7 +3499,7 @@ function yn(t, r) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var mn = new Map;
+var vn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3463,17 +3509,17 @@ var mn = new Map;
  * Returns an initialized and started Datastore for the given Firestore
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
- */ function vn(t) {
+ */ function gn(t) {
     if (t._terminated) throw new B(C, "The client has already been terminated.");
-    if (!mn.has(t)) {
+    if (!vn.has(t)) {
         b("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new vt(t, fetch.bind(null));
+            return new gt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, u = t._freezeSettings(), 
-        new Z(i, o, a, u.host, u.ssl, u.experimentalForceLongPolling, u.experimentalAutoDetectLongPolling, u.useFetchStreams))), n = fn(t._databaseId), r = function(t, e, n, r) {
-            return new pn(t, e, n, r);
+        new Z(i, o, a, u.host, u.ssl, u.experimentalForceLongPolling, u.experimentalAutoDetectLongPolling, u.useFetchStreams))), n = hn(t._databaseId), r = function(t, e, n, r) {
+            return new dn(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
-        mn.set(t, r);
+        vn.set(t, r);
     }
     var i, o, a, u;
     /**
@@ -3491,7 +3537,7 @@ var mn = new Map;
  * 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 mn.get(t);
+ */    return vn.get(t);
 }
 
 /**
@@ -3502,7 +3548,7 @@ var mn = new Map;
  * 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.
- */ var gn = /** @class */ function() {
+ */ var wn = /** @class */ function() {
     function t(t) {
         var e;
         if (void 0 === t.host) {
@@ -3522,7 +3568,7 @@ var mn = new Map;
     return t.prototype.isEqual = function(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;
     }, t;
-}(), wn = /** @class */ function() {
+}(), _n = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e, n, r) {
         this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, 
@@ -3530,7 +3576,7 @@ var mn = new Map;
         /**
              * Whether it's a Firestore or Firestore Lite instance.
              */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new gn({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new wn({}), 
         this._settingsFrozen = !1;
     }
     return Object.defineProperty(t.prototype, "app", {
@@ -3558,7 +3604,7 @@ var mn = new Map;
         configurable: !0
     }), t.prototype._setSettings = function(t) {
         if (this._settingsFrozen) throw new B(C, "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 gn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        this._settings = new wn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
             if (!t) return new Q;
             switch (t.type) {
               case "gapi":
@@ -3594,8 +3640,8 @@ var mn = new Map;
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = mn.get(t)) && (b("ComponentProvider", "Removing Datastore"), 
-        mn.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = vn.get(t)) && (b("ComponentProvider", "Removing Datastore"), 
+        vn.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
@@ -3620,7 +3666,7 @@ var mn = new Map;
  * The Cloud Firestore service interface.
  *
  * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.
- */ function _n(t, e, n) {
+ */ function bn(t, e, n) {
     n || (n = "(default)");
     var r = _getProvider(t, "firestore/lite");
     if (r.isInitialized(n)) throw new B(C, "Firestore can only be initialized once per app.");
@@ -3630,13 +3676,13 @@ var mn = new Map;
     });
 }
 
-function bn(t, e) {
+function Tn(t, e) {
     var n = "object" == typeof t ? t : u(), i = "string" == typeof t ? t : e || "(default)", o = _getProvider(n, "firestore/lite").getImmediate({
         identifier: i
     });
     if (!o._initialized) {
         var a = d("firestore");
-        a && Tn.apply(void 0, r([ o ], a, !1));
+        a && En.apply(void 0, r([ o ], a, !1));
     }
     return o;
 }
@@ -3653,10 +3699,10 @@ function bn(t, e) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function Tn(t, e, n, r) {
+ */ function En(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = ct(t, wn))._getSettings();
+    var o = (t = ct(t, _n))._getSettings();
     if ("firestore.googleapis.com" !== o.host && o.host !== e && E("Host has been set in both settings() and useEmulator(), emulator host will be used"), 
     t._setSettings(Object.assign(Object.assign({}, o), {
         host: "".concat(e, ":").concat(n),
@@ -3694,8 +3740,8 @@ function bn(t, e) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function En(t) {
-    return t = ct(t, wn), s(t.app, "firestore/lite"), t._delete();
+ */ function Sn(t) {
+    return t = ct(t, _n), s(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3734,7 +3780,7 @@ function bn(t, e) {
  * Represents an aggregation that can be performed by Firestore.
  */
 // eslint-disable-next-line @typescript-eslint/no-unused-vars
-var Sn = 
+var kn = 
 /**
      * Create a new AggregateField<T>
      * @param _aggregateType Specifies the type of aggregation operation to perform.
@@ -3747,7 +3793,7 @@ t, e) {
     void 0 === t && (t = "count"), this._aggregateType = t, this._internalFieldPath = e, 
     /** A type string to uniquely identify instances of this class. */
     this.type = "AggregateField";
-}, kn = /** @class */ function() {
+}, An = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e, n) {
         this._userDataWriter = e, this._data = n, 
@@ -3768,7 +3814,7 @@ t, e) {
     return t.prototype.data = function() {
         return this._userDataWriter.convertValue(this._data.value);
     }, t;
-}(), An = /** @class */ function() {
+}(), In = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3809,14 +3855,14 @@ t, e) {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new Fn(this.firestore, this.converter, this._key.path.popLast());
+            return new Pn(this.firestore, this.converter, this._key.path.popLast());
         },
         enumerable: !1,
         configurable: !0
     }), t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._key);
     }, t;
-}(), In = /** @class */ function() {
+}(), Fn = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3831,11 +3877,11 @@ t, e) {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), Fn = /** @class */ function(e) {
+}(), Pn = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new Te(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new Ee(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3862,7 +3908,7 @@ t, e) {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new An(this.firestore, 
+            return t.isEmpty() ? null : new In(this.firestore, 
             /* converter= */ null, new it(t));
         },
         enumerable: !1,
@@ -3870,19 +3916,19 @@ t, e) {
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(In);
+}(Fn);
 
 /**
  * The results of executing an aggregation query.
- */ function Pn(t, e) {
+ */ function Vn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = p(t), ot("collection", "path", e), t instanceof wn) {
+    if (t = p(t), ot("collection", "path", e), t instanceof _n) {
         var o = et.fromString.apply(et, r([ e ], n, !1));
-        return ut(o), new Fn(t, /* converter= */ null, o);
+        return ut(o), new Pn(t, /* converter= */ null, o);
     }
-    if (!(t instanceof An || t instanceof Fn)) throw new B(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof In || t instanceof Pn)) throw new B(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(et.fromString.apply(et, r([ e ], n, !1)));
-    return ut(a), new Fn(t.firestore, 
+    return ut(a), new Pn(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3898,27 +3944,27 @@ t, e) {
  * 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 Vn(t, e) {
-    if (t = ct(t, wn), ot("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new B(V, "Invalid collection ID '".concat(e, "' passed to function collectionGroup(). Collection IDs must not contain '/'."));
-    return new In(t, 
+ */ function Dn(t, e) {
+    if (t = ct(t, _n), ot("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new B(V, "Invalid collection ID '".concat(e, "' passed to function collectionGroup(). Collection IDs must not contain '/'."));
+    return new Fn(t, 
     /* converter= */ null, function(t) {
-        return new Te(et.emptyPath(), t);
+        return new Ee(et.emptyPath(), t);
     }(e));
 }
 
-function Dn(t, e) {
+function Nn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = Tt.F()), ot("doc", "path", e), t instanceof wn) {
+    1 === arguments.length && (e = Et.F()), ot("doc", "path", e), t instanceof _n) {
         var o = et.fromString.apply(et, r([ e ], n, !1));
-        return at(o), new An(t, 
+        return at(o), new In(t, 
         /* converter= */ null, new it(o));
     }
-    if (!(t instanceof An || t instanceof Fn)) throw new B(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
+    if (!(t instanceof In || t instanceof Pn)) throw new B(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
     var a = t._path.child(et.fromString.apply(et, r([ e ], n, !1)));
-    return at(a), new An(t.firestore, t instanceof Fn ? t.converter : null, new it(a));
+    return at(a), new In(t.firestore, t instanceof Pn ? t.converter : null, new it(a));
 }
 
 /**
@@ -3928,8 +3974,8 @@ function Dn(t, e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function Nn(t, e) {
-    return t = p(t), e = p(e), (t instanceof An || t instanceof Fn) && (e instanceof An || e instanceof Fn) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+ */ function On(t, e) {
+    return t = p(t), e = p(e), (t instanceof In || t instanceof Pn) && (e instanceof In || e instanceof Pn) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
     /**
  * Returns true if the provided queries point to the same collection and apply
  * the same constraints.
@@ -3941,16 +3987,16 @@ function Dn(t, e) {
  */;
 }
 
-function On(t, e) {
-    return t = p(t), e = p(e), t instanceof In && e instanceof In && t.firestore === e.firestore && function(t, e) {
+function qn(t, e) {
+    return t = p(t), e = p(e), t instanceof Fn && e instanceof Fn && t.firestore === e.firestore && function(t, e) {
         return function(t, e) {
             if (t.limit !== e.limit) return !1;
             if (t.orderBy.length !== e.orderBy.length) return !1;
-            for (var n = 0; n < t.orderBy.length; n++) if (!le(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!fe(t.orderBy[n], e.orderBy[n])) return !1;
             if (t.filters.length !== e.filters.length) return !1;
-            for (var r = 0; r < t.filters.length; r++) if (!te(t.filters[r], e.filters[r])) return !1;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Xt(t.startAt, e.startAt) && Xt(t.endAt, e.endAt);
-        }(Ie(t), Ie(e)) && t.limitType === e.limitType;
+            for (var r = 0; r < t.filters.length; r++) if (!ee(t.filters[r], e.filters[r])) return !1;
+            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Jt(t.startAt, e.startAt) && Jt(t.endAt, e.endAt);
+        }(Fe(t), Fe(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -3973,7 +4019,7 @@ function On(t, e) {
  */;
 }
 
-var qn = /** @class */ function() {
+var Rn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -3985,7 +4031,7 @@ var qn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(Ft.fromBase64String(e));
+            return new t(Pt.fromBase64String(e));
         } catch (e) {
             throw new B(V, "Failed to construct data from Base64 string: " + e);
         }
@@ -3996,7 +4042,7 @@ var qn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(Ft.fromUint8Array(e));
+        return new t(Pt.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4031,7 +4077,7 @@ var qn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), Rn = /** @class */ function() {
+}(), Cn = /** @class */ function() {
     /**
      * 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.
@@ -4081,8 +4127,8 @@ var qn = /** @class */ function() {
  * 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 Cn() {
-    return new Rn("__name__");
+function xn() {
+    return new Cn("__name__");
 }
 
 /**
@@ -4104,14 +4150,14 @@ function Cn() {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ var xn = 
+ */ var Mn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, Mn = /** @class */ function() {
+}, Ln = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -4162,23 +4208,23 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return Et(this._lat, t._lat) || Et(this._long, t._long);
+        return St(this._lat, t._lat) || St(this._long, t._long);
     }, t;
-}(), Ln = /^__.*__$/, jn = /** @class */ function() {
+}(), jn = /^__.*__$/, Un = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return null !== this.fieldMask ? new Le(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Me(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new je(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Le(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), Un = /** @class */ function() {
+}(), Bn = /** @class */ function() {
     function t(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return new Le(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new je(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -4204,7 +4250,7 @@ function(t) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ function Bn(t) {
+ */ function zn(t) {
     switch (t) {
       case 0 /* UserDataSource.Set */ :
  // fall through
@@ -4222,7 +4268,7 @@ function(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var zn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var Kn = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4282,7 +4328,7 @@ function(t) {
             ut: !0
         });
     }, t.prototype.lt = function(t) {
-        return cr(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
+        return lr(t, this.settings.methodName, this.settings.ft || !1, this.path, this.settings.dt);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -4296,15 +4342,15 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.ct(this.path.get(t));
     }, t.prototype.ct = function(t) {
         if (0 === t.length) throw this.lt("Document fields must not be empty");
-        if (Bn(this.st) && Ln.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
+        if (zn(this.st) && jn.test(t)) throw this.lt('Document fields cannot begin and end with "__"');
     }, t;
-}(), Kn = /** @class */ function() {
+}(), Qn = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.M = n || fn(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.M = n || hn(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.wt = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new zn({
+        return void 0 === r && (r = !1), new Kn({
             st: t,
             methodName: e,
             dt: n,
@@ -4318,30 +4364,30 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function Qn(t) {
-    var e = t._freezeSettings(), n = fn(t._databaseId);
-    return new Kn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function Gn(t) {
+    var e = t._freezeSettings(), n = hn(t._databaseId);
+    return new Qn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function Gn(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function Yn(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     var a = t.wt(o.merge || o.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, i);
-    or("Data must be an object, but it was:", a, r);
-    var u, s, c = rr(r, a);
-    if (o.merge) u = new ve(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
+    ar("Data must be an object, but it was:", a, r);
+    var u, s, c = ir(r, a);
+    if (o.merge) u = new ge(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
-            var p = ar(e, h[f], n);
+            var p = ur(e, h[f], n);
             if (!a.contains(p)) throw new B(V, "Field '".concat(p, "' is specified in your field mask but missing from your input data."));
-            lr(l, p) || l.push(p);
+            fr(l, p) || l.push(p);
         }
-        u = new ve(l), s = a.fieldTransforms.filter((function(t) {
+        u = new ge(l), s = a.fieldTransforms.filter((function(t) {
             return u.covers(t.field);
         }));
     } else u = null, s = a.fieldTransforms;
-    return new jn(new ge(c), u, s);
+    return new Un(new we(c), u, s);
 }
 
-var Yn = /** @class */ function(e) {
+var Wn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4353,7 +4399,7 @@ var Yn = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(xn);
+}(Mn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -4370,8 +4416,8 @@ var Yn = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Wn(t, e, n) {
-    return new zn({
+ */ function Hn(t, e, n) {
+    return new Kn({
         st: 3 /* UserDataSource.Argument */ ,
         dt: e.settings.dt,
         methodName: t._methodName,
@@ -4379,101 +4425,101 @@ var Yn = /** @class */ function(e) {
     }, e.databaseId, e.M, e.ignoreUndefinedProperties);
 }
 
-var Hn = /** @class */ function(e) {
+var Xn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new Re(t.path, new De);
+        return new Ce(t.path, new Ne);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(xn), Xn = /** @class */ function(e) {
+}(Mn), Jn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).yt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Wn(this, t, 
+        var e = Hn(this, t, 
         /*array=*/ !0), n = this.yt.map((function(t) {
-            return nr(t, e);
-        })), r = new Ne(n);
-        return new Re(t.path, r);
+            return rr(t, e);
+        })), r = new Oe(n);
+        return new Ce(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(xn), Jn = /** @class */ function(e) {
+}(Mn), Zn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).yt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Wn(this, t, 
+        var e = Hn(this, t, 
         /*array=*/ !0), n = this.yt.map((function(t) {
-            return nr(t, e);
-        })), r = new Oe(n);
-        return new Re(t.path, r);
+            return rr(t, e);
+        })), r = new qe(n);
+        return new Ce(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(xn), Zn = /** @class */ function(e) {
+}(Mn), $n = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).gt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new qe(t.M, Pe(t.M, this.gt));
-        return new Re(t.path, e);
+        var e = new Re(t.M, Ve(t.M, this.gt));
+        return new Ce(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(xn);
+}(Mn);
 
-/** Parse update data from an update() call. */ function $n(t, e, n, r) {
+/** Parse update data from an update() call. */ function tr(t, e, n, r) {
     var i = t.wt(1 /* UserDataSource.Update */ , e, n);
-    or("Data must be an object, but it was:", i, r);
-    var o = [], a = ge.empty();
-    At(r, (function(t, r) {
-        var u = sr(e, t, n);
+    ar("Data must be an object, but it was:", i, r);
+    var o = [], a = we.empty();
+    It(r, (function(t, r) {
+        var u = cr(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = p(r);
         var s = i.at(u);
-        if (r instanceof Yn) 
+        if (r instanceof Wn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(u); else {
-            var c = nr(r, s);
+            var c = rr(r, s);
             null != c && (o.push(u), a.set(u, c));
         }
     }));
-    var u = new ve(o);
-    return new Un(a, u, i.fieldTransforms);
+    var u = new ge(o);
+    return new Bn(a, u, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function tr(t, e, n, r, i, o) {
-    var a = t.wt(1 /* UserDataSource.Update */ , e, n), u = [ ar(e, r, n) ], s = [ i ];
+/** Parse update data from a list of field/value arguments. */ function er(t, e, n, r, i, o) {
+    var a = t.wt(1 /* UserDataSource.Update */ , e, n), u = [ ur(e, r, n) ], s = [ i ];
     if (o.length % 2 != 0) throw new B(V, "Function ".concat(e, "() needs to be called with an even number of arguments that alternate between field names and values."));
-    for (var c = 0; c < o.length; c += 2) u.push(ar(e, o[c])), s.push(o[c + 1]);
+    for (var c = 0; c < o.length; c += 2) u.push(ur(e, o[c])), s.push(o[c + 1]);
     // We iterate in reverse order to pick the last value for a field if the
     // user specified the field multiple times.
-    for (var l = [], f = ge.empty(), h = u.length - 1; h >= 0; --h) if (!lr(l, u[h])) {
+    for (var l = [], f = we.empty(), h = u.length - 1; h >= 0; --h) if (!fr(l, u[h])) {
         var d = u[h], y = s[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         y = p(y);
         var m = a.at(d);
-        if (y instanceof Yn) 
+        if (y instanceof Wn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var v = nr(y, m);
+            var v = rr(y, m);
             null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new ve(l);
-    return new Un(f, g, a.fieldTransforms);
+    var g = new ge(l);
+    return new Bn(f, g, a.fieldTransforms);
 }
 
 /**
@@ -4482,8 +4528,8 @@ var Hn = /** @class */ function(e) {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function er(t, e, n, r) {
-    return void 0 === r && (r = !1), nr(n, t.wt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function nr(t, e, n, r) {
+    return void 0 === r && (r = !1), rr(n, t.wt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -4494,12 +4540,12 @@ var Hn = /** @class */ function(e) {
  * 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 nr(t, e) {
-    if (ir(
+ */ function rr(t, e) {
+    if (or(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return or("Unsupported field value:", e, t), rr(t, e);
-    if (t instanceof xn) 
+    t = p(t))) return ar("Unsupported field value:", e, t), ir(t, e);
+    if (t instanceof Mn) 
     // FieldValues usually parse into transforms (except deleteField())
     // 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
@@ -4511,7 +4557,7 @@ var Hn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Bn(e.st)) throw e.lt("".concat(t._methodName, "() can only be used with update() and set()"));
+        if (!zn(e.st)) throw e.lt("".concat(t._methodName, "() can only be used with update() and set()"));
         if (!e.path) throw e.lt("".concat(t._methodName, "() is not currently supported inside arrays"));
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -4534,7 +4580,7 @@ var Hn = /** @class */ function(e) {
         if (e.settings.ut && 4 /* UserDataSource.ArrayArgument */ !== e.st) throw e.lt("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var a = nr(o[i], e.ht(r));
+                var a = rr(o[i], e.ht(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4553,7 +4599,7 @@ var Hn = /** @class */ function(e) {
         if (null === (t = p(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return Pe(e.M, t);
+        if ("number" == typeof t) return Ve(e.M, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4561,41 +4607,41 @@ var Hn = /** @class */ function(e) {
             stringValue: t
         };
         if (t instanceof Date) {
-            var n = Ot.fromDate(t);
+            var n = qt.fromDate(t);
             return {
-                timestampValue: Ge(e.M, n)
+                timestampValue: Ye(e.M, n)
             };
         }
-        if (t instanceof Ot) {
+        if (t instanceof qt) {
             // 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.
-            var r = new Ot(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            var r = new qt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Ge(e.M, r)
+                timestampValue: Ye(e.M, r)
             };
         }
-        if (t instanceof Mn) return {
+        if (t instanceof Ln) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof qn) return {
-            bytesValue: Ye(e.M, t._byteString)
+        if (t instanceof Rn) return {
+            bytesValue: We(e.M, t._byteString)
         };
-        if (t instanceof An) {
+        if (t instanceof In) {
             var i = e.databaseId, o = t.firestore._databaseId;
             if (!o.isEqual(i)) throw e.lt("Document reference is for database ".concat(o.projectId, "/").concat(o.database, " but should be for database ").concat(i.projectId, "/").concat(i.database));
             return {
-                referenceValue: Xe(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Je(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.lt("Unsupported field value: ".concat(st(t)));
     }(t, e);
 }
 
-function rr(t, e) {
+function ir(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -4603,8 +4649,8 @@ function rr(t, e) {
     }(t) ? 
     // If we encounter an empty object, we explicitly add it to the update
     // mask to ensure that the server creates a map entry.
-    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : At(t, (function(t, r) {
-        var i = nr(r, e.ot(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : It(t, (function(t, r) {
+        var i = rr(r, e.ot(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -4613,12 +4659,12 @@ function rr(t, e) {
     };
 }
 
-function ir(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Ot || t instanceof Mn || t instanceof qn || t instanceof An || t instanceof xn);
+function or(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof qt || t instanceof Ln || t instanceof Rn || t instanceof In || t instanceof Mn);
 }
 
-function or(t, e, n) {
-    if (!ir(n) || !function(t) {
+function ar(t, e, n) {
+    if (!or(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = st(n);
@@ -4628,20 +4674,20 @@ function or(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function ar(t, e, n) {
+ */ function ur(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = p(e)) instanceof Rn) return e._internalPath;
-    if ("string" == typeof e) return sr(t, e);
-    throw cr("Field path arguments must be of type string or ", t, 
+    (e = p(e)) instanceof Cn) return e._internalPath;
+    if ("string" == typeof e) return cr(t, e);
+    throw lr("Field path arguments must be of type string or ", t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ var ur = new RegExp("[~\\*/\\[\\]]");
+ */ var sr = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4651,20 +4697,20 @@ function or(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function sr(t, e, n) {
-    if (e.search(ur) >= 0) throw cr("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
+ */ function cr(t, e, n) {
+    if (e.search(sr) >= 0) throw lr("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (Rn.bind.apply(Rn, r([ void 0 ], e.split("."), !1))))._internalPath;
+        return (new (Cn.bind.apply(Cn, r([ void 0 ], e.split("."), !1))))._internalPath;
     } catch (r) {
-        throw cr("Invalid field path (".concat(e, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"), t, 
+        throw lr("Invalid field path (".concat(e, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"), t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function cr(t, e, n, r, i) {
+function lr(t, e, n, r, i) {
     var o = r && !r.isEmpty(), a = void 0 !== i, u = "Function ".concat(e, "() called with invalid data");
     n && (u += " (via `toFirestore()`)"), u += ". ";
     var s = "";
@@ -4673,7 +4719,7 @@ function cr(t, e, n, r, i) {
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function lr(t, e) {
+function fr(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4703,7 +4749,7 @@ function lr(t, e) {
  * 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.
- */ var fr = /** @class */ function() {
+ */ var hr = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4724,7 +4770,7 @@ function lr(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new An(this._firestore, this._converter, this._key);
+            return new In(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4749,7 +4795,7 @@ function lr(t, e) {
             if (this._converter) {
                 // We only want to use the converter and create a new DocumentSnapshot
                 // if a converter has been provided.
-                var t = new hr(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new pr(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4769,11 +4815,11 @@ function lr(t, e) {
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t.prototype.get = function(t) {
         if (this._document) {
-            var e = this._document.data.field(yr("DocumentSnapshot.get", t));
+            var e = this._document.data.field(mr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), hr = /** @class */ function(e) {
+}(), pr = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4785,7 +4831,7 @@ function lr(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(fr), pr = /** @class */ function() {
+}(hr), dr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4839,15 +4885,15 @@ function lr(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function dr(t, e) {
-    return t = p(t), e = p(e), t instanceof fr && e instanceof fr ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof pr && e instanceof pr && On(t.query, e.query) && St(t.docs, e.docs, dr)
+function yr(t, e) {
+    return t = p(t), e = p(e), t instanceof hr && e instanceof hr ? t._firestore === e._firestore && t._key.isEqual(e._key) && (null === t._document ? null === e._document : t._document.isEqual(e._document)) && t._converter === e._converter : t instanceof dr && e instanceof dr && qn(t.query, e.query) && kt(t.docs, e.docs, yr)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function yr(t, e) {
-    return "string" == typeof e ? sr(t, e) : e instanceof Rn ? e._internalPath : e._delegate._internalPath;
+function mr(t, e) {
+    return "string" == typeof e ? cr(t, e) : e instanceof Cn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4869,28 +4915,28 @@ function yr(t, e) {
 /**
  * An `AppliableConstraint` is an abstraction of a constraint that can be applied
  * to a Firestore query.
- */ var mr = function() {}, vr = /** @class */ function(e) {
+ */ var vr = function() {}, gr = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(mr);
+}(vr);
 
 /**
  * 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}, {@link startAfter}, {@link
- * endBefore}, {@link endAt}, {@link limit}, {@link limitToLast} and
- * can then be passed to {@link query} to create a new query instance that
+ * {@link orderBy}, {@link (startAt:1)}, {@link (startAfter:1)}, {@link
+ * (endBefore:1)}, {@link (endAt:1)}, {@link limit}, {@link limitToLast} and
+ * can then be passed to {@link (query:1)} to create a new query instance that
  * also contains this `QueryConstraint`.
- */ function gr(t, e) {
+ */ function wr(t, e) {
     for (var n = [], r = 2; r < arguments.length; r++) n[r - 2] = arguments[r];
     var i = [];
-    e instanceof mr && i.push(e), function(t) {
+    e instanceof vr && i.push(e), function(t) {
         var e = t.filter((function(t) {
-            return t instanceof br;
+            return t instanceof Tr;
         })).length, n = t.filter((function(t) {
-            return t instanceof wr;
+            return t instanceof _r;
         })).length;
         if (e > 1 || e > 0 && n > 0) throw new B(V, "InvalidQuery. When using composite filters, you cannot use more than one filter at the top level. Consider nesting the multiple filters within an `and(...)` statement. For example: change `query(query, where(...), or(...))` to `query(query, and(where(...), or(...)))`.");
     }(i = i.concat(n));
@@ -4905,9 +4951,9 @@ function yr(t, e) {
  * A `QueryFieldFilterConstraint` is used to narrow the set of documents returned by
  * a Firestore query by filtering on one or more document fields.
  * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then
- * be passed to {@link query} to create a new query instance that also contains
+ * be passed to {@link (query:1)} to create a new query instance that also contains
  * this `QueryFieldFilterConstraint`.
- */ var wr = /** @class */ function(e) {
+ */ var _r = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -4921,32 +4967,32 @@ function yr(t, e) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
-        return Mr(t._query, e), new In(t.firestore, t.converter, Fe(t._query, e));
+        return Lr(t._query, e), new Fn(t.firestore, t.converter, Pe(t._query, e));
     }, n.prototype._parse = function(t) {
-        var e = Qn(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = Gn(t.firestore), n = function(t, e, n, r, i, o, a) {
             var u;
             if (i.isKeyField()) {
                 if ("array-contains" /* Operator.ARRAY_CONTAINS */ === o || "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === o) throw new B(V, "Invalid Query. You can't perform '".concat(o, "' queries on documentId()."));
                 if ("in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o) {
-                    xr(a, o);
+                    Mr(a, o);
                     for (var s = [], c = 0, l = a; c < l.length; c++) {
                         var f = l[c];
-                        s.push(Cr(r, t, f));
+                        s.push(xr(r, t, f));
                     }
                     u = {
                         arrayValue: {
                             values: s
                         }
                     };
-                } else u = Cr(r, t, a);
-            } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || xr(a, o), 
-            u = er(n, "where", a, 
+                } else u = xr(r, t, a);
+            } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || Mr(a, o), 
+            u = nr(n, "where", a, 
             /* allowArrays= */ "in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o);
-            return Zt.create(i, o, u);
+            return $t.create(i, o, u);
         }(t._query, 0, e, t.firestore._databaseId, this._field, this._op, this._value);
         return n;
     }, n;
-}(vr);
+}(gr);
 
 /**
  * Creates a {@link QueryFieldFilterConstraint} that enforces that documents
@@ -4958,9 +5004,9 @@ function yr(t, e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link QueryFieldFilterConstraint}.
- */ function _r(t, e, n) {
-    var r = e, i = yr("where", t);
-    return wr._create(i, r, n);
+ */ function br(t, e, n) {
+    var r = e, i = mr("where", t);
+    return _r._create(i, r, n);
 }
 
 /**
@@ -4968,10 +5014,9 @@ function yr(t, e) {
  * returned by a Firestore query by performing the logical OR or AND of multiple
  * {@link QueryFieldFilterConstraint}s or {@link QueryCompositeFilterConstraint}s.
  * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or
- * {@link and} and can then be passed to {@link query} to create a new query
+ * {@link and} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains the `QueryCompositeFilterConstraint`.
- * @internal TODO remove this internal tag with OR Query support in the server
- */ var br = /** @class */ function(e) {
+ */ var Tr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -4989,21 +5034,21 @@ function yr(t, e) {
         })).filter((function(t) {
             return t.getFilters().length > 0;
         }));
-        return 1 === e.length ? e[0] : $t.create(e, this._getOperator());
+        return 1 === e.length ? e[0] : te.create(e, this._getOperator());
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
         return 0 === e.getFilters().length ? t : (function(t, e) {
             for (var n = t, r = 0, i = e.getFlattenedFilters(); r < i.length; r++) {
                 var o = i[r];
-                Mr(n, o), n = Fe(n, o);
+                Lr(n, o), n = Pe(n, o);
             }
-        }(t._query, e), new In(t.firestore, t.converter, Fe(t._query, e)));
+        }(t._query, e), new Fn(t.firestore, t.converter, Pe(t._query, e)));
     }, n.prototype._getQueryConstraints = function() {
         return this._queryConstraints;
     }, n.prototype._getOperator = function() {
         return "and" === this.type ? "and" /* CompositeOperator.AND */ : "or" /* CompositeOperator.OR */;
     }, n;
-}(mr);
+}(vr);
 
 /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of
@@ -5014,13 +5059,12 @@ function yr(t, e) {
  * {@link QueryFilterConstraint}s to perform a disjunction for. These must be
  * created with calls to {@link where}, {@link or}, or {@link and}.
  * @returns The newly created {@link QueryCompositeFilterConstraint}.
- * @internal TODO remove this internal tag with OR Query support in the server
- */ function Tr() {
+ */ function Er() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return jr("or", t);
-    })), br._create("or" /* CompositeOperator.OR */ , t)
+        return Ur("or", t);
+    })), Tr._create("or" /* CompositeOperator.OR */ , t)
     /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a conjunction of
  * the given filter constraints. A conjunction filter includes a document if it
@@ -5030,20 +5074,19 @@ function yr(t, e) {
  * {@link QueryFilterConstraint}s to perform a conjunction for. These must be
  * created with calls to {@link where}, {@link or}, or {@link and}.
  * @returns The newly created {@link QueryCompositeFilterConstraint}.
- * @internal TODO remove this internal tag with OR Query support in the server
  */;
 }
 
-function Er() {
+function Sr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return jr("and", t);
-    })), br._create("and" /* CompositeOperator.AND */ , t)
+        return Ur("and", t);
+    })), Tr._create("and" /* CompositeOperator.AND */ , t)
     /**
  * A `QueryOrderByConstraint` is used to sort the set of documents returned by a
  * Firestore query. `QueryOrderByConstraint`s are created by invoking
- * {@link orderBy} and can then be passed to {@link query} to create a new query
+ * {@link orderBy} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains this `QueryOrderByConstraint`.
  *
  * Note: Documents that do not contain the orderBy field will not be present in
@@ -5051,7 +5094,7 @@ function Er() {
  */;
 }
 
-var Sr = /** @class */ function(e) {
+var kr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5067,22 +5110,22 @@ var Sr = /** @class */ function(e) {
         var e = function(t, e, n) {
             if (null !== t.startAt) throw new B(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
             if (null !== t.endAt) throw new B(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            var r = new ce(e, n);
+            var r = new le(e, n);
             return function(t, e) {
-                if (null === Ee(t)) {
+                if (null === Se(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = Se(t);
-                    null !== n && Lr(t, n, e.field);
+                    var n = ke(t);
+                    null !== n && jr(t, n, e.field);
                 }
             }(t, r), r;
         }(t._query, this._field, this._direction);
-        return new In(t.firestore, t.converter, function(t, e) {
+        return new Fn(t.firestore, t.converter, function(t, e) {
             // TODO(dimond): validate that orderBy does not list the same key twice.
             var n = t.explicitOrderBy.concat([ e ]);
-            return new Te(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new Ee(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}(vr);
+}(gr);
 
 /**
  * Creates a {@link QueryOrderByConstraint} that sorts the query result by the
@@ -5095,19 +5138,19 @@ var Sr = /** @class */ function(e) {
  * @param directionStr - Optional direction to sort by ('asc' or 'desc'). If
  * not specified, order will be ascending.
  * @returns The created {@link QueryOrderByConstraint}.
- */ function kr(t, e) {
+ */ function Ar(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = yr("orderBy", t);
-    return Sr._create(r, n);
+    var n = e, r = mr("orderBy", t);
+    return kr._create(r, n);
 }
 
 /**
  * A `QueryLimitConstraint` is used to limit the number of documents returned by
  * a Firestore query.
  * `QueryLimitConstraint`s are created by invoking {@link limit} or
- * {@link limitToLast} and can then be passed to {@link query} to create a new
+ * {@link limitToLast} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryLimitConstraint`.
- */ var Ar = /** @class */ function(e) {
+ */ var Ir = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5120,11 +5163,11 @@ var Sr = /** @class */ function(e) {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        return new In(t.firestore, t.converter, function(t, e, n) {
-            return new Te(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new Fn(t.firestore, t.converter, function(t, e, n) {
+            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
         }(t._query, this._limit, this._limitType));
     }, n;
-}(vr);
+}(gr);
 
 /**
  * Creates a {@link QueryLimitConstraint} that only returns the first matching
@@ -5132,8 +5175,8 @@ var Sr = /** @class */ function(e) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Ir(t) {
-    return lt("limit", t), Ar._create("limit", t, "F" /* LimitType.First */)
+ */ function Fr(t) {
+    return lt("limit", t), Ir._create("limit", t, "F" /* LimitType.First */)
     /**
  * Creates a {@link QueryLimitConstraint} that only returns the last matching
  * documents.
@@ -5146,18 +5189,18 @@ var Sr = /** @class */ function(e) {
  */;
 }
 
-function Fr(t) {
-    return lt("limitToLast", t), Ar._create("limitToLast", t, "L" /* LimitType.Last */)
+function Pr(t) {
+    return lt("limitToLast", t), Ir._create("limitToLast", t, "L" /* LimitType.Last */)
     /**
  * A `QueryStartAtConstraint` is used to exclude documents from the start of a
  * result set returned by a Firestore query.
  * `QueryStartAtConstraint`s are created by invoking {@link (startAt:1)} or
- * {@link (startAfter:1)} and can then be passed to {@link query} to create a
+ * {@link (startAfter:1)} and can then be passed to {@link (query:1)} to create a
  * new query instance that also contains this `QueryStartAtConstraint`.
  */;
 }
 
-var Pr = /** @class */ function(e) {
+var Vr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5171,22 +5214,22 @@ var Pr = /** @class */ function(e) {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = Rr(t, this.type, this._docOrFields, this._inclusive);
-        return new In(t.firestore, t.converter, function(t, e) {
-            return new Te(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        var e = Cr(t, this.type, this._docOrFields, this._inclusive);
+        return new Fn(t.firestore, t.converter, function(t, e) {
+            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
         }(t._query, e));
     }, n;
-}(vr);
+}(gr);
 
-function Vr() {
+function Dr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Pr._create("startAt", t, 
+    return Vr._create("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function Dr() {
+function Nr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Pr._create("startAfter", t, 
+    return Vr._create("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
@@ -5194,9 +5237,9 @@ function Dr() {
  * A `QueryEndAtConstraint` is used to exclude documents from the end of a
  * result set returned by a Firestore query.
  * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or
- * {@link (endBefore:1)} and can then be passed to {@link query} to create a new
+ * {@link (endBefore:1)} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryEndAtConstraint`.
- */ var Nr = /** @class */ function(e) {
+ */ var Or = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5210,27 +5253,27 @@ function Dr() {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = Rr(t, this.type, this._docOrFields, this._inclusive);
-        return new In(t.firestore, t.converter, function(t, e) {
-            return new Te(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        var e = Cr(t, this.type, this._docOrFields, this._inclusive);
+        return new Fn(t.firestore, t.converter, function(t, e) {
+            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
         }(t._query, e));
     }, n;
-}(vr);
+}(gr);
 
-function Or() {
+function qr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Nr._create("endBefore", t, 
+    return Or._create("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function qr() {
+function Rr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Nr._create("endAt", t, 
+    return Or._create("endAt", t, 
     /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function Rr(t, e, n, r) {
-    if (n[0] = p(n[0]), n[0] instanceof fr) return function(t, e, n, r, i) {
+/** Helper function to create a bound from a document or fields */ function Cr(t, e, n, r) {
+    if (n[0] = p(n[0]), n[0] instanceof hr) return function(t, e, n, r, i) {
         if (!r) throw new B(N, "Can't use a DocumentSnapshot that doesn't exist for ".concat(n, "()."));
         // 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
@@ -5239,11 +5282,11 @@ function qr() {
         // the provided document. Without the key (by using the explicit sort
         // orders), multiple documents could match the position, yielding duplicate
         // results.
-        for (var o = [], a = 0, u = Ae(t); a < u.length; a++) {
+        for (var o = [], a = 0, u = Ie(t); a < u.length; a++) {
             var s = u[a];
-            if (s.field.isKeyField()) o.push(zt(e, r.key)); else {
+            if (s.field.isKeyField()) o.push(Kt(e, r.key)); else {
                 var c = r.data.field(s.field);
-                if (qt(c)) throw new B(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + s.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+                if (Rt(c)) throw new B(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + s.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
                 if (null === c) {
                     var l = s.field.canonicalString();
                     throw new B(V, "Invalid query. You are trying to start or end a query using a document for which the field '".concat(l, "' (used as the orderBy) does not exist."));
@@ -5251,9 +5294,9 @@ function qr() {
                 o.push(c);
             }
         }
-        return new Ht(o, i);
+        return new Xt(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = Qn(t.firestore);
+    var i = Gn(t.firestore);
     return function(t, e, n, r, i, o) {
         // Use explicit order by's because it has to match the query the user made
         var a = t.explicitOrderBy;
@@ -5262,36 +5305,36 @@ function qr() {
             var c = i[s];
             if (a[s].field.isKeyField()) {
                 if ("string" != typeof c) throw new B(V, "Invalid query. Expected a string for document ID in ".concat(r, "(), but got a ").concat(typeof c));
-                if (!ke(t) && -1 !== c.indexOf("/")) throw new B(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to ".concat(r, "() must be a plain document ID, but '").concat(c, "' contains a slash."));
+                if (!Ae(t) && -1 !== c.indexOf("/")) throw new B(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to ".concat(r, "() must be a plain document ID, but '").concat(c, "' contains a slash."));
                 var l = t.path.child(et.fromString(c));
                 if (!it.isDocumentKey(l)) throw new B(V, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to ".concat(r, "() must result in a valid document path, but '").concat(l, "' is not because it contains an odd number of segments."));
                 var f = new it(l);
-                u.push(zt(e, f));
+                u.push(Kt(e, f));
             } else {
-                var h = er(n, r, c);
+                var h = nr(n, r, c);
                 u.push(h);
             }
         }
-        return new Ht(u, o);
+        return new Xt(u, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function Cr(t, e, n) {
+function xr(t, e, n) {
     if ("string" == typeof (n = p(n))) {
         if ("" === n) throw new B(V, "Invalid query. When querying with documentId(), you must provide a valid document ID, but it was an empty string.");
-        if (!ke(e) && -1 !== n.indexOf("/")) throw new B(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
+        if (!Ae(e) && -1 !== n.indexOf("/")) throw new B(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
         var r = e.path.child(et.fromString(n));
         if (!it.isDocumentKey(r)) throw new B(V, "Invalid query. When querying a collection group by documentId(), the value provided must result in a valid document path, but '".concat(r, "' is not because it has an odd number of segments (").concat(r.length, ")."));
-        return zt(t, new it(r));
+        return Kt(t, new it(r));
     }
-    if (n instanceof An) return zt(t, n._key);
+    if (n instanceof In) return Kt(t, n._key);
     throw new B(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ".concat(st(n), "."));
 }
 
 /**
  * Validates that the value passed into a disjunctive filter satisfies all
  * array requirements.
- */ function xr(t, e) {
+ */ function Mr(t, e) {
     if (!Array.isArray(t) || 0 === t.length) throw new B(V, "Invalid Query. A non-empty array is required for '".concat(e.toString(), "' filters."));
 }
 
@@ -5304,12 +5347,12 @@ function Cr(t, e, n) {
  * Operators in a query must adhere to the following set of rules:
  * 1. Only one inequality per query.
  * 2. `NOT_IN` cannot be used with array, disjunctive, or `NOT_EQUAL` operators.
- */ function Mr(t, e) {
+ */ function Lr(t, e) {
     if (e.isInequality()) {
-        var n = Se(t), r = e.field;
+        var n = ke(t), r = e.field;
         if (null !== n && !n.isEqual(r)) throw new B(V, "Invalid query. All where filters with an inequality (<, <=, !=, not-in, >, or >=) must be on the same field. But you have inequality filters on '".concat(n.toString(), "' and '").concat(r.toString(), "'"));
-        var i = Ee(t);
-        null !== i && Lr(t, r, i);
+        var i = Se(t);
+        null !== i && jr(t, r, i);
     }
     var o = function(t, e) {
         for (var n = 0, r = t; n < r.length; n++) for (var i = 0, o = r[n].getFlattenedFilters(); i < o.length; i++) {
@@ -5338,12 +5381,12 @@ function Cr(t, e, n) {
     throw o === e.op ? new B(V, "Invalid query. You cannot use more than one '".concat(e.op.toString(), "' filter.")) : new B(V, "Invalid query. You cannot use '".concat(e.op.toString(), "' filters with '").concat(o.toString(), "' filters."));
 }
 
-function Lr(t, e, n) {
+function jr(t, e, n) {
     if (!n.isEqual(e)) throw new B(V, "Invalid query. You have a where filter with an inequality (<, <=, !=, not-in, >, or >=) on field '".concat(e.toString(), "' and so you must also use '").concat(e.toString(), "' as your first argument to orderBy(), but your first orderBy() is on field '").concat(n.toString(), "' instead."));
 }
 
-function jr(t, e) {
-    if (!(e instanceof wr || e instanceof br)) throw new B(V, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
+function Ur(t, e) {
+    if (!(e instanceof _r || e instanceof Tr)) throw new B(V, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
 }
 
 /**
@@ -5370,28 +5413,28 @@ function jr(t, e) {
  * 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 Ur(t, e, n) {
+ */ function Br(t, e, n) {
     // Cast to `any` in order to satisfy the union type constraint on
     // toFirestore().
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     return t ? n && (n.merge || n.mergeFields) ? t.toFirestore(e, n) : t.toFirestore(e) : e;
 }
 
-var Br = /** @class */ function(e) {
+var zr = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).firestore = t, n;
     }
     return t(n, e), n.prototype.convertBytes = function(t) {
-        return new qn(t);
+        return new Rn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new An(this.firestore, /* converter= */ null, e);
+        return new In(this.firestore, /* converter= */ null, e);
     }, n;
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), Mt(t)) {
+        switch (void 0 === e && (e = "none"), Lt(t)) {
           case 0 /* TypeOrder.NullValue */ :
             return null;
 
@@ -5399,7 +5442,7 @@ var Br = /** @class */ function(e) {
             return t.booleanValue;
 
           case 2 /* TypeOrder.NumberValue */ :
-            return Dt(t.integerValue || t.doubleValue);
+            return Nt(t.integerValue || t.doubleValue);
 
           case 3 /* TypeOrder.TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -5411,7 +5454,7 @@ var Br = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* TypeOrder.BlobValue */ :
-            return this.convertBytes(Nt(t.bytesValue));
+            return this.convertBytes(Ot(t.bytesValue));
 
           case 7 /* TypeOrder.RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5430,11 +5473,11 @@ var Br = /** @class */ function(e) {
         }
     }, t.prototype.convertObject = function(t, e) {
         var n = this, r = {};
-        return At(t.fields, (function(t, i) {
+        return It(t.fields, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new Mn(Dt(t.latitude), Dt(t.longitude));
+        return new Ln(Nt(t.latitude), Nt(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -5443,21 +5486,21 @@ var Br = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = Rt(t);
+            var n = Ct(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Ct(t));
+            return this.convertTimestamp(xt(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = Vt(t);
-        return new Ot(e.seconds, e.nanos);
+        var e = Dt(t);
+        return new qt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
         var n = et.fromString(t);
-        A(ln(n));
+        A(fn(n));
         var r = new $(n.get(1), n.get(3)), i = new it(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -5478,12 +5521,12 @@ var Br = /** @class */ function(e) {
  * @param reference - The reference of the document to fetch.
  * @returns A Promise resolved with a `DocumentSnapshot` containing the current
  * document contents.
- */ function zr(t) {
-    var e = vn((t = ct(t, An)).firestore), n = new Br(t.firestore);
-    return yn(e, [ t._key ]).then((function(e) {
+ */ function Kr(t) {
+    var e = gn((t = ct(t, In)).firestore), n = new zr(t.firestore);
+    return mn(e, [ t._key ]).then((function(e) {
         A(1 === e.length);
         var r = e[0];
-        return new fr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new hr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5498,18 +5541,18 @@ var Br = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Kr(t) {
+ */ function Qr(t) {
     !function(t) {
         if ("L" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new B(L, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = ct(t, In))._query);
-    var r = vn(t.firestore), i = new Br(t.firestore);
+    }((t = ct(t, Fn))._query);
+    var r = gn(t.firestore), i = new zr(t.firestore);
     return function(t, r) {
         return e(this, void 0, void 0, (function() {
             var e, i;
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    return e = I(t), i = nn(e.M, Ie(r)), [ 4 /*yield*/ , e.P("RunQuery", i.parent, {
+                    return e = I(t), i = rn(e.M, Fe(r)), [ 4 /*yield*/ , e.P("RunQuery", i.parent, {
                         structuredQuery: i.structuredQuery
                     }) ];
 
@@ -5518,12 +5561,12 @@ var Br = /** @class */ function(e) {
                         return !!t.document;
                     })).map((function(t) {
                         return function(t, e, n) {
-                            var r = Ze(t, e.name), i = He(e.updateTime), o = e.createTime ? He(e.createTime) : fe.min(), a = new ge({
+                            var r = $e(t, e.name), i = Xe(e.updateTime), o = e.createTime ? Xe(e.createTime) : he.min(), a = new we({
                                 mapValue: {
                                     fields: e.fields
                                 }
                             });
-                            return we.newFoundDocument(r, i, o, a);
+                            return _e.newFoundDocument(r, i, o, a);
                         }(e.M, t.document);
                     })) ];
                 }
@@ -5531,28 +5574,28 @@ var Br = /** @class */ function(e) {
         }));
     }(r, t._query).then((function(e) {
         var n = e.map((function(e) {
-            return new hr(t.firestore, i, e.key, e, t.converter);
+            return new pr(t.firestore, i, e.key, e, t.converter);
         }));
         return "L" /* LimitType.Last */ === t._query.limitType && 
         // 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.
-        n.reverse(), new pr(t, n);
+        n.reverse(), new dr(t, n);
     }));
 }
 
-function Qr(t, e, n) {
-    var r = Ur((t = ct(t, An)).converter, e, n), i = Gn(Qn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return dn(vn(t.firestore), [ i.toMutation(t._key, Ce.none()) ]);
+function Gr(t, e, n) {
+    var r = Br((t = ct(t, In)).converter, e, n), i = Yn(Gn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return yn(gn(t.firestore), [ i.toMutation(t._key, xe.none()) ]);
 }
 
-function Gr(t, e, n) {
+function Yr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = Qn((t = ct(t, An)).firestore);
+    var o, a = Gn((t = ct(t, In)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = p(e)) || e instanceof Rn ? tr(a, "updateDoc", t._key, e, n, r) : $n(a, "updateDoc", t._key, e), 
-    dn(vn(t.firestore), [ o.toMutation(t._key, Ce.exists(!0)) ]);
+        return o = "string" == typeof (e = p(e)) || e instanceof Cn ? er(a, "updateDoc", t._key, e, n, r) : tr(a, "updateDoc", t._key, e), 
+    yn(gn(t.firestore), [ o.toMutation(t._key, xe.exists(!0)) ]);
 }
 
 /**
@@ -5566,8 +5609,8 @@ function Gr(t, e, n) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Yr(t) {
-    return dn(vn((t = ct(t, An)).firestore), [ new je(t._key, Ce.none()) ]);
+ */ function Wr(t) {
+    return yn(gn((t = ct(t, In)).firestore), [ new Ue(t._key, xe.none()) ]);
 }
 
 /**
@@ -5584,9 +5627,9 @@ function Gr(t, e, n) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Wr(t, e) {
-    var n = Dn(t = ct(t, Fn)), r = Ur(t.converter, e), i = Gn(Qn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return dn(vn(t.firestore), [ i.toMutation(n._key, Ce.exists(!1)) ]).then((function() {
+ */ function Hr(t, e) {
+    var n = Nn(t = ct(t, Pn)), r = Br(t.converter, e), i = Yn(Gn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return yn(gn(t.firestore), [ i.toMutation(n._key, xe.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -5620,9 +5663,9 @@ function Gr(t, e, n) {
  * @returns A Promise that will be resolved with the count; the count can be
  * retrieved from `snapshot.data().count`, where `snapshot` is the
  * `AggregateQuerySnapshot` to which the returned Promise resolves.
- */ function Hr(t) {
-    return Xr(t, {
-        count: $r()
+ */ function Xr(t) {
+    return Jr(t, {
+        count: ti()
     });
 }
 
@@ -5652,13 +5695,13 @@ function Gr(t, e, n) {
  * const averageScore: number | null = aggregateSnapshot.data().averageScore;
  * ```
  * @internal TODO (sum/avg) remove when public
- */ function Xr(t, r) {
-    var i = ct(t.firestore, wn), o = vn(i), a = function(t, e) {
+ */ function Jr(t, r) {
+    var i = ct(t.firestore, _n), o = gn(i), a = function(t, e) {
         var n = [];
         for (var r in t) Object.prototype.hasOwnProperty.call(t, r) && n.push(e(t[r], r));
         return n;
     }(r, (function(t, e) {
-        return new _t(new wt(e), t._aggregateType, t._internalFieldPath);
+        return new bt(new _t(e), t._aggregateType, t._internalFieldPath);
     }));
     // Run the aggregation and convert the results
         return function(t, r, i) {
@@ -5668,7 +5711,7 @@ function Gr(t, e, n) {
                 switch (n.label) {
                   case 0:
                     return e = I(t), o = function(t, e, n) {
-                        var r = nn(t, e), i = [];
+                        var r = rn(t, e), i = [];
                         return n.forEach((function(t) {
                             "count" === t.N ? i.push({
                                 alias: t.alias.canonicalString(),
@@ -5676,12 +5719,12 @@ function Gr(t, e, n) {
                             }) : "avg" === t.N ? i.push({
                                 alias: t.alias.canonicalString(),
                                 avg: {
-                                    field: un(t.fieldPath)
+                                    field: sn(t.fieldPath)
                                 }
                             }) : "sum" === t.N && i.push({
                                 alias: t.alias.canonicalString(),
                                 sum: {
-                                    field: un(t.fieldPath)
+                                    field: sn(t.fieldPath)
                                 }
                             });
                         })), {
@@ -5691,14 +5734,14 @@ function Gr(t, e, n) {
                             },
                             parent: r.parent
                         };
-                    }(e.M, Ie(r), i), a = o.parent, e.connection.v || delete o.parent, [ 4 /*yield*/ , e.P("RunAggregationQuery", a, o, /*expectedResponseCount=*/ 1) ];
+                    }(e.M, Fe(r), i), a = o.parent, e.connection.v || delete o.parent, [ 4 /*yield*/ , e.P("RunAggregationQuery", a, o, /*expectedResponseCount=*/ 1) ];
 
                   case 1:
                     // Omit RunAggregationQueryResponse that only contain readTimes.
                     return u = n.sent().filter((function(t) {
                         return !!t.result;
                     })), [ 2 /*return*/ , (A(1 === u.length), (s = u[0]).result, s.result.aggregateFields, 
-                    new ge({
+                    new we({
                         mapValue: {
                             fields: null === (c = s.result) || void 0 === c ? void 0 : c.aggregateFields
                         }
@@ -5708,14 +5751,14 @@ function Gr(t, e, n) {
         }));
     }(o, t._query, a).then((function(e) {
         return function(t, e, n) {
-            var r = new Br(t);
-            return new kn(e, r, n);
+            var r = new zr(t);
+            return new An(e, r, n);
         }(i, t, e);
     }));
 }
 
-function Jr(t) {
-    return new Sn("sum", ar("sum", t));
+function Zr(t) {
+    return new kn("sum", ur("sum", t));
 }
 
 /**
@@ -5723,16 +5766,16 @@ function Jr(t) {
  * a specified field over a range of documents in the result set of a query.
  * @param field Specifies the field to average across the result set.
  * @internal TODO (sum/avg) remove when public
- */ function Zr(t) {
-    return new Sn("avg", ar("average", t));
+ */ function $r(t) {
+    return new kn("avg", ur("average", t));
 }
 
 /**
  * Create an AggregateField object that can be used to compute the count of
  * documents in the result set of a query.
  * @internal TODO (sum/avg) remove when public
- */ function $r() {
-    return new Sn("count");
+ */ function ti() {
+    return new kn("count");
 }
 
 /**
@@ -5741,9 +5784,9 @@ function Jr(t) {
  * @param left Compare this AggregateField to the `right`.
  * @param right Compare this AggregateField to the `left`.
  * @internal TODO (sum/avg) remove when public
- */ function ti(t, e) {
+ */ function ei(t, e) {
     var n, r;
-    return t instanceof Sn && e instanceof Sn && t._aggregateType === e._aggregateType && (null === (n = t._internalFieldPath) || void 0 === n ? void 0 : n.canonicalString()) === (null === (r = e._internalFieldPath) || void 0 === r ? void 0 : r.canonicalString());
+    return t instanceof kn && e instanceof kn && t._aggregateType === e._aggregateType && (null === (n = t._internalFieldPath) || void 0 === n ? void 0 : n.canonicalString()) === (null === (r = e._internalFieldPath) || void 0 === r ? void 0 : r.canonicalString());
 }
 
 /**
@@ -5757,8 +5800,8 @@ function Jr(t) {
  *
  * @returns `true` if the objects are "equal", as defined above, or `false`
  * otherwise.
- */ function ei(t, e) {
-    return On(t.query, e.query) && m(t.data(), e.data());
+ */ function ni(t, e) {
+    return qn(t.query, e.query) && m(t.data(), e.data());
 }
 
 /**
@@ -5780,15 +5823,15 @@ function Jr(t) {
 /**
  * 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 ni() {
-    return new Yn("deleteField");
+ */ function ri() {
+    return new Wn("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 ri() {
-    return new Hn("serverTimestamp");
+ */ function ii() {
+    return new Xn("serverTimestamp");
 }
 
 /**
@@ -5802,11 +5845,11 @@ function Jr(t) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function ii() {
+ */ function oi() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // 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 Xn("arrayUnion", t);
+        return new Jn("arrayUnion", t);
 }
 
 /**
@@ -5819,11 +5862,11 @@ function Jr(t) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function oi() {
+ */ function ai() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // 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 Jn("arrayRemove", t);
+        return new Zn("arrayRemove", t);
 }
 
 /**
@@ -5844,8 +5887,8 @@ function Jr(t) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function ai(t) {
-    return new Zn("increment", t);
+ */ function ui(t) {
+    return new $n("increment", t);
 }
 
 /**
@@ -5871,24 +5914,24 @@ function Jr(t) {
  * 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.
- */ var ui = /** @class */ function() {
+ */ var si = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Qn(t);
+        this._dataReader = Gn(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = si(t, this._firestore), i = Ur(r.converter, e, n), o = Gn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
-        return this._mutations.push(o.toMutation(r._key, Ce.none())), this;
+        var r = ci(t, this._firestore), i = Br(r.converter, e, n), o = Yn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
+        return this._mutations.push(o.toMutation(r._key, xe.none())), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
         this._verifyNotCommitted();
-        var o, a = si(t, this._firestore);
+        var o, a = ci(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = p(e)) || e instanceof Rn ? tr(this._dataReader, "WriteBatch.update", a._key, e, n, r) : $n(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, Ce.exists(!0))), this;
+                return o = "string" == typeof (e = p(e)) || e instanceof Cn ? er(this._dataReader, "WriteBatch.update", a._key, e, n, r) : tr(this._dataReader, "WriteBatch.update", a._key, e), 
+        this._mutations.push(o.toMutation(a._key, xe.exists(!0))), this;
     }, 
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5898,8 +5941,8 @@ function Jr(t) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = si(t, this._firestore);
-        return this._mutations = this._mutations.concat(new je(e._key, Ce.none())), this;
+        var e = ci(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Ue(e._key, xe.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5920,7 +5963,7 @@ function Jr(t) {
     }, t;
 }();
 
-function si(t, e) {
+function ci(t, e) {
     if ((t = p(t)).firestore !== e) throw new B(V, "Provided document reference is from a different Firestore instance.");
     return t;
 }
@@ -5937,10 +5980,10 @@ function si(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function ci(t) {
-    var e = vn(t = ct(t, wn));
-    return new ui(t, (function(t) {
-        return dn(e, t);
+ */ function li(t) {
+    var e = gn(t = ct(t, _n));
+    return new si(t, (function(t) {
+        return yn(e, t);
     }));
 }
 
@@ -5963,7 +6006,7 @@ function si(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var li = /** @class */ function() {
+ */ var fi = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -5988,7 +6031,7 @@ function si(t, e) {
                 switch (n.label) {
                   case 0:
                     if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new B(V, "Firestore transactions require all reads to be executed before all writes.");
-                    return [ 4 /*yield*/ , yn(this.datastore, t) ];
+                    return [ 4 /*yield*/ , mn(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -6007,7 +6050,7 @@ function si(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new je(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Ue(t, this.precondition(t))), this.writtenDocs.add(t.toString());
     }, t.prototype.commit = function() {
         return e(this, void 0, void 0, (function() {
             var t, e = this;
@@ -6024,8 +6067,8 @@ function si(t, e) {
                     // a `verify` operation.
                     t.forEach((function(t, n) {
                         var r = it.fromPath(n);
-                        e.mutations.push(new Ue(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , dn(this.datastore, this.mutations) ];
+                        e.mutations.push(new Be(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , yn(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -6038,7 +6081,7 @@ function si(t, e) {
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw k();
             // Represent a deleted doc using SnapshotVersion.min().
-                        e = fe.min();
+                        e = he.min();
         }
         var n = this.readVersions.get(t.key.toString());
         if (n) {
@@ -6053,7 +6096,7 @@ function si(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(fe.min()) ? Ce.exists(!1) : Ce.updateTime(e) : Ce.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(he.min()) ? xe.exists(!1) : xe.updateTime(e) : xe.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -6063,7 +6106,7 @@ function si(t, e) {
         // The first time a document is written, we want to take into account the
         // read time and existence
                 if (!this.writtenDocs.has(t.toString()) && e) {
-            if (e.isEqual(fe.min())) 
+            if (e.isEqual(he.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
@@ -6075,20 +6118,20 @@ function si(t, e) {
             // transaction.
             throw new B(V, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Ce.updateTime(e);
+                        return xe.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return Ce.exists(!0);
+                return xe.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), fi = {
+}(), hi = {
     maxAttempts: 5
-}, hi = /** @class */ function() {
+}, pi = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.datastore = e, this.options = n, this.updateFunction = r, 
-        this.deferred = i, this._t = n.maxAttempts, this.vt = new hn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
+        this.deferred = i, this._t = n.maxAttempts, this.vt = new pn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
@@ -6099,7 +6142,7 @@ function si(t, e) {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new li(this.datastore), (e = this.Et(t)) && e.then((function(e) {
+                    return t = new fi(this.datastore), (e = this.Et(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -6116,7 +6159,7 @@ function si(t, e) {
     }, t.prototype.Et = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !ft(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !ht(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
             null);
         } catch (t) {
             // Do not retry errors thrown by user provided updateFunction.
@@ -6207,7 +6250,7 @@ function si(t, e) {
  * 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 pi() {
+/** The Platform's 'document' implementation or null if not available. */ function di() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -6239,7 +6282,7 @@ function si(t, e) {
  * Note: We implement `PromiseLike` instead of `Promise`, as the `Promise` type
  * in newer versions of TypeScript defines `finally`, which is not available in
  * IE.
- */ var di, yi = /** @class */ function() {
+ */ var yi, mi = /** @class */ function() {
     function t(t, e, n, r, i) {
         this.asyncQueue = t, this.timerId = e, this.targetTimeMs = n, this.op = r, this.removalCallback = i, 
         this.deferred = new z, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
@@ -6303,7 +6346,7 @@ function si(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), mi = /** @class */ function() {
+}(), vi = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
@@ -6327,15 +6370,15 @@ function si(t, e) {
         // List of TimerIds to fast-forward delays for.
         this.Ft = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.vt = new hn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.vt = new pn(this, "async_queue_retry" /* TimerId.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.xt = function() {
-            var e = pi();
+            var e = di();
             e && b("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.vt.tt();
         };
-        var e = pi();
+        var e = di();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.xt);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
@@ -6359,7 +6402,7 @@ function si(t, e) {
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.Pt) {
             this.Pt = !0, this.Nt = t || !1;
-            var e = pi();
+            var e = di();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.xt);
         }
     }, t.prototype.enqueue = function(t) {
@@ -6457,7 +6500,7 @@ function si(t, e) {
         this.St(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ft.indexOf(t) > -1 && (e = 0);
-        var i = yi.createAndSchedule(this, t, e, n, (function(t) {
+        var i = mi.createAndSchedule(this, t, e, n, (function(t) {
             return r.kt(t);
         }));
         return this.Vt.push(i), i;
@@ -6532,10 +6575,10 @@ function si(t, e) {
         var e = this.Vt.indexOf(t);
         this.Vt.splice(e, 1);
     }, t;
-}(), vi = /** @class */ function() {
+}(), gi = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Qn(t)
+        this._firestore = t, this._transaction = e, this._dataReader = Gn(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -6544,23 +6587,23 @@ function si(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = si(t, this._firestore), r = new Br(this._firestore);
+        var e = this, n = ci(t, this._firestore), r = new zr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
             if (!t || 1 !== t.length) return k();
             var i = t[0];
-            if (i.isFoundDocument()) return new fr(e._firestore, r, i.key, i, n.converter);
-            if (i.isNoDocument()) return new fr(e._firestore, r, n._key, null, n.converter);
+            if (i.isFoundDocument()) return new hr(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new hr(e._firestore, r, n._key, null, n.converter);
             throw k();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = si(t, this._firestore), i = Ur(r.converter, e, n), o = Gn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = ci(t, this._firestore), i = Br(r.converter, e, n), o = Yn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
         return this._transaction.set(r._key, o), this;
     }, t.prototype.update = function(t, e, n) {
         for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-        var o, a = si(t, this._firestore);
+        var o, a = ci(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = p(e)) || e instanceof Rn ? tr(this._dataReader, "Transaction.update", a._key, e, n, r) : $n(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = p(e)) || e instanceof Cn ? er(this._dataReader, "Transaction.update", a._key, e, n, r) : tr(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -6570,7 +6613,7 @@ function si(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = si(t, this._firestore);
+        var e = ci(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -6610,14 +6653,14 @@ function si(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function gi(t, e, n) {
-    var r = vn(t = ct(t, wn)), i = Object.assign(Object.assign({}, fi), n);
+function wi(t, e, n) {
+    var r = gn(t = ct(t, _n)), i = Object.assign(Object.assign({}, hi), n);
     !function(t) {
         if (t.maxAttempts < 1) throw new B(V, "Max attempts must be at least 1");
     }(i);
     var o = new z;
-    return new hi(new mi, r, i, (function(n) {
-        return e(new vi(t, n));
+    return new pi(new vi, r, i, (function(n) {
+        return e(new gi(t, n));
     }), o).run(), o.promise
     /**
  * Firestore Lite
@@ -6629,15 +6672,15 @@ function gi(t, e, n) {
  */;
 }
 
-di = "".concat(i, "_lite"), g = di, o(new c("firestore/lite", (function(t, e) {
-    var n = e.instanceIdentifier, r = e.options, i = t.getProvider("app").getImmediate(), o = new wn(new Y(t.getProvider("auth-internal")), new J(t.getProvider("app-check-internal")), function(t, e) {
+yi = "".concat(i, "_lite"), g = yi, o(new c("firestore/lite", (function(t, e) {
+    var n = e.instanceIdentifier, r = e.options, i = t.getProvider("app").getImmediate(), o = new _n(new Y(t.getProvider("auth-internal")), new J(t.getProvider("app-check-internal")), function(t, e) {
         if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new B(V, '"projectId" not provided in firebase.initializeApp.');
         return new $(t.options.projectId, e);
     }(i, n), i);
     return r && o._setSettings(r), o;
 }), "PUBLIC").setMultipleInstances(!0)), 
 // RUNTIME_ENV and BUILD_TARGET are replaced by real values during the compilation
-a("firestore-lite", "3.8.4", ""), a("firestore-lite", "3.8.4", "esm5");
+a("firestore-lite", "3.9.0-20230314181055", ""), a("firestore-lite", "3.9.0-20230314181055", "esm5");
 
-export { Sn as AggregateField, kn as AggregateQuerySnapshot, qn as Bytes, Fn as CollectionReference, An as DocumentReference, fr as DocumentSnapshot, Rn as FieldPath, xn as FieldValue, wn as Firestore, B as FirestoreError, Mn as GeoPoint, In as Query, br as QueryCompositeFilterConstraint, vr as QueryConstraint, hr as QueryDocumentSnapshot, Nr as QueryEndAtConstraint, wr as QueryFieldFilterConstraint, Ar as QueryLimitConstraint, Sr as QueryOrderByConstraint, pr as QuerySnapshot, Pr as QueryStartAtConstraint, Ot as Timestamp, vi as Transaction, ui as WriteBatch, Wr as addDoc, ti as aggregateFieldEqual, ei as aggregateQuerySnapshotEqual, Er as and, oi as arrayRemove, ii as arrayUnion, Zr as average, Pn as collection, Vn as collectionGroup, Tn as connectFirestoreEmulator, $r as count, Yr as deleteDoc, ni as deleteField, Dn as doc, Cn as documentId, qr as endAt, Or as endBefore, Xr as getAggregate, Hr as getCount, zr as getDoc, Kr as getDocs, bn as getFirestore, ai as increment, _n as initializeFirestore, Ir as limit, Fr as limitToLast, Tr as or, kr as orderBy, gr as query, On as queryEqual, Nn as refEqual, gi as runTransaction, ri as serverTimestamp, Qr as setDoc, _ as setLogLevel, dr as snapshotEqual, Dr as startAfter, Vr as startAt, Jr as sum, En as terminate, Gr as updateDoc, _r as where, ci as writeBatch };
+export { kn as AggregateField, An as AggregateQuerySnapshot, Rn as Bytes, Pn as CollectionReference, In as DocumentReference, hr as DocumentSnapshot, Cn as FieldPath, Mn as FieldValue, _n as Firestore, B as FirestoreError, Ln as GeoPoint, Fn as Query, Tr as QueryCompositeFilterConstraint, gr as QueryConstraint, pr as QueryDocumentSnapshot, Or as QueryEndAtConstraint, _r as QueryFieldFilterConstraint, Ir as QueryLimitConstraint, kr as QueryOrderByConstraint, dr as QuerySnapshot, Vr as QueryStartAtConstraint, qt as Timestamp, gi as Transaction, si as WriteBatch, Hr as addDoc, ei as aggregateFieldEqual, ni as aggregateQuerySnapshotEqual, Sr as and, ai as arrayRemove, oi as arrayUnion, $r as average, Vn as collection, Dn as collectionGroup, En as connectFirestoreEmulator, ti as count, Wr as deleteDoc, ri as deleteField, Nn as doc, xn as documentId, Rr as endAt, qr as endBefore, Jr as getAggregate, Xr as getCount, Kr as getDoc, Qr as getDocs, Tn as getFirestore, ui as increment, bn as initializeFirestore, Fr as limit, Pr as limitToLast, Er as or, Ar as orderBy, wr as query, qn as queryEqual, On as refEqual, wi as runTransaction, ii as serverTimestamp, Gr as setDoc, _ as setLogLevel, yr as snapshotEqual, Nr as startAfter, Dr as startAt, Zr as sum, Sn as terminate, Yr as updateDoc, br as where, li as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map