@firebase/firestore 4.6.1-dataconnect-preview.42eb5e521 → 4.6.2-20240508213348

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

@@ -8,24 +8,6 @@ import { Logger as l, LogLevel as f } from "@firebase/logger";
 
 import { FirebaseError as h, deepEqual as p, getModularInstance as d, getDefaultEmulatorHostnameAndPort as y, createMockUserToken as m } from "@firebase/util";
 
-var v = "4.6.1-dataconnect-preview.42eb5e521", g = /** @class */ function() {
-    function t(t) {
-        this.uid = t;
-    }
-    return t.prototype.isAuthenticated = function() {
-        return null != this.uid;
-    }, 
-    /**
-     * Returns a key representing this user, suitable for inclusion in a
-     * dictionary.
-     */
-    t.prototype.toKey = function() {
-        return this.isAuthenticated() ? "uid:" + this.uid : "anonymous-user";
-    }, t.prototype.isEqual = function(t) {
-        return t.uid === this.uid;
-    }, t;
-}();
-
 /**
  * @license
  * Copyright 2017 Google LLC
@@ -45,7 +27,24 @@ var v = "4.6.1-dataconnect-preview.42eb5e521", g = /** @class */ function() {
 /**
  * Simple wrapper around a nullable UID. Mostly exists to make code more
  * readable.
- */
+ */ var g = /** @class */ function() {
+    function t(t) {
+        this.uid = t;
+    }
+    return t.prototype.isAuthenticated = function() {
+        return null != this.uid;
+    }, 
+    /**
+     * Returns a key representing this user, suitable for inclusion in a
+     * dictionary.
+     */
+    t.prototype.toKey = function() {
+        return this.isAuthenticated() ? "uid:" + this.uid : "anonymous-user";
+    }, t.prototype.isEqual = function(t) {
+        return t.uid === this.uid;
+    }, t;
+}();
+
 /** A user with a null UID. */ g.UNAUTHENTICATED = new g(null), 
 // TODO(mikelehen): Look into getting a proper uid-equivalent for
 // non-FirebaseAuth providers.
@@ -68,7 +67,7 @@ g.MOCK_USER = new g("mock-user");
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var w = "10.11.1-dataconnect-preview.42eb5e521", _ = new l("@firebase/firestore");
+var v = "10.12.0-20240508213348", w = new l("@firebase/firestore");
 
 /**
  * @license
@@ -99,39 +98,39 @@ var w = "10.11.1-dataconnect-preview.42eb5e521", _ = new l("@firebase/firestore"
  *     <li><code>`silent` to turn off logging.</li>
  *   </ul>
  */
-function b(t) {
-    _.setLogLevel(t);
+function _(t) {
+    w.setLogLevel(t);
 }
 
-function T(t) {
+function b(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (_.logLevel <= f.DEBUG) {
-        var i = e.map(k);
-        _.debug.apply(_, r([ "Firestore (".concat(w, "): ").concat(t) ], i, !1));
+    if (w.logLevel <= f.DEBUG) {
+        var i = e.map(S);
+        w.debug.apply(w, r([ "Firestore (".concat(v, "): ").concat(t) ], i, !1));
     }
 }
 
-function E(t) {
+function T(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (_.logLevel <= f.ERROR) {
-        var i = e.map(k);
-        _.error.apply(_, r([ "Firestore (".concat(w, "): ").concat(t) ], i, !1));
+    if (w.logLevel <= f.ERROR) {
+        var i = e.map(S);
+        w.error.apply(w, r([ "Firestore (".concat(v, "): ").concat(t) ], i, !1));
     }
 }
 
 /**
  * @internal
- */ function S(t) {
+ */ function E(t) {
     for (var e = [], n = 1; n < arguments.length; n++) e[n - 1] = arguments[n];
-    if (_.logLevel <= f.WARN) {
-        var i = e.map(k);
-        _.warn.apply(_, r([ "Firestore (".concat(w, "): ").concat(t) ], i, !1));
+    if (w.logLevel <= f.WARN) {
+        var i = e.map(S);
+        w.warn.apply(w, r([ "Firestore (".concat(v, "): ").concat(t) ], i, !1));
     }
 }
 
 /**
  * Converts an additional log parameter to a string representation.
- */ function k(t) {
+ */ function S(t) {
     if ("string" == typeof t) return t;
     try {
         /**
@@ -183,15 +182,15 @@ function E(t) {
  * Returns `never` and can be used in expressions:
  * @example
  * let futureVar = fail('not implemented yet');
- */ function I(t) {
+ */ function k(t) {
     void 0 === t && (t = "Unexpected state");
     // Log the failure in addition to throw an exception, just in case the
     // exception is swallowed.
-        var e = "FIRESTORE (".concat(w, ") INTERNAL ASSERTION FAILED: ") + t;
+        var e = "FIRESTORE (".concat(v, ") INTERNAL ASSERTION FAILED: ") + t;
     // NOTE: We don't use FirestoreError here because these are internal failures
     // that cannot be handled by the user. (Also it would create a circular
     // dependency between the error and assert modules which doesn't work.)
-        throw E(e), new Error(e)
+        throw T(e), new Error(e)
     /**
  * Fails if the given assertion condition is false, throwing an Error with the
  * given message if it did.
@@ -200,14 +199,14 @@ function E(t) {
  */;
 }
 
-function A(t, e) {
-    t || I();
+function I(t, e) {
+    t || k();
 }
 
 /**
  * Casts `obj` to `T`. In non-production builds, verifies that `obj` is an
  * instance of `T` before casting.
- */ function P(t, 
+ */ function A(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     return t;
@@ -228,7 +227,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", O = "unknown", V = "invalid-argument", N = "deadline-exceeded", D = "not-found", R = "permission-denied", q = "unauthenticated", x = "resource-exhausted", C = "failed-precondition", j = "aborted", L = "out-of-range", M = "unimplemented", U = "internal", B = "unavailable", z = /** @class */ function(e) {
+ */ var P = "cancelled", F = "unknown", O = "invalid-argument", V = "deadline-exceeded", N = "not-found", D = "permission-denied", R = "unauthenticated", q = "resource-exhausted", x = "failed-precondition", C = "aborted", j = "out-of-range", L = "unimplemented", M = "internal", U = "unavailable", B = /** @class */ function(e) {
     /** @hideconstructor */
     function n(
     /**
@@ -249,14 +248,14 @@ e) {
         }, r;
     }
     return t(n, e), n;
-}(h), G = function() {
+}(h), z = function() {
     var t = this;
     this.promise = new Promise((function(e, n) {
         t.resolve = e, t.reject = n;
     }));
-}, K = function(t, e) {
+}, G = function(t, e) {
     this.user = e, this.type = "OAuth", this.headers = new Map, this.headers.set("Authorization", "Bearer ".concat(t));
-}, Q = /** @class */ function() {
+}, K = /** @class */ function() {
     function t() {}
     return t.prototype.getToken = function() {
         return Promise.resolve(null);
@@ -266,7 +265,7 @@ e) {
             return e(g.UNAUTHENTICATED);
         }));
     }, t.prototype.shutdown = function() {}, t;
-}(), Y = /** @class */ function() {
+}(), Q = /** @class */ function() {
     function t(t) {
         this.token = t, 
         /**
@@ -288,7 +287,7 @@ e) {
     }, t.prototype.shutdown = function() {
         this.changeListener = null;
     }, t;
-}(), H = /** @class */ function() {
+}(), Y = /** @class */ function() {
     function t(t) {
         var e = this;
         this.auth = null, t.onInit((function(t) {
@@ -298,11 +297,11 @@ e) {
     return t.prototype.getToken = function() {
         var t = this;
         return this.auth ? this.auth.getToken().then((function(e) {
-            return e ? (A("string" == typeof e.accessToken), new K(e.accessToken, new g(t.auth.getUid()))) : null;
+            return e ? (I("string" == typeof e.accessToken), new G(e.accessToken, new g(t.auth.getUid()))) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), W = /** @class */ function() {
+}(), H = /** @class */ function() {
     function t(t, e, n) {
         this.t = t, this.i = e, this.o = n, this.type = "FirstParty", this.user = g.FIRST_PARTY, 
         this.u = new Map
@@ -324,12 +323,12 @@ e) {
         enumerable: !1,
         configurable: !0
     }), t;
-}(), J = /** @class */ function() {
+}(), W = /** @class */ function() {
     function t(t, e, n) {
         this.t = t, this.i = e, this.o = n;
     }
     return t.prototype.getToken = function() {
-        return Promise.resolve(new W(this.t, this.i, this.o));
+        return Promise.resolve(new H(this.t, this.i, this.o));
     }, t.prototype.start = function(t, e) {
         // Fire with initial uid.
         t.enqueueRetryable((function() {
@@ -337,9 +336,9 @@ e) {
         }));
     }, t.prototype.shutdown = function() {}, t.prototype.invalidateToken = function() {}, 
     t;
-}(), X = function(t) {
+}(), J = function(t) {
     this.value = t, this.type = "AppCheck", this.headers = new Map, t && t.length > 0 && this.headers.set("x-firebase-appcheck", this.value);
-}, Z = /** @class */ function() {
+}, X = /** @class */ function() {
     function t(t) {
         var e = this;
         this.h = t, this.appCheck = null, t.onInit((function(t) {
@@ -348,11 +347,11 @@ e) {
     }
     return t.prototype.getToken = function() {
         return this.appCheck ? this.appCheck.getToken().then((function(t) {
-            return t ? (A("string" == typeof t.token), new X(t.token)) : null;
+            return t ? (I("string" == typeof t.token), new J(t.token)) : null;
         })) : Promise.resolve(null);
     }, t.prototype.invalidateToken = function() {}, t.prototype.start = function(t, e) {}, 
     t.prototype.shutdown = function() {}, t;
-}(), $ = 
+}(), Z = 
 /**
      * Constructs a DatabaseInfo using the provided host, databaseId and
      * persistenceKey.
@@ -375,7 +374,7 @@ 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.longPollingOptions = u, 
     this.useFetchStreams = s;
-}, tt = /** @class */ function() {
+}, $ = /** @class */ function() {
     function t(t, e) {
         this.projectId = t, this.database = e || "(default)";
     }
@@ -390,9 +389,9 @@ function(t, e, n, r, i, o, a, u, s) {
     }), t.prototype.isEqual = function(e) {
         return e instanceof t && e.projectId === this.projectId && e.database === this.database;
     }, t;
-}(), et = /** @class */ function() {
+}(), tt = /** @class */ function() {
     function t(t, e, n) {
-        void 0 === e ? e = 0 : e > t.length && I(), void 0 === n ? n = t.length - e : n > t.length - e && I(), 
+        void 0 === e ? e = 0 : e > t.length && k(), void 0 === n ? n = t.length - e : n > t.length - e && k(), 
         this.segments = t, this.offset = e, this.len = n;
     }
     return Object.defineProperty(t.prototype, "length", {
@@ -443,7 +442,7 @@ function(t, e, n, r, i, o, a, u, s) {
         }
         return t.length < e.length ? -1 : t.length > e.length ? 1 : 0;
     }, t;
-}(), nt = /** @class */ function(e) {
+}(), et = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -477,7 +476,7 @@ function(t, e, n, r, i, o, a, u, s) {
         // 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 z(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;
@@ -487,7 +486,7 @@ function(t, e, n, r, i, o, a, u, s) {
     }, n.emptyPath = function() {
         return new n([]);
     }, n;
-}(et), rt = /^[_a-zA-Z][_a-zA-Z0-9]*$/, it = /** @class */ function(e) {
+}(tt), nt = /^[_a-zA-Z][_a-zA-Z0-9]*$/, rt = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -499,7 +498,7 @@ function(t, e, n, r, i, o, a, u, s) {
      * without escaping.
      */
     n.isValidIdentifier = function(t) {
-        return rt.test(t);
+        return nt.test(t);
     }, n.prototype.canonicalString = function() {
         return this.toArray().map((function(t) {
             return t = t.replace(/\\/g, "\\\\").replace(/`/g, "\\`"), n.isValidIdentifier(t) || (t = "`" + t + "`"), 
@@ -532,32 +531,32 @@ function(t, e, n, r, i, o, a, u, s) {
      */
     n.fromServerFormat = function(t) {
         for (var e = [], r = "", i = 0, o = function() {
-            if (0 === r.length) throw new z(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 z(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 z(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 z(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([]);
     }, n;
-}(et), ot = /** @class */ function() {
+}(tt), it = /** @class */ function() {
     function t(t) {
         this.path = t;
     }
     return t.fromPath = function(e) {
-        return new t(nt.fromString(e));
+        return new t(et.fromString(e));
     }, t.fromName = function(e) {
-        return new t(nt.fromString(e).popFirst(5));
+        return new t(et.fromString(e).popFirst(5));
     }, t.empty = function() {
-        return new t(nt.emptyPath());
+        return new t(et.emptyPath());
     }, Object.defineProperty(t.prototype, "collectionGroup", {
         get: function() {
             return this.path.popLast().lastSegment();
@@ -574,11 +573,11 @@ function(t, e, n, r, i, o, a, u, s) {
     /** Returns the fully qualified path to the parent collection. */ t.prototype.getCollectionPath = function() {
         return this.path.popLast();
     }, t.prototype.isEqual = function(t) {
-        return null !== t && 0 === nt.comparator(this.path, t.path);
+        return null !== t && 0 === et.comparator(this.path, t.path);
     }, t.prototype.toString = function() {
         return this.path.toString();
     }, t.comparator = function(t, e) {
-        return nt.comparator(t.path, e.path);
+        return et.comparator(t.path, e.path);
     }, t.isDocumentKey = function(t) {
         return t.length % 2 == 0;
     }, 
@@ -589,7 +588,7 @@ function(t, e, n, r, i, o, a, u, s) {
      * @returns A new instance of DocumentKey
      */
     t.fromSegments = function(e) {
-        return new t(new nt(e.slice()));
+        return new t(new et(e.slice()));
     }, t;
 }();
 
@@ -610,8 +609,8 @@ function(t, e, n, r, i, o, a, u, s) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-function at(t, e, n) {
-    if (!n) throw new z(V, "Function ".concat(t, "() cannot be called with an empty ").concat(e, "."));
+function ot(t, e, n) {
+    if (!n) throw new B(O, "Function ".concat(t, "() cannot be called with an empty ").concat(e, "."));
 }
 
 /**
@@ -621,22 +620,22 @@ function at(t, e, n) {
 /**
  * Validates that `path` refers to a document (indicated by the fact it contains
  * an even numbers of segments).
- */ function ut(t) {
-    if (!ot.isDocumentKey(t)) throw new z(V, "Invalid document reference. Document references must have an even number of segments, but ".concat(t, " has ").concat(t.length, "."));
+ */ function at(t) {
+    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 st(t) {
-    if (ot.isDocumentKey(t)) throw new z(V, "Invalid collection reference. Collection references must have an odd number of segments, but ".concat(t, " has ").concat(t.length, "."));
+ */ function ut(t) {
+    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, "."));
 }
 
 /**
  * Returns true if it's a non-null object without a custom prototype
  * (i.e. excludes Array, Date, etc.).
  */
-/** Returns a string describing the type / value of the provided input. */ function ct(t) {
+/** Returns a string describing the type / value of the provided input. */ function st(t) {
     if (void 0 === t) return "undefined";
     if (null === t) return "null";
     if ("string" == typeof t) return t.length > 20 && (t = "".concat(t.substring(0, 20), "...")), 
@@ -651,25 +650,25 @@ function at(t, e, n) {
         }(t);
         return e ? "a custom ".concat(e, " object") : "an object";
     }
-    return "function" == typeof t ? "a function" : I();
+    return "function" == typeof t ? "a function" : k();
 }
 
-function lt(t, 
+function ct(t, 
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
 e) {
     if ("_delegate" in t && (
     // 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 z(V, "Type does not match the expected instance. Did you pass a reference from a different Firestore SDK?");
-        var n = ct(t);
-        throw new z(V, "Expected type '".concat(e.name, "', but it was: ").concat(n));
+        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(O, "Expected type '".concat(e.name, "', but it was: ").concat(n));
     }
     return t;
 }
 
-function ft(t, e) {
-    if (e <= 0) throw new z(V, "Function ".concat(t, "() requires a positive number, but it was: ").concat(e, "."));
+function lt(t, e) {
+    if (e <= 0) throw new B(O, "Function ".concat(t, "() requires a positive number, but it was: ").concat(e, "."));
 }
 
 /**
@@ -694,7 +693,7 @@ function ft(t, e) {
 /**
  * Creates and returns a new `ExperimentalLongPollingOptions` with the same
  * option values as the given instance.
- */ function ht(t) {
+ */ function ft(t) {
     var e = {};
     return void 0 !== t.timeoutSeconds && (e.timeoutSeconds = t.timeoutSeconds), e
     /**
@@ -719,7 +718,7 @@ function ft(t, e) {
  */;
 }
 
-var pt = null;
+var ht = null;
 
 /**
  * Generates and returns an initial value for `lastUniqueDebugId`.
@@ -762,11 +761,11 @@ var pt = null;
 /**
  * Returns whether a variable is either undefined or null.
  */
-function dt(t) {
+function pt(t) {
     return null == t;
 }
 
-/** Returns whether the value represents -0. */ function yt(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;
@@ -791,7 +790,7 @@ function dt(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 mt, vt, gt = {
+ */ var yt, mt, gt = {
     BatchGetDocuments: "batchGet",
     Commit: "commit",
     RunQuery: "runQuery",
@@ -836,8 +835,8 @@ function dt(t) {
  * @returns The equivalent Code. Unknown status codes are mapped to
  *     Code.UNKNOWN.
  */
-function wt(t) {
-    if (void 0 === t) return E("RPC_ERROR", "HTTP error has no status"), O;
+function vt(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.
@@ -850,62 +849,62 @@ function wt(t) {
 
       case 400:
         // Bad Request
-        return C;
+        return x;
 
         // Other possibilities based on the forward mapping
         // return Code.INVALID_ARGUMENT;
         // return Code.OUT_OF_RANGE;
               case 401:
         // Unauthorized
-        return q;
+        return R;
 
       case 403:
         // Forbidden
-        return R;
+        return D;
 
       case 404:
         // Not Found
-        return D;
+        return N;
 
       case 409:
         // Conflict
-        return j;
+        return C;
 
         // Other possibilities:
         // return Code.ALREADY_EXISTS;
               case 416:
         // Range Not Satisfiable
-        return L;
+        return j;
 
       case 429:
         // Too Many Requests
-        return x;
+        return q;
 
       case 499:
         // Client Closed Request
-        return F;
+        return P;
 
       case 500:
         // Internal Server Error
-        return O;
+        return F;
 
         // Other possibilities:
         // return Code.INTERNAL;
         // return Code.DATA_LOSS;
               case 501:
         // Unimplemented
-        return M;
+        return L;
 
       case 503:
         // Service Unavailable
-        return B;
+        return U;
 
       case 504:
         // Gateway Timeout
-        return N;
+        return V;
 
       default:
-        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? C : t >= 500 && t < 600 ? U : O;
+        return t >= 200 && t < 300 ? "ok" : t >= 400 && t < 500 ? x : t >= 500 && t < 600 ? M : F;
     }
 }
 
@@ -928,16 +927,16 @@ function wt(t) {
 /**
  * A Rest-based connection that relies on the native HTTP stack
  * (e.g. `fetch` or a polyfill).
- */ (vt = mt || (mt = {}))[vt.OK = 0] = "OK", vt[vt.CANCELLED = 1] = "CANCELLED", 
-vt[vt.UNKNOWN = 2] = "UNKNOWN", vt[vt.INVALID_ARGUMENT = 3] = "INVALID_ARGUMENT", 
-vt[vt.DEADLINE_EXCEEDED = 4] = "DEADLINE_EXCEEDED", vt[vt.NOT_FOUND = 5] = "NOT_FOUND", 
-vt[vt.ALREADY_EXISTS = 6] = "ALREADY_EXISTS", vt[vt.PERMISSION_DENIED = 7] = "PERMISSION_DENIED", 
-vt[vt.UNAUTHENTICATED = 16] = "UNAUTHENTICATED", vt[vt.RESOURCE_EXHAUSTED = 8] = "RESOURCE_EXHAUSTED", 
-vt[vt.FAILED_PRECONDITION = 9] = "FAILED_PRECONDITION", vt[vt.ABORTED = 10] = "ABORTED", 
-vt[vt.OUT_OF_RANGE = 11] = "OUT_OF_RANGE", vt[vt.UNIMPLEMENTED = 12] = "UNIMPLEMENTED", 
-vt[vt.INTERNAL = 13] = "INTERNAL", vt[vt.UNAVAILABLE = 14] = "UNAVAILABLE", vt[vt.DATA_LOSS = 15] = "DATA_LOSS";
-
-var _t = /** @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.
@@ -971,14 +970,14 @@ var _t = /** @class */ function(r) {
                     return a = n.sent(), [ 3 /*break*/ , 4 ];
 
                   case 3:
-                    throw u = n.sent(), new z(wt((s = u).status), "Request failed with error: " + s.statusText);
+                    throw u = n.sent(), new B(vt((s = u).status), "Request failed with error: " + s.statusText);
 
                   case 4:
                     return a.ok ? [ 3 /*break*/ , 6 ] : [ 4 /*yield*/ , a.json() ];
 
                   case 5:
                     throw c = n.sent(), Array.isArray(c) && (c = c[0]), l = null === (t = null == c ? void 0 : c.error) || void 0 === t ? void 0 : t.message, 
-                    new z(wt(a.status), "Request failed with error: ".concat(null != l ? l : a.statusText));
+                    new B(vt(a.status), "Request failed with error: ".concat(null != l ? l : a.statusText));
 
                   case 6:
                     return [ 2 /*return*/ , a.json() ];
@@ -1002,18 +1001,18 @@ var _t = /** @class */ function(r) {
         enumerable: !1,
         configurable: !0
     }), t.prototype.P = function(t, e, n, r, i) {
-        var o = (null === pt ? pt = 268435456 + Math.round(2147483648 * Math.random()) : pt++, 
-        "0x" + pt.toString(16)), a = this.I(t, e.toUriEncodedString());
-        T("RestConnection", "Sending RPC '".concat(t, "' ").concat(o, ":"), a, n);
+        var o = (null === ht ? ht = 268435456 + Math.round(2147483648 * Math.random()) : ht++, 
+        "0x" + ht.toString(16)), a = this.I(t, e.toUriEncodedString());
+        b("RestConnection", "Sending RPC '".concat(t, "' ").concat(o, ":"), a, n);
         var u = {
             "google-cloud-resource-prefix": this.A,
             "x-goog-request-params": this.T
         };
         return this.V(u, r, i), this.p(t, a, u, n).then((function(e) {
-            return T("RestConnection", "Received RPC '".concat(t, "' ").concat(o, ": "), e), 
+            return b("RestConnection", "Received RPC '".concat(t, "' ").concat(o, ": "), e), 
             e;
         }), (function(e) {
-            throw S("RestConnection", "RPC '".concat(t, "' ").concat(o, " failed with error: "), e, "url: ", a, "request:", n), 
+            throw E("RestConnection", "RPC '".concat(t, "' ").concat(o, " failed with error: "), e, "url: ", a, "request:", n), 
             e;
         }));
     }, t.prototype.g = function(t, e, n, r, i, o) {
@@ -1026,7 +1025,7 @@ var _t = /** @class */ function(r) {
      * present and any additional headers for the request.
      */
     t.prototype.V = function(t, e, n) {
-        t["X-Goog-Api-Client"] = "gl-js/ fire/" + w, 
+        t["X-Goog-Api-Client"] = "gl-js/ fire/" + v, 
         // Content-Type: text/plain will avoid preflight requests which might
         // mess with CORS and redirects by proxies. If we add custom headers
         // we will need to change this code to potentially use the $httpOverwrite
@@ -1049,7 +1048,7 @@ var _t = /** @class */ function(r) {
     t.prototype.terminate = function() {
         // No-op
     }, t;
-}()), bt = function(t, e, n) {
+}()), _t = function(t, e, n) {
     this.alias = t, this.aggregateType = e, this.fieldPath = n;
 };
 
@@ -1110,7 +1109,7 @@ var _t = /** @class */ function(r) {
  *
  * If `nBytes < 0` , an error will be thrown.
  */
-function Tt(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
@@ -1142,14 +1141,14 @@ function Tt(t) {
  *
  * @internal
  * Exported internally for testing purposes.
- */ var Et = /** @class */ function() {
+ */ var Tt = /** @class */ function() {
     function t() {}
     return t.newId = 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 = Tt(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));
@@ -1157,11 +1156,11 @@ function Tt(t) {
     }, t;
 }();
 
-function St(t, e) {
+function Et(t, e) {
     return t < e ? -1 : t > e ? 1 : 0;
 }
 
-/** Helper to compare arrays using isEqual(). */ function kt(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]);
     }));
@@ -1182,13 +1181,13 @@ function St(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 It(t) {
+ */ function kt(t) {
     var e = 0;
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e++;
     return e;
 }
 
-function At(t, e) {
+function It(t, e) {
     for (var n in t) Object.prototype.hasOwnProperty.call(t, n) && e(n, t[n]);
 }
 
@@ -1210,13 +1209,13 @@ function At(t, e) {
  */
 /**
  * An error encountered while decoding base64 string.
- */ var Pt = /** @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), Ft = /** @class */ function() {
+}(Error), Pt = /** @class */ function() {
     function t(t) {
         this.binaryString = t;
     }
@@ -1228,7 +1227,7 @@ function At(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 Pt("Invalid base64 string: " + t) : t;
+                throw "undefined" != typeof DOMException && t instanceof DOMException ? new At("Invalid base64 string: " + t) : t;
             }
         }(e);
         return new t(n);
@@ -1268,7 +1267,7 @@ function At(t, e) {
     }, t.prototype.approximateByteSize = function() {
         return 2 * this.binaryString.length;
     }, t.prototype.compareTo = function(t) {
-        return St(this.binaryString, t.binaryString);
+        return Et(this.binaryString, t.binaryString);
     }, t.prototype.isEqual = function(t) {
         return this.binaryString === t.binaryString;
     }, t;
@@ -1315,23 +1314,23 @@ function At(t, e) {
  * the proto byte string in a common class that must be converted into a string
  * before being sent as a proto.
  * @internal
- */ Ft.EMPTY_BYTE_STRING = new Ft("");
+ */ Pt.EMPTY_BYTE_STRING = new Pt("");
 
-var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
+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 Vt(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.
-    if (A(!!t), "string" == typeof t) {
+    if (I(!!t), "string" == typeof t) {
         // The date string can have higher precision (nanos) than the Date class
         // (millis), so we do some custom parsing here.
         // Parse the nanos right out of the string.
-        var e = 0, n = Ot.exec(t);
-        if (A(!!n), n[1]) {
+        var e = 0, n = Ft.exec(t);
+        if (I(!!n), n[1]) {
             // Pad the fraction out to 9 digits (nanos).
             var r = n[1];
             r = (r + "000000000").substr(0, 9), e = Number(r);
@@ -1344,21 +1343,21 @@ var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         };
     }
     return {
-        seconds: Nt(t.seconds),
-        nanos: Nt(t.nanos)
+        seconds: Vt(t.seconds),
+        nanos: Vt(t.nanos)
     };
 }
 
 /**
  * Converts the possible Proto types for numbers into a JavaScript number.
  * Returns 0 if the value is not numeric.
- */ function Nt(t) {
+ */ function Vt(t) {
     // TODO(bjornick): Handle int64 greater than 53 bits.
     return "number" == typeof t ? t : "string" == typeof t ? Number(t) : 0;
 }
 
-/** Converts the possible Proto types for Blobs into a ByteString. */ function Dt(t) {
-    return "string" == typeof t ? Ft.fromBase64String(t) : Ft.fromUint8Array(t);
+/** Converts the possible Proto types for Blobs into a ByteString. */ function Nt(t) {
+    return "string" == typeof t ? Pt.fromBase64String(t) : Pt.fromUint8Array(t);
 }
 
 /**
@@ -1391,7 +1390,7 @@ var Ot = 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 Rt = /** @class */ function() {
+ */ var Dt = /** @class */ function() {
     /**
      * Creates a new timestamp.
      *
@@ -1412,11 +1411,11 @@ var Ot = 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 z(V, "Timestamp nanoseconds out of range: " + e);
-        if (e >= 1e9) throw new z(V, "Timestamp nanoseconds out of range: " + e);
-        if (t < -62135596800) throw new z(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 z(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.
@@ -1468,7 +1467,7 @@ var Ot = 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 ? St(this.nanoseconds, t.nanoseconds) : St(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.
@@ -1540,7 +1539,7 @@ var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  *   FieldValueOptions to value().
  * - With respect to other ServerTimestampValues, they sort by their
  *   localWriteTime.
- */ function qt(t) {
+ */ function Rt(t) {
     var e, n;
     return "server_timestamp" === (null === (n = ((null === (e = null == t ? void 0 : t.mapValue) || void 0 === e ? void 0 : e.fields) || {}).__type__) || void 0 === n ? void 0 : n.stringValue);
 }
@@ -1550,16 +1549,16 @@ var Ot = 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 xt(t) {
+ */ function qt(t) {
     var e = t.mapValue.fields.__previous_value__;
-    return qt(e) ? xt(e) : e;
+    return Rt(e) ? qt(e) : e;
 }
 
 /**
  * Returns the local time at which this timestamp was first set.
- */ function Ct(t) {
-    var e = Vt(t.mapValue.fields.__local_write_time__.timestampValue);
-    return new Rt(e.seconds, e.nanos);
+ */ function xt(t) {
+    var e = Ot(t.mapValue.fields.__local_write_time__.timestampValue);
+    return new Dt(e.seconds, e.nanos);
 }
 
 /**
@@ -1577,7 +1576,7 @@ var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var jt = {
+ */ var Ct = {
     fields: {
         __type__: {
             stringValue: "__max__"
@@ -1585,18 +1584,18 @@ var Ot = 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 Lt(t) {
-    return "nullValue" in t ? 0 /* TypeOrder.NullValue */ : "booleanValue" in t ? 1 /* TypeOrder.BooleanValue */ : "integerValue" in t || "doubleValue" in t ? 2 /* TypeOrder.NumberValue */ : "timestampValue" in t ? 3 /* TypeOrder.TimestampValue */ : "stringValue" in t ? 5 /* TypeOrder.StringValue */ : "bytesValue" in t ? 6 /* TypeOrder.BlobValue */ : "referenceValue" in t ? 7 /* TypeOrder.RefValue */ : "geoPointValue" in t ? 8 /* TypeOrder.GeoPointValue */ : "arrayValue" in t ? 9 /* TypeOrder.ArrayValue */ : "mapValue" in t ? qt(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 ? Rt(t) ? 4 /* TypeOrder.ServerTimestampValue */ : 
     /** Returns true if the Value represents the canonical {@link #MAX_VALUE} . */
     function(t) {
         return "__max__" === (((t.mapValue || {}).fields || {}).__type__ || {}).stringValue;
-    }(t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : I();
+    }(t) ? 9007199254740991 /* TypeOrder.MaxValue */ : 10 /* TypeOrder.ObjectValue */ : k();
 }
 
-/** Tests `left` and `right` for equality based on the backend semantics. */ function Mt(t, e) {
+/** Tests `left` and `right` for equality based on the backend semantics. */ function Lt(t, e) {
     if (t === e) return !0;
-    var n = Lt(t);
-    if (n !== Lt(e)) return !1;
+    var n = jt(t);
+    if (n !== jt(e)) return !1;
     switch (n) {
       case 0 /* TypeOrder.NullValue */ :
       case 9007199254740991 /* TypeOrder.MaxValue */ :
@@ -1606,14 +1605,14 @@ var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
         return t.booleanValue === e.booleanValue;
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return Ct(t).isEqual(Ct(e));
+        return xt(t).isEqual(xt(e));
 
       case 3 /* TypeOrder.TimestampValue */ :
         return function(t, e) {
             if ("string" == typeof t.timestampValue && "string" == typeof e.timestampValue && t.timestampValue.length === e.timestampValue.length) 
             // Use string equality for ISO 8601 timestamps
             return t.timestampValue === e.timestampValue;
-            var n = Vt(t.timestampValue), r = Vt(e.timestampValue);
+            var n = Ot(t.timestampValue), r = Ot(e.timestampValue);
             return n.seconds === r.seconds && n.nanos === r.nanos;
         }(t, e);
 
@@ -1622,7 +1621,7 @@ var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            return Dt(t.bytesValue).isEqual(Dt(e.bytesValue));
+            return Nt(t.bytesValue).isEqual(Nt(e.bytesValue));
         }(t, e);
 
       case 7 /* TypeOrder.RefValue */ :
@@ -1630,105 +1629,105 @@ var Ot = new RegExp(/^\d{4}-\d\d-\d\dT\d\d:\d\d:\d\d(?:\.(\d+))?Z$/);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            return Nt(t.geoPointValue.latitude) === Nt(e.geoPointValue.latitude) && Nt(t.geoPointValue.longitude) === Nt(e.geoPointValue.longitude);
+            return Vt(t.geoPointValue.latitude) === Vt(e.geoPointValue.latitude) && Vt(t.geoPointValue.longitude) === Vt(e.geoPointValue.longitude);
         }(t, e);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
-            if ("integerValue" in t && "integerValue" in e) return Nt(t.integerValue) === Nt(e.integerValue);
+            if ("integerValue" in t && "integerValue" in e) return Vt(t.integerValue) === Vt(e.integerValue);
             if ("doubleValue" in t && "doubleValue" in e) {
-                var n = Nt(t.doubleValue), r = Nt(e.doubleValue);
-                return n === r ? yt(n) === yt(r) : isNaN(n) && isNaN(r);
+                var n = Vt(t.doubleValue), r = Vt(e.doubleValue);
+                return n === r ? dt(n) === dt(r) : isNaN(n) && isNaN(r);
             }
             return !1;
         }(t, e);
 
       case 9 /* TypeOrder.ArrayValue */ :
-        return kt(t.arrayValue.values || [], e.arrayValue.values || [], Mt);
+        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 (It(n) !== It(r)) return !1;
-            for (var i in n) if (n.hasOwnProperty(i) && (void 0 === r[i] || !Mt(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);
 
       default:
-        return I();
+        return k();
     }
 }
 
-function Ut(t, e) {
+function Mt(t, e) {
     return void 0 !== (t.values || []).find((function(t) {
-        return Mt(t, e);
+        return Lt(t, e);
     }));
 }
 
-function Bt(t, e) {
+function Ut(t, e) {
     if (t === e) return 0;
-    var n = Lt(t), r = Lt(e);
-    if (n !== r) return St(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 St(t.booleanValue, e.booleanValue);
+        return Et(t.booleanValue, e.booleanValue);
 
       case 2 /* TypeOrder.NumberValue */ :
         return function(t, e) {
-            var n = Nt(t.integerValue || t.doubleValue), r = Nt(e.integerValue || e.doubleValue);
+            var n = Vt(t.integerValue || t.doubleValue), r = Vt(e.integerValue || e.doubleValue);
             return n < r ? -1 : n > r ? 1 : n === r ? 0 : 
             // one or both are NaN.
             isNaN(n) ? isNaN(r) ? 0 : -1 : 1;
         }(t, e);
 
       case 3 /* TypeOrder.TimestampValue */ :
-        return zt(t.timestampValue, e.timestampValue);
+        return Bt(t.timestampValue, e.timestampValue);
 
       case 4 /* TypeOrder.ServerTimestampValue */ :
-        return zt(Ct(t), Ct(e));
+        return Bt(xt(t), xt(e));
 
       case 5 /* TypeOrder.StringValue */ :
-        return St(t.stringValue, e.stringValue);
+        return Et(t.stringValue, e.stringValue);
 
       case 6 /* TypeOrder.BlobValue */ :
         return function(t, e) {
-            var n = Dt(t), r = Dt(e);
+            var n = Nt(t), r = Nt(e);
             return n.compareTo(r);
         }(t.bytesValue, e.bytesValue);
 
       case 7 /* TypeOrder.RefValue */ :
         return function(t, e) {
             for (var n = t.split("/"), r = e.split("/"), i = 0; i < n.length && i < r.length; i++) {
-                var o = St(n[i], r[i]);
+                var o = Et(n[i], r[i]);
                 if (0 !== o) return o;
             }
-            return St(n.length, r.length);
+            return Et(n.length, r.length);
         }(t.referenceValue, e.referenceValue);
 
       case 8 /* TypeOrder.GeoPointValue */ :
         return function(t, e) {
-            var n = St(Nt(t.latitude), Nt(e.latitude));
-            return 0 !== n ? n : St(Nt(t.longitude), Nt(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 = Bt(n[i], r[i]);
+                var o = Ut(n[i], r[i]);
                 if (o) return o;
             }
-            return St(n.length, r.length);
+            return Et(n.length, r.length);
         }(t.arrayValue, e.arrayValue);
 
       case 10 /* TypeOrder.ObjectValue */ :
         return function(t, e) {
-            if (t === jt && e === jt) return 0;
-            if (t === jt) return 1;
-            if (e === jt) return -1;
+            if (t === Ct && e === Ct) return 0;
+            if (t === Ct) return 1;
+            if (e === Ct) return -1;
             var n = t.fields || {}, r = Object.keys(n), i = e.fields || {}, o = Object.keys(i);
             // Even though MapValues are likely sorted correctly based on their insertion
             // order (e.g. when received from the backend), local modifications can bring
@@ -1736,48 +1735,48 @@ function Bt(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 = St(r[a], o[a]);
+                var u = Et(r[a], o[a]);
                 if (0 !== u) return u;
-                var s = Bt(n[r[a]], i[o[a]]);
+                var s = Ut(n[r[a]], i[o[a]]);
                 if (0 !== s) return s;
             }
-            return St(r.length, o.length);
+            return Et(r.length, o.length);
         }(t.mapValue, e.mapValue);
 
       default:
-        throw I();
+        throw k();
     }
 }
 
-function zt(t, e) {
-    if ("string" == typeof t && "string" == typeof e && t.length === e.length) return St(t, e);
-    var n = Vt(t), r = Vt(e), i = St(n.seconds, r.seconds);
-    return 0 !== i ? i : St(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 Gt(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 Kt(t) {
+/** Returns true if `value` is an ArrayValue. */ function Gt(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 Yt(t) {
+/** Returns true if `value` is NaN. */ function Qt(t) {
     return !!t && "doubleValue" in t && isNaN(Number(t.doubleValue));
 }
 
-/** Returns true if `value` is a MapValue. */ function Ht(t) {
+/** Returns true if `value` is a MapValue. */ function Yt(t) {
     return !!t && "mapValue" in t;
 }
 
-/** Creates a deep copy of `source`. */ function Wt(t) {
+/** Creates a deep copy of `source`. */ function Ht(t) {
     if (t.geoPointValue) return {
         geoPointValue: Object.assign({}, t.geoPointValue)
     };
@@ -1790,8 +1789,8 @@ function Gt(t, e) {
                 fields: {}
             }
         };
-        return At(t.mapValue.fields, (function(t, n) {
-            return e.mapValue.fields[t] = Wt(n);
+        return It(t.mapValue.fields, (function(t, n) {
+            return e.mapValue.fields[t] = Ht(n);
         })), e;
     }
     if (t.arrayValue) {
@@ -1799,21 +1798,21 @@ function Gt(t, e) {
             arrayValue: {
                 values: []
             }
-        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Wt(t.arrayValue.values[r]);
+        }, r = 0; r < (t.arrayValue.values || []).length; ++r) n.arrayValue.values[r] = Ht(t.arrayValue.values[r]);
         return n;
     }
     return Object.assign({}, t);
 }
 
-var Jt = function(t, e) {
+var Wt = function(t, e) {
     this.position = t, this.inclusive = e;
 };
 
-function Xt(t, e) {
+function Jt(t, e) {
     if (null === t) return null === e;
     if (null === e) return !1;
     if (t.inclusive !== e.inclusive || t.position.length !== e.position.length) return !1;
-    for (var n = 0; n < t.position.length; n++) if (!Mt(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;
 }
 
@@ -1832,7 +1831,7 @@ function Xt(t, e) {
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  * See the License for the specific language governing permissions and
  * limitations under the License.
- */ var Zt = function() {}, $t = /** @class */ function(e) {
+ */ var Xt = function() {}, Zt = /** @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;
@@ -1840,13 +1839,13 @@ function Xt(t, e) {
     /**
      * Creates a filter based on the provided arguments.
      */    return t(n, e), n.create = function(t, e, r) {
-        return t.isKeyField() ? "in" /* Operator.IN */ === e || "not-in" /* Operator.NOT_IN */ === e ? this.createKeyFieldInFilter(t, e, r) : new ne(t, e, r) : "array-contains" /* Operator.ARRAY_CONTAINS */ === e ? new ae(t, r) : "in" /* Operator.IN */ === e ? new ue(t, r) : "not-in" /* Operator.NOT_IN */ === e ? new se(t, r) : "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ === e ? new ce(t, r) : new n(t, e, r);
+        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 re(t, n) : new ie(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(Bt(e, this.value)) : null !== e && Lt(this.value) === Lt(e) && this.matchesComparison(Bt(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) {
@@ -1869,7 +1868,7 @@ function Xt(t, e) {
             return t >= 0;
 
           default:
-            return I();
+            return k();
         }
     }, n.prototype.isInequality = function() {
         return [ "<" /* Operator.LESS_THAN */ , "<=" /* Operator.LESS_THAN_OR_EQUAL */ , ">" /* Operator.GREATER_THAN */ , ">=" /* Operator.GREATER_THAN_OR_EQUAL */ , "!=" /* Operator.NOT_EQUAL */ , "not-in" /* Operator.NOT_IN */ ].indexOf(this.op) >= 0;
@@ -1878,7 +1877,7 @@ function Xt(t, e) {
     }, n.prototype.getFilters = function() {
         return [ this ];
     }, n;
-}(Zt), te = /** @class */ function(e) {
+}(Xt), $t = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).filters = t, r.op = n, r.D = null, r;
@@ -1904,32 +1903,32 @@ function Xt(t, e) {
     n.prototype.getFilters = function() {
         return Object.assign([], this.filters);
     }, n;
-}(Zt);
-
-function ee(t, e) {
-    return t instanceof $t ? function(t, e) {
-        return e instanceof $t && t.op === e.op && t.field.isEqual(e.field) && Mt(t.value, e.value);
-    }(t, e) : t instanceof te ? function(t, e) {
-        return e instanceof te && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
-            return t && ee(n, e.filters[r]);
+}(Xt);
+
+function te(t, e) {
+    return t instanceof Zt ? function(t, e) {
+        return e instanceof Zt && t.op === e.op && t.field.isEqual(e.field) && Lt(t.value, e.value);
+    }(t, e) : t instanceof $t ? function(t, e) {
+        return e instanceof $t && t.op === e.op && t.filters.length === e.filters.length && t.filters.reduce((function(t, n, r) {
+            return t && te(n, e.filters[r]);
         }), !0);
-    }(t, e) : void I();
+    }(t, e) : void k();
 }
 
-var ne = /** @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 = ot.fromName(r.referenceValue), 
+        return (i = e.call(this, t, n, r) || this).key = it.fromName(r.referenceValue), 
         i;
     }
     return t(n, e), n.prototype.matches = function(t) {
-        var e = ot.comparator(t.key, this.key);
+        var e = it.comparator(t.key, this.key);
         return this.matchesComparison(e);
     }, n;
-}($t), re = /** @class */ function(e) {
+}(Zt), ne = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
-        return (r = e.call(this, t, "in" /* Operator.IN */ , n) || this).keys = oe("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) {
@@ -1937,10 +1936,10 @@ var ne = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}($t), ie = /** @class */ function(e) {
+}(Zt), 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 = oe("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) {
@@ -1948,57 +1947,57 @@ var ne = /** @class */ function(e) {
             return e.isEqual(t.key);
         }));
     }, n;
-}($t);
+}(Zt);
 
-/** Filter that matches on key fields within an array. */ function oe(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 ot.fromName(t.referenceValue);
+        return it.fromName(t.referenceValue);
     }));
 }
 
-/** A Filter that implements the array-contains operator. */ var ae = /** @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 Kt(e) && Ut(e.arrayValue, this.value);
+        return Gt(e) && Mt(e.arrayValue, this.value);
     }, n;
-}($t), ue = /** @class */ function(e) {
+}(Zt), 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 && Ut(this.value.arrayValue, e);
+        return null !== e && Mt(this.value.arrayValue, e);
     }, n;
-}($t), se = /** @class */ function(e) {
+}(Zt), 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 (Ut(this.value.arrayValue, {
+        if (Mt(this.value.arrayValue, {
             nullValue: "NULL_VALUE"
         })) return !1;
         var e = t.data.field(this.field);
-        return null !== e && !Ut(this.value.arrayValue, e);
+        return null !== e && !Mt(this.value.arrayValue, e);
     }, n;
-}($t), ce = /** @class */ function(e) {
+}(Zt), 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 !(!Kt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
-            return Ut(e.value.arrayValue, t);
+        return !(!Gt(n) || !n.arrayValue.values) && n.arrayValue.values.some((function(t) {
+            return Mt(e.value.arrayValue, t);
         }));
     }, n;
-}($t), le = function(t, e /* Direction.ASCENDING */) {
+}(Zt), 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 fe(t, e) {
+/** A Filter that implements the IN operator. */ function le(t, e) {
     return t.dir === e.dir && t.field.isEqual(e.field);
 }
 
@@ -2021,16 +2020,16 @@ var ne = /** @class */ function(e) {
 /**
  * A version of a document in Firestore. This corresponds to the version
  * timestamp, such as update_time or read_time.
- */ var he = /** @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 Rt(0, 0));
+        return new t(new Dt(0, 0));
     }, t.max = function() {
-        return new t(new Rt(253402300799, 999999999));
+        return new t(new Dt(253402300799, 999999999));
     }, t.prototype.compareTo = function(t) {
         return this.timestamp._compareTo(t.timestamp);
     }, t.prototype.isEqual = function(t) {
@@ -2044,17 +2043,17 @@ var ne = /** @class */ function(e) {
     }, t.prototype.toTimestamp = function() {
         return this.timestamp;
     }, t;
-}(), pe = /** @class */ function() {
+}(), he = /** @class */ function() {
     function t(t, e) {
-        this.comparator = t, this.root = e || ye.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, ye.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, ye.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) {
@@ -2123,15 +2122,15 @@ var ne = /** @class */ function(e) {
     }, 
     // Returns an iterator over the SortedMap.
     t.prototype.getIterator = function() {
-        return new de(this.root, null, this.comparator, !1);
+        return new pe(this.root, null, this.comparator, !1);
     }, t.prototype.getIteratorFrom = function(t) {
-        return new de(this.root, t, this.comparator, !1);
+        return new pe(this.root, t, this.comparator, !1);
     }, t.prototype.getReverseIterator = function() {
-        return new de(this.root, null, this.comparator, !0);
+        return new pe(this.root, null, this.comparator, !0);
     }, t.prototype.getReverseIteratorFrom = function(t) {
-        return new de(this.root, t, this.comparator, !0);
+        return new pe(this.root, t, this.comparator, !0);
     }, t;
-}(), de = /** @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, 
@@ -2168,7 +2167,7 @@ var ne = /** @class */ function(e) {
             value: t.value
         };
     }, t;
-}(), ye = /** @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;
@@ -2260,10 +2259,10 @@ var ne = /** @class */ function(e) {
     // In a balanced RB tree, the black-depth (number of black nodes) from root to
     // leaves is equal on both sides.  This function verifies that or asserts.
     t.prototype.check = function() {
-        if (this.isRed() && this.left.isRed()) throw I();
-        if (this.right.isRed()) throw I();
+        if (this.isRed() && this.left.isRed()) throw k();
+        if (this.right.isRed()) throw k();
         var t = this.left.check();
-        if (t !== this.right.check()) throw I();
+        if (t !== this.right.check()) throw k();
         return t + (this.isRed() ? 0 : 1);
     }, t;
 }();
@@ -2289,39 +2288,39 @@ var ne = /** @class */ function(e) {
 // end LLRBNode
 // Empty node is shared between all LLRB trees.
 // eslint-disable-next-line @typescript-eslint/no-explicit-any
-ye.EMPTY = null, ye.RED = !0, ye.BLACK = !1, 
+de.EMPTY = null, de.RED = !0, de.BLACK = !1, 
 // end LLRBEmptyNode
-ye.EMPTY = new (/** @class */ function() {
+de.EMPTY = new (/** @class */ function() {
     function t() {
         this.size = 0;
     }
     return Object.defineProperty(t.prototype, "key", {
         get: function() {
-            throw I();
+            throw k();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "value", {
         get: function() {
-            throw I();
+            throw k();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "color", {
         get: function() {
-            throw I();
+            throw k();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "left", {
         get: function() {
-            throw I();
+            throw k();
         },
         enumerable: !1,
         configurable: !0
     }), Object.defineProperty(t.prototype, "right", {
         get: function() {
-            throw I();
+            throw k();
         },
         enumerable: !1,
         configurable: !0
@@ -2332,7 +2331,7 @@ ye.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 ye(t, e);
+        return new de(t, e);
     }, 
     // Returns a copy of the tree, with the specified key removed.
     t.prototype.remove = function(t, e) {
@@ -2381,9 +2380,9 @@ ye.EMPTY = new (/** @class */ function() {
  * NOTE: if provided comparator returns 0 for two elements, we consider them to
  * be equal!
  */
-var me = /** @class */ function() {
+var ye = /** @class */ function() {
     function t(t) {
-        this.comparator = t, this.data = new pe(this.comparator);
+        this.comparator = t, this.data = new he(this.comparator);
     }
     return t.prototype.has = function(t) {
         return null !== this.data.get(t);
@@ -2423,9 +2422,9 @@ var me = /** @class */ function() {
         var e = this.data.getIteratorFrom(t);
         return e.hasNext() ? e.getNext().key : null;
     }, t.prototype.getIterator = function() {
-        return new ve(this.data.getIterator());
+        return new me(this.data.getIterator());
     }, t.prototype.getIteratorFrom = function(t) {
-        return new ve(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));
@@ -2462,7 +2461,7 @@ var me = /** @class */ function() {
         var n = new t(this.comparator);
         return n.data = e, n;
     }, t;
-}(), ve = /** @class */ function() {
+}(), me = /** @class */ function() {
     function t(t) {
         this.iter = t;
     }
@@ -2476,7 +2475,7 @@ var me = /** @class */ function() {
         this.fields = t, 
         // TODO(dimond): validation of FieldMask
         // Sort the field mask to support `FieldMask.isEqual()` and assert below.
-        t.sort(it.comparator);
+        t.sort(rt.comparator);
     }
     return t.empty = function() {
         return new t([]);
@@ -2486,7 +2485,7 @@ var me = /** @class */ function() {
      * fields paths to this field mask.
      */
     t.prototype.unionWith = function(e) {
-        for (var n = new me(it.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);
         }
@@ -2508,11 +2507,11 @@ var me = /** @class */ function() {
         }
         return !1;
     }, t.prototype.isEqual = function(t) {
-        return kt(this.fields, t.fields, (function(t, e) {
+        return St(this.fields, t.fields, (function(t, e) {
             return t.isEqual(e);
         }));
     }, t;
-}(), we = /** @class */ function() {
+}(), ve = /** @class */ function() {
     function t(t) {
         this.value = t;
     }
@@ -2529,7 +2528,7 @@ var me = /** @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 (!Ht(e = (e.mapValue.fields || {})[t.get(n)])) return null;
+        for (var e = this.value, n = 0; n < t.length - 1; ++n) if (!Yt(e = (e.mapValue.fields || {})[t.get(n)])) return null;
         return (e = (e.mapValue.fields || {})[t.lastSegment()]) || null;
     }, 
     /**
@@ -2539,7 +2538,7 @@ var me = /** @class */ function() {
      * @param value - The value to set.
      */
     t.prototype.set = function(t, e) {
-        this.getFieldsMap(t.popLast())[t.lastSegment()] = Wt(e);
+        this.getFieldsMap(t.popLast())[t.lastSegment()] = Ht(e);
     }, 
     /**
      * Sets the provided fields to the provided values.
@@ -2547,14 +2546,14 @@ var me = /** @class */ function() {
      * @param data - A map of fields to values (or null for deletes).
      */
     t.prototype.setAll = function(t) {
-        var e = this, n = it.emptyPath(), r = {}, i = [];
+        var e = this, n = rt.emptyPath(), r = {}, i = [];
         t.forEach((function(t, o) {
             if (!n.isImmediateParentOf(o)) {
                 // Insert the accumulated changes at this parent location
                 var a = e.getFieldsMap(n);
                 e.applyChanges(a, r, i), r = {}, i = [], n = o.popLast();
             }
-            t ? r[o.lastSegment()] = Wt(t) : i.push(o.lastSegment());
+            t ? r[o.lastSegment()] = Ht(t) : i.push(o.lastSegment());
         }));
         var o = this.getFieldsMap(n);
         this.applyChanges(o, r, i);
@@ -2567,9 +2566,9 @@ var me = /** @class */ function() {
      */
     t.prototype.delete = function(t) {
         var e = this.field(t.popLast());
-        Ht(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
+        Yt(e) && e.mapValue.fields && delete e.mapValue.fields[t.lastSegment()];
     }, t.prototype.isEqual = function(t) {
-        return Mt(this.value, t.value);
+        return Lt(this.value, t.value);
     }, 
     /**
      * Returns the map that contains the leaf element of `path`. If the parent
@@ -2582,7 +2581,7 @@ var me = /** @class */ function() {
         });
         for (var n = 0; n < t.length; ++n) {
             var r = e.mapValue.fields[t.get(n)];
-            Ht(r) && r.mapValue.fields || (r = {
+            Yt(r) && r.mapValue.fields || (r = {
                 mapValue: {
                     fields: {}
                 }
@@ -2595,7 +2594,7 @@ var me = /** @class */ function() {
      * entries.
      */
     t.prototype.applyChanges = function(t, e, n) {
-        At(e, (function(e, n) {
+        It(e, (function(e, n) {
             return t[e] = n;
         }));
         for (var r = 0, i = n; r < i.length; r++) {
@@ -2603,9 +2602,9 @@ var me = /** @class */ function() {
             delete t[o];
         }
     }, t.prototype.clone = function() {
-        return new t(Wt(this.value));
+        return new t(Ht(this.value));
     }, t;
-}(), _e = /** @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
@@ -2616,9 +2615,9 @@ var me = /** @class */ function() {
     }
     return t.newInvalidDocument = function(e) {
         return new t(e, 0 /* DocumentType.INVALID */ , 
-        /* version */ he.min(), 
-        /* readTime */ he.min(), 
-        /* createTime */ he.min(), we.empty(), 0 /* DocumentState.SYNCED */);
+        /* version */ fe.min(), 
+        /* readTime */ fe.min(), 
+        /* createTime */ fe.min(), ve.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist with the given data at the
@@ -2627,14 +2626,14 @@ var me = /** @class */ function() {
     t.newFoundDocument = function(e, n, r, i) {
         return new t(e, 1 /* DocumentType.FOUND_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ he.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 */ he.min(), 
-        /* createTime */ he.min(), we.empty(), 0 /* DocumentState.SYNCED */);
+        /* readTime */ fe.min(), 
+        /* createTime */ fe.min(), ve.empty(), 0 /* DocumentState.SYNCED */);
     }, 
     /**
      * Creates a new document that is known to exist at the given version but
@@ -2644,8 +2643,8 @@ var me = /** @class */ function() {
     t.newUnknownDocument = function(e, n) {
         return new t(e, 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
         /* version */ n, 
-        /* readTime */ he.min(), 
-        /* createTime */ he.min(), we.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
+        /* readTime */ fe.min(), 
+        /* createTime */ fe.min(), ve.empty(), 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */);
     }, 
     /**
      * Changes the document type to indicate that it exists and that its version
@@ -2657,7 +2656,7 @@ var me = /** @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(he.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;
     }, 
@@ -2667,7 +2666,7 @@ var me = /** @class */ function() {
      */
     t.prototype.convertToNoDocument = function(t) {
         return this.version = t, this.documentType = 2 /* DocumentType.NO_DOCUMENT */ , 
-        this.data = we.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
+        this.data = ve.empty(), this.documentState = 0 /* DocumentState.SYNCED */ , this;
     }, 
     /**
      * Changes the document type to indicate that it exists at a given version but
@@ -2676,12 +2675,12 @@ var me = /** @class */ function() {
      */
     t.prototype.convertToUnknownDocument = function(t) {
         return this.version = t, this.documentType = 3 /* DocumentType.UNKNOWN_DOCUMENT */ , 
-        this.data = we.empty(), this.documentState = 2 /* DocumentState.HAS_COMMITTED_MUTATIONS */ , 
+        this.data = ve.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 = he.min(), 
+        return this.documentState = 1 /* DocumentState.HAS_LOCAL_MUTATIONS */ , this.version = fe.min(), 
         this;
     }, t.prototype.setReadTime = function(t) {
         return this.readTime = t, this;
@@ -2718,7 +2717,7 @@ var me = /** @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;
-}(), be = 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, 
@@ -2733,10 +2732,10 @@ var me = /** @class */ function() {
  * using this factory method, because `Query` provides an implicit `orderBy`
  * property.
  */
-function Te(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 be(t, e, n, r, i, o, a);
+    new _e(t, e, n, r, i, o, a);
 }
 
 /**
@@ -2761,7 +2760,7 @@ function Te(t, e, n, r, i, o, a) {
  * query the RemoteStore results.
  *
  * Visible for testing.
- */ var Ee = 
+ */ 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.
@@ -2786,7 +2785,7 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
 /**
  * Returns whether the query matches a collection group rather than a specific
  * collection.
- */ function Se(t) {
+ */ function Ee(t) {
     return null !== t.collectionGroup;
 }
 
@@ -2796,8 +2795,8 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
  * the SDK and backend always orders by `__name__`). The normalized order-by
  * includes implicit order-bys in addition to the explicit user provided
  * order-bys.
- */ function ke(t) {
-    var e = P(t);
+ */ function Se(t) {
+    var e = A(t);
     if (null === e.S) {
         e.S = [];
         // Any explicit order by fields should be added as is.
@@ -2809,7 +2808,7 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
                 var a = e.explicitOrderBy.length > 0 ? e.explicitOrderBy[e.explicitOrderBy.length - 1].dir : "asc" /* Direction.ASCENDING */ , u = 
         // Returns the sorted set of inequality filter fields used in this query.
         function(t) {
-            var e = new me(it.comparator);
+            var e = new ye(rt.comparator);
             return t.filters.forEach((function(t) {
                 t.getFlattenedFilters().forEach((function(t) {
                     t.isInequality() && (e = e.add(t.field));
@@ -2822,19 +2821,19 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
         // Note: `SortedSet<FieldPath>` sorts the key field before other fields. However, we want the key
         // field to be sorted last.
                 u.forEach((function(t) {
-            n.has(t.canonicalString()) || t.isKeyField() || e.S.push(new le(t, a));
+            n.has(t.canonicalString()) || t.isKeyField() || e.S.push(new ce(t, a));
         })), 
         // Add the document key field to the last if it is not explicitly ordered.
-        n.has(it.keyField().canonicalString()) || e.S.push(new le(it.keyField(), a));
+        n.has(rt.keyField().canonicalString()) || e.S.push(new ce(rt.keyField(), a));
     }
     return e.S;
 }
 
 /**
  * Converts this `Query` instance to its corresponding `Target` representation.
- */ function Ie(t) {
-    var e = P(t);
-    return e.N || (e.N = Ae(e, ke(t))), e.N
+ */ function ke(t) {
+    var e = A(t);
+    return e.N || (e.N = Ie(e, Se(t))), e.N
     /**
  * Converts this `Query` instance to its corresponding `Target` representation,
  * for use within an aggregate query. Unlike targets for non-aggregate queries,
@@ -2843,22 +2842,22 @@ function(t, e, n, r, i, o /* LimitType.First */ , a, u) {
  */;
 }
 
-function Ae(t, e) {
-    if ("F" /* LimitType.First */ === t.limitType) return Te(t.path, t.collectionGroup, e, t.filters, t.limit, t.startAt, t.endAt);
+function Ie(t, e) {
+    if ("F" /* LimitType.First */ === t.limitType) return be(t.path, t.collectionGroup, e, t.filters, t.limit, t.startAt, t.endAt);
     // Flip the orderBy directions since we want the last results
     e = e.map((function(t) {
         var e = "desc" /* Direction.DESCENDING */ === t.dir ? "asc" /* Direction.ASCENDING */ : "desc" /* Direction.DESCENDING */;
-        return new le(t.field, e);
+        return new ce(t.field, e);
     }));
     // We need to swap the cursors to match the now-flipped query ordering.
-    var n = t.endAt ? new Jt(t.endAt.position, t.endAt.inclusive) : null, r = t.startAt ? new Jt(t.startAt.position, t.startAt.inclusive) : null;
+    var n = t.endAt ? new Wt(t.endAt.position, t.endAt.inclusive) : null, r = t.startAt ? new Wt(t.startAt.position, t.startAt.inclusive) : null;
     // Now return as a LimitType.First query.
-        return Te(t.path, t.collectionGroup, e, t.filters, t.limit, n, r);
+        return be(t.path, t.collectionGroup, e, t.filters, t.limit, n, r);
 }
 
-function Pe(t, e) {
+function Ae(t, e) {
     var n = t.filters.concat([ e ]);
-    return new Ee(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);
 }
 
 /**
@@ -2886,9 +2885,9 @@ function Pe(t, e) {
  * The return value is an IntegerValue if it can safely represent the value,
  * otherwise a DoubleValue is returned.
  */
-function Fe(t, e) {
+function Pe(t, e) {
     return function(t) {
-        return "number" == typeof t && Number.isInteger(t) && !yt(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`.
@@ -2910,7 +2909,7 @@ function Fe(t, e) {
             };
         }
         return {
-            doubleValue: yt(e) ? "-0" : e
+            doubleValue: dt(e) ? "-0" : e
         };
     }(t, e);
 }
@@ -2931,36 +2930,36 @@ 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 Oe = function() {
+/** Used to represent a field transform on a mutation. */ var Fe = function() {
     // Make sure that the structural type of `TransformOperation` is unique.
     // See https://github.com/microsoft/TypeScript/issues/5451
     this._ = void 0;
-}, Ve = /** @class */ function(e) {
+}, Oe = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(Oe), Ne = /** @class */ function(e) {
+}(Fe), Ve = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Oe), De = /** @class */ function(e) {
+}(Fe), Ne = /** @class */ function(e) {
     function n(t) {
         var n = this;
         return (n = e.call(this) || this).elements = t, n;
     }
     return t(n, e), n;
-}(Oe), Re = /** @class */ function(e) {
+}(Fe), De = /** @class */ function(e) {
     function n(t, n) {
         var r = this;
         return (r = e.call(this) || this).serializer = t, r.q = n, r;
     }
     return t(n, e), n;
-}(Oe), qe = function(t, e) {
+}(Fe), Re = function(t, e) {
     this.field = t, this.transform = e;
-}, xe = /** @class */ function() {
+}, qe = /** @class */ function() {
     function t(t, e) {
         this.updateTime = t, this.exists = e
         /** Creates a new empty Precondition. */;
@@ -2982,7 +2981,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() {}, je = /** @class */ function(e) {
+}(), xe = function() {}, Ce = /** @class */ function(e) {
     function n(t, n, r, i) {
         void 0 === i && (i = []);
         var o = this;
@@ -2992,7 +2991,7 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ce), Le = /** @class */ function(e) {
+}(xe), je = /** @class */ function(e) {
     function n(t, n, r, i, o) {
         void 0 === o && (o = []);
         var a = this;
@@ -3002,7 +3001,7 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return this.fieldMask;
     }, n;
-}(Ce), Me = /** @class */ function(e) {
+}(xe), Le = /** @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 */ , 
@@ -3011,7 +3010,7 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ce), Ue = /** @class */ function(e) {
+}(xe), Me = /** @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 */ , 
@@ -3020,10 +3019,10 @@ function Fe(t, e) {
     return t(n, e), n.prototype.getFieldMask = function() {
         return null;
     }, n;
-}(Ce), Be = {
+}(xe), Ue = {
     asc: "ASCENDING",
     desc: "DESCENDING"
-}, ze = {
+}, Be = {
     "<": "LESS_THAN",
     "<=": "LESS_THAN_OR_EQUAL",
     ">": "GREATER_THAN",
@@ -3034,10 +3033,10 @@ function Fe(t, e) {
     in: "IN",
     "not-in": "NOT_IN",
     "array-contains-any": "ARRAY_CONTAINS_ANY"
-}, Ge = {
+}, ze = {
     and: "AND",
     or: "OR"
-}, Ke = function(t, e) {
+}, Ge = function(t, e) {
     this.databaseId = t, this.useProto3Json = e;
 };
 
@@ -3053,7 +3052,7 @@ function Fe(t, e) {
 /**
  * Returns a value for a Date that's appropriate to put into a proto.
  */
-function Qe(t, e) {
+function Ke(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
@@ -3064,56 +3063,56 @@ function Qe(t, e) {
  * Returns a value for bytes that's appropriate to put in a proto.
  *
  * Visible for testing.
- */ function Ye(t, e) {
+ */ function Qe(t, e) {
     return t.useProto3Json ? e.toBase64() : e.toUint8Array();
 }
 
-function He(t, e) {
-    return Qe(t, e.toTimestamp());
+function Ye(t, e) {
+    return Ke(t, e.toTimestamp());
 }
 
-function We(t) {
-    return A(!!t), he.fromTimestamp(function(t) {
-        var e = Vt(t);
-        return new Rt(e.seconds, e.nanos);
+function He(t) {
+    return I(!!t), fe.fromTimestamp(function(t) {
+        var e = Ot(t);
+        return new Dt(e.seconds, e.nanos);
     }(t));
 }
 
-function Je(t, e) {
-    return Xe(t, e).canonicalString();
+function We(t, e) {
+    return Je(t, e).canonicalString();
 }
 
-function Xe(t, e) {
+function Je(t, e) {
     var n = function(t) {
-        return new nt([ "projects", t.projectId, "databases", t.database ]);
+        return new et([ "projects", t.projectId, "databases", t.database ]);
     }(t).child("documents");
     return void 0 === e ? n : n.child(e);
 }
 
-function Ze(t, e) {
-    return Je(t.databaseId, e.path);
+function Xe(t, e) {
+    return We(t.databaseId, e.path);
 }
 
-function $e(t, e) {
+function Ze(t, e) {
     var n = function(t) {
-        var e = nt.fromString(t);
-        return A(cn(e)), e;
+        var e = et.fromString(t);
+        return I(sn(e)), e;
     }(e);
-    if (n.get(1) !== t.databaseId.projectId) throw new z(V, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
-    if (n.get(3) !== t.databaseId.database) throw new z(V, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
-    return new ot(function(t) {
-        return A(t.length > 4 && "documents" === t.get(4)), t.popFirst(5);
+    if (n.get(1) !== t.databaseId.projectId) throw new B(O, "Tried to deserialize key from different project: " + n.get(1) + " vs " + t.databaseId.projectId);
+    if (n.get(3) !== t.databaseId.database) throw new B(O, "Tried to deserialize key from different database: " + n.get(3) + " vs " + t.databaseId.database);
+    return new it(function(t) {
+        return I(t.length > 4 && "documents" === t.get(4)), t.popFirst(5);
     }(n));
 }
 
-function tn(t, e, n) {
+function $e(t, e, n) {
     return {
-        name: Ze(t, e),
+        name: Xe(t, e),
         fields: n.value.mapValue.fields
     };
 }
 
-function en(t, e) {
+function tn(t, e) {
     // Dissect the path into parent, collectionId, and optional key filter.
     var n, r = {
         structuredQuery: {}
@@ -3124,10 +3123,10 @@ function en(t, e) {
     } ]) : (n = i.popLast(), r.structuredQuery.from = [ {
         collectionId: i.lastSegment()
     } ]), r.parent = function(t, e) {
-        return Je(t.databaseId, e);
+        return We(t.databaseId, e);
     }(t, n);
     var o = function(t) {
-        if (0 !== t.length) return un(te.create(t, "and" /* CompositeOperator.AND */));
+        if (0 !== t.length) return an($t.create(t, "and" /* CompositeOperator.AND */));
     }(e.filters);
     o && (r.structuredQuery.where = o);
     var a = function(t) {
@@ -3135,15 +3134,15 @@ function en(t, e) {
             // visible for testing
             return function(t) {
                 return {
-                    field: an(t.field),
-                    direction: nn(t.dir)
+                    field: on(t.field),
+                    direction: en(t.dir)
                 };
             }(t);
         }));
     }(e.orderBy);
     a && (r.structuredQuery.orderBy = a);
     var u = function(t, e) {
-        return t.useProto3Json || dt(e) ? e : {
+        return t.useProto3Json || pt(e) ? e : {
             value: e
         };
     }(t, e.limit);
@@ -3163,75 +3162,75 @@ function en(t, e) {
     };
 }
 
+function en(t) {
+    return Ue[t];
+}
+
+// visible for testing
 function nn(t) {
     return Be[t];
 }
 
-// visible for testing
 function rn(t) {
     return ze[t];
 }
 
 function on(t) {
-    return Ge[t];
-}
-
-function an(t) {
     return {
         fieldPath: t.canonicalString()
     };
 }
 
-function un(t) {
-    return t instanceof $t ? function(t) {
+function an(t) {
+    return t instanceof Zt ? function(t) {
         if ("==" /* Operator.EQUAL */ === t.op) {
-            if (Yt(t.value)) return {
+            if (Qt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: on(t.field),
                     op: "IS_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (Kt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: on(t.field),
                     op: "IS_NULL"
                 }
             };
         } else if ("!=" /* Operator.NOT_EQUAL */ === t.op) {
-            if (Yt(t.value)) return {
+            if (Qt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: on(t.field),
                     op: "IS_NOT_NAN"
                 }
             };
-            if (Qt(t.value)) return {
+            if (Kt(t.value)) return {
                 unaryFilter: {
-                    field: an(t.field),
+                    field: on(t.field),
                     op: "IS_NOT_NULL"
                 }
             };
         }
         return {
             fieldFilter: {
-                field: an(t.field),
-                op: rn(t.op),
+                field: on(t.field),
+                op: nn(t.op),
                 value: t.value
             }
         };
-    }(t) : t instanceof te ? function(t) {
+    }(t) : t instanceof $t ? function(t) {
         var e = t.getFilters().map((function(t) {
-            return un(t);
+            return an(t);
         }));
         return 1 === e.length ? e[0] : {
             compositeFilter: {
-                op: on(t.op),
+                op: rn(t.op),
                 filters: e
             }
         };
-    }(t) : I();
+    }(t) : k();
 }
 
-function sn(t) {
+function un(t) {
     var e = [];
     return t.fields.forEach((function(t) {
         return e.push(t.canonicalString());
@@ -3240,7 +3239,7 @@ function sn(t) {
     };
 }
 
-function cn(t) {
+function sn(t) {
     // Resource names have at least 4 components (project ID, database ID)
     return t.length >= 4 && "projects" === t.get(0) && "databases" === t.get(2);
 }
@@ -3260,8 +3259,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 Ke(t, /* useProto3Json= */ !0);
+ */ function cn(t) {
+    return new Ge(t, /* useProto3Json= */ !0);
 }
 
 /**
@@ -3288,7 +3287,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 ln = /** @class */ function() {
     function t(
     /**
      * The AsyncQueue to run backoff operations on.
@@ -3347,7 +3346,7 @@ function cn(t) {
         // honored as such).
         var n = Math.floor(this.U + this.H()), r = Math.max(0, Date.now() - this.W), i = Math.max(0, n - r);
         // Guard against lastAttemptTime being in the future due to a clock change.
-                i > 0 && T("ExponentialBackoff", "Backing off for ".concat(i, " ms (base delay: ").concat(this.U, " ms, delay with jitter: ").concat(n, " ms, last attempt: ").concat(r, " ms ago)")), 
+                i > 0 && b("ExponentialBackoff", "Backing off for ".concat(i, " ms (base delay: ").concat(this.U, " ms, delay with jitter: ").concat(n, " ms, last attempt: ").concat(r, " ms ago)")), 
         this.j = this.$.enqueueAfterDelay(this.timerId, i, (function() {
             return e.W = Date.now(), t();
         })), 
@@ -3362,33 +3361,33 @@ function cn(t) {
     /** Returns a random value in the range [-currentBaseMs/2, currentBaseMs/2] */ t.prototype.H = function() {
         return (Math.random() - .5) * this.U;
     }, t;
-}(), hn = /** @class */ function(e) {
+}(), fn = /** @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.Y = !1, o;
     }
     return t(n, e), n.prototype.Z = function() {
-        if (this.Y) throw new z(C, "The client has already been terminated.");
+        if (this.Y) throw new B(x, "The client has already been terminated.");
     }, 
     /** Invokes the provided RPC with auth and AppCheck tokens. */ n.prototype.P = function(t, e, n, r) {
         var i = this;
         return this.Z(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(o) {
             var a = o[0], u = o[1];
-            return i.connection.P(t, Xe(e, n), r, a, u);
+            return i.connection.P(t, Je(e, n), r, a, u);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === q && (i.authCredentials.invalidateToken(), 
-            i.appCheckCredentials.invalidateToken()), t) : new z(O, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === R && (i.authCredentials.invalidateToken(), 
+            i.appCheckCredentials.invalidateToken()), t) : new B(F, t.toString());
         }));
     }, 
     /** Invokes the provided RPC with streamed results with auth and AppCheck tokens. */ n.prototype.g = function(t, e, n, r, i) {
         var o = this;
         return this.Z(), Promise.all([ this.authCredentials.getToken(), this.appCheckCredentials.getToken() ]).then((function(a) {
             var u = a[0], s = a[1];
-            return o.connection.g(t, Xe(e, n), r, u, s, i);
+            return o.connection.g(t, Je(e, n), r, u, s, i);
         })).catch((function(t) {
-            throw "FirebaseError" === t.name ? (t.code === q && (o.authCredentials.invalidateToken(), 
-            o.appCheckCredentials.invalidateToken()), t) : new z(O, t.toString());
+            throw "FirebaseError" === t.name ? (t.code === R && (o.authCredentials.invalidateToken(), 
+            o.appCheckCredentials.invalidateToken()), t) : new B(F, t.toString());
         }));
     }, n.prototype.terminate = function() {
         this.Y = !0, this.connection.terminate();
@@ -3422,64 +3421,64 @@ function cn(t) {
  */
 // TODO(firestorexp): Make sure there is only one Datastore instance per
 // firestore-exp client.
-function pn(t, r) {
+function hn(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 = P(t), i = {
+                return e = A(t), i = {
                     writes: r.map((function(t) {
                         return function(t, e) {
                             var n;
-                            if (e instanceof je) n = {
-                                update: tn(t, e.key, e.value)
-                            }; else if (e instanceof Me) n = {
-                                delete: Ze(t, e.key)
+                            if (e instanceof Ce) n = {
+                                update: $e(t, e.key, e.value)
                             }; else if (e instanceof Le) n = {
-                                update: tn(t, e.key, e.data),
-                                updateMask: sn(e.fieldMask)
+                                delete: Xe(t, e.key)
+                            }; else if (e instanceof je) n = {
+                                update: $e(t, e.key, e.data),
+                                updateMask: un(e.fieldMask)
                             }; else {
-                                if (!(e instanceof Ue)) return I();
+                                if (!(e instanceof Me)) return k();
                                 n = {
-                                    verify: Ze(t, e.key)
+                                    verify: Xe(t, e.key)
                                 };
                             }
                             return e.fieldTransforms.length > 0 && (n.updateTransforms = e.fieldTransforms.map((function(t) {
                                 return function(t, e) {
                                     var n = e.transform;
-                                    if (n instanceof Ve) return {
+                                    if (n instanceof Oe) return {
                                         fieldPath: e.field.canonicalString(),
                                         setToServerValue: "REQUEST_TIME"
                                     };
-                                    if (n instanceof Ne) return {
+                                    if (n instanceof Ve) return {
                                         fieldPath: e.field.canonicalString(),
                                         appendMissingElements: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof De) return {
+                                    if (n instanceof Ne) return {
                                         fieldPath: e.field.canonicalString(),
                                         removeAllFromArray: {
                                             values: n.elements
                                         }
                                     };
-                                    if (n instanceof Re) return {
+                                    if (n instanceof De) return {
                                         fieldPath: e.field.canonicalString(),
                                         increment: n.q
                                     };
-                                    throw I();
+                                    throw k();
                                 }(0, t);
                             }))), e.precondition.isNone || (n.currentDocument = function(t, e) {
                                 return void 0 !== e.updateTime ? {
-                                    updateTime: He(t, e.updateTime)
+                                    updateTime: Ye(t, e.updateTime)
                                 } : void 0 !== e.exists ? {
                                     exists: e.exists
-                                } : I();
+                                } : k();
                             }(t, e.precondition)), n;
                         }(e.serializer, t);
                     }))
-                }, [ 4 /*yield*/ , e.P("Commit", e.serializer.databaseId, nt.emptyPath(), i) ];
+                }, [ 4 /*yield*/ , e.P("Commit", e.serializer.databaseId, et.emptyPath(), i) ];
 
               case 1:
                 return n.sent(), [ 2 /*return*/ ];
@@ -3488,39 +3487,39 @@ function pn(t, r) {
     }));
 }
 
-function dn(t, r) {
+function pn(t, r) {
     return e(this, void 0, void 0, (function() {
         var e, i, o, a, u;
         return n(this, (function(n) {
             switch (n.label) {
               case 0:
-                return e = P(t), i = {
+                return e = A(t), i = {
                     documents: r.map((function(t) {
-                        return Ze(e.serializer, t);
+                        return Xe(e.serializer, t);
                     }))
-                }, [ 4 /*yield*/ , e.g("BatchGetDocuments", e.serializer.databaseId, nt.emptyPath(), i, r.length) ];
+                }, [ 4 /*yield*/ , e.g("BatchGetDocuments", e.serializer.databaseId, et.emptyPath(), i, r.length) ];
 
               case 1:
                 return o = n.sent(), a = new Map, o.forEach((function(t) {
                     var n = function(t, e) {
                         return "found" in e ? function(t, e) {
-                            A(!!e.found), e.found.name, e.found.updateTime;
-                            var n = $e(t, e.found.name), r = We(e.found.updateTime), i = e.found.createTime ? We(e.found.createTime) : he.min(), o = new we({
+                            I(!!e.found), e.found.name, e.found.updateTime;
+                            var n = Ze(t, e.found.name), r = He(e.found.updateTime), i = e.found.createTime ? He(e.found.createTime) : fe.min(), o = new ve({
                                 mapValue: {
                                     fields: e.found.fields
                                 }
                             });
-                            return _e.newFoundDocument(n, r, i, o);
+                            return we.newFoundDocument(n, r, i, o);
                         }(t, e) : "missing" in e ? function(t, e) {
-                            A(!!e.missing), A(!!e.readTime);
-                            var n = $e(t, e.missing), r = We(e.readTime);
-                            return _e.newNoDocument(n, r);
-                        }(t, e) : I();
+                            I(!!e.missing), I(!!e.readTime);
+                            var n = Ze(t, e.missing), r = He(e.readTime);
+                            return we.newNoDocument(n, r);
+                        }(t, e) : k();
                     }(e.serializer, t);
                     a.set(n.key.toString(), n);
                 })), u = [], [ 2 /*return*/ , (r.forEach((function(t) {
                     var e = a.get(t.toString());
-                    A(!!e), u.push(e);
+                    I(!!e), u.push(e);
                 })), u) ];
             }
         }));
@@ -3543,7 +3542,7 @@ function dn(t, r) {
  * See the License for the specific language governing permissions and
  * limitations under the License.
  */
-var yn = new Map;
+var dn = new Map;
 
 /**
  * An instance map that ensures only one Datastore exists per Firestore
@@ -3553,20 +3552,20 @@ 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 z(C, "The client has already been terminated.");
-    if (!yn.has(t)) {
-        T("ComponentProvider", "Initializing Datastore");
+ */ function yn(t) {
+    if (t._terminated) throw new B(x, "The client has already been terminated.");
+    if (!dn.has(t)) {
+        b("ComponentProvider", "Initializing Datastore");
         var e = function(t) {
-            return new _t(t, fetch.bind(null));
+            return new wt(t, fetch.bind(null));
         }(function(t, e, n, r) {
-            return new $(t, e, n, r.host, r.ssl, r.experimentalForceLongPolling, r.experimentalAutoDetectLongPolling, ht(r.experimentalLongPollingOptions), r.useFetchStreams);
-        }(t._databaseId, t.app.options.appId || "", t._persistenceKey, t._freezeSettings())), n = ln(t._databaseId), r = function(t, e, n, r) {
-            return new hn(t, e, n, r);
+            return new Z(t, e, n, r.host, r.ssl, r.experimentalForceLongPolling, r.experimentalAutoDetectLongPolling, ft(r.experimentalLongPollingOptions), r.useFetchStreams);
+        }(t._databaseId, t.app.options.appId || "", t._persistenceKey, t._freezeSettings())), n = cn(t._databaseId), r = function(t, e, n, r) {
+            return new fn(t, e, n, r);
         }(t._authCredentials, t._appCheckCredentials, e, n);
-        yn.set(t, r);
+        dn.set(t, r);
     }
-    return yn.get(t);
+    return dn.get(t);
 }
 
 /**
@@ -3577,32 +3576,32 @@ 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 mn = /** @class */ function() {
     function t(t) {
         var e, n;
         if (void 0 === t.host) {
-            if (void 0 !== t.ssl) throw new z(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.localCache = t.localCache, void 0 === t.cacheSizeBytes) this.cacheSizeBytes = 41943040; else {
-            if (-1 !== t.cacheSizeBytes && t.cacheSizeBytes < 1048576) throw new z(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 z(V, "".concat(t, " and ").concat(n, " cannot be used together."));
+            if (!0 === e && !0 === r) throw new B(O, "".concat(t, " and ").concat(n, " cannot be used together."));
         }("experimentalForceLongPolling", t.experimentalForceLongPolling, "experimentalAutoDetectLongPolling", t.experimentalAutoDetectLongPolling), 
         this.experimentalForceLongPolling = !!t.experimentalForceLongPolling, 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.experimentalLongPollingOptions = ht(null !== (n = t.experimentalLongPollingOptions) && void 0 !== n ? n : {}), 
+        this.experimentalLongPollingOptions = ft(null !== (n = t.experimentalLongPollingOptions) && void 0 !== n ? n : {}), 
         function(t) {
             if (void 0 !== t.timeoutSeconds) {
-                if (isNaN(t.timeoutSeconds)) throw new z(V, "invalid long polling timeout: ".concat(t.timeoutSeconds, " (must not be NaN)"));
-                if (t.timeoutSeconds < 5) throw new z(V, "invalid long polling timeout: ".concat(t.timeoutSeconds, " (minimum allowed value is 5)"));
-                if (t.timeoutSeconds > 30) throw new z(V, "invalid long polling timeout: ".concat(t.timeoutSeconds, " (maximum allowed value is 30)"));
+                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;
     }
@@ -3619,7 +3618,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 mn({}), 
         this._settingsFrozen = !1;
     }
     return Object.defineProperty(t.prototype, "app", {
@@ -3628,7 +3627,7 @@ var yn = new Map;
          * instance.
          */
         get: function() {
-            if (!this._app) throw new z(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,
@@ -3646,18 +3645,18 @@ var yn = new Map;
         enumerable: !1,
         configurable: !0
     }), t.prototype._setSettings = function(t) {
-        if (this._settingsFrozen) throw new z(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 (!t) return new Q;
+        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 mn(t), void 0 !== t.credentials && (this._authCredentials = function(t) {
+            if (!t) return new K;
             switch (t.type) {
               case "firstParty":
-                return new J(t.sessionIndex || "0", t.iamToken || null, t.authTokenFactory || null);
+                return new W(t.sessionIndex || "0", t.iamToken || null, t.authTokenFactory || null);
 
               case "provider":
                 return t.client;
 
               default:
-                throw new z(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() {
@@ -3682,29 +3681,29 @@ var yn = new Map;
      * Only ever called once.
      */
     t.prototype._terminate = function() {
-        return t = this, (e = yn.get(t)) && (T("ComponentProvider", "Removing Datastore"), 
-        yn.delete(t), e.terminate()), Promise.resolve();
+        return t = this, (e = dn.get(t)) && (b("ComponentProvider", "Removing Datastore"), 
+        dn.delete(t), e.terminate()), Promise.resolve();
         var t, e;
     }, t;
 }();
 
-function wn(t, e, n) {
+function vn(t, e, n) {
     n || (n = "(default)");
     var r = _getProvider(t, "firestore/lite");
-    if (r.isInitialized(n)) throw new z(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 wn(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 = y("firestore");
-        a && bn.apply(void 0, r([ o ], a, !1));
+        a && _n.apply(void 0, r([ o ], a, !1));
     }
     return o;
 }
@@ -3721,11 +3720,11 @@ 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 _n(t, e, n, r) {
     var i;
     void 0 === r && (r = {});
-    var o = (t = lt(t, gn))._getSettings(), a = "".concat(e, ":").concat(n);
-    if ("firestore.googleapis.com" !== o.host && o.host !== a && S("Host has been set in both settings() and connectFirestoreEmulator(), emulator host will be used."), 
+    var o = (t = ct(t, gn))._getSettings(), a = "".concat(e, ":").concat(n);
+    if ("firestore.googleapis.com" !== o.host && o.host !== a && E("Host has been set in both settings() and connectFirestoreEmulator(), emulator host will be used."), 
     t._setSettings(Object.assign(Object.assign({}, o), {
         host: a,
         ssl: !1
@@ -3736,10 +3735,10 @@ function _n(t, e) {
             // invalid field "uid" and missing field "sub" / "user_id".)
             u = m(r.mockUserToken, null === (i = t._app) || void 0 === i ? void 0 : i.options.projectId);
             var c = r.mockUserToken.sub || r.mockUserToken.user_id;
-            if (!c) throw new z(V, "mockUserToken must contain 'sub' or 'user_id' field!");
+            if (!c) throw new B(O, "mockUserToken must contain 'sub' or 'user_id' field!");
             s = new g(c);
         }
-        t._authCredentials = new Y(new K(u, s));
+        t._authCredentials = new Q(new G(u, s));
     }
 }
 
@@ -3762,8 +3761,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 = lt(t, gn), s(t.app, "firestore/lite"), t._delete();
+ */ function bn(t) {
+    return t = ct(t, gn), s(t.app, "firestore/lite"), t._delete();
 }
 
 /**
@@ -3802,7 +3801,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 Tn = 
 /**
      * Create a new AggregateField<T>
      * @param aggregateType Specifies the type of aggregation operation to perform.
@@ -3813,7 +3812,7 @@ function(t, e) {
     void 0 === t && (t = "count"), this._internalFieldPath = e, 
     /** A type string to uniquely identify instances of this class. */
     this.type = "AggregateField", this.aggregateType = t;
-}, Sn = /** @class */ function() {
+}, En = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e, n) {
         this._userDataWriter = e, this._data = n, 
@@ -3834,7 +3833,7 @@ function(t, e) {
     return t.prototype.data = function() {
         return this._userDataWriter.convertObjectMap(this._data);
     }, t;
-}(), kn = /** @class */ function() {
+}(), Sn = /** @class */ function() {
     // This is the lite version of the Query class in the main SDK.
     /** @hideconstructor protected */
     function t(t, 
@@ -3849,7 +3848,7 @@ function(t, e) {
     return t.prototype.withConverter = function(e) {
         return new t(this.firestore, e, this._query);
     }, t;
-}(), In = /** @class */ function() {
+}(), kn = /** @class */ function() {
     /** @hideconstructor */
     function t(t, 
     /**
@@ -3890,19 +3889,19 @@ function(t, e) {
          * The collection this `DocumentReference` belongs to.
          */
         get: function() {
-            return new An(this.firestore, this.converter, this._key.path.popLast());
+            return new In(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;
-}(), An = /** @class */ function(e) {
+}(), In = /** @class */ function(e) {
     /** @hideconstructor */
     function n(t, n, r) {
         var i = this;
         return i = e.call(this, t, n, function(t) {
-            return new Ee(t);
+            return new Te(t);
         }(r)) || this, i._path = r, 
         /** The type of this Firestore reference. */
         i.type = "collection", i;
@@ -3930,27 +3929,27 @@ function(t, e) {
          */
         get: function() {
             var t = this._path.popLast();
-            return t.isEmpty() ? null : new In(this.firestore, 
-            /* converter= */ null, new ot(t));
+            return t.isEmpty() ? null : new kn(this.firestore, 
+            /* converter= */ null, new it(t));
         },
         enumerable: !1,
         configurable: !0
     }), n.prototype.withConverter = function(t) {
         return new n(this.firestore, t, this._path);
     }, n;
-}(kn);
+}(Sn);
 
 /**
  * The results of executing an aggregation query.
- */ function Pn(t, e) {
+ */ function An(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
-    if (t = d(t), at("collection", "path", e), t instanceof gn) {
-        var o = nt.fromString.apply(nt, r([ e ], n, !1));
-        return st(o), new An(t, /* converter= */ null, o);
+    if (t = d(t), ot("collection", "path", e), t instanceof gn) {
+        var o = et.fromString.apply(et, r([ e ], n, !1));
+        return ut(o), new In(t, /* converter= */ null, o);
     }
-    if (!(t instanceof In || t instanceof An)) throw new z(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(nt.fromString.apply(nt, r([ e ], n, !1)));
-    return st(a), new An(t.firestore, 
+    if (!(t instanceof kn || t instanceof In)) 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 In(t.firestore, 
     /* converter= */ null, a);
 }
 
@@ -3966,27 +3965,27 @@ function(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 Fn(t, e) {
-    if (t = lt(t, gn), at("collectionGroup", "collection id", e), e.indexOf("/") >= 0) throw new z(V, "Invalid collection ID '".concat(e, "' passed to function collectionGroup(). Collection IDs must not contain '/'."));
-    return new kn(t, 
+ */ function Pn(t, e) {
+    if (t = ct(t, gn), 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 Sn(t, 
     /* converter= */ null, function(t) {
-        return new Ee(nt.emptyPath(), t);
+        return new Te(et.emptyPath(), t);
     }(e));
 }
 
-function On(t, e) {
+function Fn(t, e) {
     for (var n = [], i = 2; i < arguments.length; i++) n[i - 2] = arguments[i];
     if (t = d(t), 
     // We allow omission of 'pathString' but explicitly prohibit passing in both
     // 'undefined' and 'null'.
-    1 === arguments.length && (e = Et.newId()), at("doc", "path", e), t instanceof gn) {
-        var o = nt.fromString.apply(nt, r([ e ], n, !1));
-        return ut(o), new In(t, 
-        /* converter= */ null, new ot(o));
+    1 === arguments.length && (e = Tt.newId()), ot("doc", "path", e), t instanceof gn) {
+        var o = et.fromString.apply(et, r([ e ], n, !1));
+        return at(o), new kn(t, 
+        /* converter= */ null, new it(o));
     }
-    if (!(t instanceof In || t instanceof An)) throw new z(V, "Expected first argument to collection() to be a CollectionReference, a DocumentReference or FirebaseFirestore");
-    var a = t._path.child(nt.fromString.apply(nt, r([ e ], n, !1)));
-    return ut(a), new In(t.firestore, t instanceof An ? t.converter : null, new ot(a));
+    if (!(t instanceof kn || t instanceof In)) 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 In ? t.converter : null, new it(a));
 }
 
 /**
@@ -3996,8 +3995,8 @@ function On(t, e) {
  * @param right - A reference to compare.
  * @returns true if the references point to the same location in the same
  * Firestore database.
- */ function Vn(t, e) {
-    return t = d(t), e = d(e), (t instanceof In || t instanceof An) && (e instanceof In || e instanceof An) && t.firestore === e.firestore && t.path === e.path && t.converter === e.converter
+ */ function On(t, e) {
+    return t = d(t), e = d(e), (t instanceof kn || t instanceof In) && (e instanceof kn || e instanceof In) && 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.
@@ -4009,16 +4008,16 @@ function On(t, e) {
  */;
 }
 
-function Nn(t, e) {
-    return t = d(t), e = d(e), t instanceof kn && e instanceof kn && t.firestore === e.firestore && function(t, e) {
+function Vn(t, e) {
+    return t = d(t), e = d(e), t instanceof Sn && e instanceof Sn && 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 (!fe(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 (!ee(t.filters[r], e.filters[r])) return !1;
-            return t.collectionGroup === e.collectionGroup && !!t.path.isEqual(e.path) && !!Xt(t.startAt, e.startAt) && Xt(t.endAt, e.endAt);
-        }(Ie(t), Ie(e)) && t.limitType === e.limitType;
+            for (var r = 0; r < t.filters.length; r++) if (!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);
+        }(ke(t), ke(e)) && t.limitType === e.limitType;
     }(t._query, e._query) && t.converter === e.converter
     /**
  * @license
@@ -4041,7 +4040,7 @@ function Nn(t, e) {
  */;
 }
 
-var Dn = /** @class */ function() {
+var Nn = /** @class */ function() {
     /** @hideconstructor */
     function t(t) {
         this._byteString = t;
@@ -4053,9 +4052,9 @@ var Dn = /** @class */ function() {
      * @param base64 - The Base64 string used to create the `Bytes` object.
      */    return t.fromBase64String = function(e) {
         try {
-            return new t(Ft.fromBase64String(e));
+            return new t(Pt.fromBase64String(e));
         } catch (e) {
-            throw new z(V, "Failed to construct data from Base64 string: " + e);
+            throw new B(O, "Failed to construct data from Base64 string: " + e);
         }
     }, 
     /**
@@ -4064,7 +4063,7 @@ var Dn = /** @class */ function() {
      * @param array - The Uint8Array used to create the `Bytes` object.
      */
     t.fromUint8Array = function(e) {
-        return new t(Ft.fromUint8Array(e));
+        return new t(Pt.fromUint8Array(e));
     }, 
     /**
      * Returns the underlying bytes as a Base64-encoded string.
@@ -4099,7 +4098,7 @@ var Dn = /** @class */ function() {
     t.prototype.isEqual = function(t) {
         return this._byteString.isEqual(t._byteString);
     }, t;
-}(), Rn = /** @class */ function() {
+}(), Dn = /** @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.
@@ -4108,8 +4107,8 @@ var Dn = /** @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 z(V, "Invalid field name at argument $(i + 1). Field names must not be empty.");
-        this._internalPath = new it(t);
+        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);
     }
     /**
      * Returns true if this `FieldPath` is equal to the provided one.
@@ -4149,8 +4148,8 @@ var Dn = /** @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 qn() {
-    return new Rn("__name__");
+function Rn() {
+    return new Dn("__name__");
 }
 
 /**
@@ -4172,14 +4171,14 @@ function qn() {
 /**
  * Sentinel values that can be used when writing document fields with `set()`
  * or `update()`.
- */ var xn = 
+ */ var qn = 
 /**
      * @param _methodName - The public API endpoint that returns this class.
      * @hideconstructor
      */
 function(t) {
     this._methodName = t;
-}, Cn = /** @class */ function() {
+}, xn = /** @class */ function() {
     /**
      * Creates a new immutable `GeoPoint` object with the provided latitude and
      * longitude values.
@@ -4187,8 +4186,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 z(V, "Latitude must be a number between -90 and 90, but was: " + t);
-        if (!isFinite(e) || e < -180 || e > 180) throw new z(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", {
@@ -4230,23 +4229,23 @@ function(t) {
      * with an underscore.
      */
     t.prototype._compareTo = function(t) {
-        return St(this._lat, t._lat) || St(this._long, t._long);
+        return Et(this._lat, t._lat) || Et(this._long, t._long);
     }, t;
-}(), jn = /^__.*__$/, Ln = /** @class */ function() {
+}(), Cn = /^__.*__$/, jn = /** @class */ function() {
     function t(t, e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return null !== this.fieldMask ? new Le(t, this.data, this.fieldMask, e, this.fieldTransforms) : new je(t, this.data, e, this.fieldTransforms);
+        return null !== this.fieldMask ? new je(t, this.data, this.fieldMask, e, this.fieldTransforms) : new Ce(t, this.data, e, this.fieldTransforms);
     }, t;
-}(), Mn = /** @class */ function() {
+}(), Ln = /** @class */ function() {
     function t(t, 
     // The fieldMask does not include document transforms.
     e, n) {
         this.data = t, this.fieldMask = e, this.fieldTransforms = n;
     }
     return t.prototype.toMutation = function(t, e) {
-        return new Le(t, this.data, this.fieldMask, e, this.fieldTransforms);
+        return new je(t, this.data, this.fieldMask, e, this.fieldTransforms);
     }, t;
 }();
 
@@ -4272,7 +4271,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 Mn(t) {
     switch (t) {
       case 0 /* UserDataSource.Set */ :
  // fall through
@@ -4286,11 +4285,11 @@ function(t) {
         return !1;
 
       default:
-        throw I();
+        throw k();
     }
 }
 
-/** A "context" object passed around while parsing user data. */ var Bn = /** @class */ function() {
+/** A "context" object passed around while parsing user data. */ var Un = /** @class */ function() {
     /**
      * Initializes a ParseContext with the given source and path.
      *
@@ -4350,7 +4349,7 @@ function(t) {
             it: !0
         });
     }, t.prototype._t = function(t) {
-        return sr(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.lt);
+        return ur(t, this.settings.methodName, this.settings.ct || !1, this.path, this.settings.lt);
     }, 
     /** Returns 'true' if 'fieldPath' was traversed when creating this context. */ t.prototype.contains = function(t) {
         return void 0 !== this.fieldMask.find((function(e) {
@@ -4364,19 +4363,19 @@ function(t) {
         if (this.path) for (var t = 0; t < this.path.length; t++) this.st(this.path.get(t));
     }, t.prototype.st = function(t) {
         if (0 === t.length) throw this._t("Document fields must not be empty");
-        if (Un(this.et) && jn.test(t)) throw this._t('Document fields cannot begin and end with "__"');
+        if (Mn(this.et) && Cn.test(t)) throw this._t('Document fields cannot begin and end with "__"');
     }, t;
-}(), zn = /** @class */ function() {
+}(), Bn = /** @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 || cn(t)
         /** Creates a new top-level parse context. */;
     }
     return t.prototype.ht = function(t, e, n, r) {
-        return void 0 === r && (r = !1), new Bn({
+        return void 0 === r && (r = !1), new Un({
             et: t,
             methodName: e,
             lt: n,
-            path: it.emptyPath(),
+            path: rt.emptyPath(),
             it: !1,
             ct: r
         }, this.databaseId, this.serializer, this.ignoreUndefinedProperties);
@@ -4386,30 +4385,30 @@ function(t) {
 /**
  * Helper for parsing raw user input (provided via the API) into internal model
  * classes.
- */ function Gn(t) {
-    var e = t._freezeSettings(), n = ln(t._databaseId);
-    return new zn(t._databaseId, !!e.ignoreUndefinedProperties, n);
+ */ function zn(t) {
+    var e = t._freezeSettings(), n = cn(t._databaseId);
+    return new Bn(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.ht(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);
+    rr("Data must be an object, but it was:", a, r);
+    var u, s, c = er(r, a);
     if (o.merge) u = new ge(a.fieldMask), s = a.fieldTransforms; else if (o.mergeFields) {
         for (var l = [], f = 0, h = o.mergeFields; f < h.length; f++) {
-            var p = or(e, h[f], n);
-            if (!a.contains(p)) throw new z(V, "Field '".concat(p, "' is specified in your field mask but missing from your input data."));
-            cr(l, p) || l.push(p);
+            var p = ir(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."));
+            sr(l, p) || l.push(p);
         }
         u = new ge(l), s = a.fieldTransforms.filter((function(t) {
             return u.covers(t.field);
         }));
     } else u = null, s = a.fieldTransforms;
-    return new Ln(new we(c), u, s);
+    return new jn(new ve(c), u, s);
 }
 
-var Qn = /** @class */ function(e) {
+var Kn = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4421,7 +4420,7 @@ var Qn = /** @class */ function(e) {
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(xn);
+}(qn);
 
 /**
  * Creates a child context for parsing SerializableFieldValues.
@@ -4438,8 +4437,8 @@ var Qn = /** @class */ function(e) {
  *     context.
  * @param context - The parent context.
  * @param arrayElement - Whether or not the FieldValue has an array.
- */ function Yn(t, e, n) {
-    return new Bn({
+ */ function Qn(t, e, n) {
+    return new Un({
         et: 3 /* UserDataSource.Argument */ ,
         lt: e.settings.lt,
         methodName: t._methodName,
@@ -4447,98 +4446,98 @@ var Qn = /** @class */ function(e) {
     }, e.databaseId, e.serializer, e.ignoreUndefinedProperties);
 }
 
-var Hn = /** @class */ function(e) {
+var Yn = /** @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 Oe);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n;
     }, n;
-}(xn), Wn = /** @class */ function(e) {
+}(qn), Hn = /** @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 = Yn(this, t, 
+        var e = Qn(this, t, 
         /*array=*/ !0), n = this.dt.map((function(t) {
-            return er(t, e);
-        })), r = new Ne(n);
-        return new qe(t.path, r);
+            return tr(t, e);
+        })), r = new Ve(n);
+        return new Re(t.path, r);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n && p(this.dt, t.dt);
     }, n;
-}(xn), Jn = /** @class */ function(e) {
+}(qn), Wn = /** @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 = Yn(this, t, 
+        var e = Qn(this, t, 
         /*array=*/ !0), n = this.dt.map((function(t) {
-            return er(t, e);
-        })), r = new De(n);
-        return new qe(t.path, r);
+            return tr(t, e);
+        })), r = new Ne(n);
+        return new Re(t.path, r);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n && p(this.dt, t.dt);
     }, n;
-}(xn), Xn = /** @class */ function(e) {
+}(qn), 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 = new Re(t.serializer, Fe(t.serializer, this.ft));
-        return new qe(t.path, e);
+        var e = new De(t.serializer, Pe(t.serializer, this.ft));
+        return new Re(t.path, e);
     }, n.prototype.isEqual = function(t) {
         return t instanceof n && this.ft === t.ft;
     }, n;
-}(xn);
+}(qn);
 
-/** Parse update data from an update() call. */ function Zn(t, e, n, r) {
+/** Parse update data from an update() call. */ function Xn(t, e, n, r) {
     var i = t.ht(1 /* UserDataSource.Update */ , e, n);
-    ir("Data must be an object, but it was:", i, r);
-    var o = [], a = we.empty();
-    At(r, (function(t, r) {
-        var u = ur(e, t, n);
+    rr("Data must be an object, but it was:", i, r);
+    var o = [], a = ve.empty();
+    It(r, (function(t, r) {
+        var u = ar(e, t, n);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
                 r = d(r);
         var s = i.ot(u);
-        if (r instanceof Qn) 
+        if (r instanceof Kn) 
         // Add it to the field mask, but don't add anything to updateData.
         o.push(u); else {
-            var c = er(r, s);
+            var c = tr(r, s);
             null != c && (o.push(u), a.set(u, c));
         }
     }));
     var u = new ge(o);
-    return new Mn(a, u, i.fieldTransforms);
+    return new Ln(a, u, i.fieldTransforms);
 }
 
-/** Parse update data from a list of field/value arguments. */ function $n(t, e, n, r, i, o) {
-    var a = t.ht(1 /* UserDataSource.Update */ , e, n), u = [ or(e, r, n) ], s = [ i ];
-    if (o.length % 2 != 0) throw new z(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 Zn(t, e, n, r, i, o) {
+    var a = t.ht(1 /* UserDataSource.Update */ , e, n), u = [ ir(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(ir(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 = we.empty(), h = u.length - 1; h >= 0; --h) if (!cr(l, u[h])) {
+    for (var l = [], f = ve.empty(), h = u.length - 1; h >= 0; --h) if (!sr(l, u[h])) {
         var p = u[h], y = s[h];
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
         y = d(y);
         var m = a.ot(p);
-        if (y instanceof Qn) 
+        if (y instanceof Kn) 
         // Add it to the field mask, but don't add anything to updateData.
         l.push(p); else {
-            var v = er(y, m);
-            null != v && (l.push(p), f.set(p, v));
+            var g = tr(y, m);
+            null != g && (l.push(p), f.set(p, g));
         }
     }
-    var g = new ge(l);
-    return new Mn(f, g, a.fieldTransforms);
+    var v = new ge(l);
+    return new Ln(f, v, a.fieldTransforms);
 }
 
 /**
@@ -4547,8 +4546,8 @@ var Hn = /** @class */ function(e) {
  *
  * @param allowArrays - Whether the query value is an array that may directly
  * contain additional arrays (e.g. the operand of an `in` query).
- */ function tr(t, e, n, r) {
-    return void 0 === r && (r = !1), er(n, t.ht(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
+ */ function $n(t, e, n, r) {
+    return void 0 === r && (r = !1), tr(n, t.ht(r ? 4 /* UserDataSource.ArrayArgument */ : 3 /* UserDataSource.Argument */ , e));
 }
 
 /**
@@ -4559,12 +4558,12 @@ var Hn = /** @class */ function(e) {
  * the source of the data being parsed, etc.
  * @returns The parsed value, or null if the value was a FieldValue sentinel
  * that should not be included in the resulting parsed data.
- */ function er(t, e) {
-    if (rr(
+ */ function tr(t, e) {
+    if (nr(
     // Unwrap the API type from the Compat SDK. This will return the API type
     // from firestore-exp.
-    t = d(t))) return ir("Unsupported field value:", e, t), nr(t, e);
-    if (t instanceof xn) 
+    t = d(t))) return rr("Unsupported field value:", e, t), er(t, e);
+    if (t instanceof qn) 
     // FieldValues usually parse into transforms (except deleteField())
     // in which case we do not want to include this field in our parsed data
     // (as doing so will overwrite the field directly prior to the transform
@@ -4576,7 +4575,7 @@ var Hn = /** @class */ function(e) {
      */
     return function(t, e) {
         // Sentinels are only supported with writes, and not within arrays.
-        if (!Un(e.et)) throw e._t("".concat(t._methodName, "() can only be used with update() and set()"));
+        if (!Mn(e.et)) throw e._t("".concat(t._methodName, "() can only be used with update() and set()"));
         if (!e.path) throw e._t("".concat(t._methodName, "() is not currently supported inside arrays"));
         var n = t._toFieldTransform(e);
         n && e.fieldTransforms.push(n);
@@ -4599,7 +4598,7 @@ var Hn = /** @class */ function(e) {
         if (e.settings.it && 4 /* UserDataSource.ArrayArgument */ !== e.et) throw e._t("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 = tr(o[i], e.ut(r));
                 null == a && (
                 // Just include nulls in the array for fields being replaced with a
                 // sentinel.
@@ -4618,7 +4617,7 @@ var Hn = /** @class */ function(e) {
         if (null === (t = d(t))) return {
             nullValue: "NULL_VALUE"
         };
-        if ("number" == typeof t) return Fe(e.serializer, t);
+        if ("number" == typeof t) return Pe(e.serializer, t);
         if ("boolean" == typeof t) return {
             booleanValue: t
         };
@@ -4626,41 +4625,41 @@ var Hn = /** @class */ function(e) {
             stringValue: t
         };
         if (t instanceof Date) {
-            var n = Rt.fromDate(t);
+            var n = Dt.fromDate(t);
             return {
-                timestampValue: Qe(e.serializer, n)
+                timestampValue: Ke(e.serializer, n)
             };
         }
-        if (t instanceof Rt) {
+        if (t instanceof Dt) {
             // 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 Rt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
+            var r = new Dt(t.seconds, 1e3 * Math.floor(t.nanoseconds / 1e3));
             return {
-                timestampValue: Qe(e.serializer, r)
+                timestampValue: Ke(e.serializer, r)
             };
         }
-        if (t instanceof Cn) return {
+        if (t instanceof xn) return {
             geoPointValue: {
                 latitude: t.latitude,
                 longitude: t.longitude
             }
         };
-        if (t instanceof Dn) return {
-            bytesValue: Ye(e.serializer, t._byteString)
+        if (t instanceof Nn) return {
+            bytesValue: Qe(e.serializer, t._byteString)
         };
-        if (t instanceof In) {
+        if (t instanceof kn) {
             var i = e.databaseId, o = t.firestore._databaseId;
             if (!o.isEqual(i)) throw e._t("Document reference is for database ".concat(o.projectId, "/").concat(o.database, " but should be for database ").concat(i.projectId, "/").concat(i.database));
             return {
-                referenceValue: Je(t.firestore._databaseId || e.databaseId, t._key.path)
+                referenceValue: We(t.firestore._databaseId || e.databaseId, t._key.path)
             };
         }
-        throw e._t("Unsupported field value: ".concat(ct(t)));
+        throw e._t("Unsupported field value: ".concat(st(t)));
     }(t, e);
 }
 
-function nr(t, e) {
+function er(t, e) {
     var n = {};
     return function(t) {
         for (var e in t) if (Object.prototype.hasOwnProperty.call(t, e)) return !1;
@@ -4668,8 +4667,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) : At(t, (function(t, r) {
-        var i = er(r, e.nt(t));
+    e.path && e.path.length > 0 && e.fieldMask.push(e.path) : It(t, (function(t, r) {
+        var i = tr(r, e.nt(t));
         null != i && (n[t] = i);
     })), {
         mapValue: {
@@ -4678,35 +4677,35 @@ function nr(t, e) {
     };
 }
 
-function rr(t) {
-    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Rt || t instanceof Cn || t instanceof Dn || t instanceof In || t instanceof xn);
+function nr(t) {
+    return !("object" != typeof t || null === t || t instanceof Array || t instanceof Date || t instanceof Dt || t instanceof xn || t instanceof Nn || t instanceof kn || t instanceof qn);
 }
 
-function ir(t, e, n) {
-    if (!rr(n) || !function(t) {
+function rr(t, e, n) {
+    if (!nr(n) || !function(t) {
         return "object" == typeof t && null !== t && (Object.getPrototypeOf(t) === Object.prototype || null === Object.getPrototypeOf(t));
     }(n)) {
-        var r = ct(n);
+        var r = st(n);
         throw "an object" === r ? e._t(t + " a custom object") : e._t(t + " " + r);
     }
 }
 
 /**
  * Helper that calls fromDotSeparatedString() but wraps any error thrown.
- */ function or(t, e, n) {
+ */ function ir(t, e, n) {
     if (
     // If required, replace the FieldPath Compat class with with the firestore-exp
     // FieldPath.
-    (e = d(e)) instanceof Rn) return e._internalPath;
-    if ("string" == typeof e) return ur(t, e);
-    throw sr("Field path arguments must be of type string or ", t, 
+    (e = d(e)) instanceof Dn) return e._internalPath;
+    if ("string" == typeof e) return ar(t, e);
+    throw ur("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 or = new RegExp("[~\\*/\\[\\]]");
 
 /**
  * Wraps fromDotSeparatedString with an error message about the method that
@@ -4716,29 +4715,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 ar(t, e, n) {
+    if (e.search(or) >= 0) throw ur("Invalid field path (".concat(e, "). Paths must not contain '~', '*', '/', '[', or ']'"), t, 
     /* hasConverter= */ !1, 
     /* path= */ void 0, n);
     try {
-        return (new (Rn.bind.apply(Rn, r([ void 0 ], e.split("."), !1))))._internalPath;
+        return (new (Dn.bind.apply(Dn, 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 ur("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 ur(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 z(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 sr(t, e) {
     return t.some((function(t) {
         return t.isEqual(e);
     }));
@@ -4768,7 +4767,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 cr = /** @class */ function() {
     // Note: This class is stripped down version of the DocumentSnapshot in
     // the legacy SDK. The changes are:
     // - No support for SnapshotMetadata.
@@ -4789,7 +4788,7 @@ function cr(t, e) {
          * The `DocumentReference` for the document included in the `DocumentSnapshot`.
          */
         get: function() {
-            return new In(this._firestore, this._converter, this._key);
+            return new kn(this._firestore, this._converter, this._key);
         },
         enumerable: !1,
         configurable: !0
@@ -4814,7 +4813,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 lr(this._firestore, this._userDataWriter, this._key, this._document, 
                 /* converter= */ null);
                 return this._converter.fromFirestore(t);
             }
@@ -4834,11 +4833,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(pr("DocumentSnapshot.get", t));
             if (null !== e) return this._userDataWriter.convertValue(e);
         }
     }, t;
-}(), fr = /** @class */ function(e) {
+}(), lr = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
@@ -4850,7 +4849,7 @@ function cr(t, e) {
      */    return t(n, e), n.prototype.data = function() {
         return e.prototype.data.call(this);
     }, n;
-}(lr), hr = /** @class */ function() {
+}(cr), fr = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._docs = e, this.query = t;
@@ -4904,15 +4903,15 @@ function cr(t, e) {
  * @param right - A snapshot to compare.
  * @returns true if the snapshots are equal.
  */
-function pr(t, e) {
-    return t = d(t), e = d(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 && Nn(t.query, e.query) && kt(t.docs, e.docs, pr)
+function hr(t, e) {
+    return t = d(t), e = d(e), t instanceof cr && e instanceof cr ? 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 fr && e instanceof fr && Vn(t.query, e.query) && St(t.docs, e.docs, hr)
     /**
  * Helper that calls `fromDotSeparatedString()` but wraps any error thrown.
  */;
 }
 
-function dr(t, e) {
-    return "string" == typeof e ? ur(t, e) : e instanceof Rn ? e._internalPath : e._delegate._internalPath;
+function pr(t, e) {
+    return "string" == typeof e ? ar(t, e) : e instanceof Dn ? e._internalPath : e._delegate._internalPath;
 }
 
 /**
@@ -4934,12 +4933,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 dr = function() {}, yr = /** @class */ function(e) {
     function n() {
         return null !== e && e.apply(this, arguments) || this;
     }
     return t(n, e), n;
-}(yr);
+}(dr);
 
 /**
  * A `QueryConstraint` is used to narrow the set of documents returned by a
@@ -4948,16 +4947,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 mr(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 dr && i.push(e), function(t) {
         var e = t.filter((function(t) {
-            return t instanceof _r;
+            return t instanceof wr;
         })).length, n = t.filter((function(t) {
             return t instanceof gr;
         })).length;
-        if (e > 1 || e > 0 && n > 0) throw new z(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];
@@ -4986,32 +4985,32 @@ function dr(t, e) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
         var e = this._parse(t);
-        return Cr(t._query, e), new kn(t.firestore, t.converter, Pe(t._query, e));
+        return xr(t._query, e), new Sn(t.firestore, t.converter, Ae(t._query, e));
     }, n.prototype._parse = function(t) {
-        var e = Gn(t.firestore), n = function(t, e, n, r, i, o, a) {
+        var e = zn(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 z(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) {
-                    xr(a, o);
+                    qr(a, o);
                     for (var s = [], c = 0, l = a; c < l.length; c++) {
                         var f = l[c];
-                        s.push(qr(r, t, f));
+                        s.push(Rr(r, t, f));
                     }
                     u = {
                         arrayValue: {
                             values: s
                         }
                     };
-                } else u = qr(r, t, a);
-            } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || xr(a, o), 
-            u = tr(n, e, a, 
+                } else u = Rr(r, t, a);
+            } else "in" /* Operator.IN */ !== o && "not-in" /* Operator.NOT_IN */ !== o && "array-contains-any" /* Operator.ARRAY_CONTAINS_ANY */ !== o || qr(a, o), 
+            u = $n(n, e, a, 
             /* allowArrays= */ "in" /* Operator.IN */ === o || "not-in" /* Operator.NOT_IN */ === o);
-            return $t.create(i, o, u);
+            return Zt.create(i, o, u);
         }(t._query, "where", e, t.firestore._databaseId, this._field, this._op, this._value);
         return n;
     }, n;
-}(mr);
+}(yr);
 
 /**
  * Creates a {@link QueryFieldFilterConstraint} that enforces that documents
@@ -5023,8 +5022,8 @@ 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);
+ */ function vr(t, e, n) {
+    var r = e, i = pr("where", t);
     return gr._create(i, r, n);
 }
 
@@ -5035,7 +5034,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 wr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5053,21 +5052,21 @@ function dr(t, e) {
         })).filter((function(t) {
             return t.getFilters().length > 0;
         }));
-        return 1 === e.length ? e[0] : te.create(e, this._getOperator());
+        return 1 === e.length ? e[0] : $t.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];
-                Cr(n, o), n = Pe(n, o);
+                xr(n, o), n = Ae(n, o);
             }
-        }(t._query, e), new kn(t.firestore, t.converter, Pe(t._query, e)));
+        }(t._query, e), new Sn(t.firestore, t.converter, Ae(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);
+}(dr);
 
 /**
  * Creates a new {@link QueryCompositeFilterConstraint} that is a disjunction of
@@ -5078,12 +5077,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 _r() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return jr("or", t);
-    })), _r._create("or" /* CompositeOperator.OR */ , t)
+        return Cr("or", t);
+    })), wr._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
@@ -5096,12 +5095,12 @@ function dr(t, e) {
  */;
 }
 
-function Tr() {
+function br() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
     // Only support QueryFilterConstraints
         return t.forEach((function(t) {
-        return jr("and", t);
-    })), _r._create("and" /* CompositeOperator.AND */ , t)
+        return Cr("and", t);
+    })), wr._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
@@ -5113,7 +5112,7 @@ function Tr() {
  */;
 }
 
-var Er = /** @class */ function(e) {
+var Tr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5127,17 +5126,17 @@ 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 z(V, "Invalid query. You must not call startAt() or startAfter() before calling orderBy().");
-            if (null !== t.endAt) throw new z(V, "Invalid query. You must not call endAt() or endBefore() before calling orderBy().");
-            return new le(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().");
+            return new ce(e, n);
         }(t._query, this._field, this._direction);
-        return new kn(t.firestore, t.converter, function(t, e) {
+        return new Sn(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 Ee(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);
+}(yr);
 
 /**
  * Creates a {@link QueryOrderByConstraint} that sorts the query result by the
@@ -5150,10 +5149,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 Er(t, e) {
     void 0 === e && (e = "asc");
-    var n = e, r = dr("orderBy", t);
-    return Er._create(r, n);
+    var n = e, r = pr("orderBy", t);
+    return Tr._create(r, n);
 }
 
 /**
@@ -5162,7 +5161,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 Sr = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5175,11 +5174,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 kn(t.firestore, t.converter, function(t, e, n) {
-            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), e, n, t.startAt, t.endAt);
+        return new Sn(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);
+}(yr);
 
 /**
  * Creates a {@link QueryLimitConstraint} that only returns the first matching
@@ -5187,8 +5186,8 @@ var Er = /** @class */ function(e) {
  *
  * @param limit - The maximum number of items to return.
  * @returns The created {@link QueryLimitConstraint}.
- */ function Ir(t) {
-    return ft("limit", t), kr._create("limit", t, "F" /* LimitType.First */)
+ */ function kr(t) {
+    return lt("limit", t), Sr._create("limit", t, "F" /* LimitType.First */)
     /**
  * Creates a {@link QueryLimitConstraint} that only returns the last matching
  * documents.
@@ -5201,8 +5200,8 @@ var Er = /** @class */ function(e) {
  */;
 }
 
-function Ar(t) {
-    return ft("limitToLast", t), kr._create("limitToLast", t, "L" /* LimitType.Last */)
+function Ir(t) {
+    return lt("limitToLast", t), Sr._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.
@@ -5212,7 +5211,7 @@ function Ar(t) {
  */;
 }
 
-var Pr = /** @class */ function(e) {
+var Ar = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5226,22 +5225,22 @@ var Pr = /** @class */ function(e) {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = Rr(t, this.type, this._docOrFields, this._inclusive);
-        return new kn(t.firestore, t.converter, function(t, e) {
-            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, e, t.endAt);
+        var e = Dr(t, this.type, this._docOrFields, this._inclusive);
+        return new Sn(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);
+}(yr);
 
-function Fr() {
+function Pr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Pr._create("startAt", t, 
+    return Ar._create("startAt", t, 
     /*inclusive=*/ !0);
 }
 
-function Or() {
+function Fr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Pr._create("startAfter", t, 
+    return Ar._create("startAfter", t, 
     /*inclusive=*/ !1);
 }
 
@@ -5251,7 +5250,7 @@ function Or() {
  * `QueryEndAtConstraint`s are created by invoking {@link (endAt:1)} or
  * {@link (endBefore:1)} and can then be passed to {@link (query:1)} to create a new
  * query instance that also contains this `QueryEndAtConstraint`.
- */ var Vr = /** @class */ function(e) {
+ */ var Or = /** @class */ function(e) {
     /**
      * @internal
      */
@@ -5265,28 +5264,28 @@ function Or() {
     return t(n, e), n._create = function(t, e, r) {
         return new n(t, e, r);
     }, n.prototype._apply = function(t) {
-        var e = Rr(t, this.type, this._docOrFields, this._inclusive);
-        return new kn(t.firestore, t.converter, function(t, e) {
-            return new Ee(t.path, t.collectionGroup, t.explicitOrderBy.slice(), t.filters.slice(), t.limit, t.limitType, t.startAt, e);
+        var e = Dr(t, this.type, this._docOrFields, this._inclusive);
+        return new Sn(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);
+}(yr);
 
-function Nr() {
+function Vr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Vr._create("endBefore", t, 
+    return Or._create("endBefore", t, 
     /*inclusive=*/ !1);
 }
 
-function Dr() {
+function Nr() {
     for (var t = [], e = 0; e < arguments.length; e++) t[e] = arguments[e];
-    return Vr._create("endAt", t, 
+    return Or._create("endAt", t, 
     /*inclusive=*/ !0);
 }
 
-/** Helper function to create a bound from a document or fields */ function Rr(t, e, n, r) {
-    if (n[0] = d(n[0]), n[0] instanceof lr) return function(t, e, n, r, i) {
-        if (!r) throw new z(D, "Can't use a DocumentSnapshot that doesn't exist for ".concat(n, "()."));
+/** Helper function to create a bound from a document or fields */ function Dr(t, e, n, r) {
+    if (n[0] = d(n[0]), n[0] instanceof cr) return function(t, e, n, r, i) {
+        if (!r) throw new B(N, "Can't use a DocumentSnapshot that doesn't exist for ".concat(n, "()."));
         // Because people expect to continue/end a query at the exact document
         // provided, we need to use the implicit sort order rather than the explicit
         // sort order, because it's guaranteed to contain the document key. That way
@@ -5294,60 +5293,60 @@ function Dr() {
         // 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 = Se(t); a < u.length; a++) {
             var s = u[a];
-            if (s.field.isKeyField()) o.push(Gt(e, r.key)); else {
+            if (s.field.isKeyField()) o.push(zt(e, r.key)); else {
                 var c = r.data.field(s.field);
-                if (qt(c)) throw new z(V, 'Invalid query. You are trying to start or end a query using a document for which the field "' + s.field + '" is an uncommitted server timestamp. (Since the value of this field is unknown, you cannot start/end a query with it.)');
+                if (Rt(c)) throw new B(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 z(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 Jt(o, i);
+        return new Wt(o, i);
     }(t._query, t.firestore._databaseId, e, n[0]._document, r);
-    var i = Gn(t.firestore);
+    var i = zn(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 z(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 z(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 z(V, "Invalid query. When querying a collection and ordering by documentId(), the value passed to ".concat(r, "() must be a plain document ID, but '").concat(c, "' contains a slash."));
-                var l = t.path.child(nt.fromString(c));
-                if (!ot.isDocumentKey(l)) throw new z(V, "Invalid query. When querying a collection group and ordering by documentId(), the value passed to ".concat(r, "() must result in a valid document path, but '").concat(l, "' is not because it contains an odd number of segments."));
-                var f = new ot(l);
-                u.push(Gt(e, f));
+                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 (!Ee(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(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(zt(e, f));
             } else {
-                var h = tr(n, r, c);
+                var h = $n(n, r, c);
                 u.push(h);
             }
         }
-        return new Jt(u, o);
+        return new Wt(u, o);
     }(t._query, t.firestore._databaseId, i, e, n, r);
 }
 
-function qr(t, e, n) {
+function Rr(t, e, n) {
     if ("string" == typeof (n = d(n))) {
-        if ("" === n) throw new z(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 z(V, "Invalid query. When querying a collection by documentId(), you must provide a plain document ID, but '".concat(n, "' contains a '/' character."));
-        var r = e.path.child(nt.fromString(n));
-        if (!ot.isDocumentKey(r)) throw new z(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 Gt(t, new ot(r));
+        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 (!Ee(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(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 In) return Gt(t, n._key);
-    throw new z(V, "Invalid query. When querying with documentId(), you must provide a valid string or a DocumentReference, but it was: ".concat(ct(n), "."));
+    if (n instanceof kn) 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 xr(t, e) {
-    if (!Array.isArray(t) || 0 === t.length) throw new z(V, "Invalid Query. A non-empty array is required for '".concat(e.toString(), "' filters."));
+ */ function qr(t, e) {
+    if (!Array.isArray(t) || 0 === t.length) throw new B(O, "Invalid Query. A non-empty array is required for '".concat(e.toString(), "' filters."));
 }
 
 /**
@@ -5359,7 +5358,7 @@ function qr(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 Cr(t, e) {
+ */ function xr(t, e) {
     var n = 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++) {
             var a = o[i];
@@ -5384,11 +5383,11 @@ function qr(t, e, n) {
     }(e.op));
     if (null !== n) 
     // Special case when it's a duplicate op to give a slightly clearer error message.
-    throw n === e.op ? new z(V, "Invalid query. You cannot use more than one '".concat(e.op.toString(), "' filter.")) : new z(V, "Invalid query. You cannot use '".concat(e.op.toString(), "' filters with '").concat(n.toString(), "' filters."));
+    throw n === 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(n.toString(), "' filters."));
 }
 
-function jr(t, e) {
-    if (!(e instanceof gr || e instanceof _r)) throw new z(V, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
+function Cr(t, e) {
+    if (!(e instanceof gr || e instanceof wr)) throw new B(O, "Function ".concat(t, "() requires AppliableConstraints created with a call to 'where(...)', 'or(...)', or 'and(...)'."));
 }
 
 /**
@@ -5415,28 +5414,28 @@ function jr(t, e) {
  * because we want to provide the user with a more specific error message if
  * their `set()` or fails due to invalid data originating from a `toFirestore()`
  * call.
- */ function Lr(t, e, n) {
+ */ function jr(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 Mr = /** @class */ function(e) {
+var Lr = /** @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 Dn(t);
+        return new Nn(t);
     }, n.prototype.convertReference = function(t) {
         var e = this.convertDocumentKey(t, this.firestore._databaseId);
-        return new In(this.firestore, /* converter= */ null, e);
+        return new kn(this.firestore, /* converter= */ null, e);
     }, n;
 }(/** @class */ function() {
     function t() {}
     return t.prototype.convertValue = function(t, e) {
-        switch (void 0 === e && (e = "none"), Lt(t)) {
+        switch (void 0 === e && (e = "none"), jt(t)) {
           case 0 /* TypeOrder.NullValue */ :
             return null;
 
@@ -5444,7 +5443,7 @@ var Mr = /** @class */ function(e) {
             return t.booleanValue;
 
           case 2 /* TypeOrder.NumberValue */ :
-            return Nt(t.integerValue || t.doubleValue);
+            return Vt(t.integerValue || t.doubleValue);
 
           case 3 /* TypeOrder.TimestampValue */ :
             return this.convertTimestamp(t.timestampValue);
@@ -5456,7 +5455,7 @@ var Mr = /** @class */ function(e) {
             return t.stringValue;
 
           case 6 /* TypeOrder.BlobValue */ :
-            return this.convertBytes(Dt(t.bytesValue));
+            return this.convertBytes(Nt(t.bytesValue));
 
           case 7 /* TypeOrder.RefValue */ :
             return this.convertReference(t.referenceValue);
@@ -5471,7 +5470,7 @@ var Mr = /** @class */ function(e) {
             return this.convertObject(t.mapValue, e);
 
           default:
-            throw I();
+            throw k();
         }
     }, t.prototype.convertObject = function(t, e) {
         return this.convertObjectMap(t.fields, e);
@@ -5483,11 +5482,11 @@ var Mr = /** @class */ function(e) {
         var n = this;
         void 0 === e && (e = "none");
         var r = {};
-        return At(t, (function(t, i) {
+        return It(t, (function(t, i) {
             r[t] = n.convertValue(i, e);
         })), r;
     }, t.prototype.convertGeoPoint = function(t) {
-        return new Cn(Nt(t.latitude), Nt(t.longitude));
+        return new xn(Vt(t.latitude), Vt(t.longitude));
     }, t.prototype.convertArray = function(t, e) {
         var n = this;
         return (t.values || []).map((function(t) {
@@ -5496,25 +5495,25 @@ var Mr = /** @class */ function(e) {
     }, t.prototype.convertServerTimestamp = function(t, e) {
         switch (e) {
           case "previous":
-            var n = xt(t);
+            var n = qt(t);
             return null == n ? null : this.convertValue(n, e);
 
           case "estimate":
-            return this.convertTimestamp(Ct(t));
+            return this.convertTimestamp(xt(t));
 
           default:
             return null;
         }
     }, t.prototype.convertTimestamp = function(t) {
-        var e = Vt(t);
-        return new Rt(e.seconds, e.nanos);
+        var e = Ot(t);
+        return new Dt(e.seconds, e.nanos);
     }, t.prototype.convertDocumentKey = function(t, e) {
-        var n = nt.fromString(t);
-        A(cn(n));
-        var r = new tt(n.get(1), n.get(3)), i = new ot(n.popFirst(5));
+        var n = et.fromString(t);
+        I(sn(n));
+        var r = new $(n.get(1), n.get(3)), i = new it(n.popFirst(5));
         return r.isEqual(e) || 
         // TODO(b/64130202): Somehow support foreign references.
-        E("Document ".concat(i, " contains a document reference within a different database (").concat(r.projectId, "/").concat(r.database, ") which is not supported. It will be treated as a reference in the current database (").concat(e.projectId, "/").concat(e.database, ") instead.")), 
+        T("Document ".concat(i, " contains a document reference within a different database (").concat(r.projectId, "/").concat(r.database, ") which is not supported. It will be treated as a reference in the current database (").concat(e.projectId, "/").concat(e.database, ") instead.")), 
         i;
     }, t;
 }());
@@ -5531,12 +5530,12 @@ var Mr = /** @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 Ur(t) {
-    var e = mn((t = lt(t, In)).firestore), n = new Mr(t.firestore);
-    return dn(e, [ t._key ]).then((function(e) {
-        A(1 === e.length);
+ */ function Mr(t) {
+    var e = yn((t = ct(t, kn)).firestore), n = new Lr(t.firestore);
+    return pn(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 cr(t.firestore, n, t._key, r.isFoundDocument() ? r : null, t.converter);
     }));
 }
 
@@ -5551,18 +5550,18 @@ var Mr = /** @class */ function(e) {
  *
  * @param query - The `Query` to execute.
  * @returns A Promise that will be resolved with the results of the query.
- */ function Br(t) {
+ */ function Ur(t) {
     !function(t) {
-        if ("L" /* LimitType.Last */ === t.limitType && 0 === t.explicitOrderBy.length) throw new z(M, "limitToLast() queries require specifying at least one orderBy() clause");
-    }((t = lt(t, kn))._query);
-    var r = mn(t.firestore), i = new Mr(t.firestore);
+        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, Sn))._query);
+    var r = yn(t.firestore), i = new Lr(t.firestore);
     return function(t, r) {
         return e(this, void 0, void 0, (function() {
             var e, i, o, a;
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    return e = P(t), i = en(e.serializer, Ie(r)), o = i.B, a = i.parent, [ 4 /*yield*/ , e.g("RunQuery", e.serializer.databaseId, a, {
+                    return e = A(t), i = tn(e.serializer, ke(r)), o = i.B, a = i.parent, [ 4 /*yield*/ , e.g("RunQuery", e.serializer.databaseId, a, {
                         structuredQuery: o.structuredQuery
                     }) ];
 
@@ -5571,11 +5570,11 @@ var Mr = /** @class */ function(e) {
                         return !!t.document;
                     })).map((function(t) {
                         return function(t, e, n) {
-                            var r = $e(t, e.name), i = We(e.updateTime), o = e.createTime ? We(e.createTime) : he.min(), a = new we({
+                            var r = Ze(t, e.name), i = He(e.updateTime), o = e.createTime ? He(e.createTime) : fe.min(), a = new ve({
                                 mapValue: {
                                     fields: e.fields
                                 }
-                            }), u = _e.newFoundDocument(r, i, o, a);
+                            }), u = we.newFoundDocument(r, i, o, a);
                             return n && u.setHasCommittedMutations(), n ? u.setHasCommittedMutations() : u;
                         }(e.serializer, t.document, void 0);
                     })) ];
@@ -5584,28 +5583,28 @@ var Mr = /** @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 lr(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 fr(t, n);
     }));
 }
 
-function zr(t, e, n) {
-    var r = Lr((t = lt(t, In)).converter, e, n), i = Kn(Gn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
-    return pn(mn(t.firestore), [ i.toMutation(t._key, xe.none()) ]);
+function Br(t, e, n) {
+    var r = jr((t = ct(t, kn)).converter, e, n), i = Gn(zn(t.firestore), "setDoc", t._key, r, null !== t.converter, n);
+    return hn(yn(t.firestore), [ i.toMutation(t._key, qe.none()) ]);
 }
 
-function Gr(t, e, n) {
+function zr(t, e, n) {
     for (var r = [], i = 3; i < arguments.length; i++) r[i - 3] = arguments[i];
-    var o, a = Gn((t = lt(t, In)).firestore);
+    var o, a = zn((t = ct(t, kn)).firestore);
     // For Compat types, we have to "extract" the underlying types before
     // performing validation.
-        return o = "string" == typeof (e = d(e)) || e instanceof Rn ? $n(a, "updateDoc", t._key, e, n, r) : Zn(a, "updateDoc", t._key, e), 
-    pn(mn(t.firestore), [ o.toMutation(t._key, xe.exists(!0)) ]);
+        return o = "string" == typeof (e = d(e)) || e instanceof Dn ? Zn(a, "updateDoc", t._key, e, n, r) : Xn(a, "updateDoc", t._key, e), 
+    hn(yn(t.firestore), [ o.toMutation(t._key, qe.exists(!0)) ]);
 }
 
 /**
@@ -5619,8 +5618,8 @@ function Gr(t, e, n) {
  * @param reference - A reference to the document to delete.
  * @returns A `Promise` resolved once the document has been successfully
  * deleted from the backend.
- */ function Kr(t) {
-    return pn(mn((t = lt(t, In)).firestore), [ new Me(t._key, xe.none()) ]);
+ */ function Gr(t) {
+    return hn(yn((t = ct(t, kn)).firestore), [ new Le(t._key, qe.none()) ]);
 }
 
 /**
@@ -5637,9 +5636,9 @@ function Gr(t, e, n) {
  * @throws Error - If the provided input is not a valid Firestore document.
  * @returns A `Promise` resolved with a `DocumentReference` pointing to the
  * newly created document after it has been written to the backend.
- */ function Qr(t, e) {
-    var n = On(t = lt(t, An)), r = Lr(t.converter, e), i = Kn(Gn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
-    return pn(mn(t.firestore), [ i.toMutation(n._key, xe.exists(!1)) ]).then((function() {
+ */ function Kr(t, e) {
+    var n = Fn(t = ct(t, In)), r = jr(t.converter, e), i = Gn(zn(t.firestore), "addDoc", n._key, r, null !== n.converter, {});
+    return hn(yn(t.firestore), [ i.toMutation(n._key, qe.exists(!1)) ]).then((function() {
         return n;
     }));
 }
@@ -5673,9 +5672,9 @@ function Gr(t, e, n) {
  * @returns A Promise that will be resolved with the count; the count can be
  * retrieved from `snapshot.data().count`, where `snapshot` is the
  * `AggregateQuerySnapshot` to which the returned Promise resolves.
- */ function Yr(t) {
-    return Hr(t, {
-        count: Xr()
+ */ function Qr(t) {
+    return Yr(t, {
+        count: Jr()
     });
 }
 
@@ -5704,13 +5703,13 @@ function Gr(t, e, n) {
  * const totalHours: number = aggregateSnapshot.data().totalHours;
  * const averageScore: number | null = aggregateSnapshot.data().averageScore;
  * ```
- */ function Hr(t, r) {
-    var i = lt(t.firestore, gn), o = mn(i), a = function(t, e) {
+ */ function Yr(t, r) {
+    var i = ct(t.firestore, gn), o = yn(i), a = function(t, e) {
         var n = [];
         for (var r in t) Object.prototype.hasOwnProperty.call(t, r) && n.push(e(t[r], r, t));
         return n;
     }(r, (function(t, e) {
-        return new bt(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) {
@@ -5719,8 +5718,8 @@ function Gr(t, e, n) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    return o = P(t), a = function(t, e, n, r) {
-                        var i = en(t, e), o = i.B, a = i.parent, u = {}, s = [], c = 0;
+                    return o = A(t), a = function(t, e, n, r) {
+                        var i = tn(t, e), o = i.B, a = i.parent, u = {}, s = [], c = 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
@@ -5732,12 +5731,12 @@ function Gr(t, e, n) {
                             }) : "avg" === t.aggregateType ? s.push({
                                 alias: e,
                                 avg: {
-                                    field: an(t.fieldPath)
+                                    field: on(t.fieldPath)
                                 }
                             }) : "sum" === t.aggregateType && s.push({
                                 alias: e,
                                 sum: {
-                                    field: an(t.fieldPath)
+                                    field: on(t.fieldPath)
                                 }
                             });
                         })), {
@@ -5752,10 +5751,10 @@ function Gr(t, e, n) {
                             parent: a
                         };
                     }(o.serializer, function(t) {
-                        var e = P(t);
+                        var e = A(t);
                         return e.O || (
                         // Do not include implicit order-bys for aggregate queries.
-                        e.O = Ae(e, t.explicitOrderBy)), e.O;
+                        e.O = Ie(e, t.explicitOrderBy)), e.O;
                     }(r), i), u = a.request, s = a.X, c = a.parent, o.connection.R || delete u.parent, 
                     [ 4 /*yield*/ , o.g("RunAggregationQuery", o.serializer.databaseId, c, u, 
                     /*expectedResponseCount=*/ 1) ];
@@ -5765,7 +5764,7 @@ function Gr(t, e, n) {
                         return !!t.result;
                     })), 
                     // Omit RunAggregationQueryResponse that only contain readTimes.
-                    A(1 === l.length), f = null === (e = l[0].result) || void 0 === e ? void 0 : e.aggregateFields, 
+                    I(1 === l.length), f = null === (e = l[0].result) || void 0 === e ? void 0 : e.aggregateFields, 
                     [ 2 /*return*/ , Object.keys(f).reduce((function(t, e) {
                         return t[s[e]] = f[e], t;
                     }), {}) ];
@@ -5774,29 +5773,29 @@ function Gr(t, e, n) {
         }));
     }(o, t._query, a).then((function(e) {
         return function(t, e, n) {
-            var r = new Mr(t);
-            return new Sn(e, r, n);
+            var r = new Lr(t);
+            return new En(e, r, n);
         }(i, t, e);
     }));
 }
 
-function Wr(t) {
-    return new En("sum", or("sum", t));
+function Hr(t) {
+    return new Tn("sum", ir("sum", t));
 }
 
 /**
  * Create an AggregateField object that can be used to compute the average of
  * 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.
- */ function Jr(t) {
-    return new En("avg", or("average", t));
+ */ function Wr(t) {
+    return new Tn("avg", ir("average", t));
 }
 
 /**
  * Create an AggregateField object that can be used to compute the count of
  * documents in the result set of a query.
- */ function Xr() {
-    return new En("count");
+ */ function Jr() {
+    return new Tn("count");
 }
 
 /**
@@ -5804,9 +5803,9 @@ function Wr(t) {
  *
  * @param left Compare this AggregateField to the `right`.
  * @param right Compare this AggregateField to the `left`.
- */ function Zr(t, e) {
+ */ function Xr(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 Tn && e instanceof Tn && 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());
 }
 
 /**
@@ -5820,8 +5819,8 @@ function Wr(t) {
  *
  * @returns `true` if the objects are "equal", as defined above, or `false`
  * otherwise.
- */ function $r(t, e) {
-    return Nn(t.query, e.query) && p(t.data(), e.data());
+ */ function Zr(t, e) {
+    return Vn(t.query, e.query) && p(t.data(), e.data());
 }
 
 /**
@@ -5843,15 +5842,15 @@ function Wr(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 ti() {
-    return new Qn("deleteField");
+ */ function $r() {
+    return new Kn("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 ei() {
-    return new Hn("serverTimestamp");
+ */ function ti() {
+    return new Yn("serverTimestamp");
 }
 
 /**
@@ -5865,11 +5864,11 @@ function Wr(t) {
  * @param elements - The elements to union into the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`.
- */ function ni() {
+ */ function ei() {
     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 Wn("arrayUnion", t);
+        return new Hn("arrayUnion", t);
 }
 
 /**
@@ -5882,11 +5881,11 @@ function Wr(t) {
  * @param elements - The elements to remove from the array.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function ri() {
+ */ function ni() {
     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 Wn("arrayRemove", t);
 }
 
 /**
@@ -5907,8 +5906,8 @@ function Wr(t) {
  * @param n - The value to increment by.
  * @returns The `FieldValue` sentinel for use in a call to `setDoc()` or
  * `updateDoc()`
- */ function ii(t) {
-    return new Xn("increment", t);
+ */ function ri(t) {
+    return new Jn("increment", t);
 }
 
 /**
@@ -5934,24 +5933,24 @@ function Wr(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 oi = /** @class */ function() {
+ */ var ii = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
         this._firestore = t, this._commitHandler = e, this._mutations = [], this._committed = !1, 
-        this._dataReader = Gn(t);
+        this._dataReader = zn(t);
     }
     return t.prototype.set = function(t, e, n) {
         this._verifyNotCommitted();
-        var r = ai(t, this._firestore), i = Lr(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, xe.none())), this;
+        var r = oi(t, this._firestore), i = jr(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, qe.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 = ai(t, this._firestore);
+        var o, a = oi(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = d(e)) || e instanceof Rn ? $n(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;
+                return o = "string" == typeof (e = d(e)) || e instanceof Dn ? Zn(this._dataReader, "WriteBatch.update", a._key, e, n, r) : Xn(this._dataReader, "WriteBatch.update", a._key, e), 
+        this._mutations.push(o.toMutation(a._key, qe.exists(!0))), this;
     }, 
     /**
      * Deletes the document referred to by the provided {@link DocumentReference}.
@@ -5961,8 +5960,8 @@ function Wr(t) {
      */
     t.prototype.delete = function(t) {
         this._verifyNotCommitted();
-        var e = ai(t, this._firestore);
-        return this._mutations = this._mutations.concat(new Me(e._key, xe.none())), this;
+        var e = oi(t, this._firestore);
+        return this._mutations = this._mutations.concat(new Le(e._key, qe.none())), this;
     }, 
     /**
      * Commits all of the writes in this write batch as a single atomic unit.
@@ -5979,12 +5978,12 @@ function Wr(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 z(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 ai(t, e) {
-    if ((t = d(t)).firestore !== e) throw new z(V, "Provided document reference is from a different Firestore instance.");
+function oi(t, e) {
+    if ((t = d(t)).firestore !== e) throw new B(O, "Provided document reference is from a different Firestore instance.");
     return t;
 }
 
@@ -6000,10 +5999,10 @@ function ai(t, e) {
  *
  * @returns A `WriteBatch` that can be used to atomically execute multiple
  * writes.
- */ function ui(t) {
-    var e = mn(t = lt(t, gn));
-    return new oi(t, (function(t) {
-        return pn(e, t);
+ */ function ai(t) {
+    var e = yn(t = ct(t, gn));
+    return new ii(t, (function(t) {
+        return hn(e, t);
     }));
 }
 
@@ -6026,7 +6025,7 @@ function ai(t, e) {
 /**
  * Internal transaction object responsible for accumulating the mutations to
  * perform and the base versions for any documents read.
- */ var si = /** @class */ function() {
+ */ var ui = /** @class */ function() {
     function t(t) {
         this.datastore = t, 
         // The version of each document that was read during this transaction.
@@ -6050,9 +6049,9 @@ function ai(t, e) {
             return n(this, (function(n) {
                 switch (n.label) {
                   case 0:
-                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw this.lastTransactionError = new z(V, "Firestore transactions require all reads to be executed before all writes."), 
+                    if (this.ensureCommitNotCalled(), this.mutations.length > 0) throw this.lastTransactionError = new B(O, "Firestore transactions require all reads to be executed before all writes."), 
                     this.lastTransactionError;
-                    return [ 4 /*yield*/ , dn(this.datastore, t) ];
+                    return [ 4 /*yield*/ , pn(this.datastore, t) ];
 
                   case 1:
                     return [ 2 /*return*/ , ((e = n.sent()).forEach((function(t) {
@@ -6071,7 +6070,7 @@ function ai(t, e) {
         }
         this.writtenDocs.add(t.toString());
     }, t.prototype.delete = function(t) {
-        this.write(new Me(t, this.precondition(t))), this.writtenDocs.add(t.toString());
+        this.write(new Le(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;
@@ -6087,9 +6086,9 @@ function ai(t, e) {
                     // For each document that was read but not written to, we want to perform
                     // a `verify` operation.
                     t.forEach((function(t, n) {
-                        var r = ot.fromPath(n);
-                        e.mutations.push(new Ue(r, e.precondition(r)));
-                    })), [ 4 /*yield*/ , pn(this.datastore, this.mutations) ];
+                        var r = it.fromPath(n);
+                        e.mutations.push(new Me(r, e.precondition(r)));
+                    })), [ 4 /*yield*/ , hn(this.datastore, this.mutations) ];
 
                   case 1:
                     // For each mutation, note that the doc was written.
@@ -6100,15 +6099,15 @@ function ai(t, e) {
     }, t.prototype.recordVersion = function(t) {
         var e;
         if (t.isFoundDocument()) e = t.version; else {
-            if (!t.isNoDocument()) throw I();
+            if (!t.isNoDocument()) throw k();
             // Represent a deleted doc using SnapshotVersion.min().
-                        e = he.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 z(j, "Document version changed between two reads.");
+            throw new B(C, "Document version changed between two reads.");
         } else this.readVersions.set(t.key.toString(), e);
     }, 
     /**
@@ -6117,7 +6116,7 @@ function ai(t, e) {
      */
     t.prototype.precondition = function(t) {
         var e = this.readVersions.get(t.toString());
-        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(he.min()) ? xe.exists(!1) : xe.updateTime(e) : xe.none();
+        return !this.writtenDocs.has(t.toString()) && e ? e.isEqual(fe.min()) ? qe.exists(!1) : qe.updateTime(e) : qe.none();
     }, 
     /**
      * Returns the precondition for a document if the operation is an update.
@@ -6127,7 +6126,7 @@ function ai(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(he.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
@@ -6137,22 +6136,22 @@ function ai(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 z(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 xe.updateTime(e);
+                        return qe.updateTime(e);
         }
         // Document was not read, so we just use the preconditions for a blind
         // update.
-                return xe.exists(!0);
+                return qe.exists(!0);
     }, t.prototype.write = function(t) {
         this.ensureCommitNotCalled(), this.mutations.push(t);
     }, t.prototype.ensureCommitNotCalled = function() {}, t;
-}(), ci = {
+}(), si = {
     maxAttempts: 5
-}, li = /** @class */ function() {
+}, ci = /** @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.Et = n.maxAttempts, this.At = new fn(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
+        this.deferred = i, this.Et = n.maxAttempts, this.At = new ln(this.asyncQueue, "transaction_retry" /* TimerId.TransactionRetry */)
         /** Runs the transaction and sets the result on deferred. */;
     }
     return t.prototype.Tt = function() {
@@ -6163,7 +6162,7 @@ function ai(t, e) {
             return e(t, void 0, void 0, (function() {
                 var t, e, r = this;
                 return n(this, (function(n) {
-                    return t = new si(this.datastore), (e = this.Pt(t)) && e.then((function(e) {
+                    return t = new ui(this.datastore), (e = this.Pt(t)) && e.then((function(e) {
                         r.asyncQueue.enqueueAndForget((function() {
                             return t.commit().then((function() {
                                 r.deferred.resolve(e);
@@ -6180,7 +6179,7 @@ function ai(t, e) {
     }, t.prototype.Pt = function(t) {
         try {
             var e = this.updateFunction(t);
-            return !dt(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.
@@ -6206,30 +6205,30 @@ function ai(t, e) {
             function(t) {
                 switch (t) {
                   default:
-                    return I();
+                    return k();
 
+                  case P:
                   case F:
-                  case O:
-                  case N:
-                  case x:
+                  case V:
+                  case q:
+                  case M:
                   case U:
-                  case B:
  // Unauthenticated means something went wrong with our token and we need
                     // to retry with new credentials which will happen automatically.
-                                      case q:
+                                      case R:
                     return !1;
 
-                  case V:
-                  case D:
+                  case O:
+                  case N:
                   case "already-exists":
-                  case R:
-                  case C:
+                  case D:
+                  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 j:
+                                      case C:
+                  case j:
                   case L:
-                  case M:
                   case "data-loss":
                     return !0;
                 }
@@ -6271,7 +6270,7 @@ function ai(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 fi() {
+/** The Platform's 'document' implementation or null if not available. */ function li() {
     // `document` is not always available, e.g. in ReactNative and WebWorkers.
     // eslint-disable-next-line no-restricted-globals
     return "undefined" != typeof document ? document : null;
@@ -6303,10 +6302,10 @@ function ai(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 hi, pi = /** @class */ function() {
+ */ var fi, hi = /** @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 G, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
+        this.deferred = new z, this.then = this.deferred.promise.then.bind(this.deferred.promise), 
         // It's normal for the deferred promise to be canceled (due to cancellation)
         // and so we attach a dummy catch callback to avoid
         // 'UnhandledPromiseRejectionWarning' log spam.
@@ -6362,7 +6361,7 @@ function ai(t, e) {
      * guarantee that the operation will not be run.
      */
     t.prototype.cancel = function(t) {
-        null !== this.timerHandle && (this.clearTimeout(), this.deferred.reject(new z(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() {
@@ -6374,7 +6373,7 @@ function ai(t, e) {
         null !== this.timerHandle && (this.removalCallback(this), clearTimeout(this.timerHandle), 
         this.timerHandle = null);
     }, t;
-}(), di = /** @class */ function() {
+}(), pi = /** @class */ function() {
     function t() {
         var t = this;
         // The last promise in the queue.
@@ -6398,15 +6397,15 @@ function ai(t, e) {
         // List of TimerIds to fast-forward delays for.
         this.Ct = [], 
         // Backoff timer used to schedule retries for retryable operations
-        this.At = new fn(this, "async_queue_retry" /* TimerId.AsyncQueueRetry */), 
+        this.At = new ln(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.St = function() {
-            var e = fi();
-            e && T("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.At.J();
+            var e = li();
+            e && b("AsyncQueue", "Visibility state changed to " + e.visibilityState), t.At.J();
         };
-        var e = fi();
+        var e = li();
         e && "function" == typeof e.addEventListener && e.addEventListener("visibilitychange", this.St);
     }
     return Object.defineProperty(t.prototype, "isShuttingDown", {
@@ -6430,7 +6429,7 @@ function ai(t, e) {
     }, t.prototype.enterRestrictedMode = function(t) {
         if (!this.gt) {
             this.gt = !0, this.bt = t || !1;
-            var e = fi();
+            var e = li();
             e && "function" == typeof e.removeEventListener && e.removeEventListener("visibilitychange", this.St);
         }
     }, t.prototype.enqueue = function(t) {
@@ -6441,7 +6440,7 @@ function ai(t, e) {
         // Create a deferred Promise that we can return to the callee. This
         // allows us to return a "hanging Promise" only to the callee and still
         // advance the queue even when the operation is not run.
-                var n = new G;
+                var n = new z;
         return this.Ot((function() {
             return e.gt && e.bt ? Promise.resolve() : (t().then(n.resolve, n.reject), n.promise);
         })).then((function() {
@@ -6475,7 +6474,7 @@ function ai(t, e) {
                   case 3:
                     if (t = n.sent(), "IndexedDbTransactionError" !== t.name) throw t;
                     // Failure will be handled by AsyncQueue
-                                        return T("AsyncQueue", "Operation failed with retryable error: " + t), 
+                                        return b("AsyncQueue", "Operation failed with retryable error: " + t), 
                     [ 3 /*break*/ , 4 ];
 
                   case 4:
@@ -6517,7 +6516,7 @@ function ai(t, e) {
                 // Re-throw the error so that this.tail becomes a rejected Promise and
                 // all further attempts to chain (via .then) will just short-circuit
                 // and return the rejected Promise.
-                                throw E("INTERNAL UNHANDLED ERROR: ", n), t;
+                                throw T("INTERNAL UNHANDLED ERROR: ", n), t;
             })).then((function(t) {
                 return e.Dt = !1, t;
             }));
@@ -6528,12 +6527,12 @@ function ai(t, e) {
         this.Nt(), 
         // Fast-forward delays for timerIds that have been overriden.
         this.Ct.indexOf(t) > -1 && (e = 0);
-        var i = pi.createAndSchedule(this, t, e, n, (function(t) {
+        var i = hi.createAndSchedule(this, t, e, n, (function(t) {
             return r.Bt(t);
         }));
         return this.Ft.push(i), i;
     }, t.prototype.Nt = function() {
-        this.vt && I();
+        this.vt && k();
     }, t.prototype.verifyOperationInProgress = function() {}, 
     /**
      * Waits until all currently queued tasks are finished executing. Delayed
@@ -6603,10 +6602,10 @@ function ai(t, e) {
         var e = this.Ft.indexOf(t);
         this.Ft.splice(e, 1);
     }, t;
-}(), yi = /** @class */ function() {
+}(), di = /** @class */ function() {
     /** @hideconstructor */
     function t(t, e) {
-        this._firestore = t, this._transaction = e, this._dataReader = Gn(t)
+        this._firestore = t, this._transaction = e, this._dataReader = zn(t)
         /**
      * Reads the document referenced by the provided {@link DocumentReference}.
      *
@@ -6615,23 +6614,23 @@ function ai(t, e) {
      */;
     }
     return t.prototype.get = function(t) {
-        var e = this, n = ai(t, this._firestore), r = new Mr(this._firestore);
+        var e = this, n = oi(t, this._firestore), r = new Lr(this._firestore);
         return this._transaction.lookup([ n._key ]).then((function(t) {
-            if (!t || 1 !== t.length) return I();
+            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);
-            throw I();
+            if (i.isFoundDocument()) return new cr(e._firestore, r, i.key, i, n.converter);
+            if (i.isNoDocument()) return new cr(e._firestore, r, n._key, null, n.converter);
+            throw k();
         }));
     }, t.prototype.set = function(t, e, n) {
-        var r = ai(t, this._firestore), i = Lr(r.converter, e, n), o = Kn(this._dataReader, "Transaction.set", r._key, i, null !== r.converter, n);
+        var r = oi(t, this._firestore), i = jr(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 = ai(t, this._firestore);
+        var o, a = oi(t, this._firestore);
         // For Compat types, we have to "extract" the underlying types before
         // performing validation.
-                return o = "string" == typeof (e = d(e)) || e instanceof Rn ? $n(this._dataReader, "Transaction.update", a._key, e, n, r) : Zn(this._dataReader, "Transaction.update", a._key, e), 
+                return o = "string" == typeof (e = d(e)) || e instanceof Dn ? Zn(this._dataReader, "Transaction.update", a._key, e, n, r) : Xn(this._dataReader, "Transaction.update", a._key, e), 
         this._transaction.update(a._key, o), this;
     }, 
     /**
@@ -6641,7 +6640,7 @@ function ai(t, e) {
      * @returns This `Transaction` instance. Used for chaining method calls.
      */
     t.prototype.delete = function(t) {
-        var e = ai(t, this._firestore);
+        var e = oi(t, this._firestore);
         return this._transaction.delete(e._key), this;
     }, t;
 }();
@@ -6681,14 +6680,14 @@ function ai(t, e) {
  * `updateFunction `is returned here. Otherwise, if the transaction failed, a
  * rejected promise with the corresponding failure error is returned.
  */
-function mi(t, e, n) {
-    var r = mn(t = lt(t, gn)), i = Object.assign(Object.assign({}, ci), n);
+function yi(t, e, n) {
+    var r = yn(t = ct(t, gn)), i = Object.assign(Object.assign({}, si), n);
     !function(t) {
-        if (t.maxAttempts < 1) throw new z(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 G;
-    return new li(new di, r, i, (function(n) {
-        return e(new yi(t, n));
+    var o = new z;
+    return new ci(new pi, r, i, (function(n) {
+        return e(new di(t, n));
     }), o).Tt(), o.promise
     /**
  * Firestore Lite
@@ -6700,15 +6699,15 @@ function mi(t, e, n) {
  */;
 }
 
-hi = "".concat(i, "_lite"), w = hi, o(new c("firestore/lite", (function(t, e) {
-    var n = e.instanceIdentifier, r = e.options, i = t.getProvider("app").getImmediate(), o = new gn(new H(t.getProvider("auth-internal")), new Z(t.getProvider("app-check-internal")), function(t, e) {
-        if (!Object.prototype.hasOwnProperty.apply(t.options, [ "projectId" ])) throw new z(V, '"projectId" not provided in firebase.initializeApp.');
-        return new tt(t.options.projectId, e);
+fi = "".concat(i, "_lite"), v = fi, o(new c("firestore/lite", (function(t, e) {
+    var n = e.instanceIdentifier, r = e.options, i = t.getProvider("app").getImmediate(), o = new gn(new Y(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 $(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", v, ""), a("firestore-lite", v, "esm5");
+a("firestore-lite", "4.6.2-20240508213348", ""), a("firestore-lite", "4.6.2-20240508213348", "esm5");
 
-export { En as AggregateField, Sn as AggregateQuerySnapshot, Dn as Bytes, An as CollectionReference, In as DocumentReference, lr as DocumentSnapshot, Rn as FieldPath, xn as FieldValue, gn as Firestore, z as FirestoreError, Cn as GeoPoint, kn as Query, _r as QueryCompositeFilterConstraint, mr as QueryConstraint, fr as QueryDocumentSnapshot, Vr as QueryEndAtConstraint, gr as QueryFieldFilterConstraint, kr as QueryLimitConstraint, Er as QueryOrderByConstraint, hr as QuerySnapshot, Pr as QueryStartAtConstraint, Rt as Timestamp, yi as Transaction, oi as WriteBatch, Qr as addDoc, Zr as aggregateFieldEqual, $r as aggregateQuerySnapshotEqual, Tr as and, ri as arrayRemove, ni as arrayUnion, Jr as average, Pn as collection, Fn as collectionGroup, bn as connectFirestoreEmulator, Xr as count, Kr as deleteDoc, ti as deleteField, On as doc, qn as documentId, Dr as endAt, Nr as endBefore, Hr as getAggregate, Yr as getCount, Ur as getDoc, Br as getDocs, _n as getFirestore, ii as increment, wn as initializeFirestore, Ir as limit, Ar as limitToLast, br as or, Sr as orderBy, vr as query, Nn as queryEqual, Vn as refEqual, mi as runTransaction, ei as serverTimestamp, zr as setDoc, b as setLogLevel, pr as snapshotEqual, Or as startAfter, Fr as startAt, Wr as sum, Tn as terminate, Gr as updateDoc, wr as where, ui as writeBatch };
+export { Tn as AggregateField, En as AggregateQuerySnapshot, Nn as Bytes, In as CollectionReference, kn as DocumentReference, cr as DocumentSnapshot, Dn as FieldPath, qn as FieldValue, gn as Firestore, B as FirestoreError, xn as GeoPoint, Sn as Query, wr as QueryCompositeFilterConstraint, yr as QueryConstraint, lr as QueryDocumentSnapshot, Or as QueryEndAtConstraint, gr as QueryFieldFilterConstraint, Sr as QueryLimitConstraint, Tr as QueryOrderByConstraint, fr as QuerySnapshot, Ar as QueryStartAtConstraint, Dt as Timestamp, di as Transaction, ii as WriteBatch, Kr as addDoc, Xr as aggregateFieldEqual, Zr as aggregateQuerySnapshotEqual, br as and, ni as arrayRemove, ei as arrayUnion, Wr as average, An as collection, Pn as collectionGroup, _n as connectFirestoreEmulator, Jr as count, Gr as deleteDoc, $r as deleteField, Fn as doc, Rn as documentId, Nr as endAt, Vr as endBefore, Yr as getAggregate, Qr as getCount, Mr as getDoc, Ur as getDocs, wn as getFirestore, ri as increment, vn as initializeFirestore, kr as limit, Ir as limitToLast, _r as or, Er as orderBy, mr as query, Vn as queryEqual, On as refEqual, yi as runTransaction, ti as serverTimestamp, Br as setDoc, _ as setLogLevel, hr as snapshotEqual, Fr as startAfter, Pr as startAt, Hr as sum, bn as terminate, zr as updateDoc, vr as where, ai as writeBatch };
 //# sourceMappingURL=index.browser.esm5.js.map