@firebase/firestore 3.11.0 → 3.12.0-20230511201449

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.21.0", w = new l("@firebase/firestore");
+var g = "9.22.0-20230511201449", w = new l("@firebase/firestore");
 
 /**
  * @license
@@ -225,7 +225,7 @@ 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 F = "cancelled", P = "unknown", V = "invalid-argument", D = "deadline-exceeded", O = "not-found", N = "permission-denied", q = "unauthenticated", R = "resource-exhausted", C = "failed-precondition", x = "aborted", j = "out-of-range", L = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
+ */ var P = "cancelled", F = "unknown", O = "invalid-argument", V = "deadline-exceeded", D = "not-found", N = "permission-denied", q = "unauthenticated", R = "resource-exhausted", x = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -364,12 +364,14 @@ e) {
      * when using WebChannel as the network transport.
      * @param autoDetectLongPolling - Whether to use the detectBufferingProxy
      * option when using WebChannel as the network transport.
+     * @param longPollingOptions Options that configure long-polling.
      * @param useFetchStreams Whether to use the Fetch API instead of
      * XMLHTTPRequest
      */
-function(t, e, n, r, i, o, a, u) {
+function(t, e, n, r, i, o, a, u, s) {
     this.databaseId = t, this.appId = e, this.persistenceKey = n, this.host = r, this.ssl = i, 
-    this.forceLongPolling = o, this.autoDetectLongPolling = a, this.useFetchStreams = u;
+    this.forceLongPolling = o, this.autoDetectLongPolling = a, this.longPollingOptions = u, 
+    this.useFetchStreams = s;
 }, Z = /** @class */ function() {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
@@ -464,7 +466,7 @@ function(t, e, n, r, i, o, a, u) {
         // for legacy reasons and should not be used frequently).
                 for (var r = [], i = 0, o = t; i < o.length; i++) {
             var a = o[i];
-            if (a.indexOf("//") >= 0) throw new B(V, "Invalid segment (".concat(a, "). Paths must not contain // in them."));
+            if (a.indexOf("//") >= 0) throw new B(O, "Invalid segment (".concat(a, "). Paths must not contain // in them."));
             // Strip leading and traling slashed.
                         r.push.apply(r, a.split("/").filter((function(t) {
                 return t.length > 0;
@@ -519,18 +521,18 @@ function(t, e, n, r, i, o, a, u) {
      */
     n.fromServerFormat = function(t) {
         for (var e = [], r = "", i = 0, o = function() {
-            if (0 === r.length) throw new B(V, "Invalid field path (".concat(t, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"));
+            if (0 === r.length) throw new B(O, "Invalid field path (".concat(t, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"));
             e.push(r), r = "";
         }, a = !1; i < t.length; ) {
             var u = t[i];
             if ("\\" === u) {
-                if (i + 1 === t.length) throw new B(V, "Path has trailing escape character: " + t);
+                if (i + 1 === t.length) throw new B(O, "Path has trailing escape character: " + t);
                 var s = t[i + 1];
-                if ("\\" !== s && "." !== s && "`" !== s) throw new B(V, "Path has invalid escape sequence: " + t);
+                if ("\\" !== s && "." !== s && "`" !== s) throw new B(O, "Path has invalid escape sequence: " + t);
                 r += s, i += 2;
             } else "`" === u ? (a = !a, i++) : "." !== u || a ? (r += u, i++) : (o(), i++);
         }
-        if (o(), a) throw new B(V, "Unterminated ` in path: " + t);
+        if (o(), a) throw new B(O, "Unterminated ` in path: " + t);
         return new n(e);
     }, n.emptyPath = function() {
         return new n([]);
@@ -598,7 +600,7 @@ function(t, e, n, r, i, o, a, u) {
  * limitations under the License.
  */
 function ot(t, e, n) {
-    if (!n) throw new B(V, "Function ".concat(t, "() cannot be called with an empty ").concat(e, "."));
+    if (!n) throw new B(O, "Function ".concat(t, "() cannot be called with an empty ").concat(e, "."));
 }
 
 /**
@@ -609,14 +611,14 @@ function ot(t, e, n) {
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
  */ function at(t) {
-    if (!it.isDocumentKey(t)) throw new B(V, "Invalid document reference. Document references must have an even number of segments, but ".concat(t, " has ").concat(t.length, "."));
+    if (!it.isDocumentKey(t)) throw new B(O, "Invalid document reference. Document references must have an even number of segments, but ".concat(t, " has ").concat(t.length, "."));
 }
 
 /**
  * Validates that `path` refers to a collection (indicated by the fact it
  * contains an odd numbers of segments).
  */ function ut(t) {
-    if (it.isDocumentKey(t)) throw new B(V, "Invalid collection reference. Collection references must have an odd number of segments, but ".concat(t, " has ").concat(t.length, "."));
+    if (it.isDocumentKey(t)) throw new B(O, "Invalid collection reference. Collection references must have an odd number of segments, but ".concat(t, " has ").concat(t.length, "."));
 }
 
 /**
@@ -648,15 +650,15 @@ e) {
     // Unwrap Compat types
     // eslint-disable-next-line @typescript-eslint/no-explicit-any
     t = t._delegate), !(t instanceof e)) {
-        if (e.name === t.constructor.name) throw new B(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
+        if (e.name === t.constructor.name) throw new B(O, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
         var n = st(t);
-        throw new B(V, "Expected type '".concat(e.name, "', but it was: ").concat(n));
+        throw new B(O, "Expected type '".concat(e.name, "', but it was: ").concat(n));
     }
     return t;
 }
 
 function lt(t, e) {
-    if (e <= 0) throw new B(V, "Function ".concat(t, "() requires a positive number, but it was: ").concat(e, "."));
+    if (e <= 0) throw new B(O, "Function ".concat(t, "() requires a positive number, but it was: ").concat(e, "."));
 }
 
 /**
@@ -676,9 +678,37 @@ function lt(t, e) {
  * limitations under the License.
  */
 /**
+ * Compares two `ExperimentalLongPollingOptions` objects for equality.
+ */
+/**
+ * Creates and returns a new `ExperimentalLongPollingOptions` with the same
+ * option values as the given instance.
+ */ function ft(t) {
+    var e = {};
+    return void 0 !== t.timeoutSeconds && (e.timeoutSeconds = t.timeoutSeconds), 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;
+ */;
+}
+
+var ht = null;
 
 /**
  * Generates and returns an initial value for `lastUniqueDebugId`.
@@ -721,11 +751,11 @@ function lt(t, e) {
 /**
  * Returns whether a variable is either undefined or null.
  */
-function ht(t) {
+function pt(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function pt(t) {
+/** Returns whether the value represents -0. */ function dt(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;
@@ -750,7 +780,7 @@ function ht(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 dt, yt, mt = {
+ */ var yt, mt, vt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -795,8 +825,8 @@ function ht(t) {
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function vt(t) {
-    if (void 0 === t) return T("RPC_ERROR", "HTTP error has no status"), P;
+function gt(t) {
+    if (void 0 === t) return T("RPC_ERROR", "HTTP error has no status"), F;
     // The canonical error codes for Google APIs [1] specify mapping onto HTTP
     // status codes but the mapping is not bijective. In each case of ambiguity
     // this function chooses a primary error.
@@ -809,7 +839,7 @@ function vt(t) {
 
       case 400:
         // Bad Request
-        return C;
+        return x;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
@@ -824,11 +854,11 @@ function vt(t) {
 
       case 404:
         // Not Found
-        return O;
+        return D;
 
       case 409:
         // Conflict
-        return x;
+        return C;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
@@ -842,11 +872,11 @@ function vt(t) {
 
       case 499:
         // Client Closed Request
-        return F;
+        return P;
 
       case 500:
         // Internal Server Error
-        return P;
+        return F;
 
         // Other possibilities:
         // return Code.INTERNAL;
@@ -861,10 +891,10 @@ function vt(t) {
 
       case 504:
         // Gateway Timeout
-        return D;
+        return V;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? C : t >= 500 && t < 600 ? M : P;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? x : t >= 500 && t < 600 ? M : F;
     }
 }
 
@@ -887,16 +917,16 @@ function vt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (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) {
+ */ (mt = yt || (yt = {}))[mt.OK = 0] = "OK", mt[mt.CANCELLED = 1] = "CANCELLED", 
+mt[mt.UNKNOWN = 2] = "UNKNOWN", mt[mt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
+mt[mt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", mt[mt.NOT_FOUND = 5] = "NOT_FOUND", 
+mt[mt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", mt[mt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
+mt[mt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", mt[mt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
+mt[mt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", mt[mt.ABORTED = 10] = "ABORTED", 
+mt[mt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", mt[mt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
+mt[mt.INTERNAL = 13] = "INTERNAL", mt[mt.UNAVAILABLE = 14] = "UNAVAILABLE", mt[mt.DATA_LOSS = 15] = "DATA_LOSS";
+
+var wt = /** @class */ function(r) {
     /**
      * @param databaseInfo - The connection info.
      * @param fetchImpl - `fetch` or a Polyfill that implements the fetch API.
@@ -930,14 +960,14 @@ var gt = /** @class */ function(r) {
                     return a = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw u = n.sent(), new B(vt((s = u).status), "Request failed with error: " + s.statusText);
+                    throw u = n.sent(), new B(gt((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(vt(a.status), "Request failed with error: ".concat(null != l ? l : a.statusText));
+                    new B(gt(a.status), "Request failed with error: ".concat(null != l ? l : a.statusText));
 
                   case 6:
                     return [ 2 /*return*/ , a.json() ];
@@ -960,8 +990,8 @@ var gt = /** @class */ function(r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype.v = function(t, e, n, r, i) {
-        var o = (null === ft ? ft = 268435456 + Math.round(2147483648 * Math.random()) : ft++, 
-        "0x" + ft.toString(16)), a = this.I(t, e);
+        var o = (null === ht ? ht = 268435456 + Math.round(2147483648 * Math.random()) : ht++, 
+        "0x" + ht.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.A(t, a, u, n).then((function(e) {
@@ -993,10 +1023,10 @@ var gt = /** @class */ function(r) {
             return t[n] = e;
         }));
     }, t.prototype.I = function(t, e) {
-        var n = mt[t];
+        var n = vt[t];
         return "".concat(this.m, "/v1/").concat(e, ":").concat(n);
     }, t;
-}()), wt = function(t, e, n) {
+}()), _t = function(t, e, n) {
     this.alias = t, this.$ = e, this.fieldPath = n;
 };
 
@@ -1057,7 +1087,7 @@ var gt = /** @class */ function(r) {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function _t(t) {
+function bt(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
@@ -1083,14 +1113,14 @@ function _t(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 bt = /** @class */ function() {
+ */ var Tt = /** @class */ function() {
     function t() {}
-    return t.D = function() {
+    return t.N = 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 = _t(40), i = 0; i < r.length; ++i) 
+        ; n.length < 20; ) for (var r = bt(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));
@@ -1098,11 +1128,11 @@ function _t(t) {
     }, t;
 }();
 
-function Tt(t, e) {
+function Et(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function Et(t, e, n) {
+/** Helper to compare arrays using isEqual(). */ function St(t, e, n) {
     return t.length === e.length && t.every((function(t, r) {
         return n(t, e[r]);
     }));
@@ -1123,13 +1153,13 @@ function Tt(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 St(t) {
+ */ function kt(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function kt(t, e) {
+function It(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1151,13 +1181,13 @@ function kt(t, e) {
  */
 /**
  * An error encountered while decoding base64 string.
- */ var It = /** @class */ function(e) {
+ */ var At = /** @class */ function(e) {
     function n() {
         var t = this;
         return (t = e.apply(this, arguments) || this).name = "Base64DecodeError", t;
     }
     return t(n, e), n;
-}(Error), At = /** @class */ function() {
+}(Error), Pt = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1169,7 +1199,7 @@ function kt(t, e) {
                 // Check that `DOMException` is defined before using it to avoid
                 // "ReferenceError: Property 'DOMException' doesn't exist" in react-native.
                 // (https://github.com/firebase/firebase-js-sdk/issues/7115)
-                throw "undefined" != typeof DOMException && t instanceof DOMException ? new It("Invalid base64 string: " + t) : t;
+                throw "undefined" != typeof DOMException && t instanceof DOMException ? new At("Invalid base64 string: " + t) : t;
             }
         }(e);
         return new t(n);
@@ -1209,7 +1239,7 @@ function kt(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return Tt(this.binaryString, t.binaryString);
+        return Et(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1256,14 +1286,14 @@ function kt(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ At.EMPTY_BYTE_STRING = new At("");
+ */ Pt.EMPTY_BYTE_STRING = new Pt("");
 
 var Ft = 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 Pt(t) {
+ */ function Ot(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.
@@ -1299,7 +1329,7 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 }
 
 /** Converts the possible Proto types for Blobs into a ByteString. */ function Dt(t) {
-    return "string" == typeof t ? At.fromBase64String(t) : At.fromUint8Array(t);
+    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
 }
 
 /**
@@ -1332,7 +1362,7 @@ var Ft = 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 Nt = /** @class */ function() {
     /**
      * Creates a new timestamp.
      *
@@ -1353,11 +1383,11 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
      * The fractions of a second at nanosecond resolution.*
      */
     e) {
-        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new B(V, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new B(V, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new B(V, "Timestamp seconds out of range: " + t);
+        if (this.seconds = t, this.nanoseconds = e, e < 0) throw new B(O, "Timestamp nanoseconds out of range: " + e);
+        if (e >= 1e9) throw new B(O, "Timestamp nanoseconds out of range: " + e);
+        if (t < -62135596800) throw new B(O, "Timestamp seconds out of range: " + t);
         // This will break in the year 10,000.
-                if (t >= 253402300800) throw new B(V, "Timestamp seconds out of range: " + t);
+                if (t >= 253402300800) throw new B(O, "Timestamp seconds out of range: " + t);
     }
     /**
      * Creates a new timestamp with the current date, with millisecond precision.
@@ -1409,7 +1439,7 @@ var Ft = 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 ? Tt(this.nanoseconds, t.nanoseconds) : Tt(this.seconds, t.seconds);
+        return this.seconds === t.seconds ? Et(this.nanoseconds, t.nanoseconds) : Et(this.seconds, t.seconds);
     }, 
     /**
      * Returns true if this `Timestamp` is equal to the provided one.
@@ -1481,7 +1511,7 @@ var Ft = 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 Nt(t) {
+ */ function qt(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);
 }
@@ -1491,16 +1521,16 @@ var Ft = 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 qt(t) {
+ */ function Rt(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return Nt(e) ? qt(e) : e;
+    return qt(e) ? Rt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Rt(t) {
-    var e = Pt(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new Ot(e.seconds, e.nanos);
+ */ function xt(t) {
+    var e = Ot(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new Nt(e.seconds, e.nanos);
 }
 
 /**
@@ -1526,18 +1556,18 @@ var Ft = 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 xt(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 ? Nt(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
+/** Extracts the backend's type order for the provided value. */ function jt(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 */ : 
     /** 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 jt(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Lt(t, e) {
     if (t === e) return !0;
-    var n = xt(t);
-    if (n !== xt(e)) return !1;
+    var n = jt(t);
+    if (n !== jt(e)) return !1;
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
@@ -1547,14 +1577,14 @@ var Ft = 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 Rt(t).isEqual(Rt(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 = Pt(t.timestampValue), r = Pt(e.timestampValue);
+            var n = Ot(t.timestampValue), r = Ot(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1579,19 +1609,19 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
             if ("integerValue" in t && "integerValue" in e) return Vt(t.integerValue) === Vt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
                 var n = Vt(t.doubleValue), r = Vt(e.doubleValue);
-                return n === r ? pt(n) === pt(r) : isNaN(n) && isNaN(r);
+                return n === r ? dt(n) === dt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* TypeOrder.ArrayValue */ :
-        return Et(t.arrayValue.values || [], e.arrayValue.values || [], jt);
+        return St(t.arrayValue.values || [], e.arrayValue.values || [], Lt);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
             var n = t.mapValue.fields || {}, r = e.mapValue.fields || {};
-            if (St(n) !== St(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !jt(n[i], r[i]))) return !1;
+            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;
             return !0;
         }(t, e);
 
@@ -1600,23 +1630,23 @@ var Ft = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
     }
 }
 
-function Lt(t, e) {
+function Mt(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return jt(t, e);
+        return Lt(t, e);
     }));
 }
 
-function Mt(t, e) {
+function Ut(t, e) {
     if (t === e) return 0;
-    var n = xt(t), r = xt(e);
-    if (n !== r) return Tt(n, r);
+    var n = jt(t), r = jt(e);
+    if (n !== r) return Et(n, r);
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
         return 0;
 
       case 1 /* TypeOrder.BooleanValue */ :
-        return Tt(t.booleanValue, e.booleanValue);
+        return Et(t.booleanValue, e.booleanValue);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
@@ -1627,13 +1657,13 @@ function Mt(t, e) {
         }(t, e);
 
       case 3 /* TypeOrder.TimestampValue */ :
-        return Ut(t.timestampValue, e.timestampValue);
+        return Bt(t.timestampValue, e.timestampValue);
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return Ut(Rt(t), Rt(e));
+        return Bt(xt(t), xt(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return Tt(t.stringValue, e.stringValue);
+        return Et(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
@@ -1644,25 +1674,25 @@ function Mt(t, e) {
       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 = Tt(n[i], r[i]);
+                var o = Et(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return Tt(n.length, r.length);
+            return Et(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            var n = Tt(Vt(t.latitude), Vt(e.latitude));
-            return 0 !== n ? n : Tt(Vt(t.longitude), Vt(e.longitude));
+            var n = Et(Vt(t.latitude), Vt(e.latitude));
+            return 0 !== n ? n : Et(Vt(t.longitude), Vt(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 = Mt(n[i], r[i]);
+                var o = Ut(n[i], r[i]);
                 if (o) return o;
             }
-            return Tt(n.length, r.length);
+            return Et(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* TypeOrder.ObjectValue */ :
@@ -1677,12 +1707,12 @@ function Mt(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 = Tt(r[a], o[a]);
+                var u = Et(r[a], o[a]);
                 if (0 !== u) return u;
-                var s = Mt(n[r[a]], i[o[a]]);
+                var s = Ut(n[r[a]], i[o[a]]);
                 if (0 !== s) return s;
             }
-            return Tt(r.length, o.length);
+            return Et(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
@@ -1690,35 +1720,35 @@ function Mt(t, e) {
     }
 }
 
-function Ut(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Tt(t, e);
-    var n = Pt(t), r = Pt(e), i = Tt(n.seconds, r.seconds);
-    return 0 !== i ? i : Tt(n.nanos, r.nanos);
+function Bt(t, e) {
+    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return Et(t, e);
+    var n = Ot(t), r = Ot(e), i = Et(n.seconds, r.seconds);
+    return 0 !== i ? i : Et(n.nanos, r.nanos);
 }
 
-function Bt(t, e) {
+function zt(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 zt(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 Kt(t) {
     return !!t && "nullValue" in t;
 }
 
-/** Returns true if `value` is NaN. */ function Kt(t) {
+/** Returns true if `value` is NaN. */ function Gt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Gt(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 Yt(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1731,8 +1761,8 @@ function Bt(t, e) {
                 fields: {}
             }
         };
-        return kt(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] = Yt(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1740,21 +1770,21 @@ function Bt(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] = Yt(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
 }
 
-var Yt = function(t, e) {
+var Ht = function(t, e) {
     this.position = t, this.inclusive = e;
 };
 
-function Ht(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 (!jt(t.position[n], e.position[n])) return !1;
+    for (var n = 0; n < t.position.length; n++) if (!Lt(t.position[n], e.position[n])) return !1;
     return !0;
 }
 
@@ -1773,7 +1803,7 @@ function Ht(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() {}, Xt = /** @class */ function(e) {
+ */ var Xt = 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;
@@ -1781,13 +1811,13 @@ function Ht(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 te(t, e, r) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new ie(t, r) : "in" /* Operator.IN */ === e ? new oe(t, r) : "not-in" /* Operator.NOT_IN */ === e ? new ae(t, r) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new ue(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 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);
     }, n.createKeyFieldInFilter = function(t, e, n) {
-        return "in" /* Operator.IN */ === e ? new ee(t, n) : new ne(t, n);
+        return "in" /* Operator.IN */ === e ? new ne(t, n) : new re(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(Mt(e, this.value)) : null !== e && xt(this.value) === xt(e) && this.matchesComparison(Mt(e, this.value));
+                return "!=" /* Operator.NOT_EQUAL */ === this.op ? null !== e && this.matchesComparison(Ut(e, this.value)) : null !== e && jt(this.value) === jt(e) && this.matchesComparison(Ut(e, this.value));
         // Only compare types with matching backend order (such as double and int).
         }, n.prototype.matchesComparison = function(t) {
         switch (this.op) {
@@ -1821,10 +1851,10 @@ function Ht(t, e) {
     }, n.prototype.getFirstInequalityField = function() {
         return this.isInequality() ? this.field : null;
     }, n;
-}(Jt), $t = /** @class */ function(e) {
+}(Xt), Zt = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this) || this).filters = t, r.op = n, r.N = null, r;
+        return (r = e.call(this) || this).filters = t, r.op = n, r.D = null, r;
     }
     /**
      * Creates a filter based on the provided arguments.
@@ -1837,9 +1867,9 @@ function Ht(t, e) {
             return e.matches(t);
         }));
     }, n.prototype.getFlattenedFilters = function() {
-        return null !== this.N || (this.N = this.filters.reduce((function(t, e) {
+        return null !== this.D || (this.D = this.filters.reduce((function(t, e) {
             return t.concat(e.getFlattenedFilters());
-        }), [])), this.N;
+        }), [])), this.D;
     }, 
     // Returns a mutable copy of `this.filters`
     n.prototype.getFilters = function() {
@@ -1860,19 +1890,19 @@ function Ht(t, e) {
         }
         return null;
     }, n;
-}(Jt);
-
-function Zt(t, e) {
-    return t instanceof Xt ? function(t, e) {
-        return e instanceof Xt && t.op === e.op && t.field.isEqual(e.field) && jt(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 && Zt(n, e.filters[r]);
+}(Xt);
+
+function te(t, e) {
+    return t instanceof $t ? function(t, e) {
+        return e instanceof $t && t.op === e.op && t.field.isEqual(e.field) && Lt(t.value, e.value);
+    }(t, e) : t instanceof Zt ? function(t, e) {
+        return e instanceof Zt && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
+            return t && te(n, e.filters[r]);
         }), !0);
     }(t, e) : void k();
 }
 
-var te = /** @class */ function(e) {
+var ee = /** @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), 
@@ -1882,10 +1912,10 @@ var te = /** @class */ function(e) {
         var e = it.comparator(t.key, this.key);
         return this.matchesComparison(e);
     }, n;
-}(Xt), ee = /** @class */ function(e) {
+}($t), ne = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* Operator.IN */ , n) || this).keys = re("in" /* Operator.IN */ , n), 
+        return (r = e.call(this, t, "in" /* Operator.IN */ , n) || this).keys = ie("in" /* Operator.IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1893,10 +1923,10 @@ var te = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Xt), ne = /** @class */ function(e) {
+}($t), re = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "not-in" /* Operator.NOT_IN */ , n) || this).keys = re("not-in" /* Operator.NOT_IN */ , n), 
+        return (r = e.call(this, t, "not-in" /* Operator.NOT_IN */ , n) || this).keys = ie("not-in" /* Operator.NOT_IN */ , n), 
         r;
     }
     return t(n, e), n.prototype.matches = function(t) {
@@ -1904,57 +1934,57 @@ var te = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}(Xt);
+}($t);
 
-/** Filter that matches on key fields within an array. */ function re(t, e) {
+/** Filter that matches on key fields within an array. */ function ie(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 ie = /** @class */ function(e) {
+/** A Filter that implements the array-contains operator. */ var oe = /** @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 zt(e) && Lt(e.arrayValue, this.value);
+        return Qt(e) && Mt(e.arrayValue, this.value);
     }, n;
-}(Xt), oe = /** @class */ function(e) {
+}($t), ae = /** @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 && Lt(this.value.arrayValue, e);
+        return null !== e && Mt(this.value.arrayValue, e);
     }, n;
-}(Xt), ae = /** @class */ function(e) {
+}($t), ue = /** @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 (Lt(this.value.arrayValue, {
+        if (Mt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !Lt(this.value.arrayValue, e);
+        return null !== e && !Mt(this.value.arrayValue, e);
     }, n;
-}(Xt), ue = /** @class */ function(e) {
+}($t), se = /** @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 !(!zt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return Lt(e.value.arrayValue, t);
+        return !(!Qt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Mt(e.value.arrayValue, t);
         }));
     }, n;
-}(Xt), se = function(t, e /* Direction.ASCENDING */) {
+}($t), ce = function(t, e /* Direction.ASCENDING */) {
     void 0 === e && (e = "asc"), this.field = t, this.dir = e;
 };
 
-/** A Filter that implements the IN operator. */ function ce(t, e) {
+/** A Filter that implements the IN operator. */ function le(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
@@ -1977,16 +2007,16 @@ var te = /** @class */ function(e) {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ var le = /** @class */ function() {
+ */ var fe = /** @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 Nt(0, 0));
     }, t.max = function() {
-        return new t(new Ot(253402300799, 999999999));
+        return new t(new Nt(253402300799, 999999999));
     }, t.prototype.compareTo = function(t) {
         return this.timestamp._compareTo(t.timestamp);
     }, t.prototype.isEqual = function(t) {
@@ -2000,17 +2030,17 @@ var te = /** @class */ function(e) {
     }, t.prototype.toTimestamp = function() {
         return this.timestamp;
     }, t;
-}(), fe = /** @class */ function() {
+}(), he = /** @class */ function() {
     function t(t, e) {
-        this.comparator = t, this.root = e || pe.EMPTY;
+        this.comparator = t, this.root = e || de.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, pe.BLACK, null, null));
+        return new t(this.comparator, this.root.insert(e, n, this.comparator).copy(null, null, de.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, pe.BLACK, null, null));
+        return new t(this.comparator, this.root.remove(e, this.comparator).copy(null, null, de.BLACK, null, null));
     }, 
     // Returns the value of the node with the given key, or null.
     t.prototype.get = function(t) {
@@ -2079,15 +2109,15 @@ var te = /** @class */ function(e) {
     }, 
     // Returns an iterator over the SortedMap.
     t.prototype.getIterator = function() {
-        return new he(this.root, null, this.comparator, !1);
+        return new pe(this.root, null, this.comparator, !1);
     }, t.prototype.getIteratorFrom = function(t) {
-        return new he(this.root, t, this.comparator, !1);
+        return new pe(this.root, t, this.comparator, !1);
     }, t.prototype.getReverseIterator = function() {
-        return new he(this.root, null, this.comparator, !0);
+        return new pe(this.root, null, this.comparator, !0);
     }, t.prototype.getReverseIteratorFrom = function(t) {
-        return new he(this.root, t, this.comparator, !0);
+        return new pe(this.root, t, this.comparator, !0);
     }, t;
-}(), he = /** @class */ function() {
+}(), pe = /** @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, 
@@ -2124,7 +2154,7 @@ var te = /** @class */ function(e) {
             value: t.value
         };
     }, t;
-}(), pe = /** @class */ function() {
+}(), de = /** @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;
@@ -2245,9 +2275,9 @@ var te = /** @class */ function(e) {
 // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-pe.EMPTY = null, pe.RED = !0, pe.BLACK = !1, 
+de.EMPTY = null, de.RED = !0, de.BLACK = !1, 
 // end LLRBEmptyNode
-pe.EMPTY = new (/** @class */ function() {
+de.EMPTY = new (/** @class */ function() {
     function t() {
         this.size = 0;
     }
@@ -2288,7 +2318,7 @@ pe.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 pe(t, e);
+        return new de(t, e);
     }, 
     // Returns a copy of the tree, with the specified key removed.
     t.prototype.remove = function(t, e) {
@@ -2337,9 +2367,9 @@ pe.EMPTY = new (/** @class */ function() {
  * NOTE: if provided comparator returns 0 for two elements, we consider them to
  * be equal!
  */
-var de = /** @class */ function() {
+var ye = /** @class */ function() {
     function t(t) {
-        this.comparator = t, this.data = new fe(this.comparator);
+        this.comparator = t, this.data = new he(this.comparator);
     }
     return t.prototype.has = function(t) {
         return null !== this.data.get(t);
@@ -2379,9 +2409,9 @@ var de = /** @class */ function() {
         var e = this.data.getIteratorFrom(t);
         return e.hasNext() ? e.getNext().key : null;
     }, t.prototype.getIterator = function() {
-        return new ye(this.data.getIterator());
+        return new me(this.data.getIterator());
     }, t.prototype.getIteratorFrom = function(t) {
-        return new ye(this.data.getIteratorFrom(t));
+        return new me(this.data.getIteratorFrom(t));
     }, 
     /** Inserts or updates an element */ t.prototype.add = function(t) {
         return this.copy(this.data.remove(t).insert(t, !0));
@@ -2418,7 +2448,7 @@ var de = /** @class */ function() {
         var n = new t(this.comparator);
         return n.data = e, n;
     }, t;
-}(), ye = /** @class */ function() {
+}(), me = /** @class */ function() {
     function t(t) {
         this.iter = t;
     }
@@ -2427,7 +2457,7 @@ var de = /** @class */ function() {
     }, t.prototype.hasNext = function() {
         return this.iter.hasNext();
     }, t;
-}(), me = /** @class */ function() {
+}(), ve = /** @class */ function() {
     function t(t) {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
@@ -2442,7 +2472,7 @@ var de = /** @class */ function() {
      * fields paths to this field mask.
      */
     t.prototype.unionWith = function(e) {
-        for (var n = new de(rt.comparator), r = 0, i = this.fields; r < i.length; r++) {
+        for (var n = new ye(rt.comparator), r = 0, i = this.fields; r < i.length; r++) {
             var o = i[r];
             n = n.add(o);
         }
@@ -2464,11 +2494,11 @@ var de = /** @class */ function() {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return Et(this.fields, t.fields, (function(t, e) {
+        return St(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), ve = /** @class */ function() {
+}(), ge = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -2485,7 +2515,7 @@ var de = /** @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 (!Gt(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;
     }, 
     /**
@@ -2495,7 +2525,7 @@ var de = /** @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()] = Yt(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -2510,7 +2540,7 @@ var de = /** @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()] = Yt(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -2523,9 +2553,9 @@ var de = /** @class */ function() {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        Gt(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 jt(this.value, t.value);
+        return Lt(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2538,7 +2568,7 @@ var de = /** @class */ function() {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            Gt(r) && r.mapValue.fields || (r = {
+            Wt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -2551,7 +2581,7 @@ var de = /** @class */ function() {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        kt(e, (function(e, n) {
+        It(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -2559,9 +2589,9 @@ var de = /** @class */ function() {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(Wt(this.value));
+        return new t(Yt(this.value));
     }, t;
-}(), ge = /** @class */ function() {
+}(), we = /** @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
@@ -2572,9 +2602,9 @@ var de = /** @class */ function() {
     }
     return t.newInvalidDocument = function(e) {
         return new t(e, 0 /* DocumentType.INVALID */ , 
-        /* version */ le.min(), 
-        /* readTime */ le.min(), 
-        /* createTime */ le.min(), ve.empty(), 0 /* DocumentState.SYNCED */);
+        /* version */ fe.min(), 
+        /* readTime */ fe.min(), 
+        /* createTime */ fe.min(), ge.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -2583,14 +2613,14 @@ var de = /** @class */ function() {
     t.newFoundDocument = function(e, n, r, i) {
         return new t(e, 1 /* DocumentType.FOUND_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ le.min(), 
+        /* readTime */ fe.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 */ le.min(), 
-        /* createTime */ le.min(), ve.empty(), 0 /* DocumentState.SYNCED */);
+        /* readTime */ fe.min(), 
+        /* createTime */ fe.min(), ge.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -2600,8 +2630,8 @@ var de = /** @class */ function() {
     t.newUnknownDocument = function(e, n) {
         return new t(e, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ le.min(), 
-        /* createTime */ le.min(), ve.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
+        /* readTime */ fe.min(), 
+        /* createTime */ fe.min(), ge.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2613,7 +2643,7 @@ var de = /** @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(le.min()) || 2 /* DocumentType.NO_DOCUMENT */ !== this.documentType && 0 /* DocumentType.INVALID */ !== this.documentType || (this.createTime = t), 
+        return !this.createTime.isEqual(fe.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;
     }, 
@@ -2623,7 +2653,7 @@ var de = /** @class */ function() {
      */
     t.prototype.convertToNoDocument = function(t) {
         return this.version = t, this.documentType = 2 /* DocumentType.NO_DOCUMENT */ , 
-        this.data = ve.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
+        this.data = ge.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }, 
     /**
      * Changes the document type to indicate that it exists at a given version but
@@ -2632,12 +2662,12 @@ var de = /** @class */ function() {
      */
     t.prototype.convertToUnknownDocument = function(t) {
         return this.version = t, this.documentType = 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
-        this.data = ve.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
+        this.data = ge.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 = le.min(), 
+        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = fe.min(), 
         this;
     }, t.prototype.setReadTime = function(t) {
         return this.readTime = t, this;
@@ -2674,7 +2704,7 @@ var de = /** @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;
-}(), we = function(t, e, n, r, i, o, a) {
+}(), _e = 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, 
@@ -2689,10 +2719,10 @@ var de = /** @class */ function() {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function _e(t, e, n, r, i, o, a) {
+function be(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 we(t, e, n, r, i, o, a);
+    new _e(t, e, n, r, i, o, a);
 }
 
 /**
@@ -2717,7 +2747,7 @@ function _e(t, e, n, r, i, o, a) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var be = 
+ */ var Te = 
 /**
      * Initializes a Query with a path and optional additional query constraints.
      * Path must currently be empty if this is a collection group query.
@@ -2732,11 +2762,11 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
     this.O = null, this.startAt, this.endAt;
 };
 
-/** Creates a new Query for a query that matches all documents at `path` */ function Te(t) {
+/** Creates a new Query for a query that matches all documents at `path` */ function Ee(t) {
     return t.explicitOrderBy.length > 0 ? t.explicitOrderBy[0].field : null;
 }
 
-function Ee(t) {
+function Se(t) {
     for (var e = 0, n = t.filters; e < n.length; e++) {
         var r = n[e].getFirstInequalityField();
         if (null !== r) return r;
@@ -2751,7 +2781,7 @@ function Ee(t) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function Se(t) {
+ */ function ke(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2759,16 +2789,16 @@ function Ee(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 ke(t) {
+ */ function Ie(t) {
     var e = A(t);
     if (null === e.q) {
         e.q = [];
-        var n = Ee(e), r = Te(e);
+        var n = Se(e), r = Ee(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.q.push(new se(n)), e.q.push(new se(rt.keyField(), "asc" /* Direction.ASCENDING */)); else {
+        n.isKeyField() || e.q.push(new ce(n)), e.q.push(new ce(rt.keyField(), "asc" /* Direction.ASCENDING */)); else {
             for (var i = !1, o = 0, a = e.explicitOrderBy; o < a.length; o++) {
                 var u = a[o];
                 e.q.push(u), u.field.isKeyField() && (i = !0);
@@ -2777,7 +2807,7 @@ function Ee(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.q.push(new se(rt.keyField(), s));
+                e.q.push(new ce(rt.keyField(), s));
             }
         }
     }
@@ -2786,27 +2816,27 @@ function Ee(t) {
 
 /**
  * Converts this `Query` instance to it's corresponding `Target` representation.
- */ function Ie(t) {
+ */ function Ae(t) {
     var e = A(t);
-    if (!e.O) if ("F" /* LimitType.First */ === e.limitType) e.O = _e(e.path, e.collectionGroup, ke(e), e.filters, e.limit, e.startAt, e.endAt); else {
+    if (!e.O) if ("F" /* LimitType.First */ === e.limitType) e.O = be(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 = ke(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 se(o.field, a));
+            n.push(new ce(o.field, a));
         }
         // We need to swap the cursors to match the now-flipped query ordering.
-                var u = e.endAt ? new Yt(e.endAt.position, e.endAt.inclusive) : null, s = e.startAt ? new Yt(e.startAt.position, e.startAt.inclusive) : null;
+                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;
         // Now return as a LimitType.First query.
-                e.O = _e(e.path, e.collectionGroup, n, e.filters, e.limit, u, s);
+                e.O = be(e.path, e.collectionGroup, n, e.filters, e.limit, u, s);
     }
     return e.O;
 }
 
-function Ae(t, e) {
-    e.getFirstInequalityField(), Ee(t);
+function Pe(t, e) {
+    e.getFirstInequalityField(), Se(t);
     var n = t.filters.concat([ e ]);
-    return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
+    return new Te(t.path, t.collectionGroup, t.explicitOrderBy.slice(), n, t.limit, t.limitType, t.startAt, t.endAt);
 }
 
 /**
@@ -2836,7 +2866,7 @@ function Ae(t, e) {
  */
 function Fe(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !pt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
+        return "number" == typeof t && Number.isInteger(t) && !dt(t) && t <= Number.MAX_SAFE_INTEGER && t >= Number.MIN_SAFE_INTEGER;
     }(e) ? 
     /**
      * Returns an IntegerValue for `value`.
@@ -2858,7 +2888,7 @@ function Fe(t, e) {
             };
         }
         return {
-            doubleValue: pt(e) ? "-0" : e
+            doubleValue: dt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2879,7 +2909,7 @@ function Fe(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 Pe = function() {
+/** Used to represent a field transform on a mutation. */ var Oe = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
@@ -2888,27 +2918,27 @@ function Fe(t, e) {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(Pe), De = /** @class */ function(e) {
+}(Oe), De = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Pe), Oe = /** @class */ function(e) {
+}(Oe), Ne = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Pe), Ne = /** @class */ function(e) {
+}(Oe), qe = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).serializer = t, r.k = n, r;
     }
     return t(n, e), n;
-}(Pe), qe = function(t, e) {
+}(Oe), Re = function(t, e) {
     this.field = t, this.transform = e;
-}, Re = /** @class */ function() {
+}, xe = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2930,7 +2960,7 @@ function Fe(t, e) {
     }), t.prototype.isEqual = function(t) {
         return this.exists === t.exists && (this.updateTime ? !!t.updateTime && this.updateTime.isEqual(t.updateTime) : !t.updateTime);
     }, t;
-}(), Ce = function() {}, xe = /** @class */ function(e) {
+}(), Ce = function() {}, je = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2940,7 +2970,7 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ce), je = /** @class */ function(e) {
+}(Ce), Le = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -2950,7 +2980,7 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return this.fieldMask;
     }, n;
-}(Ce), Le = /** @class */ function(e) {
+}(Ce), Me = /** @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 */ , 
@@ -2959,7 +2989,7 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ce), Me = /** @class */ function(e) {
+}(Ce), Ue = /** @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 */ , 
@@ -2968,10 +2998,10 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ce), Ue = {
+}(Ce), Be = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, Be = {
+}, ze = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -2982,10 +3012,10 @@ function Fe(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, ze = {
+}, Qe = {
     and: "AND",
     or: "OR"
-}, Qe = function(t, e) {
+}, Ke = function(t, e) {
     this.databaseId = t, this.useProto3Json = e;
 };
 
@@ -3001,7 +3031,7 @@ function Fe(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Ke(t, e) {
+function Ge(t, e) {
     return t.useProto3Json ? "".concat(new Date(1e3 * e.seconds).toISOString().replace(/\.\d*/, "").replace("Z", ""), ".").concat(("000000000" + e.nanoseconds).slice(-9), "Z") : {
         seconds: "" + e.seconds,
         nanos: e.nanoseconds
@@ -3012,69 +3042,69 @@ function Ke(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Ge(t, e) {
+ */ function We(t, e) {
     return t.useProto3Json ? e.toBase64() : e.toUint8Array();
 }
 
-function We(t, e) {
-    return Ke(t, e.toTimestamp());
+function Ye(t, e) {
+    return Ge(t, e.toTimestamp());
 }
 
-function Ye(t) {
-    return I(!!t), le.fromTimestamp(function(t) {
-        var e = Pt(t);
-        return new Ot(e.seconds, e.nanos);
+function He(t) {
+    return I(!!t), fe.fromTimestamp(function(t) {
+        var e = Ot(t);
+        return new Nt(e.seconds, e.nanos);
     }(t));
 }
 
-function He(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 He(t.databaseId, e.path);
+function Xe(t, e) {
+    return Je(t.databaseId, e.path);
 }
 
-function Xe(t, e) {
+function $e(t, e) {
     var n, r = function(t) {
         var e = et.fromString(t);
-        return I(cn(e)), e;
+        return I(ln(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);
+    if (r.get(1) !== t.databaseId.projectId) throw new B(O, "Tried to deserialize key from different project: " + r.get(1) + " vs " + t.databaseId.projectId);
+    if (r.get(3) !== t.databaseId.database) throw new B(O, "Tried to deserialize key from different database: " + r.get(3) + " vs " + t.databaseId.database);
     return new it((I((n = r).length > 4 && "documents" === n.get(4)), n.popFirst(5)));
 }
 
-function $e(t, e) {
-    return He(t.databaseId, e);
+function Ze(t, e) {
+    return Je(t.databaseId, e);
 }
 
-function Ze(t) {
+function tn(t) {
     return new et([ "projects", t.databaseId.projectId, "databases", t.databaseId.database ]).canonicalString();
 }
 
-function tn(t, e, n) {
+function en(t, e, n) {
     return {
-        name: Je(t, e),
+        name: Xe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function en(t, e) {
+function nn(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 = Ze(t, r), n.structuredQuery.from = [ {
         collectionId: e.collectionGroup,
         allDescendants: !0
-    } ]) : (n.parent = $e(t, r.popLast()), n.structuredQuery.from = [ {
+    } ]) : (n.parent = Ze(t, r.popLast()), n.structuredQuery.from = [ {
         collectionId: r.lastSegment()
     } ]);
     var i = function(t) {
-        if (0 !== t.length) return un($t.create(t, "and" /* CompositeOperator.AND */));
+        if (0 !== t.length) return sn(Zt.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     i && (n.structuredQuery.where = i);
     var o = function(t) {
@@ -3082,15 +3112,15 @@ function en(t, e) {
             // visible for testing
             return function(t) {
                 return {
-                    field: an(t.field),
-                    direction: nn(t.dir)
+                    field: un(t.field),
+                    direction: rn(t.dir)
                 };
             }(t);
         }));
     }(e.orderBy);
     o && (n.structuredQuery.orderBy = o);
     var a, u = function(t, e) {
-        return t.useProto3Json || ht(e) ? e : {
+        return t.useProto3Json || pt(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -3105,75 +3135,75 @@ function en(t, e) {
     }(e.endAt)), n;
 }
 
-function nn(t) {
-    return Ue[t];
-}
-
-// visible for testing
 function rn(t) {
     return Be[t];
 }
 
+// visible for testing
 function on(t) {
     return ze[t];
 }
 
 function an(t) {
+    return Qe[t];
+}
+
+function un(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function un(t) {
-    return t instanceof Xt ? function(t) {
+function sn(t) {
+    return t instanceof $t ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
-            if (Kt(t.value)) return {
+            if (Gt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: un(t.field),
                     op: "IS_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (Kt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: un(t.field),
                     op: "IS_NULL"
                 }
             };
         } else if ("!=" /* Operator.NOT_EQUAL */ === t.op) {
-            if (Kt(t.value)) return {
+            if (Gt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: un(t.field),
                     op: "IS_NOT_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (Kt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: un(t.field),
                     op: "IS_NOT_NULL"
                 }
             };
         }
         return {
             fieldFilter: {
-                field: an(t.field),
-                op: rn(t.op),
+                field: un(t.field),
+                op: on(t.op),
                 value: t.value
             }
         };
-    }(t) : t instanceof $t ? function(t) {
+    }(t) : t instanceof Zt ? function(t) {
         var e = t.getFilters().map((function(t) {
-            return un(t);
+            return sn(t);
         }));
         return 1 === e.length ? e[0] : {
             compositeFilter: {
-                op: on(t.op),
+                op: an(t.op),
                 filters: e
             }
         };
     }(t) : k();
 }
 
-function sn(t) {
+function cn(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -3182,7 +3212,7 @@ function sn(t) {
     };
 }
 
-function cn(t) {
+function ln(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3202,8 +3232,8 @@ function cn(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 ln(t) {
-    return new Qe(t, /* useProto3Json= */ !0);
+ */ function fn(t) {
+    return new Ke(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3230,7 +3260,7 @@ function cn(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 fn = /** @class */ function() {
+ */ var hn = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3304,14 +3334,14 @@ function cn(t) {
     /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.Y = function() {
         return (Math.random() - .5) * this.j;
     }, t;
-}(), hn = /** @class */ function(e) {
+}(), pn = /** @class */ function(e) {
     function n(t, n, r, i) {
         var o = this;
         return (o = e.call(this) || this).authCredentials = t, o.appCheckCredentials = n, 
         o.connection = r, o.serializer = i, o.J = !1, o;
     }
     return t(n, e), n.prototype.X = function() {
-        if (this.J) throw new B(C, "The client has already been terminated.");
+        if (this.J) throw new B(x, "The client has already been terminated.");
     }, 
     /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.v = function(t, e, n) {
         var r = this;
@@ -3320,7 +3350,7 @@ function cn(t) {
             return r.connection.v(t, e, n, o, a);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === q && (r.authCredentials.invalidateToken(), 
-            r.appCheckCredentials.invalidateToken()), t) : new B(P, t.toString());
+            r.appCheckCredentials.invalidateToken()), t) : new B(F, t.toString());
         }));
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.R = function(t, e, n, r) {
@@ -3330,7 +3360,7 @@ function cn(t) {
             return i.connection.R(t, e, n, a, u, r);
         })).catch((function(t) {
             throw "FirebaseError" === t.name ? (t.code === q && (i.authCredentials.invalidateToken(), 
-            i.appCheckCredentials.invalidateToken()), t) : new B(P, t.toString());
+            i.appCheckCredentials.invalidateToken()), t) : new B(F, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.J = !0;
@@ -3364,27 +3394,27 @@ function cn(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function pn(t, r) {
+function dn(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 = A(t), i = Ze(e.serializer) + "/documents", o = {
+                return e = A(t), i = tn(e.serializer) + "/documents", o = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof xe) n = {
-                                update: tn(t, e.key, e.value)
+                            if (e instanceof je) n = {
+                                update: en(t, e.key, e.value)
+                            }; else if (e instanceof Me) n = {
+                                delete: Xe(t, e.key)
                             }; else if (e instanceof Le) n = {
-                                delete: Je(t, e.key)
-                            }; else if (e instanceof je) n = {
-                                update: tn(t, e.key, e.data),
-                                updateMask: sn(e.fieldMask)
+                                update: en(t, e.key, e.data),
+                                updateMask: cn(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Me)) return k();
+                                if (!(e instanceof Ue)) return k();
                                 n = {
-                                    verify: Je(t, e.key)
+                                    verify: Xe(t, e.key)
                                 };
                             }
                             return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((function(t) {
@@ -3400,13 +3430,13 @@ function pn(t, r) {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof Oe) return {
+                                    if (n instanceof Ne) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof Ne) return {
+                                    if (n instanceof qe) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.k
                                     };
@@ -3414,7 +3444,7 @@ function pn(t, r) {
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: We(t, e.updateTime)
+                                    updateTime: Ye(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
                                 } : k();
@@ -3430,15 +3460,15 @@ function pn(t, r) {
     }));
 }
 
-function dn(t, r) {
+function yn(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 = A(t), i = Ze(e.serializer) + "/documents", o = {
+                return e = A(t), i = tn(e.serializer) + "/documents", o = {
                     documents: r.map((function(t) {
-                        return Je(e.serializer, t);
+                        return Xe(e.serializer, t);
                     }))
                 }, [ 4 /*yield*/ , e.R("BatchGetDocuments", i, o, r.length) ];
 
@@ -3447,16 +3477,16 @@ function dn(t, r) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
                             I(!!e.found), e.found.name, e.found.updateTime;
-                            var n = Xe(t, e.found.name), r = Ye(e.found.updateTime), i = e.found.createTime ? Ye(e.found.createTime) : le.min(), o = new ve({
+                            var n = $e(t, e.found.name), r = He(e.found.updateTime), i = e.found.createTime ? He(e.found.createTime) : fe.min(), o = new ge({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return ge.newFoundDocument(n, r, i, o);
+                            return we.newFoundDocument(n, r, i, o);
                         }(t, e) : "missing" in e ? function(t, e) {
                             I(!!e.missing), I(!!e.readTime);
-                            var n = Xe(t, e.missing), r = Ye(e.readTime);
-                            return ge.newNoDocument(n, r);
+                            var n = $e(t, e.missing), r = He(e.readTime);
+                            return we.newNoDocument(n, r);
                         }(t, e) : k();
                     }(e.serializer, t);
                     u.set(n.key.toString(), n);
@@ -3485,7 +3515,7 @@ function dn(t, r) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var yn = new Map;
+var mn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3495,17 +3525,17 @@ var yn = new Map;
  * Returns an initialized and started Datastore for the given Firestore
  * instance. Callers must invoke removeComponents() when the Firestore
  * instance is terminated.
- */ function mn(t) {
-    if (t._terminated) throw new B(C, "The client has already been terminated.");
-    if (!yn.has(t)) {
+ */ function vn(t) {
+    if (t._terminated) throw new B(x, "The client has already been terminated.");
+    if (!mn.has(t)) {
         b("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new gt(t, fetch.bind(null));
+            return new wt(t, fetch.bind(null));
         }((i = t._databaseId, o = t.app.options.appId || "", a = t._persistenceKey, u = t._freezeSettings(), 
-        new $(i, o, a, u.host, u.ssl, u.experimentalForceLongPolling, u.experimentalAutoDetectLongPolling, u.useFetchStreams))), n = ln(t._databaseId), r = function(t, e, n, r) {
-            return new hn(t, e, n, r);
+        new $(i, o, a, u.host, u.ssl, u.experimentalForceLongPolling, u.experimentalAutoDetectLongPolling, ft(u.experimentalLongPollingOptions), u.useFetchStreams))), n = fn(t._databaseId), r = function(t, e, n, r) {
+            return new pn(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
-        yn.set(t, r);
+        mn.set(t, r);
     }
     var i, o, a, u;
     /**
@@ -3523,7 +3553,7 @@ var yn = 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 yn.get(t);
+ */    return mn.get(t);
 }
 
 /**
@@ -3534,32 +3564,41 @@ var yn = 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 vn = /** @class */ function() {
+ */ var gn = /** @class */ function() {
     function t(t) {
-        var e;
+        var e, n;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new B(V, "Can't provide ssl option if host option is not set");
+            if (void 0 !== t.ssl) throw new B(O, "Can't provide ssl option if host option is not set");
             this.host = "firestore.googleapis.com", this.ssl = !0;
         } else this.host = t.host, this.ssl = null === (e = t.ssl) || void 0 === e || e;
         if (this.credentials = t.credentials, this.ignoreUndefinedProperties = !!t.ignoreUndefinedProperties, 
         this.cache = t.localCache, void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new B(V, "cacheSizeBytes must be at least 1048576");
+            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new B(O, "cacheSizeBytes must be at least 1048576");
             this.cacheSizeBytes = t.cacheSizeBytes;
         }
         !function(t, e, n, r) {
-            if (!0 === e && !0 === r) throw new B(V, "".concat("experimentalForceLongPolling", " and ").concat("experimentalAutoDetectLongPolling", " cannot be used together."));
+            if (!0 === e && !0 === r) throw new B(O, "".concat("experimentalForceLongPolling", " and ").concat("experimentalAutoDetectLongPolling", " cannot be used together."));
         }(0, t.experimentalForceLongPolling, 0, t.experimentalAutoDetectLongPolling), this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, 
-        this.experimentalForceLongPolling || void 0 === t.experimentalAutoDetectLongPolling ? this.experimentalAutoDetectLongPolling = !1 : 
+        this.experimentalForceLongPolling ? this.experimentalAutoDetectLongPolling = !1 : void 0 === t.experimentalAutoDetectLongPolling ? this.experimentalAutoDetectLongPolling = !0 : 
         // For backwards compatibility, coerce the value to boolean even though
         // the TypeScript compiler has narrowed the type to boolean already.
         // noinspection PointlessBooleanExpressionJS
         this.experimentalAutoDetectLongPolling = !!t.experimentalAutoDetectLongPolling, 
-        this.useFetchStreams = !!t.useFetchStreams;
+        this.experimentalLongPollingOptions = ft(null !== (n = t.experimentalLongPollingOptions) && void 0 !== n ? n : {}), 
+        function(t) {
+            if (void 0 !== t.timeoutSeconds) {
+                if (isNaN(t.timeoutSeconds)) throw new B(O, "invalid long polling timeout: ".concat(t.timeoutSeconds, " (must not be NaN)"));
+                if (t.timeoutSeconds < 5) throw new B(O, "invalid long polling timeout: ".concat(t.timeoutSeconds, " (minimum allowed value is 5)"));
+                if (t.timeoutSeconds > 30) throw new B(O, "invalid long polling timeout: ".concat(t.timeoutSeconds, " (maximum allowed value is 30)"));
+            }
+        }(this.experimentalLongPollingOptions), this.useFetchStreams = !!t.useFetchStreams;
     }
     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;
+        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 && (e = this.experimentalLongPollingOptions, 
+        n = t.experimentalLongPollingOptions, e.timeoutSeconds === n.timeoutSeconds) && this.ignoreUndefinedProperties === t.ignoreUndefinedProperties && this.useFetchStreams === t.useFetchStreams;
+        var e, n;
     }, t;
-}(), gn = /** @class */ function() {
+}(), wn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e, n, r) {
         this._authCredentials = t, this._appCheckCredentials = e, this._databaseId = n, 
@@ -3567,7 +3606,7 @@ var yn = new Map;
         /**
              * Whether it's a Firestore or Firestore Lite instance.
              */
-        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new vn({}), 
+        this.type = "firestore-lite", this._persistenceKey = "(lite)", this._settings = new gn({}), 
         this._settingsFrozen = !1;
     }
     return Object.defineProperty(t.prototype, "app", {
@@ -3576,7 +3615,7 @@ var yn = new Map;
          * instance.
          */
         get: function() {
-            if (!this._app) throw new B(C, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
+            if (!this._app) throw new B(x, "Firestore was not initialized using the Firebase SDK. 'app' is not available");
             return this._app;
         },
         enumerable: !1,
@@ -3594,8 +3633,8 @@ var yn = new Map;
         enumerable: !1,
         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 vn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+        if (this._settingsFrozen) throw new B(x, "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) {
             if (!t) return new K;
             switch (t.type) {
               case "firstParty":
@@ -3605,7 +3644,7 @@ var yn = new Map;
                 return t.client;
 
               default:
-                throw new B(V, "makeAuthCredentialsProvider failed due to invalid credential type");
+                throw new B(O, "makeAuthCredentialsProvider failed due to invalid credential type");
             }
         }(t.credentials));
     }, t.prototype._getSettings = function() {
@@ -3630,49 +3669,29 @@ var yn = new Map;
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = yn.get(t)) && (b("ComponentProvider", "Removing Datastore"), 
-        yn.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = mn.get(t)) && (b("ComponentProvider", "Removing Datastore"), 
+        mn.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
 
-/**
- * @license
- * Copyright 2020 Google LLC
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * The Cloud Firestore service interface.
- *
- * Do not call this constructor directly. Instead, use {@link (getFirestore:1)}.
- */ function wn(t, e, n) {
+function _n(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.");
+    if (r.isInitialized(n)) throw new B(x, "Firestore can only be initialized once per app.");
     return r.initialize({
         options: e,
         instanceIdentifier: n
     });
 }
 
-function _n(t, e) {
+function bn(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 && bn.apply(void 0, r([ o ], a, !1));
+        a && Tn.apply(void 0, r([ o ], a, !1));
     }
     return o;
 }
@@ -3689,10 +3708,10 @@ function _n(t, e) {
  * @param port - the emulator port (ex: 9000).
  * @param options.mockUserToken - the mock auth token to use for unit testing
  * Security Rules.
- */ function bn(t, e, n, r) {
+ */ function Tn(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = ct(t, gn))._getSettings();
+    var o = (t = ct(t, wn))._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),
@@ -3704,7 +3723,7 @@ function _n(t, e) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             a = y(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var s = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!s) throw new B(V, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!s) throw new B(O, "mockUserToken must contain 'sub' or 'user_id' field!");
             u = new v(s);
         }
         t._authCredentials = new G(new Q(a, u));
@@ -3730,8 +3749,8 @@ function _n(t, e) {
  * @param firestore - The `Firestore` instance to terminate.
  * @returns A `Promise` that is resolved when the instance has been successfully
  * terminated.
- */ function Tn(t) {
-    return t = ct(t, gn), s(t.app, "firestore/lite"), t._delete();
+ */ function En(t) {
+    return t = ct(t, wn), s(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3770,7 +3789,7 @@ function _n(t, e) {
  * Represents an aggregation that can be performed by Firestore.
  */
 // eslint-disable-next-line @typescript-eslint/no-unused-vars
-var En = 
+var Sn = 
 /**
      * Create a new AggregateField<T>
      * @param _aggregateType Specifies the type of aggregation operation to perform.
@@ -3783,7 +3802,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";
-}, Sn = /** @class */ function() {
+}, kn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e, n) {
         this._userDataWriter = e, this._data = n, 
@@ -3804,7 +3823,7 @@ t, e) {
     return t.prototype.data = function() {
         return this._userDataWriter.convertObjectMap(this._data);
     }, t;
-}(), kn = /** @class */ function() {
+}(), In = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3845,14 +3864,14 @@ t, e) {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new An(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() {
+}(), An = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3867,11 +3886,11 @@ t, e) {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), An = /** @class */ function(e) {
+}(), Pn = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
-        return (i = e.call(this, t, n, new be(r)) || this)._path = r, 
+        return (i = e.call(this, t, n, new Te(r)) || this)._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
     }
@@ -3898,7 +3917,7 @@ t, e) {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new kn(this.firestore, 
+            return t.isEmpty() ? null : new In(this.firestore, 
             /* converter= */ null, new it(t));
         },
         enumerable: !1,
@@ -3906,19 +3925,19 @@ t, e) {
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(In);
+}(An);
 
 /**
  * The results of executing an aggregation query.
  */ function Fn(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 gn) {
+    if (t = p(t), ot("collection", "path", e), t instanceof wn) {
         var o = et.fromString.apply(et, r([ e ], n, !1));
-        return ut(o), new An(t, /* converter= */ null, o);
+        return ut(o), new Pn(t, /* converter= */ null, o);
     }
-    if (!(t instanceof kn || t instanceof An)) 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(O, "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 An(t.firestore, 
+    return ut(a), new Pn(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3934,11 +3953,11 @@ 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 Pn(t, e) {
-    if (t = ct(t, gn), 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 On(t, e) {
+    if (t = ct(t, wn), ot("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new B(O, "Invalid collection ID '".concat(e, "' passed to function collectionGroup(). Collection IDs must not contain '/'."));
+    return new An(t, 
     /* converter= */ null, function(t) {
-        return new be(et.emptyPath(), t);
+        return new Te(et.emptyPath(), t);
     }(e));
 }
 
@@ -3947,14 +3966,14 @@ function Vn(t, e) {
     if (t = p(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = bt.D()), ot("doc", "path", e), t instanceof gn) {
+    1 === arguments.length && (e = Tt.N()), ot("doc", "path", e), t instanceof wn) {
         var o = et.fromString.apply(et, r([ e ], n, !1));
-        return at(o), new kn(t, 
+        return at(o), new In(t, 
         /* converter= */ null, new it(o));
     }
-    if (!(t instanceof kn || t instanceof An)) 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(O, "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 kn(t.firestore, t instanceof An ? t.converter : null, new it(a));
+    return at(a), new In(t.firestore, t instanceof Pn ? t.converter : null, new it(a));
 }
 
 /**
@@ -3965,7 +3984,7 @@ function Vn(t, e) {
  * @returns true if the references point to the same location in the same
  * Firestore database.
  */ function Dn(t, e) {
-    return t = p(t), e = p(e), (t instanceof kn || t instanceof An) && (e instanceof kn || e instanceof An) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+    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.
@@ -3977,16 +3996,16 @@ function Vn(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 Nn(t, e) {
+    return t = p(t), e = p(e), t instanceof An && e instanceof An && 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 (!ce(t.orderBy[n], e.orderBy[n])) return !1;
+            for (var n = 0; n < t.orderBy.length; n++) if (!le(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 (!Zt(t.filters[r], e.filters[r])) return !1;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Ht(t.startAt, e.startAt) && Ht(t.endAt, e.endAt);
-        }(Ie(t), Ie(e)) && t.limitType === e.limitType;
+            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) && !!Jt(t.startAt, e.startAt) && Jt(t.endAt, e.endAt);
+        }(Ae(t), Ae(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -4009,7 +4028,7 @@ function On(t, e) {
  */;
 }
 
-var Nn = /** @class */ function() {
+var qn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -4021,9 +4040,9 @@ var Nn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(At.fromBase64String(e));
+            return new t(Pt.fromBase64String(e));
         } catch (e) {
-            throw new B(V, "Failed to construct data from Base64 string: " + e);
+            throw new B(O, "Failed to construct data from Base64 string: " + e);
         }
     }, 
     /**
@@ -4032,7 +4051,7 @@ var Nn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(At.fromUint8Array(e));
+        return new t(Pt.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4067,7 +4086,7 @@ var Nn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), qn = /** @class */ function() {
+}(), Rn = /** @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.
@@ -4076,7 +4095,7 @@ var Nn = /** @class */ function() {
      */
     function t() {
         for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new B(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
+        for (var n = 0; n < t.length; ++n) if (0 === t[n].length) throw new B(O, "Invalid field name at argument $(i + 1). Field names must not be empty.");
         this._internalPath = new rt(t);
     }
     /**
@@ -4117,8 +4136,8 @@ var Nn = /** @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 Rn() {
-    return new qn("__name__");
+function xn() {
+    return new Rn("__name__");
 }
 
 /**
@@ -4147,7 +4166,7 @@ function Rn() {
      */
 function(t) {
     this._methodName = t;
-}, xn = /** @class */ function() {
+}, jn = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -4155,8 +4174,8 @@ function(t) {
      * @param longitude - The longitude as number between -180 and 180.
      */
     function t(t, e) {
-        if (!isFinite(t) || t < -90 || t > 90) throw new B(V, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new B(V, "Longitude must be a number between -180 and 180, but was: " + e);
+        if (!isFinite(t) || t < -90 || t > 90) throw new B(O, "Latitude must be a number between -90 and 90, but was: " + t);
+        if (!isFinite(e) || e < -180 || e > 180) throw new B(O, "Longitude must be a number between -180 and 180, but was: " + e);
         this._lat = t, this._long = e;
     }
     return Object.defineProperty(t.prototype, "latitude", {
@@ -4198,23 +4217,23 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return Tt(this._lat, t._lat) || Tt(this._long, t._long);
+        return Et(this._lat, t._lat) || Et(this._long, t._long);
     }, t;
-}(), jn = /^__.*__$/, Ln = /** @class */ function() {
+}(), Ln = /^__.*__$/, Mn = /** @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 je(t, this.data, this.fieldMask, e, this.fieldTransforms) : new xe(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new Le(t, this.data, this.fieldMask, e, this.fieldTransforms) : new je(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), Mn = /** @class */ function() {
+}(), Un = /** @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 je(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new Le(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -4240,7 +4259,7 @@ function(t) {
  *
  * Latitude values are in the range of [-90, 90].
  * Longitude values are in the range of [-180, 180].
- */ function Un(t) {
+ */ function Bn(t) {
     switch (t) {
       case 0 /* UserDataSource.Set */ :
  // fall through
@@ -4258,7 +4277,7 @@ function(t) {
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Bn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var zn = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4318,7 +4337,7 @@ function(t) {
             st: !0
         });
     }, t.prototype.ct = function(t) {
-        return sr(t, this.settings.methodName, this.settings.at || !1, this.path, this.settings.ht);
+        return cr(t, this.settings.methodName, this.settings.at || !1, this.path, this.settings.ht);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -4332,15 +4351,15 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.it(this.path.get(t));
     }, t.prototype.it = function(t) {
         if (0 === t.length) throw this.ct("Document fields must not be empty");
-        if (Un(this.et) && jn.test(t)) throw this.ct('Document fields cannot begin and end with "__"');
+        if (Bn(this.et) && Ln.test(t)) throw this.ct('Document fields cannot begin and end with "__"');
     }, t;
-}(), zn = /** @class */ function() {
+}(), Qn = /** @class */ function() {
     function t(t, e, n) {
-        this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || ln(t)
+        this.databaseId = t, this.ignoreUndefinedProperties = e, this.serializer = n || fn(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.lt = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new Bn({
+        return void 0 === r && (r = !1), new zn({
             et: t,
             methodName: e,
             ht: n,
@@ -4354,30 +4373,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 = ln(t._databaseId);
-    return new zn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function Kn(t) {
+    var e = t._freezeSettings(), n = fn(t._databaseId);
+    return new Qn(t._databaseId, !!e.ignoreUndefinedProperties, n);
 }
 
-/** Parse document data from a set() call. */ function Kn(t, e, n, r, i, o) {
+/** Parse document data from a set() call. */ function Gn(t, e, n, r, i, o) {
     void 0 === o && (o = {});
     var a = t.lt(o.merge || o.mergeFields ? 2 /* UserDataSource.MergeSet */ : 0 /* UserDataSource.Set */ , e, n, i);
-    ir("Data must be an object, but it was:", a, r);
-    var u, s, c = nr(r, a);
-    if (o.merge) u = new me(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
+    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) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
-            var p = or(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."));
-            cr(l, p) || l.push(p);
+            var p = ar(e, h[f], n);
+            if (!a.contains(p)) throw new B(O, "Field '".concat(p, "' is specified in your field mask but missing from your input data."));
+            lr(l, p) || l.push(p);
         }
-        u = new me(l), s = a.fieldTransforms.filter((function(t) {
+        u = new ve(l), s = a.fieldTransforms.filter((function(t) {
             return u.covers(t.field);
         }));
     } else u = null, s = a.fieldTransforms;
-    return new Ln(new ve(c), u, s);
+    return new Mn(new ge(c), u, s);
 }
 
-var Gn = /** @class */ function(e) {
+var Wn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4406,8 +4425,8 @@ var Gn = /** @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 Bn({
+ */ function Yn(t, e, n) {
+    return new zn({
         et: 3 /* UserDataSource.Argument */ ,
         ht: e.settings.ht,
         methodName: t._methodName,
@@ -4415,101 +4434,101 @@ var Gn = /** @class */ function(e) {
     }, e.databaseId, e.serializer, e.ignoreUndefinedProperties);
 }
 
-var Yn = /** @class */ function(e) {
+var Hn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        return new qe(t.path, new Ve);
+        return new Re(t.path, new Ve);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(Cn), Hn = /** @class */ function(e) {
+}(Cn), Jn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ft = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Wn(this, t, 
+        var e = Yn(this, t, 
         /*array=*/ !0), n = this.ft.map((function(t) {
-            return er(t, e);
+            return nr(t, e);
         })), r = new De(n);
-        return new qe(t.path, r);
+        return new Re(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(Cn), Jn = /** @class */ function(e) {
+}(Cn), Xn = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).ft = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = Wn(this, t, 
+        var e = Yn(this, t, 
         /*array=*/ !0), n = this.ft.map((function(t) {
-            return er(t, e);
-        })), r = new Oe(n);
-        return new qe(t.path, r);
+            return nr(t, e);
+        })), r = new Ne(n);
+        return new Re(t.path, r);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
-}(Cn), Xn = /** @class */ function(e) {
+}(Cn), $n = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this, t) || this).dt = n, r;
     }
     return t(n, e), n.prototype._toFieldTransform = function(t) {
-        var e = new Ne(t.serializer, Fe(t.serializer, this.dt));
-        return new qe(t.path, e);
+        var e = new qe(t.serializer, Fe(t.serializer, this.dt));
+        return new Re(t.path, e);
     }, n.prototype.isEqual = function(t) {
         // TODO(mrschmidt): Implement isEquals
         return this === t;
     }, n;
 }(Cn);
 
-/** Parse update data from an update() call. */ function $n(t, e, n, r) {
+/** Parse update data from an update() call. */ function Zn(t, e, n, r) {
     var i = t.lt(1 /* UserDataSource.Update */ , e, n);
-    ir("Data must be an object, but it was:", i, r);
-    var o = [], a = ve.empty();
-    kt(r, (function(t, r) {
-        var u = ur(e, t, n);
+    or("Data must be an object, but it was:", i, r);
+    var o = [], a = ge.empty();
+    It(r, (function(t, r) {
+        var u = sr(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = p(r);
         var s = i.ot(u);
-        if (r instanceof Gn) 
+        if (r instanceof Wn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(u); else {
-            var c = er(r, s);
+            var c = nr(r, s);
             null != c && (o.push(u), a.set(u, c));
         }
     }));
-    var u = new me(o);
-    return new Mn(a, u, i.fieldTransforms);
+    var u = new ve(o);
+    return new Un(a, u, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function Zn(t, e, n, r, i, o) {
-    var a = t.lt(1 /* UserDataSource.Update */ , e, n), u = [ or(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(or(e, o[c])), s.push(o[c + 1]);
+/** Parse update data from a list of field/value arguments. */ function tr(t, e, n, r, i, o) {
+    var a = t.lt(1 /* UserDataSource.Update */ , e, n), u = [ ar(e, r, n) ], s = [ i ];
+    if (o.length % 2 != 0) throw new B(O, "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]);
     // 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 = ve.empty(), h = u.length - 1; h >= 0; --h) if (!cr(l, u[h])) {
+    for (var l = [], f = ge.empty(), h = u.length - 1; h >= 0; --h) if (!lr(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.ot(d);
-        if (y instanceof Gn) 
+        if (y instanceof Wn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(d); else {
-            var v = er(y, m);
+            var v = nr(y, m);
             null != v && (l.push(d), f.set(d, v));
         }
     }
-    var g = new me(l);
-    return new Mn(f, g, a.fieldTransforms);
+    var g = new ve(l);
+    return new Un(f, g, a.fieldTransforms);
 }
 
 /**
@@ -4518,8 +4537,8 @@ var Yn = /** @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 tr(t, e, n, r) {
-    return void 0 === r && (r = !1), er(n, t.lt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function er(t, e, n, r) {
+    return void 0 === r && (r = !1), nr(n, t.lt(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -4530,11 +4549,11 @@ var Yn = /** @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 er(t, e) {
-    if (rr(
+ */ function nr(t, e) {
+    if (ir(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = p(t))) return ir("Unsupported field value:", e, t), nr(t, e);
+    t = p(t))) return or("Unsupported field value:", e, t), rr(t, e);
     if (t instanceof Cn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
@@ -4547,7 +4566,7 @@ var Yn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Un(e.et)) throw e.ct("".concat(t._methodName, "() can only be used with update() and set()"));
+        if (!Bn(e.et)) throw e.ct("".concat(t._methodName, "() can only be used with update() and set()"));
         if (!e.path) throw e.ct("".concat(t._methodName, "() is not currently supported inside arrays"));
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -4570,7 +4589,7 @@ var Yn = /** @class */ function(e) {
         if (e.settings.st && 4 /* UserDataSource.ArrayArgument */ !== e.et) throw e.ct("Nested arrays are not supported");
         return function(t, e) {
             for (var n = [], r = 0, i = 0, o = t; i < o.length; i++) {
-                var a = er(o[i], e.ut(r));
+                var a = nr(o[i], e.ut(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4597,41 +4616,41 @@ var Yn = /** @class */ function(e) {
             stringValue: t
         };
         if (t instanceof Date) {
-            var n = Ot.fromDate(t);
+            var n = Nt.fromDate(t);
             return {
-                timestampValue: Ke(e.serializer, n)
+                timestampValue: Ge(e.serializer, n)
             };
         }
-        if (t instanceof Ot) {
+        if (t instanceof Nt) {
             // 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 Nt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Ke(e.serializer, r)
+                timestampValue: Ge(e.serializer, r)
             };
         }
-        if (t instanceof xn) return {
+        if (t instanceof jn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof Nn) return {
-            bytesValue: Ge(e.serializer, t._byteString)
+        if (t instanceof qn) return {
+            bytesValue: We(e.serializer, t._byteString)
         };
-        if (t instanceof kn) {
+        if (t instanceof In) {
             var i = e.databaseId, o = t.firestore._databaseId;
             if (!o.isEqual(i)) throw e.ct("Document reference is for database ".concat(o.projectId, "/").concat(o.database, " but should be for database ").concat(i.projectId, "/").concat(i.database));
             return {
-                referenceValue: He(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: Je(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
         throw e.ct("Unsupported field value: ".concat(st(t)));
     }(t, e);
 }
 
-function nr(t, e) {
+function rr(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -4639,8 +4658,8 @@ function nr(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) : kt(t, (function(t, r) {
-        var i = er(r, e.rt(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : It(t, (function(t, r) {
+        var i = nr(r, e.rt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -4649,12 +4668,12 @@ function nr(t, e) {
     };
 }
 
-function rr(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Ot || t instanceof xn || t instanceof Nn || t instanceof kn || t instanceof Cn);
+function ir(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Nt || t instanceof jn || t instanceof qn || t instanceof In || t instanceof Cn);
 }
 
-function ir(t, e, n) {
-    if (!rr(n) || !function(t) {
+function or(t, e, n) {
+    if (!ir(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
         var r = st(n);
@@ -4664,20 +4683,20 @@ function ir(t, e, n) {
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function or(t, e, n) {
+ */ function ar(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = p(e)) instanceof qn) return e._internalPath;
-    if ("string" == typeof e) return ur(t, e);
-    throw sr("Field path arguments must be of type string or ", t, 
+    (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, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
 }
 
 /**
  * Matches any characters in a field path string that are reserved.
- */ var ar = new RegExp("[~\\*/\\[\\]]");
+ */ var ur = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4687,29 +4706,29 @@ function ir(t, e, n) {
  * split on dots.
  * @param targetDoc - The document against which the field path will be
  * evaluated.
- */ function ur(t, e, n) {
-    if (e.search(ar) >= 0) throw sr("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
+ */ function sr(t, e, n) {
+    if (e.search(ur) >= 0) throw cr("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (qn.bind.apply(qn, r([ void 0 ], e.split("."), !1))))._internalPath;
+        return (new (Rn.bind.apply(Rn, r([ void 0 ], e.split("."), !1))))._internalPath;
     } catch (r) {
-        throw sr("Invalid field path (".concat(e, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"), t, 
+        throw cr("Invalid field path (".concat(e, "). Paths must not be empty, begin with '.', end with '.', or contain '..'"), t, 
         /* hasConverter= */ !1, 
         /* path= */ void 0, n);
     }
 }
 
-function sr(t, e, n, r, i) {
+function cr(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 = "";
     return (o || a) && (s += " (found", o && (s += " in field ".concat(r)), a && (s += " in document ".concat(i)), 
-    s += ")"), new B(V, u + t + s)
+    s += ")"), new B(O, u + t + s)
     /** Checks `haystack` if FieldPath `needle` is present. Runs in O(n). */;
 }
 
-function cr(t, e) {
+function lr(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4739,7 +4758,7 @@ function cr(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 lr = /** @class */ function() {
+ */ var fr = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4760,7 +4779,7 @@ function cr(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new kn(this._firestore, this._converter, this._key);
+            return new In(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4785,7 +4804,7 @@ function cr(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 fr(this._firestore, this._userDataWriter, this._key, this._document, 
+                var t = new hr(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4805,11 +4824,11 @@ function cr(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(dr("DocumentSnapshot.get", t));
+            var e = this._document.data.field(yr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), fr = /** @class */ function(e) {
+}(), hr = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4821,7 +4840,7 @@ function cr(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(lr), hr = /** @class */ function() {
+}(fr), pr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4875,15 +4894,15 @@ function cr(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function pr(t, e) {
-    return t = p(t), e = p(e), t instanceof lr && e instanceof lr ? 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 hr && e instanceof hr && On(t.query, e.query) && Et(t.docs, e.docs, pr)
+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 && Nn(t.query, e.query) && St(t.docs, e.docs, dr)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function dr(t, e) {
-    return "string" == typeof e ? ur(t, e) : e instanceof qn ? e._internalPath : e._delegate._internalPath;
+function yr(t, e) {
+    return "string" == typeof e ? sr(t, e) : e instanceof Rn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4905,12 +4924,12 @@ function dr(t, e) {
 /**
  * An `AppliableConstraint` is an abstraction of a constraint that can be applied
  * to a Firestore query.
- */ var yr = function() {}, mr = /** @class */ function(e) {
+ */ var mr = function() {}, vr = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(yr);
+}(mr);
 
 /**
  * A `QueryConstraint` is used to narrow the set of documents returned by a
@@ -4919,16 +4938,16 @@ function dr(t, e) {
  * (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 vr(t, e) {
+ */ function gr(t, e) {
     for (var n = [], r = 2; r < arguments.length; r++) n[r - 2] = arguments[r];
     var i = [];
-    e instanceof yr && i.push(e), function(t) {
+    e instanceof mr && i.push(e), function(t) {
         var e = t.filter((function(t) {
-            return t instanceof _r;
+            return t instanceof br;
         })).length, n = t.filter((function(t) {
-            return t instanceof gr;
+            return t instanceof wr;
         })).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(...)))`.");
+        if (e > 1 || e > 0 && n > 0) throw new B(O, "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));
     for (var o = 0, a = i; o < a.length; o++) {
         var u = a[o];
@@ -4943,7 +4962,7 @@ function dr(t, e) {
  * `QueryFieldFilterConstraint`s are created by invoking {@link where} and can then
  * be passed to {@link (query:1)} to create a new query instance that also contains
  * this `QueryFieldFilterConstraint`.
- */ var gr = /** @class */ function(e) {
+ */ var wr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -4957,32 +4976,32 @@ function dr(t, e) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
-        return xr(t._query, e), new In(t.firestore, t.converter, Ae(t._query, e));
+        return jr(t._query, e), new An(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 = Kn(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 ("array-contains" /* Operator.ARRAY_CONTAINS */ === o || "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === o) throw new B(O, "Invalid Query. You can't perform '".concat(o, "' queries on documentId()."));
                 if ("in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o) {
                     Cr(a, o);
                     for (var s = [], c = 0, l = a; c < l.length; c++) {
                         var f = l[c];
-                        s.push(Rr(r, t, f));
+                        s.push(xr(r, t, f));
                     }
                     u = {
                         arrayValue: {
                             values: s
                         }
                     };
-                } else u = Rr(r, t, 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 || Cr(a, o), 
-            u = tr(n, "where", a, 
+            u = er(n, "where", a, 
             /* allowArrays= */ "in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o);
-            return Xt.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;
-}(mr);
+}(vr);
 
 /**
  * Creates a {@link QueryFieldFilterConstraint} that enforces that documents
@@ -4994,9 +5013,9 @@ function dr(t, e) {
  *   "&lt;=", "!=").
  * @param value - The value for comparison
  * @returns The created {@link QueryFieldFilterConstraint}.
- */ function wr(t, e, n) {
-    var r = e, i = dr("where", t);
-    return gr._create(i, r, n);
+ */ function _r(t, e, n) {
+    var r = e, i = yr("where", t);
+    return wr._create(i, r, n);
 }
 
 /**
@@ -5006,7 +5025,7 @@ function dr(t, e) {
  * `QueryCompositeFilterConstraint`s are created by invoking {@link or} or
  * {@link and} and can then be passed to {@link (query:1)} to create a new query
  * instance that also contains the `QueryCompositeFilterConstraint`.
- */ var _r = /** @class */ function(e) {
+ */ var br = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5024,21 +5043,21 @@ function dr(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] : Zt.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];
-                xr(n, o), n = Ae(n, o);
+                jr(n, o), n = Pe(n, o);
             }
-        }(t._query, e), new In(t.firestore, t.converter, Ae(t._query, e)));
+        }(t._query, e), new An(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;
-}(yr);
+}(mr);
 
 /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of
@@ -5049,12 +5068,12 @@ function dr(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}.
- */ function br() {
+ */ function Tr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return Lr("or", t);
-    })), _r._create("or" /* CompositeOperator.OR */ , t)
+        return Mr("or", t);
+    })), br._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
@@ -5067,12 +5086,12 @@ function dr(t, e) {
  */;
 }
 
-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 Lr("and", t);
-    })), _r._create("and" /* CompositeOperator.AND */ , t)
+        return Mr("and", t);
+    })), br._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
@@ -5084,7 +5103,7 @@ function Tr() {
  */;
 }
 
-var Er = /** @class */ function(e) {
+var Sr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5098,24 +5117,24 @@ var Er = /** @class */ function(e) {
         return new n(t, e);
     }, n.prototype._apply = function(t) {
         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 se(e, n);
+            if (null !== t.startAt) throw new B(O, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
+            if (null !== t.endAt) throw new B(O, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
+            var r = new ce(e, n);
             return function(t, e) {
-                if (null === Te(t)) {
+                if (null === Ee(t)) {
                     // This is the first order by. It must match any inequality.
-                    var n = Ee(t);
-                    null !== n && jr(t, n, e.field);
+                    var n = Se(t);
+                    null !== n && Lr(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 An(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 be(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
+            return new Te(t.path, t.collectionGroup, n, t.filters.slice(), t.limit, t.limitType, t.startAt, t.endAt);
         }(t._query, e));
     }, n;
-}(mr);
+}(vr);
 
 /**
  * Creates a {@link QueryOrderByConstraint} that sorts the query result by the
@@ -5128,10 +5147,10 @@ var Er = /** @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 Sr(t, e) {
+ */ function kr(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = dr("orderBy", t);
-    return Er._create(r, n);
+    var n = e, r = yr("orderBy", t);
+    return Sr._create(r, n);
 }
 
 /**
@@ -5140,7 +5159,7 @@ var Er = /** @class */ function(e) {
  * `QueryLimitConstraint`s are created by invoking {@link limit} or
  * {@link limitToLast} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryLimitConstraint`.
- */ var kr = /** @class */ function(e) {
+ */ var Ir = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5153,11 +5172,11 @@ var Er = /** @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 be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new An(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);
         }(t._query, this._limit, this._limitType));
     }, n;
-}(mr);
+}(vr);
 
 /**
  * Creates a {@link QueryLimitConstraint} that only returns the first matching
@@ -5165,8 +5184,8 @@ var Er = /** @class */ function(e) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Ir(t) {
-    return lt("limit", t), kr._create("limit", t, "F" /* LimitType.First */)
+ */ function Ar(t) {
+    return lt("limit", t), Ir._create("limit", t, "F" /* LimitType.First */)
     /**
  * Creates a {@link QueryLimitConstraint} that only returns the last matching
  * documents.
@@ -5179,8 +5198,8 @@ var Er = /** @class */ function(e) {
  */;
 }
 
-function Ar(t) {
-    return lt("limitToLast", t), kr._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.
@@ -5204,14 +5223,14 @@ var Fr = /** @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 = qr(t, this.type, this._docOrFields, this._inclusive);
-        return new In(t.firestore, t.converter, function(t, e) {
-            return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        var e = Rr(t, this.type, this._docOrFields, this._inclusive);
+        return new An(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);
         }(t._query, e));
     }, n;
-}(mr);
+}(vr);
 
-function Pr() {
+function Or() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     return Fr._create("startAt", t, 
     /*inclusive=*/ !0);
@@ -5243,28 +5262,28 @@ function Vr() {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = qr(t, this.type, this._docOrFields, this._inclusive);
-        return new In(t.firestore, t.converter, function(t, e) {
-            return new be(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        var e = Rr(t, this.type, this._docOrFields, this._inclusive);
+        return new An(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);
         }(t._query, e));
     }, n;
-}(mr);
+}(vr);
 
-function Or() {
+function Nr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     return Dr._create("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function Nr() {
+function qr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     return Dr._create("endAt", t, 
     /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function qr(t, e, n, r) {
-    if (n[0] = p(n[0]), n[0] instanceof lr) return function(t, e, n, r, i) {
-        if (!r) throw new B(O, "Can't use a DocumentSnapshot that doesn't exist for ".concat(n, "()."));
+/** 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) {
+        if (!r) throw new B(D, "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
         // sort order, because it's guaranteed to contain the document key. That way
@@ -5272,60 +5291,60 @@ function Nr() {
         // 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 = ke(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(Bt(e, r.key)); else {
+            if (s.field.isKeyField()) o.push(zt(e, r.key)); else {
                 var c = r.data.field(s.field);
-                if (Nt(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 (qt(c)) throw new B(O, '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."));
+                    throw new B(O, "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."));
                 }
                 o.push(c);
             }
         }
-        return new Yt(o, i);
+        return new Ht(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = Qn(t.firestore);
+    var i = Kn(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;
-        if (i.length > a.length) throw new B(V, "Too many arguments provided to ".concat(r, "(). The number of arguments must be less than or equal to the number of orderBy() clauses"));
+        if (i.length > a.length) throw new B(O, "Too many arguments provided to ".concat(r, "(). The number of arguments must be less than or equal to the number of orderBy() clauses"));
         for (var u = [], s = 0; s < i.length; s++) {
             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 (!Se(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 ("string" != typeof c) throw new B(O, "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(O, "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."));
+                if (!it.isDocumentKey(l)) throw new B(O, "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(Bt(e, f));
+                u.push(zt(e, f));
             } else {
-                var h = tr(n, r, c);
+                var h = er(n, r, c);
                 u.push(h);
             }
         }
-        return new Yt(u, o);
+        return new Ht(u, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function Rr(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 (!Se(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 ("" === n) throw new B(O, "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(O, "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 Bt(t, new it(r));
+        if (!it.isDocumentKey(r)) throw new B(O, "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));
     }
-    if (n instanceof kn) return Bt(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), "."));
+    if (n instanceof In) return zt(t, n._key);
+    throw new B(O, "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 Cr(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."));
+    if (!Array.isArray(t) || 0 === t.length) throw new B(O, "Invalid Query. A non-empty array is required for '".concat(e.toString(), "' filters."));
 }
 
 /**
@@ -5337,12 +5356,12 @@ function Rr(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 xr(t, e) {
+ */ function jr(t, e) {
     if (e.isInequality()) {
-        var n = Ee(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 = Te(t);
-        null !== i && jr(t, r, i);
+        var n = Se(t), r = e.field;
+        if (null !== n && !n.isEqual(r)) throw new B(O, "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 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++) {
@@ -5368,15 +5387,15 @@ function Rr(t, e, n) {
     }(e.op));
     if (null !== o) 
     // Special case when it's a duplicate op to give a slightly clearer error message.
-    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."));
+    throw o === e.op ? new B(O, "Invalid query. You cannot use more than one '".concat(e.op.toString(), "' filter.")) : new B(O, "Invalid query. You cannot use '".concat(e.op.toString(), "' filters with '").concat(o.toString(), "' filters."));
 }
 
-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 Lr(t, e, n) {
+    if (!n.isEqual(e)) throw new B(O, "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 Lr(t, e) {
-    if (!(e instanceof gr || e instanceof _r)) throw new B(V, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
+function Mr(t, e) {
+    if (!(e instanceof wr || e instanceof br)) throw new B(O, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
 }
 
 /**
@@ -5403,28 +5422,28 @@ function Lr(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 Mr(t, e, n) {
+ */ function Ur(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 Ur = /** @class */ function(e) {
+var Br = /** @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 Nn(t);
+        return new qn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new kn(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"), xt(t)) {
+        switch (void 0 === e && (e = "none"), jt(t)) {
           case 0 /* TypeOrder.NullValue */ :
             return null;
 
@@ -5471,11 +5490,11 @@ var Ur = /** @class */ function(e) {
         var n = this;
         void 0 === e && (e = "none");
         var r = {};
-        return kt(t, (function(t, i) {
+        return It(t, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new xn(Vt(t.latitude), Vt(t.longitude));
+        return new jn(Vt(t.latitude), Vt(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -5484,21 +5503,21 @@ var Ur = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = qt(t);
+            var n = Rt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Rt(t));
+            return this.convertTimestamp(xt(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = Pt(t);
-        return new Ot(e.seconds, e.nanos);
+        var e = Ot(t);
+        return new Nt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
         var n = et.fromString(t);
-        I(cn(n));
+        I(ln(n));
         var r = new Z(n.get(1), n.get(3)), i = new it(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
@@ -5519,12 +5538,12 @@ var Ur = /** @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 Br(t) {
-    var e = mn((t = ct(t, kn)).firestore), n = new Ur(t.firestore);
-    return dn(e, [ t._key ]).then((function(e) {
+ */ function zr(t) {
+    var e = vn((t = ct(t, In)).firestore), n = new Br(t.firestore);
+    return yn(e, [ t._key ]).then((function(e) {
         I(1 === e.length);
         var r = e[0];
-        return new lr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
+        return new fr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5539,18 +5558,18 @@ var Ur = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function zr(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 = mn(t.firestore), i = new Ur(t.firestore);
+    }((t = ct(t, An))._query);
+    var r = vn(t.firestore), i = new Br(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 = A(t), i = en(e.serializer, Ie(r)), [ 4 /*yield*/ , e.R("RunQuery", i.parent, {
+                    return e = A(t), i = nn(e.serializer, Ae(r)), [ 4 /*yield*/ , e.R("RunQuery", i.parent, {
                         structuredQuery: i.structuredQuery
                     }) ];
 
@@ -5559,12 +5578,12 @@ var Ur = /** @class */ function(e) {
                         return !!t.document;
                     })).map((function(t) {
                         return function(t, e, n) {
-                            var r = Xe(t, e.name), i = Ye(e.updateTime), o = e.createTime ? Ye(e.createTime) : le.min(), a = new ve({
+                            var r = $e(t, e.name), i = He(e.updateTime), o = e.createTime ? He(e.createTime) : fe.min(), a = new ge({
                                 mapValue: {
                                     fields: e.fields
                                 }
                             });
-                            return ge.newFoundDocument(r, i, o, a);
+                            return we.newFoundDocument(r, i, o, a);
                         }(e.serializer, t.document);
                     })) ];
                 }
@@ -5572,28 +5591,28 @@ var Ur = /** @class */ function(e) {
         }));
     }(r, t._query).then((function(e) {
         var n = e.map((function(e) {
-            return new fr(t.firestore, i, e.key, e, t.converter);
+            return new hr(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 hr(t, n);
+        n.reverse(), new pr(t, n);
     }));
 }
 
-function Qr(t, e, n) {
-    var r = Mr((t = ct(t, kn)).converter, e, n), i = Kn(Qn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return pn(mn(t.firestore), [ i.toMutation(t._key, Re.none()) ]);
+function Kr(t, e, n) {
+    var r = Ur((t = ct(t, In)).converter, e, n), i = Gn(Kn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return dn(vn(t.firestore), [ i.toMutation(t._key, xe.none()) ]);
 }
 
-function Kr(t, e, n) {
+function Gr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = Qn((t = ct(t, kn)).firestore);
+    var o, a = Kn((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 qn ? Zn(a, "updateDoc", t._key, e, n, r) : $n(a, "updateDoc", t._key, e), 
-    pn(mn(t.firestore), [ o.toMutation(t._key, Re.exists(!0)) ]);
+        return o = "string" == typeof (e = p(e)) || e instanceof Rn ? tr(a, "updateDoc", t._key, e, n, r) : Zn(a, "updateDoc", t._key, e), 
+    dn(vn(t.firestore), [ o.toMutation(t._key, xe.exists(!0)) ]);
 }
 
 /**
@@ -5607,8 +5626,8 @@ function Kr(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 Gr(t) {
-    return pn(mn((t = ct(t, kn)).firestore), [ new Le(t._key, Re.none()) ]);
+ */ function Wr(t) {
+    return dn(vn((t = ct(t, In)).firestore), [ new Me(t._key, xe.none()) ]);
 }
 
 /**
@@ -5625,9 +5644,9 @@ function Kr(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 = Vn(t = ct(t, An)), r = Mr(t.converter, e), i = Kn(Qn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return pn(mn(t.firestore), [ i.toMutation(n._key, Re.exists(!1)) ]).then((function() {
+ */ function Yr(t, e) {
+    var n = Vn(t = ct(t, Pn)), r = Ur(t.converter, e), i = Gn(Kn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return dn(vn(t.firestore), [ i.toMutation(n._key, xe.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -5661,9 +5680,9 @@ function Kr(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 Yr(t) {
-    return Hr(t, {
-        count: $r()
+ */ function Hr(t) {
+    return Jr(t, {
+        count: Zr()
     });
 }
 
@@ -5693,13 +5712,13 @@ function Kr(t, e, n) {
  * const averageScore: number | null = aggregateSnapshot.data().averageScore;
  * ```
  * @internal TODO (sum/avg) remove when public
- */ function Hr(t, r) {
-    var i = ct(t.firestore, gn), o = mn(i), a = function(t, e) {
+ */ function Jr(t, r) {
+    var i = ct(t.firestore, wn), o = vn(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 wt(e, t._aggregateType, t._internalFieldPath);
+        return new _t(e, t._aggregateType, t._internalFieldPath);
     }));
     // Run the aggregation and convert the results
         return function(t, r, i) {
@@ -5709,7 +5728,7 @@ function Kr(t, e, n) {
                 switch (n.label) {
                   case 0:
                     return o = A(t), a = function(t, e, n) {
-                        var r = en(t, e), i = {}, o = [], a = 0;
+                        var r = nn(t, e), i = {}, o = [], a = 0;
                         return n.forEach((function(t) {
                             // Map all client-side aliases to a unique short-form
                             // alias. This avoids issues with client-side aliases that
@@ -5721,12 +5740,12 @@ function Kr(t, e, n) {
                             }) : "avg" === t.$ ? o.push({
                                 alias: e,
                                 avg: {
-                                    field: an(t.fieldPath)
+                                    field: un(t.fieldPath)
                                 }
                             }) : "sum" === t.$ && o.push({
                                 alias: e,
                                 sum: {
-                                    field: an(t.fieldPath)
+                                    field: un(t.fieldPath)
                                 }
                             });
                         })), {
@@ -5739,7 +5758,7 @@ function Kr(t, e, n) {
                             },
                             Z: i
                         };
-                    }(o.serializer, Ie(r), i), u = a.request, s = a.Z, c = u.parent, o.connection.g || delete u.parent, 
+                    }(o.serializer, Ae(r), i), u = a.request, s = a.Z, c = u.parent, o.connection.g || delete u.parent, 
                     [ 4 /*yield*/ , o.R("RunAggregationQuery", c, u, /*expectedResponseCount=*/ 1) ];
 
                   case 1:
@@ -5756,14 +5775,14 @@ function Kr(t, e, n) {
         }));
     }(o, t._query, a).then((function(e) {
         return function(t, e, n) {
-            var r = new Ur(t);
-            return new Sn(e, r, n);
+            var r = new Br(t);
+            return new kn(e, r, n);
         }(i, t, e);
     }));
 }
 
-function Jr(t) {
-    return new En("sum", or("sum", t));
+function Xr(t) {
+    return new Sn("sum", ar("sum", t));
 }
 
 /**
@@ -5771,16 +5790,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 Xr(t) {
-    return new En("avg", or("average", t));
+ */ function $r(t) {
+    return new Sn("avg", ar("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 En("count");
+ */ function Zr() {
+    return new Sn("count");
 }
 
 /**
@@ -5789,9 +5808,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 Zr(t, e) {
+ */ function ti(t, e) {
     var n, r;
-    return t instanceof En && e instanceof En && 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 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());
 }
 
 /**
@@ -5805,8 +5824,8 @@ function Jr(t) {
  *
  * @returns `true` if the objects are "equal", as defined above, or `false`
  * otherwise.
- */ function ti(t, e) {
-    return On(t.query, e.query) && m(t.data(), e.data());
+ */ function ei(t, e) {
+    return Nn(t.query, e.query) && m(t.data(), e.data());
 }
 
 /**
@@ -5828,15 +5847,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 ei() {
-    return new Gn("deleteField");
+ */ function ni() {
+    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 ni() {
-    return new Yn("serverTimestamp");
+ */ function ri() {
+    return new Hn("serverTimestamp");
 }
 
 /**
@@ -5850,11 +5869,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 ri() {
+ */ function ii() {
     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 Hn("arrayUnion", t);
+        return new Jn("arrayUnion", t);
 }
 
 /**
@@ -5867,11 +5886,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 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 Jn("arrayRemove", t);
+        return new Xn("arrayRemove", t);
 }
 
 /**
@@ -5892,8 +5911,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 oi(t) {
-    return new Xn("increment", t);
+ */ function ai(t) {
+    return new $n("increment", t);
 }
 
 /**
@@ -5919,24 +5938,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 ai = /** @class */ function() {
+ */ var ui = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Qn(t);
+        this._dataReader = Kn(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = ui(t, this._firestore), i = Mr(r.converter, e, n), o = Kn(this._dataReader, "WriteBatch.set", r._key, i, null !== r.converter, n);
-        return this._mutations.push(o.toMutation(r._key, Re.none())), this;
+        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, 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 = ui(t, this._firestore);
+        var o, a = si(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 qn ? Zn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : $n(this._dataReader, "WriteBatch.update", a._key, e), 
-        this._mutations.push(o.toMutation(a._key, Re.exists(!0))), this;
+                return o = "string" == typeof (e = p(e)) || e instanceof Rn ? tr(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Zn(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}.
@@ -5946,8 +5965,8 @@ function Jr(t) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = ui(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Le(e._key, Re.none())), this;
+        var e = si(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Me(e._key, xe.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5964,12 +5983,12 @@ function Jr(t) {
     t.prototype.commit = function() {
         return this._verifyNotCommitted(), this._committed = !0, this._mutations.length > 0 ? this._commitHandler(this._mutations) : Promise.resolve();
     }, t.prototype._verifyNotCommitted = function() {
-        if (this._committed) throw new B(C, "A write batch can no longer be used after commit() has been called.");
+        if (this._committed) throw new B(x, "A write batch can no longer be used after commit() has been called.");
     }, t;
 }();
 
-function ui(t, e) {
-    if ((t = p(t)).firestore !== e) throw new B(V, "Provided document reference is from a different Firestore instance.");
+function si(t, e) {
+    if ((t = p(t)).firestore !== e) throw new B(O, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -5985,10 +6004,10 @@ function ui(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function si(t) {
-    var e = mn(t = ct(t, gn));
-    return new ai(t, (function(t) {
-        return pn(e, t);
+ */ function ci(t) {
+    var e = vn(t = ct(t, wn));
+    return new ui(t, (function(t) {
+        return dn(e, t);
     }));
 }
 
@@ -6011,7 +6030,7 @@ function ui(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var ci = /** @class */ function() {
+ */ var li = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -6035,8 +6054,8 @@ function ui(t, e) {
             return n(this, (function(n) {
                 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*/ , dn(this.datastore, t) ];
+                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw new B(O, "Firestore transactions require all reads to be executed before all writes.");
+                    return [ 4 /*yield*/ , yn(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -6055,7 +6074,7 @@ function ui(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Le(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Me(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;
@@ -6072,8 +6091,8 @@ function ui(t, e) {
                     // a `verify` operation.
                     t.forEach((function(t, n) {
                         var r = it.fromPath(n);
-                        e.mutations.push(new Me(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , pn(this.datastore, this.mutations) ];
+                        e.mutations.push(new Ue(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , dn(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -6086,13 +6105,13 @@ function ui(t, e) {
         if (t.isFoundDocument()) e = t.version; else {
             if (!t.isNoDocument()) throw k();
             // Represent a deleted doc using SnapshotVersion.min().
-                        e = le.min();
+                        e = fe.min();
         }
         var n = this.readVersions.get(t.key.toString());
         if (n) {
             if (!e.isEqual(n)) 
             // This transaction will fail no matter what.
-            throw new B(x, "Document version changed between two reads.");
+            throw new B(C, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -6101,7 +6120,7 @@ function ui(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(le.min()) ? Re.exists(!1) : Re.updateTime(e) : Re.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(fe.min()) ? xe.exists(!1) : xe.updateTime(e) : xe.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -6111,7 +6130,7 @@ function ui(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(le.min())) 
+            if (e.isEqual(fe.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
@@ -6121,22 +6140,22 @@ function ui(t, e) {
             // express that to the backend, we have to validate locally.
             // Note: this can change once we can send separate verify writes in the
             // transaction.
-            throw new B(V, "Can't update a document that doesn't exist.");
+            throw new B(O, "Can't update a document that doesn't exist.");
             // Document exists, base precondition on document update time.
-                        return Re.updateTime(e);
+                        return xe.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return Re.exists(!0);
+                return xe.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), li = {
+}(), fi = {
     maxAttempts: 5
-}, fi = /** @class */ function() {
+}, hi = /** @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.wt = n.maxAttempts, this.yt = new fn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
+        this.deferred = i, this.wt = n.maxAttempts, this.yt = new hn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.run = function() {
@@ -6147,7 +6166,7 @@ function ui(t, e) {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new ci(this.datastore), (e = this._t(t)) && e.then((function(e) {
+                    return t = new li(this.datastore), (e = this._t(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -6164,7 +6183,7 @@ function ui(t, e) {
     }, t.prototype._t = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !ht(e) && e.catch && e.then ? e : (this.deferred.reject(Error("Transaction callback must return a Promise")), 
+            return !pt(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.
@@ -6192,9 +6211,9 @@ function ui(t, e) {
                   default:
                     return k();
 
-                  case F:
                   case P:
-                  case D:
+                  case F:
+                  case V:
                   case R:
                   case M:
                   case U:
@@ -6203,15 +6222,15 @@ function ui(t, e) {
                                       case q:
                     return !1;
 
-                  case V:
                   case O:
+                  case D:
                   case "already-exists":
                   case N:
-                  case C:
+                  case x:
  // Aborted might be retried in some scenarios, but that is dependant on
                     // the context and should handled individually by the calling code.
                     // See https://cloud.google.com/apis/design/errors.
-                                      case x:
+                                      case C:
                   case j:
                   case L:
                   case "data-loss":
@@ -6255,7 +6274,7 @@ function ui(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 hi() {
+/** The Platform's 'document' implementation or null if not available. */ function pi() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -6287,7 +6306,7 @@ function ui(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 pi, di = /** @class */ function() {
+ */ var di, yi = /** @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), 
@@ -6339,7 +6358,7 @@ function ui(t, e) {
      * guarantee that the operation will not be run.
      */
     t.prototype.cancel = function(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new B(F, "Operation cancelled" + (t ? ": " + t : ""))));
+        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new B(P, "Operation cancelled" + (t ? ": " + t : ""))));
     }, t.prototype.handleDelayElapsed = function() {
         var t = this;
         this.asyncQueue.enqueueAndForget((function() {
@@ -6351,7 +6370,7 @@ function ui(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), yi = /** @class */ function() {
+}(), mi = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
@@ -6375,16 +6394,16 @@ function ui(t, e) {
         // List of TimerIds to fast-forward delays for.
         this.$t = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.yt = new fn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.yt = new hn(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.Dt = function() {
-            var e = hi();
+        this.Nt = function() {
+            var e = pi();
             e && b("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.yt.H();
         };
-        var e = hi();
-        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Dt);
+        var e = pi();
+        e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.Nt);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
         get: function() {
@@ -6401,18 +6420,18 @@ function ui(t, e) {
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.enqueue(t);
     }, t.prototype.enqueueAndForgetEvenWhileRestricted = function(t) {
-        this.Nt(), 
+        this.Dt(), 
         // eslint-disable-next-line @typescript-eslint/no-floating-promises
         this.Ft(t);
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.Tt) {
             this.Tt = !0, this.Vt = t || !1;
-            var e = hi();
-            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Dt);
+            var e = pi();
+            e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.Nt);
         }
     }, t.prototype.enqueue = function(t) {
         var e = this;
-        if (this.Nt(), this.Tt) 
+        if (this.Dt(), this.Tt) 
         // Return a Promise which never resolves.
         return new Promise((function() {}));
         // Create a deferred Promise that we can return to the callee. This
@@ -6502,14 +6521,14 @@ function ui(t, e) {
         return this.Et = n, n;
     }, t.prototype.enqueueAfterDelay = function(t, e, n) {
         var r = this;
-        this.Nt(), 
+        this.Dt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.$t.indexOf(t) > -1 && (e = 0);
-        var i = di.createAndSchedule(this, t, e, n, (function(t) {
+        var i = yi.createAndSchedule(this, t, e, n, (function(t) {
             return r.St(t);
         }));
         return this.At.push(i), i;
-    }, t.prototype.Nt = function() {
+    }, t.prototype.Dt = function() {
         this.Rt && k();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
@@ -6580,10 +6599,10 @@ function ui(t, e) {
         var e = this.At.indexOf(t);
         this.At.splice(e, 1);
     }, t;
-}(), mi = /** @class */ function() {
+}(), vi = /** @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 = Kn(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -6592,23 +6611,23 @@ function ui(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = ui(t, this._firestore), r = new Ur(this._firestore);
+        var e = this, n = si(t, this._firestore), r = new Br(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 lr(e._firestore, r, i.key, i, n.converter);
-            if (i.isNoDocument()) return new lr(e._firestore, r, n._key, null, n.converter);
+            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);
             throw k();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = ui(t, this._firestore), i = Mr(r.converter, e, n), o = Kn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, 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);
         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 = ui(t, this._firestore);
+        var o, a = si(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 qn ? Zn(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 Rn ? tr(this._dataReader, "Transaction.update", a._key, e, n, r) : Zn(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -6618,7 +6637,7 @@ function ui(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = ui(t, this._firestore);
+        var e = si(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -6658,14 +6677,14 @@ function ui(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function vi(t, e, n) {
-    var r = mn(t = ct(t, gn)), i = Object.assign(Object.assign({}, li), n);
+function gi(t, e, n) {
+    var r = vn(t = ct(t, wn)), i = Object.assign(Object.assign({}, fi), n);
     !function(t) {
-        if (t.maxAttempts < 1) throw new B(V, "Max attempts must be at least 1");
+        if (t.maxAttempts < 1) throw new B(O, "Max attempts must be at least 1");
     }(i);
     var o = new z;
-    return new fi(new yi, r, i, (function(n) {
-        return e(new mi(t, n));
+    return new hi(new mi, r, i, (function(n) {
+        return e(new vi(t, n));
     }), o).run(), o.promise
     /**
  * Firestore Lite
@@ -6677,15 +6696,15 @@ function vi(t, e, n) {
  */;
 }
 
-pi = "".concat(i, "_lite"), g = pi, o(new c("firestore/lite", (function(t, e) {
-    var n = e.instanceIdentifier, r = e.options, i = t.getProvider("app").getImmediate(), o = new gn(new W(t.getProvider("auth-internal")), new X(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.');
+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 W(t.getProvider("auth-internal")), new X(t.getProvider("app-check-internal")), function(t, e) {
+        if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new B(O, '"projectId" not provided in firebase.initializeApp.');
         return new Z(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.11.0", ""), a("firestore-lite", "3.11.0", "esm5");
+a("firestore-lite", "3.12.0-20230511201449", ""), a("firestore-lite", "3.12.0-20230511201449", "esm5");
 
-export { En as AggregateField, Sn as AggregateQuerySnapshot, Nn as Bytes, An as CollectionReference, kn as DocumentReference, lr as DocumentSnapshot, qn as FieldPath, Cn as FieldValue, gn as Firestore, B as FirestoreError, xn as GeoPoint, In as Query, _r as QueryCompositeFilterConstraint, mr as QueryConstraint, fr as QueryDocumentSnapshot, Dr as QueryEndAtConstraint, gr as QueryFieldFilterConstraint, kr as QueryLimitConstraint, Er as QueryOrderByConstraint, hr as QuerySnapshot, Fr as QueryStartAtConstraint, Ot as Timestamp, mi as Transaction, ai as WriteBatch, Wr as addDoc, Zr as aggregateFieldEqual, ti as aggregateQuerySnapshotEqual, Tr as and, ii as arrayRemove, ri as arrayUnion, Xr as average, Fn as collection, Pn as collectionGroup, bn as connectFirestoreEmulator, $r as count, Gr as deleteDoc, ei as deleteField, Vn as doc, Rn as documentId, Nr as endAt, Or as endBefore, Hr as getAggregate, Yr as getCount, Br as getDoc, zr as getDocs, _n as getFirestore, oi as increment, wn as initializeFirestore, Ir as limit, Ar as limitToLast, br as or, Sr as orderBy, vr as query, On as queryEqual, Dn as refEqual, vi as runTransaction, ni as serverTimestamp, Qr as setDoc, _ as setLogLevel, pr as snapshotEqual, Vr as startAfter, Pr as startAt, Jr as sum, Tn as terminate, Kr as updateDoc, wr as where, si as writeBatch };
+export { Sn as AggregateField, kn as AggregateQuerySnapshot, qn as Bytes, Pn as CollectionReference, In as DocumentReference, fr as DocumentSnapshot, Rn as FieldPath, Cn as FieldValue, wn as Firestore, B as FirestoreError, jn as GeoPoint, An as Query, br as QueryCompositeFilterConstraint, vr as QueryConstraint, hr as QueryDocumentSnapshot, Dr as QueryEndAtConstraint, wr as QueryFieldFilterConstraint, Ir as QueryLimitConstraint, Sr as QueryOrderByConstraint, pr as QuerySnapshot, Fr as QueryStartAtConstraint, Nt as Timestamp, vi as Transaction, ui as WriteBatch, Yr as addDoc, ti as aggregateFieldEqual, ei as aggregateQuerySnapshotEqual, Er as and, oi as arrayRemove, ii as arrayUnion, $r as average, Fn as collection, On as collectionGroup, Tn as connectFirestoreEmulator, Zr as count, Wr as deleteDoc, ni as deleteField, Vn as doc, xn as documentId, qr as endAt, Nr as endBefore, Jr as getAggregate, Hr as getCount, zr as getDoc, Qr as getDocs, bn as getFirestore, ai as increment, _n as initializeFirestore, Ar as limit, Pr as limitToLast, Tr as or, kr as orderBy, gr as query, Nn as queryEqual, Dn as refEqual, gi as runTransaction, ri as serverTimestamp, Kr as setDoc, _ as setLogLevel, dr as snapshotEqual, Vr as startAfter, Or as startAt, Xr as sum, En as terminate, Gr as updateDoc, _r as where, ci as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map